diff options
| author | Dimitry Andric <dim@FreeBSD.org> | 2020-01-17 20:45:01 +0000 |
|---|---|---|
| committer | Dimitry Andric <dim@FreeBSD.org> | 2020-01-17 20:45:01 +0000 |
| commit | 706b4fc47bbc608932d3b491ae19a3b9cde9497b (patch) | |
| tree | 4adf86a776049cbf7f69a1929c4babcbbef925eb /llvm/lib/CodeGen/MIRVRegNamerUtils.cpp | |
| parent | 7cc9cf2bf09f069cb2dd947ead05d0b54301fb71 (diff) | |
Notes
Diffstat (limited to 'llvm/lib/CodeGen/MIRVRegNamerUtils.cpp')
| -rw-r--r-- | llvm/lib/CodeGen/MIRVRegNamerUtils.cpp | 424 |
1 files changed, 116 insertions, 308 deletions
diff --git a/llvm/lib/CodeGen/MIRVRegNamerUtils.cpp b/llvm/lib/CodeGen/MIRVRegNamerUtils.cpp index 6629000f468f5..fcc40b26c527c 100644 --- a/llvm/lib/CodeGen/MIRVRegNamerUtils.cpp +++ b/llvm/lib/CodeGen/MIRVRegNamerUtils.cpp @@ -13,336 +13,144 @@ using namespace llvm; #define DEBUG_TYPE "mir-vregnamer-utils" -namespace { +using VRegRenameMap = std::map<unsigned, unsigned>; -// TypedVReg and VRType are used to tell the renamer what to do at points in a -// sequence of values to be renamed. A TypedVReg can either contain -// an actual VReg, a FrameIndex, or it could just be a barrier for the next -// candidate (side-effecting instruction). This tells the renamer to increment -// to the next vreg name, or to skip modulo some skip-gap value. -enum VRType { RSE_Reg = 0, RSE_FrameIndex, RSE_NewCandidate }; -class TypedVReg { - VRType Type; - Register Reg; - -public: - TypedVReg(Register Reg) : Type(RSE_Reg), Reg(Reg) {} - TypedVReg(VRType Type) : Type(Type), Reg(~0U) { - assert(Type != RSE_Reg && "Expected a non-Register Type."); - } - - bool isReg() const { return Type == RSE_Reg; } - bool isFrameIndex() const { return Type == RSE_FrameIndex; } - bool isCandidate() const { return Type == RSE_NewCandidate; } - - VRType getType() const { return Type; } - Register getReg() const { - assert(this->isReg() && "Expected a virtual or physical Register."); - return Reg; - } -}; - -/// Here we find our candidates. What makes an interesting candidate? -/// A candidate for a canonicalization tree root is normally any kind of -/// instruction that causes side effects such as a store to memory or a copy to -/// a physical register or a return instruction. We use these as an expression -/// tree root that we walk in order to build a canonical walk which should -/// result in canonical vreg renaming. -std::vector<MachineInstr *> populateCandidates(MachineBasicBlock *MBB) { - std::vector<MachineInstr *> Candidates; - MachineRegisterInfo &MRI = MBB->getParent()->getRegInfo(); - - for (auto II = MBB->begin(), IE = MBB->end(); II != IE; ++II) { - MachineInstr *MI = &*II; - - bool DoesMISideEffect = false; - - if (MI->getNumOperands() > 0 && MI->getOperand(0).isReg()) { - const Register Dst = MI->getOperand(0).getReg(); - DoesMISideEffect |= !Register::isVirtualRegister(Dst); - - for (auto UI = MRI.use_begin(Dst); UI != MRI.use_end(); ++UI) { - if (DoesMISideEffect) - break; - DoesMISideEffect |= (UI->getParent()->getParent() != MI->getParent()); - } - } - - if (!MI->mayStore() && !MI->isBranch() && !DoesMISideEffect) - continue; +bool VRegRenamer::doVRegRenaming(const VRegRenameMap &VRM) { + bool Changed = false; - LLVM_DEBUG(dbgs() << "Found Candidate: "; MI->dump();); - Candidates.push_back(MI); + for (const auto &E : VRM) { + Changed = Changed || !MRI.reg_empty(E.first); + MRI.replaceRegWith(E.first, E.second); } - return Candidates; -} - -void doCandidateWalk(std::vector<TypedVReg> &VRegs, - std::queue<TypedVReg> &RegQueue, - std::vector<MachineInstr *> &VisitedMIs, - const MachineBasicBlock *MBB) { - - const MachineFunction &MF = *MBB->getParent(); - const MachineRegisterInfo &MRI = MF.getRegInfo(); - - while (!RegQueue.empty()) { - - auto TReg = RegQueue.front(); - RegQueue.pop(); - - if (TReg.isFrameIndex()) { - LLVM_DEBUG(dbgs() << "Popping frame index.\n";); - VRegs.push_back(TypedVReg(RSE_FrameIndex)); - continue; - } - - assert(TReg.isReg() && "Expected vreg or physreg."); - Register Reg = TReg.getReg(); - - if (Register::isVirtualRegister(Reg)) { - LLVM_DEBUG({ - dbgs() << "Popping vreg "; - MRI.def_begin(Reg)->dump(); - dbgs() << "\n"; - }); - - if (!llvm::any_of(VRegs, [&](const TypedVReg &TR) { - return TR.isReg() && TR.getReg() == Reg; - })) { - VRegs.push_back(TypedVReg(Reg)); - } - } else { - LLVM_DEBUG(dbgs() << "Popping physreg.\n";); - VRegs.push_back(TypedVReg(Reg)); - continue; - } - - for (auto RI = MRI.def_begin(Reg), RE = MRI.def_end(); RI != RE; ++RI) { - MachineInstr *Def = RI->getParent(); - - if (Def->getParent() != MBB) - continue; - - if (llvm::any_of(VisitedMIs, - [&](const MachineInstr *VMI) { return Def == VMI; })) { - break; - } - - LLVM_DEBUG({ - dbgs() << "\n========================\n"; - dbgs() << "Visited MI: "; - Def->dump(); - dbgs() << "BB Name: " << Def->getParent()->getName() << "\n"; - dbgs() << "\n========================\n"; - }); - VisitedMIs.push_back(Def); - for (unsigned I = 1, E = Def->getNumOperands(); I != E; ++I) { - - MachineOperand &MO = Def->getOperand(I); - if (MO.isFI()) { - LLVM_DEBUG(dbgs() << "Pushing frame index.\n";); - RegQueue.push(TypedVReg(RSE_FrameIndex)); - } - - if (!MO.isReg()) - continue; - RegQueue.push(TypedVReg(MO.getReg())); - } - } - } + return Changed; } -std::map<unsigned, unsigned> -getVRegRenameMap(const std::vector<TypedVReg> &VRegs, - const std::vector<Register> &renamedInOtherBB, - MachineRegisterInfo &MRI, NamedVRegCursor &NVC) { - std::map<unsigned, unsigned> VRegRenameMap; - bool FirstCandidate = true; - - for (auto &vreg : VRegs) { - if (vreg.isFrameIndex()) { - // We skip one vreg for any frame index because there is a good chance - // (especially when comparing SelectionDAG to GlobalISel generated MIR) - // that in the other file we are just getting an incoming vreg that comes - // from a copy from a frame index. So it's safe to skip by one. - unsigned LastRenameReg = NVC.incrementVirtualVReg(); - (void)LastRenameReg; - LLVM_DEBUG(dbgs() << "Skipping rename for FI " << LastRenameReg << "\n";); - continue; - } else if (vreg.isCandidate()) { - - // After the first candidate, for every subsequent candidate, we skip mod - // 10 registers so that the candidates are more likely to start at the - // same vreg number making it more likely that the canonical walk from the - // candidate insruction. We don't need to skip from the first candidate of - // the BasicBlock because we already skip ahead several vregs for each BB. - unsigned LastRenameReg = NVC.getVirtualVReg(); - if (FirstCandidate) - NVC.incrementVirtualVReg(LastRenameReg % 10); - FirstCandidate = false; - continue; - } else if (!Register::isVirtualRegister(vreg.getReg())) { - unsigned LastRenameReg = NVC.incrementVirtualVReg(); - (void)LastRenameReg; - LLVM_DEBUG({ - dbgs() << "Skipping rename for Phys Reg " << LastRenameReg << "\n"; - }); - continue; - } - - auto Reg = vreg.getReg(); - if (llvm::find(renamedInOtherBB, Reg) != renamedInOtherBB.end()) { - LLVM_DEBUG(dbgs() << "Vreg " << Reg - << " already renamed in other BB.\n";); - continue; - } +VRegRenameMap +VRegRenamer::getVRegRenameMap(const std::vector<NamedVReg> &VRegs) { - auto Rename = NVC.createVirtualRegister(Reg); + StringMap<unsigned> VRegNameCollisionMap; - if (VRegRenameMap.find(Reg) == VRegRenameMap.end()) { - LLVM_DEBUG(dbgs() << "Mapping vreg ";); - if (MRI.reg_begin(Reg) != MRI.reg_end()) { - LLVM_DEBUG(auto foo = &*MRI.reg_begin(Reg); foo->dump();); - } else { - LLVM_DEBUG(dbgs() << Reg;); - } - LLVM_DEBUG(dbgs() << " to ";); - if (MRI.reg_begin(Rename) != MRI.reg_end()) { - LLVM_DEBUG(auto foo = &*MRI.reg_begin(Rename); foo->dump();); - } else { - LLVM_DEBUG(dbgs() << Rename;); - } - LLVM_DEBUG(dbgs() << "\n";); + auto GetUniqueVRegName = [&VRegNameCollisionMap](const NamedVReg &Reg) { + if (VRegNameCollisionMap.find(Reg.getName()) == VRegNameCollisionMap.end()) + VRegNameCollisionMap[Reg.getName()] = 0; + const unsigned Counter = ++VRegNameCollisionMap[Reg.getName()]; + return Reg.getName() + "__" + std::to_string(Counter); + }; - VRegRenameMap.insert(std::pair<unsigned, unsigned>(Reg, Rename)); - } + VRegRenameMap VRM; + for (const auto &VReg : VRegs) { + const unsigned Reg = VReg.getReg(); + VRM[Reg] = createVirtualRegisterWithLowerName(Reg, GetUniqueVRegName(VReg)); } - - return VRegRenameMap; + return VRM; } -bool doVRegRenaming(std::vector<Register> &renamedInOtherBB, - const std::map<unsigned, unsigned> &VRegRenameMap, - MachineRegisterInfo &MRI) { - bool Changed = false; - for (auto I = VRegRenameMap.begin(), E = VRegRenameMap.end(); I != E; ++I) { - - auto VReg = I->first; - auto Rename = I->second; - - renamedInOtherBB.push_back(Rename); - - std::vector<MachineOperand *> RenameMOs; - for (auto &MO : MRI.reg_operands(VReg)) { - RenameMOs.push_back(&MO); - } - - for (auto *MO : RenameMOs) { - Changed = true; - MO->setReg(Rename); +std::string VRegRenamer::getInstructionOpcodeHash(MachineInstr &MI) { + std::string S; + raw_string_ostream OS(S); - if (!MO->isDef()) - MO->setIsKill(false); + // Gets a hashable artifact from a given MachineOperand (ie an unsigned). + auto GetHashableMO = [this](const MachineOperand &MO) -> unsigned { + switch (MO.getType()) { + case MachineOperand::MO_CImmediate: + return hash_combine(MO.getType(), MO.getTargetFlags(), + MO.getCImm()->getZExtValue()); + case MachineOperand::MO_FPImmediate: + return hash_combine( + MO.getType(), MO.getTargetFlags(), + MO.getFPImm()->getValueAPF().bitcastToAPInt().getZExtValue()); + case MachineOperand::MO_Register: + if (Register::isVirtualRegister(MO.getReg())) + return MRI.getVRegDef(MO.getReg())->getOpcode(); + return MO.getReg(); + case MachineOperand::MO_Immediate: + return MO.getImm(); + case MachineOperand::MO_TargetIndex: + return MO.getOffset() | (MO.getTargetFlags() << 16); + case MachineOperand::MO_FrameIndex: + return llvm::hash_value(MO); + + // We could explicitly handle all the types of the MachineOperand, + // here but we can just return a common number until we find a + // compelling test case where this is bad. The only side effect here + // is contributing to a hash collision but there's enough information + // (Opcodes,other registers etc) that this will likely not be a problem. + + // TODO: Handle the following Index/ID/Predicate cases. They can + // be hashed on in a stable manner. + case MachineOperand::MO_ConstantPoolIndex: + case MachineOperand::MO_JumpTableIndex: + case MachineOperand::MO_CFIIndex: + case MachineOperand::MO_IntrinsicID: + case MachineOperand::MO_Predicate: + + // In the cases below we havn't found a way to produce an artifact that will + // result in a stable hash, in most cases because they are pointers. We want + // stable hashes because we want the hash to be the same run to run. + case MachineOperand::MO_MachineBasicBlock: + case MachineOperand::MO_ExternalSymbol: + case MachineOperand::MO_GlobalAddress: + case MachineOperand::MO_BlockAddress: + case MachineOperand::MO_RegisterMask: + case MachineOperand::MO_RegisterLiveOut: + case MachineOperand::MO_Metadata: + case MachineOperand::MO_MCSymbol: + case MachineOperand::MO_ShuffleMask: + return 0; } + llvm_unreachable("Unexpected MachineOperandType."); + }; + + SmallVector<unsigned, 16> MIOperands = {MI.getOpcode(), MI.getFlags()}; + llvm::transform(MI.uses(), std::back_inserter(MIOperands), GetHashableMO); + + for (const auto *Op : MI.memoperands()) { + MIOperands.push_back((unsigned)Op->getSize()); + MIOperands.push_back((unsigned)Op->getFlags()); + MIOperands.push_back((unsigned)Op->getOffset()); + MIOperands.push_back((unsigned)Op->getOrdering()); + MIOperands.push_back((unsigned)Op->getAddrSpace()); + MIOperands.push_back((unsigned)Op->getSyncScopeID()); + MIOperands.push_back((unsigned)Op->getBaseAlignment()); + MIOperands.push_back((unsigned)Op->getFailureOrdering()); } - return Changed; + auto HashMI = hash_combine_range(MIOperands.begin(), MIOperands.end()); + return std::to_string(HashMI).substr(0, 5); } -bool renameVRegs(MachineBasicBlock *MBB, - std::vector<Register> &renamedInOtherBB, - NamedVRegCursor &NVC) { - bool Changed = false; - MachineFunction &MF = *MBB->getParent(); - MachineRegisterInfo &MRI = MF.getRegInfo(); - - std::vector<MachineInstr *> Candidates = populateCandidates(MBB); - std::vector<MachineInstr *> VisitedMIs; - llvm::copy(Candidates, std::back_inserter(VisitedMIs)); - - std::vector<TypedVReg> VRegs; - for (auto candidate : Candidates) { - VRegs.push_back(TypedVReg(RSE_NewCandidate)); - - std::queue<TypedVReg> RegQueue; - - // Here we walk the vreg operands of a non-root node along our walk. - // The root nodes are the original candidates (stores normally). - // These are normally not the root nodes (except for the case of copies to - // physical registers). - for (unsigned i = 1; i < candidate->getNumOperands(); i++) { - if (candidate->mayStore() || candidate->isBranch()) - break; - - MachineOperand &MO = candidate->getOperand(i); - if (!(MO.isReg() && Register::isVirtualRegister(MO.getReg()))) - continue; - - LLVM_DEBUG(dbgs() << "Enqueue register"; MO.dump(); dbgs() << "\n";); - RegQueue.push(TypedVReg(MO.getReg())); - } - - // Here we walk the root candidates. We start from the 0th operand because - // the root is normally a store to a vreg. - for (unsigned i = 0; i < candidate->getNumOperands(); i++) { - - if (!candidate->mayStore() && !candidate->isBranch()) - break; - - MachineOperand &MO = candidate->getOperand(i); - - // TODO: Do we want to only add vregs here? - if (!MO.isReg() && !MO.isFI()) - continue; - - LLVM_DEBUG(dbgs() << "Enqueue Reg/FI"; MO.dump(); dbgs() << "\n";); - - RegQueue.push(MO.isReg() ? TypedVReg(MO.getReg()) - : TypedVReg(RSE_FrameIndex)); - } - - doCandidateWalk(VRegs, RegQueue, VisitedMIs, MBB); - } - - // If we have populated no vregs to rename then bail. - // The rest of this function does the vreg remaping. - if (VRegs.size() == 0) - return Changed; - - auto VRegRenameMap = getVRegRenameMap(VRegs, renamedInOtherBB, MRI, NVC); - Changed |= doVRegRenaming(renamedInOtherBB, VRegRenameMap, MRI); - return Changed; +unsigned VRegRenamer::createVirtualRegister(unsigned VReg) { + assert(Register::isVirtualRegister(VReg) && "Expected Virtual Registers"); + std::string Name = getInstructionOpcodeHash(*MRI.getVRegDef(VReg)); + return createVirtualRegisterWithLowerName(VReg, Name); } -} // anonymous namespace -void NamedVRegCursor::skipVRegs() { - unsigned VRegGapIndex = 1; - if (!virtualVRegNumber) { - VRegGapIndex = 0; - virtualVRegNumber = MRI.createIncompleteVirtualRegister(); +bool VRegRenamer::renameInstsInMBB(MachineBasicBlock *MBB) { + std::vector<NamedVReg> VRegs; + std::string Prefix = "bb" + std::to_string(CurrentBBNumber) + "_"; + for (MachineInstr &Candidate : *MBB) { + // Don't rename stores/branches. + if (Candidate.mayStore() || Candidate.isBranch()) + continue; + if (!Candidate.getNumOperands()) + continue; + // Look for instructions that define VRegs in operand 0. + MachineOperand &MO = Candidate.getOperand(0); + // Avoid non regs, instructions defining physical regs. + if (!MO.isReg() || !Register::isVirtualRegister(MO.getReg())) + continue; + VRegs.push_back( + NamedVReg(MO.getReg(), Prefix + getInstructionOpcodeHash(Candidate))); } - const unsigned VR_GAP = (++VRegGapIndex * SkipGapSize); - unsigned I = virtualVRegNumber; - const unsigned E = (((I + VR_GAP) / VR_GAP) + 1) * VR_GAP; - - virtualVRegNumber = E; -} - -unsigned NamedVRegCursor::createVirtualRegister(unsigned VReg) { - if (!virtualVRegNumber) - skipVRegs(); - std::string S; - raw_string_ostream OS(S); - OS << "namedVReg" << (virtualVRegNumber & ~0x80000000); - OS.flush(); - virtualVRegNumber++; - if (auto RC = MRI.getRegClassOrNull(VReg)) - return MRI.createVirtualRegister(RC, OS.str()); - return MRI.createGenericVirtualRegister(MRI.getType(VReg), OS.str()); + return VRegs.size() ? doVRegRenaming(getVRegRenameMap(VRegs)) : false; } -bool NamedVRegCursor::renameVRegs(MachineBasicBlock *MBB) { - return ::renameVRegs(MBB, RenamedInOtherBB, *this); +unsigned VRegRenamer::createVirtualRegisterWithLowerName(unsigned VReg, + StringRef Name) { + std::string LowerName = Name.lower(); + const TargetRegisterClass *RC = MRI.getRegClassOrNull(VReg); + return RC ? MRI.createVirtualRegister(RC, LowerName) + : MRI.createGenericVirtualRegister(MRI.getType(VReg), LowerName); } |
