Linux内核学习--写一个c程序，并在内核中编译，运行

             1 #include <linux/module.h>
 2 #include <linux/init.h>
 3 #include <linux/kernel.h>
 4 5//模块许可 6 MODULE_LICENSE("Dual BSD/GPL");
 7 8//模块加载 9staticint hello_init(void)
10{
11     printk(KERN_ALERT "Hi I am heren");
12return0;       
13}
1415//模块卸载16staticvoid hello_exit(void)
17{
18     printk(KERN_ALERT "Goodbyen");
19}
2021//注册22module_init(hello_init);
23 module_exit(hello_init);

             1 obj-m +=hello.o
 2 3#generate the path
 4 CURRENT_PATH:= $(shell pwd)
 5 6#the current kernel version number
 7 LINUX_KERNEL:=$(shell uname -r)
 8 9#the absolute path
10 LINUX_KERNEL_PATH:=usr/src/linux-headers-$(LINUX_KERNEL)
1112 #compile object13all:
14         make -C $(LINUX_KERNEL_PATH) M=(CURRENT_PATH) modules
1516#clean content under current path
17clean:
18         make -c $(LINUX_KERNEL_PATH) m=(CURRENT_PATH) clean

              1
            #ifndef _LINUX_TYPES_H

              2
            #define _LINUX_TYPES_H
  3  4 #include <asm/types.h>
  5  6#ifndef __ASSEMBLY__
  7#ifdef    __KERNEL__
  8  9#define DECLARE_BITMAP(name,bits)  10     unsigned long name[BITS_TO_LONGS(bits)]
 11 12#endif 13 14 #include <linux/posix_types.h>
 15 16#ifdef __KERNEL__
 17 18typedef __u32 __kernel_dev_t;
 19 20typedef __kernel_fd_set        fd_set;
 21typedef __kernel_dev_t        dev_t;
 22typedef __kernel_ino_t        ino_t;
 23typedef __kernel_mode_t        mode_t;
 24typedef __kernel_nlink_t    nlink_t;
 25typedef __kernel_off_t        off_t;
 26typedef __kernel_pid_t        pid_t;
 27typedef __kernel_daddr_t    daddr_t;
 28typedef __kernel_key_t        key_t;
 29typedef __kernel_suseconds_t    suseconds_t;
 30typedef __kernel_timer_t    timer_t;
 31typedef __kernel_clockid_t    clockid_t;
 32typedef __kernel_mqd_t        mqd_t;
 33 34 typedef _Bool            bool;
 35 36typedef __kernel_uid32_t    uid_t;
 37typedef __kernel_gid32_t    gid_t;
 38typedef __kernel_uid16_t        uid16_t;
 39typedef __kernel_gid16_t        gid16_t;
 40 41 typedef unsigned long        uintptr_t;
 42 43#ifdef CONFIG_UID16
 44/* This is defined by include/asm-{arch}/posix_types.h */ 45typedef __kernel_old_uid_t    old_uid_t;
 46typedef __kernel_old_gid_t    old_gid_t;
 47#endif /* CONFIG_UID16 */
 48 49#if defined(__GNUC__)
 50typedef __kernel_loff_t        loff_t;
 51#endif 52 53/* 54 * The following typedefs are also protected by individual ifdefs for
 55 * historical reasons:
 56*/ 57#ifndef _SIZE_T
 58#define _SIZE_T
 59typedef __kernel_size_t        size_t;
 60#endif 61 62#ifndef _SSIZE_T
 63#define _SSIZE_T
 64typedef __kernel_ssize_t    ssize_t;
 65#endif 66 67#ifndef _PTRDIFF_T
 68#define _PTRDIFF_T
 69typedef __kernel_ptrdiff_t    ptrdiff_t;
 70#endif 71 72#ifndef _TIME_T
 73#define _TIME_T
 74typedef __kernel_time_t        time_t;
 75#endif 76 77#ifndef _CLOCK_T
 78#define _CLOCK_T
 79typedef __kernel_clock_t    clock_t;
 80#endif 81 82#ifndef _CADDR_T
 83#define _CADDR_T
 84typedef __kernel_caddr_t    caddr_t;
 85#endif 86 87/* bsd */ 88 typedef unsigned char        u_char;
 89 typedef unsigned short        u_short;
 90 typedef unsigned int        u_int;
 91 typedef unsigned long        u_long;
 92 93/* sysv */ 94 typedef unsigned char        unchar;
 95 typedef unsigned shortushort;
 96 typedef unsigned intuint;
 97 typedef unsigned longulong;
 98 99#ifndef __BIT_TYPES_DEFINED__
