Lines Matching defs:DefI
342 MachineInstr *DefI = LIS->getInstructionFromIndex(NextI->start);
343 if (HII->isPredicated(*DefI))
419 MachineInstr *DefI = LIS->getInstructionFromIndex(Seg.start);
420 Defs.insert(DefI->getParent());
421 if (HII->isPredicated(*DefI))
473 MachineInstr *DefI = LIS->getInstructionFromIndex(Seg.start);
474 for (auto &Op : DefI->operands()) {
490 MachineInstr *DefI = LIS->getInstructionFromIndex(Seg.start);
491 if (!HII->isPredicated(*DefI))
497 for (unsigned i = 0, e = DefI->getNumOperands(); i != e; ++i) {
498 MachineOperand &Op = DefI->getOperand(i);
518 MachineFunction &MF = *DefI->getParent()->getParent();
521 MachineInstrBuilder(MF, DefI).addReg(R.Reg, RegState::Implicit, R.Sub);
522 DefI->tieOperands(P.second, DefI->getNumOperands()-1);
959 MachineInstr *DefI = getReachingDefForPred(RT, TfrI, PredR, Cond);
960 if (!DefI || !isPredicable(DefI))
963 LLVM_DEBUG(dbgs() << "Source def: " << *DefI);
966 // DefI and the TfrI.
969 MachineBasicBlock::iterator DefIt = DefI, TfrIt = TfrI;
971 // Check if the predicate register is valid between DefI and TfrI.
1019 // RT = DefI
1024 // DefI and TfrI, we may not be able proceed with this transformation.
1027 // TfrI), we will not be able to move DefI down. If there is a use that
1034 // If the predicate register is defined between DefI and TfrI, the only
1035 // potential thing to do would be to move the DefI down to TfrI, and then
1036 // predicate. The reaching def (DefI) must be movable down to the location
1039 // DefI and TfrI, consider moving TfrI up to DefI.
1041 bool CanDown = canMoveOver(*DefI, Defs, Uses);
1042 // The TfrI does not access memory, but DefI could. Check if it's safe
1043 // to move DefI down to TfrI.
1044 if (DefI->mayLoadOrStore())
1045 if (!canMoveMemTo(*DefI, TfrI, true))
1052 predicateAt(MD, *DefI, PastDefIt, MP, Cond, UpdRegs);
1054 predicateAt(MD, *DefI, TfrIt, MP, Cond, UpdRegs);
1064 removeInstr(*DefI);