Home
last modified time | relevance | path

Searched refs:tail (Results 26 - 50 of 679) sorted by relevance

12345678910>>...28

/third_party/rust/crates/clap/src/
H A Dmacros.rs205 $($tail:tt)*
220 @arg (arg) $($tail)*
228 $($tail:tt)*
243 @arg (arg) $($tail)*
251 $($tail:tt)*
262 @arg (arg) $($tail)*
270 $($tail:tt)*
281 @arg (arg) $($tail)*
289 $($tail:tt)*
308 @arg (arg) $($tail)*
[all...]
/third_party/mesa3d/src/gallium/drivers/llvmpipe/
H A Dlp_scene.h100 struct cmd_block *tail; member
323 struct cmd_block *tail = bin->tail; in lp_scene_bin_command() local
329 if (tail == NULL || tail->count == CMD_BLOCK_MAX) { in lp_scene_bin_command()
330 tail = lp_scene_new_cmd_block(scene, bin); in lp_scene_bin_command()
331 if (!tail) { in lp_scene_bin_command()
334 assert(tail->count == 0); in lp_scene_bin_command()
338 unsigned i = tail->count; in lp_scene_bin_command()
339 tail in lp_scene_bin_command()
[all...]
/third_party/libwebsockets/minimal-examples/ws-server/minimal-ws-server-ring/
H A Dprotocol_lws_minimal.c36 uint32_t tail; member
62 * At least one guy with the oldest tail has lagged too far, filling in cull_lagging_clients()
70 if ((*ppss)->tail == oldest_tail) { in cull_lagging_clients()
115 &((*ppss)->tail)); in cull_lagging_clients()
132 struct per_session_data__minimal, &old_pss->tail, (size_t)(before - most), in cull_lagging_clients()
133 vhd->pss_list, tail, pss_list); in cull_lagging_clients()
187 pss->tail = lws_ring_get_oldest_tail(vhd->ring); in callback_minimal()
201 pmsg = lws_ring_get_element(vhd->ring, &pss->tail); in callback_minimal()
216 &pss->tail, /* tail o in callback_minimal()
[all...]
/third_party/skia/third_party/externals/freetype/builds/atari/
H A Ddeflinejoiner.awk90 tail, removed_length, k )
92 tail = substr( logical_line, pos )
93 sub( /^[ \t]+/, " ", tail )
94 removed_length = length( logical_line ) - pos - length( tail ) + 1
95 logical_line = substr( logical_line, 0, pos - 1 ) tail
121 tail = substr( logical_line, pos + removed_length )
122 logical_line = substr( logical_line, 0, pos - 1 ) tail
132 tail, paren_depth, junk, i, j, k, l )
136 tail = logical_line
137 sub( /^[ \t]*#[ \t]*define[ \t]+[0-9A-Za-z_]+/, "", tail )
[all...]
/third_party/curl/lib/
H A Dbufq.c246 q->tail = NULL; in Curl_bufq_free()
259 q->tail = NULL; in Curl_bufq_reset()
276 if(q->tail) in Curl_bufq_space()
277 space += chunk_space(q->tail); in Curl_bufq_space()
298 if(!q->tail || q->spare) in Curl_bufq_is_full()
304 /* we have no spares and cannot make more, is the tail full? */ in Curl_bufq_is_full()
305 return chunk_is_full(q->tail); in Curl_bufq_is_full()
345 if(q->tail == chunk) in prune_head()
346 q->tail = q->head; in prune_head()
370 if(q->tail in get_non_full_tail()
391 struct buf_chunk *tail; Curl_bufq_write() local
579 struct buf_chunk *tail = NULL; Curl_bufq_sipn() local
[all...]
H A Dllist.c44 l->tail = NULL; in Curl_llist_init()
68 list->tail = ne; in Curl_llist_insert_next()
82 list->tail = ne; in Curl_llist_insert_next()
106 list->tail = NULL; in Curl_llist_remove()
115 list->tail = e->prev; in Curl_llist_remove()
138 Curl_llist_remove(list, list->tail, user); in Curl_llist_destroy()
/third_party/backends/backend/
H A Depsonds-ops.c394 SANE_Int tail; in eds_ring_write() local
401 tail = ring->end - ring->wp; in eds_ring_write()
402 if (size < tail) { in eds_ring_write()
411 memcpy(ring->wp, buf, tail); in eds_ring_write()
412 size -= tail; in eds_ring_write()
415 memcpy(ring->wp, buf + tail, size); in eds_ring_write()
418 ring->fill += (tail + size); in eds_ring_write()
426 SANE_Int tail; in eds_ring_read() local
436 tail = ring->end - ring->rp; in eds_ring_read()
437 if (size < tail) { in eds_ring_read()
463 SANE_Int tail; eds_ring_skip() local
[all...]
/third_party/python/Lib/xml/etree/
H A DElementInclude.py157 if e.tail:
158 node.tail = (node.tail or "") + e.tail
166 if e.tail:
167 text += e.tail
170 node.tail = (node.tail or "") + text
/third_party/selinux/checkpolicy/
H A Dqueue.c21 q->head = q->tail = NULL; in queue_create()
41 q->head = q->tail = newnode; in queue_insert()
43 q->tail->next = newnode; in queue_insert()
44 q->tail = newnode; in queue_insert()
65 q->head = q->tail = newnode; in queue_push()
88 q->tail = NULL; in queue_remove()
161 q->tail = last; in queue_map_remove_on_error()
165 q->tail = NULL; in queue_map_remove_on_error()
/third_party/skia/src/core/
H A DSkImageFilterCache.cpp87 Value* tail = fLRU.tail(); variable
88 SkASSERT(tail); variable
89 if (tail == v) {
92 this->removeInternal(tail);
99 Value* tail = fLRU.tail(); variable
100 SkASSERT(tail); variable
101 this->removeInternal(tail);
/third_party/python/Lib/idlelib/
H A Dformat.py232 tail = text.index(last + "-1c lineend +1c")
235 tail = text.index("insert lineend +1c")
236 chars = text.get(head, tail)
238 return head, tail, chars, lines
240 def set_region(self, head, tail, chars, lines):
245 tail: Ending index of text to replace.
247 between head and tail.
249 and tail.
259 text.delete(head, tail)
266 head, tail, char
[all...]
/third_party/node/deps/cares/src/lib/
H A Dares__llist.c33 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...]
H A Dares_getaddrinfo.c110 struct ares_addrinfo_cname *tail = ares_malloc_zero(sizeof(*tail)); in ares__append_addrinfo_cname() local
113 if (tail == NULL) { in ares__append_addrinfo_cname()
118 *head = tail; in ares__append_addrinfo_cname()
119 return tail; in ares__append_addrinfo_cname()
126 last->next = tail; in ares__append_addrinfo_cname()
127 return tail; in ares__append_addrinfo_cname()
131 struct ares_addrinfo_cname *tail) in ares__addrinfo_cat_cnames()
135 *head = tail; in ares__addrinfo_cat_cnames()
143 last->next = tail; in ares__addrinfo_cat_cnames()
130 ares__addrinfo_cat_cnames(struct ares_addrinfo_cname **head, struct ares_addrinfo_cname *tail) ares__addrinfo_cat_cnames() argument
150 struct ares_addrinfo_node *tail = ares_malloc_zero(sizeof(*tail)); ares__append_addrinfo_node() local
170 ares__addrinfo_cat_nodes(struct ares_addrinfo_node **head, struct ares_addrinfo_node *tail) ares__addrinfo_cat_nodes() argument
[all...]
/third_party/skia/third_party/externals/dawn/src/tests/unittests/
H A DLinkedListTests.cpp58 // 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...]
/third_party/vk-gl-cts/external/vulkan-docs/src/scripts/
H A Dgenerator.py1056 def makeProtoName(self, name, tail):
1061 - tail - whatever text follows that tag in the Element"""
1064 return self.genOpts.apientry + name + tail
1066 def makeTypedefName(self, name, tail):
1070 return '(' + self.genOpts.apientryp + 'PFN_' + name + tail + ')'
1090 tail = noneStr(elem.tail)
1092 if self.should_insert_may_alias_macro and self.genOpts.conventions.is_voidpointer_alias(elem.tag, text, tail):
1094 tail = self.genOpts.conventions.make_voidpointer_alias(tail)
[all...]
/third_party/vulkan-headers/registry/
H A Dgenerator.py1056 def makeProtoName(self, name, tail):
1061 - tail - whatever text follows that tag in the Element"""
1064 return self.genOpts.apientry + name + tail
1066 def makeTypedefName(self, name, tail):
1070 return '(' + self.genOpts.apientryp + 'PFN_' + name + tail + ')'
1090 tail = noneStr(elem.tail)
1092 if self.should_insert_may_alias_macro and self.genOpts.conventions.is_voidpointer_alias(elem.tag, text, tail):
1094 tail = self.genOpts.conventions.make_voidpointer_alias(tail)
[all...]
/third_party/nghttp2/lib/
H A Dnghttp2_outbound_item.c104 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/node/deps/nghttp2/lib/
H A Dnghttp2_outbound_item.c104 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 Dfix_dict.py50 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)
/third_party/vk-gl-cts/external/vulkan-docs/src/scripts/Retired/
H A DextensionStubSource.py253 tail = noneStr(nameTag.tail)
256 type = self.makeFunctionPointerType(nameTag.text, tail)
259 # declaration. Otherwise append its contents and tail con#tents.
263 tail = noneStr(elem.tail)
265 name = self.makeProtoName(text, tail)
268 stubDecl += text + tail
270 pfnName = self.makeFunctionPointerName(nameTag.text, noneStr(tail));
311 def makeFunctionPointerType(self, name, tail)
[all...]
/third_party/node/lib/internal/streams/
H A Dbuffer_list.js16 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/curl/tests/unit/
H A Dunit1300.c72 * 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 Du_worklist.c103 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()
/third_party/skia/third_party/externals/harfbuzz/src/
H A Dhb-set-digest.hh120 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/libwebsockets/minimal-examples/ws-server/minimal-ws-server-threads-foreign-libuv-smp/mount-origin/
H A Dexample.js1 var head = 0, tail = 0, ring = new Array();
47 if (tail === head)
48 tail = (tail + 1) % 50;
50 n = tail;

Completed in 13 milliseconds

12345678910>>...28