Lines Matching refs:prev
22 bool __list_add_valid_or_report(struct list_head *new, struct list_head *prev,
25 if (CHECK_DATA_CORRUPTION(prev == NULL,
26 "list_add corruption. prev is NULL.\n") ||
29 CHECK_DATA_CORRUPTION(next->prev != prev,
30 "list_add corruption. next->prev should be prev (%px), but was %px. (next=%px).\n",
31 prev, next->prev, next) ||
32 CHECK_DATA_CORRUPTION(prev->next != next,
33 "list_add corruption. prev->next should be next (%px), but was %px. (prev=%px).\n",
34 next, prev->next, prev) ||
35 CHECK_DATA_CORRUPTION(new == prev || new == next,
36 "list_add double add: new=%px, prev=%px, next=%px.\n",
37 new, prev, next))
47 struct list_head *prev, *next;
49 prev = entry->prev;
54 CHECK_DATA_CORRUPTION(prev == NULL,
55 "list_del corruption, %px->prev is NULL\n", entry) ||
59 CHECK_DATA_CORRUPTION(prev == LIST_POISON2,
60 "list_del corruption, %px->prev is LIST_POISON2 (%px)\n",
62 CHECK_DATA_CORRUPTION(prev->next != entry,
63 "list_del corruption. prev->next should be %px, but was %px. (prev=%px)\n",
64 entry, prev->next, prev) ||
65 CHECK_DATA_CORRUPTION(next->prev != entry,
66 "list_del corruption. next->prev should be %px, but was %px. (next=%px)\n",
67 entry, next->prev, next))