+/* Licensed under LGPLv2.1+ - see LICENSE file for details */
#include <stdio.h>
#include <stdlib.h>
-#include "list/list.h"
+#include "list.h"
-struct list_head *list_check(struct list_head *h, const char *abortstr)
+static void *corrupt(const char *abortstr,
+ const struct list_node *head,
+ const struct list_node *node,
+ unsigned int count)
{
- struct list_node *n, *p;
- int count = 0;
-
- if (h->n.next == &h->n) {
- if (h->n.prev != &h->n) {
- if (!abortstr)
- return NULL;
- fprintf(stderr, "%s: prev corrupt in empty %p\n",
- abortstr, h);
- abort();
- }
- return h;
+ if (abortstr) {
+ fprintf(stderr,
+ "%s: prev corrupt in node %p (%u) of %p\n",
+ abortstr, node, count, head);
+ abort();
}
+ return NULL;
+}
+
+struct list_node *list_check_node(const struct list_node *node,
+ const char *abortstr)
+{
+ const struct list_node *p, *n;
+ int count = 0;
- for (p = &h->n, n = h->n.next; n != &h->n; p = n, n = n->next) {
+ for (p = node, n = node->next; n != node; p = n, n = n->next) {
count++;
- if (n->prev != p) {
- if (!abortstr)
- return NULL;
- fprintf(stderr,
- "%s: prev corrupt in node %p (%u) of %p\n",
- abortstr, n, count, h);
- abort();
- }
+ if (n->prev != p)
+ return corrupt(abortstr, node, n, count);
}
- return h;
+ /* Check prev on head node. */
+ if (node->prev != p)
+ return corrupt(abortstr, node, node, 0);
+
+ return (struct list_node *)node;
+}
+
+struct list_head *list_check(const struct list_head *h, const char *abortstr)
+{
+ if (!list_check_node(&h->n, abortstr))
+ return NULL;
+ return (struct list_head *)h;
}