/freebsd/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | LoopTraversal.cpp | 29 ReversePostOrderTraversal<MachineBasicBlock *> RPOT(Entry); in traverse() local 32 for (MachineBasicBlock *MBB : RPOT) { in traverse() 65 for (MachineBasicBlock *MBB : RPOT) { in traverse()
|
H A D | MIRNamerPass.cpp | 57 ReversePostOrderTraversal<MachineBasicBlock *> RPOT(&*MF.begin()); in runOnMachineFunction() local 58 for (auto &MBB : RPOT) in runOnMachineFunction()
|
H A D | CFIFixup.cpp | 146 ReversePostOrderTraversal<MachineBasicBlock *> RPOT(&*MF.begin()); in runOnMachineFunction() 147 for (MachineBasicBlock *MBB : RPOT) { in runOnMachineFunction() 120 ReversePostOrderTraversal<MachineBasicBlock *> RPOT(&*MF.begin()); runOnMachineFunction() local
|
H A D | ShrinkWrap.cpp | 202 const ReversePostOrderTraversal<MachineBasicBlock *> &RPOT, 818 const ReversePostOrderTraversal<MachineBasicBlock *> &RPOT, in performShrinkWrapping() argument 820 for (MachineBasicBlock *MBB : RPOT) { in performShrinkWrapping() 934 ReversePostOrderTraversal<MachineBasicBlock *> RPOT(&*MF.begin()); in runOnMachineFunction() local 935 if (containsIrreducibleCFG<MachineBasicBlock *>(RPOT, *MLI)) { in runOnMachineFunction() 957 bool HasCandidate = performShrinkWrapping(RPOT, RS.get()); in runOnMachineFunction()
|
H A D | MachineLateInstrsCleanup.cpp | 107 ReversePostOrderTraversal<MachineFunction *> RPOT(&MF); in runOnMachineFunction() local 108 for (MachineBasicBlock *MBB : RPOT) in runOnMachineFunction()
|
H A D | SwiftErrorValueTracking.cpp | 157 ReversePostOrderTraversal<MachineFunction *> RPOT(MF); in propagateVRegs() local 158 for (MachineBasicBlock *MBB : RPOT) { in propagateVRegs() 266 assert(std::find(RPOT.begin(), RPOT.end(), UseBB) == RPOT.end() && in preassignVRegs()
|
H A D | MIRCanonicalizerPass.cpp | 79 ReversePostOrderTraversal<MachineBasicBlock *> RPOT(&*MF.begin()); in GetRPOList() local 81 append_range(RPOList, RPOT); in GetRPOList()
|
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | LoopDeletion.cpp | 119 LoopBlocksRPO RPOT(L); in isLoopDead() local 120 RPOT.perform(&LI); in isLoopDead() 122 if (containsIrreducibleCFG<const BasicBlock *>(RPOT, LI)) in isLoopDead() 228 LoopBlocksRPO RPOT(L); in canProveExitOnFirstIteration() local 229 RPOT.perform(&LI); in canProveExitOnFirstIteration() 236 if (containsIrreducibleCFG<const BasicBlock *>(RPOT, LI)) in canProveExitOnFirstIteration() 304 for (auto *BB : RPOT) { in canProveExitOnFirstIteration()
|
H A D | LoopInstSimplify.cpp | 72 LoopBlocksRPO RPOT(&L); in simplifyLoopInst() local 73 RPOT.perform(&LI); in simplifyLoopInst() 80 for (BasicBlock *BB : RPOT) { in simplifyLoopInst()
|
H A D | LowerConstantIntrinsics.cpp | 112 ReversePostOrderTraversal<Function *> RPOT(&F); in lowerConstantIntrinsics() local 113 for (BasicBlock *BB : RPOT) { in lowerConstantIntrinsics()
|
H A D | GVNSink.cpp | 609 ReversePostOrderTraversal<Function*> RPOT(&F); in run() local 610 VN.setReachableBBs(BasicBlocksSet(RPOT.begin(), RPOT.end())); in run() 617 RPOTOrder[*RPOT.begin()] = ++NodeOrdering; in run() 618 for (auto *BB : RPOT) in run() 621 for (auto *N : RPOT) in run()
|
H A D | Reassociate.cpp | 182 ReversePostOrderTraversal<Function*> &RPOT) { in BuildRankMap() argument 193 for (BasicBlock *BB : RPOT) { in BuildRankMap() 2484 ReassociatePass::BuildPairMap(ReversePostOrderTraversal<Function *> &RPOT) { in BuildPairMap() argument 2486 for (BasicBlock *BI : RPOT) { in BuildPairMap() 2549 ReversePostOrderTraversal<Function *> RPOT(&F); in run() local 2552 BuildRankMap(F, RPOT); in run() 2563 BuildPairMap(RPOT); in run() 2568 for (BasicBlock *BI : RPOT) { in run()
|
/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/ |
H A D | BlockFrequencyInfoImpl.h | 866 std::vector<const BlockT *> RPOT; 871 rpot_iterator rpot_begin() const { return RPOT.begin(); } 872 rpot_iterator rpot_end() const { return RPOT.end(); } 883 assert(Node.Index < RPOT.size()); 884 return RPOT[Node.Index]; 1112 RPOT.clear(); 1161 RPOT.reserve(F->size()); 1162 std::copy(po_begin(Entry), po_end(Entry), std::back_inserter(RPOT)); 1163 std::reverse(RPOT.begin(), RPOT.end()); 1165 assert(RPOT.size() - 1 <= BlockNode::getMaxIndex() && [all …]
|
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Scalar/ |
H A D | Reassociate.h | 114 void BuildRankMap(Function &F, ReversePostOrderTraversal<Function *> &RPOT); 143 void BuildPairMap(ReversePostOrderTraversal<Function *> &RPOT);
|
/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
H A D | SIPreAllocateWWMRegs.cpp | 213 ReversePostOrderTraversal<MachineFunction*> RPOT(&MF); in runOnMachineFunction() local 215 for (MachineBasicBlock *MBB : RPOT) { in runOnMachineFunction()
|
/freebsd/contrib/llvm-project/llvm/include/llvm/IR/ |
H A D | GenericConvergenceVerifierImpl.h | 193 ReversePostOrderTraversal<const FunctionT *> RPOT(&F); in verify() 195 for (auto *BB : RPOT) { in verify()
|
/freebsd/contrib/llvm-project/llvm/lib/Target/X86/ |
H A D | X86WinEHState.cpp | 648 ReversePostOrderTraversal<Function *> RPOT(&F); in addStateStores() 658 for (BasicBlock *BB : RPOT) { in addStateStores() 708 for (BasicBlock *BB : RPOT) { in addStateStores() 720 for (BasicBlock *BB : RPOT) { in addStateStores() 749 for (BasicBlock *BB : RPOT) { in addStateStores() 651 ReversePostOrderTraversal<Function *> RPOT(&F); addStateStores() local
|
/freebsd/contrib/llvm-project/llvm/lib/IR/ |
H A D | SafepointIRVerifier.cpp | 134 ReversePostOrderTraversal<const Function *> RPOT(&F); in processFunction() local 135 for (const BasicBlock *BB : RPOT) { in processFunction() 588 ReversePostOrderTraversal<const Function *> RPOT(&Tracker.F); in verifyFunction() local 589 for (const BasicBlock *BB : RPOT) { in verifyFunction()
|
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/GlobalISel/ |
H A D | Legalizer.cpp | 188 ReversePostOrderTraversal<MachineFunction *> RPOT(&MF); in legalizeMachineFunction() local 190 // Traverse BB in RPOT and within each basic block, add insts top down, in legalizeMachineFunction() 192 for (auto *MBB : RPOT) { in legalizeMachineFunction()
|
/freebsd/contrib/llvm-project/llvm/lib/Target/AArch64/ |
H A D | SVEIntrinsicOpts.cpp | 408 ReversePostOrderTraversal<BasicBlock *> RPOT(Root); in optimizeInstructions() local 409 for (auto *BB : RPOT) { in optimizeInstructions()
|
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Coroutines/ |
H A D | CoroFrame.cpp | 122 bool computeBlockData(const ReversePostOrderTraversal<Function *> &RPOT); 232 const ReversePostOrderTraversal<Function *> &RPOT) { in computeBlockData() argument 235 for (const BasicBlock *BB : RPOT) { in computeBlockData() 333 ReversePostOrderTraversal<Function *> RPOT(&F); in SuspendCrossingInfo() local 334 computeBlockData</*Initialize=*/true>(RPOT); in SuspendCrossingInfo() 335 while (computeBlockData</*Initialize*/ false>(RPOT)) in SuspendCrossingInfo() 2331 ReversePostOrderTraversal<RematGraph *> RPOT(RG); in rewriteMaterializableInstructions() local 2348 auto I = RPOT.begin(); in rewriteMaterializableInstructions() 2350 for (; I != RPOT.end(); ++I) { in rewriteMaterializableInstructions() 3083 ReversePostOrderTraversal<RematGraph *> RPOT(RematUPtr.get()); in doRematerializations() [all …]
|
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/ |
H A D | VPlan.cpp | 731 RPOT(Entry); in execute() local 748 for (VPBlockBase *Block : RPOT) { in execute() 769 for (VPBlockBase *Block : RPOT) { in execute() 1468 RPOT(Region->getEntry()); in visitRegion() local 1469 for (VPBlockBase *Base : RPOT) { in visitRegion() 1560 RPOT(VPBlockDeepTraversalWrapper<const VPBlockBase *>(Plan.getEntry())); in assignNames() 1562 VPBlockUtils::blocksOnly<const VPBasicBlock>(RPOT)) in assignNames()
|
H A D | VPlanTransforms.cpp | 36 ReversePostOrderTraversal<VPBlockDeepTraversalWrapper<VPBlockBase *>> RPOT( in VPInstructionsToVPRecipes() local 38 for (VPBasicBlock *VPBB : VPBlockUtils::blocksOnly<VPBasicBlock>(RPOT)) { in VPInstructionsToVPRecipes() 509 ReversePostOrderTraversal<VPBlockDeepTraversalWrapper<VPBlockBase *>> RPOT( in removeDeadRecipes() local 512 for (VPBasicBlock *VPBB : reverse(VPBlockUtils::blocksOnly<VPBasicBlock>(RPOT))) { in removeDeadRecipes() 1070 ReversePostOrderTraversal<VPBlockDeepTraversalWrapper<VPBlockBase *>> RPOT( in simplifyRecipes() local 1073 for (VPBasicBlock *VPBB : VPBlockUtils::blocksOnly<VPBasicBlock>(RPOT)) { in simplifyRecipes()
|
/freebsd/contrib/llvm-project/clang/lib/StaticAnalyzer/Frontend/ |
H A D | AnalysisConsumer.cpp | 456 llvm::ReversePostOrderTraversal<clang::CallGraph*> RPOT(&CG); in HandleDeclsCallGraph() local 457 for (auto &N : RPOT) { in HandleDeclsCallGraph()
|
/freebsd/contrib/llvm-project/llvm/lib/Transforms/IPO/ |
H A D | HotColdSplitting.cpp | 657 ReversePostOrderTraversal<Function *> RPOT(&F); in outlineColdRegions() local 680 for (BasicBlock *BB : RPOT) { in outlineColdRegions()
|