/netbsd/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/ |
H A D | HexagonGenInsert.cpp | 541 const MachineBasicBlock *ToB, const UnsignedMap &RPO, 753 const MachineBasicBlock *ToB, const UnsignedMap &RPO, in distance() argument 764 unsigned ToRPO = RPO.lookup(ToN); in distance() 775 if (PB == FromB || RPO.lookup(PB->getNumber()) >= ToRPO) in distance() 777 unsigned D = PB->size() + distance(FromB, PB, RPO, M); in distance() 794 unsigned D2 = distance(FB, TB, RPO, M); in distance() 1162 unsigned DSV = distance(DefS, DefV, RPO, M); in pruneUsesTooFar() 1164 unsigned DIV = distance(DefI, DefV, RPO, M); in pruneUsesTooFar() 1191 UnsignedMap RPO; in pruneCandidates() local 1198 RPO[(*I)->getNumber()] = RPON++; in pruneCandidates() [all …]
|
H A D | HexagonFrameLowering.cpp | 417 UnsignedMap RPO; in findShrunkPrologEpilog() local 421 RPO[(*I)->getNumber()] = RPON++; in findShrunkPrologEpilog() 427 unsigned BN = RPO[I.getNumber()]; in findShrunkPrologEpilog() 430 if (RPO[(*SI)->getNumber()] <= BN) in findShrunkPrologEpilog()
|
/netbsd/external/apache2/llvm/dist/llvm/lib/Transforms/Vectorize/ |
H A D | VPlanHCFGBuilder.cpp | 270 LoopBlocksRPO RPO(TheLoop); in buildPlainCFG() local 271 RPO.perform(LI); in buildPlainCFG() 273 for (BasicBlock *BB : RPO) { in buildPlainCFG()
|
/netbsd/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/ |
H A D | LoopSimplifyCFG.cpp | 193 DenseMap<const BasicBlock *, unsigned> RPO; in hasIrreducibleCFG() local 196 RPO[*I] = Current++; in hasIrreducibleCFG() 201 if (L.contains(Succ) && !LI.isLoopHeader(Succ) && RPO[BB] > RPO[Succ]) in hasIrreducibleCFG()
|
/netbsd/external/apache2/llvm/dist/llvm/lib/Target/X86/ |
H A D | X86WinAllocaExpander.cpp | 147 ReversePostOrderTraversal<MachineFunction*> RPO(&MF); in computeLowerings() local 149 for (MachineBasicBlock *MBB : RPO) { in computeLowerings()
|
/netbsd/external/apache2/llvm/dist/llvm/docs/ |
H A D | Lexicon.rst | 259 **RPO**
|
/netbsd/external/gpl3/gcc/dist/gcc/doc/ |
H A D | rtl.texi | 4447 @cindex RPO 4453 a reverse postorder (RPO) traversal of the function. This means that 4461 occurs earlier than the other in the RPO@. One way to do this is 4475 in the RPO, less than zero if @var{insn1} comes before @var{insn2} in the 4476 RPO, or zero if @var{insn1} and @var{insn2} are the same. This order is
|
H A D | gcc.info | 11619 When the limit hits the innermost RPO-VN-MAX-LOOP-DEPTH loops
|
/netbsd/external/gpl3/gcc/dist/gcc/ |
H A D | ChangeLog-2018 | 8662 RPO index. 8668 everything in RPO order, prioritizing forward progress 10839 Compute max_rpo, the max RPO number a block can be backwards reached 10840 from. Re-write non-iterating mode to a RPO ordered worklist approach, 12233 RPO VN in optimistic mode (iterating). For -O1 and -Og 12234 run RPO VN in non-optimistic mode. 12246 (pass_pre::execute): Adjust to the RPO VN API. 30406 for specifying RPO order and allow NULL for that. 30408 (dom_walker::walk): Handle NULL RPO order. 30410 in RPO order. [all …]
|
H A D | ChangeLog-2021 | 14996 over a part of the RPO array and do not recurse here. 14998 (fill_always_executed_in): Walk over the RPO array and 15000 (loop_invariant_motion_in_fun): Compute the first RPO 15038 over a part of the RPO array and do not recurse here. 15040 (fill_always_executed_in): Walk over the RPO array and 15042 (loop_invariant_motion_in_fun): Compute the first RPO 29840 Compute RPO with programing order preserved by calling function 32368 degenerate phis needed by the linear RPO view.
|
H A D | ChangeLog-2017 | 3056 (build_scops): Sort pbbs in RPO order. 13429 RPO mapping. 13434 * domwalk.c (dom_walker::dom_walker): Compute bb to RPO 13436 (dom_walker::~dom_walker): Free bb to RPO mapping if not 13439 (dom_walker::walk): Do not compute bb to RPO mapping here. 13446 (gather_bbs::gather_bbs): Get and pass through bb to RPO 13450 (build_scops): Compute bb to RPO mapping and pass it to 13829 in RPO order.
|
H A D | ChangeLog-2020 | 2984 * tree-ssa-pre.c (insert): Fix successor RPO order check. 14648 * tree-ssa-loop-im.c (tree_ssa_lim): Recompute RPO after 15694 (tree_ssa_lim): ... here, share RPO order and avoid some 16607 compute a RPO with adjacent SCC members when requesting an 17653 RPO order check. Dump statistics about the number of 39422 after CFG manipulations and in RPO order to catch all
|
H A D | ChangeLog | 3730 Compute RPO with programing order preserved by calling function 3745 compute a RPO with adjacent SCC members when requesting an 25541 after CFG manipulations and in RPO order to catch all
|
H A D | ChangeLog-2016 | 9063 * domwalk.c (dom_walker::walk): Use RPO order. 14939 * tree-ssa-forwprop.c (pass_forwprop::execute): Use RPO order. 15500 * tree-ssa-propagate.c (ssa_prop_init): Use RPO order. Clear 33688 (move_computations): Perform an RPO rather than a DOM walk.
|
H A D | ChangeLog-2012 | 15866 (add_scope_conflicts): Iterate in RPO order.
|
H A D | ChangeLog-2019 | 29002 (insert): ... this function. Use a RPO walk to reduce the
|
/netbsd/external/gpl3/gcc.old/dist/gcc/doc/ |
H A D | gcc.info | 11619 When the limit hits the innermost RPO-VN-MAX-LOOP-DEPTH loops
|