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 #include "llvm/CodeGen/Passes.h"
15 #include "llvm/ADT/DenseMap.h"
16 #include "llvm/ADT/SetVector.h"
17 #include "llvm/ADT/SmallVector.h"
18 #include "llvm/ADT/Statistic.h"
19 #include "llvm/CodeGen/MachineFunction.h"
20 #include "llvm/CodeGen/MachineFunctionPass.h"
21 #include "llvm/CodeGen/MachineRegisterInfo.h"
22 #include "llvm/Pass.h"
23 #include "llvm/Support/Debug.h"
24 #include "llvm/Support/ErrorHandling.h"
25 #include "llvm/Support/raw_ostream.h"
26 #include "llvm/Target/TargetInstrInfo.h"
27 #include "llvm/Target/TargetRegisterInfo.h"
28 #include "llvm/Target/TargetSubtargetInfo.h"
31 #define DEBUG_TYPE "codegen-cp"
33 STATISTIC(NumDeletes, "Number of dead copies deleted");
36 class MachineCopyPropagation : public MachineFunctionPass {
37 const TargetRegisterInfo *TRI;
38 const TargetInstrInfo *TII;
39 MachineRegisterInfo *MRI;
42 static char ID; // Pass identification, replacement for typeid
43 MachineCopyPropagation() : MachineFunctionPass(ID) {
44 initializeMachineCopyPropagationPass(*PassRegistry::getPassRegistry());
47 bool runOnMachineFunction(MachineFunction &MF) override;
50 typedef SmallVector<unsigned, 4> DestList;
51 typedef DenseMap<unsigned, DestList> SourceMap;
53 void SourceNoLongerAvailable(unsigned Reg,
55 DenseMap<unsigned, MachineInstr*> &AvailCopyMap);
56 bool CopyPropagateBlock(MachineBasicBlock &MBB);
59 char MachineCopyPropagation::ID = 0;
60 char &llvm::MachineCopyPropagationID = MachineCopyPropagation::ID;
62 INITIALIZE_PASS(MachineCopyPropagation, "machine-cp",
63 "Machine Copy Propagation Pass", false, false)
66 MachineCopyPropagation::SourceNoLongerAvailable(unsigned Reg,
68 DenseMap<unsigned, MachineInstr*> &AvailCopyMap) {
69 for (MCRegAliasIterator AI(Reg, TRI, true); AI.isValid(); ++AI) {
70 SourceMap::iterator SI = SrcMap.find(*AI);
71 if (SI != SrcMap.end()) {
72 const DestList& Defs = SI->second;
73 for (DestList::const_iterator I = Defs.begin(), E = Defs.end();
75 unsigned MappedDef = *I;
76 // Source of copy is no longer available for propagation.
77 AvailCopyMap.erase(MappedDef);
78 for (MCSubRegIterator SR(MappedDef, TRI); SR.isValid(); ++SR)
79 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 bool MachineCopyPropagation::CopyPropagateBlock(MachineBasicBlock &MBB) {
130 SmallSetVector<MachineInstr*, 8> MaybeDeadCopies; // Candidates for deletion
131 DenseMap<unsigned, MachineInstr*> AvailCopyMap; // Def -> available copies map
132 DenseMap<unsigned, MachineInstr*> CopyMap; // Def -> copies map
133 SourceMap SrcMap; // Src -> Def map
135 DEBUG(dbgs() << "MCP: CopyPropagateBlock " << MBB.getName() << "\n");
137 bool Changed = false;
138 for (MachineBasicBlock::iterator I = MBB.begin(), E = MBB.end(); I != E; ) {
139 MachineInstr *MI = &*I;
143 unsigned Def = MI->getOperand(0).getReg();
144 unsigned Src = MI->getOperand(1).getReg();
146 if (TargetRegisterInfo::isVirtualRegister(Def) ||
147 TargetRegisterInfo::isVirtualRegister(Src))
148 report_fatal_error("MachineCopyPropagation should be run after"
149 " register allocation!");
151 DenseMap<unsigned, MachineInstr*>::iterator CI = AvailCopyMap.find(Src);
152 if (CI != AvailCopyMap.end()) {
153 MachineInstr *CopyMI = CI->second;
154 if (!MRI->isReserved(Def) &&
155 (!MRI->isReserved(Src) || NoInterveningSideEffect(CopyMI, MI)) &&
156 isNopCopy(CopyMI, Def, Src, TRI)) {
157 // The two copies cancel out and the source of the first copy
158 // hasn't been overridden, eliminate the second one. e.g.
159 // %ECX<def> = COPY %EAX<kill>
160 // ... nothing clobbered EAX.
161 // %EAX<def> = COPY %ECX
163 // %ECX<def> = COPY %EAX
165 // Also avoid eliminating a copy from reserved registers unless the
166 // definition is proven not clobbered. e.g.
167 // %RSP<def> = COPY %RAX
169 // %RAX<def> = COPY %RSP
171 DEBUG(dbgs() << "MCP: copy is a NOP, removing: "; MI->dump());
173 // Clear any kills of Def between CopyMI and MI. This extends the
175 for (MachineBasicBlock::iterator I = CopyMI, E = MI; I != E; ++I)
176 I->clearRegisterKills(Def, TRI);
178 MI->eraseFromParent();
185 // If Src is defined by a previous copy, it cannot be eliminated.
186 for (MCRegAliasIterator AI(Src, TRI, true); AI.isValid(); ++AI) {
187 CI = CopyMap.find(*AI);
188 if (CI != CopyMap.end()) {
189 DEBUG(dbgs() << "MCP: Copy is no longer dead: "; CI->second->dump());
190 MaybeDeadCopies.remove(CI->second);
194 DEBUG(dbgs() << "MCP: Copy is a deletion candidate: "; MI->dump());
196 // Copy is now a candidate for deletion.
197 MaybeDeadCopies.insert(MI);
199 // If 'Src' is previously source of another copy, then this earlier copy's
200 // source is no longer available. e.g.
201 // %xmm9<def> = copy %xmm2
203 // %xmm2<def> = copy %xmm0
205 // %xmm2<def> = copy %xmm9
206 SourceNoLongerAvailable(Def, SrcMap, AvailCopyMap);
208 // Remember Def is defined by the copy.
209 // ... Make sure to clear the def maps of aliases first.
210 for (MCRegAliasIterator AI(Def, TRI, false); AI.isValid(); ++AI) {
212 AvailCopyMap.erase(*AI);
214 for (MCSubRegIterator SR(Def, TRI, /*IncludeSelf=*/true); SR.isValid();
217 AvailCopyMap[*SR] = MI;
220 // Remember source that's copied to Def. Once it's clobbered, then
221 // it's no longer available for copy propagation.
222 if (std::find(SrcMap[Src].begin(), SrcMap[Src].end(), Def) ==
224 SrcMap[Src].push_back(Def);
231 SmallVector<unsigned, 2> Defs;
232 int RegMaskOpNum = -1;
233 for (unsigned i = 0, e = MI->getNumOperands(); i != e; ++i) {
234 MachineOperand &MO = MI->getOperand(i);
239 unsigned Reg = MO.getReg();
243 if (TargetRegisterInfo::isVirtualRegister(Reg))
244 report_fatal_error("MachineCopyPropagation should be run after"
245 " register allocation!");
252 // If 'Reg' is defined by a copy, the copy is no longer a candidate
254 for (MCRegAliasIterator AI(Reg, TRI, true); AI.isValid(); ++AI) {
255 DenseMap<unsigned, MachineInstr*>::iterator CI = CopyMap.find(*AI);
256 if (CI != CopyMap.end()) {
257 DEBUG(dbgs() << "MCP: Copy is used - not dead: "; CI->second->dump());
258 MaybeDeadCopies.remove(CI->second);
261 // Treat undef use like defs for copy propagation but not for
262 // dead copy. We would need to do a liveness check to be sure the copy
263 // is dead for undef uses.
264 // The backends are allowed to do whatever they want with undef value
265 // and we cannot be sure this register will not be rewritten to break
266 // some false dependencies for the hardware for instance.
271 // The instruction has a register mask operand which means that it clobbers
272 // a large set of registers. It is possible to use the register mask to
273 // prune the available copies, but treat it like a basic block boundary for
275 if (RegMaskOpNum >= 0) {
276 // Erase any MaybeDeadCopies whose destination register is clobbered.
277 const MachineOperand &MaskMO = MI->getOperand(RegMaskOpNum);
278 for (SmallSetVector<MachineInstr*, 8>::iterator
279 DI = MaybeDeadCopies.begin(), DE = MaybeDeadCopies.end();
281 unsigned Reg = (*DI)->getOperand(0).getReg();
282 if (MRI->isReserved(Reg) || !MaskMO.clobbersPhysReg(Reg))
284 DEBUG(dbgs() << "MCP: Removing copy due to regmask clobbering: ";
286 (*DI)->eraseFromParent();
291 // Clear all data structures as if we were beginning a new basic block.
292 MaybeDeadCopies.clear();
293 AvailCopyMap.clear();
299 for (unsigned i = 0, e = Defs.size(); i != e; ++i) {
300 unsigned Reg = Defs[i];
302 // No longer defined by a copy.
303 for (MCRegAliasIterator AI(Reg, TRI, true); AI.isValid(); ++AI) {
305 AvailCopyMap.erase(*AI);
308 // If 'Reg' is previously source of a copy, it is no longer available for
310 SourceNoLongerAvailable(Reg, SrcMap, AvailCopyMap);
314 // If MBB doesn't have successors, delete the copies whose defs are not used.
315 // If MBB does have successors, then conservative assume the defs are live-out
316 // since we don't want to trust live-in lists.
317 if (MBB.succ_empty()) {
318 for (SmallSetVector<MachineInstr*, 8>::iterator
319 DI = MaybeDeadCopies.begin(), DE = MaybeDeadCopies.end();
321 if (!MRI->isReserved((*DI)->getOperand(0).getReg())) {
322 (*DI)->eraseFromParent();
332 bool MachineCopyPropagation::runOnMachineFunction(MachineFunction &MF) {
333 if (skipOptnoneFunction(*MF.getFunction()))
336 bool Changed = false;
338 TRI = MF.getSubtarget().getRegisterInfo();
339 TII = MF.getSubtarget().getInstrInfo();
340 MRI = &MF.getRegInfo();
342 for (MachineFunction::iterator I = MF.begin(), E = MF.end(); I != E; ++I)
343 Changed |= CopyPropagateBlock(*I);