转载:https://www.linux.com/learn/linux-career-center/39972-kernel-debugging-with-proc-qsequenceq-files-part-2-of-3

This week, we'll pick up where we left off last week and continue discussing simple kernel and module debugging using seq_file-based proc files. And given the amount of material left to cover, we'll spend this week finishing off the issues related to the simpler, non-sequence proc files, and leave the complicated topic of sequenced writes for a final Part 3 next week, so this will be a relatively short column.

(The archive of all previous "Kernel Newbie Corner" articles can be found here.)

This is ongoing content from the Linux Foundation training program. If you want more content, please consider signing up for one of these classes.

A Quick Recap

As a refresher, let's consider a simple loadable module that represents a solution to last week's exercise and creates the proc file /proc/hz that, when read, displays the kernel tick rate (a value that shouldn't change no matter how many times you display it):

 #include <linux/module.h>
#include <linux/init.h>
#include <linux/kernel.h>
#include <linux/fs.h>
#include <linux/proc_fs.h>
#include <linux/seq_file.h> static int
hz_show(struct seq_file *m, void *v)
{
seq_printf(m, "%d\n", HZ);
return 0;
} static int
hz_open(struct inode *inode, struct file *file)
{
return single_open(file, hz_show, NULL);
} static const struct file_operations hz_fops = {
.owner = THIS_MODULE,
.open = hz_open,
.read = seq_read,
.llseek = seq_lseek,
.release = single_release,
}; static int __init
hz_init(void)
{
printk(KERN_INFO "Loading hz module, HZ = %d.\n", HZ);
proc_create("hz", 0, NULL, &hz_fops);
return 0;
} static void __exit
hz_exit(void)
{
remove_proc_entry("hz", NULL);
printk(KERN_INFO "Unloading hz module.\n");
} module_init(hz_init);
module_exit(hz_exit); MODULE_LICENSE("GPL");

Some quick observations about the above:

  • Even though we're continuing to use the seq_file implementation of proc files which supports sequenced writes, we're still showing examples that print so little output that we can use the simpler, "single" variation designed to print all of the output we care about in a single operation. This will change when we finally get to Part 3 next week.
  • In case you hadn't figured it out yet, the kernel tick rate is available via the global kernel macro HZ, which is all we need to print.
  • Even though we're using printk() to generate some syslog messages upon module entry and exit, those calls are clearly not essential for proper operation of our proc file and, in many cases, proc files like this won't generate any log messages unless something goes wrong.
  • We're so confident that nothing can go wrong with our module that we're not even bothering to check return codes in our module entry routine. That's not actually lazy--if you recall, even some of the kernel routines take the same shortcut.

And now that we're all back up to speed, where do we go from here?

What Exactly Can We "Print" From Our proc File?

Notice above how you generate the output from your proc file--with a fairly self-explanatory call to seq_printf(). But there are a number of output primitives you can use for that output, all declared in the kernel header file include/linux/seq_file.h, which you can combine any way you want to produce that output:

 int seq_printf(struct seq_file *, const char *, ...)
int seq_putc(struct seq_file *m, char c);
int seq_puts(struct seq_file *m, const char *s);
int seq_write(struct seq_file *seq, const void *data, size_t len);
int seq_escape(struct seq_file *, const char *, const char *);
int seq_path(struct seq_file *, struct path *, char *);
int seq_dentry(struct seq_file *, struct dentry *, char *);
int seq_path_root(struct seq_file *m, struct path *path, struct path *root,
char *esc);

The purpose of the first few should be obvious, and you can see the actual implementation and explanations of all of them in the corresponding kernel source file fs/seq_file.c. What's curious is that not all of those output primitives are exported to make them available to modules. The seq_path() function is exported, while the functionally similar seq_path_root() and seq_dentry() functions are not. And for extra confusion, the routine that they are all based on in that same source file, mangle_path() is exported. Does anyone else find that a bit odd?

In any event, it should be clear how you can generate your proc file output with any combination of printing strings, characters, or arbitrary sequences of bytes with any of the above.

Finally, make sure you consider exactly what format you want your proc file output to have. You might be tempted to spruce up the output with labels and headings, but that's just going to get in the way if you want to feed that output into another program. Your best bet is to keep things simple, and generate raw output data, then decide what to do with it from there.

Creating Hierarchical proc Files

Finally, rather than cluttering up the /proc directory with your personal proc files at the top level, you can create a subdirectory and keep multiple proc files in the same place. Here's the relevant snippets from a modified HZ module that creates the file /proc/rday/hz:

 #include <linux/module.h>
#include <linux/init.h>
#include <linux/kernel.h>
#include <linux/fs.h>
#include <linux/proc_fs.h>
#include <linux/seq_file.h> static struct proc_dir_entry* rday_dir; // pointer to new dir ... snip ... static int __init
hz_init(void)
{
rday_dir = proc_mkdir("rday", NULL);
proc_create("hz", 0, rday_dir, &hz_fops);
return 0;
} static void __exit
hz_exit(void)
{
remove_proc_entry("hz", rday_dir);
remove_proc_entry("rday", NULL);
}

Note what's changed here. Rather than create my HZ proc file under the (default location of) /proc, I first have to create (and save a global reference to) a new directory called "rday", underneath which I'll create my file. Conversely, if I do it this way, I have to make sure I undo those operations in the reverse order when I unload the module, as you can see above in the exit routine. Simple, no? There's just one new complication.

It's quite possible to write a module that creates a number of useful proc files but, at that point, you might consider actually checking return codes while creating all of your files and directories in case something goes wrong. As you've seen, if you're creating a single file, you can generally cheat and assume it's going to work. But if it gets more complicated, it might be time to start examining return codes, as in:

 static struct proc_dir_entry* rday_dir;

 static int __init
hz_init(void)
{
int retval = 0;
struct proc_dir_entry* hz_file; rday_dir = proc_mkdir("rday", NULL);
if (rday_dir == NULL) { // directory creation failed
retval = -ENOMEM;
goto out;
} hz_file = proc_create("hz", 0, rday_dir, &hz_fops);
if (hz_file == NULL) { // file creation failed
retval = -ENOMEM;
goto badfile;
} return 0; badfile:
remove_proc_entry("rday", NULL);
out:
return retval;
}

Recall from an earlier column that, if things go badly during your module entry routine, it's your responsibility to undo everything you did, and return all claimed resources back to the kernel.

Exercise for the reader: For a more complicated example that creates a number of files and symbolic links, see the file Documentation/DocBook/procfs_example.c in the kernel source tree. That example doesn't actually use the seq_file implementation of proc files, but it is a good example of how much error-checking can be done in a single loadable module.

Next week: Finishing things off with actual sequenced writing.

The Kernel Newbie Corner: Kernel Debugging with proc "Sequence" Files--Part 2的更多相关文章

  1. The Kernel Newbie Corner: Kernel Debugging with proc "Sequence" Files--Part 3

    转载:https://www.linux.com/learn/linux-career-center/44184-the-kernel-newbie-corner-kernel-debugging-w ...

  2. The Kernel Newbie Corner: Kernel Debugging Using proc "Sequence" Files--Part 1

    转载:https://www.linux.com/learn/linux-career-center/37985-the-kernel-newbie-corner-kernel-debugging-u ...

  3. Kernel Methods (5) Kernel PCA

    先看一眼PCA与KPCA的可视化区别: 在PCA算法是怎么跟协方差矩阵/特征值/特征向量勾搭起来的?里已经推导过PCA算法的小半部分原理. 本文假设你已经知道了PCA算法的基本原理和步骤. 从原始输入 ...

  4. Kernel Methods (2) Kernel function

    几个重要的问题 现在已经知道了kernel function的定义, 以及使用kernel后可以将非线性问题转换成一个线性问题. 在使用kernel 方法时, 如果稍微思考一下的话, 就会遇到以下几个 ...

  5. Debugging Information in Separate Files

    [Debugging Information in Separate Files] gdb allows you to put a program's debugging information in ...

  6. Kernel Methods (4) Kernel SVM

    (本文假设你已经知道了hard margin SVM的基本知识.) 如果要为Kernel methods找一个最好搭档, 那肯定是SVM. SVM从90年代开始流行, 直至2012年被deep lea ...

  7. Kernel Methods (3) Kernel Linear Regression

    Linear Regression 线性回归应该算得上是最简单的一种机器学习算法了吧. 它的问题定义为: 给定训练数据集\(D\), 由\(m\)个二元组\(x_i, y_i\)组成, 其中: \(x ...

  8. Linux Kernel sys_call_table、Kernel Symbols Export Table Generation Principle、Difference Between System Calls Entrance In 32bit、64bit Linux

    目录 . sys_call_table:系统调用表 . 内核符号导出表:Kernel-Symbol-Table . Linux 32bit.64bit环境下系统调用入口的异同 . Linux 32bi ...

  9. Jordan Lecture Note-12: Kernel典型相关分析(Kernel Canonical Correlation Analysis, KCCA).

    Kernel典型相关分析 (一)KCCA 同样,我们可以引入Kernel函数,通过非线性的坐标变换达到之前CCA所寻求的目标.首先,假设映射$\Phi_X: x\rightarrow \Phi_X(x ...

随机推荐

  1. 'System.Web.Http.GlobalConfiguration' does not contain a definition for 'Configure'

    It needs the system.web.http.webhost which is part of this package. I fixed this by installing the f ...

  2. Pylint

    [Pylint] pylint的调用命令: pylint [options] module_or_package 使用 Pylint 对一个模块 module.py 进行代码检查: 1. 进入这个模块 ...

  3. Struts Hello World Example

    In this tutorial we show you how to develop a hello world web application using classic Struts 1.3 f ...

  4. Hibernate理论

    1.什么是Hibernate? Hibernate是数据持久层的一个轻量级框架.数据持久层的框架有很多比如:iBATIS,myBatis,Nhibernate,Siena等等.并且Hibernate是 ...

  5. Python类的探讨

    我们下面的探讨基于Python3,我实际测试使用的是Python3.2,Python3与Python2在类函数的类型上做了改变 1,类定义语法  Python类定义以关键字class开头,一个类定义例 ...

  6. 深入理解inode与软硬链接

    一.inode是什么? 理解inode,要从文件储存说起. 文件储存在硬盘上,硬盘的最小存储单位叫做"扇区"(Sector).每个扇区储存512字节(相当于0.5KB). 操作系统 ...

  7. HDU 1561The more, The Better(树形DP)

    HDU 1561  The more, The Better 题目大意就不说了 直接DP[i][j]表示i为跟节点的子树上攻克j个城堡的所能获得的最多宝物的数量 DP[fa][j] = MAX{DP[ ...

  8. POJ1837 Balance(DP)

    POJ1837http://poj.org/problem?id=1837 题目大意就是说有一个称上有C个挂钩,告诉你每个挂钩的位置,现在有G个重物,求是之平衡的方法数. 转化一下:DP[i][j]表 ...

  9. [置顶] 小强的HTML5移动开发之路(9)——坦克大战游戏3

    上一篇我们创建了敌人的坦克和自己的坦克,接下来就应该让坦克发子弹了,我们下面来看一下如何让我们的坦克发出子弹. 前面我们用面向对象的思想对Tank进行了封装,又利用对象冒充实现了我们的坦克和敌人的坦克 ...

  10. jedis提供的功能

    Sorting(排序) Connection handling(连接池) Commands operating on any kind of values Commands operating on ...