Searched refs:le_next (Results 1 – 9 of 9) sorted by relevance
191 struct type *le_next; /* next element */ \201 #define LIST_NEXT(elm, field) ((elm)->field.le_next)206 (var) = ((var)->field.le_next))232 if ((elm)->field.le_next && \233 (elm)->field.le_next->field.le_prev != \234 &(elm)->field.le_next) \241 (elm)->field.le_next = (void *)1L; \255 if (((elm)->field.le_next = (listelm)->field.le_next) != \257 (listelm)->field.le_next->field.le_prev = \258 &(elm)->field.le_next; \[all …]
94 struct type *le_next; /* next element */ \106 if (((elm)->field.le_next = (listelm)->field.le_next) != NULL) \107 (listelm)->field.le_next->field.le_prev = \108 &(elm)->field.le_next; \109 (listelm)->field.le_next = (elm); \110 (elm)->field.le_prev = &(listelm)->field.le_next; \115 (elm)->field.le_next = (listelm); \117 (listelm)->field.le_prev = &(elm)->field.le_next; \121 if (((elm)->field.le_next = (head)->lh_first) != NULL) \122 (head)->lh_first->field.le_prev = &(elm)->field.le_next;\[all …]
98 struct type *le_next; /* next element */ \111 if ((elm)->field.le_next && \112 (elm)->field.le_next->field.le_prev != \113 &(elm)->field.le_next) \118 (elm)->field.le_next = (void *)1L; \132 if (((elm)->field.le_next = (listelm)->field.le_next) != NULL) \133 (listelm)->field.le_next->field.le_prev = \134 &(elm)->field.le_next; \135 (listelm)->field.le_next = (elm); \136 (elm)->field.le_prev = &(listelm)->field.le_next; \[all …]
99 struct type *le_next; /* next element */ \112 if ((elm)->field.le_next && \113 (elm)->field.le_next->field.le_prev != \114 &(elm)->field.le_next) \119 (elm)->field.le_next = (void *)1L; \133 if (((elm)->field.le_next = (listelm)->field.le_next) != NULL) \134 (listelm)->field.le_next->field.le_prev = \135 &(elm)->field.le_next; \136 (listelm)->field.le_next = (elm); \137 (elm)->field.le_prev = &(listelm)->field.le_next; \[all …]
68 uint16_t le_next; /* next entry in hash chain */ member
259 struct type *le_next; /* next element */ \302 #define LIST_NEXT(elm, field) ((elm)->field.le_next)
836 chunk != CHAIN_END; chunk = le->le_next) { in zap_leaf_lookup()