2002-11-17 21:03:35 +00:00
|
|
|
//===-- X86InstrBuilder.h - Functions to aid building x86 insts -*- C++ -*-===//
|
2005-04-21 23:38:14 +00:00
|
|
|
//
|
2003-10-21 15:17:13 +00:00
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
2007-12-29 20:36:04 +00:00
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
2005-04-21 23:38:14 +00:00
|
|
|
//
|
2003-10-21 15:17:13 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
2002-11-17 21:03:35 +00:00
|
|
|
//
|
|
|
|
// This file exposes functions that may be used with BuildMI from the
|
|
|
|
// MachineInstrBuilder.h file to handle X86'isms in a clean way.
|
|
|
|
//
|
|
|
|
// The BuildMem function may be used with the BuildMI function to add entire
|
|
|
|
// memory references in a single, typed, function call. X86 memory references
|
|
|
|
// can be very complex expressions (described in the README), so wrapping them
|
|
|
|
// up behind an easier to use interface makes sense. Descriptions of the
|
|
|
|
// functions are included below.
|
|
|
|
//
|
2002-12-13 09:28:50 +00:00
|
|
|
// For reference, the order of operands for memory references is:
|
|
|
|
// (Operand), Base, Scale, Index, Displacement.
|
|
|
|
//
|
2002-11-17 21:03:35 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2014-08-13 16:26:38 +00:00
|
|
|
#ifndef LLVM_LIB_TARGET_X86_X86INSTRBUILDER_H
|
|
|
|
#define LLVM_LIB_TARGET_X86_X86INSTRBUILDER_H
|
2002-11-17 21:03:35 +00:00
|
|
|
|
2008-12-03 18:11:40 +00:00
|
|
|
#include "llvm/CodeGen/MachineFrameInfo.h"
|
2002-11-17 21:03:35 +00:00
|
|
|
#include "llvm/CodeGen/MachineInstrBuilder.h"
|
2009-09-25 20:36:54 +00:00
|
|
|
#include "llvm/CodeGen/MachineMemOperand.h"
|
2002-11-17 21:03:35 +00:00
|
|
|
|
2003-11-11 22:41:34 +00:00
|
|
|
namespace llvm {
|
|
|
|
|
2004-08-30 00:13:26 +00:00
|
|
|
/// X86AddressMode - This struct holds a generalized full x86 address mode.
|
|
|
|
/// The base register can be a frame index, which will eventually be replaced
|
2004-10-15 04:43:20 +00:00
|
|
|
/// with BP or SP and Disp being offsetted accordingly. The displacement may
|
|
|
|
/// also include the offset of a global value.
|
2004-08-30 00:13:26 +00:00
|
|
|
struct X86AddressMode {
|
2005-01-17 23:25:45 +00:00
|
|
|
enum {
|
|
|
|
RegBase,
|
2006-05-24 17:04:05 +00:00
|
|
|
FrameIndexBase
|
2005-01-17 23:25:45 +00:00
|
|
|
} BaseType;
|
2005-04-21 23:38:14 +00:00
|
|
|
|
2005-01-17 23:25:45 +00:00
|
|
|
union {
|
|
|
|
unsigned Reg;
|
|
|
|
int FrameIndex;
|
|
|
|
} Base;
|
2005-04-21 23:38:14 +00:00
|
|
|
|
2005-01-17 23:25:45 +00:00
|
|
|
unsigned Scale;
|
|
|
|
unsigned IndexReg;
|
2009-09-15 18:27:02 +00:00
|
|
|
int Disp;
|
2010-04-15 01:51:59 +00:00
|
|
|
const GlobalValue *GV;
|
2009-07-01 03:27:19 +00:00
|
|
|
unsigned GVOpFlags;
|
2005-04-21 23:38:14 +00:00
|
|
|
|
2009-07-01 03:27:19 +00:00
|
|
|
X86AddressMode()
|
2014-04-28 04:05:08 +00:00
|
|
|
: BaseType(RegBase), Scale(1), IndexReg(0), Disp(0), GV(nullptr),
|
|
|
|
GVOpFlags(0) {
|
2005-01-17 23:25:45 +00:00
|
|
|
Base.Reg = 0;
|
|
|
|
}
|
2012-06-22 22:07:19 +00:00
|
|
|
|
|
|
|
|
implement rdar://6653118 - fastisel should fold loads where possible.
Since mem2reg isn't run at -O0, we get a ton of reloads from the stack,
for example, before, this code:
int foo(int x, int y, int z) {
return x+y+z;
}
used to compile into:
_foo: ## @foo
subq $12, %rsp
movl %edi, 8(%rsp)
movl %esi, 4(%rsp)
movl %edx, (%rsp)
movl 8(%rsp), %edx
movl 4(%rsp), %esi
addl %edx, %esi
movl (%rsp), %edx
addl %esi, %edx
movl %edx, %eax
addq $12, %rsp
ret
Now we produce:
_foo: ## @foo
subq $12, %rsp
movl %edi, 8(%rsp)
movl %esi, 4(%rsp)
movl %edx, (%rsp)
movl 8(%rsp), %edx
addl 4(%rsp), %edx ## Folded load
addl (%rsp), %edx ## Folded load
movl %edx, %eax
addq $12, %rsp
ret
Fewer instructions and less register use = faster compiles.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@113102 91177308-0d34-0410-b5e6-96231b3b80d8
2010-09-05 02:18:34 +00:00
|
|
|
void getFullAddress(SmallVectorImpl<MachineOperand> &MO) {
|
|
|
|
assert(Scale == 1 || Scale == 2 || Scale == 4 || Scale == 8);
|
2012-06-22 22:07:19 +00:00
|
|
|
|
implement rdar://6653118 - fastisel should fold loads where possible.
Since mem2reg isn't run at -O0, we get a ton of reloads from the stack,
for example, before, this code:
int foo(int x, int y, int z) {
return x+y+z;
}
used to compile into:
_foo: ## @foo
subq $12, %rsp
movl %edi, 8(%rsp)
movl %esi, 4(%rsp)
movl %edx, (%rsp)
movl 8(%rsp), %edx
movl 4(%rsp), %esi
addl %edx, %esi
movl (%rsp), %edx
addl %esi, %edx
movl %edx, %eax
addq $12, %rsp
ret
Now we produce:
_foo: ## @foo
subq $12, %rsp
movl %edi, 8(%rsp)
movl %esi, 4(%rsp)
movl %edx, (%rsp)
movl 8(%rsp), %edx
addl 4(%rsp), %edx ## Folded load
addl (%rsp), %edx ## Folded load
movl %edx, %eax
addq $12, %rsp
ret
Fewer instructions and less register use = faster compiles.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@113102 91177308-0d34-0410-b5e6-96231b3b80d8
2010-09-05 02:18:34 +00:00
|
|
|
if (BaseType == X86AddressMode::RegBase)
|
|
|
|
MO.push_back(MachineOperand::CreateReg(Base.Reg, false, false,
|
|
|
|
false, false, false, 0, false));
|
|
|
|
else {
|
|
|
|
assert(BaseType == X86AddressMode::FrameIndexBase);
|
|
|
|
MO.push_back(MachineOperand::CreateFI(Base.FrameIndex));
|
|
|
|
}
|
2012-06-22 22:07:19 +00:00
|
|
|
|
implement rdar://6653118 - fastisel should fold loads where possible.
Since mem2reg isn't run at -O0, we get a ton of reloads from the stack,
for example, before, this code:
int foo(int x, int y, int z) {
return x+y+z;
}
used to compile into:
_foo: ## @foo
subq $12, %rsp
movl %edi, 8(%rsp)
movl %esi, 4(%rsp)
movl %edx, (%rsp)
movl 8(%rsp), %edx
movl 4(%rsp), %esi
addl %edx, %esi
movl (%rsp), %edx
addl %esi, %edx
movl %edx, %eax
addq $12, %rsp
ret
Now we produce:
_foo: ## @foo
subq $12, %rsp
movl %edi, 8(%rsp)
movl %esi, 4(%rsp)
movl %edx, (%rsp)
movl 8(%rsp), %edx
addl 4(%rsp), %edx ## Folded load
addl (%rsp), %edx ## Folded load
movl %edx, %eax
addq $12, %rsp
ret
Fewer instructions and less register use = faster compiles.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@113102 91177308-0d34-0410-b5e6-96231b3b80d8
2010-09-05 02:18:34 +00:00
|
|
|
MO.push_back(MachineOperand::CreateImm(Scale));
|
|
|
|
MO.push_back(MachineOperand::CreateReg(IndexReg, false, false,
|
|
|
|
false, false, false, 0, false));
|
2012-06-22 22:07:19 +00:00
|
|
|
|
implement rdar://6653118 - fastisel should fold loads where possible.
Since mem2reg isn't run at -O0, we get a ton of reloads from the stack,
for example, before, this code:
int foo(int x, int y, int z) {
return x+y+z;
}
used to compile into:
_foo: ## @foo
subq $12, %rsp
movl %edi, 8(%rsp)
movl %esi, 4(%rsp)
movl %edx, (%rsp)
movl 8(%rsp), %edx
movl 4(%rsp), %esi
addl %edx, %esi
movl (%rsp), %edx
addl %esi, %edx
movl %edx, %eax
addq $12, %rsp
ret
Now we produce:
_foo: ## @foo
subq $12, %rsp
movl %edi, 8(%rsp)
movl %esi, 4(%rsp)
movl %edx, (%rsp)
movl 8(%rsp), %edx
addl 4(%rsp), %edx ## Folded load
addl (%rsp), %edx ## Folded load
movl %edx, %eax
addq $12, %rsp
ret
Fewer instructions and less register use = faster compiles.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@113102 91177308-0d34-0410-b5e6-96231b3b80d8
2010-09-05 02:18:34 +00:00
|
|
|
if (GV)
|
|
|
|
MO.push_back(MachineOperand::CreateGA(GV, Disp, GVOpFlags));
|
|
|
|
else
|
|
|
|
MO.push_back(MachineOperand::CreateImm(Disp));
|
2012-06-22 22:07:19 +00:00
|
|
|
|
implement rdar://6653118 - fastisel should fold loads where possible.
Since mem2reg isn't run at -O0, we get a ton of reloads from the stack,
for example, before, this code:
int foo(int x, int y, int z) {
return x+y+z;
}
used to compile into:
_foo: ## @foo
subq $12, %rsp
movl %edi, 8(%rsp)
movl %esi, 4(%rsp)
movl %edx, (%rsp)
movl 8(%rsp), %edx
movl 4(%rsp), %esi
addl %edx, %esi
movl (%rsp), %edx
addl %esi, %edx
movl %edx, %eax
addq $12, %rsp
ret
Now we produce:
_foo: ## @foo
subq $12, %rsp
movl %edi, 8(%rsp)
movl %esi, 4(%rsp)
movl %edx, (%rsp)
movl 8(%rsp), %edx
addl 4(%rsp), %edx ## Folded load
addl (%rsp), %edx ## Folded load
movl %edx, %eax
addq $12, %rsp
ret
Fewer instructions and less register use = faster compiles.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@113102 91177308-0d34-0410-b5e6-96231b3b80d8
2010-09-05 02:18:34 +00:00
|
|
|
MO.push_back(MachineOperand::CreateReg(0, false, false,
|
|
|
|
false, false, false, 0, false));
|
|
|
|
}
|
2004-08-30 00:13:26 +00:00
|
|
|
};
|
|
|
|
|
2002-11-17 21:03:35 +00:00
|
|
|
/// addDirectMem - This function is used to add a direct memory reference to the
|
2002-12-28 20:26:58 +00:00
|
|
|
/// current instruction -- that is, a dereference of an address in a register,
|
|
|
|
/// with no scale, index or displacement. An example is: DWORD PTR [EAX].
|
|
|
|
///
|
2009-07-16 14:03:08 +00:00
|
|
|
static inline const MachineInstrBuilder &
|
|
|
|
addDirectMem(const MachineInstrBuilder &MIB, unsigned Reg) {
|
2010-07-08 23:46:44 +00:00
|
|
|
// Because memory references are always represented with five
|
|
|
|
// values, this adds: Reg, 1, NoReg, 0, NoReg to the instruction.
|
|
|
|
return MIB.addReg(Reg).addImm(1).addReg(0).addImm(0).addReg(0);
|
2002-11-17 21:03:35 +00:00
|
|
|
}
|
|
|
|
|
2009-04-08 21:14:34 +00:00
|
|
|
|
2009-07-16 14:03:08 +00:00
|
|
|
static inline const MachineInstrBuilder &
|
|
|
|
addOffset(const MachineInstrBuilder &MIB, int Offset) {
|
2010-07-08 23:46:44 +00:00
|
|
|
return MIB.addImm(1).addReg(0).addImm(Offset).addReg(0);
|
2009-04-08 21:14:34 +00:00
|
|
|
}
|
2002-11-22 22:42:12 +00:00
|
|
|
|
2002-12-28 20:26:58 +00:00
|
|
|
/// addRegOffset - This function is used to add a memory reference of the form
|
|
|
|
/// [Reg + Offset], i.e., one with no scale or index, but with a
|
|
|
|
/// displacement. An example is: DWORD PTR [EAX + 4].
|
|
|
|
///
|
2009-07-16 14:03:08 +00:00
|
|
|
static inline const MachineInstrBuilder &
|
|
|
|
addRegOffset(const MachineInstrBuilder &MIB,
|
|
|
|
unsigned Reg, bool isKill, int Offset) {
|
2009-05-13 21:33:08 +00:00
|
|
|
return addOffset(MIB.addReg(Reg, getKillRegState(isKill)), Offset);
|
2009-04-08 21:14:34 +00:00
|
|
|
}
|
|
|
|
|
2005-01-02 02:38:18 +00:00
|
|
|
/// addRegReg - This function is used to add a memory reference of the form:
|
|
|
|
/// [Reg + Reg].
|
2009-07-16 14:03:08 +00:00
|
|
|
static inline const MachineInstrBuilder &addRegReg(const MachineInstrBuilder &MIB,
|
2008-07-03 09:09:37 +00:00
|
|
|
unsigned Reg1, bool isKill1,
|
|
|
|
unsigned Reg2, bool isKill2) {
|
2009-05-13 21:33:08 +00:00
|
|
|
return MIB.addReg(Reg1, getKillRegState(isKill1)).addImm(1)
|
2010-07-08 23:46:44 +00:00
|
|
|
.addReg(Reg2, getKillRegState(isKill2)).addImm(0).addReg(0);
|
2005-01-02 02:38:18 +00:00
|
|
|
}
|
|
|
|
|
2009-07-16 14:03:08 +00:00
|
|
|
static inline const MachineInstrBuilder &
|
2010-07-08 23:46:44 +00:00
|
|
|
addFullAddress(const MachineInstrBuilder &MIB,
|
|
|
|
const X86AddressMode &AM) {
|
|
|
|
assert(AM.Scale == 1 || AM.Scale == 2 || AM.Scale == 4 || AM.Scale == 8);
|
2012-06-22 22:07:19 +00:00
|
|
|
|
2004-08-30 00:13:26 +00:00
|
|
|
if (AM.BaseType == X86AddressMode::RegBase)
|
|
|
|
MIB.addReg(AM.Base.Reg);
|
implement rdar://6653118 - fastisel should fold loads where possible.
Since mem2reg isn't run at -O0, we get a ton of reloads from the stack,
for example, before, this code:
int foo(int x, int y, int z) {
return x+y+z;
}
used to compile into:
_foo: ## @foo
subq $12, %rsp
movl %edi, 8(%rsp)
movl %esi, 4(%rsp)
movl %edx, (%rsp)
movl 8(%rsp), %edx
movl 4(%rsp), %esi
addl %edx, %esi
movl (%rsp), %edx
addl %esi, %edx
movl %edx, %eax
addq $12, %rsp
ret
Now we produce:
_foo: ## @foo
subq $12, %rsp
movl %edi, 8(%rsp)
movl %esi, 4(%rsp)
movl %edx, (%rsp)
movl 8(%rsp), %edx
addl 4(%rsp), %edx ## Folded load
addl (%rsp), %edx ## Folded load
movl %edx, %eax
addq $12, %rsp
ret
Fewer instructions and less register use = faster compiles.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@113102 91177308-0d34-0410-b5e6-96231b3b80d8
2010-09-05 02:18:34 +00:00
|
|
|
else {
|
|
|
|
assert(AM.BaseType == X86AddressMode::FrameIndexBase);
|
2004-08-30 00:13:26 +00:00
|
|
|
MIB.addFrameIndex(AM.Base.FrameIndex);
|
implement rdar://6653118 - fastisel should fold loads where possible.
Since mem2reg isn't run at -O0, we get a ton of reloads from the stack,
for example, before, this code:
int foo(int x, int y, int z) {
return x+y+z;
}
used to compile into:
_foo: ## @foo
subq $12, %rsp
movl %edi, 8(%rsp)
movl %esi, 4(%rsp)
movl %edx, (%rsp)
movl 8(%rsp), %edx
movl 4(%rsp), %esi
addl %edx, %esi
movl (%rsp), %edx
addl %esi, %edx
movl %edx, %eax
addq $12, %rsp
ret
Now we produce:
_foo: ## @foo
subq $12, %rsp
movl %edi, 8(%rsp)
movl %esi, 4(%rsp)
movl %edx, (%rsp)
movl 8(%rsp), %edx
addl 4(%rsp), %edx ## Folded load
addl (%rsp), %edx ## Folded load
movl %edx, %eax
addq $12, %rsp
ret
Fewer instructions and less register use = faster compiles.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@113102 91177308-0d34-0410-b5e6-96231b3b80d8
2010-09-05 02:18:34 +00:00
|
|
|
}
|
|
|
|
|
2006-05-04 18:16:01 +00:00
|
|
|
MIB.addImm(AM.Scale).addReg(AM.IndexReg);
|
2004-10-15 04:43:20 +00:00
|
|
|
if (AM.GV)
|
2010-07-08 23:46:44 +00:00
|
|
|
MIB.addGlobalAddress(AM.GV, AM.Disp, AM.GVOpFlags);
|
2004-10-15 04:43:20 +00:00
|
|
|
else
|
2010-07-08 23:46:44 +00:00
|
|
|
MIB.addImm(AM.Disp);
|
2012-06-22 22:07:19 +00:00
|
|
|
|
2010-07-08 23:46:44 +00:00
|
|
|
return MIB.addReg(0);
|
2009-04-08 21:14:34 +00:00
|
|
|
}
|
|
|
|
|
2002-12-28 20:26:58 +00:00
|
|
|
/// addFrameReference - This function is used to add a reference to the base of
|
|
|
|
/// an abstract object on the stack frame of the current function. This
|
2003-01-13 00:45:53 +00:00
|
|
|
/// reference has base register as the FrameIndex offset until it is resolved.
|
|
|
|
/// This allows a constant offset to be specified as well...
|
2002-12-28 20:26:58 +00:00
|
|
|
///
|
2009-07-16 14:03:08 +00:00
|
|
|
static inline const MachineInstrBuilder &
|
2003-01-13 00:45:53 +00:00
|
|
|
addFrameReference(const MachineInstrBuilder &MIB, int FI, int Offset = 0) {
|
2008-12-03 18:11:40 +00:00
|
|
|
MachineInstr *MI = MIB;
|
|
|
|
MachineFunction &MF = *MI->getParent()->getParent();
|
|
|
|
MachineFrameInfo &MFI = *MF.getFrameInfo();
|
2011-06-28 19:10:37 +00:00
|
|
|
const MCInstrDesc &MCID = MI->getDesc();
|
2008-12-03 18:11:40 +00:00
|
|
|
unsigned Flags = 0;
|
2011-06-28 19:10:37 +00:00
|
|
|
if (MCID.mayLoad())
|
2008-12-03 18:11:40 +00:00
|
|
|
Flags |= MachineMemOperand::MOLoad;
|
2011-06-28 19:10:37 +00:00
|
|
|
if (MCID.mayStore())
|
2008-12-03 18:11:40 +00:00
|
|
|
Flags |= MachineMemOperand::MOStore;
|
2009-09-25 20:36:54 +00:00
|
|
|
MachineMemOperand *MMO =
|
2010-09-21 06:22:23 +00:00
|
|
|
MF.getMachineMemOperand(MachinePointerInfo::getFixedStack(FI, Offset),
|
2010-09-21 04:39:43 +00:00
|
|
|
Flags, MFI.getObjectSize(FI),
|
2009-09-25 20:36:54 +00:00
|
|
|
MFI.getObjectAlignment(FI));
|
2009-04-08 21:14:34 +00:00
|
|
|
return addOffset(MIB.addFrameIndex(FI), Offset)
|
2008-12-03 18:11:40 +00:00
|
|
|
.addMemOperand(MMO);
|
2003-01-13 00:45:53 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/// addConstantPoolReference - This function is used to add a reference to the
|
|
|
|
/// base of a constant value spilled to the per-function constant pool. The
|
2008-09-30 01:21:32 +00:00
|
|
|
/// reference uses the abstract ConstantPoolIndex which is retained until
|
|
|
|
/// either machine code emission or assembly output. In PIC mode on x86-32,
|
|
|
|
/// the GlobalBaseReg parameter can be used to make this a
|
|
|
|
/// GlobalBaseReg-relative reference.
|
2003-01-13 00:45:53 +00:00
|
|
|
///
|
2009-07-16 14:03:08 +00:00
|
|
|
static inline const MachineInstrBuilder &
|
2008-09-30 01:21:32 +00:00
|
|
|
addConstantPoolReference(const MachineInstrBuilder &MIB, unsigned CPI,
|
2009-06-27 01:31:51 +00:00
|
|
|
unsigned GlobalBaseReg, unsigned char OpFlags) {
|
2009-04-08 21:14:34 +00:00
|
|
|
//FIXME: factor this
|
|
|
|
return MIB.addReg(GlobalBaseReg).addImm(1).addReg(0)
|
2009-06-27 01:31:51 +00:00
|
|
|
.addConstantPoolIndex(CPI, 0, OpFlags).addReg(0);
|
2002-12-28 20:26:58 +00:00
|
|
|
}
|
|
|
|
|
2003-11-11 22:41:34 +00:00
|
|
|
} // End llvm namespace
|
|
|
|
|
2002-11-17 21:03:35 +00:00
|
|
|
#endif
|