100#define __BIT_TYPES_DEFINED__
101102typedef        __u8        u_int8_t;
103typedef        __s8        int8_t;
104typedef        __u16        u_int16_t;
105typedef        __s16        int16_t;
106typedef        __u32        u_int32_t;
107typedef        __s32        int32_t;
108109#endif /* !(__BIT_TYPES_DEFINED__) */
110111typedef        __u8        uint8_t;
112typedef        __u16        uint16_t;
113typedef        __u32        uint32_t;
114115#if defined(__GNUC__)
116typedef        __u64        uint64_t;
117typedef        __u64        u_int64_t;
118typedef        __s64        int64_t;
119#endif120121/* this is a special 64bit data type that is 8-byte aligned */122#define aligned_u64 __u64 __attribute__((aligned(8)))
123#define aligned_be64 __be64 __attribute__((aligned(8)))
124#define aligned_le64 __le64 __attribute__((aligned(8)))
125126/**
127 * The type used for indexing onto a disc or disc partition.
128 *
129 * Linux always considers sectors to be 512 bytes long independently
130 * of the devices real block size.
131 *
132 * blkcnt_t is the type of the inode‘s block count.
133*/134#ifdef CONFIG_LBDAF
135typedef u64 sector_t;
136typedef u64 blkcnt_t;
137#else138 typedef unsigned long sector_t;
139 typedef unsigned long blkcnt_t;
140#endif141142/*143 * The type of an index into the pagecache.  Use a #define so asm/types.h
144 * can override it.
145*/146#ifndef pgoff_t
147#define pgoff_t unsigned long
148#endif149150#endif /* __KERNEL__ */
151152/*153 * Below are truly Linux-specific types that should never collide with
154 * any application/library that wants linux/types.h.
155*/156157#ifdef __CHECKER__
158#define __bitwise__ __attribute__((bitwise))
159#else160#define __bitwise__
161#endif162#ifdef __CHECK_ENDIAN__
163#define __bitwise __bitwise__
164#else165#define __bitwise
166#endif167168typedef __u16 __bitwise __le16;
169typedef __u16 __bitwise __be16;
170typedef __u32 __bitwise __le32;
171typedef __u32 __bitwise __be32;
172typedef __u64 __bitwise __le64;
173typedef __u64 __bitwise __be64;
174175typedef __u16 __bitwise __sum16;
176typedef __u32 __bitwise __wsum;
177178#ifdef __KERNEL__
179typedef unsigned __bitwise__ gfp_t;
180typedef unsigned __bitwise__ fmode_t;
181182#ifdef CONFIG_PHYS_ADDR_T_64BIT
183typedef u64 phys_addr_t;
184#else185typedef u32 phys_addr_t;
186#endif187188typedef phys_addr_t resource_size_t;
189190 typedef struct {
191volatileint counter;
192} atomic_t;
193194#ifdef CONFIG_64BIT
195 typedef struct {
196volatilelong counter;
197} atomic64_t;
198#endif199200struct ustat {
201    __kernel_daddr_t    f_tfree;
202    __kernel_ino_t        f_tinode;
203char            f_fname[6];
204char            f_fpack[6];
205};
206207#endif    /* __KERNEL__ */
208#endif /*  __ASSEMBLY__ */
209#endif /* _LINUX_TYPES_H */

              1
            #ifndef _LINUX_LIST_H

              2
            #define _LINUX_LIST_H
  3  4 #include <linux/stddef.h>
  5 #include <linux/poison.h>
  6 #include <linux/prefetch.h>
  7 #include <asm/system.h>
  8  9/* 10 * Simple doubly linked list implementation.
 11 *
 12 * Some of the internal functions ("__xxx") are useful when
 13 * manipulating whole lists rather than single entries, as
 14 * sometimes we already know the next/prev entries and we can
 15 * generate better code by using them directly rather than
 16 * using the generic single-entry routines.
 17*/ 18 19struct list_head {
 20struct list_head *next, *prev;
 21};
 22 23#define LIST_HEAD_INIT(name) { &(name), &(name) }
 24 25#define LIST_HEAD(name)  26struct list_head name = LIST_HEAD_INIT(name)
 27 28static inline void INIT_LIST_HEAD(struct list_head *list)
 29{
 30     list->next = list;
 31     list->prev = list;
 32}
 33 34/* 35 * Insert a new entry between two known consecutive entries.
 36 *
 37 * This is only for internal list manipulation where we know
 38 * the prev/next entries already!
 39*/ 40#ifndef CONFIG_DEBUG_LIST
 41static inline void __list_add(struct list_head *new,
 42struct list_head *prev,
 43struct list_head *next)
 44{
 45     next->prev = new;
 46new->next = next;
 47new->prev = prev;
 48     prev->next = new;
 49}
 50#else 51externvoid __list_add(struct list_head *new,
 52struct list_head *prev,
 53struct list_head *next);
 54#endif 55 56/**
 57 * list_add - add a new entry
 58 * @new: new entry to be added
 59 * @head: list head to add it after
 60 *
 61 * Insert a new entry after the specified head.
 62 * This is good for implementing stacks.
 63*/ 64static inline void list_add(struct list_head *new, struct list_head *head)
 65{
 66     __list_add(new, head, head->next);
 67}
 68 69 70/**
 71 * list_add_tail - add a new entry
 72 * @new: new entry to be added
 73 * @head: list head to add it before
 74 *
 75 * Insert a new entry before the specified head.
 76 * This is useful for implementing queues.
 77*/ 78static inline void list_add_tail(struct list_head *new, struct list_head *head)
 79{
 80     __list_add(new, head->prev, head);
 81}
 82 83/* 84 * Delete a list entry by making the prev/next entries
 85 * point to each other.
 86 *
 87 * This is only for internal list manipulation where we know
 88 * the prev/next entries already!
 89*/ 90static inline void __list_del(struct list_head * prev, struct list_head * next)
 91{
 92     next->prev = prev;
 93     prev->next = next;
 94}
 95 96/**
 97 * list_del - deletes entry from list.
 98 * @entry: the element to delete from the list.
 99 * Note: list_empty() on entry does not return true after this, the entry is
100 * in an undefined state.
101*/102#ifndef CONFIG_DEBUG_LIST
103static inline void list_del(struct list_head *entry)
104{
105     __list_del(entry->prev, entry->next);
106     entry->next = LIST_POISON1;
107     entry->prev = LIST_POISON2;
108}
109#else110externvoid list_del(struct list_head *entry);
111#endif112113/**
114 * list_replace - replace old entry by new one
115 * @old : the element to be replaced
116 * @new : the new element to insert
117 *
118 * If @old was empty, it will be overwritten.
119*/120static inline void list_replace(struct list_head *old,
121struct list_head *new)
122{
123new->next = old->next;
124new->next->prev = new;
125new->prev = old->prev;
126new->prev->next = new;
127}
128129static inline void list_replace_init(struct list_head *old,
130struct list_head *new)
131{
132     list_replace(old, new);
133    INIT_LIST_HEAD(old);
134}
135136/**
137 * list_del_init - deletes entry from list and reinitialize it.
138 * @entry: the element to delete from the list.
139*/140static inline void list_del_init(struct list_head *entry)
141{
142     __list_del(entry->prev, entry->next);
143    INIT_LIST_HEAD(entry);
144}
145146/**
147 * list_move - delete from one list and add as another‘s head
148 * @list: the entry to move
149 * @head: the head that will precede our entry
150*/151static inline void list_move(struct list_head *list, struct list_head *head)
152{
153     __list_del(list->prev, list->next);
154    list_add(list, head);
155}
156157/**
158 * list_move_tail - delete from one list and add as another‘s tail
159 * @list: the entry to move
160 * @head: the head that will follow our entry
161*/162static inline void list_move_tail(struct list_head *list,
163struct list_head *head)
164{
165     __list_del(list->prev, list->next);
166    list_add_tail(list, head);
167}
168169/**
170 * list_is_last - tests whether @list is the last entry in list @head
171 * @list: the entry to test
172 * @head: the head of the list
173*/174static inline int list_is_last(conststruct list_head *list,
175conststruct list_head *head)
176{
177return list->next == head;
178}
179180/**
181 * list_empty - tests whether a list is empty
182 * @head: the list to test.
183*/184static inline int list_empty(conststruct list_head *head)
185{
186return head->next == head;
187}
188189/**
190 * list_empty_careful - tests whether a list is empty and not being modified
191 * @head: the list to test
192 *
193 * Description:
194 * tests whether a list is empty _and_ checks that no other CPU might be
195 * in the process of modifying either member (next or prev)
196 *
197 * NOTE: using list_empty_careful() without synchronization
198 * can only be safe if the only activity that can happen
199 * to the list entry is list_del_init(). Eg. it cannot be used
200 * if another CPU could re-list_add() it.
201*/202static inline int list_empty_careful(conststruct list_head *head)
203{
204struct list_head *next = head->next;
205return (next == head) && (next == head->prev);
206}
207208/**
209 * list_is_singular - tests whether a list has just one entry.
210 * @head: the list to test.
211*/212static inline int list_is_singular(conststruct list_head *head)
213{
214return !list_empty(head) && (head->next == head->prev);
215}
216217static inline void __list_cut_position(struct list_head *list,
218struct list_head *head, struct list_head *entry)
219{
220struct list_head *new_first = entry->next;
221     list->next = head->next;
222     list->next->prev = list;
223     list->prev = entry;
224     entry->next = list;
225     head->next = new_first;
226     new_first->prev = head;
227}
228229/**
230 * list_cut_position - cut a list into two
231 * @list: a new list to add all removed entries
232 * @head: a list with entries
233 * @entry: an entry within head, could be the head itself
234 *    and if so we won‘t cut the list
235 *
236 * This helper moves the initial part of @head, up to and
237 * including @entry, from @head to @list. You should
238 * pass on @entry an element you know is on @head. @list
239 * should be an empty list or a list you do not care about
240 * losing its data.
241 *
242*/243static inline void list_cut_position(struct list_head *list,
244struct list_head *head, struct list_head *entry)
245{
246if (list_empty(head))
247return;
248if (list_is_singular(head) &&
249         (head->next != entry && head != entry))
250return;
251if (entry == head)
252        INIT_LIST_HEAD(list);
253else254        __list_cut_position(list, head, entry);
255}
256257static inline void __list_splice(conststruct list_head *list,
258struct list_head *prev,
259struct list_head *next)
260{
261struct list_head *first = list->next;
262struct list_head *last = list->prev;
263264     first->prev = prev;
265     prev->next = first;
266267     last->next = next;
268     next->prev = last;
269}
270271/**
272 * list_splice - join two lists, this is designed for stacks
273 * @list: the new list to add.
274 * @head: the place to add it in the first list.
275*/276static inline void list_splice(conststruct list_head *list,
277struct list_head *head)
278{
279if (!list_empty(list))
280         __list_splice(list, head, head->next);
281}
282283/**
284 * list_splice_tail - join two lists, each list being a queue
285 * @list: the new list to add.
286 * @head: the place to add it in the first list.
287*/288static inline void list_splice_tail(struct list_head *list,
289struct list_head *head)
290{
291if (!list_empty(list))
292         __list_splice(list, head->prev, head);
293}
294295/**
296 * list_splice_init - join two lists and reinitialise the emptied list.
297 * @list: the new list to add.
298 * @head: the place to add it in the first list.
299 *
300 * The list at @list is reinitialised
301*/302static inline void list_splice_init(struct list_head *list,
303struct list_head *head)
304{
305if (!list_empty(list)) {
306         __list_splice(list, head, head->next);
307        INIT_LIST_HEAD(list);
308    }
309}
310311/**
312 * list_splice_tail_init - join two lists and reinitialise the emptied list
313 * @list: the new list to add.
314 * @head: the place to add it in the first list.
315 *
316 * Each of the lists is a queue.
317 * The list at @list is reinitialised
318*/319static inline void list_splice_tail_init(struct list_head *list,
320struct list_head *head)
321{
322if (!list_empty(list)) {
323         __list_splice(list, head->prev, head);
324        INIT_LIST_HEAD(list);
325    }
326}
327328/**
329 * list_entry - get the struct for this entry
330 * @ptr:    the &struct list_head pointer.
331 * @type:    the type of the struct this is embedded in.
332 * @member:    the name of the list_struct within the struct.
333*/334#define list_entry(ptr, type, member) 335    container_of(ptr, type, member)
336337/**
338 * list_first_entry - get the first element from a list
339 * @ptr:    the list head to take the element from.
340 * @type:    the type of the struct this is embedded in.
341 * @member:    the name of the list_struct within the struct.
342 *
343 * Note, that list is expected to be not empty.
344*/345#define list_first_entry(ptr, type, member) 346     list_entry((ptr)->next, type, member)
347348/**
349 * list_for_each    -    iterate over a list
350 * @pos:    the &struct list_head to use as a loop cursor.
351 * @head:    the head for your list.
352*/353#define list_for_each(pos, head) 354for (pos = (head)->next; prefetch(pos->next), pos != (head); 355             pos = pos->next)
356357/**
358 * __list_for_each    -    iterate over a list
359 * @pos:    the &struct list_head to use as a loop cursor.
360 * @head:    the head for your list.
361 *
362 * This variant differs from list_for_each() in that it‘s the
363 * simplest possible list iteration code, no prefetching is done.
364 * Use this for code that knows the list to be very short (empty
365 * or 1 entry) most of the time.
366*/367#define __list_for_each(pos, head) 368for (pos = (head)->next; pos != (head); pos = pos->next)
369370/**
371 * list_for_each_prev    -    iterate over a list backwards
372 * @pos:    the &struct list_head to use as a loop cursor.
373 * @head:    the head for your list.
374*/375#define list_for_each_prev(pos, head) 376for (pos = (head)->prev; prefetch(pos->prev), pos != (head); 377             pos = pos->prev)
378379/**
380 * list_for_each_safe - iterate over a list safe against removal of list entry
381 * @pos:    the &struct list_head to use as a loop cursor.
382 * @n:        another &struct list_head to use as temporary storage
383 * @head:    the head for your list.
384*/385#define list_for_each_safe(pos, n, head) 386for (pos = (head)->next, n = pos->next; pos != (head); 387         pos = n, n = pos->next)
388389/**
390 * list_for_each_prev_safe - iterate over a list backwards safe against removal of list entry
391 * @pos:    the &struct list_head to use as a loop cursor.
392 * @n:        another &struct list_head to use as temporary storage
393 * @head:    the head for your list.
394*/395#define list_for_each_prev_safe(pos, n, head) 396for (pos = (head)->prev, n = pos->prev; 397          prefetch(pos->prev), pos != (head); 398          pos = n, n = pos->prev)
399400/**
401 * list_for_each_entry    -    iterate over list of given type
402 * @pos:    the type * to use as a loop cursor.
403 * @head:    the head for your list.
404 * @member:    the name of the list_struct within the struct.
405*/406#define list_for_each_entry(pos, head, member)                407for (pos = list_entry((head)->next, typeof(*pos), member);    408          prefetch(pos->member.next), &pos->member != (head);     409          pos = list_entry(pos->member.next, typeof(*pos), member))
410411/**
412 * list_for_each_entry_reverse - iterate backwards over list of given type.
413 * @pos:    the type * to use as a loop cursor.
414 * @head:    the head for your list.
415 * @member:    the name of the list_struct within the struct.
416*/417#define list_for_each_entry_reverse(pos, head, member)            418for (pos = list_entry((head)->prev, typeof(*pos), member);    419          prefetch(pos->member.prev), &pos->member != (head);     420          pos = list_entry(pos->member.prev, typeof(*pos), member))
421422/**
423 * list_prepare_entry - prepare a pos entry for use in list_for_each_entry_continue()
424 * @pos:    the type * to use as a start point
425 * @head:    the head of the list
426 * @member:    the name of the list_struct within the struct.
427 *
428 * Prepares a pos entry for use as a start point in list_for_each_entry_continue().
429*/430#define list_prepare_entry(pos, head, member) 431     ((pos) ? : list_entry(head, typeof(*pos), member))
432433/**
434 * list_for_each_entry_continue - continue iteration over list of given type
435 * @pos:    the type * to use as a loop cursor.
436 * @head:    the head for your list.
437 * @member:    the name of the list_struct within the struct.
438 *
439 * Continue to iterate over list of given type, continuing after
440 * the current position.
441*/442#define list_for_each_entry_continue(pos, head, member)         443for (pos = list_entry(pos->member.next, typeof(*pos), member);    444          prefetch(pos->member.next), &pos->member != (head);    445          pos = list_entry(pos->member.next, typeof(*pos), member))
446447/**
448 * list_for_each_entry_continue_reverse - iterate backwards from the given point
449 * @pos:    the type * to use as a loop cursor.
450 * @head:    the head for your list.
451 * @member:    the name of the list_struct within the struct.
452 *
453 * Start to iterate over list of given type backwards, continuing after
454 * the current position.
455*/456#define list_for_each_entry_continue_reverse(pos, head, member)        457for (pos = list_entry(pos->member.prev, typeof(*pos), member);    458          prefetch(pos->member.prev), &pos->member != (head);    459          pos = list_entry(pos->member.prev, typeof(*pos), member))
460461/**
462 * list_for_each_entry_from - iterate over list of given type from the current point
463 * @pos:    the type * to use as a loop cursor.
464 * @head:    the head for your list.
465 * @member:    the name of the list_struct within the struct.
466 *
467 * Iterate over list of given type, continuing from current position.
468*/469#define list_for_each_entry_from(pos, head, member)             470for (; prefetch(pos->member.next), &pos->member != (head);    471          pos = list_entry(pos->member.next, typeof(*pos), member))
472473/**
474 * list_for_each_entry_safe - iterate over list of given type safe against removal of list entry
475 * @pos:    the type * to use as a loop cursor.
476 * @n:        another type * to use as temporary storage
477 * @head:    the head for your list.
478 * @member:    the name of the list_struct within the struct.
479*/480#define list_for_each_entry_safe(pos, n, head, member)            481for (pos = list_entry((head)->next, typeof(*pos), member),    482         n = list_entry(pos->member.next, typeof(*pos), member);    483          &pos->member != (head);                     484          pos = n, n = list_entry(n->member.next, typeof(*n), member))
485486/**
487 * list_for_each_entry_safe_continue
488 * @pos:    the type * to use as a loop cursor.
489 * @n:        another type * to use as temporary storage
490 * @head:    the head for your list.
491 * @member:    the name of the list_struct within the struct.
492 *
493 * Iterate over list of given type, continuing after current point,
494 * safe against removal of list entry.
495*/496#define list_for_each_entry_safe_continue(pos, n, head, member)         497for (pos = list_entry(pos->member.next, typeof(*pos), member),         498         n = list_entry(pos->member.next, typeof(*pos), member);        499          &pos->member != (head);                        500          pos = n, n = list_entry(n->member.next, typeof(*n), member))
501502/**
503 * list_for_each_entry_safe_from
504 * @pos:    the type * to use as a loop cursor.
505 * @n:        another type * to use as temporary storage
506 * @head:    the head for your list.
507 * @member:    the name of the list_struct within the struct.
508 *
509 * Iterate over list of given type from current point, safe against
510 * removal of list entry.
511*/512#define list_for_each_entry_safe_from(pos, n, head, member)             513for (n = list_entry(pos->member.next, typeof(*pos), member);        514          &pos->member != (head);                        515          pos = n, n = list_entry(n->member.next, typeof(*n), member))
516517/**
518 * list_for_each_entry_safe_reverse
519 * @pos:    the type * to use as a loop cursor.
520 * @n:        another type * to use as temporary storage
521 * @head:    the head for your list.
522 * @member:    the name of the list_struct within the struct.
523 *
524 * Iterate backwards over list of given type, safe against removal
525 * of list entry.
526*/527#define list_for_each_entry_safe_reverse(pos, n, head, member)        528for (pos = list_entry((head)->prev, typeof(*pos), member),    529         n = list_entry(pos->member.prev, typeof(*pos), member);    530          &pos->member != (head);                     531          pos = n, n = list_entry(n->member.prev, typeof(*n), member))
532533/*534 * Double linked lists with a single pointer list head.
535 * Mostly useful for hash tables where the two pointer list head is
536 * too wasteful.
537 * You lose the ability to access the tail in O(1).
538*/539540struct hlist_head {
541struct hlist_node *first;
542};
543544struct hlist_node {
545struct hlist_node *next, **pprev;
546};
547548#define HLIST_HEAD_INIT { .first = NULL }
549#define HLIST_HEAD(name) struct hlist_head name = {  .first = NULL }
550#define INIT_HLIST_HEAD(ptr) ((ptr)->first = NULL)
551static inline void INIT_HLIST_NODE(struct hlist_node *h)
552{
553     h->next = NULL;
554     h->pprev = NULL;
555}
556557static inline int hlist_unhashed(conststruct hlist_node *h)
558{
559return !h->pprev;
560}
561562static inline int hlist_empty(conststruct hlist_head *h)
563{
564return !h->first;
565}
566567static inline void __hlist_del(struct hlist_node *n)
568{
569struct hlist_node *next = n->next;
570struct hlist_node **pprev = n->pprev;
571     *pprev = next;
572if (next)
573         next->pprev = pprev;
574}
575576static inline void hlist_del(struct hlist_node *n)
577{
578    __hlist_del(n);
579     n->next = LIST_POISON1;
580     n->pprev = LIST_POISON2;
581}
582583static inline void hlist_del_init(struct hlist_node *n)
584{
585if (!hlist_unhashed(n)) {
586        __hlist_del(n);
587        INIT_HLIST_NODE(n);
588    }
589}
590591static inline void hlist_add_head(struct hlist_node *n, struct hlist_head *h)
592{
593struct hlist_node *first = h->first;
594     n->next = first;
595if (first)
596         first->pprev = &n->next;
597     h->first = n;
598     n->pprev = &h->first;
599}
600601/* next must be != NULL */602static inline void hlist_add_before(struct hlist_node *n,
603struct hlist_node *next)
604{
605     n->pprev = next->pprev;
606     n->next = next;
607     next->pprev = &n->next;
608     *(n->pprev) = n;
609}
610611static inline void hlist_add_after(struct hlist_node *n,
612struct hlist_node *next)
613{
614     next->next = n->next;
615     n->next = next;
616     next->pprev = &n->next;
617618if(next->next)
619         next->next->pprev  = &next->next;
620}
621622/*623 * Move a list from one list head to another. Fixup the pprev
624 * reference of the first entry if it exists.
625*/626static inline void hlist_move_list(struct hlist_head *old,
627struct hlist_head *new)
628{
629new->first = old->first;
630if (new->first)
631new->first->pprev = &new->first;
632     old->first = NULL;
633}
634635#define hlist_entry(ptr, type, member) container_of(ptr,type,member)
636637#define hlist_for_each(pos, head) 638for (pos = (head)->first; pos && ({ prefetch(pos->next); 1; }); 639          pos = pos->next)
640641#define hlist_for_each_safe(pos, n, head) 642for (pos = (head)->first; pos && ({ n = pos->next; 1; }); 643          pos = n)
644645/**
646 * hlist_for_each_entry    - iterate over list of given type
647 * @tpos:    the type * to use as a loop cursor.
648 * @pos:    the &struct hlist_node to use as a loop cursor.
649 * @head:    the head for your list.
650 * @member:    the name of the hlist_node within the struct.
651*/652#define hlist_for_each_entry(tpos, pos, head, member)             653for (pos = (head)->first;                     654          pos && ({ prefetch(pos->next); 1;}) &&655         ({ tpos = hlist_entry(pos, typeof(*tpos), member); 1;}); 656          pos = pos->next)
657658/**
659 * hlist_for_each_entry_continue - iterate over a hlist continuing after current point
660 * @tpos:    the type * to use as a loop cursor.
661 * @pos:    the &struct hlist_node to use as a loop cursor.
662 * @member:    the name of the hlist_node within the struct.
663*/664#define hlist_for_each_entry_continue(tpos, pos, member)         665for (pos = (pos)->next;                         666          pos && ({ prefetch(pos->next); 1;}) &&667         ({ tpos = hlist_entry(pos, typeof(*tpos), member); 1;}); 668          pos = pos->next)
669670/**
671 * hlist_for_each_entry_from - iterate over a hlist continuing from current point
672 * @tpos:    the type * to use as a loop cursor.
673 * @pos:    the &struct hlist_node to use as a loop cursor.
674 * @member:    the name of the hlist_node within the struct.
675*/676#define hlist_for_each_entry_from(tpos, pos, member)             677for (; pos && ({ prefetch(pos->next); 1;}) &&678         ({ tpos = hlist_entry(pos, typeof(*tpos), member); 1;}); 679          pos = pos->next)
680681/**
682 * hlist_for_each_entry_safe - iterate over list of given type safe against removal of list entry
683 * @tpos:    the type * to use as a loop cursor.
684 * @pos:    the &struct hlist_node to use as a loop cursor.
685 * @n:        another &struct hlist_node to use as temporary storage
686 * @head:    the head for your list.
687 * @member:    the name of the hlist_node within the struct.
688*/689#define hlist_for_each_entry_safe(tpos, pos, n, head, member)          690for (pos = (head)->first;                     691          pos && ({ n = pos->next; 1; }) &&692         ({ tpos = hlist_entry(pos, typeof(*tpos), member); 1;}); 693          pos = n)
694695#endif