Home
last modified time | relevance | path

Searched refs:next (Results 3451 - 3475 of 12876) sorted by relevance

1...<<131132133134135136137138139140>>...516

/third_party/mesa3d/src/gallium/frontends/clover/util/
H A Drange.hpp315 return std::next(o.begin(), i); in begin()
320 return std::next(o.begin(), j); in end()
325 return std::next(o.begin(), i); in begin()
330 return std::next(o.begin(), j); in end()
/third_party/node/deps/v8/tools/testrunner/local/
H A Dtestsuite.py226 return self.next()
228 def next(self): member in TestGenerator
229 return next(self._iterator)
280 next(iter(self.ListTests()), None)
/third_party/node/deps/icu-small/source/i18n/
H A Dcollationbuilder.h99 * The node's previous and next indexes must not be set yet.
162 * Counts the tailored nodes of the given strength up to the next node
253 static inline int64_t nodeFromNextIndex(int32_t next) { in nodeFromNextIndex() argument
254 return next << 8; in nodeFromNextIndex()
292 static inline int64_t changeNodeNextIndex(int64_t node, int32_t next) { in changeNodeNextIndex() argument
293 return (node & INT64_C(0xfffffffff00000ff)) | nodeFromNextIndex(next); in changeNodeNextIndex()
342 * - a root/default node of the next-weaker strength, or
369 * until the next relation is added.
393 * - index to the next node: 20 bits 27..8
/third_party/node/deps/icu-small/source/common/
H A Dustrenum.cpp44 StringEnumeration::next(int32_t *resultLength, UErrorCode &status) { in next() function in StringEnumeration
78 const char *s=next(&length, status); in snext()
164 const char *UStringEnumeration::next(int32_t *resultLength, UErrorCode &status) { in next() function in UStringEnumeration
228 return THIS(en)->next(resultLength, *ec); in ustrenum_next()
/third_party/mesa3d/src/mesa/program/
H A Dprog_parameter_layout.c11 * The above copyright notice and this permission notice (including the next
140 * - other constants are next
157 for (inst = state->inst_head; inst != NULL; inst = inst->next) { in _mesa_layout_parameters()
191 for (inst = state->inst_head; inst != NULL; inst = inst->next) { in _mesa_layout_parameters()
228 for (inst = state->inst_head; inst != NULL; inst = inst->next) { in _mesa_layout_parameters()
266 for (inst = state->inst_head; inst != NULL; inst = inst->next) { in _mesa_layout_parameters()
/third_party/node/deps/npm/node_modules/cacache/lib/
H A Dentry-index.js149 return entries.reduce((latest, next) => {
150 if (next && next.key === key) {
151 return formatEntry(cache, next)
260 // eslint-ignore-next-line no-empty-block
/third_party/mesa3d/src/gallium/drivers/nouveau/
H A Dnouveau_mm.c195 slab = list_entry(bucket->used.next, struct mm_slab, head); in nouveau_mm_allocate()
200 slab = list_entry(bucket->free.next, struct mm_slab, head); in nouveau_mm_allocate()
278 struct mm_slab *slab, *next; in nouveau_mm_free_slabs() local
280 LIST_FOR_EACH_ENTRY_SAFE(slab, next, head, head) { in nouveau_mm_free_slabs()
/third_party/mesa3d/src/gallium/drivers/nouveau/nv30/
H A Dnv30_vertprog.c96 while (heap->next && heap->size < vp->nr_insns) { in nv30_vertprog_validate()
97 struct nouveau_heap **evict = heap->next->priv; in nv30_vertprog_validate()
139 while (heap->next && heap->size < vp->nr_consts) { in nv30_vertprog_validate()
140 struct nv30_vertprog *evp = heap->next->priv; in nv30_vertprog_validate()
/third_party/icu/icu4j/demos/src/com/ibm/icu/dev/demo/translit/
H A DAnyTransliterator.java52 while (it.next(run)) { in handleTransliterate()
118 public boolean next(Position run); in next() method
160 public boolean next(Position run) { in next() method in AnyTransliterator.ScriptRunIterator
274 String variant = (String) variants.next(); in registerAnyToScript()
/third_party/lwip/src/apps/snmp/
H A Dsnmp_mib2_udp.c157 pcb = pcb->next; in udp_endpointTable_get_cell_value()
177 /* init struct to search next oid */ in udp_endpointTable_get_next_cell_instance_and_value()
180 /* iterate over all possible OIDs to find the next one */ in udp_endpointTable_get_next_cell_instance_and_value()
195 /* check generated OID: is it a candidate for the next one? */ in udp_endpointTable_get_next_cell_instance_and_value()
198 pcb = pcb->next; in udp_endpointTable_get_next_cell_instance_and_value()
201 /* did we find a next one? */ in udp_endpointTable_get_next_cell_instance_and_value()
271 pcb = pcb->next; in udp_Table_get_cell_value()
285 /* init struct to search next oid */ in udp_Table_get_next_cell_instance_and_value()
288 /* iterate over all possible OIDs to find the next one */ in udp_Table_get_next_cell_instance_and_value()
297 /* check generated OID: is it a candidate for the next on in udp_Table_get_next_cell_instance_and_value()
[all...]
/third_party/node/deps/v8/src/profiler/
H A Dsampling-heap-profiler.cc31 double next = (-base::ieee754::log(u)) * rate; in GetNextSampleInterval() local
32 return next < kTaggedSize in GetNextSampleInterval()
34 : (next > INT_MAX ? INT_MAX : static_cast<intptr_t>(next)); in GetNextSampleInterval()
/third_party/mesa3d/src/gallium/drivers/crocus/
H A Dcrocus_resource.h11 * The above copyright notice and this permission notice (including the next
316 if (p_res->next && p_res->next->format == PIPE_FORMAT_S8_UINT) in _crocus_resource_get_separate_stencil()
317 return p_res->next; in _crocus_resource_get_separate_stencil()
509 return res->base.b.next != NULL && res->mod_info && in crocus_resource_unfinished_aux_import()
/third_party/skia/third_party/externals/angle2/src/common/
H A DPoolAlloc.cpp219 PageHeader *next = mInUseList->nextPage; in ~PoolAllocator() local
222 mInUseList = next; in ~PoolAllocator()
230 PageHeader *next = mFreeList->nextPage; in ~PoolAllocator() local
232 mFreeList = next; in ~PoolAllocator()
392 // Make next allocation come from a new page in allocate()
/third_party/skia/third_party/externals/sfntly/java/src/com/google/typography/font/sfntly/table/opentype/component/
H A DTagOffsetsTable.java57 public S next() { in iterator()
61 TagOffsetRecord record = recordIterator.next(); in iterator()
192 TagOffsetRecord record = recordIterator.next(); in initFromData()
194 // Each table ends at the next start, or at the end of the data. in initFromData()
203 TagOffsetRecord record = recordIterator.next(); in initFromData()
/third_party/skia/third_party/externals/icu/source/i18n/
H A Dcollationbuilder.h98 * The node's previous and next indexes must not be set yet.
161 * Counts the tailored nodes of the given strength up to the next node
252 static inline int64_t nodeFromNextIndex(int32_t next) { in nodeFromNextIndex() argument
253 return next << 8; in nodeFromNextIndex()
291 static inline int64_t changeNodeNextIndex(int64_t node, int32_t next) { in changeNodeNextIndex() argument
292 return (node & INT64_C(0xfffffffff00000ff)) | nodeFromNextIndex(next); in changeNodeNextIndex()
340 * - a root/default node of the next-weaker strength, or
367 * until the next relation is added.
391 * - index to the next node: 20 bits 27..8
/third_party/skia/src/utils/
H A DSkCamera.cpp159 Rec* next = rec->fNext; in ~Sk3DView() local
161 rec = next; in ~Sk3DView()
174 Rec* next = fRec->fNext; in restore() local
176 fRec = next; in restore()
/third_party/skia/tests/
H A DGrQuadBufferTest.cpp113 while(iter.next()) { in TEST()
161 while(iter.next()) { in TEST()
208 while(meta.next()) { in TEST()
221 while(iter.next()) { in TEST()
/third_party/python/Lib/test/
H A Dtest_frame.py76 next(gen)
110 f = next(gen)
299 next(g)
301 # on the *very next* allocation:
319 next(g)
/third_party/skia/third_party/externals/swiftshader/third_party/subzero/runtime/
H A Dszrt_asan.c107 struct quarantine_entry *next; member
268 entry->next = NULL; in __asan_free()
274 quarantine_tail->next = entry; in __asan_free()
287 quarantine_head = freed->next; in __asan_free()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/AArch64/
H A DAArch64AdvSIMDScalarPass.cpp211 assert(std::next(Def) == MRI->def_instr_end() && "Multiple def in SSA!"); in isProfitableToTransform()
224 assert(std::next(Def) == MRI->def_instr_end() && "Multiple def in SSA!"); in isProfitableToTransform()
304 assert(std::next(Def) == MRI->def_instr_end() && "Multiple def in SSA!"); in transformInstruction()
323 assert(std::next(Def) == MRI->def_instr_end() && "Multiple def in SSA!"); in transformInstruction()
/third_party/skia/third_party/externals/icu/source/common/
H A Dustrenum.cpp44 StringEnumeration::next(int32_t *resultLength, UErrorCode &status) { in next() function in StringEnumeration
78 const char *s=next(&length, status); in snext()
164 const char *UStringEnumeration::next(int32_t *resultLength, UErrorCode &status) { in next() function in UStringEnumeration
228 return THIS(en)->next(resultLength, *ec); in ustrenum_next()
/third_party/typescript/tests/baselines/reference/
H A DreactReduxLikeDeferredInferenceAllowsAssignment.js170 function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
173 step((generator = generator.apply(thisArg, _arguments || [])).next());
178 return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
183 if (f = 1, y && (t = op[0] & 2 ? y["return"] : op[0] ? y["throw"] || ((t = y["return"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;
/third_party/toybox/toys/posix/
H A Dpatch.c101 // this file and advance to next file. in fail_hunk()
141 for (plist = TT.current_hunk; plist; plist = plist->next) { in apply_one_hunk()
160 // Figure out which line of hunk to compare with next. (Skip lines in apply_one_hunk()
165 plist = plist->next; in apply_one_hunk()
185 // Compare this line with next expected line of hunk. in apply_one_hunk()
187 // A match can fail because the next line doesn't match, or because in apply_one_hunk()
227 plist = plist->next; in apply_one_hunk()
229 check = check->next; in apply_one_hunk()
/third_party/protobuf/java/core/src/test/java/com/google/protobuf/
H A DIntArrayListTest.java80 assertEquals(1, (int) iterator.next()); in testModificationWithIteration()
82 assertEquals(2, (int) iterator.next()); in testModificationWithIteration()
86 iterator.next(); in testModificationWithIteration()
95 iterator.next(); in testModificationWithIteration()
H A DBooleanArrayListTest.java81 assertEquals(true, (boolean) iterator.next()); in testModificationWithIteration()
83 assertEquals(false, (boolean) iterator.next()); in testModificationWithIteration()
87 iterator.next(); in testModificationWithIteration()
96 iterator.next(); in testModificationWithIteration()

Completed in 19 milliseconds

1...<<131132133134135136137138139140>>...516