lib: Add struct llist for lists tracking len

The DHT uses a struct {struct list_head, size_t len} pattern, which is
also useful in the registry and other places. Having a struct llist
(defined in list.h) with consistent macros for addition/deletion etc
removes a lot of duplication and boilerplate and reduces the risk of
inconsistent updates.

The list management is now a macro-only implementation.

Signed-off-by: Dimitri Staessens <dimitri@ouroboros.rocks>
Signed-off-by: Sander Vrijders <sander@ouroboros.rocks>

1 files changed, 0 insertions, 78 deletions

diff --git a/src/lib/list.c b/src/lib/list.c
deleted file mode 100644
index 9cc1e443..00000000
--- a/src/lib/list.c
+++ /dev/null
@@ -1,78 +0,0 @@
-/*
- * Ouroboros - Copyright (C) 2016 - 2026
- *
- * Simple doubly linked list implementation.
- *
- *    Dimitri Staessens <dimitri@ouroboros.rocks>
- *    Sander Vrijders   <sander@ouroboros.rocks>
- *
- * This library is free software; you can redistribute it and/or
- * modify it under the terms of the GNU Lesser General Public License
- * version 2.1 as published by the Free Software Foundation.
- *
- * This library is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
- * Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public
- * License along with this library; if not, write to the Free Software
- * Foundation, Inc., http://www.fsf.org/about/contact/.
- */
-
-#include <ouroboros/list.h>
-
-#include <stddef.h>
-
-void list_head_init(struct list_head * h)
-{
-        h->nxt = h;
-        h->prv = h;
-}
-
-static void add_list(struct list_head * n,
-                     struct list_head * prv,
-                     struct list_head * nxt)
-{
-        nxt->prv = n;
-        n->nxt = nxt;
-        n->prv = prv;
-        prv->nxt = n;
-}
-
-static void del_list(struct list_head * prv,
-                     struct list_head * nxt)
-{
-        nxt->prv = prv;
-        prv->nxt = nxt;
-}
-
-void list_add(struct list_head * n,
-              struct list_head * h)
-{
-        add_list(n, h, h->nxt);
-}
-
-void list_add_tail(struct list_head * n,
-                   struct list_head * h)
-{
-        add_list(n, h->prv, h);
-}
-
-void list_del(struct list_head * e)
-{
-        del_list(e->prv, e->nxt);
-        e->nxt = e->prv = e;
-}
-
-bool list_is_empty(const struct list_head * h)
-{
-        return h->nxt == h;
-}
-
-void list_move(struct list_head * n,
-               struct list_head * h)
-{
-        del_list(n->prv, n->nxt);
-        add_list(n, h, h->nxt);
-}