2 * Copyright 2006, Red Hat, Inc., Dave Jones
3 * Released under the General Public License (GPL).
5 * This file contains the linked list implementations for
9 #include <linux/module.h>
10 #include <linux/list.h>
13 * Insert a new entry between two known consecutive entries.
15 * This is only for internal list manipulation where we know
16 * the prev/next entries already!
19 void __list_add(struct list_head
*new,
20 struct list_head
*prev
,
21 struct list_head
*next
)
23 WARN(next
->prev
!= prev
,
24 "list_add corruption. next->prev should be "
25 "prev (%p), but was %p. (next=%p).\n",
26 prev
, next
->prev
, next
);
27 WARN(prev
->next
!= next
,
28 "list_add corruption. prev->next should be "
29 "next (%p), but was %p. (prev=%p).\n",
30 next
, prev
->next
, prev
);
36 EXPORT_SYMBOL(__list_add
);
39 * list_del - deletes entry from list.
40 * @entry: the element to delete from the list.
41 * Note: list_empty on entry does not return true after this, the entry is
42 * in an undefined state.
44 void list_del(struct list_head
*entry
)
46 WARN(entry
->prev
->next
!= entry
,
47 "list_del corruption. prev->next should be %p, "
48 "but was %p\n", entry
, entry
->prev
->next
);
49 WARN(entry
->next
->prev
!= entry
,
50 "list_del corruption. next->prev should be %p, "
51 "but was %p\n", entry
, entry
->next
->prev
);
52 __list_del(entry
->prev
, entry
->next
);
53 entry
->next
= LIST_POISON1
;
54 entry
->prev
= LIST_POISON2
;
56 EXPORT_SYMBOL(list_del
);
This page took 0.030676 seconds and 5 git commands to generate.