| /third_party/icu/icu4c/source/test/intltest/ |
| H A D | testutil.cpp | 151 UBool ei1HasNext = ei1.next(errorCode); in checkEqualEdits()
152 UBool ei2HasNext = ei2.next(errorCode); in checkEqualEdits()
153 ok &= test.assertEquals(name + u" next()[" + i + u"]" + __LINE__, in checkEqualEdits()
182 test.assertTrue(msg + u":" + __LINE__, ei1.next(errorCode)); in checkEditsIter()
202 ei2.next(errorCode); in checkEditsIter()
203 ei2.next(errorCode); in checkEditsIter()
218 ei2.next(errorCode); in checkEditsIter()
219 ei2.next(errorCode); in checkEditsIter()
230 test.assertFalse(msg + u":" + __LINE__, ei1.next(errorCode)); in checkEditsIter()
279 // Zig-zag across the indexes to stress next() < in checkEditsIter()
[all...] |
| /third_party/node/deps/v8/src/compiler/ |
| H A D | redundancy-elimination.cc | 84 this_head = this_head->next; in Equals()
85 that_head = that_head->next; in Equals()
100 that_head = that_head->next; in Merge()
104 head_ = head_->next; in Merge()
114 head_ = head_->next; in Merge()
115 that_head = that_head->next; in Merge()
227 for (Check const* check = head_; check != nullptr; check = check->next) { in LookupCheck()
238 for (Check const* check = head_; check != nullptr; check = check->next) { in LookupBoundsCheckFor()
|
| /third_party/node/deps/v8/src/ast/ |
| H A D | modules.cc | 186 auto next = it; in SerializeRegularExports() local
189 DCHECK_EQ(it->second->local_name, next->second->local_name); in SerializeRegularExports()
190 DCHECK_EQ(it->second->cell_index, next->second->cell_index); in SerializeRegularExports()
191 ++next; in SerializeRegularExports()
193 } while (next != regular_exports_.end() && next->first == it->first); in SerializeRegularExports()
207 for (; it != next; ++it) { in SerializeRegularExports()
212 // Continue with the next distinct key. in SerializeRegularExports()
213 DCHECK(it == next); in SerializeRegularExports()
|
| /third_party/skia/src/pathops/ |
| H A D | SkOpEdgeBuilder.cpp | 308 int next = index; in walk() local
310 while (next < breakLimit && !splits[next + 1].fCanAdd) { in walk()
311 ++next; in walk()
313 if (next > index) { in walk()
314 split->fT[1] = splits[next].fT[1]; in walk()
315 split->fPts[3] = splits[next].fPts[3]; in walk()
317 if (prior < index || next > index) { in walk()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/marl/include/marl/ |
| H A D | pool.h | 97 Item* next = nullptr; // pointer to the next free item in the pool. member
254 items[i].next = this->free; in Storage()
288 storage->free = storage->free->next; in borrow()
306 storage->free = storage->free->next; in tryBorrow()
322 item->next = free; in return_()
415 item->next = storage->free; in borrow()
421 storage->free = storage->free->next; in borrow()
435 item->next = free; in return_()
|
| /third_party/skia/third_party/externals/tint/tools/src/cmd/intrinsic-gen/gen/ |
| H A D | permutate.go | 120 next := permutate // Permutation chaining
131 if err := next(); err != nil {
139 next := permutate // Permutation chaining
156 if err := next(); err != nil {
179 if err := next(); err != nil {
191 if err := next(); err != nil {
282 next := permutate // Permutation chaining
305 if err := next(); err != nil {
|
| /third_party/rust/crates/nom/src/bytes/ |
| H A D | streaming.rs | 396 /// the next few chars, so the result will be `Err::Incomplete(Needed::Unknown)`
564 if i.iter_elements().next().unwrap().as_char() == control_char { in escaped()
565 let next = control_char.len_utf8(); in escaped()
566 if next >= i.input_len() { in escaped()
569 match escapable.parse(i.slice(next..)) { in escaped()
672 if remainder.iter_elements().next().unwrap().as_char() == control_char { in escaped_transform()
673 let next = index + control_char.len_utf8(); in escaped_transform()
676 if next >= input_len { in escaped_transform()
679 match transform.parse(i.slice(next..)) { in escaped_transform()
|
| /device/soc/rockchip/rk3588/kernel/include/trace/hooks/ |
| H A D | fpsimd.h | 16 TP_PROTO(struct task_struct *prev, struct task_struct *next),
17 TP_ARGS(prev, next))
|
| /kernel/linux/linux-5.10/drivers/crypto/qat/qat_common/ |
| H A D | adf_cfg_user.h | 13 struct adf_user_cfg_key_val *next; member
26 struct adf_user_cfg_section *next; member
|
| /kernel/linux/linux-5.10/arch/xtensa/include/asm/ |
| H A D | nommu_context.h | 23 static inline void activate_mm(struct mm_struct *prev, struct mm_struct *next) in activate_mm() argument
27 static inline void switch_mm(struct mm_struct *prev, struct mm_struct *next, in switch_mm() argument
|
| /kernel/linux/linux-5.10/arch/arm/include/asm/ |
| H A D | switch_to.h | 20 * switch_to(prev, next) should switch from task `prev' to `next'
21 * `prev' will never be the same as `next'. schedule() itself
26 #define switch_to(prev,next,last) \
29 last = __switch_to(prev,task_thread_info(prev), task_thread_info(next)); \
|
| /kernel/linux/linux-5.10/arch/arc/kernel/ |
| H A D | ctx_sw.c | 25 unsigned int next = (unsigned int)next_task; in __switch_to() local
107 : "n"(KSP_WORD_OFF), "r"(next), "r"(prev) in __switch_to()
|
| /kernel/linux/linux-6.6/arch/nios2/include/asm/ |
| H A D | mmu_context.h | 43 void switch_mm(struct mm_struct *prev, struct mm_struct *next,
51 void activate_mm(struct mm_struct *prev, struct mm_struct *next);
|
| /kernel/linux/linux-6.6/drivers/crypto/intel/qat/qat_common/ |
| H A D | adf_cfg_user.h | 13 struct adf_user_cfg_key_val *next; member
26 struct adf_user_cfg_section *next; member
|
| /third_party/ffmpeg/libavutil/ |
| H A D | tree.h | 55 * @param next If next is not NULL, then next[0] will contain the previous
56 * element and next[1] the next element. If either does not exist,
57 * then the corresponding entry in next is unchanged.
67 int (*cmp)(const void *key, const void *b), void *next[2]);
72 * If *next is NULL, then the supplied element will be removed if it exists.
73 * If *next is non-NULL, then the supplied element will be inserted, unless
80 * @param next Use
[all...] |
| /third_party/node/test/parallel/ |
| H A D | test-util-inspect-long-running.js | 15 last.next = { circular: obj, last, obj: { a: 1, b: 2, c: true } };
16 last = last.next;
|
| /third_party/musl/src/process/ |
| H A D | posix_spawn_file_actions_addfchdir.c | 14 if ((op->next = fa->__actions)) op->next->prev = op; in posix_spawn_file_actions_addfchdir_np()
|
| /third_party/node/deps/ngtcp2/nghttp3/lib/ |
| H A D | nghttp3_opl.c | 31 ent->next = opl->head; in nghttp3_opl_push()
42 opl->head = ent->next; in nghttp3_opl_pop()
|
| /third_party/node/deps/ngtcp2/ngtcp2/lib/ |
| H A D | ngtcp2_opl.c | 30 ent->next = opl->head; in ngtcp2_opl_push()
41 opl->head = ent->next; in ngtcp2_opl_pop()
|
| /third_party/node/deps/v8/src/objects/ |
| H A D | free-space.h | 20 // the heap remains iterable. They have a size and a next pointer.
21 // The next pointer is the raw address of the next FreeSpace object (or NULL)
30 // Accessors for the next field.
31 inline FreeSpace next();
32 inline void set_next(FreeSpace next);
|
| /third_party/typescript/tests/baselines/reference/ |
| H A D | parser509534.js | 7 server.get(config.env.siteRoot + "/auth/login", function (req, res, next) {
20 server.get(config.env.siteRoot + "/auth/login", function (req, res, next) {
|
| H A D | iterableArrayPattern10.js | 5 next() {
26 next() {
|
| H A D | iterableArrayPattern11.js | 5 next() {
27 next() {
|
| H A D | iterableArrayPattern12.js | 5 next() {
26 next() {
|
| H A D | iterableArrayPattern13.js | 5 next() {
26 next() {
|