647       unsigned NewReg = 0;  in FindSuitableFreeRegisters()  local
649         NewReg = NewSuperReg;  in FindSuitableFreeRegisters()
653           NewReg = TRI->getSubReg(NewSuperReg, NewSubRegIdx);  in FindSuitableFreeRegisters()
656       LLVM_DEBUG(dbgs() << " " << printReg(NewReg, TRI));  in FindSuitableFreeRegisters()
659       if (!RenameRegisterMap[Reg].test(NewReg)) {  in FindSuitableFreeRegisters()
668       if (State->IsLive(NewReg) || (KillIndices[Reg] > DefIndices[NewReg])) {  in FindSuitableFreeRegisters()
673         for (MCRegAliasIterator AI(NewReg, TRI, false); AI.isValid(); ++AI) {  in FindSuitableFreeRegisters()
691         int Idx = UseMI->findRegisterDefOperandIdx(NewReg, false, true, TRI);  in FindSuitableFreeRegisters()
709         if (DefMI->readsRegister(NewReg, TRI)) {  in FindSuitableFreeRegisters()
716       RenameMap.insert(std::pair<unsigned, unsigned>(Reg, NewReg));  in FindSuitableFreeRegisters()
945             unsigned NewReg = P.second;  in BreakAntiDependencies()  local
948                               << printReg(NewReg, TRI) << "("  in BreakAntiDependencies()
954               Q.second.Operand->setReg(NewReg);  in BreakAntiDependencies()
961                               AntiDepReg, NewReg);  in BreakAntiDependencies()
967             State->UnionGroups(NewReg, 0);  in BreakAntiDependencies()
968             RegRefs.erase(NewReg);  in BreakAntiDependencies()
969             DefIndices[NewReg] = DefIndices[CurrReg];  in BreakAntiDependencies()
970             KillIndices[NewReg] = KillIndices[CurrReg];  in BreakAntiDependencies()