Fix select/yield

[openldap] / include / ldap_queue.h

diff --git a/include/ldap_queue.h b/include/ldap_queue.h
index 32e8d2cd94ae8efc7f1ed77299d041b1adf47c15..464913c1a42843f6d23ef841c3d29d455fd235dd 100644 (file)
--- a/include/ldap_queue.h
+++ b/include/ldap_queue.h
@@ -1,5 +1,5 @@
 /*
- * Copyright 2001-2002 The OpenLDAP Foundation, Redwood City, California, USA
+ * Copyright 2001-2003 The OpenLDAP Foundation, Redwood City, California, USA
  * All rights reserved.
  *
  * Redistribution and use in source and binary forms, with or without
@@ -45,6 +45,7 @@
  *     @(#)queue.h     8.5 (Berkeley) 8/20/94
  * $FreeBSD: src/sys/sys/queue.h,v 1.32.2.5 2001/09/30 21:12:54 luigi Exp $
  */
+/* See also: ftp://ftp.cs.berkeley.edu/pub/4bsd/README.Impt.License.Change */
 
 #ifndef _LDAP_QUEUE_H_
 #define        _LDAP_QUEUE_H_
@@ -135,6 +136,9 @@ struct {                                                            \
        struct type *sle_next;  /* next element */                      \
 }
 
+#define LDAP_SLIST_ENTRY_INITIALIZER(entry)                            \
+       { NULL }
+
 /*
  * Singly-linked List functions.
  */
@@ -195,6 +199,9 @@ struct {                                                            \
        struct type *stqe_next; /* next element */                      \
 }
 
+#define LDAP_STAILQ_ENTRY_INITIALIZER(entry)                           \
+       { NULL }
+
 /*
  * Singly-linked Tail queue functions.
  */
@@ -278,6 +285,9 @@ struct {                                                            \
        struct type **le_prev;  /* address of previous next element */  \
 }
 
+#define LDAP_LIST_ENTRY_INITIALIZER(entry)                     \
+       { NULL, NULL }
+
 /*
  * List functions.
  */
@@ -342,6 +352,9 @@ struct {                                                            \
        struct type **tqe_prev; /* address of previous next element */  \
 }
 
+#define LDAP_TAILQ_ENTRY_INITIALIZER(entry)                            \
+       { NULL, NULL }
+
 /*
  * Tail queue functions.
  */
@@ -350,20 +363,26 @@ struct {                                                          \
 #define LDAP_TAILQ_FOREACH(var, head, field)                           \
        for (var = LDAP_TAILQ_FIRST(head); var; var = TAILQ_NEXT(var, field))
 
-#define LDAP_TAILQ_FOREACH_REVERSE(var, head, headname, field)         \
-       for ((var) = LDAP_TAILQ_LAST((head), headname);                 \
+#define LDAP_TAILQ_FOREACH_REVERSE(var, head, type, field)             \
+       for ((var) = LDAP_TAILQ_LAST((head), type, field);              \
             (var);                                                     \
-            (var) = LDAP_TAILQ_PREV((var), headname, field))
+            (var) = LDAP_TAILQ_PREV((var), head, type, field))
 
 #define        LDAP_TAILQ_FIRST(head) ((head)->tqh_first)
 
-#define        LDAP_TAILQ_LAST(head, headname) \
-       (*(((struct headname *)((head)->tqh_last))->tqh_last))
+#define LDAP_TAILQ_LAST(head, type, field)                             \
+       (LDAP_TAILQ_EMPTY(head) ?                                       \
+               NULL :                                                  \
+               ((struct type *)                                        \
+               ((char *)((head)->tqh_last) - offsetof(struct type, field))))
 
 #define        LDAP_TAILQ_NEXT(elm, field) ((elm)->field.tqe_next)
 
-#define LDAP_TAILQ_PREV(elm, headname, field) \
-       (*(((struct headname *)((elm)->field.tqe_prev))->tqh_last))
+#define LDAP_TAILQ_PREV(elm, head, type, field)                        \
+       ((struct type *)((elm)->field.tqe_prev) == LDAP_TAILQ_FIRST(head) ? \
+       NULL :                                                          \
+       ((struct type *)                                                \
+       ((char *)((elm)->field.tqe_prev) - offsetof(struct type, field))))
 
 #define        LDAP_TAILQ_INIT(head) do {                                      \
        (head)->tqh_first = NULL;                                       \