The Linux Kernel Module Programming Guide
Peter Jay Salzman
Michael Burian
Ori Pomerantz
Copyright © 2001 Peter Jay Salzman
2007-05-18 ver 2.6.4
The Linux Kernel Module Programming Guide is a free book; you may reproduce
and/or modify it under the terms of the Open Software License, version 1.1. You
can obtain a copy of this license at http://opensource.org/licenses/osl.php.
This book is distributed in the hope it will be useful, but without any
warranty, without even the implied warranty of merchantability or fitness for a
particular purpose.
The author encourages wide distribution of this book for personal or commercial
use, provided the above copyright notice remains intact and the method adheres
to the provisions of the Open Software License. In summary, you may copy and
distribute this book free of charge or for a profit. No explicit permission is
required from the author for reproduction of this book in any medium, physical
or electronic.
Derivative works and translations of this document must be placed under the
Open Software License, and the original copyright notice must remain intact. If
you have contributed new material to this book, you must make the material and
source code available for your revisions. Please make revisions and updates
available directly to the document maintainer, Peter Jay Salzman
.
This will allow for the merging of updates and provide consistent revisions to
the Linux community.
If you publish or distribute this book commercially, donations, royalties, and/
or printed copies are greatly appreciated by the author and the Linux
Documentation_Project (LDP). Contributing in this way shows your support for
free software and the LDP. If you have questions or comments, please contact
the address above.
-------------------------------------------------------------------------------
Table of Contents
Foreword
1. Authorship
2. Versioning_and_Notes
3. Acknowledgements
1. Introduction
1.1. What_Is_A_Kernel_Module?
1.2. How_Do_Modules_Get_Into_The_Kernel?
2. Hello_World
2.1. Hello,_World_(part_1):_The_Simplest_Module
2.2. Compiling_Kernel_Modules
2.3. Hello_World_(part_2)
2.4. Hello_World_(part_3):_The___init_and___exit_Macros
2.5. Hello_World_(part_4):_Licensing_and_Module_Documentation
2.6. Passing_Command_Line_Arguments_to_a_Module
2.7. Modules_Spanning_Multiple_Files
2.8. Building_modules_for_a_precompiled_kernel
3. Preliminaries
3.1. Modules_vs_Programs
4. Character_Device_Files
4.1. Character_Device_Drivers
5. The_/proc_File_System
5.1. The_/proc_File_System
5.2. Read_and_Write_a_/proc_File
5.3. Manage_/proc_file_with_standard_filesystem
5.4. Manage_/proc_file_with_seq_file
6. Using_/proc_For_Input
6.1. TODO:_Write_a_chapter_about_sysfs
7. Talking_To_Device_Files
7.1. Talking_to_Device_Files_(writes_and_IOCTLs)
8. System_Calls
8.1. System_Calls
9. Blocking_Processes
9.1. Blocking_Processes
10. Replacing_Printks
10.1. Replacing_printk
10.2. Flashing_keyboard_LEDs
11. Scheduling_Tasks
11.1. Scheduling_Tasks
12. Interrupt_Handlers
12.1. Interrupt_Handlers
13. Symmetric_Multi_Processing
13.1. Symmetrical_Multi-Processing
14. Common_Pitfalls
14.1. Common_Pitfalls
A. Changes:_2.0_To_2.2
A.1. Changes_between_2.4_and_2.6
B. Where_To_Go_From_Here
B.1. Where_From_Here?
Index
List of Figures
5-1. How_seq_file_works
List of Examples
2-1. hello-1.c
2-2. Makefile_for_a_basic_kernel_module
2-3. hello-2.c
2-4. Makefile_for_both_our_modules
2-5. hello-3.c
2-6. hello-4.c
2-7. hello-5.c
2-8. start.c
2-9. stop.c
2-10. Makefile
4-1. chardev.c
5-1. procfs1.c
5-2. procfs2.c
5-3. procfs3.c
5-4. procfs4.c
7-1. chardev.c
7-2. chardev.h
7-3. ioctl.c
8-1. syscall.c
9-1. sleep.c
9-2. cat_noblock.c
10-1. print_string.c
10-2. kbleds.c
11-1. sched.c
12-1. intrpt.c
-------------------------------------------------------------------------------
Foreword
1. Authorship
The Linux Kernel Module Programming Guide was originally written for the 2.2
kernels by Ori Pomerantz. Eventually, Ori no longer had time to maintain the
document. After all, the Linux kernel is a fast moving target. Peter Jay
Salzman took over maintenance and updated it for the 2.4 kernels. Eventually,
Peter no longer had time to follow developments with the 2.6 kernel, so Michael
Burian became a co-maintainer to update the document for the 2.6 kernels.
-------------------------------------------------------------------------------
2. Versioning and Notes
The Linux kernel is a moving target. There has always been a question whether
the LKMPG should remove deprecated information or keep it around for historical
sake. Michael Burian and I decided to create a new branch of the LKMPG for each
new stable kernel version. So version LKMPG 2.4.x will address Linux kernel 2.4
and LKMPG 2.6.x will address Linux kernel 2.6. No attempt will be made to
archive historical information; a person wishing this information should read
the appropriately versioned LKMPG.
The source code and discussions should apply to most architectures, but I can't
promise anything. One exception is Chapter_12, Interrupt Handlers, which should
not work on any architecture except for x86.
-------------------------------------------------------------------------------
3. Acknowledgements
The following people have contributed corrections or good suggestions: Ignacio
Martin, David Porter, Daniele Paolo Scarpazza, Dimo Velev, Francois Audeon and
Horst Schirmeier.
-------------------------------------------------------------------------------
Chapter 1. Introduction
1.1. What Is A Kernel Module?
So, you want to write a kernel module. You know C, you've written a few normal
programs to run as processes, and now you want to get to where the real action
is, to where a single wild pointer can wipe out your file system and a core
dump means a reboot.
What exactly is a kernel module? Modules are pieces of code that can be loaded
and unloaded into the kernel upon demand. They extend the functionality of the
kernel without the need to reboot the system. For example, one type of module
is the device driver, which allows the kernel to access hardware connected to
the system. Without modules, we would have to build monolithic kernels and add
new functionality directly into the kernel image. Besides having larger
kernels, this has the disadvantage of requiring us to rebuild and reboot the
kernel every time we want new functionality.
-------------------------------------------------------------------------------
1.2. How Do Modules Get Into The Kernel?
You can see what modules are already loaded into the kernel by running lsmod,
which gets its information by reading the file /proc/modules.
How do these modules find their way into the kernel? When the kernel needs a
feature that is not resident in the kernel, the kernel module daemon kmod[1]
execs modprobe to load the module in. modprobe is passed a string in one of two
forms:
* A module name like softdog or ppp.
* A more generic identifier like char-major-10-30.
If modprobe is handed a generic identifier, it first looks for that string in
the file /etc/modprobe.conf.[2] If it finds an alias line like:
________________________________
| |
| alias char-major-10-30 softdog|
| |
|________________________________|
it knows that the generic identifier refers to the module softdog.ko.
Next, modprobe looks through the file /lib/modules/version/modules.dep, to see
if other modules must be loaded before the requested module may be loaded. This
file is created by depmod -a and contains module dependencies. For example,
msdos.ko requires the fat.ko module to be already loaded into the kernel. The
requested module has a dependency on another module if the other module defines
symbols (variables or functions) that the requested module uses.
Lastly, modprobe uses insmod to first load any prerequisite modules into the
kernel, and then the requested module. modprobe directs insmod to /lib/modules/
version/[3], the standard directory for modules. insmod is intended to be
fairly dumb about the location of modules, whereas modprobe is aware of the
default location of modules, knows how to figure out the dependencies and load
the modules in the right order. So for example, if you wanted to load the msdos
module, you'd have to either run:
_____________________________________________________
| |
| insmod /lib/modules/2.6.11/kernel/fs/fat/fat.ko |
| insmod /lib/modules/2.6.11/kernel/fs/msdos/msdos.ko|
| |
|_____________________________________________________|
or:
________________
| |
| modprobe msdos|
| |
|________________|
What we've seen here is: insmod requires you to pass it the full pathname and
to insert the modules in the right order, while modprobe just takes the name,
without any extension, and figures out all it needs to know by parsing /lib/
modules/version/modules.dep.
Linux distros provide modprobe, insmod and depmod as a package called module-
init-tools. In previous versions that package was called modutils. Some distros
also set up some wrappers that allow both packages to be installed in parallel
and do the right thing in order to be able to deal with 2.4 and 2.6 kernels.
Users should not need to care about the details, as long as they're running
recent versions of those tools.
Now you know how modules get into the kernel. There's a bit more to the story
if you want to write your own modules which depend on other modules (we calling
this `stacking modules'). But this will have to wait for a future chapter. We
have a lot to cover before addressing this relatively high-level issue.
-------------------------------------------------------------------------------
1.2.1. Before We Begin
Before we delve into code, there are a few issues we need to cover. Everyone's
system is different and everyone has their own groove. Getting your first
"hello world" program to compile and load correctly can sometimes be a trick.
Rest assured, after you get over the initial hurdle of doing it for the first
time, it will be smooth sailing thereafter.
-------------------------------------------------------------------------------
1.2.1.1. Modversioning
A module compiled for one kernel won't load if you boot a different kernel
unless you enable CONFIG_MODVERSIONS in the kernel. We won't go into module
versioning until later in this guide. Until we cover modversions, the examples
in the guide may not work if you're running a kernel with modversioning turned
on. However, most stock Linux distro kernels come with it turned on. If you're
having trouble loading the modules because of versioning errors, compile a
kernel with modversioning turned off.
-------------------------------------------------------------------------------
1.2.1.2. Using X
It is highly recommended that you type in, compile and load all the examples
this guide discusses. It's also highly recommended you do this from a console.
You should not be working on this stuff in X.
Modules can't print to the screen like printf() can, but they can log
information and warnings, which ends up being printed on your screen, but only
on a console. If you insmod a module from an xterm, the information and
warnings will be logged, but only to your log files. You won't see it unless
you look through your log files. To have immediate access to this information,
do all your work from the console.
-------------------------------------------------------------------------------
1.2.1.3. Compiling Issues and Kernel Version
Very often, Linux distros will distribute kernel source that has been patched
in various non-standard ways, which may cause trouble.
A more common problem is that some Linux distros distribute incomplete kernel
headers. You'll need to compile your code using various header files from the
Linux kernel. Murphy's Law states that the headers that are missing are exactly
the ones that you'll need for your module work.
To avoid these two problems, I highly recommend that you download, compile and
boot into a fresh, stock Linux kernel which can be downloaded from any of the
Linux kernel mirror sites. See the Linux Kernel HOWTO for more details.
Ironically, this can also cause a problem. By default, gcc on your system may
look for the kernel headers in their default location rather than where you
installed the new copy of the kernel (usually in /usr/src/. This can be fixed
by using gcc's -I switch.
-------------------------------------------------------------------------------
Chapter 2. Hello World
2.1. Hello, World (part 1): The Simplest Module
When the first caveman programmer chiseled the first program on the walls of
the first cave computer, it was a program to paint the string `Hello, world' in
Antelope pictures. Roman programming textbooks began with the `Salut, Mundi'
program. I don't know what happens to people who break with this tradition, but
I think it's safer not to find out. We'll start with a series of hello world
programs that demonstrate the different aspects of the basics of writing a
kernel module.
Here's the simplest module possible. Don't compile it yet; we'll cover module
compilation in the next section.
Example 2-1. hello-1.c
>
Kernel modules must have at least two functions: a "start" (initialization)
function called init_module() which is called when the module is insmoded into
the kernel, and an "end" (cleanup) function called cleanup_module() which is
called just before it is rmmoded. Actually, things have changed starting with
kernel 2.3.13. You can now use whatever name you like for the start and end
functions of a module, and you'll learn how to do this in Section_2.3. In fact,
the new method is the preferred method. However, many people still use
init_module() and cleanup_module() for their start and end functions.
Typically, init_module() either registers a handler for something with the
kernel, or it replaces one of the kernel functions with its own code (usually
code to do something and then call the original function). The cleanup_module()
function is supposed to undo whatever init_module() did, so the module can be
unloaded safely.
Lastly, every kernel module needs to include linux/module.h. We needed to
include linux/kernel.h only for the macro expansion for the printk() log level,
KERN_ALERT, which you'll learn about in Section_2.1.1.
-------------------------------------------------------------------------------
2.1.1. Introducing printk()
Despite what you might think, printk() was not meant to communicate information
to the user, even though we used it for exactly this purpose in hello-1! It
happens to be a logging mechanism for the kernel, and is used to log
information or give warnings. Therefore, each printk() statement comes with a
priority, which is the <1> and KERN_ALERT you see. There are 8 priorities and
the kernel has macros for them, so you don't have to use cryptic numbers, and
you can view them (and their meanings) in linux/kernel.h. If you don't specify
a priority level, the default priority, DEFAULT_MESSAGE_LOGLEVEL, will be used.
Take time to read through the priority macros. The header file also describes
what each priority means. In practise, don't use number, like <4>. Always use
the macro, like KERN_WARNING.
If the priority is less than int console_loglevel, the message is printed on
your current terminal. If both syslogd and klogd are running, then the message
will also get appended to /var/log/messages, whether it got printed to the
console or not. We use a high priority, like KERN_ALERT, to make sure the
printk() messages get printed to your console rather than just logged to your
logfile. When you write real modules, you'll want to use priorities that are
meaningful for the situation at hand.
-------------------------------------------------------------------------------
2.2. Compiling Kernel Modules
Kernel modules need to be compiled a bit differently from regular userspace
apps. Former kernel versions required us to care much about these settings,
which are usually stored in Makefiles. Although hierarchically organized, many
redundant settings accumulated in sublevel Makefiles and made them large and
rather difficult to maintain. Fortunately, there is a new way of doing these
things, called kbuild, and the build process for external loadable modules is
now fully integrated into the standard kernel build mechanism. To learn more on
how to compile modules which are not part of the official kernel (such as all
the examples you'll find in this guide), see file linux/Documentation/kbuild/
modules.txt.
So, let's look at a simple Makefile for compiling a module named hello-1.c:
Example 2-2. Makefile for a basic kernel module
>
From a technical point of view just the first line is really necessary, the
"all" and "clean" targets were added for pure convenience.
Now you can compile the module by issuing the command make. You should obtain
an output which resembles the following:
________________________________________________________________________
| |
| hostname:~/lkmpg-examples/02-HelloWorld# make |
| make -C /lib/modules/2.6.11/build M=/root/lkmpg-examples/02-HelloWorld|
| modules |
| make[1]: Entering directory `/usr/src/linux-2.6.11' |
| CC [M] /root/lkmpg-examples/02-HelloWorld/hello-1.o |
| Building modules, stage 2. |
| MODPOST |
| CC /root/lkmpg-examples/02-HelloWorld/hello-1.mod.o |
| LD [M] /root/lkmpg-examples/02-HelloWorld/hello-1.ko |
| make[1]: Leaving directory `/usr/src/linux-2.6.11' |
| hostname:~/lkmpg-examples/02-HelloWorld# |
| |
|________________________________________________________________________|
Note that kernel 2.6 introduces a new file naming convention: kernel modules
now have a .ko extension (in place of the old .o extension) which easily
distinguishes them from conventional object files. The reason for this is that
they contain an additional .modinfo section that where additional information
about the module is kept. We'll soon see what this information is good for.
Use modinfo hello-*.ko to see what kind of information it is.
_____________________________________________________________
| |
| hostname:~/lkmpg-examples/02-HelloWorld# modinfo hello-1.ko|
| filename: hello-1.ko |
| vermagic: 2.6.11 preempt PENTIUMII 4KSTACKS gcc-3.3 |
| depends: |
|_____________________________________________________________|
Nothing spectacular, so far. That changes once we're using modinfo on one of
our the later examples, hello-5.ko.
________________________________________________________________
| |
| hostname:~/lkmpg-examples/02-HelloWorld# modinfo hello-5.ko |
| filename: hello-5.ko |
| license: GPL |
| author: Peter Jay Salzman |
| vermagic: 2.6.11 preempt PENTIUMII 4KSTACKS gcc-3.3 |
| depends: |
| parm: myintArray:An array of integers (array of int)|
| parm: mystring:A character string (charp) |
| parm: mylong:A long integer (long) |
| parm: myint:An integer (int) |
| parm: myshort:A short integer (short) |
| hostname:~/lkmpg-examples/02-HelloWorld# |
|________________________________________________________________|
Lot's of useful information to see here. An author string for bugreports,
license information, even a short description of the parameters it accepts.
Additional details about Makefiles for kernel modules are available in linux/
Documentation/kbuild/makefiles.txt. Be sure to read this and the related files
before starting to hack Makefiles. It'll probably save you lots of work.
Now it is time to insert your freshly-compiled module it into the kernel with
insmod ./hello-1.ko (ignore anything you see about tainted kernels; we'll cover
that shortly).
All modules loaded into the kernel are listed in /proc/modules. Go ahead and
cat that file to see that your module is really a part of the kernel.
Congratulations, you are now the author of Linux kernel code! When the novelty
wears off, remove your module from the kernel by using rmmod hello-1. Take a
look at /var/log/messages just to see that it got logged to your system
logfile.
Here's another exercise for the reader. See that comment above the return
statement in init_module()? Change the return value to something negative,
recompile and load the module again. What happens?
-------------------------------------------------------------------------------
2.3. Hello World (part 2)
As of Linux 2.4, you can rename the init and cleanup functions of your modules;
they no longer have to be called init_module() and cleanup_module()
respectively. This is done with the module_init() and module_exit() macros.
These macros are defined in linux/init.h. The only caveat is that your init and
cleanup functions must be defined before calling the macros, otherwise you'll
get compilation errors. Here's an example of this technique:
Example 2-3. hello-2.c
>
So now we have two real kernel modules under our belt. Adding another module is
as simple as this:
Example 2-4. Makefile for both our modules
>
Now have a look at linux/drivers/char/Makefile for a real world example. As you
can see, some things get hardwired into the kernel (obj-y) but where are all
those obj-m gone? Those familiar with shell scripts will easily be able to spot
them. For those not, the obj-$(CONFIG_FOO) entries you see everywhere expand
into obj-y or obj-m, depending on whether the CONFIG_FOO variable has been set
to y or m. While we are at it, those were exactly the kind of variables that
you have set in the linux/.config file, the last time when you said make
menuconfig or something like that.
-------------------------------------------------------------------------------
2.4. Hello World (part 3): The __init and __exit Macros
This demonstrates a feature of kernel 2.2 and later. Notice the change in the
definitions of the init and cleanup functions. The __init macro causes the init
function to be discarded and its memory freed once the init function finishes
for built-in drivers, but not loadable modules. If you think about when the
init function is invoked, this makes perfect sense.
There is also an __initdata which works similarly to __init but for init
variables rather than functions.
The __exit macro causes the omission of the function when the module is built
into the kernel, and like __exit, has no effect for loadable modules. Again, if
you consider when the cleanup function runs, this makes complete sense; built-
in drivers don't need a cleanup function, while loadable modules do.
These macros are defined in linux/init.h and serve to free up kernel memory.
When you boot your kernel and see something like Freeing unused kernel memory:
236k freed, this is precisely what the kernel is freeing.
Example 2-5. hello-3.c
>
-------------------------------------------------------------------------------
2.5. Hello World (part 4): Licensing and Module Documentation
If you're running kernel 2.4 or later, you might have noticed something like
this when you loaded proprietary modules:
_____________________________________________________________________________
| |
| # insmod xxxxxx.o |
| Warning: loading xxxxxx.ko will taint the kernel: no license |
| See http://www.tux.org/lkml/#export-tainted for information about tainted|
| modules |
| Module xxxxxx loaded, with warnings |
| |
|_____________________________________________________________________________|
In kernel 2.4 and later, a mechanism was devised to identify code licensed
under the GPL (and friends) so people can be warned that the code is non open-
source. This is accomplished by the MODULE_LICENSE() macro which is
demonstrated in the next piece of code. By setting the license to GPL, you can
keep the warning from being printed. This license mechanism is defined and
documented in linux/module.h:
_____________________________________________________________________________
| |
| /* |
| * The following license idents are currently accepted as indicating free |
| * software modules |
| * |
| * "GPL" [GNU Public License v2 or later] |
| * "GPL v2" [GNU Public License v2] |
| * "GPL and additional rights" [GNU Public License v2 rights and more] |
| * "Dual BSD/GPL" [GNU Public License v2 |
| * or BSD license choice] |
| * "Dual MIT/GPL" [GNU Public License v2 |
| * or MIT license choice] |
| * "Dual MPL/GPL" [GNU Public License v2 |
| * or Mozilla license choice] |
| * |
| * The following other idents are available |
| * |
| * "Proprietary" [Non free products] |
| * |
| * There are dual licensed components, but when running with Linux it is |
| the |
| * GPL that is relevant so this is a non issue. Similarly LGPL linked with |
| GPL |
| * is a GPL combined work. |
| * |
| * This exists for several reasons |
| * 1. So modinfo can show license info for users wanting to vet their setup|
| |
| * is free |
| * 2. So the community can ignore bug reports including proprietary modules|
| * 3. So vendors can do likewise based on their own policies |
| */ |
|_____________________________________________________________________________|
Similarly, MODULE_DESCRIPTION() is used to describe what the module does,
MODULE_AUTHOR() declares the module's author, and MODULE_SUPPORTED_DEVICE()
declares what types of devices the module supports.
These macros are all defined in linux/module.h and aren't used by the kernel
itself. They're simply for documentation and can be viewed by a tool like
objdump. As an exercise to the reader, try and search fo these macros in linux/
drivers to see how module authors use these macros to document their modules.
I'd recommend to use something like grep -inr MODULE_AUTHOR * in /usr/src/
linux-2.6.x/. People unfamiliar with command line tools will probably like some
web base solution, search for sites that offer kernel trees that got indexed
with LXR. (or setup it up on your local machine).
Users of traditional Unix editors, like emacs or vi will also find tag files
useful. They can be generated by make tags or make TAGS in /usr/src/linux-
2.6.x/. Once you've got such a tagfile in your kerneltree you can put the
cursor on some function call and use some key combination to directly jump to
the definition function.
Example 2-6. hello-4.c
>
-------------------------------------------------------------------------------
2.6. Passing Command Line Arguments to a Module
Modules can take command line arguments, but not with the argc/argv you might
be used to.
To allow arguments to be passed to your module, declare the variables that will
take the values of the command line arguments as global and then use the
module_param() macro, (defined in linux/moduleparam.h) to set the mechanism up.
At runtime, insmod will fill the variables with any command line arguments that
are given, like ./insmod mymodule.ko myvariable=5. The variable declarations
and macros should be placed at the beginning of the module for clarity. The
example code should clear up my admittedly lousy explanation.
The module_param() macro takes 3 arguments: the name of the variable, its type
and permissions for the corresponding file in sysfs. Integer types can be
signed as usual or unsigned. If you'd like to use arrays of integers or strings
see module_param_array() and module_param_string().
______________________________
| |
| int myint = 3; |
| module_param(myint, int, 0);|
| |
|______________________________|
Arrays are supported too, but things are a bit different now than they were in
the 2.4. days. To keep track of the number of parameters you need to pass a
pointer to a count variable as third parameter. At your option, you could also
ignore the count and pass NULL instead. We show both possibilities here:
_____________________________________________________________________________
| |
| int myintarray[2]; |
| module_param_array(myintarray, int, NULL, 0); /* not interested in count */|
| |
| int myshortarray[4]; |
| int count; |
| module_parm_array(myshortarray, short, &count, 0); /* put count into |
| "count" variable */ |
| |
|_____________________________________________________________________________|
A good use for this is to have the module variable's default values set, like
an port or IO address. If the variables contain the default values, then
perform autodetection (explained elsewhere). Otherwise, keep the current value.
This will be made clear later on.
Lastly, there's a macro function, MODULE_PARM_DESC(), that is used to document
arguments that the module can take. It takes two parameters: a variable name
and a free form string describing that variable.
Example 2-7. hello-5.c
>
I would recommend playing around with this code:
__________________________________________________________________________
| |
| satan# insmod hello-5.ko mystring="bebop" mybyte=255 myintArray=-1 |
| mybyte is an 8 bit integer: 255 |
| myshort is a short integer: 1 |
| myint is an integer: 20 |
| mylong is a long integer: 9999 |
| mystring is a string: bebop |
| myintArray is -1 and 420 |
| |
| satan# rmmod hello-5 |
| Goodbye, world 5 |
| |
| satan# insmod hello-5.ko mystring="supercalifragilisticexpialidocious" \|
| > mybyte=256 myintArray=-1,-1 |
| mybyte is an 8 bit integer: 0 |
| myshort is a short integer: 1 |
| myint is an integer: 20 |
| mylong is a long integer: 9999 |
| mystring is a string: supercalifragilisticexpialidocious |
| myintArray is -1 and -1 |
| |
| satan# rmmod hello-5 |
| Goodbye, world 5 |
| |
| satan# insmod hello-5.ko mylong=hello |
| hello-5.o: invalid argument syntax for mylong: 'h' |
|__________________________________________________________________________|
-------------------------------------------------------------------------------
2.7. Modules Spanning Multiple Files
Sometimes it makes sense to divide a kernel module between several source
files.
Here's an example of such a kernel module.
Example 2-8. start.c
>
The next file:
Example 2-9. stop.c
>
And finally, the makefile:
Example 2-10. Makefile
>
This is the complete makefile for all the examples we've seen so far. The first
five lines are nothing special, but for the last example we'll need two lines.
First we invent an object name for our combined module, second we tell make
what object files are part of that module.
-------------------------------------------------------------------------------
2.8. Building modules for a precompiled kernel
Obviously, we strongly suggest you to recompile your kernel, so that you can
enable a number of useful debugging features, such as forced module unloading
(MODULE_FORCE_UNLOAD): when this option is enabled, you can force the kernel to
unload a module even when it believes it is unsafe, via a rmmod -f module
command. This option can save you a lot of time and a number of reboots during
the development of a module.
Nevertheless, there is a number of cases in which you may want to load your
module into a precompiled running kernel, such as the ones shipped with common
Linux distributions, or a kernel you have compiled in the past. In certain
circumstances you could require to compile and insert a module into a running
kernel which you are not allowed to recompile, or on a machine that you prefer
not to reboot. If you can't think of a case that will force you to use modules
for a precompiled kernel you might want to skip this and treat the rest of this
chapter as a big footnote.
Now, if you just install a kernel source tree, use it to compile your kernel
module and you try to insert your module into the kernel, in most cases you
would obtain an error as follows:
__________________________________________________________________
| |
| insmod: error inserting 'poet_atkm.ko': -1 Invalid module format|
| |
|__________________________________________________________________|
Less cryptical information are logged to /var/log/messages:
____________________________________________________________________________
| |
| Jun 4 22:07:54 localhost kernel: poet_atkm: version magic '2.6.5- |
| 1.358custom 686 |
| REGPARM 4KSTACKS gcc-3.3' should be '2.6.5-1.358 686 REGPARM 4KSTACKS gcc-|
| 3.3' |
| |
|____________________________________________________________________________|
In other words, your kernel refuses to accept your module because version
strings (more precisely, version magics) do not match. Incidentally, version
magics are stored in the module object in the form of a static string, starting
with vermagic:. Version data are inserted in your module when it is linked
against the init/vermagic.o file. To inspect version magics and other strings
stored in a given module, issue the modinfo module.ko command:
__________________________________________________________
| |
| [root@pcsenonsrv 02-HelloWorld]# modinfo hello-4.ko |
| license: GPL |
| author: Peter Jay Salzman
|
| description: A sample driver |
| vermagic: 2.6.5-1.358 686 REGPARM 4KSTACKS gcc-3.3|
| depends: |
| |
|__________________________________________________________|
To overcome this problem we could resort to the --force-vermagic option, but
this solution is potentially unsafe, and unquestionably inacceptable in
production modules. Consequently, we want to compile our module in an
environment which was identical to the one in which our precompiled kernel was
built. How to do this, is the subject of the remainder of this chapter.
First of all, make sure that a kernel source tree is available, having exactly
the same version as your current kernel. Then, find the configuration file
which was used to compile your precompiled kernel. Usually, this is available
in your current /boot directory, under a name like config-2.6.x. You may just
want to copy it to your kernel source tree: cp /boot/config-`uname -r` /usr/
src/linux-`uname -r`/.config.
Let's focus again on the previous error message: a closer look at the version
magic strings suggests that, even with two configuration files which are
exactly the same, a slight difference in the version magic could be possible,
and it is sufficient to prevent insertion of the module into the kernel. That
slight difference, namely the custom string which appears in the module's
version magic and not in the kernel's one, is due to a modification with
respect to the original, in the makefile that some distribution include. Then,
examine your /usr/src/linux/Makefile, and make sure that the specified version
information matches exactly the one used for your current kernel. For example,
you makefile could start as follows:
_____________________________
| |
| VERSION = 2 |
| PATCHLEVEL = 6 |
| SUBLEVEL = 5 |
| EXTRAVERSION = -1.358custom|
| ... |
| |
|_____________________________|
In this case, you need to restore the value of symbol EXTRAVERSION to -1.358.
We suggest to keep a backup copy of the makefile used to compile your kernel
available in /lib/modules/2.6.5-1.358/build. A simple cp /lib/modules/`uname -
r`/build/Makefile /usr/src/linux-`uname -r` should suffice. Additionally, if
you already started a kernel build with the previous (wrong) Makefile, you
should also rerun make, or directly modify symbol UTS_RELEASE in file /usr/src/
linux-2.6.x/include/linux/version.h according to contents of file /lib/modules/
2.6.x/build/include/linux/version.h, or overwrite the latter with the first.
Now, please run make to update configuration and version headers and objects:
______________________________________________________
| |
| [root@pcsenonsrv linux-2.6.x]# make |
| CHK include/linux/version.h |
| UPD include/linux/version.h |
| SYMLINK include/asm -> include/asm-i386 |
| SPLIT include/linux/autoconf.h -> include/config/*|
| HOSTCC scripts/basic/fixdep |
| HOSTCC scripts/basic/split-include |
| HOSTCC scripts/basic/docproc |
| HOSTCC scripts/conmakehash |
| HOSTCC scripts/kallsyms |
| CC scripts/empty.o |
| ... |
| |
|______________________________________________________|
If you do not desire to actually compile the kernel, you can interrupt the
build process (CTRL-C) just after the SPLIT line, because at that time, the
files you need will be are ready. Now you can turn back to the directory of
your module and compile it: It will be built exactly according your current
kernel settings, and it will load into it without any errors.
-------------------------------------------------------------------------------
Chapter 3. Preliminaries
3.1. Modules vs Programs
3.1.1. How modules begin and end
A program usually begins with a main() function, executes a bunch of
instructions and terminates upon completion of those instructions. Kernel
modules work a bit differently. A module always begin with either the
init_module or the function you specify with module_init call. This is the
entry function for modules; it tells the kernel what functionality the module
provides and sets up the kernel to run the module's functions when they're
needed. Once it does this, entry function returns and the module does nothing
until the kernel wants to do something with the code that the module provides.
All modules end by calling either cleanup_module or the function you specify
with the module_exit call. This is the exit function for modules; it undoes
whatever entry function did. It unregisters the functionality that the entry
function registered.
Every module must have an entry function and an exit function. Since there's
more than one way to specify entry and exit functions, I'll try my best to use
the terms `entry function' and `exit function', but if I slip and simply refer
to them as init_module and cleanup_module, I think you'll know what I mean.
-------------------------------------------------------------------------------
3.1.2. Functions available to modules
Programmers use functions they don't define all the time. A prime example of
this is printf(). You use these library functions which are provided by the
standard C library, libc. The definitions for these functions don't actually
enter your program until the linking stage, which insures that the code (for
printf() for example) is available, and fixes the call instruction to point to
that code.
Kernel modules are different here, too. In the hello world example, you might
have noticed that we used a function, printk() but didn't include a standard I/
O library. That's because modules are object files whose symbols get resolved
upon insmod'ing. The definition for the symbols comes from the kernel itself;
the only external functions you can use are the ones provided by the kernel. If
you're curious about what symbols have been exported by your kernel, take a
look at /proc/kallsyms.
One point to keep in mind is the difference between library functions and
system calls. Library functions are higher level, run completely in user space
and provide a more convenient interface for the programmer to the functions
that do the real work---system calls. System calls run in kernel mode on the
user's behalf and are provided by the kernel itself. The library function
printf() may look like a very general printing function, but all it really does
is format the data into strings and write the string data using the low-level
system call write(), which then sends the data to standard output.
Would you like to see what system calls are made by printf()? It's easy!
Compile the following program:
________________________________
| |
| #include |
| int main(void) |
| { printf("hello"); return 0; }|
| |
|________________________________|
with gcc -Wall -o hello hello.c. Run the exectable with strace ./hello. Are you
impressed? Every line you see corresponds to a system call. strace[4] is a
handy program that gives you details about what system calls a program is
making, including which call is made, what its arguments are what it returns.
It's an invaluable tool for figuring out things like what files a program is
trying to access. Towards the end, you'll see a line which looks like write(1,
"hello", 5hello). There it is. The face behind the printf() mask. You may not
be familiar with write, since most people use library functions for file I/O
(like fopen, fputs, fclose). If that's the case, try looking at man 2 write.
The 2nd man section is devoted to system calls (like kill() and read(). The 3rd
man section is devoted to library calls, which you would probably be more
familiar with (like cosh() and random()).
You can even write modules to replace the kernel's system calls, which we'll do
shortly. Crackers often make use of this sort of thing for backdoors or
trojans, but you can write your own modules to do more benign things, like have
the kernel write Tee hee, that tickles! everytime someone tries to delete a
file on your system.
-------------------------------------------------------------------------------
3.1.3. User Space vs Kernel Space
A kernel is all about access to resources, whether the resource in question
happens to be a video card, a hard drive or even memory. Programs often compete
for the same resource. As I just saved this document, updatedb started updating
the locate database. My vim session and updatedb are both using the hard drive
concurrently. The kernel needs to keep things orderly, and not give users
access to resources whenever they feel like it. To this end, a CPU can run in
different modes. Each mode gives a different level of freedom to do what you
want on the system. The Intel 80386 architecture has 4 of these modes, which
are called rings. Unix uses only two rings; the highest ring (ring 0, also
known as `supervisor mode' where everything is allowed to happen) and the
lowest ring, which is called `user mode'.
Recall the discussion about library functions vs system calls. Typically, you
use a library function in user mode. The library function calls one or more
system calls, and these system calls execute on the library function's behalf,
but do so in supervisor mode since they are part of the kernel itself. Once the
system call completes its task, it returns and execution gets transfered back
to user mode.
-------------------------------------------------------------------------------
3.1.4. Name Space
When you write a small C program, you use variables which are convenient and
make sense to the reader. If, on the other hand, you're writing routines which
will be part of a bigger problem, any global variables you have are part of a
community of other peoples' global variables; some of the variable names can
clash. When a program has lots of global variables which aren't meaningful
enough to be distinguished, you get namespace pollution. In large projects,
effort must be made to remember reserved names, and to find ways to develop a
scheme for naming unique variable names and symbols.
When writing kernel code, even the smallest module will be linked against the
entire kernel, so this is definitely an issue. The best way to deal with this
is to declare all your variables as static and to use a well-defined prefix for
your symbols. By convention, all kernel prefixes are lowercase. If you don't
want to declare everything as static, another option is to declare a symbol
table and register it with a kernel. We'll get to this later.
The file /proc/kallsyms holds all the symbols that the kernel knows about and
which are therefore accessible to your modules since they share the kernel's
codespace.
-------------------------------------------------------------------------------
3.1.5. Code space
Memory management is a very complicated subject---the majority of O'Reilly's
`Understanding The Linux Kernel' is just on memory management! We're not
setting out to be experts on memory managements, but we do need to know a
couple of facts to even begin worrying about writing real modules.
If you haven't thought about what a segfault really means, you may be surprised
to hear that pointers don't actually point to memory locations. Not real ones,
anyway. When a process is created, the kernel sets aside a portion of real
physical memory and hands it to the process to use for its executing code,
variables, stack, heap and other things which a computer scientist would know
about[5]. This memory begins with 0x00000000 and extends up to whatever it
needs to be. Since the memory space for any two processes don't overlap, every
process that can access a memory address, say 0xbffff978, would be accessing a
different location in real physical memory! The processes would be accessing an
index named 0xbffff978 which points to some kind of offset into the region of
memory set aside for that particular process. For the most part, a process like
our Hello, World program can't access the space of another process, although
there are ways which we'll talk about later.
The kernel has its own space of memory as well. Since a module is code which
can be dynamically inserted and removed in the kernel (as opposed to a semi-
autonomous object), it shares the kernel's codespace rather than having its
own. Therefore, if your module segfaults, the kernel segfaults. And if you
start writing over data because of an off-by-one error, then you're trampling
on kernel data (or code). This is even worse than it sounds, so try your best
to be careful.
By the way, I would like to point out that the above discussion is true for any
operating system which uses a monolithic kernel[6]. There are things called
microkernels which have modules which get their own codespace. The GNU Hurd and
QNX Neutrino are two examples of a microkernel.
-------------------------------------------------------------------------------
3.1.6. Device Drivers
One class of module is the device driver, which provides functionality for
hardware like a TV card or a serial port. On unix, each piece of hardware is
represented by a file located in /dev named a device file which provides the
means to communicate with the hardware. The device driver provides the
communication on behalf of a user program. So the es1370.o sound card device
driver might connect the /dev/sound device file to the Ensoniq IS1370 sound
card. A userspace program like mp3blaster can use /dev/sound without ever
knowing what kind of sound card is installed.
-------------------------------------------------------------------------------
3.1.6.1. Major and Minor Numbers
Let's look at some device files. Here are device files which represent the
first three partitions on the primary master IDE hard drive:
_______________________________________________________
| |
| # ls -l /dev/hda[1-3] |
| brw-rw---- 1 root disk 3, 1 Jul 5 2000 /dev/hda1|
| brw-rw---- 1 root disk 3, 2 Jul 5 2000 /dev/hda2|
| brw-rw---- 1 root disk 3, 3 Jul 5 2000 /dev/hda3|
| |
|_______________________________________________________|
Notice the column of numbers separated by a comma? The first number is called
the device's major number. The second number is the minor number. The major
number tells you which driver is used to access the hardware. Each driver is
assigned a unique major number; all device files with the same major number are
controlled by the same driver. All the above major numbers are 3, because
they're all controlled by the same driver.
The minor number is used by the driver to distinguish between the various
hardware it controls. Returning to the example above, although all three
devices are handled by the same driver they have unique minor numbers because
the driver sees them as being different pieces of hardware.
Devices are divided into two types: character devices and block devices. The
difference is that block devices have a buffer for requests, so they can choose
the best order in which to respond to the requests. This is important in the
case of storage devices, where it's faster to read or write sectors which are
close to each other, rather than those which are further apart. Another
difference is that block devices can only accept input and return output in
blocks (whose size can vary according to the device), whereas character devices
are allowed to use as many or as few bytes as they like. Most devices in the
world are character, because they don't need this type of buffering, and they
don't operate with a fixed block size. You can tell whether a device file is
for a block device or a character device by looking at the first character in
the output of ls -l. If it's `b' then it's a block device, and if it's `c' then
it's a character device. The devices you see above are block devices. Here are
some character devices (the serial ports):
________________________________________________________
| |
| crw-rw---- 1 root dial 4, 64 Feb 18 23:34 /dev/ttyS0|
| crw-r----- 1 root dial 4, 65 Nov 17 10:26 /dev/ttyS1|
| crw-rw---- 1 root dial 4, 66 Jul 5 2000 /dev/ttyS2|
| crw-rw---- 1 root dial 4, 67 Jul 5 2000 /dev/ttyS3|
| |
|________________________________________________________|
If you want to see which major numbers have been assigned, you can look at /
usr/src/linux/Documentation/devices.txt.
When the system was installed, all of those device files were created by the
mknod command. To create a new char device named `coffee' with major/minor
number 12 and 2, simply do mknod /dev/coffee c 12 2. You don't have to put your
device files into /dev, but it's done by convention. Linus put his device files
in /dev, and so should you. However, when creating a device file for testing
purposes, it's probably OK to place it in your working directory where you
compile the kernel module. Just be sure to put it in the right place when
you're done writing the device driver.
I would like to make a few last points which are implicit from the above
discussion, but I'd like to make them explicit just in case. When a device file
is accessed, the kernel uses the major number of the file to determine which
driver should be used to handle the access. This means that the kernel doesn't
really need to use or even know about the minor number. The driver itself is
the only thing that cares about the minor number. It uses the minor number to
distinguish between different pieces of hardware.
By the way, when I say `hardware', I mean something a bit more abstract than a
PCI card that you can hold in your hand. Look at these two device files:
________________________________________________________________
| |
| % ls -l /dev/fd0 /dev/fd0u1680 |
| brwxrwxrwx 1 root floppy 2, 0 Jul 5 2000 /dev/fd0 |
| brw-rw---- 1 root floppy 2, 44 Jul 5 2000 /dev/fd0u1680|
| |
|________________________________________________________________|
By now you can look at these two device files and know instantly that they are
block devices and are handled by same driver (block major 2). You might even be
aware that these both represent your floppy drive, even if you only have one
floppy drive. Why two files? One represents the floppy drive with 1.44 MB of
storage. The other is the same floppy drive with 1.68 MB of storage, and
corresponds to what some people call a `superformatted' disk. One that holds
more data than a standard formatted floppy. So here's a case where two device
files with different minor number actually represent the same piece of physical
hardware. So just be aware that the word `hardware' in our discussion can mean
something very abstract.
-------------------------------------------------------------------------------
Chapter 4. Character Device Files
4.1. Character Device Drivers
-------------------------------------------------------------------------------
4.1.1. The file_operations Structure
The file_operations structure is defined in linux/fs.h, and holds pointers to
functions defined by the driver that perform various operations on the device.
Each field of the structure corresponds to the address of some function defined
by the driver to handle a requested operation.
For example, every character driver needs to define a function that reads from
the device. The file_operations structure holds the address of the module's
function that performs that operation. Here is what the definition looks like
for kernel 2.6.5:
___________________________________________________________________________
| |
| struct file_operations { |
| struct module *owner; |
| loff_t(*llseek) (struct file *, loff_t, int); |
| ssize_t(*read) (struct file *, char __user *, size_t, loff_t *); |
| ssize_t(*aio_read) (struct kiocb *, char __user *, size_t, loff_t); |
| ssize_t(*write) (struct file *, const char __user *, size_t, loff_t *);|
| ssize_t(*aio_write) (struct kiocb *, const char __user *, size_t, |
| loff_t); |
| int (*readdir) (struct file *, void *, filldir_t); |
| unsigned int (*poll) (struct file *, struct poll_table_struct *); |
| int (*ioctl) (struct inode *, struct file *, unsigned int, |
| unsigned long); |
| int (*mmap) (struct file *, struct vm_area_struct *); |
| int (*open) (struct inode *, struct file *); |
| int (*flush) (struct file *); |
| int (*release) (struct inode *, struct file *); |
| int (*fsync) (struct file *, struct dentry *, int datasync); |
| int (*aio_fsync) (struct kiocb *, int datasync); |
| int (*fasync) (int, struct file *, int); |
| int (*lock) (struct file *, int, struct file_lock *); |
| ssize_t(*readv) (struct file *, const struct iovec *, unsigned long, |
| loff_t *); |
| ssize_t(*writev) (struct file *, const struct iovec *, unsigned long, |
| loff_t *); |
| ssize_t(*sendfile) (struct file *, loff_t *, size_t, read_actor_t, |
| void __user *); |
| ssize_t(*sendpage) (struct file *, struct page *, int, size_t, |
| loff_t *, int); |
| unsigned long (*get_unmapped_area) (struct file *, unsigned long, |
| unsigned long, unsigned long, |
| unsigned long); |
| }; |
| |
|___________________________________________________________________________|
Some operations are not implemented by a driver. For example, a driver that
handles a video card won't need to read from a directory structure. The
corresponding entries in the file_operations structure should be set to NULL.
There is a gcc extension that makes assigning to this structure more
convenient. You'll see it in modern drivers, and may catch you by surprise.
This is what the new way of assigning to the structure looks like:
_________________________________
| |
| struct file_operations fops = {|
| read: device_read, |
| write: device_write, |
| open: device_open, |
| release: device_release |
| }; |
| |
|_________________________________|
However, there's also a C99 way of assigning to elements of a structure, and
this is definitely preferred over using the GNU extension. The version of gcc
the author used when writing this, 2.95, supports the new C99 syntax. You
should use this syntax in case someone wants to port your driver. It will help
with compatibility:
_________________________________
| |
| struct file_operations fops = {|
| .read = device_read, |
| .write = device_write, |
| .open = device_open, |
| .release = device_release |
| }; |
| |
|_________________________________|
The meaning is clear, and you should be aware that any member of the structure
which you don't explicitly assign will be initialized to NULL by gcc.
An instance of struct file_operations containing pointers to functions that are
used to implement read, write, open, ... syscalls is commonly named fops.
-------------------------------------------------------------------------------
4.1.2. The file structure
Each device is represented in the kernel by a file structure, which is defined
in linux/fs.h. Be aware that a file is a kernel level structure and never
appears in a user space program. It's not the same thing as a FILE, which is
defined by glibc and would never appear in a kernel space function. Also, its
name is a bit misleading; it represents an abstract open `file', not a file on
a disk, which is represented by a structure named inode.
An instance of struct file is commonly named filp. You'll also see it refered
to as struct file file. Resist the temptation.
Go ahead and look at the definition of file. Most of the entries you see, like
struct dentry aren't used by device drivers, and you can ignore them. This is
because drivers don't fill file directly; they only use structures contained in
file which are created elsewhere.
-------------------------------------------------------------------------------
4.1.3. Registering A Device
As discussed earlier, char devices are accessed through device files, usually
located in /dev[7]. The major number tells you which driver handles which
device file. The minor number is used only by the driver itself to
differentiate which device it's operating on, just in case the driver handles
more than one device.
Adding a driver to your system means registering it with the kernel. This is
synonymous with assigning it a major number during the module's initialization.
You do this by using the register_chrdev function, defined by linux/fs.h.
__________________________________________________________________
| |
| int register_chrdev(unsigned int major, const char *name, struct|
| file_operations *fops); |
| |
|__________________________________________________________________|
where unsigned int major is the major number you want to request, const char
*name is the name of the device as it'll appear in /proc/devices and struct
file_operations *fops is a pointer to the file_operations table for your
driver. A negative return value means the registration failed. Note that we
didn't pass the minor number to register_chrdev. That's because the kernel
doesn't care about the minor number; only our driver uses it.
Now the question is, how do you get a major number without hijacking one that's
already in use? The easiest way would be to look through Documentation/
devices.txt and pick an unused one. That's a bad way of doing things because
you'll never be sure if the number you picked will be assigned later. The
answer is that you can ask the kernel to assign you a dynamic major number.
If you pass a major number of 0 to register_chrdev, the return value will be
the dynamically allocated major number. The downside is that you can't make a
device file in advance, since you don't know what the major number will be.
There are a couple of ways to do this. First, the driver itself can print the
newly assigned number and we can make the device file by hand. Second, the
newly registered device will have an entry in /proc/devices, and we can either
make the device file by hand or write a shell script to read the file in and
make the device file. The third method is we can have our driver make the
device file using the mknod system call after a successful registration and rm
during the call to cleanup_module.
-------------------------------------------------------------------------------
4.1.4. Unregistering A Device
We can't allow the kernel module to be rmmod'ed whenever root feels like it. If
the device file is opened by a process and then we remove the kernel module,
using the file would cause a call to the memory location where the appropriate
function (read/write) used to be. If we're lucky, no other code was loaded
there, and we'll get an ugly error message. If we're unlucky, another kernel
module was loaded into the same location, which means a jump into the middle of
another function within the kernel. The results of this would be impossible to
predict, but they can't be very positive.
Normally, when you don't want to allow something, you return an error code (a
negative number) from the function which is supposed to do it. With
cleanup_module that's impossible because it's a void function. However, there's
a counter which keeps track of how many processes are using your module. You
can see what it's value is by looking at the 3rd field of /proc/modules. If
this number isn't zero, rmmod will fail. Note that you don't have to check the
counter from within cleanup_module because the check will be performed for you
by the system call sys_delete_module, defined in linux/module.c. You shouldn't
use this counter directly, but there are functions defined in linux/module.h
which let you increase, decrease and display this counter:
* try_module_get(THIS_MODULE): Increment the use count.
* module_put(THIS_MODULE): Decrement the use count.
It's important to keep the counter accurate; if you ever do lose track of the
correct usage count, you'll never be able to unload the module; it's now reboot
time, boys and girls. This is bound to happen to you sooner or later during a
module's development.
-------------------------------------------------------------------------------
4.1.5. chardev.c
The next code sample creates a char driver named chardev. You can cat its
device file (or open the file with a program) and the driver will put the
number of times the device file has been read from into the file. We don't
support writing to the file (like echo "hi" > /dev/hello), but catch these
attempts and tell the user that the operation isn't supported. Don't worry if
you don't see what we do with the data we read into the buffer; we don't do
much with it. We simply read in the data and print a message acknowledging that
we received it.
Example 4-1. chardev.c
>
-------------------------------------------------------------------------------
4.1.6. Writing Modules for Multiple Kernel Versions
The system calls, which are the major interface the kernel shows to the
processes, generally stay the same across versions. A new system call may be
added, but usually the old ones will behave exactly like they used to. This is
necessary for backward compatibility -- a new kernel version is not supposed to
break regular processes. In most cases, the device files will also remain the
same. On the other hand, the internal interfaces within the kernel can and do
change between versions.
The Linux kernel versions are divided between the stable versions (n.$<$even
number$>$.m) and the development versions (n.$<$odd number$>$.m). The
development versions include all the cool new ideas, including those which will
be considered a mistake, or reimplemented, in the next version. As a result,
you can't trust the interface to remain the same in those versions (which is
why I don't bother to support them in this book, it's too much work and it
would become dated too quickly). In the stable versions, on the other hand, we
can expect the interface to remain the same regardless of the bug fix version
(the m number).
There are differences between different kernel versions, and if you want to
support multiple kernel versions, you'll find yourself having to code
conditional compilation directives. The way to do this to compare the macro
LINUX_VERSION_CODE to the macro KERNEL_VERSION. In version a.b.c of the kernel,
the value of this macro would be $2^{16}a+2^{8}b+c$.
While previous versions of this guide showed how you can write backward
compatible code with such constructs in great detail, we decided to break with
this tradition for the better. People interested in doing such might now use a
LKMPG with a version matching to their kernel. We decided to version the LKMPG
like the kernel, at least as far as major and minor number are concerned. We
use the patchlevel for our own versioning so use LKMPG version 2.4.x for
kernels 2.4.x, use LKMPG version 2.6.x for kernels 2.6.x and so on. Also make
sure that you always use current, up to date versions of both, kernel and
guide.
Update: What we've said above was true for kernels up to and including 2.6.10.
You might already have noticed that recent kernels look different. In case you
haven't they look like 2.6.x.y now. The meaning of the first three items
basically stays the same, but a subpatchlevel has been added and will indicate
security fixes till the next stable patchlevel is out. So people can choose
between a stable tree with security updates and use the latest kernel as
developer tree. Search the kernel mailing list archives if you're interested in
the full story.
-------------------------------------------------------------------------------
Chapter 5. The /proc File System
5.1. The /proc File System
In Linux, there is an additional mechanism for the kernel and kernel modules to
send information to processes --- the /proc file system. Originally designed to
allow easy access to information about processes (hence the name), it is now
used by every bit of the kernel which has something interesting to report, such
as /proc/modules which provides the list of modules and /proc/meminfo which
stats memory usage statistics.
The method to use the proc file system is very similar to the one used with
device drivers --- a structure is created with all the information needed for
the /proc file, including pointers to any handler functions (in our case there
is only one, the one called when somebody attempts to read from the /proc
file). Then, init_module registers the structure with the kernel and
cleanup_module unregisters it.
The reason we use proc_register_dynamic[8] is because we don't want to
determine the inode number used for our file in advance, but to allow the
kernel to determine it to prevent clashes. Normal file systems are located on a
disk, rather than just in memory (which is where /proc is), and in that case
the inode number is a pointer to a disk location where the file's index-node
(inode for short) is located. The inode contains information about the file,
for example the file's permissions, together with a pointer to the disk
location or locations where the file's data can be found.
Because we don't get called when the file is opened or closed, there's nowhere
for us to put try_module_get and try_module_put in this module, and if the file
is opened and then the module is removed, there's no way to avoid the
consequences.
Here a simple example showing how to use a /proc file. This is the HelloWorld
for the /proc filesystem. There are three parts: create the file /proc/
helloworld in the function init_module, return a value (and a buffer) when the
file /proc/helloworld is read in the callback function procfs_read, and delete
the file /proc/helloworld in the function cleanup_module.
The /proc/helloworld is created when the module is loaded with the function
create_proc_entry. The return value is a 'struct proc_dir_entry *', and it will
be used to configure the file /proc/helloworld (for example, the owner of this
file). A null return value means that the creation has failed.
Each time, everytime the file /proc/helloworld is read, the function
procfs_read is called. Two parameters of this function are very important: the
buffer (the first parameter) and the offset (the third one). The content of the
buffer will be returned to the application which read it (for example the cat
command). The offset is the current position in the file. If the return value
of the function isn't null, then this function is called again. So be careful
with this function, if it never returns zero, the read function is called
endlessly.
________________________
| |
| % cat /proc/helloworld|
| HelloWorld! |
|________________________|
Example 5-1. procfs1.c
>
-------------------------------------------------------------------------------
5.2. Read and Write a /proc File
We have seen a very simple example for a /proc file where we only read the file
/proc/helloworld. It's also possible to write in a /proc file. It works the
same way as read, a function is called when the /proc file is written. But
there is a little difference with read, data comes from user, so you have to
import data from user space to kernel space (with copy_from_user or get_user)
The reason for copy_from_user or get_user is that Linux memory (on Intel
architecture, it may be different under some other processors) is segmented.
This means that a pointer, by itself, does not reference a unique location in
memory, only a location in a memory segment, and you need to know which memory
segment it is to be able to use it. There is one memory segment for the kernel,
and one for each of the processes.
The only memory segment accessible to a process is its own, so when writing
regular programs to run as processes, there's no need to worry about segments.
When you write a kernel module, normally you want to access the kernel memory
segment, which is handled automatically by the system. However, when the
content of a memory buffer needs to be passed between the currently running
process and the kernel, the kernel function receives a pointer to the memory
buffer which is in the process segment. The put_user and get_user macros allow
you to access that memory. These functions handle only one caracter, you can
handle several caracters with copy_to_user and copy_from_user. As the buffer
(in read or write function) is in kernel space, for write function you need to
import data because it comes from user space, but not for the read function
because data is already in kernel space.
Example 5-2. procfs2.c
>
-------------------------------------------------------------------------------
5.3. Manage /proc file with standard filesystem
We have seen how to read and write a /proc file with the /proc interface. But
it's also possible to manage /proc file with inodes. The main interest is to
use advanced function, like permissions.
In Linux, there is a standard mechanism for file system registration. Since
every file system has to have its own functions to handle inode and file
operations[9], there is a special structure to hold pointers to all those
functions, struct inode_operations, which includes a pointer to struct
file_operations. In /proc, whenever we register a new file, we're allowed to
specify which struct inode_operations will be used to access to it. This is the
mechanism we use, a struct inode_operations which includes a pointer to a
struct file_operations which includes pointers to our procfs_read and
procfs_write functions.
Another interesting point here is the module_permission function. This function
is called whenever a process tries to do something with the /proc file, and it
can decide whether to allow access or not. Right now it is only based on the
operation and the uid of the current user (as available in current, a pointer
to a structure which includes information on the currently running process),
but it could be based on anything we like, such as what other processes are
doing with the same file, the time of day, or the last input we received.
It's important to note that the standard roles of read and write are reversed
in the kernel. Read functions are used for output, whereas write functions are
used for input. The reason for that is that read and write refer to the user's
point of view --- if a process reads something from the kernel, then the kernel
needs to output it, and if a process writes something to the kernel, then the
kernel receives it as input.
Example 5-3. procfs3.c
>
Still hungry for procfs examples? Well, first of all keep in mind, there are
rumors around, claiming that procfs is on it's way out, consider using sysfs
instead. Second, if you really can't get enough, there's a highly recommendable
bonus level for procfs below linux/Documentation/DocBook/. Use make help in
your toplevel kernel directory for instructions about how to convert it into
your favourite format. Example: make htmldocs. Consider using this mechanism,
in case you want to document something kernel related yourself.
-------------------------------------------------------------------------------
5.4. Manage /proc file with seq_file
As we have seen, writing a /proc file may be quite "complex". So to help people
writting /proc file, there is an API named seq_file that helps formating a /
proc file for output. It's based on sequence, which is composed of 3 functions:
start(), next(), and stop(). The seq_file API starts a sequence when a user
read the /proc file.
A sequence begins with the call of the function start(). If the return is a non
NULL value, the function next() is called. This function is an iterator, the
goal is to go thought all the data. Each time next() is called, the function
show() is also called. It writes data values in the buffer read by the user.
The function next() is called until it returns NULL. The sequence ends when
next() returns NULL, then the function stop() is called.
BE CARREFUL: when a sequence is finished, another one starts. That means that
at the end of function stop(), the function start() is called again. This loop
finishes when the function start() returns NULL. You can see a scheme of this
in the figure "How seq_file works".
Figure 5-1. How seq_file works
Seq_file provides basic functions for file_operations, as seq_read, seq_lseek,
and some others. But nothing to write in the /proc file. Of course, you can
still use the same way as in the previous example.
Example 5-4. procfs4.c
>
If you want more information, you can read this web page:
* http://lwn.net/Articles/22355/
* http://www.kernelnewbies.org/documents/seq_file_howto.txt
You can also read the code of fs/seq_file.c in the linux kernel.
-------------------------------------------------------------------------------
Chapter 6. Using /proc For Input
6.1. TODO: Write a chapter about sysfs
This is just a placeholder for now. Finally I'd like to see a (yet to be
written) chapter about sysfs instead here. If you are familiar with sysfs and
would like to take part in writing this chapter, feel free to contact us (the
LKMPG maintainers) for further details.
-------------------------------------------------------------------------------
Chapter 7. Talking To Device Files
7.1. Talking to Device Files (writes and IOCTLs)
Device files are supposed to represent physical devices. Most physical devices
are used for output as well as input, so there has to be some mechanism for
device drivers in the kernel to get the output to send to the device from
processes. This is done by opening the device file for output and writing to
it, just like writing to a file. In the following example, this is implemented
by device_write.
This is not always enough. Imagine you had a serial port connected to a modem
(even if you have an internal modem, it is still implemented from the CPU's
perspective as a serial port connected to a modem, so you don't have to tax
your imagination too hard). The natural thing to do would be to use the device
file to write things to the modem (either modem commands or data to be sent
through the phone line) and read things from the modem (either responses for
commands or the data received through the phone line). However, this leaves
open the question of what to do when you need to talk to the serial port
itself, for example to send the rate at which data is sent and received.
The answer in Unix is to use a special function called ioctl (short for Input
Output ConTroL). Every device can have its own ioctl commands, which can be
read ioctl's (to send information from a process to the kernel), write ioctl's
(to return information to a process), [10] both or neither. The ioctl function
is called with three parameters: the file descriptor of the appropriate device
file, the ioctl number, and a parameter, which is of type long so you can use a
cast to use it to pass anything. [11]
The ioctl number encodes the major device number, the type of the ioctl, the
command, and the type of the parameter. This ioctl number is usually created by
a macro call (_IO, _IOR, _IOW or _IOWR --- depending on the type) in a header
file. This header file should then be included both by the programs which will
use ioctl (so they can generate the appropriate ioctl's) and by the kernel
module (so it can understand it). In the example below, the header file is
chardev.h and the program which uses it is ioctl.c.
If you want to use ioctls in your own kernel modules, it is best to receive an
official ioctl assignment, so if you accidentally get somebody else's ioctls,
or if they get yours, you'll know something is wrong. For more information,
consult the kernel source tree at Documentation/ioctl-number.txt.
Example 7-1. chardev.c
>
Example 7-2. chardev.h
>
Example 7-3. ioctl.c
>
-------------------------------------------------------------------------------
Chapter 8. System Calls
8.1. System Calls
So far, the only thing we've done was to use well defined kernel mechanisms to
register /proc files and device handlers. This is fine if you want to do
something the kernel programmers thought you'd want, such as write a device
driver. But what if you want to do something unusual, to change the behavior of
the system in some way? Then, you're mostly on your own.
This is where kernel programming gets dangerous. While writing the example
below, I killed the open() system call. This meant I couldn't open any files, I
couldn't run any programs, and I couldn't shutdown the computer. I had to pull
the power switch. Luckily, no files died. To ensure you won't lose any files
either, please run sync right before you do the insmod and the rmmod.
Forget about /proc files, forget about device files. They're just minor
details. The real process to kernel communication mechanism, the one used by
all processes, is system calls. When a process requests a service from the
kernel (such as opening a file, forking to a new process, or requesting more
memory), this is the mechanism used. If you want to change the behaviour of the
kernel in interesting ways, this is the place to do it. By the way, if you want
to see which system calls a program uses, run strace .
In general, a process is not supposed to be able to access the kernel. It can't
access kernel memory and it can't call kernel functions. The hardware of the
CPU enforces this (that's the reason why it's called `protected mode').
System calls are an exception to this general rule. What happens is that the
process fills the registers with the appropriate values and then calls a
special instruction which jumps to a previously defined location in the kernel
(of course, that location is readable by user processes, it is not writable by
them). Under Intel CPUs, this is done by means of interrupt 0x80. The hardware
knows that once you jump to this location, you are no longer running in
restricted user mode, but as the operating system kernel --- and therefore
you're allowed to do whatever you want.
The location in the kernel a process can jump to is called system_call. The
procedure at that location checks the system call number, which tells the
kernel what service the process requested. Then, it looks at the table of
system calls (sys_call_table) to see the address of the kernel function to
call. Then it calls the function, and after it returns, does a few system
checks and then return back to the process (or to a different process, if the
process time ran out). If you want to read this code, it's at the source file
arch/$<$architecture$>$/kernel/entry.S, after the line ENTRY(system_call).
So, if we want to change the way a certain system call works, what we need to
do is to write our own function to implement it (usually by adding a bit of our
own code, and then calling the original function) and then change the pointer
at sys_call_table to point to our function. Because we might be removed later
and we don't want to leave the system in an unstable state, it's important for
cleanup_module to restore the table to its original state.
The source code here is an example of such a kernel module. We want to `spy' on
a certain user, and to printk() a message whenever that user opens a file.
Towards this end, we replace the system call to open a file with our own
function, called our_sys_open. This function checks the uid (user's id) of the
current process, and if it's equal to the uid we spy on, it calls printk() to
display the name of the file to be opened. Then, either way, it calls the
original open() function with the same parameters, to actually open the file.
The init_module function replaces the appropriate location in sys_call_table
and keeps the original pointer in a variable. The cleanup_module function uses
that variable to restore everything back to normal. This approach is dangerous,
because of the possibility of two kernel modules changing the same system call.
Imagine we have two kernel modules, A and B. A's open system call will be
A_open and B's will be B_open. Now, when A is inserted into the kernel, the
system call is replaced with A_open, which will call the original sys_open when
it's done. Next, B is inserted into the kernel, which replaces the system call
with B_open, which will call what it thinks is the original system call,
A_open, when it's done.
Now, if B is removed first, everything will be well---it will simply restore
the system call to A_open, which calls the original. However, if A is removed
and then B is removed, the system will crash. A's removal will restore the
system call to the original, sys_open, cutting B out of the loop. Then, when B
is removed, it will restore the system call to what it thinks is the original,
A_open, which is no longer in memory. At first glance, it appears we could
solve this particular problem by checking if the system call is equal to our
open function and if so not changing it at all (so that B won't change the
system call when it's removed), but that will cause an even worse problem. When
A is removed, it sees that the system call was changed to B_open so that it is
no longer pointing to A_open, so it won't restore it to sys_open before it is
removed from memory. Unfortunately, B_open will still try to call A_open which
is no longer there, so that even without removing B the system would crash.
Note that all the related problems make syscall stealing unfeasiable for
production use. In order to keep people from doing potential harmful things
sys_call_table is no longer exported. This means, if you want to do something
more than a mere dry run of this example, you will have to patch your current
kernel in order to have sys_call_table exported. In the example directory you
will find a README and the patch. As you can imagine, such modifications are
not to be taken lightly. Do not try this on valueable systems (ie systems that
you do not own - or cannot restore easily). You'll need to get the complete
sourcecode of this guide as a tarball in order to get the patch and the README.
Depending on your kernel version, you might even need to hand apply the patch.
Still here? Well, so is this chapter. If Wyle E. Coyote was a kernel hacker,
this would be the first thing he'd try. ;)
Example 8-1. syscall.c
>
-------------------------------------------------------------------------------
Chapter 9. Blocking Processes
9.1. Blocking Processes
What do you do when somebody asks you for something you can't do right away? If
you're a human being and you're bothered by a human being, the only thing you
can say is: "Not right now, I'm busy. Go away!". But if you're a kernel module
and you're bothered by a process, you have another possibility. You can put the
process to sleep until you can service it. After all, processes are being put
to sleep by the kernel and woken up all the time (that's the way multiple
processes appear to run on the same time on a single CPU).
This kernel module is an example of this. The file (called /proc/sleep) can
only be opened by a single process at a time. If the file is already open, the
kernel module calls wait_event_interruptible[12]. This function changes the
status of the task (a task is the kernel data structure which holds information
about a process and the system call it's in, if any) to TASK_INTERRUPTIBLE,
which means that the task will not run until it is woken up somehow, and adds
it to WaitQ, the queue of tasks waiting to access the file. Then, the function
calls the scheduler to context switch to a different process, one which has
some use for the CPU.
When a process is done with the file, it closes it, and module_close is called.
That function wakes up all the processes in the queue (there's no mechanism to
only wake up one of them). It then returns and the process which just closed
the file can continue to run. In time, the scheduler decides that the process
has had enough and gives control of the CPU to another process. Eventually, one
of the processes which was in the queue will be given control of the CPU by the
scheduler. It starts at the point right after the call to
module_interruptible_sleep_on[13]. It can then proceed to set a global variable
to tell all the other processes that the file is still open and go on with its
life. When the other processes get a piece of the CPU, they'll see that global
variable and go back to sleep.
So we'll use tail -f to keep the file open in the background, while trying to
access it with another process (again in the background, so that we need not
switch to a different vt). As soon as the first background process is killed
with kill %1, the second is woken up, is able to access the file and finally
terminates.
To make our life more interesting, module_close doesn't have a monopoly on
waking up the processes which wait to access the file. A signal, such as Ctrl+c
(SIGINT) can also wake up a process. [14] In that case, we want to return with
-EINTR immediately. This is important so users can, for example, kill the
process before it receives the file.
There is one more point to remember. Some times processes don't want to sleep,
they want either to get what they want immediately, or to be told it cannot be
done. Such processes use the O_NONBLOCK flag when opening the file. The kernel
is supposed to respond by returning with the error code -EAGAIN from operations
which would otherwise block, such as opening the file in this example. The
program cat_noblock, available in the source directory for this chapter, can be
used to open a file with O_NONBLOCK.
_________________________________________________________________________
| |
| hostname:~/lkmpg-examples/09-BlockingProcesses# insmod sleep.ko |
| hostname:~/lkmpg-examples/09-BlockingProcesses# cat_noblock /proc/sleep|
| Last input: |
| hostname:~/lkmpg-examples/09-BlockingProcesses# tail -f /proc/sleep & |
| Last input: |
| Last input: |
| Last input: |
| Last input: |
| Last input: |
| Last input: |
| Last input: |
| tail: /proc/sleep: file truncated |
| [1] 6540 |
| hostname:~/lkmpg-examples/09-BlockingProcesses# cat_noblock /proc/sleep|
| Open would block |
| hostname:~/lkmpg-examples/09-BlockingProcesses# kill %1 |
| [1]+ Terminated tail -f /proc/sleep |
| hostname:~/lkmpg-examples/09-BlockingProcesses# cat_noblock /proc/sleep|
| Last input: |
| hostname:~/lkmpg-examples/09-BlockingProcesses# |
|_________________________________________________________________________|
Example 9-1. sleep.c
>
Example 9-2. cat_noblock.c
>
-------------------------------------------------------------------------------
Chapter 10. Replacing Printks
10.1. Replacing printk
In Section_1.2.1.2, I said that X and kernel module programming don't mix.
That's true for developing kernel modules, but in actual use, you want to be
able to send messages to whichever tty[15] the command to load the module came
from.
The way this is done is by using current, a pointer to the currently running
task, to get the current task's tty structure. Then, we look inside that tty
structure to find a pointer to a string write function, which we use to write a
string to the tty.
Example 10-1. print_string.c
>
-------------------------------------------------------------------------------
10.2. Flashing keyboard LEDs
In certain conditions, you may desire a simpler and more direct way to
communicate to the external world. Flashing keyboard LEDs can be such a
solution: It is an immediate way to attract attention or to display a status
condition. Keyboard LEDs are present on every hardware, they are always
visible, they do not need any setup, and their use is rather simple and non-
intrusive, compared to writing to a tty or a file.
The following source code illustrates a minimal kernel module which, when
loaded, starts blinking the keyboard LEDs until it is unloaded.
Example 10-2. kbleds.c
>
If none of the examples in this chapter fit your debugging needs there might
yet be some other tricks to try. Ever wondered what CONFIG_LL_DEBUG in make
menuconfig is good for? If you activate that you get low level access to the
serial port. While this might not sound very powerful by itself, you can patch
kernel/printk.c or any other essential syscall to use printascii, thus makeing
it possible to trace virtually everything what your code does over a serial
line. If you find yourself porting the kernel to some new and former
unsupported architecture this is usually amongst the first things that should
be implemented. Logging over a netconsole might also be worth a try.
While you have seen lots of stuff that can be used to aid debugging here, there
are some things to be aware of. Debugging is almost always intrusive. Adding
debug code can change the situation enough to make the bug seem to dissappear.
Thus you should try to keep debug code to a minimum and make sure it does not
show up in production code.
-------------------------------------------------------------------------------
Chapter 11. Scheduling Tasks
11.1. Scheduling Tasks
Very often, we have "housekeeping" tasks which have to be done at a certain
time, or every so often. If the task is to be done by a process, we do it by
putting it in the crontab file. If the task is to be done by a kernel module,
we have two possibilities. The first is to put a process in the crontab file
which will wake up the module by a system call when necessary, for example by
opening a file. This is terribly inefficient, however -- we run a new process
off of crontab, read a new executable to memory, and all this just to wake up a
kernel module which is in memory anyway.
Instead of doing that, we can create a function that will be called once for
every timer interrupt. The way we do this is we create a task, held in a
workqueue_struct structure, which will hold a pointer to the function. Then, we
use queue_delayed_work to put that task on a task list called my_workqueue,
which is the list of tasks to be executed on the next timer interrupt. Because
we want the function to keep on being executed, we need to put it back on
my_workqueue whenever it is called, for the next timer interrupt.
There's one more point we need to remember here. When a module is removed by
rmmod, first its reference count is checked. If it is zero, module_cleanup is
called. Then, the module is removed from memory with all its functions. Things
need to be shut down properly, or bad things will happen. See the code below
how this can be done in a safe way.
Example 11-1. sched.c
>
-------------------------------------------------------------------------------
Chapter 12. Interrupt Handlers
12.1. Interrupt Handlers
-------------------------------------------------------------------------------
12.1.1. Interrupt Handlers
Except for the last chapter, everything we did in the kernel so far we've done
as a response to a process asking for it, either by dealing with a special
file, sending an ioctl(), or issuing a system call. But the job of the kernel
isn't just to respond to process requests. Another job, which is every bit as
important, is to speak to the hardware connected to the machine.
There are two types of interaction between the CPU and the rest of the
computer's hardware. The first type is when the CPU gives orders to the
hardware, the other is when the hardware needs to tell the CPU something. The
second, called interrupts, is much harder to implement because it has to be
dealt with when convenient for the hardware, not the CPU. Hardware devices
typically have a very small amount of RAM, and if you don't read their
information when available, it is lost.
Under Linux, hardware interrupts are called IRQ's (InterruptRe quests)[16].
There are two types of IRQ's, short and long. A short IRQ is one which is
expected to take a very short period of time, during which the rest of the
machine will be blocked and no other interrupts will be handled. A long IRQ is
one which can take longer, and during which other interrupts may occur (but not
interrupts from the same device). If at all possible, it's better to declare an
interrupt handler to be long.
When the CPU receives an interrupt, it stops whatever it's doing (unless it's
processing a more important interrupt, in which case it will deal with this one
only when the more important one is done), saves certain parameters on the
stack and calls the interrupt handler. This means that certain things are not
allowed in the interrupt handler itself, because the system is in an unknown
state. The solution to this problem is for the interrupt handler to do what
needs to be done immediately, usually read something from the hardware or send
something to the hardware, and then schedule the handling of the new
information at a later time (this is called the "bottom half") and return. The
kernel is then guaranteed to call the bottom half as soon as possible -- and
when it does, everything allowed in kernel modules will be allowed.
The way to implement this is to call request_irq() to get your interrupt
handler called when the relevant IRQ is received. [17]This function receives
the IRQ number, the name of the function, flags, a name for /proc/interrupts
and a parameter to pass to the interrupt handler. Usually there is a certain
number of IRQs available. How many IRQs there are is hardware-dependent. The
flags can include SA_SHIRQ to indicate you're willing to share the IRQ with
other interrupt handlers (usually because a number of hardware devices sit on
the same IRQ) and SA_INTERRUPT to indicate this is a fast interrupt. This
function will only succeed if there isn't already a handler on this IRQ, or if
you're both willing to share.
Then, from within the interrupt handler, we communicate with the hardware and
then use queue_work() mark_bh(BH_IMMEDIATE) to schedule the bottom half.
-------------------------------------------------------------------------------
12.1.2. Keyboards on the Intel Architecture
The rest of this chapter is completely Intel specific. If you're not running on
an Intel platform, it will not work. Don't even try to compile the code here.
I had a problem with writing the sample code for this chapter. On one hand, for
an example to be useful it has to run on everybody's computer with meaningful
results. On the other hand, the kernel already includes device drivers for all
of the common devices, and those device drivers won't coexist with what I'm
going to write. The solution I've found was to write something for the keyboard
interrupt, and disable the regular keyboard interrupt handler first. Since it
is defined as a static symbol in the kernel source files (specifically,
drivers/char/keyboard.c), there is no way to restore it. Before insmod'ing this
code, do on another terminal sleep 120; reboot if you value your file system.
This code binds itself to IRQ 1, which is the IRQ of the keyboard controlled
under Intel architectures. Then, when it receives a keyboard interrupt, it
reads the keyboard's status (that's the purpose of the inb(0x64)) and the scan
code, which is the value returned by the keyboard. Then, as soon as the kernel
thinks it's feasible, it runs got_char which gives the code of the key used
(the first seven bits of the scan code) and whether it has been pressed (if the
8th bit is zero) or released (if it's one).
Example 12-1. intrpt.c
>
-------------------------------------------------------------------------------
Chapter 13. Symmetric Multi Processing
13.1. Symmetrical Multi-Processing
One of the easiest and cheapest ways to improve hardware performance is to put
more than one CPU on the board. This can be done either making the different
CPU's take on different jobs (asymmetrical multi-processing) or by making them
all run in parallel, doing the same job (symmetrical multi-processing, a.k.a.
SMP). Doing asymmetrical multi-processing effectively requires specialized
knowledge about the tasks the computer should do, which is unavailable in a
general purpose operating system such as Linux. On the other hand, symmetrical
multi-processing is relatively easy to implement.
By relatively easy, I mean exactly that: not that it's really easy. In a
symmetrical multi-processing environment, the CPU's share the same memory, and
as a result code running in one CPU can affect the memory used by another. You
can no longer be certain that a variable you've set to a certain value in the
previous line still has that value; the other CPU might have played with it
while you weren't looking. Obviously, it's impossible to program like this.
In the case of process programming this normally isn't an issue, because a
process will normally only run on one CPU at a time[18]. The kernel, on the
other hand, could be called by different processes running on different CPU's.
In version 2.0.x, this isn't a problem because the entire kernel is in one big
spinlock. This means that if one CPU is in the kernel and another CPU wants to
get in, for example because of a system call, it has to wait until the first
CPU is done. This makes Linux SMP safe[19], but inefficient.
In version 2.2.x, several CPU's can be in the kernel at the same time. This is
something module writers need to be aware of.
-------------------------------------------------------------------------------
Chapter 14. Common Pitfalls
14.1. Common Pitfalls
Before I send you on your way to go out into the world and write kernel
modules, there are a few things I need to warn you about. If I fail to warn you
and something bad happens, please report the problem to me for a full refund of
the amount I was paid for your copy of the book.
Using standard libraries
You can't do that. In a kernel module you can only use kernel functions,
which are the functions you can see in /proc/kallsyms.
Disabling interrupts
You might need to do this for a short time and that is OK, but if you
don't enable them afterwards, your system will be stuck and you'll have
to power it off.
Sticking your head inside a large carnivore
I probably don't have to warn you about this, but I figured I will
anyway, just in case.
-------------------------------------------------------------------------------
Appendix A. Changes: 2.0 To 2.2
A.1. Changes between 2.4 and 2.6
-------------------------------------------------------------------------------
A.1.1. Changes between 2.4 and 2.6
I don't know the entire kernel well enough to document all of the changes. Some
hints for porting can be found by comparing this version of the LKMPG with it's
counterpart for kernel 2.4. Apart from that, anybody who needs to port drivers
from 2.4 to 2.6 kernels might want to visit http://lwn.net/Articles/driver-
porting/. If you still can't find an example that exactly meets your needs
there, find a driver that's similar to your driver and present in both kernel
versions. File comparison tools like xxdiff or meld can be a great help then.
Also check if your driver is covered by docs in linux/Documentation/. Before
starting with porting and in case you're stuck it's a good idea to find an
appropiate mailinglist and ask people there for pointers.
-------------------------------------------------------------------------------
Appendix B. Where To Go From Here
B.1. Where From Here?
I could easily have squeezed a few more chapters into this book. I could have
added a chapter about creating new file systems, or about adding new protocol
stacks (as if there's a need for that -- you'd have to dig underground to find
a protocol stack not supported by Linux). I could have added explanations of
the kernel mechanisms we haven't touched upon, such as bootstrapping or the
disk interface.
However, I chose not to. My purpose in writing this book was to provide
initiation into the mysteries of kernel module programming and to teach the
common techniques for that purpose. For people seriously interested in kernel
programming, I recommend Juan-Mariano de Goyeneche's list_of_kernel_resources.
Also, as Linus said, the best way to learn the kernel is to read the source
code yourself.
If you're interested in more examples of short kernel modules, I recommend
Phrack magazine. Even if you're not interested in security, and as a programmer
you should be, the kernel modules there are good examples of what you can do
inside the kernel, and they're short enough not to require too much effort to
understand.
I hope I have helped you in your quest to become a better programmer, or at
least to have fun through technology. And, if you do write useful kernel
modules, I hope you publish them under the GPL, so I can use them too.
If you'd like to contribute to this guide, please contact one the maintainers
for details. As you've already seen, there's a placeholder chapter now, waiting
to be filled with examples for sysfs.
-------------------------------------------------------------------------------
Index
Symbols
/etc/conf.modules, How_Do_Modules_Get_Into_The_Kernel?
/etc/modules.conf, How_Do_Modules_Get_Into_The_Kernel?
/proc filesystem, The_/proc_File_System
/proc/interrupts, Interrupt_Handlers
/proc/kallsyms, Functions_available_to_modules, Name_Space, Common_Pitfalls
/proc/meminfo, The_/proc_File_System
/proc/modules, How_Do_Modules_Get_Into_The_Kernel?, The_/proc_File_System
2.6 changes, Changes_between_2.4_and_2.6
_IO, Talking_to_Device_Files_(writes_and_IOCTLs)
_IOR, Talking_to_Device_Files_(writes_and_IOCTLs)
_IOW, Talking_to_Device_Files_(writes_and_IOCTLs)
_IOWR, Talking_to_Device_Files_(writes_and_IOCTLs)
__exit, Hello_World_(part_3):_The___init_and___exit_Macros
__init, Hello_World_(part_3):_The___init_and___exit_Macros
__initdata, Hello_World_(part_3):_The___init_and___exit_Macros
__initfunction(), Hello_World_(part_3):_The___init_and___exit_Macros
-------------------------------------------------------------------------------
B
blocking processes, Blocking_Processes
blocking, how to avoid, Blocking_Processes
bottom half, Interrupt_Handlers
busy, Blocking_Processes
-------------------------------------------------------------------------------
C
carnivore
large, Common_Pitfalls
cleanup_module(), Hello,_World_(part_1):_The_Simplest_Module
code space, Code_space
coffee, Major_and_Minor_Numbers
copy_from_user, Read_and_Write_a_/proc_File
copy_to_user, Read_and_Write_a_/proc_File
CPU
multiple, Symmetrical_Multi-Processing
crontab, Scheduling_Tasks
ctrl-c, Blocking_Processes
current task, Replacing_printk
-------------------------------------------------------------------------------
D
DEFAULT_MESSAGE_LOGLEVEL, Introducing_printk()
defining ioctls, Talking_to_Device_Files_(writes_and_IOCTLs)
device file
character, Character_Device_Drivers
device files
input to, Talking_to_Device_Files_(writes_and_IOCTLs)
write to, Talking_to_Device_Files_(writes_and_IOCTLs)
-------------------------------------------------------------------------------
E
EAGAIN, Blocking_Processes
EINTR, Blocking_Processes
ENTRY(system call), System_Calls
entry.S, System_Calls
-------------------------------------------------------------------------------
F
file, The_file_structure
filesystem
/proc, The_/proc_File_System
registration, Manage_/proc_file_with_standard_filesystem
filesystem registration, Manage_/proc_file_with_standard_filesystem
file_operations, The_file_operations_Structure
file_operations structure, Manage_/proc_file_with_standard_filesystem
-------------------------------------------------------------------------------
G
get_user, Read_and_Write_a_/proc_File
-------------------------------------------------------------------------------
H
handlers
interrupt, Interrupt_Handlers
housekeeping, Scheduling_Tasks
Hurd, Code_space
-------------------------------------------------------------------------------
I
inb, Keyboards_on_the_Intel_Architecture
init_module(), Hello,_World_(part_1):_The_Simplest_Module
inode, The_file_structure, The_/proc_File_System
inode_operations structure, Manage_/proc_file_with_standard_filesystem
insmod, Compiling_Kernel_Modules, System_Calls
Intel architecture
keyboard, Keyboards_on_the_Intel_Architecture
interrupt 0x80, System_Calls
interrupt handlers, Interrupt_Handlers
interruptible_sleep_on, Blocking_Processes
interrupts
disabling, Common_Pitfalls
ioctl, Talking_to_Device_Files_(writes_and_IOCTLs)
defining, Talking_to_Device_Files_(writes_and_IOCTLs)
official assignment, Talking_to_Device_Files_(writes_and_IOCTLs)
-------------------------------------------------------------------------------
K
kernel
versions, Changes_between_2.4_and_2.6
kernel versions, Writing_Modules_for_Multiple_Kernel_Versions
kerneld, How_Do_Modules_Get_Into_The_Kernel?
KERNEL_VERSION, Writing_Modules_for_Multiple_Kernel_Versions
keyboard, Keyboards_on_the_Intel_Architecture
keyboard LEDs
flashing, Flashing_keyboard_LEDs
kmod, How_Do_Modules_Get_Into_The_Kernel?
-------------------------------------------------------------------------------
L
libraries
standard, Common_Pitfalls
library function, Functions_available_to_modules
LINUX_VERSION_CODE, Writing_Modules_for_Multiple_Kernel_Versions
-------------------------------------------------------------------------------
M
major number, Major_and_Minor_Numbers
dynamic allocation, Registering_A_Device
memory segments, Read_and_Write_a_/proc_File
microkernel, Code_space
minor number, Major_and_Minor_Numbers
mknod, Major_and_Minor_Numbers
modem, Talking_to_Device_Files_(writes_and_IOCTLs)
MODULE_AUTHOR(), Hello_World_(part_4):_Licensing_and_Module_Documentation
module_cleanup, Scheduling_Tasks
MODULE_DESCRIPTION(), Hello_World_(part_4):_Licensing_and_Module
Documentation
module_exit, Hello_World_(part_2)
module_init, Hello_World_(part_2)
module_interruptible_sleep_on, Blocking_Processes
MODULE_LICENSE(), Hello_World_(part_4):_Licensing_and_Module_Documentation
module_permissions, Manage_/proc_file_with_standard_filesystem
module_sleep_on, Blocking_Processes
MODULE_SUPPORTED_DEVICE(), Hello_World_(part_4):_Licensing_and_Module
Documentation
module_wake_up, Blocking_Processes
MOD_DEC_USE_COUNT, Unregistering_A_Device
MOD_INC_USE_COUNT, Unregistering_A_Device
MOD_IN_USE, Unregistering_A_Device
monolithic kernel, Code_space
multi-processing, Symmetrical_Multi-Processing
multi-tasking, Blocking_Processes
multitasking, Blocking_Processes
-------------------------------------------------------------------------------
N
namespace pollution, Name_Space
Neutrino, Code_space
non-blocking, Blocking_Processes
-------------------------------------------------------------------------------
O
official ioctl assignment, Talking_to_Device_Files_(writes_and_IOCTLs)
O_NONBLOCK, Blocking_Processes
-------------------------------------------------------------------------------
P
permission, Manage_/proc_file_with_standard_filesystem
pointer
current, Manage_/proc_file_with_standard_filesystem
printk
replacing, Replacing_printk
printk(), Introducing_printk()
proc file
kallsyms, Common_Pitfalls
processes
blocking, Blocking_Processes
killing, Blocking_Processes
waking up, Blocking_Processes
processing
multi, Symmetrical_Multi-Processing
proc_register, The_/proc_File_System
proc_register_dynamic, The_/proc_File_System
putting processes to sleep, Blocking_Processes
put_user, Read_and_Write_a_/proc_File
-------------------------------------------------------------------------------
Q
queue_delayed_work, Scheduling_Tasks
queue_work, Interrupt_Handlers
-------------------------------------------------------------------------------
R
read
in the kernel, Read_and_Write_a_/proc_File
reference count, Scheduling_Tasks
refund policy, Common_Pitfalls
register_chrdev, Registering_A_Device
request_irq(), Interrupt_Handlers
rmmod, System_Calls, Scheduling_Tasks
preventing, Unregistering_A_Device
-------------------------------------------------------------------------------
S
SA_INTERRUPT, Interrupt_Handlers
SA_SHIRQ, Interrupt_Handlers
scheduler, Blocking_Processes
scheduling tasks, Scheduling_Tasks
segment
memory, Read_and_Write_a_/proc_File
seq_file, Manage_/proc_file_with_seq_file
serial port, Talking_to_Device_Files_(writes_and_IOCTLs)
shutdown, System_Calls
SIGINT, Blocking_Processes
signal, Blocking_Processes
sleep
putting processes to, Blocking_Processes
sleep_on, Blocking_Processes
SMP, Symmetrical_Multi-Processing
source file
chardev.c, Talking_to_Device_Files_(writes_and_IOCTLs)
chardev.h, Talking_to_Device_Files_(writes_and_IOCTLs)
hello-1.c, Hello,_World_(part_1):_The_Simplest_Module
hello-2.c, Hello_World_(part_2)
hello-3.c, Hello_World_(part_3):_The___init_and___exit_Macros
hello-4.c, Hello_World_(part_4):_Licensing_and_Module_Documentation
hello-5.c, Passing_Command_Line_Arguments_to_a_Module
intrpt.c, Keyboards_on_the_Intel_Architecture
ioctl.c, Talking_to_Device_Files_(writes_and_IOCTLs)
print_string.c, Replacing_printk
sched.c, Scheduling_Tasks
sleep.c, Blocking_Processes
start.c, Modules_Spanning_Multiple_Files
stop.c, Modules_Spanning_Multiple_Files
syscall.c, System_Calls
source files
multiple, Modules_Spanning_Multiple_Files, Building_modules_for_a
precompiled_kernel
standard libraries, Common_Pitfalls
strace, Functions_available_to_modules, System_Calls
struct
tty, Replacing_printk
struct file_operations, Manage_/proc_file_with_standard_filesystem
struct inode_operations, Manage_/proc_file_with_standard_filesystem
symbol table, Name_Space
symmetrical multi-processing, Symmetrical_Multi-Processing
sync, System_Calls
system call, Functions_available_to_modules, System_Calls
open, System_Calls
system calls, System_Calls
sys_call_table, System_Calls
sys_open, System_Calls
-------------------------------------------------------------------------------
T
task, Scheduling_Tasks
current, Replacing_printk
tasks
scheduling, Scheduling_Tasks
TASK_INTERRUPTIBLE, Blocking_Processes
try_module_get, System_Calls
tty_structure, Replacing_printk
-------------------------------------------------------------------------------
W
waking up processes, Blocking_Processes
workqueue_struct, Scheduling_Tasks
write
in the kernel, Read_and_Write_a_/proc_File
Notes
[1] In earlier versions of linux, this was known as kerneld.
[2] If such a file exists. Note that the acual behavoir might be distribution-
dependent. If you're interested in the details,read the man pages that
came with module-init-tools, and see for yourself what's really going on.
You could use something like strace modprobe dummy to find out how
dummy.ko gets loaded. FYI: The dummy.ko I'm talking about here is part of
the mainline kernel and can be found in the networking section. It needs
to be compiled as a module (and installed, of course) for this to work.
[3] If you are modifying the kernel, to avoid overwriting your existing
modules you may want to use the EXTRAVERSION variable in the kernel
Makefile to create a seperate directory.
[4] It's an invaluable tool for figuring out things like what files a program
is trying to access. Ever have a program bail silently because it couldn't
find a file? It's a PITA!
[5] I'm a physicist, not a computer scientist, Jim!
[6] This isn't quite the same thing as `building all your modules into the
kernel', although the idea is the same.
[7] This is by convention. When writing a driver, it's OK to put the device
file in your current directory. Just make sure you place it in /dev for a
production driver
[8] In version 2.0, in version 2.2 this is done automatically if we set the
inode to zero.
[9] The difference between the two is that file operations deal with the file
itself, and inode operations deal with ways of referencing the file, such
as creating links to it.
[10] Notice that here the roles of read and write are reversed again, so in
ioctl's read is to send information to the kernel and write is to receive
information from the kernel.
[11] This isn't exact. You won't be able to pass a structure, for example,
through an ioctl --- but you will be able to pass a pointer to the
structure.
[12] The easiest way to keep a file open is to open it with tail -f.
[13] This means that the process is still in kernel mode -- as far as the
process is concerned, it issued the open system call and the system call
hasn't returned yet. The process doesn't know somebody else used the CPU
for most of the time between the moment it issued the call and the moment
it returned.
[14] This is because we used module_interruptible_sleep_on. We could have used
module_sleep_on instead, but that would have resulted is extremely angry
users whose Ctrl+cs are ignored.
[15] Teletype, originally a combination keyboard-printer used to communicate
with a Unix system, and today an abstraction for the text stream used for
a Unix program, whether it's a physical terminal, an xterm on an X
display, a network connection used with telnet, etc.
[16] This is standard nomencalture on the Intel architecture where Linux
originated.
[17] In practice IRQ handling can be a bit more complex. Hardware is often
designed in a way that chains two interrupt controllers, so that all the
IRQs from interrupt controller B are cascaded to a certain IRQ from
interrupt controller A. Of course that requires that the kernel finds out
which IRQ it really was afterwards and that adds overhead. Other
architectures offer some special, very low overhead, so called "fast IRQ"
or FIQs. To take advantage of them requires handlers to be written in
assembler, so they do not really fit into the kernel. They can be made to
work similar to the others, but after that procedure, they're no longer
any faster than "common" IRQs. SMP enabled kernels running on systems with
more than one processor need to solve another truckload of problems. It's
not enough to know if a certain IRQs has happend, it's also important for
what CPU(s) it was for. People still interested in more details, might
want to do a web search for "APIC" now ;)
[18] The exception is threaded processes, which can run on several CPU's at
once.
[19] Meaning it is safe to use it with SMP