|
|
reference, declaration → definition
definition → references, declarations, derived classes, virtual overrides
reference to multiple definitions → definitions
unreferenced
|
References
gen/tools/clang/include/clang/AST/Attrs.inc13734 for (auto &Feature : AttrFeatures) {
13751 for (auto &Feature : AttrFeatures) {
13777 for (auto &Feature : AttrFeatures) {
include/llvm/ADT/DirectedGraph.h 188 iterator end() { return Nodes.end(); }
208 if (findNode(N) != Nodes.end())
223 EL.insert(EL.end(), TempList.begin(), TempList.end());
223 EL.insert(EL.end(), TempList.begin(), TempList.end());
235 if (IT == Nodes.end())
239 for (auto *Node : Nodes) {
243 for (auto *E : EL)
256 assert(findNode(Src) != Nodes.end() && "Src node should be present.");
257 assert(findNode(Dst) != Nodes.end() && "Dst node should be present.");
include/llvm/ADT/FoldingSet.h 568 iterator end() { return Vector.end(); }
include/llvm/ADT/MapVector.h 71 iterator end() { return Vector.end(); }
149 return Pos == Map.end()? Vector.end() :
176 if (Next == Vector.end())
211 for (auto I = O, E = Vector.end(); I != E; ++I) {
226 Vector.erase(O, Vector.end());
include/llvm/ADT/PriorityWorklist.h 122 V.insert(V.end(), std::begin(Input), std::end(Input));
197 if (E == V.end())
202 V.erase(E, V.end());
include/llvm/ADT/STLExtras.h 1129 for (auto V : C)
1151 -> decltype(std::distance(Range.begin(), Range.end())) {
1152 return std::distance(Range.begin(), Range.end());
1333 C.erase(remove_if(C, P), C.end());
include/llvm/ADT/SetVector.h 93 return vector_.end();
160 assert(I != vector_.end() && "Corrupted SetVector instances!");
202 if (I == vector_.end())
204 vector_.erase(I, vector_.end());
include/llvm/ADT/SmallSet.h 185 if (I != Vector.end()) // Don't reinsert if it already exists.
210 for (mutable_iterator I = Vector.begin(), E = Vector.end(); I != E; ++I)
include/llvm/ADT/SmallVector.h 133 reverse_iterator rbegin() { return reverse_iterator(end()); }
168 return end()[-1];
214 ::new ((void*) this->end()) T(Elt);
221 ::new ((void*) this->end()) T(::std::move(Elt));
227 this->end()->~T();
243 this->uninitialized_move(this->begin(), this->end(), NewElts);
246 destroy_range(this->begin(), this->end());
305 memcpy(reinterpret_cast<void *>(this->end()), &Elt, sizeof(T));
340 this->destroy_range(this->begin(), this->end());
346 this->destroy_range(this->begin()+N, this->end());
351 for (auto I = this->end(), E = this->begin() + N; I != E; ++I)
359 this->destroy_range(this->begin()+N, this->end());
364 std::uninitialized_fill(this->end(), this->begin()+N, NV);
392 this->uninitialized_copy(in_start, in_end, this->end());
401 std::uninitialized_fill_n(this->end(), NumInputs, Elt);
417 std::uninitialized_fill(this->begin(), this->end(), Elt);
439 assert(I < this->end() && "Erasing at past-the-end iterator.");
443 std::move(I+1, this->end(), I);
456 assert(E <= this->end() && "Trying to erase past the end.");
460 iterator I = std::move(E, this->end(), S);
462 this->destroy_range(I, this->end());
468 if (I == this->end()) { // Important special case for empty vector.
470 return this->end()-1;
474 assert(I <= this->end() && "Inserting past the end of the vector.");
482 ::new ((void*) this->end()) T(::std::move(this->back()));
484 std::move_backward(I, this->end()-1, this->end());
484 std::move_backward(I, this->end()-1, this->end());
490 if (I <= EltPtr && EltPtr < this->end())
498 if (I == this->end()) { // Important special case for empty vector.
500 return this->end()-1;
504 assert(I <= this->end() && "Inserting past the end of the vector.");
511 ::new ((void*) this->end()) T(std::move(this->back()));
513 std::move_backward(I, this->end()-1, this->end());
513 std::move_backward(I, this->end()-1, this->end());
519 if (I <= EltPtr && EltPtr < this->end())
530 if (I == this->end()) { // Important special case for empty vector.
536 assert(I <= this->end() && "Inserting past the end of the vector.");
548 if (size_t(this->end()-I) >= NumToInsert) {
549 T *OldEnd = this->end();
550 append(std::move_iterator<iterator>(this->end() - NumToInsert),
551 std::move_iterator<iterator>(this->end()));
564 T *OldEnd = this->end();
567 this->uninitialized_move(I, OldEnd, this->end()-NumOverwritten);
585 if (I == this->end()) { // Important special case for empty vector.
591 assert(I <= this->end() && "Inserting past the end of the vector.");
605 if (size_t(this->end()-I) >= NumToInsert) {
606 T *OldEnd = this->end();
607 append(std::move_iterator<iterator>(this->end() - NumToInsert),
608 std::move_iterator<iterator>(this->end()));
621 T *OldEnd = this->end();
624 this->uninitialized_move(I, OldEnd, this->end()-NumOverwritten);
644 ::new ((void *)this->end()) T(std::forward<ArgTypes>(Args)...);
692 this->uninitialized_copy(this->begin()+NumShared, this->end(), RHS.end());
692 this->uninitialized_copy(this->begin()+NumShared, this->end(), RHS.end());
694 this->destroy_range(this->begin()+NumShared, this->end());
698 this->uninitialized_copy(RHS.begin()+NumShared, RHS.end(), this->end());
698 this->uninitialized_copy(RHS.begin()+NumShared, RHS.end(), this->end());
700 this->destroy_range(RHS.begin()+NumShared, RHS.end());
724 this->destroy_range(NewEnd, this->end());
736 this->destroy_range(this->begin(), this->end());
761 this->destroy_range(this->begin(), this->end());
778 NewEnd = std::move(RHS.begin(), RHS.end(), NewEnd);
781 this->destroy_range(NewEnd, this->end());
796 this->destroy_range(this->begin(), this->end());
806 this->uninitialized_move(RHS.begin()+CurSize, RHS.end(),
843 this->destroy_range(this->begin(), this->end());
include/llvm/ADT/SparseSet.h 177 iterator end() { return Dense.end(); }
include/llvm/ADT/StringExtras.h 379 return join(R.begin(), R.end(), Separator);
include/llvm/ADT/TinyPtrVector.h 196 return Val.template get<VecTy *>()->end();
include/llvm/ADT/iterator_range.h 40 : begin_iterator(c.begin()), end_iterator(c.end()) {}
include/llvm/Analysis/AliasAnalysis.h 1120 for (auto &Getter : ResultGetters)
include/llvm/Analysis/BlockFrequencyInfoImpl.h 236 Nodes.insert(Nodes.end(), FirstOther, LastOther);
679 for (const auto &I : Working.Loop->Exits)
1206 for (const BlockNode &M : Loop.Nodes)
include/llvm/Analysis/CGSCCPassManager.h 474 for (LazyCallGraph::Node *N : Nodes) {
include/llvm/Analysis/DDG.h 148 InstList.insert(InstList.end(), Input.begin(), Input.end());
include/llvm/Analysis/LazyCallGraph.h 258 iterator begin() { return iterator(Edges.begin(), Edges.end()); }
259 iterator end() { return iterator(Edges.end(), Edges.end()); }
259 iterator end() { return iterator(Edges.end(), Edges.end()); }
278 return call_iterator(Edges.begin(), Edges.end());
280 call_iterator call_end() { return call_iterator(Edges.end(), Edges.end()); }
280 call_iterator call_end() { return call_iterator(Edges.end(), Edges.end()); }
287 for (auto &E : Edges)
include/llvm/Analysis/LoopInfoImpl.h 90 for (BlockT *EB : UniqueExitBlocks)
288 VisitSet.insert(ExitBBs.begin(), ExitBBs.end());
577 PreOrderLoopsInRootL.end());
include/llvm/Analysis/RegionInfoImpl.h 134 for (BlockT *BB : ExitingBlocks) {
895 for (RegionT *R : Regions)
907 for (BlockT *BB : BBs)
include/llvm/CodeGen/BasicTTIImpl.h 1465 for (unsigned ISD : ISDs) {
1487 auto MinLegalCostI = std::min_element(LegalCost.begin(), LegalCost.end());
1488 if (MinLegalCostI != LegalCost.end())
1492 std::min_element(CustomCost.begin(), CustomCost.end());
1493 if (MinCustomCostI != CustomCost.end())
include/llvm/CodeGen/CallingConvLower.h 562 auto B = TmpArgLocs.begin(), E = TmpArgLocs.end();
include/llvm/CodeGen/GlobalISel/GISelChangeObserver.h 78 auto It = std::find(Observers.begin(), Observers.end(), O);
79 if (It != Observers.end())
84 for (auto &O : Observers)
88 for (auto &O : Observers)
92 for (auto &O : Observers)
96 for (auto &O : Observers)
include/llvm/CodeGen/GlobalISel/InstructionSelectorImpl.h 883 for (const auto &RenderOpFn : State.Renderers[RendererID])
include/llvm/CodeGen/GlobalISel/LegalizationArtifactCombiner.h 525 for (auto *DeadMI : DeadInsts) {
include/llvm/CodeGen/GlobalISel/RegBankSelect.h 383 insertpt_iterator end() { return InsertPoints.end(); }
include/llvm/CodeGen/LiveInterval.h 215 iterator end() { return segments.end(); }
224 vni_iterator vni_end() { return valnos.end(); }
620 assert(std::is_sorted(R.begin(), R.end()));
621 auto Idx = R.begin(), EndIdx = R.end();
include/llvm/CodeGen/LiveRangeEdit.h 160 iterator end() const { return NewRegs.end(); }
include/llvm/CodeGen/MachinePipeliner.h 333 for (const SDep &Succ : Nodes[i]->Succs)
include/llvm/CodeGen/SelectionDAG.h 201 DbgIterator DbgEnd() { return DbgValues.end(); }
203 DbgIterator ByvalParmDbgEnd() { return ByvalParmDbgValues.end(); }
205 DbgLabelIterator DbgLabelEnd() { return DbgLabels.end(); }
include/llvm/CodeGen/SelectionDAGNodes.h 926 Worklist.append(DeferredNodes.begin(), DeferredNodes.end());
include/llvm/DebugInfo/CodeView/CodeViewRecordIO.h 151 for (auto &X : Items) {
160 for (auto &X : Items) {
include/llvm/DebugInfo/DWARF/DWARFContext.h 148 NormalUnits.begin() + NormalUnits.getNumInfoUnits(), NormalUnits.end());
160 return unit_iterator_range(NormalUnits.begin(), NormalUnits.end());
174 DWOUnits.end());
186 return unit_iterator_range(DWOUnits.begin(), DWOUnits.end());
include/llvm/IR/CFGDiff.h 107 for (auto U : LegalizedUpdates) {
include/llvm/IR/LegacyPassNameParser.h 83 array_pod_sort(PNP->Values.begin(), PNP->Values.end(), ValCompare);
include/llvm/IR/PassInstrumentation.h 149 for (auto &C : Callbacks->BeforePassCallbacks)
160 for (auto &C : Callbacks->AfterPassCallbacks)
170 for (auto &C : Callbacks->AfterPassInvalidatedCallbacks)
179 for (auto &C : Callbacks->BeforeAnalysisCallbacks)
188 for (auto &C : Callbacks->AfterAnalysisCallbacks)
include/llvm/IR/PassManager.h 1189 for (auto OuterID : DeadKeys)
include/llvm/IR/PredIteratorCache.h 53 std::copy(PredCache.begin(), PredCache.end(), Entry);
include/llvm/MC/MCInst.h 194 iterator end() { return Operands.end(); }
include/llvm/MC/MCParser/MCAsmParser.h 204 for (auto Err : PendingErrors) {
include/llvm/MC/MCStreamer.h 385 auto I = SectionStack.end();
include/llvm/MCA/HardwareUnits/LSUnit.h 138 for (MemoryGroup *MG : Succ)
151 for (MemoryGroup *MG : Succ)
include/llvm/Option/ArgList.h 191 iterator begin() { return {Args.begin(), Args.end()}; }
192 iterator end() { return {Args.end(), Args.end()}; }
192 iterator end() { return {Args.end(), Args.end()}; }
include/llvm/Support/Allocator.h 170 DeallocateSlabs(Slabs.begin(), Slabs.end());
175 DeallocateSlabs(Slabs.begin(), Slabs.end());
209 DeallocateSlabs(std::next(Slabs.begin()), Slabs.end());
210 Slabs.erase(std::next(Slabs.begin()), Slabs.end());
427 for (auto &PtrAndSize : CustomSizedSlabs) {
474 for (auto I = Allocator.Slabs.begin(), E = Allocator.Slabs.end(); I != E;
485 for (auto &PtrAndSize : Allocator.CustomSizedSlabs) {
include/llvm/Support/Automaton.h 145 std::reverse(P.begin(), P.end());
include/llvm/Support/Error.h 991 return join(Errors.begin(), Errors.end(), "\n");
include/llvm/Support/GenericDomTree.h 643 if (RIt != Roots.end()) {
include/llvm/Support/GenericDomTreeConstruction.h 141 for (auto ChildAndKind : FCIt->second) {
149 assert(llvm::find(Res, Child) != Res.end()
151 Res.erase(std::remove(Res.begin(), Res.end(), Child), Res.end());
151 Res.erase(std::remove(Res.begin(), Res.end(), Child), Res.end());
157 assert(llvm::find(Res, Child) == Res.end() &&
236 for (const NodePtr Succ :
321 for (const auto &N : WInfo.ReverseChildren) {
495 : Roots) dbgs()
533 if (llvm::find(Roots, N) != Roots.end()) {
691 if (RIt == DT.Roots.end())
719 if (std::none_of(DT.Roots.begin(), DT.Roots.end(), [BUI](const NodePtr N) {
798 for (const NodePtr Succ :
852 for (const TreeNodePtr TN : II.Affected) {
859 for (const TreeNodePtr TN : II.VisitedUnaffected)
884 for (const auto &Edge : DiscoveredEdgesToReachable) {
930 return llvm::find(Successors, SuccCandidate) != Successors.end();
1016 for (const NodePtr Pred :
1065 if (llvm::find(AffectedQueue, To) == AffectedQueue.end())
1079 for (const NodePtr N : AffectedQueue) {
1183 for (UpdateT &U : BUI.Updates) {
1291 for (const NodePtr N : ComputedRoots)
1434 for (const TreeNodePtr Ch : Children) {
1614 for (auto &U : BUI.Updates) {
include/llvm/Support/GenericIteratedDominanceFrontier.h 196 for (auto Succ : ChildrenGetter.get(BB))
include/llvm/Support/ScopedPrinter.h 143 for (const auto &Flag : SetFlags) {
include/llvm/Support/SmallVectorMemoryBuffer.h 41 init(this->SV.begin(), this->SV.end(), false);
48 init(this->SV.begin(), this->SV.end(), false);
include/llvm/Support/VirtualFileSystem.h 362 reverse_iterator overlays_rend() { return FSList.end(); }
include/llvm/Support/YAMLTraits.h 874 if (this->canElideEmptySequence() && !(Val.begin() != Val.end()))
include/llvm/TextAPI/MachO/InterfaceFile.h 204 for (const auto &Target_ : Targets)
include/llvm/Transforms/IPO/Attributor.h 558 iterator end() { return IRPositions.end(); }
include/llvm/Transforms/Utils/Evaluator.h 46 for (auto &Tmp : AllocaTmps)
include/llvm/Transforms/Utils/SSAUpdaterImpl.h 336 E = BlockList->end(); I != E; ++I) {
397 E = BlockList->end(); I != E; ++I)
453 E = BlockList->end(); I != E; ++I)
lib/Analysis/AssumptionCache.cpp 117 for (auto &AV : Affected) {
119 if (std::find(AVV.begin(), AVV.end(), CI) == AVV.end())
119 if (std::find(AVV.begin(), AVV.end(), CI) == AVV.end())
128 for (auto &AV : Affected) {
136 AssumeHandles.end());
152 for (auto &A : AVI->second)
153 if (std::find(NAVV.begin(), NAVV.end(), A) == NAVV.end())
153 if (std::find(NAVV.begin(), NAVV.end(), A) == NAVV.end())
185 for (auto &A : AssumeHandles)
210 for (auto &VH : AssumeHandles) {
lib/Analysis/BlockFrequencyInfoImpl.cpp 164 for (WeightList::const_iterator I = O, L = O, E = Weights.end(); I != E;
174 Weights.erase(O, Weights.end());
182 for (const Weight &W : Weights)
244 assert(Total == std::accumulate(Weights.begin(), Weights.end(), UINT64_C(0),
257 for (Weight &W : Weights) {
355 for (const auto &I : Loop.Exits)
383 for (auto &Mass : Loop.BackedgeMass)
404 for (const BlockNode &M : Loop.Nodes) {
434 for (const Weight &W : Dist.Weights) {
510 for (const BlockNode &N : Loop.Nodes) {
763 Headers.end(), Others.begin(), Others.end());
763 Headers.end(), Others.begin(), Others.end());
766 for (const auto &N : Loop->Nodes)
796 for (auto &Mass : OuterLoop.BackedgeMass)
799 for (auto I = O, E = OuterLoop.Nodes.end(); I != E; ++I)
802 OuterLoop.Nodes.erase(O, OuterLoop.Nodes.end());
834 for (const Weight &W : Dist.Weights) {
845 for (const Weight &W : Dist.Weights) {
lib/Analysis/BranchProbabilityInfo.cpp 232 for (unsigned SuccIdx : UnreachableEdges)
242 for (unsigned SuccIdx : UnreachableEdges)
244 for (unsigned SuccIdx : ReachableEdges)
327 for (auto i : UnreachableIdxs)
337 for (auto i : ReachableIdxs)
378 for (unsigned SuccIdx : ColdEdges)
390 for (unsigned SuccIdx : ColdEdges)
392 for (unsigned SuccIdx : NormalEdges)
629 for (unsigned SuccIdx : BackEdges)
636 for (unsigned SuccIdx : InEdges)
644 for (unsigned SuccIdx : ExitingEdges)
652 for (unsigned SuccIdx : UnlikelyEdges)
lib/Analysis/CFLAndersAliasAnalysis.cpp 484 ExtRelations.erase(std::unique(ExtRelations.begin(), ExtRelations.end()),
485 ExtRelations.end());
lib/Analysis/CGSCCPassManager.cpp 542 DeadTargets.end());
566 NewRefSCCs.end()))) {
lib/Analysis/CallGraph.cpp 106 for (CallGraphNode *CN : Nodes)
lib/Analysis/ConstantFolding.cpp 883 for (Value *NestedOp : NestedOps)
lib/Analysis/DDG.cpp 155 for (auto *N : Nodes) {
lib/Analysis/DependenceGraphBuilder.cpp 87 for (Instruction *II : SrcIList) {
147 for (Instruction *ISrc : SrcIList) {
148 for (Instruction *IDst : DstIList) {
lib/Analysis/DivergenceAnalysis.cpp 199 for (auto *Block : TaintStack) {
lib/Analysis/DomTreeUpdater.cpp 66 const auto E = PendUpdates.end();
87 const auto E = PendUpdates.end();
lib/Analysis/IVDescriptors.cpp 387 Worklist.append(PHIs.begin(), PHIs.end());
388 Worklist.append(NonPHIs.begin(), NonPHIs.end());
808 for (auto &Inst : *Casts) {
lib/Analysis/InstructionSimplify.cpp 4421 if (find(Indices, -1) != Indices.end())
lib/Analysis/LazyCallGraph.cpp 236 for (Node *N : Nodes) {
312 for (SCC *C : SCCs) {
657 TargetSCC.Nodes.append(C->Nodes.begin(), C->Nodes.end());
658 for (Node *N : C->Nodes)
668 for (SCC *C : make_range(EraseEnd, SCCs.end()))
744 for (Node *N : Worklist) {
762 for (Node *RootN : Worklist) {
809 OldSCC.Nodes.append(PendingSCCStack.begin(), PendingSCCStack.end());
867 PendingSCCStack.erase(SCCNodes.end().base(), PendingSCCStack.end());
876 SCCs.insert(SCCs.begin() + OldIdx, NewSCCs.begin(), NewSCCs.end());
1077 MergedSCCs.append(RC->SCCs.begin(), RC->SCCs.end());
1085 MergedSCCs.append(SCCs.begin(), SCCs.end());
1094 for (RefSCC *RC : make_range(EraseEnd, G->PostOrderRefSCCs.end()))
1180 for (SCC *C : SCCs) {
1184 Worklist.append(C->Nodes.begin(), C->Nodes.end());
1283 auto RefSCCNodes = make_range(StackRI.base(), PendingRefSCCStack.end());
1299 PendingRefSCCStack.erase(RefSCCNodes.begin(), PendingRefSCCStack.end());
1326 Result.end());
1330 for (SCC *C : SCCs) {
1356 for (RefSCC *RC : Result)
1566 for (auto *RC : PostOrderRefSCCs)
1581 for (Node *RootN : Roots) {
1656 PendingSCCStack.erase(SCCNodes.end().base(), PendingSCCStack.end());
1713 std::reverse(Roots.begin(), Roots.end());
lib/Analysis/LazyValueInfo.cpp 328 for (Value *V : ValsToClear) {
511 BlockValueStack.begin(), BlockValueStack.end());
lib/Analysis/LoopAccessAnalysis.cpp 397 for (CheckingPtrGroup &Group : Groups) {
760 for (auto Access : Retries)
912 for (const Value *UnderlyingObj : TempObjects) {
1144 std::iota(SortedIndices.begin(), SortedIndices.end(), 0);
1640 for (MemAccessInfo CurAccess : CheckDeps) {
1928 for (StoreInst *ST : Stores) {
1959 for (LoadInst *LD : Loads) {
2219 for (const auto &Check : ExpandedChecks) {
lib/Analysis/LoopAnalysisManager.cpp 63 for (Loop *L : PreOrderLoops) {
lib/Analysis/LoopCacheAnalysis.cpp 497 for (const Loop *L : Loops) {
498 assert((std::find_if(LoopCosts.begin(), LoopCosts.end(),
501 }) == LoopCosts.end()) &&
528 for (ReferenceGroupTy &RefGroup : RefGroups) {
563 for (const ReferenceGroupTy &RG : RefGroups) {
lib/Analysis/LoopInfo.cpp 495 for (BasicBlock *BB : LatchesBlocks) {
521 for (BasicBlock *BB : LoopLatches)
968 for (auto *Block : ExitBlocks)
lib/Analysis/MemDepPrinter.cpp 123 for (const NonLocalDepResult &I : NLDI) {
lib/Analysis/MemoryDependenceAnalysis.cpp 1312 Worklist.append(NewBlocks.begin(), NewBlocks.end());
lib/Analysis/MemorySSA.cpp 785 for (auto I = std::next(Dom), E = Paths.end(); I != E; ++I)
788 auto Last = Paths.end() - 1;
861 for (ListIndex Paused : NewPaused) {
881 for (const TerminatedPath &TP : TerminatedPaths) {
905 for (ListIndex I : NewPaused)
1500 for (auto &BB : IDFBlocks)
2005 while (ALI != AL->end() && AAI != ActualAccesses.end()) {
2014 while (DLI != DL->end() && ADI != ActualDefs.end()) {
lib/Analysis/MemorySSAUpdater.cpp 196 for (auto &U : Uses)
221 for (auto &Op : Operands) {
282 for (auto &MP : InsertedPHIs)
320 std::find(InsertedPHIs.begin(), InsertedPHIs.end(), DefBefore) !=
321 InsertedPHIs.end()))
342 SmallVector<WeakVH, 8> FixupList(InsertedPHIs.begin(), InsertedPHIs.end());
371 for (const auto &VH : InsertedPHIs)
379 for (auto *BBIDF : IDFBlocks) {
393 for (auto &MPhi : NewInsertedPHIs) {
404 for (auto &MPhi : NewInsertedPHIs) {
421 FixupList.append(InsertedPHIs.begin() + StartingPHISize, InsertedPHIs.end());
444 for (auto &MP : InsertedPHIs) {
809 for (auto &Update : RevDeleteUpdates)
1048 for (auto &VH : InsertedPhis)
1057 BlocksToProcess.end());
1063 for (auto *BBIDF : IDFBlocks)
1070 for (auto *BBIDF : IDFBlocks) {
1090 for (auto *BlockWithDefsToReplace : BlocksWithDefsToReplace) {
lib/Analysis/ModuleSummaryAnalysis.cpp 192 for (auto &Call : DevirtCalls)
216 for (auto &Call : DevirtCalls)
554 for (MDNode *Type : Types) {
lib/Analysis/PHITransAddr.cpp 66 if (Entry != InstInputs.end()) {
129 if (Entry != InstInputs.end()) {
245 if (std::equal(GEPOps.begin(), GEPOps.end(), GEPI->op_begin()))
lib/Analysis/PhiValues.cpp 130 for (unsigned int N : InvalidComponents) {
lib/Analysis/ScalarEvolution.cpp 2589 for (const SCEV *NewOp : NewOps)
3672 std::uninitialized_copy(Ops.begin(), Ops.end(), O);
4143 for (auto *S : Ops)
4151 for (auto *S : Ops)
6821 for (auto *S : LoopUsersItr->second)
7937 for (const auto &I : PHIsToCompute) {
8010 for (PHINode *PHI : PHIsToCompute) {
8028 for (auto &LS : Values)
11034 for (const SCEV *S : Strides)
11038 for (const SCEV *S : Strides) {
11045 for (const SCEV *T : Terms)
11074 for (const SCEV *&Term : Terms) {
11089 Terms.end());
11101 for (const SCEV *T : Terms)
11160 for (const SCEV *T : Terms)
11165 array_pod_sort(Terms.begin(), Terms.end());
11166 Terms.erase(std::unique(Terms.begin(), Terms.end()), Terms.end());
11166 Terms.erase(std::unique(Terms.begin(), Terms.end()), Terms.end());
11175 for (const SCEV *&Term : Terms) {
11185 for (const SCEV *T : Terms)
11191 for (const SCEV *T : NewTerms)
11205 for (const SCEV *S : Sizes)
11259 std::reverse(Subscripts.begin(), Subscripts.end());
11263 for (const SCEV *S : Subscripts)
11342 for (const SCEV *S : Sizes)
11346 for (const SCEV *S : Subscripts)
11384 Worklist.insert(Worklist.end(), U->user_begin(), U->user_end());
11502 for (BasicBlock *ExitingBlock : ExitingBlocks) {
11646 for (auto &V : Values) {
11753 for (auto &V : Values) {
11945 LoopStack.insert(LoopStack.end(), L->begin(), L->end());
12196 for (auto *P : PredicatedRewrite->second){
lib/Analysis/ScalarEvolutionExpander.cpp 323 SmallVector<const SCEV *, 8> NoAddRecs(Ops.begin(), Ops.end() - NumAddRecs);
324 SmallVector<const SCEV *, 8> AddRecs(Ops.end() - NumAddRecs, Ops.end());
324 SmallVector<const SCEV *, 8> AddRecs(Ops.end() - NumAddRecs, Ops.end());
337 Ops.append(AddRecs.begin(), AddRecs.end());
369 Ops.append(AddRecs.begin(), AddRecs.end());
432 for (const SCEV *Op : Ops) {
707 for (auto I = OpsAndLoops.begin(), E = OpsAndLoops.end(); I != E;) {
727 Sum = expandAddToGEP(NewOps.begin(), NewOps.end(), PTy, Ty, Sum);
737 Sum = expandAddToGEP(NewOps.begin(), NewOps.end(), PTy, Ty, expand(Op));
791 while (E != OpsAndLoops.end() && *I == *E && Exponent != MaxExponent) {
818 while (I != OpsAndLoops.end()) {
993 for (auto *InsertPtGuard : InsertPointGuards)
1970 for (PHINode *Phi : Phis) {
2102 for (BasicBlock *BB : ExitingBlocks) {
lib/Analysis/StackSafetyAnalysis.cpp 462 for (auto &CS : US.Calls) {
483 for (auto &AS : FS.Allocas)
485 for (auto &PS : FS.Params)
493 for (auto &CallerID : Callers[Callee])
508 for (auto &AS : FS.Allocas)
509 for (auto &CS : AS.Use.Calls)
511 for (auto &PS : FS.Params)
512 for (auto &CS : PS.Use.Calls)
516 Callees.erase(std::unique(Callees.begin(), Callees.end()), Callees.end());
516 Callees.erase(std::unique(Callees.begin(), Callees.end()), Callees.end());
518 for (auto &Callee : Callees)
lib/Analysis/StratifiedSets.h 541 for (const auto &Ptr : Found)
lib/Analysis/SyncDependenceAnalysis.cpp 279 for (const auto *BlockLoopExit : BlockLoopExits) {
lib/Analysis/SyntheticCountsUtils.cpp 56 for (auto &E : SCCEdges) {
69 for (auto &E : NonSCCEdges) {
lib/Analysis/TargetTransformInfo.cpp 63 for (BasicBlock *BB : ExitingBlocks) {
1128 std::fill(&ShuffleMask[MaskStart], ShuffleMask.end(), -1);
lib/Analysis/TypeMetadataUtils.cpp 126 for (Value *LoadedPtr : LoadedPtrs)
lib/Analysis/VFABIDemangling.cpp 385 Parameters.begin(), Parameters.end(), [](const VFParameter PK) {
lib/Analysis/ValueTracking.cpp 3847 for (const Value *V : Objs) {
4208 for (const auto *Result : Results) {
lib/AsmParser/LLParser.cpp 226 for (auto *Inst : InstsWithTBAATag) {
3586 ArrayRef<Constant *> Indices(Elts.begin() + 1, Elts.end());
6269 for (BasicBlock *DestBB : Table)
lib/Bitcode/Reader/BitcodeAnalyzer.cpp 916 for (auto &Val : Record) {
lib/Bitcode/Reader/BitcodeReader.cpp 2461 SmallString<16> Elts(Record.begin(), Record.end());
2472 SmallVector<uint8_t, 16> Elts(Record.begin(), Record.end());
2478 SmallVector<uint16_t, 16> Elts(Record.begin(), Record.end());
2484 SmallVector<uint32_t, 16> Elts(Record.begin(), Record.end());
2490 SmallVector<uint64_t, 16> Elts(Record.begin(), Record.end());
2496 SmallVector<uint16_t, 16> Elts(Record.begin(), Record.end());
2502 SmallVector<uint32_t, 16> Elts(Record.begin(), Record.end());
2508 SmallVector<uint64_t, 16> Elts(Record.begin(), Record.end());
2619 ArrayRef<Constant *> Indices(Elts.begin() + 1, Elts.end());
4320 for (BasicBlock *Handler : Handlers)
4412 cve = CaseVals.end(); cvi != cve; ++cvi)
5584 for (auto &Val : Record) {
6125 Record.end());
6142 {{Record[0], Record[1]}, {Record.begin() + 2, Record.end()}});
6147 {{Record[0], Record[1]}, {Record.begin() + 2, Record.end()}});
6233 for (auto &Val : Record) {
lib/Bitcode/Reader/MetadataLoader.cpp 272 for (const auto &Array : OldTypeRefs.Arrays)
517 for (auto *MD : MDs)
768 for (auto &Elt : Record) {
793 SmallString<8> Name(Record.begin(), Record.end());
1109 SmallString<8> Name(Record.begin(), Record.end());
1210 for (unsigned ID : Record)
1879 std::string String(Record.begin(), Record.end());
2073 SmallString<8> Name(Record.begin() + 1, Record.end());
lib/Bitcode/Writer/BitcodeWriter.cpp 2149 for (const auto &I : MDs) {
2231 for (auto Tag : Tags) {
2250 for (auto SSN : SSNs) {
3540 Record.insert(Record.end(), VC.Args.begin(), VC.Args.end());
3582 NameVals.insert(NameVals.end(), args.begin(), args.end());
3705 llvm::sort(NameVals.begin() + SizeBeforeRefs, NameVals.end());
4115 for (auto *AS : Aliases) {
lib/Bitcode/Writer/ValueEnumerator.cpp 227 List.begin(), List.end(),
383 for (const auto &I : MDs)
398 for (const auto &I : MDs)
650 for (const MDNode *N : DelayedDistinctNodes)
lib/CodeGen/AllocationOrder.h 56 return Hints.end()[Pos++];
75 return Hints.end()[Pos++];
lib/CodeGen/Analysis.cpp 774 for (const MachineBasicBlock *MBB : UnreachableBlocks)
777 for (const MachineBasicBlock *MBB : EHScopeBlocks)
780 for (const MachineBasicBlock *MBB : SEHCatchPads)
783 for (std::pair<const MachineBasicBlock *, int> CatchRetPair :
lib/CodeGen/AsmPrinter/AddressPool.cpp 72 for (const MCExpr *Entry : Entries)
lib/CodeGen/AsmPrinter/AsmPrinter.cpp 507 for (const HandlerInfo &HI : Handlers) {
735 for (const HandlerInfo &HI : Handlers) {
1068 for (const HandlerInfo &HI : Handlers) {
1123 for (const HandlerInfo &HI : Handlers) {
1197 for (const HandlerInfo &HI : Handlers) {
1207 for (const HandlerInfo &HI : Handlers) {
1297 for (auto *GV : FailedCandidates)
1470 for (const HandlerInfo &HI : Handlers) {
2025 for (Structor &S : Structors) {
2923 for (const HandlerInfo &HI : Handlers) {
3162 for (const auto &Sled : Sleds)
lib/CodeGen/AsmPrinter/CodeViewDebug.cpp 490 auto B = Locs.begin(), E = Locs.end();
1077 for (const DILocation *InlinedAt : FI.ChildSites) {
1184 for (const InsnRange &Range : Scope->getRanges()) {
2588 for (const DICompositeType *RecordTy : TypesToEmit)
2604 for (const LocalVariable *L : Params)
2738 for (LexicalScope *Scope : Scopes)
2792 ParentLocals.append(Locals->begin(), Locals->end());
2794 ParentGlobals.append(Globals->begin(), Globals->end());
2986 for (const auto *GVE : GVEs)
3043 for (const CVGlobalVariable &CVGV : ComdatVariables) {
lib/CodeGen/AsmPrinter/DbgEntityHistoryCalculator.cpp 118 assert(VarPos != VarSet.end());
154 for (auto Index : IndicesToErase)
199 for (auto Index : IndicesToErase)
214 for (const auto &Var : I->second)
304 for (unsigned Reg : RegsToClobber) {
lib/CodeGen/AsmPrinter/DebugHandlerBase.cpp 106 for (const InsnRange &R : S->getRanges()) {
lib/CodeGen/AsmPrinter/DebugLocEntry.h 139 Values.erase(std::unique(Values.begin(), Values.end(),
143 Values.end());
lib/CodeGen/AsmPrinter/DwarfCompileUnit.cpp 452 FinalChildren.insert(FinalChildren.end(),
454 std::make_move_iterator(Children.end()));
462 for (auto &I : Children)
766 for (auto *Dependency : dependencies(Var)) {
787 for (DbgVariable *DV : Locals)
793 for (const auto *IE : ImportedEntities[Scope->getScopeNode()])
801 for (DbgLabel *DL : DU->getScopeLabels().lookup(Scope))
804 for (LexicalScope *LS : Scope->getChildren())
845 for (auto &I : Children)
979 for (const auto &Param : Params) {
lib/CodeGen/AsmPrinter/DwarfDebug.cpp 305 for (const auto &FIE : V.FrameIndexExprs)
560 for (auto ArgReg : CallFwdRegsInfo->second) {
917 GVEs.erase(std::unique(GVEs.begin(), GVEs.end(),
922 GVEs.end());
950 for (auto *GVE : GVs)
1031 for (const auto &Entity : ConcreteEntities) {
1267 for (const auto &VI : Asm->MF->getVariableDbgInfo()) {
1401 OpenRanges.erase(Last, OpenRanges.end());
1462 for (auto &R : OpenRanges)
1582 for (auto &Entry : Entries)
2234 assert(std::is_sorted(Values.begin(), Values.end()) &&
2237 for (auto Fragment : Values)
2515 for (const SymbolCU &Cur : List) {
2941 for (const auto &TU : TypeUnitsToAdd)
2954 for (auto &TU : TypeUnitsToAdd) {
lib/CodeGen/AsmPrinter/DwarfExpression.cpp 251 for (auto &Reg : DwarfRegs) {
lib/CodeGen/AsmPrinter/DwarfFile.cpp 33 for (const auto &TheU : CUs)
66 for (const auto &TheU : CUs) {
lib/CodeGen/AsmPrinter/DwarfStringPool.cpp 97 for (const auto &Entry : Entries) {
124 for (const auto &Entry : Entries)
lib/CodeGen/AsmPrinter/EHStreamer.cpp 467 I = CallSites.begin(), E = CallSites.end(); I != E; ++I, ++idx) {
512 I = CallSites.begin(), E = CallSites.end(); I != E; ++I) {
565 I = Actions.begin(), E = Actions.end(); I != E; ++I) {
lib/CodeGen/AsmPrinter/WinException.cpp 875 for (auto &IPStatePair : IPToStateTable) {
1221 for (ClrClause &Clause : Clauses) {
lib/CodeGen/AtomicExpandPass.cpp 218 for (auto I : AtomicInsts) {
1299 for (auto EV : PrunedInsts)
1771 for (Value *Arg : Args)
lib/CodeGen/BranchFolding.cpp 1253 std::accumulate(EdgeFreqLs.begin(), EdgeFreqLs.end(), BlockFrequency(0))
lib/CodeGen/CFGuardLongjmp.cpp 108 for (MachineInstr *Setjmp : SetjmpCalls) {
lib/CodeGen/CallingConvLower.cpp 71 for (auto const &ValAssign : Locs) {
252 for (MCPhysReg PReg : RemainingRegs) {
lib/CodeGen/CodeGenPrepare.cpp 515 II = Successors.begin(), IE = Successors.end(); II != IE; ++II)
529 II = Successors.begin(), IE = Successors.end(); II != IE; ++II)
548 for (auto &I : Statepoints)
571 for (auto &Block : Blocks) {
635 LoopList.insert(LoopList.end(), L->begin(), L->end());
648 for (auto &Block : Blocks) {
1898 LargeOffsetGEPMap[ArgVal].append(GEPs.begin(), GEPs.end());
2048 for (auto const &TailCallBB : TailCallBBs) {
2548 EndIt = OriginalUses.end();
2556 for (auto *DVI: DbgValues) {
2729 for (CommitPt It = Actions.begin(), EndIt = Actions.end(); It != EndIt;
3199 for (auto &AM : AddrModes) {
3212 for (auto *V : NullValue)
5179 for (auto ExtInst : NewlyMovedExts) {
5212 for (Instruction *Inst : Insts) {
5217 for (auto &Pt : CurPts) {
5299 std::unique(LargeOffsetGEPs.begin(), LargeOffsetGEPs.end()),
5300 LargeOffsetGEPs.end());
5309 while (LargeOffsetGEP != LargeOffsetGEPs.end()) {
5520 for (auto I : SpeculativelyMovedExts) {
5538 for (auto I : SpeculativelyMovedExts) {
5549 for (auto I : SpeculativelyMovedExts) {
5568 for (auto I : Chains) {
5812 for (auto *And : AndsToMaybeRemove)
6020 for (SelectInst *SI : ASI) {
6076 INS.insert(ASI.begin(), ASI.end());
6192 for (Use *U : ToReplace) {
6379 for (const auto &Inst : InstsToBePromoted) {
6536 for (auto &ToBePromoted : InstsToBePromoted)
lib/CodeGen/CriticalAntiDepBreaker.cpp 423 ite = Forbid.end(); it != ite; ++it)
lib/CodeGen/DwarfEHPrepare.cpp 146 for (auto *RI : Resumes) {
147 for (auto *LP : CleanupLPads) {
239 for (ResumeInst *RI : Resumes) {
lib/CodeGen/ExecutionDomainFix.cpp 137 A->Instrs.append(B->Instrs.begin(), B->Instrs.end());
330 for (int rx : used) {
367 for (int i : used) {
457 for (LoopTraversal::TraversedMBBInfo TraversedMBB : TraversedMBBOrder) {
461 for (LiveRegsDVInfo OutLiveRegs : MBBOutRegsInfos) {
lib/CodeGen/ExpandReductions.cpp 85 for (auto *II : Worklist) {
lib/CodeGen/GlobalISel/CombinerHelper.cpp 236 for (auto Src : ConcatSrcs) {
463 for (auto *UseMO : Uses) {
lib/CodeGen/GlobalISel/IRTranslator.cpp 193 for (auto Ty : SplitTys)
1305 for (const Value *V : Allocas) {
2053 for (auto &Phi : PendingPHIs) {
2066 for (auto Pred : getMachinePredBBs({IRPred, PI->getParent()})) {
lib/CodeGen/GlobalISel/Legalizer.cpp 117 for (const auto *MI : NewMIs)
271 for (auto *DeadMI : DeadInstructions) {
lib/CodeGen/GlobalISel/LegalizerHelper.cpp 440 std::copy(Args.begin(), Args.end(), std::back_inserter(Info.OrigArgs));
2460 for (Register PartReg : PartRegs) {
2468 for (Register LeftoverReg : LeftoverRegs) {
2493 for (auto &MIB : NewInsts)
4136 for (int Idx : Mask) {
lib/CodeGen/GlobalISel/RegBankSelect.cpp 297 for (const RegisterBankInfo::InstructionMapping *CurMapping :
306 for (RepairingPlacement &RepairPt : LocalRepairPts)
587 for (RepairingPlacement &RepairPt : RepairPts) {
lib/CodeGen/GlobalISel/RegisterBankInfo.cpp 304 return hash_combine_range(Hashes.begin(), Hashes.end());
418 for (const InstructionMapping *AltMapping : AltMappings)
421 for (const InstructionMapping *Mapping : PossibleMappings)
688 return NewVRegs.size() <= StartIdx + NumVal ? NewVRegs.end()
lib/CodeGen/IfConversion.cpp 1031 SmallVector<MachineOperand, 4> RevCond(BBI.BrCond.begin(), BBI.BrCond.end());
1188 SmallVector<MachineOperand, 4> RevPred(Pred.begin(), Pred.end());
1189 SmallVector<MachineOperand, 4> Cond(BBI.BrCond.begin(), BBI.BrCond.end());
1279 RevCond(BBI.BrCond.begin(), BBI.BrCond.end());
1489 for (auto Clobber : Clobbers) {
1533 SmallVector<MachineOperand, 4> Cond(BBI.BrCond.begin(), BBI.BrCond.end());
1619 SmallVector<MachineOperand, 4> Cond(BBI.BrCond.begin(), BBI.BrCond.end());
1699 CvtBBI->BrCond.end());
1790 SmallVector<MachineOperand, 4> RevCond(BBI.BrCond.begin(), BBI.BrCond.end());
1962 for (MCPhysReg Reg : Defs) {
2159 BBI.Predicate.append(Cond.begin(), Cond.end());
2223 ToBBI.Predicate.append(FromBBI.Predicate.begin(), FromBBI.Predicate.end());
2224 ToBBI.Predicate.append(Cond.begin(), Cond.end());
2274 for (MachineBasicBlock *Succ : FromSuccs) {
2341 ToBBI.Predicate.append(FromBBI.Predicate.begin(), FromBBI.Predicate.end());
lib/CodeGen/IndirectBrExpandPass.cpp 160 for (auto *IBr : IndirectBrs) {
172 for (auto *IBr : IndirectBrs) {
202 for (auto *IBr : IndirectBrs) {
lib/CodeGen/InlineSpiller.cpp 622 for (const auto &OpPair : Ops) {
645 for (unsigned Reg : RegsToSpill) {
666 for (unsigned Reg : RegsToSpill) {
696 for (unsigned Reg : RegsToSpill) {
708 RegsToSpill.erase(RegsToSpill.begin() + ResultPos, RegsToSpill.end());
1042 for (const auto &OpPair : Ops) {
1076 for (unsigned Reg : RegsToSpill)
1082 for (unsigned Reg : RegsToSpill)
1092 for (unsigned Reg : RegsToSpill) {
1105 for (unsigned Reg : RegsToSpill)
1220 for (const auto SpillToRm : SpillsToRm)
1495 for (const auto Rspill : SpillsToRm)
1519 for (auto const RMEnt : SpillsToRm) {
lib/CodeGen/InterleavedAccessPass.cpp 346 for (auto SVI : Shuffles)
468 for (auto I : DeadInsts)
lib/CodeGen/InterleavedLoadCombinePass.cpp 836 for (int i : SVI->getShuffleMask()) {
lib/CodeGen/LatencyPriorityQueue.cpp 58 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
77 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
93 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
lib/CodeGen/LexicalScopes.cpp 262 for (const auto &R : MIRanges) {
295 for (auto &R : InsnRanges)
lib/CodeGen/LiveDebugValues.cpp 616 for (auto Fragment : MapIt->second) {
1405 for (auto &TR : Transfers) {
lib/CodeGen/LiveDebugVariables.cpp 558 for (auto &userValue : userValues)
561 for (auto &userLabel : userLabels)
669 for (auto const &L : userLabels) {
902 for (const InsnRange &Range : Scope->getRanges()) {
1133 for (auto *UV : *UserVals)
1141 for (auto *UV : *UserVals)
1395 for (auto &userValue : userValues) {
1401 for (auto &userLabel : userLabels) {
lib/CodeGen/LiveInterval.cpp 93 if (I == segments().end()) {
159 assert(I != segments().end() && "Not a valid segment!");
165 for (; MergeTo != segments().end() && NewEnd >= MergeTo->end; ++MergeTo)
173 if (MergeTo != segments().end() && MergeTo->start <= I->end &&
187 assert(I != segments().end() && "Not a valid segment!");
243 if (I != segments().end()) {
534 for (const Segment &S : segments) {
695 for (Segment &S : Other.segments)
716 for (Segment &S : Other.segments)
893 for (VNInfo *VNI : SR.valnos) {
917 for (VNInfo *VNI : ToBeRemoved)
1260 LiveRange::iterator SpillSrc = Spills.end();
1273 assert(NumMoved == size_t(Spills.end() - SpillSrc));
1274 Spills.erase(SpillSrc, Spills.end());
lib/CodeGen/LiveIntervals.cpp 117 for (LiveRange *LR : RegUnitRanges)
346 for (unsigned Unit : NewRanges)
503 for (VNInfo *VNI : LI.valnos) {
593 for (VNInfo *VNI : SR.valnos) {
735 for (auto &RUP : RU) {
763 for (auto &SRP : SRs) {
1388 assert(RI != LIS.RegMaskSlots.end() && *RI == OldIdx.getRegSlot() &&
1394 assert((std::next(RI) == LIS.RegMaskSlots.end() ||
lib/CodeGen/LivePhysRegs.cpp 107 for (auto Reg : Clobbers) {
lib/CodeGen/LiveRangeCalc.cpp 218 for (const LiveInBlock &I : LiveIn) {
431 array_pod_sort(WorkList.begin(), WorkList.end());
437 for (unsigned BN : WorkList) {
467 for (unsigned BN : WorkList) {
492 for (LiveInBlock &I : LiveIn) {
lib/CodeGen/LiveRangeEdit.cpp 82 for (VNInfo *VNI : getParent().valnos) {
438 for (const LiveInterval *SplitLI : SplitLIs) {
lib/CodeGen/LiveVariables.cpp 592 E = VarInfoVec.end(); I != E; ++I)
lib/CodeGen/LowerEmuTLS.cpp 79 for (const auto G : TlsVars)
lib/CodeGen/MIRParser/MIParser.cpp 841 for (MachineBasicBlock *Succ : Successors)
980 for (const auto &Operand : Operands)
1116 for (const auto &I : ImplicitOperands) {
1378 for (const auto &TiedPair : TiedRegisterPairs) {
1388 for (const auto &TiedPair : TiedRegisterPairs)
lib/CodeGen/MIRPrinter.cpp 483 for (auto ArgReg : CSInfo.second) {
580 Normalized.end());
582 BranchProbability::normalizeProbabilities(Equal.begin(), Equal.end());
584 return std::equal(Normalized.begin(), Normalized.end(), Equal.begin());
lib/CodeGen/MachineBasicBlock.cpp 959 E = Terminators.end(); I != E; ++I) {
lib/CodeGen/MachineBlockPlacement.cpp 251 iterator end() { return Blocks.end(); }
781 for (MachineBasicBlock *SuccSucc : SuccSuccs) {
1507 for (MachineBasicBlock *Succ : Successors) {
1548 for (auto &Tup : DupCandidates) {
1591 WorkList.end());
1600 for (MachineBasicBlock *MBB : WorkList) {
2371 for (auto &ExitWithFreq : ExitsWithFreq)
2930 RemoveList.end());
2956 for (MachineBasicBlock *Pred : DuplicatedPreds) {
lib/CodeGen/MachineCSE.cpp 642 for (std::pair<unsigned, unsigned> &CSEPair : CSEPairs) {
656 for (unsigned ImplicitDefToUpdate : ImplicitDefsToUpdate)
658 for (auto PhysDef : PhysDefs)
674 for (auto ImplicitDef : ImplicitDefs)
681 for (auto ImplicitDef : ImplicitDefs)
757 for (MachineDomTreeNode *Node : Scopes) {
lib/CodeGen/MachineCombiner.cpp 167 for (auto *InstrPtr : InsInstrs) { // for each Use
287 for (auto I : DelInstrs)
360 for (auto *InstrPtr : Instrs) {
436 for (auto *InstrPtr : InsInstrs)
439 for (auto *InstrPtr : DelInstrs) {
451 for (auto *InstrPtr : InsInstrs)
466 for (auto P : Patterns) {
546 for (auto P : Patterns) {
563 for (auto const *InstrPtr : DelInstrs)
567 for (auto const *InstrPtr : InsInstrs)
620 for (auto *InstrPtr : InsInstrs)
lib/CodeGen/MachineCopyPropagation.cpp 611 for (unsigned Reg : Defs)
lib/CodeGen/MachineDominators.cpp 100 for (CriticalEdge &Edge : CriticalEdgesToSplit) {
136 for (CriticalEdge &Edge : CriticalEdgesToSplit) {
lib/CodeGen/MachineInstr.cpp 1988 return hash_combine_range(HashComponents.begin(), HashComponents.end());
2141 for (auto *DBI : DbgValues)
2150 for (auto A : Accesses)
lib/CodeGen/MachineLICM.cpp 329 std::fill(RegPressure.begin(), RegPressure.end(), 0);
544 for (CandidateInfo &Candidate : Candidates) {
621 for (MachineBasicBlock *CurrentLoopExitingBlock : CurrentLoopExitingBlocks)
727 for (MachineDomTreeNode *Node : Scopes) {
767 for (MachineInstr *I : Candidates) {
808 std::fill(RegPressure.begin(), RegPressure.end(), 0);
1163 for (const auto &RP : BackTrace)
1181 for (auto &RP : BackTrace)
1404 for (unsigned Idx : Defs) {
lib/CodeGen/MachineLoopUtils.cpp 66 for (auto *Use : Uses) {
lib/CodeGen/MachinePipeliner.cpp 481 for (auto &I : NodeSets) {
494 for (auto &I : NodeSets) {
647 for (const Value *V : Objs) {
673 for (auto V : Objs) {
682 for (auto V : Objs) {
687 for (auto Load : I->second) {
820 for (auto &PI : I.Preds) {
871 for (SUnit::pred_iterator P = I.Preds.begin(), E = I.Preds.end(); P != E;
881 for (auto &P : LastSU->Preds)
1046 SmallVectorImpl<ResourceManager *>::iterator RE = Resources.end();
1077 for (ResourceManager *RI : Resources) {
1094 for (NodeSet &Nodes : NodeSets) {
1117 for (SUnit::pred_iterator IP = SU->Preds.begin(), EP = SU->Preds.end();
1125 E = DepsAdded.end();
1148 for (auto &SI : SUnits[i].Succs) {
1174 for (auto &PI : SUnits[i].Preds) {
1204 for (auto W : AdjK[V]) {
1225 for (auto W : AdjK[V]) {
1298 for (auto &Dep : SU.Preds) {
1317 for (auto I = PHISUs.begin(); I != PHISUs.end(); ++I) {
1318 for (auto &Dep : (*I)->Succs) {
1337 for (auto I : UseSUs) {
1338 for (auto Src : SrcSUs) {
1384 EP = SU->Preds.end();
1408 ES = SU->Succs.end();
1425 for (NodeSet &I : NodeSets)
1451 for (SUnit::pred_iterator PI = (*I)->Preds.begin(), PE = (*I)->Preds.end();
1462 ES = (*I)->Succs.end();
1484 for (SUnit::succ_iterator SI = (*I)->Succs.begin(), SE = (*I)->Succs.end();
1494 PE = (*I)->Preds.end();
1522 for (auto &SI : Cur->Succs)
1524 for (auto &PI : Cur->Preds)
1585 for (auto &NS : NodeSets) {
1661 for (auto &NS : NodeSets) {
1679 for (NodeSet &I : NodeSets) {
1742 for (auto &SI : SU->Succs) {
1747 for (auto &PI : SU->Preds) {
1769 for (NodeSetType::iterator I = NodeSets.begin(), E = NodeSets.end(); I != E;
1781 E = NodeSets.end();
1791 for (NodeSetType::iterator I = NodeSets.begin(), E = NodeSets.end(); I != E;
1798 E = NodeSets.end();
1813 for (auto &Nodes : NodeSets) {
1871 for (const auto &I : maxHeight->Succs) {
1881 for (const auto &I : maxHeight->Preds) {
1922 for (const auto &I : maxDepth->Preds) {
1930 for (const auto &I : maxDepth->Succs) {
2353 for (const auto &PI : PrevSU->Preds)
2376 for (const auto &SI : SuccSU->Succs)
2388 for (auto &P : SU->Preds)
2390 for (auto &S : P.getSUnit()->Succs)
2526 for (auto &S : SU->Succs) {
2543 for (auto &P : SU->Preds) {
2649 for (auto &SI : SU.Succs)
2703 for (SDep &PredEdge : SU->Preds) {
2714 for (SDep &SuccEdge : SU->Succs) {
3024 std::fill(ProcResourceCount.begin(), ProcResourceCount.end(), 0);
lib/CodeGen/MachineRegisterInfo.cpp 633 UpdatedCSRs.erase(std::remove(UpdatedCSRs.begin(), UpdatedCSRs.end(), *AI),
634 UpdatedCSRs.end());
lib/CodeGen/MachineScheduler.cpp 505 std::reverse(Regions.begin(), Regions.end());
545 R != MBBRegions.end(); ++R) {
646 for (SDep &Succ : SU->Succs)
683 for (SDep &Pred : SU->Preds)
1322 for (const RegisterMaskPair &P : RPTracker.getPressure().LiveOutRegs) {
1583 for (const SDep &Succ : SUa->Succs) {
1608 for (const SDep &Pred : SU.Preds) {
1625 for (auto &SCD : StoreChainDependents)
1770 for (const SDep &Succ : LastLocalSU->Succs) {
1785 for (const SDep &Pred : GlobalSU->Preds) {
1797 I = LocalUses.begin(), E = LocalUses.end(); I != E; ++I) {
1803 I = GlobalUses.begin(), E = GlobalUses.end(); I != E; ++I) {
3261 for (SDep &Dep : Deps) {
3347 for (const SUnit *SU : BotRoots) {
lib/CodeGen/MachineSink.cpp 680 for (MachineBasicBlock *SuccBlock :
790 DBE = DbgValuesToSink.end();
959 DbgUsersToSink.insert(DbgUsersToSink.end(), Users.begin(), Users.end());
1012 for (auto *User : DbgDefUsers) {
1147 for (auto U : UsedOpsInCopy) {
1168 for (unsigned DefReg : DefedRegsInCopy)
1171 for (auto U : UsedOpsInCopy) {
lib/CodeGen/MachineTraceMetrics.cpp 736 for (unsigned Kill : Kills)
741 for (unsigned DefOp : LiveDefOps) {
793 for (const DataDep &Dep : Deps) {
1028 for (LiveInReg &LI : TBI.LiveIns) {
1116 for (const DataDep &Dep : Deps)
1134 for (LiveInReg &LIR : TBI.LiveIns) {
lib/CodeGen/MachineVerifier.cpp 1444 for (int Idx : MaskIdxes) {
lib/CodeGen/MacroFusion.cpp 43 for (SDep &SI : FirstSU.Succs)
47 for (SDep &SI : SecondSU.Preds)
60 for (SDep &SI : FirstSU.Succs)
64 for (SDep &SI : SecondSU.Preds)
77 for (const SDep &SI : FirstSU.Succs) {
90 for (const SDep &SI : SecondSU.Preds) {
155 for (SDep &Dep : AnchorSU.Preds) {
lib/CodeGen/ModuloSchedule.cpp 821 for (auto &Epilog : EpilogBBs)
1635 for (; PI != Prologs.end(); ++PI, ++EI) {
1686 for (MachineInstr *Use : Uses)
1752 for (auto &Sub : Subs)
1885 for (auto &OldAndNew : KOIs) {
lib/CodeGen/PeepholeOptimizer.cpp 556 Uses.append(ExtendedUses.begin(), ExtendedUses.end());
1295 for (const RegSubRegPair &Def : RewritePairs) {
1578 for (auto &RI : RC) {
1911 for (const RegSubRegPairAndIdx &RegSeqInput : RegSeqInputRegs) {
lib/CodeGen/PostRASchedulerList.cpp 489 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
lib/CodeGen/PrologEpilogInserter.cpp 208 for (auto *MI : EntryDbgValues[&MBB])
235 for (MachineBasicBlock *SaveBlock : SaveBlocks)
259 I.first->insert(I.first->begin(), I.second.begin(), I.second.end());
620 for (MachineBasicBlock *SaveBlock : SaveBlocks) {
626 for (MachineBasicBlock *RestoreBlock : RestoreBlocks)
685 for (int i : AllocatedFrameSlots) {
892 IE = SFIs.end(); I != IE; ++I)
1043 for (auto &Object : ObjectsToAllocate)
1054 IE = SFIs.end(); I != IE; ++I)
1096 for (MachineBasicBlock *SaveBlock : SaveBlocks)
1100 for (MachineBasicBlock *RestoreBlock : RestoreBlocks)
1103 for (MachineBasicBlock *SaveBlock : SaveBlocks)
1111 for (MachineBasicBlock *SaveBlock : SaveBlocks)
1125 for (MachineBasicBlock *SaveBlock : SaveBlocks)
lib/CodeGen/ReachingDefAnalysis.cpp 153 for (LoopTraversal::TraversedMBBInfo TraversedMBB : TraversedMBBOrder) {
158 for (MBBDefsInfo &MBBDefs : MBBReachingDefs) {
182 for (int Def : MBBReachingDefs[MBBNumber][*Unit]) {
lib/CodeGen/RegAllocBase.cpp 144 for (unsigned Reg : SplitVRegs) {
lib/CodeGen/RegAllocBasic.cpp 283 PhysRegE = PhysRegSpillCands.end(); PhysRegI != PhysRegE; ++PhysRegI) {
lib/CodeGen/RegAllocFast.cpp 329 for (MachineInstr *DBG : LRIDbgValues) {
972 for (unsigned PartialDef : PartialDefs)
1199 for (unsigned VirtReg : VirtDead)
1285 for (MachineInstr *MI : Coalesced)
lib/CodeGen/RegAllocGreedy.cpp 2688 for (unsigned NewVReg : CurrentNewVRegs)
2708 End = CurrentNewVRegs.end();
2979 for (const HintInfo &HI : Info) {
3127 setStage(NewVRegs.begin(), NewVRegs.end(), RS_Done);
lib/CodeGen/RegAllocPBQP.cpp 642 Worklist.insert(Worklist.end(), NewVRegs.begin(), NewVRegs.end());
lib/CodeGen/RegisterCoalescer.cpp 695 for (LiveRange::Segment &ASeg : IntA.segments) {
1076 for (auto VNI : IntB.valnos) {
1463 for (MachineOperand &MO : ImplicitOps)
3601 LocalWorkList.append(LocalTerminals.begin(), LocalTerminals.end());
3602 WorkList.append(GlobalTerminals.begin(), GlobalTerminals.end());
3614 WorkList.append(Terminals.begin(), Terminals.end());
3620 CurrList(WorkList.begin() + PrevSize, WorkList.end());
3622 WorkList.erase(std::remove(WorkList.begin() + PrevSize, WorkList.end(),
3623 nullptr), WorkList.end());
3710 array_pod_sort(InflateRegs.begin(), InflateRegs.end());
3711 InflateRegs.erase(std::unique(InflateRegs.begin(), InflateRegs.end()),
3712 InflateRegs.end());
lib/CodeGen/RegisterPressure.cpp 362 for (const RegisterMaskPair &Pair : P.LiveOutRegs) {
388 if (I == RegUnits.end()) {
400 if (I == RegUnits.end()) {
414 if (I != RegUnits.end()) {
485 for (const RegisterMaskPair &P : RegOpers.Defs)
494 for (const RegisterMaskPair &P : RegOpers.Defs)
582 for (auto RI = Defs.begin(); RI != Defs.end(); /*empty*/) {
603 for (auto I = Defs.begin(); I != Defs.end(); ) {
621 for (auto I = Uses.begin(); I != Uses.end(); ) {
633 for (const RegisterMaskPair &P : DeadDefs) {
723 if (I == LiveInOrOut.end()) {
820 bool IsRedef = I != LiveUses->end();
1062 for (const RegisterMaskPair &P : RegOpers.Defs) {
1071 for (const RegisterMaskPair &P : RegOpers.Uses) {
1296 for (const RegisterMaskPair &Use : RegOpers.Uses) {
1319 for (const RegisterMaskPair &Def : RegOpers.Defs) {
lib/CodeGen/RegisterScavenging.cpp 75 for (ScavengedInfo &SI : Scavenged) {
189 IE = Scavenged.end(); I != IE; ++I) {
267 for (ScavengedInfo &I : Scavenged) {
lib/CodeGen/RegisterUsageInfo.cpp 88 for (const FuncPtrRegMaskPair *FPRMPair : FPRMPairVector) {
lib/CodeGen/RenameIndependentSubregs.cpp 184 for (RenameIndependentSubregs::SubRangeInfo &SRInfo : SubRangeInfos) {
lib/CodeGen/SafeStack.cpp 800 for (ReturnInst *RI : Returns) {
826 for (ReturnInst *RI : Returns) {
lib/CodeGen/SafeStackColoring.cpp 57 for (auto *I : Markers) {
226 for (auto &It : BBMarkers[BB]) {
293 for (auto &R : LiveRanges) {
300 for (auto &R : LiveRanges)
lib/CodeGen/SafeStackLayout.cpp 71 for (const StackRegion &R : Regions) {
126 for (StackRegion &R : Regions) {
144 std::stable_sort(StackObjects.begin() + 1, StackObjects.end(),
149 for (auto &Obj : StackObjects)
lib/CodeGen/ScheduleDAG.cpp 109 for (SDep &PredDep : Preds) {
122 for (SDep &SuccDep : PredSU->Succs) {
178 if (I == Preds.end())
185 assert(Succ != N->Succs.end() && "Mismatching preds / succs lists!");
224 for (SDep &SuccDep : SU->Succs) {
239 for (SDep &PredDep : SU->Preds) {
272 for (const SDep &PredDep : Cur->Preds) {
303 for (const SDep &SuccDep : Cur->Succs) {
331 for (SUnit::pred_iterator I = std::next(BestI), E = Preds.end(); I != E;
500 for (const SDep &PredDep : SU->Preds) {
515 for (const SDep &PD : SU.Preds) {
531 for (auto &U : Updates)
709 for (const SDep &PredDep : TargetSU->Preds)
lib/CodeGen/ScheduleDAGInstrs.cpp 159 for (Value *V : Objs) {
947 for (const UnderlyingObject &UnderlObj : Objs) {
957 for (const UnderlyingObject &UnderlObj : Objs) {
977 for (const UnderlyingObject &UnderlObj : Objs) {
1387 for (SchedDFSResult::Connection &C : Connections) {
1489 for (const Connection &C : SubtreeConnections[SubtreeID]) {
lib/CodeGen/SelectionDAG/DAGCombiner.cpp 1796 for (const SDValue &Op : Ops) {
1875 for (const SDValue &Op : Ops) {
4908 for (auto *Load : Loads) {
6506 for (auto Store : Stores) {
11312 std::reverse(Ops.end()-NumOutputsPerInput, Ops.end());
11312 std::reverse(Ops.end()-NumOutputsPerInput, Ops.end());
14682 LSItEnd = LoadedSlices.end();
17425 VecIn.begin(), std::find(VecIn.begin(), VecIn.end(), ExtractedFromVec));
17526 for (int &Vec : VectorMask)
17750 for (SDValue &Op : Ops) {
18556 for (SDValue &Op : Ops)
18559 for (SDValue &Op : Ops)
19040 for (int M : OuterMask)
20197 for (SDNode *N : Built)
20218 for (SDNode *N : Built)
20238 for (SDNode *N : Built)
lib/CodeGen/SelectionDAG/FastISel.cpp 324 for (MachineInstr *DI : DbgValues) {
847 for (auto const &MO : Ops)
998 for (auto Reg : CLI.OutRegs)
1017 for (auto Reg : CLI.InRegs)
1025 for (auto &MO : Ops)
1053 for (auto &MO : Ops)
1074 for (auto &MO : Ops)
lib/CodeGen/SelectionDAG/FunctionLoweringInfo.cpp 115 for (WinEHTryBlockMapEntry &TBME : EHInfo.TryBlockMap) {
116 for (WinEHHandlerType &H : TBME.HandlerArray) {
283 for (EVT VT : ValueVTs) {
297 for (WinEHTryBlockMapEntry &TBME : EHInfo.TryBlockMap) {
298 for (WinEHHandlerType &H : TBME.HandlerArray) {
303 for (CxxUnwindMapEntry &UME : EHInfo.CxxUnwindMap)
306 for (SEHUnwindMapEntry &UME : EHInfo.SEHUnwindMap) {
310 for (ClrEHUnwindMapEntry &CME : EHInfo.ClrEHUnwindMap) {
538 for (EVT VT : ValueVTs) {
lib/CodeGen/SelectionDAG/InstrEmitter.cpp 1136 for (unsigned Reg : ECRegs) {
lib/CodeGen/SelectionDAG/LegalizeIntegerTypes.cpp 1108 std::reverse(Parts.begin(), Parts.end());
lib/CodeGen/SelectionDAG/ResourcePriorityQueue.cpp 69 for (SDep &Pred : SU->Preds) {
107 for (const SDep &Succ : SU->Succs) {
144 for (const SDep &Succ : SU->Succs)
153 for (SDep &Pred : SU->Preds)
212 for (const SDep &Pred : SU->Preds) {
229 for (const SDep &Succ : SU->Succs)
268 for (const SDep &Succ : Packet[i]->Succs) {
498 for (SDep &Pred : SU->Preds) {
513 for (const SDep &Succ : SU->Succs) {
lib/CodeGen/SelectionDAG/ScheduleDAGFast.cpp 162 for (SDep &Pred : SU->Preds) {
192 for (SDep &Succ : SU->Succs) {
282 for (SDep &Pred : SU->Preds) {
291 for (SDep &Succ : SU->Succs) {
352 for (SDep &Pred : SU->Preds)
359 for (SDep &Succ : SU->Succs) {
395 for (SDep &Succ : SU->Succs) {
474 for (SDep &Pred : SU->Preds) {
lib/CodeGen/SelectionDAG/ScheduleDAGRRList.cpp 556 for (SDep &Pred : SU->Preds) {
770 for (SDep &Succ : SU->Succs) {
839 for (SDep &Pred : SU->Preds) {
886 for (auto &Succ : SU->Succs) {
900 for (auto &Succ2 : SU->Succs) {
1062 for (SDep &Pred : SU->Preds) {
1070 for (SDep &Succ : SU->Succs) {
1078 for (const SDep &Pred : ChainPreds) {
1083 for (const SDep &Pred : LoadPreds) {
1088 for (const SDep &Pred : NodePreds) {
1092 for (SDep D : NodeSuccs) {
1103 for (SDep D : ChainSuccs) {
1187 for (SDep &Pred : SU->Preds)
1198 for (SDep &Succ : SU->Succs) {
1210 for (auto &DelDep : DelDeps)
1237 for (SDep &Succ : SU->Succs) {
1254 for (auto &DelDep : DelDeps)
1355 for (SDep &Pred : SU->Preds) {
1500 for (SUnit *TrySU : Interferences) {
1507 for (unsigned Reg : LRegs) {
1967 for (auto It : WorkList)
2136 for (const SDep &Pred : SU->Preds) {
2179 for (const SDep &Pred : SU->Preds) {
2261 for (const SDep &Pred : SU->Preds) {
2417 for (const SDep &Pred : SU->Preds) {
2429 for (const SDep &Pred : SU->Preds) {
2849 for (const SDep &SuccPred : SuccSU->Preds) {
2960 for (const SDep &Pred : SU.Preds)
2984 for (const SDep &Pred : SU.Preds)
3007 for (const SDep &PredSucc : PredSU->Succs) {
lib/CodeGen/SelectionDAG/ScheduleDAGSDNodes.cpp 789 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
799 EE = SU->Succs.end(); II != EE; ++II) {
990 InsertBB->insert(Pos, DbgMIs.begin(), DbgMIs.end());
996 for (const auto &InstrOrder : Orders) {
lib/CodeGen/SelectionDAG/ScheduleDAGVLIW.cpp 139 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
lib/CodeGen/SelectionDAG/SelectionDAG.cpp 766 for (auto &Val: I->second)
1244 std::reverse(EltParts.begin(), EltParts.end());
1255 Ops.insert(Ops.end(), EltParts.begin(), EltParts.end());
1255 Ops.insert(Ops.end(), EltParts.begin(), EltParts.end());
4247 for (SDValue Op : Elts)
4251 for (SDValue &Op : Elts)
8077 for (SDDbgValue *Dbg : ClonedDVs)
8118 for (SDDbgValue *Dbg : ClonedDVs)
9591 Vals.erase(Vals.begin() + SliceIdx, Vals.end());
lib/CodeGen/SelectionDAG/SelectionDAGBuilder.cpp 782 for (EVT ValueVT : ValueVTs) {
1332 for (auto RegAndSize : RFV.getRegsAndSizes()) {
1748 for (auto &UnwindDest : UnwindDests) {
2151 BranchProbability::normalizeProbabilities(Probs.begin(), Probs.end());
2184 BranchProbability::normalizeProbabilities(Probs.begin(), Probs.end());
2814 for (auto &UnwindDest : UnwindDests) {
3605 for (auto Src : ConcatSrcs) {
3661 for (int Idx : Mask) {
3702 SmallVector<int, 8> MappedOps(Mask.begin(), Mask.end());
3703 for (int &Idx : MappedOps) {
3721 for (int Idx : Mask) {
6580 E = Allocas.end(); Object != E; ++Object) {
6833 for (auto &T : Targets) {
8137 for (SDISelAsmOperandInfo &OpInfo : ConstraintOperands) {
8193 for (SDISelAsmOperandInfo &OpInfo : ConstraintOperands) {
8454 for (SDISelAsmOperandInfo &OpInfo : ConstraintOperands) {
9909 for (MachineFunction::VariableDbgInfo &VI : DbgDeclareInfo) {
10213 for (BitTestCase &BTC : BTB->Cases)
lib/CodeGen/SelectionDAG/SelectionDAGISel.cpp 2315 std::replace(ChainNodesMatched.begin(), ChainNodesMatched.end(), N,
2323 !std::count(NowDeadNodes.begin(), NowDeadNodes.end(), ChainNode))
2369 for (auto *N : ChainNodesMatched) {
2385 for (SDValue V : InputChains)
2388 for (auto *N : ChainNodesMatched)
2735 for (auto &I : RecordedNodes)
2739 for (auto &I : MatchScopes)
2740 for (auto &J : I.NodeStack)
2929 NewEntry.NodeStack.append(NodeStack.begin(), NodeStack.end());
3461 Chain.erase(std::remove(Chain.begin(), Chain.end(), N), Chain.end());
3461 Chain.erase(std::remove(Chain.begin(), Chain.end(), N), Chain.end());
3492 for (MachineMemOperand *MMO : MatchedMemRefs) {
3587 NodeStack.append(LastScope.NodeStack.begin(), LastScope.NodeStack.end());
lib/CodeGen/SelectionDAG/StatepointLowering.cpp 490 for (const Value *V : SI.Bases) {
497 for (const Value *V : SI.Ptrs) {
606 for (const GCRelocateInst *Relocate : SI.GCRelocates) {
647 for (auto *Reloc : SI.GCRelocates)
752 Ops.insert(Ops.end(), CallNode->op_begin() + 2, RegMaskIt);
764 Ops.insert(Ops.end(), LoweredMetaArgs.begin(), LoweredMetaArgs.end());
764 Ops.insert(Ops.end(), LoweredMetaArgs.begin(), LoweredMetaArgs.end());
lib/CodeGen/SelectionDAG/StatepointLowering.h 82 assert(I != PendingGCRelocateCalls.end() &&
lib/CodeGen/SelectionDAG/TargetLowering.cpp 4914 for (SDNode *N : Built)
5082 for (SDNode *N : Built)
lib/CodeGen/ShadowStackGCLowering.cpp 252 Roots.insert(Roots.begin(), MetaRoots.begin(), MetaRoots.end());
lib/CodeGen/ShrinkWrap.cpp 430 for (MachineBasicBlock *LoopExitBB: ExitBlocks) {
lib/CodeGen/SjLjEHPrepare.cpp 466 for (ReturnInst *Return : Returns)
lib/CodeGen/SpillPlacement.cpp 127 for (LinkVector::iterator I = Links.begin(), E = Links.end(); I != E; ++I)
159 for (LinkVector::iterator I = Links.begin(), E = Links.end(); I != E; ++I) {
lib/CodeGen/SplitKit.cpp 180 array_pod_sort(UseSlots.begin(), UseSlots.end());
184 UseSlots.erase(std::unique(UseSlots.begin(), UseSlots.end(),
186 UseSlots.end());
222 UseE = UseSlots.end();
598 for (unsigned Idx : PossibleIndexes) {
955 for (VNInfo *VNI : LI->valnos) {
1019 for (VNInfo *VNI : LI->valnos) {
1100 for (VNInfo *VNI : LI->valnos) {
1267 for (const VNInfo *V : ParentLI.valnos) {
1283 for (const VNInfo *V : PS.valnos) {
1371 for (ExtPoint &EP : ExtPoints) {
1411 for (const LiveRange::Segment &S : LI->segments) {
1477 for (const VNInfo *ParentVNI : Edit->getParent().valnos) {
1538 for (LiveInterval *SplitLI : SplitLIs)
lib/CodeGen/StackColoring.cpp 734 for (auto Slot : slots) {
767 for (const MachineBasicBlock *BB : BasicBlockNumbering) {
839 for (auto Slot : slots) {
876 for (MachineInstr *MI : Markers) {
892 for (auto &VI : MF->getVariableDbgInfo()) {
1038 for (Value *V : Objs) {
1066 for (WinEHTryBlockMapEntry &TBME : EHInfo->TryBlockMap)
1067 for (WinEHHandlerType &H : TBME.HandlerArray)
1233 for (auto &s : LiveStarts)
1263 FirstS.append(SecondS.begin(), SecondS.end());
1265 std::inplace_merge(FirstS.begin(), Mid, FirstS.end());
lib/CodeGen/StackMaps.cpp 275 for (auto I = LiveOuts.begin(), E = LiveOuts.end(); I != E; ++I) {
292 LiveOuts.end());
320 for (auto &Loc : Locations) {
lib/CodeGen/StackSlotColoring.cpp 221 for (auto *I : Intervals) {
476 E = toErase.end(); I != E; ++I)
515 for (int &Next : NextColors)
lib/CodeGen/SwiftErrorValueTracking.cpp 128 for (const auto *SwiftErrorVal : SwiftErrorVals) {
160 for (const auto *SwiftErrorVal : SwiftErrorVals) {
206 VRegs.begin(), VRegs.end(),
209 VRegs.end();
247 for (auto BBRegPair : VRegs) {
lib/CodeGen/TailDuplicator.cpp 707 for (MachineBasicBlock *PredBB : Preds) {
983 for (auto &CI : CopyInfos) {
lib/CodeGen/TargetLoweringBase.cpp 1913 for (StringRef RecipType : OverrideVector) {
1967 for (StringRef RecipType : OverrideVector) {
lib/CodeGen/TargetLoweringObjectFileImpl.cpp 70 for (const auto &MFE: ModuleFlags) {
318 for (const auto &MFE : ModuleFlags) {
lib/CodeGen/TargetPassConfig.cpp 545 for (auto IP : Impl->InsertedPasses) {
lib/CodeGen/VirtRegMap.cpp 293 for (auto &RangeIterPair : SubRanges) {
lib/CodeGen/WasmEHPrepare.cpp 255 for (auto *BB : CatchPads) {
266 for (auto *BB : CleanupPads)
lib/CodeGen/WinEHPrepare.cpp 261 for (const auto *CatchPad : Handlers) {
715 for (auto *PN : PHINodes) {
818 for (CatchReturnInst *CatchRet : FixupCatchrets)
lib/CodeGen/XRayInstrumentation.cpp 119 for (auto &I : Terminators)
lib/DebugInfo/CodeView/TypeHashing.cpp 43 for (const auto &Ref : Refs) {
lib/DebugInfo/CodeView/TypeRecordMapping.cpp 64 for (const auto &Flag : SetFlags) {
lib/DebugInfo/CodeView/TypeStreamMerger.cpp 413 for (auto &Ref : Refs) {
lib/DebugInfo/DWARF/DWARFAcceleratorTable.cpp 185 for (auto &Atom : AtomForms) {
272 for (auto &Atom : Values)
617 for (auto &Value : E.Values) {
lib/DebugInfo/DWARF/DWARFDebugLine.cpp 250 for (auto Descriptor : *DirDescriptors) {
287 for (auto Descriptor : *FileDescriptors) {
lib/DebugInfo/DWARF/DWARFUnit.cpp 106 if (I != this->end() &&
121 auto I = std::upper_bound(begin(), end(), Unit,
lib/DebugInfo/DWARF/DWARFVerifier.cpp 1257 make_range(EntryNames.begin(), EntryNames.end()));
1405 for (StringRef Name : EntryNames) {
lib/DebugInfo/PDB/Native/PDBFileBuilder.cpp 175 for (const auto &IS : InjectedSources) {
201 for (const auto &IS : InjectedSources) {
252 for (const auto &IS : InjectedSources) {
lib/ExecutionEngine/ExecutionEngine.cpp 144 for (auto I = Modules.begin(), E = Modules.end(); I != E; ++I) {
411 for (std::unique_ptr<Module> &M : Modules)
lib/ExecutionEngine/MCJIT/MCJIT.cpp 95 for (auto &Obj : LoadedObjects)
261 for (auto M : ModsToAdd)
341 for (object::OwningBinary<object::Archive> &OB : Archives) {
lib/ExecutionEngine/Orc/OrcMCJITReplacement.h 316 for (auto E = Modules.end(); I != E; ++I)
319 if (I == Modules.end())
lib/ExecutionEngine/Orc/SpeculateAnalyses.cpp 104 for (const auto I : IBBs)
109 llvm::sort(BBFreqs.begin(), BBFreqs.end(),
299 for (auto BB : SequencedBlocks)
lib/ExecutionEngine/RuntimeDyld/RuntimeDyldELF.cpp 325 for (const auto &Section : Sections) {
1325 for (auto I = PendingRelocs.begin(); I != PendingRelocs.end();) {
lib/ExecutionEngine/RuntimeDyld/Targets/RuntimeDyldCOFFX86_64.h 38 for (const SectionEntry &Section : Sections)
272 for (auto const &EHFrameSID : UnregisteredEHFrameSections) {
lib/ExecutionEngine/SectionMemoryManager.cpp 66 for (FreeMemBlock &FreeMB : MemGroup.FreeMem) {
198 for (sys::MemoryBlock &MB : MemGroup.PendingMem)
206 for (FreeMemBlock &FreeMB : MemGroup.FreeMem) {
217 MemGroup.FreeMem.end());
223 for (sys::MemoryBlock &Block : CodeMem.PendingMem)
230 for (sys::MemoryBlock &Block : Group->AllocatedMem)
lib/FuzzMutate/FuzzerCLI.cpp 47 for (StringRef Opt : Opts) {
84 for (StringRef Opt : Opts) {
lib/IR/AsmWriter.cpp 232 List.begin(), List.end(),
1054 for (auto &MD : MDs)
1079 for (auto &MD : MDs)
1706 for (auto F : SplitFlags) {
1730 for (auto F : SplitFlags) {
lib/IR/Attributes.cpp 748 for (const auto Attr : SortedAttrs)
1074 AttrSets.insert(AttrSets.end(), ArgAttrs.begin(), ArgAttrs.end());
lib/IR/AutoUpgrade.cpp 4022 for (auto &S : ValueComp)
4055 for (auto Component : Components)
lib/IR/DIBuilder.cpp 57 RetainedNodes.append(PV->second.begin(), PV->second.end());
61 RetainedNodes.append(PL->second.begin(), PL->second.end());
93 for (auto *N : RetainValues)
103 AllImportedModules.end())));
121 for (const auto &N : UnresolvedNodes)
lib/IR/DataLayout.cpp 499 if (I != Alignments.end() &&
513 return std::lower_bound(Pointers.begin(), Pointers.end(), AddressSpace,
527 if (I == Pointers.end() || I->AddressSpace != AddrSpace) {
lib/IR/DebugInfo.cpp 654 for (auto Attachment : MDs)
675 for (auto *Op : Ops)
lib/IR/DebugInfoMetadata.cpp 125 RemainingWork = std::accumulate(Components.begin(), Components.end(), RemainingWork);
lib/IR/Instruction.cpp 721 for (const auto &MD : TheMDs) {
lib/IR/LLVMContextImpl.cpp 135 for (auto *V : MDVs)
lib/IR/LLVMContextImpl.h 1207 Attachments.end());
lib/IR/LegacyPassManager.cpp 813 for (PMDataManager *PassManager : PassManagers)
818 for (PMDataManager *IndirectPassManager : IndirectPassManagers)
891 for (PMDataManager *PM : PassManagers)
895 for (PMDataManager *IPM : IndirectPassManagers)
906 for (PMDataManager *PM : PassManagers)
909 for (ImmutablePass *P : ImmutablePasses)
941 for (Pass *P1 : HigherLevelAnalysis) {
1033 for (Pass *P : DeadPasses)
1092 for (Pass *PUsed : UsedPasses) {
1124 for (AnalysisID ID : ReqAnalysisNotAvailable) {
1213 for (Pass *P : LUses) {
1354 for (Pass *P : PassVector)
1535 for (ImmutablePass *ImPass : getImmutablePasses())
1550 for (ImmutablePass *ImPass : getImmutablePasses())
1857 for (ImmutablePass *ImPass : getImmutablePasses())
1866 for (ImmutablePass *ImPass : getImmutablePasses())
lib/IR/MDBuilder.cpp 72 for (auto ID : OrderID)
lib/IR/Metadata.cpp 242 for (const auto &Pair : Uses) {
296 for (const auto &Pair : Uses) {
1044 for (auto *I : EndPoints)
1103 for (auto &I : Attachments)
1122 for (auto I = Attachments.begin(), E = std::prev(Attachments.end()); I != E;
1146 array_pod_sort(Result.begin(), Result.end());
1168 auto I = std::remove_if(Attachments.begin(), Attachments.end(),
1170 bool Changed = I != Attachments.end();
1171 Attachments.erase(I, Attachments.end());
1453 for (auto &MD : MDs) {
1543 for (MDNode *MD : MDs)
lib/IR/Module.cpp 313 for (const ModuleFlagEntry &MFE : ModuleFlags) {
lib/IR/SafepointIRVerifier.cpp 174 DeadBlocks.insert(Dom.begin(), Dom.end());
177 for (BasicBlock *B : Dom)
lib/IR/TypeFinder.cpp 73 for (const auto &MD : MDForInst)
lib/IR/Verifier.cpp 690 for (auto *MD : MDs) {
1370 for (const MDNode *Requirement : Requirements) {
2249 for (const auto &I : MDs) {
2281 for (const auto &I : MDs) {
2513 for (BasicBlock *BB : CBI.getIndirectDests())
3298 for (Value *Idx : Idxs) {
lib/Linker/IRMover.cpp 89 for (Type *Ty : SpeculativeTypes)
94 for (StructType *Ty : SpeculativeDstOpaqueTypes)
103 for (Type *Ty : SpeculativeTypes)
198 for (StructType *SrcSTy : SrcDefinitionsToResolve) {
912 SrcElements.erase(It, SrcElements.end());
1168 AllImportedModules.end())));
lib/MC/ConstantPools.cpp 30 for (const ConstantPoolEntry &Entry : Entries) {
lib/MC/MCCodePadder.cpp 191 for (const auto *Protege : Jurisdiction)
297 SmallVector<MCPFRange, 8>::iterator CurrWindowLocation = Windows.end();
303 if (CurrWindowLocation == Windows.end() ||
309 CurrWindowLocation = Windows.end() - 1;
322 I, Windows.end(), 0.0,
354 std::reverse(FullWindowFirstPart.begin(), FullWindowFirstPart.end());
lib/MC/MCCodeView.cpp 211 for (auto File : Files) {
lib/MC/MCContext.cpp 599 for (auto &Dir : CUIDTablePair.second.getMCDwarfDirs())
lib/MC/MCELFStreamer.cpp 74 DF->getContents().append(Code.begin(), Code.end());
87 DF->getContents().append(EF->getContents().begin(), EF->getContents().end());
568 CEIF->getContents().append(Code.begin(), Code.end());
596 DF->getContents().append(Code.begin(), Code.end());
lib/MC/MCMachOStreamer.cpp 465 for (MCFixup &Fixup : Fixups) {
470 DF->getContents().append(Code.begin(), Code.end());
lib/MC/MCObjectStreamer.cpp 54 for (MCSymbol *Sym : PendingLabels) {
69 for (PendingMCFixup &PendingFixup : PendingFixups) {
374 IF->getContents().append(Code.begin(), Code.end());
lib/MC/MCParser/AsmParser.cpp 982 for (std::tuple<SMLoc, CppHashInfoTy, MCSymbol *> &LocSym : DirLabels) {
5857 ClobberRegs.insert(ClobberRegs.end(), ImpDefs.begin(), ImpDefs.end());
5865 array_pod_sort(ClobberRegs.begin(), ClobberRegs.end());
5866 ClobberRegs.erase(std::unique(ClobberRegs.begin(), ClobberRegs.end()),
5867 ClobberRegs.end());
5896 array_pod_sort(AsmStrRewrites.begin(), AsmStrRewrites.end(), rewritesSort);
5897 for (const AsmRewrite &AR : AsmStrRewrites) {
lib/MC/MCParser/MCAsmParser.cpp 107 for (auto &PErr : PendingErrors)
lib/MC/MCParser/WasmAsmParser.cpp 97 for (auto &Flag : Flags) {
lib/MC/MCSection.cpp 64 SubsectionFragmentMap.end(),
67 if (MI != SubsectionFragmentMap.end()) {
73 if (MI == SubsectionFragmentMap.end())
lib/MC/MCSectionMachO.cpp 250 for (StringRef &SectionAttr : SectionAttrs) {
lib/MC/MCWasmStreamer.cpp 49 DF->getContents().append(EF->getContents().begin(), EF->getContents().end());
191 DF->getContents().append(Code.begin(), Code.end());
lib/MC/MCWinCOFFStreamer.cpp 66 DF->getContents().append(Code.begin(), Code.end());
lib/MC/MCXCOFFStreamer.cpp 82 DF->getContents().append(Code.begin(), Code.end());
lib/MC/SubtargetFeature.cpp 36 V.assign(Tmp.begin(), Tmp.end());
lib/MC/WasmObjectWriter.cpp 609 DataBytes.insert(DataBytes.end(), Fill->getValueSize() * NumValues,
613 DataBytes.insert(DataBytes.end(), Contents.begin(), Contents.end());
617 DataBytes.insert(DataBytes.end(), Contents.begin(), Contents.end());
862 for (const WasmDataSegment &Segment : DataSegments) {
977 for (const WasmDataSegment &Segment : DataSegments) {
lib/MC/WinCOFFObjectWriter.cpp 849 for (auto &Aux : File->Aux) {
lib/MC/XCOFFObjectWriter.cpp 588 for (auto &Sym : Csect.Syms) {
lib/MCA/HardwareUnits/RegisterFile.cpp 62 for (RegisterMappingTracker &RMT : RegisterFiles)
384 auto It = std::unique(Writes.begin(), Writes.end());
389 for (const WriteRef &WR : Writes) {
419 for (WriteRef &WR : DependentWrites) {
lib/MCA/HardwareUnits/ResourceManager.cpp 339 for (const ResourceRef &RF : ResourcesFreed)
lib/MCA/HardwareUnits/Scheduler.cpp 244 Insts.insert(Insts.end(), ReadySet.begin(), ReadySet.end());
lib/MCA/InstrBuilder.cpp 159 for (ResourcePlusCycles &RPC : ID.Resources) {
186 for (const std::pair<uint64_t, ResourceUsage> &R : ID.Resources)
lib/MCA/Instruction.cpp 60 for (const std::pair<ReadState *, int> &User : Users) {
143 for (const WriteState &WS : getDefs()) {
149 for (const ReadState &RS : getUses()) {
175 for (WriteState &WS : getDefs())
232 for (ReadState &Use : getUses())
235 for (WriteState &Def : getDefs())
244 for (WriteState &Def : getDefs())
lib/MCA/Pipeline.cpp 27 for (auto &S : Stages)
66 for (const std::unique_ptr<Stage> &S : Stages) {
lib/MCA/Stages/DispatchStage.cpp 115 for (ReadState &RS : IS.getUses())
123 for (WriteState &WS : IS.getDefs())
lib/MCA/Stages/EntryStage.cpp 61 auto Range = make_range(&Instructions[NumRetired], Instructions.end());
lib/MCA/Stages/ExecuteStage.cpp 72 for (const InstRef &I : Pending)
75 for (const InstRef &I : Ready)
103 for (const ResourceRef &RR : Freed)
106 for (InstRef &IR : Executed) {
113 for (const InstRef &IR : Pending)
116 for (const InstRef &IR : Ready)
lib/MCA/Stages/InstructionTables.cpp 33 Masks.begin(), std::find(Masks.begin(), Masks.end(), Resource.first));
lib/Object/ELF.cpp 569 std::upper_bound(LoadSegments.begin(), LoadSegments.end(), VAddr,
lib/Object/IRSymtab.cpp 103 Symtab.insert(Symtab.end(), reinterpret_cast<const char *>(Objs.data()),
lib/Object/MachOObjectFile.cpp 4044 for (const SectionInfo &SI : Sections) {
4065 for (const SectionInfo &SI : Sections) {
4076 for (const SectionInfo &SI : Sections) {
lib/ObjectYAML/MinidumpEmitter.cpp 103 allocateNewArray<support::ulittle16_t>(make_range(WStr.begin(), WStr.end()));
lib/Option/Arg.cpp 78 it = ASL.begin(), ie = ASL.end(); it != ie; ++it) {
lib/Option/ArgList.cpp 95 return std::vector<std::string>(Values.begin(), Values.end());
lib/Option/OptTable.cpp 220 for (StringRef Val : Candidates)
lib/Passes/PassBuilder.cpp 346 for (auto &C : PeepholeEPCallbacks)
355 for (auto &C : ModuleAnalysisRegistrationCallbacks)
364 for (auto &C : CGSCCAnalysisRegistrationCallbacks)
373 for (auto &C : FunctionAnalysisRegistrationCallbacks)
382 for (auto &C : LoopAnalysisRegistrationCallbacks)
464 for (auto &C : LateLoopOptimizationsEPCallbacks)
477 for (auto &C : LoopOptimizerEndEPCallbacks)
530 for (auto &C : ScalarOptimizerLateEPCallbacks)
821 for (auto &C : CGSCCOptimizerLateEPCallbacks)
904 for (auto &C : VectorizerStartEPCallbacks)
1003 for (auto &C : OptimizerLastEPCallbacks)
1032 for (auto &C : PipelineStartEPCallbacks)
1062 for (auto &C : PipelineStartEPCallbacks)
1639 for (auto &CB : Callbacks)
1848 for (auto &C : ModulePipelineParsingCallbacks)
1925 for (auto &C : ModulePipelineParsingCallbacks)
1977 for (auto &C : CGSCCPipelineParsingCallbacks)
2008 for (auto &C : CGSCCPipelineParsingCallbacks)
2053 for (auto &C : FunctionPipelineParsingCallbacks)
2091 for (auto &C : FunctionPipelineParsingCallbacks)
2124 for (auto &C : LoopPipelineParsingCallbacks)
2163 for (auto &C : LoopPipelineParsingCallbacks)
2185 for (auto &C : AAParsingCallbacks)
2280 for (auto &C : TopLevelPipelineParsingCallbacks)
lib/ProfileData/Coverage/CoverageMapping.cpp 91 for (auto I = Prev + 1, E = Terms.end(); I != E; ++I) {
99 Terms.erase(++Prev, Terms.end());
104 for (auto T : Terms) {
116 for (auto T : Terms) {
417 std::stable_sort(CompletedRegionsIt, ActiveRegions.end(),
462 ActiveRegions.erase(CompletedRegionsIt, ActiveRegions.end());
471 std::stable_partition(ActiveRegions.begin(), ActiveRegions.end(),
475 if (CompletedRegions != ActiveRegions.end()) {
lib/ProfileData/Coverage/CoverageMappingReader.cpp 266 for (auto I : VirtualFileMapping) {
lib/ProfileData/GCOV.cpp 120 for (const auto &FPtr : Functions)
371 for (const auto &Block : Blocks)
408 for (uint32_t N : Lines)
462 if (it == Blocked.end()) {
496 } else if (find(Blocked, W) == Blocked.end() && // W is not blocked.
515 if (find(List, V) == List.end()) {
725 for (StringRef Filename : Filenames) {
885 for (uint64_t N : BranchCounts)
lib/ProfileData/InstrProf.cpp 471 for (StringRef &Name : Names)
lib/ProfileData/InstrProfReader.cpp 662 Out.insert(Out.end(), OrigName.begin(), ExtractedName.begin());
663 Out.insert(Out.end(), Replacement.begin(), Replacement.end());
664 Out.insert(Out.end(), ExtractedName.end(), OrigName.end());
lib/ProfileData/InstrProfWriter.cpp 464 for (const auto &record : OrderedFuncData) {
lib/ProfileData/SampleProfReader.cpp 1135 NewStack.insert(NewStack.end(), InlineStack.begin(), InlineStack.end());
1139 for (auto CallerProfile : NewStack)
1183 NewStack.insert(NewStack.end(), InlineStack.begin(), InlineStack.end());
lib/ProfileData/SampleProfWriter.cpp 79 SectionHdrLayout.begin(), SectionHdrLayout.end(),
392 for (auto &Entry : SectionHdrLayout)
402 for (auto &Entry : SectionHdrLayout) {
lib/Remarks/Remark.cpp 128 if (Next == unwrap(Remark)->Args.end())
lib/Remarks/RemarkStringTable.cpp 48 for (Argument &Arg : R.Args) {
lib/Support/APInt.cpp 2253 std::reverse(Str.begin()+StartDig, Str.end());
lib/Support/BinaryStreamReader.cpp 55 Dest = decodeULEB128(EncodedBytes.begin(), nullptr, EncodedBytes.end());
70 Dest = decodeSLEB128(EncodedBytes.begin(), nullptr, EncodedBytes.end());
lib/Support/CommandLine.cpp 262 for (auto Name : OptionNames) {
270 Opt != Sub.PositionalOpts.end(); ++Opt) {
277 for (auto Opt = Sub.SinkOpts.begin(); Opt != Sub.SinkOpts.end(); ++Opt) {
453 else if (find(Categories, &C) == Categories.end())
588 for (auto Name : OptionNames) {
1141 if (std::any_of(FileStack.begin() + 1, FileStack.end(), IsEquivalent)) {
1161 for (ResponseFileRecord &Record : FileStack) {
1169 Argv.insert(Argv.begin() + I, ExpandedArgv.begin(), ExpandedArgv.end());
1305 for (auto O: DefaultOptions) {
1456 E = SinkOpts.end();
2036 array_pod_sort(Opts.begin(), Opts.end(), OptNameCompare);
2047 array_pod_sort(Subs.begin(), Subs.end(), SubNameCompare);
2066 for (const auto &S : Subs) {
2119 for (auto Opt : PositionalOpts) {
2207 for (auto &Cat : Opt->Categories) {
2468 for (auto &Cat : I.second->Categories) {
2479 for (auto &Cat : I.second->Categories) {
lib/Support/Debug.cpp 107 for (auto dbgType : dbgTypes)
lib/Support/DebugCounter.cpp 122 sort(CounterNames.begin(), CounterNames.end());
126 for (auto &CounterName : CounterNames) {
lib/Support/FileCheck.cpp 1817 for (std::pair<size_t, size_t> CmdlineDefIndices : CmdlineDefsIndices) {
1925 for (const auto &Var : LocalPatternVars)
1927 for (const auto &Var : LocalNumericVars)
lib/Support/GraphWriter.cpp 119 for (auto Name : parts) {
lib/Support/Host.cpp 255 for (auto I : Lines)
261 for (auto I : Lines)
1249 for (auto &Line : strs) {
lib/Support/JSON.cpp 353 if (End == S.end() && I >= std::numeric_limits<int64_t>::min() &&
360 return End == S.end() || parseError("Invalid JSON value (number?)");
lib/Support/MemoryBuffer.cpp 218 FD, makeMutableArrayRef(Buffer.end(), ChunkSize));
lib/Support/Path.cpp 430 for (auto &component : components) {
536 std::replace(Path.begin(), Path.end(), '/', '\\');
540 PathHome.append(Path.begin() + 1, Path.end());
544 for (auto PI = Path.begin(), PE = Path.end(); PI < PE; ++PI) {
711 for (StringRef C : components)
lib/Support/Process.cpp 48 for (StringRef Dir : Dirs) {
lib/Support/ScaledNumber.cpp 188 return std::string(Chars.begin(), Chars.end());
lib/Support/Signals.cpp 197 if (CurLine == Lines.end())
205 if (CurLine == Lines.end())
lib/Support/SpecialCaseList.cpp 134 for (auto I = Lines.begin(), E = Lines.end(); I != E; ++I, ++LineNo) {
lib/Support/TimeProfiler.cpp 115 for (const auto &E : Entries) {
lib/Support/Unix/Path.inc 600 Path.insert(Path.begin() + 1, Storage.begin() + 1, Storage.end());
lib/Support/VirtualFileSystem.cpp 429 for (auto &FS : FSList)
436 for (auto &FS : FSList)
1845 for (auto &Comp : Path)
lib/Support/YAMLParser.cpp 725 EscapedInput.insert(EscapedInput.end(), Val.begin(), Val.end());
988 i != SimpleKeys.end();) {
1000 if (!SimpleKeys.empty() && (SimpleKeys.end() - 1)->FlowLevel == Level)
1897 Storage.insert(Storage.end(), Valid.begin(), Valid.end());
1901 Storage.insert(Storage.end(), UnquotedValue.begin(), UnquotedValue.end());
1920 Storage.insert(Storage.end(), Valid.begin(), Valid.end());
2049 Storage.insert(Storage.end(), UnquotedValue.begin(), UnquotedValue.end());
lib/TableGen/Record.cpp 192 std::uninitialized_copy(Classes.begin(), Classes.end(),
246 Stack.insert(Stack.end(), T1->classes_begin(), T1->classes_end());
863 Args.insert(Args.end(), LHS->begin(), LHS->end());
864 Args.insert(Args.end(), RHS->begin(), RHS->end());
916 Args.insert(Args.end(), LHSs->begin(), LHSs->end());
917 Args.insert(Args.end(), RHSs->begin(), RHSs->end());
1117 for (Init *&Item : NewList) {
2082 for (RecordVal &Value : Values) {
2394 for (Init *S : Stack) {
lib/TableGen/TGParser.cpp 375 for (const auto &S : Substs)
421 for (const auto &S : Substs)
461 for (DefsetRecord *Defset : Defsets) {
1720 for (Init *V : Val) {
1927 std::reverse(NewBits.begin(), NewBits.end());
1978 for (Init *V : Vals) {
2124 std::reverse(Ranges.begin(), Ranges.end());
2501 for (unsigned R : Ranges)
2580 std::reverse(BitList.begin(), BitList.end());
2634 for (LetRecord &LR : LetInfo)
2876 std::reverse(Bits.begin(), Bits.end());
lib/Target/AArch64/AArch64CallLowering.cpp 410 for (const auto &F : Forwards) {
930 for (auto &OrigArg : Info.OrigArgs) {
lib/Target/AArch64/AArch64CallingConvention.cpp 48 for (auto &It : PendingMembers) {
122 for (auto &It : PendingMembers) {
133 for (auto &It : PendingMembers) {
lib/Target/AArch64/AArch64ExpandPseudoInsts.cpp 127 for (auto I = Insn.begin(), E = Insn.end(); I != E; ++I) {
lib/Target/AArch64/AArch64FalkorHWPFFix.cpp 694 for (auto *MI : P.second) {
lib/Target/AArch64/AArch64FastISel.cpp 3079 for (CCValAssign &VA : ArgLocs) {
3230 for (auto Flag : CLI.OutFlags)
3239 for (auto *Val : CLI.OutVals) {
3307 for (auto Reg : CLI.OutRegs)
3935 for (unsigned RetReg : RetRegs)
lib/Target/AArch64/AArch64FrameLowering.cpp 2157 for (const RegPairInfo &RPI : RegPairs)
lib/Target/AArch64/AArch64ISelDAGToDAG.cpp 2655 for (StringRef Field : Fields) {
lib/Target/AArch64/AArch64ISelLowering.cpp 3629 for (const CCValAssign &ArgLoc : ArgLocs)
3922 std::find_if(RegsToPass.begin(), RegsToPass.end(),
3931 CSInfo.erase(std::remove_if(CSInfo.begin(), CSInfo.end(),
3935 CSInfo.end());
4015 for (auto &RegToPass : RegsToPass) {
4073 for (auto &RegToPass : RegsToPass)
4215 std::find_if(RetVals.begin(), RetVals.end(),
4228 for (auto &RetVal : RetVals) {
6303 if (Source == Sources.end())
6304 Source = Sources.insert(Sources.end(), ShuffleSourceInfo(SourceVec));
6322 for (auto &Source : Sources) {
6336 for (auto &Src : Sources) {
6397 for (auto &Src : Sources) {
6409 : Sources)
lib/Target/AArch64/AArch64InstructionSelector.cpp 1224 for (auto &RenderFn : *Imm1Fn)
1226 for (auto &RenderFn : *Imm2Fn)
3024 for (Register InsReg : InsertRegs) {
3159 for (auto &RenderFn : *ImmFns)
3185 for (auto &RenderFn : *ImmFns)
3260 for (auto &RenderFn : *ImmFns)
3676 for (int Val : Mask) {
lib/Target/AArch64/AArch64LoadStoreOptimizer.cpp 1096 for (MachineInstr *MIb : MemInsns)
lib/Target/AArch64/AArch64PromoteConstant.cpp 525 for (auto U = Updates.begin(), E = Updates.end(); U != E;) {
lib/Target/AArch64/AArch64RedundantCopyElimination.cpp 326 for (auto &KnownReg : KnownRegs) {
388 for (RegImm &KnownReg : KnownRegs) {
lib/Target/AArch64/AArch64SIMDInstrOpt.cpp 239 for (auto IDesc : InstDescRepl)
252 for (auto IDesc :InstDescRepl)
728 for (MachineInstr *MI : RemoveMIs)
lib/Target/AArch64/AArch64SpeculationHardening.cpp 330 for (auto MI_Reg : ReturnInstructions) {
341 for (auto MI_Reg : CallInstructions) {
684 for (auto Entry : EntryBlocks)
lib/Target/AArch64/AArch64StackTagging.cpp 97 Ranges.begin(), Ranges.end(), Start,
99 if (I != Ranges.end() && End > I->Start) {
216 for (const auto &R : Ranges) {
646 for (auto &RI : RetVec) {
658 for (auto &RI : ReachableRetVec)
669 for (auto &RI : RetVec) {
689 for (auto &I : UnrecognizedLifetimes)
lib/Target/AArch64/AArch64StackTaggingPreRA.cpp 167 for (auto *I : ReTags) {
lib/Target/AArch64/AsmParser/AArch64AsmParser.cpp 5054 (std::find(RequestedExtensions.begin(), RequestedExtensions.end(),
5057 (std::find(RequestedExtensions.begin(), RequestedExtensions.end(),
5134 for (auto Name : RequestedExtensions) {
5233 for (auto Name : RequestedExtensions) {
lib/Target/AMDGPU/AMDGPUAtomicOptimizer.cpp 97 for (ReplacementInfo &Info : ToReplace) {
lib/Target/AMDGPU/AMDGPUCallLowering.cpp 169 for (EVT VT : SplitVTs) {
lib/Target/AMDGPU/AMDGPUHSAMetadataStreamer.cpp 387 for (StringRef Key : SplitTypeQuals) {
816 for (StringRef Key : SplitTypeQuals) {
lib/Target/AMDGPU/AMDGPUMachineCFGStructurizer.cpp 171 for (auto &Source : ElimiatedSources) {
1393 for (auto i : *RegionIndices) {
1439 for (auto i : PHIRegionIndices) {
1606 for (auto PII : PHIRegionIndices) {
1675 for (auto PHII : PHIs) {
1687 for (auto PHII : PHIs) {
2038 for (auto LI : OldLiveOuts) {
2082 for (auto SI : Sources) {
2131 for (auto &SourceInfo : ElimiatedSources) {
2474 for (auto PHII : PHIs) {
lib/Target/AMDGPU/AMDGPUPrintfRuntimeBinding.cpp 157 for (auto CI : Printfs) {
558 for (auto CI : Printfs)
lib/Target/AMDGPU/AMDGPUPromoteAlloca.cpp 172 for (AllocaInst *AI : Allocas) {
lib/Target/AMDGPU/AMDGPUPropagateAttributes.cpp 161 for (Clone &C : Clones)
lib/Target/AMDGPU/AMDGPURegisterBankInfo.cpp 52 for (MachineInstr *MI : NewInsts)
lib/Target/AMDGPU/AMDGPURewriteOutArguments.cpp 285 for (Argument *OutArg : OutArgs) {
302 for (ReturnInst *RI : Returns) {
323 for (std::pair<ReturnInst *, StoreInst *> Store : ReplaceableStores) {
329 return Entry.first == OutArg;}) != ValVec.end()) {
396 for (std::pair<Argument *, Value *> ReturnPoint : Replacement.second) {
lib/Target/AMDGPU/AMDGPUSubtarget.cpp 746 for (const SDep &SI : SU.Preds) {
752 for (const SDep &SI : SUa->Succs) {
790 if (SU != Succs[I] && llvm::find(Succs, SU) == Succs.end())
798 if (llvm::find(Succs, SU) != Succs.end())
827 for (SDep &SI : From->Succs) {
833 for (SDep &SI : SU->Succs) {
lib/Target/AMDGPU/AMDGPUUnifyDivergentExitNodes.cpp 221 for (BasicBlock *BB : UnreachableBlocks) {
lib/Target/AMDGPU/AMDGPUUnifyMetadata.cpp 99 if (std::find(All.begin(), All.end(), Op.get()) == All.end())
99 if (std::find(All.begin(), All.end(), Op.get()) == All.end())
104 for (const auto &MD : All)
lib/Target/AMDGPU/AMDILCFGStructurizer.cpp 734 It = OrderedBlks.begin(), E = OrderedBlks.end(); It != E; ++It) {
767 OrderedBlks.end());
777 OrderedBlks.end();
840 = countActiveBlock(OrderedBlks.begin(), OrderedBlks.end());
1632 E = RetMBB.end(); It != E; ++It) {
lib/Target/AMDGPU/GCNDPPCombine.cpp 537 for (auto *MI : *(Rollback? &DPPMIs : &OrigMIs))
lib/Target/AMDGPU/GCNMinRegStrategy.cpp 96 for (auto PDep : SDep.getSUnit()->Preds) {
189 for (const auto &P : S.getSUnit()->Preds) {
lib/Target/AMDGPU/GCNNSAReassign.cpp 258 for (auto &C : Candidates) {
281 if (llvm::find(Intervals, LI) != Intervals.end()) {
297 for(auto *LI : Intervals)
312 for (auto E = Candidates.end(); Success && I != E &&
lib/Target/AMDGPU/GCNRegBankReassign.cpp 655 std::sort(BankStalls.begin(), BankStalls.end());
lib/Target/AMDGPU/GCNRegPressure.cpp 242 auto I = std::find_if(Res.begin(), Res.end(), [Reg](const RegisterMaskPair &RM) {
245 if (I != Res.end())
lib/Target/AMDGPU/GCNRegPressure.h 225 for (auto SI : LiveIdxs)
233 for (auto SI : SRLiveIdxs)
lib/Target/AMDGPU/GCNSchedStrategy.cpp 552 for (auto Region : Regions) {
lib/Target/AMDGPU/R600InstrInfo.cpp 348 for (const auto &Src : getSrcs(MI)) {
617 for (const auto &Src : getSrcs(MI)) {
lib/Target/AMDGPU/SIFoldOperands.cpp 321 for (FoldCandidate &Fold : FoldList)
510 return FC.UseMI == UseMI; }) != FoldList.end())
637 for (auto & F : CopyUses) {
1197 for (auto U : UsesToProcess) {
1207 for (MachineInstr *Copy : CopiesToReplace)
1210 for (FoldCandidate &Fold : FoldList) {
lib/Target/AMDGPU/SIFormMemoryClauses.cpp 191 for (unsigned Idx : CoveringSubregs) {
lib/Target/AMDGPU/SIISelLowering.cpp 2885 for (auto &RegToPass : RegsToPass) {
2939 for (auto &RegToPass : RegsToPass) {
4100 for (SDValue &Elt : Elts)
5571 for (const SDValue &Addr : VAddrs)
10180 Ops.insert(Ops.end(), Node->op_begin(), Node->op_begin() + DmaskIdx);
10182 Ops.insert(Ops.end(), Node->op_begin() + DmaskIdx + 1, Node->op_end());
lib/Target/AMDGPU/SIInsertWaitcnts.cpp 1566 for (MachineBasicBlock *MBB : EndPgmBlocks) {
lib/Target/AMDGPU/SILoadStoreOptimizer.cpp 1645 for (auto P : InstsWCommonBase) {
lib/Target/AMDGPU/SILowerI1Copies.cpp 203 for (MachineBasicBlock *MBB : ReachableOrdered) {
215 for (MachineBasicBlock *UnreachablePred : Stack) {
216 if (llvm::find(Predecessors, UnreachablePred) == Predecessors.end())
534 for (MachineInstr *MI : DeadCopies)
560 for (MachineInstr *MI : Vreg1Phis) {
731 for (MachineInstr *MI : DeadCopies)
lib/Target/AMDGPU/SILowerSGPRSpills.cpp 218 for (MachineBasicBlock *SaveBlock : SaveBlocks)
221 for (MachineBasicBlock *RestoreBlock : RestoreBlocks)
lib/Target/AMDGPU/SIMachineFunctionInfo.cpp 363 for (MCPhysReg Reg : SpillAGPR)
365 for (MCPhysReg Reg : SpillVGPR)
lib/Target/AMDGPU/SIMachineScheduler.cpp 350 for (const auto &RegMaskPair : RPTracker.getPressure().LiveInRegs) {
377 for (const auto &RegMaskPair : RPTracker.getPressure().LiveOutRegs) {
443 for (SDep& Succ : SU->Succs) {
484 for (SDep& Succ : SU->Succs) {
516 for (SDep& Succ : SU->Succs) {
827 for (SDep& PredDep : SU->Preds) {
869 for (SDep& SuccDep : SU->Succs) {
953 for (SDep& SuccDep : SU->Succs) {
1023 for (SDep& SuccDep : SU->Succs) {
1044 for (SDep& SuccDep : SU->Succs) {
1065 for (SDep& SuccDep : SU->Succs) {
1097 for (SDep& SuccDep : SU->Succs) {
1126 for (SDep& SuccDep : SU->Succs) {
1158 for (unsigned j : ExpGroup) {
1189 for (unsigned j : ExpGroup)
1243 for (SDep& SuccDep : SU->Succs) {
1251 for (SDep& PredDep : SU->Preds) {
1840 for (SDep& PredDep : SU->Preds) {
1875 for (SDep& SuccDep : SU->Succs) {
lib/Target/AMDGPU/SIMachineScheduler.h 474 for (const auto &RegMaskPair : RPTracker.getPressure().LiveInRegs) {
482 for (const auto &RegMaskPair : RPTracker.getPressure().LiveOutRegs) {
lib/Target/AMDGPU/SIOptimizeExecMasking.cpp 415 for (MachineInstr *OtherInst : OtherUseInsts) {
lib/Target/AMDGPU/SIWholeQuadMode.cpp 417 for (MachineInstr *MI : SetInactiveInstrs)
419 for (MachineInstr *MI : SoftWQMInstrs)
841 for (MachineInstr *MI : LiveMaskQueries) {
854 for (MachineInstr *MI : LowerToCopyInstrs) {
lib/Target/ARC/ARCISelLowering.cpp 563 for (const auto &ArgDI : ArgData) {
lib/Target/ARM/A15SDOptimizer.cpp 598 for (SmallVectorImpl<unsigned>::iterator I = Defs.begin(), E = Defs.end();
613 for (MachineInstr *MI : DefSrcs) {
636 E = Uses.end(); I != E; ++I) {
lib/Target/ARM/ARMAsmPrinter.cpp 172 for (std::pair<unsigned, MCSymbol *> &TIP : ThumbIndirectPads) {
1331 for (std::pair<unsigned, MCSymbol *> &TIP : ThumbIndirectPads) {
lib/Target/ARM/ARMBaseInstrInfo.cpp 1559 for (const auto &Reg : ScratchRegs) {
lib/Target/ARM/ARMCallLowering.cpp 544 for (auto Arg : Info.OrigArgs) {
lib/Target/ARM/ARMCallingConv.cpp 233 It != PendingMembers.end(); ++It) {
248 for (auto &It : PendingMembers) {
270 for (auto &It : PendingMembers) {
lib/Target/ARM/ARMCodeGenPrepare.cpp 462 for (auto *U : Users)
lib/Target/ARM/ARMFastISel.cpp 2172 for (unsigned R : RetRegs)
2276 for (Register R : RegArgs)
2420 for (Register R : RegArgs)
lib/Target/ARM/ARMFrameLowering.cpp 247 assert(Info != Insts.end() && "invalid sp adjusting instruction");
255 for (auto &Info : Insts) {
1884 if (LRPos != UnspilledCS1GPRs.end())
1888 if (FPPos != UnspilledCS1GPRs.end())
2035 if (LRPos != UnspilledCS1GPRs.end())
2109 for (unsigned Reg : Extras) {
lib/Target/ARM/ARMISelDAGToDAG.cpp 4305 for (StringRef Field : Fields) {
lib/Target/ARM/ARMISelLowering.cpp 7378 if (Source == Sources.end())
7379 Source = Sources.insert(Sources.end(), ShuffleSourceInfo(SourceVec));
7395 for (auto &Source : Sources) {
7408 for (auto &Src : Sources) {
7469 for (auto &Src : Sources) {
7481 : Sources)
9495 CSI = CallSiteIdxs.begin(), CSE = CallSiteIdxs.end();
9511 II = MBBList.begin(), IE = MBBList.end(); II != IE; ++II) {
9870 I = MBBLPads.begin(), E = MBBLPads.end(); I != E; ++I)
lib/Target/ARM/ARMLegalizerInfo.cpp 422 for (auto Libcall : Libcalls) {
lib/Target/ARM/ARMLoadStoreOptimizer.cpp 937 for (unsigned &ImpDefReg : ImpDefs) {
950 for (unsigned ImpDef : ImpDefs)
1812 for (const MemOpQueueEntry &E : MemOps) {
1828 for (MI = MemOps.begin(), ME = MemOps.end(); MI != ME; ++MI) {
1839 if (MI != MemOps.end()) {
1882 for (const MergeCandidate *Candidate : Candidates) {
1907 for (MachineInstr *MI : MergeBaseCandidates)
lib/Target/ARM/ARMLowOverheadLoops.cpp 537 for (auto *Start : Starts) {
543 for (auto *Dec : Decs)
546 for (auto *End : Ends)
lib/Target/ARM/ARMParallelDSP.cpp 187 for (auto &Mul : Muls)
203 for (auto *I : Lds)
378 for (auto Write : Writes) {
379 for (auto Read : Loads) {
411 for (auto *Base : Loads) {
412 for (auto *Offset : Loads) {
558 for (auto &MulCand : R.getMuls()) {
672 for (auto &MulCand : MulCands) {
715 for (auto &Pair : R.getMulPairs()) {
lib/Target/ARM/AsmParser/ARMAsmParser.cpp 252 for (const MCInst &Inst : PendingConditionalInsts) {
3556 assert(std::is_sorted(Regs.begin(), Regs.end()) &&
3560 for (const auto &P : Regs)
6656 for (auto &Operand : Operands) {
6668 for (auto &Operand : Operands) {
11709 for (auto &M : Messages) {
lib/Target/ARM/MCTargetDesc/ARMUnwindOpAsm.h 63 Ops.insert(Ops.end(), Opcodes.begin(), Opcodes.end());
84 Ops.insert(Ops.end(), Opcode, Opcode + Size);
lib/Target/ARM/MVETailPredication.cpp 455 for (auto *I : MaskedInsts) {
lib/Target/ARM/Thumb2ITBlockPass.cpp 100 for (unsigned Reg : Regs)
lib/Target/AVR/AVRISelLowering.cpp 1066 for (CCValAssign &VA : ArgLocs) {
1263 for (auto Reg : RegsToPass) {
1276 for (auto Reg : RegsToPass) {
1328 std::reverse(RVLocs.begin(), RVLocs.end());
1332 for (CCValAssign const &RVLoc : RVLocs) {
1394 std::reverse(RVLocs.begin(), RVLocs.end());
lib/Target/BPF/BPFISelLowering.cpp 226 for (auto &VA : ArgLocs) {
310 for (auto &Arg : Outs) {
359 for (auto &Reg : RegsToPass) {
385 for (auto &Reg : RegsToPass)
474 for (auto &Val : RVLocs) {
lib/Target/BPF/BTFDebug.cpp 1080 for (auto *GVE : GVs) {
lib/Target/Hexagon/AsmParser/HexagonAsmParser.cpp 900 Operands.insert(Operands.end() - 1, HexagonOperand::CreateToken(
1054 if ((Tokens.end() - 2)->getKind() == AsmToken::TokenKind::Plus) {
1055 Tokens.insert(Tokens.end() - 2,
lib/Target/Hexagon/HexagonConstExtenders.cpp 152 for (Node *N : Nodes)
1355 for (RangeTree::Node *N : Nodes) {
1377 unsigned N = std::accumulate(V.begin(), V.end(), 0u,
1396 for (RangeTree::Node *N : Tree.nodesWith(Best)) {
lib/Target/Hexagon/HexagonCopyToCombine.cpp 633 for (auto NewMI : DbgMItoMove) {
lib/Target/Hexagon/HexagonEarlyIfConv.cpp 614 for (DTNodeVectType::iterator I = Cn.begin(), E = Cn.end(); I != E; ++I) {
966 for (DTNodeVectType::iterator I = Cn.begin(), E = Cn.end(); I != E; ++I) {
lib/Target/Hexagon/HexagonExpandCondsets.cpp 428 for (auto &SI : PredDefs) {
438 for (auto &SI : PredDefs) {
1200 for (MachineInstr *CI : TwoRegs) {
1282 for (MachineInstr *MI : Condsets)
1295 for (MachineInstr *MI : Condsets)
lib/Target/Hexagon/HexagonFrameLowering.cpp 446 for (auto &B : SFBlocks)
617 for (auto MI : AdjustRegs) {
1958 for (unsigned VR : NewRegs)
lib/Target/Hexagon/HexagonGenMux.cpp 331 for (MuxInfo &MX : ML) {
lib/Target/Hexagon/HexagonHazardRecognizer.cpp 143 for (auto &S : SU->Succs)
158 for (auto &S : SU->Succs)
lib/Target/Hexagon/HexagonISelDAGToDAG.cpp 1686 std::pop_heap(Q.begin(), Q.end(), WeightedLeaf::Compare);
1703 std::push_heap(Q.begin(), Q.end(), WeightedLeaf::Compare);
1746 std::make_heap(Q.begin(), Q.end(), WeightedLeaf::Compare);
1773 std::make_heap(Q.begin(), Q.end(), WeightedLeaf::Compare);
lib/Target/Hexagon/HexagonISelDAGToDAGHVX.cpp 971 for (SDNode *L : Nodes)
1828 for (unsigned I : Perm)
lib/Target/Hexagon/HexagonISelLowering.cpp 2484 for (SDValue P : Ops) {
lib/Target/Hexagon/HexagonISelLoweringHVX.cpp 396 (Constant**)Consts.end());
449 for (int M : ExtIdx) {
557 for (const SDValue &W : Words[IdxW ^ 1]) {
563 for (const SDValue &W : Words[IdxW ^ 1]) {
575 for (const SDValue &W : Words[IdxW]) {
lib/Target/Hexagon/HexagonInstrInfo.cpp 2100 for (auto &RegA : DefsA)
2101 for (auto &RegB : UsesB) {
lib/Target/Hexagon/HexagonLoopIdiomRecognition.cpp 2309 SetVector<Instruction*> Worklist(Insts.begin(), Insts.end());
2372 for (auto &SI : Stores)
lib/Target/Hexagon/HexagonMachineScheduler.cpp 292 for (const SDep &PI : SU->Preds) {
310 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
525 for (auto &Pred : SU->Preds) {
540 for (auto &Succ : SU->Succs) {
646 for (const SDep &SI : SU->Succs)
652 for (const SDep &PI : SU->Preds)
706 for (const SDep &PI : SU->Preds) {
715 for (const SDep &SI : SU->Succs) {
732 for (const auto &PI : SU->Preds) {
740 for (const auto &SI : SU->Succs) {
lib/Target/Hexagon/HexagonOptAddrMode.cpp 168 for (NodeAddr<UseNode *> UA : AddAslSN.Addr->members_if(DFG->IsUse, *DFG)) {
245 for (NodeAddr<DefNode *> DA : SA.Addr->members_if(DFG->IsDef, *DFG)) {
290 for (NodeAddr<UseNode *> UA : SN.Addr->members_if(DFG->IsUse, *DFG)) {
689 for (auto IA : BA.Addr->members(*DFG)) {
805 for (NodeAddr<BlockNode *> BA : FA.Addr->members(*DFG))
lib/Target/Hexagon/HexagonRDFOpt.cpp 162 for (NodeAddr<BlockNode*> BA : DFG.getFunc().Addr->members(DFG)) {
163 for (auto TA : BA.Addr->members_if(DFG.IsCode<NodeAttrs::Stmt>, DFG)) {
165 for (NodeAddr<RefNode*> RA : SA.Addr->members(DFG)) {
200 for (NodeAddr<RefNode*> RA : Refs)
205 for (NodeAddr<RefNode*> RA : Refs) {
257 for (NodeAddr<DefNode*> DA : IA.Addr->members_if(DFG.IsDef, DFG)) {
267 for (auto D : Defs)
lib/Target/Hexagon/HexagonSubtarget.cpp 133 for (auto &D : SU.Preds)
136 for (auto &E : Erase)
152 for (SDep &SI : SU.Succs) {
162 for (SDep &PI : SI.getSUnit()->Preds) {
420 for (auto &I : Src->Succs) {
450 auto F = std::find(Dst->Preds.begin(), Dst->Preds.end(), T);
451 assert(F != Dst->Preds.end());
459 for (auto &I : Src->Succs) {
467 auto F = std::find(Dst->Preds.begin(), Dst->Preds.end(), T);
468 assert(F != Dst->Preds.end());
475 for (auto &I : Deps)
554 for (auto &I : DstBest->Preds)
562 for (auto &I : SrcBest->Succs)
lib/Target/Hexagon/HexagonVExtract.cpp 140 for (MachineInstr *ExtI : P.second) {
lib/Target/Hexagon/HexagonVLIWPacketizer.cpp 525 for (const auto &PI : SUI->Preds)
1860 for (auto &Pred : SUI->Preds)
1871 for (auto &Pred : SUI->Preds)
lib/Target/Hexagon/HexagonVectorLoopCarriedReuse.cpp 494 for (Instruction *I : PNUsers) {
lib/Target/Hexagon/MCTargetDesc/HexagonAsmBackend.cpp 708 for (auto I : Layout.getSectionOrder()) {
lib/Target/Hexagon/MCTargetDesc/HexagonMCTargetDesc.cpp 310 return join(Result.begin(), Result.end(), ",");
lib/Target/Hexagon/MCTargetDesc/HexagonShuffler.cpp 639 ISK != Packet.end(); ++ISK, ++slotSkip)
650 std::stable_sort(ISJ, Packet.end());
lib/Target/Hexagon/MCTargetDesc/HexagonShuffler.h 181 iterator end() { return (Packet.end()); }
lib/Target/Hexagon/RDFCopy.cpp 72 for (NodeAddr<InstrNode*> IA : BA.Addr->members(DFG)) {
144 for (NodeAddr<DefNode*> DA : SA.Addr->members_if(DFG.IsDef, DFG)) {
lib/Target/Hexagon/RDFDeadCode.cpp 88 for (NodeAddr<RefNode*> RA : IA.Addr->members(DFG)) {
97 for (NodeAddr<UseNode*> UA : IA.Addr->members_if(DFG.IsUse, DFG)) {
101 for (NodeAddr<DefNode*> TA : DFG.getRelatedRefs(IA, DA))
107 for (NodeAddr<DefNode*> DA : LV.getAllReachingDefs(UA)) {
128 for (NodeAddr<BlockNode*> BA : DFG.getFunc().Addr->members(DFG))
129 for (NodeAddr<InstrNode*> IA : BA.Addr->members(DFG))
151 for (NodeAddr<DefNode*> DA : IA.Addr->members_if(DFG.IsDef, DFG))
157 for (NodeAddr<BlockNode*> BA : DFG.getFunc().Addr->members(DFG)) {
158 for (NodeAddr<InstrNode*> IA : BA.Addr->members(DFG)) {
159 for (NodeAddr<RefNode*> RA : IA.Addr->members(DFG))
198 for (auto N : NodeAddr<CodeNode*>(BA).Addr->members(DFG))
221 for (NodeAddr<RefNode*> RA : DRNs) {
231 for (NodeAddr<InstrNode*> IA : DINs) {
lib/Target/Hexagon/RDFGraph.cpp 293 for (auto I : P.Obj.Addr->members(P.G))
301 for (auto I : P.Obj.Addr->members(P.G))
888 for (NodeAddr<BlockNode*> BA : Blocks)
889 for (NodeAddr<InstrNode*> IA : BA.Addr->members(*this))
890 for (NodeAddr<RefNode*> RA : IA.Addr->members(*this))
921 for (NodeAddr<BlockNode*> BA : Blocks) {
939 for (NodeAddr<BlockNode*> PBA : Preds) {
950 for (NodeAddr<BlockNode*> BA : Blocks)
952 for (NodeAddr<BlockNode*> BA : Blocks)
1046 for (NodeAddr<DefNode*> DA : IA.Addr->members_if(IsDef, *this)) {
1067 for (NodeAddr<NodeBase*> T : Rel)
1092 for (NodeAddr<DefNode*> DA : IA.Addr->members_if(IsDef, *this)) {
1121 for (NodeAddr<NodeBase*> T : Rel)
1400 for (NodeAddr<InstrNode*> IA : BA.Addr->members(*this))
1401 for (NodeAddr<RefNode*> RA : IA.Addr->members_if(IsDef, *this))
1496 for (NodeAddr<BlockNode*> PBA : Preds) {
1520 for (NodeAddr<BlockNode*> BA : Func.Addr->members(*this)) {
1521 for (auto P : BA.Addr->members_if(IsPhi, *this))
1526 for (NodeAddr<NodeBase*> M : Ms) {
1545 for (NodeAddr<RefNode*> RA : Refs) {
1618 for (NodeAddr<RefNode*> RA : SA.Addr->members_if(P, *this)) {
1658 for (NodeAddr<InstrNode*> IA : BA.Addr->members(*this)) {
1698 for (NodeAddr<InstrNode*> IA : SBA.Addr->members_if(IsPhi, *this)) {
1708 for (auto U : IA.Addr->members_if(IsUseForBA, *this)) {
1787 for (NodeAddr<RefNode*> I : ReachedDefs)
1789 for (NodeAddr<RefNode*> I : ReachedUses)
1792 for (NodeAddr<DefNode*> I : ReachedDefs)
1794 for (NodeAddr<UseNode*> I : ReachedUses)
lib/Target/Hexagon/RDFLiveness.cpp 129 for (auto S : DFG.getRelatedRefs(RefA.Addr->getOwner(DFG), RefA))
151 for (auto S : DFG.getRelatedRefs(TA.Addr->getOwner(DFG), TA))
236 for (NodeAddr<DefNode*> DA : TA.Addr->members_if(DefInSet, DFG)) {
249 RDefs.insert(RDefs.end(), Ds.begin(), Ds.end());
249 RDefs.insert(RDefs.end(), Ds.begin(), Ds.end());
250 for (NodeAddr<DefNode*> DA : Ds) {
294 for (NodeAddr<NodeBase*> R : RDs)
299 for (NodeAddr<DefNode*> DA : RDs) {
308 for (auto U : PA.Addr->members_if(DFG.IsRef<NodeAttrs::Use>, DFG)) {
343 for (NodeAddr<RefNode*> R : Refs) {
431 for (NodeAddr<BlockNode*> BA : Blocks) {
433 Phis.insert(Phis.end(), Ps.begin(), Ps.end());
433 Phis.insert(Phis.end(), Ps.begin(), Ps.end());
442 for (NodeAddr<PhiNode*> PhiA : Phis) {
453 for (NodeAddr<RefNode*> R : PhiRefs) {
488 for (auto T : DFG.getRelatedRefs(A.Addr->getOwner(DFG), A)) {
525 for (NodeAddr<DefNode*> DA : getAllReachingDefs(R, UA)) {
552 for (auto I : PhiRefs) {
563 for (NodeAddr<DefNode*> D : Ds) {
576 for (NodeAddr<PhiUseNode*> T : DFG.getRelatedRefs(PhiA, PUA))
620 for (NodeAddr<UseNode*> UA : PUs) {
686 for (NodeAddr<BlockNode*> BA : DFG.getFunc().Addr->members(DFG)) {
688 for (NodeAddr<InstrNode*> IA : BA.Addr->members(DFG)) {
689 for (NodeAddr<RefNode*> RA : IA.Addr->members(DFG))
724 for (NodeAddr<BlockNode*> BA : Blocks) {
727 for (auto P : BA.Addr->members_if(DFG.IsCode<NodeAttrs::Phi>, DFG))
742 for (NodeAddr<BlockNode*> BA : Blocks) {
744 for (NodeAddr<PhiNode*> PA : Phis) {
750 for (auto U : PA.Addr->members_if(DFG.IsRef<NodeAttrs::Use>, DFG)) {
779 for (NodeAddr<DefNode*> D : Ds) {
789 for (NodeAddr<PhiUseNode*> T : DFG.getRelatedRefs(PA, PUA))
1033 for (NodeAddr<DefNode*> TA : getAllReachingDefs(DA)) {
1069 for (auto I : DFG.getFunc().Addr->findBlock(B, DFG).Addr->members(DFG)) {
1073 for (NodeAddr<UseNode*> UA : IA.Addr->members_if(DFG.IsUse, DFG)) {
1077 for (NodeAddr<DefNode*> D : getAllReachingDefs(UA))
lib/Target/Mips/AsmParser/MipsAsmParser.cpp 1554 Op->RegList.List = new SmallVector<unsigned, 10>(Regs.begin(), Regs.end());
1684 for (auto Reg : (*RegList.List))
lib/Target/Mips/MCTargetDesc/MipsELFStreamer.cpp 78 for (auto *L : Labels) {
111 for (const auto &I : MipsOptionRecords)
lib/Target/Mips/MipsAnalyzeImmediate.cpp 28 for (InstSeqLs::iterator Iter = SeqLs.begin(); Iter != SeqLs.end(); ++Iter)
79 std::make_move_iterator(SeqLsORi.end()));
110 InstSeqLs::iterator ShortestSeq = SeqLs.end();
114 for (InstSeqLs::iterator S = SeqLs.begin(); S != SeqLs.end(); ++S) {
125 Insts.append(ShortestSeq->begin(), ShortestSeq->end());
lib/Target/Mips/MipsBranchExpansion.cpp 815 SmallVectorImpl<MBBInfo>::iterator I, E = MBBInfos.end();
lib/Target/Mips/MipsCallLowering.cpp 52 std::reverse(VRegs.begin(), VRegs.end());
543 for (auto &Arg : Info.OrigArgs) {
591 for (auto &Arg : Info.OrigArgs) {
lib/Target/Mips/MipsDelaySlotFiller.cpp 499 for (ValueType VT : Objs)
542 for (const Value *UValue : Objs) {
lib/Target/Mips/MipsFastISel.cpp 1521 for (auto Flag : CLI.OutFlags)
1529 for (auto *Val : CLI.OutVals) {
1566 for (auto Reg : CLI.OutRegs)
lib/Target/Mips/MipsInstructionSelector.cpp 690 for (const struct Instr &Instruction : Instructions) {
lib/Target/Mips/MipsRegisterBankInfo.cpp 656 for (MachineInstr *DeadMI : DeadInstrs)
lib/Target/Mips/MipsSEISelLowering.cpp 2640 for (const auto &V : Indices) {
2647 return fitsRegularPattern<int>(Indices.begin(), 1, Indices.end(), SplatIndex,
2674 const auto &End = Indices.end();
2720 const auto &End = Indices.end();
2767 const auto &End = Indices.end();
2815 const auto &End = Indices.end();
2863 const auto &End = Indices.end();
2906 const auto &End = Indices.end();
2956 for (SmallVector<int, 16>::iterator I = Indices.begin(); I != Indices.end();
lib/Target/NVPTX/MCTargetDesc/NVPTXTargetStreamer.cpp 28 for (const std::string &S : DwarfFiles)
lib/Target/NVPTX/ManagedStringPool.h 33 while (Current != Pool.end()) {
lib/Target/NVPTX/NVPTXISelDAGToDAG.cpp 647 for (auto *Node : E0)
649 for (auto *Node : E1)
lib/Target/NVPTX/NVPTXLowerAggrCopies.cpp 105 for (LoadInst *LI : AggrLoads) {
126 for (MemIntrinsic *MemCall : MemCalls) {
lib/Target/NVPTX/NVPTXProxyRegErasure.cpp 87 for (auto *MI : RemoveList) {
lib/Target/NVPTX/NVVMReflect.cpp 176 for (Instruction *I : ToRemove)
lib/Target/PowerPC/PPCBoolRetToInt.cpp 161 for (auto &User : ToRemove)
lib/Target/PowerPC/PPCExpandISEL.cpp 201 auto E = CurrentISELList.end();
268 while (MI != BIL.end()) {
436 for (auto &MI : BIL) {
lib/Target/PowerPC/PPCISelDAGToDAG.cpp 1532 for (auto &BG : BitGroups) {
1596 for (auto &BG : BitGroups) {
1602 for (auto &BG2 : BitGroups)
1628 for (auto I = BitGroups.begin(); I != BitGroups.end();) {
1632 std::prev(BitGroups.end()) : std::prev(I);
1655 assert(std::next(I) == BitGroups.end() &&
1753 for (ValueRotInfo &VRI : ValueRotsVec) {
1878 for (auto &BG : BitGroups) {
2070 for (ValueRotInfo &VRI : ValueRotsVec) {
2098 for (auto &BG : BitGroups) {
2134 for (auto &BG : BitGroups) {
2254 for (auto &BG : BitGroups) {
2287 for (auto I = BitGroups.begin(), IE = BitGroups.end(); I != IE; ++I) {
2303 for (auto &BG : BitGroups) {
2383 BitGroups.erase(remove_if(BitGroups, F), BitGroups.end());
5618 UE = ToReplace.end(); UI != UE; ++UI) {
lib/Target/PowerPC/PPCISelLowering.cpp 6836 for (CCValAssign &VA : ArgLocs) {
6861 for (auto Reg : RegsToPass) {
12225 for (auto &PromOp : PromOps)
12479 for (auto &PromOp : PromOps)
lib/Target/PowerPC/PPCInstrInfo.cpp 3683 for (auto &MO : MOps)
lib/Target/PowerPC/PPCLoopPreIncPrep.cpp 223 for (auto &B : Buckets) {
313 for (auto &E : BucketChain.Elements) {
417 IE = BucketChain.Elements.end(); I != IE; ++I) {
474 for (auto &Bucket : Buckets)
lib/Target/PowerPC/PPCPreEmitPeephole.cpp 284 for (MachineInstr *MI : InstrsToErase) {
lib/Target/PowerPC/PPCQPXLoadSplat.cpp 80 for (auto SI = Splats.begin(); SI != Splats.end();) {
lib/Target/PowerPC/PPCTargetTransformInfo.cpp 529 for (auto &BB : ExitingBlocks) {
lib/Target/RISCV/AsmParser/RISCVAsmParser.cpp 1600 for (RISCVMatInt::Inst &Inst : Seq) {
lib/Target/RISCV/RISCVISelDAGToDAG.cpp 73 for (RISCVMatInt::Inst &Inst : Seq) {
lib/Target/RISCV/RISCVISelLowering.cpp 1301 for (MachineInstr *DebugInstr : SelectDebugValues) {
1589 for (auto &It : PendingLocs) {
2078 for (auto &Arg : Outs)
2253 for (auto &Reg : RegsToPass) {
2296 for (auto &Reg : RegsToPass)
2335 for (auto &VA : RVLocs) {
lib/Target/RISCV/RISCVInstrInfo.cpp 179 for (RISCVMatInt::Inst &Inst : Seq) {
lib/Target/RISCV/RISCVTargetObjectFile.cpp 91 for (const auto &MFE : ModuleFlags) {
lib/Target/Sparc/AsmParser/SparcAsmParser.cpp 602 for (const MCInst &I : Instructions) {
lib/Target/SystemZ/SystemZCallingConv.h 114 for (auto &It : PendingMembers) {
lib/Target/SystemZ/SystemZFrameLowering.cpp 467 for (auto CFIIndex : CFIIndexes) {
lib/Target/SystemZ/SystemZISelLowering.cpp 4559 for (auto &Op : GS.Ops) {
4585 for (auto Elem : Elems) {
4614 for (auto Elem : Elems)
5550 for (SDNode *U : OtherUses) {
6588 for (auto MI : Selects) {
6651 for (auto SelMI : Selects)
6699 for (auto SelMI : Selects)
6703 for (auto DbgMI : DbgValues)
lib/Target/SystemZ/SystemZLongBranch.cpp 332 for (auto &Terminator : Terminators)
343 for (auto &Block : MBBs) {
444 for (auto &Block : MBBs) {
lib/Target/SystemZ/SystemZRegisterInfo.cpp 64 CopyHints.insert(Hints.begin(), Hints.end());
lib/Target/SystemZ/SystemZTargetMachine.cpp 49 for (auto &Feature : Features) {
lib/Target/WebAssembly/MCTargetDesc/WebAssemblyTargetStreamer.cpp 111 for (auto Pair : Grouped) {
lib/Target/WebAssembly/WebAssemblyAsmPrinter.cpp 209 for (auto &Producer : *Producers.second) {
261 for (auto &F : EmittedFeatures) {
lib/Target/WebAssembly/WebAssemblyCFGSort.cpp 286 for (Entry &E : Entries)
lib/Target/WebAssembly/WebAssemblyCFGStackify.cpp 701 for (auto *MI : ToDelete) {
972 for (auto Range : UnwindDestToTryRanges[nullptr])
1046 for (auto Range : UnwindDestToTryRanges[EHPad])
1108 for (auto Range : TryRanges) {
1203 for (auto *Dest : BrDests)
1332 for (auto MO : Ops) {
lib/Target/WebAssembly/WebAssemblyCallIndirectFixup.cpp 138 for (const MachineOperand &MO : Ops)
lib/Target/WebAssembly/WebAssemblyDebugValueManager.cpp 32 for (auto *DBI : DbgValues)
lib/Target/WebAssembly/WebAssemblyExceptionInfo.cpp 67 for (auto *WE : Exceptions) {
76 for (auto *WE : Exceptions) {
lib/Target/WebAssembly/WebAssemblyFastISel.cpp 879 for (unsigned ArgReg : Args)
lib/Target/WebAssembly/WebAssemblyFixFunctionBitcasts.cpp 276 for (auto &UseFunc : Uses) {
lib/Target/WebAssembly/WebAssemblyFixIrreducibleControlFlow.cpp 337 for (auto Block : SortedEntries)
340 for (auto I = SortedEntries.begin(), E = SortedEntries.end() - 1; I != E;
368 for (auto *Entry : SortedEntries) {
384 for (auto *Entry : SortedEntries) {
394 for (auto *Pred : AllPreds) {
409 for (auto *Pred : AllPreds)
419 for (auto *Pred : AllPreds) {
450 for (auto *Pred : AllPreds) {
lib/Target/WebAssembly/WebAssemblyISelLowering.cpp 668 std::equal(CallerRetTys.begin(), CallerRetTys.end(),
772 make_range(OutVals.begin() + NumFixedArgs, OutVals.end())) {
809 IsVarArg ? OutVals.begin() + NumFixedArgs : OutVals.end());
815 for (const auto &In : Ins) {
942 for (MVT VT : Results)
lib/Target/WebAssembly/WebAssemblyLateEHPrepare.cpp 96 for (auto *Succ : Succs)
201 for (auto *Succ : Succs)
252 for (auto *MI : ToDelete)
270 for (auto *Extract : ExtractInstrs) {
lib/Target/WebAssembly/WebAssemblyLowerEmscriptenEHSjLj.cpp 867 for (Instruction *I : ToErase)
1049 for (Instruction *I : ToErase)
lib/Target/WebAssembly/WebAssemblyMachineFunctionInfo.cpp 37 for (EVT VT : VTs) {
lib/Target/WebAssembly/WebAssemblyRegColoring.cpp 147 for (LiveInterval *OtherLI : Assignments[C])
lib/Target/WebAssembly/WebAssemblyRegStackify.cpp 390 for (unsigned Reg : MutableRegisters)
lib/Target/X86/AsmParser/X86AsmParser.cpp 1342 for (auto &WarningMsg : Warnings) {
3373 for (const auto &Op : Operands) {
lib/Target/X86/MCTargetDesc/X86WinCOFFTargetStreamer.cpp 351 for (RegSaveOffset RO : RegSaveOffsets)
lib/Target/X86/X86AvoidStoreForwardingBlocks.cpp 666 for (auto Disp : DispSizeStack)
686 for (auto LoadStoreInstPair : BlockedLoadsStoresPairs) {
693 for (auto PBInst : PotentialBlockers) {
729 for (auto RemovedInst : ForRemoval) {
lib/Target/X86/X86CallFrameOptimization.cpp 205 for (auto CC : CallSeqVector) {
268 for (auto CC : CallSeqVector) {
475 auto MMI = Context.ArgStoreVector.begin(), MME = Context.ArgStoreVector.end();
lib/Target/X86/X86CallLowering.cpp 408 for (const auto &OrigArg : Info.OrigArgs) {
lib/Target/X86/X86CallingConv.cpp 280 for (auto &It : PendingMembers) {
lib/Target/X86/X86CmovConversion.cpp 185 for (auto &Group : AllCmovGroups) {
230 for (MachineLoop *CurrLoop : Loops) {
246 for (auto &Group : CmovInstGroups)
397 for (auto &Group : CmovInstGroups)
398 CmovInstructions.insert(Group.begin(), Group.end());
531 for (auto &Group : TempGroups) {
533 for (auto *MI : Group) {
606 for (auto *MI : DBGInstructions)
777 for (auto *NewMI : NewMIs) {
lib/Target/X86/X86CondBrFolding.cpp 349 for (auto &I : BranchPath) {
426 for (auto MBBI : RemoveList) {
lib/Target/X86/X86DomainReassignment.cpp 520 for (auto MI : ToErase)
lib/Target/X86/X86FastISel.cpp 3244 for (auto Flag : CLI.OutFlags)
3531 for (auto Reg : OutRegs)
lib/Target/X86/X86FixupSetCC.cpp 158 for (auto &I : ToErase)
lib/Target/X86/X86FlagsCopyLowering.cpp 364 for (MachineInstr *CopyI : Copies) {
684 for (MachineInstr *JmpI : JmpIs) {
lib/Target/X86/X86FloatingPoint.cpp 1715 for (auto *MO : Uses)
lib/Target/X86/X86FrameLowering.cpp 3103 for (auto &Obj : ObjectsToAllocate) {
3154 std::reverse(ObjectsToAllocate.begin(), ObjectsToAllocate.end());
3194 for (WinEHTryBlockMapEntry &TBME : EHInfo.TryBlockMap) {
3195 for (WinEHHandlerType &H : TBME.HandlerArray) {
lib/Target/X86/X86ISelLowering.cpp 2588 for (auto &Reg : RegsToPass) {
3411 for (SDValue Val : LiveGPRs) {
3432 SaveXMMOps.insert(SaveXMMOps.end(), LiveXMMRegs.begin(),
3433 LiveXMMRegs.end());
3474 for (ForwardedRegister &FR : Forwards) {
4073 for (auto const &RegPair : RegsToPass)
5881 for (SDValue &CatOp : CatOps) {
6178 EltBits.append(SubEltBits.begin(), SubEltBits.end());
6237 EltBits.erase(EltBits.begin() + BaseIdx + NumSubElts, EltBits.end());
6330 for (APInt Elt : EltBits)
6707 for (int &M : Mask)
6971 Ops.append(SrcInputs0.begin(), SrcInputs0.end());
6972 Ops.append(SrcInputs1.begin(), SrcInputs1.end());
7019 for (SDValue &SubInput : SubInputs) {
7246 for (int &M : Mask)
7252 for (int &M : Mask)
7263 for (int &M : Mask)
7905 for (auto *LD : Loads)
7990 for (auto *LD : Loads)
8474 for (unsigned Idx : InsertIndices)
13427 array_pod_sort(LoInputs.begin(), LoInputs.end());
13428 LoInputs.erase(std::unique(LoInputs.begin(), LoInputs.end()), LoInputs.end());
13428 LoInputs.erase(std::unique(LoInputs.begin(), LoInputs.end()), LoInputs.end());
13431 array_pod_sort(HiInputs.begin(), HiInputs.end());
13432 HiInputs.erase(std::unique(HiInputs.begin(), HiInputs.end()), HiInputs.end());
13432 HiInputs.erase(std::unique(HiInputs.begin(), HiInputs.end()), HiInputs.end());
14235 array_pod_sort(LoInputs.begin(), LoInputs.end());
14236 LoInputs.erase(std::unique(LoInputs.begin(), LoInputs.end()),
14237 LoInputs.end());
14240 array_pod_sort(HiInputs.begin(), HiInputs.end());
14241 HiInputs.erase(std::unique(HiInputs.begin(), HiInputs.end()),
14242 HiInputs.end());
17073 for (int &M : NewMask)
17132 assert(find(WidenedMask, SM_SentinelZero) != WidenedMask.end() &&
30382 for (unsigned &Reg : AvailableRegs)
30389 for (unsigned MaybeReg : AvailableRegs) {
30963 for (unsigned CSI : MF->getCallSiteLandingPad(Sym)) {
30975 for (auto &LP : CallSiteNumToLPad[CSI]) {
31118 for (auto MBBS : Successors) {
31153 for (auto &LP : MBBLPads)
32661 for (int M : Mask) {
32685 for (int M : Mask) {
32865 for (SDValue &NewInput : WideInputs) {
32880 for (int &M : WideMask) {
33084 for (SDValue OpInput : OpInputs)
33285 for (int &M : Mask)
36496 for (SDNode *Use : BoolExtracts) {
38605 for (APInt &Elt : EltBits) {
40813 ShuffleMask.append(SrcShuffleMask.begin(), SrcShuffleMask.end());
45282 array_pod_sort(AsmPieces.begin(), AsmPieces.end());
45296 array_pod_sort(AsmPieces.begin(), AsmPieces.end());
lib/Target/X86/X86InsertPrefetch.cpp 209 for (auto &PrefInfo : Prefetches) {
lib/Target/X86/X86InstrInfo.cpp 2473 for (const auto &C : Clobbers) {
3822 for (auto &Op : OpsToUpdate) {
5532 for (MachineOperand &BeforeOp : BeforeOps)
5536 for (MachineOperand &AfterOp : AfterOps)
5538 for (MachineOperand &ImpOp : ImpOps) {
lib/Target/X86/X86OptimizeLEAs.cpp 597 while (I1 != List.end()) {
600 while (I2 != List.end()) {
lib/Target/X86/X86SpeculativeLoadHardening.cpp 536 CMovs.append(IndirectBrCMovs.begin(), IndirectBrCMovs.end());
546 for (MachineInstr *CMovI : CMovs)
921 for (auto *NewMI : NewMIs)
926 for (auto *NewMI : NewMIs) {
2033 for (MachineOperand *Op : HardenOpRegs) {
lib/Target/X86/X86WinEHState.cpp 491 Args.append(OptionalArgs.begin(), OptionalArgs.end());
777 for (CallSite CS : SetJmp3CallSites) {
lib/Target/XCore/XCoreFrameLowering.cpp 279 std::reverse(SpillList.begin(), SpillList.end());
lib/Target/XCore/XCoreISelLowering.cpp 1389 ArgDE = ArgData.end();
lib/Target/XCore/XCoreLowerThreadLocal.cpp 132 WUsers.erase(std::unique(WUsers.begin(), WUsers.end()), WUsers.end());
132 WUsers.erase(std::unique(WUsers.begin(), WUsers.end()), WUsers.end());
lib/Testing/Support/Annotations.cpp 76 return {P.begin(), P.end()};
89 return {R.begin(), R.end()};
lib/Transforms/AggressiveInstCombine/TruncInstCombine.cpp 120 for (Value *Operand : Operands)
174 for (auto *Operand : Operands)
189 for (auto *Operand : Operands)
334 if (Entry != Worklist.end()) {
lib/Transforms/CFGuard/CFGuard.cpp 286 for (CallBase *CB : IndirectCalls) {
290 for (CallBase *CB : IndirectCalls) {
lib/Transforms/Coroutines/CoroEarly.cpp 217 for (CoroFreeInst *CF : CoroFrees)
lib/Transforms/Coroutines/CoroElide.cpp 63 for (CoroSubFnInst *I : Users)
120 for (auto *CA : CoroAllocs) {
134 for (auto *CB : CoroBegins) {
212 for (CoroBeginInst *CB : CoroBegins) {
319 for (auto *CII : L->CoroIds)
lib/Transforms/Coroutines/CoroFrame.cpp 194 for (auto *CE : Shape.CoroEnds)
207 for (auto *CSI : Shape.CoroSuspends) {
432 for (auto &S : Spills) {
755 for (auto &P : Allocas) {
768 for (Instruction *I : UsersToUpdate)
779 for (auto &P : Allocas) {
903 for (BasicBlock *Pred : Preds) {
935 for (BasicBlock *BB : WorkList)
1276 for (auto Suspend : Shape.CoroSuspends) {
1281 for (auto End : Shape.CoroEnds) {
1340 for (auto *CSI : Shape.CoroSuspends) {
1347 for (CoroEndInst *CE : Shape.CoroEnds)
1438 for (auto I : DeadInstructions)
lib/Transforms/Coroutines/CoroSplit.cpp 291 for (auto *AnyS : Shape.CoroSuspends) {
478 for (AnyCoroSuspendInst *CS : Shape.CoroSuspends) {
489 for (CoroEndInst *CE : Shape.CoroEnds) {
526 for (CallInst *Op : Shape.SwiftErrorOps) {
707 for (ReturnInst *Return : Returns)
785 for (auto End : Shape.CoroEnds) {
801 for (CoroSizeInst *CS : Shape.CoroSizes) {
960 for (CallInst *Call : Resumes)
1561 for (Function *F : Coroutines) {
lib/Transforms/Coroutines/Coroutines.cpp 179 for (CoroFreeInst *CF : CoroFrees) {
329 for (CoroFrameInst *CF : CoroFrames) {
336 for (AnyCoroSuspendInst *CS : CoroSuspends) {
344 for (CoroEndInst *CE : CoroEnds)
360 for (auto AnySuspend : CoroSuspends) {
394 for (auto AnySuspend : CoroSuspends) {
472 for (CoroFrameInst *CF : CoroFrames) {
484 for (CoroSaveInst *CoroSave : UnusedCoroSaves)
lib/Transforms/IPO/AlwaysInliner.cpp 79 for (Function *F : make_range(NonComdatBegin, InlinedFunctions.end()))
81 InlinedFunctions.erase(NonComdatBegin, InlinedFunctions.end());
88 for (Function *F : InlinedFunctions)
lib/Transforms/IPO/ArgumentPromotion.cpp 146 ArgAttrVec.insert(ArgAttrVec.end(), STy->getNumElements(),
751 for (LoadInst *Load : Loads) {
824 WorkList.insert(WorkList.end(), arg->user_begin(), arg->user_end());
830 WorkList.insert(WorkList.end(), V->user_begin(), V->user_end());
839 for (StoreInst *Store : Stores)
934 for (Argument *PtrArg : PointerArgs) {
lib/Transforms/IPO/Attributor.cpp 889 for (Instruction *RI : OpcodeInstMap[Instruction::Ret])
2387 for (const Instruction *I : NoReturnChanged) {
2468 for (const Attribute &Attr : Attrs)
2688 for (const Attribute &Attr : Attrs)
3780 for (const Attribute &Attr : Attrs) {
4370 for (Instruction *I : OpcodeInstMap[Opcode]) {
4459 Worklist.insert(AllAbstractAttributes.begin(), AllAbstractAttributes.end());
4477 AllAbstractAttributes.end());
4482 for (AbstractAttribute *ChangedAA : ChangedAAs) {
4508 AllAbstractAttributes.end());
4513 Worklist.insert(ChangedAAs.begin(), ChangedAAs.end());
4555 for (AbstractAttribute *AA : AllAbstractAttributes) {
lib/Transforms/IPO/BlockExtractor.cpp 116 for (const auto &Line : Lines) {
129 BlocksByName.push_back({LineSplit[0], {BBNames.begin(), BBNames.end()}});
178 for (const auto &BInfo : BlocksByName) {
194 for (auto &BBs : GroupsOfBlocks) {
196 for (BasicBlock *BB : BBs) {
221 for (Function *F : Functions) {
lib/Transforms/IPO/ConstantMerge.cpp 72 for (const auto &V : MDs)
82 for (auto MD : MDs)
lib/Transforms/IPO/CrossDSOCFI.cpp 87 for (MDNode *Type : Types)
lib/Transforms/IPO/DeadArgumentElimination.cpp 244 for (auto MD : MDs)
605 MaybeLiveAggregateUses.end());
1075 for (auto MD : MDs)
lib/Transforms/IPO/FunctionAttrs.cpp 344 iterator end() { return SyntheticRoot.Uses.end(); }
427 static ChildIteratorType child_end(NodeRef N) { return N->Uses.end(); }
734 for (Argument *Use : Tracker.Uses) {
803 for (ArgumentGraphNode *Use : N->Uses) {
1211 for (auto &ID : InferInSCC) {
lib/Transforms/IPO/GlobalDCE.cpp 177 for (MDNode *Type : Types) {
lib/Transforms/IPO/GlobalOpt.cpp 442 for (auto *GVE : GVs) {
1659 for(auto *GVe : GVs){
1692 for(auto *GV : GVs)
1846 for (auto *L : Loads) {
1904 for (auto *U : Users) {
1908 for (auto *UU : UUsers) {
2505 for (auto ComplexCE : ComplexCEs)
2508 for (auto GVPair : GVs) {
2554 for (auto CEPair : SimpleCEs) {
2616 array_pod_sort(UsedArray.begin(), UsedArray.end(), compareNames);
lib/Transforms/IPO/GlobalSplit.cpp 91 for (MDNode *Type : Types) {
lib/Transforms/IPO/HotColdSplitting.cpp 506 auto RegionEndIt = Blocks.end();
620 for (BasicBlock *BB : SubRegion)
lib/Transforms/IPO/Inliner.cpp 712 for (Value *Ptr : InlineInfo.InlinedCalls)
840 for (Function *F : DeadFunctionsInComdats)
854 array_pod_sort(FunctionsToRemove.begin(), FunctionsToRemove.end());
856 std::unique(FunctionsToRemove.begin(), FunctionsToRemove.end()),
857 FunctionsToRemove.end());
858 for (CallGraphNode *CGN : FunctionsToRemove) {
1121 std::remove_if(Calls.begin() + i + 1, Calls.end(),
1125 Calls.end());
1131 assert(find(DeadFunctions, &Callee) == DeadFunctions.end() &&
1209 for (Function *DeadF : DeadFunctions) {
lib/Transforms/IPO/LowerTypeTests.cpp 158 for (uint64_t &Offset : Offsets) {
173 for (uint64_t Offset : Offsets) {
692 for (MDNode *Type : Types) {
1316 for (StringRef Feature : Features) {
1389 for (const auto &Arg : AsmArgs)
1798 for (auto F : Defs)
1800 for (auto F : Decls)
1970 for (MDNode *Type : Types) {
lib/Transforms/IPO/PartialInlining.cpp 422 for (auto *Block : BlockList) {
510 for (auto *BB : DominateVector)
531 for (auto *BB : DominateVector)
640 for (BasicBlock *E : OutliningInfo->Entries)
654 for (BasicBlock *E : OutliningInfo->Entries) {
709 for (auto *E : OI->Entries) {
893 for (auto FuncBBPair : Cloner.OutlinedFunctions) {
977 for (BasicBlock *BB : OI->Entries) {
980 for (BasicBlock *E : OI->ReturnBlockPreds) {
1002 for (FunctionOutliningMultiRegionInfo::OutlineRegionInfo RegionInfo :
1005 for (BasicBlock *BB : RegionInfo.Region) {
1079 for (BasicBlock *E : ClonedOI->ReturnBlockPreds) {
1094 for (auto *DP : DeadPhis)
1097 for (auto E : ClonedOI->ReturnBlockPreds) {
1106 for (BasicBlock* BB : Region)
1129 for (FunctionOutliningMultiRegionInfo::OutlineRegionInfo RegionInfo :
1186 (std::find(ClonedOI->Entries.begin(), ClonedOI->Entries.end(), BB) !=
1187 ClonedOI->Entries.end());
1249 for (auto FuncBBPair : OutlinedFunctions) {
lib/Transforms/IPO/PassManagerBuilder.cpp 209 for (auto &Ext : *GlobalExtensions) {
lib/Transforms/IPO/SampleProfile.cpp 932 CIS.insert(CIS.begin(), Candidates.begin(), Candidates.end());
935 for (auto I : CIS) {
1188 for (auto *Pred : Predecessors[BB]) {
1200 for (auto *Succ : Successors[BB]) {
1277 for (auto *Pred : Predecessors[BB]) {
1283 for (auto *Succ : Successors[BB]) {
lib/Transforms/IPO/StripSymbols.cpp 321 for (auto *GVE : GVEs)
lib/Transforms/IPO/ThinLTOBitcodeWriter.cpp 125 for (auto MD : MDs) {
335 for (auto Type : Types)
342 for (auto MD : CfiFunctionMDs)
367 for (auto MD : FunctionAliases)
383 for (auto MD : Symvers)
lib/Transforms/IPO/WholeProgramDevirt.cpp 799 for (MDNode *Type : Types) {
1577 for (DevirtCallSite Call : DevirtCalls) {
1589 for (auto Assume : Assumes)
1634 for (Instruction *LoadedPtr : LoadedPtrs) {
1643 for (Instruction *Pred : Preds) {
1669 for (DevirtCallSite Call : DevirtCalls) {
lib/Transforms/InstCombine/InstCombineAndOrXor.cpp 2022 for (auto *Inst : Insts)
lib/Transforms/InstCombine/InstCombineCalls.cpp 510 for (int Idx : ShiftAmts) {
527 for (int Idx : ShiftAmts) {
lib/Transforms/InstCombine/InstCombineLoadStoreAlloca.cpp 274 for (auto P : Path)
488 for (const auto &MDPair : MD) {
lib/Transforms/InstCombine/InstCombinePHI.cpp 1023 array_pod_sort(PHIUsers.begin(), PHIUsers.end());
lib/Transforms/InstCombine/InstCombineVectorOps.cpp 156 for (auto E : Extracts)
2011 for (BitCastInst *BC : BCs) {
lib/Transforms/Instrumentation/AddressSanitizer.cpp 999 for (auto &Ret : RetVec)
1002 for (auto &StackRestoreInst : StackRestoreVec)
2312 for (auto *GV : GVs)
2711 for (auto Inst : ToInstrument) {
2728 for (auto CI : NoReturnCalls) {
2733 for (auto Inst : PointerComparisonsOrSubtracts) {
2963 for (const auto &APC : DynamicAllocaPoisonCallVec) {
2978 for (auto &AI : DynamicAllocaVec)
3003 for (auto *AI : StaticAllocasToMoveUp)
3012 for (AllocaInst *AI : AllocaVec) {
3032 for (auto &Desc : SVD)
3036 for (const auto &APC : StaticAllocaPoisonCallVec) {
3126 for (const auto &Desc : SVD) {
3170 for (const auto &APC : StaticAllocaPoisonCallVec) {
3187 for (auto Ret : RetVec) {
3239 for (auto AI : AllocaVec) AI->eraseFromParent();
lib/Transforms/Instrumentation/BoundsChecking.cpp 199 for (const auto &Entry : TrapInfo) {
lib/Transforms/Instrumentation/ControlHeightReduction.cpp 78 for (StringRef Line : Lines) {
93 for (StringRef Line : Lines) {
222 for (RegInfo &RI : Next->RegInfos)
224 for (CHRScope *Sub : Next->Subs)
231 for (RegInfo &RI : RegInfos)
247 auto BoundaryIt = std::find_if(RegInfos.begin(), RegInfos.end(),
251 if (BoundaryIt == RegInfos.end())
255 TailRegInfos.insert(TailRegInfos.begin(), BoundaryIt, RegInfos.end());
258 for (RegInfo &RI : TailRegInfos)
260 for (auto It = Subs.begin(); It != Subs.end(); ) {
268 assert(std::find_if(RegInfos.begin(), RegInfos.end(),
271 }) != RegInfos.end() &&
716 for (SelectInst *SI : RI.Selects) {
729 for (SelectInst *SI : RI.Selects) {
834 for (auto *SI : Selects)
902 for (SelectInst *SI : Selects) {
906 for (auto it = Selects.begin(); it != Selects.end(); ) {
943 for (SelectInst *SI : Selects) {
946 for (SelectInst *SI : Selects) {
953 Selects.erase(std::remove_if(Selects.begin(), Selects.end(),
956 }), Selects.end());
971 for (auto *SI : Selects) {
983 for (auto *SI : Selects) {
1028 for (CHRScope *Sub : Subscopes) {
1046 for (SelectInst *SI : RI.Selects) {
1124 for (RegInfo &RI : Scope->RegInfos)
1125 for (SelectInst *SI : RI.Selects)
1127 for (CHRScope *Sub : Scope->Subs)
1133 for (CHRScope *Scope : Input) {
1141 for (CHRScope *Scope : Output) {
1166 for (RegInfo &RI : RegInfos) {
1249 for (CHRScope *Sub : Split->Subs) {
1253 NewSubs.insert(NewSubs.end(), SubSplits.begin(), SubSplits.end());
1253 NewSubs.insert(NewSubs.end(), SubSplits.begin(), SubSplits.end());
1278 for (CHRScope *Scope : Scopes) {
1307 for (RegInfo &RI : Scope->RegInfos) {
1317 for (SelectInst *SI : RI.Selects) {
1326 for (CHRScope *Sub : Scope->Subs) {
1341 for (CHRScope *Scope : Input) {
1366 for (CHRScope *Scope : Input) {
1381 for (RegInfo &RI : Scope->CHRRegions) {
1392 for (RegInfo &RI : Scope->RegInfos) {
1393 for (SelectInst *SI : RI.Selects) {
1398 for (RegInfo &RI : Scope->RegInfos) {
1415 for (SelectInst *SI : RI.Selects) {
1432 for (CHRScope *Sub : Scope->Subs)
1501 for (const RegInfo &RI : Scope->CHRRegions) {
1577 for (RegInfo &RI : Scope->RegInfos) {
1586 for (BasicBlock *BB : BlocksInScopeVec) {
1589 for (BasicBlock *BB : BlocksInScopeVec) {
1624 for (Instruction *UI : Users) {
1645 for (SelectInst *SI : RI.Selects)
1651 for (RegInfo &RI : Scope->CHRRegions) {
1663 for (RegInfo &RI : Scope->CHRRegions) {
1678 for (SelectInst *SI : RI.Selects) {
1773 for (RegInfo &RI : Scope->RegInfos)
1849 for (RegInfo &RI : Scope->CHRRegions) {
1855 for (SelectInst *SI : RI.Selects) {
1979 for (CHRScope *Scope : CHRScopes) {
1992 for (CHRScope *Scope : Scopes) {
lib/Transforms/Instrumentation/DataFlowSanitizer.cpp 937 for (BasicBlock *i : BBList) {
1197 for (const Value *Obj : Objs) {
lib/Transforms/Instrumentation/GCOVProfiling.cpp 310 for (auto &I : SortedLinesByFile)
655 for (auto I : ForkAndExecs) {
760 for (auto &Func : Funcs) {
lib/Transforms/Instrumentation/HWAddressSanitizer.cpp 1031 for (auto *LP : LandingPadVec) {
1075 for (auto RI : RetVec) {
1183 for (AllocaInst *AI : AllocasToInstrument) {
1238 for (auto Inst : ToInstrument)
lib/Transforms/Instrumentation/InstrProfiling.cpp 248 for (BasicBlock *ExitBlock : LoopExitBlocks) {
265 for (auto &Cand : LoopToCandidates[&L]) {
352 for (auto *TargetBlock : LoopExitBlocks) {
lib/Transforms/Instrumentation/MemorySanitizer.cpp 1160 for (StoreInst *SI : StoreList) {
1243 for (const auto &ShadowData : InstrumentationList) {
1292 for (PHINode *PN : ShadowPHINodes) {
1307 for (auto Item : LifetimeStartList) {
lib/Transforms/Instrumentation/PGOInstrumentation.cpp 1125 for (auto &E : Edges) {
1707 : Weights) {
1720 std::accumulate(Weights.begin(), Weights.end(), (uint64_t)0,
lib/Transforms/Instrumentation/PGOMemOPSizeOpt.cpp 372 for (uint64_t SizeId : SizeIds) {
lib/Transforms/Instrumentation/SanitizerCoverage.cpp 767 llvm::sort(Initializers.begin() + 2, Initializers.end(),
lib/Transforms/Instrumentation/ThreadSanitizer.cpp 479 for (auto Inst : AllLoadsAndStores) {
486 for (auto Inst : AtomicAccesses) {
491 for (auto Inst : MemIntrinCalls) {
lib/Transforms/ObjCARC/ObjCARCContract.cpp 713 for (Value *PHI : PHIList)
lib/Transforms/ObjCARC/ObjCARCOpts.cpp 627 EquivalentArgs.insert(ArgUsers.begin(), ArgUsers.end());
1646 for (Instruction *NewRetain : NewRetains) {
1718 for (Instruction *NewRelease : NewReleases) {
lib/Transforms/Scalar/ADCE.cpp 494 for (auto *BB : IDFBlocks) {
553 for (Instruction *&I : Worklist) {
lib/Transforms/Scalar/BDCE.cpp 135 for (Instruction *&I : Worklist) {
lib/Transforms/Scalar/ConstantHoisting.cpp 575 for (auto User : ConstCand->Uses) {
663 for (auto &U : CC->Uses) {
830 for (auto const &ConstInfo : ConstInfoVec) {
884 for (auto const &R : ToBeRebased) {
lib/Transforms/Scalar/ConstantProp.cpp 89 for (auto *I : WorkListVec) {
lib/Transforms/Scalar/CorrelatedValuePropagation.cpp 189 for (auto &IncomingConstant : IncomingConstants) {
lib/Transforms/Scalar/DeadStoreElimination.cpp 790 for (const Value *Pointer : Pointers)
803 E = Pointers.end();
lib/Transforms/Scalar/DivRemPairs.cpp 188 for (DivRemPairWorklistEntry &E : Worklist) {
lib/Transforms/Scalar/GVN.cpp 748 for (const AvailableValueInBlock &AV : ValuesPerBlock) {
1035 UnavailableBlocks.end());
1087 for (const AvailableValueInBlock &AV : ValuesPerBlock)
1089 for (BasicBlock *UnavailableBB : UnavailableBlocks)
1150 for (BasicBlock *OrigPred : CriticalEdgePred) {
1226 for (Instruction *I : NewInsts) {
2175 for (auto *I : InstrsToErase) {
2535 DeadBlocks.insert(Dom.begin(), Dom.end());
2538 for (BasicBlock *B : Dom) {
2575 for (BasicBlock *P : Preds) {
lib/Transforms/Scalar/GVNHoist.cpp 642 for (auto It = VCHI.begin(), E = VCHI.end(); It != E;) {
658 It = std::find_if(It, VCHI.end(),
709 auto PHIIt = std::find_if(CHIs.begin(), CHIs.end(),
722 if (valueAnticipable(make_range(Safe.begin(), Safe.end()), TI)) {
725 for (auto B : Safe)
731 PHIIt = std::find_if(PrevIt, CHIs.end(),
793 for (auto IDFB : IDFBlocks) {
1009 for (const HoistingPointInfo &HP : HPL) {
lib/Transforms/Scalar/GVNSink.cpp 159 for (auto II = Insts.begin(); II != Insts.end();) {
174 for (auto *Inst : Insts) {
242 for (auto &P : Ops) {
277 while (BI != Blocks.end()) {
278 assert(VI != Values.end());
669 for (auto *I : NewInsts)
778 for (auto I = Preds.begin(); I != Preds.end();) {
805 : Candidates) dbgs()
854 for (auto *I : Insts)
866 for (auto *I : Insts)
872 for (auto *I : Insts)
878 for (auto *I : Insts)
lib/Transforms/Scalar/GuardWidening.cpp 331 for (auto *II : CurrentList)
347 for (auto *I : EliminatedGuardsAndBranches)
586 for (auto &RC : CombinedChecks) {
704 Checks.erase(remove_if(Checks, IsCurrentCheck), Checks.end());
709 RangeChecksOut.insert(RangeChecksOut.end(), CurrentChecks.begin(),
710 CurrentChecks.end());
739 !std::all_of(std::next(CurrentChecks.begin()), CurrentChecks.end(),
lib/Transforms/Scalar/IndVarSimplify.cpp 596 for (BasicBlock *ExitBB : ExitBlocks) {
705 for (const RewritePhi &Phi : RewritePhiSet) {
757 for (auto *ExitBB : ExitBlocks) {
845 for (const RewritePhi &Phi : RewritePhiSet) {
2665 for (BasicBlock *ExitingBB : ExitingBlocks) {
2709 ExitingBlocks.erase(NewEnd, ExitingBlocks.end());
2750 for (BasicBlock *ExitingBB : ExitingBlocks) {
2939 for (BasicBlock *ExitingBB : ExitingBlocks) {
3039 for (BasicBlock *ExitingBB : ExitingBlocks) {
lib/Transforms/Scalar/InductiveRangeCheckElimination.cpp 1812 for (InductiveRangeCheck &IRC : RangeChecks)
1845 for (InductiveRangeCheck &IRC : RangeChecks) {
1883 for (InductiveRangeCheck &IRC : RangeChecksToEliminate) {
lib/Transforms/Scalar/InferAddressSpaces.cpp 295 for (int Idx : OpIndexes) {
402 for (Value *PtrOperand : getPointerOperands(*TopVal)) {
732 for (Value *PtrOperand : getPointerOperands(V)) {
893 for (const Use *UndefUse : UndefUsesToFix) {
1023 for (Instruction *I : DeadInstructions)
lib/Transforms/Scalar/JumpThreading.cpp 564 for (const auto &Edge : Edges)
680 for (auto &R : Result)
713 for (const auto &LHSVal : LHSVals)
718 for (const auto &RHSVal : RHSVals)
739 for (auto &R : Result)
755 for (const auto &LHSVal : LHSVals) {
900 for (const auto &LHSVal : LHSVals) {
920 for (auto &C : Conds) {
1447 for (const auto &AvailablePred : AvailablePreds)
1486 array_pod_sort(AvailablePreds.begin(), AvailablePreds.end());
1502 assert(I != AvailablePreds.end() && I->first == P &&
1517 for (LoadInst *PredLoadI : CSELoads) {
1608 for (const auto &PredValue : PredValues) {
1626 for (const auto &PredValue : PredValues) {
1742 for (const auto &PredToDest : PredToDestList)
1849 for (const auto &XorOpValue : XorOpValues) {
1869 for (const auto &XorOpValue : XorOpValues) {
2127 for (auto NewBB : NewBBs) {
2192 *std::max_element(BBSuccFreq.begin(), BBSuccFreq.end());
2199 for (uint64_t Freq : BBSuccFreq)
2204 BBSuccProbs.end());
2247 for (auto Prob : BBSuccProbs)
lib/Transforms/Scalar/LICM.cpp 420 for (BasicBlock *ExitBlock : ExitBlocks) {
1498 ExitBlocks.end());
1631 ExitBlocks.end());
2186 for (Loop *InnerL : RecomputeLoops)
lib/Transforms/Scalar/LoopDataPrefetch.cpp 286 for (const auto &PrefLoad : PrefLoads) {
lib/Transforms/Scalar/LoopDistribute.cpp 519 for (Instruction *Inst : Instructions) {
739 for (auto *Inst : DefsUsedOutside)
990 for (Loop *L : Worklist) {
lib/Transforms/Scalar/LoopFuse.cpp 473 iterator end() { return LoopsOnLevel.end(); }
622 for (auto &CurrCandSet : FusionCandidates) {
700 for (auto &CandidateSet : FusionCandidates) {
1229 for (PHINode *LCPHI : OriginalFC0PHIs) {
1277 for (BasicBlock *BB : Blocks) {
1471 for (PHINode *LCPHI : OriginalFC0PHIs) {
1530 for (BasicBlock *BB : Blocks) {
lib/Transforms/Scalar/LoopIdiomRecognize.cpp 639 for (auto &SI : StoreRefsForMemcpy)
710 for (auto &k : IndexQueue) {
1996 for (const BasicBlock *ExitBB : ExitBlocks) {
2343 for (const Loop::Edge &Edge : LoopExitEdges) {
lib/Transforms/Scalar/LoopInterchange.cpp 114 for (I = MemInstr.begin(), IE = MemInstr.end(); I != IE; ++I) {
115 for (J = I, JE = MemInstr.end(); J != JE; ++J) {
466 for (Loop *L : LoopList) {
1200 for (BasicBlock *BB : OrigInnerBBs) {
1388 for (PHINode *P : LcssaInnerExit)
1393 for (PHINode *P : LcssaInnerLatch)
1541 for (PHINode *PHI : OuterLoopPHIs) {
1546 for (PHINode *PHI : InnerLoopPHIs) {
lib/Transforms/Scalar/LoopLoadElimination.cpp 573 for (const auto &Cand : Candidates)
617 for (Loop *L : Worklist) {
lib/Transforms/Scalar/LoopPredication.cpp 942 for (const auto &ExitEdge : ExitEdges) {
1013 for (auto *Guard : Guards)
1015 for (auto *Guard : GuardsAsWidenableBranches)
lib/Transforms/Scalar/LoopRerollPass.cpp 245 iterator end() { return Instructions.end(); }
960 RootSets.append(PotentialRootSets.begin(), PotentialRootSets.end());
986 for (auto &V : RootSets) {
1018 for (auto &DRS : RootSets) {
1019 Exclude.insert(DRS.Roots.begin(), DRS.Roots.end());
1023 Exclude.insert(LoopIncs.begin(), LoopIncs.end());
1025 for (auto &DRS : RootSets) {
1033 for (auto *Root : DRS.Roots) {
1058 for (auto &DRS : RootSets) {
1059 Exclude.insert(DRS.Roots.begin(), DRS.Roots.end());
1088 for (auto &DRS : RootSets) {
1096 for (auto &DRS : RootSets) {
1363 for (auto &DRS : RootSets) {
1427 for (auto &DRS : RootSets) {
1566 for (Instruction *User : Users)
1687 for (Instruction *PossibleIV : PossibleIVs)
lib/Transforms/Scalar/LoopSimplifyCFG.cpp 265 for (auto *ExitBlock : ExitBlocks)
364 for (BasicBlock *BB : DeadExitBlocks) {
370 for (Instruction *PN : DeadPhis) {
432 DeadLoopBlocks.end());
442 for (auto *BB : DeadLoopBlocks)
456 for (auto *BB : DeadLoopBlocks) {
467 for (auto *BB : DeadLoopBlocks)
476 for (BasicBlock *BB : FoldCandidates) {
649 for (auto &Block : Blocks) {
lib/Transforms/Scalar/LoopStrengthReduce.cpp 254 iterator end() { return RegSequence.end(); }
429 for (const SCEV *S : MyGood)
431 for (const SCEV *S : MyBad)
515 auto I = find_if(make_range(BaseRegs.begin(), BaseRegs.end()),
520 if (I != BaseRegs.end())
1578 for (const Formula &F : Formulae) {
2385 for (BasicBlock *ExitingBlock : ExitingBlocks) {
2628 for (const Formula &F : LU.Formulae) {
2994 IVChain::const_iterator IncEnd = Chain.Incs.end();
3589 JE = AddOps.end();
3693 for (const SCEV *BaseReg : Base.BaseRegs) {
3879 for (const SCEV *BaseReg : Base.BaseRegs)
4047 for (const SCEV *&BaseReg : F.BaseRegs) {
4123 for (const SCEV *Reg : Sequence) {
4184 for (const WorkItem &WI : WorkItems) {
4251 for (const SCEV *NewReg : NewF.BaseRegs)
4356 for (const SCEV *Reg : F.BaseRegs) {
4413 for (const LSRUse &LU : Uses) {
4446 I = F.BaseRegs.begin(), E = F.BaseRegs.end(); I != E; ++I) {
4506 for (const Formula &F : LU.Formulae) {
4523 for (LSRFixup &Fixup : LU.Fixups) {
4613 for (const SCEV *Reg : FA.BaseRegs) {
4618 for (const SCEV *Reg : FB.BaseRegs) {
4735 for (const LSRUse &LU : Uses) {
4766 for (const SCEV *BaseReg : F.BaseRegs) {
4804 UniqRegs.insert(F.BaseRegs.begin(), F.BaseRegs.end());
5383 for (LSRFixup &Fixup : Uses[LUIdx].Fixups)
5472 for (const IVChain &Chain : IVChainVec) {
5479 for (const LSRFixup &Fixup : Uses[LUIdx].Fixups) {
5484 for (const IVChain &Chain : IVChainVec) {
5598 for (const LSRUse &LU : Uses) {
5632 for (const LSRUse &LU : Uses)
5642 for (const LSRUse &LU : Uses) {
lib/Transforms/Scalar/LoopUnrollPass.cpp 456 CostWorklist.append(PHIUsedList.begin(), PHIUsedList.end());
1403 Worklist.append(PreOrderLoops.begin(), PreOrderLoops.end());
lib/Transforms/Scalar/LoopUnswitch.cpp 697 for (IntrinsicInst *Guard : Guards) {
1273 LoopBlocks.insert(LoopBlocks.end(), ExitBlocks.begin(), ExitBlocks.end());
lib/Transforms/Scalar/LowerConstantIntrinsics.cpp 106 for (WeakTrackingVH &VH: Worklist) {
lib/Transforms/Scalar/LowerGuardIntrinsic.cpp 62 for (auto *CI : ToLower) {
lib/Transforms/Scalar/LowerWidenableCondition.cpp 59 for (auto *CI : ToLower) {
lib/Transforms/Scalar/MakeGuardsExplicit.cpp 99 for (auto *Guard : GuardIntrinsics)
lib/Transforms/Scalar/MemCpyOptimizer.cpp 203 if (I == Ranges.end() || End < I->Start) {
239 while (++NextI != Ranges.end() && End >= NextI->Start) {
241 I->TheStores.append(NextI->TheStores.begin(), NextI->TheStores.end());
lib/Transforms/Scalar/NewGVN.cpp 2720 for (auto *Op : Ops) {
2834 for (auto PHIOp : PHIOps)
2839 for (auto PHIOp : PHIOps) {
2935 for (auto *I : TempInst) {
3935 for (auto &VD : DFSOrderedSet) {
4102 for (auto &VD : PossibleDeadStores) {
lib/Transforms/Scalar/PlaceSafepoints.cpp 315 for (BasicBlock *Pred : LoopLatches) {
587 for (Instruction *PollLocation : PollsNeeded) {
lib/Transforms/Scalar/Reassociate.cpp 1515 Ops.insert(Ops.end(), ValueEntry(getRank(V), V));
1777 Factors.erase(std::unique(Factors.begin(), Factors.end(),
1781 Factors.end());
1902 for (auto Op : Ops)
2011 for (Instruction *Negatible : Candidates) {
lib/Transforms/Scalar/RewriteStatepointsForGC.cpp 1779 for (auto *AI : ToClobber) {
1821 auto Last = std::unique(Uses.begin(), Uses.end());
1822 Uses.erase(Last, Uses.end());
1824 for (Instruction *Use : Uses) {
1885 Vec.end());
1962 for (Instruction *Instr : Chain) {
2086 std::reverse(ChainToBase.begin(), ChainToBase.end());
2095 for (Instruction *Instr: ChainToBase) {
2166 for (auto LiveValue: LiveValuesToBeDeleted) {
2177 Uniqued.insert(ToUpdate.begin(), ToUpdate.end());
2180 for (CallBase *Call : ToUpdate)
2188 for (CallBase *Call : ToUpdate) {
2204 for (CallBase *Call : ToUpdate) {
2266 for (auto &Info : Records) {
2286 for (auto &Info : Records)
2291 for (CallInst *CI : Holders)
2323 for (auto &Info : Records) {
2347 Live.insert(Live.end(), Statepoint.gc_args_begin(),
2372 for (auto *Ptr : Live)
2484 for (auto *II : InvariantStartInstructions) {
lib/Transforms/Scalar/SCCP.cpp 1121 auto Indices = makeArrayRef(Operands.begin() + 1, Operands.end());
2113 for (BasicBlock *BB : BlocksToErase) {
2126 for (BasicBlock *DeadBB : BlocksToErase) {
lib/Transforms/Scalar/SROA.cpp 248 iterator end() { return Slices.end(); }
269 llvm::sort(SliceI, Slices.end());
270 std::inplace_merge(Slices.begin(), SliceI, Slices.end());
477 P.SplitTails.end());
1069 Slices.end());
1075 std::shuffle(Slices.begin(), Slices.end(), MT);
1455 Indices.erase(Indices.end() - NumLayers, Indices.end());
1455 Indices.erase(Indices.end() - NumLayers, Indices.end());
1932 CandidateTys.end());
1952 std::unique(CandidateTys.begin(), CandidateTys.end(), RankVectorTypes),
1953 CandidateTys.end());
1958 for (VectorType *VTy : CandidateTys) {
1990 for (VectorType *VTy : CandidateTys)
3789 Stores.end());
3800 Stores.end());
3807 Loads.end());
3836 for (LoadInst *LI : Loads) {
3960 for (StoreInst *SI : Stores) {
4359 for (auto Fragment : Fragments) {
lib/Transforms/Scalar/Scalarizer.cpp 406 for (const auto &MD : MDs)
829 for (const auto &GMI : Gathered) {
lib/Transforms/Scalar/SeparateConstOffsetFromGEP.cpp 637 for (User *I : UserChain) {
lib/Transforms/Scalar/SimpleLoopUnswitch.cpp 275 for (auto *ExitBB : Exits)
1066 for (auto *ClonedBB : NewBlocks)
1125 for (auto *ClonedBB : NewBlocks) {
1467 DeadBlocks.end());
1472 for (BasicBlock *BB : DeadBlocks)
1475 for (BasicBlock *BB : DeadBlocks)
1490 ExitBlocks.end());
1974 for (auto *ExitBB : ExitBlocks) {
2085 for (auto &VMap : VMaps)
2150 for (auto &VMap : VMaps)
2170 for (std::unique_ptr<ValueToValueMapTy> &VMap : VMaps)
2609 for (auto *ExitBB : ExitBlocks)
2729 for (auto &TerminatorAndInvariants : UnswitchCandidates) {
lib/Transforms/Scalar/SpeculateAroundPHIs.cpp 141 for (auto &StackPair : DFSStack) {
626 for (auto *OrigI : SpecList)
647 for (auto *PredBB : SpecPreds)
657 for (auto *OrigI : SpecList) {
761 PNs.end());
lib/Transforms/Scalar/StructurizeCFG.cpp 380 std::reverse(Order.begin(), Order.end());
541 for (BranchInst *Term : Conds) {
lib/Transforms/Scalar/TailRecursionElimination.cpp 309 for (CallInst *CI : DeferredTails) {
800 for (PHINode *PN : ArgumentPHIs) {
lib/Transforms/Scalar/WarnMissedTransforms.cpp 86 for (auto *L : LI->getLoopsInPreorder())
lib/Transforms/Utils/BasicBlockUtils.cpp 282 for (auto Incoming : IncomingValues) {
288 for (auto &DVI : DbgValues) {
725 for (BasicBlock *NewBB2Pred : NewBB2Preds)
lib/Transforms/Utils/BreakCriticalEdges.cpp 411 for (BasicBlock *Pred : OtherPreds) {
lib/Transforms/Utils/BuildLibCalls.cpp 968 Args.insert(Args.end(), VariadicArgs.begin(), VariadicArgs.end());
978 Args.insert(Args.end(), VariadicArgs.begin(), VariadicArgs.end());
lib/Transforms/Utils/CallPromotionUtils.cpp 115 for (User *U : UsersToUpdate)
185 for (User *U : UsersToUpdate)
lib/Transforms/Utils/CloneFunction.cpp 145 for (auto MD : MDs) {
782 for (Loop *CurLoop : OrigLoop->getLoopsInPreorder()) {
lib/Transforms/Utils/CloneModule.cpp 134 for (auto MD : MDs)
lib/Transforms/Utils/CodeExtractor.cpp 724 for (BasicBlock *PredBB : Preds)
735 for (unsigned i : IncomingVals)
758 for (DomTreeNode *I : Children)
1142 for (unsigned SwiftErrArgNo : SwiftErrorArgs) {
1587 for (DbgVariableIntrinsic *DVI : DbgUsers)
lib/Transforms/Utils/ImportedFunctionsInliningStatistics.cpp 178 for (auto *const InlinedFunctionNode : GraphNode.InlinedCallees) {
lib/Transforms/Utils/InlineFunction.cpp 665 for (Value *V : UnwindDestPHIValues) {
1037 for (const Value *V : PtrArgs) {
1041 for (const Value *O : Objects)
1090 for (const Argument *A : NoAliasArgs) {
1125 for (const Argument *A : NoAliasArgs) {
1728 for (std::pair<Value*, Value*> &Init : ByValInit)
1859 for (auto &AI : IFI.StaticAllocas)
1905 ArgAttrs.append(VarArgsAttrs.begin(), VarArgsAttrs.end());
1910 Params.append(VarArgsToForward.begin(), VarArgsToForward.end());
1993 for (ReturnInst *RI : Returns) {
2021 for (ReturnInst *RI : Returns) {
2122 Returns.erase(NewEnd, Returns.end());
2129 for (ReturnInst *RI : Returns) {
2181 for (ReturnInst *RI : Returns) {
lib/Transforms/Utils/LCSSA.cpp 184 for (Use *UseToRewrite : UsesToRewrite) {
222 for (auto DVI : DbgValues) {
237 for (PHINode *InsertedPN : InsertedPHIs) {
245 for (auto *PostProcessPN : PostProcessPHIs)
253 for (PHINode *PN : AddedPHIs)
282 for (BasicBlock *BB : ExitBlocks)
lib/Transforms/Utils/LibCallsShrinkWrap.cpp 80 for (auto &CI : WorkList) {
lib/Transforms/Utils/Local.cpp 492 for (auto *DII : DbgUsers) {
1239 for (auto *DVI : DbgValues) {
1402 for (auto &I : Dbgs) {
1469 for (auto PHI : InsertedPHIs) {
1747 for (auto *DII : Users) {
1764 for (auto *DII : Users) {
2287 for (const auto &MD : Metadata) {
2382 for (const auto &MDPair : MD) {
2587 for (auto *DII : DbgUsers)
2739 P.erase(std::prev(P.end(), BitShift), P.end());
2739 P.erase(std::prev(P.end(), BitShift), P.end());
2743 P.insert(P.end(), BitShift, BitPart::Unset);
lib/Transforms/Utils/LoopRotationUtils.cpp 148 for (auto &DbgValue : DbgValues) {
466 for (BasicBlock *ExitPred : ExitPreds) {
lib/Transforms/Utils/LoopSimplify.cpp 519 for (BasicBlock *ExitingBlock : ExitingBlocks)
614 for (auto *ExitingBB : ExitingBlocks)
lib/Transforms/Utils/LoopUnroll.cpp 865 for (auto *ChildBB : ChildrenToUpdate)
lib/Transforms/Utils/LoopUnrollAndJam.cpp 617 for (Value *I : Earlier) {
618 for (Value *J : Later) {
lib/Transforms/Utils/LoopUnrollPeel.cpp 554 for (auto Edge : ExitEdges)
614 for (auto Edge : ExitEdges) {
lib/Transforms/Utils/LoopUnrollRuntime.cpp 801 for (auto *BB : OtherExits) {
857 for (auto *BB : ChildrenToUpdate)
lib/Transforms/Utils/LoopUtils.cpp 647 for (auto *DVI : DeadDebugInst)
837 std::fill(&ShuffleMask[i / 2], ShuffleMask.end(),
lib/Transforms/Utils/LoopVersioning.cpp 146 for (User *U : UsersToUpdate)
199 for (const auto &Check : AliasChecks)
281 for (Loop *L : Worklist) {
lib/Transforms/Utils/LowerMemIntrinsics.cpp 104 for (auto OpTy : RemainingOps) {
lib/Transforms/Utils/ModuleUtils.cpp 195 for (Function *F : DeadComdatFunctions) {
lib/Transforms/Utils/PredicateInfo.cpp 368 for (auto Cond : ConditionsToProcess) {
372 for (auto *Op : CmpOperands) {
401 for (auto *Succ : SuccsToProcess) {
439 for (auto Cond : ConditionsToProcess) {
443 for (auto *Op : CmpOperands)
545 for (auto RenameIter = RenameStack.end() - Start;
546 RenameIter != RenameStack.end(); ++RenameIter) {
603 for (auto *Op : OpsToRename) {
668 for (auto &VD : OrderedUses) {
lib/Transforms/Utils/PromoteMemoryToRegister.cpp 605 Info.DefiningBlocks.end());
625 for (BasicBlock *BB : PHIBlocks)
671 for (auto &Declares : AllocaDbgDeclares)
744 assert(EntIt != Preds.end() && *EntIt == SomePHI->getIncomingBlock(i) &&
760 for (BasicBlock *Pred : Preds)
781 Info.UsingBlocks.end());
lib/Transforms/Utils/SSAUpdater.cpp 153 PredValues.end());
165 for (const auto &PredValue : PredValues)
448 for (LoadInst *ALoad : LiveInLoads) {
lib/Transforms/Utils/SSAUpdaterBulk.cpp 130 for (auto &R : Rewrites) {
146 for (Use *U : R.Uses)
158 for (auto *FrontierBB : IDFBlocks) {
168 for (auto *PN : InsertedPHIsForVar) {
176 for (Use *U : R.Uses) {
lib/Transforms/Utils/SimplifyCFG.cpp 1165 for (BasicBlock *NewSuccessor : NewSuccessors)
1186 SmallVector<uint32_t, 8> MDWeights(Weights.begin(), Weights.end());
1596 for (auto *I : Insts)
1608 for (auto *I : Insts)
1632 for (auto *I : Insts)
1682 for (auto *&Inst : Insts) {
1783 for (auto *V : PHIOperands[I])
2141 for (Instruction *I : SpeculatedDbgIntrinsics)
2808 NewWeights.end());
3722 array_pod_sort(Values.begin(), Values.end(), ConstantIntSortPredicate);
3723 Values.erase(std::unique(Values.begin(), Values.end()), Values.end());
3723 Values.erase(std::unique(Values.begin(), Values.end()), Values.end());
4286 for (BasicBlock *EHPred : EHPreds)
4316 array_pod_sort(Cases.begin(), Cases.end(), ConstantIntSortPredicate);
4500 for (ConstantInt *DeadCase : DeadCases) {
4595 for (int Index : Indexes)
4752 for (auto &I : UniqueResults) {
5346 for (const auto &I : Results) {
5356 for (PHINode *PHI : PHIs) {
5381 for (const auto &I : DefaultResultsList) {
5479 for (PHINode *PHI : PHIs) {
5577 for (auto &V : Values)
5594 for (auto &V : Values)
5598 for (auto &V : Values)
lib/Transforms/Utils/SimplifyIndVar.cpp 472 for (auto *EVI : ToDelete)
578 for (auto *ICI : ICmpUsers) {
lib/Transforms/Utils/SimplifyLibCalls.cpp 2148 for (CallInst *C : Calls)
lib/Transforms/Utils/SplitModule.cpp 190 for (auto &I : Sets) {
lib/Transforms/Utils/StripGCRelocates.cpp 55 for (GCRelocateInst *GCRel : GCRelocates) {
lib/Transforms/Utils/ValueMapper.cpp 681 for (MDNode *N : POT) {
700 for (auto *N : G.POT) {
731 for (auto *N : CyclicNodes)
762 for (const MDNode *N : G.POT)
880 for (const auto &MI : MDs) {
931 for (const auto &I : MDs)
lib/Transforms/Vectorize/LoadStoreVectorizer.cpp 579 for (Instruction *I : Instrs)
655 for (Instruction *MemInstr : MemoryInstrs) {
901 for (int Head : Heads) {
1226 for (auto I : InstrsToErase)
lib/Transforms/Vectorize/LoopVectorizationPlanner.h 245 for (const auto &Plan : VPlans)
lib/Transforms/Vectorize/LoopVectorize.cpp 3033 for (BasicBlock *BB : LoopBypassBlocks)
3240 for (Type *ScalarTy : ScalarTys)
3450 for (Instruction *PI : PredicatedInstructions)
3895 Worklist.insert(InstsToReanalyze.begin(), InstsToReanalyze.end());
3929 for (PHINode *OrigPhi : OrigPHIsToFix) {
5396 for (Instruction *ToRemove : List)
lib/Transforms/Vectorize/SLPVectorizer.cpp 1779 for (ScheduleData *MemoryDepSD : BundleMember->MemoryDependencies) {
2011 return {N->UserTreeIndices.end(), N->Container};
2035 return nodes_iterator(R->VectorizableTree.end());
2114 for (auto &TEPtr : VectorizableTree) {
2373 for (unsigned Idx : CurrentOrder)
2972 for (unsigned I : E->ReuseShuffleIndices) {
3233 for (unsigned Idx : E->ReuseShuffleIndices) {
3446 std::next(VectorizableTree.begin(), I + 1), VectorizableTree.end(),
3461 for (ExternalUser &EU : ExternalUses) {
3559 assert(llvm::all_of(make_range(E->Scalars.begin(), E->Scalars.end()),
3600 SmallPtrSet<Value *, 16> Bundle(E->Scalars.begin(), E->Scalars.end());
3664 for(unsigned Idx : E->ReuseShuffleIndices)
4277 for (const auto &ExternalUse : ExternalUses) {
4356 for (auto &TEPtr : VectorizableTree) {
4443 for (auto I = CSEWorkList.begin(), E = CSEWorkList.end(); I != E; ++I) {
4457 for (Instruction *v : Visited) {
5071 SmallPtrSet<Value *, 32> Expr(TreeRoot.begin(), TreeRoot.end());
5072 for (auto &EU : ExternalUses)
5081 for (auto &EntryPtr : VectorizableTree)
5082 Expr.insert(EntryPtr->Scalars.begin(), EntryPtr->Scalars.end());
5086 for (auto *Root : TreeRoot)
5095 for (auto *Root : TreeRoot)
5106 for (auto *Root : TreeRoot) {
5142 for (auto *Scalar : ToDemote) {
5183 for (auto *Scalar : ToDemote)
5450 VectorizedStores.insert(Operands.begin(), Operands.end());
6407 for (auto &V : ReductionOps)
6408 IgnoreList.append(V.begin(), V.end());
6487 for (auto *I : Pair.second) {
6645 std::reverse(BuildVectorOpds.begin(), BuildVectorOpds.end());
6663 std::reverse(BuildVectorOpds.begin(), BuildVectorOpds.end());
6912 E = Incoming.end();
lib/Transforms/Vectorize/VPlan.cpp 109 for (VPBlockBase *Block : Blocks)
415 for (auto VPBB : State->CFG.VPBBsToFix) {
lib/Transforms/Vectorize/VPlan.h 372 auto Pos = std::find(Predecessors.begin(), Predecessors.end(), Predecessor);
379 auto Pos = std::find(Successors.begin(), Successors.end(), Successor);
1198 for (VPValue *CBV : VPCBVs)
1350 return N->getSuccessors().end();
1382 return N->getPredecessors().end();
1544 for (VPBlockBase *SuccBlock : PredBlock->getSuccessors()) {
lib/Transforms/Vectorize/VPlanHCFGBuilder.cpp 94 for (auto *Phi : PhisToFix) {
lib/Transforms/Vectorize/VPlanPredicator.cpp 120 for (VPBlockBase *SuccBlock : FromBlock->getSuccessors()) {
154 for (VPBlockBase *PredBlock : CurrBlock->getPredecessors()) {
lib/Transforms/Vectorize/VPlanSLP.cpp 275 for (auto *Candidate : BestCandidates) {
307 for (auto &Operands : MultiNodeOps) {
320 for (auto Ops : MultiNodeOps) {
398 for (auto &Operands : getOperands(Values)) {
425 for (auto &Ops : FinalOrder) {
442 for (auto &Operands : getOperands(Values))
lib/Transforms/Vectorize/VPlanValue.h 102 user_iterator user_end() { return Users.end(); }
176 operand_iterator op_end() { return Operands.end(); }
lib/XRay/Profile.cpp 157 if (RootIt == Roots.end()) {
tools/bugpoint/CrashDebugger.cpp 385 for (auto *BB : BBs) {
407 for (auto *BB : Unreachable) {
413 for (auto *BB : Unreachable)
tools/clang/include/clang/AST/DeclBase.h 517 Vec.erase(std::remove_if(Vec.begin(), Vec.end(), isa<T, Attr*>), Vec.end());
517 Vec.erase(std::remove_if(Vec.begin(), Vec.end(), isa<T, Attr*>), Vec.end());
tools/clang/include/clang/AST/DeclContextInternals.h 117 assert(I != Vec.end() && "list does not contain decl");
120 assert(llvm::find(Vec, D) == Vec.end() && "list still contains decl");
133 Vec.erase(std::remove_if(Vec.begin(), Vec.end(),
135 Vec.end());
175 for (DeclsTy::iterator OD = Vec.begin(), ODEnd = Vec.end();
220 while (I != Vec.end() &&
tools/clang/include/clang/AST/ExternalASTSource.h 558 return Self->Loaded.end()[this->I];
587 Loaded.erase(&*From, Loaded.end());
tools/clang/include/clang/AST/LexicallyOrderedRecursiveASTVisitor.h 150 for (Decl *D : LexicallyNestedDeclarations) {
tools/clang/include/clang/AST/OpenMPClause.h 4499 for (auto C : CL) {
tools/clang/include/clang/AST/RecursiveASTVisitor.h 657 std::reverse(LocalQueue.begin() + N, LocalQueue.end());
tools/clang/include/clang/AST/StmtOpenMP.h 270 CaptureRegions.begin(), CaptureRegions.end(),
274 for (auto ThisCaptureRegion : CaptureRegions) {
tools/clang/include/clang/AST/UnresolvedSet.h 83 iterator end() { return iterator(decls().end()); }
100 for (DeclsTy::iterator I = decls().begin(), E = decls().end(); I != E; ++I)
tools/clang/include/clang/ASTMatchers/ASTMatchersInternal.h 229 for (BoundNodesMap &Binding : Bindings)
243 Bindings.erase(std::remove_if(Bindings.begin(), Bindings.end(), Predicate),
244 Bindings.end());
tools/clang/include/clang/Analysis/Analyses/Dominators.h 207 Ret.erase(std::remove(Ret.begin(), Ret.end(), nullptr), Ret.end());
207 Ret.erase(std::remove(Ret.begin(), Ret.end(), nullptr), Ret.end());
297 Ret.erase(std::remove(Ret.begin(), Ret.end(), nullptr), Ret.end());
297 Ret.erase(std::remove(Ret.begin(), Ret.end(), nullptr), Ret.end());
312 Ret.erase(std::remove(Ret.begin(), Ret.end(), nullptr), Ret.end());
312 Ret.erase(std::remove(Ret.begin(), Ret.end(), nullptr), Ret.end());
327 Ret.erase(std::remove(Ret.begin(), Ret.end(), nullptr), Ret.end());
327 Ret.erase(std::remove(Ret.begin(), Ret.end(), nullptr), Ret.end());
342 Ret.erase(std::remove(Ret.begin(), Ret.end(), nullptr), Ret.end());
342 Ret.erase(std::remove(Ret.begin(), Ret.end(), nullptr), Ret.end());
tools/clang/include/clang/Analysis/Analyses/ThreadSafetyCommon.h 197 for (auto *Blk : BackEdges)
243 for (auto *Blk : ForwardEdges)
tools/clang/include/clang/Analysis/CallGraph.h 163 iterator end() { return CalledFunctions.end(); }
tools/clang/include/clang/Analysis/CloneDetection.h 213 for (const auto &C : Sequences) {
tools/clang/include/clang/Basic/PartialDiagnostic.h 307 for (const CharSourceRange &Range : DiagStorage->DiagRanges)
311 for (const FixItHint &Fix : DiagStorage->FixItHints)
tools/clang/include/clang/Driver/Action.h 150 input_iterator input_end() { return Inputs.end(); }
tools/clang/include/clang/Driver/Job.h 197 iterator end() { return Jobs.end(); }
tools/clang/include/clang/Frontend/ASTUnit.h 602 return StoredDiagnostics.end();
tools/clang/include/clang/Parse/RAIIObjectsForParser.h 457 E = Container.end();
tools/clang/include/clang/Sema/CXXFieldCollector.h 68 FieldDecl **getCurFields() { return &*(Fields.end() - getCurNumFields()); }
tools/clang/include/clang/Sema/DelayedDiagnostic.h 292 i = Diagnostics.begin(), e = Diagnostics.end(); i != e; ++i)
tools/clang/include/clang/Sema/IdentifierResolver.h 48 DeclsTy::iterator decls_end() { return Decls.end(); }
tools/clang/include/clang/Sema/Overload.h 449 iterator end() { return conversions().end(); }
1031 iterator end() { return Candidates.end(); }
tools/clang/include/clang/Sema/Scope.h 469 UsingDirectives.end());
tools/clang/include/clang/Sema/ScopeInfo.h 990 PotentiallyCapturingExprs.end(), E),
991 PotentiallyCapturingExprs.end());
tools/clang/include/clang/Sema/SemaInternal.h 255 Inner(!IsAtEnd ? Outer->second.begin() : OuterBack->second.end()) {
261 if (Inner == Outer->second.end() && Outer != OuterBack) {
tools/clang/include/clang/Sema/Template.h 524 return OutOfLinePartialSpecs.end();
528 return OutOfLineVarPartialSpecs.end();
tools/clang/include/clang/Sema/TemplateDeduction.h 330 iterator end() { return Candidates.end(); }
tools/clang/include/clang/Sema/TypoCorrection.h 233 return isKeyword() ? CorrectionDecls.end() : CorrectionDecls.begin();
236 decl_iterator end() { return CorrectionDecls.end(); }
tools/clang/include/clang/Serialization/ASTReader.h 1255 for (auto ID : It->second)
tools/clang/include/clang/Serialization/ASTWriter.h 768 for (unsigned I : OffsetIndices) {
tools/clang/include/clang/Serialization/ContinuousRangeMap.h 77 if (I != Rep.end() && I->first == Val.first) {
89 iterator end() { return Rep.end(); }
98 return Rep.end();
121 std::unique(Self.Rep.begin(), Self.Rep.end(),
tools/clang/include/clang/Serialization/ModuleManager.h 151 ModuleIterator end() { return Chain.end(); }
tools/clang/include/clang/StaticAnalyzer/Core/BugReporter/BugReporter.h 501 visitor_iterator visitor_end() { return Callbacks.end(); }
tools/clang/lib/ARCMigrate/ObjCMT.cpp 2258 EI = Entries.begin(), EE = Entries.end(); EI != EE; ++EI) {
tools/clang/lib/ARCMigrate/PlistReporter.cpp 74 for (FileID FID : Fids)
tools/clang/lib/ARCMigrate/TransAutoreleasePool.cpp 96 scpE = info.Scopes.end(); scpI != scpE; ++scpI) {
100 clearRefsIn(scope.Releases.begin(), scope.Releases.end(), info.Refs);
120 scpE = info.Scopes.end(); scpI != scpE; ++scpI) {
151 scpE = info.Scopes.end(); scpI != scpE; ++scpI) {
155 relE = scope.Releases.end(); relI != relE; ++relI) {
tools/clang/lib/ARCMigrate/TransProperties.cpp 122 for (PropsTy::iterator I = props.begin(), E = props.end(); I != E; ++I) {
150 for (PropsTy::iterator I = props.begin(), E = props.end(); I != E; ++I)
205 for (PropsTy::iterator I = props.begin(), E = props.end(); I != E; ++I) {
225 for (PropsTy::iterator I = props.begin(), E = props.end(); I != E; ++I) {
253 for (PropsTy::iterator I = props.begin(), E = props.end(); I != E; ++I) {
305 for (PropsTy::iterator I = props.begin(), E = props.end(); I != E; ++I) {
319 for (PropsTy::iterator I = props.begin(), E = props.end(); I != E; ++I) {
350 for (PropsTy::iterator I = props.begin(), E = props.end(); I != E; ++I)
364 for (PropsTy::iterator I = props.begin(), E = props.end(); I != E; ++I)
tools/clang/lib/ARCMigrate/TransProtectedScope.cpp 117 I = StoredDiags.begin(), E = StoredDiags.end();
tools/clang/lib/ARCMigrate/TransformActions.cpp 562 TI = I->second.begin(), TE = I->second.end(); TI != TE; ++TI) {
tools/clang/lib/AST/ASTContext.cpp 854 for (auto &Pair : Deallocations)
885 for (APValue *Value : APValueCleanups)
1067 for (auto ID : LazyInits)
1104 Inits->LazyInitializers.insert(Inits->LazyInitializers.end(),
1556 Overridden.append(OverDecls.begin(), OverDecls.end());
2459 for (const auto Base : Bases) {
4542 llvm::array_pod_sort(Protocols.begin(), Protocols.end(), CmpProtocolNames);
4545 for (ObjCProtocolDecl *&P : Protocols)
4549 auto ProtocolsEnd = std::unique(Protocols.begin(), Protocols.end());
4550 Protocols.erase(ProtocolsEnd, Protocols.end());
8306 IntersectionSet.end(),
8310 IntersectionSet.end());
8314 llvm::array_pod_sort(IntersectionSet.begin(), IntersectionSet.end(),
10464 std::find(Vector->begin(), Vector->end(),
10465 ParentStack.back()) != Vector->end();
tools/clang/lib/AST/ASTImporter.cpp 118 std::reverse(Redecls.begin(), Redecls.end());
275 for (const Attr *FromAttr : FromD->getAttrs()) {
2200 for (auto *FoundDecl : FoundDecls) {
2316 for (auto *FoundDecl : FoundDecls) {
2408 for (auto *FoundDecl : FoundDecls) {
2512 for (auto *FoundDecl : FoundDecls) {
2615 for (auto *FoundDecl : FoundDecls) {
2751 for (auto *R : Redecls) {
2826 for (auto *FoundDecl : FoundDecls) {
3000 for (; RedeclIt != Redecls.end() && *RedeclIt != D; ++RedeclIt) {
3042 for (auto *FoundDecl : FoundDecls) {
3250 for (auto *Param : Parameters) {
3291 std::copy(CtorInitializers.begin(), CtorInitializers.end(), Memory);
3335 for (++RedeclIt; RedeclIt != Redecls.end(); ++RedeclIt) {
3373 for (auto *FoundDecl : FoundDecls) {
3601 for (auto *FoundDecl : FoundDecls) {
3647 for (; RedeclIt != Redecls.end() && *RedeclIt != D; ++RedeclIt) {
3671 for (auto *FoundDecl : FoundDecls) {
3781 for (++RedeclIt; RedeclIt != Redecls.end(); ++RedeclIt) {
3889 for (auto *FoundDecl : FoundDecls) {
3984 for (auto *ToParam : ToParams) {
4196 for (auto *FoundDecl : FoundDecls) {
4621 for (auto *FoundDecl : FoundDecls) {
4796 for (auto *FoundDecl : FoundDecls) {
5054 for (auto *FoundDecl : FoundDecls) {
5347 for (auto *FoundDecl : FoundDecls) {
5578 for (auto *FoundDecl : FoundDecls) {
8010 for (const auto &Path : SavedImportPaths[FromD])
tools/clang/lib/AST/CXXInheritance.cpp 557 if (llvm::find(SubobjectOverrides, Overriding) == SubobjectOverrides.end())
753 for (const UniqueVirtualMethod &OP : Overriding)
762 std::remove_if(Overriding.begin(), Overriding.end(), IsHidden),
763 Overriding.end());
tools/clang/lib/AST/CommentParser.cpp 248 P.putBack(llvm::makeArrayRef(Toks.begin() + Pos.CurToken, Toks.end()));
tools/clang/lib/AST/ComparisonCategories.cpp 55 if (It != Objects.end())
tools/clang/lib/AST/DeclBase.cpp 845 auto I = Attrs.begin(), E = Attrs.end();
1250 std::reverse(Contexts.begin(), Contexts.end());
1556 for (auto *DC : Contexts) {
1568 for (auto *DC : Contexts)
1700 for (auto *Context : Contexts)
1714 Results.insert(Results.end(), LookupResults.begin(), LookupResults.end());
1725 Results.insert(Results.end(),
tools/clang/lib/AST/DeclObjC.cpp 1371 for (const auto *Override : Overrides)
tools/clang/lib/AST/DeclPrinter.cpp 233 for (auto *A : Attrs) {
255 for (auto *A : Attrs) {
tools/clang/lib/AST/DeclTemplate.cpp 215 for (const RedeclarableTemplateDecl *Prev : PrevDecls)
333 std::copy(TemplateArgs.begin(), TemplateArgs.end(),
362 for (auto *D : PreviousDecls)
tools/clang/lib/AST/ExprConstant.cpp 291 Entries.insert(Entries.end(), VEntries.begin(), VEntries.end());
1033 std::remove_if(CleanupStack.begin(), CleanupStack.end(),
1035 CleanupStack.end());
1042 for (Cleanup &C : CleanupStack)
1327 std::remove_if(NewEnd, Info.CleanupStack.end(),
1329 Info.CleanupStack.erase(NewEnd, Info.CleanupStack.end());
1653 Path.insert(Path.end(), P.begin(), P.end());
2714 for (CXXBasePathElement &Elem : Paths.front())
5270 for (CXXBasePathElement &Elem : Paths.front())
6154 std::reverse(Output.begin(), Output.end());
6160 std::reverse(Input.begin(), Input.end());
6163 for (unsigned char Byte : Input) {
tools/clang/lib/AST/ExternalASTMerger.cpp 509 for (const Candidate &C : Candidates) {
tools/clang/lib/AST/Interp/ByteCodeEmitter.cpp 69 for (auto &DS : Descriptors) {
92 for (unsigned Reloc : It->second) {
tools/clang/lib/AST/Interp/EvalEmitter.cpp 238 for (auto &Local : Descriptors[I]) {
tools/clang/lib/AST/Interp/Function.h 47 return llvm::make_range(Descriptors.begin(), Descriptors.end());
87 return llvm::make_range(Scopes.begin(), Scopes.end());
tools/clang/lib/AST/Interp/Record.cpp 19 for (Base &V : SrcVirtualBases)
22 for (Base &B : Bases)
24 for (Field &F : Fields)
26 for (Base &V : VirtualBases)
tools/clang/lib/AST/Interp/State.cpp 70 getEvalStatus().Diag->insert(getEvalStatus().Diag->end(), Diags.begin(),
tools/clang/lib/AST/ItaniumMangle.cpp 299 UsedAbiTags.insert(UsedAbiTags.end(), AbiTag->tags().begin(),
309 UsedAbiTags.insert(UsedAbiTags.end(), AbiTag->tags().begin(),
311 TagList.insert(TagList.end(), AbiTag->tags().begin(),
316 UsedAbiTags.insert(UsedAbiTags.end(), AdditionalAbiTags->begin(),
318 TagList.insert(TagList.end(), AdditionalAbiTags->begin(),
323 TagList.erase(std::unique(TagList.begin(), TagList.end()), TagList.end());
323 TagList.erase(std::unique(TagList.begin(), TagList.end()), TagList.end());
339 UsedAbiTags.erase(std::unique(UsedAbiTags.begin(), UsedAbiTags.end()),
340 UsedAbiTags.end());
357 Parent->UsedAbiTags.insert(Parent->UsedAbiTags.end(),
358 UsedAbiTags.begin(), UsedAbiTags.end());
359 Parent->EmittedAbiTags.insert(Parent->EmittedAbiTags.end(),
361 EmittedAbiTags.end());
694 std::set_difference(ReturnTypeAbiTags.begin(), ReturnTypeAbiTags.end(),
697 AdditionalAbiTags.end());
838 VariableTypeAbiTags.end(), UsedAbiTags.begin(),
840 AdditionalAbiTags.end());
tools/clang/lib/AST/MicrosoftMangle.cpp 841 if (StringFound != NameBackReferences.end()) {
1302 if (Found == NameBackReferences.end()) {
2554 for (const llvm::APInt &Dimension : Dimensions)
tools/clang/lib/AST/ODRHash.cpp 495 for (auto SubDecl : Decls) {
592 for (auto SubDecl : Decls) {
619 for (auto SubDecl : Decls) {
tools/clang/lib/AST/RecordLayoutBuilder.cpp 2807 for (uint64_t &FieldOffset : FieldOffsets)
2839 for (uint64_t &FieldOffset : FieldOffsets)
3342 for (const CXXRecordDecl *Base : Bases) {
tools/clang/lib/AST/Stmt.cpp 719 for (const auto &Piece : Pieces) {
tools/clang/lib/AST/VTableBuilder.cpp 511 for (const auto &OffsetPair : Offsets) {
523 for (const auto &OffsetPair : Offsets) {
1065 if (llvm::find(ThunksVector, Thunk) != ThunksVector.end())
1564 for (const CXXMethodDecl *MD : NewVirtualFunctions) {
2454 if (llvm::find(ThunksVector, Thunk) != ThunksVector.end())
2881 for (const MethodGroup &Group : Groups)
2942 for (const CXXMethodDecl *MD : VirtualMethods) {
3343 for (auto& P : Paths)
3526 for (const std::unique_ptr<VPtrInfo>& Info : Paths) {
3572 for (const std::unique_ptr<VPtrInfo> &VFPtr : *VFPtrLocations[RD]) {
tools/clang/lib/ASTMatchers/ASTMatchersInternal.cpp 74 for (BoundNodesMap &Binding : Bindings) {
tools/clang/lib/Analysis/CFG.cpp 4655 for (const Expr *CommaLHS : CommaLHSs) {
5391 for (auto I: Stmts)
tools/clang/lib/Analysis/CloneDetection.cpp 100 for (StmtSequence &GroupSeq : Group) {
118 for (StmtSequence &Stmt : Group) {
364 for (const StmtSequence &S : Group) {
tools/clang/lib/Analysis/ReachableCode.cpp 531 llvm::array_pod_sort(DeferredLocs.begin(), DeferredLocs.end(), SrcCmp);
533 E = DeferredLocs.end(); I != E; ++I) {
tools/clang/lib/Analysis/ThreadSafety.cpp 89 iterator It = std::find_if(begin(), end(),
93 if (It == end())
190 iterator end() { return FactIDs.end(); }
1163 for (const auto *Vdb : Info->Vect) {
1185 for (auto *Info : InfoVect)
1553 for (const auto &ExclusiveLockToAdd : ExclusiveLocksToAdd)
1557 for (const auto &SharedLockToAdd : SharedLocksToAdd)
1841 for (const auto &AssertLock : AssertLocks)
1853 for (const auto &AssertLock : AssertLocks)
1865 for (const auto &AssertLock : AssertLocks)
1922 for (const auto &M : ExclusiveLocksToRemove)
1924 for (const auto &M : SharedLocksToRemove)
1926 for (const auto &M : GenericLocksToRemove)
1930 for (const auto &M : ExclusiveLocksToAdd)
1934 for (const auto &M : SharedLocksToAdd)
1948 for (const auto &M : ExclusiveLocksToAdd)
1950 for (const auto &M : ScopedExclusiveReqs)
1952 for (const auto &M : SharedLocksToAdd)
1954 for (const auto &M : ScopedSharedReqs)
1956 for (const auto &M : ExclusiveLocksToRemove)
1958 for (const auto &M : SharedLocksToRemove)
2351 for (const auto &Mu : ExclusiveLocksToAdd) {
2356 for (const auto &Mu : SharedLocksToAdd) {
2431 for (const auto *PrevBlock : SpecialBlocks) {
2525 for (const auto &Lock : ExclusiveLocksAcquired)
2528 for (const auto &Lock : SharedLocksAcquired)
2531 for (const auto &Lock : LocksReleased)
tools/clang/lib/Analysis/UninitializedValues.cpp 167 for (auto &val : vals)
tools/clang/lib/Basic/Diagnostic.cpp 280 for (DiagStatePoint &Transition : File.StateTransitions) {
391 for (diag::kind Diag : GroupDiags)
415 for (diag::kind Diag : GroupDiags) {
446 for (diag::kind Diag : GroupDiags) {
1080 OutStr.append(Tree.begin(), Tree.end());
1096 this->Message.assign(Message.begin(), Message.end());
tools/clang/lib/Basic/Module.cpp 639 for (Module *E : Exports) {
tools/clang/lib/Basic/SourceManager.cpp 1275 std::copy(LineOffsets.begin(), LineOffsets.end(), FI->SourceLineCache);
tools/clang/lib/CodeGen/CGBlocks.cpp 137 for (const BlockCaptureManagedEntity &E : ManagedCaptures) {
473 for (auto I : Helper->getCustomFieldTypes()) /* custom fields */ {
700 li = layout.begin() + 1, le = layout.end();
755 li = layout.begin(), le = layout.end(); li != le; ++li) {
1017 for (auto I : Helper->getCustomFieldValues(*this, blockInfo)) {
1233 for (auto I : Helper->getCustomFieldTypes())
1427 for (auto I : Helper->getCustomFieldValues(CGM, blockInfo)) {
2050 for (const auto &CopiedCapture : CopiedCaptures) {
2243 for (const auto &DestroyedCapture : DestroyedCaptures) {
tools/clang/lib/CodeGen/CGBuiltin.cpp 1237 for (const auto &Item : Layout.Items) {
1290 for (llvm::Value *Object : RetainableOperands)
5590 SmallVector<Value *, 2> MulOps(Ops.begin() + 1, Ops.end());
5675 std::rotate(Ops.begin(), Ops.begin() + 1, Ops.end());
tools/clang/lib/CodeGen/CGCUDANV.cpp 351 for (const VarDecl *A : Args) {
420 for (auto &&I : EmittedKernels) {
445 for (auto &&Info : DeviceVars) {
tools/clang/lib/CodeGen/CGCall.cpp 966 for (auto BS : RExp->Bases)
968 for (auto FD : RExp->Fields)
987 for (auto BS : RExp->Bases)
989 for (auto FD : RExp->Fields)
1030 for (const CXXBaseSpecifier *BS : RExp->Bases) {
1040 for (auto FD : RExp->Fields) {
1073 for (const CXXBaseSpecifier *BS : RExp->Bases) {
1086 for (auto FD : RExp->Fields) {
2662 for (auto *I : InstsToKill)
3489 std::reverse(Args.begin() + CallArgsStart, Args.end());
4584 for (CallLifetimeEnd &LifetimeEnd : CallLifetimeEndAfterCall)
tools/clang/lib/CodeGen/CGCall.h 297 insert(end(), other.begin(), other.end());
298 Writebacks.insert(Writebacks.end(),
300 CleanupsToDeactivate.insert(CleanupsToDeactivate.end(),
tools/clang/lib/CodeGen/CGClass.cpp 2296 for (const VPtr &Vptr : getVTablePointers(ClassDecl))
2581 for (const VPtr &Vptr : getVTablePointers(RD))
tools/clang/lib/CodeGen/CGDebugInfo.cpp 4017 assert(std::find(Expr.begin(), Expr.end(), llvm::dwarf::DW_OP_deref) ==
4018 Expr.end() &&
4267 llvm::array_pod_sort(chunks.begin(), chunks.end());
4269 for (const BlockLayoutChunk &Chunk : chunks) {
tools/clang/lib/CodeGen/CGDecl.cpp 1348 for (auto &VlaSize : Dimensions) {
tools/clang/lib/CodeGen/CGDeclCXX.cpp 549 PrioritizedCXXGlobalInits.end());
555 E = PrioritizedCXXGlobalInits.end(); I != E; ) {
tools/clang/lib/CodeGen/CGExpr.cpp 476 for (const auto &Ignored : CommaLHSs)
tools/clang/lib/CodeGen/CGExprCXX.cpp 540 for (std::pair<CharUnits, CharUnits> Store : Stores) {
554 for (std::pair<CharUnits, CharUnits> Store : Stores) {
tools/clang/lib/CodeGen/CGExprConstant.cpp 970 for (llvm::Constant *Elt : Elements)
tools/clang/lib/CodeGen/CGGPUBuiltin.cpp 85 if (std::any_of(Args.begin() + 1, Args.end(), [&](const CallArg &A) {
tools/clang/lib/CodeGen/CGLoopInfo.cpp 426 LoopProperties.insert(LoopProperties.end(), AdditionalLoopProperties.begin(),
tools/clang/lib/CodeGen/CGNonTrivialStruct.cpp 314 for (auto &P : Params)
tools/clang/lib/CodeGen/CGObjCGNU.cpp 2322 e = Types.end() ; i!=e ; i++) {
3210 for (auto v : values) array.add(v);
3346 for (auto *property : Properties) {
3673 for (TypedSelector &sel : table[untypedSel]) {
tools/clang/lib/CodeGen/CGObjCMac.cpp 2728 llvm::array_pod_sort(RunSkipBlockVars.begin(), RunSkipBlockVars.end());
3299 for (auto PD : Properties) {
5278 llvm::array_pod_sort(IvarsInfo.begin(), IvarsInfo.end());
5280 assert(std::is_sorted(IvarsInfo.begin(), IvarsInfo.end()));
5341 for (auto &request : IvarsInfo) {
5471 builder.visitAggregate(ivars.begin(), ivars.end(), CharUnits::Zero(),
7134 args.insert(args.end(), formalArgs.begin(), formalArgs.end());
tools/clang/lib/CodeGen/CGOpenMPRuntime.cpp 1749 for(auto *D : FunctionUDRMap[CGF.CurFn])
1755 for(auto *D : I->second)
4152 for (const auto &E : OrderedEntries) {
7848 &Data : RecordLayout) {
7907 for (auto &M : CurTypes)
7981 It->second.begin(), It->second.end(), [VD](const MapInfo &MI) {
7986 if (CI != It->second.end()) {
8061 for (const DeferredDevicePtrEntryTy &L : CI->second) {
8083 BasePointers.append(CurBasePointers.begin(), CurBasePointers.end());
8084 Pointers.append(CurPointers.begin(), CurPointers.end());
8085 Sizes.append(CurSizes.begin(), CurSizes.end());
8086 Types.append(CurTypes.begin(), CurTypes.end());
8155 BasePointers.append(CurBasePointers.begin(), CurBasePointers.end());
8156 Pointers.append(CurPointers.begin(), CurPointers.end());
8157 Sizes.append(CurSizes.begin(), CurSizes.end());
8158 Types.append(CurTypes.begin(), CurTypes.end());
8308 for (const MapData &L : DeclComponentLists) {
8414 for (const MapData &L : DeclComponentLists) {
8571 for (llvm::Value *S : Sizes)
8602 for (llvm::Value *S : Sizes)
9378 BasePointers.append(CurBasePointers.begin(), CurBasePointers.end());
9379 Pointers.append(CurPointers.begin(), CurPointers.end());
9380 Sizes.append(CurSizes.begin(), CurSizes.end());
9381 MapTypes.append(CurMapTypes.begin(), CurMapTypes.end());
10330 for (char Mask : Masked) {
10462 assert(std::all_of(Sizes.begin(), Sizes.end(),
tools/clang/lib/CodeGen/CGOpenMPRuntimeNVPTX.cpp 259 for (const auto &Pair : GlobalizedVars) {
1459 for (llvm::Function *W : Work) {
2205 for (const RecordDecl *RD : GlobalizedRecords.back().Records) {
2357 for (const ValueDecl *VD : I->getSecond().EscapedVariableLengthDecls) {
5069 for (const GlobalPtrSizeRecsTy &Records : GlobalizedRecords) {
5134 for (const GlobalPtrSizeRecsTy *Rec : SharedRecs) {
5162 for (const GlobalPtrSizeRecsTy *Rec : GlobalRecs) {
5173 for (const RecordDecl *TeamReductionRec : TeamsReductions) {
tools/clang/lib/CodeGen/CGStmt.cpp 576 i = Labels.begin(), e = Labels.end(); i != e; ++i) {
586 ParentScope->Labels.append(Labels.begin(), Labels.end());
tools/clang/lib/CodeGen/CGStmtOpenMP.cpp 608 for (const auto *Arg : Args) {
1133 for (const Expr *IRef : Shareds) {
2998 for (const Expr *E : Data.PrivateVars) {
3005 for (const Expr *E : Data.FirstprivateVars) {
3013 for (const Expr *E : Data.LastprivateVars) {
3034 for (const auto &Pair : PrivatePtrs) {
3236 for (const Expr *E : Data.FirstprivateVars) {
3246 for (const auto &Pair : PrivatePtrs) {
tools/clang/lib/CodeGen/CodeGenAction.cpp 205 for (auto &LM : LinkModules) {
tools/clang/lib/CodeGen/CodeGenFunction.cpp 412 E = DeferredReplacements.end();
tools/clang/lib/CodeGen/CodeGenModule.cpp 265 for (auto &I : GlobalValReplacements) {
462 for (auto *MD : ELFDependentLibraries)
2063 std::reverse(MetadataArgs.begin(), MetadataArgs.end());
2064 LinkerOptionsMetadata.append(MetadataArgs.begin(), MetadataArgs.end());
2068 for (auto *MD : LinkerOptionsMetadata)
2975 Features.begin(), Features.end(), [&Target](StringRef Feat) {
2977 }), Features.end());
2995 (Options.end() - 2)->Conditions.Features) == 0) {
2996 StringRef LHSName = (Options.end() - 2)->Function->getName();
2997 StringRef RHSName = (Options.end() - 1)->Function->getName();
2999 Options.erase(Options.end() - 2);
3001 Options.erase(Options.end() - 1);
5907 std::vector<std::string> Features(FeaturesTmp.begin(), FeaturesTmp.end());
tools/clang/lib/CodeGen/CodeGenTBAA.cpp 335 for (const auto &Field : Fields)
tools/clang/lib/CodeGen/ConstantInitBuilder.cpp 109 Buffer.erase(Buffer.begin() + newEnd, Buffer.end());
255 buffer.erase(buffer.begin() + Begin, buffer.end());
277 buffer.erase(buffer.begin() + Begin, buffer.end());
tools/clang/lib/CodeGen/CoverageMappingGen.cpp 248 for (const auto &FL : FileLocs) {
279 for (const auto &R : MappingRegions) {
tools/clang/lib/CodeGen/ItaniumCXXABI.cpp 2607 for (auto VDAndWrapper : ThreadWrappers) {
tools/clang/lib/CodeGen/MicrosoftCXXABI.cpp 2764 DerivedToBasePath.end(), C);
3556 for (MSRTTIClass &Class : Classes)
3578 for (auto Class : Classes) {
3641 for (MSRTTIClass &Class : Classes)
4123 for (const MSRTTIClass &Class : Classes) {
tools/clang/lib/CodeGen/TargetInfo.cpp 7091 ArgList.append(IntArgList.begin(), IntArgList.end());
tools/clang/lib/CodeGen/VarBypassDetector.cpp 137 for (const auto &S : FromScopes) {
tools/clang/lib/Driver/Action.cpp 65 for (auto *A : Inputs)
79 for (auto *A : Inputs)
tools/clang/lib/Driver/Compilation.cpp 92 for (auto ArgPtr : AllocatedArgs)
tools/clang/lib/Driver/Distro.cpp 28 for (StringRef Line : Lines)
118 for (const StringRef& Line : Lines) {
tools/clang/lib/Driver/Driver.cpp 347 for (StringRef Val : A->getValues())
391 for (StringRef Val : A->getValues())
675 for (const char *Val : OpenMPTargets->getValues()) {
800 SystemConfigDir = std::string(CfgDir.begin(), CfgDir.end());
811 UserConfigDir = std::string(CfgDir.begin(), CfgDir.end());
926 for (const std::string &SearchDir : CfgFileSearchDirs)
1144 for (auto I = ASL.begin(), E = ASL.end(); I != E; ++I) {
1280 for (InputList::iterator it = Inputs.begin(), ie = Inputs.end(); it != ie;) {
1296 ie = Inputs.end();
1474 for (const auto &CmdPair : FailingCommands) {
1961 for (Action* Act : SingleActions) {
1979 Actions.append(Inputs.begin(), Inputs.end());
2422 for (auto Arch : GpuArchList) {
2661 for (Action *&A : CudaDeviceActions)
2754 for (auto *A : CudaDeviceActions) {
2766 for (Action *&A : CudaDeviceActions)
2777 for (auto &LI : DeviceLinkerInputs) {
2818 for (auto *A : OpenMPDeviceActions) {
2830 for (Action *&A : OpenMPDeviceActions)
2881 for (Action *&A : OpenMPDeviceActions) {
2902 for (auto *A : OpenMPDeviceActions) {
2918 for (auto &LI : DeviceLinkerInputs) {
2986 for (auto *SB : SpecializedBuilders) {
3001 for (auto *SB : SpecializedBuilders)
3027 for (auto *SB : SpecializedBuilders) {
3094 for (auto *SB : SpecializedBuilders) {
3126 for (auto *SB : SpecializedBuilders) {
3147 AL.append(OffloadAL.begin(), OffloadAL.end());
3160 for (DeviceActionBuilder *SB : SpecializedBuilders) {
3183 for (auto *SB : SpecializedBuilders) {
3311 for (phases::ID Phase : PCHPL)
3410 for (phases::ID Phase : PL) {
3627 for (const Action *A : C.getActions())
3646 for (Action *A : C.getActions()) {
3933 for (Action *A : Inputs) {
3943 PreprocessJobOffloadActions.end());
4159 for (const auto *OA : CollapsedOffloadActions)
4171 for (const Action *Input : Inputs) {
4197 OffloadDependencesInputInfo.end());
4645 for (const auto &TargetSpecificExecutable : TargetSpecificExecutables)
tools/clang/lib/Driver/Job.cpp 244 for (auto &F : NewIncFlags) {
tools/clang/lib/Driver/ToolChains/Arch/AArch64.cpp 60 for (StringRef Feature : Split) {
tools/clang/lib/Driver/ToolChains/Arch/ARM.cpp 81 for (StringRef Feature : Split) {
tools/clang/lib/Driver/ToolChains/Arch/RISCV.cpp 110 auto E = Prefix.end();
114 for (StringRef Ext : Split) {
180 for (auto Ext : AllExts) {
tools/clang/lib/Driver/ToolChains/Clang.cpp 851 for (const auto &Act : C.getActions()) {
1459 while (Protection != BranchProtection.end()) {
1464 while (++Protection != BranchProtection.end()) {
1967 for (auto &it: ASL)
5305 for (const char *OriginalArg : OriginalArgs) {
6193 for (const char *OriginalArg : OriginalArgs) {
tools/clang/lib/Driver/ToolChains/CommonArgs.cpp 742 for (auto RT : SharedRuntimes)
744 for (auto RT : HelperStaticRuntimes)
747 for (auto RT : StaticRuntimes) {
751 for (auto RT : NonWholeStaticRuntimes) {
755 for (auto S : RequiredSymbols) {
tools/clang/lib/Driver/ToolChains/Cuda.cpp 126 for (const auto &Candidate : Candidates) {
691 for (StringRef Path : Frags)
704 for (StringRef LibraryPath : LibraryPaths) {
tools/clang/lib/Driver/ToolChains/Darwin.cpp 1860 for (llvm::StringRef dir : dirs) {
2127 for (const char *Value : A->getValues()) {
tools/clang/lib/Driver/ToolChains/Fuchsia.cpp 287 for (StringRef dir : dirs) {
tools/clang/lib/Driver/ToolChains/Gnu.cpp 1818 CandidateTripleAliases.end());
1827 for (const std::string &Prefix : Prefixes) {
1830 for (StringRef Suffix : CandidateLibDirs) {
1839 for (StringRef Candidate : CandidateTripleAliases)
1842 for (StringRef Suffix : CandidateBiarchLibDirs) {
1846 for (StringRef Candidate : CandidateBiarchTripleAliases)
2441 for (StringRef Line : Lines) {
2464 for (StringRef ConfLine : ConfigLines) {
2481 for (const auto &GentooScanPath : GentooScanPaths) {
tools/clang/lib/Driver/ToolChains/HIP.cpp 38 for (std::string LibraryPath : LibraryPaths) {
353 for (auto Lib : BCLibs)
tools/clang/lib/Driver/ToolChains/Hexagon.cpp 421 for (const char *Value : A->getValues())
tools/clang/lib/Driver/ToolChains/Hurd.cpp 146 for (StringRef Dir : Dirs) {
tools/clang/lib/Driver/ToolChains/Linux.cpp 675 for (StringRef dir : dirs) {
tools/clang/lib/Driver/ToolChains/MSVC.cpp 100 for (llvm::StringRef PathEntry : PathEntries) {
1251 for (StringRef Dir : Dirs)
tools/clang/lib/Driver/ToolChains/MinGW.cpp 330 for (StringRef CandidateArch : Archs) {
347 for (StringRef CandidateGcc : Gccs)
361 for (StringRef CandidateSubdir : Subdirs) {
568 for (auto &CppIncludeBase : CppIncludeBases) {
tools/clang/lib/Driver/ToolChains/Solaris.cpp 245 for (StringRef dir : dirs) {
tools/clang/lib/Driver/ToolChains/WebAssembly.cpp 234 for (StringRef dir : dirs) {
tools/clang/lib/Driver/XRayArgs.cpp 106 for (const auto &P : BundleParts) {
166 for (const auto &M : ModeParts)
tools/clang/lib/Edit/Commit.cpp 284 for (const auto &act : CachedEdits)
tools/clang/lib/Edit/EditedSource.cpp 58 for (auto &ExpArg : CurrCommitMacroArgExps) {
63 if (llvm::find(ArgUses, ArgUse) == ArgUses.end())
91 }) != I->second.end()) {
tools/clang/lib/Format/AffectedRangeManager.cpp 25 SmallVectorImpl<AnnotatedLine *>::iterator E = Lines.end();
96 markAllAsAffected((*I)->Children.begin(), (*I)->Children.end());
tools/clang/lib/Format/Format.cpp 1264 for (AnnotatedLine *Line : Lines) {
1471 for (auto *Line : AnnotatedLines)
1479 for (auto *Child : Line->Children) {
1922 Indices.erase(std::unique(Indices.begin(), Indices.end(),
1926 Indices.end());
1937 std::is_sorted(Indices.begin(), Indices.end()) &&
1942 for (unsigned Index : Indices) {
2099 Indices.erase(std::unique(Indices.begin(), Indices.end(),
2103 Indices.end());
2109 for (unsigned Index : Indices) {
tools/clang/lib/Format/FormatTokenLexer.cpp 134 auto &At = *(Tokens.end() - 2);
135 auto &String = *(Tokens.end() - 1);
143 Tokens.erase(Tokens.end() - 1);
152 auto &Hash = *(Tokens.end() - 2);
153 auto &Identifier = *(Tokens.end() - 1);
162 Tokens.erase(Tokens.end() - 1);
172 auto &At = *(Tokens.end() - 2);
173 auto &String = *(Tokens.end() - 1);
181 auto &Dollar = *(Tokens.end() - 3);
190 Tokens.erase(Tokens.end() - 2);
191 Tokens.erase(Tokens.end() - 1);
202 Tokens.erase(Tokens.end() - 1);
209 auto &FirstQuestion = *(Tokens.end() - 2);
210 auto &SecondQuestion = *(Tokens.end() - 1);
219 Tokens.erase(Tokens.end() - 1);
226 auto &At = *(Tokens.end() - 2);
227 auto &Keyword = *(Tokens.end() - 1);
238 Tokens.erase(Tokens.end() - 1);
246 auto &Identifier = *(Tokens.end() - 2);
247 auto &Question = *(Tokens.end() - 1);
255 Tokens.erase(Tokens.end() - 1);
263 auto &Identifier = *(Tokens.end() - 1);
281 FourthTokenIsLess = (Tokens.end() - 4)[0]->is(tok::less);
283 auto First = Tokens.end() - 3;
296 Tokens.erase(Tokens.end() - 2);
306 Tokens.end() - Kinds.size();
tools/clang/lib/Format/SortJavaScriptImports.cpp 147 bool ReferencesInOrder = std::is_sorted(Indices.begin(), Indices.end());
263 for (auto I = Symbols.begin(), E = Symbols.end(); I != E; ++I) {
283 for (auto Line : AnnotatedLines) {
tools/clang/lib/Format/TokenAnnotator.cpp 2047 E = Line.Children.end();
2184 E = Line.Children.end();
tools/clang/lib/Format/UnwrappedLineFormatter.cpp 709 for (AnnotatedLine *Child : Tok->Children)
tools/clang/lib/Format/UnwrappedLineParser.cpp 270 for (auto &Line : Lines)
279 E = Lines.end();
762 for (auto &Line : Lines) {
818 for (auto &Line : Lines) {
2485 std::make_move_iterator(PreprocessorDirectives.end()));
2610 E = CommentsBeforeNextToken.end();
tools/clang/lib/Format/UsingDeclarationsSorter.cpp 118 for (const UsingDeclaration &Declaration : *UsingDeclarations) {
129 UsingDeclarations->begin(), UsingDeclarations->end());
133 SortedUsingDeclarations.end(),
137 SortedUsingDeclarations.end());
tools/clang/lib/Format/WhitespaceManager.cpp 208 for (auto &Change : Changes) {
tools/clang/lib/Frontend/ASTUnit.cpp 385 for (auto &R : Results) {
1074 std::remove_if(StoredDiags.begin(), StoredDiags.end(), isNonDriverDiag),
1075 StoredDiags.end());
1086 for (auto &SD : StoredDiagnostics) {
2072 AllResults.insert(AllResults.end(), Results, Results + NumResults);
2488 if (EndIt != LocDecls.end())
tools/clang/lib/Frontend/ChainedIncludesSource.cpp 178 for (auto &SB : SerialBufs)
tools/clang/lib/Frontend/CompilerInstance.cpp 161 for (auto &Name : HeaderMapFileNames)
213 for (auto &E : VFSEntries)
1544 for (auto *II : LoadedModules) {
1554 for (auto *II : LoadedModules) {
1569 Stack.insert(Stack.end(),
1996 for (auto &C : CleanModuleName)
2100 std::reverse(Path.begin(), Path.end());
tools/clang/lib/Frontend/CompilerInvocation.cpp 179 for (const auto *Arg : A->getValues())
201 Funcs.insert(Funcs.end(), Values.begin(), Values.end());
337 for (const StringRef CheckerOrPackage : CheckersAndPackages)
349 for (const auto &configVal : configVals) {
479 for (const StringRef CheckerOrPackage : CheckersAndPackages) {
610 for (const auto B : BundleParts) {
1066 for (const auto &arg : ASL) {
tools/clang/lib/Frontend/CreateInvocationFromCommandLine.cpp 66 for (auto &A : C->getActions()){
tools/clang/lib/Frontend/DiagnosticRenderer.cpp 341 std::set_intersection(BeginArgExpansions.begin(), BeginArgExpansions.end(),
342 EndArgExpansions.begin(), EndArgExpansions.end(),
507 for (const auto &Range : SpellingRanges)
tools/clang/lib/Frontend/FrontendAction.cpp 341 for (Module::Header &H : Module->Headers[HK]) {
tools/clang/lib/Frontend/InitHeaderSearch.cpp 266 for (StringRef dir : dirs)
tools/clang/lib/Frontend/LogDiagnosticPrinter.cpp 103 for (auto &DE : Entries)
tools/clang/lib/Frontend/PrintPreprocessedOutput.cpp 844 llvm::array_pod_sort(MacrosByID.begin(), MacrosByID.end(), MacroIDCompare);
tools/clang/lib/Frontend/Rewrite/RewriteModernObjC.cpp 4085 E = BlockByRefDecls.end(); I != E; ++I) {
4096 E = BlockByCopyDecls.end(); I != E; ++I) {
4193 E = BlockByCopyDecls.end(); I != E; ++I) {
4222 E = BlockByRefDecls.end(); I != E; ++I) {
4241 E = BlockByCopyDecls.end(); I != E; ++I) {
4256 E = BlockByRefDecls.end(); I != E; ++I) {
5303 E = BlockByCopyDecls.end(); I != E; ++I) {
5339 E = BlockByRefDecls.end(); I != E; ++I) {
tools/clang/lib/Frontend/Rewrite/RewriteObjC.cpp 3295 E = BlockByRefDecls.end(); I != E; ++I) {
3306 E = BlockByCopyDecls.end(); I != E; ++I) {
3403 E = BlockByCopyDecls.end(); I != E; ++I) {
3432 E = BlockByRefDecls.end(); I != E; ++I) {
3451 E = BlockByCopyDecls.end(); I != E; ++I) {
3466 E = BlockByRefDecls.end(); I != E; ++I) {
4441 E = BlockByCopyDecls.end(); I != E; ++I) {
4476 E = BlockByRefDecls.end(); I != E; ++I) {
5367 RewriteObjCMethodsMetaData(InstanceMethods.begin(), InstanceMethods.end(),
5643 RewriteObjCMethodsMetaData(InstanceMethods.begin(), InstanceMethods.end(),
tools/clang/lib/Frontend/SerializedDiagnosticPrinter.cpp 693 for (ArrayRef<CharSourceRange>::iterator I = Ranges.begin(), E = Ranges.end();
tools/clang/lib/Frontend/TextDiagnostic.cpp 1179 E = Ranges.end();
1223 E = Ranges.end();
tools/clang/lib/Frontend/VerifyDiagnosticConsumer.cpp 354 for (auto &UD : Deferred->second) {
tools/clang/lib/Index/IndexBody.cpp 63 auto It = StmtStack.end()-2;
tools/clang/lib/Index/IndexDecl.cpp 131 for(auto overridden: Overriden) {
tools/clang/lib/Index/IndexingContext.cpp 417 if (It != FinalRelations.end()) {
tools/clang/lib/Lex/HeaderSearch.cpp 564 SearchPath->append(FrameworkName.begin(), FrameworkName.end()-1);
1092 SearchPath->append(HeadersFilename.begin(), HeadersFilename.end()-1);
1104 SearchPath->append(HeadersFilename.begin(), HeadersFilename.end()-1);
tools/clang/lib/Lex/ModuleMap.cpp 324 for (auto *M : ShadowModules)
455 std::find_if(Hs->begin(), Hs->end(), [&](const Module::Header &H) {
457 }) != Hs->end();
489 for (const KnownHeader &Header : Known->second) {
576 for (KnownHeader &H : Known->second) {
846 for (auto &Submodule : PendingSubmodules) {
1112 for (const auto &Cb : Callbacks)
1177 for (auto &Header : Mod->UnresolvedHeaders)
1192 for (auto H : HeaderList)
1209 for (const auto &Cb : Callbacks)
1257 E = H->second.end();
1270 for (auto &UE : Unresolved) {
1283 for (auto &UDU : Unresolved) {
2095 ActiveModule->MissingHeaders.begin(), ActiveModule->MissingHeaders.end());
2432 llvm::array_pod_sort(Headers.begin(), Headers.end(), compareModuleHeaders);
2434 for (auto &Header : Headers)
3006 for (const auto &Cb : Callbacks)
tools/clang/lib/Lex/PPDirectives.cpp 182 for (char &Ch : LowerInclude) {
1991 std::reverse(Path.begin(), Path.end());
2105 for (auto Component : Components) {
2366 if (llvm::find(Parameters, II) != Parameters.end()) { // C99 6.10.3p6
tools/clang/lib/Lex/PPLexerChange.cpp 537 for (auto *M : AllMods)
tools/clang/lib/Lex/PPMacroExpansion.cpp 531 for (const MacroExpandsInfo &Info : DelayedMacroExpandsCallbacks) {
675 SmallVectorImpl<Token>::iterator ClosingBrace = OldTokens.end();
683 E = OldTokens.end();
722 NewTokens.insert(NewTokens.end(), ArgStartIterator, I);
923 for (SourceRange Range : InitLists)
932 for (SourceRange ParenLocation : ParenHints) {
tools/clang/lib/Lex/Pragma.cpp 146 std::copy(Tokens.begin() + 1, Tokens.end(), Toks.get());
380 std::copy(PragmaToks.begin(), PragmaToks.end(), TokArray);
1097 for (auto IIAndLoc : ModuleName) {
tools/clang/lib/Lex/Preprocessor.cpp 1255 for (auto &Piece : ModuleImportPath) {
tools/clang/lib/Lex/TokenLexer.cpp 476 ResultToks.end())) {
484 ResultToks.end());
533 for (Token &Tok : llvm::make_range(ResultToks.end() - NumToks,
534 ResultToks.end())) {
541 ResultToks.end()-NumToks, ResultToks.end());
541 ResultToks.end()-NumToks, ResultToks.end());
tools/clang/lib/Parse/ParseAST.cpp 168 for (Decl *D : S.WeakTopLevelDecls())
tools/clang/lib/Parse/ParseCXXInlineMethods.cpp 990 std::copy(Toks.begin() + 1, Toks.end(), Buffer.get());
tools/clang/lib/Parse/ParseDecl.cpp 1722 for (ParsedAttr *AL : ToBeMoved) {
4215 FieldDecls.insert(FieldDecls.end(), Fields.begin(), Fields.end());
4215 FieldDecls.insert(FieldDecls.end(), Fields.begin(), Fields.end());
tools/clang/lib/Parse/ParseDeclCXX.cpp 181 for (const auto &ExtraNS : ExtraNSs) {
2803 E = Ranges.end(); I != E; ++I)
tools/clang/lib/Parse/ParseExpr.cpp 1703 for (auto &E : ArgExprs)
1716 for (auto &E : ArgExprs)
2934 for (auto &E : Exprs) {
tools/clang/lib/Parse/ParseObjc.cpp 337 for (const auto &pair : ProtocolIdents) {
434 for (const auto &pair : protocolIdents) {
2268 E = LateParsedObjCMethods.end(); I != E; ++I)
tools/clang/lib/Parse/ParseOpenMP.cpp 1186 for (auto &MTLocDecl : DeclareTargetDecls) {
tools/clang/lib/Parse/ParsePragma.cpp 1373 for (const auto &I : SubjectMatchRuleSet) {
2243 std::copy(Pragma.begin(), Pragma.end(), Toks.get());
2460 std::copy(TokenVector.begin(), TokenVector.end(), TokenArray.get());
2745 std::copy(TokenList.begin(), TokenList.end(), TokenArray.get());
2930 std::copy(TokenList.begin(), TokenList.end(), TokenArray.get());
tools/clang/lib/Parse/ParseStmtAsm.cpp 644 ClobberRefs.insert(ClobberRefs.end(), Clobbers.begin(), Clobbers.end());
644 ClobberRefs.insert(ClobberRefs.end(), Clobbers.begin(), Clobbers.end());
tools/clang/lib/Parse/ParseTentative.cpp 1171 TentativelyDeclaredIdentifiers.end(), II)
1172 != TentativelyDeclaredIdentifiers.end();
tools/clang/lib/Sema/AnalysisBasedWarnings.cpp 1439 for (const auto &P : UsesByStmt) {
1550 llvm::sort(vec->begin(), vec->end(),
1558 for (const auto &U : *vec) {
2099 for (const auto &D : fscope->PossiblyUnreachableDiags) {
2106 for (const auto &D : fscope->PossiblyUnreachableDiags) {
tools/clang/lib/Sema/IdentifierResolver.cpp 75 for (DeclsTy::iterator I = Decls.end(); I != Decls.begin(); --I) {
tools/clang/lib/Sema/JumpDiagnostics.cpp 687 E = GotoJumps.end();
708 E = JumpTargets.end();
753 I = JumpScopes.begin(), E = JumpScopes.end(); I != E; ++I) {
tools/clang/lib/Sema/MultiplexExternalSemaSource.cpp 88 for (auto *S : Sources)
96 for (const auto &S : Sources)
174 for (auto *S : Sources)
241 for (auto &Source : Sources)
tools/clang/lib/Sema/Sema.cpp 363 for (sema::FunctionScopeInfo *FSI : FunctionScopes)
718 for (auto Undef : Undefined) {
766 for (auto &WeakID : WeakIDs)
895 LateParsedInstantiations.end());
916 for (auto PII : Pending)
920 Pending.begin(), Pending.end());
982 LateParsedInstantiations.end());
1753 for (const auto &PUD : Scope->PossiblyUnreachableDiags)
2192 for (auto &I : Exts)
2201 for (auto &I : Exts)
tools/clang/lib/Sema/SemaAccess.cpp 953 CXXBasePath::iterator I = PI->end(), E = PI->begin();
1190 CXXBasePath::iterator i = path.end(), e = path.begin();
1232 if (constrainingBase == path.end())
1240 constrainingBase + 1 != path.end()) {
tools/clang/lib/Sema/SemaAttr.cpp 449 Stack.erase(std::prev(I.base()), Stack.end());
733 for (const auto &Rule : StrictSubjectMatchRuleSet) {
786 for (const PragmaAttributeEntry &Entry :
810 for (auto &Group : PragmaAttributeStack) {
811 for (auto &Entry : Group.Entries) {
819 for (const auto &Rule : Entry.MatchRules) {
tools/clang/lib/Sema/SemaCUDA.cpp 228 Matches.begin(), Matches.end(),
304 for (const auto *B : Bases) {
tools/clang/lib/Sema/SemaChecking.cpp 7512 for (auto E : DiagnosticExprs)
14635 for (MisalignedMember &m : MisalignedMembers) {
14656 if (MA != MisalignedMembers.end() &&
14760 for (FieldDecl *FDI : ReverseMemberChain) {
tools/clang/lib/Sema/SemaCodeComplete.cpp 648 return iterator(DeclOrVector.get<DeclIndexPairVector *>()->end());
5729 for (const auto &C : Intro.Captures) {
8808 Results.insert(Results.end(), Builder.data(),
tools/clang/lib/Sema/SemaConcept.cpp 117 for (const PartialDiagnosticAt &PDiag : EvaluationDiags)
tools/clang/lib/Sema/SemaCoroutine.cpp 1258 for (auto Arg : PlacementArgs)
tools/clang/lib/Sema/SemaDecl.cpp 8081 NearMatch = NearMatches.begin(), NearMatchEnd = NearMatches.end();
8525 E = HistoryStack.end();
10854 UsedEnd = UsedFieldIndex.end(),
10856 OrigEnd = InitFieldIndex.end();
12527 for (auto &it : Notes)
13750 for (const std::pair<SourceLocation, const BlockDecl *> &P :
14660 std::reverse(Namespaces.begin(), Namespaces.end());
14661 for (auto *II : Namespaces)
16698 OMEnd = SO->second.end();
17300 for (const auto &Vec : DupVector) {
17311 for (auto *ECD : llvm::make_range(Vec->begin() + 1, Vec->end()))
tools/clang/lib/Sema/SemaDeclAttr.cpp 984 for (const PartialDiagnosticAt &PDiag : Diags)
5425 Tags.erase(std::unique(Tags.begin(), Tags.end()), Tags.end());
5425 Tags.erase(std::unique(Tags.begin(), Tags.end()), Tags.end());
7754 for (StringRef S : SlotNames) {
tools/clang/lib/Sema/SemaDeclCXX.cpp 757 << llvm::join(BadSpecifiers.begin(), BadSpecifiers.end(), " ");
760 for (auto Loc : BadSpecifierLocs)
769 CPlusPlus20Specifiers.end(), " ");
770 for (auto Loc : CPlusPlus20SpecifierLocs)
2937 Element != Path->end(); ++Element)
3510 UsedEnd = UsedFieldIndex.end(),
3512 OrigEnd = InitFieldIndex.end();
3665 for (ValueDecl* VD : DeclsToRemove)
7171 for (auto &Check : Overriding)
7176 for (auto &Check : Equivalent)
8245 overloadedMethods.end());
8502 for (TemplateParameterList *Params : ParameterLists) {
11839 for (CXXMethodDecl *M : WorkList) {
11858 for (CXXRecordDecl *Class : WorkList)
13665 ConvertedArgs.append(AllArgs.begin(), AllArgs.end());
15585 VTableUses.insert(VTableUses.begin(), NewUses.begin(), NewUses.end());
tools/clang/lib/Sema/SemaDeclObjC.cpp 1498 for (auto proto : protocols) {
3517 for (auto *M : Methods)
4841 D != Decls.end(); ++D) {
tools/clang/lib/Sema/SemaExpr.cpp 222 for (const PartialDiagnosticAt &Suppressed : Pos->second)
1556 for (unsigned I : CompatIndices) {
13998 for (const CXXBasePathElement &B : Path)
14333 for (Capture &Cap : BSI->Captures) {
14995 for (const PartialDiagnosticAt &Note : Notes)
15003 for (const PartialDiagnosticAt &Note : Notes)
15147 LHSs.erase(std::remove(LHSs.begin(), LHSs.end(), BO->getLHS()),
15148 LHSs.end());
15180 for (const auto *L : Rec.Lambdas)
15190 for (auto *BO : Rec.VolatileAssignmentLHSs)
15200 ExprCleanupObjects.end());
15221 ExprCleanupObjects.end());
tools/clang/lib/Sema/SemaExprCXX.cpp 918 for (CXXRecordDecl *Subobject : UnambiguousPublicSubobjects) {
2384 AllocArgs.insert(AllocArgs.end(), PlaceArgs.begin(), PlaceArgs.end());
2576 for (auto Fn : BestDeallocFns)
2633 for (auto &Match : Matches)
2936 for (auto &Match : Matches)
4974 for (Expr &E : OpaqueArgExprs)
7734 if (SI != SemaTypoExprs.end()) {
7828 for (auto Iterator = SemaTypoExprs.begin(); Iterator != SemaTypoExprs.end();) {
tools/clang/lib/Sema/SemaInit.cpp 5926 for (auto &S : Steps)
6680 for (auto E : Path)
9620 CurrentParameterCopyTypes.end()) {
tools/clang/lib/Sema/SemaLambda.cpp 759 for (const ReturnStmt *RS : CSI.Returns) {
1024 for (auto C = Intro.Captures.begin(), E = Intro.Captures.end(); C != E;
tools/clang/lib/Sema/SemaLookup.cpp 3214 for (NamedDecl *CandDecl : Candidates) {
3954 for (Decl *D : ScopeDecls) {
4267 for (TypoResultList::iterator RI = CList.begin(), RIEnd = CList.end();
4397 for (const TypoCorrection &QR : QualifiedResults) {
4556 CurNameSpecifierIdentifiers.end(),
4557 Name) != CurNameSpecifierIdentifiers.end()) {
4567 CurContextIdentifiers.end()) {
4931 for (auto *N : ExternalKnownNamespaces)
5312 OwningModules.insert(OwningModules.end(), Merged.begin(), Merged.end());
tools/clang/lib/Sema/SemaObjCProperty.cpp 890 for (ObjCPropertyDecl *Prop : Properties) {
955 for (const auto &Note : Mismatches)
981 for (const auto &Note : Mismatches) {
2279 I = DesignatedInits.begin(), E = DesignatedInits.end(); I != E; ++I) {
tools/clang/lib/Sema/SemaOpenMP.cpp 3706 for (const OMPLinearClause *C : LCs) {
3729 for (const clang::OMPClauseWithPreInit *C : PICs) {
4063 for (SourceLocation Loc : NameModifierLoc) {
12718 for (U &Set : Lookups) {
12845 for (const UnresolvedSet<8> &Set : Lookups) {
13358 for (llvm::APSInt &Size : ArraySizes)
15164 for (const UnresolvedSet<8> &Set : Lookups) {
15357 CurComponents.end());
15414 assert(I != CurComponents.end() && "Null decl on map clause.");
15499 CurComponents.end());
tools/clang/lib/Sema/SemaOverload.cpp 906 i = Entries.begin(), e = Entries.end(); i != e; ++i)
6506 Attrs.begin(), Attrs.end(),
6521 for (const auto *DIA : llvm::make_range(WarningBegin, Attrs.end()))
9628 for (auto *Cand : Candidates) {
9650 for (auto *Cand : Candidates) {
11230 for (I = Cands.begin(), E = Cands.end(); I != E; ++I) {
11396 for (auto I = Matches.begin()+1, E = Matches.end(); I != E; ++I)
tools/clang/lib/Sema/SemaPseudoObject.cpp 1524 ArgExprs.append(CallArgs.begin(), CallArgs.end());
tools/clang/lib/Sema/SemaStmt.cpp 1083 if (I != CaseVals.end() && I->first < CRHi) {
1089 I = std::upper_bound(I, CaseVals.end(), CRHi, CaseCompareFunctor());
1147 std::unique(EnumVals.begin(), EnumVals.end(), EqEnumVals);
1151 CI != CaseVals.end(); CI++) {
1206 while (CI != CaseVals.end() && CI->first < EI->first)
1209 if (CI != CaseVals.end() && CI->first == EI->first)
1301 std::unique(EnumVals.begin(), EnumVals.end(), EqEnumVals);
1570 for (auto Range : Ranges)
4280 for (const sema::Capture &Cap : RSI->Captures) {
tools/clang/lib/Sema/SemaStmtAsm.cpp 63 for (Expr *E : ParentsToUpdate)
675 std::stable_sort(NamedOperandList.begin(), NamedOperandList.end(),
685 if (Found != NamedOperandList.end()) {
788 for (StringRef NextMember : Members) {
tools/clang/lib/Sema/SemaTemplate.cpp 2709 std::reverse(NestedTypes.begin(), NestedTypes.end());
3162 for (Expr *Term : Terms) {
4124 PEnd = Matched.end();
4135 PEnd = Matched.end();
4173 for (MatchResult P : Matched)
4239 for (TemplateArgument &Arg : Converted) {
5303 Converted.insert(Converted.end(),
5304 ArgumentPack.begin(), ArgumentPack.end());
8359 for (auto &P : DiscardedCandidates)
tools/clang/lib/Sema/SemaTemplateDeduction.cpp 791 for (auto &Pack : Packs) {
817 for (auto &Pack : Packs)
842 for (auto &Pack : Packs) {
866 for (auto &Pack : Packs) {
895 std::copy(Pack.New.begin(), Pack.New.end(), ArgumentPack);
1762 Deduced.end());
2865 SmallVector<TemplateArgument, 4> DeducedArgs(Deduced.begin(), Deduced.end());
2906 SmallVector<TemplateArgument, 4> DeducedArgs(Deduced.begin(), Deduced.end());
3324 SmallVector<TemplateArgument, 4> DeducedArgs(Deduced.begin(), Deduced.end());
4573 for (const OriginalCallArg &OriginalArg : OriginalCallArgs) {
4769 Args1.insert(Args1.end(), Proto1->param_type_begin(),
4771 Args2.insert(Args2.end(), Proto2->param_type_begin(),
5086 Deduced.end());
tools/clang/lib/Sema/SemaTemplateInstantiate.cpp 2231 E = LateAttrs.end(); I != E; ++I) {
2552 PEnd = Matched.end();
2564 PEnd = Matched.end();
2584 PEnd = Matched.end();
tools/clang/lib/Sema/SemaTemplateInstantiateDecl.cpp 205 for (const auto &P : Diags)
861 for (auto *NewBD : NewBindings)
tools/clang/lib/Sema/SemaTemplateVariadic.cpp 281 for (auto *SI : FunctionScopes)
311 if (std::find_if(LSI->LocalPacks.begin(), LSI->LocalPacks.end(),
312 DeclaresThisPack) != LSI->LocalPacks.end())
332 Func->CompoundScopes.begin(), Func->CompoundScopes.end(),
tools/clang/lib/Sema/SemaType.cpp 270 for (TypeAttrPair &A : AttrsForTypes) {
289 AttrsForTypes.begin(), AttrsForTypes.end(),
291 It != AttrsForTypes.end() && It->first == AT; ++It) {
334 for (ParsedAttr *AL : savedAttrs)
818 for (ParsedAttr *AL : ToBeRemoved)
tools/clang/lib/Sema/TreeTransform.h11577 for (InitCaptureInfoTy &Info : NewC.Expansions) {
tools/clang/lib/Serialization/ASTReader.cpp 406 ExistingFeatures.begin(), ExistingFeatures.end(), ReadFeatures.begin(),
407 ReadFeatures.end(), std::back_inserter(UnmatchedExistingFeatures));
408 std::set_difference(ReadFeatures.begin(), ReadFeatures.end(),
409 ExistingFeatures.begin(), ExistingFeatures.end(),
418 for (StringRef Feature : UnmatchedReadFeatures)
421 for (StringRef Feature : UnmatchedExistingFeatures)
2159 std::reverse(ModuleMacros.begin(), ModuleMacros.end());
2161 for (auto &MMR : ModuleMacros) {
2163 for (unsigned ModID : MMR.Overrides) {
2453 Filename.assign(Buffer.begin(), Buffer.end());
3211 F.PreloadIdentifierOffsets.assign(Record.begin(), Record.end());
3707 LateParsedTemplates.append(Record.begin(), Record.end());
4044 I = Exports.begin(), E = Exports.end(); I != E; ++I) {
4189 for (const ImportedModule &IM : Loaded)
4211 MEnd = Loaded.end();
4273 MEnd = Loaded.end();
4340 ImportedModules.end());
4691 std::copy(Record.begin(), Record.end(), F->Signature.data());
4707 F->PragmaDiagMappings.insert(F->PragmaDiagMappings.end(),
4708 Record.begin(), Record.end());
4924 for (auto &Import : ImportedModules) {
5654 for (auto &ID : Record)
8065 for (DeclID ID : It->second.Table.find(Name)) {
8086 for (DeclID ID : It->second.Table.findAll()) {
8155 SelectorsLoaded.end(),
8290 for (uint64_t ID : PreloadedDeclIDs) {
8553 InstanceMethods.append(Data.Instance.begin(), Data.Instance.end());
8554 FactoryMethods.append(Data.Factory.begin(), Data.Factory.end());
9746 E = CommentsCursors.end();
10079 for (auto &RecordPair : Merge.second) {
10094 for (auto &FD : Merge.second) {
10106 for (auto &Enum : Merge.second) {
10247 for (auto &RecordPair : Merge.second) {
10402 auto FirstEnd = FirstTemplateHashes.end();
10640 while (FirstIt != FirstHashes.end() || SecondIt != SecondHashes.end()) {
10640 while (FirstIt != FirstHashes.end() || SecondIt != SecondHashes.end()) {
10641 if (FirstIt != FirstHashes.end() && SecondIt != SecondHashes.end() &&
10641 if (FirstIt != FirstHashes.end() && SecondIt != SecondHashes.end() &&
10648 FirstDecl = FirstIt == FirstHashes.end() ? nullptr : FirstIt->first;
10649 SecondDecl = SecondIt == SecondHashes.end() ? nullptr : SecondIt->first;
11802 for (auto &SecondFunction : Merge.second) {
11980 for (auto &SecondEnum : Merge.second) {
12193 for (auto *ND : It->second)
tools/clang/lib/Serialization/ASTReaderDecl.cpp 275 IDs.insert(IDs.end(), Old + 1, Old + 1 + Old[0]);
277 IDs.erase(std::unique(IDs.begin(), IDs.end()), IDs.end());
277 IDs.erase(std::unique(IDs.begin(), IDs.end()), IDs.end());
282 std::copy(IDs.begin(), IDs.end(), Result + 1);
3948 for (auto ID : EagerlyDeserializedDecls)
3981 for (auto &FileAndOffset : UpdateOffsets) {
4039 for (const auto &Update : VisibleUpdates)
tools/clang/lib/Serialization/ASTReaderInternals.h 73 Found.insert(Data.begin(), Data.end());
tools/clang/lib/Serialization/ASTReaderStmt.cpp 214 std::copy(Attrs.begin(), Attrs.end(), S->getAttrArrayPtr());
tools/clang/lib/Serialization/ASTWriter.cpp 1531 BaseDirectory.assign(BaseDir.begin(), BaseDir.end());
2132 for (auto U : M->MissingHeaders) {
2553 for (const IdentifierInfo *Name : MacroIdentifiers) {
2985 for (const auto &R : Mod->Requirements) {
3016 for (auto &H : Mod->Headers[HL.HeaderKind])
3039 for (const auto &E : Mod->Exports) {
3053 for (const auto &LL : Mod->LinkLibraries) {
3167 for (auto &StatePoint : FileIDAndFile.second.StateTransitions) {
3287 for (auto &FileDeclEntry : SortedFileDeclIDs) {
3290 for (auto &LocDeclEntry : Info.DeclIDs)
3792 for (const IdentifierInfo *II : IIs)
4146 for (auto &Name : Names)
4158 for (auto &Name : Names) {
4227 for (auto &NameAndResult : LookupResults) {
4353 for (const ElementTy &E : StableOpenCLTypeExtMap) {
4385 for (const ElementTy &E : StableOpenCLDeclExtMap) {
4435 llvm::array_pod_sort(CategoriesMap.begin(), CategoriesMap.end());
4469 for (const auto &Tok : LPT.Toks) {
4511 for (const auto &StackEntry : SemaRef.PackStack.Stack) {
4598 Record.insert(Record.end(), Str.begin(), Str.end());
4869 for (const auto &I : Undefined) {
4960 for (const auto *I : DeclsToEmitEvenIfUnreferenced) {
4975 for (const IdentifierInfo *II : IIs) {
4994 for (auto &Selector : AllSelectors)
5215 Imports.erase(std::unique(Imports.begin(), Imports.end(), Eq),
5216 Imports.end());
5219 for (const auto &Import : Imports) {
5265 for (auto &Update : DeclUpdate.second) {
tools/clang/lib/Serialization/ASTWriterDecl.cpp 231 for (auto *D : Specs) {
tools/clang/lib/Serialization/GlobalModuleIndex.cpp 216 Modules[ID].Dependencies.insert(Modules[ID].Dependencies.end(),
376 for (auto &MI : Modules) {
808 Record.append(M->second.Dependencies.begin(), M->second.Dependencies.end());
tools/clang/lib/Serialization/ModuleManager.cpp 246 Roots.erase(std::remove_if(Roots.begin(), Roots.end(), IsVictim),
247 Roots.end());
252 PCHChain.erase(llvm::find(PCHChain, &*I), PCHChain.end());
270 Chain.erase(Chain.begin() + (First - begin()), Chain.end());
tools/clang/lib/Serialization/MultiOnDiskHashTable.h 213 OverriddenFiles.end());
tools/clang/lib/StaticAnalyzer/Checkers/CallAndMessageChecker.cpp 287 DI = F.FieldChain.begin(), DE = F.FieldChain.end(); DI!=DE;++DI){
tools/clang/lib/StaticAnalyzer/Checkers/DebugCheckers.cpp 277 llvm::array_pod_sort(Keys.begin(), Keys.end(), compareEntry);
tools/clang/lib/StaticAnalyzer/Checkers/DereferenceChecker.cpp 188 I = Ranges.begin(), E = Ranges.end(); I!=E; ++I)
tools/clang/lib/StaticAnalyzer/Checkers/GCDAntipatternChecker.cpp 215 for (BoundNodes Match : Matches)
220 for (BoundNodes Match : Matches)
tools/clang/lib/StaticAnalyzer/Checkers/GenericTaintChecker.cpp 306 for (int Arg : Args) {
tools/clang/lib/StaticAnalyzer/Checkers/LLVMConventionsChecker.cpp 268 E=FieldChain.end(); I!=E; ++I) {
tools/clang/lib/StaticAnalyzer/Checkers/MPI-Checker/MPIChecker.cpp 79 for (const auto &ReqRegion : ReqRegions) {
tools/clang/lib/StaticAnalyzer/Checkers/MacOSKeychainAPIChecker.cpp 575 for (const auto &P : Errors)
tools/clang/lib/StaticAnalyzer/Checkers/MallocChecker.cpp 2669 I = Errors.begin(), E = Errors.end(); I != E; ++I) {
tools/clang/lib/StaticAnalyzer/Checkers/MallocOverflowSecurityChecker.cpp 156 toScanFor.erase(std::remove_if(toScanFor.begin(), toScanFor.end(), P),
157 toScanFor.end());
283 e = PossibleMallocOverflows.end();
tools/clang/lib/StaticAnalyzer/Checkers/OSObjectCStyleCast.cpp 79 for (BoundNodes Match : Matches)
tools/clang/lib/StaticAnalyzer/Checkers/ObjCAutoreleaseWriteChecker.cpp 202 for (BoundNodes Match : Matches)
tools/clang/lib/StaticAnalyzer/Checkers/PointerIterationChecker.cpp 88 for (const auto &Match : Matches)
tools/clang/lib/StaticAnalyzer/Checkers/PointerSortingChecker.cpp 101 for (const auto &Match : Matches)
tools/clang/lib/StaticAnalyzer/Checkers/RetainCountChecker/RetainCountChecker.cpp 702 for (ProgramStateRef St : Out) {
1322 for (SymbolRef L : Leaked) {
1448 for (SymbolRef L : Leaked)
tools/clang/lib/StaticAnalyzer/Checkers/RunLoopAutoreleaseLeakChecker.cpp 169 for (BoundNodes Match : Matches)
190 for (BoundNodes Match : Matches)
tools/clang/lib/StaticAnalyzer/Checkers/StackAddrEscapeChecker.cpp 184 for (const MemRegion *Region : getCapturedStackRegions(B, C)) {
213 for (const MemRegion *Region : getCapturedStackRegions(B, C)) {
341 for (const auto &P : Cb.V) {
tools/clang/lib/StaticAnalyzer/Core/BugReporter.cpp 1446 if (llvm::find(SrcContexts, DstContext) != SrcContexts.end())
2719 for (auto &V : visitors) {
2734 for (auto &V : visitors) {
tools/clang/lib/StaticAnalyzer/Core/BugReporterVisitors.cpp 448 for (BoundNodes &Match : Matches) {
727 std::reverse(RegionSequence.begin(), RegionSequence.end());
731 for (const MemRegion *R : RegionSequence) {
tools/clang/lib/StaticAnalyzer/Core/CheckerManager.cpp 94 for (const auto checker : *checkers)
tools/clang/lib/StaticAnalyzer/Core/LoopWidening.cpp 72 for (BoundNodes Match : Matches) {
tools/clang/lib/StaticAnalyzer/Core/PlistDiagnostics.cpp 394 for (const PathDiagnosticMacroPiece *P : MacroPieces) {
792 for (FileID FID : Fids)
1007 ArgEnd = ArgMapIt->second.end();
1220 while (It != CurrExpArgTokens.end()) {
tools/clang/lib/StaticAnalyzer/Core/RegionStore.cpp 849 FieldsInBindingKey.end(),
852 return std::equal(FieldsInBindingKey.begin(), FieldsInBindingKey.end(),
974 E = Bindings.end();
1098 for (BoundNodes &Match : Matches) {
2073 E = Bindings.end();
2359 for (FieldVector::iterator I = Fields.begin(), E = Fields.end(); I != E; ++I){
2629 for (auto I = Postponed.begin(), E = Postponed.end(); I != E; ++I) {
tools/clang/lib/StaticAnalyzer/Core/Store.cpp 54 for (const auto &I : InitialBindings)
tools/clang/lib/StaticAnalyzer/Frontend/CheckerRegistry.cpp 63 assert(std::is_sorted(Collection.begin(), Collection.end(),
289 for (const std::pair<StringRef, StringRef> &Entry : Dependencies) {
366 assert(It != Collection.end() &&
376 for (const std::pair<StringRef, CmdLineOption> &CheckerOptEntry :
383 for (const std::pair<StringRef, CmdLineOption> &PackageOptEntry :
tools/clang/lib/Tooling/ASTDiff/ASTDiff.cpp 228 for (NodeId Child : N.Children)
tools/clang/lib/Tooling/Core/Lookup.cpp 68 for (; FromIter != FromNamespaces.end() && UseIter != UseNamespaces.end();
68 for (; FromIter != FromNamespaces.end() && UseIter != UseNamespaces.end();
79 assert(FromIter == FromNamespaces.end() && UseIter == UseNamespaces.end());
79 assert(FromIter == FromNamespaces.end() && UseIter == UseNamespaces.end());
153 for (const auto *NS : EnclosingNamespaces) {
tools/clang/lib/Tooling/DependencyScanning/DependencyScanningFilesystem.cpp 80 for (const auto &Range : SkippedRanges) {
tools/clang/lib/Tooling/Inclusions/HeaderIncludes.cpp 252 for (auto Line : Lines) {
tools/clang/lib/Tooling/InterpolatingCompilationDatabase.cpp 145 ArgList = {TmpArgv.begin(), TmpArgv.end()};
404 for (StringRef Dir : Dirs)
tools/clang/lib/Tooling/JSONCompilationDatabase.cpp 153 std::vector<std::string> Result(T.begin(), T.end());
tools/clang/lib/Tooling/Refactoring/ASTSelection.cpp 352 std::cref(ASTSelection), {ParentStack.begin(), ParentStack.end()}});
360 std::cref(ASTSelection), {ParentStack.begin(), ParentStack.end()}});
tools/clang/lib/Tooling/Refactoring/AtomicChange.cpp 100 for (llvm::StringRef Line : Lines)
tools/clang/lib/Tooling/Transformer/RewriteRule.cpp 72 for (auto &Case : Rule.Cases)
tools/clang/lib/Tooling/Transformer/Transformer.cpp 52 for (const auto &T : *Transformations) {
tools/clang/tools/driver/driver.cpp 237 for (const char *Opt : Opts)
346 }) != argv.end()) {
350 for (const char *F : argv) {
374 auto FirstArg = std::find_if(argv.begin() + 1, argv.end(),
376 if (FirstArg != argv.end() && StringRef(*FirstArg).startswith("-cc1")) {
379 auto newEnd = std::remove(argv.begin(), argv.end(), nullptr);
406 argv.insert(argv.begin() + 1, PrependedOpts.begin(), PrependedOpts.end());
415 argv.append(AppendedOpts.begin(), AppendedOpts.end());
476 for (const auto &P : FailingCommands) {
tools/clang/tools/extra/clang-change-namespace/ChangeNamespace.cpp 241 auto DeclE = DeclNsSplitted.end();
243 auto NsE = NsNameSplitted.end();
317 for (auto I = NsSplitted.begin() + 1, E = NsSplitted.end(); I != E; ++I) {
tools/clang/tools/extra/clang-change-namespace/tool/ClangChangeNamespace.cpp 93 for (auto Line : Lines)
tools/clang/tools/extra/clang-doc/Representation.cpp 158 std::move(Other.Loc.begin(), Other.Loc.end(), std::back_inserter(Loc));
159 std::sort(Loc.begin(), Loc.end());
160 auto Last = std::unique(Loc.begin(), Loc.end());
161 Loc.erase(Last, Loc.end());
tools/clang/tools/extra/clang-include-fixer/IncludeFixerContext.cpp 58 while (FullySymbolQualifiersIter != FullySymbolQualifiers.end() &&
59 SymbolScopedQualifiersIter != ScopedQualifiers.end()) {
66 for (; FullySymbolQualifiersIter != FullySymbolQualifiers.end();
tools/clang/tools/extra/clang-include-fixer/tool/ClangIncludeFixer.cpp 174 for (StringRef Pair : SemicolonSplits) {
tools/clang/tools/extra/clang-move/Move.cpp 556 for (StringRef SymbolName : Context->Spec.Names) {
tools/clang/tools/extra/clang-reorder-fields/ReorderFieldsAction.cpp 110 for (BoundNodes &BN : FoundExprs)
291 for (auto Result :
tools/clang/tools/extra/clang-tidy/ClangTidy.cpp 177 for (auto Fix : FixLocations) {
tools/clang/tools/extra/clang-tidy/ClangTidyDiagnosticConsumer.cpp 288 return llvm::find(Checks, CheckName) != Checks.end();
tools/clang/tools/extra/clang-tidy/bugprone/BranchCloneCheck.cpp 189 auto End = Branches.end();
tools/clang/tools/extra/clang-tidy/bugprone/ExceptionEscapeCheck.cpp 38 FunctionsThatShouldNotThrowVec.end());
43 IgnoredExceptionsVec.end());
tools/clang/tools/extra/clang-tidy/bugprone/UseAfterMoveCheck.cpp 140 for (const Stmt *Reinit : ReinitsToDelete) {
145 for (const DeclRefExpr *Use : Uses) {
202 std::sort(Uses->begin(), Uses->end(),
339 for (const auto &Match : Matches) {
tools/clang/tools/extra/clang-tidy/cert/ProperlySeededRandomGeneratorCheck.cpp 113 if (llvm::find(DisallowedSeedTypes, SeedType) != DisallowedSeedTypes.end()) {
tools/clang/tools/extra/clang-tidy/cppcoreguidelines/ProTypeMemberInitCheck.cpp 55 for (const auto &Match : Matches)
79 return llvm::join(Names.begin(), Names.end(), ", ");
240 for (const auto &Insertion :
tools/clang/tools/extra/clang-tidy/misc/NewDeleteOverloadsCheck.cpp 204 for (const auto *FD : Diagnose)
tools/clang/tools/extra/clang-tidy/modernize/ConcatNestedNamespacesCheck.cpp 55 std::for_each(std::next(Namespaces.begin()), Namespaces.end(),
tools/clang/tools/extra/clang-tidy/modernize/PassByValueCheck.cpp 201 for (const ParmVarDecl *ParmDecl : collectParamDecls(Ctor, ParamDecl)) {
tools/clang/tools/extra/clang-tidy/modernize/UseOverrideCheck.cpp 147 for (Token T : Tokens) {
175 auto LastTokenIter = std::prev(Tokens.end());
221 for (Token Tok : Tokens) {
tools/clang/tools/extra/clang-tidy/modernize/UseTrailingReturnTypeCheck.cpp 341 for (ClassifiedToken CT : *MaybeTokens) {
tools/clang/tools/extra/clang-tidy/openmp/ExceptionEscapeCheck.cpp 36 IgnoredExceptionsVec.end());
tools/clang/tools/extra/clang-tidy/readability/ConstReturnTypeCheck.cpp 118 for (auto &Hint : CR.Hints)
121 for (auto Loc : CR.DeclLocs)
tools/clang/tools/extra/clang-tidy/readability/IdentifierNamingCheck.cpp 296 for (auto Substr : Substrs) {
325 for (auto const &Word : Words) {
333 for (auto const &Word : Words) {
341 for (auto const &Word : Words) {
348 for (auto const &Word : Words) {
359 for (auto const &Word : Words) {
368 for (auto const &Word : Words) {
tools/clang/tools/extra/clang-tidy/readability/InconsistentDeclarationParameterNameCheck.cpp 162 std::sort(InconsistentDeclarations.begin(), InconsistentDeclarations.end(),
tools/clang/tools/extra/clang-tidy/readability/MagicNumbersCheck.cpp 87 IgnoredFloatingPointValues.end());
89 IgnoredDoublePointValues.end());
tools/clang/tools/extra/clang-tidy/readability/NamedParameterCheck.cpp 91 for (auto P : UnnamedParams) {
tools/clang/tools/extra/clang-tidy/readability/NamespaceCommentCheck.cpp 92 for (const auto &EndOfNameLocation : Ends) {
tools/clang/tools/extra/clang-tidy/readability/RedundantPreprocessorCheck.cpp 75 for (const auto &Entry : Stack) {
tools/clang/tools/extra/clang-tidy/utils/ExceptionAnalyzer.cpp 66 for (const Type *T : TypesToDelete)
89 for (const Type *T : TypesToDelete)
tools/clang/tools/extra/clang-tidy/utils/ExprSequence.cpp 56 for (const Stmt *Parent : getParentStmts(Descendant, Context)) {
87 for (const Stmt *Parent : getParentStmts(Before, Context)) {
101 for (const Stmt *Parent : getParentStmts(S, Context)) {
tools/clang/tools/extra/clang-tidy/utils/HeaderFileExtensionsUtils.cpp 47 for (StringRef Suffix : Suffixes) {
tools/clang/tools/extra/clang-tidy/utils/IncludeSorter.cpp 130 for (const std::string &IncludeEntry : IncludeBucket[IncludeKind]) {
186 auto SourceLocationIteratorEnd = SourceLocations.end();
192 IncludeBucket[IncludeKind].end());
193 for (const auto &IncludeEntry : IncludeBucket[IncludeKind]) {
196 SourceRangeVector::iterator LocationIteratorEnd = Location.end();
tools/clang/tools/extra/clang-tidy/utils/OptionsUtils.cpp 22 for (StringRef &Name : Names) {
tools/clang/tools/extra/clang-tidy/utils/TransformerClangTidyCheck.cpp 98 for (const auto &T : *Transformations)
tools/clang/tools/extra/clangd/CodeComplete.cpp 354 Completion.Includes.end(),
1614 for (const auto &Candidate : Bundle) {
tools/clang/tools/extra/clangd/Diagnostics.cpp 577 std::replace(Message.begin(), Message.end(), '\n', ' ');
tools/clang/tools/extra/clangd/FileDistance.cpp 100 for (auto Child : DownEdges.lookup(llvm::hash_value(llvm::StringRef(""))))
106 for (auto Child : DownEdges.lookup(Parent)) {
tools/clang/tools/extra/clangd/FindTarget.cpp 368 for (const auto &Entry : allTargetDecls(N)) {
398 for (auto &D : Decls) {
410 Targets.insert(Targets.end(), TemplatePatterns.begin(),
411 TemplatePatterns.end());
698 for (const auto &R : explicitReference(N))
760 for (const NamedDecl *T : R.Targets) {
tools/clang/tools/extra/clangd/Headers.cpp 107 for (const auto &Include : Includes)
154 for (const auto &Child : IncludeChildren.lookup(Parent)) {
tools/clang/tools/extra/clangd/IncludeFixer.cpp 169 for (const auto &Inc : getRankedIncludes(Sym)) {
tools/clang/tools/extra/clangd/QueryDriverDatabase.cpp 68 if (StartIt == Lines.end()) {
74 llvm::find_if(llvm::make_range(StartIt, Lines.end()),
76 if (EndIt == Lines.end()) {
tools/clang/tools/extra/clangd/SourceCode.cpp 887 for (llvm::StringRef &R : Results)
911 for (llvm::StringRef Enclosing : ancestorNamespaces(Current)) {
923 for (llvm::StringRef Enclosing : ancestorNamespaces(Current)) {
955 for (char &C : Word)
tools/clang/tools/extra/clangd/URI.cpp 47 return std::string(Path.begin(), Path.end());
tools/clang/tools/extra/clangd/XRefs.cpp 1312 for (const Decl *D : Ref.Targets) {
tools/clang/tools/extra/clangd/index/Merge.cpp 200 for (auto &SI : S.IncludeHeaders) {
tools/clang/tools/extra/clangd/index/Serialization.cpp 330 for (auto &I : Sym.IncludeHeaders) {
tools/clang/tools/extra/clangd/index/Symbol.h 165 for (auto &Include : S.IncludeHeaders)
tools/clang/tools/extra/clangd/index/dex/PostingList.cpp 53 CurrentID = std::partition_point(CurrentID, DecompressedChunk.end(),
80 for (const DocID Doc : C.decompress()) {
tools/clang/tools/extra/clangd/index/dex/dexp/Dexp.cpp 143 Request.Scopes = {Scopes.begin(), Scopes.end()};
310 for (llvm::StringRef S : Args)
tools/clang/tools/extra/clangd/refactor/tweaks/DefineInline.cpp 175 for (const NamedDecl *ND : Ref.Targets) {
379 for (auto &Pair : Edits)
tools/clang/tools/extra/clangd/refactor/tweaks/ExtractVariable.cpp 256 for (const SelectionTree::Node *Child : SelectedOperands)
tools/clang/tools/extra/clangd/refactor/tweaks/RemoveUsingNamespace.cpp 151 for (auto *T : Ref.Targets) {
tools/clang/tools/extra/clangd/tool/ClangdMain.cpp 397 return std::string(Path.begin(), Path.end());
tools/clang/tools/extra/clangd/unittests/FindTargetTests.cpp 90 for (const auto &Entry : allTargetDecls(N->ASTNode))
tools/clang/tools/extra/clangd/unittests/TestTU.cpp 132 for (auto NameIt = Components.begin(), End = Components.end() - 1;
tools/clang/tools/extra/modularize/Modularize.cpp 885 for (auto &CompileCheckFile : ModUtil->HeaderFileNames) {
929 for (EntryBinArray::iterator CI = EntryBins.begin(), CE = EntryBins.end();
940 for (EntryBinArray::iterator DI = EntryBins.begin(), DE = EntryBins.end();
950 for (LocationArray::iterator FE = DI->end(); FI != FE; ++FI) {
tools/clang/tools/extra/modularize/ModularizeUtilities.cpp 158 E = Strings.end();
231 E = Strings.end();
498 for(auto &TestFilePath : ProblemFileNames) {
515 for (auto &ProblemFile : ProblemFileNames) {
523 for (auto &GoodFile : HeaderFileNames) {
525 for (auto &ProblemFile : ProblemFileNames) {
540 for (auto &File : HeaderFileNames) {
542 for (auto &ProblemFile : ProblemFileNames) {
tools/clang/tools/extra/modularize/PreprocessorTracker.cpp 803 E = Headers.end();
tools/clang/tools/extra/pp-trace/PPTrace.cpp 140 for (StringRef Pattern : Patterns) {
tools/clang/tools/extra/unittests/clang-tidy/ClangTidyTest.h 69 for (auto &Check : Checks) {
tools/clang/tools/libclang/CIndex.cpp 338 for (SmallVectorImpl<Decl *>::iterator DE = Decls.end(); DIt != DE; ++DIt) {
864 llvm::array_pod_sort(WrittenInits.begin(), WrittenInits.end(),
1055 E = DeclsInContainer.end(); I != E; ++I) {
2136 VisitorWorkList::iterator I = WL.begin() + size, E = WL.end();
2460 VisitorWorkList::iterator I = WL.begin() + size, E = WL.end();
2585 VisitorWorkList::iterator I = WL.begin() + size, E = WL.end();
7884 AvailabilityAttrs.begin(), AvailabilityAttrs.end(),
7922 AvailabilityAttrs.erase(It, AvailabilityAttrs.end());
tools/clang/tools/libclang/CIndexHigh.cpp 39 I = Overridden.begin(), E = Overridden.end(); I != E; ++I)
118 I = methods.begin(), E = methods.end(); I != E; ++I) {
tools/clang/tools/libclang/CIndexer.cpp 166 File = std::string(TempPath.begin(), TempPath.end());
tools/clang/tools/libclang/CXCursor.cpp 114 if (I != SelLocs.end())
570 if (I != SelLocs.end())
1062 I = OverDecls.begin(), E = OverDecls.end(); I != E; ++I) {
tools/clang/tools/libclang/CursorVisitor.h 169 I = WorkListCache.begin(), E = WorkListCache.end(); I != E; ++I) {
tools/clang/unittests/Analysis/CloneDetectionTest.cpp 79 for (auto &Clone : CloneGroups.front()) {
98 for (auto &Clone : CloneGroups.front()) {
tools/clang/unittests/CodeGen/IRMatchers.h 273 for (auto Item : MDs) {
tools/clang/unittests/CodeGen/IncrementalProcessingTest.cpp 90 for (Decl *D : S.WeakTopLevelDecls())
tools/clang/unittests/Frontend/PCHPreambleTest.cpp 37 ++ReadCounts[std::string(PathVec.begin(), PathVec.end())];
tools/clang/unittests/Tooling/CompilationDatabaseTest.cpp 651 return {Ret.begin(), Ret.end()};
674 {Dir, path(File), {Argv.begin(), Argv.end()}, "foo.o"});
tools/clang/unittests/Tooling/LexicallyOrderedRecursiveASTVisitorTest.cpp 76 for (const Decl *D : TraversalStack) {
tools/clang/utils/TableGen/ClangAttrEmitter.cpp 3336 for (auto Str : Frags) {
tools/clang/utils/TableGen/ClangDiagnosticsEmitter.cpp 208 E = SortedGroups.end();
217 E = SortedGroups.end();
tools/clang/utils/TableGen/MveEmitter.cpp 1116 auto it = NameParts.end();
tools/clang/utils/TableGen/NeonEmitter.cpp 2107 for (auto *Def : Defs) {
2145 for (auto *Def : Defs) {
2231 for (auto *Def : Defs) {
2480 for (auto *I : Defs)
2493 I != Defs.end(); /*No step*/) {
2587 for (auto *I : Defs)
2600 I != Defs.end(); /*No step*/) {
tools/dsymutil/MachOUtils.cpp 94 for (auto &Thin : ArchFiles)
98 for (auto &Thin : ArchFiles) {
110 for (auto Arg : Args)
470 for (auto Cmd : BuildVersionCmd) {
tools/llc/llc.cpp 172 for (auto PassName : PassNames)
tools/lld/COFF/Driver.cpp 673 for (StringRef type : types) {
1184 for (StringRef s : vec) {
1371 for (StringRef s : vec) {
tools/lld/COFF/DriverUtils.cpp 100 for (StringRef arg : splitArgs) {
829 for (const char *s : expandedArgv)
836 config->argv = {expandedArgv.begin(), expandedArgv.end()};
906 return std::vector<const char *>(tokens.begin(), tokens.end());
tools/lld/COFF/InputFiles.cpp 460 for (auto &kv : weakAliases) {
tools/lld/COFF/MapFile.cpp 67 std::sort(v.begin(), v.end(), [](DefinedRegular *a, DefinedRegular *b) {
120 for (DefinedRegular *sym : sectionSyms[sc])
tools/lld/Common/Args.cpp 70 for (StringRef s : arr) {
tools/lld/ELF/MapFile.cpp 190 for (Symbol *sym : sectionSyms[isec])
tools/lld/ELF/Thunks.cpp 328 for (Defined *d : syms)
tools/lld/include/lld/Core/Simple.h 218 std::sort(elements.begin(), elements.end(),
231 for (SimpleReference *node : elements) {
tools/lld/lib/ReaderWriter/MachO/MachONormalizedFileToAtoms.cpp 294 std::sort(symbols.begin(), symbols.end(),
343 for (const Symbol *sym : symbols) {
tools/lld/lib/ReaderWriter/MachO/StubsPass.cpp 314 for (const Reference *ref : _targetToUses[target]) {
tools/lld/tools/lld/lld.cpp 87 for (auto it = expandedArgs.begin(); it + 1 != expandedArgs.end(); ++it) {
111 for (StringRef s : v)
tools/lld/wasm/Driver.cpp 363 for (StringRef s : arg->getValues())
tools/lld/wasm/SyntheticSections.cpp 537 if (producers.second->end() ==
567 for (auto &feature : emitted) {
tools/lldb/include/lldb/Utility/RangeMap.h 153 std::stable_sort(m_entries.begin(), m_entries.end());
181 for (pos = m_entries.begin(), end = m_entries.end(), prev = end;
193 for (pos = m_entries.begin(), end = m_entries.end(), prev = end;
233 for (pos = m_entries.begin(), end = m_entries.end(); pos != end; ++pos)
639 std::stable_sort(m_entries.begin(), m_entries.end());
666 for (pos = m_entries.begin(), end = m_entries.end(), prev = end; pos != end;
678 for (pos = m_entries.begin(), end = m_entries.end(), prev = end;
907 typename Collection::iterator end = m_entries.end();
923 if (entry >= &*m_entries.begin() && entry + 1 < &*m_entries.end())
tools/lldb/source/Breakpoint/BreakpointResolver.cpp 216 all_scs.begin(), all_scs.end(), [&](const SymbolContext &sc) {
227 auto worklist_end = all_scs.end();
287 all_scs.erase(worklist_begin, all_scs.end());
tools/lldb/source/Core/ValueObject.cpp 241 std::copy(m_value_checksum.begin(), m_value_checksum.end(),
tools/lldb/source/Expression/IRInterpreter.cpp 1040 for (IndexIterator ii = indices.begin(), ie = indices.end(); ii != ie;
tools/lldb/source/Host/common/FileSystem.cpp 246 SmallString<128> resolved(path.begin(), path.end());
252 SmallString<128> absolute(resolved.begin(), resolved.end());
257 path.append(absolute.begin(), absolute.end());
259 path.append(resolved.begin(), resolved.end());
tools/lldb/source/Host/common/NativeProcessProtocol.cpp 469 llvm::make_range(saved_opcode_bytes.begin(), saved_opcode_bytes.end()));
tools/lldb/source/Interpreter/OptionValueProperties.cpp 203 for (const auto &part : components)
tools/lldb/source/Plugins/Disassembler/llvm/DisassemblerLLVMC.cpp 856 for (const Operand &operand : operands) {
tools/lldb/source/Plugins/ExpressionParser/Clang/ASTUtils.h 314 for (auto *S : Sources)
321 for (const auto &S : Sources)
407 for (auto *S : Sources)
437 for (auto &Source : Sources)
442 for (auto &Source : Sources)
447 for (auto &Source : Sources)
452 for (auto &Source : Sources)
458 for (auto &Source : Sources)
465 for (auto &Source : Sources)
473 for (auto &Source : Sources)
478 for (auto &Source : Sources) {
489 for (auto &Source : Sources)
495 for (auto &Source : Sources)
501 for (auto &Source : Sources)
507 for (auto &Source : Sources)
513 for (auto &Source : Sources)
520 for (auto &Source : Sources)
527 for (auto &Source : Sources)
533 for (auto &Source : Sources)
541 for (auto &Source : Sources)
549 for (auto &Source : Sources)
559 for (auto &Source : Sources) {
570 for (auto &Source : Sources) {
tools/lldb/source/Plugins/ExpressionParser/Clang/ClangASTSource.cpp 1119 for (NamedDecl *named_decl : methods) {
tools/lldb/source/Plugins/ExpressionParser/Clang/ClangModulesDeclVendor.cpp 181 for (clang::Module *module : sub_exports) {
tools/lldb/source/Plugins/ExpressionParser/Clang/IRForTarget.cpp 904 for (Instruction *inst : selector_loads) {
1055 for (Instruction *inst : class_loads) {
1169 for (Instruction *inst : pvar_allocs) {
1374 for (LoadInst *load_instruction : load_instructions) {
1526 for (Instruction *inst : guard_loads)
1529 for (Instruction *inst : guard_stores)
tools/lldb/source/Plugins/LanguageRuntime/RenderScript/RenderScriptRuntime/RenderScriptRuntime.cpp 3020 for (auto line = info_lines.begin(); line != info_lines.end(); ++line) {
3036 if (info_lines.end() - (line + 1) < (ptrdiff_t)n_lines)
4156 for (const auto &name : type_names) {
tools/lldb/source/Plugins/Platform/Android/AdbClient.cpp 168 for (const auto device : devices)
tools/lldb/source/Plugins/Process/Linux/ProcessorTrace.cpp 388 for (auto part : parts) {
tools/lldb/source/Plugins/Process/minidump/MinidumpTypes.cpp 47 for (auto line : lines) {
tools/lldb/source/Plugins/SymbolFile/DWARF/SymbolFileDWARF.cpp 3773 for (const CallSiteParameter ¶m : parameters) {
tools/lldb/source/Plugins/SymbolFile/NativePDB/CompileUnitIndex.cpp 76 cci.m_build_info.assign(bir.ArgIndices.begin(), bir.ArgIndices.end());
tools/lldb/source/Symbol/ClangASTContext.cpp 8057 ife = indirect_fields.end();
tools/lldb/source/Symbol/PostfixExpression.cpp 96 for (llvm::StringRef expr : exprs) {
tools/lldb/source/Symbol/SymbolContext.cpp 881 for (const Symbol *symbol : external_symbols) {
892 for (const Symbol *symbol : internal_symbols) {
tools/lldb/source/Target/StackFrame.cpp 1353 for (const Instruction::Operand &operand : operands) {
tools/lldb/source/Utility/Broadcaster.cpp 60 for (auto it = m_listeners.begin(); it != m_listeners.end();) {
77 for (auto &pair : GetListeners())
128 for (auto &pair : GetListeners()) {
157 for (auto &pair : GetListeners()) {
170 for (auto &pair : GetListeners()) {
231 for (auto &pair : GetListeners()) {
tools/lldb/source/Utility/FileSpec.cpp 63 std::replace(path.begin(), path.end(), '/', '\\');
210 std::replace(resolved.begin(), resolved.end(), '\\', '/');
384 return std::string(result.begin(), result.end());
400 path.insert(path.end(), '/');
tools/lldb/source/Utility/Stream.cpp 252 for (char C : buf)
tools/lldb/tools/driver/Driver.cpp 374 for (auto value : arg->getValues())
tools/lldb/tools/lldb-server/LLDBServerUtilities.cpp 46 for (auto channel_with_categories : channel_array) {
tools/lldb/tools/lldb-test/lldb-test.cpp 246 for (auto entry_str : entries_str) {
tools/lldb/unittests/tools/lldb-server/tests/MessageObjects.cpp 342 for (StringRef s : elements) {
358 for (StringRef s : elements) {
tools/llvm-ar/llvm-ar.cpp 401 Members.assign(PositionalArgs.begin(), PositionalArgs.end());
tools/llvm-cat/llvm-cat.cpp 65 Buffer.insert(Buffer.end(), BitcodeMod.getBuffer().begin(),
tools/llvm-cov/SourceCoverageViewHTML.cpp 317 OS << tag("tr", join(Columns.begin(), Columns.end(), ""));
384 OS << tag("tr", join(Columns.begin(), Columns.end(), ""), "light-row-bold");
386 OS << tag("tr", join(Columns.begin(), Columns.end(), ""), "light-row");
568 for (const auto &Range : HighlightedRanges) {
603 for (const auto &Snippet : Snippets)
tools/llvm-cov/SourceCoverageViewText.cpp 139 for (const auto &Range : HighlightedRanges)
tools/llvm-cxxdump/llvm-cxxdump.cpp 87 for (const SectionRef &SR : SectionRelocMap[Sec]) {
111 for (const SectionRef &SR : SectionRelocMap[Sec]) {
tools/llvm-cxxfilt/llvm-cxxfilt.cpp 127 for (const auto &Word : Words)
tools/llvm-diff/DiffConsumer.cpp 96 I = contexts.begin(), E = contexts.end(); I != E; ++I) {
tools/llvm-diff/DifferenceEngine.cpp 585 PI = Path.begin(), PE = Path.end();
729 I = Queue.begin(), E = Queue.end(); I != E; ++I)
tools/llvm-dwarfdump/llvm-dwarfdump.cpp 376 Dies.erase(std::unique(Dies.begin(), Dies.end()), Dies.end());
376 Dies.erase(std::unique(Dies.begin(), Dies.end()), Dies.end());
378 for (DWARFDie Die : Dies)
tools/llvm-dwp/llvm-dwp.cpp 738 std::make_move_iterator(DWOs->end()));
tools/llvm-exegesis/lib/BenchmarkResult.cpp 77 for (StringRef Piece : Pieces) {
tools/llvm-exegesis/lib/BenchmarkRunner.cpp 51 for (auto &CounterName : CounterNames) {
tools/llvm-exegesis/lib/Latency.cpp 160 for (const auto ExecutionModeBit : getExecutionModeBits(EM & EC.Mask))
tools/llvm-exegesis/lib/MCInstrDescView.cpp 135 for (auto &Op : Operands)
143 for (auto &Op : Operands)
147 for (auto &Op : Operands)
155 for (const auto &Op : Operands) {
tools/llvm-exegesis/lib/SchedClassResolution.cpp 182 for (const MCWriteProcResEntry &WPR : WPRS) {
tools/llvm-exegesis/lib/SnippetGenerator.cpp 221 for (const Variable &Var : IT.Instr.Variables) {
tools/llvm-exegesis/llvm-exegesis.cpp 197 for (const StringRef OpcodeName : Pieces) {
tools/llvm-extract/llvm-extract.cpp 272 for (StringRef BBName : BBNames) {
tools/llvm-lipo/llvm-lipo.cpp 364 for (auto Arg : ActionArgs)
409 for (auto Action : ActionArgs) {
601 for (auto &Slice : Slices) {
715 for (MachO::fat_arch &FA : FatArchList)
790 for (auto &Slice : Slices) {
tools/llvm-mca/Views/BottleneckAnalysis.cpp 45 std::fill(ResourceUsers.begin(), ResourceUsers.end(),
173 for (DGNode &N : Nodes) {
239 for (unsigned IID : RootSet) {
348 for (const DependencyEdge *&DE : Seq) {
440 if (It != Vec.end()) {
520 for (const std::pair<unsigned, unsigned> &U : Users)
tools/llvm-mca/Views/RegisterFileStatistics.cpp 41 std::fill(PRFUsage.begin(), PRFUsage.end(), RFUEmpty);
44 std::fill(MoveElimInfo.begin(), MoveElimInfo.end(), MEIEmpty);
96 for (MoveEliminationInfo &MEI : MoveElimInfo) {
tools/llvm-objcopy/CopyConfig.cpp 274 for (StringRef Line : Lines) {
869 for (StringRef Filename : Positional) {
tools/llvm-objcopy/ELF/ELFObjcopy.cpp 327 for (SectionBase *S : ToReplace)
tools/llvm-objcopy/ELF/Object.cpp 204 assert(Iter == Line.end());
439 std::copy(DecompressedContent.begin(), DecompressedContent.end(), Buf);
983 for (SectionBase *&Sec : GroupMembers)
tools/llvm-objcopy/MachO/MachOWriter.cpp 122 return *std::max_element(Ends.begin(), Ends.end());
472 for (auto WriteOp : Queue)
tools/llvm-objcopy/llvm-objcopy.cpp 344 for (CopyConfig &CopyConfig : DriverConfig->CopyConfigs) {
tools/llvm-objdump/MachODump.cpp 7927 for (auto &Entry : CompactUnwinds) {
tools/llvm-pdbutil/BytesOutputStyle.cpp 481 for (const auto &Spec : Specs) {
tools/llvm-pdbutil/MinimalTypeDumper.cpp 490 auto Max = std::max_element(Indices.begin(), Indices.end());
493 for (auto I : Indices)
tools/llvm-profdata/llvm-profdata.cpp 355 for (std::unique_ptr<WriterContext> &WC : Contexts) {
439 for (StringRef symbol : SymbolVec)
585 for (const StringRef &FileWeightEntry : Entries) {
675 for (auto &WF : WeightedInputs)
tools/llvm-rc/ResourceFileWriter.cpp 169 for (UTF16 &Ch : Chars) {
374 for (auto Ch : ProcessedString)
1272 for (auto Char : Data)
1317 for (auto Ch : ProcessedString) {
1477 *std::max_element(FileVer.begin(), FileVer.end()), "FILEVERSION fields"));
1483 *std::max_element(ProdVer.begin(), ProdVer.end()),
1517 Path.assign(Cwd.begin(), Cwd.end());
tools/llvm-rc/ResourceScriptParser.cpp 775 SmallVector<uint32_t, 4> ArgInts(ArgsResult->begin(), ArgsResult->end());
tools/llvm-readobj/ELFDumper.cpp 1964 for (const auto &Flag : SetFlags) {
4467 for (const auto &Property : getGNUPropertyList<ELFT>(Desc))
5823 for (const auto &Property : getGNUPropertyList<ELFT>(Desc))
tools/llvm-reduce/deltas/ReduceMetadata.cpp 30 for (auto &MD : MDs) {
109 for (auto &MD : MDs)
tools/llvm-rtdyld/llvm-rtdyld.cpp 473 for (auto &D : Lines) {
549 for (auto &FM : MemMgr.FunctionMemory) {
645 for (const auto& CodeSection : MemMgr.FunctionMemory)
647 for (const auto& DataSection : MemMgr.DataMemory)
tools/llvm-xray/xray-converter.cpp 192 for (auto node_iter : map_iter.second) {
200 for (auto *ParentSibling : parent->ExtraData.siblings)
201 for (auto node_iter : ParentSibling->Callees)
222 if (match != ParentCallees.end())
237 for (auto *sibling : CurrentStack->ExtraData.siblings)
tools/llvm-xray/xray-stacks.cpp 388 if (I == Top.first->Callees.end()) {
431 for (auto &E : make_range(I, TS.end() - 1))
441 TS.erase(I, TS.end());
461 reverse(make_range(CurrentStack.begin() + 1, CurrentStack.end()))) {
533 if (MaybeFoundIter == MergedByThreadRoots.end()) {
568 for (const auto *N : RootValues) {
620 for (const auto *N : RootValues) {
645 TopStacksByCount.end(), E,
661 for (const auto &P : TopStacksBySum) {
667 for (const auto &P : TopStacksByCount) {
tools/polly/include/polly/ScopInfo.h 1535 iterator end() { return MemAccs.end(); }
2129 InvariantEquivClasses.end());
tools/polly/lib/Analysis/ScopBuilder.cpp 643 for (auto *LatchBB : LatchBBs)
740 for (BasicBlock *LatchBB : LatchBlocks) {
1296 LoopStack.erase(LoopStack.begin() + Dimension, LoopStack.end());
1699 AccItr->second.Shape->DelinearizedSizes.end());
2693 for (MemoryAccess *LoadMA : Loads)
2698 for (const auto &CandidatePair : Candidates) {
2769 for (auto InvMA : InvariantAccesses)
2992 for (auto &InvMA : InvMAs) {
3012 for (auto &InvMA : InvMAs) {
3150 for (InvariantEquivClassTy &EqClass2 : S.getInvariantAccesses())
3174 for (InvariantEquivClassTy &EqClass : scop->InvariantEquivClasses) {
3204 for (MemoryAccess *Access : Stmt.MemAccs) {
3301 for (MemoryAccess *MA : AliasGroup)
3407 for (AliasGroupTy &AG : AliasGroups) {
3436 for (MemoryAccess *Access : AliasGroup) {
3461 for (MemoryAccess *MA : AliasGroup) {
3471 for (MemoryAccess *MA : AliasGroup) {
3511 while (AGI != AG.end()) {
3651 for (auto GlobalReadPair : GlobalReads) {
tools/polly/lib/Analysis/ScopDetection.cpp 916 for (const SCEV *DelinearizedSize : Sizes) {
995 for (const SCEV *S : Acc->DelinearizedSubscripts)
1265 for (BasicBlock *ControlBB : LoopControlBlocks) {
1314 for (BasicBlock *ExitBB : ExitBlocks) {
1534 for (BasicBlock *Latch : Latches)
tools/polly/lib/Analysis/ScopInfo.cpp 343 for (const SCEV *Expr : DimensionSizes) {
1327 for (auto *MA : MemAccs) {
1333 MemAccs.erase(std::remove_if(MemAccs.begin(), MemAccs.end(), Predicate),
1334 MemAccs.end());
1340 auto MAIt = std::find(MemAccs.begin(), MemAccs.end(), MA);
1341 assert(MAIt != MemAccs.end());
1749 for (MemoryAccess *MA : MAList)
1804 for (auto &IAClass : InvariantEquivClasses) {
2499 auto NewEnd = std::remove(Uses.begin(), Uses.end(), Access);
2500 Uses.erase(NewEnd, Uses.end());
2506 auto NewEnd = std::remove(Incomings.begin(), Incomings.end(), Access);
2507 Incomings.erase(NewEnd, Incomings.end());
tools/polly/lib/CodeGen/BlockGenerators.cpp 1527 for (const PHINodePairTy &PHINodePair : IncompletePHINodeMap[BB])
tools/polly/lib/CodeGen/IRBuilder.cpp 76 for (const ScopArrayInfo *Array : Arrays) {
83 for (const ScopArrayInfo *Array : Arrays) {
tools/polly/lib/CodeGen/IslNodeBuilder.cpp 1517 for (auto &IAClass : InvariantEquivClasses)
tools/polly/lib/Support/ScopHelper.cpp 488 for (auto ExitBlock : ExitBlocks) {
tools/polly/lib/Transform/ForwardOpTree.cpp 848 for (MemoryAccess *RA : Accs) {
tools/polly/lib/Transform/MaximalStaticExpansion.cpp 444 for (auto SAI : CurrentSAI) {
tools/polly/lib/Transform/ScheduleOptimizer.cpp 699 for (auto *MemA = Accesses.begin(); MemA != Accesses.end() - 1; MemA++) {
776 for (auto *MemA = Accesses.end() - 1; MemA != Accesses.begin(); MemA--) {
tools/polly/lib/Transform/Simplify.cpp 421 for (MemoryAccess *MA : Accesses) {
519 for (MemoryAccess *MA : DeferredRemove) {
543 for (MemoryAccess *MA : AllMAs) {
565 for (Instruction *Inst : AllInsts) {
unittests/ADT/DirectedGraphTest.cpp 278 for (auto &SCC : ListOfSCCs) {
284 for (auto &SCC : ListOfSCCs) {
unittests/ADT/IteratorTest.cpp 79 End = test_iterator(V.end());
121 End = test_iterator(V.end());
unittests/ADT/SmallStringTest.cpp 35 EXPECT_TRUE(v.begin() == v.end());
unittests/ADT/SmallVectorTest.cpp 167 EXPECT_TRUE(v.begin() == v.end());
248 EXPECT_FALSE(this->theVector.begin() == this->theVector.end());
376 EXPECT_TRUE(it == this->theVector.end());
419 this->theVector.append(this->otherVector.begin(), this->otherVector.end());
601 auto I = this->theVector.insert(this->theVector.end(), 2, Constructable(16));
621 EXPECT_EQ(this->theVector.end(),
622 this->theVector.insert(this->theVector.end(),
665 auto I = this->theVector.insert(this->theVector.end(), Arr, Arr+3);
686 EXPECT_EQ(this->theVector.end(),
687 this->theVector.insert(this->theVector.end(),
742 this->theVector.insert(this->theVector.end(), L.begin(), L.end());
837 for (MovedFrom &m : v)
unittests/Analysis/DivergenceAnalysisTest.cpp 304 if (ItDivJoins != ItCase.second.end() && &BB == *ItDivJoins) {
unittests/Analysis/LazyCallGraphTest.cpp 977 EXPECT_NE(find(MergedRCs, &BRC), MergedRCs.end());
978 EXPECT_NE(find(MergedRCs, &CRC), MergedRCs.end());
979 EXPECT_NE(find(MergedRCs, &DRC), MergedRCs.end());
1051 EXPECT_NE(find(MergedRCs, &BRC), MergedRCs.end());
1052 EXPECT_NE(find(MergedRCs, &CRC), MergedRCs.end());
1053 EXPECT_NE(find(MergedRCs, &DRC), MergedRCs.end());
unittests/ExecutionEngine/MCJIT/MCJITTestAPICommon.h 74 for(; I != SupportedSubArchs.end(); ++I)
86 UnsupportedEnvironments.end())
unittests/IR/DominatorTreeBatchUpdatesTest.cpp 62 LLVM_DEBUG(for (auto &U : Legalized) { U.dump(); dbgs() << ", "; });
65 EXPECT_NE(llvm::find(Legalized, DomUpdate{Insert, B, C}), Legalized.end());
66 EXPECT_NE(llvm::find(Legalized, DomUpdate{Insert, B, D}), Legalized.end());
67 EXPECT_NE(llvm::find(Legalized, DomUpdate{Delete, A, B}), Legalized.end());
85 LLVM_DEBUG(for (auto &U : Legalized) { U.dump(); dbgs() << ", "; });
88 EXPECT_NE(llvm::find(Legalized, DomUpdate{Insert, C, B}), Legalized.end());
89 EXPECT_NE(llvm::find(Legalized, DomUpdate{Insert, D, B}), Legalized.end());
90 EXPECT_NE(llvm::find(Legalized, DomUpdate{Delete, B, A}), Legalized.end());
unittests/IR/ValueMapTest.cpp 111 VM.insert(Elems.begin(), Elems.end());
unittests/Support/BranchProbabilityTest.cpp 341 BranchProbability::normalizeProbabilities(Probs.begin(), Probs.end());
347 BranchProbability::normalizeProbabilities(Probs.begin(), Probs.end());
353 BranchProbability::normalizeProbabilities(Probs.begin(), Probs.end());
359 BranchProbability::normalizeProbabilities(Probs.begin(), Probs.end());
365 BranchProbability::normalizeProbabilities(Probs.begin(), Probs.end());
375 BranchProbability::normalizeProbabilities(Probs.begin(), Probs.end());
381 BranchProbability::normalizeProbabilities(Probs.begin(), Probs.end());
387 BranchProbability::normalizeProbabilities(Probs.begin(), Probs.end());
394 BranchProbability::normalizeProbabilities(Probs.begin(), Probs.end());
unittests/Support/CommandLineTest.cpp 98 ASSERT_NE(Retrieved->Categories.end(),
106 ASSERT_NE(Retrieved->Categories.end(),
163 ASSERT_NE(TestOption2.Categories.end(),
179 ASSERT_NE(TestOption2.Categories.end(),
185 ASSERT_NE(TestOption2.Categories.end(),
195 ASSERT_EQ(TestOption.Categories.end(),
201 ASSERT_NE(TestOption.Categories.end(),
207 ASSERT_NE(TestOption.Categories.end(),
unittests/Support/Path.cpp 131 e = paths.end();
152 std::reverse(ReverseComponentStack.begin(), ReverseComponentStack.end());
286 for (auto &Path : Paths) {
299 for (auto &Path : RootPaths) {
unittests/Support/TargetParserTest.cpp 321 for(StringRef CPU : List) {
920 for(StringRef CPU : List) {
unittests/Support/ThreadPool.cpp 34 UnsupportedEnvironments.end())
unittests/Transforms/Scalar/LoopPassManagerTest.cpp 1389 for (BasicBlock *LoopBB : LoopBBs) {
1392 for (DomTreeNode *ChildNode : ChildNodes)
1398 for (BasicBlock *LoopBB : LoopBBs)
usr/include/c++/7.4.0/bits/range_access.h 68 end(_Container& __cont) -> decltype(__cont.end())
69 { return __cont.end(); }
usr/include/c++/7.4.0/bits/stl_queue.h 479 { std::make_heap(c.begin(), c.end(), comp); }
598 std::push_heap(c.begin(), c.end(), comp);
606 std::push_heap(c.begin(), c.end(), comp);
633 std::pop_heap(c.begin(), c.end(), comp);
utils/TableGen/AsmMatcherEmitter.cpp 856 for (ResOperand &Op : ResOperands) {
867 for (ResOperand &Op : ResOperands) {
947 for (MatchableInfo::AsmOperand &Op : AsmOperands) {
utils/TableGen/AsmWriterEmitter.cpp 962 for (auto &Op : Ops) {
utils/TableGen/CodeGenDAGPatterns.cpp 192 array_pod_sort(Modes.begin(), Modes.end());
195 for (unsigned M : Modes) {
204 array_pod_sort(Types.begin(), Types.end());
2945 for (TreePatternNode *Node : Nodes) {
3997 for (const Record *Instr : Instrs) {
4030 for (const std::string &Msg : Msgs)
4035 for (const Record *Instr : Instrs) {
utils/TableGen/CodeGenRegisters.cpp 133 I = ConcatenationOf.begin(); I != ConcatenationOf.end(); /*empty*/) {
137 for (CodeGenSubRegIndex *SRI : SubIdx->ConcatenationOf)
146 SubIdx->ConcatenationOf.end());
294 for (CodeGenRegister *ESR : ExplicitSubRegs) {
497 for (CodeGenRegister *SubReg : Cand->ExplicitSubRegs) {
502 for (CodeGenSubRegIndex *SubIdx : SubRegIdx->ConcatenationOf)
1157 SRI.ConcatenationOf.end()), &SRI));
1493 for (auto &I : LaneTransforms) {
utils/TableGen/CodeGenSchedule.cpp 1468 unsigned Cnt = std::count(ProcIndices.begin(), ProcIndices.end(),
1535 RWSequences.insert(RWSequences.end(), SelectedRWs.size() - 1,
1548 RWSequences[OperIdx].insert(RWSequences[OperIdx].end(),
1565 Seq.insert(Seq.end(), ExpandedRWs.begin(), ExpandedRWs.end());
utils/TableGen/CodeGenTarget.cpp 382 LegalValueTypes.insert(LegalValueTypes.end(), RC.VTs.begin(), RC.VTs.end());
387 LegalValueTypes.end()),
388 LegalValueTypes.end());
utils/TableGen/DAGISelMatcher.cpp 81 for (Matcher *C : Children)
86 for (auto &C : Cases)
91 for (auto &C : Cases)
utils/TableGen/DAGISelMatcherOpt.cpp 440 for (auto &M : Cases) {
utils/TableGen/DFAEmitter.cpp 63 for (state_type &FromState : DS) {
78 NewStates.erase(std::unique(NewStates.begin(), NewStates.end()),
79 NewStates.end());
81 TI.erase(std::unique(TI.begin(), TI.end()), TI.end());
81 TI.erase(std::unique(TI.begin(), TI.end()), TI.end());
utils/TableGen/GlobalISelEmitter.cpp 3094 for (const auto &InsnID : InsnIDs) {
5468 for (auto &Condition : Conditions)
utils/TableGen/PseudoLoweringEmitter.cpp 208 for (auto &Expansion : Expansions) {
utils/TableGen/RISCVCompressInstEmitter.cpp 478 for (auto &Op : Ops) {
592 for (auto &CompressPat : CompressPatterns) {
utils/TableGen/RegisterInfoEmitter.cpp 952 for (LaneBitmask M : LaneMaskVec) {
utils/TableGen/SearchableTableEmitter.cpp 599 for (auto &Field : Table.Fields) {
625 for (auto &Field : Table.Fields) {
780 for (const auto &Table : Tables)