| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Coroutines/ |
| H A D | SuspendCrossingInfo.cpp | 35 const ReversePostOrderTraversal<Function *> &RPOT, in dump() argument 38 for (const BasicBlock *BB : RPOT) { in dump() 58 ReversePostOrderTraversal<Function *> RPOT(F); in dump() local 59 for (const BasicBlock *BB : RPOT) { in dump() 63 dump(" Consumes", Block[BBNo].Consumes, RPOT, MST); in dump() 64 dump(" Kills", Block[BBNo].Kills, RPOT, MST); in dump() 93 const ReversePostOrderTraversal<Function *> &RPOT) { in computeBlockData() argument 96 for (const BasicBlock *BB : RPOT) { in computeBlockData() 206 ReversePostOrderTraversal<Function *> RPOT(&F); in SuspendCrossingInfo() local 207 computeBlockData</*Initialize=*/true>(RPOT); in SuspendCrossingInfo() [all …]
|
| H A D | MaterializationUtils.cpp | 177 ReversePostOrderTraversal<RematGraph *> RPOT(RG); in rewriteMaterializableInstructions() local 194 auto I = RPOT.begin(); in rewriteMaterializableInstructions() 196 for (; I != RPOT.end(); ++I) { in rewriteMaterializableInstructions() 305 ReversePostOrderTraversal<RematGraph *> RPOT(RematUPtr.get()); in doRematerializations() 306 for (auto I = RPOT.begin(); I != RPOT.end(); in doRematerializations()
|
| /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 | 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 propagateVRegs()
|
| H A D | MIRNamerPass.cpp | 57 ReversePostOrderTraversal<MachineBasicBlock *> RPOT(&*MF.begin()); in runOnMachineFunction() local 58 for (auto &MBB : RPOT) in runOnMachineFunction()
|
| H A D | ShrinkWrap.cpp | 202 const ReversePostOrderTraversal<MachineBasicBlock *> &RPOT, 821 const ReversePostOrderTraversal<MachineBasicBlock *> &RPOT, in performShrinkWrapping() argument 823 for (MachineBasicBlock *MBB : RPOT) { in performShrinkWrapping() 934 ReversePostOrderTraversal<MachineBasicBlock *> RPOT(&*MF.begin()); in run() local 935 if (containsIrreducibleCFG<MachineBasicBlock *>(RPOT, *MLI)) { in run() 957 bool HasCandidate = performShrinkWrapping(RPOT, RS.get()); in run()
|
| H A D | CFIFixup.cpp | 152 ReversePostOrderTraversal<const MachineBasicBlock *> RPOT(&*MF.begin()); in computeBlockInfo() local 153 for (const MachineBasicBlock *MBB : RPOT) { in computeBlockInfo()
|
| H A D | MachineLateInstrsCleanup.cpp | 126 ReversePostOrderTraversal<MachineFunction *> RPOT(&MF); in run() local 127 for (MachineBasicBlock *MBB : RPOT) in run()
|
| /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 | 69 LoopBlocksRPO RPOT(&L); in simplifyLoopInst() local 70 RPOT.perform(&LI); in simplifyLoopInst() 77 for (BasicBlock *BB : RPOT) { in simplifyLoopInst()
|
| H A D | LowerConstantIntrinsics.cpp | 111 ReversePostOrderTraversal<Function *> RPOT(&F); in lowerConstantIntrinsics() local 112 for (BasicBlock *BB : RPOT) { in lowerConstantIntrinsics()
|
| H A D | GVNSink.cpp | 524 ReversePostOrderTraversal<Function*> RPOT(&F); in run() local 525 VN.setReachableBBs(BasicBlocksSet(llvm::from_range, RPOT)); in run() 532 RPOTOrder[*RPOT.begin()] = ++NodeOrdering; in run() 533 for (auto *BB : RPOT) in run() 536 for (auto *N : RPOT) in run()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/ |
| H A D | BlockFrequencyInfoImpl.h | 860 std::vector<const BlockT *> RPOT; 865 rpot_iterator rpot_begin() const { return RPOT.begin(); } 866 rpot_iterator rpot_end() const { return RPOT.end(); } 877 assert(Node.Index < RPOT.size()); 878 return RPOT[Node.Index]; 1106 RPOT.clear(); 1156 RPOT.reserve(F->size()); 1157 std::copy(po_begin(Entry), po_end(Entry), std::back_inserter(RPOT)); 1158 std::reverse(RPOT.begin(), RPOT.end()); 1160 assert(RPOT.size() - 1 <= BlockNode::getMaxIndex() && [all …]
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Scalar/ |
| H A D | Reassociate.h | 102 void BuildRankMap(Function &F, ReversePostOrderTraversal<Function *> &RPOT); 131 void BuildPairMap(ReversePostOrderTraversal<Function *> &RPOT);
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/RISCV/ |
| H A D | RISCVVMV0Elimination.cpp | 93 ReversePostOrderTraversal<MachineBasicBlock *> RPOT(&*MF.begin()); in runOnMachineFunction() local 94 for (MachineBasicBlock *MBB : RPOT) { in runOnMachineFunction()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Coroutines/ |
| H A D | SuspendCrossingInfo.h | 95 bool computeBlockData(const ReversePostOrderTraversal<Function *> &RPOT); 102 const ReversePostOrderTraversal<Function *> &RPOT,
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/ |
| H A D | VPlanPredicator.cpp | 269 ReversePostOrderTraversal<VPBlockShallowTraversalWrapper<VPBlockBase *>> RPOT( in introduceMasksAndLinearize() local 272 for (VPBlockBase *VPB : RPOT) { in introduceMasksAndLinearize() 289 for (VPBasicBlock *VPBB : VPBlockUtils::blocksOnly<VPBasicBlock>(RPOT)) { in introduceMasksAndLinearize()
|
| H A D | VPlanUnroll.cpp | 335 RPOT(VPR->getEntry()); in unrollBlock() local 336 for (VPBlockBase *VPB : RPOT) in unrollBlock() 428 ReversePostOrderTraversal<VPBlockShallowTraversalWrapper<VPBlockBase *>> RPOT( in unrollByUF() local 430 for (VPBlockBase *VPB : RPOT) in unrollByUF()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/InstCombine/ |
| H A D | InstCombiner.h | 84 ReversePostOrderTraversal<BasicBlock *> &RPOT; variable 107 ReversePostOrderTraversal<BasicBlock *> &RPOT) in InstCombiner() argument 112 ORE(ORE), BFI(BFI), BPI(BPI), PSI(PSI), RPOT(RPOT) {} in InstCombiner()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/IR/ |
| H A D | GenericConvergenceVerifierImpl.h | 190 ReversePostOrderTraversal<const FunctionT *> RPOT(&F); in verify() 192 for (auto *BB : RPOT) { in verify()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
| H A D | SIPreAllocateWWMRegs.cpp | 220 ReversePostOrderTraversal<MachineFunction*> RPOT(&MF); in run() local 222 for (MachineBasicBlock *MBB : RPOT) { in run()
|
| /freebsd/contrib/llvm-project/clang/lib/Analysis/ |
| H A D | CallGraph.cpp | 225 llvm::ReversePostOrderTraversal<const CallGraph *> RPOT(this); in print() local 226 for (const CallGraphNode *N : RPOT) { in print()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/X86/ |
| H A D | X86WinEHState.cpp | 669 ReversePostOrderTraversal<Function *> RPOT(&F); in addStateStores() local 679 for (BasicBlock *BB : RPOT) { in addStateStores() 729 for (BasicBlock *BB : RPOT) { in addStateStores() 741 for (BasicBlock *BB : RPOT) { in addStateStores() 770 for (BasicBlock *BB : RPOT) { in addStateStores()
|
| /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() 589 ReversePostOrderTraversal<const Function *> RPOT(&Tracker.F); in verifyFunction() local 590 for (const BasicBlock *BB : RPOT) { in verifyFunction()
|
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/GlobalISel/ |
| H A D | Legalizer.cpp | 187 ReversePostOrderTraversal<MachineFunction *> RPOT(&MF); in legalizeMachineFunction() local 191 for (auto *MBB : RPOT) { in legalizeMachineFunction()
|