Home
last modified time | relevance | path

Searched refs:next (Results 4401 - 4425 of 12876) sorted by relevance

1...<<171172173174175176177178179180>>...516

/third_party/skia/src/pathops/
H A DSkOpBuilder.cpp66 if (!contourHead.next()) { in FixWinding()
105 } while ((test = test->next())); in FixWinding()
/third_party/skia/third_party/externals/dawn/src/dawn_wire/client/
H A DClient.cpp140 device = device->next()) { in Disconnect()
147 object = object->next()) { in Disconnect()
/third_party/skia/third_party/externals/dawn/generator/templates/
H A Dapi.h101 struct {{c_prefix}}ChainedStruct const * next; member
106 struct {{c_prefix}}ChainedStructOut * next; member
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/MSP430/
H A DMSP430RegisterInfo.cpp144 BuildMI(MBB, std::next(II), dl, TII.get(MSP430::SUB16ri), DstReg) in eliminateFrameIndex()
147 BuildMI(MBB, std::next(II), dl, TII.get(MSP430::ADD16ri), DstReg) in eliminateFrameIndex()
/third_party/skia/third_party/externals/icu/source/common/unicode/
H A Dbrkiter.h198 * encoded text, the break positions returned by next(), previous(), etc.
219 * DONE is returned by previous() and next() after all valid
250 * @return The character index of the next text boundary or DONE if all
254 virtual int32_t next(void) = 0;
302 virtual int32_t next(int32_t n) = 0;
H A Drbbi.h402 * equivalent to repeatedly calling next() or previous().
409 virtual int32_t next(int32_t n);
412 * Advances the iterator to the next boundary position.
416 virtual int32_t next(void);
457 * next() will return UBRK_DONE).
480 * position from <code>next()</code>, <code>previous()</code>, or
484 * <code>current()</code> index even after <code>next()</code> has returned DONE.
/third_party/typescript/tests/baselines/reference/tsbuild/sample1/
H A Dinvalidates-projects-correctly.js468 non Dts change to logic:: After building next project
586 Dts change to Logic:: After building next project
/third_party/toybox/kconfig/lxdialog/
H A Ddialog.h169 struct dialog_list *next; member
184 item_cur && (item_cur != &item_nil); item_cur = item_cur->next)
/third_party/toybox/toys/posix/
H A Dtail.c36 struct line_list *next, *prev; member
90 // Read in next chunk from end of file in try_lseek()
98 temp->next = list; in try_lseek()
154 // Read next page of data, appending to linked list in order in do_tail()
/third_party/typescript/tests/baselines/reference/
H A DasyncImportNestedYield.js9 return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
14 if (f = 1, y && (t = op[0] & 2 ? y["return"] : op[0] ? y["throw"] || ((t = y["return"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;
38 return i = {}, verb("next"), verb("throw"), verb("return"), i[Symbol.asyncIterator] = function () { return this; }, i;
42 function fulfill(value) { resume("next", value); }
H A DdeclarationEmitPromise.js29 function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
32 step((generator = generator.apply(thisArg, _arguments || [])).next());
H A DprivateNamesIncompatibleModifiers.js42 function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
45 step((generator = generator.apply(thisArg, _arguments || [])).next());
52 return i = {}, verb("next"), verb("throw"), verb("return"), i[Symbol.asyncIterator] = function () { return this; }, i;
56 function fulfill(value) { resume("next", value); }
/third_party/skia/third_party/externals/expat/expat/tests/
H A Dminicheck.c117 TCase *next = suite->tests->next_tcase; in suite_free() local
119 suite->tests = next; in suite_free()
/third_party/rust/crates/rustix/tests/process/
H A Dprctl.rs205 if let Some(current_name) = iter.next().map(str::trim) { in is_linux_kernel_config_item_enabled()
207 if let Some(mut value) = iter.next().map(str::trim) { in is_linux_kernel_config_item_enabled()
/third_party/rust/crates/nix/test/common/
H A Dmod.rs96 if fields.next() == Some("Seccomp:") &&
97 fields.next() != Some("0")
/third_party/spirv-tools/source/opt/
H A Dtree_iterator.h31 // children. To move to the next node, the iterator:
86 // Moves the iterator to the next node in the tree.
100 // Update the iterator for the next child. in MoveToNextNode()
112 // already visited) and the iterator of the next children to visit.
113 // When all the children has been visited, we pop the entry, get the next
124 // children. To move to the next node, the iterator:
193 // Moves the iterator to the next node in the tree.
215 // Update the iterator for the next child (avoid unneeded pop). in MoveToNextNode()
220 // Moves the iterator to the next node in the tree.
227 NodeIterator next in WalkToLeaf() local
[all...]
/kernel/linux/linux-5.10/drivers/md/
H A Ddm-writecache.c700 struct rb_node *next; in writecache_pop_from_freelist() local
706 next = rb_next(&e->rb_node); in writecache_pop_from_freelist()
708 if (unlikely(!next)) in writecache_pop_from_freelist()
709 next = rb_first(&wc->freetree); in writecache_pop_from_freelist()
710 wc->current_free = next ? container_of(next, struct wc_entry, rb_node) : NULL; in writecache_pop_from_freelist()
714 e = container_of(wc->freelist.next, struct wc_entry, lru); in writecache_pop_from_freelist()
753 wc->lru.next = LIST_POISON1; in writecache_poison_lists()
755 wc->freelist.next = LIST_POISON1; in writecache_poison_lists()
782 e = container_of(wc->lru.next, struc in writecache_flush()
1425 struct rb_node *next = rb_next(&e->rb_node); writecache_map() local
[all...]
/kernel/linux/linux-5.10/drivers/nvdimm/
H A Dnamespace_devs.c528 * @next: allocation that follows the given free space range
540 struct resource *next, struct resource *exist, in space_valid()
615 struct resource *next = res->sibling, *new_res = NULL; in scan_allocate() local
631 space_valid(nd_region, ndd, label_id, NULL, next, exist, in scan_allocate()
639 if (!loc && next) { in scan_allocate()
641 valid.end = min(mapping_end, next->start - 1); in scan_allocate()
642 space_valid(nd_region, ndd, label_id, res, next, exist, in scan_allocate()
650 if (!loc && !next) { in scan_allocate()
653 space_valid(nd_region, ndd, label_id, res, next, exist, in scan_allocate()
674 if (strcmp(next in scan_allocate()
538 space_valid(struct nd_region *nd_region, struct nvdimm_drvdata *ndd, struct nd_label_id *label_id, struct resource *prev, struct resource *next, struct resource *exist, resource_size_t n, struct resource *valid) space_valid() argument
757 struct resource *next = res->sibling; merge_dpa() local
[all...]
/kernel/linux/linux-6.6/drivers/md/
H A Ddm-writecache.c722 struct rb_node *next; in writecache_pop_from_freelist() local
729 next = rb_next(&e->rb_node); in writecache_pop_from_freelist()
731 if (unlikely(!next)) in writecache_pop_from_freelist()
732 next = rb_first(&wc->freetree); in writecache_pop_from_freelist()
733 wc->current_free = next ? container_of(next, struct wc_entry, rb_node) : NULL; in writecache_pop_from_freelist()
737 e = container_of(wc->freelist.next, struct wc_entry, lru); in writecache_pop_from_freelist()
776 wc->lru.next = LIST_POISON1; in writecache_poison_lists()
778 wc->freelist.next = LIST_POISON1; in writecache_poison_lists()
805 e = container_of(wc->lru.next, struc in writecache_flush()
1401 struct rb_node *next = rb_next(&e->rb_node); writecache_bio_copy_ssd() local
[all...]
/third_party/node/deps/openssl/openssl/apps/
H A Ds_server.c314 BIO *next = BIO_next(b); in ebcdic_read() local
318 if (next == NULL) in ebcdic_read()
321 ret = BIO_read(next, out, outl); in ebcdic_read()
330 BIO *next = BIO_next(b); in ebcdic_write() local
336 if (next == NULL) in ebcdic_write()
356 ret = BIO_write(next, wbuf->buff, inl); in ebcdic_write()
364 BIO *next = BIO_next(b); in ebcdic_ctrl() local
366 if (next == NULL) in ebcdic_ctrl()
373 ret = BIO_ctrl(next, cmd, num, ptr); in ebcdic_ctrl()
382 BIO *next in ebcdic_gets() local
3692 struct simple_ssl_session_st *next; global() member
[all...]
/third_party/openssl/apps/
H A Ds_server.c314 BIO *next = BIO_next(b); in ebcdic_read() local
318 if (next == NULL) in ebcdic_read()
321 ret = BIO_read(next, out, outl); in ebcdic_read()
330 BIO *next = BIO_next(b); in ebcdic_write() local
336 if (next == NULL) in ebcdic_write()
356 ret = BIO_write(next, wbuf->buff, inl); in ebcdic_write()
364 BIO *next = BIO_next(b); in ebcdic_ctrl() local
366 if (next == NULL) in ebcdic_ctrl()
373 ret = BIO_ctrl(next, cmd, num, ptr); in ebcdic_ctrl()
382 BIO *next in ebcdic_gets() local
3687 struct simple_ssl_session_st *next; global() member
[all...]
/foundation/multimedia/image_framework/frameworks/innerkitsimpl/utils/src/
H A Dimage_utils.cpp745 static void GetNextArray(const uint8_t* pattern, uint32_t patternLen, std::vector<uint32_t>& next) in GetNextArray() argument
748 next[0] = prefixEnd; in GetNextArray()
750 // if not match, move prefixEnd to next position in GetNextArray()
752 prefixEnd = next[prefixEnd - 1]; in GetNextArray()
758 //update next array in GetNextArray()
759 next[i] = prefixEnd; in GetNextArray()
771 std::vector<uint32_t> next(patternLen, 0); in KMPFind()
772 GetNextArray(pattern, patternLen, next); in KMPFind()
776 // if not match, move patternIndex to next position in KMPFind()
778 patternIndex = next[patternInde in KMPFind()
[all...]
/kernel/linux/linux-5.10/drivers/net/ethernet/8390/
H A Dlib8390.c474 /* Push the next to-transmit packet through. */ in __ei_interrupt()
576 * We have finished a transmit: check for errors and then trigger the next
710 if (rx_frame.next != next_frame && in ei_receive()
711 rx_frame.next != next_frame + 1 && in ei_receive()
712 rx_frame.next != next_frame - num_rx_pages && in ei_receive()
713 rx_frame.next != next_frame + 1 - num_rx_pages) { in ei_receive()
724 rx_frame.next); in ei_receive()
752 rx_frame.status, rx_frame.next, in ei_receive()
759 next_frame = rx_frame.next; in ei_receive()
763 netdev_notice(dev, "next fram in ei_receive()
[all...]
/kernel/linux/linux-5.10/drivers/net/
H A Dbareudp.c50 struct list_head next; /* bareudp node on namespace list */ member
598 list_for_each_entry(bareudp, &bn->bareudp_list, next) { in bareudp_find_dev()
632 list_add(&bareudp->next, &bn->bareudp_list); in bareudp_configure()
653 list_del(&bareudp->next); in bareudp_dellink()
774 struct bareudp_dev *bareudp, *next; in bareudp_destroy_tunnels() local
776 list_for_each_entry_safe(bareudp, next, &bn->bareudp_list, next) in bareudp_destroy_tunnels()
/kernel/linux/linux-5.10/drivers/hid/intel-ish-hid/ishtp/
H A Dclient.c44 struct ishtp_cl_rb *next; in ishtp_read_list_flush() local
48 list_for_each_entry_safe(rb, next, &cl->dev->read_list.list, list) in ishtp_read_list_flush()
440 * send next message.
481 rb = list_entry(cl->free_rb_list.list.next, struct ishtp_cl_rb, list); in ishtp_cl_read_start()
677 cl_msg = list_entry(cl->tx_list.list.next, struct ishtp_cl_tx_ring, in ipc_tx_send()
764 cl_msg = list_entry(cl->tx_list.list.next, struct ishtp_cl_tx_ring, in ishtp_cl_send_msg_dma()
901 * rb buffer for the next coming msg in recv_ishtp_cl_msg()
906 new_rb = list_entry(cl->free_rb_list.list.next, in recv_ishtp_cl_msg()
1021 * rb buffer for the next coming msg in recv_ishtp_cl_msg_dma()
1026 new_rb = list_entry(cl->free_rb_list.list.next, in recv_ishtp_cl_msg_dma()
[all...]

Completed in 27 milliseconds

1...<<171172173174175176177178179180>>...516