Home
last modified time | relevance | path

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

/freebsd/contrib/ntp/sntp/libevent/compat/sys/
H A Dqueue.h150 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 …]
/freebsd/contrib/libevent/compat/sys/
H A Dqueue.h150 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 …]
/freebsd/crypto/openssh/openbsd-compat/
H A Dsys-queue.h269 struct type *le_next; /* next element */ \
279 #define LIST_NEXT(elm, field) ((elm)->field.le_next)
299 if (((elm)->field.le_next = (listelm)->field.le_next) != NULL) \
300 (listelm)->field.le_next->field.le_prev = \
301 &(elm)->field.le_next; \
302 (listelm)->field.le_next = (elm); \
303 (elm)->field.le_prev = &(listelm)->field.le_next; \
308 (elm)->field.le_next = (listelm); \
310 (listelm)->field.le_prev = &(elm)->field.le_next; \
314 if (((elm)->field.le_next = (head)->lh_first) != NULL) \
[all …]
/freebsd/usr.bin/gencat/
H A Dgencat.c498 set = set->entries.le_next) {
502 msg = msg->entries.le_next) {
549 set = set->entries.le_next) {
553 msg = msg->entries.le_next) {
595 for (; p != NULL && p->setId < setId; q = p, p = p->entries.le_next);
635 for (; p != NULL && p->msgId < msgId; q = p, p = p->entries.le_next);
661 for (; set != NULL && set->setId < setId; set = set->entries.le_next);
686 for (; msg != NULL && msg->msgId < msgId; msg = msg->entries.le_next);
/freebsd/sys/contrib/openzfs/module/zfs/
H A Dzap_leaf.c126 le->le_next = BSWAP_16(le->le_next); in zap_leaf_byteswap()
431 *chunkp != CHAIN_END; chunkp = &le->le_next) { in zap_leaf_lookup()
480 chunk != CHAIN_END; chunk = le->le_next) { in zap_leaf_lookup_closest()
580 *zeh->zeh_chunkp = le->le_next; in zap_entry_remove()
612 chunk != CHAIN_END; chunk = le->le_next) { in zap_entry_create()
625 chunk != CHAIN_END; chunk = le->le_next) { in zap_entry_create()
698 chunk != CHAIN_END; chunk = le->le_next) { in zap_entry_normalization_conflict()
737 *chunkp != CHAIN_END; chunkp = &le2->le_next) { in zap_leaf_rehash_entry()
743 le->le_next = *chunkp; in zap_leaf_rehash_entry()
849 chunk = le->le_next; in zap_leaf_stats()
/freebsd/sys/sys/
H A Dqueue.h509 struct type *le_next; /* next element */ \
515 class type *le_next; /* next element */ \
546 &((elm)->field.le_next)) \
638 #define LIST_NEXT(elm, field) ((elm)->field.le_next)
643 QUEUE_TYPEOF(type), field.le_next))
649 QMD_SAVELINK(oldnext, (elm)->field.le_next); \
662 QMD_SAVELINK(oldnext, (elm)->field.le_next); \
669 &(elm2)->field.le_next; \
/freebsd/contrib/libarchive/unzip/
H A Dla_queue.h428 struct type *le_next; /* next element */ \
434 class type *le_next; /* next element */ \
465 &((elm)->field.le_next)) \
554 #define LIST_NEXT(elm, field) ((elm)->field.le_next)
559 QUEUE_TYPEOF(type), field.le_next))
562 QMD_SAVELINK(oldnext, (elm)->field.le_next); \
/freebsd/contrib/openbsm/compat/
H A Dqueue.h322 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); \
/freebsd/contrib/ntp/sntp/libevent/include/event2/
H A Devent_struct.h92 struct type *le_next; /* next element */ \
/freebsd/contrib/libevent/include/event2/
H A Devent_struct.h92 struct type *le_next; /* next element */ \
/freebsd/sys/fs/nfs/
H A Dnfs.h804 (lelm)->field.le_next = (head)->lh_first; \
805 (lelm)->field.le_next->field.le_prev = \
806 &(lelm)->field.le_next; \
/freebsd/tools/debugscripts/
H A Dgdbinit.i386244 set $aproc = $proc.p_list.le_next
285 set $aproc = $proc.p_list.le_next
328 set $aproc = $proc.p_list.le_next
H A Dgdbinit.kernel226 set $aproc = $proc.p_list.le_next
271 set $proc = $proc.p_list.le_next
/freebsd/sys/contrib/openzfs/include/sys/
H A Dzap_leaf.h142 uint16_t le_next; /* next entry in hash chain */ member
/freebsd/usr.sbin/makefs/zfs/
H A Dzap.c449 lptr = &le->le_next; in zap_fat_write()
493 le->le_next = 0xffff; in zap_fat_write()
/freebsd/sys/fs/unionfs/
H A Dunion_subr.c242 unp->un_hash.le_next = NULL; in unionfs_rem_cached_vnode()
526 unp_t1->un_hash.le_next = NULL; in unionfs_noderem()
/freebsd/usr.sbin/ifmcstat/
H A Difmcstat.c518 return (multi.in6m_entry.le_next); in in6_multientry()
/freebsd/sys/kern/
H A Dkern_exit.c121 p_orphan.le_next); in proc_realparent()
/freebsd/sys/cddl/boot/zfs/
H A Dzfsimpl.h1720 uint16_t le_next; /* next entry in hash chain */ member
/freebsd/stand/libsa/zfs/
H A Dzfsimpl.c2662 *chunkp != CHAIN_END; chunkp = &le->le_next) { in zap_leaf_lookup()
/freebsd/sys/netipsec/
H A Dkey.c555 (!((elm)->chain.le_next == NULL && (elm)->chain.le_prev == NULL))