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/Pass.h"
17 #include "llvm/CodeGen/MachineFunction.h"
18 #include "llvm/CodeGen/MachineFunctionPass.h"
19 #include "llvm/CodeGen/MachineRegisterInfo.h"
20 #include "llvm/Target/TargetRegisterInfo.h"
21 #include "llvm/Support/Debug.h"
22 #include "llvm/Support/ErrorHandling.h"
23 #include "llvm/Support/raw_ostream.h"
24 #include "llvm/ADT/BitVector.h"
25 #include "llvm/ADT/DenseMap.h"
26 #include "llvm/ADT/SetVector.h"
27 #include "llvm/ADT/SmallVector.h"
28 #include "llvm/ADT/Statistic.h"
31 STATISTIC(NumDeletes, "Number of dead copies deleted");
34 class MachineCopyPropagation : public MachineFunctionPass {
35 const TargetRegisterInfo *TRI;
36 MachineRegisterInfo *MRI;
39 static char ID; // Pass identification, replacement for typeid
40 MachineCopyPropagation() : MachineFunctionPass(ID) {
41 initializeMachineCopyPropagationPass(*PassRegistry::getPassRegistry());
44 virtual bool runOnMachineFunction(MachineFunction &MF);
47 typedef SmallVector<unsigned, 4> DestList;
48 typedef DenseMap<unsigned, DestList> SourceMap;
50 void SourceNoLongerAvailable(unsigned Reg,
52 DenseMap<unsigned, MachineInstr*> &AvailCopyMap);
53 bool CopyPropagateBlock(MachineBasicBlock &MBB);
56 char MachineCopyPropagation::ID = 0;
57 char &llvm::MachineCopyPropagationID = MachineCopyPropagation::ID;
59 INITIALIZE_PASS(MachineCopyPropagation, "machine-cp",
60 "Machine Copy Propagation Pass", false, false)
63 MachineCopyPropagation::SourceNoLongerAvailable(unsigned Reg,
65 DenseMap<unsigned, MachineInstr*> &AvailCopyMap) {
66 for (MCRegAliasIterator AI(Reg, TRI, true); AI.isValid(); ++AI) {
67 SourceMap::iterator SI = SrcMap.find(*AI);
68 if (SI != SrcMap.end()) {
69 const DestList& Defs = SI->second;
70 for (DestList::const_iterator I = Defs.begin(), E = Defs.end();
72 unsigned MappedDef = *I;
73 // Source of copy is no longer available for propagation.
74 if (AvailCopyMap.erase(MappedDef)) {
75 for (MCSubRegIterator SR(MappedDef, TRI); SR.isValid(); ++SR)
76 AvailCopyMap.erase(*SR);
83 static bool NoInterveningSideEffect(const MachineInstr *CopyMI,
84 const MachineInstr *MI) {
85 const MachineBasicBlock *MBB = CopyMI->getParent();
86 if (MI->getParent() != MBB)
88 MachineBasicBlock::const_iterator I = CopyMI;
89 MachineBasicBlock::const_iterator E = MBB->end();
90 MachineBasicBlock::const_iterator E2 = MI;
93 while (I != E && I != E2) {
94 if (I->hasUnmodeledSideEffects() || I->isCall() ||
102 /// isNopCopy - Return true if the specified copy is really a nop. That is
103 /// if the source of the copy is the same of the definition of the copy that
104 /// supplied the source. If the source of the copy is a sub-register than it
105 /// must check the sub-indices match. e.g.
111 static bool isNopCopy(MachineInstr *CopyMI, unsigned Def, unsigned Src,
112 const TargetRegisterInfo *TRI) {
113 unsigned SrcSrc = CopyMI->getOperand(1).getReg();
116 if (TRI->isSubRegister(SrcSrc, Def)) {
117 unsigned SrcDef = CopyMI->getOperand(0).getReg();
118 unsigned SubIdx = TRI->getSubRegIndex(SrcSrc, Def);
121 return SubIdx == TRI->getSubRegIndex(SrcDef, Src);
127 bool MachineCopyPropagation::CopyPropagateBlock(MachineBasicBlock &MBB) {
128 SmallSetVector<MachineInstr*, 8> MaybeDeadCopies; // Candidates for deletion
129 DenseMap<unsigned, MachineInstr*> AvailCopyMap; // Def -> available copies map
130 DenseMap<unsigned, MachineInstr*> CopyMap; // Def -> copies map
131 SourceMap SrcMap; // Src -> Def map
133 bool Changed = false;
134 for (MachineBasicBlock::iterator I = MBB.begin(), E = MBB.end(); I != E; ) {
135 MachineInstr *MI = &*I;
139 unsigned Def = MI->getOperand(0).getReg();
140 unsigned Src = MI->getOperand(1).getReg();
142 if (TargetRegisterInfo::isVirtualRegister(Def) ||
143 TargetRegisterInfo::isVirtualRegister(Src))
144 report_fatal_error("MachineCopyPropagation should be run after"
145 " register allocation!");
147 DenseMap<unsigned, MachineInstr*>::iterator CI = AvailCopyMap.find(Src);
148 if (CI != AvailCopyMap.end()) {
149 MachineInstr *CopyMI = CI->second;
150 if (!MRI->isReserved(Def) &&
151 (!MRI->isReserved(Src) || NoInterveningSideEffect(CopyMI, MI)) &&
152 isNopCopy(CopyMI, Def, Src, TRI)) {
153 // The two copies cancel out and the source of the first copy
154 // hasn't been overridden, eliminate the second one. e.g.
155 // %ECX<def> = COPY %EAX<kill>
156 // ... nothing clobbered EAX.
157 // %EAX<def> = COPY %ECX
159 // %ECX<def> = COPY %EAX
161 // Also avoid eliminating a copy from reserved registers unless the
162 // definition is proven not clobbered. e.g.
163 // %RSP<def> = COPY %RAX
165 // %RAX<def> = COPY %RSP
167 // Clear any kills of Def between CopyMI and MI. This extends the
169 for (MachineBasicBlock::iterator I = CopyMI, E = MI; I != E; ++I)
170 I->clearRegisterKills(Def, TRI);
172 MI->eraseFromParent();
179 // If Src is defined by a previous copy, it cannot be eliminated.
180 for (MCRegAliasIterator AI(Src, TRI, true); AI.isValid(); ++AI) {
181 CI = CopyMap.find(*AI);
182 if (CI != CopyMap.end())
183 MaybeDeadCopies.remove(CI->second);
186 // Copy is now a candidate for deletion.
187 MaybeDeadCopies.insert(MI);
189 // If 'Src' is previously source of another copy, then this earlier copy's
190 // source is no longer available. e.g.
191 // %xmm9<def> = copy %xmm2
193 // %xmm2<def> = copy %xmm0
195 // %xmm2<def> = copy %xmm9
196 SourceNoLongerAvailable(Def, SrcMap, AvailCopyMap);
198 // Remember Def is defined by the copy.
199 // ... Make sure to clear the def maps of aliases first.
200 for (MCRegAliasIterator AI(Def, TRI, false); AI.isValid(); ++AI) {
202 AvailCopyMap.erase(*AI);
205 AvailCopyMap[Def] = MI;
206 for (MCSubRegIterator SR(Def, TRI); SR.isValid(); ++SR) {
208 AvailCopyMap[*SR] = MI;
211 // Remember source that's copied to Def. Once it's clobbered, then
212 // it's no longer available for copy propagation.
213 if (std::find(SrcMap[Src].begin(), SrcMap[Src].end(), Def) ==
215 SrcMap[Src].push_back(Def);
222 SmallVector<unsigned, 2> Defs;
223 int RegMaskOpNum = -1;
224 for (unsigned i = 0, e = MI->getNumOperands(); i != e; ++i) {
225 MachineOperand &MO = MI->getOperand(i);
230 unsigned Reg = MO.getReg();
234 if (TargetRegisterInfo::isVirtualRegister(Reg))
235 report_fatal_error("MachineCopyPropagation should be run after"
236 " register allocation!");
243 // If 'Reg' is defined by a copy, the copy is no longer a candidate
245 for (MCRegAliasIterator AI(Reg, TRI, true); AI.isValid(); ++AI) {
246 DenseMap<unsigned, MachineInstr*>::iterator CI = CopyMap.find(*AI);
247 if (CI != CopyMap.end())
248 MaybeDeadCopies.remove(CI->second);
252 // The instruction has a register mask operand which means that it clobbers
253 // a large set of registers. It is possible to use the register mask to
254 // prune the available copies, but treat it like a basic block boundary for
256 if (RegMaskOpNum >= 0) {
257 // Erase any MaybeDeadCopies whose destination register is clobbered.
258 const MachineOperand &MaskMO = MI->getOperand(RegMaskOpNum);
259 for (SmallSetVector<MachineInstr*, 8>::iterator
260 DI = MaybeDeadCopies.begin(), DE = MaybeDeadCopies.end();
262 unsigned Reg = (*DI)->getOperand(0).getReg();
263 if (MRI->isReserved(Reg) || !MaskMO.clobbersPhysReg(Reg))
265 (*DI)->eraseFromParent();
270 // Clear all data structures as if we were beginning a new basic block.
271 MaybeDeadCopies.clear();
272 AvailCopyMap.clear();
278 for (unsigned i = 0, e = Defs.size(); i != e; ++i) {
279 unsigned Reg = Defs[i];
281 // No longer defined by a copy.
282 for (MCRegAliasIterator AI(Reg, TRI, true); AI.isValid(); ++AI) {
284 AvailCopyMap.erase(*AI);
287 // If 'Reg' is previously source of a copy, it is no longer available for
289 SourceNoLongerAvailable(Reg, SrcMap, AvailCopyMap);
293 // If MBB doesn't have successors, delete the copies whose defs are not used.
294 // If MBB does have successors, then conservative assume the defs are live-out
295 // since we don't want to trust live-in lists.
296 if (MBB.succ_empty()) {
297 for (SmallSetVector<MachineInstr*, 8>::iterator
298 DI = MaybeDeadCopies.begin(), DE = MaybeDeadCopies.end();
300 if (!MRI->isReserved((*DI)->getOperand(0).getReg())) {
301 (*DI)->eraseFromParent();
311 bool MachineCopyPropagation::runOnMachineFunction(MachineFunction &MF) {
312 bool Changed = false;
314 TRI = MF.getTarget().getRegisterInfo();
315 MRI = &MF.getRegInfo();
317 for (MachineFunction::iterator I = MF.begin(), E = MF.end(); I != E; ++I)
318 Changed |= CopyPropagateBlock(*I);