H A D | queue.h | 134 #define SLIST_FOREACH(var, head, field) \ argument 137 (var) = SLIST_NEXT((var), field)) 143 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \ argument 144 SLIST_NEXT((elm), field) = SLIST_NEXT((slistelm), field); \ 145 SLIST_NEXT((slistelm), field) = (elm); \ 148 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument 149 SLIST_NEXT((elm), field) = SLIST_FIRST((head)); \ 153 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next) argument 155 #define SLIST_REMOVE(head, elm, type, field) do { \ argument 157 SLIST_REMOVE_HEAD((head), field); \ [all …]
|