Home
last modified time | relevance | path

Searched refs:le_next (Results 1 – 9 of 9) sorted by relevance

/f-stack/dpdk/drivers/net/ice/base/
H A Dice_osdep.h334 ((type *)(entry)->field.next.le_next)
348 while (tail->next.le_next != NULL) in list_add_tail()
349 tail = tail->next.le_next; in list_add_tail()
359 (pos) = (pos)->member.next.le_next ? \
360 container_of((pos)->member.next.le_next, struct type, \
368 (tmp) = (pos) == 0 ? 0 : ((pos)->member.next.le_next ? \
369 container_of((pos)->member.next.le_next, struct type, \
374 (tmp) = (pos) == 0 ? 0 : ((tmp)->member.next.le_next ? \
375 container_of((pos)->member.next.le_next, struct type, \
/f-stack/freebsd/contrib/openzfs/module/zfs/
H A Dzap_leaf.c137 le->le_next = BSWAP_16(le->le_next); in zap_leaf_byteswap()
397 *chunkp != CHAIN_END; chunkp = &le->le_next) { in zap_leaf_lookup()
446 chunk != CHAIN_END; chunk = le->le_next) { in zap_leaf_lookup_closest()
549 *zeh->zeh_chunkp = le->le_next; in zap_entry_remove()
577 chunk != CHAIN_END; chunk = le->le_next) { in zap_entry_create()
590 chunk != CHAIN_END; chunk = le->le_next) { in zap_entry_create()
663 chunk != CHAIN_END; chunk = le->le_next) { in zap_entry_normalization_conflict()
703 *chunkp != CHAIN_END; chunkp = &le2->le_next) { in zap_leaf_rehash_entry()
709 le->le_next = *chunkp; in zap_leaf_rehash_entry()
841 chunk = le->le_next; in zap_leaf_stats()
/f-stack/tools/compat/include/sys/
H A Dqueue.h412 struct type *le_next; /* next element */ \
418 class type *le_next; /* next element */ \
437 &((elm)->field.le_next)) \
504 #define LIST_NEXT(elm, field) ((elm)->field.le_next)
509 QUEUE_TYPEOF(type), field.le_next))
512 QMD_SAVELINK(oldnext, (elm)->field.le_next); \
/f-stack/dpdk/lib/librte_eal/windows/include/sys/
H A Dqueue.h429 struct type *le_next; /* next element */ \
435 class type *le_next; /* next element */ \
466 &((elm)->field.le_next)) \
555 #define LIST_NEXT(elm, field) ((elm)->field.le_next)
560 QUEUE_TYPEOF(type), field.le_next))
563 QMD_SAVELINK(oldnext, (elm)->field.le_next); \
/f-stack/freebsd/sys/
H A Dqueue.h458 struct type *le_next; /* next element */ \
464 class type *le_next; /* next element */ \
495 &((elm)->field.le_next)) \
584 #define LIST_NEXT(elm, field) ((elm)->field.le_next)
589 QUEUE_TYPEOF(type), field.le_next))
592 QMD_SAVELINK(oldnext, (elm)->field.le_next); \
/f-stack/freebsd/netinet/
H A Din_debug.c93 IA_DB_RPINTF("%p", ia_hash.le_next); in in_show_in_ifaddr()
/f-stack/freebsd/contrib/openzfs/include/sys/
H A Dzap_leaf.h142 uint16_t le_next; /* next entry in hash chain */ member
/f-stack/freebsd/kern/
H A Dkern_exit.c114 p_orphan.le_next); in proc_realparent()
/f-stack/freebsd/netipsec/
H A Dkey.c526 (!((elm)->chain.le_next == NULL && (elm)->chain.le_prev == NULL))