Searched refs:le_next (Results 1 – 15 of 15) sorted by relevance
87 struct type *le_next; /* next element */ \92 #define LIST_NEXT(elm, field) ((elm)->field.le_next)103 if (((elm)->field.le_next = (listelm)->field.le_next) != NULL) \104 (listelm)->field.le_next->field.le_prev = \105 &(elm)->field.le_next; \106 (listelm)->field.le_next = (elm); \107 (elm)->field.le_prev = &(listelm)->field.le_next; \112 (elm)->field.le_next = (listelm); \114 (listelm)->field.le_prev = &(elm)->field.le_next; \118 if (((elm)->field.le_next = (head)->lh_first) != NULL) \[all …]
92 struct type *le_next; /* next element */ \104 if (((elm)->field.le_next = (listelm)->field.le_next) != NULL) \105 (listelm)->field.le_next->field.le_prev = \106 &(elm)->field.le_next; \107 (listelm)->field.le_next = (elm); \108 (elm)->field.le_prev = &(listelm)->field.le_next; \112 if (((elm)->field.le_next = (head)->lh_first) != NULL) \113 (head)->lh_first->field.le_prev = &(elm)->field.le_next;\119 if ((elm)->field.le_next != NULL) \120 (elm)->field.le_next->field.le_prev = \[all …]
253 struct type *le_next; /* next element */ \263 #define LIST_NEXT(elm, field) ((elm)->field.le_next)278 if (((elm)->field.le_next = (listelm)->field.le_next) != NULL) \279 (listelm)->field.le_next->field.le_prev = \280 &(elm)->field.le_next; \281 (listelm)->field.le_next = (elm); \282 (elm)->field.le_prev = &(listelm)->field.le_next; \287 (elm)->field.le_next = (listelm); \289 (listelm)->field.le_prev = &(elm)->field.le_next; \293 if (((elm)->field.le_next = (head)->lh_first) != NULL) \[all …]
106 struct type *le_next; /* next element */ \119 if ((elm)->field.le_next && \120 (elm)->field.le_next->field.le_prev != \121 &(elm)->field.le_next) \126 (elm)->field.le_next = (void *)1L; \141 if (((elm)->field.le_next = (listelm)->field.le_next) != NULL) \142 (listelm)->field.le_next->field.le_prev = \143 &(elm)->field.le_next; \144 (listelm)->field.le_next = (elm); \145 (elm)->field.le_prev = &(listelm)->field.le_next; \[all …]
121 struct ldi_event *le_next; member
137 le->le_next = BSWAP_16(le->le_next); in zap_leaf_byteswap()408 *chunkp != CHAIN_END; chunkp = &le->le_next) { in zap_leaf_lookup()468 chunk != CHAIN_END; chunk = le->le_next) { in zap_leaf_lookup_closest()574 *zeh->zeh_chunkp = le->le_next; in zap_entry_remove()605 chunk != CHAIN_END; chunk = le->le_next) { in zap_entry_create()618 chunk != CHAIN_END; chunk = le->le_next) { in zap_entry_create()692 chunk != CHAIN_END; chunk = le->le_next) { in zap_entry_normalization_conflict()732 *chunkp != CHAIN_END; chunkp = &le2->le_next) { in zap_leaf_rehash_entry()738 le->le_next = *chunkp; in zap_leaf_rehash_entry()876 chunk = le->le_next; in zap_leaf_stats()
243 for (p = hp->head.lh_first; p != NULL; p = p->links.le_next)313 for (p = hp->head.lh_first; p != NULL; p = p->links.le_next)
82 uint16_t le_next; /* next entry in hash chain */ member
322 struct type *le_next; /* next element */ \341 &((elm)->field.le_next)) \398 #define LIST_NEXT(elm, field) ((elm)->field.le_next)407 TRASHIT((elm)->field.le_next); \
135 uint16_t le_next; /* next entry in hash chain */ member
480 lep->le_next = lhp->lh_events; in handle_event_add()495 lep->le_prev->le_next = lep->le_next; in handle_event_remove()496 if (lep->le_next) in handle_event_remove()497 lep->le_next->le_prev = lep->le_prev; in handle_event_remove()499 lhp->lh_events = lep->le_next; in handle_event_remove()
95 for ((var) = (head)->lh_first; (var); (var) = (var)->field.le_next)
673 chunk != CHAIN_END; chunk = le->le_next) { in zap_leaf_lookup()
828 : le_next ( le -- n ) h# 2 +le ;909 r> le_next ( xt dn ch# )
663 zlc->l_entry.le_next); in zap_leaf()