|
|
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/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/IntervalIterator.h 216 if (!Int->contains(*I)) { // If pred not in interval, we can't be
include/llvm/Analysis/LoopInfo.h 238 for (const auto Pred : children<Inverse<BlockT *>>(H))
317 for (const auto Pred : children<Inverse<BlockT *>>(H))
include/llvm/Analysis/LoopInfoImpl.h 91 for (BlockT *Predecessor : children<Inverse<BlockT *>>(EB))
195 for (const auto Pred : children<Inverse<BlockT *>>(Header)) {
213 for (const auto Pred : children<Inverse<BlockT *>>(Header)) {
464 for (const auto Pred : children<Inverse<BlockT *>>(PredBB)) {
547 for (const auto Backedge : children<Inverse<BlockT *>>(Header)) {
include/llvm/Analysis/RegionInfoImpl.h 167 for (BlockT *Pred : make_range(InvBlockTraits::child_begin(entry),
191 BlockT *Pred = *PI;
211 for (BlockT *Pred : make_range(InvBlockTraits::child_begin(exit),
269 for (BlockT *Pred : make_range(InvBlockTraits::child_begin(BB),
468 for (BlockT *Pred : make_range(InvBlockTraits::child_begin(getExit()),
480 for (BlockT *Pred : make_range(InvBlockTraits::child_begin(getExit()),
568 for (BlockT *P : make_range(InvBlockTraits::child_begin(BB),
859 for (BlockT *Pred : make_range(InvBlockTraits::child_begin(Exit),
include/llvm/IR/CFG.h 77 inline pointer *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/Transforms/Utils/BasicBlockUtils.h 190 Instruction *TI = (*PI)->getTerminator();
lib/Analysis/CFG.cpp 106 const BasicBlock *FirstPred = *I;
114 if (*I != FirstPred)
lib/Analysis/Interval.cpp 31 if (contains(*I))
lib/Analysis/LazyValueInfo.cpp 750 if (!getEdgeValue(Val, *PI, BB, EdgeResult))
1933 Tristate Baseline = getPredicateOnEdge(Pred, V, C, *PI, BB, CxtI);
1937 Tristate Ret = getPredicateOnEdge(Pred, V, C, *PI, BB, CxtI);
lib/Analysis/LoopInfo.cpp 128 Backedge = *PI++;
131 Incoming = *PI++;
lib/Analysis/MemorySSAUpdater.cpp 80 for (auto *Pred : predecessors(BB)) {
123 for (auto *Pred : predecessors(BB))
395 for (auto *Pred : predecessors(BBIDF)) {
lib/Analysis/MustExecute.cpp 165 for (auto *Pred : predecessors(BB)) {
181 for (auto *PredPred : predecessors(Pred))
lib/Analysis/ScalarEvolution.cpp10072 for (const BasicBlock *IncBB : predecessors(LBB)) {
10102 for (const BasicBlock *IncBB : predecessors(LBB)) {
lib/Analysis/ScalarEvolutionExpander.cpp 1302 BasicBlock *Pred = *HPI;
1572 BasicBlock *HP = *HPI;
lib/Analysis/TargetTransformInfo.cpp 97 for (BasicBlock *Pred : predecessors(L->getHeader())) {
lib/CodeGen/CodeGenPrepare.cpp 679 if (auto *CBI = dyn_cast<CallBrInst>((*PI)->getTerminator()))
722 BasicBlock *DestBBPred = *PI;
863 PN.addIncoming(InVal, *PI);
2030 if (!VisitedBBs.insert(*PI).second)
2033 BasicBlock::InstListType &InstList = (*PI)->getInstList();
2043 TailCallBBs.push_back(*PI);
3401 for (auto B : predecessors(PHI->getParent())) {
lib/CodeGen/SafeStackColoring.cpp 171 for (auto *PredBB : predecessors(BB)) {
lib/CodeGen/SelectionDAG/SelectionDAGISel.cpp 1405 if (!FuncInfo->VisitedBBs.count(*PI)) {
lib/CodeGen/WinEHPrepare.cpp 252 for (const BasicBlock *PredBlock : predecessors(BB))
299 for (const BasicBlock *PredBlock : predecessors(BB)) {
365 for (const BasicBlock *PredBlock : predecessors(BB))
401 for (const BasicBlock *PredBlock : predecessors(BB))
813 for (BasicBlock *Pred : predecessors(OldBlock))
1140 for (BasicBlock *PredBlock : predecessors(EHBlock)) {
lib/ExecutionEngine/Orc/SpeculateAnalyses.cpp 187 if (BPI->isEdgeHot(*PIt, AtBB) && !PredSkipNodes.count(*PIt))
187 if (BPI->isEdgeHot(*PIt, AtBB) && !PredSkipNodes.count(*PIt))
188 traverseToEntryBlock(*PIt, CallerBlocks, BackEdgesInfo, BPI,
lib/IR/AsmWriter.cpp 3594 writeOperand(*PI, false);
3597 writeOperand(*PI, false);
lib/IR/BasicBlock.cpp 243 const BasicBlock *ThePred = *PI;
256 const BasicBlock *PredBB = *PI;
259 if (*PI != PredBB)
lib/IR/Dominators.cpp 215 const BasicBlock *BB = *PI;
lib/IR/SafepointIRVerifier.cpp 88 if (InBB == *PredIt) {
119 if (!isDeadBlock(*PredIt) && !isDeadEdge(&U))
622 const BasicBlock *PBB = *PredIt;
lib/IR/Verifier.cpp 3598 for (BasicBlock *PredBB : predecessors(BB)) {
3623 for (BasicBlock *PredBB : predecessors(BB)) {
lib/Target/AMDGPU/AMDGPUAnnotateUniformValues.cpp 80 for (auto I : predecessors(Root))
lib/Target/AMDGPU/AMDGPUUnifyDivergentExitNodes.cpp 102 for (BasicBlock *Pred : predecessors(&BB))
110 for (BasicBlock *Pred : predecessors(Top)) {
lib/Target/AMDGPU/SIAnnotateControlFlow.cpp 273 for (BasicBlock *Pred : predecessors(Target)) {
304 for (BasicBlock *Pred : predecessors(BB)) {
lib/Target/Hexagon/HexagonLoopIdiomRecognition.cpp 627 BasicBlock *PB = (*PI == BB) ? *std::next(PI) : *PI;
627 BasicBlock *PB = (*PI == BB) ? *std::next(PI) : *PI;
627 BasicBlock *PB = (*PI == BB) ? *std::next(PI) : *PI;
2231 BasicBlock *PB = *PI;
lib/Target/PowerPC/PPCLoopPreIncPrep.cpp 380 for (const auto &PI : predecessors(Header)) {
392 for (const auto &PI : predecessors(Header)) {
lib/Target/X86/X86WinEHState.cpp 561 for (BasicBlock *PredBB : predecessors(BB)) {
lib/Transforms/Coroutines/CoroSplit.cpp 1031 for (auto *Pred : predecessors(BB))
lib/Transforms/IPO/ArgumentPromotion.cpp 763 for (BasicBlock *P : predecessors(BB)) {
lib/Transforms/IPO/BlockExtractor.cpp 147 for (auto PredBB : predecessors(LPad)) {
lib/Transforms/IPO/PartialInlining.cpp 646 for (auto Pred : predecessors(BB)) {
lib/Transforms/IPO/SampleProfile.cpp 1325 BasicBlock *B2 = *PI;
lib/Transforms/InstCombine/InstCombineLoadStoreAlloca.cpp 1500 if (*PredIter == StoreBB)
1502 BasicBlock *OtherBB = *PredIter;
lib/Transforms/Instrumentation/ControlHeightReduction.cpp 207 for (BasicBlock *Pred : predecessors(NextEntry))
767 for (BasicBlock *Pred : predecessors(Entry))
1619 for (BasicBlock *Pred : predecessors(ExitBlock)) {
lib/Transforms/Instrumentation/GCOVProfiling.cpp 818 for (BasicBlock *Pred : predecessors(&BB)) {
lib/Transforms/Instrumentation/PGOInstrumentation.cpp 1326 if (isa<IndirectBrInst>((*PI)->getTerminator()))
lib/Transforms/Instrumentation/SanitizerCoverage.cpp 498 for (const BasicBlock *PRED : make_range(pred_begin(BB), pred_end(BB))) {
lib/Transforms/ObjCARC/DependencyAnalysis.cpp 244 BasicBlock *PredBB = *PI;
lib/Transforms/Scalar/ADCE.cpp 454 for (auto *PredBB : predecessors(Info.BB)) {
lib/Transforms/Scalar/CorrelatedValuePropagation.cpp 370 Cond, Case, *PI,
lib/Transforms/Scalar/DeadStoreElimination.cpp 629 if (!Visited.insert(*PredI).second)
631 WorkList.push_back(*PredI);
643 BasicBlock *Pred = *I;
lib/Transforms/Scalar/GVN.cpp 688 if (!IsValueFullyAvailableInBlock(*PI, FullyAvailableBlocks,RecurseDepth+1))
1093 for (BasicBlock *Pred : predecessors(LoadBB)) {
1696 for (const BasicBlock *Pred : predecessors(&CurrBlock)) {
2290 for (BasicBlock *P : predecessors(CurrentBlock)) {
2544 for (BasicBlock *P : predecessors(S))
2588 for (BasicBlock *P : predecessors(B)) {
lib/Transforms/Scalar/GVNHoist.cpp 633 for (auto Pred : predecessors(BB)) {
lib/Transforms/Scalar/GVNSink.cpp 765 for (auto *B : predecessors(BBEnd)) {
lib/Transforms/Scalar/JumpThreading.cpp 607 for (BasicBlock *Pred : predecessors(BB))
635 for (BasicBlock *P : predecessors(BB)) {
833 for (BasicBlock *P : predecessors(BB)) {
865 for (BasicBlock *P : predecessors(BB)) {
952 for (BasicBlock *Pred : predecessors(BB))
1363 for (BasicBlock *PredBB : predecessors(LoadBB)) {
1451 for (BasicBlock *P : predecessors(LoadBB)) {
1498 BasicBlock *P = *PI;
2130 for (auto Pred : predecessors(NewBB)) {
2660 Pred1 = *PI++;
2663 Pred2 = *PI++;
lib/Transforms/Scalar/LICM.cpp 654 for (BasicBlock *PredBB : predecessors(BB))
1483 BasicBlock *BBPred = *PI;
lib/Transforms/Scalar/LoopDeletion.cpp 105 for (auto *Pred: predecessors(Preheader)) {
lib/Transforms/Scalar/LoopUnswitch.cpp 1333 BasicBlock *BB = *I;
lib/Transforms/Scalar/MergeICmps.cpp 725 BasicBlock* const Pred = *pred_begin(EntryBlock_);
lib/Transforms/Scalar/SimpleLoopUnswitch.cpp 1247 for (auto *Pred : predecessors(ClonedHeader)) {
1282 for (auto *Pred : predecessors(BB))
1386 for (BasicBlock *PredBB : predecessors(BB)) {
1575 for (auto *Pred : predecessors(Header)) {
1648 for (auto *Pred : predecessors(BB))
1785 for (BasicBlock *PredBB : predecessors(BB)) {
lib/Transforms/Scalar/SimplifyCFGPass.cpp 130 RetBlockPHI->addIncoming(InVal, *PI);
lib/Transforms/Scalar/StructurizeCFG.cpp 455 for (BasicBlock *P : predecessors(BB)) {
686 BasicBlock *BB = *BBI++;
lib/Transforms/Scalar/TailRecursionElimination.cpp 643 BasicBlock *P = *PI;
703 BasicBlock *Pred = *PI;
lib/Transforms/Utils/BasicBlockUtils.cpp 100 for (BasicBlock *Pred : predecessors(BB))
704 BasicBlock *Pred = *i++;
897 Pred1 = *PI++;
900 Pred2 = *PI++;
lib/Transforms/Utils/BreakCriticalEdges.cpp 295 BasicBlock *P = *I;
lib/Transforms/Utils/CloneFunction.cpp 563 --PredCount[*PI];
lib/Transforms/Utils/CodeExtractor.cpp 230 for (auto *PBB : predecessors(BB))
389 for (auto *Pred : predecessors(CommonExitBlock)) {
428 BasicBlock *Pred = *PI++;
1400 for (BasicBlock *Pred : predecessors(header)) {
lib/Transforms/Utils/Local.cpp 696 Updates.push_back({DominatorTree::Delete, *I, PredBB});
698 if (llvm::find(successors(*I), DestBB) == succ_end(*I))
698 if (llvm::find(successors(*I), DestBB) == succ_end(*I))
699 Updates.push_back({DominatorTree::Insert, *I, DestBB});
992 if (auto *CBI = dyn_cast<CallBrInst>((*I)->getTerminator())) {
1008 Updates.push_back({DominatorTree::Delete, *I, BB});
1010 if (llvm::find(successors(*I), Succ) == succ_end(*I))
1010 if (llvm::find(successors(*I), Succ) == succ_end(*I))
1011 Updates.push_back({DominatorTree::Insert, *I, Succ});
1052 BasicBlock *Pred = *PI;
lib/Transforms/Utils/LoopSimplify.cpp 131 BasicBlock *P = *PI;
174 BasicBlock *WBB = *I;
291 BasicBlock *P = *PI;
367 BasicBlock *P = *I;
492 BasicBlock *P = *PI;
lib/Transforms/Utils/LoopUnroll.cpp 657 for (auto *Pred : predecessors(*BB))
lib/Transforms/Utils/LoopUnrollRuntime.cpp 138 for (BasicBlock *PredBB : predecessors(PrologExit))
lib/Transforms/Utils/LoopUtils.cpp 67 for (auto *PredBB : predecessors(BB))
lib/Transforms/Utils/PromoteMemoryToRegister.cpp 828 for (BasicBlock *P : predecessors(BB)) {
lib/Transforms/Utils/SSAUpdater.cpp 128 BasicBlock *PredBB = *PI;
266 Preds->push_back(*PI);
lib/Transforms/Utils/SimplifyCFG.cpp 1748 for (auto *B : predecessors(BB)) {
2381 DomBlock = *pred_begin(IfBlock1);
2394 DomBlock = *pred_begin(IfBlock2);
2669 BasicBlock *PredBlock = *PI;
2923 BasicBlock *OtherPredBB = *PredI == BB ? *++PredI : *PredI;
2923 BasicBlock *OtherPredBB = *PredI == BB ? *++PredI : *PredI;
2923 BasicBlock *OtherPredBB = *PredI == BB ? *++PredI : *PredI;
2938 for (BasicBlock *PredBB : predecessors(Succ))
3252 BasicBlock *P = *PI;
3877 BasicBlock *Pred = *PI++;
3912 BasicBlock *Pred = *PI++;
4013 for (auto *pred : predecessors(BB)) {
4036 for (auto *pred : predecessors(UnwindDest))
4045 BasicBlock *PredBB = *PI++;
4117 BasicBlock *P = *PI;
5269 BasicBlock *Pred = *PI;
5752 for (BasicBlock *OtherPred : predecessors(Succ)) {
5851 for (auto *P : predecessors(BB)) {
5947 if (BranchInst *PBI = dyn_cast<BranchInst>((*PI)->getTerminator()))
lib/Transforms/Vectorize/LoopVectorize.cpp 3621 for (auto *BB : predecessors(LoopScalarPreHeader)) {
6697 for (auto *Predecessor : predecessors(BB)) {
lib/Transforms/Vectorize/VPlanHCFGBuilder.cpp 86 for (BasicBlock *Pred : predecessors(BB))
tools/clang/lib/CodeGen/CGExprScalar.cpp 4016 PN->addIncoming(llvm::ConstantInt::getFalse(VMContext), *PI);
4101 PN->addIncoming(llvm::ConstantInt::getTrue(VMContext), *PI);
tools/llvm-diff/DifferenceEngine.cpp 127 if (!Blocks.count(*I)) Count++;
tools/polly/lib/Analysis/ScopBuilder.cpp 688 for (auto *PredBB : predecessors(BB)) {
tools/polly/lib/CodeGen/BlockGenerators.cpp 866 BasicBlock *OptExitBB = *(pred_begin(MergeBB));
868 OptExitBB = *(++pred_begin(MergeBB));
936 BasicBlock *OptExitBB = *(pred_begin(MergeBB));
938 OptExitBB = *(++pred_begin(MergeBB));
1422 for (auto ExitingBB : predecessors(R->getExit())) {
1438 for (auto ExitingBB : predecessors(R->getExit())) {
1486 if (!R->contains(*PI)) {
1487 StartBlockMap[*PI] = EntryBBCopy;
1488 EndBlockMap[*PI] = EntryBBCopy;
1594 for (auto *PredBB : make_range(pred_begin(BB), pred_end(BB))) {
1603 for (auto *PredBBCopy : make_range(pred_begin(BBCopy), pred_end(BBCopy)))
tools/polly/lib/Support/ScopHelper.cpp 62 for (BasicBlock *P : predecessors(Entry))
71 for (BasicBlock *ExitPred : predecessors(NewEntering)) {
122 for (BasicBlock *P : predecessors(ExitBB))
421 for (auto Pred : predecessors(R.getExit()))
596 for (auto Pred : predecessors(R.getExit()))
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 294 *__result = *__first;
usr/include/c++/7.4.0/bits/stl_uninitialized.h 83 std::_Construct(std::__addressof(*__cur), *__first);