| /third_party/toybox/tests/ |
| D | tail.test | 9 testing "tail" "tail && echo yes" "oneyes\n" "" "one"
10 testing "file" "tail file1" \
12 testing "-n in bounds" "tail -n 3 file1" "nine\nten\neleven\n" "" ""
13 testing "-n out of bounds" "tail -n 999 file1" "$BIGTEST" "" ""
14 testing "-n+ in bounds" "tail -n +3 file1" \
16 testing "-n+ outof bounds" "tail -n +999 file1" "" "" ""
17 testing "-c in bounds" "tail -c 27 file1" \
19 testing "-c out of bounds" "tail -c 999 file1" "$BIGTEST" "" ""
20 testing "-c+ in bounds" "tail -c +27 file1" \
22 testing "-c+ out of bonds" "tail -c +999 file1" "" "" ""
[all …]
|
| /third_party/libwebsockets/include/libwebsockets/ |
| D | lws-ring.h | 43 * automatically called for elements with no tail behind them, ie, elements
65 * consumption into one or two memcpy()s depending on if the head or tail
69 * an API to inform it when the "oldest" tail has moved on. You can give
70 * NULL where-ever an api asks for a tail pointer, and it will use an internal
71 * single tail pointer for convenience.
73 * The "oldest tail", which is the only tail if you give it NULL instead of
74 * some other tail, is used to track which elements in the ringbuffer are
89 * oldest tail moving beyond it
95 * retired from the ringbuffer after the oldest tail has gone past it, and for
128 * \param tail: a pointer to the tail struct to use, or NULL for single tail
[all …]
|
| /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/node/deps/npm/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/musl/src/exit/linux/ |
| D | atexit.c | 30 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 = prev; in remove_node()
[all …]
|
| /third_party/musl/porting/linux/user/src/exit/ |
| D | atexit.c | 30 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 = prev; in RemoveNode()
[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 <<()
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() argument
253 tail_ = advance(0, src->entries(head, tail)); in Fill()
[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/curl/tests/unit/ |
| 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 is not getting set correctly");
125 * 2: the list tail should different from newly created element
[all …]
|
| /third_party/node/deps/v8/src/builtins/ |
| D | wasm.tq | 116 tail runtime::WasmTableInit(
120 tail ThrowWasmTrapTableOutOfBounds();
132 tail runtime::WasmTableCopy(
136 tail ThrowWasmTrapTableOutOfBounds();
148 tail runtime::WasmTableFill(
152 tail ThrowWasmTrapTableOutOfBounds();
161 tail runtime::WasmTableGrow(
193 tail runtime::WasmFunctionTableGet(
197 tail ThrowWasmTrapTableOutOfBounds();
228 tail runtime::WasmFunctionTableSet(
[all …]
|
| /third_party/node/lib/internal/streams/ |
| D | compose.js | 99 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.on('readable', function() {
191 tail.on('end', function() {
197 const buf = tail.read();
[all …]
|
| /third_party/mesa3d/src/util/ |
| D | u_vector.c | 31 * 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()
93 assert(vector->head - vector->tail < vector->size); in u_vector_add()
[all …]
|
| /third_party/skia/third_party/externals/harfbuzz/src/ |
| D | hb-serialize.hh | 60 Tail, /* Relative to the current object tail after packed. */ enumerator
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()
[all …]
|
| /third_party/ffmpeg/libavfilter/dnn/ |
| D | queue.c | 35 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->prev = new_entry; in ff_queue_push_back()
[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
198 /* Submission queue entry addition to SQE ring buffer tail */ in submit_to_uring_sq()
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()
[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/skia/src/opts/ |
| D | SkRasterPipeline_opts.h | 143 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, U16* r, U16* g) {
[all …]
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/ |
| D | EarlyIfConversion.cpp | 76 // Tail Tail
79 // Head block, and phis in the Tail block are converted to select instructions.
92 MachineBasicBlock *Tail; member in __anon660967b00111::SSAIfConv
101 /// equal to Tail.
102 bool isTriangle() const { return TBB == Tail || FBB == Tail; } in isTriangle()
104 /// Returns the Tail predecessor for the True side.
105 MachineBasicBlock *getTPred() const { return TBB == Tail ? Head : TBB; } in getTPred()
107 /// Returns the Tail predecessor for the False side.
108 MachineBasicBlock *getFPred() const { return FBB == Tail ? Head : FBB; } in getFPred()
110 /// Information about each phi in the Tail block.
[all …]
|
| /third_party/libwebsockets/plugins/ |
| D | protocol_lws_mirror.c | 53 uint32_t tail; member
95 * tail" with it. Elements behind the "oldest tail" are freed and recycled for
96 * new head content. Elements after the "oldest tail" are still waiting to be
99 * If the oldest tail moved on from before, check if it created enough space
102 * Mark connections that are at the oldest tail as being on a 3s timeout to
107 * You can skip calling this if on your connection, before processing, the tail
108 * was not equal to the current worst, ie, if the tail you will work on is !=
109 * lws_ring_get_oldest_tail(ring) then no need to call this when the tail
125 &pss->tail); in __mirror_update_worst_tail()
128 worst_tail = pss->tail; in __mirror_update_worst_tail()
[all …]
|
| /third_party/skia/third_party/externals/dawn/src/tests/unittests/ |
| 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 …]
|
| /third_party/node/deps/openssl/config/archs/VC-WIN32/asm_avx2/crypto/bn/ |
| D | bn-586.asm | 205 ; Tail Round 0
216 ; Tail Round 1
227 ; Tail Round 2
238 ; Tail Round 3
249 ; Tail Round 4
260 ; Tail Round 5
271 ; Tail Round 6
397 ; Tail Round 0
406 ; Tail Round 1
415 ; Tail Round 2
[all …]
|
| /third_party/node/deps/openssl/config/archs/VC-WIN32/asm/crypto/bn/ |
| D | bn-586.asm | 205 ; Tail Round 0
216 ; Tail Round 1
227 ; Tail Round 2
238 ; Tail Round 3
249 ; Tail Round 4
260 ; Tail Round 5
271 ; Tail Round 6
397 ; Tail Round 0
406 ; Tail Round 1
415 ; Tail Round 2
[all …]
|
| /third_party/nghttp2/src/ |
| D | memchunk.h | 118 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 = tail->next; in append()
167 *tail->last++ = c; in append()
179 if (!tail) { in append()
[all …]
|
| /third_party/libwebsockets/lib/system/smd/ |
| D | smd.c | 104 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 || (pr->tail->_class & pr->_class_filter)); in _lws_smd_msg_send()
[all …]
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/RISCV/ |
| D | RISCVMergeBaseOffset.cpp | 46 void foldOffset(MachineInstr &HiLUI, MachineInstr &LoADDI, MachineInstr &Tail,
100 // Delete the tail instruction and update all the uses to use the
104 MachineInstr &Tail, int64_t Offset) { in foldOffset() argument
108 // Delete the tail instruction. in foldOffset()
109 DeadInstrs.insert(&Tail); in foldOffset()
110 MRI->replaceRegWith(Tail.getOperand(0).getReg(), in foldOffset()
184 MachineInstr &Tail = *MRI->use_begin(DestReg)->getParent(); in detectAndFoldOffset() local
185 switch (Tail.getOpcode()) { in detectAndFoldOffset()
188 << Tail); in detectAndFoldOffset()
192 int64_t Offset = Tail.getOperand(2).getImm(); in detectAndFoldOffset()
[all …]
|