| /third_party/libcoap/include/coap3/ |
| D | coap_utlist_internal.h | 40 * 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 …]
|
| D | coap_uthash_internal.h | 139 #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/ |
| D | list.h | 64 * @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/libwebsockets/lib/misc/lwsac/ |
| D | lwsac.c | 29 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/alsa-utils/alsactl/ |
| D | list.h | 73 * @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/ |
| D | noscript01.test | 5 "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 …]
|
| D | tests3.test | 5 "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/FreeBSD/sys/sys/ |
| D | queue.h | 46 * added to the list after an existing element or at the head of the list.
47 * Elements being removed from the head of the list should use the explicit
54 * head of the list and the other to the tail of the list. The elements are
57 * to the list after an existing element, at the head of the list, or at the
58 * end of the list. Elements being removed from the head of the tail queue
68 * or after an existing element or at the head of the list. A list
71 * A tail queue is headed by a pair of pointers, one to the head of the
75 * after an existing element, at the head of the list, or at the end of
119 /* Store the last 2 places the queue element or head was altered */
132 #define QMD_TRACE_HEAD(head) do { \ argument
[all …]
|
| D | tree.h | 88 #define SPLAY_ROOT(head) (head)->sph_root argument
89 #define SPLAY_EMPTY(head) (SPLAY_ROOT(head) == NULL) argument
92 #define SPLAY_ROTATE_RIGHT(head, tmp, field) do { \ argument
93 SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(tmp, field); \
94 SPLAY_RIGHT(tmp, field) = (head)->sph_root; \
95 (head)->sph_root = tmp; \
98 #define SPLAY_ROTATE_LEFT(head, tmp, field) do { \ argument
99 SPLAY_RIGHT((head)->sph_root, field) = SPLAY_LEFT(tmp, field); \
100 SPLAY_LEFT(tmp, field) = (head)->sph_root; \
101 (head)->sph_root = tmp; \
[all …]
|
| /third_party/ltp/testcases/realtime/include/ |
| D | list.h | 94 * @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/ |
| D | buflist.c | 34 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/iptables/libiptc/ |
| D | linux_list.h | 85 * @head: list head to add it after
87 * Insert a new entry after the specified head.
90 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()
98 * @head: list head to add it before
100 * Insert a new entry before the specified head.
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()
127 * @head: list head to add it after
129 * Insert a new entry after the specified head.
[all …]
|
| /third_party/curl/tests/unit/ |
| D | unit1300.c | 59 struct Curl_llist_element *head; variable
71 * 2: list head will be NULL
77 fail_unless(llist.head == NULL, "list head should initiate to NULL");
88 * 2: list head will hold the data "unusedData_case1"
89 * 3: list tail will be the same as list head
92 Curl_llist_insert_next(&llist, llist.head, &unusedData_case1, &case1_list);
96 /* test that the list head data holds my unusedData */
97 fail_unless(llist.head->ptr == &unusedData_case1,
98 "head ptr should be first entry");
100 fail_unless(llist.tail == llist.head,
[all …]
|
| /third_party/FreeBSD/sys/compat/linuxkpi/common/include/linux/ |
| D | list.h | 68 list_empty(const struct list_head *head) in list_empty() argument
71 return (head->next == head); in list_empty()
75 list_empty_careful(const struct list_head *head) in list_empty_careful() argument
77 struct list_head *next = head->next; in list_empty_careful()
79 return ((next == head) && (next == head->prev)); in list_empty_careful()
158 #define list_for_each(p, head) \ argument
159 for (p = (head)->next; p != (head); p = (p)->next)
161 #define list_for_each_safe(p, n, head) \ argument
162 for (p = (head)->next, n = (p)->next; p != (head); p = n, n = (p)->next)
181 #define list_for_each_entry_safe_from(pos, n, head, member) \ argument
[all …]
|
| /third_party/libuv/include/uv/ |
| D | tree.h | 84 #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/tex-hyphen/tests/context/ka/ |
| D | ka-example-hyp.tex | 38 local function identify(head,marked)
39 local current, prev = head, nil
54 local function strip(head,marked)
57 nodes.remove(head,prev.next,true)
61 local function mark(head,marked,what,how)
63 head, prev = node.insert_after(head,prev,newkern(1000))
68 head, prev = node.insert_after(head,prev,newkern(-quad/20))
69 -- head, prev = node.insert_after(head,prev,newkern(0))
73 head, prev = node.insert_after(head,prev,rule)
78 head, prev = node.insert_after(head,prev,rule)
[all …]
|
| /third_party/parse5/test/data/serialization/ |
| D | tests.json | 5 … "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=\"& 42 &\"></div></body></html>"
35 … "expected": "<html><head></head><body><div data-foo=\" bar \"></div></body></html>"
40 …"expected": "<html><head></head><body><div data-foo=\""\" id=\"test1"\" class=\"test2&qu…
45 "expected": "<html><head></head><body><div data-foo=\"<span>\"></div></body></html>"
[all …]
|
| /third_party/libdrm/intel/ |
| D | uthash.h | 119 #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/skia/third_party/externals/abseil-cpp/absl/strings/internal/ |
| D | cord_rep_ring.cc | 64 // 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/flatbuffers/lobster/ |
| D | flatbuffers.lobster | 40 head = 0
53 return buf.length - head
57 return offset { head }
75 object_end = head
83 let object_offset = head
113 head = object_offset
121 buf.write_int32_le(buf.length - object_offset, head - object_offset)
124 vtables.push(head)
129 buf, head = buf.write_int8_le_back(head, 0)
137 let align_size = ((~(head + additional_bytes)) + 1) & (size - 1)
[all …]
|
| /third_party/toybox/tests/ |
| D | head.test | 7 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/ntfs-3g/ntfsprogs/ |
| D | list.h | 71 * @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/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Demangle/ |
| D | MicrosoftDemangle.h | 39 NewHead->Next = Head; in addNode()
41 Head = NewHead; in addNode()
49 while (Head) { in ~ArenaAllocator()
50 assert(Head->Buf); in ~ArenaAllocator()
51 delete[] Head->Buf; in ~ArenaAllocator()
52 AllocatorNode *Next = Head->Next; in ~ArenaAllocator()
53 delete Head; in ~ArenaAllocator() local
54 Head = Next; in ~ArenaAllocator()
59 assert(Head && Head->Buf); in allocUnalignedBuffer()
61 uint8_t *P = Head->Buf + Head->Used; in allocUnalignedBuffer()
[all …]
|
| /third_party/rust/rust/library/std/src/sync/mpmc/ |
| D | list.rs | 31 // * If set in head, indicates that the block is not the last one.
145 /// The head of the channel.
146 head: CachePadded<Position<T>>, field
162 head: CachePadded::new(Position { in new()
217 self.head.block.store(new, Ordering::Release); in start_send()
280 let mut head = self.head.index.load(Ordering::Acquire); in start_recv() localVariable
281 let mut block = self.head.block.load(Ordering::Acquire); in start_recv()
285 let offset = (head >> SHIFT) % LAP; in start_recv()
290 head = self.head.index.load(Ordering::Acquire); in start_recv()
291 block = self.head.block.load(Ordering::Acquire); in start_recv()
[all …]
|
| D | array.rs | 52 /// The head of the channel.
56 /// represent the lap. The mark bit in the head is always zero.
58 /// Messages are popped from the head of the channel.
59 head: CachePadded<AtomicUsize>, field
98 // Head is initialized to `{ lap: 0, mark: 0, index: 0 }`. in with_capacity()
99 let head = 0; in with_capacity() localVariable
117 head: CachePadded::new(AtomicUsize::new(head)), in with_capacity()
178 let head = self.head.load(Ordering::Relaxed); in start_send() localVariable
180 // If the head lags one lap behind the tail as well... in start_send()
181 if head.wrapping_add(self.one_lap) == tail { in start_send()
[all …]
|