| /third_party/node/deps/nghttp2/lib/ |
| H A D | nghttp2_outbound_item.c | 104 q->head = q->tail = NULL; in nghttp2_outbound_queue_init()
110 if (q->tail) { in nghttp2_outbound_queue_push()
111 q->tail = q->tail->qnext = item; in nghttp2_outbound_queue_push()
113 q->head = q->tail = item; in nghttp2_outbound_queue_push()
127 q->tail = NULL; in nghttp2_outbound_queue_pop()
|
| /third_party/python/Lib/lib2to3/fixes/ |
| H A D | fix_dict.py | 50 tail=any*
57 tail = results["tail"]
66 tail = [n.clone() for n in tail]
67 special = not tail and self.in_special_context(node, isiter)
77 if tail:
78 new = pytree.Node(syms.power, [new] + tail)
|
| /kernel/linux/linux-5.10/drivers/of/ |
| H A D | pdt.c | 114 struct property *head, *tail; in of_pdt_build_prop_list() local
116 head = tail = of_pdt_build_one_prop(node, NULL, in of_pdt_build_prop_list()
119 tail->next = of_pdt_build_one_prop(node, NULL, NULL, NULL, 0); in of_pdt_build_prop_list()
120 tail = tail->next; in of_pdt_build_prop_list()
121 while(tail) { in of_pdt_build_prop_list()
122 tail->next = of_pdt_build_one_prop(node, tail->name, in of_pdt_build_prop_list()
124 tail = tail in of_pdt_build_prop_list()
[all...] |
| /kernel/linux/linux-6.6/drivers/of/ |
| H A D | pdt.c | 114 struct property *head, *tail; in of_pdt_build_prop_list() local
116 head = tail = of_pdt_build_one_prop(node, NULL, in of_pdt_build_prop_list()
119 tail->next = of_pdt_build_one_prop(node, NULL, NULL, NULL, 0); in of_pdt_build_prop_list()
120 tail = tail->next; in of_pdt_build_prop_list()
121 while(tail) { in of_pdt_build_prop_list()
122 tail->next = of_pdt_build_one_prop(node, tail->name, in of_pdt_build_prop_list()
124 tail = tail in of_pdt_build_prop_list()
[all...] |
| /third_party/node/deps/cares/src/lib/ |
| H A D | ares__llist.c | 33 ares__llist_node_t *tail; member
100 node->prev = list->tail; in ares__llist_attach_at()
101 if (list->tail) { in ares__llist_attach_at()
102 list->tail->next = node; in ares__llist_attach_at()
104 list->tail = node; in ares__llist_attach_at()
112 if (list->tail == NULL) { in ares__llist_attach_at()
113 list->tail = node; in ares__llist_attach_at()
194 return list->tail; in ares__llist_node_last()
270 if (node == list->tail) { in ares__llist_node_detach()
271 list->tail in ares__llist_node_detach()
[all...] |
| /kernel/linux/linux-5.10/arch/x86/kernel/ |
| H A D | static_call.c | 10 JMP = 2, /* tramp / site tail-call */
11 RET = 3, /* tramp / site cond-tail-call */
59 static void __static_call_validate(void *insn, bool tail) in __static_call_validate() argument
63 if (tail) { in __static_call_validate()
79 static inline enum insn_type __sc_insn(bool null, bool tail) in __sc_insn() argument
84 * tail null insn in __sc_insn()
91 return 2*tail + null; in __sc_insn()
94 void arch_static_call_transform(void *site, void *tramp, void *func, bool tail) in arch_static_call_transform() argument
104 __static_call_validate(site, tail); in arch_static_call_transform()
105 __static_call_transform(site, __sc_insn(!func, tail), fun in arch_static_call_transform()
[all...] |
| /kernel/linux/linux-6.6/include/linux/ |
| H A D | pipe_fs_i.h | 40 * @tail: The point of buffer consumption
62 unsigned int tail; member
146 * @tail: The pipe ring tail pointer
148 static inline bool pipe_empty(unsigned int head, unsigned int tail) in pipe_empty() argument
150 return head == tail; in pipe_empty()
156 * @tail: The pipe ring tail pointer
158 static inline unsigned int pipe_occupancy(unsigned int head, unsigned int tail) in pipe_occupancy() argument
160 return head - tail; in pipe_occupancy()
169 pipe_full(unsigned int head, unsigned int tail, unsigned int limit) pipe_full() argument
[all...] |
| /kernel/linux/linux-6.6/arch/x86/kernel/ |
| H A D | static_call.c | 10 JMP = 2, /* tramp / site tail-call */
11 RET = 3, /* tramp / site cond-tail-call */
114 static void __static_call_validate(u8 *insn, bool tail, bool tramp) in __static_call_validate() argument
123 if (tail) { in __static_call_validate()
142 static inline enum insn_type __sc_insn(bool null, bool tail) in __sc_insn() argument
147 * tail null insn in __sc_insn()
154 return 2*tail + null; in __sc_insn()
157 void arch_static_call_transform(void *site, void *tramp, void *func, bool tail) in arch_static_call_transform() argument
167 __static_call_validate(site, tail, false); in arch_static_call_transform()
168 __static_call_transform(site, __sc_insn(!func, tail), fun in arch_static_call_transform()
[all...] |
| /third_party/curl/tests/unit/ |
| H A D | unit1300.c | 72 * 3: list tail will be NULL
78 fail_unless(llist.tail == NULL, "list tail should initiate to NULL");
89 * 3: list tail will be the same as list head
99 /* same goes for the list tail */
100 fail_unless(llist.tail == llist.head,
101 "tail and head should be the same");
109 * 2: the list tail should be our newly created element
116 fail_unless(llist.tail->ptr == &unusedData_case3,
117 "the list tail i
[all...] |
| /third_party/mesa3d/src/util/ |
| H A D | u_worklist.c | 103 unsigned tail = (w->start + w->count - 1) % w->size; in u_worklist_push_tail_index() local
105 w->entries[tail] = index; in u_worklist_push_tail_index()
114 unsigned tail = (w->start + w->count - 1) % w->size; in u_worklist_peek_tail_index() local
116 return w->entries[tail]; in u_worklist_peek_tail_index()
124 unsigned tail = (w->start + w->count - 1) % w->size; in u_worklist_pop_tail_index() local
128 BITSET_CLEAR(w->present, *(w->entries[tail])); in u_worklist_pop_tail_index()
129 return w->entries[tail]; in u_worklist_pop_tail_index()
|
| H A D | u_fifo.h | 34 size_t tail; member
46 fifo->tail = 0; in u_fifo_create()
78 if (++fifo->tail >= fifo->size) in u_fifo_pop()
79 fifo->tail = 0; in u_fifo_pop()
81 *ptr = array[fifo->tail]; in u_fifo_pop()
|
| /third_party/skia/third_party/externals/harfbuzz/src/ |
| H A D | hb-set-digest.hh | 120 tail.init (); in init()
126 tail.add (g); in add()
132 tail.add_range (a, b); in add_range()
139 tail.add_array (array, count, stride); in add_array()
147 tail.add_sorted_array (array, count, stride); in add_sorted_array()
155 return head.may_have (g) && tail.may_have (g); in may_have()
160 tail_t tail; member
|
| /third_party/node/lib/internal/streams/ |
| H A D | buffer_list.js | 16 this.tail = null;
23 this.tail.next = entry;
26 this.tail = entry;
33 this.tail = entry;
43 this.head = this.tail = null;
51 this.head = this.tail = null;
123 this.head = this.tail = null;
155 this.head = this.tail = null;
|
| /third_party/skia/third_party/externals/dawn/src/tests/unittests/ |
| H A D | LinkedListTests.cpp | 58 // Checks that when iterating |list| (either from head to tail, or from
59 // tail to head, as determined by |forward|), we get back |node_ids|,
66 for (const LinkNode<Node>* node = (forward ? list.head() : list.tail()); node != list.end(); in ExpectListContentsForDirection()
78 SCOPED_TRACE("Iterating forward (from head to tail)"); in ExpectListContents()
82 SCOPED_TRACE("Iterating backward (from tail to head)"); in ExpectListContents()
90 EXPECT_EQ(list.end(), list.tail()); in TEST()
102 EXPECT_EQ(&n1, list.tail()); in TEST()
112 EXPECT_EQ(&n2, list.tail()); in TEST()
122 EXPECT_EQ(&n3, list.tail()); in TEST()
145 EXPECT_EQ(&n5, list.tail()); in TEST()
[all...] |
| /kernel/linux/linux-5.10/drivers/s390/block/ |
| H A D | dasd_eer.c | 92 int tail; member
106 if (eerb->head < eerb->tail) in dasd_eer_get_free_bytes()
107 return eerb->tail - eerb->head - 1; in dasd_eer_get_free_bytes()
108 return eerb->buffersize - eerb->head + eerb->tail -1; in dasd_eer_get_free_bytes()
118 if (eerb->head >= eerb->tail) in dasd_eer_get_filled_bytes()
119 return eerb->head - eerb->tail; in dasd_eer_get_filled_bytes()
120 return eerb->buffersize - eerb->tail + eerb->head; in dasd_eer_get_filled_bytes()
167 tailindex = eerb->tail / PAGE_SIZE; in dasd_eer_read_buffer()
168 localtail = eerb->tail % PAGE_SIZE; in dasd_eer_read_buffer()
173 eerb->tail in dasd_eer_read_buffer()
[all...] |
| /kernel/linux/linux-6.6/drivers/s390/block/ |
| H A D | dasd_eer.c | 92 int tail; member
106 if (eerb->head < eerb->tail) in dasd_eer_get_free_bytes()
107 return eerb->tail - eerb->head - 1; in dasd_eer_get_free_bytes()
108 return eerb->buffersize - eerb->head + eerb->tail -1; in dasd_eer_get_free_bytes()
118 if (eerb->head >= eerb->tail) in dasd_eer_get_filled_bytes()
119 return eerb->head - eerb->tail; in dasd_eer_get_filled_bytes()
120 return eerb->buffersize - eerb->tail + eerb->head; in dasd_eer_get_filled_bytes()
167 tailindex = eerb->tail / PAGE_SIZE; in dasd_eer_read_buffer()
168 localtail = eerb->tail % PAGE_SIZE; in dasd_eer_read_buffer()
173 eerb->tail in dasd_eer_read_buffer()
[all...] |
| /kernel/linux/linux-6.6/tools/testing/selftests/bpf/benchs/ |
| H A D | run_common.sh | 62 summary=$(echo $2 | tail -n1)
69 summary=$(echo $2 | tail -n1)
76 summary=$(echo $2 | tail -n1)
83 summary=$(echo $2 | tail -n1)
90 summary=$(echo $2 | tail -n1)
|
| /third_party/libwebsockets/minimal-examples/ws-server/minimal-ws-server-threads-foreign-libuv-smp/mount-origin/ |
| H A D | example.js | 1 var head = 0, tail = 0, ring = new Array();
47 if (tail === head)
48 tail = (tail + 1) % 50;
50 n = tail;
|
| /third_party/libwebsockets/minimal-examples/client-server/minimal-ws-proxy/mount-origin/ |
| H A D | example.js | 1 var head = 0, tail = 0, ring = new Array();
47 if (tail === head)
48 tail = (tail + 1) % 20;
50 n = tail;
|
| /third_party/libwebsockets/minimal-examples/ws-server/minimal-ws-server-threadpool/mount-origin/ |
| H A D | example.js | 1 var head = 0, tail = 0, ring = new Array();
53 if (tail === head)
54 tail = (tail + 1) % 50;
56 n = tail;
|
| /third_party/libwebsockets/minimal-examples/ws-server/minimal-ws-server-threads/mount-origin/ |
| H A D | example.js | 1 var head = 0, tail = 0, ring = new Array();
47 if (tail === head)
48 tail = (tail + 1) % 50;
50 n = tail;
|
| /third_party/libwebsockets/minimal-examples/ws-server/minimal-ws-server-threads-smp/mount-origin/ |
| H A D | example.js | 1 var head = 0, tail = 0, ring = new Array();
47 if (tail === head)
48 tail = (tail + 1) % 50;
50 n = tail;
|
| /kernel/linux/linux-5.10/sound/core/seq/ |
| H A D | seq_prioq.c | 52 f->tail = NULL; in snd_seq_prioq_new()
150 if (f->tail && !prior) { in snd_seq_prioq_cell_in()
151 if (compare_timestamp(&cell->event, &f->tail->event)) { in snd_seq_prioq_cell_in()
152 /* add new cell to tail of the fifo */ in snd_seq_prioq_cell_in()
153 f->tail->next = cell; in snd_seq_prioq_cell_in()
154 f->tail = cell; in snd_seq_prioq_cell_in()
196 f->tail = cell; in snd_seq_prioq_cell_in()
230 /* reset tail if this was the last element */ in snd_seq_prioq_cell_out()
231 if (f->tail == cell) in snd_seq_prioq_cell_out()
232 f->tail in snd_seq_prioq_cell_out()
[all...] |
| /kernel/linux/linux-5.10/tools/perf/util/ |
| H A D | block-range.c | 205 struct block_range *tail = malloc(sizeof(struct block_range)); in block_range__create() local
206 if (!tail) in block_range__create()
209 *tail = (struct block_range){ in block_range__create()
225 rb_link_right_of_node(&tail->node, &entry->node); in block_range__create()
226 rb_insert_color(&tail->node, &block_ranges.root); in block_range__create()
247 * If @end is in beyond @entry but not inside @next, add tail. in block_range__create()
249 if (end < next->start) { /* add tail: [...e->end][...end] */ in block_range__create()
250 struct block_range *tail; in block_range__create() local
252 tail = malloc(sizeof(struct block_range)); in block_range__create()
253 if (!tail) in block_range__create()
[all...] |
| /kernel/linux/linux-6.6/tools/perf/util/ |
| H A D | block-range.c | 201 struct block_range *tail = malloc(sizeof(struct block_range)); in block_range__create() local
202 if (!tail) in block_range__create()
205 *tail = (struct block_range){ in block_range__create()
221 rb_link_right_of_node(&tail->node, &entry->node); in block_range__create()
222 rb_insert_color(&tail->node, &block_ranges.root); in block_range__create()
243 * If @end is in beyond @entry but not inside @next, add tail. in block_range__create()
245 if (end < next->start) { /* add tail: [...e->end][...end] */ in block_range__create()
246 struct block_range *tail; in block_range__create() local
248 tail = malloc(sizeof(struct block_range)); in block_range__create()
249 if (!tail) in block_range__create()
[all...] |