vpdf/system/dlist.h

   1 #ifndef __DLIST_H__
   2 #define __DLIST_H__
   3
   4 /* dlist.h - linked list routines by Harry Sintonen <sintonen@iki.fi>
   5
   6    faster swapnodes() by Jamie van den Berge <entity@vapor.com>
   7    mergesortlist() by Fabio Alemagna <falemagn@aros.org>
   8
   9    MinList.c and MinList.h are public domain as long name of all contributers
  10    still appear in both files.
  11 */
  12
  13 #include <stdio.h>
  14 #include <exec/lists.h>
  15
  16 #if 0
  17 struct dnode
  18 {
  19         struct dnode *n_succ;
  20         struct dnode *n_pred;
  21 };
  22
  23 struct dlist
  24 {
  25         struct dnode *l_head;
  26         struct dnode *l_tail;
  27         struct dnode *l_tailpred;
  28 };
  29 #endif
  30
  31 /* callback function type for callfornode()
  32 */
  33 typedef int (*LISTFUNCPTR) (struct MinNode *, void *);
  34
  35 /* return value for LISTFUNCPTR:
  36 */
  37 #define LFR_CONTINUE    0   /* continue list travelsal */
  38 #define LFR_BREAK       1   /* stop list travelsal and return current node */
  39
  40 /* flags for callfornode()
  41 */
  42 #define CFNF_BACKWARDS  (1 << 0)
  43
  44 /* callback function type for qsortlist()
  45 */
  46 typedef int (*COMPARFUNCPTR) (struct MinNode*, struct MinNode *);
  47
  48
  49 #ifdef USE_QSL_ALL
  50
  51 /* use this as qsortlist() nmemb to sort all nodes from base
  52 */
  53 #define QSL_ALL         0xffffffff
  54
  55 #endif
  56
  57
  58 #define LISTEMPTY(l) \
  59 ((l)->mlh_TailPred == (struct MinNode *) (l))
  60
  61 #define CNEWLIST(l) \
  62 {(struct MinNode *) &(l)->mlh_Tail, NULL, (struct MinNode *) &(l)->mlh_Head}
  63
  64
  65 #ifdef __cplusplus
  66 extern "C" {
  67 #endif
  68
  69
  70 void newlist(
  71         struct MinList *l);
  72
  73 void addhead(
  74         struct MinList *l,
  75         struct MinNode *n);
  76
  77 void addtail(
  78         struct MinList *l,
  79         struct MinNode *n);
  80
  81 void insert(
  82         struct MinList *l,
  83         struct MinNode *n,
  84         struct MinNode *afterof);
  85
  86 struct MinNode *remhead(
  87         struct MinList *l);
  88
  89 struct MinNode *remtail(
  90         struct MinList *l);
  91
  92 void remnode(
  93         struct MinNode *n);
  94
  95 struct MinNode *finMinNode(
  96         struct MinList *l,
  97         struct MinNode *n);
  98
  99 struct MinNode *callfornode(
 100         struct MinList *l,
 101         LISTFUNCPTR func,
 102         void *userdata,
 103         unsigned long int flags);
 104
 105 void qsortlist(
 106         struct MinList *l,
 107         struct MinNode *base,
 108         unsigned long int nmemb,
 109         COMPARFUNCPTR compar);
 110
 111 void mergesortlist(
 112         struct MinList *l,
 113         COMPARFUNCPTR compar);
 114
 115 #ifdef __cplusplus
 116 } // extern "C"
 117 #endif
 118
 119 #endif /* __DLIST_H__ */