Home
last modified time | relevance | path

Searched refs:next (Results 276 - 300 of 12371) sorted by relevance

1...<<11121314151617181920>>...495

/third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/util/
H A DStringTrieBuilder.java319 next=nextNode; in IntermediateValueNode()
324 return (0x222222*37+value)*37+next.hashCode(); in hashCode()
335 return next==o.next; in equals()
340 offset=edgeNumber=next.markRightEdgesFirst(edgeNumber); in markRightEdgesFirst()
346 next.write(builder); in write()
350 private Node next; field in StringTrieBuilder.IntermediateValueNode
358 next=nextNode; in LinearMatchNode()
371 if(length!=o.length || next!=o.next) { in equals()
502 private Node next; global() field in StringTrieBuilder.LinearMatchNode
806 private Node next; // A branch sub-node. global() field in StringTrieBuilder.BranchHeadNode
[all...]
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/util/
H A DStringTrieBuilder.java318 next=nextNode; in IntermediateValueNode()
323 return (0x222222*37+value)*37+next.hashCode(); in hashCode()
334 return next==o.next; in equals()
339 offset=edgeNumber=next.markRightEdgesFirst(edgeNumber); in markRightEdgesFirst()
345 next.write(builder); in write()
349 private Node next; field in StringTrieBuilder.IntermediateValueNode
357 next=nextNode; in LinearMatchNode()
370 if(length!=o.length || next!=o.next) { in equals()
501 private Node next; global() field in StringTrieBuilder.LinearMatchNode
805 private Node next; // A branch sub-node. global() field in StringTrieBuilder.BranchHeadNode
[all...]
/kernel/linux/linux-5.10/block/
H A Dblk-merge.c18 struct request *prev_rq, struct bio *prev, struct bio *next) in bio_will_gap()
42 * - if 'pb' ends unaligned, the next bio must include in bio_will_gap()
47 bio_get_first_bvec(next, &nb); in bio_will_gap()
93 * If the next starting sector would be misaligned, stop the discard at in blk_bio_discard_split()
621 struct request *next) in req_attempt_discard_merge()
627 if (blk_rq_sectors(req) + bio_sectors(next->bio) > in req_attempt_discard_merge()
631 req->nr_phys_segments = segments + blk_rq_nr_discard_segments(next); in req_attempt_discard_merge()
639 struct request *next) in ll_merge_requests_fn()
643 if (req_gap_back_merge(req, next->bio)) in ll_merge_requests_fn()
649 if ((blk_rq_sectors(req) + blk_rq_sectors(next)) > in ll_merge_requests_fn()
17 bio_will_gap(struct request_queue *q, struct request *prev_rq, struct bio *prev, struct bio *next) bio_will_gap() argument
620 req_attempt_discard_merge(struct request_queue *q, struct request *req, struct request *next) req_attempt_discard_merge() argument
638 ll_merge_requests_fn(struct request_queue *q, struct request *req, struct request *next) ll_merge_requests_fn() argument
712 blk_try_req_merge(struct request *req, struct request *next) blk_try_req_merge() argument
727 attempt_merge(struct request_queue *q, struct request *req, struct request *next) attempt_merge() argument
824 struct request *next = elv_latter_request(q, rq); attempt_back_merge() local
848 blk_attempt_req_merge(struct request_queue *q, struct request *rq, struct request *next) blk_attempt_req_merge() argument
[all...]
/third_party/icu/icu4c/source/test/intltest/
H A Dbytestrietest.cpp233 // with next() and current(). in TestValuesForState()
321 trie->next('j'); in TestHasUniqueValue()
322 trie->next('a'); in TestHasUniqueValue()
323 trie->next('n'); in TestHasUniqueValue()
324 // hasUniqueValue() directly after next() in TestHasUniqueValue()
329 trie->next('u'); in TestHasUniqueValue()
333 if(trie->next('n')!=USTRINGTRIE_INTERMEDIATE_VALUE || 6!=trie->getValue()) { in TestHasUniqueValue()
342 trie->next('u'); in TestHasUniqueValue()
359 trie->next('j'); in TestGetNextBytes()
360 trie->next(' in TestGetNextBytes()
[all...]
/third_party/node/lib/internal/streams/
H A Dbuffer_list.js21 const entry = { data: v, next: null };
23 this.tail.next = entry;
31 const entry = { data: v, next: this.head };
45 this.head = this.head.next;
60 while ((p = p.next) !== null)
74 p = p.next;
101 for (let p = this.head; p; p = p.next) {
120 if (p.next)
121 this.head = p.next;
132 } while ((p = p.next) !
[all...]
/third_party/skia/third_party/externals/abseil-cpp/absl/base/internal/
H A Dlow_level_alloc.cc100 AllocList *next[kMaxLevel]; member
138 // level<kMaxLevel and next[level-1] will fit in the node.
144 size_t max_fit = (size - offsetof(AllocList, next)) / sizeof(AllocList *); in LLA_SkiplistLevels()
160 for (AllocList *n; (n = p->next[level]) != nullptr && n < e; p = n) { in LLA_SkiplistSearch()
164 return (head->levels == 0) ? nullptr : prev[0]->next[0]; in LLA_SkiplistSearch()
177 e->next[i] = prev[i]->next[i]; in LLA_SkiplistInsert()
178 prev[i]->next[i] = e; in LLA_SkiplistInsert()
189 for (int i = 0; i != e->levels && prev[i]->next[i] == e; i++) { in LLA_SkiplistDelete()
190 prev[i]->next[ in LLA_SkiplistDelete()
455 AllocList *next = prev->next[i]; Next() local
[all...]
/kernel/linux/linux-5.10/fs/cachefiles/
H A Dnamei.c488 struct dentry *dir, *next = NULL; in cachefiles_walk_to_object() local
531 next = lookup_one_len(name, dir, nlen); in cachefiles_walk_to_object()
533 if (IS_ERR(next)) { in cachefiles_walk_to_object()
534 trace_cachefiles_lookup(object, next, NULL); in cachefiles_walk_to_object()
538 inode = d_backing_inode(next); in cachefiles_walk_to_object()
539 trace_cachefiles_lookup(object, next, inode); in cachefiles_walk_to_object()
540 _debug("next -> %p %s", next, inode ? "positive" : "negative"); in cachefiles_walk_to_object()
548 if (d_is_negative(next)) in cachefiles_walk_to_object()
554 if (d_is_negative(next)) { in cachefiles_walk_to_object()
[all...]
/third_party/skia/third_party/externals/zlib/contrib/tests/
H A Dinfcover.cc66 allocation routines on the next zlib initialization
74 struct mem_item *next; /* pointer to next item in list, or NULL */ member
114 item->next = zone->first; in mem_alloc()
129 struct mem_item *item, *next; in mem_free() local
138 /* point next to the item that matches ptr, or NULL if not found -- remove in mem_free()
140 next = zone->first; in mem_free()
141 if (next) { in mem_free()
142 if (next->ptr == ptr) in mem_free()
143 zone->first = next in mem_free()
218 struct mem_item *item, *next; mem_done() local
270 unsigned next, val; h2b() local
471 static unsigned int next = 0; pull() local
[all...]
/kernel/linux/linux-5.10/arch/loongarch/include/asm/
H A Dmmu_context.h77 static inline void switch_mm_irqs_off(struct mm_struct *prev, struct mm_struct *next, in switch_mm_irqs_off() argument
83 if (!asid_valid(next, cpu)) in switch_mm_irqs_off()
84 get_new_mmu_context(next, cpu); in switch_mm_irqs_off()
86 write_csr_asid(cpu_asid(cpu, next)); in switch_mm_irqs_off()
88 if (next != &init_mm) in switch_mm_irqs_off()
89 csr_write64((unsigned long)next->pgd, LOONGARCH_CSR_PGDL); in switch_mm_irqs_off()
97 cpumask_set_cpu(cpu, mm_cpumask(next)); in switch_mm_irqs_off()
102 static inline void switch_mm(struct mm_struct *prev, struct mm_struct *next, in switch_mm() argument
108 switch_mm_irqs_off(prev, next, tsk); in switch_mm()
120 #define activate_mm(prev, next) switch_m
[all...]
/kernel/linux/linux-5.10/arch/arm/mm/
H A Didmap.c28 unsigned long next; in idmap_add_pmd() local
49 next = pmd_addr_end(addr, end); in idmap_add_pmd()
52 } while (pmd++, addr = next, addr != end); in idmap_add_pmd()
73 unsigned long next; in idmap_add_pud() local
76 next = pud_addr_end(addr, end); in idmap_add_pud()
77 idmap_add_pmd(pud, addr, next, prot); in idmap_add_pud()
78 } while (pud++, addr = next, addr != end); in idmap_add_pud()
85 unsigned long next; in identity_mapping_add() local
98 next = pgd_addr_end(addr, end); in identity_mapping_add()
99 idmap_add_pud(pgd, addr, next, pro in identity_mapping_add()
[all...]
/kernel/linux/linux-6.6/arch/loongarch/include/asm/
H A Dmmu_context.h77 static inline void switch_mm_irqs_off(struct mm_struct *prev, struct mm_struct *next, in switch_mm_irqs_off() argument
83 if (!asid_valid(next, cpu)) in switch_mm_irqs_off()
84 get_new_mmu_context(next, cpu); in switch_mm_irqs_off()
86 write_csr_asid(cpu_asid(cpu, next)); in switch_mm_irqs_off()
88 if (next != &init_mm) in switch_mm_irqs_off()
89 csr_write64((unsigned long)next->pgd, LOONGARCH_CSR_PGDL); in switch_mm_irqs_off()
97 cpumask_set_cpu(cpu, mm_cpumask(next)); in switch_mm_irqs_off()
102 static inline void switch_mm(struct mm_struct *prev, struct mm_struct *next, in switch_mm() argument
108 switch_mm_irqs_off(prev, next, tsk); in switch_mm()
120 #define activate_mm(prev, next) switch_m
[all...]
/kernel/linux/linux-6.6/arch/arm/mm/
H A Didmap.c28 unsigned long next; in idmap_add_pmd() local
49 next = pmd_addr_end(addr, end); in idmap_add_pmd()
52 } while (pmd++, addr = next, addr != end); in idmap_add_pmd()
73 unsigned long next; in idmap_add_pud() local
76 next = pud_addr_end(addr, end); in idmap_add_pud()
77 idmap_add_pmd(pud, addr, next, prot); in idmap_add_pud()
78 } while (pud++, addr = next, addr != end); in idmap_add_pud()
85 unsigned long next; in identity_mapping_add() local
98 next = pgd_addr_end(addr, end); in identity_mapping_add()
99 idmap_add_pud(pgd, addr, next, pro in identity_mapping_add()
[all...]
/third_party/node/deps/v8/src/bigint/
H A Dmul-schoolbook.cc35 next = digit_add2(next, high, &carrybit); \
55 digit_t next, next_carry = 0, carry = 0; in MultiplySchoolbook()
57 Z[0] = digit_mul(X[0], Y[0], &next); in MultiplySchoolbook()
61 digit_t zi = next; in MultiplySchoolbook()
62 next = 0; in MultiplySchoolbook()
68 digit_t zi = digit_add2(next, carry, &carry); in MultiplySchoolbook()
69 next = next_carry + carry; in MultiplySchoolbook()
81 digit_t zi = digit_add2(next, carry, &carry); in MultiplySchoolbook()
82 next in MultiplySchoolbook()
[all...]
/third_party/skia/fuzz/
H A DFuzz.h43 // next() loads fuzzed bytes into the variable passed in by pointer.
44 // We use this approach instead of T next() because different compilers
45 // evaluate function parameters in different orders. If fuzz->next()
46 // returned 5 and then 7, foo(fuzz->next(), fuzz->next()) would be
49 // next() in a way that does not consume fuzzed bytes in a single
52 void next(T* t) { this->nextBytes(t, sizeof(T)); } in next() function in Fuzz
56 void next(Arg* first, Args... rest);
77 void next(bool* b);
78 void next(SkRegio
100 inline void Fuzz::next(Arg* first, Args... rest) { next() function in Fuzz
[all...]
/kernel/linux/linux-5.10/arch/s390/mm/
H A Dpage-states.c106 unsigned long next; in mark_kernel_pmd() local
112 next = pmd_addr_end(addr, end); in mark_kernel_pmd()
117 } while (pmd++, addr = next, addr != end); in mark_kernel_pmd()
122 unsigned long next; in mark_kernel_pud() local
129 next = pud_addr_end(addr, end); in mark_kernel_pud()
137 mark_kernel_pmd(pud, addr, next); in mark_kernel_pud()
138 } while (pud++, addr = next, addr != end); in mark_kernel_pud()
143 unsigned long next; in mark_kernel_p4d() local
150 next = p4d_addr_end(addr, end); in mark_kernel_p4d()
158 mark_kernel_pud(p4d, addr, next); in mark_kernel_p4d()
164 unsigned long addr, next; mark_kernel_pgd() local
[all...]
/kernel/linux/linux-6.6/arch/s390/mm/
H A Dpage-states.c96 unsigned long next; in mark_kernel_pmd() local
102 next = pmd_addr_end(addr, end); in mark_kernel_pmd()
107 } while (pmd++, addr = next, addr != end); in mark_kernel_pmd()
112 unsigned long next; in mark_kernel_pud() local
119 next = pud_addr_end(addr, end); in mark_kernel_pud()
127 mark_kernel_pmd(pud, addr, next); in mark_kernel_pud()
128 } while (pud++, addr = next, addr != end); in mark_kernel_pud()
133 unsigned long next; in mark_kernel_p4d() local
140 next = p4d_addr_end(addr, end); in mark_kernel_p4d()
148 mark_kernel_pud(p4d, addr, next); in mark_kernel_p4d()
154 unsigned long addr, next; mark_kernel_pgd() local
[all...]
/third_party/icu/icu4j/main/classes/collate/src/com/ibm/icu/impl/text/
H A DRbnfScannerProviderImpl.java134 int o = iter.next(); in allIgnorable()
137 o = iter.next(); in allIgnorable()
179 int oStr = strIter.next(); in findText2()
180 int oKey = keyIter.next(); in findText2()
184 oStr = strIter.next(); in findText2()
189 oKey = keyIter.next(); in findText2()
203 oStr = strIter.next(); in findText2()
204 oKey = keyIter.next(); in findText2()
210 oStr = strIter.next(); in findText2()
233 int oStr = strIter.next(); in prefixLength()
[all...]
/third_party/icu/icu4c/source/common/
H A Dulist.cpp19 UListNode *next; member
62 newItem->next = NULL; in ulist_addFirstItem()
71 list->head = p->next; in ulist_removeItem()
73 p->previous->next = p->next; in ulist_removeItem()
75 if (p->next == NULL) { in ulist_removeItem()
79 p->next->previous = p->previous; in ulist_removeItem()
82 list->curr = p->next; in ulist_removeItem()
115 newItem->next = NULL; in ulist_addItemEndList()
117 list->tail->next in ulist_addItemEndList()
[all...]
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/impl/text/
H A DRbnfScannerProviderImpl.java136 int o = iter.next(); in allIgnorable()
139 o = iter.next(); in allIgnorable()
181 int oStr = strIter.next(); in findText2()
182 int oKey = keyIter.next(); in findText2()
186 oStr = strIter.next(); in findText2()
191 oKey = keyIter.next(); in findText2()
205 oStr = strIter.next(); in findText2()
206 oKey = keyIter.next(); in findText2()
212 oStr = strIter.next(); in findText2()
235 int oStr = strIter.next(); in prefixLength()
[all...]
/third_party/node/deps/icu-small/source/common/
H A Dulist.cpp19 UListNode *next; member
62 newItem->next = nullptr; in ulist_addFirstItem()
71 list->head = p->next; in ulist_removeItem()
73 p->previous->next = p->next; in ulist_removeItem()
75 if (p->next == nullptr) { in ulist_removeItem()
79 p->next->previous = p->previous; in ulist_removeItem()
82 list->curr = p->next; in ulist_removeItem()
115 newItem->next = nullptr; in ulist_addItemEndList()
117 list->tail->next in ulist_addItemEndList()
[all...]
/third_party/skia/third_party/externals/icu/source/common/
H A Dulist.cpp19 UListNode *next; member
62 newItem->next = NULL; in ulist_addFirstItem()
71 list->head = p->next; in ulist_removeItem()
73 p->previous->next = p->next; in ulist_removeItem()
75 if (p->next == NULL) { in ulist_removeItem()
79 p->next->previous = p->previous; in ulist_removeItem()
82 list->curr = p->next; in ulist_removeItem()
115 newItem->next = NULL; in ulist_addItemEndList()
117 list->tail->next in ulist_addItemEndList()
[all...]
/kernel/linux/linux-5.10/arch/arm64/mm/
H A Dkasan_init.c102 unsigned long next; in kasan_pte_populate() local
111 next = addr + PAGE_SIZE; in kasan_pte_populate()
113 } while (ptep++, addr = next, addr != end && pte_none(READ_ONCE(*ptep))); in kasan_pte_populate()
119 unsigned long next; in kasan_pmd_populate() local
123 next = pmd_addr_end(addr, end); in kasan_pmd_populate()
124 kasan_pte_populate(pmdp, addr, next, node, early); in kasan_pmd_populate()
125 } while (pmdp++, addr = next, addr != end && pmd_none(READ_ONCE(*pmdp))); in kasan_pmd_populate()
131 unsigned long next; in kasan_pud_populate() local
135 next = pud_addr_end(addr, end); in kasan_pud_populate()
136 kasan_pmd_populate(pudp, addr, next, nod in kasan_pud_populate()
143 unsigned long next; kasan_p4d_populate() local
155 unsigned long next; kasan_pgd_populate() local
[all...]
/kernel/linux/linux-6.6/arch/loongarch/mm/
H A Dkasan_init.c148 unsigned long next; in kasan_pte_populate() local
155 next = addr + PAGE_SIZE; in kasan_pte_populate()
157 } while (ptep++, addr = next, addr != end && __pte_none(early, READ_ONCE(*ptep))); in kasan_pte_populate()
163 unsigned long next; in kasan_pmd_populate() local
167 next = pmd_addr_end(addr, end); in kasan_pmd_populate()
168 kasan_pte_populate(pmdp, addr, next, node, early); in kasan_pmd_populate()
169 } while (pmdp++, addr = next, addr != end && __pmd_none(early, READ_ONCE(*pmdp))); in kasan_pmd_populate()
175 unsigned long next; in kasan_pud_populate() local
179 next = pud_addr_end(addr, end); in kasan_pud_populate()
180 kasan_pmd_populate(pudp, addr, next, nod in kasan_pud_populate()
187 unsigned long next; kasan_p4d_populate() local
199 unsigned long next; kasan_pgd_populate() local
[all...]
/kernel/linux/linux-6.6/arch/arm64/mm/
H A Dkasan_init.c105 unsigned long next; in kasan_pte_populate() local
114 next = addr + PAGE_SIZE; in kasan_pte_populate()
116 } while (ptep++, addr = next, addr != end && pte_none(READ_ONCE(*ptep))); in kasan_pte_populate()
122 unsigned long next; in kasan_pmd_populate() local
126 next = pmd_addr_end(addr, end); in kasan_pmd_populate()
127 kasan_pte_populate(pmdp, addr, next, node, early); in kasan_pmd_populate()
128 } while (pmdp++, addr = next, addr != end && pmd_none(READ_ONCE(*pmdp))); in kasan_pmd_populate()
134 unsigned long next; in kasan_pud_populate() local
138 next = pud_addr_end(addr, end); in kasan_pud_populate()
139 kasan_pmd_populate(pudp, addr, next, nod in kasan_pud_populate()
146 unsigned long next; kasan_p4d_populate() local
158 unsigned long next; kasan_pgd_populate() local
[all...]
/third_party/eudev/src/libudev/
H A Dlibudev-list.c54 list->next = list; in udev_list_node_init()
60 return list->next == list; in udev_list_node_is_empty()
65 struct udev_list_node *next) in udev_list_node_insert_between()
67 next->prev = new; in udev_list_node_insert_between()
68 new->next = next; in udev_list_node_insert_between()
70 prev->next = new; in udev_list_node_insert_between()
81 struct udev_list_node *next = entry->next; in udev_list_node_remove() local
83 next in udev_list_node_remove()
63 udev_list_node_insert_between(struct udev_list_node *new, struct udev_list_node *prev, struct udev_list_node *next) udev_list_node_insert_between() argument
277 struct udev_list_node *next; udev_list_entry_get_next() local
[all...]

Completed in 14 milliseconds

1...<<11121314151617181920>>...495