test/uae/lists.h

   1 #ifndef EXEC_LISTS_H
   2 #define EXEC_LISTS_H
   3 /* Copyright © 1995, The AROS Development Team. All rights reserved. */
   4
   5 /******************************************************************************
   6
   7     FILE
   8         $Id$
   9
  10     DESCRIPTION
  11         Prototypes and macros for exec-lists.
  12
  13 ******************************************************************************/
  14
  15 /**************************************
  16                 Includes
  17 **************************************/
  18 #ifndef EXEC_NODES_H
  19 #   include "nodes.h"
  20 #endif
  21
  22
  23 class ListPtr : public APTR
  24 {
  25 public:
  26     inline struct List * operator -> ()
  27     {
  28         return (struct List *) ntohl (data);
  29     }
  30
  31     inline operator struct List * ()
  32     {
  33         return (struct List *) ntohl (data);
  34     }
  35
  36     inline operator struct MinList * ()
  37     {
  38         return (struct MinList *) ntohl (data);
  39     }
  40
  41     inline operator void * ()
  42     {
  43         return (void *) ntohl (data);
  44     }
  45
  46     inline operator struct Node * ()
  47     {
  48         return (struct Node *) ntohl (data);
  49     }
  50
  51     inline ListPtr (struct List * v)
  52     {
  53         data = htonl ((long)v);
  54     }
  55
  56     inline ListPtr ()
  57     {
  58         return;
  59     }
  60 };
  61
  62 class MinListPtr : public APTR
  63 {
  64 public:
  65     inline struct MinList * operator -> ()
  66     {
  67         return (struct MinList *) ntohl (data);
  68     }
  69
  70     inline operator struct MinList * ()
  71     {
  72         return (struct MinList *) ntohl (data);
  73     }
  74
  75     inline MinListPtr (struct MinList * v)
  76     {
  77         data = htonl ((long)v);
  78     }
  79 };
  80
  81 /**************************************
  82                Structures
  83 **************************************/
  84 /* Normal list */
  85 struct List
  86 {
  87     NodePtr lh_Head,
  88             lh_Tail,
  89             lh_TailPred;
  90     UBYTE   lh_Type;
  91     UBYTE   l_pad;
  92
  93     inline List () { return; }
  94 };
  95
  96 /* Minimal list */
  97 struct MinList
  98 {
  99     MinNodePtr mlh_Head,
 100                mlh_Tail,
 101                mlh_TailPred;
 102
 103     inline MinList () { return; }
 104 };
 105
 106
 107 /**************************************
 108                Makros
 109 **************************************/
 110 #define IsListEmpty(l) \
 111         ( (((struct List *)l)->lh_TailPred) == (struct Node *)(l) )
 112
 113 #define IsMsgPortEmpty(mp) \
 114       ( (((struct MsgPort *)mp)->mp_MsgList.lh_TailPred) \
 115             == (struct Node *)(&(((struct MsgPort *)mp)->mp_MsgList)) )
 116
 117 #   define NEWLIST(l)       (((struct List *)l)->lh_TailPred \
 118                                 = (struct Node *)(l), \
 119                             ((struct List *)l)->lh_Tail = 0, \
 120                             ((struct List *)l)->lh_Head \
 121                                 = (struct Node *)\
 122                                     &(((struct List *)l)->lh_Tail))
 123
 124 #   define ADDHEAD(l,n)     ((void)(\
 125         ((struct Node *)n)->ln_Succ          = ((struct List *)l)->lh_Head, \
 126         ((struct Node *)n)->ln_Pred          = (struct Node *)&((struct List *)l)->lh_Head, \
 127         ((struct Node *)((struct List *)l)->lh_Head)->ln_Pred = ((struct Node *)n), \
 128         ((struct List *)l)->lh_Head          = ((struct Node *)n)))
 129
 130 #   define ADDTAIL(l,n)     ((void)(\
 131         ((struct Node *)n)->ln_Succ              = (struct Node *)&((struct List *)l)->lh_Tail, \
 132         ((struct Node *)n)->ln_Pred              = ((struct List *)l)->lh_TailPred, \
 133         ((struct List *)l)->lh_TailPred->ln_Succ = ((struct Node *)n), \
 134         ((struct List *)l)->lh_TailPred          = ((struct Node *)n) ))
 135
 136 #   define REMOVE(n)        ((void)(\
 137         ((struct Node *)n)->ln_Pred->ln_Succ = ((struct Node *)n)->ln_Succ,\
 138         ((struct Node *)n)->ln_Succ->ln_Pred = ((struct Node *)n)->ln_Pred ))
 139
 140 #   define GetHead(l)       (void *)(((struct List *)l)->lh_Head->ln_Succ \
 141                                 ? ((struct List *)l)->lh_Head \
 142                                 : (struct Node *)0)
 143 #   define GetTail(l)       (void *)(((struct List *)l)->lh_TailPred->ln_Pred \
 144                                 ? ((struct List *)l)->lh_TailPred \
 145                                 : (struct Node *)0)
 146 #   define GetSucc(n)       (void *)(((struct Node *)n)->ln_Succ->ln_Succ \
 147                                 ? ((struct Node *)n)->ln_Succ \
 148                                 : (struct Node *)0)
 149 #   define GetPred(n)       (void *)(((struct Node *)n)->ln_Pred->ln_Pred \
 150                                 ? ((struct Node *)n)->ln_Pred \
 151                                 : (struct Node *)0)
 152 #   define ForeachNode(l,n) \
 153         for (n=(void *)(((struct List *)(l))->lh_Head); \
 154             ((struct Node *)(n))->ln_Succ; \
 155             n=(void *)(((struct Node *)(n))->ln_Succ))
 156
 157 #   define ForeachNodeSafe(l,n,n2) \
 158         for (n=(void *)(((struct List *)(l))->lh_Head); \
 159             (n2=(void *)((struct Node *)(n))->ln_Succ); \
 160             n=(void *)n2)
 161
 162 #   define SetNodeName(node,name)   \
 163         (((struct Node *)(node))->ln_Name = (char *)(name))
 164 #   define GetNodeName(node)        \
 165         (((struct Node *)(node))->ln_Name
 166
 167 #   define ListLength(list,count)   \
 168         do {                                \
 169             struct Node * n;                \
 170             count = 0;                      \
 171             ForeachNode (list,n) count ++;  \
 172         } while (0)
 173
 174
 175
 176 /******************************************************************************
 177 *****  ENDE exec/lists.h
 178 ******************************************************************************/
 179
 180 #endif /* EXEC_LISTS_H */