|
|
reference, declaration → definition
definition → references, declarations, derived classes, virtual overrides
reference to multiple definitions → definitions
unreferenced
|
References
include/llvm/ADT/DepthFirstIterator.h 131 NodeRef Next = *(*Opt)++;
include/llvm/ADT/PostOrderIterator.h 128 NodeRef BB = *VisitStack.back().second++;
include/llvm/ADT/SCCIterator.h 159 NodeRef childN = *VisitStack.back().NextChild++;
219 if (*CI == N)
include/llvm/ADT/SetVector.h 152 if (set_.insert(*Start).second)
153 vector_.push_back(*Start);
include/llvm/ADT/SmallPtrSet.h 389 insert(*I);
include/llvm/ADT/iterator.h 359 NR.second = *this->I;
include/llvm/Analysis/BlockFrequencyInfoImpl.h 1272 for (const auto Succ : children<const BlockT *>(BB))
1325 Dist, OuterLoop, Node, getNode(*SI),
include/llvm/Analysis/CFG.h 160 for (NodeT Succ : make_range(GT::child_begin(Node), GT::child_end(Node))) {
include/llvm/Analysis/DominanceFrontierImpl.h 184 for (const auto Succ : children<BlockT *>(currentBB)) {
include/llvm/Analysis/IntervalIterator.h 186 ProcessNode(Int, getSourceGraphNode(OrigContainer, *I));
239 ProcessNode(Int, getSourceGraphNode(OrigContainer, *It));
include/llvm/Analysis/LoopInfo.h 211 for (const auto &Succ : children<const BlockT *>(BB)) {
include/llvm/Analysis/LoopInfoImpl.h 38 for (const auto &Succ : children<BlockT *>(BB))
66 for (const auto &Succ : children<BlockT *>(BB))
108 for (BlockT *Successor : children<BlockT *>(BB))
145 for (const auto &Succ : children<BlockT *>(BB))
include/llvm/Analysis/LoopIterator.h 61 NodeRef operator*() const { return {L, *I}; }
include/llvm/Analysis/RegionInfoImpl.h 261 for (BlockT *Succ :
286 for (BlockT *Succ :
473 return new RegionT(getEntry(), *BlockTraits::child_begin(exit), RI, DT);
656 if (num_successors <= 1 && exit == *(BlockTraits::child_begin(entry)))
849 Exit = *BlockTraits::child_begin(BB);
include/llvm/Analysis/RegionIterator.h 110 while (BlockTraits::child_end(node->getEntry()) != BItor && isExit(*BItor))
133 BlockT *BB = isRegionMode() ? getRegionSucc() : *BItor;
147 && isExit(*BItor));
191 Node->getParent()->getExit() == *Itor)
212 BlockT *BB = *Itor;
229 && Node->getParent()->getExit() == *Itor);
include/llvm/IR/CFG.h 175 operator reference() const { return *It; }
204 inline BlockT *operator->() const { return operator*(); }
include/llvm/Support/GenericDomTree.h 778 NodeRef NewBBSucc = *GraphT::child_begin(NewBB);
781 for (const auto &Pred : children<Inverse<N>>(NewBB))
787 for (const auto &Pred : children<Inverse<N>>(NewBBSucc)) {
include/llvm/Support/GraphWriter.h 231 if (!DTraits.isNodeHidden(*EI))
234 if (!DTraits.isNodeHidden(*EI))
239 if (NodeRef TargetNode = *EI) {
include/llvm/Transforms/Utils/SSAUpdaterImpl.h 199 BBInfo *SuccInfo = BBMap[*SI];
lib/Analysis/BranchProbabilityInfo.cpp 164 for (auto *I : successors(BB))
221 if (PostDominatedByUnreachable.count(*I))
367 if (PostDominatedByColdCall.count(*I))
598 if (UnlikelyBlocks.count(*I) != 0)
600 else if (!L->contains(*I))
602 else if (L->getHeader() == *I)
607 if (getSCCNum(*I, SccI) != SccNum)
609 else if (isSCCHeader(*I, SccNum, SccI))
844 printEdgeProbability(OS << " ", &BI, *SI);
862 const BasicBlock *Succ = *I;
906 if (*I == Dst) {
lib/Analysis/CFG.cpp 47 BB = *I++;
lib/Analysis/DivergenceAnalysis.cpp 244 for (auto *SuccBlock : successors(UserBlock)) {
lib/Analysis/EHPersonalities.cpp 131 for (BasicBlock *Succ : successors(Visiting))
lib/Analysis/InlineCost.cpp 1705 for (BasicBlock *Succ : successors(CurrBB)) {
1714 for (BasicBlock *S : successors(Dead))
lib/Analysis/LazyValueInfo.cpp 2023 for (auto *BBSucc : successors(ParentBB))
lib/Analysis/LegacyDivergenceAnalysis.cpp 233 for (BasicBlock *Succ : successors(ThisBB)) {
lib/Analysis/LoopInfo.cpp 806 if (*I == BB)
809 Loop *L = LI->getLoopFor(*I);
813 assert((FoundIB || !DFS.hasPostorder(*I)) && "should have seen IB");
lib/Analysis/MemorySSA.cpp 1089 for (const BasicBlock *S : successors(BB)) {
1195 for (const BasicBlock *S : successors(BB)) {
lib/Analysis/MemorySSAUpdater.cpp 476 for (const auto *S : successors(NewDef->getBlock())) {
505 for (const auto *S : successors(FixupBlock)) {
1207 for (BasicBlock *Succ : successors(To))
1217 for (BasicBlock *Succ : successors(From))
1345 for (BasicBlock *Succ : successors(TI))
1387 for (const BasicBlock *Successor : successors(BB)) {
1402 for (const BasicBlock *Succ : successors(BB)) {
lib/Analysis/MustExecute.cpp 218 for (auto *Succ : successors(Pred))
lib/Analysis/ScalarEvolution.cpp 7155 for (auto *SBB : successors(ExitingBlock))
lib/Analysis/SyncDependenceAnalysis.cpp 227 for (const auto *SuccBlock : NodeSuccessors) {
285 for (const auto *SuccBlock : successors(Block)) {
lib/CodeGen/GlobalISel/IRTranslator.cpp 404 for (const BasicBlock *Succ : successors(&BrInst))
845 for (const BasicBlock *Succ : successors(&BrInst))
lib/CodeGen/WinEHPrepare.cpp 867 for (BasicBlock *SuccBB : successors(NewBlock)) {
lib/ExecutionEngine/Orc/SpeculateAnalyses.cpp 226 if (BPI->isEdgeHot(AtBB, *PIt) && !SuccSkipNodes.count(*PIt))
226 if (BPI->isEdgeHot(AtBB, *PIt) && !SuccSkipNodes.count(*PIt))
227 traverseToExitBlock(*PIt, CallerBlocks, BackEdgesInfo, BPI,
lib/IR/BasicBlock.cpp 278 const BasicBlock *TheSucc = *SI;
286 const BasicBlock *SuccBB = *SI;
289 if (*SI != SuccBB)
lib/IR/SafepointIRVerifier.cpp 178 for (BasicBlock *S : successors(B))
lib/Target/X86/X86WinEHState.cpp 598 for (BasicBlock *SuccBB : successors(BB)) {
718 for (BasicBlock *SuccBB : successors(BB))
lib/Transforms/Coroutines/CoroFrame.cpp 225 for (BasicBlock *SI : successors(B)) {
1033 for (auto Succ : successors(From)) {
1067 for (auto Succ : successors(BB)) {
lib/Transforms/IPO/Attributor.cpp 1814 for (auto *SuccBB : successors(BB)) {
2368 for (const BasicBlock *SuccBB : successors(BB)) {
lib/Transforms/IPO/HotColdSplitting.cpp 267 for (BasicBlock *SuccBB : successors(BB)) {
lib/Transforms/IPO/PartialInlining.cpp 424 if (!is_contained(BlockList, *SI)) {
485 if (VisitedMap[*SI])
487 VisitedMap[*SI] = true;
488 DFS.push_back(*SI);
490 BranchProbability SuccProb = BPI.getEdgeProbability(thisBB, *SI);
496 << (*SI)->getName() << "\nBranch Probability = " << SuccProb
501 DT.getDescendants(*SI, DominateVector);
606 BasicBlock *Succ1 = *succ_begin(CurrEntry);
607 BasicBlock *Succ2 = *(succ_begin(CurrEntry) + 1);
655 for (auto Succ : successors(E)) {
683 BasicBlock *Succ1 = *succ_begin(Cand);
684 BasicBlock *Succ2 = *(succ_begin(Cand) + 1);
lib/Transforms/IPO/SampleProfile.cpp 1335 BasicBlock *B2 = *SI;
lib/Transforms/InstCombine/InstructionCombining.cpp 3276 if (*SI == UserParent) {
3460 for (BasicBlock *SuccBB : successors(TI))
lib/Transforms/Instrumentation/GCOVProfiling.cpp 793 for (BasicBlock *Succ : successors(TI)) {
lib/Transforms/Instrumentation/SanitizerCoverage.cpp 484 for (const BasicBlock *SUCC : make_range(succ_begin(BB), succ_end(BB))) {
lib/Transforms/ObjCARC/DependencyAnalysis.cpp 265 for (const BasicBlock *Succ : successors(BB))
lib/Transforms/ObjCARC/ObjCARCOpts.cpp 1131 for (const BasicBlock *Succ : successors(BB)) {
1478 BasicBlock *SuccBB = *SuccStack.back().second++;
lib/Transforms/Scalar/ADCE.cpp 284 for (auto *Succ : successors(BB))
397 for (auto *BB : successors(I->getParent()))
589 for (auto *Succ : successors(BB)) {
600 for (auto *Succ : successors(BB)) {
lib/Transforms/Scalar/CorrelatedValuePropagation.cpp 354 for (auto *Succ : successors(BB))
lib/Transforms/Scalar/GVN.cpp 1425 for (BasicBlock *Successor : successors(IntrinsicI->getParent())) {
2539 for (BasicBlock *S : successors(B)) {
lib/Transforms/Scalar/GVNHoist.cpp 367 for (const BasicBlock *Succ : successors(BB))
lib/Transforms/Scalar/IndVarSimplify.cpp 2739 bool ExitIfTrue = !L->contains(*succ_begin(ExitingBB));
lib/Transforms/Scalar/InductiveRangeCheckElimination.cpp 1166 for (auto *SBB : successors(OriginalBB)) {
lib/Transforms/Scalar/JumpThreading.cpp 1683 for (BasicBlock *SuccBB : successors(BB)) {
1749 for (BasicBlock *Succ : successors(Pred))
2184 for (BasicBlock *Succ : successors(BB)) {
2623 for (auto *Succ : successors(SplitBB)) {
lib/Transforms/Scalar/LoopInterchange.cpp 609 for (BasicBlock *Succ : successors(OuterLoopHeaderBI))
lib/Transforms/Scalar/LoopSimplifyCFG.cpp 197 for (auto *Succ : successors(BB))
247 for (BasicBlock *Succ : successors(BB))
488 for (auto *Succ : successors(BB))
lib/Transforms/Scalar/LoopUnrollPass.cpp 599 for (BasicBlock *Succ : successors(BB))
lib/Transforms/Scalar/LoopUnswitch.cpp 852 if (!isTrivialLoopExitBlockHelper(L, *SI, ExitBB, Visited))
1549 BasicBlock *OldSISucc = *succ_begin(NewSISucc);
lib/Transforms/Scalar/MergedLoadStoreMotion.cpp 291 BasicBlock *Pred0 = *SI;
294 BasicBlock *Pred1 = *SI;
lib/Transforms/Scalar/PlaceSafepoints.cpp 283 for (BasicBlock *Succ : successors(BB)) {
lib/Transforms/Scalar/RewriteStatepointsForGC.cpp 2672 for (BasicBlock *Succ : successors(BB)) {
2756 for (BasicBlock *Succ : successors(BB)) {
lib/Transforms/Scalar/SimpleLoopUnswitch.cpp 1079 for (auto *SuccBB : successors(LoopBB))
1087 for (auto *SuccBB : successors(ParentBB)) {
1126 for (auto *SuccBB : successors(ClonedBB))
1459 for (BasicBlock *SuccBB : successors(ClonedBB))
1495 for (BasicBlock *SuccBB : successors(BB)) {
2388 for (auto *Succ : successors(CheckBB))
2414 for (auto *Succ : successors(CheckBB))
2677 for (BasicBlock *SuccBB : successors(&BB)) {
lib/Transforms/Scalar/Sink.cpp 181 if (IsAcceptableTarget(Inst, *I, DT, LI))
182 SuccToSinkTo = *I;
lib/Transforms/Scalar/StructurizeCFG.cpp 668 delPhiValues(BB, *SI);
lib/Transforms/Scalar/TailRecursionElimination.cpp 282 for (auto *SuccBB : make_range(succ_begin(BB), succ_end(BB))) {
lib/Transforms/Utils/BasicBlockUtils.cpp 62 for (BasicBlock *Succ : successors(BB)) {
239 if (llvm::find(successors(PredBB), *I) == succ_end(PredBB))
240 Updates.push_back({DominatorTree::Insert, PredBB, *I});
242 Updates.push_back({DominatorTree::Delete, BB, *I});
lib/Transforms/Utils/CloneFunction.cpp 433 for (const BasicBlock *Succ : successors(TI))
lib/Transforms/Utils/CodeExtractor.cpp 288 for (auto *Succ : successors(Block)) {
1428 if (!Blocks.count(*SI)) {
1431 BlockFrequency &BF = ExitWeights[*SI];
1432 BF += BFI->getBlockFreq(Block) * BPI->getEdgeProbability(Block, *SI);
1434 ExitBlocks.insert(*SI);
lib/Transforms/Utils/FlattenCFG.cpp 457 for (BasicBlock *Succ : successors(PBI)) {
lib/Transforms/Utils/Local.cpp 243 for (BasicBlock *Succ : successors(SI)) {
760 assert(*succ_begin(BB) == Succ && "Succ is not successor of BB!");
1911 for (BasicBlock *Successor : successors(BB)) {
2168 for (BasicBlock *Successor : successors(BB))
2241 for (BasicBlock *Successor : successors(BB)) {
lib/Transforms/Utils/LoopRotationUtils.cpp 386 for (BasicBlock *SuccBB : successors(OrigHeader))
lib/Transforms/Utils/LoopSimplify.cpp 615 for (auto *SuccBB : successors(ExitingBB)) {
lib/Transforms/Utils/LoopUnroll.cpp 638 for (BasicBlock *Succ : successors(*BB)) {
725 for (BasicBlock *Succ : successors(BB)) {
lib/Transforms/Utils/LoopUnrollRuntime.cpp 92 for (BasicBlock *Succ : successors(Latch)) {
249 for (BasicBlock *Succ : successors(Latch)) {
lib/Transforms/Utils/LoopUtils.cpp 104 for (auto *SuccBB : successors(BB)) {
lib/Transforms/Utils/PromoteMemoryToRegister.cpp 988 VisitedSuccs.insert(*I);
990 BB = *I;
994 if (VisitedSuccs.insert(*I).second)
995 Worklist.emplace_back(*I, Pred, IncomingVals, IncomingLocs);
lib/Transforms/Utils/SimplifyCFG.cpp 242 for (BasicBlock *Succ : successors(SI2BB))
285 for (BasicBlock *Succ : successors(SI2BB))
916 for (BasicBlock *Succ : successors(TIBB))
1220 for (BasicBlock *Succ : successors(BB1)) {
1355 for (BasicBlock *Succ : successors(BB1)) {
1396 for (BasicBlock *Succ : successors(BB1)) {
1419 for (BasicBlock *Succ : successors(BB1))
3470 for (BasicBlock *Succ : successors(OldTerm)) {
tools/bugpoint/CrashDebugger.cpp 408 for (BasicBlock *Successor : successors(&*BB))
468 for (BasicBlock *Succ : successors(&BB))
tools/clang/lib/CodeGen/CGLoopInfo.cpp 788 for (BasicBlock *Succ : successors(I))
tools/llvm-reduce/deltas/ReduceBasicBlocks.cpp 31 for (auto Succ : successors(&BB))
103 for (auto *Succ : successors(&BB))
tools/polly/lib/CodeGen/BlockGenerators.cpp 1533 if (R->contains(*SI) && SeenBlocks.insert(*SI))
1533 if (R->contains(*SI) && SeenBlocks.insert(*SI))
1534 Blocks.push_back(*SI);
usr/include/c++/7.4.0/bits/predefined_ops.h 241 { return *__it == _M_value; }
283 { return bool(_M_pred(*__it)); }
351 { return !bool(_M_pred(*__it)); }
usr/include/c++/7.4.0/bits/stl_algo.h 3884 __f(*__first);
usr/include/c++/7.4.0/bits/stl_algobase.h 324 *__result = *__first;
usr/include/c++/7.4.0/bits/stl_iterator.h 172 return *--__tmp;
usr/include/c++/7.4.0/bits/stl_uninitialized.h 83 std::_Construct(std::__addressof(*__cur), *__first);