Home
last modified time | relevance | path

Searched refs:elm (Results 1 – 2 of 2) sorted by relevance

/utopia/UTPA2-700.0.x/projects/tools/lint/mips-linux-gnu_include/sys/
H A Dqueue.h105 #define LIST_INSERT_AFTER(listelm, elm, field) do { \ argument
106 if (((elm)->field.le_next = (listelm)->field.le_next) != NULL) \
108 &(elm)->field.le_next; \
109 (listelm)->field.le_next = (elm); \
110 (elm)->field.le_prev = &(listelm)->field.le_next; \
113 #define LIST_INSERT_BEFORE(listelm, elm, field) do { \ argument
114 (elm)->field.le_prev = (listelm)->field.le_prev; \
115 (elm)->field.le_next = (listelm); \
116 *(listelm)->field.le_prev = (elm); \
117 (listelm)->field.le_prev = &(elm)->field.le_next; \
[all …]
/utopia/UTPA2-700.0.x/projects/tools/lint/aeon_include/sys/
H A Dqueue.h138 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \ argument
139 SLIST_NEXT((elm), field) = SLIST_NEXT((slistelm), field); \
140 SLIST_NEXT((slistelm), field) = (elm); \
143 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
144 SLIST_NEXT((elm), field) = SLIST_FIRST((head)); \
145 SLIST_FIRST((head)) = (elm); \
148 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next) argument
150 #define SLIST_REMOVE(head, elm, type, field) do { \ argument
151 if (SLIST_FIRST((head)) == (elm)) { \
156 while (SLIST_NEXT(curelm, field) != (elm)) \
[all …]