blob: 3239df9ca2c20236d71cf1bd02cf73708ecd83f9 [file] [log] [blame]
Chris Lattner5930d3d2005-11-16 22:59:19 +00001//===- X86ISelDAGToDAG.cpp - A DAG pattern matching inst selector for X86 -===//
Chris Lattner655e7df2005-11-16 01:54:32 +00002//
3// The LLVM Compiler Infrastructure
4//
5// This file was developed by the Evan Cheng and is distributed under
6// the University of Illinois Open Source License. See LICENSE.TXT for details.
7//
8//===----------------------------------------------------------------------===//
9//
10// This file defines a DAG pattern matching instruction selector for X86,
11// converting from a legalized dag to a X86 dag.
12//
13//===----------------------------------------------------------------------===//
14
Evan Chengd49cc362006-02-10 22:24:32 +000015#define DEBUG_TYPE "isel"
Chris Lattner655e7df2005-11-16 01:54:32 +000016#include "X86.h"
Evan Chengbc7a0f442006-01-11 06:09:51 +000017#include "X86InstrBuilder.h"
Evan Cheng2dd2c652006-03-13 23:20:37 +000018#include "X86ISelLowering.h"
Chris Lattner7c551262006-01-11 01:15:34 +000019#include "X86RegisterInfo.h"
Chris Lattner655e7df2005-11-16 01:54:32 +000020#include "X86Subtarget.h"
Evan Cheng2dd2c652006-03-13 23:20:37 +000021#include "X86TargetMachine.h"
Chris Lattner3f0f71b2005-11-19 02:11:08 +000022#include "llvm/GlobalValue.h"
Chris Lattner7c551262006-01-11 01:15:34 +000023#include "llvm/Instructions.h"
Chris Lattner5d70a7c2006-03-25 06:47:10 +000024#include "llvm/Intrinsics.h"
Chris Lattner7c551262006-01-11 01:15:34 +000025#include "llvm/Support/CFG.h"
Chris Lattner3f0f71b2005-11-19 02:11:08 +000026#include "llvm/CodeGen/MachineConstantPool.h"
Chris Lattner655e7df2005-11-16 01:54:32 +000027#include "llvm/CodeGen/MachineFunction.h"
Evan Cheng73a1ad92006-01-10 20:26:56 +000028#include "llvm/CodeGen/MachineFrameInfo.h"
Chris Lattner7c551262006-01-11 01:15:34 +000029#include "llvm/CodeGen/MachineInstrBuilder.h"
30#include "llvm/CodeGen/SSARegMap.h"
Chris Lattner655e7df2005-11-16 01:54:32 +000031#include "llvm/CodeGen/SelectionDAGISel.h"
32#include "llvm/Target/TargetMachine.h"
33#include "llvm/Support/Debug.h"
Chris Lattner0cc59072006-06-28 23:27:49 +000034#include "llvm/Support/Visibility.h"
Chris Lattner655e7df2005-11-16 01:54:32 +000035#include "llvm/ADT/Statistic.h"
Evan Cheng2e945382006-07-28 06:05:06 +000036#include <deque>
Chris Lattnerde02d772006-01-22 23:41:00 +000037#include <iostream>
Evan Cheng54cb1832006-02-05 06:46:41 +000038#include <set>
Chris Lattner655e7df2005-11-16 01:54:32 +000039using namespace llvm;
40
41//===----------------------------------------------------------------------===//
42// Pattern Matcher Implementation
43//===----------------------------------------------------------------------===//
44
45namespace {
Chris Lattner3f0f71b2005-11-19 02:11:08 +000046 /// X86ISelAddressMode - This corresponds to X86AddressMode, but uses
47 /// SDOperand's instead of register numbers for the leaves of the matched
48 /// tree.
49 struct X86ISelAddressMode {
50 enum {
51 RegBase,
Chris Lattneraa2372562006-05-24 17:04:05 +000052 FrameIndexBase
Chris Lattner3f0f71b2005-11-19 02:11:08 +000053 } BaseType;
54
55 struct { // This is really a union, discriminated by BaseType!
56 SDOperand Reg;
57 int FrameIndex;
58 } Base;
59
60 unsigned Scale;
61 SDOperand IndexReg;
62 unsigned Disp;
63 GlobalValue *GV;
Evan Cheng77d86ff2006-02-25 10:09:08 +000064 Constant *CP;
65 unsigned Align; // CP alignment.
Chris Lattner3f0f71b2005-11-19 02:11:08 +000066
67 X86ISelAddressMode()
Evan Cheng77d86ff2006-02-25 10:09:08 +000068 : BaseType(RegBase), Scale(1), IndexReg(), Disp(0), GV(0),
69 CP(0), Align(0) {
Chris Lattner3f0f71b2005-11-19 02:11:08 +000070 }
71 };
72}
73
74namespace {
Chris Lattner655e7df2005-11-16 01:54:32 +000075 Statistic<>
76 NumFPKill("x86-codegen", "Number of FP_REG_KILL instructions added");
77
78 //===--------------------------------------------------------------------===//
79 /// ISel - X86 specific code to select X86 machine instructions for
80 /// SelectionDAG operations.
81 ///
Chris Lattner0cc59072006-06-28 23:27:49 +000082 class VISIBILITY_HIDDEN X86DAGToDAGISel : public SelectionDAGISel {
Chris Lattner655e7df2005-11-16 01:54:32 +000083 /// ContainsFPCode - Every instruction we select that uses or defines a FP
84 /// register should set this to true.
85 bool ContainsFPCode;
86
87 /// X86Lowering - This object fully describes how to lower LLVM code to an
88 /// X86-specific SelectionDAG.
89 X86TargetLowering X86Lowering;
90
91 /// Subtarget - Keep a pointer to the X86Subtarget around so that we can
92 /// make the right decision when generating code for different targets.
93 const X86Subtarget *Subtarget;
Evan Cheng5588de92006-02-18 00:15:05 +000094
95 unsigned GlobalBaseReg;
Evan Cheng691a63d2006-07-27 16:44:36 +000096
Chris Lattner655e7df2005-11-16 01:54:32 +000097 public:
Evan Cheng2dd2c652006-03-13 23:20:37 +000098 X86DAGToDAGISel(X86TargetMachine &TM)
99 : SelectionDAGISel(X86Lowering),
Evan Cheng691a63d2006-07-27 16:44:36 +0000100 X86Lowering(*TM.getTargetLowering()),
101 Subtarget(&TM.getSubtarget<X86Subtarget>()),
Evan Cheng8101dd62006-08-02 09:18:33 +0000102 DAGSize(0), ReachabilityMatrix(NULL), ReachMatrixRange(NULL) {}
Chris Lattner655e7df2005-11-16 01:54:32 +0000103
Evan Cheng5588de92006-02-18 00:15:05 +0000104 virtual bool runOnFunction(Function &Fn) {
105 // Make sure we re-emit a set of the global base reg if necessary
106 GlobalBaseReg = 0;
107 return SelectionDAGISel::runOnFunction(Fn);
108 }
109
Chris Lattner655e7df2005-11-16 01:54:32 +0000110 virtual const char *getPassName() const {
111 return "X86 DAG->DAG Instruction Selection";
112 }
113
114 /// InstructionSelectBasicBlock - This callback is invoked by
115 /// SelectionDAGISel when it has created a SelectionDAG for us to codegen.
116 virtual void InstructionSelectBasicBlock(SelectionDAG &DAG);
117
Evan Chengbc7a0f442006-01-11 06:09:51 +0000118 virtual void EmitFunctionEntryCode(Function &Fn, MachineFunction &MF);
119
Evan Chenge2a3f702006-07-28 01:03:48 +0000120 virtual bool CanBeFoldedBy(SDNode *N, SDNode *U);
Evan Cheng691a63d2006-07-27 16:44:36 +0000121
Chris Lattner655e7df2005-11-16 01:54:32 +0000122// Include the pieces autogenerated from the target description.
123#include "X86GenDAGISel.inc"
124
125 private:
Evan Chenge8071ec2006-07-28 06:33:41 +0000126 void DetermineReachability(SDNode *f, SDNode *t);
Evan Cheng691a63d2006-07-27 16:44:36 +0000127
Evan Cheng6dc90ca2006-02-09 00:37:58 +0000128 void Select(SDOperand &Result, SDOperand N);
Chris Lattner655e7df2005-11-16 01:54:32 +0000129
Evan Chenga86ba852006-02-11 02:05:36 +0000130 bool MatchAddress(SDOperand N, X86ISelAddressMode &AM, bool isRoot = true);
Evan Chengc9fab312005-12-08 02:01:35 +0000131 bool SelectAddr(SDOperand N, SDOperand &Base, SDOperand &Scale,
132 SDOperand &Index, SDOperand &Disp);
133 bool SelectLEAAddr(SDOperand N, SDOperand &Base, SDOperand &Scale,
134 SDOperand &Index, SDOperand &Disp);
Evan Chengd5f2ba02006-02-06 06:02:33 +0000135 bool TryFoldLoad(SDOperand P, SDOperand N,
136 SDOperand &Base, SDOperand &Scale,
Evan Cheng10d27902006-01-06 20:36:21 +0000137 SDOperand &Index, SDOperand &Disp);
Chris Lattnerba1ed582006-06-08 18:03:49 +0000138 /// SelectInlineAsmMemoryOperand - Implement addressing mode selection for
139 /// inline asm expressions.
140 virtual bool SelectInlineAsmMemoryOperand(const SDOperand &Op,
141 char ConstraintCode,
142 std::vector<SDOperand> &OutOps,
143 SelectionDAG &DAG);
144
Evan Chenge8a42362006-06-02 22:38:37 +0000145 void EmitSpecialCodeForMain(MachineBasicBlock *BB, MachineFrameInfo *MFI);
146
Evan Cheng67ed58e2005-12-12 21:49:40 +0000147 inline void getAddressOperands(X86ISelAddressMode &AM, SDOperand &Base,
148 SDOperand &Scale, SDOperand &Index,
149 SDOperand &Disp) {
150 Base = (AM.BaseType == X86ISelAddressMode::FrameIndexBase) ?
151 CurDAG->getTargetFrameIndex(AM.Base.FrameIndex, MVT::i32) : AM.Base.Reg;
Evan Cheng1d712482005-12-17 09:13:43 +0000152 Scale = getI8Imm(AM.Scale);
Evan Cheng67ed58e2005-12-12 21:49:40 +0000153 Index = AM.IndexReg;
154 Disp = AM.GV ? CurDAG->getTargetGlobalAddress(AM.GV, MVT::i32, AM.Disp)
Evan Cheng77d86ff2006-02-25 10:09:08 +0000155 : (AM.CP ?
156 CurDAG->getTargetConstantPool(AM.CP, MVT::i32, AM.Align, AM.Disp)
157 : getI32Imm(AM.Disp));
Evan Cheng67ed58e2005-12-12 21:49:40 +0000158 }
159
Chris Lattner3f0f71b2005-11-19 02:11:08 +0000160 /// getI8Imm - Return a target constant with the specified value, of type
161 /// i8.
162 inline SDOperand getI8Imm(unsigned Imm) {
163 return CurDAG->getTargetConstant(Imm, MVT::i8);
164 }
165
Chris Lattner655e7df2005-11-16 01:54:32 +0000166 /// getI16Imm - Return a target constant with the specified value, of type
167 /// i16.
168 inline SDOperand getI16Imm(unsigned Imm) {
169 return CurDAG->getTargetConstant(Imm, MVT::i16);
170 }
171
172 /// getI32Imm - Return a target constant with the specified value, of type
173 /// i32.
174 inline SDOperand getI32Imm(unsigned Imm) {
175 return CurDAG->getTargetConstant(Imm, MVT::i32);
176 }
Evan Chengd49cc362006-02-10 22:24:32 +0000177
Evan Cheng5588de92006-02-18 00:15:05 +0000178 /// getGlobalBaseReg - insert code into the entry mbb to materialize the PIC
179 /// base register. Return the virtual register that holds this value.
180 SDOperand getGlobalBaseReg();
181
Evan Cheng691a63d2006-07-27 16:44:36 +0000182 /// DAGSize - Number of nodes in the DAG.
183 ///
184 unsigned DAGSize;
185
186 /// TopOrder - Topological ordering of all nodes in the DAG.
187 ///
Evan Cheng45af2872006-08-01 08:17:22 +0000188 std::vector<SDNode*> TopOrder;
Evan Cheng87585762006-07-27 22:10:00 +0000189
Evan Cheng45af2872006-08-01 08:17:22 +0000190 /// ReachabilityMatrix - A N x N matrix representing all pairs reachability
Evan Cheng691a63d2006-07-27 16:44:36 +0000191 /// information. One bit per potential edge.
Evan Cheng8101dd62006-08-02 09:18:33 +0000192 unsigned char *ReachabilityMatrix;
Evan Cheng45af2872006-08-01 08:17:22 +0000193
Evan Cheng8101dd62006-08-02 09:18:33 +0000194 /// ReachMatrixRange - The range of reachability information available for
195 /// the particular source node.
196 unsigned *ReachMatrixRange;
Evan Cheng691a63d2006-07-27 16:44:36 +0000197
198 inline void setReachable(SDNode *f, SDNode *t) {
199 unsigned Idx = f->getNodeId() * DAGSize + t->getNodeId();
Evan Cheng8101dd62006-08-02 09:18:33 +0000200 ReachabilityMatrix[Idx / 8] |= 1 << (Idx % 8);
Evan Cheng691a63d2006-07-27 16:44:36 +0000201 }
202
203 inline bool isReachable(SDNode *f, SDNode *t) {
204 unsigned Idx = f->getNodeId() * DAGSize + t->getNodeId();
Evan Cheng8101dd62006-08-02 09:18:33 +0000205 return ReachabilityMatrix[Idx / 8] & (1 << (Idx % 8));
Evan Cheng691a63d2006-07-27 16:44:36 +0000206 }
207
Evan Cheng11a4d8c2006-07-28 00:49:31 +0000208 /// UnfoldableSet - An boolean array representing nodes which have been
209 /// folded into addressing modes and therefore should not be folded in
210 /// another operation.
Evan Cheng8101dd62006-08-02 09:18:33 +0000211 unsigned char *UnfoldableSet;
Evan Cheng11a4d8c2006-07-28 00:49:31 +0000212
213 inline void setUnfoldable(SDNode *N) {
Evan Cheng8101dd62006-08-02 09:18:33 +0000214 unsigned Id = N->getNodeId();
215 UnfoldableSet[Id / 8] |= 1 << (Id % 8);
Evan Cheng11a4d8c2006-07-28 00:49:31 +0000216 }
217
218 inline bool isUnfoldable(SDNode *N) {
Evan Cheng8101dd62006-08-02 09:18:33 +0000219 unsigned Id = N->getNodeId();
220 return UnfoldableSet[Id / 8] & (1 << (Id % 8));
Evan Cheng11a4d8c2006-07-28 00:49:31 +0000221 }
222
Evan Cheng2b6f78b2006-02-10 22:46:26 +0000223#ifndef NDEBUG
224 unsigned Indent;
225#endif
Chris Lattner655e7df2005-11-16 01:54:32 +0000226 };
227}
228
Evan Chenge2a3f702006-07-28 01:03:48 +0000229bool X86DAGToDAGISel::CanBeFoldedBy(SDNode *N, SDNode *U) {
Evan Cheng11a4d8c2006-07-28 00:49:31 +0000230 // Is it already folded by SelectAddr / SelectLEAAddr?
231 if (isUnfoldable(N))
232 return false;
233
Evan Cheng691a63d2006-07-27 16:44:36 +0000234 // If U use can somehow reach N through another path then U can't fold N or
235 // it will create a cycle. e.g. In the following diagram, U can reach N
Evan Chenge8071ec2006-07-28 06:33:41 +0000236 // through X. If N is folded into into U, then X is both a predecessor and
Evan Cheng691a63d2006-07-27 16:44:36 +0000237 // a successor of U.
238 //
239 // [ N ]
240 // ^ ^
241 // | |
242 // / \---
243 // / [X]
244 // | ^
245 // [U]--------|
Evan Chenge8071ec2006-07-28 06:33:41 +0000246 DetermineReachability(U, N);
Evan Cheng691a63d2006-07-27 16:44:36 +0000247 assert(isReachable(U, N) && "Attempting to fold a non-operand node?");
248 for (SDNode::op_iterator I = U->op_begin(), E = U->op_end(); I != E; ++I) {
249 SDNode *P = I->Val;
250 if (P != N && isReachable(P, N))
251 return false;
252 }
253 return true;
254}
255
Evan Cheng45af2872006-08-01 08:17:22 +0000256/// DetermineReachability - Determine reachability between all pairs of nodes
Evan Cheng2e945382006-07-28 06:05:06 +0000257/// between f and t in topological order.
Evan Chenge8071ec2006-07-28 06:33:41 +0000258void X86DAGToDAGISel::DetermineReachability(SDNode *f, SDNode *t) {
Evan Cheng45af2872006-08-01 08:17:22 +0000259 unsigned Orderf = f->getNodeId();
260 unsigned Ordert = t->getNodeId();
261 unsigned Range = ReachMatrixRange[Orderf];
Evan Cheng87585762006-07-27 22:10:00 +0000262 if (Range >= Ordert)
263 return;
264 if (Range < Orderf)
265 Range = Orderf;
266
267 for (unsigned i = Range; i < Ordert; ++i) {
Evan Cheng691a63d2006-07-27 16:44:36 +0000268 SDNode *N = TopOrder[i];
269 setReachable(N, N);
270 // If N is a leaf node, there is nothing more to do.
271 if (N->getNumOperands() == 0)
272 continue;
273
Evan Cheng8f585192006-08-02 22:01:32 +0000274 for (unsigned i2 = Range; ; ++i2) {
Evan Cheng691a63d2006-07-27 16:44:36 +0000275 SDNode *M = TopOrder[i2];
276 if (isReachable(M, N)) {
Evan Cheng45af2872006-08-01 08:17:22 +0000277 // Update reachability from M to N's operands.
Evan Cheng8f585192006-08-02 22:01:32 +0000278 for (SDNode::op_iterator I = N->op_begin(),E = N->op_end(); I != E;++I){
279 SDNode *P = I->Val;
280 if (P->getNodeId() >= 0)
281 setReachable(M, P);
282 }
Evan Cheng691a63d2006-07-27 16:44:36 +0000283 }
284 if (M == N) break;
285 }
286 }
Evan Cheng87585762006-07-27 22:10:00 +0000287
Evan Cheng45af2872006-08-01 08:17:22 +0000288 ReachMatrixRange[Orderf] = Ordert;
Evan Cheng691a63d2006-07-27 16:44:36 +0000289}
290
Chris Lattner655e7df2005-11-16 01:54:32 +0000291/// InstructionSelectBasicBlock - This callback is invoked by SelectionDAGISel
292/// when it has created a SelectionDAG for us to codegen.
293void X86DAGToDAGISel::InstructionSelectBasicBlock(SelectionDAG &DAG) {
294 DEBUG(BB->dump());
Chris Lattner7c551262006-01-11 01:15:34 +0000295 MachineFunction::iterator FirstMBB = BB;
Chris Lattner655e7df2005-11-16 01:54:32 +0000296
Evan Cheng8f585192006-08-02 22:01:32 +0000297 DAGSize = DAG.AssignTopologicalOrder(TopOrder);
Evan Cheng8101dd62006-08-02 09:18:33 +0000298 unsigned RMSize = (DAGSize * DAGSize + 7) / 8;
299 ReachabilityMatrix = new unsigned char[RMSize];
300 memset(ReachabilityMatrix, 0, RMSize);
301 ReachMatrixRange = new unsigned[DAGSize];
302 memset(ReachMatrixRange, 0, DAGSize * sizeof(unsigned));
303 unsigned NumBytes = (DAGSize + 7) / 8;
304 UnfoldableSet = new unsigned char[NumBytes];
305 memset(UnfoldableSet, 0, NumBytes);
Evan Cheng3b5e0ca2006-07-28 00:10:59 +0000306
Chris Lattner655e7df2005-11-16 01:54:32 +0000307 // Codegen the basic block.
Evan Chengd49cc362006-02-10 22:24:32 +0000308#ifndef NDEBUG
309 DEBUG(std::cerr << "===== Instruction selection begins:\n");
Evan Cheng2b6f78b2006-02-10 22:46:26 +0000310 Indent = 0;
Evan Chengd49cc362006-02-10 22:24:32 +0000311#endif
Evan Cheng54cb1832006-02-05 06:46:41 +0000312 DAG.setRoot(SelectRoot(DAG.getRoot()));
Evan Chengd49cc362006-02-10 22:24:32 +0000313#ifndef NDEBUG
314 DEBUG(std::cerr << "===== Instruction selection ends:\n");
315#endif
Evan Cheng3b5e0ca2006-07-28 00:10:59 +0000316
Evan Cheng8101dd62006-08-02 09:18:33 +0000317 delete[] ReachabilityMatrix;
318 delete[] ReachMatrixRange;
319 delete[] UnfoldableSet;
320 ReachabilityMatrix = NULL;
321 ReachMatrixRange = NULL;
322 UnfoldableSet = NULL;
Evan Cheng8f585192006-08-02 22:01:32 +0000323 TopOrder.clear();
Evan Cheng1d9b6712005-12-19 22:36:02 +0000324 CodeGenMap.clear();
Evan Cheng1a8e74d2006-05-24 20:46:25 +0000325 HandleMap.clear();
326 ReplaceMap.clear();
Chris Lattner655e7df2005-11-16 01:54:32 +0000327 DAG.RemoveDeadNodes();
328
329 // Emit machine code to BB.
330 ScheduleAndEmitDAG(DAG);
Chris Lattner7c551262006-01-11 01:15:34 +0000331
332 // If we are emitting FP stack code, scan the basic block to determine if this
333 // block defines any FP values. If so, put an FP_REG_KILL instruction before
334 // the terminator of the block.
Evan Chengcde9e302006-01-27 08:10:46 +0000335 if (!Subtarget->hasSSE2()) {
Chris Lattner7c551262006-01-11 01:15:34 +0000336 // Note that FP stack instructions *are* used in SSE code when returning
337 // values, but these are not live out of the basic block, so we don't need
338 // an FP_REG_KILL in this case either.
339 bool ContainsFPCode = false;
340
341 // Scan all of the machine instructions in these MBBs, checking for FP
342 // stores.
343 MachineFunction::iterator MBBI = FirstMBB;
344 do {
345 for (MachineBasicBlock::iterator I = MBBI->begin(), E = MBBI->end();
346 !ContainsFPCode && I != E; ++I) {
347 for (unsigned op = 0, e = I->getNumOperands(); op != e; ++op) {
348 if (I->getOperand(op).isRegister() && I->getOperand(op).isDef() &&
349 MRegisterInfo::isVirtualRegister(I->getOperand(op).getReg()) &&
350 RegMap->getRegClass(I->getOperand(0).getReg()) ==
351 X86::RFPRegisterClass) {
352 ContainsFPCode = true;
353 break;
354 }
355 }
356 }
357 } while (!ContainsFPCode && &*(MBBI++) != BB);
358
359 // Check PHI nodes in successor blocks. These PHI's will be lowered to have
360 // a copy of the input value in this block.
361 if (!ContainsFPCode) {
362 // Final check, check LLVM BB's that are successors to the LLVM BB
363 // corresponding to BB for FP PHI nodes.
364 const BasicBlock *LLVMBB = BB->getBasicBlock();
365 const PHINode *PN;
366 for (succ_const_iterator SI = succ_begin(LLVMBB), E = succ_end(LLVMBB);
367 !ContainsFPCode && SI != E; ++SI) {
368 for (BasicBlock::const_iterator II = SI->begin();
369 (PN = dyn_cast<PHINode>(II)); ++II) {
370 if (PN->getType()->isFloatingPoint()) {
371 ContainsFPCode = true;
372 break;
373 }
374 }
375 }
376 }
377
378 // Finally, if we found any FP code, emit the FP_REG_KILL instruction.
379 if (ContainsFPCode) {
380 BuildMI(*BB, BB->getFirstTerminator(), X86::FP_REG_KILL, 0);
381 ++NumFPKill;
382 }
383 }
Chris Lattner655e7df2005-11-16 01:54:32 +0000384}
385
Evan Chengbc7a0f442006-01-11 06:09:51 +0000386/// EmitSpecialCodeForMain - Emit any code that needs to be executed only in
387/// the main function.
Evan Chenge8a42362006-06-02 22:38:37 +0000388void X86DAGToDAGISel::EmitSpecialCodeForMain(MachineBasicBlock *BB,
389 MachineFrameInfo *MFI) {
390 if (Subtarget->TargetType == X86Subtarget::isCygwin)
391 BuildMI(BB, X86::CALLpcrel32, 1).addExternalSymbol("__main");
392
Evan Chengbc7a0f442006-01-11 06:09:51 +0000393 // Switch the FPU to 64-bit precision mode for better compatibility and speed.
394 int CWFrameIdx = MFI->CreateStackObject(2, 2);
395 addFrameReference(BuildMI(BB, X86::FNSTCW16m, 4), CWFrameIdx);
396
397 // Set the high part to be 64-bit precision.
398 addFrameReference(BuildMI(BB, X86::MOV8mi, 5),
399 CWFrameIdx, 1).addImm(2);
400
401 // Reload the modified control word now.
402 addFrameReference(BuildMI(BB, X86::FLDCW16m, 4), CWFrameIdx);
403}
404
405void X86DAGToDAGISel::EmitFunctionEntryCode(Function &Fn, MachineFunction &MF) {
406 // If this is main, emit special code for main.
407 MachineBasicBlock *BB = MF.begin();
408 if (Fn.hasExternalLinkage() && Fn.getName() == "main")
409 EmitSpecialCodeForMain(BB, MF.getFrameInfo());
410}
411
Chris Lattner3f0f71b2005-11-19 02:11:08 +0000412/// MatchAddress - Add the specified node to the specified addressing mode,
413/// returning true if it cannot be done. This just pattern matches for the
414/// addressing mode
Evan Chenga86ba852006-02-11 02:05:36 +0000415bool X86DAGToDAGISel::MatchAddress(SDOperand N, X86ISelAddressMode &AM,
416 bool isRoot) {
Evan Cheng77d86ff2006-02-25 10:09:08 +0000417 bool Available = false;
418 // If N has already been selected, reuse the result unless in some very
419 // specific cases.
Evan Chenga86ba852006-02-11 02:05:36 +0000420 std::map<SDOperand, SDOperand>::iterator CGMI= CodeGenMap.find(N.getValue(0));
421 if (CGMI != CodeGenMap.end()) {
Evan Cheng77d86ff2006-02-25 10:09:08 +0000422 Available = true;
Evan Chenga86ba852006-02-11 02:05:36 +0000423 }
424
Chris Lattner3f0f71b2005-11-19 02:11:08 +0000425 switch (N.getOpcode()) {
426 default: break;
Evan Cheng77d86ff2006-02-25 10:09:08 +0000427 case ISD::Constant:
428 AM.Disp += cast<ConstantSDNode>(N)->getValue();
429 return false;
430
431 case X86ISD::Wrapper:
432 // If both base and index components have been picked, we can't fit
433 // the result available in the register in the addressing mode. Duplicate
434 // GlobalAddress or ConstantPool as displacement.
435 if (!Available || (AM.Base.Reg.Val && AM.IndexReg.Val)) {
436 if (ConstantPoolSDNode *CP =
437 dyn_cast<ConstantPoolSDNode>(N.getOperand(0))) {
438 if (AM.CP == 0) {
439 AM.CP = CP->get();
440 AM.Align = CP->getAlignment();
441 AM.Disp += CP->getOffset();
442 return false;
443 }
444 } else if (GlobalAddressSDNode *G =
445 dyn_cast<GlobalAddressSDNode>(N.getOperand(0))) {
446 if (AM.GV == 0) {
447 AM.GV = G->getGlobal();
448 AM.Disp += G->getOffset();
449 return false;
450 }
451 }
452 }
453 break;
454
Chris Lattner3f0f71b2005-11-19 02:11:08 +0000455 case ISD::FrameIndex:
456 if (AM.BaseType == X86ISelAddressMode::RegBase && AM.Base.Reg.Val == 0) {
457 AM.BaseType = X86ISelAddressMode::FrameIndexBase;
458 AM.Base.FrameIndex = cast<FrameIndexSDNode>(N)->getIndex();
459 return false;
460 }
461 break;
Evan Chengc9fab312005-12-08 02:01:35 +0000462
Chris Lattner3f0f71b2005-11-19 02:11:08 +0000463 case ISD::SHL:
Evan Cheng77d86ff2006-02-25 10:09:08 +0000464 if (!Available && AM.IndexReg.Val == 0 && AM.Scale == 1)
Chris Lattner3f0f71b2005-11-19 02:11:08 +0000465 if (ConstantSDNode *CN = dyn_cast<ConstantSDNode>(N.Val->getOperand(1))) {
466 unsigned Val = CN->getValue();
467 if (Val == 1 || Val == 2 || Val == 3) {
468 AM.Scale = 1 << Val;
469 SDOperand ShVal = N.Val->getOperand(0);
470
471 // Okay, we know that we have a scale by now. However, if the scaled
472 // value is an add of something and a constant, we can fold the
473 // constant into the disp field here.
474 if (ShVal.Val->getOpcode() == ISD::ADD && ShVal.hasOneUse() &&
475 isa<ConstantSDNode>(ShVal.Val->getOperand(1))) {
476 AM.IndexReg = ShVal.Val->getOperand(0);
477 ConstantSDNode *AddVal =
478 cast<ConstantSDNode>(ShVal.Val->getOperand(1));
479 AM.Disp += AddVal->getValue() << Val;
480 } else {
481 AM.IndexReg = ShVal;
482 }
483 return false;
484 }
485 }
486 break;
Evan Chengc9fab312005-12-08 02:01:35 +0000487
Chris Lattner3f0f71b2005-11-19 02:11:08 +0000488 case ISD::MUL:
489 // X*[3,5,9] -> X+X*[2,4,8]
Evan Cheng77d86ff2006-02-25 10:09:08 +0000490 if (!Available &&
491 AM.BaseType == X86ISelAddressMode::RegBase &&
492 AM.Base.Reg.Val == 0 &&
493 AM.IndexReg.Val == 0)
Chris Lattner3f0f71b2005-11-19 02:11:08 +0000494 if (ConstantSDNode *CN = dyn_cast<ConstantSDNode>(N.Val->getOperand(1)))
495 if (CN->getValue() == 3 || CN->getValue() == 5 || CN->getValue() == 9) {
496 AM.Scale = unsigned(CN->getValue())-1;
497
498 SDOperand MulVal = N.Val->getOperand(0);
499 SDOperand Reg;
500
501 // Okay, we know that we have a scale by now. However, if the scaled
502 // value is an add of something and a constant, we can fold the
503 // constant into the disp field here.
504 if (MulVal.Val->getOpcode() == ISD::ADD && MulVal.hasOneUse() &&
505 isa<ConstantSDNode>(MulVal.Val->getOperand(1))) {
506 Reg = MulVal.Val->getOperand(0);
507 ConstantSDNode *AddVal =
508 cast<ConstantSDNode>(MulVal.Val->getOperand(1));
509 AM.Disp += AddVal->getValue() * CN->getValue();
510 } else {
511 Reg = N.Val->getOperand(0);
512 }
513
514 AM.IndexReg = AM.Base.Reg = Reg;
515 return false;
516 }
517 break;
518
519 case ISD::ADD: {
Evan Cheng77d86ff2006-02-25 10:09:08 +0000520 if (!Available) {
Evan Chenga86ba852006-02-11 02:05:36 +0000521 X86ISelAddressMode Backup = AM;
522 if (!MatchAddress(N.Val->getOperand(0), AM, false) &&
523 !MatchAddress(N.Val->getOperand(1), AM, false))
524 return false;
525 AM = Backup;
526 if (!MatchAddress(N.Val->getOperand(1), AM, false) &&
527 !MatchAddress(N.Val->getOperand(0), AM, false))
528 return false;
529 AM = Backup;
530 }
Chris Lattner3f0f71b2005-11-19 02:11:08 +0000531 break;
532 }
Evan Cheng734e1e22006-05-30 06:59:36 +0000533
534 case ISD::OR: {
535 if (!Available) {
536 X86ISelAddressMode Backup = AM;
537 // Look for (x << c1) | c2 where (c2 < c1)
538 ConstantSDNode *CN = dyn_cast<ConstantSDNode>(N.Val->getOperand(0));
539 if (CN && !MatchAddress(N.Val->getOperand(1), AM, false)) {
540 if (AM.GV == NULL && AM.Disp == 0 && CN->getValue() < AM.Scale) {
541 AM.Disp = CN->getValue();
542 return false;
543 }
544 }
545 AM = Backup;
546 CN = dyn_cast<ConstantSDNode>(N.Val->getOperand(1));
547 if (CN && !MatchAddress(N.Val->getOperand(0), AM, false)) {
548 if (AM.GV == NULL && AM.Disp == 0 && CN->getValue() < AM.Scale) {
549 AM.Disp = CN->getValue();
550 return false;
551 }
552 }
553 AM = Backup;
554 }
555 break;
556 }
Chris Lattner3f0f71b2005-11-19 02:11:08 +0000557 }
558
559 // Is the base register already occupied?
560 if (AM.BaseType != X86ISelAddressMode::RegBase || AM.Base.Reg.Val) {
561 // If so, check to see if the scale index register is set.
562 if (AM.IndexReg.Val == 0) {
563 AM.IndexReg = N;
564 AM.Scale = 1;
565 return false;
566 }
567
568 // Otherwise, we cannot select it.
569 return true;
570 }
571
572 // Default, generate it as a register.
573 AM.BaseType = X86ISelAddressMode::RegBase;
574 AM.Base.Reg = N;
575 return false;
576}
577
Evan Chengc9fab312005-12-08 02:01:35 +0000578/// SelectAddr - returns true if it is able pattern match an addressing mode.
579/// It returns the operands which make up the maximal addressing mode it can
580/// match by reference.
581bool X86DAGToDAGISel::SelectAddr(SDOperand N, SDOperand &Base, SDOperand &Scale,
582 SDOperand &Index, SDOperand &Disp) {
583 X86ISelAddressMode AM;
Evan Chengbc7a0f442006-01-11 06:09:51 +0000584 if (MatchAddress(N, AM))
585 return false;
Evan Chengc9fab312005-12-08 02:01:35 +0000586
Evan Chengbc7a0f442006-01-11 06:09:51 +0000587 if (AM.BaseType == X86ISelAddressMode::RegBase) {
Evan Chengd19d51f2006-02-05 05:25:07 +0000588 if (!AM.Base.Reg.Val)
Evan Chengbc7a0f442006-01-11 06:09:51 +0000589 AM.Base.Reg = CurDAG->getRegister(0, MVT::i32);
Evan Chengc9fab312005-12-08 02:01:35 +0000590 }
Evan Chengbc7a0f442006-01-11 06:09:51 +0000591
Evan Chengd19d51f2006-02-05 05:25:07 +0000592 if (!AM.IndexReg.Val)
Evan Chengbc7a0f442006-01-11 06:09:51 +0000593 AM.IndexReg = CurDAG->getRegister(0, MVT::i32);
594
595 getAddressOperands(AM, Base, Scale, Index, Disp);
Evan Cheng77d86ff2006-02-25 10:09:08 +0000596
Evan Cheng11a4d8c2006-07-28 00:49:31 +0000597 int Id = Base.Val ? Base.Val->getNodeId() : -1;
598 if (Id != -1)
599 setUnfoldable(Base.Val);
600 Id = Index.Val ? Index.Val->getNodeId() : -1;
601 if (Id != -1)
602 setUnfoldable(Index.Val);
603
Evan Chengbc7a0f442006-01-11 06:09:51 +0000604 return true;
Evan Chengc9fab312005-12-08 02:01:35 +0000605}
606
Evan Cheng77d86ff2006-02-25 10:09:08 +0000607/// SelectLEAAddr - it calls SelectAddr and determines if the maximal addressing
608/// mode it matches can be cost effectively emitted as an LEA instruction.
Evan Cheng77d86ff2006-02-25 10:09:08 +0000609bool X86DAGToDAGISel::SelectLEAAddr(SDOperand N, SDOperand &Base,
610 SDOperand &Scale,
611 SDOperand &Index, SDOperand &Disp) {
612 X86ISelAddressMode AM;
613 if (MatchAddress(N, AM))
614 return false;
615
616 unsigned Complexity = 0;
617 if (AM.BaseType == X86ISelAddressMode::RegBase)
618 if (AM.Base.Reg.Val)
619 Complexity = 1;
620 else
621 AM.Base.Reg = CurDAG->getRegister(0, MVT::i32);
622 else if (AM.BaseType == X86ISelAddressMode::FrameIndexBase)
623 Complexity = 4;
624
625 if (AM.IndexReg.Val)
626 Complexity++;
627 else
628 AM.IndexReg = CurDAG->getRegister(0, MVT::i32);
629
Evan Cheng990c3602006-02-28 21:13:57 +0000630 if (AM.Scale > 2)
Evan Cheng77d86ff2006-02-25 10:09:08 +0000631 Complexity += 2;
Evan Cheng990c3602006-02-28 21:13:57 +0000632 // Don't match just leal(,%reg,2). It's cheaper to do addl %reg, %reg
633 else if (AM.Scale > 1)
634 Complexity++;
Evan Cheng77d86ff2006-02-25 10:09:08 +0000635
636 // FIXME: We are artificially lowering the criteria to turn ADD %reg, $GA
637 // to a LEA. This is determined with some expermentation but is by no means
638 // optimal (especially for code size consideration). LEA is nice because of
639 // its three-address nature. Tweak the cost function again when we can run
640 // convertToThreeAddress() at register allocation time.
641 if (AM.GV || AM.CP)
642 Complexity += 2;
643
644 if (AM.Disp && (AM.Base.Reg.Val || AM.IndexReg.Val))
645 Complexity++;
646
647 if (Complexity > 2) {
648 getAddressOperands(AM, Base, Scale, Index, Disp);
649 return true;
650 }
651
Evan Cheng11a4d8c2006-07-28 00:49:31 +0000652 int Id = Base.Val ? Base.Val->getNodeId() : -1;
653 if (Id != -1)
654 setUnfoldable(Base.Val);
655 Id = Index.Val ? Index.Val->getNodeId() : -1;
656 if (Id != -1)
657 setUnfoldable(Index.Val);
658
Evan Cheng77d86ff2006-02-25 10:09:08 +0000659 return false;
660}
661
Evan Chengd5f2ba02006-02-06 06:02:33 +0000662bool X86DAGToDAGISel::TryFoldLoad(SDOperand P, SDOperand N,
663 SDOperand &Base, SDOperand &Scale,
664 SDOperand &Index, SDOperand &Disp) {
665 if (N.getOpcode() == ISD::LOAD &&
666 N.hasOneUse() &&
667 !CodeGenMap.count(N.getValue(0)) &&
Evan Chenge2a3f702006-07-28 01:03:48 +0000668 !CanBeFoldedBy(N.Val, P.Val))
Evan Cheng10d27902006-01-06 20:36:21 +0000669 return SelectAddr(N.getOperand(1), Base, Scale, Index, Disp);
670 return false;
671}
672
673static bool isRegister0(SDOperand Op) {
Evan Chengc9fab312005-12-08 02:01:35 +0000674 if (RegisterSDNode *R = dyn_cast<RegisterSDNode>(Op))
675 return (R->getReg() == 0);
676 return false;
677}
678
Evan Cheng5588de92006-02-18 00:15:05 +0000679/// getGlobalBaseReg - Output the instructions required to put the
680/// base address to use for accessing globals into a register.
681///
682SDOperand X86DAGToDAGISel::getGlobalBaseReg() {
683 if (!GlobalBaseReg) {
684 // Insert the set of GlobalBaseReg into the first MBB of the function
685 MachineBasicBlock &FirstMBB = BB->getParent()->front();
686 MachineBasicBlock::iterator MBBI = FirstMBB.begin();
687 SSARegMap *RegMap = BB->getParent()->getSSARegMap();
688 // FIXME: when we get to LP64, we will need to create the appropriate
689 // type of register here.
Evan Cheng9fee4422006-05-16 07:21:53 +0000690 GlobalBaseReg = RegMap->createVirtualRegister(X86::GR32RegisterClass);
Evan Cheng5588de92006-02-18 00:15:05 +0000691 BuildMI(FirstMBB, MBBI, X86::MovePCtoStack, 0);
692 BuildMI(FirstMBB, MBBI, X86::POP32r, 1, GlobalBaseReg);
693 }
694 return CurDAG->getRegister(GlobalBaseReg, MVT::i32);
695}
696
Evan Chengf838cfc2006-05-20 01:36:52 +0000697static SDNode *FindCallStartFromCall(SDNode *Node) {
698 if (Node->getOpcode() == ISD::CALLSEQ_START) return Node;
699 assert(Node->getOperand(0).getValueType() == MVT::Other &&
700 "Node doesn't have a token chain argument!");
701 return FindCallStartFromCall(Node->getOperand(0).Val);
702}
703
Evan Cheng6dc90ca2006-02-09 00:37:58 +0000704void X86DAGToDAGISel::Select(SDOperand &Result, SDOperand N) {
Evan Cheng00fcb002005-12-15 01:02:48 +0000705 SDNode *Node = N.Val;
706 MVT::ValueType NVT = Node->getValueType(0);
Evan Cheng10d27902006-01-06 20:36:21 +0000707 unsigned Opc, MOpc;
708 unsigned Opcode = Node->getOpcode();
Chris Lattner655e7df2005-11-16 01:54:32 +0000709
Evan Chengd49cc362006-02-10 22:24:32 +0000710#ifndef NDEBUG
Evan Cheng2b6f78b2006-02-10 22:46:26 +0000711 DEBUG(std::cerr << std::string(Indent, ' '));
Evan Chengd49cc362006-02-10 22:24:32 +0000712 DEBUG(std::cerr << "Selecting: ");
713 DEBUG(Node->dump(CurDAG));
714 DEBUG(std::cerr << "\n");
Evan Cheng2b6f78b2006-02-10 22:46:26 +0000715 Indent += 2;
Evan Chengd49cc362006-02-10 22:24:32 +0000716#endif
717
Evan Cheng6dc90ca2006-02-09 00:37:58 +0000718 if (Opcode >= ISD::BUILTIN_OP_END && Opcode < X86ISD::FIRST_NUMBER) {
719 Result = N;
Evan Chengd49cc362006-02-10 22:24:32 +0000720#ifndef NDEBUG
Evan Chenga86ba852006-02-11 02:05:36 +0000721 DEBUG(std::cerr << std::string(Indent-2, ' '));
Evan Chengd49cc362006-02-10 22:24:32 +0000722 DEBUG(std::cerr << "== ");
723 DEBUG(Node->dump(CurDAG));
724 DEBUG(std::cerr << "\n");
Evan Cheng2b6f78b2006-02-10 22:46:26 +0000725 Indent -= 2;
Evan Chengd49cc362006-02-10 22:24:32 +0000726#endif
Evan Cheng6dc90ca2006-02-09 00:37:58 +0000727 return; // Already selected.
728 }
Evan Cheng2ae799a2006-01-11 22:15:18 +0000729
730 std::map<SDOperand, SDOperand>::iterator CGMI = CodeGenMap.find(N);
Evan Cheng6dc90ca2006-02-09 00:37:58 +0000731 if (CGMI != CodeGenMap.end()) {
732 Result = CGMI->second;
Evan Chengd49cc362006-02-10 22:24:32 +0000733#ifndef NDEBUG
Evan Chenga86ba852006-02-11 02:05:36 +0000734 DEBUG(std::cerr << std::string(Indent-2, ' '));
Evan Chengd49cc362006-02-10 22:24:32 +0000735 DEBUG(std::cerr << "== ");
736 DEBUG(Result.Val->dump(CurDAG));
737 DEBUG(std::cerr << "\n");
Evan Cheng2b6f78b2006-02-10 22:46:26 +0000738 Indent -= 2;
Evan Chengd49cc362006-02-10 22:24:32 +0000739#endif
Evan Cheng6dc90ca2006-02-09 00:37:58 +0000740 return;
741 }
Chris Lattner655e7df2005-11-16 01:54:32 +0000742
Evan Cheng10d27902006-01-06 20:36:21 +0000743 switch (Opcode) {
Chris Lattner655e7df2005-11-16 01:54:32 +0000744 default: break;
Evan Chenge0ed6ec2006-02-23 20:41:18 +0000745 case X86ISD::GlobalBaseReg:
746 Result = getGlobalBaseReg();
747 return;
748
Evan Cheng77d86ff2006-02-25 10:09:08 +0000749 case ISD::ADD: {
750 // Turn ADD X, c to MOV32ri X+c. This cannot be done with tblgen'd
751 // code and is matched first so to prevent it from being turned into
752 // LEA32r X+c.
753 SDOperand N0 = N.getOperand(0);
754 SDOperand N1 = N.getOperand(1);
755 if (N.Val->getValueType(0) == MVT::i32 &&
756 N0.getOpcode() == X86ISD::Wrapper &&
757 N1.getOpcode() == ISD::Constant) {
758 unsigned Offset = (unsigned)cast<ConstantSDNode>(N1)->getValue();
759 SDOperand C(0, 0);
760 // TODO: handle ExternalSymbolSDNode.
761 if (GlobalAddressSDNode *G =
762 dyn_cast<GlobalAddressSDNode>(N0.getOperand(0))) {
763 C = CurDAG->getTargetGlobalAddress(G->getGlobal(), MVT::i32,
764 G->getOffset() + Offset);
765 } else if (ConstantPoolSDNode *CP =
766 dyn_cast<ConstantPoolSDNode>(N0.getOperand(0))) {
767 C = CurDAG->getTargetConstantPool(CP->get(), MVT::i32,
768 CP->getAlignment(),
769 CP->getOffset()+Offset);
770 }
771
772 if (C.Val) {
773 if (N.Val->hasOneUse()) {
774 Result = CurDAG->SelectNodeTo(N.Val, X86::MOV32ri, MVT::i32, C);
775 } else {
776 SDNode *ResNode = CurDAG->getTargetNode(X86::MOV32ri, MVT::i32, C);
777 Result = CodeGenMap[N] = SDOperand(ResNode, 0);
778 }
779 return;
780 }
781 }
782
783 // Other cases are handled by auto-generated code.
784 break;
Evan Cheng1f342c22006-02-23 02:43:52 +0000785 }
Evan Chenge0ed6ec2006-02-23 20:41:18 +0000786
Evan Cheng10d27902006-01-06 20:36:21 +0000787 case ISD::MULHU:
788 case ISD::MULHS: {
789 if (Opcode == ISD::MULHU)
790 switch (NVT) {
791 default: assert(0 && "Unsupported VT!");
792 case MVT::i8: Opc = X86::MUL8r; MOpc = X86::MUL8m; break;
793 case MVT::i16: Opc = X86::MUL16r; MOpc = X86::MUL16m; break;
794 case MVT::i32: Opc = X86::MUL32r; MOpc = X86::MUL32m; break;
795 }
796 else
797 switch (NVT) {
798 default: assert(0 && "Unsupported VT!");
799 case MVT::i8: Opc = X86::IMUL8r; MOpc = X86::IMUL8m; break;
800 case MVT::i16: Opc = X86::IMUL16r; MOpc = X86::IMUL16m; break;
801 case MVT::i32: Opc = X86::IMUL32r; MOpc = X86::IMUL32m; break;
802 }
803
804 unsigned LoReg, HiReg;
805 switch (NVT) {
806 default: assert(0 && "Unsupported VT!");
807 case MVT::i8: LoReg = X86::AL; HiReg = X86::AH; break;
808 case MVT::i16: LoReg = X86::AX; HiReg = X86::DX; break;
809 case MVT::i32: LoReg = X86::EAX; HiReg = X86::EDX; break;
810 }
811
812 SDOperand N0 = Node->getOperand(0);
813 SDOperand N1 = Node->getOperand(1);
814
815 bool foldedLoad = false;
816 SDOperand Tmp0, Tmp1, Tmp2, Tmp3;
Evan Chengd5f2ba02006-02-06 06:02:33 +0000817 foldedLoad = TryFoldLoad(N, N1, Tmp0, Tmp1, Tmp2, Tmp3);
Evan Cheng92e27972006-01-06 23:19:29 +0000818 // MULHU and MULHS are commmutative
819 if (!foldedLoad) {
Evan Chengd5f2ba02006-02-06 06:02:33 +0000820 foldedLoad = TryFoldLoad(N, N0, Tmp0, Tmp1, Tmp2, Tmp3);
Evan Cheng92e27972006-01-06 23:19:29 +0000821 if (foldedLoad) {
822 N0 = Node->getOperand(1);
823 N1 = Node->getOperand(0);
824 }
825 }
826
Evan Cheng6dc90ca2006-02-09 00:37:58 +0000827 SDOperand Chain;
828 if (foldedLoad)
829 Select(Chain, N1.getOperand(0));
830 else
831 Chain = CurDAG->getEntryNode();
Evan Cheng10d27902006-01-06 20:36:21 +0000832
Evan Cheng6dc90ca2006-02-09 00:37:58 +0000833 SDOperand InFlag(0, 0);
834 Select(N0, N0);
Evan Cheng10d27902006-01-06 20:36:21 +0000835 Chain = CurDAG->getCopyToReg(Chain, CurDAG->getRegister(LoReg, NVT),
Evan Cheng6dc90ca2006-02-09 00:37:58 +0000836 N0, InFlag);
Evan Cheng10d27902006-01-06 20:36:21 +0000837 InFlag = Chain.getValue(1);
838
839 if (foldedLoad) {
Evan Cheng6dc90ca2006-02-09 00:37:58 +0000840 Select(Tmp0, Tmp0);
841 Select(Tmp1, Tmp1);
842 Select(Tmp2, Tmp2);
843 Select(Tmp3, Tmp3);
Evan Chengd1b82d82006-02-09 07:17:49 +0000844 SDNode *CNode =
845 CurDAG->getTargetNode(MOpc, MVT::Other, MVT::Flag, Tmp0, Tmp1,
846 Tmp2, Tmp3, Chain, InFlag);
847 Chain = SDOperand(CNode, 0);
848 InFlag = SDOperand(CNode, 1);
Evan Cheng10d27902006-01-06 20:36:21 +0000849 } else {
Evan Cheng6dc90ca2006-02-09 00:37:58 +0000850 Select(N1, N1);
Evan Chengd1b82d82006-02-09 07:17:49 +0000851 InFlag =
852 SDOperand(CurDAG->getTargetNode(Opc, MVT::Flag, N1, InFlag), 0);
Evan Cheng10d27902006-01-06 20:36:21 +0000853 }
854
Evan Cheng6dc90ca2006-02-09 00:37:58 +0000855 Result = CurDAG->getCopyFromReg(Chain, HiReg, NVT, InFlag);
Evan Cheng10d27902006-01-06 20:36:21 +0000856 CodeGenMap[N.getValue(0)] = Result;
Evan Chengd5f2ba02006-02-06 06:02:33 +0000857 if (foldedLoad) {
Evan Cheng92e27972006-01-06 23:19:29 +0000858 CodeGenMap[N1.getValue(1)] = Result.getValue(1);
Evan Cheng101e4b92006-02-09 22:12:53 +0000859 AddHandleReplacement(N1.Val, 1, Result.Val, 1);
Evan Chengd5f2ba02006-02-06 06:02:33 +0000860 }
Evan Cheng6dc90ca2006-02-09 00:37:58 +0000861
Evan Chengd49cc362006-02-10 22:24:32 +0000862#ifndef NDEBUG
Evan Chenga86ba852006-02-11 02:05:36 +0000863 DEBUG(std::cerr << std::string(Indent-2, ' '));
Evan Chengd49cc362006-02-10 22:24:32 +0000864 DEBUG(std::cerr << "== ");
865 DEBUG(Result.Val->dump(CurDAG));
866 DEBUG(std::cerr << "\n");
Evan Cheng2b6f78b2006-02-10 22:46:26 +0000867 Indent -= 2;
Evan Chengd49cc362006-02-10 22:24:32 +0000868#endif
Evan Cheng6dc90ca2006-02-09 00:37:58 +0000869 return;
Evan Cheng92e27972006-01-06 23:19:29 +0000870 }
Evan Cheng5588de92006-02-18 00:15:05 +0000871
Evan Cheng92e27972006-01-06 23:19:29 +0000872 case ISD::SDIV:
873 case ISD::UDIV:
874 case ISD::SREM:
875 case ISD::UREM: {
876 bool isSigned = Opcode == ISD::SDIV || Opcode == ISD::SREM;
877 bool isDiv = Opcode == ISD::SDIV || Opcode == ISD::UDIV;
878 if (!isSigned)
879 switch (NVT) {
880 default: assert(0 && "Unsupported VT!");
881 case MVT::i8: Opc = X86::DIV8r; MOpc = X86::DIV8m; break;
882 case MVT::i16: Opc = X86::DIV16r; MOpc = X86::DIV16m; break;
883 case MVT::i32: Opc = X86::DIV32r; MOpc = X86::DIV32m; break;
884 }
885 else
886 switch (NVT) {
887 default: assert(0 && "Unsupported VT!");
888 case MVT::i8: Opc = X86::IDIV8r; MOpc = X86::IDIV8m; break;
889 case MVT::i16: Opc = X86::IDIV16r; MOpc = X86::IDIV16m; break;
890 case MVT::i32: Opc = X86::IDIV32r; MOpc = X86::IDIV32m; break;
891 }
892
893 unsigned LoReg, HiReg;
894 unsigned ClrOpcode, SExtOpcode;
895 switch (NVT) {
896 default: assert(0 && "Unsupported VT!");
897 case MVT::i8:
898 LoReg = X86::AL; HiReg = X86::AH;
Evan Chenga2efb9f2006-06-02 21:20:34 +0000899 ClrOpcode = X86::MOV8r0;
Evan Cheng92e27972006-01-06 23:19:29 +0000900 SExtOpcode = X86::CBW;
901 break;
902 case MVT::i16:
903 LoReg = X86::AX; HiReg = X86::DX;
Evan Chenga2efb9f2006-06-02 21:20:34 +0000904 ClrOpcode = X86::MOV16r0;
Evan Cheng92e27972006-01-06 23:19:29 +0000905 SExtOpcode = X86::CWD;
906 break;
907 case MVT::i32:
908 LoReg = X86::EAX; HiReg = X86::EDX;
Evan Chenga2efb9f2006-06-02 21:20:34 +0000909 ClrOpcode = X86::MOV32r0;
Evan Cheng92e27972006-01-06 23:19:29 +0000910 SExtOpcode = X86::CDQ;
911 break;
912 }
913
914 SDOperand N0 = Node->getOperand(0);
915 SDOperand N1 = Node->getOperand(1);
916
917 bool foldedLoad = false;
918 SDOperand Tmp0, Tmp1, Tmp2, Tmp3;
Evan Chengd5f2ba02006-02-06 06:02:33 +0000919 foldedLoad = TryFoldLoad(N, N1, Tmp0, Tmp1, Tmp2, Tmp3);
Evan Cheng6dc90ca2006-02-09 00:37:58 +0000920 SDOperand Chain;
921 if (foldedLoad)
922 Select(Chain, N1.getOperand(0));
923 else
924 Chain = CurDAG->getEntryNode();
Evan Cheng92e27972006-01-06 23:19:29 +0000925
Evan Cheng6dc90ca2006-02-09 00:37:58 +0000926 SDOperand InFlag(0, 0);
927 Select(N0, N0);
Evan Cheng92e27972006-01-06 23:19:29 +0000928 Chain = CurDAG->getCopyToReg(Chain, CurDAG->getRegister(LoReg, NVT),
Evan Cheng6dc90ca2006-02-09 00:37:58 +0000929 N0, InFlag);
Evan Cheng92e27972006-01-06 23:19:29 +0000930 InFlag = Chain.getValue(1);
931
932 if (isSigned) {
933 // Sign extend the low part into the high part.
Evan Chengd1b82d82006-02-09 07:17:49 +0000934 InFlag =
935 SDOperand(CurDAG->getTargetNode(SExtOpcode, MVT::Flag, InFlag), 0);
Evan Cheng92e27972006-01-06 23:19:29 +0000936 } else {
937 // Zero out the high part, effectively zero extending the input.
Evan Chenga2efb9f2006-06-02 21:20:34 +0000938 SDOperand ClrNode = SDOperand(CurDAG->getTargetNode(ClrOpcode, NVT), 0);
Evan Cheng92e27972006-01-06 23:19:29 +0000939 Chain = CurDAG->getCopyToReg(Chain, CurDAG->getRegister(HiReg, NVT),
940 ClrNode, InFlag);
941 InFlag = Chain.getValue(1);
942 }
943
944 if (foldedLoad) {
Evan Cheng6dc90ca2006-02-09 00:37:58 +0000945 Select(Tmp0, Tmp0);
946 Select(Tmp1, Tmp1);
947 Select(Tmp2, Tmp2);
948 Select(Tmp3, Tmp3);
Evan Chengd1b82d82006-02-09 07:17:49 +0000949 SDNode *CNode =
950 CurDAG->getTargetNode(MOpc, MVT::Other, MVT::Flag, Tmp0, Tmp1,
951 Tmp2, Tmp3, Chain, InFlag);
952 Chain = SDOperand(CNode, 0);
953 InFlag = SDOperand(CNode, 1);
Evan Cheng92e27972006-01-06 23:19:29 +0000954 } else {
Evan Cheng6dc90ca2006-02-09 00:37:58 +0000955 Select(N1, N1);
Evan Chengd1b82d82006-02-09 07:17:49 +0000956 InFlag =
957 SDOperand(CurDAG->getTargetNode(Opc, MVT::Flag, N1, InFlag), 0);
Evan Cheng92e27972006-01-06 23:19:29 +0000958 }
959
Evan Cheng6dc90ca2006-02-09 00:37:58 +0000960 Result = CurDAG->getCopyFromReg(Chain, isDiv ? LoReg : HiReg,
961 NVT, InFlag);
Evan Cheng92e27972006-01-06 23:19:29 +0000962 CodeGenMap[N.getValue(0)] = Result;
Evan Chengd5f2ba02006-02-06 06:02:33 +0000963 if (foldedLoad) {
Evan Cheng92e27972006-01-06 23:19:29 +0000964 CodeGenMap[N1.getValue(1)] = Result.getValue(1);
Evan Cheng101e4b92006-02-09 22:12:53 +0000965 AddHandleReplacement(N1.Val, 1, Result.Val, 1);
Evan Chengd5f2ba02006-02-06 06:02:33 +0000966 }
Evan Chengd49cc362006-02-10 22:24:32 +0000967
968#ifndef NDEBUG
Evan Chenga86ba852006-02-11 02:05:36 +0000969 DEBUG(std::cerr << std::string(Indent-2, ' '));
Evan Chengd49cc362006-02-10 22:24:32 +0000970 DEBUG(std::cerr << "== ");
971 DEBUG(Result.Val->dump(CurDAG));
972 DEBUG(std::cerr << "\n");
Evan Cheng2b6f78b2006-02-10 22:46:26 +0000973 Indent -= 2;
Evan Chengd49cc362006-02-10 22:24:32 +0000974#endif
Evan Cheng6dc90ca2006-02-09 00:37:58 +0000975 return;
Evan Cheng10d27902006-01-06 20:36:21 +0000976 }
Evan Cheng9733bde2006-05-08 08:01:26 +0000977
978 case ISD::TRUNCATE: {
979 if (NVT == MVT::i8) {
980 unsigned Opc2;
981 MVT::ValueType VT;
982 switch (Node->getOperand(0).getValueType()) {
983 default: assert(0 && "Unknown truncate!");
984 case MVT::i16:
985 Opc = X86::MOV16to16_;
986 VT = MVT::i16;
Evan Cheng9fee4422006-05-16 07:21:53 +0000987 Opc2 = X86::TRUNC_GR16_GR8;
Evan Cheng9733bde2006-05-08 08:01:26 +0000988 break;
989 case MVT::i32:
990 Opc = X86::MOV32to32_;
991 VT = MVT::i32;
Evan Cheng9fee4422006-05-16 07:21:53 +0000992 Opc2 = X86::TRUNC_GR32_GR8;
Evan Cheng9733bde2006-05-08 08:01:26 +0000993 break;
994 }
995
996 SDOperand Tmp0, Tmp1;
997 Select(Tmp0, Node->getOperand(0));
998 Tmp1 = SDOperand(CurDAG->getTargetNode(Opc, VT, Tmp0), 0);
999 Result = CodeGenMap[N] =
1000 SDOperand(CurDAG->getTargetNode(Opc2, NVT, Tmp1), 0);
1001
1002#ifndef NDEBUG
1003 DEBUG(std::cerr << std::string(Indent-2, ' '));
1004 DEBUG(std::cerr << "== ");
1005 DEBUG(Result.Val->dump(CurDAG));
1006 DEBUG(std::cerr << "\n");
1007 Indent -= 2;
1008#endif
1009 return;
1010 }
Evan Chenga26c4512006-05-20 07:44:28 +00001011
1012 break;
Evan Cheng9733bde2006-05-08 08:01:26 +00001013 }
Chris Lattner655e7df2005-11-16 01:54:32 +00001014 }
1015
Evan Cheng6dc90ca2006-02-09 00:37:58 +00001016 SelectCode(Result, N);
Evan Chengd49cc362006-02-10 22:24:32 +00001017#ifndef NDEBUG
Evan Chenga86ba852006-02-11 02:05:36 +00001018 DEBUG(std::cerr << std::string(Indent-2, ' '));
Evan Chengd49cc362006-02-10 22:24:32 +00001019 DEBUG(std::cerr << "=> ");
1020 DEBUG(Result.Val->dump(CurDAG));
1021 DEBUG(std::cerr << "\n");
Evan Cheng2b6f78b2006-02-10 22:46:26 +00001022 Indent -= 2;
Evan Chengd49cc362006-02-10 22:24:32 +00001023#endif
Chris Lattner655e7df2005-11-16 01:54:32 +00001024}
1025
Chris Lattnerba1ed582006-06-08 18:03:49 +00001026bool X86DAGToDAGISel::
1027SelectInlineAsmMemoryOperand(const SDOperand &Op, char ConstraintCode,
1028 std::vector<SDOperand> &OutOps, SelectionDAG &DAG){
1029 SDOperand Op0, Op1, Op2, Op3;
1030 switch (ConstraintCode) {
1031 case 'o': // offsetable ??
1032 case 'v': // not offsetable ??
1033 default: return true;
1034 case 'm': // memory
1035 if (!SelectAddr(Op, Op0, Op1, Op2, Op3))
1036 return true;
1037 break;
1038 }
1039
1040 OutOps.resize(4);
1041 Select(OutOps[0], Op0);
1042 Select(OutOps[1], Op1);
1043 Select(OutOps[2], Op2);
1044 Select(OutOps[3], Op3);
1045 return false;
1046}
1047
Chris Lattner655e7df2005-11-16 01:54:32 +00001048/// createX86ISelDag - This pass converts a legalized DAG into a
1049/// X86-specific DAG, ready for instruction scheduling.
1050///
Evan Cheng2dd2c652006-03-13 23:20:37 +00001051FunctionPass *llvm::createX86ISelDag(X86TargetMachine &TM) {
Chris Lattner655e7df2005-11-16 01:54:32 +00001052 return new X86DAGToDAGISel(TM);
1053}