Home
last modified time | relevance | path

Searched refs:next (Results 5551 - 5575 of 5727) sorted by relevance

1...<<221222223224225226227228229230

/third_party/skia/src/xps/
H A DSkXPSDevice.cpp1303 while ((verb = iter.next(points)) != SkPath::kDone_Verb) { in addXpsPathGeometry()
/third_party/skia/src/pdf/
H A DSkPDFDevice.cpp775 rec->fPos += 1; // move to the next glyph's position in drawGlyphRunAsPath()
882 while (SkClusterator::Cluster c = clusterator.next()) { in internalDrawGlyphRun()
/third_party/skia/tests/
H A DImageTest.cpp1392 while (void* addr = iter.next()) { in DEF_TEST()
/third_party/python/Lib/test/
H A Dtest_nntplib.py927 resp, art_num, message_id = self.server.next()
H A Dtest_compile.py651 self.assertIs(next(iter(f3.__code__.co_consts[1])),
1004 # Check if bytecode containing jumps that simply point to the next line
H A Dtest_urllib2.py1322 self.assertEqual(url, next(urls))
1337 # Set up a normal response for the next request
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/CodeGen/
H A DSelectionDAGNodes.h288 /// Get the next SDUse in the use list.
733 return !use_empty() && std::next(use_begin()) == use_end(); in hasOneUse()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/
H A DLazyValueInfo.cpp850 for (Instruction &I : make_range(std::next(BBI->getIterator().getReverse()), in intersectAssumeOrGuardBlockValueConstantRange()
955 // %siv.next = select i1 %39, i32 16, i32 %40 in solveBlockValueSelect()
956 // %siv.next = constantrange<0, 17> not <-1, 17> in solveBlockValueSelect()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Utils/
H A DCodeExtractor.cpp1249 InsertPt = std::next(OutI->getIterator()); in emitCallAndSwitchStatement()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/AVR/
H A DAVRExpandPseudoInsts.cpp104 BlockIt NMBBI = std::next(MBBI); in expandMBB()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Hexagon/
H A DHexagonCommonGEP.cpp565 for (NodeSet::iterator NJ = std::next(NI); NJ != NE; ++NJ) in common()
1120 // is not the same as the input type of the next node. in fabricateGEP()
H A DRDFGraph.cpp398 // If NA is already "next", do nothing. in append()
718 // Get the next valid position after P (skipping all delimiters). in nextUp()
1014 NextI = std::next(I); in releaseBlock()
1148 // Return the next reference node in the instruction node IA that is related
1186 // Find the next node related to RA in IA that satisfies condition P.
1213 // Get the next shadow node in IA corresponding to RA, and optionally create
1234 // Get the next shadow node in IA corresponding to RA. Return null-address
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/PowerPC/
H A DPPCAsmPrinter.cpp1230 make_range(std::next(MI->operands_begin()), MI->operands_end())) { in EmitInstruction()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/WebAssembly/
H A DWebAssemblyISelLowering.cpp379 DoneMBB->splice(DoneMBB->begin(), BB, std::next(MI.getIterator()), BB->end()); in LowerFPToInt()
780 // For non-fixed arguments, next emit stores to store the argument values in LowerCall()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/X86/
H A DX86FloatingPoint.cpp491 while (++Start != std::next(I)) { in processBasicBlock()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Instrumentation/
H A DControlHeightReduction.cpp201 // The next scope is appendable only if this scope is directly connected to in appendable()
203 // it (no edge to the next scope outside this scope). in appendable()
211 // There's an edge going into the entry of the next scope from outside in appendable()
1006 auto NextIt = std::next(It); in findScopes()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Scalar/
H A DLICM.cpp1195 if (std::next(Begin) != CurAST->end()) in canSinkOrHoistInst()
/third_party/skia/third_party/externals/icu/source/common/
H A Dustrcase.cpp419 /* find next index where to titlecase */ in ustrcase_internalToTitle()
425 index=iter->next(); in ustrcase_internalToTitle()
444 // Adjust the titlecasing index to the next cased character, in ustrcase_internalToTitle()
445 // or to the next letter/number/symbol/private use. in ustrcase_internalToTitle()
1469 /* get next code unit from string 1, post-increment */ in _cmpFold()
1492 /* get next code unit from string 2, post-increment */ in _cmpFold()
1650 /* set next level pointers to case folding */ in _cmpFold()
1696 /* set next level pointers to case folding */ in _cmpFold()
/third_party/python/Python/
H A Dpylifecycle.c2087 if (tstate != interp->threads.head || tstate->next != NULL) { in Py_EndInterpreter()
/third_party/python/Lib/xml/etree/
H A DElementTree.py162 Text after this element's end tag, but before the next sibling element's
1268 next(it)
/third_party/rust/crates/bindgen/bindgen/ir/
H A Ditem.rs140 fn next(&mut self) -> Option<Self::Item> { in next() functions
391 /// The next local id to use for a child or template instantiation.
/third_party/selinux/libsepol/cil/src/
H A Dcil_copy_ast.c2088 parent->cl_tail->next = new; in __cil_copy_node_helper()
/third_party/rust/crates/serde/serde_derive_internals/src/
H A Dattr.rs1864 while let Some(tt) = iter.next() { in collect_lifetimes_from_tokens()
1867 if let Some(TokenTree::Ident(ident)) = iter.next() { in collect_lifetimes_from_tokens()
/third_party/rust/crates/serde/serde_derive/src/internals/
H A Dattr.rs1864 while let Some(tt) = iter.next() { in collect_lifetimes_from_tokens()
1867 if let Some(TokenTree::Ident(ident)) = iter.next() { in collect_lifetimes_from_tokens()
/third_party/rust/crates/serde/serde/src/private/
H A Dde.rs1428 let (variant, value) = match iter.next() { in deserialize_enum()
1438 if iter.next().is_some() { in deserialize_enum()
1998 let (variant, value) = match iter.next() { in deserialize_enum()
2008 if iter.next().is_some() { in deserialize_enum()
2256 match self.iter.next() { in next_element_seed()
2301 match self.iter.next() { in next_key_seed()

Completed in 70 milliseconds

1...<<221222223224225226227228229230