Searched refs:toErase (Results 1 – 5 of 5) sorted by relevance
50 SmallPtrSet<Operation *, 16> toErase; in removeCopy() local87 if (!checkDominance(copyOp, copyTarget.getUsers(), toErase)) continue; in removeCopy()95 toErase.insert(lastOp); in removeCopy()102 toErase.insert(copyOp); in removeCopy()105 for (auto *eraseOp : toErase) eraseOp->erase(); in removeCopy()
378 SmallVector<MachineInstr*, 4> toErase; in RemoveDeadStores() local390 toErase.push_back(&*I); in RemoveDeadStores()410 toErase.push_back(&*I); in RemoveDeadStores()413 toErase.push_back(&*NextMI); in RemoveDeadStores()417 for (SmallVectorImpl<MachineInstr *>::iterator I = toErase.begin(), in RemoveDeadStores()418 E = toErase.end(); I != E; ++I) in RemoveDeadStores()
428 SmallVector<MachineInstr*, 4> toErase; in RemoveDeadStores() local439 toErase.push_back(&*I); in RemoveDeadStores()469 toErase.push_back(&*ProbableLoadMI); in RemoveDeadStores()472 toErase.push_back(&*NextMI); in RemoveDeadStores()476 for (SmallVectorImpl<MachineInstr *>::iterator I = toErase.begin(), in RemoveDeadStores()477 E = toErase.end(); I != E; ++I) in RemoveDeadStores()
420 SmallVector<MachineInstr*, 4> toErase; in RemoveDeadStores() local431 toErase.push_back(&*I); in RemoveDeadStores()461 toErase.push_back(&*ProbableLoadMI); in RemoveDeadStores()464 toErase.push_back(&*NextMI); in RemoveDeadStores()468 for (MachineInstr *MI : toErase) in RemoveDeadStores()
463 if (const size_t toErase = overlimit + expired; in expirations() local464 toErase > 0) { in expirations()467 mItemsDiscarded += (int64_t)toErase; in expirations()468 mItems.erase(mItems.begin(), mItems.begin() + (ptrdiff_t)toErase); // erase from front in expirations()