Searched refs:RPOT (Results 1 - 25 of 38) sorted by relevance

12

/freebsd-12-stable/contrib/llvm-project/llvm/lib/CodeGen/
H A DMIRNamerPass.cpp61 ReversePostOrderTraversal<MachineBasicBlock *> RPOT(&*MF.begin()); variable
62 for (auto &MBB : RPOT)
H A DLoopTraversal.cpp29 ReversePostOrderTraversal<MachineBasicBlock *> RPOT(Entry);
32 for (MachineBasicBlock *MBB : RPOT) {
66 for (MachineBasicBlock *MBB : RPOT) {
H A DMIRCanonicalizerPass.cpp86 ReversePostOrderTraversal<MachineBasicBlock *> RPOT(&*MF.begin());
88 for (auto MBB : RPOT) {
H A DSwiftErrorValueTracking.cpp157 ReversePostOrderTraversal<MachineFunction *> RPOT(MF);
158 for (MachineBasicBlock *MBB : RPOT) {
H A DShrinkWrap.cpp471 ReversePostOrderTraversal<MachineBasicBlock *> RPOT(&*MF.begin());
472 if (containsIrreducibleCFG<MachineBasicBlock *>(RPOT, *MLI)) {
H A DLiveDebugValues.cpp1550 ReversePostOrderTraversal<MachineFunction *> RPOT(&MF);
1552 for (auto RI = RPOT.begin(), RE = RPOT.end(); RI != RE; ++RI) {
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DVPlanPredicator.cpp189 ReversePostOrderTraversal<VPBlockBase *> RPOT(EntryBlock);
194 for (VPBlockBase *Block : make_range(RPOT.begin(), RPOT.end())) {
202 // TODO: Predication and linearization need RPOT for every region.
204 // blocks, we should be able to compute RPOT once in predication and
208 ReversePostOrderTraversal<VPBlockBase *> RPOT(Region->getEntry());
211 for (VPBlockBase *CurrBlock : make_range(RPOT.begin(), RPOT.end())) {
H A DVPlanTransforms.cpp25 ReversePostOrderTraversal<VPBlockBase *> RPOT(TopRegion->getEntry());
30 for (VPBlockBase *Base : RPOT) {
38 for (VPBlockBase *Base : RPOT) {
H A DVPlan.cpp232 ReversePostOrderTraversal<VPBlockBase *> RPOT(Entry);
236 for (VPBlockBase *Block : RPOT) {
267 for (VPBlockBase *Block : RPOT) {
764 ReversePostOrderTraversal<VPBlockBase *> RPOT(Region->getEntry());
765 for (VPBlockBase *Base : RPOT) {
/freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DBlockFrequencyInfoImpl.h728 /// Run a single post-order traversal and save it (in reverse) in RPOT.
730 /// to BlockNode (the index into RPOT) in Nodes.
858 std::vector<const BlockT *> RPOT; member in class:llvm::BlockFrequencyInfoImpl
863 rpot_iterator rpot_begin() const { return RPOT.begin(); }
864 rpot_iterator rpot_end() const { return RPOT.end(); }
874 assert(Node.Index < RPOT.size());
875 return RPOT[Node.Index];
1030 RPOT.clear();
1065 RPOT.reserve(F->size());
1066 std::copy(po_begin(Entry), po_end(Entry), std::back_inserter(RPOT));
[all...]
/freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/Transforms/Scalar/
H A 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/
H A DSIPreAllocateWWMRegs.cpp186 ReversePostOrderTraversal<MachineFunction*> RPOT(&MF);
188 for (MachineBasicBlock *MBB : RPOT) {
H A DSIWholeQuadMode.cpp323 ReversePostOrderTraversal<MachineFunction *> RPOT(&MF);
324 for (auto BI = RPOT.begin(), BE = RPOT.end(); BI != BE; ++BI) {
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DLowerConstantIntrinsics.cpp91 ReversePostOrderTraversal<Function *> RPOT(&F);
92 for (BasicBlock *BB : RPOT) {
H A DLoopInstSimplify.cpp78 LoopBlocksRPO RPOT(&L);
79 RPOT.perform(&LI);
86 for (BasicBlock *BB : RPOT) {
H A DStructurizeCFG.cpp336 ReversePostOrderTraversal<Region*> RPOT(ParentRegion);
342 for (RegionNode *RN : RPOT) {
349 for (auto I = RPOT.begin(), E = RPOT.end(); I != E; ++I) {
H A DReassociate.cpp167 ReversePostOrderTraversal<Function*> &RPOT) {
178 for (BasicBlock *BB : RPOT) {
2328 ReassociatePass::BuildPairMap(ReversePostOrderTraversal<Function *> &RPOT) {
2330 for (BasicBlock *BI : RPOT) {
2393 ReversePostOrderTraversal<Function *> RPOT(&F);
2396 BuildRankMap(F, RPOT);
2407 BuildPairMap(RPOT);
2412 for (BasicBlock *BI : RPOT) {
166 BuildRankMap(Function &F, ReversePostOrderTraversal<Function*> &RPOT) argument
/freebsd-12-stable/contrib/llvm-project/clang/lib/Analysis/
H A DCallGraph.cpp219 llvm::ReversePostOrderTraversal<const CallGraph *> RPOT(this);
221 I = RPOT.begin(), E = RPOT.end(); I != E; ++I) {
/freebsd-12-stable/contrib/llvm-project/llvm/lib/CodeGen/GlobalISel/
H A DLegalizer.cpp152 ReversePostOrderTraversal<MachineFunction *> RPOT(&MF);
154 // Traverse BB in RPOT and within each basic block, add insts top down,
156 for (auto *MBB : RPOT) {
/freebsd-12-stable/contrib/llvm-project/llvm/lib/IR/
H A DSafepointIRVerifier.cpp135 ReversePostOrderTraversal<const Function *> RPOT(&F);
136 for (const BasicBlock *BB : RPOT) {
582 ReversePostOrderTraversal<const Function *> RPOT(&Tracker.F);
583 for (const BasicBlock *BB : RPOT) {
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/X86/
H A DX86WinEHState.cpp659 ReversePostOrderTraversal<Function *> RPOT(&F);
669 for (BasicBlock *BB : RPOT) {
719 for (BasicBlock *BB : RPOT) {
731 for (BasicBlock *BB : RPOT) {
760 for (BasicBlock *BB : RPOT) {
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DHotColdSplitting.cpp552 ReversePostOrderTraversal<Function *> RPOT(&F);
570 for (BasicBlock *BB : RPOT) {
/freebsd-12-stable/contrib/llvm-project/clang/lib/StaticAnalyzer/Frontend/
H A DAnalysisConsumer.cpp560 llvm::ReversePostOrderTraversal<clang::CallGraph*> RPOT(&CG);
562 I = RPOT.begin(), E = RPOT.end(); I != E; ++I) {
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/ARM/
H A DThumb2SizeReduction.cpp1138 ReversePostOrderTraversal<MachineFunction*> RPOT(&MF);
1141 I = RPOT.begin(), E = RPOT.end(); I != E; ++I)
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Analysis/
H A DTargetTransformInfo.cpp50 LoopBlocksRPO RPOT(L);
51 RPOT.perform(&LI);
52 if (containsIrreducibleCFG<const BasicBlock *>(RPOT, LI))

Completed in 297 milliseconds

12