Home
last modified time | relevance | path

Searched refs:next (Results 1201 - 1225 of 12432) sorted by relevance

1...<<41424344454647484950>>...498

/third_party/rust/crates/syn/src/
H A Dpunctuated.rs76 self.iter().next() in first()
81 self.iter_mut().next() in first_mut()
544 fn next(&mut self) -> Option<Self::Item> { in next() functions
546 .next() in next()
548 .or_else(|| self.last.next().map(Pair::End)) in next()
559 .next() in next_back()
594 fn next(&mut self) -> Option<Self::Item> { in next() functions
596 .next() in next()
598 .or_else(|| self.last.next().map(Pair::End)) in next()
609 .next() in next_back()
634 fn next(&mut self) -> Option<Self::Item> { next() functions
686 fn next(&mut self) -> Option<Self::Item> { next() functions
762 fn next(&mut self) -> Option<Self::Item> { next() functions
786 fn next(&mut self) -> Option<Self::Item> { next() functions
868 fn next(&mut self) -> Option<Self::Item> { next() functions
892 fn next(&mut self) -> Option<Self::Item> { next() functions
[all...]
/drivers/peripheral/wlan/wpa/interfaces/hdi_service/service_common/
H A Dhdi_wpa_hal.c123 info = info->next; in WpaCliAddIface()
146 info->next = p->ifaces; in WpaCliAddIface()
164 info = info->next; in WpaCliRemoveIface()
177 p->ifaces = info->next; in WpaCliRemoveIface()
179 prev->next = info->next; in WpaCliRemoveIface()
232 WpaIfaceInfo *q = p->next; in ReleaseWpaGlobalInterface()
/kernel/linux/linux-5.10/drivers/md/bcache/
H A Dutil.c194 * bch_next_delay() - update ratelimiting statistics and calculate next delay
199 * jiffies until the next time to do some work.
205 d->next += div_u64(done * NSEC_PER_SEC, atomic_long_read(&d->rate)); in bch_next_delay()
213 if (time_before64(now + NSEC_PER_SEC * 5LLU / 2LLU, d->next)) in bch_next_delay()
214 d->next = now + NSEC_PER_SEC * 5LLU / 2LLU; in bch_next_delay()
216 if (time_after64(now - NSEC_PER_SEC * 2, d->next)) in bch_next_delay()
217 d->next = now - NSEC_PER_SEC * 2; in bch_next_delay()
219 return time_after64(d->next, now) in bch_next_delay()
220 ? div_u64(d->next - now, NSEC_PER_SEC / HZ) in bch_next_delay()
/kernel/linux/linux-5.10/drivers/net/ethernet/cisco/enic/
H A Dvnic_wq.c50 buf->next = wq->bufs[0]; in vnic_wq_alloc_bufs()
51 buf->next->prev = buf; in vnic_wq_alloc_bufs()
54 buf->next = wq->bufs[i + 1]; in vnic_wq_alloc_bufs()
55 buf->next->prev = buf; in vnic_wq_alloc_bufs()
57 buf->next = buf + 1; in vnic_wq_alloc_bufs()
58 buf->next->prev = buf; in vnic_wq_alloc_bufs()
206 buf = wq->to_clean = buf->next; in vnic_wq_clean()
/kernel/linux/linux-5.10/scripts/kconfig/
H A Dexpr.h21 struct file *next; member
84 /* The next symbol in the same bucket in the symbol hash table */
85 struct symbol *next; member
134 #define for_all_symbols(i, sym) for (i = 0; i < SYMBOL_HASHSIZE; i++) for (sym = symbol_hash[i]; sym; sym = sym->next)
193 struct property *next; /* next property - null if last */ member
206 for (st = sym->prop; st; st = st->next) \
211 for (st = sym->prop; st; st = st->next) \
221 /* The next menu node at the same level */
222 struct menu *next; member
[all...]
/kernel/linux/linux-5.10/net/appletalk/
H A Datalk_proc.c21 for (i = atalk_interfaces; pos && i; i = i->next) in atalk_get_interface_idx()
48 i = i->next; in atalk_seq_interface_next()
82 for (r = atalk_routes; pos && r; r = r->next) in atalk_get_route_idx()
109 r = r->next; in atalk_seq_route_next()
191 .next = atalk_seq_interface_next,
198 .next = atalk_seq_route_next,
205 .next = atalk_seq_socket_next,
/kernel/linux/linux-5.10/drivers/gpu/drm/i915/
H A Di915_gem_evict.c11 * The above copyright notice and this permission notice (including the next
96 struct i915_vma *vma, *next; in i915_gem_evict_something() local
130 list_for_each_entry_safe(vma, next, &vm->bound_list, vm_link) { in i915_gem_evict_something()
166 list_for_each_entry_safe(vma, next, &eviction_list, evict_link) { in i915_gem_evict_something()
186 * enabling us to evict them on the next iteration. in i915_gem_evict_something()
212 list_for_each_entry_safe(vma, next, &eviction_list, evict_link) { in i915_gem_evict_something()
221 list_for_each_entry_safe(vma, next, &eviction_list, evict_link) { in i915_gem_evict_something()
259 struct i915_vma *vma, *next; in i915_gem_evict_for_node() local
337 list_for_each_entry_safe(vma, next, &eviction_list, evict_link) { in i915_gem_evict_for_node()
/kernel/linux/linux-6.6/drivers/net/ethernet/cisco/enic/
H A Dvnic_wq.c37 buf->next = wq->bufs[0]; in vnic_wq_alloc_bufs()
38 buf->next->prev = buf; in vnic_wq_alloc_bufs()
41 buf->next = wq->bufs[i + 1]; in vnic_wq_alloc_bufs()
42 buf->next->prev = buf; in vnic_wq_alloc_bufs()
44 buf->next = buf + 1; in vnic_wq_alloc_bufs()
45 buf->next->prev = buf; in vnic_wq_alloc_bufs()
193 buf = wq->to_clean = buf->next; in vnic_wq_clean()
/kernel/linux/linux-6.6/drivers/md/bcache/
H A Dutil.c194 * bch_next_delay() - update ratelimiting statistics and calculate next delay
199 * jiffies until the next time to do some work.
205 d->next += div_u64(done * NSEC_PER_SEC, atomic_long_read(&d->rate)); in bch_next_delay()
213 if (time_before64(now + NSEC_PER_SEC * 5LLU / 2LLU, d->next)) in bch_next_delay()
214 d->next = now + NSEC_PER_SEC * 5LLU / 2LLU; in bch_next_delay()
216 if (time_after64(now - NSEC_PER_SEC * 2, d->next)) in bch_next_delay()
217 d->next = now - NSEC_PER_SEC * 2; in bch_next_delay()
219 return time_after64(d->next, now) in bch_next_delay()
220 ? div_u64(d->next - now, NSEC_PER_SEC / HZ) in bch_next_delay()
/kernel/linux/linux-6.6/scripts/kconfig/
H A Dexpr.h21 struct file *next; member
84 /* The next symbol in the same bucket in the symbol hash table */
85 struct symbol *next; member
134 #define for_all_symbols(i, sym) for (i = 0; i < SYMBOL_HASHSIZE; i++) for (sym = symbol_hash[i]; sym; sym = sym->next)
190 struct property *next; /* next property - null if last */ member
203 for (st = sym->prop; st; st = st->next) \
208 for (st = sym->prop; st; st = st->next) \
218 /* The next menu node at the same level */
219 struct menu *next; member
[all...]
/kernel/uniproton/src/core/kernel/timer/swtmr/
H A Dprt_swtmr_minor.c80 /* if the stoping node have next node ,set its rollnum to the next node's */ in OsSwTmrStop()
83 if (swtmr->next != (struct TagSwTmrCtrl *)listObject) { in OsSwTmrStop()
84 UWROLLNUMADD(swtmr->next->idxRollNum, swtmr->idxRollNum); in OsSwTmrStop()
92 swtmr->next->prev = swtmr->prev; in OsSwTmrStop()
93 swtmr->prev->next = swtmr->next; in OsSwTmrStop()
96 swtmr->next = NULL; in OsSwTmrStop()
110 swtmr->next = g_tmrFreeList; in OsSwTmrDelete()
/kernel/linux/linux-6.6/net/appletalk/
H A Datalk_proc.c21 for (i = atalk_interfaces; pos && i; i = i->next) in atalk_get_interface_idx()
48 i = i->next; in atalk_seq_interface_next()
82 for (r = atalk_routes; pos && r; r = r->next) in atalk_get_route_idx()
109 r = r->next; in atalk_seq_route_next()
191 .next = atalk_seq_interface_next,
198 .next = atalk_seq_route_next,
205 .next = atalk_seq_socket_next,
/third_party/ffmpeg/libavcodec/
H A Dhuffman.c66 int offset, i, next; in ff_huff_gen_len_table() local
89 for (next = size; next < size * 2 - 1; next++) { in ff_huff_gen_len_table()
92 up[h[0].name] = next; in ff_huff_gen_len_table()
95 up[h[0].name] = next; in ff_huff_gen_len_table()
96 h[0].name = next; in ff_huff_gen_len_table()
/third_party/elfutils/libdwfl/
H A Ddwfl_module.c140 for (Dwfl_Module *m = dwfl->modulelist; m != NULL; m = m->next) in INTDEF()
150 mod->next = *tailp; in use()
171 for (Dwfl_Module *m = *prevp; m != NULL; m = *(prevp = &m->next)) in dwfl_report_module()
178 *prevp = m->next; in dwfl_report_module()
184 tailp = &m->next; in dwfl_report_module()
233 *tailp = m->next; in INTDEF()
237 tailp = &m->next; in INTDEF()
/third_party/curl/src/
H A Dtool_parsecfg.c236 /* Allocate the next config */ in parseconfig()
237 operation->next = malloc(sizeof(struct OperationConfig)); in parseconfig()
238 if(operation->next) { in parseconfig()
240 config_init(operation->next); in parseconfig()
243 operation->next->global = global; in parseconfig()
246 global->last = operation->next; in parseconfig()
249 operation->next->prev = operation; in parseconfig()
250 operation = operation->next; in parseconfig()
/third_party/icu/ohos_icu4j/src/main/tests/ohos/global/icu/dev/test/normalizer/
H A DTestCanonicalIterator.java97 String item = slowIt.next(); in TestSpeed()
111 String item = it.next(); in TestSpeed()
154 String result = it.next(); in TestBasic()
165 if(!it.next().equals(first)){ in TestBasic()
216 String item = it.next(); in characterTest()
241 String item = it.next(); in characterTest()
248 String item = slowIt.next(); in characterTest()
262 for(String item=it.next();item!=null;item=it.next()){ in characterTest()
274 result.append(it.next() in collectionToString()
[all...]
/third_party/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/normalizer/
H A DTestCanonicalIterator.java94 String item = slowIt.next(); in TestSpeed()
108 String item = it.next(); in TestSpeed()
151 String result = it.next(); in TestBasic()
162 if(!it.next().equals(first)){ in TestBasic()
213 String item = it.next(); in characterTest()
238 String item = it.next(); in characterTest()
245 String item = slowIt.next(); in characterTest()
259 for(String item=it.next();item!=null;item=it.next()){ in characterTest()
271 result.append(it.next() in collectionToString()
[all...]
/third_party/libwebsockets/lib/misc/lwsac/
H A Dlwsac.c69 return lac->next; in lwsac_get_next()
117 bf = bf->next; in _lwsac_use()
176 lachead->curr->next = bf; in _lwsac_use()
180 bf->next = NULL; in _lwsac_use()
230 head = head->next; in lwsac_scan_extant()
244 head = head->next; in lwsac_total_overhead()
270 struct lwsac *tmp = it->next; in lwsac_free()
/third_party/mesa3d/src/compiler/nir/
H A Dnir_phi_builder.c11 * The above copyright notice and this permission notice (including the next
144 nir_block *next = (nir_block *) dom_entry->key; in nir_phi_builder_add_value() local
153 if (next == pb->impl->end_block) in nir_phi_builder_add_value()
156 if (_mesa_hash_table_search(&val->ht, INDEX_TO_KEY(next->index)) == NULL) { in nir_phi_builder_add_value()
161 nir_phi_builder_value_set_block_def(val, next, NEEDS_PHI); in nir_phi_builder_add_value()
163 if (pb->work[next->index] < pb->iter_count) { in nir_phi_builder_add_value()
164 pb->work[next->index] = pb->iter_count; in nir_phi_builder_add_value()
165 pb->W[w_end++] = next; in nir_phi_builder_add_value()
252 * 1) To speed up lookup next time even if the next tim in nir_phi_builder_value_get_block_def()
[all...]
/third_party/mesa3d/src/compiler/glsl/
H A Dir_function.cpp11 * The above copyright notice and this permission notice (including the next
55 ; node_a = node_a->next, node_b = node_b->next) { in parameter_lists_match()
234 ; node_a = node_a->next, in is_best_inexact_overload()
235 node_b = node_b->next, in is_best_inexact_overload()
236 node_p = node_p->next) { in is_best_inexact_overload()
381 ; node_a = node_a->next, node_b = node_b->next) { in parameter_lists_match_exact()
/third_party/libwebsockets/plugins/
H A Dprotocol_lws_status.c47 struct per_session_data__lws_status *next; member
78 } lws_end_foreach_ll(pss, next); in trigger_resend()
123 pss->next = vhd->live_pss_list; in callback_lws_status()
171 } lws_end_foreach_ll(pss2, next); in callback_lws_status()
174 /* our next guy went away */ in callback_lws_status()
187 pss->walk_next = pss->walk_next->next; in callback_lws_status()
226 *ppss = pss->next; in callback_lws_status()
229 } lws_end_foreach_llp(ppss, next); in callback_lws_status()
/third_party/node/test/parallel/
H A Dtest-repl-programmatic-history.js28 const next = _iter.next();
29 if (next.done) {
36 const action = next.value;
219 write(chunk, _, next) {
225 return next();
233 next();
H A Dtest-repl-persistent-history.js30 const next = _iter.next();
31 if (next.done) {
38 const action = next.value;
222 write(chunk, _, next) {
228 return next();
236 next();
/third_party/node/deps/v8/src/zone/
H A Dzone.cc75 segment_head_ = segment_head_->next(); in Reset()
111 Segment* next = current->next(); in DeleteAll() local
114 current = next; in DeleteAll()
209 Segment* next = current->next(); in ~ZoneScope() local
211 current = next; in ~ZoneScope()
/third_party/libwebsockets/win32port/zlib/
H A Dinftrees.c27 on return points to the next available entry's address. bits is the
54 code FAR *next; /* next available space in table */ local
151 filled is at next and has curr index bits. The code being used is huff
201 next = *table; /* current table to fill in */
233 min = fill; /* save offset to next table */
236 next[(huff >> drop) + fill] = here;
250 /* go to next symbol, update count, len */
264 next += min; /* here min is 1 << curr */
266 /* determine length of next tabl
[all...]

Completed in 14 milliseconds

1...<<41424344454647484950>>...498