| /third_party/libwebsockets/lib/misc/ |
| D | lws-ring.c | 100 lws_ring_get_count_waiting_elements(struct lws_ring *ring, uint32_t *tail) in lws_ring_get_count_waiting_elements() argument
103 if (!tail) in lws_ring_get_count_waiting_elements()
104 tail = &ring->oldest_tail; in lws_ring_get_count_waiting_elements()
114 if (ring->head == *tail) in lws_ring_get_count_waiting_elements()
117 if (ring->head > *tail) in lws_ring_get_count_waiting_elements()
118 f = (int)(ring->head - *tail); in lws_ring_get_count_waiting_elements()
120 f = (int)((ring->buflen - *tail) + ring->head); in lws_ring_get_count_waiting_elements()
199 lws_ring_consume(struct lws_ring *ring, uint32_t *tail, void *dest, in lws_ring_consume() argument
203 void *orig_tail = tail; in lws_ring_consume()
207 if (!tail) { in lws_ring_consume()
[all …]
|
| /third_party/boost/boost/spirit/home/classic/utility/ |
| D | distinct.hpp | 45 : tail(chset<CharT>()) in distinct_parser()
50 : tail(tail_.derived()) in distinct_parser()
55 : tail(chset_p(letters)) in distinct_parser()
61 return lexeme_d[chseq_p(str) >> ~epsilon_p(tail)]; in operator ()()
64 TailT tail; member in boost::spirit::distinct_parser
89 : tail(chset<CharT>()) in distinct_directive()
94 : tail(chset_p(letters)) in distinct_directive()
99 : tail(tail_.derived()) in distinct_directive()
108 lexeme_d[as_parser<ParserT>::convert(subject) >> ~epsilon_p(tail)]; in operator []()
111 TailT tail; member in boost::spirit::distinct_directive
[all …]
|
| /third_party/node/deps/npm/node_modules/tar/node_modules/yallist/ |
| D | yallist.js | 13 self.tail = null
49 if (node === this.tail) {
50 this.tail = prev
78 if (!this.tail) {
79 this.tail = node
85 if (node === this.tail) {
93 var tail = this.tail
95 node.prev = tail
96 if (tail) {
97 tail.next = node
[all …]
|
| /third_party/node/deps/npm/node_modules/cross-spawn/node_modules/yallist/ |
| D | yallist.js | 12 self.tail = null
48 if (node === this.tail) {
49 this.tail = prev
75 if (!this.tail) {
76 this.tail = node
82 if (node === this.tail) {
90 var tail = this.tail
92 node.prev = tail
93 if (tail) {
94 tail.next = node
[all …]
|
| /third_party/node/deps/npm/node_modules/yallist/ |
| D | yallist.js | 13 self.tail = null
49 if (node === this.tail) {
50 this.tail = prev
76 if (!this.tail) {
77 this.tail = node
83 if (node === this.tail) {
91 var tail = this.tail
93 node.prev = tail
94 if (tail) {
95 tail.next = node
[all …]
|
| /third_party/iowow/src/utils/ |
| D | murmur3.c | 70 const uint8_t *tail = (const uint8_t *)(data + nblocks * 4); in murmur3_x86_32() local
74 k1 ^= (uint32_t)tail[2] << 16; in murmur3_x86_32()
77 k1 ^= (uint32_t)tail[1] << 8; in murmur3_x86_32()
80 k1 ^= (uint32_t)tail[0]; in murmur3_x86_32()
148 const uint8_t *tail = (const uint8_t *)(data + nblocks * 16); in murmur3_x86_128() local
157 k4 ^= (uint32_t)tail[14] << 16; in murmur3_x86_128()
160 k4 ^= (uint32_t)tail[13] << 8; in murmur3_x86_128()
163 k4 ^= (uint32_t)tail[12] << 0; in murmur3_x86_128()
170 k3 ^= (uint32_t)tail[11] << 24; in murmur3_x86_128()
173 k3 ^= (uint32_t)tail[10] << 16; in murmur3_x86_128()
[all …]
|
| /third_party/boost/libs/phoenix/test/function/ |
| D | lazy_list_tests.cpp | 31 using phx::tail; 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()
59 BOOST_TEST(head(tail(l6))() == 3); in main()
60 BOOST_TEST(head(tail(arg1))(l6) == 3); in main()
61 BOOST_TEST(head(tail(l7))() == 4); in main()
[all …]
|
| /third_party/glib/glib/tests/ |
| D | queue.c | 24 g_assert (!queue->tail); in check_integrity()
25 if (!queue->tail) in check_integrity()
37 g_assert (last == queue->tail); in check_integrity()
41 for (list = queue->tail; list != NULL; list = list->prev) in check_integrity()
55 for (list = queue->tail; list != NULL; list = list->prev) in check_integrity()
63 for (list = queue->tail; list != NULL; list = list->prev) in check_integrity()
219 GList *tail; in random_test() member
234 queues[i].tail = NULL; in random_test()
246 g_assert (qinf->tail == q->tail); in random_test()
256 g_assert (q->tail == NULL); in random_test()
[all …]
|
| /third_party/flutter/skia/third_party/externals/harfbuzz/src/ |
| D | hb-serialize.hh | 50 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()
116 this->tail = this->end; in reset()
185 obj->tail = tail; in push()
204 obj->tail = head; in pop_pack()
206 unsigned len = obj->tail - obj->head; in pop_pack()
222 tail -= len; in pop_pack()
[all …]
|
| /third_party/boost/libs/wave/src/cpplexer/re2clex/ |
| D | aq.cpp | 47 ((q->tail + q->max_size + 1) - q->head) % q->max_size == \ in aq_grow()
52 BOOST_ASSERT(q->tail <= q->max_size); in aq_grow()
61 if (q->tail <= q->head) /* tail has wrapped around */ in aq_grow()
65 (q->tail + 1) * sizeof(aq_stdelement)); in aq_grow()
66 q->tail += q->max_size; in aq_grow()
73 BOOST_ASSERT(q->tail <= q->max_size); in aq_grow()
84 BOOST_ASSERT(q->tail <= q->max_size); in aq_enqueue()
91 ++q->tail; in aq_enqueue()
92 if (q->tail == q->max_size) in aq_enqueue()
93 q->tail = 0; in aq_enqueue()
[all …]
|
| /third_party/skia/experimental/sktext/src/ |
| D | Line.h | 32 void merge(TextMetrics tail) { in merge() argument
33 this->fAscent = std::min(this->fAscent, tail.fAscent); in merge()
34 this->fDescent = std::max(this->fDescent, tail.fDescent); in merge()
35 this->fLeading = std::max(this->fLeading, tail.fLeading); in merge()
121 void moveTo(Stretch& tail) { in moveTo() argument
123 if (tail.isEmpty()) { in moveTo()
128 if (!tail.isEmpty()) { in moveTo()
129 this->fGlyphStart = tail.fGlyphStart; in moveTo()
130 this->fGlyphEnd = tail.fGlyphEnd; in moveTo()
131 this->fWidth = tail.fWidth; in moveTo()
[all …]
|
| /third_party/mindspore/mindspore/core/mindrt/src/thread/ |
| D | hqueue.h | 95 Pointer tail = qtail; in Enqueue() local
96 if (tail.index == -1) { in Enqueue()
99 Pointer next = nodes[tail.index]->next; in Enqueue()
101 if (tail != this->qtail) { in Enqueue()
106 this->qtail.compare_exchange_strong(tail, {next.index, tail.version + 1}); in Enqueue()
110 if (nodes[tail.index]->next.compare_exchange_strong(next, {nodeIdx, next.version + 1})) { in Enqueue()
111 this->qtail.compare_exchange_strong(tail, {nodeIdx, tail.version + 1}); in Enqueue()
123 Pointer tail = qtail; in Dequeue() local
133 if (head.index == tail.index) { in Dequeue()
137 this->qtail.compare_exchange_strong(tail, {next.index, tail.version + 1}); in Dequeue()
[all …]
|
| /third_party/mesa3d/src/util/ |
| D | u_vector.c | 49 vector->tail = 0; in u_vector_init_pow2()
63 if (vector->head - vector->tail == vector->size) { in u_vector_add()
68 src_tail = vector->tail & (vector->size - 1); in u_vector_add()
69 dst_tail = vector->tail & (size - 1); in u_vector_add()
81 split = u_align_u32(vector->tail, vector->size); in u_vector_add()
82 assert(vector->tail <= split && split < vector->head); in u_vector_add()
84 split - vector->tail); in u_vector_add()
93 assert(vector->head - vector->tail < vector->size); in u_vector_add()
106 if (vector->head == vector->tail) in u_vector_remove()
109 assert(vector->head - vector->tail <= vector->size); in u_vector_remove()
[all …]
|
| /third_party/glib/glib/ |
| D | gqueue.c | 131 queue->head = queue->tail = NULL; in g_queue_init()
222 queue->tail = queue->head; in g_queue_reverse()
357 queue->tail = g_list_last (queue->head); in g_queue_sort()
374 if (!queue->tail) in g_queue_push_head()
375 queue->tail = queue->head; in g_queue_push_head()
427 queue->tail = link; in g_queue_push_head_link()
445 queue->tail = g_list_append (queue->tail, data); in g_queue_push_tail()
446 if (queue->tail->next) in g_queue_push_tail()
447 queue->tail = queue->tail->next; in g_queue_push_tail()
449 queue->head = queue->tail; in g_queue_push_tail()
[all …]
|
| /third_party/harfbuzz/src/ |
| D | hb-serialize.hh | 72 return (tail - head == o.tail - o.head) in operator ==()
74 && 0 == hb_memcmp (head, o.head, tail - head) in operator ==()
79 return hb_bytes_t (head, tail - head).hash () ^ in hash()
94 char *tail; member
102 char *tail; member
108 { return snapshot_t { head, tail, current, current->links.length }; } in snapshot()
152 this->tail = this->end; in reset()
242 obj->tail = tail; in push()
255 revert (obj->head, obj->tail); in pop_discard()
271 obj->tail = head; in pop_pack()
[all …]
|
| /third_party/skia/third_party/externals/abseil-cpp/absl/strings/internal/ |
| D | cord_rep_ring.cc | 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()
100 } while (head != rep.tail()); in operator <<()
221 assert(head() == 0 || head() < tail()); in SetCapacityForTesting()
244 UnrefEntries(rep, rep->head(), rep->tail()); in Destroy()
250 index_type tail) { in Fill() argument
253 tail_ = advance(0, src->entries(head, tail)); in Fill()
260 src->ForEach(head, tail, [&](index_type index) { in Fill()
269 index_type tail, size_t extra) { in Copy() argument
270 CordRepRing* newrep = CordRepRing::New(rep->entries(head, tail), extra); in Copy()
[all …]
|
| /third_party/gstreamer/gstreamer/gst/ |
| D | gstatomicqueue.c | 224 gint head, tail, size; in gst_atomic_queue_peek() local
234 tail = g_atomic_int_get (&head_mem->tail_read); in gst_atomic_queue_peek()
238 if (G_LIKELY (head != tail)) in gst_atomic_queue_peek()
275 gint head, tail, size; in gst_atomic_queue_pop() local
290 tail = g_atomic_int_get (&head_mem->tail_read); in gst_atomic_queue_pop()
295 (head != tail) in gst_atomic_queue_pop()
341 gint head, tail, size; in gst_atomic_queue_push() local
351 tail = g_atomic_int_get (&tail_mem->tail_write); in gst_atomic_queue_push()
356 (tail - head <= size) in gst_atomic_queue_push()
360 mem = new_queue_mem ((size << 1) + 1, tail); in gst_atomic_queue_push()
[all …]
|
| /third_party/ffmpeg/libavfilter/dnn/ |
| D | queue.c | 36 QueueEntry *tail; member
55 q->tail = create_entry(q); in ff_queue_create()
57 if (!q->head || !q->tail) { in ff_queue_create()
59 av_freep(&q->tail); in ff_queue_create()
64 q->head->next = q->tail; in ff_queue_create()
65 q->tail->prev = q->head; in ff_queue_create()
67 q->tail->next = NULL; in ff_queue_create()
107 return q->tail->prev->value; in ff_queue_peek_back()
141 original_prev = q->tail->prev; in ff_queue_push_back()
143 q->tail->prev = new_entry; in ff_queue_push_back()
[all …]
|
| /third_party/boost/libs/accumulators/test/ |
| D | tail.cpp | 43 check_tail(tail(acc), "\10"); in test_right_tail()
48 check_tail(tail(acc), "\20\10"); in test_right_tail()
53 check_tail(tail(acc), "\20\14\10"); in test_right_tail()
58 check_tail(tail(acc), "\30\20\14\10"); in test_right_tail()
63 check_tail(tail(acc), "\30\20\14\10"); in test_right_tail()
68 check_tail(tail(acc), "\30\20\14\11"); in test_right_tail()
84 check_tail(tail(acc), "\10"); in test_left_tail()
89 check_tail(tail(acc), "\10\20"); in test_left_tail()
94 check_tail(tail(acc), "\10\14\20"); in test_left_tail()
99 check_tail(tail(acc), "\10\14\20\30"); in test_left_tail()
[all …]
|
| /third_party/skia/third_party/externals/harfbuzz/src/ |
| D | hb-serialize.hh | 72 return (tail - head == o.tail - o.head) in operator ==()
74 && 0 == hb_memcmp (head, o.head, tail - head) in operator ==()
79 return hb_bytes_t (head, tail - head).hash () ^ in hash()
94 char *tail; member
102 char *tail; member
109 { return snapshot_t { head, tail, current, current->links.length, errors }; } in snapshot()
159 this->tail = this->end; in reset()
249 obj->tail = tail; in push()
262 revert (obj->head, obj->tail); in pop_discard()
278 obj->tail = head; in pop_pack()
[all …]
|
| /third_party/ltp/testcases/kernel/syscalls/io_uring/ |
| D | io_uring01.c | 37 unsigned int *tail; member
46 unsigned int *tail; member
96 sring->tail = sptr + p.sq_off.tail; in setup_io_uring_test()
119 cring->tail = cptr + p.cq_off.tail; in setup_io_uring_test()
148 for (head = *cring->head; head != *cring->tail; head++) { in drain_uring_cq()
180 unsigned int index = 0, tail = 0, next_tail = 0; in submit_to_uring_sq() local
199 tail = *sring->tail; in submit_to_uring_sq()
200 next_tail = tail + 1; in submit_to_uring_sq()
201 index = tail & *s->sq_ring.ring_mask; in submit_to_uring_sq()
211 tail = next_tail; in submit_to_uring_sq()
[all …]
|
| /third_party/selinux/libsepol/cil/src/ |
| D | cil_list.c | 51 new_list->tail = NULL; in cil_list_init()
111 if (list->tail == NULL) { in cil_list_append()
113 list->tail = item; in cil_list_append()
117 list->tail->next = item; in cil_list_append()
118 list->tail = item; in cil_list_append()
133 if (list->tail == NULL) { in cil_list_prepend()
135 list->tail = item; in cil_list_prepend()
157 if (curr == list->tail) { in cil_list_insert()
159 return list->tail; in cil_list_insert()
188 if (list->tail == NULL) { in cil_list_append_item()
[all …]
|
| /third_party/littlefs/scripts/ |
| D | readtree.py | 18 tail = (args.block1, args.block2)
22 if set(m.blocks) == set(tail):
31 for block in tail:
42 mdir.tail = mdir[Tag('tail', 0, 0)]
43 if mdir.tail.size != 8 or mdir.tail.data == 8*b'\xff':
44 mdir.tail = None
46 mdir.tail = None
70 if mdir.tail is None or not mdir.tail.is_('hardtail'):
74 if mdir.tail is None:
77 tail = struct.unpack('<II', mdir.tail.data)
[all …]
|
| /third_party/gstreamer/gstplugins_bad/gst/removesilence/ |
| D | vad_private.c | 47 union pgen tail; member
81 vad->cqueue.tail.a = vad->cqueue.head.a = 0; in vad_reset()
120 guint64 tail; in vad_update() local
132 if (p->cqueue.head.a == p->cqueue.tail.a) in vad_update()
133 p->cqueue.tail.a = (p->cqueue.tail.a + 1) & (p->cqueue.size - 1); in vad_update()
136 tail = p->cqueue.tail.a; in vad_update()
139 sample = p->cqueue.base.s[tail]; in vad_update()
140 tail = (tail + 1) & (p->cqueue.size - 1); in vad_update()
141 if (tail == p->cqueue.head.a) in vad_update()
144 ((sample & 0x8000) != (p->cqueue.base.s[tail] & 0x8000)) ? 1 : -1; in vad_update()
|
| /third_party/node/lib/internal/ |
| D | fixed_queue.js | 92 this.head = this.tail = new FixedCircularBuffer();
109 const tail = this.tail;
110 const next = tail.shift();
111 if (tail.isEmpty() && tail.next !== null) {
113 this.tail = tail.next;
|