1 //===-- PeepholeOptimizer.cpp - X86 Peephole Optimizer --------------------===//
3 // The LLVM Compiler Infrastructure
5 // This file was developed by the LLVM research group and is distributed under
6 // the University of Illinois Open Source License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file contains a peephole optimizer for the X86.
12 //===----------------------------------------------------------------------===//
15 #include "llvm/CodeGen/MachineFunctionPass.h"
16 #include "llvm/CodeGen/MachineInstrBuilder.h"
17 #include "llvm/Target/MRegisterInfo.h"
18 #include "llvm/Target/TargetInstrInfo.h"
19 #include "llvm/Target/TargetMachine.h"
20 #include "Support/Statistic.h"
21 #include "Support/STLExtras.h"
26 Statistic<> NumPHOpts("x86-peephole",
27 "Number of peephole optimization performed");
28 Statistic<> NumPHMoves("x86-peephole", "Number of peephole moves folded");
29 struct PH : public MachineFunctionPass {
30 virtual bool runOnMachineFunction(MachineFunction &MF);
32 bool PeepholeOptimize(MachineBasicBlock &MBB,
33 MachineBasicBlock::iterator &I);
35 virtual const char *getPassName() const { return "X86 Peephole Optimizer"; }
39 FunctionPass *llvm::createX86PeepholeOptimizerPass() { return new PH(); }
41 bool PH::runOnMachineFunction(MachineFunction &MF) {
44 for (MachineFunction::iterator BI = MF.begin(), E = MF.end(); BI != E; ++BI)
45 for (MachineBasicBlock::iterator I = BI->begin(); I != BI->end(); )
46 if (PeepholeOptimize(*BI, I)) {
56 bool PH::PeepholeOptimize(MachineBasicBlock &MBB,
57 MachineBasicBlock::iterator &I) {
58 assert(I != MBB.end());
59 MachineBasicBlock::iterator NextI = next(I);
62 MachineInstr *Next = (NextI != MBB.end()) ? &*NextI : (MachineInstr*)0;
64 switch (MI->getOpcode()) {
67 case X86::MOVrr32: // Destroy X = X copies...
68 if (MI->getOperand(0).getReg() == MI->getOperand(1).getReg()) {
74 // A large number of X86 instructions have forms which take an 8-bit
75 // immediate despite the fact that the operands are 16 or 32 bits. Because
76 // this can save three bytes of code size (and icache space), we want to
77 // shrink them if possible.
78 case X86::IMULrri16: case X86::IMULrri32:
79 assert(MI->getNumOperands() == 3 && "These should all have 3 operands!");
80 if (MI->getOperand(2).isImmediate()) {
81 int Val = MI->getOperand(2).getImmedValue();
82 // If the value is the same when signed extended from 8 bits...
83 if (Val == (signed int)(signed char)Val) {
85 switch (MI->getOpcode()) {
86 default: assert(0 && "Unknown opcode value!");
87 case X86::IMULrri16: Opcode = X86::IMULrri16b; break;
88 case X86::IMULrri32: Opcode = X86::IMULrri32b; break;
90 unsigned R0 = MI->getOperand(0).getReg();
91 unsigned R1 = MI->getOperand(1).getReg();
92 I = MBB.insert(MBB.erase(I),
93 BuildMI(Opcode, 2, R0).addReg(R1).addZImm((char)Val));
100 case X86::IMULrmi16: case X86::IMULrmi32:
101 assert(MI->getNumOperands() == 6 && "These should all have 6 operands!");
102 if (MI->getOperand(5).isImmediate()) {
103 int Val = MI->getOperand(5).getImmedValue();
104 // If the value is the same when signed extended from 8 bits...
105 if (Val == (signed int)(signed char)Val) {
107 switch (MI->getOpcode()) {
108 default: assert(0 && "Unknown opcode value!");
109 case X86::IMULrmi16: Opcode = X86::IMULrmi16b; break;
110 case X86::IMULrmi32: Opcode = X86::IMULrmi32b; break;
112 unsigned R0 = MI->getOperand(0).getReg();
113 unsigned R1 = MI->getOperand(1).getReg();
114 unsigned Scale = MI->getOperand(2).getImmedValue();
115 unsigned R2 = MI->getOperand(3).getReg();
116 unsigned Offset = MI->getOperand(4).getImmedValue();
117 I = MBB.insert(MBB.erase(I),
118 BuildMI(Opcode, 5, R0).addReg(R1).addZImm(Scale).
119 addReg(R2).addSImm(Offset).addZImm((char)Val));
126 case X86::ADDri16: case X86::ADDri32:
127 case X86::SUBri16: case X86::SUBri32:
128 case X86::ANDri16: case X86::ANDri32:
129 case X86::ORri16: case X86::ORri32:
130 case X86::XORri16: case X86::XORri32:
131 assert(MI->getNumOperands() == 2 && "These should all have 2 operands!");
132 if (MI->getOperand(1).isImmediate()) {
133 int Val = MI->getOperand(1).getImmedValue();
134 // If the value is the same when signed extended from 8 bits...
135 if (Val == (signed int)(signed char)Val) {
137 switch (MI->getOpcode()) {
138 default: assert(0 && "Unknown opcode value!");
139 case X86::ADDri16: Opcode = X86::ADDri16b; break;
140 case X86::ADDri32: Opcode = X86::ADDri32b; break;
141 case X86::SUBri16: Opcode = X86::SUBri16b; break;
142 case X86::SUBri32: Opcode = X86::SUBri32b; break;
143 case X86::ANDri16: Opcode = X86::ANDri16b; break;
144 case X86::ANDri32: Opcode = X86::ANDri32b; break;
145 case X86::ORri16: Opcode = X86::ORri16b; break;
146 case X86::ORri32: Opcode = X86::ORri32b; break;
147 case X86::XORri16: Opcode = X86::XORri16b; break;
148 case X86::XORri32: Opcode = X86::XORri32b; break;
150 unsigned R0 = MI->getOperand(0).getReg();
151 I = MBB.insert(MBB.erase(I),
152 BuildMI(Opcode, 1, R0, MachineOperand::UseAndDef)
153 .addZImm((char)Val));
160 case X86::ADDmi16: case X86::ADDmi32:
161 case X86::SUBmi16: case X86::SUBmi32:
162 case X86::ANDmi16: case X86::ANDmi32:
163 case X86::ORmi16: case X86::ORmi32:
164 case X86::XORmi16: case X86::XORmi32:
165 assert(MI->getNumOperands() == 5 && "These should all have 5 operands!");
166 if (MI->getOperand(4).isImmediate()) {
167 int Val = MI->getOperand(4).getImmedValue();
168 // If the value is the same when signed extended from 8 bits...
169 if (Val == (signed int)(signed char)Val) {
171 switch (MI->getOpcode()) {
172 default: assert(0 && "Unknown opcode value!");
173 case X86::ADDmi16: Opcode = X86::ADDmi16b; break;
174 case X86::ADDmi32: Opcode = X86::ADDmi32b; break;
175 case X86::SUBmi16: Opcode = X86::SUBmi16b; break;
176 case X86::SUBmi32: Opcode = X86::SUBmi32b; break;
177 case X86::ANDmi16: Opcode = X86::ANDmi16b; break;
178 case X86::ANDmi32: Opcode = X86::ANDmi32b; break;
179 case X86::ORmi16: Opcode = X86::ORmi16b; break;
180 case X86::ORmi32: Opcode = X86::ORmi32b; break;
181 case X86::XORmi16: Opcode = X86::XORmi16b; break;
182 case X86::XORmi32: Opcode = X86::XORmi32b; break;
184 unsigned R0 = MI->getOperand(0).getReg();
185 unsigned Scale = MI->getOperand(1).getImmedValue();
186 unsigned R1 = MI->getOperand(2).getReg();
187 unsigned Offset = MI->getOperand(3).getImmedValue();
188 I = MBB.insert(MBB.erase(I),
189 BuildMI(Opcode, 5).addReg(R0).addZImm(Scale).
190 addReg(R1).addSImm(Offset).addZImm((char)Val));
197 case X86::MOVri32: Size++;
198 case X86::MOVri16: Size++;
200 // FIXME: We can only do this transformation if we know that flags are not
201 // used here, because XOR clobbers the flags!
202 if (MI->getOperand(1).isImmediate()) { // avoid mov EAX, <value>
203 int Val = MI->getOperand(1).getImmedValue();
204 if (Val == 0) { // mov EAX, 0 -> xor EAX, EAX
205 static const unsigned Opcode[] ={X86::XORrr8,X86::XORrr16,X86::XORrr32};
206 unsigned Reg = MI->getOperand(0).getReg();
207 I = MBB.insert(MBB.erase(I),
208 BuildMI(Opcode[Size], 2, Reg).addReg(Reg).addReg(Reg));
210 } else if (Val == -1) { // mov EAX, -1 -> or EAX, -1
211 // TODO: 'or Reg, -1' has a smaller encoding than 'mov Reg, -1'
216 case X86::BSWAPr32: // Change bswap EAX, bswap EAX into nothing
217 if (Next->getOpcode() == X86::BSWAPr32 &&
218 MI->getOperand(0).getReg() == Next->getOperand(0).getReg()) {
219 I = MBB.erase(MBB.erase(I));
229 class UseDefChains : public MachineFunctionPass {
230 std::vector<MachineInstr*> DefiningInst;
232 // getDefinition - Return the machine instruction that defines the specified
233 // SSA virtual register.
234 MachineInstr *getDefinition(unsigned Reg) {
235 assert(MRegisterInfo::isVirtualRegister(Reg) &&
236 "use-def chains only exist for SSA registers!");
237 assert(Reg - MRegisterInfo::FirstVirtualRegister < DefiningInst.size() &&
238 "Unknown register number!");
239 assert(DefiningInst[Reg-MRegisterInfo::FirstVirtualRegister] &&
240 "Unknown register number!");
241 return DefiningInst[Reg-MRegisterInfo::FirstVirtualRegister];
244 // setDefinition - Update the use-def chains to indicate that MI defines
246 void setDefinition(unsigned Reg, MachineInstr *MI) {
247 if (Reg-MRegisterInfo::FirstVirtualRegister >= DefiningInst.size())
248 DefiningInst.resize(Reg-MRegisterInfo::FirstVirtualRegister+1);
249 DefiningInst[Reg-MRegisterInfo::FirstVirtualRegister] = MI;
252 // removeDefinition - Update the use-def chains to forget about Reg
254 void removeDefinition(unsigned Reg) {
255 assert(getDefinition(Reg)); // Check validity
256 DefiningInst[Reg-MRegisterInfo::FirstVirtualRegister] = 0;
259 virtual bool runOnMachineFunction(MachineFunction &MF) {
260 for (MachineFunction::iterator BI = MF.begin(), E = MF.end(); BI!=E; ++BI)
261 for (MachineBasicBlock::iterator I = BI->begin(); I != BI->end(); ++I) {
262 for (unsigned i = 0, e = I->getNumOperands(); i != e; ++i) {
263 MachineOperand &MO = I->getOperand(i);
264 if (MO.isRegister() && MO.isDef() && !MO.isUse() &&
265 MRegisterInfo::isVirtualRegister(MO.getReg()))
266 setDefinition(MO.getReg(), I);
272 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
273 AU.setPreservesAll();
274 MachineFunctionPass::getAnalysisUsage(AU);
277 virtual void releaseMemory() {
278 std::vector<MachineInstr*>().swap(DefiningInst);
282 RegisterAnalysis<UseDefChains> X("use-def-chains",
283 "use-def chain construction for machine code");
288 Statistic<> NumSSAPHOpts("x86-ssa-peephole",
289 "Number of SSA peephole optimization performed");
291 /// SSAPH - This pass is an X86-specific, SSA-based, peephole optimizer. This
292 /// pass is really a bad idea: a better instruction selector should completely
293 /// supersume it. However, that will take some time to develop, and the
294 /// simple things this can do are important now.
295 class SSAPH : public MachineFunctionPass {
298 virtual bool runOnMachineFunction(MachineFunction &MF);
300 bool PeepholeOptimize(MachineBasicBlock &MBB,
301 MachineBasicBlock::iterator &I);
303 virtual const char *getPassName() const {
304 return "X86 SSA-based Peephole Optimizer";
307 /// Propagate - Set MI[DestOpNo] = Src[SrcOpNo], optionally change the
308 /// opcode of the instruction, then return true.
309 bool Propagate(MachineInstr *MI, unsigned DestOpNo,
310 MachineInstr *Src, unsigned SrcOpNo, unsigned NewOpcode = 0){
311 MI->getOperand(DestOpNo) = Src->getOperand(SrcOpNo);
312 if (NewOpcode) MI->setOpcode(NewOpcode);
316 /// OptimizeAddress - If we can fold the addressing arithmetic for this
317 /// memory instruction into the instruction itself, do so and return true.
318 bool OptimizeAddress(MachineInstr *MI, unsigned OpNo);
320 /// getDefininingInst - If the specified operand is a read of an SSA
321 /// register, return the machine instruction defining it, otherwise, return
323 MachineInstr *getDefiningInst(MachineOperand &MO) {
324 if (MO.isDef() || !MO.isRegister() ||
325 !MRegisterInfo::isVirtualRegister(MO.getReg())) return 0;
326 return UDC->getDefinition(MO.getReg());
329 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
330 AU.addRequired<UseDefChains>();
331 AU.addPreserved<UseDefChains>();
332 MachineFunctionPass::getAnalysisUsage(AU);
337 FunctionPass *llvm::createX86SSAPeepholeOptimizerPass() { return new SSAPH(); }
339 bool SSAPH::runOnMachineFunction(MachineFunction &MF) {
340 bool Changed = false;
343 UDC = &getAnalysis<UseDefChains>();
346 LocalChanged = false;
348 for (MachineFunction::iterator BI = MF.begin(), E = MF.end(); BI != E; ++BI)
349 for (MachineBasicBlock::iterator I = BI->begin(); I != BI->end(); )
350 if (PeepholeOptimize(*BI, I)) {
355 Changed |= LocalChanged;
356 } while (LocalChanged);
361 static bool isValidScaleAmount(unsigned Scale) {
362 return Scale == 1 || Scale == 2 || Scale == 4 || Scale == 8;
365 /// OptimizeAddress - If we can fold the addressing arithmetic for this
366 /// memory instruction into the instruction itself, do so and return true.
367 bool SSAPH::OptimizeAddress(MachineInstr *MI, unsigned OpNo) {
368 MachineOperand &BaseRegOp = MI->getOperand(OpNo+0);
369 MachineOperand &ScaleOp = MI->getOperand(OpNo+1);
370 MachineOperand &IndexRegOp = MI->getOperand(OpNo+2);
371 MachineOperand &DisplacementOp = MI->getOperand(OpNo+3);
373 unsigned BaseReg = BaseRegOp.hasAllocatedReg() ? BaseRegOp.getReg() : 0;
374 unsigned Scale = ScaleOp.getImmedValue();
375 unsigned IndexReg = IndexRegOp.hasAllocatedReg() ? IndexRegOp.getReg() : 0;
377 bool Changed = false;
379 // If the base register is unset, and the index register is set with a scale
380 // of 1, move it to be the base register.
381 if (BaseRegOp.hasAllocatedReg() && BaseReg == 0 &&
382 Scale == 1 && IndexReg != 0) {
383 BaseRegOp.setReg(IndexReg);
384 IndexRegOp.setReg(0);
388 // Attempt to fold instructions used by the base register into the instruction
389 if (MachineInstr *DefInst = getDefiningInst(BaseRegOp)) {
390 switch (DefInst->getOpcode()) {
392 // If there is no displacement set for this instruction set one now.
393 // FIXME: If we can fold two immediates together, we should do so!
394 if (DisplacementOp.isImmediate() && !DisplacementOp.getImmedValue()) {
395 if (DefInst->getOperand(1).isImmediate()) {
397 return Propagate(MI, OpNo+3, DefInst, 1);
403 // If the source is a register-register add, and we do not yet have an
404 // index register, fold the add into the memory address.
406 BaseRegOp = DefInst->getOperand(1);
407 IndexRegOp = DefInst->getOperand(2);
408 ScaleOp.setImmedValue(1);
414 // If this shift could be folded into the index portion of the address if
415 // it were the index register, move it to the index register operand now,
416 // so it will be folded in below.
417 if ((Scale == 1 || (IndexReg == 0 && IndexRegOp.hasAllocatedReg())) &&
418 DefInst->getOperand(2).getImmedValue() < 4) {
419 std::swap(BaseRegOp, IndexRegOp);
420 ScaleOp.setImmedValue(1); Scale = 1;
421 std::swap(IndexReg, BaseReg);
428 // Attempt to fold instructions used by the index into the instruction
429 if (MachineInstr *DefInst = getDefiningInst(IndexRegOp)) {
430 switch (DefInst->getOpcode()) {
432 // Figure out what the resulting scale would be if we folded this shift.
433 unsigned ResScale = Scale * (1 << DefInst->getOperand(2).getImmedValue());
434 if (isValidScaleAmount(ResScale)) {
435 IndexRegOp = DefInst->getOperand(1);
436 ScaleOp.setImmedValue(ResScale);
447 bool SSAPH::PeepholeOptimize(MachineBasicBlock &MBB,
448 MachineBasicBlock::iterator &I) {
449 MachineBasicBlock::iterator NextI = next(I);
451 MachineInstr *MI = I;
452 MachineInstr *Next = (NextI != MBB.end()) ? &*NextI : (MachineInstr*)0;
454 bool Changed = false;
456 const TargetInstrInfo &TII = MBB.getParent()->getTarget().getInstrInfo();
458 // Scan the operands of this instruction. If any operands are
459 // register-register copies, replace the operand with the source.
460 for (unsigned i = 0, e = MI->getNumOperands(); i != e; ++i)
461 // Is this an SSA register use?
462 if (MachineInstr *DefInst = getDefiningInst(MI->getOperand(i))) {
463 // If the operand is a vreg-vreg copy, it is always safe to replace the
464 // source value with the input operand.
465 unsigned Source, Dest;
466 if (TII.isMoveInstr(*DefInst, Source, Dest)) {
467 // Don't propagate physical registers into any instructions.
468 if (DefInst->getOperand(1).isRegister() &&
469 MRegisterInfo::isVirtualRegister(Source)) {
470 MI->getOperand(i).setReg(Source);
478 // Perform instruction specific optimizations.
479 switch (MI->getOpcode()) {
481 // Register to memory stores. Format: <base,scale,indexreg,immdisp>, srcreg
482 case X86::MOVmr32: case X86::MOVmr16: case X86::MOVmr8:
483 case X86::MOVmi32: case X86::MOVmi16: case X86::MOVmi8:
484 // Check to see if we can fold the source instruction into this one...
485 if (MachineInstr *SrcInst = getDefiningInst(MI->getOperand(4))) {
486 switch (SrcInst->getOpcode()) {
487 // Fold the immediate value into the store, if possible.
488 case X86::MOVri8: return Propagate(MI, 4, SrcInst, 1, X86::MOVmi8);
489 case X86::MOVri16: return Propagate(MI, 4, SrcInst, 1, X86::MOVmi16);
490 case X86::MOVri32: return Propagate(MI, 4, SrcInst, 1, X86::MOVmi32);
495 // If we can optimize the addressing expression, do so now.
496 if (OptimizeAddress(MI, 0))
503 // If we can optimize the addressing expression, do so now.
504 if (OptimizeAddress(MI, 1))