Home
last modified time | relevance | path

Searched refs:next (Results 1951 - 1975 of 6079) sorted by relevance

1...<<71727374757677787980>>...244

/third_party/icu/ohos_icu4j/src/main/tests/ohos/global/icu/dev/test/util/
H A DICUServiceTest.java260 String id = (String)iter.next(); in TestAPI()
274 Entry e = (Entry)iter.next(); in TestAPI()
305 Entry e = (Entry)iter.next(); in TestAPI()
370 Entry e = (Entry)iter.next(); in TestAPI()
381 String xid = (String)iter.next(); in TestAPI()
404 String xid = (String)iter.next(); in TestAPI()
448 Entry e = (Entry)iter.next(); in TestAPI()
475 Entry e = (Entry)iter.next(); in TestAPI()
613 if (LocaleUtility.isFallbackOf(id, (String)iter.next())) {
753 logln("id: " + iter.next()); in TestLocale()
[all...]
/third_party/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/util/
H A DICUServiceTest.java257 String id = (String)iter.next(); in TestAPI()
271 Entry e = (Entry)iter.next(); in TestAPI()
302 Entry e = (Entry)iter.next(); in TestAPI()
367 Entry e = (Entry)iter.next(); in TestAPI()
378 String xid = (String)iter.next(); in TestAPI()
401 String xid = (String)iter.next(); in TestAPI()
445 Entry e = (Entry)iter.next(); in TestAPI()
472 Entry e = (Entry)iter.next(); in TestAPI()
610 if (LocaleUtility.isFallbackOf(id, (String)iter.next())) {
750 logln("id: " + iter.next()); in TestLocale()
[all...]
/third_party/node/deps/v8/tools/
H A Dwindbg.js402 const next =
405 if (!prev) return next;
406 if (!next) return prev;
407 return (addr - prev <= next - addr) ? prev : next;
707 (hsd.next.address - poi(last_block))/ptr_size;
723 for (let location = poi(last_block); location < hsd.next.address;
729 // where will the next handle allocate at?
731 if (hsd.next.address < hsd.limit.address) {
732 print(`${prefix} at ${hex(hsd.next
[all...]
/third_party/node/src/
H A Dspawn_sync.cc85 SyncProcessOutputBuffer* SyncProcessOutputBuffer::next() const { in next() function in node::SyncProcessOutputBuffer
90 void SyncProcessOutputBuffer::set_next(SyncProcessOutputBuffer* next) { in set_next() argument
91 next_ = next; in set_next()
120 SyncProcessOutputBuffer* next; in ~SyncProcessStdioPipe() local
122 for (buf = first_output_buffer_; buf != nullptr; buf = next) { in ~SyncProcessStdioPipe()
123 next = buf->next(); in ~SyncProcessStdioPipe()
238 for (buf = first_output_buffer_; buf != nullptr; buf = buf->next()) in OutputLength()
249 for (buf = first_output_buffer_; buf != nullptr; buf = buf->next()) in CopyOutput()
/third_party/icu/icu4c/source/tools/tzcode/
H A Dzdump.c236 struct listentry * next; member
504 namelist = namelist->next; in main()
669 struct listentry * next; in main() local
672 next = entry->next; in main()
674 entry = next; in main()
1030 *namelist = dummyentry.next; in getall()
1063 pentry->next = NULL; in getzones()
1064 (*last)->next = pentry; in getzones()
/third_party/lwip/src/core/ipv4/
H A Detharp.c153 q = q->next; in free_etharp_q()
252 /* Reset state to stable, so that the next transmitted packet will in etharp_tmr()
504 arp_table[i].q = q->next;
1016 since this failure could be temporary, and the next packet calling
1049 LWIP_ASSERT("no packet queues allowed!", (p->len != p->tot_len) || (p->next == 0));
1054 p = p->next;
1073 new_entry->next = 0;
1080 while (r->next != NULL) {
1081 r = r->next;
1084 r->next
[all...]
/third_party/skia/third_party/externals/icu/source/tools/tzcode/
H A Dzdump.c242 struct listentry * next; member
510 namelist = namelist->next; in main()
675 struct listentry * next; in main() local
678 next = entry->next; in main()
680 entry = next; in main()
1036 *namelist = dummyentry.next; in getall()
1069 pentry->next = NULL; in getzones()
1070 (*last)->next = pentry; in getzones()
/third_party/skia/third_party/externals/brotli/research/
H A Ddurchschlag.cc15 TextIdx next; member
170 TextIdx end, TextIdx* next) { in rebuildCandidatesList()
209 next[i] = candidates->at(score); in rebuildCandidatesList()
320 slot = item.next; in durchschlag_prepare()
478 std::vector<TextIdx> next(end); in durchschlagGenerateExclusive()
480 &candidates, &map, span, shortcut, end, next.data()); in durchschlagGenerateExclusive()
502 candidates[maxScore] = next[candidate]; in durchschlagGenerateExclusive()
523 next[candidate] = candidates[score]; in durchschlagGenerateExclusive()
527 &candidates, &map, span, shortcut, end, next.data()); in durchschlagGenerateExclusive()
168 rebuildCandidatesList(std::vector<TextIdx>* candidates, std::vector<MetaSlot>* map, TextIdx span, const TextIdx* shortcut, TextIdx end, TextIdx* next) rebuildCandidatesList() argument
/third_party/openssl/test/helpers/
H A Dssltestlib.c86 BIO *next = BIO_next(bio); in copy_flags() local
88 flags = BIO_test_flags(next, BIO_FLAGS_SHOULD_RETRY | BIO_FLAGS_RWS); in copy_flags()
196 BIO *next = BIO_next(bio); in tls_dump_read() local
198 ret = BIO_read(next, out, outl); in tls_dump_read()
211 BIO *next = BIO_next(bio); in tls_dump_write() local
213 ret = BIO_write(next, in, inl); in tls_dump_write()
222 BIO *next = BIO_next(bio); in tls_dump_ctrl() local
224 if (next == NULL) in tls_dump_ctrl()
232 ret = BIO_ctrl(next, cmd, num, ptr); in tls_dump_ctrl()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Mips/
H A DMipsDelaySlotFiller.cpp569 std::next(Branch)->eraseFromParent(); in replaceWithCompactBranch()
641 if (InMicroMipsMode && TII->getInstSizeInBytes(*std::next(DSI)) == 2 && in runOnMachineBasicBlock()
679 BuildMI(MBB, std::next(I), I->getDebugLoc(), TII->get(Mips::NOP)); in runOnMachineBasicBlock()
680 MIBundleBuilder(MBB, I, std::next(I, 2)); in runOnMachineBasicBlock()
791 MBB.splice(std::next(SlotI), &MBB, Filler.getReverse()); in searchBackward()
792 MIBundleBuilder(MBB, SlotI, std::next(SlotI, 2)); in searchBackward()
809 if (!searchRange(MBB, std::next(Slot), MBB.end(), RegDU, NM, Slot, Filler)) { in searchForward()
815 MBB.splice(std::next(Slot), &MBB, Filler); in searchForward()
816 MIBundleBuilder(MBB, Slot, std::next(Slot, 2)); in searchForward()
/third_party/wpa_supplicant/wpa_supplicant-2.9/wpa_supplicant/
H A Dibss_rsn.c32 for (peer = ibss_rsn->peers; peer; peer = peer->next) in ibss_rsn_get_peer()
357 for (peer = ibss_rsn->peers; peer; peer = peer->next) { in auth_for_each_sta()
552 peer->next = ibss_rsn->peers; in ibss_rsn_peer_init()
648 peer = peer->next; in ibss_rsn_stop()
658 prev = peer, peer = peer->next) { in ibss_rsn_stop()
661 ibss_rsn->peers = peer->next; in ibss_rsn_stop()
663 prev->next = peer->next; in ibss_rsn_stop()
704 peer = peer->next; in ibss_rsn_deinit()
/third_party/wpa_supplicant/wpa_supplicant-2.9_standard/src/common/
H A Ddpp_backup.c23 struct dpp_asymmetric_key *next = key->next; in dpp_free_asymmetric_key() local
30 key = next; in dpp_free_asymmetric_key()
540 const u8 *next, *e_end; in dpp_parse_recipient_infos() local
605 &next) < 0) in dpp_parse_recipient_infos()
686 pos = next; in dpp_parse_recipient_infos()
860 const u8 *pos = buf, *end = buf + len, *next; in dpp_parse_one_asymmetric_key() local
918 if (!params || asn1_get_oid(params, params_len, &oid, &next) < 0) { in dpp_parse_one_asymmetric_key()
1123 last->next = key; in dpp_parse_dpp_asymmetric_key_package()
/third_party/wpa_supplicant/wpa_supplicant-2.9_standard/wpa_supplicant/
H A Dibss_rsn.c32 for (peer = ibss_rsn->peers; peer; peer = peer->next) in ibss_rsn_get_peer()
388 for (peer = ibss_rsn->peers; peer; peer = peer->next) { in auth_for_each_sta()
579 peer->next = ibss_rsn->peers; in ibss_rsn_peer_init()
675 peer = peer->next; in ibss_rsn_stop()
685 prev = peer, peer = peer->next) { in ibss_rsn_stop()
688 ibss_rsn->peers = peer->next; in ibss_rsn_stop()
690 prev->next = peer->next; in ibss_rsn_stop()
731 peer = peer->next; in ibss_rsn_deinit()
/third_party/wpa_supplicant/wpa_supplicant-2.9_standard/hostapd/
H A Dap_config_file.c114 vlan->next = bss->vlan; in hostapd_config_read_vlan_file()
358 while (a->next) in hostapd_config_read_eap_user()
359 a = a->next; in hostapd_config_read_eap_user()
360 a->next = attr; in hostapd_config_read_eap_user()
606 tail->next = user; in hostapd_config_read_eap_user()
979 char *pos, *next; in add_r0kh() local
987 next = os_strchr(pos, ' '); in add_r0kh()
988 if (next) in add_r0kh()
989 *next++ = '\0'; in add_r0kh()
990 if (next in add_r0kh()
1025 char *pos, *next; add_r1kh() local
2173 char *pos, *next; add_airtime_weight() local
[all...]
/third_party/wpa_supplicant/wpa_supplicant-2.9/hostapd/
H A Dap_config_file.c108 vlan->next = bss->vlan; in hostapd_config_read_vlan_file()
352 while (a->next) in hostapd_config_read_eap_user()
353 a = a->next; in hostapd_config_read_eap_user()
354 a->next = attr; in hostapd_config_read_eap_user()
600 tail->next = user; in hostapd_config_read_eap_user()
1067 char *pos, *next; in add_r0kh() local
1075 next = os_strchr(pos, ' '); in add_r0kh()
1076 if (next) in add_r0kh()
1077 *next++ = '\0'; in add_r0kh()
1078 if (next in add_r0kh()
1113 char *pos, *next; add_r1kh() local
2243 char *pos, *next; add_airtime_weight() local
[all...]
/third_party/curl/lib/
H A Dhttp2.c363 return Curl_conn_cf_recv(cf->next, data, (char *)buf, buflen, err); in nw_in_reader()
374 ssize_t nwritten = Curl_conn_cf_send(cf->next, data, in nw_out_writer()
595 if(!cf->next || !cf->next->cft->is_alive(cf->next, data, input_pending)) in http2_connisalive()
1903 if(!cf->next || !cf->next->cft->has_data_pending(cf->next, data)) in h2_progress_ingress()
2371 if(!cf->next->connected) { in cf_h2_connect()
2372 result = Curl_conn_cf_connect(cf->next, dat in cf_h2_connect()
[all...]
/third_party/toybox/toys/pending/
H A Ddhcpd.c175 struct static_lease_s *next; member
181 struct static_lease6_s *next; member
257 uint32_t siaddr_nip; // "next server" bootp option
683 sltmp->next = gstate.leases.sleases; in get_staticlease()
1218 listdls = listdls->next; in write_leasefile()
1255 listdls = listdls->next; in write_lease6file()
1311 for (listdls = gstate.dleases; listdls; listdls = listdls->next) { in verifyip6_in_lease()
1319 for (sls6 = gstate.leases.sleases6; sls6; sls6 = sls6->next) in verifyip6_in_lease()
1335 for (listdls = gstate.dleases; listdls; listdls = listdls->next) { in verifyip_in_lease()
1343 for (sls = gstate.leases.sleases; sls; sls = sls->next) in verifyip_in_lease()
[all...]
/third_party/mesa3d/src/nouveau/codegen/
H A Dnv50_ir_emit_nvc0.cpp1313 if (!i->next || !isTextureOp(i->next->op)) in isNextIndependentTex()
1315 if (i->getDef(0)->interfers(i->next->getSrc(0))) in isNextIndependentTex()
1317 return !i->next->srcExists(1) || !i->getDef(0)->interfers(i->next->getSrc(1)); in isNextIndependentTex()
3173 void setDelay(Instruction *, int delay, Instruction *next);
3184 SchedDataCalculator::setDelay(Instruction *insn, int delay, Instruction *next)
3197 !next || !targ->canDualIssue(insn, next)) {
3242 Instruction *next
[all...]
/third_party/rust/crates/memchr/bench/data/code/
H A Drust-library.rs1642 while let Some(elt) = map.iter().map(|(&i, _)| i).next() { in clone_slim_100_and_remove_all()
1713 while let Some(elt) = map.iter().map(|(&i, _)| i).next() { in clone_slim_10k_and_remove_all()
1784 while let Some(elt) = map.iter().map(|(&i, _)| i).next() { in clone_fat_val_100_and_remove_all()
1910 while let Some(elt) = set.iter().copied().next() { in clone_100_and_remove_all()
1981 while let Some(elt) = set.iter().copied().next() { in clone_10k_and_remove_all()
2706 assert_eq!(n.iter().next(), None); in test_iterator()
2710 assert_eq!(it.next().unwrap(), &4); in test_iterator()
2712 assert_eq!(it.next(), None); in test_iterator()
2722 it.next(); in test_iterator_clone()
2724 assert_eq!(it.next(), j in test_iterator_clone()
3484 fn next(&mut self) -> Option<Self::Item> { shared_from_iter_trustedlen_no_fuse() functions
9237 fn next(&mut self) -> Option<Self::Item> { shared_from_iter_trustedlen_no_fuse() functions
18784 fn next(&mut self) -> Option<char> { next() functions
27945 fn next(&mut self) -> Option<&'a T> { next() functions
27999 fn next(&mut self) -> Option<&'a mut T> { next() functions
28483 fn next(&mut self) -> Option<T> { next() functions
28547 fn next(&mut self) -> Option<T> { fmt() functions
29283 fn next(&mut self) -> Option<(K, V)> { next() functions
29422 pub fn next(&mut self) -> u32 { next() functions
31091 fn next(&mut self) -> Option<(&'a K, &'a V)> { into_iter() functions
31160 fn next(&mut self) -> Option<(&'a K, &'a mut V)> { into_iter() functions
31277 fn next(&mut self) -> Option<(K, V)> { next() functions
31317 fn next(&mut self) -> Option<&'a K> { next() functions
31366 fn next(&mut self) -> Option<&'a V> { next() functions
31457 fn next(&mut self) -> Option<(K, V)> { fmt() functions
31514 fn next(&mut self) -> Option<(&'a K, &'a V)> { next() functions
31535 fn next(&mut self) -> Option<&'a mut V> { next() functions
31575 fn next(&mut self) -> Option<K> { next() functions
31617 fn next(&mut self) -> Option<V> { next() functions
31674 fn next(&mut self) -> Option<(&'a K, &'a mut V)> { next() functions
33296 fn next(&mut self) -> Option<T> { fmt() functions
33454 fn next(&mut self) -> Option<&'a T> { next() functions
33494 fn next(&mut self) -> Option<T> { next() functions
33529 fn next(&mut self) -> Option<&'a T> { next() functions
33577 fn next(&mut self) -> Option<&'a T> { next() functions
33633 fn next(&mut self) -> Option<&'a T> { next() functions
33678 fn next(&mut self) -> Option<&'a T> { next() functions
33728 fn next(&mut self) -> Option<&'a T> { next() functions
40034 fn next(&mut self) -> Option<T> { fmt() functions
40213 fn next(&mut self) -> Option<T> { next() functions
40337 fn next(&mut self) -> Option<Self::Item> { remainder() functions
43321 fn next(&mut self) -> Option<&'a T> { next() functions
44162 fn next(&mut self) -> Option<&'a mut T> { next() functions
45483 fn next(&mut self) -> Option<&'a T> { next() functions
45540 fn next(&mut self) -> Option<T> { fmt() functions
45600 fn next(&mut self) -> Option<T> { next() functions
45637 fn next(&mut self) -> Option<T> { next() functions
45702 fn next(&mut self) -> Option<T> { next() functions
45977 fn next(&mut self) -> Option<T> { next() functions
46366 fn next(&mut self) -> Option<T> { next() functions
48964 fn next(&mut self) -> T; next() functions
48970 fn next(&mut self) -> T { next() functions
48980 fn next(&mut self) -> T { next() functions
48990 fn next(&mut self) -> T { next() functions
49799 fn next(&mut self) -> Option<T> { next() functions
49988 fn next(&mut self) -> Option<Self::Item> { next() functions
51649 fn next(&mut self) -> Option<I::Item> { next() functions
[all...]
/third_party/backends/backend/
H A Dcanon_pp.c256 s_tmp = s_tmp->next; in sane_init()
325 s_tmp = s_tmp->next; in sane_init()
345 for (s_tmp = first_dev; s_tmp != NULL; s_tmp = s_tmp->next) in sane_init()
481 for (dev = first_dev; dev != NULL; dev = dev->next) in sane_get_devices()
536 cs = cs->next; in sane_open()
545 cs = cs->next; in sane_open()
554 cs = cs->next; in sane_open()
916 * Get information about the next packet. If a scan hasn't started, results
1447 CANONP_Scanner *dev, *next; in sane_exit() local
1451 for (dev = first_dev; dev != NULL; dev = next) in sane_exit()
[all...]
/third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/text/
H A DRuleBasedBreakIterator.java443 * equivalent to repeatedly calling next() or previous().
451 public int next(int n) { in next() method in RuleBasedBreakIterator
455 result = next(); in next()
468 * Advances the iterator to the next boundary position.
473 public int next() { in next() method in RuleBasedBreakIterator
474 fBreakCache.next(); in next()
574 next(); in isBoundary()
584 * next() will return BreakIterator.DONE).
607 * position from <code>next()</code>, <code>previous()</code>, or
611 * <code>current()</code> index even after <code>next()</cod
1352 void next() { next() method in RuleBasedBreakIterator.BreakCache
[all...]
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/text/
H A DRuleBasedBreakIterator.java386 * equivalent to repeatedly calling next() or previous().
393 public int next(int n) { in next() method in RuleBasedBreakIterator
397 result = next(); in next()
410 * Advances the iterator to the next boundary position.
414 public int next() { in next() method in RuleBasedBreakIterator
415 fBreakCache.next(); in next()
510 next(); in isBoundary()
520 * next() will return BreakIterator.DONE).
542 * position from <code>next()</code>, <code>previous()</code>, or
546 * <code>current()</code> index even after <code>next()</cod
1329 void next() { next() method in RuleBasedBreakIterator.BreakCache
[all...]
/third_party/libwebsockets/lib/core/
H A Dcontext.c899 * [ -> fops_zip (copied into context so .next settable) ] in lws_create_context()
907 /* make a soft copy so we can set .next */ in lws_create_context()
909 prev->next = &context->fops_zip; in lws_create_context()
910 prev = (struct lws_plat_file_ops *)prev->next; in lws_create_context()
915 prev->next = info->fops; in lws_create_context()
1666 volatile struct lws_foreign_thread_pollfd *ftp, *next; in lws_pt_destroy() local
1678 next = ftp->next; in lws_pt_destroy()
1680 ftp = next; in lws_pt_destroy()
1851 goto next; in lws_context_destroy()
[all...]
/third_party/mesa3d/src/gallium/drivers/svga/
H A Dsvga_pipe_query.c223 struct svga_qmem_alloc_entry *next; /* next memory block */ member
238 /* Find the next available query block */ in allocate_query_block()
264 prev_alloc_entry->next = alloc_entry->next; in allocate_query_block()
266 svga->gb_query_map[i] = alloc_entry->next; in allocate_query_block()
271 alloc_entry = alloc_entry->next; in allocate_query_block()
304 /* Find the next available slot */ in allocate_query_slot()
356 alloc_entry->next = NULL; in allocate_query_block_entry()
401 alloc_entry->next in allocate_query()
452 struct svga_qmem_alloc_entry *alloc_entry, *next; destroy_gb_query_obj() local
[all...]
/commonlibrary/rust/ylong_runtime/ylong_runtime/src/net/
H A Dschedule_io.rs116 let mut next = Bit::from_usize(0); in reset() variables
117 next.set_by_mask(GENERATION, new_generation); in reset()
118 self.status.store(next.as_usize(), Release); in reset()

Completed in 62 milliseconds

1...<<71727374757677787980>>...244