Home
last modified time | relevance | path

Searched defs:elm (Results 1 – 24 of 24) sorted by relevance

/external/libevent/compat/sys/
Dqueue.h109 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next) argument
123 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \ argument
128 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
160 #define LIST_NEXT(elm, field) ((elm)->field.le_next) argument
174 #define LIST_INSERT_AFTER(listelm, elm, field) do { \ argument
182 #define LIST_INSERT_BEFORE(listelm, elm, field) do { \ argument
189 #define LIST_INSERT_HEAD(head, elm, field) do { \ argument
196 #define LIST_REMOVE(elm, field) do { \ argument
203 #define LIST_REPLACE(elm, elm2, field) do { \ argument
234 #define SIMPLEQ_NEXT(elm, field) ((elm)->field.sqe_next) argument
[all …]
/external/cronet/third_party/libevent/compat/sys/
Dqueue.h109 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next) argument
123 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \ argument
128 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
160 #define LIST_NEXT(elm, field) ((elm)->field.le_next) argument
174 #define LIST_INSERT_AFTER(listelm, elm, field) do { \ argument
182 #define LIST_INSERT_BEFORE(listelm, elm, field) do { \ argument
189 #define LIST_INSERT_HEAD(head, elm, field) do { \ argument
196 #define LIST_REMOVE(elm, field) do { \ argument
203 #define LIST_REPLACE(elm, elm2, field) do { \ argument
234 #define SIMPLEQ_NEXT(elm, field) ((elm)->field.sqe_next) argument
[all …]
/external/libiio/src/iiod/
Dqueue.h105 #define LIST_INSERT_AFTER(listelm, elm, field) do { \ argument
113 #define LIST_INSERT_BEFORE(listelm, elm, field) do { \ argument
120 #define LIST_INSERT_HEAD(head, elm, field) do { \ argument
127 #define LIST_REMOVE(elm, field) do { \ argument
144 #define LIST_NEXT(elm, field) ((elm)->field.le_next) argument
170 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \ argument
175 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
184 #define SLIST_REMOVE(head, elm, type, field) do { \ argument
205 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next) argument
233 #define STAILQ_INSERT_HEAD(head, elm, field) do { \ argument
[all …]
/external/iperf3/src/
Dqueue.h113 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next) argument
132 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \ argument
137 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
142 #define SLIST_REMOVE_NEXT(head, elm, field) do { \ argument
150 #define SLIST_REMOVE(head, elm, type, field) do { \ argument
187 #define LIST_NEXT(elm, field) ((elm)->field.le_next) argument
201 #define LIST_INSERT_AFTER(listelm, elm, field) do { \ argument
209 #define LIST_INSERT_BEFORE(listelm, elm, field) do { \ argument
216 #define LIST_INSERT_HEAD(head, elm, field) do { \ argument
223 #define LIST_REMOVE(elm, field) do { \ argument
[all …]
/external/libevent/
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
105 #define HT_SET_HASH_(elm, field, hashfn) \ argument
107 #define HT_SET_HASHVAL_(elm, field, val) \ argument
109 #define HT_ELT_HASH_(elm, field, hashfn) \ argument
112 #define HT_SET_HASH_(elm, field, hashfn) \ argument
[all …]
Devent-internal.h382 #define TAILQ_NEXT(elm, field) ((elm)->field.tqe_next) argument
393 #define TAILQ_INSERT_BEFORE(listelm, elm, field) do { \ argument
/external/ipsec-tools/src/include-glibc/sys/
Dqueue.h138 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \ argument
143 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
148 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next) argument
150 #define SLIST_REMOVE(head, elm, type, field) do { \ argument
201 #define STAILQ_INSERT_AFTER(head, tqelm, elm, field) do { \ argument
207 #define STAILQ_INSERT_HEAD(head, elm, field) do { \ argument
213 #define STAILQ_INSERT_TAIL(head, elm, field) do { \ argument
225 #define STAILQ_NEXT(elm, field) ((elm)->field.stqe_next) argument
227 #define STAILQ_REMOVE(head, elm, type, field) do { \ argument
247 #define STAILQ_REMOVE_HEAD_UNTIL(head, elm, field) do { \ argument
[all …]
/external/libxkbcommon/src/
Dutil-list.c42 list_insert(struct list *list, struct list *elm) in list_insert()
56 list_append(struct list *list, struct list *elm) in list_append()
70 list_remove(struct list *elm) in list_remove()
91 list_is_last(const struct list *list, const struct list *elm) in list_is_last()
/external/openthread/third_party/tcplp/bsdtcp/sys/
Dqueue.h220 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \ argument
225 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
230 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next) argument
232 #define SLIST_REMOVE(head, elm, type, field) do { \ argument
246 #define SLIST_REMOVE_AFTER(elm, field) do { \ argument
329 #define STAILQ_INSERT_AFTER(head, tqelm, elm, field) do { \ argument
335 #define STAILQ_INSERT_HEAD(head, elm, field) do { \ argument
341 #define STAILQ_INSERT_TAIL(head, elm, field) do { \ argument
352 #define STAILQ_NEXT(elm, field) ((elm)->field.stqe_next) argument
354 #define STAILQ_REMOVE(head, elm, type, field) do { \ argument
[all …]
/external/jemalloc_new/include/jemalloc/internal/
Drtree.h173 rtree_leaf_elm_bits_read(tsdn_t *tsdn, rtree_t *rtree, rtree_leaf_elm_t *elm, in rtree_leaf_elm_bits_read()
212 rtree_leaf_elm_t *elm, bool dependent) { in rtree_leaf_elm_extent_read()
225 rtree_leaf_elm_t *elm, bool dependent) { in rtree_leaf_elm_szind_read()
237 rtree_leaf_elm_t *elm, bool dependent) { in rtree_leaf_elm_slab_read()
249 rtree_leaf_elm_t *elm, extent_t *extent) { in rtree_leaf_elm_extent_write()
263 rtree_leaf_elm_t *elm, szind_t szind) { in rtree_leaf_elm_szind_write()
281 rtree_leaf_elm_t *elm, bool slab) { in rtree_leaf_elm_slab_write()
295 rtree_leaf_elm_write(tsdn_t *tsdn, rtree_t *rtree, rtree_leaf_elm_t *elm, in rtree_leaf_elm_write()
315 rtree_leaf_elm_t *elm, szind_t szind, bool slab) { in rtree_leaf_elm_szind_slab_update()
401 rtree_leaf_elm_t *elm = rtree_leaf_elm_lookup(tsdn, rtree, rtree_ctx, in rtree_write() local
[all …]
Dtcache_inlines.h220 tcaches_t *elm = &tcaches[ind]; in tcaches_get() local
/external/igt-gpu-tools/lib/
Digt_list.h60 static inline void igt_list_add(struct igt_list *elm, struct igt_list *list) in igt_list_add()
65 static inline void igt_list_add_tail(struct igt_list *elm, in igt_list_add_tail()
77 static inline void igt_list_del(struct igt_list *elm) in igt_list_del()
82 static inline void igt_list_move(struct igt_list *elm, struct igt_list *list) in igt_list_move()
88 static inline void igt_list_move_tail(struct igt_list *elm, in igt_list_move_tail()
/external/libevent/WIN32-Code/
Dtree.h75 #define SPLAY_LEFT(elm, field) (elm)->field.spe_left argument
76 #define SPLAY_RIGHT(elm, field) (elm)->field.spe_right argument
313 #define RB_LEFT(elm, field) (elm)->field.rbe_left argument
314 #define RB_RIGHT(elm, field) (elm)->field.rbe_right argument
315 #define RB_PARENT(elm, field) (elm)->field.rbe_parent argument
316 #define RB_COLOR(elm, field) (elm)->field.rbe_color argument
320 #define RB_SET(elm, parent, field) do { \ argument
335 #define RB_ROTATE_LEFT(head, elm, tmp, field) do { \ argument
355 #define RB_ROTATE_RIGHT(head, elm, tmp, field) do { \ argument
/external/jemalloc_new/src/
Drtree.c165 rtree_child_node_tryread(rtree_node_elm_t *elm, bool dependent) { in rtree_child_node_tryread()
181 rtree_child_node_read(tsdn_t *tsdn, rtree_t *rtree, rtree_node_elm_t *elm, in rtree_child_node_read()
194 rtree_child_leaf_tryread(rtree_node_elm_t *elm, bool dependent) { in rtree_child_leaf_tryread()
210 rtree_child_leaf_read(tsdn_t *tsdn, rtree_t *rtree, rtree_node_elm_t *elm, in rtree_child_leaf_read()
Dtcache.c615 tcaches_t *elm; in tcaches_create() local
637 tcaches_elm_remove(tsd_t *tsd, tcaches_t *elm) { in tcaches_elm_remove()
661 tcaches_t *elm = &tcaches[ind]; in tcaches_destroy() local
Dextent.c132 extent_rtree_leaf_elm_try_lock(tsdn_t *tsdn, rtree_leaf_elm_t *elm, in extent_rtree_leaf_elm_try_lock()
164 rtree_leaf_elm_t *elm = rtree_leaf_elm_lookup(tsdn, &extents_rtree, in extent_lock_from_addr() local
Dctl.c1078 const char *elm, *tdot, *dot; in ctl_lookup() local
/external/cronet/third_party/libevent/
Devent-internal.h77 #define TAILQ_NEXT(elm, field) ((elm)->field.tqe_next) argument
82 #define TAILQ_INSERT_BEFORE(listelm, elm, field) do { \ argument
/external/armnn/python/pyarmnn/src/pyarmnn/swig/modules/
Darmnn_tensor.i80 std::string elm = "NumElements: " + std::to_string($self->GetNumElements()); in __str__() local
/external/ipsec-tools/src/racoon/
Dvar.h99 #define LIST_FOREACH(elm, head, field) \ argument
Drsalist.c61 #define LIST_NEXT(elm, field) ((elm)->field.le_next) argument
Dschedule.c57 #define TAILQ_FOREACH(elm, head, field) \ argument
/external/wayland/src/
Dwayland-util.c44 wl_list_insert(struct wl_list *list, struct wl_list *elm) in wl_list_insert()
53 wl_list_remove(struct wl_list *elm) in wl_list_remove()
/external/jemalloc_new/test/unit/
Drtree.c176 rtree_leaf_elm_t *elm = rtree_leaf_elm_lookup(tsdn, rtree, in TEST_BEGIN() local