blob: 2717d4d5cefc9ca3a43b6661f1ecb1881e2b2751 [file] [log] [blame]
Bob Wilsonfe61fb12010-02-12 01:30:21 +00001//===-- OptimizePHIs.cpp - Optimize machine instruction PHIs --------------===//
2//
3// The LLVM Compiler Infrastructure
4//
5// This file is distributed under the University of Illinois Open Source
6// License. See LICENSE.TXT for details.
7//
8//===----------------------------------------------------------------------===//
9//
10// This pass optimizes machine instruction PHIs to take advantage of
11// opportunities created during DAG legalization.
12//
13//===----------------------------------------------------------------------===//
14
15#define DEBUG_TYPE "phi-opt"
16#include "llvm/CodeGen/Passes.h"
17#include "llvm/CodeGen/MachineFunctionPass.h"
18#include "llvm/CodeGen/MachineInstr.h"
19#include "llvm/CodeGen/MachineRegisterInfo.h"
20#include "llvm/Target/TargetInstrInfo.h"
21#include "llvm/Function.h"
Bob Wilsonbf9b2212010-02-13 00:31:44 +000022#include "llvm/ADT/SmallPtrSet.h"
Bob Wilsonfe61fb12010-02-12 01:30:21 +000023#include "llvm/ADT/Statistic.h"
24using namespace llvm;
25
26STATISTIC(NumPHICycles, "Number of PHI cycles replaced");
Bob Wilsonbf9b2212010-02-13 00:31:44 +000027STATISTIC(NumDeadPHICycles, "Number of dead PHI cycles");
Bob Wilsonfe61fb12010-02-12 01:30:21 +000028
29namespace {
30 class OptimizePHIs : public MachineFunctionPass {
31 MachineRegisterInfo *MRI;
32 const TargetInstrInfo *TII;
33
34 public:
35 static char ID; // Pass identification
36 OptimizePHIs() : MachineFunctionPass(&ID) {}
37
38 virtual bool runOnMachineFunction(MachineFunction &MF);
39
40 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
41 AU.setPreservesCFG();
42 MachineFunctionPass::getAnalysisUsage(AU);
43 }
44
45 private:
Bob Wilsonbf9b2212010-02-13 00:31:44 +000046 typedef SmallPtrSet<MachineInstr*, 16> InstrSet;
47 typedef SmallPtrSetIterator<MachineInstr*> InstrSetIterator;
48
49 bool IsSingleValuePHICycle(MachineInstr *MI, unsigned &SingleValReg,
50 InstrSet &PHIsInCycle);
51 bool IsDeadPHICycle(MachineInstr *MI, InstrSet &PHIsInCycle);
52 bool OptimizeBB(MachineBasicBlock &MBB);
Bob Wilsonfe61fb12010-02-12 01:30:21 +000053 };
54}
55
56char OptimizePHIs::ID = 0;
57static RegisterPass<OptimizePHIs>
58X("opt-phis", "Optimize machine instruction PHIs");
59
60FunctionPass *llvm::createOptimizePHIsPass() { return new OptimizePHIs(); }
61
62bool OptimizePHIs::runOnMachineFunction(MachineFunction &Fn) {
63 MRI = &Fn.getRegInfo();
64 TII = Fn.getTarget().getInstrInfo();
65
Bob Wilsonbf9b2212010-02-13 00:31:44 +000066 // Find dead PHI cycles and PHI cycles that can be replaced by a single
67 // value. InstCombine does these optimizations, but DAG legalization may
68 // introduce new opportunities, e.g., when i64 values are split up for
69 // 32-bit targets.
Bob Wilsonfe61fb12010-02-12 01:30:21 +000070 bool Changed = false;
71 for (MachineFunction::iterator I = Fn.begin(), E = Fn.end(); I != E; ++I)
Bob Wilsonbf9b2212010-02-13 00:31:44 +000072 Changed |= OptimizeBB(*I);
Bob Wilsonfe61fb12010-02-12 01:30:21 +000073
74 return Changed;
75}
76
77/// IsSingleValuePHICycle - Check if MI is a PHI where all the source operands
78/// are copies of SingleValReg, possibly via copies through other PHIs. If
79/// SingleValReg is zero on entry, it is set to the register with the single
Bob Wilsonbf9b2212010-02-13 00:31:44 +000080/// non-copy value. PHIsInCycle is a set used to keep track of the PHIs that
Bob Wilsonfe61fb12010-02-12 01:30:21 +000081/// have been scanned.
Bob Wilsonbf9b2212010-02-13 00:31:44 +000082bool OptimizePHIs::IsSingleValuePHICycle(MachineInstr *MI,
Bob Wilsonfe61fb12010-02-12 01:30:21 +000083 unsigned &SingleValReg,
Bob Wilsonbf9b2212010-02-13 00:31:44 +000084 InstrSet &PHIsInCycle) {
Bob Wilsonfe61fb12010-02-12 01:30:21 +000085 assert(MI->isPHI() && "IsSingleValuePHICycle expects a PHI instruction");
86 unsigned DstReg = MI->getOperand(0).getReg();
87
88 // See if we already saw this register.
Bob Wilsonbf9b2212010-02-13 00:31:44 +000089 if (!PHIsInCycle.insert(MI))
Bob Wilsonfe61fb12010-02-12 01:30:21 +000090 return true;
91
92 // Don't scan crazily complex things.
Bob Wilsonbf9b2212010-02-13 00:31:44 +000093 if (PHIsInCycle.size() == 16)
Bob Wilsonfe61fb12010-02-12 01:30:21 +000094 return false;
95
96 // Scan the PHI operands.
97 for (unsigned i = 1; i != MI->getNumOperands(); i += 2) {
98 unsigned SrcReg = MI->getOperand(i).getReg();
99 if (SrcReg == DstReg)
100 continue;
Bob Wilsonbf9b2212010-02-13 00:31:44 +0000101 MachineInstr *SrcMI = MRI->getVRegDef(SrcReg);
Bob Wilsonfe61fb12010-02-12 01:30:21 +0000102
103 // Skip over register-to-register moves.
104 unsigned MvSrcReg, MvDstReg, SrcSubIdx, DstSubIdx;
105 if (SrcMI &&
106 TII->isMoveInstr(*SrcMI, MvSrcReg, MvDstReg, SrcSubIdx, DstSubIdx) &&
107 SrcSubIdx == 0 && DstSubIdx == 0 &&
108 TargetRegisterInfo::isVirtualRegister(MvSrcReg))
109 SrcMI = MRI->getVRegDef(MvSrcReg);
110 if (!SrcMI)
111 return false;
112
113 if (SrcMI->isPHI()) {
Bob Wilsonbf9b2212010-02-13 00:31:44 +0000114 if (!IsSingleValuePHICycle(SrcMI, SingleValReg, PHIsInCycle))
Bob Wilsonfe61fb12010-02-12 01:30:21 +0000115 return false;
116 } else {
117 // Fail if there is more than one non-phi/non-move register.
118 if (SingleValReg != 0)
119 return false;
120 SingleValReg = SrcReg;
121 }
122 }
123 return true;
124}
125
Bob Wilsonbf9b2212010-02-13 00:31:44 +0000126/// IsDeadPHICycle - Check if the register defined by a PHI is only used by
127/// other PHIs in a cycle.
128bool OptimizePHIs::IsDeadPHICycle(MachineInstr *MI, InstrSet &PHIsInCycle) {
129 assert(MI->isPHI() && "IsDeadPHICycle expects a PHI instruction");
130 unsigned DstReg = MI->getOperand(0).getReg();
131 assert(TargetRegisterInfo::isVirtualRegister(DstReg) &&
132 "PHI destination is not a virtual register");
133
134 // See if we already saw this register.
135 if (!PHIsInCycle.insert(MI))
136 return true;
137
138 // Don't scan crazily complex things.
139 if (PHIsInCycle.size() == 16)
140 return false;
141
142 for (MachineRegisterInfo::use_iterator I = MRI->use_begin(DstReg),
143 E = MRI->use_end(); I != E; ++I) {
144 MachineInstr *UseMI = &*I;
145 if (!UseMI->isPHI() || !IsDeadPHICycle(UseMI, PHIsInCycle))
146 return false;
147 }
148
149 return true;
150}
151
152/// OptimizeBB - Remove dead PHI cycles and PHI cycles that can be replaced by
153/// a single value.
154bool OptimizePHIs::OptimizeBB(MachineBasicBlock &MBB) {
Bob Wilsonfe61fb12010-02-12 01:30:21 +0000155 bool Changed = false;
156 for (MachineBasicBlock::iterator
157 MII = MBB.begin(), E = MBB.end(); MII != E; ) {
158 MachineInstr *MI = &*MII++;
159 if (!MI->isPHI())
160 break;
161
Bob Wilsonbf9b2212010-02-13 00:31:44 +0000162 // Check for single-value PHI cycles.
Bob Wilsonfe61fb12010-02-12 01:30:21 +0000163 unsigned SingleValReg = 0;
Bob Wilsonbf9b2212010-02-13 00:31:44 +0000164 InstrSet PHIsInCycle;
165 if (IsSingleValuePHICycle(MI, SingleValReg, PHIsInCycle) &&
Bob Wilsonfe61fb12010-02-12 01:30:21 +0000166 SingleValReg != 0) {
167 MRI->replaceRegWith(MI->getOperand(0).getReg(), SingleValReg);
168 MI->eraseFromParent();
169 ++NumPHICycles;
170 Changed = true;
Bob Wilsonbf9b2212010-02-13 00:31:44 +0000171 continue;
172 }
173
174 // Check for dead PHI cycles.
175 PHIsInCycle.clear();
176 if (IsDeadPHICycle(MI, PHIsInCycle)) {
177 for (InstrSetIterator PI = PHIsInCycle.begin(), PE = PHIsInCycle.end();
178 PI != PE; ++PI) {
179 MachineInstr *PhiMI = *PI;
180 if (&*MII == PhiMI)
181 ++MII;
182 PhiMI->eraseFromParent();
183 }
184 ++NumDeadPHICycles;
185 Changed = true;
Bob Wilsonfe61fb12010-02-12 01:30:21 +0000186 }
187 }
188 return Changed;
189}