Home
last modified time | relevance | path

Searched full:head (Results 1 – 25 of 4065) sorted by relevance

12345678910>>...163

/third_party/libcoap/include/coap3/
Dutlist.h40 * Either way, the pointer to the head of the list must be initialized to NULL.
81 * namely, we always reassign our tmp variable to the list head if we need
82 * to dereference its prev/next pointers, and save/restore the real head.*/
314 #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)
[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/exfatprogs/include/
Dlist.h64 * @head: list head to add it after
66 * Insert a new entry after the specified head.
69 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()
77 * @head: list head to add it before
79 * Insert a new entry before the specified head.
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()
124 * list_move - delete from one list and add as another's head
126 * @head: the head that will precede our entry
[all …]
/third_party/gstreamer/gstplugins_bad/ext/sctp/usrsctp/usrsctplib/
Duser_queue.h41 * added to the list after an existing element or at the head of the list.
42 * Elements being removed from the head of the list should use the explicit
49 * head of the list and the other to the tail of the list. The elements are
52 * to the list after an existing element, at the head of the list, or at the
53 * end of the list. Elements being removed from the head of the tail queue
63 * or after an existing element or at the head of the list. A list
66 * A tail queue is headed by a pair of pointers, one to the head of the
70 * after an existing element, at the head of the list, or at the end of
102 /* Store the last 2 places the queue element or head was altered */
114 #define QMD_TRACE_HEAD(head) do { \ argument
[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, size_t 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.h47 * added to the list after an existing element or at the head of the list.
48 * Elements being removed from the head of the list should use the explicit
55 * head of the list and the other to the tail of the list. The elements are
58 * to the list after an existing element, at the head of the list, or at the
59 * end of the list. Elements being removed from the head of the tail queue
69 * or after an existing element or at the head of the list. A list
72 * A tail queue is headed by a pair of pointers, one to the head of the
76 * after an existing element, at the head of the list, or at the end of
120 /* Store the last 2 places the queue element or head was altered */
133 #define QMD_TRACE_HEAD(head) do { \ 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/alsa-utils/alsactl/
Dlist.h73 * @head: list head to add it after
75 * Insert a new entry after the specified head.
78 static inline void list_add(struct list_head *new, struct list_head *head) in list_add() argument
80 __list_add(new, head, head->next); in list_add()
86 * @head: list head to add it before
88 * Insert a new entry before the specified head.
91 static inline void list_add_tail(struct list_head *new, struct list_head *head) in list_add_tail() argument
93 __list_add(new, head->prev, head); in list_add_tail()
133 * list_move - delete from one list and add as another's head
135 * @head: the head that will precede our entry
[all …]
/third_party/parse5/test/data/parser-feedback/
Dnoscript01.test5 "description": "<head><noscript><!doctype html><!--foo--></noscript>",
6 "input": "<head><noscript><!doctype html><!--foo--></noscript>",
10 "head",
30 "description": "<head><noscript><html class=\"foo\"><!--foo--></noscript>",
31 "input": "<head><noscript><html class=\"foo\"><!--foo--></noscript>",
35 "head",
55 "description": "<head><noscript></noscript>",
56 "input": "<head><noscript></noscript>",
60 "head",
76 "description": "<head><noscript> </noscript>",
[all …]
Dtests3.test5 "description": "<head></head><style></style>",
6 "input": "<head></head><style></style>",
10 "head",
15 "head"
30 "description": "<head></head><script></script>",
31 "input": "<head></head><script></script>",
35 "head",
40 "head"
55 "description": "<head></head><!-- --><style></style><!-- --><script></script>",
56 "input": "<head></head><!-- --><style></style><!-- --><script></script>",
[all …]
/third_party/ltp/testcases/realtime/include/
Dlist.h94 * @head: list head to add it after
96 * Insert a new entry after the specified head.
99 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()
107 * @head: list head to add it before
109 * Insert a new entry before the specified head.
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()
154 * list_move - delete from one list and add as another's head
156 * @head: the head that will precede our entry
[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/tools/sparse/sparse-src/
Dptrlist.c36 // @head: the head of the list
37 // @return: the size of the list given by @head.
38 int ptr_list_size(struct ptr_list *head) in ptr_list_size() argument
42 if (head) { in ptr_list_size()
43 struct ptr_list *list = head; in ptr_list_size()
46 } while ((list = list->next) != head); in ptr_list_size()
53 // @head: the head of the list
55 bool ptr_list_empty(const struct ptr_list *head) in ptr_list_empty() argument
57 const struct ptr_list *list = head; in ptr_list_empty()
59 if (!head) in ptr_list_empty()
[all …]
Dptrlist.h14 #define CHECK_TYPE(head,ptr) (void)(&(ptr) == &(head)->list[0]) argument
15 #define PTRLIST_TYPE(head) __typeof__((head)->list[0]) argument
16 #define VRFY_PTR_LIST(head) (void)(sizeof((head)->list[0])) argument
32 void * undo_ptr_list_last(struct ptr_list **head);
33 void * delete_ptr_list_last(struct ptr_list **head);
36 bool lookup_ptr_list_entry(const struct ptr_list *head, const void *entry);
42 extern bool ptr_list_empty(const struct ptr_list *head);
43 extern bool ptr_list_multiple(const struct ptr_list *head);
60 struct ptr_list** head = (struct ptr_list**)(list); \
62 (__typeof__(&(ptr))) __add_ptr_list(head, ptr); \
[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/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/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/parse5/test/data/serialization/
Dtests.json5 … "expected": "<html><head></head><body><template>Some <div>content</div></template></body></html>"
9 …"input": "<head><meta http-equiv=\"refresh\" content=\"30\"></head><body><div style=\"background-c…
10 …"expected": "<html><head><meta http-equiv=\"refresh\" content=\"30\"></head><body><div style=\"bac…
15 … "expected": "<html><head></head><body><svg xml:base=\"http://example.org\"></svg></body></html>"
20 …"expected": "<html><head></head><body><svg xmlns=\"http://www.w3.org/1999/xhtml\" xmlns:xlink=\"ht…
25 "expected": "<html><head></head><body><svg xlink:title=\"Hey!\"></svg></body></html>"
30 "expected": "<html><head></head><body><div data-foo=\"&amp; 42 &amp;\"></div></body></html>"
35 … "expected": "<html><head></head><body><div data-foo=\"&nbsp; bar&nbsp;\"></div></body></html>"
40 …"expected": "<html><head></head><body><div data-foo=\"&quot;\" id=\"test1&quot;\" class=\"test2&qu…
45 "expected": "<html><head></head><body><div data-foo=\"<span>\"></div></body></html>"
[all …]
/third_party/skia/third_party/externals/abseil-cpp/absl/strings/internal/
Dcord_rep_ring.cc64 // Unrefs the entries in `[head, tail)`.
66 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()
86 << ", head = " << rep.head_ << ", tail = " << rep.tail_ in operator <<()
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 <<()
[all …]
/third_party/ntfs-3g/ntfsprogs/
Dlist.h71 * @head: list head to add it after
73 * Insert a new entry after the specified head.
77 struct ntfs_list_head *head) in ntfs_list_add() argument
79 __ntfs_list_add(new, head, head->next); in ntfs_list_add()
85 * @head: list head to add it before
87 * Insert a new entry before the specified head.
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()
137 * @head: the list to test.
139 static __inline__ int ntfs_list_empty(struct ntfs_list_head *head) in ntfs_list_empty() argument
[all …]
/third_party/toybox/tests/
Dhead.test7 testing "head, stdin" "head -n 1 && echo yes" "one\nyes\n" "" "one\ntwo"
8 testing "head, stdin via -" "head -n 1 - && echo yes" "one\nyes\n" "" "one\ntwo"
9 testing "head, file" "head input -n 1 && echo yes" "one\nyes\n" "one\ntwo" ""
10 testing "-number" "head -2 input && echo yes" "one\ntwo\nyes\n" \
12 testing "head, default lines" "head" "1\n2\n3\n4\n5\n6\n7\n8\n9\n10\n" "" "1\n2\n3\n4\n5\n6\n7\n8\n…
15 testing "-v file" "head -v -n 1 input" "==> input <==\none\n" "one\ntwo\n" ""
16 testing "-v stdin" "head -v -n 1 | sed 's/==> standard input <==/==> - <==/'" \
19 testing "file and stdin" "head -n 1 input - | sed 's/==> standard input <==/==> - <==/'" \
25 testing "head, multiple files" "head -n 2 input file1" "==> input <==\none\ntwo\n\n==> file1 <==\nf…
26 testing "-q, multiple files" "head -q -n 2 input file1" "one\ntwo\nfoo\nbar\n" \
[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/node/deps/npm/node_modules/tar/node_modules/yallist/
Dyallist.js14 self.head = null
46 if (node === this.head) {
47 this.head = next
62 if (node === this.head) {
70 var head = this.head
72 node.next = head
73 if (head) {
74 head.prev = node
77 this.head = node
101 if (!this.head) {
[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/node/deps/npm/node_modules/yallist/
Dyallist.js14 self.head = null
46 if (node === this.head) {
47 this.head = next
60 if (node === this.head) {
68 var head = this.head
70 node.next = head
71 if (head) {
72 head.prev = node
75 this.head = node
99 if (!this.head) {
[all …]

12345678910>>...163