14 /* Securely fee single-linked list */
15 #define FREE_SLIST(l, type) do { \
16 type *walk = SLIST_FIRST(l); \
17 while (!SLIST_EMPTY(l)) { \
18 SLIST_REMOVE_HEAD(l, slist); \
20 walk = SLIST_FIRST(l); \
26 /* Securely fee tail-queues */
27 #define FREE_TAILQ(l, type) do { \
28 type *walk = TAILQ_FIRST(l); \
29 while (!TAILQ_EMPTY(l)) { \
30 TAILQ_REMOVE(l, TAILQ_FIRST(l), tailq); \
32 walk = TAILQ_FIRST(l); \