Searched refs:RIt (Results 1 – 7 of 7) sorted by relevance
1304 SmallVector<MachineDomTreeNode *, 32>::reverse_iterator RIt = Orders.rbegin(); in getVisitOrders() local1305 for (; RIt != Orders.rend(); RIt++) in getVisitOrders()1306 LLVM_DEBUG(dbgs() << "BB" << (*RIt)->getBlock()->getNumber() << ","); in getVisitOrders()1348 SmallVector<MachineDomTreeNode *, 32>::reverse_iterator RIt = Orders.rbegin(); in runHoistSpills() local1349 for (; RIt != Orders.rend(); RIt++) { in runHoistSpills()1350 MachineBasicBlock *Block = (*RIt)->getBlock(); in runHoistSpills()1353 if (SpillsToKeep.find(*RIt) != SpillsToKeep.end() && !SpillsToKeep[*RIt]) { in runHoistSpills()1354 SpillsInSubTreeMap[*RIt].first.insert(*RIt); in runHoistSpills()1356 SpillsInSubTreeMap[*RIt].second = MBFI.getBlockFreq(Block); in runHoistSpills()1362 const std::vector<MachineDomTreeNode *> &Children = (*RIt)->getChildren(); in runHoistSpills()[all …]
167 MachineBasicBlock::reverse_iterator RIt = CondBr.getReverseIterator(); in knownRegValInBlock() local168 for (MachineInstr &PredI : make_range(std::next(RIt), PredMBB->rend())) { in knownRegValInBlock()
267 for (auto RIt = Orders.rbegin(); RIt != Orders.rend(); RIt++) { in findBestInsertionSet() local268 BasicBlock *Node = *RIt; in findBestInsertionSet()
642 auto RIt = llvm::find(Roots, BB);643 if (RIt != Roots.end()) {644 std::swap(*RIt, Roots.back());
690 auto RIt = llvm::find(DT.Roots, To->getBlock()); in UpdateRootsBeforeInsertion() local691 if (RIt == DT.Roots.end()) in UpdateRootsBeforeInsertion()
140 template<class RIt>141 static bool is_raw_ptr(RIt) in is_raw_ptr() argument
57986 zda2=XV0<RIt&=9)u532qbVyw-US0Q;yZ!ZVE20#LO+IY$U4`W$-&G14R_A+I#Q&e_