blob: 6430e54a59cd83b350dd8ffde656784a7a0f43ac [file] [log] [blame]
Eugene Zelenko32a40562017-09-11 23:00:48 +00001//===- OptimizePHIs.cpp - Optimize machine instruction PHIs ---------------===//
Bob Wilson0827e042010-02-12 01:30:21 +00002//
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
Chandler Carruthed0881b2012-12-03 16:50:05 +000015#include "llvm/ADT/SmallPtrSet.h"
16#include "llvm/ADT/Statistic.h"
Eugene Zelenko32a40562017-09-11 23:00:48 +000017#include "llvm/CodeGen/MachineBasicBlock.h"
18#include "llvm/CodeGen/MachineFunction.h"
Bob Wilson0827e042010-02-12 01:30:21 +000019#include "llvm/CodeGen/MachineFunctionPass.h"
20#include "llvm/CodeGen/MachineInstr.h"
Eugene Zelenko32a40562017-09-11 23:00:48 +000021#include "llvm/CodeGen/MachineOperand.h"
Bob Wilson0827e042010-02-12 01:30:21 +000022#include "llvm/CodeGen/MachineRegisterInfo.h"
Eugene Zelenko32a40562017-09-11 23:00:48 +000023#include "llvm/Pass.h"
Chandler Carruthed0881b2012-12-03 16:50:05 +000024#include "llvm/Target/TargetInstrInfo.h"
Eugene Zelenko32a40562017-09-11 23:00:48 +000025#include "llvm/Target/TargetRegisterInfo.h"
Eric Christopherd9134482014-08-04 21:25:23 +000026#include "llvm/Target/TargetSubtargetInfo.h"
Eugene Zelenko32a40562017-09-11 23:00:48 +000027#include <cassert>
28
Bob Wilson0827e042010-02-12 01:30:21 +000029using namespace llvm;
30
Matthias Braun1527baa2017-05-25 21:26:32 +000031#define DEBUG_TYPE "opt-phis"
Chandler Carruth1b9dde02014-04-22 02:02:50 +000032
Bob Wilson0827e042010-02-12 01:30:21 +000033STATISTIC(NumPHICycles, "Number of PHI cycles replaced");
Bob Wilson01abf8f2010-02-13 00:31:44 +000034STATISTIC(NumDeadPHICycles, "Number of dead PHI cycles");
Bob Wilson0827e042010-02-12 01:30:21 +000035
36namespace {
Eugene Zelenko32a40562017-09-11 23:00:48 +000037
Bob Wilson0827e042010-02-12 01:30:21 +000038 class OptimizePHIs : public MachineFunctionPass {
39 MachineRegisterInfo *MRI;
40 const TargetInstrInfo *TII;
41
42 public:
43 static char ID; // Pass identification
Eugene Zelenko32a40562017-09-11 23:00:48 +000044
Owen Anderson6c18d1a2010-10-19 17:21:58 +000045 OptimizePHIs() : MachineFunctionPass(ID) {
46 initializeOptimizePHIsPass(*PassRegistry::getPassRegistry());
47 }
Bob Wilson0827e042010-02-12 01:30:21 +000048
Craig Topper4584cd52014-03-07 09:26:03 +000049 bool runOnMachineFunction(MachineFunction &MF) override;
Bob Wilson0827e042010-02-12 01:30:21 +000050
Craig Topper4584cd52014-03-07 09:26:03 +000051 void getAnalysisUsage(AnalysisUsage &AU) const override {
Bob Wilson0827e042010-02-12 01:30:21 +000052 AU.setPreservesCFG();
53 MachineFunctionPass::getAnalysisUsage(AU);
54 }
55
56 private:
Eugene Zelenko32a40562017-09-11 23:00:48 +000057 using InstrSet = SmallPtrSet<MachineInstr *, 16>;
58 using InstrSetIterator = SmallPtrSetIterator<MachineInstr *>;
Bob Wilson01abf8f2010-02-13 00:31:44 +000059
60 bool IsSingleValuePHICycle(MachineInstr *MI, unsigned &SingleValReg,
61 InstrSet &PHIsInCycle);
62 bool IsDeadPHICycle(MachineInstr *MI, InstrSet &PHIsInCycle);
63 bool OptimizeBB(MachineBasicBlock &MBB);
Bob Wilson0827e042010-02-12 01:30:21 +000064 };
Eugene Zelenko32a40562017-09-11 23:00:48 +000065
66} // end anonymous namespace
Bob Wilson0827e042010-02-12 01:30:21 +000067
68char OptimizePHIs::ID = 0;
Eugene Zelenko32a40562017-09-11 23:00:48 +000069
Andrew Trick1fa5bcb2012-02-08 21:23:13 +000070char &llvm::OptimizePHIsID = OptimizePHIs::ID;
Eugene Zelenko32a40562017-09-11 23:00:48 +000071
Matthias Braun1527baa2017-05-25 21:26:32 +000072INITIALIZE_PASS(OptimizePHIs, DEBUG_TYPE,
Owen Andersondf7a4f22010-10-07 22:25:06 +000073 "Optimize machine instruction PHIs", false, false)
Bob Wilson0827e042010-02-12 01:30:21 +000074
Bob Wilson0827e042010-02-12 01:30:21 +000075bool OptimizePHIs::runOnMachineFunction(MachineFunction &Fn) {
Andrew Kayloraa641a52016-04-22 22:06:11 +000076 if (skipFunction(*Fn.getFunction()))
Paul Robinson7c99ec52014-03-31 17:43:35 +000077 return false;
78
Bob Wilson0827e042010-02-12 01:30:21 +000079 MRI = &Fn.getRegInfo();
Eric Christopherfc6de422014-08-05 02:39:49 +000080 TII = Fn.getSubtarget().getInstrInfo();
Bob Wilson0827e042010-02-12 01:30:21 +000081
Bob Wilson01abf8f2010-02-13 00:31:44 +000082 // Find dead PHI cycles and PHI cycles that can be replaced by a single
83 // value. InstCombine does these optimizations, but DAG legalization may
84 // introduce new opportunities, e.g., when i64 values are split up for
85 // 32-bit targets.
Bob Wilson0827e042010-02-12 01:30:21 +000086 bool Changed = false;
87 for (MachineFunction::iterator I = Fn.begin(), E = Fn.end(); I != E; ++I)
Bob Wilson01abf8f2010-02-13 00:31:44 +000088 Changed |= OptimizeBB(*I);
Bob Wilson0827e042010-02-12 01:30:21 +000089
90 return Changed;
91}
92
93/// IsSingleValuePHICycle - Check if MI is a PHI where all the source operands
94/// are copies of SingleValReg, possibly via copies through other PHIs. If
95/// SingleValReg is zero on entry, it is set to the register with the single
Bob Wilson01abf8f2010-02-13 00:31:44 +000096/// non-copy value. PHIsInCycle is a set used to keep track of the PHIs that
Bob Wilson0827e042010-02-12 01:30:21 +000097/// have been scanned.
Bob Wilson01abf8f2010-02-13 00:31:44 +000098bool OptimizePHIs::IsSingleValuePHICycle(MachineInstr *MI,
Bob Wilson0827e042010-02-12 01:30:21 +000099 unsigned &SingleValReg,
Bob Wilson01abf8f2010-02-13 00:31:44 +0000100 InstrSet &PHIsInCycle) {
Bob Wilson0827e042010-02-12 01:30:21 +0000101 assert(MI->isPHI() && "IsSingleValuePHICycle expects a PHI instruction");
102 unsigned DstReg = MI->getOperand(0).getReg();
103
104 // See if we already saw this register.
David Blaikie70573dc2014-11-19 07:49:26 +0000105 if (!PHIsInCycle.insert(MI).second)
Bob Wilson0827e042010-02-12 01:30:21 +0000106 return true;
107
108 // Don't scan crazily complex things.
Bob Wilson01abf8f2010-02-13 00:31:44 +0000109 if (PHIsInCycle.size() == 16)
Bob Wilson0827e042010-02-12 01:30:21 +0000110 return false;
111
112 // Scan the PHI operands.
113 for (unsigned i = 1; i != MI->getNumOperands(); i += 2) {
114 unsigned SrcReg = MI->getOperand(i).getReg();
115 if (SrcReg == DstReg)
116 continue;
Bob Wilson01abf8f2010-02-13 00:31:44 +0000117 MachineInstr *SrcMI = MRI->getVRegDef(SrcReg);
Bob Wilson0827e042010-02-12 01:30:21 +0000118
119 // Skip over register-to-register moves.
Jakob Stoklund Olesen37c42a32010-07-16 04:45:42 +0000120 if (SrcMI && SrcMI->isCopy() &&
121 !SrcMI->getOperand(0).getSubReg() &&
122 !SrcMI->getOperand(1).getSubReg() &&
123 TargetRegisterInfo::isVirtualRegister(SrcMI->getOperand(1).getReg()))
Jakob Stoklund Olesen4c82a9e2010-07-03 00:04:37 +0000124 SrcMI = MRI->getVRegDef(SrcMI->getOperand(1).getReg());
Bob Wilson0827e042010-02-12 01:30:21 +0000125 if (!SrcMI)
126 return false;
127
128 if (SrcMI->isPHI()) {
Bob Wilson01abf8f2010-02-13 00:31:44 +0000129 if (!IsSingleValuePHICycle(SrcMI, SingleValReg, PHIsInCycle))
Bob Wilson0827e042010-02-12 01:30:21 +0000130 return false;
131 } else {
132 // Fail if there is more than one non-phi/non-move register.
133 if (SingleValReg != 0)
134 return false;
135 SingleValReg = SrcReg;
136 }
137 }
138 return true;
139}
140
Bob Wilson01abf8f2010-02-13 00:31:44 +0000141/// IsDeadPHICycle - Check if the register defined by a PHI is only used by
142/// other PHIs in a cycle.
143bool OptimizePHIs::IsDeadPHICycle(MachineInstr *MI, InstrSet &PHIsInCycle) {
144 assert(MI->isPHI() && "IsDeadPHICycle expects a PHI instruction");
145 unsigned DstReg = MI->getOperand(0).getReg();
146 assert(TargetRegisterInfo::isVirtualRegister(DstReg) &&
147 "PHI destination is not a virtual register");
148
149 // See if we already saw this register.
David Blaikie70573dc2014-11-19 07:49:26 +0000150 if (!PHIsInCycle.insert(MI).second)
Bob Wilson01abf8f2010-02-13 00:31:44 +0000151 return true;
152
153 // Don't scan crazily complex things.
154 if (PHIsInCycle.size() == 16)
155 return false;
156
Owen Andersonb36376e2014-03-17 19:36:09 +0000157 for (MachineInstr &UseMI : MRI->use_instructions(DstReg)) {
158 if (!UseMI.isPHI() || !IsDeadPHICycle(&UseMI, PHIsInCycle))
Bob Wilson01abf8f2010-02-13 00:31:44 +0000159 return false;
160 }
161
162 return true;
163}
164
165/// OptimizeBB - Remove dead PHI cycles and PHI cycles that can be replaced by
166/// a single value.
167bool OptimizePHIs::OptimizeBB(MachineBasicBlock &MBB) {
Bob Wilson0827e042010-02-12 01:30:21 +0000168 bool Changed = false;
169 for (MachineBasicBlock::iterator
170 MII = MBB.begin(), E = MBB.end(); MII != E; ) {
171 MachineInstr *MI = &*MII++;
172 if (!MI->isPHI())
173 break;
174
Bob Wilson01abf8f2010-02-13 00:31:44 +0000175 // Check for single-value PHI cycles.
Bob Wilson0827e042010-02-12 01:30:21 +0000176 unsigned SingleValReg = 0;
Bob Wilson01abf8f2010-02-13 00:31:44 +0000177 InstrSet PHIsInCycle;
178 if (IsSingleValuePHICycle(MI, SingleValReg, PHIsInCycle) &&
Bob Wilson0827e042010-02-12 01:30:21 +0000179 SingleValReg != 0) {
Cameron Zwarichd85bc102011-10-17 21:54:46 +0000180 unsigned OldReg = MI->getOperand(0).getReg();
181 if (!MRI->constrainRegClass(SingleValReg, MRI->getRegClass(OldReg)))
182 continue;
183
184 MRI->replaceRegWith(OldReg, SingleValReg);
Bob Wilson0827e042010-02-12 01:30:21 +0000185 MI->eraseFromParent();
186 ++NumPHICycles;
187 Changed = true;
Bob Wilson01abf8f2010-02-13 00:31:44 +0000188 continue;
189 }
190
191 // Check for dead PHI cycles.
192 PHIsInCycle.clear();
193 if (IsDeadPHICycle(MI, PHIsInCycle)) {
194 for (InstrSetIterator PI = PHIsInCycle.begin(), PE = PHIsInCycle.end();
195 PI != PE; ++PI) {
196 MachineInstr *PhiMI = *PI;
Duncan P. N. Exon Smith00ec93d2016-08-17 00:43:59 +0000197 if (MII == PhiMI)
Bob Wilson01abf8f2010-02-13 00:31:44 +0000198 ++MII;
199 PhiMI->eraseFromParent();
200 }
201 ++NumDeadPHICycles;
202 Changed = true;
Bob Wilson0827e042010-02-12 01:30:21 +0000203 }
204 }
205 return Changed;
206}