Home
last modified time | relevance | path

Searched refs:next (Results 951 - 975 of 12436) sorted by relevance

1...<<31323334353637383940>>...498

/third_party/skia/src/sksl/ir/
H A DSkSLForStatement.h37 std::unique_ptr<Expression> next, in ForStatement()
45 , fNext(std::move(next)) in ForStatement()
53 std::unique_ptr<Expression> next,
67 std::unique_ptr<Expression> next,
88 std::unique_ptr<Expression>& next() { in next() function in SkSL::final
92 const std::unique_ptr<Expression>& next() const { in next() function in SkSL::final
34 ForStatement(int line, std::unique_ptr<Statement> initializer, std::unique_ptr<Expression> test, std::unique_ptr<Expression> next, std::unique_ptr<Statement> statement, std::unique_ptr<LoopUnrollInfo> unrollInfo, std::shared_ptr<SymbolTable> symbols) ForStatement() argument
/third_party/skia/src/sksl/lex/
H A DNFAState.h33 NFAState(Kind kind, std::vector<int> next) in NFAState()
35 , fNext(std::move(next)) {} in NFAState()
37 NFAState(char c, std::vector<int> next) in NFAState()
40 , fNext(std::move(next)) {} in NFAState()
46 NFAState(bool inverse, std::vector<bool> accepts, std::vector<int> next) in NFAState()
49 , fNext(std::move(next)) { in NFAState()
/third_party/toybox/lib/
H A Dcommas.c12 char *next, *arg; in comma_args() local
19 while ((next = comma_iterate(&arg, &len))) in comma_args()
20 if ((next = callback(data, next, len))) in comma_args()
22 (int)(5+strlen(toys.which->name)+strlen(err)+next-al->arg), '^'); in comma_args()
23 al = al->next; in comma_args()
45 // returns start of next entry or NULL if none
47 // advances *list to start of next entry
/third_party/toybox/toys/pending/
H A Dipcrm.c80 for (tmp = TT.mkey; tmp; tmp = tmp->next) do_ipcrm(1, 1, tmp->arg); in ipcrm_main()
81 for (tmp = TT.mid; tmp; tmp = tmp->next) do_ipcrm(0, 1, tmp->arg); in ipcrm_main()
82 for (tmp = TT.qkey; tmp; tmp = tmp->next) do_ipcrm(1, 2, tmp->arg); in ipcrm_main()
83 for (tmp = TT.qid; tmp; tmp = tmp->next) do_ipcrm(0, 2, tmp->arg); in ipcrm_main()
84 for (tmp = TT.skey; tmp; tmp = tmp->next) do_ipcrm(1, 3, tmp->arg); in ipcrm_main()
85 for (tmp = TT.sid; tmp; tmp = tmp->next) do_ipcrm(0, 3, tmp->arg); in ipcrm_main()
/third_party/rust/crates/peeking_take_while/src/
H A Dlib.rs7 //! `peeking_take_while` peeks at the next item in the iterator and runs the
54 //! assert_eq!(iter_xs.next(), Some(11));
57 //! assert_eq!(iter_ys.next(), Some(10));
84 /// `peeking_take_while` peeks at the next item in the iterator and runs the
143 fn next(&mut self) -> Option<Self::Item> { in fmt() functions
198 assert!(it1.next().is_none()); in not_fused()
199 assert_eq!(it1.next(), Some(0)); in not_fused()
200 assert!(it1.next().is_none()); in not_fused()
201 assert_eq!(it1.next(), Some(1)); in not_fused()
215 assert!(it1.next() in fused()
[all...]
/third_party/wpa_supplicant/wpa_supplicant-2.9/src/eap_server/
H A Deap_server_methods.c28 for (m = eap_methods; m; m = m->next) { in eap_server_get_eap_method()
48 for (m = eap_methods; m; m = m->next) { in eap_server_get_type()
116 for (m = eap_methods; m; m = m->next) { in eap_server_method_register()
127 last->next = method; in eap_server_method_register()
147 eap_methods = eap_methods->next; in eap_server_unregister_methods()
171 for (m = eap_methods; m; m = m->next) { in eap_server_get_name()
/third_party/wpa_supplicant/wpa_supplicant-2.9_standard/src/eap_server/
H A Deap_server_methods.c29 for (m = eap_methods; m; m = m->next) { in eap_server_get_eap_method()
49 for (m = eap_methods; m; m = m->next) { in eap_server_get_type()
118 for (m = eap_methods; m; m = m->next) { in eap_server_method_register()
130 last->next = method; in eap_server_method_register()
150 eap_methods = eap_methods->next; in eap_server_unregister_methods()
174 for (m = eap_methods; m; m = m->next) { in eap_server_get_name()
/kernel/linux/linux-6.6/fs/jfs/
H A Djfs_dtree.c75 * if (next entry satisfies case-insensitive match)
483 static void free_index(tid_t tid, struct inode *ip, u32 index, u32 next) in free_index() argument
496 dirtab_slot->addr2 = cpu_to_le32(next); in free_index()
1165 * the entire key must be retained for the next-to-leftmost in dtSplitUp()
1190 /* next to leftmost entry of in dtSplitUp()
1403 nextbn = le64_to_cpu(sp->header.next); in dtSplitPage()
1404 rp->header.next = cpu_to_le64(nextbn); in dtSplitPage()
1406 sp->header.next = cpu_to_le64(rbn); in dtSplitPage()
1434 * way next time. in dtSplitPage()
1451 f->next in dtSplitPage()
2717 int i, next; jfs_readdir() local
3762 int ssi, next; /* src slot index */ dtMoveEntry() local
[all...]
/third_party/alsa-lib/src/ucm/
H A Dparser.c285 snd_config_iterator_t i, next; in evaluate_regex() local
306 snd_config_for_each(i, next, d) { in evaluate_regex()
330 snd_config_iterator_t i, next; in evaluate_define() local
352 snd_config_for_each(i, next, d) { in evaluate_define()
415 snd_config_iterator_t i, next; in evaluate_macro1() local
444 snd_config_for_each(i, next, a) { in evaluate_macro1()
472 snd_config_for_each(i, next, a) { in evaluate_macro1()
495 snd_config_iterator_t i, i2, next, next2; in evaluate_macro() local
519 snd_config_for_each(i, next, d) { in evaluate_macro()
585 snd_config_iterator_t i, next; in evaluate_variant() local
687 snd_config_iterator_t i, next; parse_libconfig1() local
776 snd_config_iterator_t i, next; parse_libconfig() local
809 snd_config_iterator_t i, next; parse_transition() local
857 snd_config_iterator_t i, next; parse_compound() local
909 snd_config_iterator_t i, next; parse_device_list() local
1056 snd_config_iterator_t i, next; parse_sequence() local
1270 snd_config_iterator_t i, next; parse_value() local
1374 snd_config_iterator_t i, next; parse_modifier() local
1520 snd_config_iterator_t i, next; parse_device() local
1639 snd_config_iterator_t i, next; parse_dev_name_list() local
1708 snd_config_iterator_t i, next; parse_compound_check_legacy() local
1885 snd_config_iterator_t i, next; parse_verb() local
1959 snd_config_iterator_t i, next; parse_verb_file() local
2104 snd_config_iterator_t i, next; parse_variant() local
2164 snd_config_iterator_t i, next; parse_master_section() local
2396 snd_config_iterator_t i, next; parse_master_file() local
2572 snd_config_iterator_t i, next, i2, next2; parse_toplevel_path() local
2720 snd_config_iterator_t i, next; parse_toplevel_config() local
[all...]
/third_party/node/deps/ngtcp2/ngtcp2/lib/
H A Dngtcp2_ksl.c87 head->next = head->prev = NULL; in ksl_head_init()
142 rblk->next = blk->next; in ksl_split_blk()
143 blk->next = rblk; in ksl_split_blk()
144 if (rblk->next) { in ksl_split_blk()
145 rblk->next->prev = rblk; in ksl_split_blk()
226 nhead->next = nhead->prev = NULL; in ksl_split_head()
398 lblk->next = rblk->next; in ksl_merge_node()
399 if (lblk->next) { in ksl_merge_node()
[all...]
/third_party/node/deps/ngtcp2/nghttp3/lib/
H A Dnghttp3_ksl.c88 head->next = head->prev = NULL; in ksl_head_init()
143 rblk->next = blk->next; in ksl_split_blk()
144 blk->next = rblk; in ksl_split_blk()
145 if (rblk->next) { in ksl_split_blk()
146 rblk->next->prev = rblk; in ksl_split_blk()
229 nhead->next = nhead->prev = NULL; in ksl_split_head()
404 lblk->next = rblk->next; in ksl_merge_node()
405 if (lblk->next) { in ksl_merge_node()
[all...]
/third_party/selinux/libsepol/cil/test/unit/
H A Dtest_cil_copy_ast.c73 CuAssertStrEquals(tc, copy_list->head->next->data, cil_l->head->next->data); in test_cil_copy_list()
75 CuAssertIntEquals(tc, copy_list->head->next->flavor, cil_l->head->next->flavor); in test_cil_copy_list()
95 CuAssertStrEquals(tc, copy_list->head->next->data, cil_l->head->next->data); in test_cil_copy_list_sublist()
96 CuAssertStrEquals(tc, ((struct cil_list *)copy_list->head->next->next->data)->head->data, ((struct cil_list *)cil_l->head->next->next in test_cil_copy_list_sublist()
[all...]
/kernel/linux/linux-5.10/arch/arc/kernel/
H A Dfpu.c32 void fpu_save_restore(struct task_struct *prev, struct task_struct *next) in fpu_save_restore() argument
35 unsigned int *readfrom = &next->thread.fpu.aux_dpfp[0].l; in fpu_save_restore()
69 void fpu_save_restore(struct task_struct *prev, struct task_struct *next) in fpu_save_restore() argument
72 struct arc_fpu *restore = &next->thread.fpu; in fpu_save_restore()
/kernel/linux/linux-6.6/arch/arc/kernel/
H A Dfpu.c32 void fpu_save_restore(struct task_struct *prev, struct task_struct *next) in fpu_save_restore() argument
35 unsigned int *readfrom = &next->thread.fpu.aux_dpfp[0].l; in fpu_save_restore()
69 void fpu_save_restore(struct task_struct *prev, struct task_struct *next) in fpu_save_restore() argument
72 struct arc_fpu *restore = &next->thread.fpu; in fpu_save_restore()
/third_party/node/benchmark/zlib/
H A Ddeflate.js27 (function next() {
30 deflater.write(chunk, next);
39 (function next(err, result) {
42 deflate(chunk, next);
/third_party/skia/fuzz/
H A DFuzz.cpp13 void Fuzz::next(bool* b) { in next() function in Fuzz
15 this->next(&n); in next()
30 void Fuzz::next(SkRegion* region) { in next() function in Fuzz
36 this->next(f); in nextRange()
/kernel/linux/linux-5.10/drivers/base/
H A Dmap.c21 struct probe *next; member
60 s = &(*s)->next; in kobj_map()
61 p->next = *s; in kobj_map()
81 for (s = &domain->probes[index % 255]; *s; s = &(*s)->next) { in kobj_unmap()
84 *s = p->next; in kobj_unmap()
109 for (s = &domain->probes[index % 255]; *s; s = &(*s)->next) { in kobj_delete()
112 *s = p->next; in kobj_delete()
131 for (p = domain->probes[MAJOR(dev) % 255]; p; p = p->next) { in kobj_lookup()
/kernel/linux/linux-6.6/arch/powerpc/mm/nohash/
H A Dmmu_context.c230 void switch_mmu_context(struct mm_struct *prev, struct mm_struct *next, in switch_mmu_context() argument
242 next->context.active++; in switch_mmu_context()
252 id = next->context.id; in switch_mmu_context()
286 context_mm[id] = next; in switch_mmu_context()
287 next->context.id = id; in switch_mmu_context()
295 local_flush_tlb_mm(next); in switch_mmu_context()
307 abatron_pteptrs[1] = next->pgd; in switch_mmu_context()
308 set_context(id, next->pgd); in switch_mmu_context()
/kernel/linux/linux-5.10/mm/
H A Dpage_reporting.c116 struct page *page, *next; in page_reporting_cycle() local
146 list_for_each_entry_safe(page, next, list, lru) { in page_reporting_cycle()
158 next = page; in page_reporting_cycle()
165 next = page; in page_reporting_cycle()
203 * Reset next to first entry, the old next isn't valid in page_reporting_cycle()
206 next = list_first_entry(list, struct page, lru); in page_reporting_cycle()
214 if (&next->lru != list && !list_is_first(&next->lru, list)) in page_reporting_cycle()
215 list_rotate_to_front(&next in page_reporting_cycle()
[all...]
/kernel/liteos_a/kernel/include/
H A Dlos_list.h54 struct LOS_DL_LIST *pstNext; /**< Current node's pointer to the next node */
82 * @brief Point to the next node pointed to by the current node.
86 * <li>This API is used to point to the next node pointed to by the current node.</li>
412 * @param item [IN] Current node's pointer to the next node.
462 * @param next [IN] Save the next node.
472 #define LOS_DL_LIST_FOR_EACH_ENTRY_SAFE(item, next, list, type, member) \
474 next = LOS_DL_LIST_ENTRY((item)->member.pstNext, type, member); \
476 item = next, next
[all...]
/kernel/linux/linux-6.6/mm/
H A Dpage_reporting.c153 struct page *page, *next; in page_reporting_cycle() local
183 list_for_each_entry_safe(page, next, list, lru) { in page_reporting_cycle()
195 next = page; in page_reporting_cycle()
202 next = page; in page_reporting_cycle()
240 * Reset next to first entry, the old next isn't valid in page_reporting_cycle()
243 next = list_first_entry(list, struct page, lru); in page_reporting_cycle()
251 if (!list_entry_is_head(next, list, lru) && !list_is_first(&next->lru, list)) in page_reporting_cycle()
252 list_rotate_to_front(&next in page_reporting_cycle()
[all...]
/kernel/linux/linux-6.6/kernel/trace/
H A Drethook.c29 node = node->next; in rethook_flush_task()
46 node = node->next; in rethook_free_rcu()
224 node = node->next; in __rethook_find_ret_addr()
232 node = node->next; in __rethook_find_ret_addr()
242 * @cur: a storage of the loop cursor llist_node pointer for next call
327 first = first->next; in rethook_trampoline_handler()
335 current->rethooks.first = node->next; in rethook_trampoline_handler()
336 node->next = NULL; in rethook_trampoline_handler()
340 first = first->next; in rethook_trampoline_handler()
/kernel/linux/linux-6.6/kernel/sched/
H A Dstats.h111 void psi_task_switch(struct task_struct *prev, struct task_struct *next,
179 struct task_struct *next, in psi_sched_switch()
185 psi_task_switch(prev, next, sleep); in psi_sched_switch()
193 struct task_struct *next, in psi_sched_switch()
273 * the idle task.) We are only called when prev != next.
276 sched_info_switch(struct rq *rq, struct task_struct *prev, struct task_struct *next) in sched_info_switch() argument
286 if (next != rq->idle) in sched_info_switch()
287 sched_info_arrive(rq, next); in sched_info_switch()
293 # define sched_info_switch(rq, t, next) do { } while (0)
178 psi_sched_switch(struct task_struct *prev, struct task_struct *next, bool sleep) psi_sched_switch() argument
192 psi_sched_switch(struct task_struct *prev, struct task_struct *next, bool sleep) psi_sched_switch() argument
/third_party/ffmpeg/libavutil/tests/
H A Dencryption_info.c64 if (a->next || b->next) { in compare_encryption_init_info()
65 if (!a->next || !b->next) in compare_encryption_init_info()
67 if (compare_encryption_init_info(a->next, b->next) != 0) in compare_encryption_init_info()
131 av_assert0(!info->next); in create_init_info()
160 info->next = create_init_info(); in run_encryption_init_info_test()
/third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/breakiter/
H A DThaiBreakEngine.java159 // next word. If it's not a dictionary word, we will combine it with the word we in divideUpDictionaryRange()
175 fIter.next(); in divideUpDictionaryRange()
183 // Note: In the original Apple code, checked that the next in divideUpDictionaryRange()
204 // Backup to where we were for next iteration in divideUpDictionaryRange()
212 fIter.next(); in divideUpDictionaryRange()
226 fIter.next(); in divideUpDictionaryRange()
227 fIter.next(); in divideUpDictionaryRange()
232 fIter.next(); in divideUpDictionaryRange()
238 fIter.next(); in divideUpDictionaryRange()
239 fIter.next(); in divideUpDictionaryRange()
[all...]

Completed in 17 milliseconds

1...<<31323334353637383940>>...498