Home
last modified time | relevance | path

Searched defs:elm (Results 1 – 23 of 23) 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/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.h378 #define TAILQ_NEXT(elm, field) ((elm)->field.tqe_next) argument
389 #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/dhcpcd-6.8.2/compat/
Dqueue.h68 #define TAILQ_NEXT(elm, field) ((elm)->field.tqe_next) argument
71 #define TAILQ_PREV(elm, headname, field) \ argument
94 #define TAILQ_INSERT_HEAD(head, elm, field) do { \ argument
104 #define TAILQ_INSERT_TAIL(head, elm, field) do { \ argument
111 #define TAILQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
122 #define TAILQ_INSERT_BEFORE(listelm, elm, field) do { \ argument
129 #define TAILQ_REMOVE(head, elm, field) do { \ argument
140 #define TAILQ_REPLACE(head, elm, elm2, field) do { \ argument
/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/v8/src/
Dlist-inl.h89 void List<T, P>::Set(int index, const T& elm) { in Set()
96 void List<T, P>::InsertAt(int index, const T& elm, P alloc) { in InsertAt()
119 bool List<T, P>::RemoveElement(const T& elm) { in RemoveElement()
184 bool List<T, P>::Contains(const T& elm) const { in Contains()
194 int List<T, P>::CountOccurrences(const T& elm, int start, int end) const { in CountOccurrences()
Dstring-stream.cc85 int elm = 0; in Add() local
/external/jemalloc/include/jemalloc/internal/
Drtree.h164 rtree_child_tryread(rtree_node_elm_t *elm, bool dependent) in rtree_child_tryread()
177 rtree_child_read(rtree_t *rtree, rtree_node_elm_t *elm, unsigned level, in rtree_child_read()
190 rtree_val_read(rtree_t *rtree, rtree_node_elm_t *elm, bool dependent) in rtree_val_read()
212 rtree_val_write(rtree_t *rtree, rtree_node_elm_t *elm, const extent_node_t *val) in rtree_val_write()
Dtcache.h474 tcaches_t *elm = &tcaches[ind]; in tcaches_get() local
Darena.h1246 arena_chunk_map_misc_t *elm = in arena_prof_tctx_get() local
1273 arena_chunk_map_misc_t *elm; in arena_prof_tctx_set() local
1305 arena_chunk_map_misc_t *elm; in arena_prof_tctx_reset() 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/jemalloc/src/
Dtcache.c481 tcaches_t *elm; in tcaches_create() local
520 tcaches_elm_flush(tsd_t *tsd, tcaches_t *elm) { in tcaches_elm_flush()
539 tcaches_t *elm; in tcaches_destroy() local
Drtree.c128 rtree_child_read_hard(rtree_t *rtree, rtree_node_elm_t *elm, unsigned level) in rtree_child_read_hard()
Dctl.c822 const char *elm, *tdot, *dot; in ctl_lookup() local
/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/v8/benchmarks/
Ddeltablue.js60 OrderedCollection.prototype.add = function (elm) { argument
76 OrderedCollection.prototype.remove = function (elm) { argument
/external/adhd/cras/src/server/
Dcras_server.c410 struct attached_client *elm; in cras_server_run() local
/external/v8/src/regexp/
Djsregexp.cc2553 TextElement elm = elements()->at(k); in GetQuickCheckDetails() local
2810 TextElement elm = elements()->at(i); in FilterOneByte() local
3250 TextElement elm = elements()->at(i); in TextEmitPass() local
3303 TextElement elm = elements()->last(); in Length() local
3438 TextElement elm = elements()->at(i); in MakeCaseIndependent() local
3458 TextElement elm = elements()->at(0); in GetSuccessorOfOmnivorousTextNode() local
4614 TextElement elm = that->elements()->at(i); in VisitText() local
6308 TextElement& elm = elements()->at(i); in CalculateOffsets() local
6551 TextElement elm = that->elements()->at(0); in VisitText() local
Dregexp-ast.h360 void AddElement(TextElement elm, Zone* zone) { in AddElement()
/external/v8/src/builtins/
Dbuiltins-array.cc833 MUST_USE_RESULT bool visit(uint32_t i, Handle<Object> elm) { in visit()