Changeset 24 for branches/FREEBSD/src/kmk/lst.lib/lstInt.h

Timestamp:

Nov 26, 2002, 10:24:54 PM (23 years ago)

Author:

bird

Message:

Import of RELENG_4_7_0_RELEASE

File:

• branches/FREEBSD/src/kmk/lst.lib/lstInt.h (modified) (7 diffs)

branches/FREEBSD/src/kmk/lst.lib/lstInt.h

@@ -35 +35 @@
  *
  *      from: @(#)lstInt.h      8.1 (Berkeley) 6/6/93
- * $FreeBSD: src/usr.bin/make/lst.lib/lstInt.h,v 1.10 2002/07/15 06:57:25 jmallett Exp $
+ * $FreeBSD: src/usr.bin/make/lst.lib/lstInt.h,v 1.7 1999/08/28 01:03:53 peter Exp $
  */
 
@@ -51 +51 @@
         struct ListNode *prevPtr;   /* previous element in list */
         struct ListNode *nextPtr;   /* next in list */
-        int             useCount:8, /* Count of functions using the node.
+        short           useCount:8, /* Count of functions using the node.
                                      * node may not be deleted until count
                                      * goes to 0 */
                         flags:8;    /* Node status flags */
-        void *  datum;      /* datum associated with this element */
+        ClientData      datum;      /* datum associated with this element */
 } *ListNode;
 /*
@@ -61 +61 @@
  */
 #define LN_DELETED      0x0001      /* List node should be removed when done */
+
+#define NilListNode     ((ListNode)-1)
 
 typedef enum {
@@ -76 +78 @@
         Where           atEnd;    /* Where in the list the last access was */
         Boolean         isOpen;   /* true if list has been Lst_Open'ed */
-        ListNode        curPtr;   /* current node, if open. NULL if
+        ListNode        curPtr;   /* current node, if open. NilListNode if
                                    * *just* opened */
         ListNode        prevPtr;  /* Previous node, if open. Used by
                                    * Lst_Remove */
 } *List;
+
+#define NilList         ((List)-1)
 
 /*
@@ -92 +96 @@
  *      Return TRUE if the list l is valid
  */
-#define LstValid(l)     (((Lst)l == NULL) ? FALSE : TRUE)
+#define LstValid(l)     (((Lst)l == NILLST) ? FALSE : TRUE)
 
 /*
@@ -98 +102 @@
  *      Return TRUE if the LstNode ln is valid with respect to l
  */
-#define LstNodeValid(ln, l)     ((((LstNode)ln) == NULL) ? FALSE : TRUE)
+#define LstNodeValid(ln, l)     ((((LstNode)ln) == NILLNODE) ? FALSE : TRUE)
 
 /*
@@ -104 +108 @@
  *      TRUE if the list l is empty.
  */
-#define LstIsEmpty(l)   (((List)l)->firstPtr == NULL)
+#define LstIsEmpty(l)   (((List)l)->firstPtr == NilListNode)
 
 #endif /* _LSTINT_H_ */