lib/lists.h

   1 /*
   2  *      BIRD Library -- Linked Lists
   3  *
   4  *      (c) 1998 Martin Mares <mj@ucw.cz>
   5  *
   6  *      Can be freely distributed and used under the terms of the GNU GPL.
   7  */
   8
   9 #ifndef _BIRD_LISTS_H_
  10 #define _BIRD_LISTS_H_
  11
  12 /*
  13  * I admit the list structure is very tricky and also somewhat awkward,
  14  * but it's both efficient and easy to manipulate once one understands the
  15  * basic trick: The list head always contains two synthetic nodes which are
  16  * always present in the list: the head and the tail. But as the `next'
  17  * entry of the tail and the `prev' entry of the head are both NULL, the
  18  * nodes can overlap each other:
  19  *
  20  *     head    head_node.next
  21  *     null    head_node.prev  tail_node.next
  22  *     tail                    tail_node.prev
  23  */
  24
  25 typedef struct node {
  26   struct node *next, *prev;
  27 } node;
  28
  29 typedef struct list {                   /* In fact two overlayed nodes */
  30   struct node *head, *null, *tail;
  31 } list;
  32
  33 #define NODE (node *)
  34 #define HEAD(list) ((void *)((list).head))
  35 #define TAIL(list) ((void *)((list).tail))
  36 #define NODE_NEXT(n) ((void *)((NODE (n))->next))
  37 #define NODE_VALID(n) ((NODE (n))->next)
  38 #define WALK_LIST(n,list) for(n=HEAD(list); NODE_VALID(n); n=NODE_NEXT(n))
  39 #define WALK_LIST2(n,nn,list,pos) \
  40   for(nn=(list).head; NODE_VALID(nn) && (n=SKIP_BACK(typeof(*n),pos,nn)); nn=nn->next)
  41 #define WALK_LIST_DELSAFE(n,nxt,list) \
  42      for(n=HEAD(list); nxt=NODE_NEXT(n); n=(void *) nxt)
  43 /* WALK_LIST_FIRST supposes that called code removes each processed node */
  44 #define WALK_LIST_FIRST(n,list) \
  45      while(n=HEAD(list), (NODE (n))->next)
  46 #define WALK_LIST_BACKWARDS(n,list) for(n=TAIL(list);(NODE (n))->prev; \
  47                                 n=(void *)((NODE (n))->prev))
  48 #define WALK_LIST_BACKWARDS_DELSAFE(n,prv,list) \
  49      for(n=TAIL(list); prv=(void *)((NODE (n))->prev); n=(void *) prv)
  50
  51 #define EMPTY_LIST(list) (!(list).head->next)
  52
  53
  54 #ifndef _BIRD_LISTS_C_
  55 #define LIST_INLINE static inline
  56 #include "lib/lists.c"
  57 #undef LIST_INLINE
  58
  59 #else /* _BIRD_LISTS_C_ */
  60 #define LIST_INLINE
  61 void add_tail(list *, node *);
  62 void add_head(list *, node *);
  63 void rem_node(node *);
  64 void rem2_node(node *);
  65 void add_tail_list(list *, list *);
  66 void init_list(list *);
  67 void insert_node(node *, node *);
  68 #endif
  69
  70 #endif