Searched refs:post_order (Results 1 – 19 of 19) sorted by relevance
83 for (auto *DomNode : post_order(&MDT)) { in recalculate()196 for (auto *DomNode : post_order(&MDT)) { in recalculate()242 for (auto *DomNode : post_order(&MDT)) { in recalculate()
127 for (MachineBasicBlock *MBB : post_order(&MF)) { in eliminateDeadMI()
1104 for (auto *DomNode : post_order(DomTree)) in runOnMachineFunction()1237 for (auto *DomNode : post_order(DomTree)) in runOnMachineFunction()
147 for (MachineBasicBlock *MBB : post_order(&MF)) { in combineMachineInstrs()
140 for (MachineBasicBlock *MBB : post_order(&MF)) { in runOnMachineFunction()
124 for (MachineBasicBlock *MBB : post_order(&MF)) { in runOnMachineFunction()
635 for (auto *MBBI : post_order(&(MF.front()))) { in buildMRT()
180 llvm::for_each(post_order(&F->getEntryBlock()), evaluateBB); in computeDeoptOrUnreachablePaths()
490 for (NodeType *N : post_order(&Graph)) { in sortNodesTopologically()
1254 for (const auto *BB : post_order(&F.getEntryBlock())) { in calculate()
521 for (BlockT *BB : post_order(EntryBlock)) in traverse()569 for (auto DomNode : post_order(DomRoot)) { in analyze()
193 template <class T> iterator_range<po_iterator<T>> post_order(const T &G) { in post_order() function
256 for (MachineBasicBlock *MBB : post_order(&MF)) { in generateAssignInstrs()
706 for (auto DomNode : post_order(N)) in scanForRegions()
357 for (BasicBlock *BB : post_order(&Func)) { in visit()
434 for (BasicBlock *BB : post_order(&F)) { in run()
13396 for (auto *BB : post_order(&F.getEntryBlock())) { in runImpl()
875 for (BasicBlock *BB : post_order(&F)) { in DSEState()
981 for (MachineBasicBlock *B : post_order(&MF)) in rewrite()