2017-09-13 23:15:20 +02:00
|
|
|
//===- llvm/CodeGen/VirtRegMap.cpp - Virtual Register Map -----------------===//
|
2004-02-24 00:08:11 +01:00
|
|
|
//
|
2019-01-19 09:50:56 +01:00
|
|
|
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
|
|
|
|
// See https://llvm.org/LICENSE.txt for license information.
|
|
|
|
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
|
2004-02-24 00:08:11 +01:00
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
2004-09-30 03:54:45 +02:00
|
|
|
// This file implements the VirtRegMap class.
|
|
|
|
//
|
2010-02-10 17:03:48 +01:00
|
|
|
// It also contains implementations of the Spiller interface, which, given a
|
2004-09-30 03:54:45 +02:00
|
|
|
// virtual register map and a machine function, eliminates all virtual
|
|
|
|
// references by replacing them with physical register references - adding spill
|
2004-02-24 09:58:30 +01:00
|
|
|
// code as necessary.
|
2004-02-24 00:08:11 +01:00
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2012-11-28 20:13:06 +01:00
|
|
|
#include "llvm/CodeGen/VirtRegMap.h"
|
2012-06-09 01:44:45 +02:00
|
|
|
#include "LiveDebugVariables.h"
|
2017-09-13 23:15:20 +02:00
|
|
|
#include "llvm/ADT/SmallVector.h"
|
2014-03-04 11:07:28 +01:00
|
|
|
#include "llvm/ADT/Statistic.h"
|
2017-09-13 23:15:20 +02:00
|
|
|
#include "llvm/CodeGen/LiveInterval.h"
|
2017-12-13 03:51:04 +01:00
|
|
|
#include "llvm/CodeGen/LiveIntervals.h"
|
2017-12-19 00:19:44 +01:00
|
|
|
#include "llvm/CodeGen/LiveStacks.h"
|
2017-09-13 23:15:20 +02:00
|
|
|
#include "llvm/CodeGen/MachineBasicBlock.h"
|
2004-02-24 00:08:11 +01:00
|
|
|
#include "llvm/CodeGen/MachineFrameInfo.h"
|
2004-09-30 03:54:45 +02:00
|
|
|
#include "llvm/CodeGen/MachineFunction.h"
|
2017-09-13 23:15:20 +02:00
|
|
|
#include "llvm/CodeGen/MachineFunctionPass.h"
|
|
|
|
#include "llvm/CodeGen/MachineInstr.h"
|
|
|
|
#include "llvm/CodeGen/MachineOperand.h"
|
2007-12-31 05:13:23 +01:00
|
|
|
#include "llvm/CodeGen/MachineRegisterInfo.h"
|
2017-09-13 23:15:20 +02:00
|
|
|
#include "llvm/CodeGen/SlotIndexes.h"
|
2017-11-08 02:01:31 +01:00
|
|
|
#include "llvm/CodeGen/TargetInstrInfo.h"
|
2017-11-17 02:07:10 +01:00
|
|
|
#include "llvm/CodeGen/TargetOpcodes.h"
|
|
|
|
#include "llvm/CodeGen/TargetRegisterInfo.h"
|
|
|
|
#include "llvm/CodeGen/TargetSubtargetInfo.h"
|
2018-04-30 16:59:11 +02:00
|
|
|
#include "llvm/Config/llvm-config.h"
|
2017-09-13 23:15:20 +02:00
|
|
|
#include "llvm/MC/LaneBitmask.h"
|
|
|
|
#include "llvm/Pass.h"
|
2006-08-27 14:54:02 +02:00
|
|
|
#include "llvm/Support/Compiler.h"
|
2009-02-11 09:24:21 +01:00
|
|
|
#include "llvm/Support/Debug.h"
|
2009-07-24 12:36:58 +02:00
|
|
|
#include "llvm/Support/raw_ostream.h"
|
2017-09-13 23:15:20 +02:00
|
|
|
#include <cassert>
|
|
|
|
#include <iterator>
|
|
|
|
#include <utility>
|
|
|
|
|
2004-02-24 00:08:11 +01:00
|
|
|
using namespace llvm;
|
|
|
|
|
2014-04-22 04:02:50 +02:00
|
|
|
#define DEBUG_TYPE "regalloc"
|
|
|
|
|
2011-09-15 20:31:13 +02:00
|
|
|
STATISTIC(NumSpillSlots, "Number of spill slots allocated");
|
|
|
|
STATISTIC(NumIdCopies, "Number of identity moves eliminated after rewriting");
|
2008-05-13 02:00:25 +02:00
|
|
|
|
2004-09-30 03:54:45 +02:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// VirtRegMap implementation
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2009-03-13 06:55:11 +01:00
|
|
|
char VirtRegMap::ID = 0;
|
|
|
|
|
2010-10-08 00:25:06 +02:00
|
|
|
INITIALIZE_PASS(VirtRegMap, "virtregmap", "Virtual Register Map", false, false)
|
2009-03-13 06:55:11 +01:00
|
|
|
|
|
|
|
bool VirtRegMap::runOnMachineFunction(MachineFunction &mf) {
|
2009-06-14 22:22:55 +02:00
|
|
|
MRI = &mf.getRegInfo();
|
2014-08-05 04:39:49 +02:00
|
|
|
TII = mf.getSubtarget().getInstrInfo();
|
|
|
|
TRI = mf.getSubtarget().getRegisterInfo();
|
2009-03-13 06:55:11 +01:00
|
|
|
MF = &mf;
|
2009-11-04 00:52:08 +01:00
|
|
|
|
2009-03-13 06:55:11 +01:00
|
|
|
Virt2PhysMap.clear();
|
|
|
|
Virt2StackSlotMap.clear();
|
|
|
|
Virt2SplitMap.clear();
|
2009-05-04 05:30:11 +02:00
|
|
|
|
2006-09-05 04:12:02 +02:00
|
|
|
grow();
|
2009-03-13 06:55:11 +01:00
|
|
|
return false;
|
2006-09-05 04:12:02 +02:00
|
|
|
}
|
|
|
|
|
2004-09-30 03:54:45 +02:00
|
|
|
void VirtRegMap::grow() {
|
2011-01-09 22:58:20 +01:00
|
|
|
unsigned NumRegs = MF->getRegInfo().getNumVirtRegs();
|
|
|
|
Virt2PhysMap.resize(NumRegs);
|
|
|
|
Virt2StackSlotMap.resize(NumRegs);
|
|
|
|
Virt2SplitMap.resize(NumRegs);
|
2004-02-24 00:08:11 +01:00
|
|
|
}
|
|
|
|
|
2019-08-13 02:55:24 +02:00
|
|
|
void VirtRegMap::assignVirt2Phys(Register virtReg, MCPhysReg physReg) {
|
|
|
|
assert(virtReg.isVirtual() && Register::isPhysicalRegister(physReg));
|
|
|
|
assert(Virt2PhysMap[virtReg.id()] == NO_PHYS_REG &&
|
2017-06-08 23:30:54 +02:00
|
|
|
"attempt to assign physical register to already mapped "
|
|
|
|
"virtual register");
|
|
|
|
assert(!getRegInfo().isReserved(physReg) &&
|
|
|
|
"Attempt to map virtReg to a reserved physReg");
|
2019-08-13 02:55:24 +02:00
|
|
|
Virt2PhysMap[virtReg.id()] = physReg;
|
2017-06-08 23:30:54 +02:00
|
|
|
}
|
|
|
|
|
2010-11-16 01:41:01 +01:00
|
|
|
unsigned VirtRegMap::createSpillSlot(const TargetRegisterClass *RC) {
|
2017-04-24 20:55:33 +02:00
|
|
|
unsigned Size = TRI->getSpillSize(*RC);
|
[Alignment][NFC] Use more Align versions of various functions
Summary:
This is patch is part of a series to introduce an Alignment type.
See this thread for context: http://lists.llvm.org/pipermail/llvm-dev/2019-July/133851.html
See this patch for the introduction of the type: https://reviews.llvm.org/D64790
Reviewers: courbet
Subscribers: MatzeB, qcolombet, arsenm, sdardis, jvesely, nhaehnle, hiraditya, jrtc27, atanasyan, kerbowa, llvm-commits
Tags: #llvm
Differential Revision: https://reviews.llvm.org/D77291
2020-04-02 10:53:29 +02:00
|
|
|
Align Alignment = TRI->getSpillAlign(*RC);
|
|
|
|
int SS = MF->getFrameInfo().CreateSpillStackObject(Size, Alignment);
|
2011-09-15 20:31:13 +02:00
|
|
|
++NumSpillSlots;
|
2010-11-16 01:41:01 +01:00
|
|
|
return SS;
|
|
|
|
}
|
|
|
|
|
2019-08-13 02:55:24 +02:00
|
|
|
bool VirtRegMap::hasPreferredPhys(Register VirtReg) {
|
|
|
|
Register Hint = MRI->getSimpleHint(VirtReg);
|
|
|
|
if (!Hint.isValid())
|
2016-06-02 20:37:21 +02:00
|
|
|
return false;
|
2019-08-13 02:55:24 +02:00
|
|
|
if (Hint.isVirtual())
|
2012-12-04 01:30:22 +01:00
|
|
|
Hint = getPhys(Hint);
|
|
|
|
return getPhys(VirtReg) == Hint;
|
|
|
|
}
|
|
|
|
|
2019-08-13 02:55:24 +02:00
|
|
|
bool VirtRegMap::hasKnownPreference(Register VirtReg) {
|
2012-12-04 00:23:50 +01:00
|
|
|
std::pair<unsigned, unsigned> Hint = MRI->getRegAllocationHint(VirtReg);
|
2019-08-02 01:27:28 +02:00
|
|
|
if (Register::isPhysicalRegister(Hint.second))
|
2012-12-04 00:23:50 +01:00
|
|
|
return true;
|
2019-08-02 01:27:28 +02:00
|
|
|
if (Register::isVirtualRegister(Hint.second))
|
2012-12-04 00:23:50 +01:00
|
|
|
return hasPhys(Hint.second);
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2019-08-13 02:55:24 +02:00
|
|
|
int VirtRegMap::assignVirt2StackSlot(Register virtReg) {
|
|
|
|
assert(virtReg.isVirtual());
|
|
|
|
assert(Virt2StackSlotMap[virtReg.id()] == NO_STACK_SLOT &&
|
2004-09-30 03:54:45 +02:00
|
|
|
"attempt to assign stack slot to already spilled register");
|
2009-03-13 06:55:11 +01:00
|
|
|
const TargetRegisterClass* RC = MF->getRegInfo().getRegClass(virtReg);
|
2019-08-13 02:55:24 +02:00
|
|
|
return Virt2StackSlotMap[virtReg.id()] = createSpillSlot(RC);
|
2004-02-24 00:08:11 +01:00
|
|
|
}
|
|
|
|
|
2019-08-13 02:55:24 +02:00
|
|
|
void VirtRegMap::assignVirt2StackSlot(Register virtReg, int SS) {
|
|
|
|
assert(virtReg.isVirtual());
|
|
|
|
assert(Virt2StackSlotMap[virtReg.id()] == NO_STACK_SLOT &&
|
2004-09-30 03:54:45 +02:00
|
|
|
"attempt to assign stack slot to already spilled register");
|
2008-02-27 04:04:06 +01:00
|
|
|
assert((SS >= 0 ||
|
2016-07-28 20:40:00 +02:00
|
|
|
(SS >= MF->getFrameInfo().getObjectIndexBegin())) &&
|
2007-04-04 09:40:01 +02:00
|
|
|
"illegal fixed frame index");
|
2019-08-13 02:55:24 +02:00
|
|
|
Virt2StackSlotMap[virtReg.id()] = SS;
|
2004-05-29 22:38:05 +02:00
|
|
|
}
|
|
|
|
|
2012-06-09 01:44:45 +02:00
|
|
|
void VirtRegMap::print(raw_ostream &OS, const Module*) const {
|
|
|
|
OS << "********** REGISTER MAP **********\n";
|
|
|
|
for (unsigned i = 0, e = MRI->getNumVirtRegs(); i != e; ++i) {
|
2019-08-02 01:27:28 +02:00
|
|
|
unsigned Reg = Register::index2VirtReg(i);
|
2012-06-09 01:44:45 +02:00
|
|
|
if (Virt2PhysMap[Reg] != (unsigned)VirtRegMap::NO_PHYS_REG) {
|
2017-11-28 13:42:37 +01:00
|
|
|
OS << '[' << printReg(Reg, TRI) << " -> "
|
|
|
|
<< printReg(Virt2PhysMap[Reg], TRI) << "] "
|
2014-11-17 06:50:14 +01:00
|
|
|
<< TRI->getRegClassName(MRI->getRegClass(Reg)) << "\n";
|
2012-06-09 01:44:45 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
for (unsigned i = 0, e = MRI->getNumVirtRegs(); i != e; ++i) {
|
2019-08-02 01:27:28 +02:00
|
|
|
unsigned Reg = Register::index2VirtReg(i);
|
2012-06-09 01:44:45 +02:00
|
|
|
if (Virt2StackSlotMap[Reg] != VirtRegMap::NO_STACK_SLOT) {
|
2017-11-28 13:42:37 +01:00
|
|
|
OS << '[' << printReg(Reg, TRI) << " -> fi#" << Virt2StackSlotMap[Reg]
|
2014-11-17 06:50:14 +01:00
|
|
|
<< "] " << TRI->getRegClassName(MRI->getRegClass(Reg)) << "\n";
|
2012-06-09 01:44:45 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
OS << '\n';
|
|
|
|
}
|
|
|
|
|
2017-10-15 16:32:27 +02:00
|
|
|
#if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
|
2016-01-29 21:50:44 +01:00
|
|
|
LLVM_DUMP_METHOD void VirtRegMap::dump() const {
|
2012-06-09 01:44:45 +02:00
|
|
|
print(dbgs());
|
|
|
|
}
|
2012-09-06 21:06:06 +02:00
|
|
|
#endif
|
2012-06-09 01:44:45 +02:00
|
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// VirtRegRewriter
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
|
|
|
// The VirtRegRewriter is the last of the register allocator passes.
|
|
|
|
// It rewrites virtual registers to physical registers as specified in the
|
|
|
|
// VirtRegMap analysis. It also updates live-in information on basic blocks
|
|
|
|
// according to LiveIntervals.
|
|
|
|
//
|
|
|
|
namespace {
|
2017-09-13 23:15:20 +02:00
|
|
|
|
2012-06-09 01:44:45 +02:00
|
|
|
class VirtRegRewriter : public MachineFunctionPass {
|
|
|
|
MachineFunction *MF;
|
|
|
|
const TargetRegisterInfo *TRI;
|
|
|
|
const TargetInstrInfo *TII;
|
|
|
|
MachineRegisterInfo *MRI;
|
|
|
|
SlotIndexes *Indexes;
|
|
|
|
LiveIntervals *LIS;
|
|
|
|
VirtRegMap *VRM;
|
|
|
|
|
|
|
|
void rewrite();
|
|
|
|
void addMBBLiveIns();
|
2015-06-16 20:22:28 +02:00
|
|
|
bool readsUndefSubreg(const MachineOperand &MO) const;
|
2019-08-13 02:55:24 +02:00
|
|
|
void addLiveInsForSubRanges(const LiveInterval &LI, Register PhysReg) const;
|
2016-07-09 02:19:07 +02:00
|
|
|
void handleIdentityCopy(MachineInstr &MI) const;
|
2017-03-17 01:41:39 +01:00
|
|
|
void expandCopyBundle(MachineInstr &MI) const;
|
2019-08-13 02:55:24 +02:00
|
|
|
bool subRegLiveThrough(const MachineInstr &MI, Register SuperPhysReg) const;
|
2015-09-09 20:07:54 +02:00
|
|
|
|
2012-06-09 01:44:45 +02:00
|
|
|
public:
|
|
|
|
static char ID;
|
2017-09-13 23:15:20 +02:00
|
|
|
|
2012-06-09 01:44:45 +02:00
|
|
|
VirtRegRewriter() : MachineFunctionPass(ID) {}
|
|
|
|
|
2014-03-07 10:26:03 +01:00
|
|
|
void getAnalysisUsage(AnalysisUsage &AU) const override;
|
2012-06-09 01:44:45 +02:00
|
|
|
|
2014-03-07 10:26:03 +01:00
|
|
|
bool runOnMachineFunction(MachineFunction&) override;
|
2017-09-13 23:15:20 +02:00
|
|
|
|
2016-03-29 19:40:22 +02:00
|
|
|
MachineFunctionProperties getSetProperties() const override {
|
|
|
|
return MachineFunctionProperties().set(
|
2016-08-25 03:27:13 +02:00
|
|
|
MachineFunctionProperties::Property::NoVRegs);
|
2016-03-29 19:40:22 +02:00
|
|
|
}
|
2012-06-09 01:44:45 +02:00
|
|
|
};
|
2017-09-13 23:15:20 +02:00
|
|
|
|
2012-06-09 01:44:45 +02:00
|
|
|
} // end anonymous namespace
|
|
|
|
|
2017-09-13 23:15:20 +02:00
|
|
|
char VirtRegRewriter::ID = 0;
|
|
|
|
|
2012-06-09 01:44:45 +02:00
|
|
|
char &llvm::VirtRegRewriterID = VirtRegRewriter::ID;
|
|
|
|
|
|
|
|
INITIALIZE_PASS_BEGIN(VirtRegRewriter, "virtregrewriter",
|
|
|
|
"Virtual Register Rewriter", false, false)
|
|
|
|
INITIALIZE_PASS_DEPENDENCY(SlotIndexes)
|
|
|
|
INITIALIZE_PASS_DEPENDENCY(LiveIntervals)
|
|
|
|
INITIALIZE_PASS_DEPENDENCY(LiveDebugVariables)
|
2012-09-21 22:04:28 +02:00
|
|
|
INITIALIZE_PASS_DEPENDENCY(LiveStacks)
|
2012-06-09 01:44:45 +02:00
|
|
|
INITIALIZE_PASS_DEPENDENCY(VirtRegMap)
|
|
|
|
INITIALIZE_PASS_END(VirtRegRewriter, "virtregrewriter",
|
|
|
|
"Virtual Register Rewriter", false, false)
|
|
|
|
|
|
|
|
void VirtRegRewriter::getAnalysisUsage(AnalysisUsage &AU) const {
|
|
|
|
AU.setPreservesCFG();
|
|
|
|
AU.addRequired<LiveIntervals>();
|
|
|
|
AU.addRequired<SlotIndexes>();
|
|
|
|
AU.addPreserved<SlotIndexes>();
|
|
|
|
AU.addRequired<LiveDebugVariables>();
|
2012-09-21 22:04:28 +02:00
|
|
|
AU.addRequired<LiveStacks>();
|
|
|
|
AU.addPreserved<LiveStacks>();
|
2012-06-09 01:44:45 +02:00
|
|
|
AU.addRequired<VirtRegMap>();
|
|
|
|
MachineFunctionPass::getAnalysisUsage(AU);
|
|
|
|
}
|
|
|
|
|
|
|
|
bool VirtRegRewriter::runOnMachineFunction(MachineFunction &fn) {
|
|
|
|
MF = &fn;
|
2014-10-13 23:57:44 +02:00
|
|
|
TRI = MF->getSubtarget().getRegisterInfo();
|
|
|
|
TII = MF->getSubtarget().getInstrInfo();
|
2012-06-09 01:44:45 +02:00
|
|
|
MRI = &MF->getRegInfo();
|
|
|
|
Indexes = &getAnalysis<SlotIndexes>();
|
|
|
|
LIS = &getAnalysis<LiveIntervals>();
|
|
|
|
VRM = &getAnalysis<VirtRegMap>();
|
2018-05-14 14:53:11 +02:00
|
|
|
LLVM_DEBUG(dbgs() << "********** REWRITE VIRTUAL REGISTERS **********\n"
|
|
|
|
<< "********** Function: " << MF->getName() << '\n');
|
|
|
|
LLVM_DEBUG(VRM->dump());
|
2012-06-09 01:44:45 +02:00
|
|
|
|
|
|
|
// Add kill flags while we still have virtual registers.
|
2012-09-06 20:15:18 +02:00
|
|
|
LIS->addKillFlags(VRM);
|
2012-06-09 01:44:45 +02:00
|
|
|
|
2012-06-09 02:14:47 +02:00
|
|
|
// Live-in lists on basic blocks are required for physregs.
|
|
|
|
addMBBLiveIns();
|
|
|
|
|
2012-06-09 01:44:45 +02:00
|
|
|
// Rewrite virtual registers.
|
|
|
|
rewrite();
|
|
|
|
|
|
|
|
// Write out new DBG_VALUE instructions.
|
|
|
|
getAnalysis<LiveDebugVariables>().emitDebugValues(VRM);
|
|
|
|
|
|
|
|
// All machine operands and other references to virtual registers have been
|
|
|
|
// replaced. Remove the virtual registers and release all the transient data.
|
|
|
|
VRM->clearAllVirt();
|
|
|
|
MRI->clearVirtRegs();
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2015-09-09 20:07:54 +02:00
|
|
|
void VirtRegRewriter::addLiveInsForSubRanges(const LiveInterval &LI,
|
2019-08-13 02:55:24 +02:00
|
|
|
Register PhysReg) const {
|
2015-09-09 20:07:54 +02:00
|
|
|
assert(!LI.empty());
|
|
|
|
assert(LI.hasSubRanges());
|
|
|
|
|
2017-09-13 23:15:20 +02:00
|
|
|
using SubRangeIteratorPair =
|
|
|
|
std::pair<const LiveInterval::SubRange *, LiveInterval::const_iterator>;
|
|
|
|
|
2015-09-09 20:07:54 +02:00
|
|
|
SmallVector<SubRangeIteratorPair, 4> SubRanges;
|
|
|
|
SlotIndex First;
|
|
|
|
SlotIndex Last;
|
|
|
|
for (const LiveInterval::SubRange &SR : LI.subranges()) {
|
|
|
|
SubRanges.push_back(std::make_pair(&SR, SR.begin()));
|
|
|
|
if (!First.isValid() || SR.segments.front().start < First)
|
|
|
|
First = SR.segments.front().start;
|
|
|
|
if (!Last.isValid() || SR.segments.back().end > Last)
|
|
|
|
Last = SR.segments.back().end;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Check all mbb start positions between First and Last while
|
|
|
|
// simulatenously advancing an iterator for each subrange.
|
|
|
|
for (SlotIndexes::MBBIndexIterator MBBI = Indexes->findMBBIndex(First);
|
|
|
|
MBBI != Indexes->MBBIndexEnd() && MBBI->first <= Last; ++MBBI) {
|
|
|
|
SlotIndex MBBBegin = MBBI->first;
|
|
|
|
// Advance all subrange iterators so that their end position is just
|
|
|
|
// behind MBBBegin (or the iterator is at the end).
|
2016-12-15 15:36:06 +01:00
|
|
|
LaneBitmask LaneMask;
|
2015-09-09 20:07:54 +02:00
|
|
|
for (auto &RangeIterPair : SubRanges) {
|
|
|
|
const LiveInterval::SubRange *SR = RangeIterPair.first;
|
|
|
|
LiveInterval::const_iterator &SRI = RangeIterPair.second;
|
|
|
|
while (SRI != SR->end() && SRI->end <= MBBBegin)
|
|
|
|
++SRI;
|
|
|
|
if (SRI == SR->end())
|
|
|
|
continue;
|
|
|
|
if (SRI->start <= MBBBegin)
|
|
|
|
LaneMask |= SR->LaneMask;
|
|
|
|
}
|
2016-12-15 15:36:06 +01:00
|
|
|
if (LaneMask.none())
|
2015-09-09 20:07:54 +02:00
|
|
|
continue;
|
|
|
|
MachineBasicBlock *MBB = MBBI->second;
|
2015-09-09 20:08:03 +02:00
|
|
|
MBB->addLiveIn(PhysReg, LaneMask);
|
2015-09-09 20:07:54 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-06-09 02:14:47 +02:00
|
|
|
// Compute MBB live-in lists from virtual register live ranges and their
|
|
|
|
// assignments.
|
|
|
|
void VirtRegRewriter::addMBBLiveIns() {
|
|
|
|
for (unsigned Idx = 0, IdxE = MRI->getNumVirtRegs(); Idx != IdxE; ++Idx) {
|
2019-08-13 02:55:24 +02:00
|
|
|
Register VirtReg = Register::index2VirtReg(Idx);
|
2012-06-09 02:14:47 +02:00
|
|
|
if (MRI->reg_nodbg_empty(VirtReg))
|
|
|
|
continue;
|
|
|
|
LiveInterval &LI = LIS->getInterval(VirtReg);
|
|
|
|
if (LI.empty() || LIS->intervalIsInOneMBB(LI))
|
|
|
|
continue;
|
|
|
|
// This is a virtual register that is live across basic blocks. Its
|
|
|
|
// assigned PhysReg must be marked as live-in to those blocks.
|
2019-08-13 02:55:24 +02:00
|
|
|
Register PhysReg = VRM->getPhys(VirtReg);
|
2012-06-09 02:14:47 +02:00
|
|
|
assert(PhysReg != VirtRegMap::NO_PHYS_REG && "Unmapped virtual register.");
|
|
|
|
|
2014-12-10 02:13:08 +01:00
|
|
|
if (LI.hasSubRanges()) {
|
2015-09-09 20:07:54 +02:00
|
|
|
addLiveInsForSubRanges(LI, PhysReg);
|
2014-12-10 02:13:08 +01:00
|
|
|
} else {
|
2015-09-09 20:07:54 +02:00
|
|
|
// Go over MBB begin positions and see if we have segments covering them.
|
|
|
|
// The following works because segments and the MBBIndex list are both
|
|
|
|
// sorted by slot indexes.
|
|
|
|
SlotIndexes::MBBIndexIterator I = Indexes->MBBIndexBegin();
|
|
|
|
for (const auto &Seg : LI) {
|
|
|
|
I = Indexes->advanceMBBIndex(I, Seg.start);
|
|
|
|
for (; I != Indexes->MBBIndexEnd() && I->first < Seg.end; ++I) {
|
|
|
|
MachineBasicBlock *MBB = I->second;
|
|
|
|
MBB->addLiveIn(PhysReg);
|
|
|
|
}
|
2014-12-10 02:13:08 +01:00
|
|
|
}
|
2012-06-09 02:14:47 +02:00
|
|
|
}
|
|
|
|
}
|
2015-05-22 10:11:26 +02:00
|
|
|
|
|
|
|
// Sort and unique MBB LiveIns as we've not checked if SubReg/PhysReg were in
|
|
|
|
// each MBB's LiveIns set before calling addLiveIn on them.
|
|
|
|
for (MachineBasicBlock &MBB : *MF)
|
|
|
|
MBB.sortUniqueLiveIns();
|
2012-06-09 02:14:47 +02:00
|
|
|
}
|
|
|
|
|
2015-06-16 20:22:28 +02:00
|
|
|
/// Returns true if the given machine operand \p MO only reads undefined lanes.
|
|
|
|
/// The function only works for use operands with a subregister set.
|
|
|
|
bool VirtRegRewriter::readsUndefSubreg(const MachineOperand &MO) const {
|
|
|
|
// Shortcut if the operand is already marked undef.
|
|
|
|
if (MO.isUndef())
|
|
|
|
return true;
|
|
|
|
|
2019-08-13 02:55:24 +02:00
|
|
|
Register Reg = MO.getReg();
|
2015-06-16 20:22:28 +02:00
|
|
|
const LiveInterval &LI = LIS->getInterval(Reg);
|
|
|
|
const MachineInstr &MI = *MO.getParent();
|
2016-02-27 07:40:41 +01:00
|
|
|
SlotIndex BaseIndex = LIS->getInstructionIndex(MI);
|
2015-06-16 20:22:28 +02:00
|
|
|
// This code is only meant to handle reading undefined subregisters which
|
|
|
|
// we couldn't properly detect before.
|
|
|
|
assert(LI.liveAt(BaseIndex) &&
|
|
|
|
"Reads of completely dead register should be marked undef already");
|
|
|
|
unsigned SubRegIdx = MO.getSubReg();
|
2016-08-24 15:37:55 +02:00
|
|
|
assert(SubRegIdx != 0 && LI.hasSubRanges());
|
2015-09-25 23:51:14 +02:00
|
|
|
LaneBitmask UseMask = TRI->getSubRegIndexLaneMask(SubRegIdx);
|
2015-06-16 20:22:28 +02:00
|
|
|
// See if any of the relevant subregister liveranges is defined at this point.
|
|
|
|
for (const LiveInterval::SubRange &SR : LI.subranges()) {
|
2016-12-16 20:11:56 +01:00
|
|
|
if ((SR.LaneMask & UseMask).any() && SR.liveAt(BaseIndex))
|
2015-06-16 20:22:28 +02:00
|
|
|
return false;
|
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2016-07-09 02:19:07 +02:00
|
|
|
void VirtRegRewriter::handleIdentityCopy(MachineInstr &MI) const {
|
|
|
|
if (!MI.isIdentityCopy())
|
|
|
|
return;
|
2018-05-14 14:53:11 +02:00
|
|
|
LLVM_DEBUG(dbgs() << "Identity copy: " << MI);
|
2016-07-09 02:19:07 +02:00
|
|
|
++NumIdCopies;
|
|
|
|
|
|
|
|
// Copies like:
|
2017-12-07 11:40:31 +01:00
|
|
|
// %r0 = COPY undef %r0
|
|
|
|
// %al = COPY %al, implicit-def %eax
|
2016-07-09 02:19:07 +02:00
|
|
|
// give us additional liveness information: The target (super-)register
|
|
|
|
// must not be valid before this point. Replace the COPY with a KILL
|
|
|
|
// instruction to maintain this information.
|
2019-05-20 16:09:36 +02:00
|
|
|
if (MI.getOperand(1).isUndef() || MI.getNumOperands() > 2) {
|
2016-07-09 02:19:07 +02:00
|
|
|
MI.setDesc(TII->get(TargetOpcode::KILL));
|
2018-05-14 14:53:11 +02:00
|
|
|
LLVM_DEBUG(dbgs() << " replace by: " << MI);
|
2016-07-09 02:19:07 +02:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (Indexes)
|
2017-03-17 01:41:33 +01:00
|
|
|
Indexes->removeSingleMachineInstrFromMaps(MI);
|
|
|
|
MI.eraseFromBundle();
|
2018-05-14 14:53:11 +02:00
|
|
|
LLVM_DEBUG(dbgs() << " deleted.\n");
|
2016-07-09 02:19:07 +02:00
|
|
|
}
|
|
|
|
|
2017-03-17 01:41:39 +01:00
|
|
|
/// The liverange splitting logic sometimes produces bundles of copies when
|
|
|
|
/// subregisters are involved. Expand these into a sequence of copy instructions
|
|
|
|
/// after processing the last in the bundle. Does not update LiveIntervals
|
|
|
|
/// which we shouldn't need for this instruction anymore.
|
|
|
|
void VirtRegRewriter::expandCopyBundle(MachineInstr &MI) const {
|
|
|
|
if (!MI.isCopy())
|
|
|
|
return;
|
|
|
|
|
|
|
|
if (MI.isBundledWithPred() && !MI.isBundledWithSucc()) {
|
2018-06-14 21:24:03 +02:00
|
|
|
SmallVector<MachineInstr *, 2> MIs({&MI});
|
|
|
|
|
2017-03-17 01:41:39 +01:00
|
|
|
// Only do this when the complete bundle is made out of COPYs.
|
2017-03-21 22:58:08 +01:00
|
|
|
MachineBasicBlock &MBB = *MI.getParent();
|
2017-03-17 01:41:39 +01:00
|
|
|
for (MachineBasicBlock::reverse_instr_iterator I =
|
2017-03-21 22:58:08 +01:00
|
|
|
std::next(MI.getReverseIterator()), E = MBB.instr_rend();
|
|
|
|
I != E && I->isBundledWithSucc(); ++I) {
|
2017-03-17 01:41:39 +01:00
|
|
|
if (!I->isCopy())
|
|
|
|
return;
|
2018-06-14 21:24:03 +02:00
|
|
|
MIs.push_back(&*I);
|
|
|
|
}
|
|
|
|
MachineInstr *FirstMI = MIs.back();
|
|
|
|
|
|
|
|
auto anyRegsAlias = [](const MachineInstr *Dst,
|
|
|
|
ArrayRef<MachineInstr *> Srcs,
|
|
|
|
const TargetRegisterInfo *TRI) {
|
|
|
|
for (const MachineInstr *Src : Srcs)
|
|
|
|
if (Src != Dst)
|
|
|
|
if (TRI->regsOverlap(Dst->getOperand(0).getReg(),
|
|
|
|
Src->getOperand(1).getReg()))
|
|
|
|
return true;
|
|
|
|
return false;
|
|
|
|
};
|
|
|
|
|
|
|
|
// If any of the destination registers in the bundle of copies alias any of
|
|
|
|
// the source registers, try to schedule the instructions to avoid any
|
|
|
|
// clobbering.
|
|
|
|
for (int E = MIs.size(), PrevE = E; E > 1; PrevE = E) {
|
|
|
|
for (int I = E; I--; )
|
|
|
|
if (!anyRegsAlias(MIs[I], makeArrayRef(MIs).take_front(E), TRI)) {
|
|
|
|
if (I + 1 != E)
|
|
|
|
std::swap(MIs[I], MIs[E - 1]);
|
|
|
|
--E;
|
|
|
|
}
|
|
|
|
if (PrevE == E) {
|
|
|
|
MF->getFunction().getContext().emitError(
|
|
|
|
"register rewriting failed: cycle in copy bundle");
|
|
|
|
break;
|
|
|
|
}
|
2017-03-17 01:41:39 +01:00
|
|
|
}
|
|
|
|
|
2018-06-14 21:24:03 +02:00
|
|
|
MachineInstr *BundleStart = FirstMI;
|
|
|
|
for (MachineInstr *BundledMI : llvm::reverse(MIs)) {
|
|
|
|
// If instruction is in the middle of the bundle, move it before the
|
|
|
|
// bundle starts, otherwise, just unbundle it. When we get to the last
|
|
|
|
// instruction, the bundle will have been completely undone.
|
|
|
|
if (BundledMI != BundleStart) {
|
|
|
|
BundledMI->removeFromBundle();
|
|
|
|
MBB.insert(FirstMI, BundledMI);
|
|
|
|
} else if (BundledMI->isBundledWithSucc()) {
|
|
|
|
BundledMI->unbundleFromSucc();
|
|
|
|
BundleStart = &*std::next(BundledMI->getIterator());
|
|
|
|
}
|
2017-03-17 01:41:39 +01:00
|
|
|
|
2018-06-14 21:24:03 +02:00
|
|
|
if (Indexes && BundledMI != FirstMI)
|
|
|
|
Indexes->insertMachineInstrInMaps(*BundledMI);
|
2017-03-17 01:41:39 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
[VirtRegRewriter] Properly model the register liveness on undef subreg definition
Undef subreg definition means that the content of the super register
doesn't matter at this point. While that's true for virtual registers,
this may not hold when replacing them with actual physical registers.
Indeed, some part of the physical register may be coalesced with the
related virtual register and thus, the values for those parts matter and
must be live.
The fix consists in checking whether or not subregs of the physical register
being assigned to an undef subreg definition are live through that def and
insert an implicit use if they are. Doing so, will keep them alive until
that point like they should be.
E.g., let vreg14 being assigned to R0_R1 then
%vreg14:gsub_0<def,read-undef> = COPY %R0 ; <-- R1 is still live here
%vreg14:gsub_1<def> = COPY %R1
Before this changes, the rewriter would change the code into:
%R0<def> = KILL %R0, %R0_R1<imp-def> ; <-- this tells R1 is redefined
%R1<def> = KILL %R1, %R0_R1<imp-def>, %R0_R1<imp-use> ; this value of this R1
; is believed to come
; from the previous
; instruction
Because of this invalid liveness, later pass could make wrong choices and in
particular clobber live register as it happened with the register scavenger in
llvm.org/PR34107
Now we would generate:
%R0<def> = KILL %R0, %R0_R1<imp-def>, %R0_R1<imp-use> ; This tells R1 needs to
; reach this point
%R1<def> = KILL %R1, %R0_R1<imp-def>, %R0_R1<imp-use>
The bug has been here forever, it got exposed recently because the register
scavenger got smarter.
Fixes llvm.org/PR34107
llvm-svn: 310979
2017-08-16 02:17:05 +02:00
|
|
|
/// Check whether (part of) \p SuperPhysReg is live through \p MI.
|
|
|
|
/// \pre \p MI defines a subregister of a virtual register that
|
|
|
|
/// has been assigned to \p SuperPhysReg.
|
|
|
|
bool VirtRegRewriter::subRegLiveThrough(const MachineInstr &MI,
|
2019-08-13 02:55:24 +02:00
|
|
|
Register SuperPhysReg) const {
|
[VirtRegRewriter] Properly model the register liveness on undef subreg definition
Undef subreg definition means that the content of the super register
doesn't matter at this point. While that's true for virtual registers,
this may not hold when replacing them with actual physical registers.
Indeed, some part of the physical register may be coalesced with the
related virtual register and thus, the values for those parts matter and
must be live.
The fix consists in checking whether or not subregs of the physical register
being assigned to an undef subreg definition are live through that def and
insert an implicit use if they are. Doing so, will keep them alive until
that point like they should be.
E.g., let vreg14 being assigned to R0_R1 then
%vreg14:gsub_0<def,read-undef> = COPY %R0 ; <-- R1 is still live here
%vreg14:gsub_1<def> = COPY %R1
Before this changes, the rewriter would change the code into:
%R0<def> = KILL %R0, %R0_R1<imp-def> ; <-- this tells R1 is redefined
%R1<def> = KILL %R1, %R0_R1<imp-def>, %R0_R1<imp-use> ; this value of this R1
; is believed to come
; from the previous
; instruction
Because of this invalid liveness, later pass could make wrong choices and in
particular clobber live register as it happened with the register scavenger in
llvm.org/PR34107
Now we would generate:
%R0<def> = KILL %R0, %R0_R1<imp-def>, %R0_R1<imp-use> ; This tells R1 needs to
; reach this point
%R1<def> = KILL %R1, %R0_R1<imp-def>, %R0_R1<imp-use>
The bug has been here forever, it got exposed recently because the register
scavenger got smarter.
Fixes llvm.org/PR34107
llvm-svn: 310979
2017-08-16 02:17:05 +02:00
|
|
|
SlotIndex MIIndex = LIS->getInstructionIndex(MI);
|
|
|
|
SlotIndex BeforeMIUses = MIIndex.getBaseIndex();
|
|
|
|
SlotIndex AfterMIDefs = MIIndex.getBoundaryIndex();
|
|
|
|
for (MCRegUnitIterator Unit(SuperPhysReg, TRI); Unit.isValid(); ++Unit) {
|
|
|
|
const LiveRange &UnitRange = LIS->getRegUnit(*Unit);
|
|
|
|
// If the regunit is live both before and after MI,
|
|
|
|
// we assume it is live through.
|
|
|
|
// Generally speaking, this is not true, because something like
|
|
|
|
// "RU = op RU" would match that description.
|
|
|
|
// However, we know that we are trying to assess whether
|
|
|
|
// a def of a virtual reg, vreg, is live at the same time of RU.
|
|
|
|
// If we are in the "RU = op RU" situation, that means that vreg
|
|
|
|
// is defined at the same time as RU (i.e., "vreg, RU = op RU").
|
|
|
|
// Thus, vreg and RU interferes and vreg cannot be assigned to
|
|
|
|
// SuperPhysReg. Therefore, this situation cannot happen.
|
|
|
|
if (UnitRange.liveAt(AfterMIDefs) && UnitRange.liveAt(BeforeMIUses))
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2012-06-09 01:44:45 +02:00
|
|
|
void VirtRegRewriter::rewrite() {
|
2015-03-19 01:21:58 +01:00
|
|
|
bool NoSubRegLiveness = !MRI->subRegLivenessEnabled();
|
2019-08-13 02:55:24 +02:00
|
|
|
SmallVector<Register, 8> SuperDeads;
|
|
|
|
SmallVector<Register, 8> SuperDefs;
|
|
|
|
SmallVector<Register, 8> SuperKills;
|
2014-02-25 17:57:28 +01:00
|
|
|
|
2011-02-18 23:03:18 +01:00
|
|
|
for (MachineFunction::iterator MBBI = MF->begin(), MBBE = MF->end();
|
|
|
|
MBBI != MBBE; ++MBBI) {
|
2018-05-14 14:53:11 +02:00
|
|
|
LLVM_DEBUG(MBBI->print(dbgs(), Indexes));
|
2012-01-19 08:46:36 +01:00
|
|
|
for (MachineBasicBlock::instr_iterator
|
|
|
|
MII = MBBI->instr_begin(), MIE = MBBI->instr_end(); MII != MIE;) {
|
2015-10-10 00:56:24 +02:00
|
|
|
MachineInstr *MI = &*MII;
|
2011-02-18 23:03:18 +01:00
|
|
|
++MII;
|
|
|
|
|
|
|
|
for (MachineInstr::mop_iterator MOI = MI->operands_begin(),
|
|
|
|
MOE = MI->operands_end(); MOI != MOE; ++MOI) {
|
|
|
|
MachineOperand &MO = *MOI;
|
2012-02-17 20:07:56 +01:00
|
|
|
|
|
|
|
// Make sure MRI knows about registers clobbered by regmasks.
|
|
|
|
if (MO.isRegMask())
|
|
|
|
MRI->addPhysRegsUsedFromRegMask(MO.getRegMask());
|
|
|
|
|
2019-08-13 02:55:24 +02:00
|
|
|
if (!MO.isReg() || !MO.getReg().isVirtual())
|
2011-02-18 23:03:18 +01:00
|
|
|
continue;
|
2019-08-13 02:55:24 +02:00
|
|
|
Register VirtReg = MO.getReg();
|
|
|
|
Register PhysReg = VRM->getPhys(VirtReg);
|
2012-06-09 01:44:45 +02:00
|
|
|
assert(PhysReg != VirtRegMap::NO_PHYS_REG &&
|
|
|
|
"Instruction uses unmapped VirtReg");
|
2012-10-15 23:57:41 +02:00
|
|
|
assert(!MRI->isReserved(PhysReg) && "Reserved register assignment");
|
2011-02-18 23:03:18 +01:00
|
|
|
|
|
|
|
// Preserve semantics of sub-register operands.
|
2015-06-16 20:22:28 +02:00
|
|
|
unsigned SubReg = MO.getSubReg();
|
|
|
|
if (SubReg != 0) {
|
2018-08-15 18:07:47 +02:00
|
|
|
if (NoSubRegLiveness || !MRI->shouldTrackSubRegLiveness(VirtReg)) {
|
2015-06-16 20:22:28 +02:00
|
|
|
// A virtual register kill refers to the whole register, so we may
|
2017-12-07 11:40:31 +01:00
|
|
|
// have to add implicit killed operands for the super-register. A
|
2015-06-16 20:22:28 +02:00
|
|
|
// partial redef always kills and redefines the super-register.
|
[VirtRegRewriter] Properly model the register liveness on undef subreg definition
Undef subreg definition means that the content of the super register
doesn't matter at this point. While that's true for virtual registers,
this may not hold when replacing them with actual physical registers.
Indeed, some part of the physical register may be coalesced with the
related virtual register and thus, the values for those parts matter and
must be live.
The fix consists in checking whether or not subregs of the physical register
being assigned to an undef subreg definition are live through that def and
insert an implicit use if they are. Doing so, will keep them alive until
that point like they should be.
E.g., let vreg14 being assigned to R0_R1 then
%vreg14:gsub_0<def,read-undef> = COPY %R0 ; <-- R1 is still live here
%vreg14:gsub_1<def> = COPY %R1
Before this changes, the rewriter would change the code into:
%R0<def> = KILL %R0, %R0_R1<imp-def> ; <-- this tells R1 is redefined
%R1<def> = KILL %R1, %R0_R1<imp-def>, %R0_R1<imp-use> ; this value of this R1
; is believed to come
; from the previous
; instruction
Because of this invalid liveness, later pass could make wrong choices and in
particular clobber live register as it happened with the register scavenger in
llvm.org/PR34107
Now we would generate:
%R0<def> = KILL %R0, %R0_R1<imp-def>, %R0_R1<imp-use> ; This tells R1 needs to
; reach this point
%R1<def> = KILL %R1, %R0_R1<imp-def>, %R0_R1<imp-use>
The bug has been here forever, it got exposed recently because the register
scavenger got smarter.
Fixes llvm.org/PR34107
llvm-svn: 310979
2017-08-16 02:17:05 +02:00
|
|
|
if ((MO.readsReg() && (MO.isDef() || MO.isKill())) ||
|
|
|
|
(MO.isDef() && subRegLiveThrough(*MI, PhysReg)))
|
2015-06-16 20:22:28 +02:00
|
|
|
SuperKills.push_back(PhysReg);
|
|
|
|
|
|
|
|
if (MO.isDef()) {
|
|
|
|
// Also add implicit defs for the super-register.
|
2014-12-10 02:13:04 +01:00
|
|
|
if (MO.isDead())
|
|
|
|
SuperDeads.push_back(PhysReg);
|
|
|
|
else
|
|
|
|
SuperDefs.push_back(PhysReg);
|
|
|
|
}
|
2015-06-16 20:22:28 +02:00
|
|
|
} else {
|
|
|
|
if (MO.isUse()) {
|
|
|
|
if (readsUndefSubreg(MO))
|
|
|
|
// We need to add an <undef> flag if the subregister is
|
|
|
|
// completely undefined (and we are not adding super-register
|
|
|
|
// defs).
|
|
|
|
MO.setIsUndef(true);
|
|
|
|
} else if (!MO.isDead()) {
|
|
|
|
assert(MO.isDef());
|
|
|
|
}
|
2011-10-05 02:01:48 +02:00
|
|
|
}
|
2011-02-18 23:03:18 +01:00
|
|
|
|
2017-12-07 11:40:31 +01:00
|
|
|
// The def undef and def internal flags only make sense for
|
2017-03-17 01:41:33 +01:00
|
|
|
// sub-register defs, and we are substituting a full physreg. An
|
2017-12-07 11:40:31 +01:00
|
|
|
// implicit killed operand from the SuperKills list will represent the
|
2017-03-17 01:41:33 +01:00
|
|
|
// partial read of the super-register.
|
|
|
|
if (MO.isDef()) {
|
2015-06-16 20:22:28 +02:00
|
|
|
MO.setIsUndef(false);
|
2017-03-17 01:41:33 +01:00
|
|
|
MO.setIsInternalRead(false);
|
|
|
|
}
|
2015-06-16 20:22:28 +02:00
|
|
|
|
2011-02-18 23:03:18 +01:00
|
|
|
// PhysReg operands cannot have subregister indexes.
|
2015-06-16 20:22:28 +02:00
|
|
|
PhysReg = TRI->getSubReg(PhysReg, SubReg);
|
2019-08-13 02:55:24 +02:00
|
|
|
assert(PhysReg.isValid() && "Invalid SubReg for physical register");
|
2011-02-18 23:03:18 +01:00
|
|
|
MO.setSubReg(0);
|
|
|
|
}
|
|
|
|
// Rewrite. Note we could have used MachineOperand::substPhysReg(), but
|
|
|
|
// we need the inlining here.
|
|
|
|
MO.setReg(PhysReg);
|
[MachineOperand][Target] MachineOperand::isRenamable semantics changes
Summary:
Add a target option AllowRegisterRenaming that is used to opt in to
post-register-allocation renaming of registers. This is set to 0 by
default, which causes the hasExtraSrcRegAllocReq/hasExtraDstRegAllocReq
fields of all opcodes to be set to 1, causing
MachineOperand::isRenamable to always return false.
Set the AllowRegisterRenaming flag to 1 for all in-tree targets that
have lit tests that were effected by enabling COPY forwarding in
MachineCopyPropagation (AArch64, AMDGPU, ARM, Hexagon, Mips, PowerPC,
RISCV, Sparc, SystemZ and X86).
Add some more comments describing the semantics of the
MachineOperand::isRenamable function and how it is set and maintained.
Change isRenamable to check the operand's opcode
hasExtraSrcRegAllocReq/hasExtraDstRegAllocReq bit directly instead of
relying on it being consistently reflected in the IsRenamable bit
setting.
Clear the IsRenamable bit when changing an operand's register value.
Remove target code that was clearing the IsRenamable bit when changing
registers/opcodes now that this is done conservatively by default.
Change setting of hasExtraSrcRegAllocReq in AMDGPU target to be done in
one place covering all opcodes that have constant pipe read limit
restrictions.
Reviewers: qcolombet, MatzeB
Subscribers: aemerson, arsenm, jyknight, mcrosier, sdardis, nhaehnle, javed.absar, tpr, arichardson, kristof.beyls, kbarton, fedor.sergeev, asb, rbar, johnrusso, simoncook, jordy.potman.lists, apazos, sabuasal, niosHD, escha, nemanjai, llvm-commits
Differential Revision: https://reviews.llvm.org/D43042
llvm-svn: 325931
2018-02-23 19:25:08 +01:00
|
|
|
MO.setIsRenamable(true);
|
2011-02-18 23:03:18 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
// Add any missing super-register kills after rewriting the whole
|
|
|
|
// instruction.
|
|
|
|
while (!SuperKills.empty())
|
|
|
|
MI->addRegisterKilled(SuperKills.pop_back_val(), TRI, true);
|
|
|
|
|
2011-04-27 19:42:31 +02:00
|
|
|
while (!SuperDeads.empty())
|
|
|
|
MI->addRegisterDead(SuperDeads.pop_back_val(), TRI, true);
|
|
|
|
|
|
|
|
while (!SuperDefs.empty())
|
|
|
|
MI->addRegisterDefined(SuperDefs.pop_back_val(), TRI);
|
|
|
|
|
2018-05-14 14:53:11 +02:00
|
|
|
LLVM_DEBUG(dbgs() << "> " << *MI);
|
2011-02-18 23:03:18 +01:00
|
|
|
|
2017-03-17 01:41:39 +01:00
|
|
|
expandCopyBundle(*MI);
|
|
|
|
|
2016-07-09 02:19:07 +02:00
|
|
|
// We can remove identity copies right now.
|
|
|
|
handleIdentityCopy(*MI);
|
2011-02-18 23:03:18 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|