|
|
reference, declaration → definition
definition → references, declarations, derived classes, virtual overrides
reference to multiple definitions → definitions
unreferenced
|
References
include/llvm/ADT/DirectedGraph.h 96 iterator begin() { return Edges.begin(); }
include/llvm/CodeGen/MachinePipeliner.h 414 iterator begin() { return Nodes.begin(); }
lib/Analysis/AliasAnalysisEvaluator.cpp 140 for (SetVector<Value *>::iterator I1 = Pointers.begin(), E = Pointers.end();
147 for (SetVector<Value *>::iterator I2 = Pointers.begin(); I2 != I1; ++I2) {
177 for (Value *Load : Loads) {
178 for (Value *Store : Stores) {
203 for (SetVector<Value *>::iterator I1 = Stores.begin(), E = Stores.end();
205 for (SetVector<Value *>::iterator I2 = Stores.begin(); I2 != I1; ++I2) {
231 for (CallBase *Call : Calls) {
232 for (auto Pointer : Pointers) {
281 for (CallBase *CallA : Calls) {
282 for (CallBase *CallB : Calls) {
lib/Analysis/CGSCCPassManager.cpp 578 for (Node *RefTarget : DemotedCallTargets) {
607 for (Node *CallTarget : PromotedRefTargets) {
lib/Analysis/LazyCallGraph.cpp 127 for (auto *F : G->LibFunctions)
lib/Analysis/LoopAccessAnalysis.cpp 827 for (auto A : Accesses)
862 for (auto AC : S) {
lib/Analysis/MemorySSAUpdater.cpp 1327 SmallVector<WeakVH, 16> PhisToOptimize{PhisToCheck.begin(),
lib/Analysis/ModuleSummaryAnalysis.cpp 425 for (auto &VI : StoreRefEdges)
433 for (auto &VI : LoadRefEdges)
437 for (auto &VI : StoreRefEdges)
lib/Analysis/ScalarEvolution.cpp 3849 for (const auto &VE : SI->second)
lib/Analysis/ScalarEvolutionExpander.cpp 1790 for (auto const &VOPair : *Set) {
lib/Analysis/VectorUtils.cpp 1051 for (auto *Group : StoreGroups)
1072 for (auto *Group : LoadGroups) {
lib/CodeGen/AsmPrinter/CodeViewDebug.cpp 863 for (const DISubprogram *SP : InlinedSubprograms) {
lib/CodeGen/AsmPrinter/DwarfDebug.cpp 1044 for (const DISubprogram *SP : ProcessedSPNodes) {
lib/CodeGen/CodeGenPrepare.cpp 3358 for (auto M : Matched)
3364 for (auto MV : Matched)
6214 for (auto *I : MaybeDead) {
lib/CodeGen/GlobalISel/Localizer.cpp 179 for (MachineInstr *MI : LocalizedInstrs) {
lib/CodeGen/InlineSpiller.cpp 1185 for (auto const SibReg : Siblings) {
lib/CodeGen/MachineBlockPlacement.cpp 2510 for (const MachineBasicBlock *LoopBB : LoopBlockSet)
2544 for (const MachineBasicBlock *LoopBB : LoopBlockSet)
lib/CodeGen/MachineCopyPropagation.cpp 583 MaybeDeadCopies.begin();
619 for (MachineInstr *MaybeDead : MaybeDeadCopies) {
lib/CodeGen/MachinePipeliner.cpp 1211 NodeSets.push_back(NodeSet(Stack.begin(), Stack.end()));
1449 for (SetVector<SUnit *>::iterator I = NodeOrder.begin(), E = NodeOrder.end();
1482 for (SetVector<SUnit *>::iterator I = NodeOrder.begin(), E = NodeOrder.end();
1535 for (typename S1Ty::iterator I = Set1.begin(), E = Set1.end(); I != E; ++I)
1684 for (SUnit *NI : N) {
1689 I.insert(Path.begin(), Path.end());
1695 for (SUnit *NI : N) {
1700 I.insert(Path.begin(), Path.end());
1710 for (SUnit *I : N)
1719 for (SUnit *I : N)
1818 R.insert(N.begin(), N.end());
1822 R.insert(N.begin(), N.end());
1856 for (SUnit *I : R) {
1895 R.insert(N.begin(), N.end());
1902 for (SUnit *I : R) {
1944 R.insert(N.begin(), N.end());
1952 for (SUnit *I : NodeOrder)
1975 SetVector<SUnit *>::iterator NI = NodeOrder.begin();
lib/CodeGen/MachineSink.cpp 328 for (auto &Pair : ToSplit) {
1320 DbgValsToSink.insert(DbgValsToSink.begin(), DbgValsToSinkSet.begin(),
lib/CodeGen/RegAllocGreedy.cpp 3023 for (LiveInterval *LI : SetOfBrokenHints) {
lib/CodeGen/SelectionDAG/DAGCombiner.cpp 1426 for (SDNode *LN : UpdatedNodes) {
12498 for (auto *U : Users) {
lib/CodeGen/SjLjEHPrepare.cpp 384 setupFunctionContext(F, makeArrayRef(LPads.begin(), LPads.end()));
lib/CodeGen/TailDuplicator.cpp 104 for (MachineBasicBlock *PredBB : Preds) {
464 for (MachineBasicBlock *SuccBB : Succs) {
816 for (MachineBasicBlock *PredBB : Preds) {
952 for (MachineBasicBlock *PredBB : Preds) {
lib/IR/AsmWriter.cpp 2621 for (const Comdat *C : Comdats) {
lib/Linker/IRMover.cpp 1348 makeArrayRef(Elts.begin(), Elts.end())));
lib/Linker/LinkModules.cpp 546 for (GlobalValue *GV : ValuesToLink)
lib/TableGen/SetTheory.cpp 56 for (RecSet::iterator I = Add.begin(), E = Add.end(); I != E; ++I)
72 for (RecSet::iterator I = S1.begin(), E = S1.end(); I != E; ++I)
106 Elts.insert(Set.begin() + N, Set.end());
119 Elts.insert(Set.begin(), Set.begin() + N);
119 Elts.insert(Set.begin(), Set.begin() + N);
140 Elts.insert(Set.begin() + N, Set.end());
141 Elts.insert(Set.begin(), Set.begin() + N);
141 Elts.insert(Set.begin(), Set.begin() + N);
326 EltVec.assign(Elts.begin(), Elts.end());
lib/Target/AArch64/AArch64PBQPRegAlloc.cpp 263 for (auto r : Chains) {
339 for (auto r : Chains) {
lib/Target/AArch64/AArch64RedundantCopyElimination.cpp 454 for (MCPhysReg KnownReg : UsedKnownRegs)
lib/Target/AMDGPU/AMDGPUAnnotateUniformValues.cpp 106 for (auto &BB : Checklist) {
lib/Target/AMDGPU/AMDGPUMachineCFGStructurizer.cpp 527 for (auto CI : Children) {
543 return (*(Children.begin()))->getBBSelectRegOut();
561 for (auto MRTI : Children) {
587 for (auto CI : Children) {
607 for (auto &CI : Children) {
827 for (auto CI : *Children) {
1332 for (auto CI : *Children) {
1344 for (auto CI : *Children) {
2652 for (auto CI = Children->begin(), CE = Children->end(); CI != CE; ++CI) {
2789 for (auto CI : *Children) {
2841 for (auto CI = Region->getChildren()->begin(),
lib/Target/ARM/ARMCodeGenPrepare.cpp 548 for (auto *V : *Visited) {
576 for (auto *V : *Visited) {
667 for (auto V : *Visited) {
713 for (auto *V : *Visited) {
768 for (auto *V : Visited) {
983 for (auto *I : CurrentVisited)
987 for (auto *V : CurrentVisited) {
lib/Target/ARM/ARMParallelDSP.cpp 119 for (auto *Add : Adds) {
185 for (auto *Add : Adds)
544 AllAdds.insert(R.getAdds().begin(), R.getAdds().end());
lib/Target/Hexagon/BitTracker.cpp 952 Targets.insert(BTs.begin(), BTs.end());
976 for (const MachineBasicBlock *TB : Targets)
lib/Target/Hexagon/HexagonCommonGEP.cpp 401 Uses[PN].insert(Us.begin(), Us.end());
615 MinUs.insert(Uses[N].begin(), Uses[N].end());
773 for (UseSet::iterator I = Us.begin(), E = Us.end(); I != E; ++I) {
983 for (Use *U : Us) {
987 for (Use *U : NewUs)
1021 for (UseSet::iterator J = Us.begin(), F = Us.end(); J != F; ++J) {
1050 for (UseSet::iterator J = Us.begin(), F = Us.end(); J != F; ++J)
1151 for (UseSet::iterator I = Us.begin(), E = Us.end(); I != E; ++I)
1236 for (UseSet::iterator I = Us.begin(), E = Us.end(); I != E; ++I) {
lib/Target/Hexagon/HexagonConstExtenders.cpp 1316 for (unsigned I : P.second)
1397 for (unsigned I : RangeMap[N->Range])
1468 F->second.insert(P.second.begin(), P.second.end());
lib/Target/Hexagon/HexagonConstPropagation.cpp 775 for (const MachineBasicBlock *TB : Targets) {
lib/Target/Hexagon/HexagonExpandCondsets.cpp 392 for (MachineBasicBlock *D : Defs)
lib/Target/Hexagon/HexagonFrameLowering.cpp 1961 for (auto *RC : SpillRCs) {
lib/Target/Hexagon/HexagonGenPredicate.cpp 489 for (VectOfInst::iterator I = Erase.begin(), E = Erase.end(); I != E; ++I)
519 for (iterator I = Copy.begin(), E = Copy.end(); I != E; ++I) {
lib/Target/Hexagon/HexagonISelDAGToDAGHVX.cpp 197 FirstQ.insert(Q.begin(), Q.end());
202 for (Node N : FirstQ) {
lib/Target/Hexagon/HexagonLoopIdiomRecognition.cpp 1318 Cycled.insert(C.begin(), C.end());
1324 ValueSeq Users(Cycled.begin(), Cycled.end());
1352 ValueSeq Internal(Users.begin(), Users.end());
1366 for (Value *V : Inputs)
1369 for (Value *V : Internal)
lib/Target/Hexagon/HexagonRDFOpt.cpp 178 for (NodeId N : PartlyDead) {
lib/Target/Hexagon/HexagonVectorLoopCarriedReuse.cpp 449 for (auto *D : Dependences) {
720 for (auto *D : Dependences) {
lib/Target/Hexagon/RDFDeadCode.cpp 144 for (NodeId N : LiveNodes) {
lib/Target/Hexagon/RDFGraph.cpp 1415 for (auto DB : IDF) {
lib/Target/Hexagon/RDFLiveness.cpp 159 for (NodeId N : DefQ) {
207 std::vector<NodeId> Tmp(Owners.begin(), Owners.end());
711 IDF[&B].insert(IDFB.begin(), IDFB.end());
lib/Target/X86/X86SpeculativeLoadHardening.cpp 589 for (MachineBasicBlock *MBB : Blocks) {
lib/Transforms/IPO/AlwaysInliner.cpp 58 for (CallSite CS : Calls)
lib/Transforms/IPO/Attributor.cpp 731 for (const Use *U : Uses) {
742 for (const Use *U : NextUses)
1095 RVS.RetValsMap[&Val].insert(RVS.RetInsts.begin(), RVS.RetInsts.end());
1212 NewRVsMap[RetVal].insert(It.second.begin(), It.second.end());
1223 for (ReturnInst *RI : It.second)
2154 for (const Instruction *NRC : NoReturnCalls) {
2384 for (const Instruction *I : NoReturnCalls)
3558 for (Instruction *MallocCall : MallocCalls) {
4484 Worklist.insert(QuerriedAAs.begin(), QuerriedAAs.end());
4496 for (AbstractAttribute *AA : Worklist)
4543 ChangedAAs.append(QuerriedAAs.begin(), QuerriedAAs.end());
lib/Transforms/IPO/CrossDSOCFI.cpp 142 for (uint64_t TypeId : TypeIds) {
lib/Transforms/IPO/FunctionImport.cpp 1183 for (const auto *GV : GlobalsToImport)
lib/Transforms/IPO/Inliner.cpp 1154 for (Function *InlinedCallee : InlinedCallees) {
lib/Transforms/IPO/LowerTypeTests.cpp 1292 for (auto GV : GlobalVarUsers)
1743 for (auto *C : Constants)
lib/Transforms/IPO/PartialInlining.cpp 1144 for (Value *value : Inputs)
1146 for (Value *output : Outputs)
lib/Transforms/IPO/ThinLTOBitcodeWriter.cpp 319 for (auto V : CfiFunctions) {
lib/Transforms/InstCombine/InstCombineCasts.cpp 2222 for (auto *OldPN : OldPhiNodes) {
2229 for (auto *OldPN : OldPhiNodes) {
2260 for (auto *OldPN : OldPhiNodes) {
lib/Transforms/InstCombine/InstCombineCompares.cpp 590 for (auto *PN : PHIs)
599 for (Value *Val : Explored) {
660 for (Value *Val : Explored) {
672 for (Value *Val : Explored) {
712 for (Value *Val : Explored) {
730 for (Value *Val : Explored) {
lib/Transforms/ObjCARC/ProvenanceAnalysisEvaluator.cpp 70 for (Value *V1 : Values) {
72 for (Value *V2 : Values) {
lib/Transforms/Scalar/ADCE.cpp 472 for (auto *BB : BlocksWithDeadTerminators)
483 BlocksWithDeadTerminators.begin(),
565 for (auto *BB : BlocksWithDeadTerminators)
573 for (auto *BB : BlocksWithDeadTerminators) {
lib/Transforms/Scalar/ConstantHoisting.cpp 215 for (auto BB : BBs) {
279 BBs.insert(InsertPts.begin(), InsertPts.end());
301 ParentInsertPts.insert(InsertPts.begin(), InsertPts.end());
325 for (auto BB : BBs) {
346 Instruction &FirstInst = (*BBs.begin())->front();
839 for (Instruction *IP : IPSet) {
lib/Transforms/Scalar/GVN.cpp 2566 for(SmallSetVector<BasicBlock *, 4>::iterator I = DF.begin(), E = DF.end();
2642 for (BasicBlock *BB : DeadBlocks) {
lib/Transforms/Scalar/GVNSink.cpp 160 if (std::find(Blocks.begin(), Blocks.end(), (*II)->getParent()) ==
755 for (auto *C : ActivePreds)
lib/Transforms/Scalar/LICM.cpp 1538 BasicBlock *PredBB = *PredBBs.begin();
1641 for (auto *UI : Users) {
lib/Transforms/Scalar/LoopIdiomRecognize.cpp 758 for (SetVector<StoreInst *>::iterator it = Heads.begin(), e = Heads.end();
lib/Transforms/Scalar/LoopStrengthReduce.cpp 2678 I = Strides.begin(), E = Strides.end(); I != E; ++I)
3885 for (int64_t Factor : Factors) {
3970 for (int64_t Factor : Factors) {
4032 for (Type *SrcTy : Types) {
4926 for (const SCEV *Reg : ReqRegs) {
lib/Transforms/Scalar/LowerConstantIntrinsics.cpp 55 for (auto I : Worklist) {
lib/Transforms/Scalar/PlaceSafepoints.cpp 562 for (BasicBlock *Header : Headers) {
lib/Transforms/Scalar/Reassociate.cpp 2440 RedoInsts.erase(RedoInsts.begin());
lib/Transforms/Scalar/RewriteStatepointsForGC.cpp 379 for (Value *V : LiveSet)
2028 for (Value *LiveValue: Info.LiveSet) {
2700 for (Value *V : Live) {
2735 for (Value *Kill : Data.KillSet[&BB])
2806 Out.insert(LiveOut.begin(), LiveOut.end());
2817 for (auto V : Updated)
2825 for (auto V : Updated)
lib/Transforms/Scalar/SROA.cpp 4204 for (PHINode *PHI : PHIUsers)
4212 for (SelectInst *Sel : SelectUsers)
4228 for (PHINode *PHIUser : PHIUsers)
4230 for (SelectInst *SelectUser : SelectUsers)
lib/Transforms/Scalar/SimpleLoopUnswitch.cpp 1355 for (auto *ClonedBB : ClonedLoopBlocks)
1514 for (auto *BB : DeadBlockSet)
1539 for (auto *BB : DeadBlockSet) {
1548 for (auto *BB : DeadBlockSet)
2027 for (auto *SuccBB : UnswitchedSuccBBs) {
2069 for (BasicBlock *SuccBB : UnswitchedSuccBBs)
2082 for (BasicBlock *SuccBB : UnswitchedSuccBBs)
2091 for (BasicBlock *SuccBB : UnswitchedSuccBBs)
2102 BasicBlock *UnswitchedSuccBB = *UnswitchedSuccBBs.begin();
2124 for (BasicBlock *SuccBB : UnswitchedSuccBBs)
lib/Transforms/Scalar/SpeculateAroundPHIs.cpp 570 for (auto *PredBB : PredSet) {
lib/Transforms/Utils/BreakCriticalEdges.cpp 377 for (BasicBlock *Target : Targets) {
lib/Transforms/Utils/CodeExtractor.cpp 215 for (auto *BB : Result) {
745 for (BasicBlock *Block : Blocks)
1076 for (Value *input : inputs) {
1088 for (Value *output : outputs) {
1191 for (BasicBlock *Block : Blocks) {
1327 Function *oldFunc = (*Blocks.begin())->getParent();
1331 for (BasicBlock *Block : Blocks) {
1392 BasicBlock *header = *Blocks.begin();
1411 for (BasicBlock *Block : Blocks)
1425 for (BasicBlock *Block : Blocks) {
1482 for (auto *II : SinkingCands) {
1491 for (auto *II : SinkingCands) {
1500 for (auto *II : HoistingCands)
lib/Transforms/Utils/InlineFunction.cpp 835 SmallVector<const Metadata *, 16> Queue(MD.begin(), MD.end());
848 for (const MDNode *I : MD) {
856 for (const MDNode *I : MD) {
lib/Transforms/Utils/LCSSA.cpp 268 for (PHINode *PN : PHIsToRemove)
348 for (BasicBlock *BB : BlocksDominatingExits) {
lib/Transforms/Utils/Local.cpp 2240 for (auto *BB : DeadBlockSet) {
2265 for (auto *BB : DeadBlockSet) {
2275 for (auto *BB : DeadBlockSet)
lib/Transforms/Utils/LoopUnroll.cpp 950 for (Loop *SubLoop : LoopsToSimplify)
lib/Transforms/Utils/SimplifyCFG.cpp 1020 for (auto *Succ : FailBlocks) {
3868 for (auto *TrivialBB : TrivialUnwindBlocks) {
lib/Transforms/Vectorize/LoopVectorize.cpp 4448 for (auto *I : ScalarPtrs)
4542 Scalars[VF].insert(Worklist.begin(), Worklist.end());
4736 for (auto *V : ConsecutiveLikePtrs)
4818 Uniforms[VF].insert(Worklist.begin(), Worklist.end());
lib/Transforms/Vectorize/SLPVectorizer.cpp 4395 for (Instruction *I : GatherSeq) {
4426 for (BasicBlock *BB : CSEBlocks)
7088 for (auto *V : Candidates) {
tools/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ExplodedGraph.h 496 iterator begin() { return Impl.begin(); }
tools/clang/lib/AST/ASTImporter.cpp 7833 return FoundDeclsTy(LookupResult.begin(), LookupResult.end());
tools/clang/lib/AST/CXXInheritance.cpp 48 std::copy(Decls.begin(), Decls.end(), DeclsFound.get());
tools/clang/lib/Analysis/CFG.cpp 1586 for (LabelSetTy::iterator I = AddressTakenLabels.begin(),
tools/clang/lib/Basic/Module.cpp 255 return llvm::makeArrayRef(TopHeaders.begin(), TopHeaders.end());
tools/clang/lib/CodeGen/CGException.cpp 1797 for (const VarDecl *VD : Finder.Captures) {
tools/clang/lib/CodeGen/CGObjCMac.cpp 5590 for (const auto *Sym : DefinedSymbols)
5593 for (const auto *Sym : LazySymbols)
5595 for (const auto &Category : DefinedCategoryNames)
tools/clang/lib/CodeGen/CodeGenModule.cpp 2018 for (Module *M : ImportedModules) {
2060 for (Module *M : LinkModules)
tools/clang/lib/CodeGen/MicrosoftCXXABI.cpp 4185 AT, llvm::makeArrayRef(CatchableTypes.begin(),
tools/clang/lib/Frontend/Rewrite/RewriteModernObjC.cpp 3961 for (ObjCIvarDecl *IvarDecl : Ivars) {
tools/clang/lib/Parse/ParseOpenMP.cpp 1195 SmallVector<Decl *, 4> Decls(SameDirectiveDecls.begin(),
tools/clang/lib/Sema/Sema.cpp 855 for (const TypedefNameDecl *TD : UnusedLocalTypedefNameCandidates) {
1213 for (NamedDeclSetType::iterator I = UnusedPrivateFields.begin(),
tools/clang/lib/Sema/SemaExprCXX.cpp 852 for (CXXRecordDecl *PublicSubobject : PublicSubobjectsSeen) {
7632 for (TypoExpr *TE : TypoExprs) {
7664 for (auto TE : TypoExprs) {
7729 for (auto TE : TypoExprs) {
tools/clang/lib/Sema/SemaLookup.cpp 3545 for (auto *NS : AssociatedNamespaces) {
tools/clang/lib/Sema/SemaOpenMP.cpp12766 for (auto *NS : AssociatedNamespaces) {
tools/clang/lib/Sema/SemaOverload.cpp 7600 iterator pointer_begin() { return PointerTypes.begin(); }
7606 iterator member_pointer_begin() { return MemberPointerTypes.begin(); }
7612 iterator enumeration_begin() { return EnumerationTypes.begin(); }
7617 iterator vector_begin() { return VectorTypes.begin(); }
12143 it = AssociatedNamespaces.begin(),
12169 << R.getLookupName() << 1 << *SuggestedNamespaces.begin();
tools/clang/lib/Sema/SemaStmt.cpp 1552 for (auto *VD : Decls)
1566 for (auto *VD : Decls)
tools/clang/lib/Serialization/ASTReader.cpp10057 for (auto *ND : PendingMergedDefinitionsToDeduplicate)
tools/clang/lib/Serialization/ASTWriter.cpp 3031 for (auto *I : Mod->Imports)
4832 for (const TypedefNameDecl *TD : SemaRef.UnusedLocalTypedefNameCandidates)
5188 for (auto *DC : UpdatedDeclContexts)
tools/clang/lib/Serialization/ModuleManager.cpp 414 M = NextModule->Imports.begin(),
472 return Node->Imports.begin();
tools/clang/lib/StaticAnalyzer/Checkers/IvarInvalidationChecker.cpp 83 for (MethodSet::iterator I = InvalidationMethods.begin(),
427 I = PartialInfo.InvalidationMethods.begin(),
479 for (MethodSet::iterator I = Info.InvalidationMethods.begin(),
tools/clang/lib/StaticAnalyzer/Frontend/CheckerRegistry.cpp 439 for (const auto *Checker : enabledCheckers) {
562 for (const auto *i : EnabledCheckers)
tools/clang/tools/extra/clang-tidy/ExpandModularHeadersPPCallbacks.cpp 115 for (auto Import : MF->Imports)
tools/clang/unittests/AST/ASTImporterTest.cpp 4280 EXPECT_EQ(*Res.begin(), D);
4330 EXPECT_EQ(*Res.begin(), Foo);
4366 EXPECT_EQ(*Res.begin(), Foo);
4384 EXPECT_EQ(*Res.begin(), FirstDeclMatcher<FieldDecl>().match(
4389 EXPECT_EQ(*Res.begin(), FirstDeclMatcher<FieldDecl>().match(
4394 EXPECT_EQ(*Res.begin(), FirstDeclMatcher<VarDecl>().match(
4443 EXPECT_NE(*ResMinus.begin(), *ResPlus.begin());
4443 EXPECT_NE(*ResMinus.begin(), *ResPlus.begin());
4471 EXPECT_EQ(*Res.begin(), ToPlus);
4502 EXPECT_EQ(*Res.begin(), RD);
4527 EXPECT_EQ(*Res.begin(), RD);
4630 EXPECT_EQ(*Res.begin(), F);
4670 EXPECT_EQ(*Res.begin(), FieldInTemplate);
4679 EXPECT_EQ(*Res.begin(), FieldInSpec);
4725 EXPECT_EQ(*Res.begin(), X);
4759 EXPECT_EQ(*Res.begin(), A);
4764 EXPECT_EQ(*Res.begin(), A);
4785 EXPECT_EQ(*Res.begin(), A);
tools/clang/utils/TableGen/NeonEmitter.cpp 1686 Elts.insert(Elts2.begin(), Elts2.begin() + (Elts2.size() / 2));
1686 Elts.insert(Elts2.begin(), Elts2.begin() + (Elts2.size() / 2));
1696 Elts.insert(Elts2.begin() + (Elts2.size() / 2), Elts2.end());
1763 for (auto &E : Elts) {
tools/lld/ELF/MapFile.cpp 256 for (InputFile *file : files)
tools/llvm-exegesis/lib/Clustering.cpp 152 const size_t Q = *ToProcess.begin();
153 ToProcess.erase(ToProcess.begin());
tools/llvm-extract/llvm-extract.cpp 292 for (GlobalValue *GV : GVs) {
326 SmallPtrSet<GlobalValue *, 8> GVSet(GVs.begin(), GVs.end());
334 std::vector<GlobalValue *> Gvs(GVs.begin(), GVs.end());
tools/llvm-objdump/llvm-objdump.cpp 460 for (StringRef S : MissingSections)
tools/llvm-reduce/deltas/ReduceFunctions.cpp 51 for (auto *C : CallsToRemove)
tools/polly/include/polly/ScopDetection.h 562 iterator begin() { return ValidRegions.begin(); }
tools/polly/include/polly/ScopInfo.h 2159 inline array_iterator array_begin() { return ScopArrayInfoSet.begin(); }
tools/polly/lib/Analysis/ScopBuilder.cpp 1548 for (auto *Param : DetectedParams) {
1654 for (LoadInst *LInst : AccessILS)
1741 for (LoadInst *LInst : AccessILS)
1861 for (const Loop *L : Loops)
1875 for (LoadInst *LInst : AccessILS)
3654 for (auto *BP : ArrayBasePointers)
tools/polly/lib/Analysis/ScopDetection.cpp 458 for (LoadInst *Load : RequiredILS) {
469 for (auto NonAffineRegion : Context.NonAffineSubRegionSet) {
481 Context.RequiredILS.insert(RequiredILS.begin(), RequiredILS.end());
494 for (auto *V : Values) {
1041 for (auto &Pair : Context.NonAffineAccesses) {
1098 for (const Loop *L : Loops)
1874 for (const Region *R : Result->ValidRegions)
1912 for (const Region *R : SD.ValidRegions)
tools/polly/lib/Analysis/ScopInfo.cpp 1557 for (auto *Parameter : Parameters) {
tools/polly/lib/CodeGen/BlockGenerators.cpp 1556 for (BasicBlock *BB : SeenBlocks) {
1580 for (BasicBlock *BB : SeenBlocks) {
tools/polly/lib/CodeGen/IslNodeBuilder.cpp 326 for (const SCEV *Expr : SCEVs) {
355 for (Value *V : Values) {
674 for (const Loop *L : Loops) {
725 for (const Loop *L : Loops)
1047 for (auto *Val : Values) {
1364 for (auto *Val : Values) {
tools/polly/lib/CodeGen/LoopGenerators.cpp 221 for (Value *V : Values)
tools/polly/lib/Support/SCEVValidator.cpp 671 Params.insert(ResultParams.begin(), ResultParams.end());
unittests/ADT/SetVectorTest.cpp 24 auto I = S.erase(std::next(S.begin()));
28 EXPECT_EQ(std::next(S.begin()), I);
30 EXPECT_EQ(0, *S.begin());
31 EXPECT_EQ(2, *std::next(S.begin()));
unittests/Analysis/AliasAnalysisTest.cpp 55 for (Value *P1 : Pointers)
56 for (Value *P2 : Pointers)
usr/include/c++/7.4.0/bits/range_access.h 48 begin(_Container& __cont) -> decltype(__cont.begin())
49 { return __cont.begin(); }
utils/TableGen/AsmMatcherEmitter.cpp 1926 unsigned ID = IsNew ? Table.size() - 1 : find(Table, Name) - Table.begin();
2291 for (const auto &Converter : OperandConversionKinds)
2298 for (const auto &Signature : InstructionConversionKinds)
utils/TableGen/CodeGenRegisters.cpp 778 Orders[1 + i].append(Order.begin(), Order.end());
utils/TableGen/FixedLenDecoderEmitter.cpp 950 for (const auto &Predicate : Predicates) {
979 for (const auto &Decoder : Decoders) {
1183 return (unsigned)(P - Decoders.begin());
1255 return (unsigned)(P - TableInfo.Predicates.begin());
utils/TableGen/RegisterInfoEmitter.cpp 905 diffEncode(SubRegLists[i], Reg.EnumValue, SR.begin(), SR.end());
910 for (const CodeGenRegister *S : SR)
1558 ArrayRef<Record*>(OPSet.begin(), OPSet.end()));