Lines Matching defs:Reg
60 unsigned AggressiveAntiDepState::GetGroup(unsigned Reg) {
61 unsigned Node = GroupNodeIndices[Reg];
73 for (unsigned Reg = 0; Reg != NumTargetRegs; ++Reg) {
74 if ((GetGroup(Reg) == Group) && (RegRefs->count(Reg) > 0))
75 Regs.push_back(Reg);
82 assert(GroupNodeIndices[0] == 0 && "Reg 0 not in Group 0!");
95 unsigned AggressiveAntiDepState::LeaveGroup(unsigned Reg)
97 // Create a new GroupNode for Reg. Reg's existing GroupNode must
102 GroupNodeIndices[Reg] = idx;
106 bool AggressiveAntiDepState::IsLive(unsigned Reg)
110 return((KillIndices[Reg] != ~0u) && (DefIndices[Reg] == ~0u));
154 unsigned Reg = *AI;
155 State->UnionGroups(Reg, 0);
156 KillIndices[Reg] = BB->size();
157 DefIndices[Reg] = ~0u;
167 unsigned Reg = *I;
168 if (!IsReturnBlock && !Pristine.test(Reg)) continue;
169 for (MCRegAliasIterator AI(Reg, TRI, true); AI.isValid(); ++AI) {
197 for (unsigned Reg = 0; Reg != TRI->getNumRegs(); ++Reg) {
198 // If Reg is current live, then mark that it can't be renamed as
204 if (State->IsLive(Reg)) {
205 DEBUG(if (State->GetGroup(Reg) != 0)
206 dbgs() << " " << TRI->getName(Reg) << "=g" <<
207 State->GetGroup(Reg) << "->g0(region live-out)");
208 State->UnionGroups(Reg, 0);
209 } else if ((DefIndices[Reg] < InsertPosIndex)
210 && (DefIndices[Reg] >= Count)) {
211 DefIndices[Reg] = Count;
223 unsigned Reg = MO.getReg();
224 if (Reg == 0)
229 Op = MI->findRegisterUseOperand(Reg, true);
231 Op = MI->findRegisterDefOperand(Reg);
243 const unsigned Reg = MO.getReg();
244 for (MCSubRegIterator SubRegs(Reg, TRI, /*IncludeSelf=*/true);
289 void AggressiveAntiDepBreaker::HandleLastUse(unsigned Reg, unsigned KillIdx,
302 for (MCRegAliasIterator AI(Reg, TRI, true); AI.isValid(); ++AI)
303 if (TRI->isSuperRegister(Reg, *AI) && State->IsLive(*AI)) {
308 if (!State->IsLive(Reg)) {
309 KillIndices[Reg] = KillIdx;
310 DefIndices[Reg] = ~0u;
311 RegRefs.erase(Reg);
312 State->LeaveGroup(Reg);
314 dbgs() << header << TRI->getName(Reg); header = nullptr; });
315 DEBUG(dbgs() << "->g" << State->GetGroup(Reg) << tag);
318 for (MCSubRegIterator SubRegs(Reg, TRI); SubRegs.isValid(); ++SubRegs) {
326 dbgs() << header << TRI->getName(Reg); header = nullptr; });
350 unsigned Reg = MO.getReg();
351 if (Reg == 0) continue;
353 HandleLastUse(Reg, Count + 1, "", "\tDead Def: ", "\n");
360 unsigned Reg = MO.getReg();
361 if (Reg == 0) continue;
363 DEBUG(dbgs() << " " << TRI->getName(Reg) << "=g" << State->GetGroup(Reg));
372 DEBUG(if (State->GetGroup(Reg) != 0) dbgs() << "->g0(alloc-req)");
373 State->UnionGroups(Reg, 0);
377 // partially defined here, so group those aliases with Reg.
378 for (MCRegAliasIterator AI(Reg, TRI, false); AI.isValid(); ++AI) {
381 State->UnionGroups(Reg, AliasReg);
382 DEBUG(dbgs() << "->g" << State->GetGroup(Reg) << "(via " <<
392 RegRefs.insert(std::make_pair(Reg, RR));
402 unsigned Reg = MO.getReg();
403 if (Reg == 0) continue;
405 if (MI->isKill() || (PassthruRegs.count(Reg) != 0))
408 // Update def for Reg and aliases.
409 for (MCRegAliasIterator AI(Reg, TRI, true); AI.isValid(); ++AI) {
416 if (TRI->isSuperRegister(Reg, *AI) && State->IsLive(*AI))
456 unsigned Reg = MO.getReg();
457 if (Reg == 0) continue;
459 DEBUG(dbgs() << " " << TRI->getName(Reg) << "=g" <<
460 State->GetGroup(Reg));
465 HandleLastUse(Reg, Count, "(last-use)");
468 DEBUG(if (State->GetGroup(Reg) != 0) dbgs() << "->g0(alloc-req)");
469 State->UnionGroups(Reg, 0);
477 RegRefs.insert(std::make_pair(Reg, RR));
491 unsigned Reg = MO.getReg();
492 if (Reg == 0) continue;
495 DEBUG(dbgs() << "=" << TRI->getName(Reg));
496 State->UnionGroups(FirstReg, Reg);
498 DEBUG(dbgs() << " " << TRI->getName(Reg));
499 FirstReg = Reg;
507 BitVector AggressiveAntiDepBreaker::GetRenameRegisters(unsigned Reg) {
511 // Check all references that need rewriting for Reg. For each, use
514 for (const auto &Q : make_range(State->GetRegRefs().equal_range(Reg))) {
558 unsigned Reg = Regs[i];
559 if ((SuperReg == 0) || TRI->isSuperRegister(SuperReg, Reg))
560 SuperReg = Reg;
562 // If Reg has any references, then collect possible rename regs
563 if (RegRefs.count(Reg) > 0) {
564 DEBUG(dbgs() << "\t\t" << TRI->getName(Reg) << ":");
566 BitVector BV = GetRenameRegisters(Reg);
567 RenameRegisterMap.insert(std::pair<unsigned, BitVector>(Reg, BV));
578 unsigned Reg = Regs[i];
579 if (Reg == SuperReg) continue;
580 bool IsSub = TRI->isSubRegister(SuperReg, Reg);
640 unsigned Reg = Regs[i];
642 if (Reg == SuperReg) {
645 unsigned NewSubRegIdx = TRI->getSubRegIndex(SuperReg, Reg);
652 // Check if Reg can be renamed to NewReg.
653 BitVector BV = RenameRegisterMap[Reg];
660 // Regs's kill, it's safe to replace Reg with NewReg. We
663 if (State->IsLive(NewReg) || (KillIndices[Reg] > DefIndices[NewReg])) {
671 (KillIndices[Reg] > DefIndices[AliasReg])) {
681 // We cannot rename 'Reg' to 'NewReg' if one of the uses of 'Reg' also
683 for (const auto &Q : make_range(RegRefs.equal_range(Reg))) {
695 // Also, we cannot rename 'Reg' to 'NewReg' if the instruction defining
696 // 'Reg' is an early-clobber define and that instruction also uses
698 for (const auto &Q : make_range(RegRefs.equal_range(Reg))) {
709 // Record that 'Reg' can be renamed to 'NewReg'.
710 RenameMap.insert(std::pair<unsigned, unsigned>(Reg, NewReg));
781 for (unsigned Reg = 0; Reg < TRI->getNumRegs(); ++Reg) {
782 if (!State->IsLive(Reg))
783 DEBUG(dbgs() << " " << TRI->getName(Reg));
837 DEBUG(dbgs() << "\tAntidep reg: " << TRI->getName(AntiDepReg));
