Home
last modified time | relevance | path

Searched refs:head (Results 1 – 25 of 2296) sorted by relevance

12345678910>>...92

/external/libiio/src/iiod/
Dqueue.h89 #define LIST_HEAD_INITIALIZER(head) \ argument
101 #define LIST_INIT(head) do { \ argument
102 (head)->lh_first = NULL; \
120 #define LIST_INSERT_HEAD(head, elm, field) do { \ argument
121 if (((elm)->field.le_next = (head)->lh_first) != NULL) \
122 (head)->lh_first->field.le_prev = &(elm)->field.le_next;\
123 (head)->lh_first = (elm); \
124 (elm)->field.le_prev = &(head)->lh_first; \
134 #define LIST_FOREACH(var, head, field) \ argument
135 for ((var) = ((head)->lh_first); \
[all …]
/external/libevent/compat/sys/
Dqueue.h93 #define SLIST_HEAD_INITIALIZER(head) \ argument
106 #define SLIST_FIRST(head) ((head)->slh_first) argument
107 #define SLIST_END(head) NULL argument
108 #define SLIST_EMPTY(head) (SLIST_FIRST(head) == SLIST_END(head)) argument
111 #define SLIST_FOREACH(var, head, field) \ argument
112 for((var) = SLIST_FIRST(head); \
113 (var) != SLIST_END(head); \
119 #define SLIST_INIT(head) { \ argument
120 SLIST_FIRST(head) = SLIST_END(head); \
128 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
[all …]
/external/iperf3/src/
Dqueue.h99 #define SLIST_HEAD_INITIALIZER(head) \ argument
110 #define SLIST_FIRST(head) ((head)->slh_first) argument
111 #define SLIST_END(head) NULL argument
112 #define SLIST_EMPTY(head) (SLIST_FIRST(head) == SLIST_END(head)) argument
115 #define SLIST_FOREACH(var, head, field) \ argument
116 for((var) = SLIST_FIRST(head); \
117 (var) != SLIST_END(head); \
120 #define SLIST_FOREACH_PREVPTR(var, varp, head, field) \ argument
121 for ((varp) = &SLIST_FIRST((head)); \
122 ((var) = *(varp)) != SLIST_END(head); \
[all …]
/external/openssh/openbsd-compat/
Dsys-queue.h190 #define SLIST_HEAD_INITIALIZER(head) \ argument
201 #define SLIST_FIRST(head) ((head)->slh_first) argument
202 #define SLIST_END(head) NULL argument
203 #define SLIST_EMPTY(head) (SLIST_FIRST(head) == SLIST_END(head)) argument
206 #define SLIST_FOREACH(var, head, field) \ argument
207 for((var) = SLIST_FIRST(head); \
208 (var) != SLIST_END(head); \
211 #define SLIST_FOREACH_SAFE(var, head, field, tvar) \ argument
212 for ((var) = SLIST_FIRST(head); \
219 #define SLIST_INIT(head) { \ argument
[all …]
Dsys-tree.h84 #define SPLAY_ROOT(head) (head)->sph_root argument
85 #define SPLAY_EMPTY(head) (SPLAY_ROOT(head) == NULL) argument
88 #define SPLAY_ROTATE_RIGHT(head, tmp, field) do { \ argument
89 SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(tmp, field); \
90 SPLAY_RIGHT(tmp, field) = (head)->sph_root; \
91 (head)->sph_root = tmp; \
94 #define SPLAY_ROTATE_LEFT(head, tmp, field) do { \ argument
95 SPLAY_RIGHT((head)->sph_root, field) = SPLAY_LEFT(tmp, field); \
96 SPLAY_LEFT(tmp, field) = (head)->sph_root; \
97 (head)->sph_root = tmp; \
[all …]
/external/ipsec-tools/src/include-glibc/sys/
Dqueue.h114 #define SLIST_HEAD_INITIALIZER(head) \ argument
125 #define SLIST_EMPTY(head) ((head)->slh_first == NULL) argument
127 #define SLIST_FIRST(head) ((head)->slh_first) argument
129 #define SLIST_FOREACH(var, head, field) \ argument
130 for ((var) = SLIST_FIRST((head)); \
134 #define SLIST_INIT(head) do { \ argument
135 SLIST_FIRST((head)) = NULL; \
143 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
144 SLIST_NEXT((elm), field) = SLIST_FIRST((head)); \
145 SLIST_FIRST((head)) = (elm); \
[all …]
/external/libevent/
Dht-internal.h41 #define HT_EMPTY(head) \ argument
42 ((head)->hth_n_entries == 0)
45 #define HT_SIZE(head) \ argument
46 ((head)->hth_n_entries)
49 #define HT_MEM_USAGE(head) \ argument
50 (sizeof(*head) + (head)->hth_table_length * sizeof(void*))
52 #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
[all …]
/external/usrsctp/usrsctplib/
Duser_queue.h114 #define QMD_TRACE_HEAD(head) do { \ argument
115 (head)->trace.prevline = (head)->trace.lastline; \
116 (head)->trace.prevfile = (head)->trace.lastfile; \
117 (head)->trace.lastline = __LINE__; \
118 (head)->trace.lastfile = __FILE__; \
130 #define QMD_TRACE_HEAD(head) argument
144 #define SLIST_HEAD_INITIALIZER(head) \ argument
161 #define SLIST_EMPTY(head) ((head)->slh_first == NULL) argument
163 #define SLIST_FIRST(head) ((head)->slh_first) argument
165 #define SLIST_FOREACH(var, head, field) \ argument
[all …]
/external/libwebsockets/lib/misc/lwsac/
Dlwsac.c29 lws_list_ptr_insert(lws_list_ptr *head, lws_list_ptr *add, in lws_list_ptr_insert() argument
32 while (sort_func && *head) { in lws_list_ptr_insert()
33 if (sort_func(add, *head) <= 0) in lws_list_ptr_insert()
36 head = *head; in lws_list_ptr_insert()
39 *add = *head; in lws_list_ptr_insert()
40 *head = add; in lws_list_ptr_insert()
73 lwsac_extend(struct lwsac *head, int amount) in lwsac_extend() argument
78 assert(head); in lwsac_extend()
79 lachead = (struct lwsac_head *)&head[1]; in lwsac_extend()
96 _lwsac_use(struct lwsac **head, size_t ensure, size_t chunk_size, char backfill) in _lwsac_use() argument
[all …]
/external/adhd/cras/src/common/
Dutlist.h64 #define LL_PREPEND(head, add) \ argument
66 (add)->next = head; \
67 head = add; \
82 #define LL_APPEND(head, add) \ argument
84 __typeof(head) _tmp; \
86 if (head) { \
87 _tmp = head; \
92 (head) = (add); \
96 #define LL_DELETE(head, del) \ argument
98 __typeof(head) _tmp; \
[all …]
/external/libdrm/intel/
Duthash.h119 #define HASH_FIND_BYHASHVALUE(hh,head,keyptr,keylen,hashval,out) \ argument
122 if (head) { \
124 HASH_TO_BKT(hashval, (head)->hh.tbl->num_buckets, _hf_bkt); \
125 if (HASH_BLOOM_TEST((head)->hh.tbl, hashval) != 0) { \
126 …HASH_FIND_IN_BKT((head)->hh.tbl, hh, (head)->hh.tbl->buckets[ _hf_bkt ], keyptr, keylen, hashval, …
131 #define HASH_FIND(hh,head,keyptr,keylen,out) \ argument
135 HASH_FIND_BYHASHVALUE(hh, head, keyptr, keylen, _hf_hashv, out); \
172 #define HASH_MAKE_TABLE(hh,head) \ argument
174 (head)->hh.tbl = (UT_hash_table*)uthash_malloc( \
176 if (!((head)->hh.tbl)) { uthash_fatal( "out of memory"); } \
[all …]
/external/blktrace/iowatcher/
Dlist.h94 static inline void list_add(struct list_head *new, struct list_head *head) in list_add() argument
96 __list_add(new, head, head->next); in list_add()
99 extern void list_add(struct list_head *new, struct list_head *head);
111 static inline void list_add_tail(struct list_head *new, struct list_head *head) in list_add_tail() argument
113 __list_add(new, head->prev, head); in list_add_tail()
182 static inline void list_move(struct list_head *list, struct list_head *head) in list_move() argument
185 list_add(list, head); in list_move()
194 struct list_head *head) in list_move_tail() argument
197 list_add_tail(list, head); in list_move_tail()
206 const struct list_head *head) in list_is_last() argument
[all …]
/external/ltp/testcases/realtime/include/
Dlist.h99 static inline void list_add(struct list_head *new, struct list_head *head) in list_add() argument
101 __list_add(new, head, head->next); in list_add()
112 static inline void list_add_tail(struct list_head *new, struct list_head *head) in list_add_tail() argument
114 __list_add(new, head->prev, head); in list_add_tail()
158 static inline void list_move(struct list_head *list, struct list_head *head) in list_move() argument
161 list_add(list, head); in list_move()
170 struct list_head *head) in list_move_tail() argument
173 list_add_tail(list, head); in list_move_tail()
180 static inline int list_empty(const struct list_head *head) in list_empty() argument
182 return head->next == head; in list_empty()
[all …]
/external/libwebsockets/lib/core/
Dbuflist.c34 lws_buflist_append_segment(struct lws_buflist **head, const uint8_t *buf, in lws_buflist_append_segment() argument
38 int first = !*head; in lws_buflist_append_segment()
39 void *p = *head; in lws_buflist_append_segment()
46 while (*head) { in lws_buflist_append_segment()
51 if (*head == (*head)->next) { in lws_buflist_append_segment()
55 head = &((*head)->next); in lws_buflist_append_segment()
77 *head = nbuf; in lws_buflist_append_segment()
83 lws_buflist_destroy_segment(struct lws_buflist **head) in lws_buflist_destroy_segment() argument
85 struct lws_buflist *old = *head; in lws_buflist_destroy_segment()
87 assert(*head); in lws_buflist_destroy_segment()
[all …]
/external/iptables/libiptc/
Dlinux_list.h90 static inline void list_add(struct list_head *new, struct list_head *head) in list_add() argument
92 __list_add(new, head, head->next); in list_add()
103 static inline void list_add_tail(struct list_head *new, struct list_head *head) in list_add_tail() argument
105 __list_add(new, head->prev, head); in list_add_tail()
140 static inline void list_add_rcu(struct list_head *new, struct list_head *head) in list_add_rcu() argument
142 __list_add_rcu(new, head, head->next); in list_add_rcu()
162 struct list_head *head) in list_add_tail_rcu() argument
164 __list_add_rcu(new, head->prev, head); in list_add_tail_rcu()
238 static inline void list_move(struct list_head *list, struct list_head *head) in list_move() argument
241 list_add(list, head); in list_move()
[all …]
/external/libnetfilter_conntrack/include/internal/
Dlinux_list.h95 static inline void list_add(struct list_head *new, struct list_head *head) in list_add() argument
97 __list_add(new, head, head->next); in list_add()
108 static inline void list_add_tail(struct list_head *new, struct list_head *head) in list_add_tail() argument
110 __list_add(new, head->prev, head); in list_add_tail()
145 static inline void list_add_rcu(struct list_head *new, struct list_head *head) in list_add_rcu() argument
147 __list_add_rcu(new, head, head->next); in list_add_rcu()
167 struct list_head *head) in list_add_tail_rcu() argument
169 __list_add_rcu(new, head->prev, head); in list_add_tail_rcu()
243 static inline void list_move(struct list_head *list, struct list_head *head) in list_move() argument
246 list_add(list, head); in list_move()
[all …]
/external/libnfnetlink/include/
Dlinux_list.h94 static inline void list_add(struct list_head *new, struct list_head *head) in list_add() argument
96 __list_add(new, head, head->next); in list_add()
107 static inline void list_add_tail(struct list_head *new, struct list_head *head) in list_add_tail() argument
109 __list_add(new, head->prev, head); in list_add_tail()
144 static inline void list_add_rcu(struct list_head *new, struct list_head *head) in list_add_rcu() argument
146 __list_add_rcu(new, head, head->next); in list_add_rcu()
166 struct list_head *head) in list_add_tail_rcu() argument
168 __list_add_rcu(new, head->prev, head); in list_add_tail_rcu()
242 static inline void list_move(struct list_head *list, struct list_head *head) in list_move() argument
245 list_add(list, head); in list_move()
[all …]
/external/jemalloc_new/test/unit/
Dql.c17 test_empty_list(list_head_t *head) { in test_empty_list() argument
21 assert_ptr_null(ql_first(head), "Unexpected element for empty list"); in test_empty_list()
22 assert_ptr_null(ql_last(head, link), in test_empty_list()
26 ql_foreach(t, head, link) { in test_empty_list()
32 ql_reverse_foreach(t, head, link) { in test_empty_list()
39 list_head_t head; in TEST_BEGIN() local
41 ql_new(&head); in TEST_BEGIN()
42 test_empty_list(&head); in TEST_BEGIN()
57 test_entries_list(list_head_t *head, list_t *entries, unsigned nentries) { in test_entries_list() argument
61 assert_c_eq(ql_first(head)->id, entries[0].id, "Element id mismatch"); in test_entries_list()
[all …]
/external/libevent/WIN32-Code/
Dtree.h77 #define SPLAY_ROOT(head) (head)->sph_root argument
78 #define SPLAY_EMPTY(head) (SPLAY_ROOT(head) == NULL) argument
81 #define SPLAY_ROTATE_RIGHT(head, tmp, field) do { \ argument
82 SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(tmp, field); \
83 SPLAY_RIGHT(tmp, field) = (head)->sph_root; \
84 (head)->sph_root = tmp; \
87 #define SPLAY_ROTATE_LEFT(head, tmp, field) do { \ argument
88 SPLAY_RIGHT((head)->sph_root, field) = SPLAY_LEFT(tmp, field); \
89 SPLAY_LEFT(tmp, field) = (head)->sph_root; \
90 (head)->sph_root = tmp; \
[all …]
/external/ltp/testcases/kernel/syscalls/epoll2/include/
Ddbllist.h26 #define DBL_LIST_ADDH(new, head) DBL_LIST_ADD(new, head, (head)->pNext) argument
28 #define DBL_LIST_ADDT(new, head) DBL_LIST_ADD(new, (head)->pPrev, head) argument
44 #define DBL_LIST_EMTPY(head) ((head)->pNext == head) argument
46 #define DBL_LIST_SPLICE(list, head) \ argument
51 struct list_head * at = (head)->pNext; \
52 (first)->pPrev = head; \
53 (head)->pNext = first; \
68 #define DBL_LIST_FIRST(head) (((head)->pNext != (head)) ? (head)->pNext: NULL) argument
70 #define DBL_LIST_LAST(head) (((head)->pPrev != (head)) ? (head)->pPrev: NULL) argument
74 #define DBL_LIST_FOR_EACH(pos, head) for (pos = (head)->pNext; pos != (head); pos = (pos)->pNext) argument
[all …]
/external/fastrpc/inc/
Duthash.h92 #define HASH_FIND(hh,head,keyptr,keylen,out) \ argument
96 if (head) { \
97 HASH_FCN(keyptr,keylen, (head)->hh.tbl->num_buckets, _hf_hashv, _hf_bkt); \
98 if (HASH_BLOOM_TEST((head)->hh.tbl, _hf_hashv)) { \
99 HASH_FIND_IN_BKT((head)->hh.tbl, hh, (head)->hh.tbl->buckets[ _hf_bkt ], \
138 #define HASH_MAKE_TABLE(hh,head) \ argument
140 (head)->hh.tbl = (UT_hash_table*)uthash_malloc( \
142 if (!((head)->hh.tbl)) { uthash_fatal( "out of memory"); } \
143 memset((head)->hh.tbl, 0, sizeof(UT_hash_table)); \
144 (head)->hh.tbl->tail = &((head)->hh); \
[all …]
/external/linux-kselftest/tools/testing/selftests/arm64/signal/testcases/
Dtestcases.c5 struct _aarch64_ctx *get_header(struct _aarch64_ctx *head, uint32_t magic, in get_header() argument
11 if (!head || resv_sz < HDR_SZ) in get_header()
15 head->magic != magic && head->magic) { in get_header()
16 offs += head->size; in get_header()
17 head = GET_RESV_NEXT_HEAD(head); in get_header()
19 if (head->magic == magic) { in get_header()
20 found = head; in get_header()
59 struct _aarch64_ctx *head = in validate_reserved() local
65 while (head && !terminated && offs < resv_sz) { in validate_reserved()
66 if ((uint64_t)head & 0x0fUL) { in validate_reserved()
[all …]
/external/libnetfilter_conntrack/src/conntrack/
Dbuild_mnl.c118 switch(ct->head.orig.protonum) { in nfct_build_protoinfo()
123 if (!(test_bit(ATTR_TCP_STATE, ct->head.set) || in nfct_build_protoinfo()
124 test_bit(ATTR_TCP_FLAGS_ORIG, ct->head.set) || in nfct_build_protoinfo()
125 test_bit(ATTR_TCP_FLAGS_REPL, ct->head.set) || in nfct_build_protoinfo()
126 test_bit(ATTR_TCP_MASK_ORIG, ct->head.set) || in nfct_build_protoinfo()
127 test_bit(ATTR_TCP_MASK_REPL, ct->head.set) || in nfct_build_protoinfo()
128 test_bit(ATTR_TCP_WSCALE_ORIG, ct->head.set) || in nfct_build_protoinfo()
129 test_bit(ATTR_TCP_WSCALE_REPL, ct->head.set))) { in nfct_build_protoinfo()
134 if (test_bit(ATTR_TCP_STATE, ct->head.set)) { in nfct_build_protoinfo()
138 if (test_bit(ATTR_TCP_FLAGS_ORIG, ct->head.set) && in nfct_build_protoinfo()
[all …]
/external/apache-xml/src/main/java/org/apache/xalan/templates/
DTemplateList.java140 TemplateSubPatternAssociation head = in dumpAssociationTables() local
143 while (null != head) in dumpAssociationTables()
145 System.out.print("(" + head.getTargetString() + ", " in dumpAssociationTables()
146 + head.getPattern() + ")"); in dumpAssociationTables()
148 head = head.getNext(); in dumpAssociationTables()
154 TemplateSubPatternAssociation head = m_wildCardPatterns; in dumpAssociationTables() local
158 while (null != head) in dumpAssociationTables()
160 System.out.print("(" + head.getTargetString() + ", " in dumpAssociationTables()
161 + head.getPattern() + ")"); in dumpAssociationTables()
163 head = head.getNext(); in dumpAssociationTables()
[all …]
/external/libnl/include/netlink/
Dlist.h40 struct nl_list_head *head) in nl_list_add_tail() argument
42 __nl_list_add(obj, head->prev, head); in nl_list_add_tail()
46 struct nl_list_head *head) in nl_list_add_head() argument
48 __nl_list_add(obj, head, head->next); in nl_list_add_head()
57 static inline int nl_list_empty(struct nl_list_head *head) in nl_list_empty() argument
59 return head->next == head; in nl_list_empty()
69 #define nl_list_at_tail(pos, head, member) \ argument
70 ((pos)->member.next == (head))
72 #define nl_list_at_head(pos, head, member) \ argument
73 ((pos)->member.prev == (head))
[all …]

12345678910>>...92