Searched refs:le_next (Results 1 – 8 of 8) sorted by relevance
150 struct type *le_next; /* next element */ \160 #define LIST_NEXT(elm, field) ((elm)->field.le_next)175 if (((elm)->field.le_next = (listelm)->field.le_next) != NULL) \176 (listelm)->field.le_next->field.le_prev = \177 &(elm)->field.le_next; \178 (listelm)->field.le_next = (elm); \179 (elm)->field.le_prev = &(listelm)->field.le_next; \184 (elm)->field.le_next = (listelm); \186 (listelm)->field.le_prev = &(elm)->field.le_next; \190 if (((elm)->field.le_next = (head)->lh_first) != NULL) \[all …]
177 struct type *le_next; /* next element */ \187 #define LIST_NEXT(elm, field) ((elm)->field.le_next)202 if (((elm)->field.le_next = (listelm)->field.le_next) != NULL) \203 (listelm)->field.le_next->field.le_prev = \204 &(elm)->field.le_next; \205 (listelm)->field.le_next = (elm); \206 (elm)->field.le_prev = &(listelm)->field.le_next; \211 (elm)->field.le_next = (listelm); \213 (listelm)->field.le_prev = &(elm)->field.le_next; \217 if (((elm)->field.le_next = (head)->lh_first) != NULL) \[all …]
262 struct type *le_next; /* next element */ \272 #define LIST_NEXT(elm, field) ((elm)->field.le_next)292 if (((elm)->field.le_next = (listelm)->field.le_next) != NULL) \293 (listelm)->field.le_next->field.le_prev = \294 &(elm)->field.le_next; \295 (listelm)->field.le_next = (elm); \296 (elm)->field.le_prev = &(listelm)->field.le_next; \301 (elm)->field.le_next = (listelm); \303 (listelm)->field.le_prev = &(elm)->field.le_next; \307 if (((elm)->field.le_next = (head)->lh_first) != NULL) \[all …]
67 uint16_t le_next; /* next entry in hash chain */ member
92 struct type *le_next; /* next element */ \
265 struct type *le_next; /* next element */ \308 #define LIST_NEXT(elm, field) ((elm)->field.le_next)
61 #define LIST_NEXT(elm, field) ((elm)->field.le_next)
835 chunk != CHAIN_END; chunk = le->le_next) { in zap_leaf_lookup()