2 * Copyright (c) 2007, 2010 Todd C. Miller <Todd.Miller@courtesan.com>
4 * Permission to use, copy, modify, and distribute this software for any
5 * purpose with or without fee is hereby granted, provided that the above
6 * copyright notice and this permission notice appear in all copies.
8 * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
9 * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
10 * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
11 * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
12 * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
13 * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
14 * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
21 * Convenience macro for declaring a list head.
23 #define TQ_DECLARE(n) \
30 * Foreach loops: forward and reverse
33 #define tq_foreach_fwd(h, v) \
34 for ((v) = (h)->first; (v) != NULL; (v) = (v)->next)
37 #define tq_foreach_rev(h, v) \
38 for ((v) = (h)->last; (v) != NULL; (v) = (v)->prev)
44 #define tq_init(h) do { \
50 * Simple macros to avoid exposing first/last and prev/next.
53 #define tq_empty(h) ((h)->first == NULL)
56 #define tq_first(h) ((h)->first)
59 #define tq_last(h) ((h)->last)
62 #define list_next(e) ((e)->next)
65 #define list_prev(e) ((e)->prev)
68 * Prototypes for list.c
71 void tq_append(void *, void *);
72 void tq_remove(void *, void *);
73 void list_append(void *, void *);
74 void list2tq(void *, void *);
76 #endif /* _SUDO_LIST_H */