5 struct list_head *list_check(struct list_head *h, const char *abortstr)
7 struct list_node *n, *p;
10 if (h->n.next == &h->n) {
11 if (h->n.prev != &h->n) {
14 fprintf(stderr, "%s: prev corrupt in empty %p\n",
21 for (p = &h->n, n = h->n.next; n != &h->n; p = n, n = n->next) {
27 "%s: prev corrupt in node %p (%u) of %p\n",
28 abortstr, n, count, h);