/third_party/node/deps/icu-small/source/common/unicode/ |
H A D | bytestrie.h | 197 * Equivalent to reset().next(inByte). 218 UStringTrieResult next(int32_t inByte); 227 * result=next(c); 235 UStringTrieResult next(const char *s, int32_t length); 239 * current()/first()/next() returned USTRINGTRIE_INTERMEDIATE_VALUE or USTRINGTRIE_FINAL_VALUE. 270 * That is, each byte b for which it would be next(b)!=USTRINGTRIE_NO_MATCH now. 271 * @param out Each next byte is appended to this object. 330 * Finds the next (byte sequence, value) pair if there is one. 343 UBool next(UErrorCode &errorCode); 346 * @return The NUL-terminated byte sequence for the last successful next() [all...] |
/third_party/mesa3d/src/intel/dev/ |
H A D | intel_hwconfig.c | 11 * The above copyright notice and this permission notice (including the next 146 struct hwconfig *next = in intel_process_hwconfig_table() local 148 assert(next <= end); in intel_process_hwconfig_table() 150 current = next; in intel_process_hwconfig_table()
|
/third_party/ltp/testcases/kernel/hotplug/memory_hotplug/ |
H A D | memtoy.c | 413 char *next; in parse_command_line_args() local 435 argval = strtoul(optarg, &next, 0); in parse_command_line_args() 436 if (*next != '\0') { in parse_command_line_args()
|
/third_party/node/deps/v8/src/compiler/backend/ |
H A D | jump-threading.cc | 156 int next = 1 + block->rpo_number().ToInt(); in ComputeForwarding() local 157 if (next < code->InstructionBlockCount()) fw = RpoNumber::FromInt(next); in ComputeForwarding() 213 fallthru = false; // branches don't fall through to the next block. in ApplyForwarding() 223 fallthru = false; // jumps don't fall through to the next block. in ApplyForwarding()
|
/third_party/mesa3d/src/tool/pps/ |
H A D | pps_config.cc | 93 docopt::docopt(USAGE, {std::next(argv), std::next(argv, argc)}, true, "pps-config 0.3"); in main() 176 while (!driver->next()) in main()
|
/third_party/mesa3d/src/util/tests/ |
H A D | rb_tree_test.cpp | 191 struct rb_node *next = rb_node_next(n); in validate_search() local 192 if (next != NULL) { in validate_search() 194 rb_node_data(struct rb_test_node, next, node); in validate_search()
|
/third_party/rust/crates/clap/src/util/ |
H A D | flat_map.rs | 192 fn next(&mut self) -> Option<(&'a K, &'a V)> { in next() functions 193 match self.keys.next() { in next() 195 let v = self.values.next().unwrap(); in next() 228 fn next(&mut self) -> Option<(&'a K, &'a mut V)> { in next() functions 229 match self.keys.next() { in next() 231 let v = self.values.next().unwrap(); in next()
|
/third_party/rust/crates/clap/clap_lex/src/ |
H A D | lib.rs | 59 //! raw.next(&mut cursor); // Skip the bin 60 //! while let Some(arg) = raw.next(&mut cursor) { 181 /// Advance the cursor, returning the next [`ParsedArg`] 182 pub fn next(&self, cursor: &mut ArgCursor) -> Option<ParsedArg<'_>> { in next() functions 188 let next = self.items.get(cursor.cursor).map(|s| s.as_os_str()); in next() 190 next in next() 193 /// Return the next [`ParsedArg`] 233 /// Inject arguments before the [`RawArgs::next`] 423 self.next().ok_or(i)?.map_err(|_| i)?; in display() 440 /// Advance the iterator, returning the next shor in display() 476 fn next(&mut self) -> Option<Self::Item> { next() functions [all...] |
/third_party/python/Include/internal/ |
H A D | pycore_object.h | 170 PyGC_Head *next = _PyGCHead_NEXT(gc); in _PyObject_GC_UNTRACK() local 171 _PyGCHead_SET_NEXT(prev, next); in _PyObject_GC_UNTRACK() 172 _PyGCHead_SET_PREV(next, prev); in _PyObject_GC_UNTRACK()
|
/third_party/pulseaudio/src/pulsecore/ |
H A D | core-subscribe.c | 37 * function is postponed to the next main loop iteration, i.e. is not 102 if (!s->next) in free_event() 170 for (s = c->subscriptions; s; s = s->next) { in defer_cb() 186 pa_subscription *n = s->next; in defer_cb()
|
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/ |
H A D | LiveRangeShrink.cpp | 157 // IOM is rebuild from the next instruction to prevent later in runOnMachineFunction() 219 MachineBasicBlock::iterator I = std::next(Insert->getIterator()); in runOnMachineFunction() 222 I = std::next(I); in runOnMachineFunction() 234 MachineBasicBlock::iterator EndIter = std::next(MI.getIterator()); in runOnMachineFunction()
|
/third_party/skia/src/core/ |
H A D | SkEnumerate.h | 81 return SkEnumerate{fBeginIndex + deltaBegin, std::next(fBegin, deltaBegin), fEnd}; in last() 86 auto newBegin = std::next(fBegin, offset); in subspan() 87 return SkEnumerate(fBeginIndex + offset, newBegin, std::next(newBegin, count)); in subspan()
|
H A D | SkPath.cpp | 808 this->lineTo(iter.next()); in addRect() 809 this->lineTo(iter.next()); in addRect() 810 this->lineTo(iter.next()); in addRect() 972 this->conicTo(rectIter.next(), rrectIter.next(), weight); in addRRect() 973 this->lineTo(rrectIter.next()); in addRRect() 975 this->conicTo(rectIter.next(), rrectIter.next(), weight); in addRRect() 979 this->lineTo(rrectIter.next()); in addRRect() 980 this->conicTo(rectIter.next(), rrectIte in addRRect() 1757 SkPath::Verb SkPath::Iter::next(SkPoint ptsParam[4]) { next() function in SkPath::Iter 1837 SkPath::Verb SkPath::RawIter::next(SkPoint pts[4]) { next() function in SkPath::RawIter 2396 void ContourIter::next() { next() function in ContourIter 2593 int next = find_diff_pt(pts, index, n, 1); ComputeFirstDirection() local [all...] |
/third_party/skia/third_party/externals/oboe/apps/OboeTester/app/src/main/java/com/mobileer/miditools/synth/ |
H A D | SynthEngine.java | 210 SynthVoice voice = iterator.next(); in generateBuffer() 230 SynthVoice voice = iterator.next(); in allNotesOff() 275 SynthVoice voice = iterator.next(); in pitchBend()
|
/third_party/skia/tools/ |
H A D | SkMetaData.cpp | 17 Rec* next = rec->fNext; in reset() local 19 rec = next; in reset() 227 const char* SkMetaData::Iter::next(SkMetaData::Type* t, int* count) { in next() function in SkMetaData::Iter
|
/third_party/skia/third_party/externals/icu/source/common/unicode/ |
H A D | bytestrie.h | 197 * Equivalent to reset().next(inByte). 218 UStringTrieResult next(int32_t inByte); 227 * result=next(c); 235 UStringTrieResult next(const char *s, int32_t length); 239 * current()/first()/next() returned USTRINGTRIE_INTERMEDIATE_VALUE or USTRINGTRIE_FINAL_VALUE. 270 * That is, each byte b for which it would be next(b)!=USTRINGTRIE_NO_MATCH now. 271 * @param out Each next byte is appended to this object. 330 * Finds the next (byte sequence, value) pair if there is one. 343 UBool next(UErrorCode &errorCode); 346 * @return The NUL-terminated byte sequence for the last successful next() [all...] |
/third_party/toybox/toys/pending/ |
H A D | last.c | 49 new->next = *old; in llist_add_node() 62 *list = (*list)->next; in find_and_dlink() 65 list = &(*list)->next; in find_and_dlink() 108 // Read next structure, determine type in last_main()
|
/third_party/skia/third_party/externals/abseil-cpp/absl/random/internal/ |
H A D | randen_engine.h | 199 size_t next; in operator >>() local 207 is >> next; in operator >>() local 212 engine.next_ = next; in operator >>()
|
/third_party/skia/include/core/ |
H A D | SkRegion.h | 483 /** Advances SkRegion::Iterator to next SkIRect in SkRegion if it is not done. 487 void next(); 532 /** Advances iterator to next SkIRect in SkRegion contained by clip. 536 void next(); 571 /** Advances iterator to next span intersecting SkRegion within line segment provided 580 bool next(int* left, int* right);
|
/third_party/wpa_supplicant/wpa_supplicant-2.9_standard/src/ap/ |
H A D | airtime_policy.c | 79 for (sta = hapd->sta_list; sta; sta = sta->next) { in count_backlogged_sta() 115 for (sta = hapd->sta_list; sta; sta = sta->next) in set_sta_weights() 236 wt = wt->next; in get_weight_for_sta()
|
/third_party/wpa_supplicant/wpa_supplicant-2.9/src/ap/ |
H A D | airtime_policy.c | 79 for (sta = hapd->sta_list; sta; sta = sta->next) { in count_backlogged_sta() 111 for (sta = hapd->sta_list; sta; sta = sta->next) in set_sta_weights() 232 wt = wt->next; in get_weight_for_sta()
|
/kernel/linux/linux-6.6/kernel/trace/ |
H A D | ring_buffer.c | 330 local_t write; /* index for next write */ 331 unsigned read; /* index for next read */ 731 struct list_head *next; in verify_event() local 747 next = rb_list_head(page->list.next); in verify_event() 748 page = list_entry(next, struct buffer_page, list); in verify_event() 1006 * empty. The flag only causes the next event to run in ring_buffer_wait() 1114 * is set, the next event will wake the task up, but we can get stuck in ring_buffer_poll_wait() 1204 * ASCII art, the reader sets its old page to point to the next 1220 * head->list->prev->next bi [all...] |
/third_party/libcoap/src/ |
H A D | coap_net.c | 149 q = q->next; in coap_adjust_basetime() 180 node->next = q; in coap_insert_node() 190 q = q->next; in coap_insert_node() 197 node->next = q; in coap_insert_node() 198 p->next = node; in coap_insert_node() 227 coap_delete_all(queue->next); in coap_delete_all() 255 coap_queue_t *next; in coap_pop_next() local 260 next = context->sendqueue; in coap_pop_next() 261 context->sendqueue = context->sendqueue->next; in coap_pop_next() 263 context->sendqueue->t += next in coap_pop_next() [all...] |
/kernel/linux/linux-6.6/kernel/sched/ |
H A D | rt.c | 159 rt_rq->highest_prio.next = MAX_RT_PRIO-1; in init_rt_rq() 454 if (p->prio < rq->rt.highest_prio.next) in enqueue_pushable_task() 455 rq->rt.highest_prio.next = p->prio; in enqueue_pushable_task() 466 rq->rt.highest_prio.next = p->prio; in dequeue_pushable_task() 468 rq->rt.highest_prio.next = MAX_RT_PRIO-1; in dequeue_pushable_task() 564 tg = list_entry_rcu(tg->list.next, in next_task_group() 768 goto next; in do_balance_runtime() 786 next: in do_balance_runtime() 1754 * - current will be preempted on the next reschedule in check_preempt_curr_rt() 1795 struct sched_rt_entity *next in pick_next_rt_entity() local 2425 int next; rto_next_cpu() local 2814 unsigned long next; watchdog() local [all...] |
/third_party/node/deps/openssl/config/archs/linux-armv4/asm/crypto/sha/ |
H A D | sha256-armv4.S | 176 eor r12,r4,r5 @ a^b, b^c in next round 179 eor r12,r4,r5 @ a^b, b^c in next round 234 eor r3,r11,r4 @ a^b, b^c in next round 237 eor r3,r11,r4 @ a^b, b^c in next round 292 eor r12,r10,r11 @ a^b, b^c in next round 295 eor r12,r10,r11 @ a^b, b^c in next round 350 eor r3,r9,r10 @ a^b, b^c in next round 353 eor r3,r9,r10 @ a^b, b^c in next round 408 eor r12,r8,r9 @ a^b, b^c in next round 411 eor r12,r8,r9 @ a^b, b^c in next roun [all...] |