Home
last modified time | relevance | path

Searched refs:RPOT (Results 1 – 25 of 41) sorted by relevance

12

/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
DVPlanPredicator.cpp189 ReversePostOrderTraversal<VPBlockBase *> RPOT(EntryBlock); in predicateRegionRec() local
194 for (VPBlockBase *Block : RPOT) { in predicateRegionRec()
208 ReversePostOrderTraversal<VPBlockBase *> RPOT(Region->getEntry()); in linearizeRegionRec() local
211 for (VPBlockBase *CurrBlock : RPOT) { in linearizeRegionRec()
DVPlanTransforms.cpp25 ReversePostOrderTraversal<VPBlockBase *> RPOT(TopRegion->getEntry()); in VPInstructionsToVPRecipes() local
27 for (VPBlockBase *Base : RPOT) { in VPInstructionsToVPRecipes()
DVPlan.cpp449 ReversePostOrderTraversal<VPBlockBase *> RPOT(Entry); in execute() local
453 for (VPBlockBase *Block : RPOT) { in execute()
486 for (VPBlockBase *Block : RPOT) { in execute()
1401 ReversePostOrderTraversal<VPBlockBase *> RPOT(Region->getEntry()); in visitRegion() local
1402 for (VPBlockBase *Base : RPOT) { in visitRegion()
1461 RPOT(VPBlockRecursiveTraversalWrapper<const VPBlockBase *>( in assignSlots()
1464 VPBlockUtils::blocksOnly<const VPBasicBlock>(RPOT)) in assignSlots()
/freebsd-12-stable/contrib/llvm-project/llvm/lib/CodeGen/
DLoopTraversal.cpp29 ReversePostOrderTraversal<MachineBasicBlock *> RPOT(Entry); in traverse() local
32 for (MachineBasicBlock *MBB : RPOT) { in traverse()
66 for (MachineBasicBlock *MBB : RPOT) { in traverse()
DMIRNamerPass.cpp61 ReversePostOrderTraversal<MachineBasicBlock *> RPOT(&*MF.begin()); in runOnMachineFunction() local
62 for (auto &MBB : RPOT) in runOnMachineFunction()
DSwiftErrorValueTracking.cpp157 ReversePostOrderTraversal<MachineFunction *> RPOT(MF); in propagateVRegs() local
158 for (MachineBasicBlock *MBB : RPOT) { in propagateVRegs()
DMIRCanonicalizerPass.cpp86 ReversePostOrderTraversal<MachineBasicBlock *> RPOT(&*MF.begin()); in GetRPOList() local
88 append_range(RPOList, RPOT); in GetRPOList()
DShrinkWrap.cpp466 ReversePostOrderTraversal<MachineBasicBlock *> RPOT(&*MF.begin()); in runOnMachineFunction() local
467 if (containsIrreducibleCFG<MachineBasicBlock *>(RPOT, *MLI)) { in runOnMachineFunction()
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/
DLoopDeletion.cpp120 LoopBlocksRPO RPOT(L); in isLoopDead() local
121 RPOT.perform(&LI); in isLoopDead()
123 if (containsIrreducibleCFG<const BasicBlock *>(RPOT, LI)) in isLoopDead()
215 LoopBlocksRPO RPOT(L); in canProveExitOnFirstIteration() local
216 RPOT.perform(&LI); in canProveExitOnFirstIteration()
223 if (containsIrreducibleCFG<const BasicBlock *>(RPOT, LI)) in canProveExitOnFirstIteration()
291 for (auto *BB : RPOT) { in canProveExitOnFirstIteration()
DLoopInstSimplify.cpp78 LoopBlocksRPO RPOT(&L); in simplifyLoopInst() local
79 RPOT.perform(&LI); in simplifyLoopInst()
86 for (BasicBlock *BB : RPOT) { in simplifyLoopInst()
DLowerConstantIntrinsics.cpp103 ReversePostOrderTraversal<Function *> RPOT(&F); in lowerConstantIntrinsics() local
104 for (BasicBlock *BB : RPOT) { in lowerConstantIntrinsics()
DReassociate.cpp168 ReversePostOrderTraversal<Function*> &RPOT) { in BuildRankMap() argument
179 for (BasicBlock *BB : RPOT) { in BuildRankMap()
2439 ReassociatePass::BuildPairMap(ReversePostOrderTraversal<Function *> &RPOT) { in BuildPairMap() argument
2441 for (BasicBlock *BI : RPOT) { in BuildPairMap()
2504 ReversePostOrderTraversal<Function *> RPOT(&F); in run() local
2507 BuildRankMap(F, RPOT); in run()
2518 BuildPairMap(RPOT); in run()
2523 for (BasicBlock *BI : RPOT) { in run()
DGVNSink.cpp572 ReversePostOrderTraversal<Function*> RPOT(&F); in run() local
573 for (auto *N : RPOT) in run()
/freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/Analysis/
DBlockFrequencyInfoImpl.h869 std::vector<const BlockT *> RPOT;
874 rpot_iterator rpot_begin() const { return RPOT.begin(); }
875 rpot_iterator rpot_end() const { return RPOT.end(); }
886 assert(Node.Index < RPOT.size());
887 return RPOT[Node.Index];
1120 RPOT.clear();
1168 RPOT.reserve(F->size());
1169 std::copy(po_begin(Entry), po_end(Entry), std::back_inserter(RPOT));
1170 std::reverse(RPOT.begin(), RPOT.end());
1172 assert(RPOT.size() - 1 <= BlockNode::getMaxIndex() &&
[all …]
/freebsd-12-stable/contrib/llvm-project/clang/lib/Analysis/
DCallGraph.cpp223 llvm::ReversePostOrderTraversal<const CallGraph *> RPOT(this); in print() local
225 I = RPOT.begin(), E = RPOT.end(); I != E; ++I) { in print()
/freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/Transforms/Scalar/
DReassociate.h100 void BuildRankMap(Function &F, ReversePostOrderTraversal<Function *> &RPOT);
128 void BuildPairMap(ReversePostOrderTraversal<Function *> &RPOT);
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/AMDGPU/
DSIPreAllocateWWMRegs.cpp220 ReversePostOrderTraversal<MachineFunction*> RPOT(&MF); in runOnMachineFunction() local
222 for (MachineBasicBlock *MBB : RPOT) { in runOnMachineFunction()
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/X86/
DX86WinEHState.cpp652 ReversePostOrderTraversal<Function *> RPOT(&F); in addStateStores() local
662 for (BasicBlock *BB : RPOT) { in addStateStores()
712 for (BasicBlock *BB : RPOT) { in addStateStores()
724 for (BasicBlock *BB : RPOT) { in addStateStores()
753 for (BasicBlock *BB : RPOT) { in addStateStores()
/freebsd-12-stable/contrib/llvm-project/llvm/lib/IR/
DSafepointIRVerifier.cpp136 ReversePostOrderTraversal<const Function *> RPOT(&F); in processFunction() local
137 for (const BasicBlock *BB : RPOT) { in processFunction()
581 ReversePostOrderTraversal<const Function *> RPOT(&Tracker.F); in verifyFunction() local
582 for (const BasicBlock *BB : RPOT) { in verifyFunction()
/freebsd-12-stable/contrib/llvm-project/llvm/lib/CodeGen/GlobalISel/
DLegalizer.cpp187 ReversePostOrderTraversal<MachineFunction *> RPOT(&MF); in legalizeMachineFunction() local
191 for (auto *MBB : RPOT) { in legalizeMachineFunction()
DRegBankSelect.cpp697 ReversePostOrderTraversal<MachineFunction*> RPOT(&MF); in runOnMachineFunction() local
698 for (MachineBasicBlock *MBB : RPOT) { in runOnMachineFunction()
/freebsd-12-stable/contrib/llvm-project/clang/lib/StaticAnalyzer/Frontend/
DAnalysisConsumer.cpp463 llvm::ReversePostOrderTraversal<clang::CallGraph*> RPOT(&CG); in HandleDeclsCallGraph() local
465 I = RPOT.begin(), E = RPOT.end(); I != E; ++I) { in HandleDeclsCallGraph()
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/IPO/
DHotColdSplitting.cpp605 ReversePostOrderTraversal<Function *> RPOT(&F); in outlineColdRegions() local
623 for (BasicBlock *BB : RPOT) { in outlineColdRegions()
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/ARM/
DThumb2SizeReduction.cpp1148 ReversePostOrderTraversal<MachineFunction*> RPOT(&MF); in runOnMachineFunction() local
1151 I = RPOT.begin(), E = RPOT.end(); I != E; ++I) in runOnMachineFunction()
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Analysis/
DTargetTransformInfo.cpp50 LoopBlocksRPO RPOT(L); in canAnalyze() local
51 RPOT.perform(&LI); in canAnalyze()
52 if (containsIrreducibleCFG<const BasicBlock *>(RPOT, LI)) in canAnalyze()

12