Home
last modified time | relevance | path

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

123

/external/libiio/src/iiod/
Dqueue.h105 #define LIST_INSERT_AFTER(listelm, elm, field) do { \ argument
106 if (((elm)->field.le_next = (listelm)->field.le_next) != NULL) \
108 &(elm)->field.le_next; \
109 (listelm)->field.le_next = (elm); \
110 (elm)->field.le_prev = &(listelm)->field.le_next; \
113 #define LIST_INSERT_BEFORE(listelm, elm, field) do { \ argument
114 (elm)->field.le_prev = (listelm)->field.le_prev; \
115 (elm)->field.le_next = (listelm); \
116 *(listelm)->field.le_prev = (elm); \
117 (listelm)->field.le_prev = &(elm)->field.le_next; \
[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
133 (elm)->field.sle_next = (slistelm)->field.sle_next; \
134 (slistelm)->field.sle_next = (elm); \
137 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
138 (elm)->field.sle_next = (head)->slh_first; \
139 (head)->slh_first = (elm); \
142 #define SLIST_REMOVE_NEXT(head, elm, field) do { \ argument
143 (elm)->field.sle_next = (elm)->field.sle_next->field.sle_next; \
150 #define SLIST_REMOVE(head, elm, type, field) do { \ argument
[all …]
/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
124 (elm)->field.sle_next = (slistelm)->field.sle_next; \
125 (slistelm)->field.sle_next = (elm); \
128 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
129 (elm)->field.sle_next = (head)->slh_first; \
130 (head)->slh_first = (elm); \
160 #define LIST_NEXT(elm, field) ((elm)->field.le_next) argument
174 #define LIST_INSERT_AFTER(listelm, elm, field) do { \ argument
175 if (((elm)->field.le_next = (listelm)->field.le_next) != NULL) \
[all …]
/external/ipsec-tools/src/include-glibc/sys/
Dqueue.h138 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \ argument
139 SLIST_NEXT((elm), field) = SLIST_NEXT((slistelm), field); \
140 SLIST_NEXT((slistelm), field) = (elm); \
143 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
144 SLIST_NEXT((elm), field) = SLIST_FIRST((head)); \
145 SLIST_FIRST((head)) = (elm); \
148 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next) argument
150 #define SLIST_REMOVE(head, elm, type, field) do { \ argument
151 if (SLIST_FIRST((head)) == (elm)) { \
156 while (SLIST_NEXT(curelm, field) != (elm)) \
[all …]
/external/openssh/openbsd-compat/
Dsys-queue.h204 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next) argument
223 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \ argument
224 (elm)->field.sle_next = (slistelm)->field.sle_next; \
225 (slistelm)->field.sle_next = (elm); \
228 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
229 (elm)->field.sle_next = (head)->slh_first; \
230 (head)->slh_first = (elm); \
233 #define SLIST_REMOVE_AFTER(elm, field) do { \ argument
234 (elm)->field.sle_next = (elm)->field.sle_next->field.sle_next; \
241 #define SLIST_REMOVE(head, elm, type, field) do { \ argument
[all …]
Dsys-tree.h82 #define SPLAY_LEFT(elm, field) (elm)->field.spe_left argument
83 #define SPLAY_RIGHT(elm, field) (elm)->field.spe_right argument
129 name##_SPLAY_FIND(struct name *head, struct type *elm) \
133 name##_SPLAY(head, elm); \
134 if ((cmp)(elm, (head)->sph_root) == 0) \
140 name##_SPLAY_NEXT(struct name *head, struct type *elm) \
142 name##_SPLAY(head, elm); \
143 if (SPLAY_RIGHT(elm, field) != NULL) { \
144 elm = SPLAY_RIGHT(elm, field); \
145 while (SPLAY_LEFT(elm, field) != NULL) { \
[all …]
/external/usrsctp/usrsctplib/
Duser_queue.h184 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \ argument
185 SLIST_NEXT((elm), field) = SLIST_NEXT((slistelm), field); \
186 SLIST_NEXT((slistelm), field) = (elm); \
189 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
190 SLIST_NEXT((elm), field) = SLIST_FIRST((head)); \
191 SLIST_FIRST((head)) = (elm); \
194 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next) argument
196 #define SLIST_REMOVE(head, elm, type, field) do { \ argument
197 QMD_SAVELINK(oldnext, (elm)->field.sle_next); \
198 if (SLIST_FIRST((head)) == (elm)) { \
[all …]
/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
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); \
136 if (SPLAY_RIGHT(elm, field) != NULL) { \
137 elm = SPLAY_RIGHT(elm, field); \
138 while (SPLAY_LEFT(elm, field) != NULL) { \
[all …]
/external/libxkbcommon/src/
Dutil-list.c42 list_insert(struct list *list, struct list *elm) in list_insert() argument
46 assert(((elm->next == NULL && elm->prev == NULL) || list_empty(elm)) || in list_insert()
49 elm->prev = list; in list_insert()
50 elm->next = list->next; in list_insert()
51 list->next = elm; in list_insert()
52 elm->next->prev = elm; in list_insert()
56 list_append(struct list *list, struct list *elm) in list_append() argument
60 assert(((elm->next == NULL && elm->prev == NULL) || list_empty(elm)) || in list_append()
63 elm->next = list; in list_append()
64 elm->prev = list->prev; in list_append()
[all …]
Dutil-list.h44 void list_insert(struct list *list, struct list *elm);
45 void list_append(struct list *list, struct list *elm);
46 void list_remove(struct list *elm);
48 bool list_is_last(const struct list *list, const struct list *elm);
/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
106 do { (elm)->field.hte_hash = hashfn(elm); } while (0)
107 #define HT_SET_HASHVAL_(elm, field, val) \ argument
108 do { (elm)->field.hte_hash = (val); } while (0)
[all …]
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; \
/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() argument
175 return (uintptr_t)atomic_load_p(&elm->le_bits, dependent in rtree_leaf_elm_bits_read()
212 rtree_leaf_elm_t *elm, bool dependent) { in rtree_leaf_elm_extent_read() argument
214 uintptr_t bits = rtree_leaf_elm_bits_read(tsdn, rtree, elm, dependent); in rtree_leaf_elm_extent_read()
217 extent_t *extent = (extent_t *)atomic_load_p(&elm->le_extent, dependent in rtree_leaf_elm_extent_read()
225 rtree_leaf_elm_t *elm, bool dependent) { in rtree_leaf_elm_szind_read() argument
227 uintptr_t bits = rtree_leaf_elm_bits_read(tsdn, rtree, elm, dependent); in rtree_leaf_elm_szind_read()
230 return (szind_t)atomic_load_u(&elm->le_szind, dependent ? ATOMIC_RELAXED in rtree_leaf_elm_szind_read()
237 rtree_leaf_elm_t *elm, bool dependent) { in rtree_leaf_elm_slab_read() argument
239 uintptr_t bits = rtree_leaf_elm_bits_read(tsdn, rtree, elm, dependent); in rtree_leaf_elm_slab_read()
[all …]
Dtcache_inlines.h220 tcaches_t *elm = &tcaches[ind]; in tcaches_get() local
221 if (unlikely(elm->tcache == NULL)) { in tcaches_get()
222 elm->tcache = tcache_create_explicit(tsd); in tcaches_get()
224 return elm->tcache; in tcaches_get()
/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() argument
62 __igt_list_add(elm, list, list->next); in igt_list_add()
65 static inline void igt_list_add_tail(struct igt_list *elm, in igt_list_add_tail() argument
68 __igt_list_add(elm, list->prev, list); in igt_list_add_tail()
77 static inline void igt_list_del(struct igt_list *elm) in igt_list_del() argument
79 __igt_list_del(elm->prev, elm->next); in igt_list_del()
82 static inline void igt_list_move(struct igt_list *elm, struct igt_list *list) in igt_list_move() argument
84 igt_list_del(elm); in igt_list_move()
85 igt_list_add(elm, list); in igt_list_move()
88 static inline void igt_list_move_tail(struct igt_list *elm, in igt_list_move_tail() argument
[all …]
/external/jemalloc_new/src/
Drtree.c165 rtree_child_node_tryread(rtree_node_elm_t *elm, bool dependent) { in rtree_child_node_tryread() argument
169 node = (rtree_node_elm_t *)atomic_load_p(&elm->child, in rtree_child_node_tryread()
172 node = (rtree_node_elm_t *)atomic_load_p(&elm->child, 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() argument
185 node = rtree_child_node_tryread(elm, dependent); in rtree_child_node_read()
187 node = rtree_node_init(tsdn, rtree, level + 1, &elm->child); in rtree_child_node_read()
194 rtree_child_leaf_tryread(rtree_node_elm_t *elm, bool dependent) { in rtree_child_leaf_tryread() argument
198 leaf = (rtree_leaf_elm_t *)atomic_load_p(&elm->child, in rtree_child_leaf_tryread()
201 leaf = (rtree_leaf_elm_t *)atomic_load_p(&elm->child, 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() argument
[all …]
Dtcache.c615 tcaches_t *elm; in tcaches_create() local
618 elm = tcaches_avail; in tcaches_create()
620 elm->tcache = tcache; in tcaches_create()
621 *r_ind = (unsigned)(elm - tcaches); in tcaches_create()
623 elm = &tcaches[tcaches_past]; in tcaches_create()
624 elm->tcache = tcache; in tcaches_create()
637 tcaches_elm_remove(tsd_t *tsd, tcaches_t *elm) { in tcaches_elm_remove() argument
640 if (elm->tcache == NULL) { in tcaches_elm_remove()
643 tcache_t *tcache = elm->tcache; in tcaches_elm_remove()
644 elm->tcache = NULL; in tcaches_elm_remove()
[all …]
/external/wayland/src/
Dwayland-util.c44 wl_list_insert(struct wl_list *list, struct wl_list *elm) in wl_list_insert() argument
46 elm->prev = list; in wl_list_insert()
47 elm->next = list->next; in wl_list_insert()
48 list->next = elm; in wl_list_insert()
49 elm->next->prev = elm; in wl_list_insert()
53 wl_list_remove(struct wl_list *elm) in wl_list_remove() argument
55 elm->prev->next = elm->next; in wl_list_remove()
56 elm->next->prev = elm->prev; in wl_list_remove()
57 elm->next = NULL; in wl_list_remove()
58 elm->prev = NULL; in wl_list_remove()
/external/ipsec-tools/src/racoon/
Dvar.h99 #define LIST_FOREACH(elm, head, field) \ argument
100 for (elm = LIST_FIRST(head); elm; elm = LIST_NEXT(elm, field))
Dschedule.c57 #define TAILQ_FOREACH(elm, head, field) \ argument
58 for (elm = TAILQ_FIRST(head); elm; elm = TAILQ_NEXT(elm, field))
Drsalist.c61 #define LIST_NEXT(elm, field) ((elm)->field.le_next) argument
/external/wpa_supplicant_8/wpa_supplicant/wpa_gui-qt4/
Deventhistory.cpp85 elm = new EventListModel(parent); in EventHistory()
86 eventListView->setModel(elm); in EventHistory()
93 delete elm; in ~EventHistory()
119 elm->addEvent(msg.getTimestamp().toString("yyyy-MM-dd hh:mm:ss.zzz"), in addEvent()
/external/freetype/builds/atari/
Ddeflinejoiner.awk23 junk, elm )
25 elm = -1
29 elm = shift( array )
30 } while ( 0 > elm );
32 return elm
/external/adhd/cras/src/server/
Dcras_server.c556 struct attached_client *elm; in cras_server_run() local
637 DL_FOREACH (server_instance.clients_head, elm) { in cras_server_run()
638 pollfds[num_pollfds].fd = elm->fd; in cras_server_run()
640 elm->pollfd = &pollfds[num_pollfds]; in cras_server_run()
687 DL_FOREACH (server_instance.clients_head, elm) in cras_server_run()
688 if (elm->pollfd && elm->pollfd->revents & POLLIN) in cras_server_run()
689 handle_message_from_client(elm); in cras_server_run()
/external/jemalloc_new/test/unit/
Drtree.c176 rtree_leaf_elm_t *elm = rtree_leaf_elm_lookup(tsdn, rtree, in TEST_BEGIN() local
178 assert_ptr_not_null(elm, in TEST_BEGIN()
180 rtree_leaf_elm_write(tsdn, rtree, elm, &extent, NSIZES, false); in TEST_BEGIN()

123