commit 449b29e8bd9fb1ae2e57cea7074e1b9778343455
author David Lamparter <equinox@opensourcerouting.org> Mon Jun 13 17:29:12 2016 +0200
committer Paul Jakma <paul@quagga.net> Mon Jan 23 18:51:53 2017 +0000
tree 0f4d1897e1b17123a50f7351c74006badbd232da
parent c96e78dde1f118eaee4269aa2c91ef70850e5423

lib: linklist: add listnode_add_before()

This utility function, to join the zoo that the Quagga linked-list
implementation has accumulated, does an insert-before while returning
the newly allocated node.

It is similar to:
- listnode_add_after(), but
  - complementary direction
  - returns allocated node
- list_add_node_prev(), but
  - supports before == NULL
  - returns allocated node

In general, the entire linked-list implementation is in bad shape, and
while it needs a cleanup / rewrite / replacement, this would both cause
significant conflicts and block other cleanups...

Signed-off-by: David Lamparter <equinox@opensourcerouting.org>
Signed-off-by: David Lamparter <equinox@opensourcerouting.org>

lib/linklist.c

diff --git a/lib/linklist.c b/lib/linklist.c
index 4b16f07..8b6a852 100644
--- a/lib/linklist.c
+++ b/lib/linklist.c
@@ -159,6 +159,44 @@
   list->count++;
 }
 
+struct listnode *
+listnode_add_before (struct list *list, struct listnode *pp, void *val)
+{
+  struct listnode *nn;
+
+  assert (val != NULL);
+
+  nn = listnode_new ();
+  nn->data = val;
+
+  if (pp == NULL)
+    {
+      if (list->tail)
+        list->tail->next = nn;
+      else
+        list->head = nn;
+
+      nn->prev = list->tail;
+      nn->next = pp;
+
+      list->tail = nn;
+    }
+  else
+    {
+      if (pp->prev)
+	pp->prev->next = nn;
+      else
+	list->head = nn;
+
+      nn->prev = pp->prev;
+      nn->next = pp;
+
+      pp->prev = nn;
+    }
+  list->count++;
+  return nn;
+}
+
 /* Move given listnode to tail of the list */
 void
 listnode_move_to_tail (struct list *l, struct listnode *n)

lib/linklist.h

diff --git a/lib/linklist.h b/lib/linklist.h
index 6209c8b..96aaf43 100644
--- a/lib/linklist.h
+++ b/lib/linklist.h
@@ -68,6 +68,7 @@
 extern void listnode_add (struct list *, void *);
 extern void listnode_add_sort (struct list *, void *);
 extern void listnode_add_after (struct list *, struct listnode *, void *);
+extern struct listnode *listnode_add_before (struct list *, struct listnode *, void *);
 extern void listnode_move_to_tail (struct list *, struct listnode *);
 extern void listnode_delete (struct list *, void *);
 extern struct listnode *listnode_lookup (struct list *, void *);