Lines Matching defs:Dist
126 bool noUseAfterLastDef(Register Reg, unsigned Dist, unsigned &LastDef);
151 MachineInstr *MI, unsigned Dist);
154 unsigned RegBIdx, unsigned RegCIdx, unsigned Dist);
160 Register RegB, unsigned &Dist);
162 bool isDefTooClose(Register Reg, unsigned Dist, MachineInstr *MI);
172 unsigned &Dist, bool shouldOnlyCommute);
178 unsigned Dist);
187 void processTiedPairs(MachineInstr *MI, TiedPairList&, unsigned &Dist);
339 bool TwoAddressInstructionImpl::noUseAfterLastDef(Register Reg, unsigned Dist,
342 unsigned LastUse = Dist;
356 return !(LastUse > LastDef && LastUse < Dist);
637 unsigned Dist) {
696 if (!noUseAfterLastDef(RegC, Dist, LastDefC))
702 if (!noUseAfterLastDef(RegB, Dist, LastDefB))
742 unsigned Dist) {
788 Register RegA, Register RegB, unsigned &Dist) {
815 DistanceMap.insert(std::make_pair(&MI, Dist++));
816 Dist--;
1074 bool TwoAddressInstructionImpl::isDefTooClose(Register Reg, unsigned Dist,
1085 assert(Dist > DefDist && "Visited def already?");
1086 if (TII->getInstrLatency(InstrItins, DefMI) > (Dist - DefDist))
1242 /// The 'Dist' arguments provides the distance of MI from the start of the
1251 unsigned Dist) {
1278 isProfitableToCommute(DstOpReg, BaseOpReg, OtherOpReg, MI, Dist)) {
1285 Dist)) {
1314 unsigned SrcIdx, unsigned DstIdx, unsigned &Dist, bool shouldOnlyCommute) {
1328 bool Commuted = tryInstructionCommute(&MI, DstIdx, SrcIdx, regBKilled, Dist);
1363 if (convertInstTo3Addr(mi, nmi, regA, regB, Dist)) {
1422 DistanceMap.insert(std::make_pair(NewMIs[0], Dist++));
1423 DistanceMap.insert(std::make_pair(NewMIs[1], Dist));
1435 tryInstructionTransform(NewMI, mi, NewSrcIdx, NewDstIdx, Dist, true);
1502 Dist--;
1555 unsigned &Dist) {
1622 DistanceMap.insert(std::make_pair(&*PrevMI, Dist));
1623 DistanceMap[MI] = ++Dist;
1844 unsigned Dist = 0;
1863 DistanceMap.insert(std::make_pair(&*mi, ++Dist));
1891 tryInstructionTransform(mi, nmi, SrcIdx, DstIdx, Dist, false)) {
1912 processTiedPairs(&*mi, TO.second, Dist);