Changeset 24 for branches/FREEBSD/src/kmk/lst.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.h (modified) (12 diffs)

branches/FREEBSD/src/kmk/lst.h

@@ -1 +1 @@
 /*
- * Copyright (c) 1988, 1989, 1990, 1993
- *      The Regents of the University of California.  All rights reserved.
+ * Copyright (c) 1988, 1989, 1990 The Regents of the University of California.
  * Copyright (c) 1988, 1989 by Adam de Boor
  * Copyright (c) 1989 by Berkeley Softworks
@@ -37 +36 @@
  * SUCH DAMAGE.
  *
- *      @(#)lst.h       8.2 (Berkeley) 4/28/95
- * $FreeBSD: src/usr.bin/make/lst.h,v 1.15 2002/09/17 21:29:06 jmallett Exp $
+ *      from: @(#)lst.h 8.1 (Berkeley) 6/6/93
+ * $FreeBSD: src/usr.bin/make/lst.h,v 1.9 1999/08/28 01:03:32 peter Exp $
  */
 
@@ -46 +45 @@
  */
 #ifndef _LST_H_
-#define _LST_H_
+#define _LST_H_
 
 #include        <sys/param.h>
+#ifdef __STDC__
 #include        <stdlib.h>
+#endif
 #include        "sprite.h"
 
@@ -59 +60 @@
 typedef struct  LstNode *LstNode;
 
+#define NILLST          ((Lst) NIL)
+#define NILLNODE        ((LstNode) NIL)
+
 /*
  * NOFREE can be used as the freeProc to Lst_Destroy when the elements are
@@ -64 +68 @@
  * NOCOPY performs similarly when given as the copyProc to Lst_Duplicate.
  */
-#define NOFREE          ((void (*)(void *)) 0)
-#define NOCOPY          ((void * (*)(void *)) 0)
+#define NOFREE          ((void (*) __P((ClientData))) 0)
+#define NOCOPY          ((ClientData (*) __P((ClientData))) 0)
 
-#define LST_CONCNEW     0   /* create new LstNode's when using Lst_Concat */
-#define LST_CONCLINK    1   /* relink LstNode's when using Lst_Concat */
+#define LST_CONCNEW     0   /* create new LstNode's when using Lst_Concat */
+#define LST_CONCLINK    1   /* relink LstNode's when using Lst_Concat */
 
 /*
@@ -74 +78 @@
  */
 /* Create a new list */
-Lst             Lst_Init(Boolean);
+Lst             Lst_Init __P((Boolean));
 /* Duplicate an existing list */
-Lst             Lst_Duplicate(Lst, void * (*)(void *));
+Lst             Lst_Duplicate __P((Lst, ClientData (*)(ClientData)));
 /* Destroy an old one */
-void            Lst_Destroy(Lst, void (*)(void *));
+void            Lst_Destroy __P((Lst, void (*)(ClientData)));
 /* True if list is empty */
-Boolean         Lst_IsEmpty(Lst);
+Boolean         Lst_IsEmpty __P((Lst));
 
 /*
@@ -86 +90 @@
  */
 /* Insert an element before another */
-ReturnStatus    Lst_Insert(Lst, LstNode, void *);
+ReturnStatus    Lst_Insert __P((Lst, LstNode, ClientData));
 /* Insert an element after another */
-ReturnStatus    Lst_Append(Lst, LstNode, void *);
+ReturnStatus    Lst_Append __P((Lst, LstNode, ClientData));
 /* Place an element at the front of a lst. */
-ReturnStatus    Lst_AtFront(Lst, void *);
+ReturnStatus    Lst_AtFront __P((Lst, ClientData));
 /* Place an element at the end of a lst. */
-ReturnStatus    Lst_AtEnd(Lst, void *);
+ReturnStatus    Lst_AtEnd __P((Lst, ClientData));
 /* Remove an element */
-ReturnStatus    Lst_Remove(Lst, LstNode);
+ReturnStatus    Lst_Remove __P((Lst, LstNode));
 /* Replace a node with a new value */
-ReturnStatus    Lst_Replace(LstNode, void *);
+ReturnStatus    Lst_Replace __P((LstNode, ClientData));
 /* Concatenate two lists */
-ReturnStatus    Lst_Concat(Lst, Lst, int);
+ReturnStatus    Lst_Concat __P((Lst, Lst, int));
 
 /*
@@ -104 +108 @@
  */
 /* Return first element in list */
-LstNode         Lst_First(Lst);
+LstNode         Lst_First __P((Lst));
 /* Return last element in list */
-LstNode         Lst_Last(Lst);
+LstNode         Lst_Last __P((Lst));
 /* Return successor to given element */
-LstNode         Lst_Succ(LstNode);
+LstNode         Lst_Succ __P((LstNode));
 /* Get datum from LstNode */
-void *  Lst_Datum(LstNode);
+ClientData      Lst_Datum __P((LstNode));
 
 /*
@@ -116 +120 @@
  */
 /* Find an element in a list */
-LstNode         Lst_Find(Lst, void *, int (*)(void *, void *));
+LstNode         Lst_Find __P((Lst, ClientData,
+                              int (*)(ClientData, ClientData)));
 /* Find an element starting from somewhere */
-LstNode         Lst_FindFrom(Lst, LstNode, void *, int (*cProc)(void *, void *));
+LstNode         Lst_FindFrom __P((Lst, LstNode, ClientData,
+                                  int (*cProc)(ClientData, ClientData)));
 /*
  * See if the given datum is on the list. Returns the LstNode containing
  * the datum
  */
-LstNode         Lst_Member(Lst, void *);
+LstNode         Lst_Member __P((Lst, ClientData));
 /* Apply a function to all elements of a lst */
-void            Lst_ForEach(Lst, int (*)(void *, void *), void *);
+void            Lst_ForEach __P((Lst, int (*)(ClientData, ClientData),
+                                 ClientData));
 /*
  * Apply a function to all elements of a lst starting from a certain point.
@@ -131 +138 @@
  * beginning of the list again.
  */
-void            Lst_ForEachFrom(Lst, LstNode, int (*)(void *, void *), void *);
+void            Lst_ForEachFrom __P((Lst, LstNode,
+                                     int (*)(ClientData, ClientData),
+                                     ClientData));
 /*
  * these functions are for dealing with a list as a table, of sorts.
@@ -138 +147 @@
  */
 /* Open the list */
-ReturnStatus    Lst_Open(Lst);
+ReturnStatus    Lst_Open __P((Lst));
 /* Next element please */
-LstNode         Lst_Next(Lst);
+LstNode         Lst_Next __P((Lst));
 /* Done yet? */
-Boolean         Lst_IsAtEnd(Lst);
+Boolean         Lst_IsAtEnd __P((Lst));
 /* Finish table access */
-void            Lst_Close(Lst);
+void            Lst_Close __P((Lst));
 
 /*
@@ -150 +159 @@
  */
 /* Place an element at tail of queue */
-ReturnStatus    Lst_EnQueue(Lst, void *);
+ReturnStatus    Lst_EnQueue __P((Lst, ClientData));
 /* Remove an element from head of queue */
-void *  Lst_DeQueue(Lst);
+ClientData      Lst_DeQueue __P((Lst));
 
 #endif /* _LST_H_ */