blob: 6886a65e4beffd8f58335f0bce87f440d3fa197c [file] [log] [blame]
Preston Gurd8b7ab4b2013-04-25 20:29:37 +00001//===-- X86FixupLEAs.cpp - use or replace LEA instructions -----------===//
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 file defines the pass which will find instructions which
11// can be re-written as LEA instructions in order to reduce pipeline
12// delays for some models of the Intel Atom family.
13//
14//===----------------------------------------------------------------------===//
15
Preston Gurd8b7ab4b2013-04-25 20:29:37 +000016#include "X86.h"
17#include "X86InstrInfo.h"
18#include "X86Subtarget.h"
19#include "llvm/ADT/Statistic.h"
20#include "llvm/CodeGen/LiveVariables.h"
21#include "llvm/CodeGen/MachineFunctionPass.h"
22#include "llvm/CodeGen/MachineInstrBuilder.h"
23#include "llvm/CodeGen/MachineRegisterInfo.h"
24#include "llvm/CodeGen/Passes.h"
25#include "llvm/Support/Debug.h"
26#include "llvm/Support/raw_ostream.h"
27#include "llvm/Target/TargetInstrInfo.h"
28using namespace llvm;
29
Chandler Carruth84e68b22014-04-22 02:41:26 +000030#define DEBUG_TYPE "x86-fixup-LEAs"
31
Preston Gurd8b7ab4b2013-04-25 20:29:37 +000032STATISTIC(NumLEAs, "Number of LEA instructions created");
33
34namespace {
35 class FixupLEAPass : public MachineFunctionPass {
36 enum RegUsageState { RU_NotUsed, RU_Write, RU_Read };
37 static char ID;
Preston Gurd128920d2013-04-25 21:31:33 +000038 /// \brief Loop over all of the instructions in the basic block
39 /// replacing applicable instructions with LEA instructions,
40 /// where appropriate.
Preston Gurd8b7ab4b2013-04-25 20:29:37 +000041 bool processBasicBlock(MachineFunction &MF, MachineFunction::iterator MFI);
42
Craig Topper2d9361e2014-03-09 07:44:38 +000043 const char *getPassName() const override { return "X86 Atom LEA Fixup";}
Preston Gurd128920d2013-04-25 21:31:33 +000044
45 /// \brief Given a machine register, look for the instruction
46 /// which writes it in the current basic block. If found,
47 /// try to replace it with an equivalent LEA instruction.
48 /// If replacement succeeds, then also process the the newly created
49 /// instruction.
Preston Gurd8b7ab4b2013-04-25 20:29:37 +000050 void seekLEAFixup(MachineOperand& p, MachineBasicBlock::iterator& I,
51 MachineFunction::iterator MFI);
Preston Gurd128920d2013-04-25 21:31:33 +000052
53 /// \brief Given a memory access or LEA instruction
54 /// whose address mode uses a base and/or index register, look for
55 /// an opportunity to replace the instruction which sets the base or index
56 /// register with an equivalent LEA instruction.
Preston Gurd8b7ab4b2013-04-25 20:29:37 +000057 void processInstruction(MachineBasicBlock::iterator& I,
58 MachineFunction::iterator MFI);
Preston Gurd128920d2013-04-25 21:31:33 +000059
60 /// \brief Determine if an instruction references a machine register
61 /// and, if so, whether it reads or writes the register.
Preston Gurd8b7ab4b2013-04-25 20:29:37 +000062 RegUsageState usesRegister(MachineOperand& p,
63 MachineBasicBlock::iterator I);
Preston Gurd128920d2013-04-25 21:31:33 +000064
65 /// \brief Step backwards through a basic block, looking
66 /// for an instruction which writes a register within
67 /// a maximum of INSTR_DISTANCE_THRESHOLD instruction latency cycles.
Preston Gurd8b7ab4b2013-04-25 20:29:37 +000068 MachineBasicBlock::iterator searchBackwards(MachineOperand& p,
69 MachineBasicBlock::iterator& I,
70 MachineFunction::iterator MFI);
Preston Gurd128920d2013-04-25 21:31:33 +000071
72 /// \brief if an instruction can be converted to an
73 /// equivalent LEA, insert the new instruction into the basic block
74 /// and return a pointer to it. Otherwise, return zero.
Preston Gurd8b7ab4b2013-04-25 20:29:37 +000075 MachineInstr* postRAConvertToLEA(MachineFunction::iterator &MFI,
Preston Gurd128920d2013-04-25 21:31:33 +000076 MachineBasicBlock::iterator &MBBI) const;
Preston Gurd8b7ab4b2013-04-25 20:29:37 +000077
78 public:
79 FixupLEAPass() : MachineFunctionPass(ID) {}
80
Preston Gurd128920d2013-04-25 21:31:33 +000081 /// \brief Loop over all of the basic blocks,
82 /// replacing instructions by equivalent LEA instructions
83 /// if needed and when possible.
Craig Topper2d9361e2014-03-09 07:44:38 +000084 bool runOnMachineFunction(MachineFunction &MF) override;
Preston Gurd8b7ab4b2013-04-25 20:29:37 +000085
86 private:
87 MachineFunction *MF;
88 const TargetMachine *TM;
89 const TargetInstrInfo *TII; // Machine instruction info.
Preston Gurd8b7ab4b2013-04-25 20:29:37 +000090
91 };
92 char FixupLEAPass::ID = 0;
93}
94
Preston Gurd8b7ab4b2013-04-25 20:29:37 +000095MachineInstr *
96FixupLEAPass::postRAConvertToLEA(MachineFunction::iterator &MFI,
Preston Gurd128920d2013-04-25 21:31:33 +000097 MachineBasicBlock::iterator &MBBI) const {
Preston Gurd8b7ab4b2013-04-25 20:29:37 +000098 MachineInstr* MI = MBBI;
99 MachineInstr* NewMI;
100 switch (MI->getOpcode()) {
101 case X86::MOV32rr:
102 case X86::MOV64rr: {
103 const MachineOperand& Src = MI->getOperand(1);
104 const MachineOperand& Dest = MI->getOperand(0);
105 NewMI = BuildMI(*MF, MI->getDebugLoc(),
106 TII->get( MI->getOpcode() == X86::MOV32rr ? X86::LEA32r : X86::LEA64r))
107 .addOperand(Dest)
108 .addOperand(Src).addImm(1).addReg(0).addImm(0).addReg(0);
109 MFI->insert(MBBI, NewMI); // Insert the new inst
110 return NewMI;
111 }
112 case X86::ADD64ri32:
113 case X86::ADD64ri8:
114 case X86::ADD64ri32_DB:
115 case X86::ADD64ri8_DB:
116 case X86::ADD32ri:
117 case X86::ADD32ri8:
118 case X86::ADD32ri_DB:
119 case X86::ADD32ri8_DB:
120 case X86::ADD16ri:
121 case X86::ADD16ri8:
122 case X86::ADD16ri_DB:
123 case X86::ADD16ri8_DB:
124 if (!MI->getOperand(2).isImm()) {
125 // convertToThreeAddress will call getImm()
126 // which requires isImm() to be true
Craig Topper062a2ba2014-04-25 05:30:21 +0000127 return nullptr;
Preston Gurd8b7ab4b2013-04-25 20:29:37 +0000128 }
Preston Gurdf03a6e72013-09-30 23:51:22 +0000129 break;
Preston Gurdf0b62882013-09-30 23:18:42 +0000130 case X86::ADD16rr:
131 case X86::ADD16rr_DB:
132 if (MI->getOperand(1).getReg() != MI->getOperand(2).getReg()) {
133 // if src1 != src2, then convertToThreeAddress will
134 // need to create a Virtual register, which we cannot do
135 // after register allocation.
Craig Topper062a2ba2014-04-25 05:30:21 +0000136 return nullptr;
Preston Gurdf0b62882013-09-30 23:18:42 +0000137 }
Preston Gurd8b7ab4b2013-04-25 20:29:37 +0000138 }
Craig Topper062a2ba2014-04-25 05:30:21 +0000139 return TII->convertToThreeAddress(MFI, MBBI, nullptr);
Preston Gurd8b7ab4b2013-04-25 20:29:37 +0000140}
141
142FunctionPass *llvm::createX86FixupLEAs() {
143 return new FixupLEAPass();
144}
145
Preston Gurd8b7ab4b2013-04-25 20:29:37 +0000146bool FixupLEAPass::runOnMachineFunction(MachineFunction &Func) {
147 MF = &Func;
Preston Gurd8b7ab4b2013-04-25 20:29:37 +0000148 TM = &MF->getTarget();
Bill Wendling8f268402013-06-07 21:00:34 +0000149 TII = TM->getInstrInfo();
Preston Gurd8b7ab4b2013-04-25 20:29:37 +0000150
151 DEBUG(dbgs() << "Start X86FixupLEAs\n";);
152 // Process all basic blocks.
153 for (MachineFunction::iterator I = Func.begin(), E = Func.end(); I != E; ++I)
154 processBasicBlock(Func, I);
155 DEBUG(dbgs() << "End X86FixupLEAs\n";);
156
157 return true;
158}
159
Preston Gurd8b7ab4b2013-04-25 20:29:37 +0000160FixupLEAPass::RegUsageState FixupLEAPass::usesRegister(MachineOperand& p,
161 MachineBasicBlock::iterator I) {
162 RegUsageState RegUsage = RU_NotUsed;
163 MachineInstr* MI = I;
164
165 for (unsigned int i = 0; i < MI->getNumOperands(); ++i) {
166 MachineOperand& opnd = MI->getOperand(i);
167 if (opnd.isReg() && opnd.getReg() == p.getReg()){
168 if (opnd.isDef())
169 return RU_Write;
170 RegUsage = RU_Read;
171 }
172 }
173 return RegUsage;
174}
175
176/// getPreviousInstr - Given a reference to an instruction in a basic
177/// block, return a reference to the previous instruction in the block,
178/// wrapping around to the last instruction of the block if the block
179/// branches to itself.
180static inline bool getPreviousInstr(MachineBasicBlock::iterator& I,
181 MachineFunction::iterator MFI) {
182 if (I == MFI->begin()) {
183 if (MFI->isPredecessor(MFI)) {
184 I = --MFI->end();
185 return true;
186 }
187 else
188 return false;
189 }
190 --I;
191 return true;
192}
193
Preston Gurd8b7ab4b2013-04-25 20:29:37 +0000194MachineBasicBlock::iterator FixupLEAPass::searchBackwards(MachineOperand& p,
195 MachineBasicBlock::iterator& I,
196 MachineFunction::iterator MFI) {
197 int InstrDistance = 1;
198 MachineBasicBlock::iterator CurInst;
199 static const int INSTR_DISTANCE_THRESHOLD = 5;
200
201 CurInst = I;
202 bool Found;
203 Found = getPreviousInstr(CurInst, MFI);
204 while( Found && I != CurInst) {
205 if (CurInst->isCall() || CurInst->isInlineAsm())
206 break;
207 if (InstrDistance > INSTR_DISTANCE_THRESHOLD)
208 break; // too far back to make a difference
209 if (usesRegister(p, CurInst) == RU_Write){
210 return CurInst;
211 }
212 InstrDistance += TII->getInstrLatency(TM->getInstrItineraryData(), CurInst);
213 Found = getPreviousInstr(CurInst, MFI);
214 }
Craig Topper062a2ba2014-04-25 05:30:21 +0000215 return nullptr;
Preston Gurd8b7ab4b2013-04-25 20:29:37 +0000216}
217
Preston Gurd8b7ab4b2013-04-25 20:29:37 +0000218void FixupLEAPass::processInstruction(MachineBasicBlock::iterator& I,
219 MachineFunction::iterator MFI) {
220 // Process a load, store, or LEA instruction.
221 MachineInstr *MI = I;
222 int opcode = MI->getOpcode();
223 const MCInstrDesc& Desc = MI->getDesc();
224 int AddrOffset = X86II::getMemoryOperandNo(Desc.TSFlags, opcode);
225 if (AddrOffset >= 0) {
226 AddrOffset += X86II::getOperandBias(Desc);
227 MachineOperand& p = MI->getOperand(AddrOffset + X86::AddrBaseReg);
228 if (p.isReg() && p.getReg() != X86::ESP) {
229 seekLEAFixup(p, I, MFI);
230 }
231 MachineOperand& q = MI->getOperand(AddrOffset + X86::AddrIndexReg);
232 if (q.isReg() && q.getReg() != X86::ESP) {
233 seekLEAFixup(q, I, MFI);
234 }
235 }
236}
237
Preston Gurd8b7ab4b2013-04-25 20:29:37 +0000238void FixupLEAPass::seekLEAFixup(MachineOperand& p,
239 MachineBasicBlock::iterator& I,
240 MachineFunction::iterator MFI) {
241 MachineBasicBlock::iterator MBI = searchBackwards(p, I, MFI);
242 if (MBI) {
Preston Gurd128920d2013-04-25 21:31:33 +0000243 MachineInstr* NewMI = postRAConvertToLEA(MFI, MBI);
Preston Gurd8b7ab4b2013-04-25 20:29:37 +0000244 if (NewMI) {
245 ++NumLEAs;
246 DEBUG(dbgs() << "Candidate to replace:"; MBI->dump(););
247 // now to replace with an equivalent LEA...
248 DEBUG(dbgs() << "Replaced by: "; NewMI->dump(););
249 MFI->erase(MBI);
250 MachineBasicBlock::iterator J =
251 static_cast<MachineBasicBlock::iterator> (NewMI);
252 processInstruction(J, MFI);
253 }
254 }
255}
256
Preston Gurd8b7ab4b2013-04-25 20:29:37 +0000257bool FixupLEAPass::processBasicBlock(MachineFunction &MF,
258 MachineFunction::iterator MFI) {
259
260 for (MachineBasicBlock::iterator I = MFI->begin(); I != MFI->end(); ++I)
261 processInstruction(I, MFI);
262 return false;
263}