Home
last modified time | relevance | path

Searched refs:next (Results 4051 - 4075 of 6079) sorted by relevance

1...<<161162163164165166167168169170>>...244

/third_party/skia/third_party/externals/icu/source/i18n/
H A Ducoleitr.cpp323 return CollationElementIterator::fromUCollationElements(elems)->next(*status); in ucol_next()
345 int32_t ce = cei->next(*status); in nextProcessed()
/third_party/skia/third_party/externals/icu/source/tools/gendict/
H A Dgendict.cpp460 it.next(status); in main()
468 it.next(status); in main()
/third_party/skia/third_party/externals/microhttpd/src/microhttpd/
H A Ddigestauth.c449 for (pos = connection->headers_received; NULL != pos; pos = pos->next) in test_header()
536 for (pos = connection->headers_received; NULL != pos; pos = pos->next) in check_argument_match()
/third_party/skia/tests/
H A DPDFPrimitivesTest.cpp421 REPORTER_ASSERT(reporter, clusterator.next() == expectation); in DEF_TEST()
441 REPORTER_ASSERT(reporter, clusterator.next() == expectation); in DEF_TEST()
/third_party/skia/src/pdf/
H A DSkPDFUtils.cpp155 for (SkPath::Verb verb = iter.next(args); in EmitPath()
157 verb = iter.next(args)) { in EmitPath()
/third_party/python/Lib/
H A Dcontextlib.py137 return next(self.gen)
144 next(self.gen)
420 After the exception is suppressed, execution proceeds with the next
/third_party/python/Lib/test/libregrtest/
H A Druntest_mp.py99 # We do not use a generator so multiple threads can call next().
115 return next(self.tests_iter)
309 test_name = next(self.pending)
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/CodeGen/
H A DSlotIndexes.h263 /// Returns the next slot in the index list. This could be either the
264 /// next slot for the instruction pointed to by this index or, if this
265 /// index is a STORE, the first slot for the next instruction.
277 /// Returns the next index. This is the index corresponding to the this
278 /// index's slot, but for the next instruction.
405 /// Returns the next non-null index, if one exists.
487 /// Move iterator to the next IdxMBBPair where the SlotIndex is greater or
552 nextItr = std::next(prevItr); in insertMachineInstrInMaps()
603 std::next(MachineFunction::iterator(mbb)); in insertMBBInMaps()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/MC/
H A DMCRegisterInfo.h205 /// advance - Move to the next list position, return the applied
222 /// Pre-increment to move to the next position.
303 return make_range(std::next(mc_subreg_iterator(Reg, this)), in subregs()
316 return make_range(std::next(mc_superreg_iterator(Reg, this)), in superregs()
625 /// Moves to the next position.
721 /// Moves to the next position.
761 /// Preincrement to move to the next root register.
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Support/
H A DAllocator.h130 /// where every allocation is found by merely allocating the next N bytes in
131 /// the slab, or the next N bytes in the next slab.
209 DeallocateSlabs(std::next(Slabs.begin()), Slabs.end()); in Reset()
210 Slabs.erase(std::next(Slabs.begin()), Slabs.end()); in Reset()
368 /// This points to the next free byte in the slab.
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/
H A DCGSCCPassManager.cpp408 for (SCC &NewC : llvm::reverse(make_range(std::next(NewSCCRange.begin()), in incorporateNewSCCRange()
565 for (RefSCC *NewRC : llvm::reverse(make_range(std::next(NewRefSCCs.begin()), in updateCGAndAnalysisManagerForFunctionPass()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Utils/
H A DDebugify.cpp322 return applyDebugifyMetadata(M, make_range(FuncIt, std::next(FuncIt)),
366 return checkDebugifyMetadata(M, make_range(FuncIt, std::next(FuncIt)),
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-subzero/include/llvm/Support/
H A DAllocator.h127 /// where every allocation is found by merely allocating the next N bytes in
128 /// the slab, or the next N bytes in the next slab.
206 DeallocateSlabs(std::next(Slabs.begin()), Slabs.end()); in Reset()
207 Slabs.erase(std::next(Slabs.begin()), Slabs.end()); in Reset()
294 /// This points to the next free byte in the slab.
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/AArch64/
H A DAArch64RedundantCopyElimination.cpp168 for (MachineInstr &PredI : make_range(std::next(RIt), PredMBB->rend())) { in knownRegValInBlock()
306 MachineBasicBlock::iterator Itr = std::next(CondBr); in optimizeBlock()
429 // Skip to the next instruction if we removed the COPY/MovImm. in optimizeBlock()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/AMDGPU/
H A DR600Packetizer.cpp314 endPacket(std::next(It)->getParent(), std::next(It));
375 // The next region starts above the previous region. Look backward in the in runOnMachineFunction()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/AVR/
H A DAVRInstrInfo.cpp302 while (std::next(I) != MBB.end()) { in analyzeBranch()
303 std::next(I)->eraseFromParent(); in analyzeBranch()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Scalar/
H A DCallSiteSplitting.cpp246 auto II = std::next(CI->getIterator()); in copyMustTailReturn()
333 TailBB, PredBB, &*std::next(Instr->getIterator()), ValueToValueMaps[i], in splitCallSite()
/third_party/spirv-tools/source/
H A Denum_set.h170 // The iterator has the logic to find the next valid bit. If the value 0
171 // is not stored, use it to find the next valid bit.
427 assert(std::next(it) == buckets_.end() || in InsertBucketFor()
428 std::next(it)->start > bucket_start); in InsertBucketFor()
/third_party/skia/third_party/externals/icu/source/common/
H A Dcaniter.cpp129 *@return the next string that is canonically equivalent. The value null is returned when
132 UnicodeString CanonicalIterator::next() { in next() function in CanonicalIterator
150 // find next value for next time in next()
369 //String item = (String) it.next(); in getEquivalents()
380 //String possible = (String) it2.next(); in getEquivalents()
456 while (iter.next()) { in getEquivalents2()
H A Dlocalebuilder.cpp171 while ((key = keywords->next(nullptr, errorCode)) != nullptr) { in _copyExtensions()
199 while ((key = iter->next(nullptr, errorCode)) != nullptr) { in _clearUAttributesAndKeyType()
H A Dnormlzr.cpp265 * Return the next character in the normalized text and advance
269 UChar32 Normalizer::next() { in next() function in Normalizer
312 return next(); in first()
333 * {@link #next} and {@link #previous} iterate through characters in the
335 * correspondence between characters returned by <tt>next</tt> and
H A Drbbi_cache.cpp164 // leave the text pointer on the other side of its range, ready to search for the next one. in populateDictionary()
169 // Reload the loop variables for the next go-round in populateDictionary()
240 // startPos is in the cache. Do a next() from that position. in following()
243 // next() does not clear it in the fast-path case, where everything matters. Maybe it should. in following()
246 next(); in following()
272 * Out-of-line code for BreakCache::next().
292 // Cache already holds the next boundary in previous()
409 next(); in populateNear()
412 // If position is not itself a boundary, the next() loop above will overshoot. in populateNear()
462 // (subsequent calls to BreakIterator::next() wil in populateFollowing()
[all...]
/third_party/typescript/tests/baselines/reference/
H A DthisTypeInFunctionsNegative.js186 function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
189 step((generator = generator.apply(thisArg, _arguments || [])).next());
/third_party/toybox/toys/net/
H A Difconfig.c331 sl->next = ifaces; in show_iface()
358 for(sl = ifaces; sl; sl = sl->next) in show_iface()
/third_party/protobuf/java/core/src/main/java/com/google/protobuf/
H A DInternal.java508 public java.util.Map.Entry<K, V> next() { in next() method in Internal.MapAdapter.IteratorAdapter
509 return new EntryAdapter(realIterator.next()); in next()

Completed in 25 milliseconds

1...<<161162163164165166167168169170>>...244