Lines Matching defs:Reg

70 unsigned AggressiveAntiDepState::GetGroup(unsigned Reg) {
71 unsigned Node = GroupNodeIndices[Reg];
83 for (unsigned Reg = 0; Reg != NumTargetRegs; ++Reg) {
84 if ((GetGroup(Reg) == Group) && (RegRefs->count(Reg) > 0))
85 Regs.push_back(Reg);
91 assert(GroupNodeIndices[0] == 0 && "Reg 0 not in Group 0!");
104 unsigned AggressiveAntiDepState::LeaveGroup(unsigned Reg) {
105 // Create a new GroupNode for Reg. Reg's existing GroupNode must
110 GroupNodeIndices[Reg] = idx;
114 bool AggressiveAntiDepState::IsLive(unsigned Reg) {
117 return((KillIndices[Reg] != ~0u) && (DefIndices[Reg] == ~0u));
158 unsigned Reg = *AI;
159 State->UnionGroups(Reg, 0);
160 KillIndices[Reg] = BB->size();
161 DefIndices[Reg] = ~0u;
172 unsigned Reg = *I;
173 if (!IsReturnBlock && !Pristine.test(Reg))
175 for (MCRegAliasIterator AI(Reg, TRI, true); AI.isValid(); ++AI) {
203 for (unsigned Reg = 1; Reg != TRI->getNumRegs(); ++Reg) {
204 // If Reg is current live, then mark that it can't be renamed as
210 if (State->IsLive(Reg)) {
211 LLVM_DEBUG(if (State->GetGroup(Reg) != 0) dbgs()
212 << " " << printReg(Reg, TRI) << "=g" << State->GetGroup(Reg)
214 State->UnionGroups(Reg, 0);
215 } else if ((DefIndices[Reg] < InsertPosIndex)
216 && (DefIndices[Reg] >= Count)) {
217 DefIndices[Reg] = Count;
228 Register Reg = MO.getReg();
229 if (Reg == 0)
234 Op = MI.findRegisterUseOperand(Reg, /*TRI=*/nullptr, true);
236 Op = MI.findRegisterDefOperand(Reg, /*TRI=*/nullptr);
248 const Register Reg = MO.getReg();
249 for (MCPhysReg SubReg : TRI->subregs_inclusive(Reg))
291 void AggressiveAntiDepBreaker::HandleLastUse(unsigned Reg, unsigned KillIdx,
304 for (MCRegAliasIterator AI(Reg, TRI, true); AI.isValid(); ++AI)
305 if (TRI->isSuperRegister(Reg, *AI) && State->IsLive(*AI)) {
310 if (!State->IsLive(Reg)) {
311 KillIndices[Reg] = KillIdx;
312 DefIndices[Reg] = ~0u;
313 RegRefs.erase(Reg);
314 State->LeaveGroup(Reg);
316 dbgs() << header << printReg(Reg, TRI);
319 LLVM_DEBUG(dbgs() << "->g" << State->GetGroup(Reg) << tag);
324 for (MCPhysReg SubregReg : TRI->subregs(Reg)) {
331 dbgs() << header << printReg(Reg, TRI);
355 Register Reg = MO.getReg();
356 if (Reg == 0) continue;
358 HandleLastUse(Reg, Count + 1, "", "\tDead Def: ", "\n");
365 Register Reg = MO.getReg();
366 if (Reg == 0) continue;
368 LLVM_DEBUG(dbgs() << " " << printReg(Reg, TRI) << "=g"
369 << State->GetGroup(Reg));
378 LLVM_DEBUG(if (State->GetGroup(Reg) != 0) dbgs() << "->g0(alloc-req)");
379 State->UnionGroups(Reg, 0);
383 // partially defined here, so group those aliases with Reg.
384 for (MCRegAliasIterator AI(Reg, TRI, false); AI.isValid(); ++AI) {
387 State->UnionGroups(Reg, AliasReg);
388 LLVM_DEBUG(dbgs() << "->g" << State->GetGroup(Reg) << "(via "
398 RegRefs.insert(std::make_pair(Reg, RR));
407 Register Reg = MO.getReg();
408 if (Reg == 0) continue;
410 if (MI.isKill() || (PassthruRegs.count(Reg) != 0))
413 // Update def for Reg and aliases.
414 for (MCRegAliasIterator AI(Reg, TRI, true); AI.isValid(); ++AI) {
421 if (TRI->isSuperRegister(Reg, *AI) && State->IsLive(*AI))
460 Register Reg = MO.getReg();
461 if (Reg == 0) continue;
463 LLVM_DEBUG(dbgs() << " " << printReg(Reg, TRI) << "=g"
464 << State->GetGroup(Reg));
469 HandleLastUse(Reg, Count, "(last-use)");
472 LLVM_DEBUG(if (State->GetGroup(Reg) != 0) dbgs() << "->g0(alloc-req)");
473 State->UnionGroups(Reg, 0);
481 RegRefs.insert(std::make_pair(Reg, RR));
494 Register Reg = MO.getReg();
495 if (Reg == 0) continue;
498 LLVM_DEBUG(dbgs() << "=" << printReg(Reg, TRI));
499 State->UnionGroups(FirstReg, Reg);
501 LLVM_DEBUG(dbgs() << " " << printReg(Reg, TRI));
502 FirstReg = Reg;
510 BitVector AggressiveAntiDepBreaker::GetRenameRegisters(unsigned Reg) {
514 // Check all references that need rewriting for Reg. For each, use
517 for (const auto &Q : make_range(State->GetRegRefs().equal_range(Reg))) {
557 for (unsigned Reg : Regs) {
558 // If Reg has any references, then collect possible rename regs
559 if (RegRefs.count(Reg) > 0) {
560 LLVM_DEBUG(dbgs() << "\t\t" << printReg(Reg, TRI) << ":");
562 BitVector &BV = RenameRegisterMap[Reg];
564 BV = GetRenameRegisters(Reg);
576 for (unsigned Reg : Regs) {
577 if (Reg == SuperReg) continue;
578 bool IsSub = TRI->isSubRegister(SuperReg, Reg);
637 for (unsigned Reg : Regs) {
639 if (Reg == SuperReg) {
642 unsigned NewSubRegIdx = TRI->getSubRegIndex(SuperReg, Reg);
649 // Check if Reg can be renamed to NewReg.
650 if (!RenameRegisterMap[Reg].test(NewReg)) {
656 // Regs's kill, it's safe to replace Reg with NewReg. We
659 if (State->IsLive(NewReg) || (KillIndices[Reg] > DefIndices[NewReg])) {
667 (KillIndices[Reg] > DefIndices[AliasReg])) {
678 // We cannot rename 'Reg' to 'NewReg' if one of the uses of 'Reg' also
680 for (const auto &Q : make_range(RegRefs.equal_range(Reg))) {
692 // Also, we cannot rename 'Reg' to 'NewReg' if the instruction defining
693 // 'Reg' is an early-clobber define and that instruction also uses
695 for (const auto &Q : make_range(RegRefs.equal_range(Reg))) {
706 // Record that 'Reg' can be renamed to 'NewReg'.
707 RenameMap.insert(std::pair<unsigned, unsigned>(Reg, NewReg));
772 for (unsigned Reg = 1; Reg < TRI->getNumRegs(); ++Reg) {
773 if (!State->IsLive(Reg))
774 LLVM_DEBUG(dbgs() << " " << printReg(Reg, TRI));