Searched defs:RIt (Results 1 – 10 of 10) sorted by relevance
22 using RIt = std::reverse_iterator<path::iterator>; in main() typedef
166 MachineBasicBlock::reverse_iterator RIt = CondBr.getReverseIterator(); in knownRegValInBlock() local
167 MachineBasicBlock::reverse_iterator RIt = CondBr.getReverseIterator(); in knownRegValInBlock() local
1413 SmallVector<MachineDomTreeNode *, 32>::reverse_iterator RIt = Orders.rbegin(); in getVisitOrders() local1457 SmallVector<MachineDomTreeNode *, 32>::reverse_iterator RIt = Orders.rbegin(); in runHoistSpills() local
2165 for (auto RIt = Locs->rbegin(), REnd = Locs->rend(); RIt != REnd; ++RIt) { in removeRedundantDbgLocsUsingBackwardScan() local
1304 SmallVector<MachineDomTreeNode *, 32>::reverse_iterator RIt = Orders.rbegin(); in getVisitOrders() local1348 SmallVector<MachineDomTreeNode *, 32>::reverse_iterator RIt = Orders.rbegin(); in runHoistSpills() local
1217 SmallVector<MachineDomTreeNode *, 32>::reverse_iterator RIt = Orders.rbegin(); in getVisitOrders() local1260 SmallVector<MachineDomTreeNode *, 32>::reverse_iterator RIt = Orders.rbegin(); in runHoistSpills() local
267 for (auto RIt = Orders.rbegin(); RIt != Orders.rend(); RIt++) { in findBestInsertionSet() local
142 static bool is_raw_ptr(RIt) in is_raw_ptr() argument
690 auto RIt = llvm::find(DT.Roots, To->getBlock()); in UpdateRootsBeforeInsertion() local