Home
last modified time | relevance | path

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

12345678910>>...81

/third_party/libcoap/include/coap3/
Dutlist.h314 #define LL_PREPEND(head,add) \ argument
315 LL_PREPEND2(head,add,next)
317 #define LL_PREPEND2(head,add,next) \ argument
319 (add)->next = (head); \
320 (head) = (add); \
338 #define LL_APPEND(head,add) \ argument
339 LL_APPEND2(head,add,next)
341 #define LL_APPEND2(head,add,next) \ argument
343 LDECLTYPE(head) _tmp; \
345 if (head) { \
[all …]
Duthash.h139 #define HASH_ROLLBACK_BKT(hh, head, itemptrhh) \ argument
143 HASH_TO_BKT(_hd_hh_item->hashv, (head)->hh.tbl->num_buckets, _hd_bkt); \
144 (head)->hh.tbl->buckets[_hd_bkt].count++; \
154 #define HASH_FIND_BYHASHVALUE(hh,head,keyptr,keylen,hashval,out) \ argument
157 if (head) { \
159 HASH_TO_BKT(hashval, (head)->hh.tbl->num_buckets, _hf_bkt); \
160 if (HASH_BLOOM_TEST((head)->hh.tbl, hashval) != 0) { \
161 …HASH_FIND_IN_BKT((head)->hh.tbl, hh, (head)->hh.tbl->buckets[ _hf_bkt ], keyptr, keylen, hashval, …
166 #define HASH_FIND(hh,head,keyptr,keylen,out) \ argument
169 if (head) { \
[all …]
/third_party/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 …]
/third_party/FreeBSD/sys/sys/
Dqueue.h132 #define QMD_TRACE_HEAD(head) do { \ argument
133 (head)->trace.prevline = (head)->trace.lastline; \
134 (head)->trace.prevfile = (head)->trace.lastfile; \
135 (head)->trace.lastline = __LINE__; \
136 (head)->trace.lastfile = __FILE__; \
148 #define QMD_TRACE_HEAD(head) argument
189 #define SLIST_HEAD_INITIALIZER(head) \ argument
228 #define SLIST_EMPTY(head) ((head)->slh_first == NULL) argument
230 #define SLIST_FIRST(head) ((head)->slh_first) argument
232 #define SLIST_FOREACH(var, head, field) \ argument
[all …]
Dtree.h89 #define SPLAY_ROOT(head) (head)->sph_root argument
90 #define SPLAY_EMPTY(head) (SPLAY_ROOT(head) == NULL) argument
93 #define SPLAY_ROTATE_RIGHT(head, tmp, field) do { \ argument
94 SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(tmp, field); \
95 SPLAY_RIGHT(tmp, field) = (head)->sph_root; \
96 (head)->sph_root = tmp; \
99 #define SPLAY_ROTATE_LEFT(head, tmp, field) do { \ argument
100 SPLAY_RIGHT((head)->sph_root, field) = SPLAY_LEFT(tmp, field); \
101 SPLAY_LEFT(tmp, field) = (head)->sph_root; \
102 (head)->sph_root = tmp; \
[all …]
/third_party/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 …]
/third_party/uboot/u-boot-2020.01/include/linux/
Dlist.h61 static inline void list_add(struct list_head *new, struct list_head *head) in list_add() argument
63 __list_add(new, head, head->next); in list_add()
74 static inline void list_add_tail(struct list_head *new, struct list_head *head) in list_add_tail() argument
76 __list_add(new, head->prev, head); in list_add_tail()
143 static inline void list_move(struct list_head *list, struct list_head *head) in list_move() argument
146 list_add(list, head); in list_move()
155 struct list_head *head) in list_move_tail() argument
158 list_add_tail(list, head); in list_move_tail()
167 const struct list_head *head) in list_is_last() argument
169 return list->next == head; in list_is_last()
[all …]
/third_party/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 …]
/third_party/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 …]
/third_party/exfat-utils/include/
Dlist.h69 static inline void list_add(struct list_head *new, struct list_head *head) in list_add() argument
71 __list_add(new, head, head->next); in list_add()
82 static inline void list_add_tail(struct list_head *new, struct list_head *head) in list_add_tail() argument
84 __list_add(new, head->prev, head); in list_add_tail()
128 static inline void list_move(struct list_head *list, struct list_head *head) in list_move() argument
131 list_add(list, head); in list_move()
140 struct list_head *head) in list_move_tail() argument
143 list_add_tail(list, head); in list_move_tail()
150 static inline int list_empty(const struct list_head *head) in list_empty() argument
152 return head->next == head; in list_empty()
[all …]
/third_party/parse5/test/data/parser-feedback/
Dtests3.test4 "description": "<head></head><style></style>",
5 "input": "<head></head><style></style>",
9 "head",
14 "head"
28 "description": "<head></head><script></script>",
29 "input": "<head></head><script></script>",
33 "head",
38 "head"
52 "description": "<head></head><!-- --><style></style><!-- --><script></script>",
53 "input": "<head></head><!-- --><style></style><!-- --><script></script>",
[all …]
/third_party/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 …]
/third_party/libuv/include/uv/
Dtree.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 …]
/third_party/quickjs/
Dlist.h42 static inline void init_list_head(struct list_head *head) in init_list_head() argument
44 head->prev = head; in init_list_head()
45 head->next = head; in init_list_head()
59 static inline void list_add(struct list_head *el, struct list_head *head) in list_add() argument
61 __list_add(el, head, head->next); in list_add()
65 static inline void list_add_tail(struct list_head *el, struct list_head *head) in list_add_tail() argument
67 __list_add(el, head->prev, head); in list_add_tail()
86 #define list_for_each(el, head) \ argument
87 for(el = (head)->next; el != (head); el = el->next)
89 #define list_for_each_safe(el, el1, head) \ argument
[all …]
/third_party/FreeBSD/sys/compat/linuxkpi/common/include/linux/
Dlist.h70 list_empty(const struct list_head *head) in list_empty() argument
73 return (head->next == head); in list_empty()
77 list_empty_careful(const struct list_head *head) in list_empty_careful() argument
79 struct list_head *next = head->next; in list_empty_careful()
81 return ((next == head) && (next == head->prev)); in list_empty_careful()
160 #define list_for_each(p, head) \ argument
161 for (p = (head)->next; p != (head); p = (p)->next)
163 #define list_for_each_safe(p, n, head) \ argument
164 for (p = (head)->next, n = (p)->next; p != (head); p = n, n = (p)->next)
183 #define list_for_each_entry_safe_from(pos, n, head, member) \ argument
[all …]
/third_party/f2fs-tools/tools/
Df2fstat.c69 static inline void remove_newline(char **head) in remove_newline() argument
72 if (**head == '\n') { in remove_newline()
73 *head = *head + 1; in remove_newline()
87 char *head, *tail; in f2fstat() local
126 head = buf; in f2fstat()
129 head = strstr(buf, opt->partname); in f2fstat()
130 if (head == NULL) in f2fstat()
135 remove_newline(&head); in f2fstat()
136 tail = strchr(head, ':'); in f2fstat()
140 if (strlen(head) >= sizeof(keyname)) { in f2fstat()
[all …]
/third_party/boost/libs/phoenix/test/function/
Dlazy_list_tests.cpp30 using phx::head; in main()
49 BOOST_TEST(head(l1)() == 1); in main()
50 BOOST_TEST(head(arg1)(l1) == 1); in main()
51 BOOST_TEST(head(tail(l2))() == 1); in main()
52 BOOST_TEST(head(tail(arg1))(l2) == 1); in main()
53 BOOST_TEST(head(tail(tail(l3)))() == 1); in main()
54 BOOST_TEST(head(tail(tail(arg1)))(l3) == 1); in main()
55 BOOST_TEST(head(tail(tail(l4)))() == 2); in main()
56 BOOST_TEST(head(tail(tail(arg1)))(l4) == 2); in main()
57 BOOST_TEST(head(l5)() == 5); in main()
[all …]
/third_party/skia/third_party/externals/abseil-cpp/absl/strings/internal/
Dcord_rep_ring.cc66 void UnrefEntries(const CordRepRing* rep, index_type head, index_type tail) { in UnrefEntries() argument
67 rep->ForEach(head, tail, [rep](index_type ix) { in UnrefEntries()
89 CordRepRing::index_type head = rep.head(); in operator <<() local
91 CordRep* child = rep.entry_child(head); in operator <<()
92 s << " entry[" << head << "] length = " << rep.entry_length(head) in operator <<()
96 << ", offset = " << rep.entry_data_offset(head) in operator <<()
97 << ", end_pos = " << static_cast<ptrdiff_t>(rep.entry_end_pos(head)) in operator <<()
99 head = rep.advance(head); in operator <<()
100 } while (head != rep.tail()); in operator <<()
116 index_type head() const { return head_; } in head() function in absl::cord_internal::CordRepRing::Filler
[all …]
/third_party/flutter/skia/third_party/externals/harfbuzz/src/
Dhb-serialize.hh50 char *head, *tail; member
59 return (tail - head == o.tail - o.head) in operator ==()
61 && 0 == hb_memcmp (head, o.head, tail - head) in operator ==()
66 return hb_bytes_t (head, tail - head).hash () ^ in hash()
82 range_t snapshot () { range_t s = {head, tail} ; return s; } in snapshot()
115 this->head = this->start; in reset()
158 (unsigned) (this->head - this->start), in end_serialize()
184 obj->head = head; in push()
204 obj->tail = head; in pop_pack()
206 unsigned len = obj->tail - obj->head; in pop_pack()
[all …]
/third_party/e2fsprogs/lib/blkid/
Dlist.h66 _INLINE_ void list_add(struct list_head *add, struct list_head *head) in list_add() argument
68 __list_add(add, head, head->next); in list_add()
79 _INLINE_ void list_add_tail(struct list_head *add, struct list_head *head) in list_add_tail() argument
81 __list_add(add, head->prev, head); in list_add_tail()
124 _INLINE_ int list_empty(struct list_head *head) in list_empty() argument
126 return head->next == head; in list_empty()
134 _INLINE_ void list_splice(struct list_head *list, struct list_head *head) in list_splice() argument
140 struct list_head *at = head->next; in list_splice()
142 first->prev = head; in list_splice()
143 head->next = first; in list_splice()
[all …]
/third_party/ntfs-3g/ntfsprogs/
Dlist.h77 struct ntfs_list_head *head) in ntfs_list_add() argument
79 __ntfs_list_add(new, head, head->next); in ntfs_list_add()
91 struct ntfs_list_head *head) in ntfs_list_add_tail() argument
93 __ntfs_list_add(new, head->prev, head); in ntfs_list_add_tail()
139 static __inline__ int ntfs_list_empty(struct ntfs_list_head *head) in ntfs_list_empty() argument
141 return head->next == head; in ntfs_list_empty()
150 struct ntfs_list_head *head) in ntfs_list_splice() argument
156 struct ntfs_list_head *at = head->next; in ntfs_list_splice()
158 first->prev = head; in ntfs_list_splice()
159 head->next = first; in ntfs_list_splice()
[all …]
/third_party/node/lib/internal/streams/
Dbuffer_list.js13 this.head = null;
23 this.head = entry;
29 const entry = { data: v, next: this.head };
32 this.head = entry;
39 const ret = this.head.data;
41 this.head = this.tail = null;
43 this.head = this.head.next;
49 this.head = this.tail = null;
56 let p = this.head;
67 let p = this.head;
[all …]
/third_party/toybox/toys/pending/
Dtcpsvd.c66 struct list *head; member
125 struct list_pid *prev, *free_node, *head = *pids; in delete() local
128 if (!head) return NULL; in delete()
130 while (head) { in delete()
131 if (head->pid == pid) { in delete()
132 ip = head->ip; in delete()
133 free_node = head; in delete()
134 if (!prev) *pids = head->next; in delete()
135 else prev->next = head->next; in delete()
139 prev = head; in delete()
[all …]
/third_party/curl/tests/unit/
Dunit1300.c57 struct Curl_llist_element *head; variable
75 fail_unless(llist.head == NULL, "list head should initiate to NULL");
90 Curl_llist_insert_next(&llist, llist.head, &unusedData_case1, &case1_list);
95 fail_unless(llist.head->ptr == &unusedData_case1,
98 fail_unless(llist.tail == llist.head,
110 Curl_llist_insert_next(&llist, llist.head,
112 fail_unless(llist.head->next->ptr == &unusedData_case3,
126 Curl_llist_insert_next(&llist, llist.head,
128 fail_unless(llist.head->next->ptr == &unusedData_case2,
145 head = llist.head;
[all …]
/third_party/glib/glib/tests/
Dqueue.c23 if (!queue->head) in check_integrity()
26 g_assert (!queue->head); in check_integrity()
30 for (list = queue->head; list != NULL; list = list->next) in check_integrity()
48 g_assert (last == queue->head); in check_integrity()
51 for (list = queue->head; list != NULL; list = list->next) in check_integrity()
67 for (list = queue->head; list != NULL; list = list->next) in check_integrity()
220 GList *head; in random_test() member
233 queues[i].head = NULL; in random_test()
245 g_assert (qinf->head == q->head); in random_test()
255 g_assert (q->head == NULL); in random_test()
[all …]

12345678910>>...81