blob: 6a039a62841d9f4c9c9156b95c3e68ede4fe92d9 [file] [log] [blame]
Dave Jones199a9af2006-09-29 01:59:00 -07001/*
2 * Copyright 2006, Red Hat, Inc., Dave Jones
3 * Released under the General Public License (GPL).
4 *
5 * This file contains the linked list implementations for
6 * DEBUG_LIST.
7 */
8
Paul Gortmaker8bc3bcc2011-11-16 21:29:17 -05009#include <linux/export.h>
Dave Jones199a9af2006-09-29 01:59:00 -070010#include <linux/list.h>
Paul Gortmaker50af5ea2012-01-20 18:35:53 -050011#include <linux/bug.h>
Paul Gortmakerb116ee42012-01-20 18:46:49 -050012#include <linux/kernel.h>
Syed Rameez Mustafa1c014f32013-07-15 11:52:09 -070013#include <linux/bug.h>
Dave Jones199a9af2006-09-29 01:59:00 -070014
15/*
16 * Insert a new entry between two known consecutive entries.
17 *
18 * This is only for internal list manipulation where we know
19 * the prev/next entries already!
20 */
21
22void __list_add(struct list_head *new,
23 struct list_head *prev,
24 struct list_head *next)
25{
Dave Jones924d9ad2008-07-25 01:45:55 -070026 WARN(next->prev != prev,
27 "list_add corruption. next->prev should be "
28 "prev (%p), but was %p. (next=%p).\n",
29 prev, next->prev, next);
30 WARN(prev->next != next,
31 "list_add corruption. prev->next should be "
32 "next (%p), but was %p. (prev=%p).\n",
33 next, prev->next, prev);
Syed Rameez Mustafa1c014f32013-07-15 11:52:09 -070034
35 BUG_ON(((prev->next != next) || (next->prev != prev)) &&
36 PANIC_CORRUPTION);
37
Dave Jones199a9af2006-09-29 01:59:00 -070038 next->prev = new;
39 new->next = next;
40 new->prev = prev;
41 prev->next = new;
42}
43EXPORT_SYMBOL(__list_add);
44
Linus Torvalds3c18d4d2011-02-18 11:32:28 -080045void __list_del_entry(struct list_head *entry)
46{
47 struct list_head *prev, *next;
48
49 prev = entry->prev;
50 next = entry->next;
51
52 if (WARN(next == LIST_POISON1,
53 "list_del corruption, %p->next is LIST_POISON1 (%p)\n",
54 entry, LIST_POISON1) ||
55 WARN(prev == LIST_POISON2,
56 "list_del corruption, %p->prev is LIST_POISON2 (%p)\n",
57 entry, LIST_POISON2) ||
58 WARN(prev->next != entry,
59 "list_del corruption. prev->next should be %p, "
60 "but was %p\n", entry, prev->next) ||
61 WARN(next->prev != entry,
62 "list_del corruption. next->prev should be %p, "
Syed Rameez Mustafa1c014f32013-07-15 11:52:09 -070063 "but was %p\n", entry, next->prev)) {
64 BUG_ON(PANIC_CORRUPTION);
Linus Torvalds3c18d4d2011-02-18 11:32:28 -080065 return;
Syed Rameez Mustafa1c014f32013-07-15 11:52:09 -070066 }
Linus Torvalds3c18d4d2011-02-18 11:32:28 -080067
68 __list_del(prev, next);
69}
70EXPORT_SYMBOL(__list_del_entry);
71
Dave Jones199a9af2006-09-29 01:59:00 -070072/**
Dave Jones199a9af2006-09-29 01:59:00 -070073 * list_del - deletes entry from list.
74 * @entry: the element to delete from the list.
75 * Note: list_empty on entry does not return true after this, the entry is
76 * in an undefined state.
77 */
78void list_del(struct list_head *entry)
79{
Linus Torvalds3c18d4d2011-02-18 11:32:28 -080080 __list_del_entry(entry);
Dave Jones199a9af2006-09-29 01:59:00 -070081 entry->next = LIST_POISON1;
82 entry->prev = LIST_POISON2;
83}
84EXPORT_SYMBOL(list_del);