blob: 901409a15451bc5a367f5a3fce3d6cfc3319c310 [file] [log] [blame]
Chris Lattner7a125372005-11-16 22:59:19 +00001//===- X86ISelDAGToDAG.cpp - A DAG pattern matching inst selector for X86 -===//
Chris Lattnerc961eea2005-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 Chengf597dc72006-02-10 22:24:32 +000015#define DEBUG_TYPE "isel"
Chris Lattnerc961eea2005-11-16 01:54:32 +000016#include "X86.h"
Evan Cheng8700e142006-01-11 06:09:51 +000017#include "X86InstrBuilder.h"
Evan Chengc4c62572006-03-13 23:20:37 +000018#include "X86ISelLowering.h"
Chris Lattner92cb0af2006-01-11 01:15:34 +000019#include "X86RegisterInfo.h"
Chris Lattnerc961eea2005-11-16 01:54:32 +000020#include "X86Subtarget.h"
Evan Chengc4c62572006-03-13 23:20:37 +000021#include "X86TargetMachine.h"
Chris Lattnerf9ce9fb2005-11-19 02:11:08 +000022#include "llvm/GlobalValue.h"
Chris Lattner92cb0af2006-01-11 01:15:34 +000023#include "llvm/Instructions.h"
Chris Lattner420736d2006-03-25 06:47:10 +000024#include "llvm/Intrinsics.h"
Chris Lattner92cb0af2006-01-11 01:15:34 +000025#include "llvm/Support/CFG.h"
Chris Lattnerf9ce9fb2005-11-19 02:11:08 +000026#include "llvm/CodeGen/MachineConstantPool.h"
Chris Lattnerc961eea2005-11-16 01:54:32 +000027#include "llvm/CodeGen/MachineFunction.h"
Evan Chengaaca22c2006-01-10 20:26:56 +000028#include "llvm/CodeGen/MachineFrameInfo.h"
Chris Lattner92cb0af2006-01-11 01:15:34 +000029#include "llvm/CodeGen/MachineInstrBuilder.h"
30#include "llvm/CodeGen/SSARegMap.h"
Chris Lattnerc961eea2005-11-16 01:54:32 +000031#include "llvm/CodeGen/SelectionDAGISel.h"
32#include "llvm/Target/TargetMachine.h"
33#include "llvm/Support/Debug.h"
Chris Lattner2c79de82006-06-28 23:27:49 +000034#include "llvm/Support/Visibility.h"
Chris Lattnerc961eea2005-11-16 01:54:32 +000035#include "llvm/ADT/Statistic.h"
Chris Lattner2c2c6c62006-01-22 23:41:00 +000036#include <iostream>
Evan Chenga8df1b42006-07-27 16:44:36 +000037#include <list>
Evan Chengba2f0a92006-02-05 06:46:41 +000038#include <set>
Chris Lattnerc961eea2005-11-16 01:54:32 +000039using namespace llvm;
40
41//===----------------------------------------------------------------------===//
42// Pattern Matcher Implementation
43//===----------------------------------------------------------------------===//
44
45namespace {
Chris Lattnerf9ce9fb2005-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 Lattnerd74ea2b2006-05-24 17:04:05 +000052 FrameIndexBase
Chris Lattnerf9ce9fb2005-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 Cheng51a9ed92006-02-25 10:09:08 +000064 Constant *CP;
65 unsigned Align; // CP alignment.
Chris Lattnerf9ce9fb2005-11-19 02:11:08 +000066
67 X86ISelAddressMode()
Evan Cheng51a9ed92006-02-25 10:09:08 +000068 : BaseType(RegBase), Scale(1), IndexReg(), Disp(0), GV(0),
69 CP(0), Align(0) {
Chris Lattnerf9ce9fb2005-11-19 02:11:08 +000070 }
71 };
72}
73
74namespace {
Chris Lattnerc961eea2005-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 Lattner2c79de82006-06-28 23:27:49 +000082 class VISIBILITY_HIDDEN X86DAGToDAGISel : public SelectionDAGISel {
Chris Lattnerc961eea2005-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 Cheng7ccced62006-02-18 00:15:05 +000094
95 unsigned GlobalBaseReg;
Evan Chenga8df1b42006-07-27 16:44:36 +000096
Chris Lattnerc961eea2005-11-16 01:54:32 +000097 public:
Evan Chengc4c62572006-03-13 23:20:37 +000098 X86DAGToDAGISel(X86TargetMachine &TM)
99 : SelectionDAGISel(X86Lowering),
Evan Chenga8df1b42006-07-27 16:44:36 +0000100 X86Lowering(*TM.getTargetLowering()),
101 Subtarget(&TM.getSubtarget<X86Subtarget>()),
102 DAGSize(0), ReachibilityMatrix(NULL) {}
Chris Lattnerc961eea2005-11-16 01:54:32 +0000103
Evan Cheng7ccced62006-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 Lattnerc961eea2005-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 Cheng8700e142006-01-11 06:09:51 +0000118 virtual void EmitFunctionEntryCode(Function &Fn, MachineFunction &MF);
119
Evan Chenga8df1b42006-07-27 16:44:36 +0000120 virtual bool IsFoldableBy(SDNode *N, SDNode *U);
121
Chris Lattnerc961eea2005-11-16 01:54:32 +0000122// Include the pieces autogenerated from the target description.
123#include "X86GenDAGISel.inc"
124
125 private:
Evan Chenga8df1b42006-07-27 16:44:36 +0000126 void DetermineTopologicalOrdering();
Evan Cheng5fa5de82006-07-27 22:10:00 +0000127 void DeterminReachibility(SDNode *f, SDNode *t);
Evan Chenga8df1b42006-07-27 16:44:36 +0000128
Evan Cheng34167212006-02-09 00:37:58 +0000129 void Select(SDOperand &Result, SDOperand N);
Chris Lattnerc961eea2005-11-16 01:54:32 +0000130
Evan Cheng2486af12006-02-11 02:05:36 +0000131 bool MatchAddress(SDOperand N, X86ISelAddressMode &AM, bool isRoot = true);
Evan Chengec693f72005-12-08 02:01:35 +0000132 bool SelectAddr(SDOperand N, SDOperand &Base, SDOperand &Scale,
133 SDOperand &Index, SDOperand &Disp);
134 bool SelectLEAAddr(SDOperand N, SDOperand &Base, SDOperand &Scale,
135 SDOperand &Index, SDOperand &Disp);
Evan Cheng5e351682006-02-06 06:02:33 +0000136 bool TryFoldLoad(SDOperand P, SDOperand N,
137 SDOperand &Base, SDOperand &Scale,
Evan Cheng0114e942006-01-06 20:36:21 +0000138 SDOperand &Index, SDOperand &Disp);
Chris Lattnerc0bad572006-06-08 18:03:49 +0000139 /// SelectInlineAsmMemoryOperand - Implement addressing mode selection for
140 /// inline asm expressions.
141 virtual bool SelectInlineAsmMemoryOperand(const SDOperand &Op,
142 char ConstraintCode,
143 std::vector<SDOperand> &OutOps,
144 SelectionDAG &DAG);
145
Evan Cheng3649b0e2006-06-02 22:38:37 +0000146 void EmitSpecialCodeForMain(MachineBasicBlock *BB, MachineFrameInfo *MFI);
147
Evan Chenge5280532005-12-12 21:49:40 +0000148 inline void getAddressOperands(X86ISelAddressMode &AM, SDOperand &Base,
149 SDOperand &Scale, SDOperand &Index,
150 SDOperand &Disp) {
151 Base = (AM.BaseType == X86ISelAddressMode::FrameIndexBase) ?
152 CurDAG->getTargetFrameIndex(AM.Base.FrameIndex, MVT::i32) : AM.Base.Reg;
Evan Chengbdce7b42005-12-17 09:13:43 +0000153 Scale = getI8Imm(AM.Scale);
Evan Chenge5280532005-12-12 21:49:40 +0000154 Index = AM.IndexReg;
155 Disp = AM.GV ? CurDAG->getTargetGlobalAddress(AM.GV, MVT::i32, AM.Disp)
Evan Cheng51a9ed92006-02-25 10:09:08 +0000156 : (AM.CP ?
157 CurDAG->getTargetConstantPool(AM.CP, MVT::i32, AM.Align, AM.Disp)
158 : getI32Imm(AM.Disp));
Evan Chenge5280532005-12-12 21:49:40 +0000159 }
160
Chris Lattnerf9ce9fb2005-11-19 02:11:08 +0000161 /// getI8Imm - Return a target constant with the specified value, of type
162 /// i8.
163 inline SDOperand getI8Imm(unsigned Imm) {
164 return CurDAG->getTargetConstant(Imm, MVT::i8);
165 }
166
Chris Lattnerc961eea2005-11-16 01:54:32 +0000167 /// getI16Imm - Return a target constant with the specified value, of type
168 /// i16.
169 inline SDOperand getI16Imm(unsigned Imm) {
170 return CurDAG->getTargetConstant(Imm, MVT::i16);
171 }
172
173 /// getI32Imm - Return a target constant with the specified value, of type
174 /// i32.
175 inline SDOperand getI32Imm(unsigned Imm) {
176 return CurDAG->getTargetConstant(Imm, MVT::i32);
177 }
Evan Chengf597dc72006-02-10 22:24:32 +0000178
Evan Cheng7ccced62006-02-18 00:15:05 +0000179 /// getGlobalBaseReg - insert code into the entry mbb to materialize the PIC
180 /// base register. Return the virtual register that holds this value.
181 SDOperand getGlobalBaseReg();
182
Evan Chenga8df1b42006-07-27 16:44:36 +0000183 /// DAGSize - Number of nodes in the DAG.
184 ///
185 unsigned DAGSize;
186
187 /// TopOrder - Topological ordering of all nodes in the DAG.
188 ///
Evan Cheng5fa5de82006-07-27 22:10:00 +0000189 SDNode* *TopOrder;
190
191 /// IdToOrder - Node id to topological order map.
192 ///
193 unsigned *IdToOrder;
194
195 /// RMRange - The range of reachibility information available for the
196 /// particular source node.
197 unsigned *RMRange;
Evan Chenga8df1b42006-07-27 16:44:36 +0000198
199 /// ReachibilityMatrix - A N x N matrix representing all pairs reachibility
200 /// information. One bit per potential edge.
201 unsigned char *ReachibilityMatrix;
202
203 inline void setReachable(SDNode *f, SDNode *t) {
204 unsigned Idx = f->getNodeId() * DAGSize + t->getNodeId();
205 ReachibilityMatrix[Idx / 8] |= 1 << (Idx % 8);
206 }
207
208 inline bool isReachable(SDNode *f, SDNode *t) {
209 unsigned Idx = f->getNodeId() * DAGSize + t->getNodeId();
210 return ReachibilityMatrix[Idx / 8] & (1 << (Idx % 8));
211 }
212
Evan Cheng23addc02006-02-10 22:46:26 +0000213#ifndef NDEBUG
214 unsigned Indent;
215#endif
Chris Lattnerc961eea2005-11-16 01:54:32 +0000216 };
217}
218
Evan Chenga8df1b42006-07-27 16:44:36 +0000219bool X86DAGToDAGISel::IsFoldableBy(SDNode *N, SDNode *U) {
220 // If U use can somehow reach N through another path then U can't fold N or
221 // it will create a cycle. e.g. In the following diagram, U can reach N
222 // through X. If N is foled into into U, then X is both a predecessor and
223 // a successor of U.
224 //
225 // [ N ]
226 // ^ ^
227 // | |
228 // / \---
229 // / [X]
230 // | ^
231 // [U]--------|
Evan Cheng5fa5de82006-07-27 22:10:00 +0000232 DeterminReachibility(U, N);
Evan Chenga8df1b42006-07-27 16:44:36 +0000233 assert(isReachable(U, N) && "Attempting to fold a non-operand node?");
234 for (SDNode::op_iterator I = U->op_begin(), E = U->op_end(); I != E; ++I) {
235 SDNode *P = I->Val;
236 if (P != N && isReachable(P, N))
237 return false;
238 }
239 return true;
240}
241
242/// DetermineTopologicalOrdering - Determine topological ordering of the nodes
243/// in the DAG.
244void X86DAGToDAGISel::DetermineTopologicalOrdering() {
245 DAGSize = CurDAG->AssignNodeIds();
Evan Cheng5fa5de82006-07-27 22:10:00 +0000246 TopOrder = new SDNode*[DAGSize];
247 IdToOrder = new unsigned[DAGSize];
248 memset(IdToOrder, 0, DAGSize * sizeof(unsigned));
249 RMRange = new unsigned[DAGSize];
250 memset(RMRange, 0, DAGSize * sizeof(unsigned));
Evan Chenga8df1b42006-07-27 16:44:36 +0000251
252 std::vector<unsigned> InDegree(DAGSize);
253 std::list<SDNode*> Sources;
254 for (SelectionDAG::allnodes_iterator I = CurDAG->allnodes_begin(),
255 E = CurDAG->allnodes_end(); I != E; ++I) {
256 SDNode *N = I;
257 unsigned Degree = N->use_size();
258 InDegree[N->getNodeId()] = Degree;
259 if (Degree == 0)
260 Sources.push_back(I);
261 }
262
263 unsigned Order = 0;
264 while (!Sources.empty()) {
265 SDNode *N = Sources.front();
266 Sources.pop_front();
267 TopOrder[Order] = N;
Evan Cheng5fa5de82006-07-27 22:10:00 +0000268 IdToOrder[N->getNodeId()] = Order;
Evan Chenga8df1b42006-07-27 16:44:36 +0000269 Order++;
270 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I) {
271 SDNode *P = I->Val;
272 int PId = P->getNodeId();
273 unsigned Degree = InDegree[PId] - 1;
274 if (Degree == 0)
275 Sources.push_back(P);
276 InDegree[PId] = Degree;
277 }
278 }
279}
280
Evan Cheng5fa5de82006-07-27 22:10:00 +0000281void X86DAGToDAGISel::DeterminReachibility(SDNode *f, SDNode *t) {
282 if (!ReachibilityMatrix) {
283 DetermineTopologicalOrdering();
284 ReachibilityMatrix = new unsigned char[DAGSize * DAGSize];
285 memset(ReachibilityMatrix, 0, DAGSize * DAGSize * sizeof(unsigned char));
286 }
Evan Chenga8df1b42006-07-27 16:44:36 +0000287
Evan Cheng5fa5de82006-07-27 22:10:00 +0000288 int Idf = f->getNodeId();
289 int Idt = t->getNodeId();
290 unsigned Orderf = IdToOrder[Idf];
291 unsigned Ordert = IdToOrder[Idt];
292 unsigned Range = RMRange[Idf];
293 if (Range >= Ordert)
294 return;
295 if (Range < Orderf)
296 Range = Orderf;
297
298 for (unsigned i = Range; i < Ordert; ++i) {
Evan Chenga8df1b42006-07-27 16:44:36 +0000299 SDNode *N = TopOrder[i];
300 setReachable(N, N);
301 // If N is a leaf node, there is nothing more to do.
302 if (N->getNumOperands() == 0)
303 continue;
304
Evan Cheng5fa5de82006-07-27 22:10:00 +0000305 for (unsigned i2 = Orderf; ; ++i2) {
Evan Chenga8df1b42006-07-27 16:44:36 +0000306 SDNode *M = TopOrder[i2];
307 if (isReachable(M, N)) {
308 // Update reachibility from M to N's operands.
309 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E;++I)
310 setReachable(M, I->Val);
311 }
312 if (M == N) break;
313 }
314 }
Evan Cheng5fa5de82006-07-27 22:10:00 +0000315
316 RMRange[Idf] = Ordert;
Evan Chenga8df1b42006-07-27 16:44:36 +0000317}
318
Chris Lattnerc961eea2005-11-16 01:54:32 +0000319/// InstructionSelectBasicBlock - This callback is invoked by SelectionDAGISel
320/// when it has created a SelectionDAG for us to codegen.
321void X86DAGToDAGISel::InstructionSelectBasicBlock(SelectionDAG &DAG) {
322 DEBUG(BB->dump());
Chris Lattner92cb0af2006-01-11 01:15:34 +0000323 MachineFunction::iterator FirstMBB = BB;
Chris Lattnerc961eea2005-11-16 01:54:32 +0000324
325 // Codegen the basic block.
Evan Chengf597dc72006-02-10 22:24:32 +0000326#ifndef NDEBUG
327 DEBUG(std::cerr << "===== Instruction selection begins:\n");
Evan Cheng23addc02006-02-10 22:46:26 +0000328 Indent = 0;
Evan Chengf597dc72006-02-10 22:24:32 +0000329#endif
Evan Chengba2f0a92006-02-05 06:46:41 +0000330 DAG.setRoot(SelectRoot(DAG.getRoot()));
Evan Cheng6a3d5a62006-05-25 00:24:28 +0000331 assert(InFlightSet.empty() && "ISel InFlightSet has not been emptied!");
Evan Chengf597dc72006-02-10 22:24:32 +0000332#ifndef NDEBUG
333 DEBUG(std::cerr << "===== Instruction selection ends:\n");
334#endif
Evan Chenga8df1b42006-07-27 16:44:36 +0000335 if (ReachibilityMatrix) {
336 delete[] ReachibilityMatrix;
Evan Cheng5fa5de82006-07-27 22:10:00 +0000337 delete[] TopOrder;
338 delete[] IdToOrder;
339 delete[] RMRange;
Evan Chenga8df1b42006-07-27 16:44:36 +0000340 ReachibilityMatrix = NULL;
Evan Cheng5fa5de82006-07-27 22:10:00 +0000341 TopOrder = NULL;
342 IdToOrder = RMRange = NULL;
Evan Chenga8df1b42006-07-27 16:44:36 +0000343 }
Evan Chengfcaa9952005-12-19 22:36:02 +0000344 CodeGenMap.clear();
Evan Chengafe358e2006-05-24 20:46:25 +0000345 HandleMap.clear();
346 ReplaceMap.clear();
Chris Lattnerc961eea2005-11-16 01:54:32 +0000347 DAG.RemoveDeadNodes();
348
349 // Emit machine code to BB.
350 ScheduleAndEmitDAG(DAG);
Chris Lattner92cb0af2006-01-11 01:15:34 +0000351
352 // If we are emitting FP stack code, scan the basic block to determine if this
353 // block defines any FP values. If so, put an FP_REG_KILL instruction before
354 // the terminator of the block.
Evan Cheng559806f2006-01-27 08:10:46 +0000355 if (!Subtarget->hasSSE2()) {
Chris Lattner92cb0af2006-01-11 01:15:34 +0000356 // Note that FP stack instructions *are* used in SSE code when returning
357 // values, but these are not live out of the basic block, so we don't need
358 // an FP_REG_KILL in this case either.
359 bool ContainsFPCode = false;
360
361 // Scan all of the machine instructions in these MBBs, checking for FP
362 // stores.
363 MachineFunction::iterator MBBI = FirstMBB;
364 do {
365 for (MachineBasicBlock::iterator I = MBBI->begin(), E = MBBI->end();
366 !ContainsFPCode && I != E; ++I) {
367 for (unsigned op = 0, e = I->getNumOperands(); op != e; ++op) {
368 if (I->getOperand(op).isRegister() && I->getOperand(op).isDef() &&
369 MRegisterInfo::isVirtualRegister(I->getOperand(op).getReg()) &&
370 RegMap->getRegClass(I->getOperand(0).getReg()) ==
371 X86::RFPRegisterClass) {
372 ContainsFPCode = true;
373 break;
374 }
375 }
376 }
377 } while (!ContainsFPCode && &*(MBBI++) != BB);
378
379 // Check PHI nodes in successor blocks. These PHI's will be lowered to have
380 // a copy of the input value in this block.
381 if (!ContainsFPCode) {
382 // Final check, check LLVM BB's that are successors to the LLVM BB
383 // corresponding to BB for FP PHI nodes.
384 const BasicBlock *LLVMBB = BB->getBasicBlock();
385 const PHINode *PN;
386 for (succ_const_iterator SI = succ_begin(LLVMBB), E = succ_end(LLVMBB);
387 !ContainsFPCode && SI != E; ++SI) {
388 for (BasicBlock::const_iterator II = SI->begin();
389 (PN = dyn_cast<PHINode>(II)); ++II) {
390 if (PN->getType()->isFloatingPoint()) {
391 ContainsFPCode = true;
392 break;
393 }
394 }
395 }
396 }
397
398 // Finally, if we found any FP code, emit the FP_REG_KILL instruction.
399 if (ContainsFPCode) {
400 BuildMI(*BB, BB->getFirstTerminator(), X86::FP_REG_KILL, 0);
401 ++NumFPKill;
402 }
403 }
Chris Lattnerc961eea2005-11-16 01:54:32 +0000404}
405
Evan Cheng8700e142006-01-11 06:09:51 +0000406/// EmitSpecialCodeForMain - Emit any code that needs to be executed only in
407/// the main function.
Evan Cheng3649b0e2006-06-02 22:38:37 +0000408void X86DAGToDAGISel::EmitSpecialCodeForMain(MachineBasicBlock *BB,
409 MachineFrameInfo *MFI) {
410 if (Subtarget->TargetType == X86Subtarget::isCygwin)
411 BuildMI(BB, X86::CALLpcrel32, 1).addExternalSymbol("__main");
412
Evan Cheng8700e142006-01-11 06:09:51 +0000413 // Switch the FPU to 64-bit precision mode for better compatibility and speed.
414 int CWFrameIdx = MFI->CreateStackObject(2, 2);
415 addFrameReference(BuildMI(BB, X86::FNSTCW16m, 4), CWFrameIdx);
416
417 // Set the high part to be 64-bit precision.
418 addFrameReference(BuildMI(BB, X86::MOV8mi, 5),
419 CWFrameIdx, 1).addImm(2);
420
421 // Reload the modified control word now.
422 addFrameReference(BuildMI(BB, X86::FLDCW16m, 4), CWFrameIdx);
423}
424
425void X86DAGToDAGISel::EmitFunctionEntryCode(Function &Fn, MachineFunction &MF) {
426 // If this is main, emit special code for main.
427 MachineBasicBlock *BB = MF.begin();
428 if (Fn.hasExternalLinkage() && Fn.getName() == "main")
429 EmitSpecialCodeForMain(BB, MF.getFrameInfo());
430}
431
Chris Lattnerf9ce9fb2005-11-19 02:11:08 +0000432/// MatchAddress - Add the specified node to the specified addressing mode,
433/// returning true if it cannot be done. This just pattern matches for the
434/// addressing mode
Evan Cheng2486af12006-02-11 02:05:36 +0000435bool X86DAGToDAGISel::MatchAddress(SDOperand N, X86ISelAddressMode &AM,
436 bool isRoot) {
Evan Cheng51a9ed92006-02-25 10:09:08 +0000437 bool Available = false;
438 // If N has already been selected, reuse the result unless in some very
439 // specific cases.
Evan Cheng2486af12006-02-11 02:05:36 +0000440 std::map<SDOperand, SDOperand>::iterator CGMI= CodeGenMap.find(N.getValue(0));
441 if (CGMI != CodeGenMap.end()) {
Evan Cheng51a9ed92006-02-25 10:09:08 +0000442 Available = true;
Evan Cheng2486af12006-02-11 02:05:36 +0000443 }
444
Chris Lattnerf9ce9fb2005-11-19 02:11:08 +0000445 switch (N.getOpcode()) {
446 default: break;
Evan Cheng51a9ed92006-02-25 10:09:08 +0000447 case ISD::Constant:
448 AM.Disp += cast<ConstantSDNode>(N)->getValue();
449 return false;
450
451 case X86ISD::Wrapper:
452 // If both base and index components have been picked, we can't fit
453 // the result available in the register in the addressing mode. Duplicate
454 // GlobalAddress or ConstantPool as displacement.
455 if (!Available || (AM.Base.Reg.Val && AM.IndexReg.Val)) {
456 if (ConstantPoolSDNode *CP =
457 dyn_cast<ConstantPoolSDNode>(N.getOperand(0))) {
458 if (AM.CP == 0) {
459 AM.CP = CP->get();
460 AM.Align = CP->getAlignment();
461 AM.Disp += CP->getOffset();
462 return false;
463 }
464 } else if (GlobalAddressSDNode *G =
465 dyn_cast<GlobalAddressSDNode>(N.getOperand(0))) {
466 if (AM.GV == 0) {
467 AM.GV = G->getGlobal();
468 AM.Disp += G->getOffset();
469 return false;
470 }
471 }
472 }
473 break;
474
Chris Lattnerf9ce9fb2005-11-19 02:11:08 +0000475 case ISD::FrameIndex:
476 if (AM.BaseType == X86ISelAddressMode::RegBase && AM.Base.Reg.Val == 0) {
477 AM.BaseType = X86ISelAddressMode::FrameIndexBase;
478 AM.Base.FrameIndex = cast<FrameIndexSDNode>(N)->getIndex();
479 return false;
480 }
481 break;
Evan Chengec693f72005-12-08 02:01:35 +0000482
Chris Lattnerf9ce9fb2005-11-19 02:11:08 +0000483 case ISD::SHL:
Evan Cheng51a9ed92006-02-25 10:09:08 +0000484 if (!Available && AM.IndexReg.Val == 0 && AM.Scale == 1)
Chris Lattnerf9ce9fb2005-11-19 02:11:08 +0000485 if (ConstantSDNode *CN = dyn_cast<ConstantSDNode>(N.Val->getOperand(1))) {
486 unsigned Val = CN->getValue();
487 if (Val == 1 || Val == 2 || Val == 3) {
488 AM.Scale = 1 << Val;
489 SDOperand ShVal = N.Val->getOperand(0);
490
491 // Okay, we know that we have a scale by now. However, if the scaled
492 // value is an add of something and a constant, we can fold the
493 // constant into the disp field here.
494 if (ShVal.Val->getOpcode() == ISD::ADD && ShVal.hasOneUse() &&
495 isa<ConstantSDNode>(ShVal.Val->getOperand(1))) {
496 AM.IndexReg = ShVal.Val->getOperand(0);
497 ConstantSDNode *AddVal =
498 cast<ConstantSDNode>(ShVal.Val->getOperand(1));
499 AM.Disp += AddVal->getValue() << Val;
500 } else {
501 AM.IndexReg = ShVal;
502 }
503 return false;
504 }
505 }
506 break;
Evan Chengec693f72005-12-08 02:01:35 +0000507
Chris Lattnerf9ce9fb2005-11-19 02:11:08 +0000508 case ISD::MUL:
509 // X*[3,5,9] -> X+X*[2,4,8]
Evan Cheng51a9ed92006-02-25 10:09:08 +0000510 if (!Available &&
511 AM.BaseType == X86ISelAddressMode::RegBase &&
512 AM.Base.Reg.Val == 0 &&
513 AM.IndexReg.Val == 0)
Chris Lattnerf9ce9fb2005-11-19 02:11:08 +0000514 if (ConstantSDNode *CN = dyn_cast<ConstantSDNode>(N.Val->getOperand(1)))
515 if (CN->getValue() == 3 || CN->getValue() == 5 || CN->getValue() == 9) {
516 AM.Scale = unsigned(CN->getValue())-1;
517
518 SDOperand MulVal = N.Val->getOperand(0);
519 SDOperand Reg;
520
521 // Okay, we know that we have a scale by now. However, if the scaled
522 // value is an add of something and a constant, we can fold the
523 // constant into the disp field here.
524 if (MulVal.Val->getOpcode() == ISD::ADD && MulVal.hasOneUse() &&
525 isa<ConstantSDNode>(MulVal.Val->getOperand(1))) {
526 Reg = MulVal.Val->getOperand(0);
527 ConstantSDNode *AddVal =
528 cast<ConstantSDNode>(MulVal.Val->getOperand(1));
529 AM.Disp += AddVal->getValue() * CN->getValue();
530 } else {
531 Reg = N.Val->getOperand(0);
532 }
533
534 AM.IndexReg = AM.Base.Reg = Reg;
535 return false;
536 }
537 break;
538
539 case ISD::ADD: {
Evan Cheng51a9ed92006-02-25 10:09:08 +0000540 if (!Available) {
Evan Cheng2486af12006-02-11 02:05:36 +0000541 X86ISelAddressMode Backup = AM;
542 if (!MatchAddress(N.Val->getOperand(0), AM, false) &&
543 !MatchAddress(N.Val->getOperand(1), AM, false))
544 return false;
545 AM = Backup;
546 if (!MatchAddress(N.Val->getOperand(1), AM, false) &&
547 !MatchAddress(N.Val->getOperand(0), AM, false))
548 return false;
549 AM = Backup;
550 }
Chris Lattnerf9ce9fb2005-11-19 02:11:08 +0000551 break;
552 }
Evan Chenge6ad27e2006-05-30 06:59:36 +0000553
554 case ISD::OR: {
555 if (!Available) {
556 X86ISelAddressMode Backup = AM;
557 // Look for (x << c1) | c2 where (c2 < c1)
558 ConstantSDNode *CN = dyn_cast<ConstantSDNode>(N.Val->getOperand(0));
559 if (CN && !MatchAddress(N.Val->getOperand(1), AM, false)) {
560 if (AM.GV == NULL && AM.Disp == 0 && CN->getValue() < AM.Scale) {
561 AM.Disp = CN->getValue();
562 return false;
563 }
564 }
565 AM = Backup;
566 CN = dyn_cast<ConstantSDNode>(N.Val->getOperand(1));
567 if (CN && !MatchAddress(N.Val->getOperand(0), AM, false)) {
568 if (AM.GV == NULL && AM.Disp == 0 && CN->getValue() < AM.Scale) {
569 AM.Disp = CN->getValue();
570 return false;
571 }
572 }
573 AM = Backup;
574 }
575 break;
576 }
Chris Lattnerf9ce9fb2005-11-19 02:11:08 +0000577 }
578
579 // Is the base register already occupied?
580 if (AM.BaseType != X86ISelAddressMode::RegBase || AM.Base.Reg.Val) {
581 // If so, check to see if the scale index register is set.
582 if (AM.IndexReg.Val == 0) {
583 AM.IndexReg = N;
584 AM.Scale = 1;
585 return false;
586 }
587
588 // Otherwise, we cannot select it.
589 return true;
590 }
591
592 // Default, generate it as a register.
593 AM.BaseType = X86ISelAddressMode::RegBase;
594 AM.Base.Reg = N;
595 return false;
596}
597
Evan Chengec693f72005-12-08 02:01:35 +0000598/// SelectAddr - returns true if it is able pattern match an addressing mode.
599/// It returns the operands which make up the maximal addressing mode it can
600/// match by reference.
601bool X86DAGToDAGISel::SelectAddr(SDOperand N, SDOperand &Base, SDOperand &Scale,
602 SDOperand &Index, SDOperand &Disp) {
603 X86ISelAddressMode AM;
Evan Cheng8700e142006-01-11 06:09:51 +0000604 if (MatchAddress(N, AM))
605 return false;
Evan Chengec693f72005-12-08 02:01:35 +0000606
Evan Cheng8700e142006-01-11 06:09:51 +0000607 if (AM.BaseType == X86ISelAddressMode::RegBase) {
Evan Cheng7dd281b2006-02-05 05:25:07 +0000608 if (!AM.Base.Reg.Val)
Evan Cheng8700e142006-01-11 06:09:51 +0000609 AM.Base.Reg = CurDAG->getRegister(0, MVT::i32);
Evan Chengec693f72005-12-08 02:01:35 +0000610 }
Evan Cheng8700e142006-01-11 06:09:51 +0000611
Evan Cheng7dd281b2006-02-05 05:25:07 +0000612 if (!AM.IndexReg.Val)
Evan Cheng8700e142006-01-11 06:09:51 +0000613 AM.IndexReg = CurDAG->getRegister(0, MVT::i32);
614
615 getAddressOperands(AM, Base, Scale, Index, Disp);
Evan Cheng51a9ed92006-02-25 10:09:08 +0000616
Evan Cheng8700e142006-01-11 06:09:51 +0000617 return true;
Evan Chengec693f72005-12-08 02:01:35 +0000618}
619
Evan Cheng51a9ed92006-02-25 10:09:08 +0000620/// SelectLEAAddr - it calls SelectAddr and determines if the maximal addressing
621/// mode it matches can be cost effectively emitted as an LEA instruction.
Evan Cheng51a9ed92006-02-25 10:09:08 +0000622bool X86DAGToDAGISel::SelectLEAAddr(SDOperand N, SDOperand &Base,
623 SDOperand &Scale,
624 SDOperand &Index, SDOperand &Disp) {
625 X86ISelAddressMode AM;
626 if (MatchAddress(N, AM))
627 return false;
628
629 unsigned Complexity = 0;
630 if (AM.BaseType == X86ISelAddressMode::RegBase)
631 if (AM.Base.Reg.Val)
632 Complexity = 1;
633 else
634 AM.Base.Reg = CurDAG->getRegister(0, MVT::i32);
635 else if (AM.BaseType == X86ISelAddressMode::FrameIndexBase)
636 Complexity = 4;
637
638 if (AM.IndexReg.Val)
639 Complexity++;
640 else
641 AM.IndexReg = CurDAG->getRegister(0, MVT::i32);
642
Evan Cheng8c03fe42006-02-28 21:13:57 +0000643 if (AM.Scale > 2)
Evan Cheng51a9ed92006-02-25 10:09:08 +0000644 Complexity += 2;
Evan Cheng8c03fe42006-02-28 21:13:57 +0000645 // Don't match just leal(,%reg,2). It's cheaper to do addl %reg, %reg
646 else if (AM.Scale > 1)
647 Complexity++;
Evan Cheng51a9ed92006-02-25 10:09:08 +0000648
649 // FIXME: We are artificially lowering the criteria to turn ADD %reg, $GA
650 // to a LEA. This is determined with some expermentation but is by no means
651 // optimal (especially for code size consideration). LEA is nice because of
652 // its three-address nature. Tweak the cost function again when we can run
653 // convertToThreeAddress() at register allocation time.
654 if (AM.GV || AM.CP)
655 Complexity += 2;
656
657 if (AM.Disp && (AM.Base.Reg.Val || AM.IndexReg.Val))
658 Complexity++;
659
660 if (Complexity > 2) {
661 getAddressOperands(AM, Base, Scale, Index, Disp);
662 return true;
663 }
664
665 return false;
666}
667
Evan Cheng5e351682006-02-06 06:02:33 +0000668bool X86DAGToDAGISel::TryFoldLoad(SDOperand P, SDOperand N,
669 SDOperand &Base, SDOperand &Scale,
670 SDOperand &Index, SDOperand &Disp) {
671 if (N.getOpcode() == ISD::LOAD &&
672 N.hasOneUse() &&
673 !CodeGenMap.count(N.getValue(0)) &&
Evan Cheng8cbc93a2006-07-27 21:19:10 +0000674 !IsFoldableBy(N.Val, P.Val))
Evan Cheng0114e942006-01-06 20:36:21 +0000675 return SelectAddr(N.getOperand(1), Base, Scale, Index, Disp);
676 return false;
677}
678
679static bool isRegister0(SDOperand Op) {
Evan Chengec693f72005-12-08 02:01:35 +0000680 if (RegisterSDNode *R = dyn_cast<RegisterSDNode>(Op))
681 return (R->getReg() == 0);
682 return false;
683}
684
Evan Cheng7ccced62006-02-18 00:15:05 +0000685/// getGlobalBaseReg - Output the instructions required to put the
686/// base address to use for accessing globals into a register.
687///
688SDOperand X86DAGToDAGISel::getGlobalBaseReg() {
689 if (!GlobalBaseReg) {
690 // Insert the set of GlobalBaseReg into the first MBB of the function
691 MachineBasicBlock &FirstMBB = BB->getParent()->front();
692 MachineBasicBlock::iterator MBBI = FirstMBB.begin();
693 SSARegMap *RegMap = BB->getParent()->getSSARegMap();
694 // FIXME: when we get to LP64, we will need to create the appropriate
695 // type of register here.
Evan Cheng069287d2006-05-16 07:21:53 +0000696 GlobalBaseReg = RegMap->createVirtualRegister(X86::GR32RegisterClass);
Evan Cheng7ccced62006-02-18 00:15:05 +0000697 BuildMI(FirstMBB, MBBI, X86::MovePCtoStack, 0);
698 BuildMI(FirstMBB, MBBI, X86::POP32r, 1, GlobalBaseReg);
699 }
700 return CurDAG->getRegister(GlobalBaseReg, MVT::i32);
701}
702
Evan Chengb245d922006-05-20 01:36:52 +0000703static SDNode *FindCallStartFromCall(SDNode *Node) {
704 if (Node->getOpcode() == ISD::CALLSEQ_START) return Node;
705 assert(Node->getOperand(0).getValueType() == MVT::Other &&
706 "Node doesn't have a token chain argument!");
707 return FindCallStartFromCall(Node->getOperand(0).Val);
708}
709
Evan Cheng34167212006-02-09 00:37:58 +0000710void X86DAGToDAGISel::Select(SDOperand &Result, SDOperand N) {
Evan Chengdef941b2005-12-15 01:02:48 +0000711 SDNode *Node = N.Val;
712 MVT::ValueType NVT = Node->getValueType(0);
Evan Cheng0114e942006-01-06 20:36:21 +0000713 unsigned Opc, MOpc;
714 unsigned Opcode = Node->getOpcode();
Chris Lattnerc961eea2005-11-16 01:54:32 +0000715
Evan Chengf597dc72006-02-10 22:24:32 +0000716#ifndef NDEBUG
Evan Cheng23addc02006-02-10 22:46:26 +0000717 DEBUG(std::cerr << std::string(Indent, ' '));
Evan Chengf597dc72006-02-10 22:24:32 +0000718 DEBUG(std::cerr << "Selecting: ");
719 DEBUG(Node->dump(CurDAG));
720 DEBUG(std::cerr << "\n");
Evan Cheng23addc02006-02-10 22:46:26 +0000721 Indent += 2;
Evan Chengf597dc72006-02-10 22:24:32 +0000722#endif
723
Evan Cheng34167212006-02-09 00:37:58 +0000724 if (Opcode >= ISD::BUILTIN_OP_END && Opcode < X86ISD::FIRST_NUMBER) {
725 Result = N;
Evan Chengf597dc72006-02-10 22:24:32 +0000726#ifndef NDEBUG
Evan Cheng2486af12006-02-11 02:05:36 +0000727 DEBUG(std::cerr << std::string(Indent-2, ' '));
Evan Chengf597dc72006-02-10 22:24:32 +0000728 DEBUG(std::cerr << "== ");
729 DEBUG(Node->dump(CurDAG));
730 DEBUG(std::cerr << "\n");
Evan Cheng23addc02006-02-10 22:46:26 +0000731 Indent -= 2;
Evan Chengf597dc72006-02-10 22:24:32 +0000732#endif
Evan Cheng34167212006-02-09 00:37:58 +0000733 return; // Already selected.
734 }
Evan Cheng38262ca2006-01-11 22:15:18 +0000735
736 std::map<SDOperand, SDOperand>::iterator CGMI = CodeGenMap.find(N);
Evan Cheng34167212006-02-09 00:37:58 +0000737 if (CGMI != CodeGenMap.end()) {
738 Result = CGMI->second;
Evan Chengf597dc72006-02-10 22:24:32 +0000739#ifndef NDEBUG
Evan Cheng2486af12006-02-11 02:05:36 +0000740 DEBUG(std::cerr << std::string(Indent-2, ' '));
Evan Chengf597dc72006-02-10 22:24:32 +0000741 DEBUG(std::cerr << "== ");
742 DEBUG(Result.Val->dump(CurDAG));
743 DEBUG(std::cerr << "\n");
Evan Cheng23addc02006-02-10 22:46:26 +0000744 Indent -= 2;
Evan Chengf597dc72006-02-10 22:24:32 +0000745#endif
Evan Cheng34167212006-02-09 00:37:58 +0000746 return;
747 }
Chris Lattnerc961eea2005-11-16 01:54:32 +0000748
Evan Cheng0114e942006-01-06 20:36:21 +0000749 switch (Opcode) {
Chris Lattnerc961eea2005-11-16 01:54:32 +0000750 default: break;
Evan Cheng020d2e82006-02-23 20:41:18 +0000751 case X86ISD::GlobalBaseReg:
752 Result = getGlobalBaseReg();
753 return;
754
Evan Cheng51a9ed92006-02-25 10:09:08 +0000755 case ISD::ADD: {
756 // Turn ADD X, c to MOV32ri X+c. This cannot be done with tblgen'd
757 // code and is matched first so to prevent it from being turned into
758 // LEA32r X+c.
759 SDOperand N0 = N.getOperand(0);
760 SDOperand N1 = N.getOperand(1);
761 if (N.Val->getValueType(0) == MVT::i32 &&
762 N0.getOpcode() == X86ISD::Wrapper &&
763 N1.getOpcode() == ISD::Constant) {
764 unsigned Offset = (unsigned)cast<ConstantSDNode>(N1)->getValue();
765 SDOperand C(0, 0);
766 // TODO: handle ExternalSymbolSDNode.
767 if (GlobalAddressSDNode *G =
768 dyn_cast<GlobalAddressSDNode>(N0.getOperand(0))) {
769 C = CurDAG->getTargetGlobalAddress(G->getGlobal(), MVT::i32,
770 G->getOffset() + Offset);
771 } else if (ConstantPoolSDNode *CP =
772 dyn_cast<ConstantPoolSDNode>(N0.getOperand(0))) {
773 C = CurDAG->getTargetConstantPool(CP->get(), MVT::i32,
774 CP->getAlignment(),
775 CP->getOffset()+Offset);
776 }
777
778 if (C.Val) {
779 if (N.Val->hasOneUse()) {
780 Result = CurDAG->SelectNodeTo(N.Val, X86::MOV32ri, MVT::i32, C);
781 } else {
782 SDNode *ResNode = CurDAG->getTargetNode(X86::MOV32ri, MVT::i32, C);
783 Result = CodeGenMap[N] = SDOperand(ResNode, 0);
784 }
785 return;
786 }
787 }
788
789 // Other cases are handled by auto-generated code.
790 break;
Evan Chenga0ea0532006-02-23 02:43:52 +0000791 }
Evan Cheng020d2e82006-02-23 20:41:18 +0000792
Evan Cheng0114e942006-01-06 20:36:21 +0000793 case ISD::MULHU:
794 case ISD::MULHS: {
795 if (Opcode == ISD::MULHU)
796 switch (NVT) {
797 default: assert(0 && "Unsupported VT!");
798 case MVT::i8: Opc = X86::MUL8r; MOpc = X86::MUL8m; break;
799 case MVT::i16: Opc = X86::MUL16r; MOpc = X86::MUL16m; break;
800 case MVT::i32: Opc = X86::MUL32r; MOpc = X86::MUL32m; break;
801 }
802 else
803 switch (NVT) {
804 default: assert(0 && "Unsupported VT!");
805 case MVT::i8: Opc = X86::IMUL8r; MOpc = X86::IMUL8m; break;
806 case MVT::i16: Opc = X86::IMUL16r; MOpc = X86::IMUL16m; break;
807 case MVT::i32: Opc = X86::IMUL32r; MOpc = X86::IMUL32m; break;
808 }
809
810 unsigned LoReg, HiReg;
811 switch (NVT) {
812 default: assert(0 && "Unsupported VT!");
813 case MVT::i8: LoReg = X86::AL; HiReg = X86::AH; break;
814 case MVT::i16: LoReg = X86::AX; HiReg = X86::DX; break;
815 case MVT::i32: LoReg = X86::EAX; HiReg = X86::EDX; break;
816 }
817
818 SDOperand N0 = Node->getOperand(0);
819 SDOperand N1 = Node->getOperand(1);
820
821 bool foldedLoad = false;
822 SDOperand Tmp0, Tmp1, Tmp2, Tmp3;
Evan Cheng5e351682006-02-06 06:02:33 +0000823 foldedLoad = TryFoldLoad(N, N1, Tmp0, Tmp1, Tmp2, Tmp3);
Evan Cheng948f3432006-01-06 23:19:29 +0000824 // MULHU and MULHS are commmutative
825 if (!foldedLoad) {
Evan Cheng5e351682006-02-06 06:02:33 +0000826 foldedLoad = TryFoldLoad(N, N0, Tmp0, Tmp1, Tmp2, Tmp3);
Evan Cheng948f3432006-01-06 23:19:29 +0000827 if (foldedLoad) {
828 N0 = Node->getOperand(1);
829 N1 = Node->getOperand(0);
830 }
831 }
832
Evan Cheng34167212006-02-09 00:37:58 +0000833 SDOperand Chain;
834 if (foldedLoad)
835 Select(Chain, N1.getOperand(0));
836 else
837 Chain = CurDAG->getEntryNode();
Evan Cheng0114e942006-01-06 20:36:21 +0000838
Evan Cheng34167212006-02-09 00:37:58 +0000839 SDOperand InFlag(0, 0);
840 Select(N0, N0);
Evan Cheng0114e942006-01-06 20:36:21 +0000841 Chain = CurDAG->getCopyToReg(Chain, CurDAG->getRegister(LoReg, NVT),
Evan Cheng34167212006-02-09 00:37:58 +0000842 N0, InFlag);
Evan Cheng0114e942006-01-06 20:36:21 +0000843 InFlag = Chain.getValue(1);
844
845 if (foldedLoad) {
Evan Cheng34167212006-02-09 00:37:58 +0000846 Select(Tmp0, Tmp0);
847 Select(Tmp1, Tmp1);
848 Select(Tmp2, Tmp2);
849 Select(Tmp3, Tmp3);
Evan Cheng7e9b26f2006-02-09 07:17:49 +0000850 SDNode *CNode =
851 CurDAG->getTargetNode(MOpc, MVT::Other, MVT::Flag, Tmp0, Tmp1,
852 Tmp2, Tmp3, Chain, InFlag);
853 Chain = SDOperand(CNode, 0);
854 InFlag = SDOperand(CNode, 1);
Evan Cheng0114e942006-01-06 20:36:21 +0000855 } else {
Evan Cheng34167212006-02-09 00:37:58 +0000856 Select(N1, N1);
Evan Cheng7e9b26f2006-02-09 07:17:49 +0000857 InFlag =
858 SDOperand(CurDAG->getTargetNode(Opc, MVT::Flag, N1, InFlag), 0);
Evan Cheng0114e942006-01-06 20:36:21 +0000859 }
860
Evan Cheng34167212006-02-09 00:37:58 +0000861 Result = CurDAG->getCopyFromReg(Chain, HiReg, NVT, InFlag);
Evan Cheng0114e942006-01-06 20:36:21 +0000862 CodeGenMap[N.getValue(0)] = Result;
Evan Cheng5e351682006-02-06 06:02:33 +0000863 if (foldedLoad) {
Evan Cheng948f3432006-01-06 23:19:29 +0000864 CodeGenMap[N1.getValue(1)] = Result.getValue(1);
Evan Cheng7d82d602006-02-09 22:12:53 +0000865 AddHandleReplacement(N1.Val, 1, Result.Val, 1);
Evan Cheng5e351682006-02-06 06:02:33 +0000866 }
Evan Cheng34167212006-02-09 00:37:58 +0000867
Evan Chengf597dc72006-02-10 22:24:32 +0000868#ifndef NDEBUG
Evan Cheng2486af12006-02-11 02:05:36 +0000869 DEBUG(std::cerr << std::string(Indent-2, ' '));
Evan Chengf597dc72006-02-10 22:24:32 +0000870 DEBUG(std::cerr << "== ");
871 DEBUG(Result.Val->dump(CurDAG));
872 DEBUG(std::cerr << "\n");
Evan Cheng23addc02006-02-10 22:46:26 +0000873 Indent -= 2;
Evan Chengf597dc72006-02-10 22:24:32 +0000874#endif
Evan Cheng34167212006-02-09 00:37:58 +0000875 return;
Evan Cheng948f3432006-01-06 23:19:29 +0000876 }
Evan Cheng7ccced62006-02-18 00:15:05 +0000877
Evan Cheng948f3432006-01-06 23:19:29 +0000878 case ISD::SDIV:
879 case ISD::UDIV:
880 case ISD::SREM:
881 case ISD::UREM: {
882 bool isSigned = Opcode == ISD::SDIV || Opcode == ISD::SREM;
883 bool isDiv = Opcode == ISD::SDIV || Opcode == ISD::UDIV;
884 if (!isSigned)
885 switch (NVT) {
886 default: assert(0 && "Unsupported VT!");
887 case MVT::i8: Opc = X86::DIV8r; MOpc = X86::DIV8m; break;
888 case MVT::i16: Opc = X86::DIV16r; MOpc = X86::DIV16m; break;
889 case MVT::i32: Opc = X86::DIV32r; MOpc = X86::DIV32m; break;
890 }
891 else
892 switch (NVT) {
893 default: assert(0 && "Unsupported VT!");
894 case MVT::i8: Opc = X86::IDIV8r; MOpc = X86::IDIV8m; break;
895 case MVT::i16: Opc = X86::IDIV16r; MOpc = X86::IDIV16m; break;
896 case MVT::i32: Opc = X86::IDIV32r; MOpc = X86::IDIV32m; break;
897 }
898
899 unsigned LoReg, HiReg;
900 unsigned ClrOpcode, SExtOpcode;
901 switch (NVT) {
902 default: assert(0 && "Unsupported VT!");
903 case MVT::i8:
904 LoReg = X86::AL; HiReg = X86::AH;
Evan Chengaede9b92006-06-02 21:20:34 +0000905 ClrOpcode = X86::MOV8r0;
Evan Cheng948f3432006-01-06 23:19:29 +0000906 SExtOpcode = X86::CBW;
907 break;
908 case MVT::i16:
909 LoReg = X86::AX; HiReg = X86::DX;
Evan Chengaede9b92006-06-02 21:20:34 +0000910 ClrOpcode = X86::MOV16r0;
Evan Cheng948f3432006-01-06 23:19:29 +0000911 SExtOpcode = X86::CWD;
912 break;
913 case MVT::i32:
914 LoReg = X86::EAX; HiReg = X86::EDX;
Evan Chengaede9b92006-06-02 21:20:34 +0000915 ClrOpcode = X86::MOV32r0;
Evan Cheng948f3432006-01-06 23:19:29 +0000916 SExtOpcode = X86::CDQ;
917 break;
918 }
919
920 SDOperand N0 = Node->getOperand(0);
921 SDOperand N1 = Node->getOperand(1);
922
923 bool foldedLoad = false;
924 SDOperand Tmp0, Tmp1, Tmp2, Tmp3;
Evan Cheng5e351682006-02-06 06:02:33 +0000925 foldedLoad = TryFoldLoad(N, N1, Tmp0, Tmp1, Tmp2, Tmp3);
Evan Cheng34167212006-02-09 00:37:58 +0000926 SDOperand Chain;
927 if (foldedLoad)
928 Select(Chain, N1.getOperand(0));
929 else
930 Chain = CurDAG->getEntryNode();
Evan Cheng948f3432006-01-06 23:19:29 +0000931
Evan Cheng34167212006-02-09 00:37:58 +0000932 SDOperand InFlag(0, 0);
933 Select(N0, N0);
Evan Cheng948f3432006-01-06 23:19:29 +0000934 Chain = CurDAG->getCopyToReg(Chain, CurDAG->getRegister(LoReg, NVT),
Evan Cheng34167212006-02-09 00:37:58 +0000935 N0, InFlag);
Evan Cheng948f3432006-01-06 23:19:29 +0000936 InFlag = Chain.getValue(1);
937
938 if (isSigned) {
939 // Sign extend the low part into the high part.
Evan Cheng7e9b26f2006-02-09 07:17:49 +0000940 InFlag =
941 SDOperand(CurDAG->getTargetNode(SExtOpcode, MVT::Flag, InFlag), 0);
Evan Cheng948f3432006-01-06 23:19:29 +0000942 } else {
943 // Zero out the high part, effectively zero extending the input.
Evan Chengaede9b92006-06-02 21:20:34 +0000944 SDOperand ClrNode = SDOperand(CurDAG->getTargetNode(ClrOpcode, NVT), 0);
Evan Cheng948f3432006-01-06 23:19:29 +0000945 Chain = CurDAG->getCopyToReg(Chain, CurDAG->getRegister(HiReg, NVT),
946 ClrNode, InFlag);
947 InFlag = Chain.getValue(1);
948 }
949
950 if (foldedLoad) {
Evan Cheng34167212006-02-09 00:37:58 +0000951 Select(Tmp0, Tmp0);
952 Select(Tmp1, Tmp1);
953 Select(Tmp2, Tmp2);
954 Select(Tmp3, Tmp3);
Evan Cheng7e9b26f2006-02-09 07:17:49 +0000955 SDNode *CNode =
956 CurDAG->getTargetNode(MOpc, MVT::Other, MVT::Flag, Tmp0, Tmp1,
957 Tmp2, Tmp3, Chain, InFlag);
958 Chain = SDOperand(CNode, 0);
959 InFlag = SDOperand(CNode, 1);
Evan Cheng948f3432006-01-06 23:19:29 +0000960 } else {
Evan Cheng34167212006-02-09 00:37:58 +0000961 Select(N1, N1);
Evan Cheng7e9b26f2006-02-09 07:17:49 +0000962 InFlag =
963 SDOperand(CurDAG->getTargetNode(Opc, MVT::Flag, N1, InFlag), 0);
Evan Cheng948f3432006-01-06 23:19:29 +0000964 }
965
Evan Cheng34167212006-02-09 00:37:58 +0000966 Result = CurDAG->getCopyFromReg(Chain, isDiv ? LoReg : HiReg,
967 NVT, InFlag);
Evan Cheng948f3432006-01-06 23:19:29 +0000968 CodeGenMap[N.getValue(0)] = Result;
Evan Cheng5e351682006-02-06 06:02:33 +0000969 if (foldedLoad) {
Evan Cheng948f3432006-01-06 23:19:29 +0000970 CodeGenMap[N1.getValue(1)] = Result.getValue(1);
Evan Cheng7d82d602006-02-09 22:12:53 +0000971 AddHandleReplacement(N1.Val, 1, Result.Val, 1);
Evan Cheng5e351682006-02-06 06:02:33 +0000972 }
Evan Chengf597dc72006-02-10 22:24:32 +0000973
974#ifndef NDEBUG
Evan Cheng2486af12006-02-11 02:05:36 +0000975 DEBUG(std::cerr << std::string(Indent-2, ' '));
Evan Chengf597dc72006-02-10 22:24:32 +0000976 DEBUG(std::cerr << "== ");
977 DEBUG(Result.Val->dump(CurDAG));
978 DEBUG(std::cerr << "\n");
Evan Cheng23addc02006-02-10 22:46:26 +0000979 Indent -= 2;
Evan Chengf597dc72006-02-10 22:24:32 +0000980#endif
Evan Cheng34167212006-02-09 00:37:58 +0000981 return;
Evan Cheng0114e942006-01-06 20:36:21 +0000982 }
Evan Cheng403be7e2006-05-08 08:01:26 +0000983
984 case ISD::TRUNCATE: {
985 if (NVT == MVT::i8) {
986 unsigned Opc2;
987 MVT::ValueType VT;
988 switch (Node->getOperand(0).getValueType()) {
989 default: assert(0 && "Unknown truncate!");
990 case MVT::i16:
991 Opc = X86::MOV16to16_;
992 VT = MVT::i16;
Evan Cheng069287d2006-05-16 07:21:53 +0000993 Opc2 = X86::TRUNC_GR16_GR8;
Evan Cheng403be7e2006-05-08 08:01:26 +0000994 break;
995 case MVT::i32:
996 Opc = X86::MOV32to32_;
997 VT = MVT::i32;
Evan Cheng069287d2006-05-16 07:21:53 +0000998 Opc2 = X86::TRUNC_GR32_GR8;
Evan Cheng403be7e2006-05-08 08:01:26 +0000999 break;
1000 }
1001
1002 SDOperand Tmp0, Tmp1;
1003 Select(Tmp0, Node->getOperand(0));
1004 Tmp1 = SDOperand(CurDAG->getTargetNode(Opc, VT, Tmp0), 0);
1005 Result = CodeGenMap[N] =
1006 SDOperand(CurDAG->getTargetNode(Opc2, NVT, Tmp1), 0);
1007
1008#ifndef NDEBUG
1009 DEBUG(std::cerr << std::string(Indent-2, ' '));
1010 DEBUG(std::cerr << "== ");
1011 DEBUG(Result.Val->dump(CurDAG));
1012 DEBUG(std::cerr << "\n");
1013 Indent -= 2;
1014#endif
1015 return;
1016 }
Evan Cheng6b2e2542006-05-20 07:44:28 +00001017
1018 break;
Evan Cheng403be7e2006-05-08 08:01:26 +00001019 }
Chris Lattnerc961eea2005-11-16 01:54:32 +00001020 }
1021
Evan Cheng34167212006-02-09 00:37:58 +00001022 SelectCode(Result, N);
Evan Chengf597dc72006-02-10 22:24:32 +00001023#ifndef NDEBUG
Evan Cheng2486af12006-02-11 02:05:36 +00001024 DEBUG(std::cerr << std::string(Indent-2, ' '));
Evan Chengf597dc72006-02-10 22:24:32 +00001025 DEBUG(std::cerr << "=> ");
1026 DEBUG(Result.Val->dump(CurDAG));
1027 DEBUG(std::cerr << "\n");
Evan Cheng23addc02006-02-10 22:46:26 +00001028 Indent -= 2;
Evan Chengf597dc72006-02-10 22:24:32 +00001029#endif
Chris Lattnerc961eea2005-11-16 01:54:32 +00001030}
1031
Chris Lattnerc0bad572006-06-08 18:03:49 +00001032bool X86DAGToDAGISel::
1033SelectInlineAsmMemoryOperand(const SDOperand &Op, char ConstraintCode,
1034 std::vector<SDOperand> &OutOps, SelectionDAG &DAG){
1035 SDOperand Op0, Op1, Op2, Op3;
1036 switch (ConstraintCode) {
1037 case 'o': // offsetable ??
1038 case 'v': // not offsetable ??
1039 default: return true;
1040 case 'm': // memory
1041 if (!SelectAddr(Op, Op0, Op1, Op2, Op3))
1042 return true;
1043 break;
1044 }
1045
1046 OutOps.resize(4);
1047 Select(OutOps[0], Op0);
1048 Select(OutOps[1], Op1);
1049 Select(OutOps[2], Op2);
1050 Select(OutOps[3], Op3);
1051 return false;
1052}
1053
Chris Lattnerc961eea2005-11-16 01:54:32 +00001054/// createX86ISelDag - This pass converts a legalized DAG into a
1055/// X86-specific DAG, ready for instruction scheduling.
1056///
Evan Chengc4c62572006-03-13 23:20:37 +00001057FunctionPass *llvm::createX86ISelDag(X86TargetMachine &TM) {
Chris Lattnerc961eea2005-11-16 01:54:32 +00001058 return new X86DAGToDAGISel(TM);
1059}