list_debug.c (0cd340dcb05c4a43742fe156f36737bb2a321bfd) list_debug.c (de54ebbe26bb371a6f1fbc0593372232f04e3107)
1/*
2 * Copyright 2006, Red Hat, Inc., Dave Jones
3 * Released under the General Public License (GPL).
4 *
5 * This file contains the linked list validation for DEBUG_LIST.
6 */
7
8#include <linux/export.h>

--- 6 unchanged lines hidden (view full) ---

15 * Check that the data structures for the list manipulations are reasonably
16 * valid. Failures here indicate memory corruption (and possibly an exploit
17 * attempt).
18 */
19
20bool __list_add_valid(struct list_head *new, struct list_head *prev,
21 struct list_head *next)
22{
1/*
2 * Copyright 2006, Red Hat, Inc., Dave Jones
3 * Released under the General Public License (GPL).
4 *
5 * This file contains the linked list validation for DEBUG_LIST.
6 */
7
8#include <linux/export.h>

--- 6 unchanged lines hidden (view full) ---

15 * Check that the data structures for the list manipulations are reasonably
16 * valid. Failures here indicate memory corruption (and possibly an exploit
17 * attempt).
18 */
19
20bool __list_add_valid(struct list_head *new, struct list_head *prev,
21 struct list_head *next)
22{
23 if (unlikely(next->prev != prev)) {
24 WARN(1, "list_add corruption. next->prev should be prev (%p), but was %p. (next=%p).\n",
25 prev, next->prev, next);
26 return false;
27 }
28 if (unlikely(prev->next != next)) {
29 WARN(1, "list_add corruption. prev->next should be next (%p), but was %p. (prev=%p).\n",
30 next, prev->next, prev);
31 return false;
32 }
33 if (unlikely(new == prev || new == next)) {
34 WARN(1, "list_add double add: new=%p, prev=%p, next=%p.\n",
35 new, prev, next);
36 return false;
37 }
23 CHECK_DATA_CORRUPTION(next->prev != prev,
24 "list_add corruption. next->prev should be prev (%p), but was %p. (next=%p).\n",
25 prev, next->prev, next);
26 CHECK_DATA_CORRUPTION(prev->next != next,
27 "list_add corruption. prev->next should be next (%p), but was %p. (prev=%p).\n",
28 next, prev->next, prev);
29 CHECK_DATA_CORRUPTION(new == prev || new == next,
30 "list_add double add: new=%p, prev=%p, next=%p.\n",
31 new, prev, next);
32
38 return true;
39}
40EXPORT_SYMBOL(__list_add_valid);
41
42bool __list_del_entry_valid(struct list_head *entry)
43{
44 struct list_head *prev, *next;
45
46 prev = entry->prev;
47 next = entry->next;
48
33 return true;
34}
35EXPORT_SYMBOL(__list_add_valid);
36
37bool __list_del_entry_valid(struct list_head *entry)
38{
39 struct list_head *prev, *next;
40
41 prev = entry->prev;
42 next = entry->next;
43
49 if (unlikely(next == LIST_POISON1)) {
50 WARN(1, "list_del corruption, %p->next is LIST_POISON1 (%p)\n",
51 entry, LIST_POISON1);
52 return false;
53 }
54 if (unlikely(prev == LIST_POISON2)) {
55 WARN(1, "list_del corruption, %p->prev is LIST_POISON2 (%p)\n",
56 entry, LIST_POISON2);
57 return false;
58 }
59 if (unlikely(prev->next != entry)) {
60 WARN(1, "list_del corruption. prev->next should be %p, but was %p\n",
61 entry, prev->next);
62 return false;
63 }
64 if (unlikely(next->prev != entry)) {
65 WARN(1, "list_del corruption. next->prev should be %p, but was %p\n",
66 entry, next->prev);
67 return false;
68 }
44 CHECK_DATA_CORRUPTION(next == LIST_POISON1,
45 "list_del corruption, %p->next is LIST_POISON1 (%p)\n",
46 entry, LIST_POISON1);
47 CHECK_DATA_CORRUPTION(prev == LIST_POISON2,
48 "list_del corruption, %p->prev is LIST_POISON2 (%p)\n",
49 entry, LIST_POISON2);
50 CHECK_DATA_CORRUPTION(prev->next != entry,
51 "list_del corruption. prev->next should be %p, but was %p\n",
52 entry, prev->next);
53 CHECK_DATA_CORRUPTION(next->prev != entry,
54 "list_del corruption. next->prev should be %p, but was %p\n",
55 entry, next->prev);
69 return true;
70
71}
72EXPORT_SYMBOL(__list_del_entry_valid);
56 return true;
57
58}
59EXPORT_SYMBOL(__list_del_entry_valid);