Home
last modified time | relevance | path

Searched refs:elm (Results 1 – 4 of 4) sorted by relevance

/libevent-2.1.12/compat/sys/
H A Dqueue.h109 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next) argument
130 (head)->slh_first = (elm); \
160 #define LIST_NEXT(elm, field) ((elm)->field.le_next) argument
192 (head)->lh_first = (elm); \
199 (elm)->field.le_prev; \
200 *(elm)->field.le_prev = (elm)->field.le_next; \
234 #define SIMPLEQ_NEXT(elm, field) ((elm)->field.sqe_next) argument
295 #define TAILQ_NEXT(elm, field) ((elm)->field.tqe_next) argument
362 *(elm)->field.tqe_prev = (elm)->field.tqe_next; \
399 #define CIRCLEQ_NEXT(elm, field) ((elm)->field.cqe_next) argument
[all …]
/libevent-2.1.12/WIN32-Code/
H A Dtree.h75 #define SPLAY_LEFT(elm, field) (elm)->field.spe_left argument
76 #define SPLAY_RIGHT(elm, field) (elm)->field.spe_right argument
137 elm = SPLAY_RIGHT(elm, field); \
139 elm = SPLAY_LEFT(elm, field); \
313 #define RB_LEFT(elm, field) (elm)->field.rbe_left argument
521 elm = RB_RIGHT(elm, field); \
630 elm = RB_RIGHT(elm, field); \
632 elm = RB_LEFT(elm, field); \
636 elm = RB_PARENT(elm, field); \
640 elm = RB_PARENT(elm, field); \
[all …]
/libevent-2.1.12/
H A Dht-internal.h52 #define HT_FIND(name, head, elm) name##_HT_FIND((head), (elm)) argument
53 #define HT_INSERT(name, head, elm) name##_HT_INSERT((head), (elm)) argument
54 #define HT_REPLACE(name, head, elm) name##_HT_REPLACE((head), (elm)) argument
55 #define HT_REMOVE(name, head, elm) name##_HT_REMOVE((head), (elm)) argument
57 #define HT_NEXT(name, head, elm) name##_HT_NEXT((head), (elm)) argument
58 #define HT_NEXT_RMV(name, head, elm) name##_HT_NEXT_RMV((head), (elm)) argument
106 do { (elm)->field.hte_hash = hashfn(elm); } while (0)
115 (hashfn(elm))
285 *elm = (*elm)->field.hte_next; \
409 for (elm = head->hth_table[i]; elm; elm = elm->field.hte_next) { \
[all …]
H A Devent-internal.h382 #define TAILQ_NEXT(elm, field) ((elm)->field.tqe_next) argument
393 #define TAILQ_INSERT_BEFORE(listelm, elm, field) do { \ argument
394 (elm)->field.tqe_prev = (listelm)->field.tqe_prev; \
395 (elm)->field.tqe_next = (listelm); \
396 *(listelm)->field.tqe_prev = (elm); \
397 (listelm)->field.tqe_prev = &(elm)->field.tqe_next; \