dz̸linuxÄÚºËÖеÄlist.h[2]

Á´±íµÄɾ³ý
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}
¸Ãº¯Êýͨ¹ýÉèÖÃprevºÍnextÖ¸ÕëÖ¸Ïò±Ë´Ë£¬ÊµÏÖÁËɾ³ý¶þÕßÖ®¼ä½ÚµãµÄ¹¦ÄÜ¡£µ«ÊÇÕâÀïÎÒÓиöÒÉ»ó£¬É¾³ýµÄÖ¸ÕëµÄÊÍ·ÅÔÚÄÄÀïʵÏÖ¡£
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#else
110extern void list_del(struct list_head *entry);
111#endif
¸Ãº¯Êýͨ¹ýµ÷ÓÃÉÏÃæµÄÄÚÁªº¯ÊýʵÏÖ½ÚµãµÄɾ³ý£¬ÕâÀïµÄLIST_POISON1ºÍLIST_POISON2ÊÇÔÚlinux/poison.h¶¨ÒåµÄ¡£´Ë´¦ÈÔÈ»ÊÇÌõ¼þ±àÒë¡£
 
 
Á´±í½ÚµãµÄÖû»
113/**
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,
121 struct list_head *new)
122{
123 new->next = old->next;
124 new->next->prev = new;
125 new->prev = old->prev;
126 new->prev->next = new;
127}
128
129static inline void list_replace_init(struct list_head *old,
130 struct list_head *new)
131{
132 list_replace(old, new);
133 INIT_LIST_HEAD(old);
134}
¾²Ì¬ÄÚÁªº¯Êýlist_replace½ÓÊÜÁ½¸ö²ÎÊý£ºoldºÍnew£¬²¢Í¨¹ýnewÌæ»»old¡£¶ølist_replace_initº¯ÊýÔòÊÇͨ¹ýµ÷ÓÃlist_replace½øÐÐÌæ»»£¬Ö®ºóµ÷ÓÃINIT_LIST_HEAD¶Ô±»Ìæ»»µÄold½øÐÐÁ´±í³õʼ»¯¡£
 
 
Á´±íµÄÒƶ¯
146/**
147 * list_move - delete from one list