Home
last modified time | relevance | path

Searched refs:next (Results 1001 - 1025 of 12933) sorted by relevance

1...<<41424344454647484950>>...518

/third_party/musl/libc-test/src/functionalext/supplement/network/
H A Dnameservercheck_client.c121 int next; in res_msend_rc_ext() local
202 next = 0; in res_msend_rc_ext()
229 while (next < nqueries) { in res_msend_rc_ext()
235 { .iov_base = (void *)answers[next], in res_msend_rc_ext()
278 memset(answers[next], 0, asize); in res_msend_rc_ext()
283 for (i=next; i<nqueries && ( in res_msend_rc_ext()
284 answers[next][0] != queries[i][0] || in res_msend_rc_ext()
285 answers[next][1] != queries[i][1] ); i++); in res_msend_rc_ext()
292 switch (answers[next][3] & 15) { in res_msend_rc_ext()
305 /* Store answer in the right slot, or update next in res_msend_rc_ext()
[all...]
/third_party/python/Tools/scripts/
H A Dpindent.py66 # - check syntax based on transitions in 'next' table
88 next = {} variable
89 next['if'] = next['elif'] = 'elif', 'else', 'end'
90 next['while'] = next['for'] = 'else', 'end'
91 next['try'] = 'except', 'finally'
92 next['except'] = 'except', 'else', 'finally', 'end'
93 next['else'] = next['finall
[all...]
/third_party/skia/tests/
H A DPathOpsAngleTest.cpp16 static float next(float f) in next() function
44 float xs[3] = { prev(pt.fX), pt.fX, next(pt.fX) }; in DEF_TEST()
45 float ys[3] = { prev(pt.fY), pt.fY, next(pt.fY) }; in DEF_TEST()
264 SkOpSegment* next = first->next();
265 next->debugAddAngle(0, 1);
266 PathOpsAngleTester::Orderable(*first->debugLastAngle(), *next->debugLastAngle());
461 SkOpSegment* seg2 = seg1->next(); in DEF_TEST()
463 SkOpSegment* seg3 = seg2->next(); in DEF_TEST()
486 startSpan = startSpan->upCast()->next(); in debugAddAngle()
519 SkOpSegment* next = first->next(); DEF_TEST() local
[all...]
/third_party/toybox/toys/pending/
H A Dtcpsvd.c54 struct list_pid *next; member
60 struct list* next; member
95 newnode->next = NULL; in insert()
98 newnode->next = (*l); in insert()
134 if (!prev) *pids = head->next; in delete()
135 else prev->next = head->next; in delete()
140 head = head->next; in delete()
157 if (!prev) h[hash].head = head->next; in remove_connection()
158 else prev->next in remove_connection()
[all...]
/third_party/typescript/tests/baselines/reference/
H A DparserRealSource4.js189 public next: HashEntry;
211 for (current = this.table[val]; current != null ; current = current.next) {
216 entry.next = this.table[val];
229 for (current = this.table[val]; current != null ; current = current.next) {
234 prevEntry.next = current.next;
237 this.table[val] = current.next;
252 for (current = this.table[val]; current != null ; current = current.next) {
484 for (current = this.table[val]; current != null; current = current.next) {
489 entry.next
[all...]
/third_party/selinux/libsepol/src/
H A Doptimize.c271 for (; list; list = list->next) { in is_cond_rule_redundant()
308 *cur = tmp->next; in optimize_avtab()
315 /* rule not redundant -> move to next rule */ in optimize_avtab()
316 cur = &(*cur)->next; in optimize_avtab()
339 *cond = tmp->next; in optimize_cond_av_list()
340 tmp->next = pcov; in optimize_cond_av_list()
343 cond = &(*cond)->next; in optimize_cond_av_list()
364 *cond = tmp->next; in optimize_cond_av_list()
365 tmp->next = *del; in optimize_cond_av_list()
368 cond = &(*cond)->next; in optimize_cond_av_list()
[all...]
/third_party/skia/third_party/externals/abseil-cpp/absl/synchronization/
H A Dmutex.cc164 // The returned value should be used as `c` for the next call to `MutexDelay`.
302 SynchEvent *next ABSL_GUARDED_BY(synch_event_mu);
334 e = e->next) { in EnsureSynchEvent()
349 e->next = synch_event[h]; in EnsureSynchEvent()
387 pe = &e->next) { in ForgetSynchEvent()
391 *pe = e->next; in ForgetSynchEvent()
410 e = e->next) { in GetSynchEvent()
782 // The next several routines maintain the per-thread next and skip fields
785 // last element, and head->next i
1153 PerThreadSynch *next = w->next; Wakeup() local
[all...]
/kernel/linux/linux-5.10/drivers/media/test-drivers/vidtv/
H A Dvidtv_psi.c279 while (head->next) in vidtv_psi_desc_chain()
280 head = head->next; in vidtv_psi_desc_chain()
282 head->next = desc; in vidtv_psi_desc_chain()
411 head_e = head_e->next; in vidtv_psi_service_list_desc_init()
427 prev_e->next = curr_e; in vidtv_psi_service_list_desc_init()
430 entry = entry->next; in vidtv_psi_service_list_desc_init()
553 curr->next = NULL; in vidtv_psi_desc_clone()
557 prev->next = curr; in vidtv_psi_desc_clone()
560 desc = desc->next; in vidtv_psi_desc_clone()
575 curr = curr->next; in vidtv_psi_desc_destroy()
[all...]
/kernel/linux/linux-6.6/drivers/media/test-drivers/vidtv/
H A Dvidtv_psi.c272 while (head->next) in vidtv_psi_desc_chain()
273 head = head->next; in vidtv_psi_desc_chain()
275 head->next = desc; in vidtv_psi_desc_chain()
404 head_e = head_e->next; in vidtv_psi_service_list_desc_init()
420 prev_e->next = curr_e; in vidtv_psi_service_list_desc_init()
423 entry = entry->next; in vidtv_psi_service_list_desc_init()
545 curr->next = NULL; in vidtv_psi_desc_clone()
549 prev->next = curr; in vidtv_psi_desc_clone()
552 desc = desc->next; in vidtv_psi_desc_clone()
567 curr = curr->next; in vidtv_psi_desc_destroy()
[all...]
/kernel/linux/linux-5.10/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()
3015 int i, next; jfs_readdir() local
4060 int ssi, next; /* src slot index */ dtMoveEntry() local
[all...]
/foundation/communication/wifi/wifi/relation_services/wifi_hal_service/
H A Dwifi_hal_crpc_server.c71 while (p->next != NULL) { in PushRpcFunc()
72 p = p->next; in PushRpcFunc()
80 q->next = NULL; in PushRpcFunc()
81 p->next = q; in PushRpcFunc()
288 WifiHalRpcFunc *p = g_rpcFuncHandle[i].next; in ReleaseRpcFunc()
290 WifiHalRpcFunc *q = p->next; in ReleaseRpcFunc()
309 p = p->next; in GetRpcFunc()
364 g_wifiHalEventCallback->cbmsgs[i].next = g_wifiHalEventCallback->cbmsgs + i; in InitCallbackMsg()
376 WifiHalEventCallbackMsg *p = head->next; in ReleaseCallbackMsg()
378 WifiHalEventCallbackMsg *q = p->next; in ReleaseCallbackMsg()
[all...]
/third_party/rust/crates/glob/src/
H A Dlib.rs180 match p.components().next() { in glob_with()
209 components.next(); in glob_with()
331 fn next(&mut self) -> Option<GlobResult> { in next() functions
365 let mut next = idx; in next() variables
368 while (next + 1) < self.dir_patterns.len() in next()
369 && self.dir_patterns[next + 1].is_recursive in next()
371 next += 1; in next()
381 next, in next()
386 if next == self.dir_patterns.len() - 1 { in next()
391 // advanced to the next patter in next()
[all...]
/base/global/i18n/frameworks/intl/entity_recognition/phone_number_recognition/src/
H A Dphone_number_rule.cpp110 cur = cur->next; in InitRule()
121 value = value->next; in ParseXmlNode()
127 value = value->next; in ParseXmlNode()
129 value = value->next; in ParseXmlNode()
135 while (value->next != nullptr && !xmlStrcmp(value->next->name, in ParseXmlNode()
137 value = value->next; in ParseXmlNode()
145 rule = rule->next; in ParseXmlNode()
/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...]
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/text/
H A DThaiBreakEngine.java169 // next word. If it's not a dictionary word, we will combine it with the word we in divideUpDictionaryRange()
185 fIter.next(); in divideUpDictionaryRange()
193 // Note: In the original Apple code, checked that the next in divideUpDictionaryRange()
214 // Backup to where we were for next iteration in divideUpDictionaryRange()
222 fIter.next(); in divideUpDictionaryRange()
236 fIter.next(); in divideUpDictionaryRange()
237 fIter.next(); in divideUpDictionaryRange()
242 fIter.next(); in divideUpDictionaryRange()
248 fIter.next(); in divideUpDictionaryRange()
249 fIter.next(); in divideUpDictionaryRange()
[all...]
/third_party/mesa3d/src/broadcom/vulkan/
H A Dv3dv_cl.h11 * The above copyright notice and this permission notice (including the next
62 struct v3dv_cl_out *next; member
79 return (char *)cl->next - (char *)cl->base; in v3dv_cl_offset()
104 return cl->next; in cl_start()
108 cl_end(struct v3dv_cl *cl, struct v3dv_cl_out *next) in cl_end() argument
110 cl->next = next; in cl_end()
219 memcpy((cl)->next, packet, size); \
220 cl_advance(&(cl)->next, size); \
/third_party/mesa3d/src/gallium/drivers/v3d/
H A Dv3d_cl.h11 * The above copyright notice and this permission notice (including the next
69 struct v3d_cl_out *next; member
84 return (char *)cl->next - (char *)cl->base; in cl_offset()
101 return cl->next; in cl_start()
105 cl_end(struct v3d_cl *cl, struct v3d_cl_out *next) in cl_end() argument
107 cl->next = next; in cl_end()
257 memcpy((cl)->next, packet, size); \
258 cl_advance(&(cl)->next, size); \

Completed in 22 milliseconds

1...<<41424344454647484950>>...518