Commit | Line | Data |
---|---|---|
199a9afc DJ |
1 | /* |
2 | * Copyright 2006, Red Hat, Inc., Dave Jones | |
3 | * Released under the General Public License (GPL). | |
4 | * | |
aebc7b0d ME |
5 | * This file contains the linked list validation and error reporting for |
6 | * LIST_HARDENED and DEBUG_LIST. | |
199a9afc DJ |
7 | */ |
8 | ||
8bc3bcc9 | 9 | #include <linux/export.h> |
199a9afc | 10 | #include <linux/list.h> |
50af5ead | 11 | #include <linux/bug.h> |
b116ee4d | 12 | #include <linux/kernel.h> |
559f9bad | 13 | #include <linux/rculist.h> |
199a9afc DJ |
14 | |
15 | /* | |
d7c81673 KC |
16 | * Check that the data structures for the list manipulations are reasonably |
17 | * valid. Failures here indicate memory corruption (and possibly an exploit | |
18 | * attempt). | |
199a9afc DJ |
19 | */ |
20 | ||
aebc7b0d | 21 | __list_valid_slowpath |
b16c42c8 ME |
22 | bool __list_add_valid_or_report(struct list_head *new, struct list_head *prev, |
23 | struct list_head *next) | |
199a9afc | 24 | { |
0cc011c5 GR |
25 | if (CHECK_DATA_CORRUPTION(prev == NULL, |
26 | "list_add corruption. prev is NULL.\n") || | |
27 | CHECK_DATA_CORRUPTION(next == NULL, | |
28 | "list_add corruption. next is NULL.\n") || | |
29 | CHECK_DATA_CORRUPTION(next->prev != prev, | |
68c1f082 | 30 | "list_add corruption. next->prev should be prev (%px), but was %px. (next=%px).\n", |
85caa95b KC |
31 | prev, next->prev, next) || |
32 | CHECK_DATA_CORRUPTION(prev->next != next, | |
68c1f082 | 33 | "list_add corruption. prev->next should be next (%px), but was %px. (prev=%px).\n", |
85caa95b KC |
34 | next, prev->next, prev) || |
35 | CHECK_DATA_CORRUPTION(new == prev || new == next, | |
68c1f082 | 36 | "list_add double add: new=%px, prev=%px, next=%px.\n", |
85caa95b KC |
37 | new, prev, next)) |
38 | return false; | |
de54ebbe | 39 | |
d7c81673 | 40 | return true; |
199a9afc | 41 | } |
b16c42c8 | 42 | EXPORT_SYMBOL(__list_add_valid_or_report); |
199a9afc | 43 | |
aebc7b0d | 44 | __list_valid_slowpath |
b16c42c8 | 45 | bool __list_del_entry_valid_or_report(struct list_head *entry) |
3c18d4de LT |
46 | { |
47 | struct list_head *prev, *next; | |
48 | ||
49 | prev = entry->prev; | |
50 | next = entry->next; | |
51 | ||
0cc011c5 GR |
52 | if (CHECK_DATA_CORRUPTION(next == NULL, |
53 | "list_del corruption, %px->next is NULL\n", entry) || | |
54 | CHECK_DATA_CORRUPTION(prev == NULL, | |
55 | "list_del corruption, %px->prev is NULL\n", entry) || | |
56 | CHECK_DATA_CORRUPTION(next == LIST_POISON1, | |
68c1f082 | 57 | "list_del corruption, %px->next is LIST_POISON1 (%px)\n", |
85caa95b KC |
58 | entry, LIST_POISON1) || |
59 | CHECK_DATA_CORRUPTION(prev == LIST_POISON2, | |
68c1f082 | 60 | "list_del corruption, %px->prev is LIST_POISON2 (%px)\n", |
85caa95b KC |
61 | entry, LIST_POISON2) || |
62 | CHECK_DATA_CORRUPTION(prev->next != entry, | |
a31f9336 ZL |
63 | "list_del corruption. prev->next should be %px, but was %px. (prev=%px)\n", |
64 | entry, prev->next, prev) || | |
85caa95b | 65 | CHECK_DATA_CORRUPTION(next->prev != entry, |
a31f9336 ZL |
66 | "list_del corruption. next->prev should be %px, but was %px. (next=%px)\n", |
67 | entry, next->prev, next)) | |
85caa95b KC |
68 | return false; |
69 | ||
0cd340dc | 70 | return true; |
199a9afc | 71 | } |
b16c42c8 | 72 | EXPORT_SYMBOL(__list_del_entry_valid_or_report); |