1 //===- MachineCopyPropagation.cpp - Machine Copy Propagation Pass ---------===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This is an extremely simple MachineInstr-level copy propagation pass.
12 //===----------------------------------------------------------------------===//
14 #define DEBUG_TYPE "codegen-cp"
15 #include "llvm/CodeGen/Passes.h"
16 #include "llvm/ADT/DenseMap.h"
17 #include "llvm/ADT/SetVector.h"
18 #include "llvm/ADT/SmallVector.h"
19 #include "llvm/ADT/Statistic.h"
20 #include "llvm/CodeGen/MachineFunction.h"
21 #include "llvm/CodeGen/MachineFunctionPass.h"
22 #include "llvm/CodeGen/MachineRegisterInfo.h"
23 #include "llvm/Pass.h"
24 #include "llvm/Support/Debug.h"
25 #include "llvm/Support/ErrorHandling.h"
26 #include "llvm/Support/raw_ostream.h"
27 #include "llvm/Target/TargetInstrInfo.h"
28 #include "llvm/Target/TargetRegisterInfo.h"
31 STATISTIC(NumDeletes, "Number of dead copies deleted");
34 class MachineCopyPropagation : public MachineFunctionPass {
35 const TargetRegisterInfo *TRI;
36 const TargetInstrInfo *TII;
37 MachineRegisterInfo *MRI;
40 static char ID; // Pass identification, replacement for typeid
41 MachineCopyPropagation() : MachineFunctionPass(ID) {
42 initializeMachineCopyPropagationPass(*PassRegistry::getPassRegistry());
45 virtual bool runOnMachineFunction(MachineFunction &MF);
48 typedef SmallVector<unsigned, 4> DestList;
49 typedef DenseMap<unsigned, DestList> SourceMap;
51 void SourceNoLongerAvailable(unsigned Reg,
53 DenseMap<unsigned, MachineInstr*> &AvailCopyMap);
54 bool CopyPropagateBlock(MachineBasicBlock &MBB);
55 void removeCopy(MachineInstr *MI);
58 char MachineCopyPropagation::ID = 0;
59 char &llvm::MachineCopyPropagationID = MachineCopyPropagation::ID;
61 INITIALIZE_PASS(MachineCopyPropagation, "machine-cp",
62 "Machine Copy Propagation Pass", false, false)
65 MachineCopyPropagation::SourceNoLongerAvailable(unsigned Reg,
67 DenseMap<unsigned, MachineInstr*> &AvailCopyMap) {
68 for (MCRegAliasIterator AI(Reg, TRI, true); AI.isValid(); ++AI) {
69 SourceMap::iterator SI = SrcMap.find(*AI);
70 if (SI != SrcMap.end()) {
71 const DestList& Defs = SI->second;
72 for (DestList::const_iterator I = Defs.begin(), E = Defs.end();
74 unsigned MappedDef = *I;
75 // Source of copy is no longer available for propagation.
76 if (AvailCopyMap.erase(MappedDef)) {
77 for (MCSubRegIterator SR(MappedDef, TRI); SR.isValid(); ++SR)
78 AvailCopyMap.erase(*SR);
85 static bool NoInterveningSideEffect(const MachineInstr *CopyMI,
86 const MachineInstr *MI) {
87 const MachineBasicBlock *MBB = CopyMI->getParent();
88 if (MI->getParent() != MBB)
90 MachineBasicBlock::const_iterator I = CopyMI;
91 MachineBasicBlock::const_iterator E = MBB->end();
92 MachineBasicBlock::const_iterator E2 = MI;
95 while (I != E && I != E2) {
96 if (I->hasUnmodeledSideEffects() || I->isCall() ||
104 /// isNopCopy - Return true if the specified copy is really a nop. That is
105 /// if the source of the copy is the same of the definition of the copy that
106 /// supplied the source. If the source of the copy is a sub-register than it
107 /// must check the sub-indices match. e.g.
113 static bool isNopCopy(MachineInstr *CopyMI, unsigned Def, unsigned Src,
114 const TargetRegisterInfo *TRI) {
115 unsigned SrcSrc = CopyMI->getOperand(1).getReg();
118 if (TRI->isSubRegister(SrcSrc, Def)) {
119 unsigned SrcDef = CopyMI->getOperand(0).getReg();
120 unsigned SubIdx = TRI->getSubRegIndex(SrcSrc, Def);
123 return SubIdx == TRI->getSubRegIndex(SrcDef, Src);
129 // Remove MI from the function because it has been determined it is dead.
130 // Turn it into a noop KILL instruction if it has super-register liveness
132 void MachineCopyPropagation::removeCopy(MachineInstr *MI) {
133 if (MI->getNumOperands() == 2)
134 MI->eraseFromParent();
136 MI->setDesc(TII->get(TargetOpcode::KILL));
139 bool MachineCopyPropagation::CopyPropagateBlock(MachineBasicBlock &MBB) {
140 SmallSetVector<MachineInstr*, 8> MaybeDeadCopies; // Candidates for deletion
141 DenseMap<unsigned, MachineInstr*> AvailCopyMap; // Def -> available copies map
142 DenseMap<unsigned, MachineInstr*> CopyMap; // Def -> copies map
143 SourceMap SrcMap; // Src -> Def map
145 bool Changed = false;
146 for (MachineBasicBlock::iterator I = MBB.begin(), E = MBB.end(); I != E; ) {
147 MachineInstr *MI = &*I;
151 unsigned Def = MI->getOperand(0).getReg();
152 unsigned Src = MI->getOperand(1).getReg();
154 if (TargetRegisterInfo::isVirtualRegister(Def) ||
155 TargetRegisterInfo::isVirtualRegister(Src))
156 report_fatal_error("MachineCopyPropagation should be run after"
157 " register allocation!");
159 DenseMap<unsigned, MachineInstr*>::iterator CI = AvailCopyMap.find(Src);
160 if (CI != AvailCopyMap.end()) {
161 MachineInstr *CopyMI = CI->second;
162 if (!MRI->isReserved(Def) &&
163 (!MRI->isReserved(Src) || NoInterveningSideEffect(CopyMI, MI)) &&
164 isNopCopy(CopyMI, Def, Src, TRI)) {
165 // The two copies cancel out and the source of the first copy
166 // hasn't been overridden, eliminate the second one. e.g.
167 // %ECX<def> = COPY %EAX<kill>
168 // ... nothing clobbered EAX.
169 // %EAX<def> = COPY %ECX
171 // %ECX<def> = COPY %EAX
173 // Also avoid eliminating a copy from reserved registers unless the
174 // definition is proven not clobbered. e.g.
175 // %RSP<def> = COPY %RAX
177 // %RAX<def> = COPY %RSP
179 // Clear any kills of Def between CopyMI and MI. This extends the
181 for (MachineBasicBlock::iterator I = CopyMI, E = MI; I != E; ++I)
182 I->clearRegisterKills(Def, TRI);
191 // If Src is defined by a previous copy, it cannot be eliminated.
192 for (MCRegAliasIterator AI(Src, TRI, true); AI.isValid(); ++AI) {
193 CI = CopyMap.find(*AI);
194 if (CI != CopyMap.end())
195 MaybeDeadCopies.remove(CI->second);
198 // Copy is now a candidate for deletion.
199 MaybeDeadCopies.insert(MI);
201 // If 'Src' is previously source of another copy, then this earlier copy's
202 // source is no longer available. e.g.
203 // %xmm9<def> = copy %xmm2
205 // %xmm2<def> = copy %xmm0
207 // %xmm2<def> = copy %xmm9
208 SourceNoLongerAvailable(Def, SrcMap, AvailCopyMap);
210 // Remember Def is defined by the copy.
211 // ... Make sure to clear the def maps of aliases first.
212 for (MCRegAliasIterator AI(Def, TRI, false); AI.isValid(); ++AI) {
214 AvailCopyMap.erase(*AI);
216 for (MCSubRegIterator SR(Def, TRI, /*IncludeSelf=*/true); SR.isValid();
219 AvailCopyMap[*SR] = MI;
222 // Remember source that's copied to Def. Once it's clobbered, then
223 // it's no longer available for copy propagation.
224 if (std::find(SrcMap[Src].begin(), SrcMap[Src].end(), Def) ==
226 SrcMap[Src].push_back(Def);
233 SmallVector<unsigned, 2> Defs;
234 int RegMaskOpNum = -1;
235 for (unsigned i = 0, e = MI->getNumOperands(); i != e; ++i) {
236 MachineOperand &MO = MI->getOperand(i);
241 unsigned Reg = MO.getReg();
245 if (TargetRegisterInfo::isVirtualRegister(Reg))
246 report_fatal_error("MachineCopyPropagation should be run after"
247 " register allocation!");
254 // If 'Reg' is defined by a copy, the copy is no longer a candidate
256 for (MCRegAliasIterator AI(Reg, TRI, true); AI.isValid(); ++AI) {
257 DenseMap<unsigned, MachineInstr*>::iterator CI = CopyMap.find(*AI);
258 if (CI != CopyMap.end())
259 MaybeDeadCopies.remove(CI->second);
263 // The instruction has a register mask operand which means that it clobbers
264 // a large set of registers. It is possible to use the register mask to
265 // prune the available copies, but treat it like a basic block boundary for
267 if (RegMaskOpNum >= 0) {
268 // Erase any MaybeDeadCopies whose destination register is clobbered.
269 const MachineOperand &MaskMO = MI->getOperand(RegMaskOpNum);
270 for (SmallSetVector<MachineInstr*, 8>::iterator
271 DI = MaybeDeadCopies.begin(), DE = MaybeDeadCopies.end();
273 unsigned Reg = (*DI)->getOperand(0).getReg();
274 if (MRI->isReserved(Reg) || !MaskMO.clobbersPhysReg(Reg))
281 // Clear all data structures as if we were beginning a new basic block.
282 MaybeDeadCopies.clear();
283 AvailCopyMap.clear();
289 for (unsigned i = 0, e = Defs.size(); i != e; ++i) {
290 unsigned Reg = Defs[i];
292 // No longer defined by a copy.
293 for (MCRegAliasIterator AI(Reg, TRI, true); AI.isValid(); ++AI) {
295 AvailCopyMap.erase(*AI);
298 // If 'Reg' is previously source of a copy, it is no longer available for
300 SourceNoLongerAvailable(Reg, SrcMap, AvailCopyMap);
304 // If MBB doesn't have successors, delete the copies whose defs are not used.
305 // If MBB does have successors, then conservative assume the defs are live-out
306 // since we don't want to trust live-in lists.
307 if (MBB.succ_empty()) {
308 for (SmallSetVector<MachineInstr*, 8>::iterator
309 DI = MaybeDeadCopies.begin(), DE = MaybeDeadCopies.end();
311 if (!MRI->isReserved((*DI)->getOperand(0).getReg())) {
322 bool MachineCopyPropagation::runOnMachineFunction(MachineFunction &MF) {
323 bool Changed = false;
325 TRI = MF.getTarget().getRegisterInfo();
326 TII = MF.getTarget().getInstrInfo();
327 MRI = &MF.getRegInfo();
329 for (MachineFunction::iterator I = MF.begin(), E = MF.end(); I != E; ++I)
330 Changed |= CopyPropagateBlock(*I);