Home
last modified time | relevance | path

Searched refs:tail (Results 1 - 25 of 679) sorted by relevance

12345678910>>...28

/third_party/libwebsockets/lib/misc/
H A Dlws-ring.c100 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()
255 lws_ring_get_element(struct lws_ring *ring, uint32_t *tail) lws_ring_get_element() argument
267 lws_ring_update_oldest_tail(struct lws_ring *ring, uint32_t tail) lws_ring_update_oldest_tail() argument
288 lws_ring_dump(struct lws_ring *ring, uint32_t *tail) lws_ring_dump() argument
[all...]
/third_party/musl/src/exit/linux/
H A Datexit.c30 static struct node *tail; // point to the last node, or NULL variable
55 // link new nodes after tail in grow()
56 if (tail) { in grow()
57 tail->next = nodes; in grow()
66 if (tail == NULL) { in append_node()
69 new_tail = tail->next; in append_node()
77 new_tail->prev = tail; in append_node()
78 tail = new_tail; in append_node()
85 if (tail == node) { in remove_node()
87 tail in remove_node()
[all...]
/third_party/musl/porting/linux/user/src/exit/
H A Datexit.c30 static struct node *tail; // point to the last node, or NULL variable
55 // link new nodes after tail in grow()
56 if (tail) { in grow()
57 tail->next = nodes; in grow()
67 if (tail == NULL) { in append_node()
70 new_tail = tail->next; in append_node()
78 new_tail->prev = tail; in append_node()
79 tail = new_tail; in append_node()
87 if (tail == node) { in RemoveNode()
89 tail in RemoveNode()
[all...]
/third_party/node/deps/npm/node_modules/yallist/
H A Dyallist.js13 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) {
[all...]
/third_party/node/lib/internal/streams/
H A Dcompose.js99 const tail = pipeline(streams, onfinished);
107 isReadable(tail) ||
108 isReadableStream(tail) ||
109 isTransformStream(tail)
118 readableObjectMode: !!tail?.readableObjectMode,
170 const toRead = isTransformStream(tail) ? tail.readable : tail;
182 if (isNodeStream(tail)) {
183 tail
[all...]
/third_party/skia/experimental/sktext/src/
H A DLine.h32 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 in moveTo()
[all...]
/third_party/rust/crates/regex/regex-syntax/src/hir/
H A Dvisitor.rs86 tail: &'a [Hir],
94 tail: &'a [Hir],
155 Some(Frame::Concat { head: &x[0], tail: &x[1..] }) in induct()
159 Some(Frame::Alternation { head: &x[0], tail: &x[1..] }) in induct()
171 Frame::Concat { tail, .. } => { in pop()
172 if tail.is_empty() { in pop()
175 Some(Frame::Concat { head: &tail[0], tail: &tail[1..] }) in pop()
178 Frame::Alternation { tail, in pop()
[all...]
/third_party/ltp/testcases/kernel/syscalls/io_uring/
H A Dio_uring01.c37 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
198 /* Submission queue entry addition to SQE ring buffer tail */ in submit_to_uring_sq()
199 tail in submit_to_uring_sq()
[all...]
H A Dio_uring02.c90 uint32_t i, count, tail; in drain_fallback() local
101 for (i = 0, tail = *uring.sqr_tail; i < 255; i++, tail++, sqe_ptr++) { in drain_fallback()
108 uring.sqr_array[tail & *uring.sqr_mask] = i; in drain_fallback()
118 uring.sqr_array[tail & *uring.sqr_mask] = i; in drain_fallback()
120 tail++; in drain_fallback()
122 __atomic_store(uring.sqr_tail, &tail, __ATOMIC_RELEASE); in drain_fallback()
127 __atomic_load(uring.cqr_tail, &tail, __ATOMIC_ACQUIRE); in drain_fallback()
129 for (i = *uring.cqr_head; i != tail; i++, count--) { in drain_fallback()
210 uint32_t tail; in run() local
[all...]
/third_party/rust/crates/regex/regex-syntax/src/ast/
H A Dvisitor.rs150 tail: &'a [Ast],
158 tail: &'a [Ast],
171 tail: &'a [ast::ClassSetItem],
270 Some(Frame::Concat { head: &x.asts[0], tail: &x.asts[1..] }) in induct()
275 tail: &x.asts[1..], in induct()
287 Frame::Concat { tail, .. } => { in pop()
288 if tail.is_empty() { in pop()
291 Some(Frame::Concat { head: &tail[0], tail: &tail[ in pop()
[all...]
/third_party/ffmpeg/libavfilter/dnn/
H A Dqueue.c35 QueueEntry *tail; member
54 q->tail = create_entry(q); in ff_queue_create()
56 if (!q->head || !q->tail) { in ff_queue_create()
58 av_freep(&q->tail); in ff_queue_create()
63 q->head->next = q->tail; in ff_queue_create()
64 q->tail->prev = q->head; in ff_queue_create()
66 q->tail->next = NULL; in ff_queue_create()
106 return q->tail->prev->value; in ff_queue_peek_back()
140 original_prev = q->tail->prev; in ff_queue_push_back()
142 q->tail in ff_queue_push_back()
[all...]
/third_party/skia/third_party/externals/harfbuzz/src/
H A Dhb-serialize.hh60 Tail, /* Relative to the current object tail after packed. */
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 in push()
639 char *start, *head, *tail, *end; global() member
[all...]
/third_party/mesa3d/src/util/
H A Du_vector.c31 * removed from tail. head and tail are free-running uint32_t indices and we
33 * number of bytes in the queue is always head - tail, even in case of
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()
[all...]
/third_party/littlefs/scripts/
H A Dreadtree.py18 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 i
[all...]
/third_party/selinux/libsepol/cil/src/
H A Dcil_list.c51 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 in cil_list_append_item()
[all...]
/third_party/skia/third_party/externals/abseil-cpp/absl/strings/internal/
H A 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 <<()
100 } while (head != rep.tail()); in operator <<()
141 output << "head " << head_ << " and/or tail " << tail_ << "exceed capacity " in IsValid()
221 assert(head() == 0 || head() < tail()); in SetCapacityForTesting()
244 UnrefEntries(rep, rep->head(), rep->tail()); in Destroy()
250 index_type tail) { in Fill()
253 tail_ = advance(0, src->entries(head, tail)); in Fill()
249 Fill(const CordRepRing* src, index_type head, index_type tail) Fill() argument
268 Copy(CordRepRing* rep, index_type head, index_type tail, size_t extra) Copy() argument
375 Position tail = ring->FindTail(head.index, offset + len); AddRing() local
544 const char* tail = data.data() + data.length() - avail.length(); Prepend() local
584 FindBinary(index_type head, index_type tail, size_t offset) const FindBinary() argument
603 index_type tail = tail_; FindSlow() local
632 index_type tail = tail_; FindTailSlow() local
678 Position tail = rep->FindTail(head.index, offset + len); global() local
747 Position tail = rep->FindTail(rep->length - len); RemoveSuffix() local
[all...]
/third_party/nghttp2/src/
H A Dmemchunk.h118 tail(nullptr), in Memchunks()
127 tail{std::exchange(other.tail, nullptr)},
142 tail = std::exchange(other.tail, nullptr);
161 if (!tail) { in append()
162 head = tail = pool->get(); in append()
163 } else if (tail->left() == 0) { in append()
164 tail->next = pool->get(); in append()
165 tail in append()
419 Memchunk *head, *tail; global() member
[all...]
/third_party/node/deps/openssl/openssl/util/
H A Dcheck-format.pl452 my ($head, $tail) = (substr($str, 0, $i).$1, $3);
471 $tail =~ m/^([\s@]*)([^\s\@])/;
487 # $tail =~ m/^[\s@]*\d+/ # this matching would need improvement
514 if $tail =~ m/^([^{]*)/ && $1 =~ m/[^\s\@;]/; # non-space non-';' before any '{'
608 if ((my ($head, $tail) = m|^(.*?)\*/(.*)$|) && $1 ne '/') { # ending comment: '*/'
610 report("missing space (or ',', ';', ')', '}', ']') after '*/'") if $tail =~ m/^[^\s,;)}\]]/; # no space or ,;)}] after '*/'
614 $_ = "$head@@".$tail; # blind the "*/"
625 $_ = blind_nonspace($cmt_text)."@@".$tail;
632 if (my ($head, $opt_minus, $tail) = m|^(.*?)/\*(-?)(.*)$|) { # begin of comment: '/*'
635 report("missing space, '*', or '!' after '/*$opt_minus'") if $tail
[all...]
/third_party/openssl/util/
H A Dcheck-format.pl452 my ($head, $tail) = (substr($str, 0, $i).$1, $3);
471 $tail =~ m/^([\s@]*)([^\s\@])/;
487 # $tail =~ m/^[\s@]*\d+/ # this matching would need improvement
514 if $tail =~ m/^([^{]*)/ && $1 =~ m/[^\s\@;]/; # non-space non-';' before any '{'
608 if ((my ($head, $tail) = m|^(.*?)\*/(.*)$|) && $1 ne '/') { # ending comment: '*/'
610 report("missing space (or ',', ';', ')', '}', ']') after '*/'") if $tail =~ m/^[^\s,;)}\]]/; # no space or ,;)}] after '*/'
614 $_ = "$head@@".$tail; # blind the "*/"
625 $_ = blind_nonspace($cmt_text)."@@".$tail;
632 if (my ($head, $opt_minus, $tail) = m|^(.*?)/\*(-?)(.*)$|) { # begin of comment: '/*'
635 report("missing space, '*', or '!' after '/*$opt_minus'") if $tail
[all...]
/third_party/python/Lib/lib2to3/pgen2/
H A Dliterals.py20 all, tail = m.group(0, 1)
22 esc = simple_escapes.get(tail)
25 if tail.startswith("x"):
26 hexes = tail[1:]
28 raise ValueError("invalid hex string escape ('\\%s')" % tail)
32 raise ValueError("invalid hex string escape ('\\%s')" % tail) from None
35 i = int(tail, 8)
37 raise ValueError("invalid octal string escape ('\\%s')" % tail) from None
/third_party/lame/mpglib/
H A Dinterface.c76 mp->head = mp->tail = NULL; in InitMP3()
99 b = mp->tail; in ExitMP3()
130 if (!mp->tail) { in addbuf()
131 mp->tail = nbuf; in addbuf()
146 struct buf *buf = mp->tail; in remove_buf()
148 mp->tail = buf->next; in remove_buf()
149 if (mp->tail) in remove_buf()
150 mp->tail->prev = NULL; in remove_buf()
152 mp->tail = mp->head = NULL; in remove_buf()
168 pos = mp->tail in read_buf_byte()
[all...]
/third_party/musl/src/regex/
H A Dglob.c20 static int append(struct match **tail, const char *name, size_t len, int mark) in append() argument
24 (*tail)->next = new; in append()
31 *tail = new; in append()
35 static int do_glob(char *buf, size_t pos, int type, char *pat, int flags, int (*errfunc)(const char *path, int err), struct match **tail) in do_glob() argument
112 if (append(tail, buf, pos, (flags & GLOB_MARK) && type==DT_DIR)) in do_glob()
160 int r = do_glob(buf, pos+l, de->d_type, p2 ? p2 : "", flags, errfunc, tail); in do_glob()
229 struct match head = { .next = NULL }, *tail = &head; in glob() local
252 error = do_glob(buf, pos, 0, s, flags, errfunc, &tail); in glob()
261 for (cnt=0, tail=head.next; tail; tai in glob()
[all...]
/third_party/skia/src/opts/
H A DSkRasterPipeline_opts.h143 SI void load2(const uint16_t* ptr, size_t tail, U16* r, U16* g) { in load2() argument
147 SI void store2(uint16_t* ptr, size_t tail, U16 r, U16 g) { in store2() argument
151 SI void load3(const uint16_t* ptr, size_t tail, U16* r, U16* g, U16* b) { in load3() argument
156 SI void load4(const uint16_t* ptr, size_t tail, U16* r, U16* g, U16* b, U16* a) { in load4() argument
162 SI void store4(uint16_t* ptr, size_t tail, U16 r, U16 g, U16 b, U16 a) { in store4() argument
169 SI void load2(const float* ptr, size_t tail, F* r, F* g) { in load2() argument
173 SI void store2(float* ptr, size_t tail, F r, F g) { in store2() argument
177 SI void load4(const float* ptr, size_t tail, F* r, F* g, F* b, F* a) { in load4() argument
183 SI void store4(float* ptr, size_t tail, F r, F g, F b, F a) { in store4() argument
242 SI void load2(const uint16_t* ptr, size_t tail, U1
1074 size_t dx, dy, tail; global() member
1154 load(const T* src, size_t tail) load() argument
[all...]
/third_party/skia/third_party/externals/microhttpd/src/microhttpd/
H A Dinternal.h966 * timeout, sorted by timeout (earliest at the tail, most recently
967 * used connection at the head). MHD can just look at the tail of
970 * moved back to the tail of the list.
980 * sorted by timeout (earliest timeout at the tail).
1311 * Insert an element at the head of a DLL. Assumes that head, tail and
1315 * @param tail pointer to the tail of the DLL
1318 #define DLL_insert(head,tail,element) do { \
1323 if ((tail) == NULL) \
1324 (tail)
[all...]
/third_party/libwebsockets/lib/system/smd/
H A Dsmd.c104 lwsl_info(" peer %d: %p: tail: %p, filt 0x%x\n", in lws_smd_dump()
105 n++, pr, pr->tail, pr->_class_filter); in lws_smd_dump()
173 if (xpr->tail == msg) { in _lws_smd_msg_destroy()
175 "we are about to destroy as tail", xpr, msg); in _lws_smd_msg_destroy()
236 * Any peer with no active tail needs to check our class to see if we in _lws_smd_msg_send()
237 * should become his tail in _lws_smd_msg_send()
244 !pr->tail && _lws_smd_msg_peer_interested_in_msg(pr, msg)) { in _lws_smd_msg_send()
245 pr->tail = msg; in _lws_smd_msg_send()
246 /* tail message has to actually be of interest to the peer */ in _lws_smd_msg_send()
247 assert(!pr->tail || (p in _lws_smd_msg_send()
495 lws_dll2_t *tail = &pr->tail->list; _lws_smd_msg_next_matching_filter() local
[all...]

Completed in 15 milliseconds

12345678910>>...28