Home
last modified time | relevance | path

Searched refs:next (Results 3126 - 3150 of 12535) sorted by relevance

1...<<121122123124125126127128129130>>...502

/kernel/linux/linux-6.6/drivers/media/common/saa7146/
H A Dsaa7146_fops.c104 struct saa7146_buf *buf,*next = NULL; in saa7146_buffer_next() local
113 /* activate next one from queue */ in saa7146_buffer_next()
114 buf = list_entry(q->queue.next, struct saa7146_buf, list); in saa7146_buffer_next()
117 next = list_entry(q->queue.next, struct saa7146_buf, list); in saa7146_buffer_next()
119 DEB_INT("next buffer: buf:%p, prev:%p, next:%p\n", in saa7146_buffer_next()
120 buf, q->queue.prev, q->queue.next); in saa7146_buffer_next()
121 buf->activate(dev,buf,next); in saa7146_buffer_next()
123 DEB_INT("no next buffe in saa7146_buffer_next()
[all...]
/kernel/linux/linux-6.6/net/sunrpc/xprtrdma/
H A Dfrwr_ops.c281 * Returns the next segment or a negative errno pointer.
397 mr->mr_regwr.wr.next = post_wr; in frwr_send()
493 * also ensures proper Send flow control: waking the next RPC waits until
516 last->next = NULL; in frwr_unmap_sync()
527 prev = &last->next; in frwr_unmap_sync()
599 * ensures proper Send flow control: waking the next RPC waits until
619 last->next = NULL; in frwr_unmap_async()
630 prev = &last->next; in frwr_unmap_async()
689 mr->mr_regwr.wr.next = NULL; in frwr_wp_create()
/kernel/linux/linux-6.6/net/rxrpc/
H A Dcall_event.c375 unsigned long now, next, t; in rxrpc_input_call_event() local
514 next = call->expect_rx_by; in rxrpc_input_call_event()
516 #define set(T) { t = READ_ONCE(T); if (time_before(t, next)) next = t; } in rxrpc_input_call_event()
527 if (time_after_eq(now, next)) in rxrpc_input_call_event()
530 rxrpc_reduce_call_timer(call, next, now, rxrpc_timer_restart); in rxrpc_input_call_event()
/kernel/linux/linux-6.6/sound/drivers/opl3/
H A Dopl3_synth.c311 for (patch = opl3->patch_table[key]; patch; patch = patch->next) { in snd_opl3_find_patch()
323 patch->next = opl3->patch_table[key]; in snd_opl3_find_patch()
336 struct fm_patch *patch, *next; in snd_opl3_clear_patches() local
337 for (patch = opl3->patch_table[i]; patch; patch = next) { in snd_opl3_clear_patches()
338 next = patch->next; in snd_opl3_clear_patches()
/kernel/linux/linux-6.6/lib/crypto/mpi/
H A Dmpih-mul.c399 if (!ctx->next) { in mpihelp_mul_karatsuba_case()
400 ctx->next = kzalloc(sizeof *ctx, GFP_KERNEL); in mpihelp_mul_karatsuba_case()
401 if (!ctx->next) in mpihelp_mul_karatsuba_case()
407 ctx->next) < 0) in mpihelp_mul_karatsuba_case()
426 for (ctx = ctx->next; ctx; ctx = ctx2) { in mpihelp_release_karatsuba_ctx()
427 ctx2 = ctx->next; in mpihelp_release_karatsuba_ctx()
/kernel/linux/linux-6.6/lib/
H A Dts_fsm.c137 struct ts_fsm_token *cur = NULL, *next; in fsm_find() local
169 next = &fsm->tokens[tok_idx + 1]; in fsm_find()
171 next = NULL; in fsm_find()
199 if (next == NULL) in fsm_find()
205 while (!match_token(next, data[block_idx])) { in fsm_find()
222 while (!match_token(next, data[block_idx])) { in fsm_find()
/kernel/linux/linux-6.6/net/netfilter/ipvs/
H A Dip_vs_lblc.c233 struct hlist_node *next; in ip_vs_lblc_flush() local
239 hlist_for_each_entry_safe(en, next, &tbl->bucket[i], list) { in ip_vs_lblc_flush()
260 struct hlist_node *next; in ip_vs_lblc_full_check() local
268 hlist_for_each_entry_safe(en, next, &tbl->bucket[j], list) { in ip_vs_lblc_full_check()
302 struct hlist_node *next; in ip_vs_lblc_check_expire() local
324 hlist_for_each_entry_safe(en, next, &tbl->bucket[j], list) { in ip_vs_lblc_check_expire()
/kernel/linux/linux-6.6/net/ipv6/
H A Dip6_input.c84 struct sk_buff *skb, *next; in ip6_sublist_rcv_finish() local
86 list_for_each_entry_safe(skb, next, head, list) { in ip6_sublist_rcv_finish()
112 struct sk_buff *skb, *next, *hint = NULL; in ip6_list_rcv_finish() local
117 list_for_each_entry_safe(skb, next, head, list) { in ip6_list_rcv_finish()
329 struct sk_buff *skb, *next; in ipv6_list_rcv() local
333 list_for_each_entry_safe(skb, next, head, list) { in ipv6_list_rcv()
/test/xts/acts/kernel_lite/sys_posix/src/
H A DSysApiTest.cpp468 struct Myque *next;
478 head = head->next;
499 EXPECT_TRUE(element1.next == &element2) << "queue num error !";
503 EXPECT_TRUE(element1.next == &element3) << "queue num error !";
507 EXPECT_TRUE(element1.next == &element1) << "queue num error !";
511 EXPECT_TRUE(element1.next == &element1) << "queue num error !";
/third_party/alsa-utils/alsaloop/
H A Dcontrol.c320 for (ossmix = loop->oss_controls; ossmix; ossmix = ossmix->next) in control_init()
322 for (mix = loop->controls; mix; mix = mix->next) { in control_init()
333 for (ossmix = loop->oss_controls; ossmix; ossmix = ossmix->next) { in control_init()
351 for (ossmix = loop->oss_controls; ossmix; ossmix = ossmix->next) { in control_done()
356 for (mix = loop->controls; mix; mix = mix->next) { in control_done()
416 for (mix = lhandle->loopback->controls; mix; mix = mix->next) { in control_event()
/third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/text/
H A DEdits.java25 * next() on the iterator, skips over no-change edits (unchanged regions).
29 * calling next() on the iterator, skips over no-change edits (unchanged regions).
50 * {@link Edits.Iterator#next()} methods are called. They are identical to the non-change iterators when
71 // m or n = 61: actual length follows in the next edits array unit.
72 // m or n = 62..63: actual length follows in the next two edits array units.
262 * The iterator can be moved between edits using the {@link #next()}, {@link #findSourceIndex(int)},
341 * Advances the iterator to the next edit.
345 public boolean next() { in next() method in Edits.Iterator
346 return next(onlyChanges_); in next()
349 private boolean next(boolea method in Edits.Iterator
[all...]
/third_party/icu/ohos_icu4j/src/main/tests/ohos/global/icu/dev/test/timezone/
H A DTimeZoneAliasTest.java55 Zone zone = (Zone)it.next(); in TestAliases()
70 String otherId = (String)aliasIterator.next(); in TestAliases()
99 Zone testZone = (Zone)it.next(); in TestDifferences()
122 Zone zone = (Zone)it.next(); in TestGenerateZones()
141 result.append(it.next().toString()); in join()
190 Zone testZone = (Zone)it.next();
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/text/
H A DEdits.java26 * next() on the iterator, skips over no-change edits (unchanged regions).
30 * calling next() on the iterator, skips over no-change edits (unchanged regions).
51 * {@link Edits.Iterator#next()} methods are called. They are identical to the non-change iterators when
70 // m or n = 61: actual length follows in the next edits array unit.
71 // m or n = 62..63: actual length follows in the next two edits array units.
254 * The iterator can be moved between edits using the {@link #next()}, {@link #findSourceIndex(int)},
332 * Advances the iterator to the next edit.
335 public boolean next() { in next() method in Edits.Iterator
336 return next(onlyChanges_); in next()
339 private boolean next(boolea method in Edits.Iterator
[all...]
/third_party/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/timezone/
H A DTimeZoneAliasTest.java52 Zone zone = (Zone)it.next(); in TestAliases()
67 String otherId = (String)aliasIterator.next(); in TestAliases()
96 Zone testZone = (Zone)it.next(); in TestDifferences()
119 Zone zone = (Zone)it.next(); in TestGenerateZones()
138 result.append(it.next().toString()); in join()
187 Zone testZone = (Zone)it.next();
/third_party/musl/src/malloc/mallocng/
H A Dmalloc.c124 // instead of next page as initial brk. in alloc_meta()
160 ctx.meta_area_tail->next = (void *)p; in alloc_meta()
172 m->prev = m->next = 0; in alloc_meta()
189 m = m->next; in try_avail()
198 m = m->next; in try_avail()
208 if (m->next != m) { in try_avail()
209 m = m->next; in try_avail()
215 // activate up to next 4k boundary in try_avail()
/third_party/musl/porting/linux/user/src/malloc/mallocng/
H A Dmalloc.c122 // instead of next page as initial brk. in alloc_meta()
156 ctx.meta_area_tail->next = (void *)p; in alloc_meta()
168 m->prev = m->next = 0; in alloc_meta()
185 m = m->next; in try_avail()
194 m = m->next; in try_avail()
204 if (m->next != m) { in try_avail()
205 m = m->next; in try_avail()
211 // activate up to next 4k boundary in try_avail()
/third_party/mesa3d/src/loader/
H A Dloader.c13 * The above copyright notice and this permission notice (including the next
643 const char *search_paths, *next, *end; in loader_open_driver_lib() local
659 for (const char *p = search_paths; p < end; p = next + 1) { in loader_open_driver_lib()
661 next = strchr(p, ':'); in loader_open_driver_lib()
662 if (next == NULL) in loader_open_driver_lib()
663 next = end; in loader_open_driver_lib()
665 len = next - p; in loader_open_driver_lib()
/third_party/node/deps/v8/src/builtins/
H A Dbuiltins-handler-gen.cc97 Label next(this), if_unknown_type(this, Label::kDeferred); in DispatchForElementsKindTransition()
127 Goto(&next); \ in DispatchForElementsKindTransition()
135 BIND(&next); in DispatchForElementsKindTransition()
233 Label next(this), if_unknown_type(this, Label::kDeferred); in DispatchByElementsKind()
269 Goto(&next); \ in DispatchByElementsKind()
278 BIND(&next); in DispatchByElementsKind()
/third_party/node/deps/v8/src/strings/
H A Dstring-stream.cc241 for (unsigned next; (next = position + 2048) < length_; position = next) { in OutputToFile()
242 char save = buffer_[next]; in OutputToFile()
243 buffer_[next] = '\0'; in OutputToFile()
245 buffer_[next] = save; in OutputToFile()
/third_party/node/deps/v8/src/torque/
H A Dearley-parser.cc192 // Worklist for items at the next position. in RunEarleyAlgorithm()
228 // symbol next. in RunEarleyAlgorithm()
233 Symbol* next = item.NextSymbol(); in RunEarleyAlgorithm() local
234 // 'Scan' phase: Check if {next} is the next symbol in the input (this in RunEarleyAlgorithm()
235 // is never the case if {next} is a non-terminal). in RunEarleyAlgorithm()
237 tokens.token_symbols[pos] == next) { in RunEarleyAlgorithm()
241 if (!next->IsTerminal()) { in RunEarleyAlgorithm()
242 // Remember that this item is waiting for completion with {next}. in RunEarleyAlgorithm()
243 waiting[{pos, next}] in RunEarleyAlgorithm()
[all...]
/third_party/libphonenumber/metadata/src/main/java/com/google/i18n/phonenumbers/metadata/finitestatematcher/compiler/
H A DOperation.java144 * sequences of "ANY" operations. If this instruction cannot be merged with the given "next"
147 * @param next the operation following this operation which we will try and merge with.
149 Operation mergeWith(Operation next) { in mergeWith() argument
319 public Operation mergeWith(Operation next) { in mergeWith() argument
320 if (next.getOpCode() == OpCode.ANY && isTerminating() == next.isTerminating()) { in mergeWith()
321 return new Any(isTerminating(), this.count + ((Any) next).count, ((Any) next).outs); in mergeWith()
/third_party/skia/src/pathops/
H A DSkPathWriter.cpp232 SkOpSpanBase* start = opPtT->fT ? opSpanBase->prev() : opSpanBase->upCast()->next(); in assemble()
239 SkOpSpanBase* opSpanEnd = start->t() ? start->prev() : start->upCast()->next(); in assemble()
353 SkPoint prior, next; in assemble() local
358 next = contour.getPoint(0); in assemble()
360 SkAssertResult(contour.getLastPt(&next)); in assemble()
362 if (prior != next) { in assemble()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/DebugInfo/DWARF/
H A DDWARFAcceleratorTable.h214 /// next to the actual entries.
490 void next();
510 next(); in operator ++()
515 next(); in operator ++()
535 void next() { in next() function in llvm::DWARFDebugNames::NameIterator
556 next(); in operator ++()
561 next(); in operator ++()
/third_party/protobuf/java/core/src/main/java/com/google/protobuf/
H A DSmallSortedMap.java303 entryList.add(new Entry(iterator.next())); in removeArrayEntryAt()
547 public Map.Entry<K, V> next() { in next() method in SmallSortedMap.EntryIterator
554 return getOverflowIterator().next(); in next()
560 throw new IllegalStateException("remove() was called before next()"); in remove()
600 public Map.Entry<K, V> next() { in next() method in SmallSortedMap.DescendingEntryIterator
602 return getOverflowIterator().next(); in next()
640 public Object next() {
/third_party/protobuf/java/core/src/test/java/com/google/protobuf/
H A DSmallSortedMapTest.java219 Map.Entry<Integer, Integer> entry = it.next(); in testGetArrayEntryAndOverflowEntries()
291 Map.Entry<Integer, Integer> entry = it.next(); in testEntrySetIteratorNext()
306 it.next(); in testEntrySetIteratorRemove()
320 Map.Entry<Integer, Integer> entry = it.next(); in testMapEntryModification()
372 Map.Entry<Integer, Integer> entry = it.next(); in testMakeImmutable()
394 Integer key = keys.next(); in testMakeImmutable()

Completed in 22 milliseconds

1...<<121122123124125126127128129130>>...502