Searched refs:elm (Results 1 - 25 of 36) sorted by relevance

12

/external/libevent/compat/sys/
H A Dqueue.h109 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next)
123 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \
124 (elm)->field.sle_next = (slistelm)->field.sle_next; \
125 (slistelm)->field.sle_next = (elm); \
128 #define SLIST_INSERT_HEAD(head, elm, field) do { \
129 (elm)->field.sle_next = (head)->slh_first; \
130 (head)->slh_first = (elm); \
160 #define LIST_NEXT(elm, field) ((elm)
[all...]
/external/ipsec-tools/src/include-glibc/sys/
H A Dqueue.h138 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \
139 SLIST_NEXT((elm), field) = SLIST_NEXT((slistelm), field); \
140 SLIST_NEXT((slistelm), field) = (elm); \
143 #define SLIST_INSERT_HEAD(head, elm, field) do { \
144 SLIST_NEXT((elm), field) = SLIST_FIRST((head)); \
145 SLIST_FIRST((head)) = (elm); \
148 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next)
150 #define SLIST_REMOVE(head, elm, type, field) do { \
151 if (SLIST_FIRST((head)) == (elm)) { \
[all...]
/external/libevent/
H A Dht-internal.h52 #define HT_FIND(name, head, elm) name##_HT_FIND((head), (elm))
53 #define HT_INSERT(name, head, elm) name##_HT_INSERT((head), (elm))
54 #define HT_REPLACE(name, head, elm) name##_HT_REPLACE((head), (elm))
55 #define HT_REMOVE(name, head, elm) name##_HT_REMOVE((head), (elm))
57 #define HT_NEXT(name, head, elm) name##_HT_NEXT((head), (elm))
[all...]
H A Devent-internal.h378 #define TAILQ_NEXT(elm, field) ((elm)->field.tqe_next)
389 #define TAILQ_INSERT_BEFORE(listelm, elm, field) do { \
390 (elm)->field.tqe_prev = (listelm)->field.tqe_prev; \
391 (elm)->field.tqe_next = (listelm); \
392 *(listelm)->field.tqe_prev = (elm); \
393 (listelm)->field.tqe_prev = &(elm)->field.tqe_next; \
/external/libevent/WIN32-Code/
H A Dtree.h75 #define SPLAY_LEFT(elm, field) (elm)->field.spe_left
76 #define SPLAY_RIGHT(elm, field) (elm)->field.spe_right
120 /* Finds the node with the same key as elm */ \
122 name##_SPLAY_FIND(struct name *head, struct type *elm) \
126 name##_SPLAY(head, elm); \
127 if ((cmp)(elm, (head)->sph_root) == 0) \
133 name##_SPLAY_NEXT(struct name *head, struct type *elm) \
135 name##_SPLAY(head, elm); \
[all...]
/external/dhcpcd-6.8.2/compat/
H A Dqueue.h68 #define TAILQ_NEXT(elm, field) ((elm)->field.tqe_next)
71 #define TAILQ_PREV(elm, headname, field) \
72 (*(((struct headname *)((elm)->field.tqe_prev))->tqh_last))
94 #define TAILQ_INSERT_HEAD(head, elm, field) do { \
95 if (((elm)->field.tqe_next = (head)->tqh_first) != TAILQ_END(head))\
97 &(elm)->field.tqe_next; \
99 (head)->tqh_last = &(elm)->field.tqe_next; \
100 (head)->tqh_first = (elm); \
101 (elm)
[all...]
/external/ipsec-tools/src/racoon/
H A Dvar.h99 #define LIST_FOREACH(elm, head, field) \
100 for (elm = LIST_FIRST(head); elm; elm = LIST_NEXT(elm, field))
H A Dschedule.c57 #define TAILQ_FOREACH(elm, head, field) \
58 for (elm = TAILQ_FIRST(head); elm; elm = TAILQ_NEXT(elm, field))
H A Drsalist.c61 #define LIST_NEXT(elm, field) ((elm)->field.le_next)
/external/jemalloc/include/jemalloc/internal/
H A Drtree.h104 rtree_node_elm_t *elm, unsigned level);
115 rtree_node_elm_t *rtree_child_tryread(rtree_node_elm_t *elm,
117 rtree_node_elm_t *rtree_child_read(rtree_t *rtree, rtree_node_elm_t *elm,
119 extent_node_t *rtree_val_read(rtree_t *rtree, rtree_node_elm_t *elm,
121 void rtree_val_write(rtree_t *rtree, rtree_node_elm_t *elm,
164 rtree_child_tryread(rtree_node_elm_t *elm, bool dependent) argument
169 child = elm->child;
171 child = atomic_read_p(&elm->pun);
177 rtree_child_read(rtree_t *rtree, rtree_node_elm_t *elm, unsigned level, argument
182 child = rtree_child_tryread(elm, dependen
190 rtree_val_read(rtree_t *rtree, rtree_node_elm_t *elm, bool dependent) argument
212 rtree_val_write(rtree_t *rtree, rtree_node_elm_t *elm, const extent_node_t *val) argument
[all...]
H A Dtcache.h474 tcaches_t *elm = &tcaches[ind];
475 if (unlikely(elm->tcache == NULL)) {
476 elm->tcache = tcache_create(tsd_tsdn(tsd), arena_choose(tsd,
479 return (elm->tcache);
H A Darena.h1246 arena_chunk_map_misc_t *elm =
1248 ret = atomic_read_p(&elm->prof_tctx_pun);
1273 arena_chunk_map_misc_t *elm;
1277 elm = arena_miscelm_get_mutable(chunk, pageind);
1278 atomic_write_p(&elm->prof_tctx_pun, tctx);
1305 arena_chunk_map_misc_t *elm;
1313 elm = arena_miscelm_get_mutable(chunk, pageind);
1314 atomic_write_p(&elm->prof_tctx_pun,
/external/wpa_supplicant_8/wpa_supplicant/wpa_gui-qt4/
H A Deventhistory.cpp85 elm = new EventListModel(parent);
86 eventListView->setModel(elm);
93 delete elm;
119 elm->addEvent(msg.getTimestamp().toString("yyyy-MM-dd hh:mm:ss.zzz"),
H A Deventhistory.h54 EventListModel *elm; member in class:EventHistory
/external/wayland/src/
H A Dwayland-util.c44 wl_list_insert(struct wl_list *list, struct wl_list *elm) argument
46 elm->prev = list;
47 elm->next = list->next;
48 list->next = elm;
49 elm->next->prev = elm;
53 wl_list_remove(struct wl_list *elm) argument
55 elm->prev->next = elm->next;
56 elm
[all...]
H A Dwayland-util.h229 * struct of \p elm as the first element in the list.
231 * \note If \p elm is already part of a list, inserting it again will lead to
235 * \param elm Link of the containing struct to insert into the list
240 wl_list_insert(struct wl_list *list, struct wl_list *elm);
245 * \note This operation leaves \p elm in an invalid state.
247 * \param elm Link of the containing struct to remove from the list
252 wl_list_remove(struct wl_list *elm);
/external/freetype/builds/atari/
H A Ddeflinejoiner.awk23 junk, elm )
25 elm = -1
29 elm = shift( array )
30 } while ( 0 > elm );
32 return elm
/external/v8/src/
H A Dlist-inl.h89 void List<T, P>::Set(int index, const T& elm) { argument
91 data_[index] = elm;
96 void List<T, P>::InsertAt(int index, const T& elm, P alloc) { argument
98 Add(elm, alloc);
102 data_[index] = elm;
119 bool List<T, P>::RemoveElement(const T& elm) { argument
121 if (data_[i] == elm) {
184 bool List<T, P>::Contains(const T& elm) const {
186 if (data_[i] == elm)
194 int List<T, P>::CountOccurrences(const T& elm, in argument
[all...]
H A Dlist.h122 bool RemoveElement(const T& elm);
149 bool Contains(const T& elm) const;
150 int CountOccurrences(const T& elm, int start, int end) const;
/external/jemalloc/src/
H A Dtcache.c481 tcaches_t *elm; local
501 elm = tcaches_avail;
503 elm->tcache = tcache;
504 *r_ind = (unsigned)(elm - tcaches);
506 elm = &tcaches[tcaches_past];
507 elm->tcache = tcache;
520 tcaches_elm_flush(tsd_t *tsd, tcaches_t *elm) { argument
523 if (elm->tcache == NULL) {
526 tcache_destroy(tsd, elm->tcache);
527 elm
539 tcaches_t *elm; local
[all...]
H A Drtree.c128 rtree_child_read_hard(rtree_t *rtree, rtree_node_elm_t *elm, unsigned level) argument
131 return (rtree_node_init(rtree, level+1, &elm->child));
/external/adhd/cras/src/server/
H A Dcras_server.c410 struct attached_client *elm; local
515 DL_FOREACH(server_instance.clients_head, elm) {
516 pollfds[num_pollfds].fd = elm->fd;
518 elm->pollfd = &pollfds[num_pollfds];
543 DL_FOREACH(server_instance.clients_head, elm)
544 if (elm->pollfd && elm->pollfd->revents & POLLIN)
545 handle_message_from_client(elm);
/external/v8/benchmarks/
H A Ddeltablue.js60 OrderedCollection.prototype.add = function (elm) {
61 this.elms.push(elm);
76 OrderedCollection.prototype.remove = function (elm) {
80 if (value != elm) {
/external/v8/src/regexp/
H A Djsregexp.cc2553 TextElement elm = elements()->at(k); local
2554 if (elm.text_type() == TextElement::ATOM) {
2555 Vector<const uc16> quarks = elm.atom()->data();
2619 RegExpCharacterClass* tree = elm.char_class();
2810 TextElement elm = elements()->at(i); local
2811 if (elm.text_type() == TextElement::ATOM) {
2812 Vector<const uc16> quarks = elm.atom()->data();
2827 DCHECK(elm.text_type() == TextElement::CHAR_CLASS);
2828 RegExpCharacterClass* cc = elm.char_class();
3250 TextElement elm local
3438 TextElement elm = elements()->at(i); local
4614 TextElement elm = that->elements()->at(i); local
6308 TextElement& elm = elements()->at(i); local
6551 TextElement elm = that->elements()->at(0); local
[all...]
H A Dregexp-ast.h360 void AddElement(TextElement elm, Zone* zone) { argument
361 elements_.Add(elm, zone);
362 length_ += elm.length();

Completed in 8298 milliseconds

12