blob: 8da6f79f5bf5a891755560dfd2df0a11734243ba [file] [log] [blame]
Chris Lattnerc3aae252005-01-07 07:46:32 +00001//===-- SelectionDAG.cpp - Implement the SelectionDAG data structures -----===//
Misha Brukmanedf128a2005-04-21 22:36:52 +00002//
John Criswellb576c942003-10-20 19:43:21 +00003// The LLVM Compiler Infrastructure
4//
Chris Lattner4ee451d2007-12-29 20:36:04 +00005// This file is distributed under the University of Illinois Open Source
6// License. See LICENSE.TXT for details.
Misha Brukmanedf128a2005-04-21 22:36:52 +00007//
John Criswellb576c942003-10-20 19:43:21 +00008//===----------------------------------------------------------------------===//
Chris Lattner78ec3112003-08-11 14:57:33 +00009//
Chris Lattnerc3aae252005-01-07 07:46:32 +000010// This implements the SelectionDAG class.
Chris Lattner78ec3112003-08-11 14:57:33 +000011//
12//===----------------------------------------------------------------------===//
13
14#include "llvm/CodeGen/SelectionDAG.h"
Chris Lattnerc3aae252005-01-07 07:46:32 +000015#include "llvm/Constants.h"
Lauro Ramos Venanciob3a04172007-04-20 21:38:10 +000016#include "llvm/GlobalVariable.h"
Chris Lattner70a248d2006-03-27 06:45:25 +000017#include "llvm/Intrinsics.h"
Christopher Lamb95c218a2007-04-22 23:15:30 +000018#include "llvm/DerivedTypes.h"
Chris Lattnerc3aae252005-01-07 07:46:32 +000019#include "llvm/Assembly/Writer.h"
20#include "llvm/CodeGen/MachineBasicBlock.h"
Evan Chengd6594ae2006-09-12 21:00:35 +000021#include "llvm/CodeGen/MachineConstantPool.h"
Chris Lattner37ce9df2007-10-15 17:47:20 +000022#include "llvm/CodeGen/MachineFrameInfo.h"
Evan Chenga844bde2008-02-02 04:07:54 +000023#include "llvm/CodeGen/MachineModuleInfo.h"
Dan Gohman69de1932008-02-06 22:27:42 +000024#include "llvm/CodeGen/PseudoSourceValue.h"
Chris Lattner0561b3f2005-08-02 19:26:06 +000025#include "llvm/Support/MathExtras.h"
Dan Gohman6f0d0242008-02-10 18:45:23 +000026#include "llvm/Target/TargetRegisterInfo.h"
Christopher Lamb95c218a2007-04-22 23:15:30 +000027#include "llvm/Target/TargetData.h"
Chris Lattnerb48da392005-01-23 04:39:44 +000028#include "llvm/Target/TargetLowering.h"
Chris Lattnerf3e133a2005-08-16 18:33:07 +000029#include "llvm/Target/TargetInstrInfo.h"
30#include "llvm/Target/TargetMachine.h"
Chris Lattner012f2412006-02-17 21:58:01 +000031#include "llvm/ADT/SetVector.h"
Chris Lattnerd48c5e82007-02-04 00:24:41 +000032#include "llvm/ADT/SmallPtrSet.h"
Duncan Sandsaf47b112007-10-16 09:56:48 +000033#include "llvm/ADT/SmallSet.h"
Chris Lattner190a4182006-08-04 17:45:20 +000034#include "llvm/ADT/SmallVector.h"
Evan Cheng115c0362005-12-19 23:11:49 +000035#include "llvm/ADT/StringExtras.h"
Jeff Cohenfd161e92005-01-09 20:41:56 +000036#include <algorithm>
Jeff Cohen97af7512006-12-02 02:22:01 +000037#include <cmath>
Chris Lattnere25738c2004-06-02 04:28:06 +000038using namespace llvm;
Brian Gaeked0fde302003-11-11 22:41:34 +000039
Chris Lattner0b3e5252006-08-15 19:11:05 +000040/// makeVTList - Return an instance of the SDVTList struct initialized with the
41/// specified members.
42static SDVTList makeVTList(const MVT::ValueType *VTs, unsigned NumVTs) {
43 SDVTList Res = {VTs, NumVTs};
44 return Res;
45}
46
Chris Lattnerf8dc0612008-02-03 06:49:24 +000047SelectionDAG::DAGUpdateListener::~DAGUpdateListener() {}
48
Jim Laskey58b968b2005-08-17 20:08:02 +000049//===----------------------------------------------------------------------===//
50// ConstantFPSDNode Class
51//===----------------------------------------------------------------------===//
52
53/// isExactlyValue - We don't rely on operator== working on double values, as
54/// it returns true for things that are clearly not equal, like -0.0 and 0.0.
55/// As such, this method can be used to do an exact bit-for-bit comparison of
56/// two floating point values.
Dale Johannesene6c17422007-08-26 01:18:27 +000057bool ConstantFPSDNode::isExactlyValue(const APFloat& V) const {
Dale Johannesen87503a62007-08-25 22:10:57 +000058 return Value.bitwiseIsEqual(V);
Jim Laskey58b968b2005-08-17 20:08:02 +000059}
60
Dale Johannesenf04afdb2007-08-30 00:23:21 +000061bool ConstantFPSDNode::isValueValidForType(MVT::ValueType VT,
62 const APFloat& Val) {
63 // convert modifies in place, so make a copy.
64 APFloat Val2 = APFloat(Val);
65 switch (VT) {
66 default:
67 return false; // These can't be represented as floating point!
68
69 // FIXME rounding mode needs to be more flexible
70 case MVT::f32:
71 return &Val2.getSemantics() == &APFloat::IEEEsingle ||
72 Val2.convert(APFloat::IEEEsingle, APFloat::rmNearestTiesToEven) ==
73 APFloat::opOK;
74 case MVT::f64:
75 return &Val2.getSemantics() == &APFloat::IEEEsingle ||
76 &Val2.getSemantics() == &APFloat::IEEEdouble ||
77 Val2.convert(APFloat::IEEEdouble, APFloat::rmNearestTiesToEven) ==
78 APFloat::opOK;
79 // TODO: Figure out how to test if we can use a shorter type instead!
80 case MVT::f80:
81 case MVT::f128:
82 case MVT::ppcf128:
83 return true;
84 }
85}
86
Jim Laskey58b968b2005-08-17 20:08:02 +000087//===----------------------------------------------------------------------===//
Chris Lattner61d43992006-03-25 22:57:01 +000088// ISD Namespace
Jim Laskey58b968b2005-08-17 20:08:02 +000089//===----------------------------------------------------------------------===//
Chris Lattner5cdcc582005-01-09 20:52:51 +000090
Evan Chenga8df1662006-03-27 06:58:47 +000091/// isBuildVectorAllOnes - Return true if the specified node is a
Chris Lattner61d43992006-03-25 22:57:01 +000092/// BUILD_VECTOR where all of the elements are ~0 or undef.
Evan Chenga8df1662006-03-27 06:58:47 +000093bool ISD::isBuildVectorAllOnes(const SDNode *N) {
Chris Lattner547a16f2006-04-15 23:38:00 +000094 // Look through a bit convert.
95 if (N->getOpcode() == ISD::BIT_CONVERT)
96 N = N->getOperand(0).Val;
97
Evan Chenga8df1662006-03-27 06:58:47 +000098 if (N->getOpcode() != ISD::BUILD_VECTOR) return false;
Chris Lattner61d43992006-03-25 22:57:01 +000099
100 unsigned i = 0, e = N->getNumOperands();
101
102 // Skip over all of the undef values.
103 while (i != e && N->getOperand(i).getOpcode() == ISD::UNDEF)
104 ++i;
105
106 // Do not accept an all-undef vector.
107 if (i == e) return false;
108
109 // Do not accept build_vectors that aren't all constants or which have non-~0
110 // elements.
Chris Lattner452e8352006-03-25 22:59:28 +0000111 SDOperand NotZero = N->getOperand(i);
Evan Chenga8df1662006-03-27 06:58:47 +0000112 if (isa<ConstantSDNode>(NotZero)) {
113 if (!cast<ConstantSDNode>(NotZero)->isAllOnesValue())
114 return false;
115 } else if (isa<ConstantFPSDNode>(NotZero)) {
Evan Cheng23cc8702006-03-27 08:10:26 +0000116 MVT::ValueType VT = NotZero.getValueType();
117 if (VT== MVT::f64) {
Dale Johannesen9d5f4562007-09-12 03:30:33 +0000118 if (((cast<ConstantFPSDNode>(NotZero)->getValueAPF().
119 convertToAPInt().getZExtValue())) != (uint64_t)-1)
Evan Cheng23cc8702006-03-27 08:10:26 +0000120 return false;
121 } else {
Dale Johannesen9d5f4562007-09-12 03:30:33 +0000122 if ((uint32_t)cast<ConstantFPSDNode>(NotZero)->
123 getValueAPF().convertToAPInt().getZExtValue() !=
Evan Cheng23cc8702006-03-27 08:10:26 +0000124 (uint32_t)-1)
125 return false;
126 }
Evan Chenga8df1662006-03-27 06:58:47 +0000127 } else
Chris Lattner61d43992006-03-25 22:57:01 +0000128 return false;
129
130 // Okay, we have at least one ~0 value, check to see if the rest match or are
131 // undefs.
Chris Lattner61d43992006-03-25 22:57:01 +0000132 for (++i; i != e; ++i)
133 if (N->getOperand(i) != NotZero &&
134 N->getOperand(i).getOpcode() != ISD::UNDEF)
135 return false;
136 return true;
137}
138
139
Evan Cheng4a147842006-03-26 09:50:58 +0000140/// isBuildVectorAllZeros - Return true if the specified node is a
141/// BUILD_VECTOR where all of the elements are 0 or undef.
142bool ISD::isBuildVectorAllZeros(const SDNode *N) {
Chris Lattner547a16f2006-04-15 23:38:00 +0000143 // Look through a bit convert.
144 if (N->getOpcode() == ISD::BIT_CONVERT)
145 N = N->getOperand(0).Val;
146
Evan Cheng4a147842006-03-26 09:50:58 +0000147 if (N->getOpcode() != ISD::BUILD_VECTOR) return false;
Evan Chenga8df1662006-03-27 06:58:47 +0000148
149 unsigned i = 0, e = N->getNumOperands();
150
151 // Skip over all of the undef values.
152 while (i != e && N->getOperand(i).getOpcode() == ISD::UNDEF)
153 ++i;
154
155 // Do not accept an all-undef vector.
156 if (i == e) return false;
157
158 // Do not accept build_vectors that aren't all constants or which have non-~0
159 // elements.
160 SDOperand Zero = N->getOperand(i);
161 if (isa<ConstantSDNode>(Zero)) {
162 if (!cast<ConstantSDNode>(Zero)->isNullValue())
163 return false;
164 } else if (isa<ConstantFPSDNode>(Zero)) {
Dale Johanneseneaf08942007-08-31 04:03:46 +0000165 if (!cast<ConstantFPSDNode>(Zero)->getValueAPF().isPosZero())
Evan Chenga8df1662006-03-27 06:58:47 +0000166 return false;
167 } else
168 return false;
169
170 // Okay, we have at least one ~0 value, check to see if the rest match or are
171 // undefs.
172 for (++i; i != e; ++i)
173 if (N->getOperand(i) != Zero &&
174 N->getOperand(i).getOpcode() != ISD::UNDEF)
175 return false;
176 return true;
Evan Cheng4a147842006-03-26 09:50:58 +0000177}
178
Evan Chengefec7512008-02-18 23:04:32 +0000179/// isScalarToVector - Return true if the specified node is a
180/// ISD::SCALAR_TO_VECTOR node or a BUILD_VECTOR node where only the low
181/// element is not an undef.
182bool ISD::isScalarToVector(const SDNode *N) {
183 if (N->getOpcode() == ISD::SCALAR_TO_VECTOR)
184 return true;
185
186 if (N->getOpcode() != ISD::BUILD_VECTOR)
187 return false;
188 if (N->getOperand(0).getOpcode() == ISD::UNDEF)
189 return false;
190 unsigned NumElems = N->getNumOperands();
191 for (unsigned i = 1; i < NumElems; ++i) {
192 SDOperand V = N->getOperand(i);
193 if (V.getOpcode() != ISD::UNDEF)
194 return false;
195 }
196 return true;
197}
198
199
Evan Chengbb81d972008-01-31 09:59:15 +0000200/// isDebugLabel - Return true if the specified node represents a debug
Evan Chengfc718542008-02-04 23:10:38 +0000201/// label (i.e. ISD::LABEL or TargetInstrInfo::LABEL node and third operand
Evan Chengbb81d972008-01-31 09:59:15 +0000202/// is 0).
203bool ISD::isDebugLabel(const SDNode *N) {
204 SDOperand Zero;
205 if (N->getOpcode() == ISD::LABEL)
206 Zero = N->getOperand(2);
207 else if (N->isTargetOpcode() &&
208 N->getTargetOpcode() == TargetInstrInfo::LABEL)
209 // Chain moved to last operand.
210 Zero = N->getOperand(1);
211 else
212 return false;
213 return isa<ConstantSDNode>(Zero) && cast<ConstantSDNode>(Zero)->isNullValue();
214}
215
Chris Lattnerc3aae252005-01-07 07:46:32 +0000216/// getSetCCSwappedOperands - Return the operation corresponding to (Y op X)
217/// when given the operation for (X op Y).
218ISD::CondCode ISD::getSetCCSwappedOperands(ISD::CondCode Operation) {
219 // To perform this operation, we just need to swap the L and G bits of the
220 // operation.
221 unsigned OldL = (Operation >> 2) & 1;
222 unsigned OldG = (Operation >> 1) & 1;
223 return ISD::CondCode((Operation & ~6) | // Keep the N, U, E bits
224 (OldL << 1) | // New G bit
225 (OldG << 2)); // New L bit.
226}
227
228/// getSetCCInverse - Return the operation corresponding to !(X op Y), where
229/// 'op' is a valid SetCC operation.
230ISD::CondCode ISD::getSetCCInverse(ISD::CondCode Op, bool isInteger) {
231 unsigned Operation = Op;
232 if (isInteger)
233 Operation ^= 7; // Flip L, G, E bits, but not U.
234 else
235 Operation ^= 15; // Flip all of the condition bits.
236 if (Operation > ISD::SETTRUE2)
237 Operation &= ~8; // Don't let N and U bits get set.
238 return ISD::CondCode(Operation);
239}
240
241
242/// isSignedOp - For an integer comparison, return 1 if the comparison is a
243/// signed operation and 2 if the result is an unsigned comparison. Return zero
244/// if the operation does not depend on the sign of the input (setne and seteq).
245static int isSignedOp(ISD::CondCode Opcode) {
246 switch (Opcode) {
247 default: assert(0 && "Illegal integer setcc operation!");
248 case ISD::SETEQ:
249 case ISD::SETNE: return 0;
250 case ISD::SETLT:
251 case ISD::SETLE:
252 case ISD::SETGT:
253 case ISD::SETGE: return 1;
254 case ISD::SETULT:
255 case ISD::SETULE:
256 case ISD::SETUGT:
257 case ISD::SETUGE: return 2;
258 }
259}
260
261/// getSetCCOrOperation - Return the result of a logical OR between different
262/// comparisons of identical values: ((X op1 Y) | (X op2 Y)). This function
263/// returns SETCC_INVALID if it is not possible to represent the resultant
264/// comparison.
265ISD::CondCode ISD::getSetCCOrOperation(ISD::CondCode Op1, ISD::CondCode Op2,
266 bool isInteger) {
267 if (isInteger && (isSignedOp(Op1) | isSignedOp(Op2)) == 3)
268 // Cannot fold a signed integer setcc with an unsigned integer setcc.
269 return ISD::SETCC_INVALID;
Misha Brukmanedf128a2005-04-21 22:36:52 +0000270
Chris Lattnerc3aae252005-01-07 07:46:32 +0000271 unsigned Op = Op1 | Op2; // Combine all of the condition bits.
Misha Brukmanedf128a2005-04-21 22:36:52 +0000272
Chris Lattnerc3aae252005-01-07 07:46:32 +0000273 // If the N and U bits get set then the resultant comparison DOES suddenly
274 // care about orderedness, and is true when ordered.
275 if (Op > ISD::SETTRUE2)
Chris Lattnere41102b2006-05-12 17:03:46 +0000276 Op &= ~16; // Clear the U bit if the N bit is set.
277
278 // Canonicalize illegal integer setcc's.
279 if (isInteger && Op == ISD::SETUNE) // e.g. SETUGT | SETULT
280 Op = ISD::SETNE;
281
Chris Lattnerc3aae252005-01-07 07:46:32 +0000282 return ISD::CondCode(Op);
283}
284
285/// getSetCCAndOperation - Return the result of a logical AND between different
286/// comparisons of identical values: ((X op1 Y) & (X op2 Y)). This
287/// function returns zero if it is not possible to represent the resultant
288/// comparison.
289ISD::CondCode ISD::getSetCCAndOperation(ISD::CondCode Op1, ISD::CondCode Op2,
290 bool isInteger) {
291 if (isInteger && (isSignedOp(Op1) | isSignedOp(Op2)) == 3)
292 // Cannot fold a signed setcc with an unsigned setcc.
Misha Brukmanedf128a2005-04-21 22:36:52 +0000293 return ISD::SETCC_INVALID;
Chris Lattnerc3aae252005-01-07 07:46:32 +0000294
295 // Combine all of the condition bits.
Chris Lattnera83385f2006-04-27 05:01:07 +0000296 ISD::CondCode Result = ISD::CondCode(Op1 & Op2);
297
298 // Canonicalize illegal integer setcc's.
299 if (isInteger) {
300 switch (Result) {
301 default: break;
Chris Lattner883a52d2006-06-28 18:29:47 +0000302 case ISD::SETUO : Result = ISD::SETFALSE; break; // SETUGT & SETULT
303 case ISD::SETUEQ: Result = ISD::SETEQ ; break; // SETUGE & SETULE
304 case ISD::SETOLT: Result = ISD::SETULT ; break; // SETULT & SETNE
305 case ISD::SETOGT: Result = ISD::SETUGT ; break; // SETUGT & SETNE
Chris Lattnera83385f2006-04-27 05:01:07 +0000306 }
307 }
308
309 return Result;
Chris Lattnerc3aae252005-01-07 07:46:32 +0000310}
311
Chris Lattnerb48da392005-01-23 04:39:44 +0000312const TargetMachine &SelectionDAG::getTarget() const {
313 return TLI.getTargetMachine();
314}
315
Jim Laskey58b968b2005-08-17 20:08:02 +0000316//===----------------------------------------------------------------------===//
Jim Laskey583bd472006-10-27 23:46:08 +0000317// SDNode Profile Support
318//===----------------------------------------------------------------------===//
319
Jim Laskeydef69b92006-10-27 23:52:51 +0000320/// AddNodeIDOpcode - Add the node opcode to the NodeID data.
321///
Jim Laskey583bd472006-10-27 23:46:08 +0000322static void AddNodeIDOpcode(FoldingSetNodeID &ID, unsigned OpC) {
323 ID.AddInteger(OpC);
324}
325
326/// AddNodeIDValueTypes - Value type lists are intern'd so we can represent them
327/// solely with their pointer.
328void AddNodeIDValueTypes(FoldingSetNodeID &ID, SDVTList VTList) {
329 ID.AddPointer(VTList.VTs);
330}
331
Jim Laskeydef69b92006-10-27 23:52:51 +0000332/// AddNodeIDOperands - Various routines for adding operands to the NodeID data.
333///
Jim Laskey583bd472006-10-27 23:46:08 +0000334static void AddNodeIDOperands(FoldingSetNodeID &ID,
335 const SDOperand *Ops, unsigned NumOps) {
Chris Lattner63e3f142007-02-04 07:28:00 +0000336 for (; NumOps; --NumOps, ++Ops) {
337 ID.AddPointer(Ops->Val);
338 ID.AddInteger(Ops->ResNo);
339 }
Jim Laskey583bd472006-10-27 23:46:08 +0000340}
341
Jim Laskey583bd472006-10-27 23:46:08 +0000342static void AddNodeIDNode(FoldingSetNodeID &ID,
343 unsigned short OpC, SDVTList VTList,
344 const SDOperand *OpList, unsigned N) {
345 AddNodeIDOpcode(ID, OpC);
346 AddNodeIDValueTypes(ID, VTList);
347 AddNodeIDOperands(ID, OpList, N);
348}
349
Jim Laskeydef69b92006-10-27 23:52:51 +0000350/// AddNodeIDNode - Generic routine for adding a nodes info to the NodeID
351/// data.
Jim Laskey583bd472006-10-27 23:46:08 +0000352static void AddNodeIDNode(FoldingSetNodeID &ID, SDNode *N) {
353 AddNodeIDOpcode(ID, N->getOpcode());
354 // Add the return value info.
355 AddNodeIDValueTypes(ID, N->getVTList());
356 // Add the operand info.
357 AddNodeIDOperands(ID, N->op_begin(), N->getNumOperands());
358
359 // Handle SDNode leafs with special info.
Dale Johannesen2041a0e2007-03-30 21:38:07 +0000360 switch (N->getOpcode()) {
361 default: break; // Normal nodes don't need extra info.
362 case ISD::TargetConstant:
363 case ISD::Constant:
Chris Lattner19fc1d32008-02-20 06:28:01 +0000364 ID.Add(cast<ConstantSDNode>(N)->getAPIntValue());
Dale Johannesen2041a0e2007-03-30 21:38:07 +0000365 break;
366 case ISD::TargetConstantFP:
Dale Johanneseneaf08942007-08-31 04:03:46 +0000367 case ISD::ConstantFP: {
Ted Kremenek1f801fa2008-02-11 17:24:50 +0000368 ID.Add(cast<ConstantFPSDNode>(N)->getValueAPF());
Dale Johannesen2041a0e2007-03-30 21:38:07 +0000369 break;
Dale Johanneseneaf08942007-08-31 04:03:46 +0000370 }
Dale Johannesen2041a0e2007-03-30 21:38:07 +0000371 case ISD::TargetGlobalAddress:
Lauro Ramos Venanciob3a04172007-04-20 21:38:10 +0000372 case ISD::GlobalAddress:
373 case ISD::TargetGlobalTLSAddress:
374 case ISD::GlobalTLSAddress: {
Dale Johannesen2041a0e2007-03-30 21:38:07 +0000375 GlobalAddressSDNode *GA = cast<GlobalAddressSDNode>(N);
376 ID.AddPointer(GA->getGlobal());
377 ID.AddInteger(GA->getOffset());
378 break;
379 }
380 case ISD::BasicBlock:
381 ID.AddPointer(cast<BasicBlockSDNode>(N)->getBasicBlock());
382 break;
383 case ISD::Register:
384 ID.AddInteger(cast<RegisterSDNode>(N)->getReg());
385 break;
Dan Gohman69de1932008-02-06 22:27:42 +0000386 case ISD::SRCVALUE:
387 ID.AddPointer(cast<SrcValueSDNode>(N)->getValue());
388 break;
389 case ISD::MEMOPERAND: {
390 const MemOperand &MO = cast<MemOperandSDNode>(N)->MO;
391 ID.AddPointer(MO.getValue());
392 ID.AddInteger(MO.getFlags());
393 ID.AddInteger(MO.getOffset());
394 ID.AddInteger(MO.getSize());
395 ID.AddInteger(MO.getAlignment());
Dale Johannesen2041a0e2007-03-30 21:38:07 +0000396 break;
397 }
398 case ISD::FrameIndex:
399 case ISD::TargetFrameIndex:
400 ID.AddInteger(cast<FrameIndexSDNode>(N)->getIndex());
401 break;
402 case ISD::JumpTable:
403 case ISD::TargetJumpTable:
404 ID.AddInteger(cast<JumpTableSDNode>(N)->getIndex());
405 break;
406 case ISD::ConstantPool:
407 case ISD::TargetConstantPool: {
408 ConstantPoolSDNode *CP = cast<ConstantPoolSDNode>(N);
409 ID.AddInteger(CP->getAlignment());
410 ID.AddInteger(CP->getOffset());
411 if (CP->isMachineConstantPoolEntry())
412 CP->getMachineCPVal()->AddSelectionDAGCSEId(ID);
413 else
414 ID.AddPointer(CP->getConstVal());
415 break;
416 }
417 case ISD::LOAD: {
418 LoadSDNode *LD = cast<LoadSDNode>(N);
419 ID.AddInteger(LD->getAddressingMode());
420 ID.AddInteger(LD->getExtensionType());
Dan Gohmanb625f2f2008-01-30 00:15:11 +0000421 ID.AddInteger((unsigned int)(LD->getMemoryVT()));
Dale Johannesen2041a0e2007-03-30 21:38:07 +0000422 ID.AddInteger(LD->getAlignment());
423 ID.AddInteger(LD->isVolatile());
424 break;
425 }
426 case ISD::STORE: {
427 StoreSDNode *ST = cast<StoreSDNode>(N);
428 ID.AddInteger(ST->getAddressingMode());
429 ID.AddInteger(ST->isTruncatingStore());
Dan Gohmanb625f2f2008-01-30 00:15:11 +0000430 ID.AddInteger((unsigned int)(ST->getMemoryVT()));
Dale Johannesen2041a0e2007-03-30 21:38:07 +0000431 ID.AddInteger(ST->getAlignment());
432 ID.AddInteger(ST->isVolatile());
433 break;
434 }
Jim Laskey583bd472006-10-27 23:46:08 +0000435 }
436}
437
438//===----------------------------------------------------------------------===//
Jim Laskey58b968b2005-08-17 20:08:02 +0000439// SelectionDAG Class
440//===----------------------------------------------------------------------===//
Chris Lattnerb48da392005-01-23 04:39:44 +0000441
Chris Lattner0e12e6e2005-01-07 21:09:16 +0000442/// RemoveDeadNodes - This method deletes all unreachable nodes in the
Chris Lattner190a4182006-08-04 17:45:20 +0000443/// SelectionDAG.
444void SelectionDAG::RemoveDeadNodes() {
Chris Lattner0e12e6e2005-01-07 21:09:16 +0000445 // Create a dummy node (which is not added to allnodes), that adds a reference
446 // to the root node, preventing it from being deleted.
Chris Lattner95038592005-10-05 06:35:28 +0000447 HandleSDNode Dummy(getRoot());
Chris Lattner0e12e6e2005-01-07 21:09:16 +0000448
Chris Lattner190a4182006-08-04 17:45:20 +0000449 SmallVector<SDNode*, 128> DeadNodes;
Chris Lattnerf469cb62005-11-08 18:52:27 +0000450
Chris Lattner190a4182006-08-04 17:45:20 +0000451 // Add all obviously-dead nodes to the DeadNodes worklist.
Chris Lattnerde202b32005-11-09 23:47:37 +0000452 for (allnodes_iterator I = allnodes_begin(), E = allnodes_end(); I != E; ++I)
Chris Lattner190a4182006-08-04 17:45:20 +0000453 if (I->use_empty())
454 DeadNodes.push_back(I);
455
456 // Process the worklist, deleting the nodes and adding their uses to the
457 // worklist.
458 while (!DeadNodes.empty()) {
459 SDNode *N = DeadNodes.back();
460 DeadNodes.pop_back();
461
462 // Take the node out of the appropriate CSE map.
463 RemoveNodeFromCSEMaps(N);
464
465 // Next, brutally remove the operand list. This is safe to do, as there are
466 // no cycles in the graph.
467 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I) {
468 SDNode *Operand = I->Val;
469 Operand->removeUser(N);
470
471 // Now that we removed this operand, see if there are no uses of it left.
472 if (Operand->use_empty())
473 DeadNodes.push_back(Operand);
Chris Lattnerf469cb62005-11-08 18:52:27 +0000474 }
Chris Lattner63e3f142007-02-04 07:28:00 +0000475 if (N->OperandsNeedDelete)
476 delete[] N->OperandList;
Chris Lattner190a4182006-08-04 17:45:20 +0000477 N->OperandList = 0;
478 N->NumOperands = 0;
479
480 // Finally, remove N itself.
481 AllNodes.erase(N);
Chris Lattnerf469cb62005-11-08 18:52:27 +0000482 }
483
Chris Lattner0e12e6e2005-01-07 21:09:16 +0000484 // If the root changed (e.g. it was a dead load, update the root).
Chris Lattner95038592005-10-05 06:35:28 +0000485 setRoot(Dummy.getValue());
Chris Lattner0e12e6e2005-01-07 21:09:16 +0000486}
487
Chris Lattnerf8dc0612008-02-03 06:49:24 +0000488void SelectionDAG::RemoveDeadNode(SDNode *N, DAGUpdateListener *UpdateListener){
Evan Cheng130a6472006-10-12 20:34:05 +0000489 SmallVector<SDNode*, 16> DeadNodes;
490 DeadNodes.push_back(N);
491
492 // Process the worklist, deleting the nodes and adding their uses to the
493 // worklist.
494 while (!DeadNodes.empty()) {
495 SDNode *N = DeadNodes.back();
496 DeadNodes.pop_back();
497
Chris Lattnerf8dc0612008-02-03 06:49:24 +0000498 if (UpdateListener)
499 UpdateListener->NodeDeleted(N);
500
Evan Cheng130a6472006-10-12 20:34:05 +0000501 // Take the node out of the appropriate CSE map.
502 RemoveNodeFromCSEMaps(N);
503
504 // Next, brutally remove the operand list. This is safe to do, as there are
505 // no cycles in the graph.
506 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I) {
507 SDNode *Operand = I->Val;
508 Operand->removeUser(N);
509
510 // Now that we removed this operand, see if there are no uses of it left.
511 if (Operand->use_empty())
512 DeadNodes.push_back(Operand);
513 }
Chris Lattner63e3f142007-02-04 07:28:00 +0000514 if (N->OperandsNeedDelete)
515 delete[] N->OperandList;
Evan Cheng130a6472006-10-12 20:34:05 +0000516 N->OperandList = 0;
517 N->NumOperands = 0;
518
519 // Finally, remove N itself.
Evan Cheng130a6472006-10-12 20:34:05 +0000520 AllNodes.erase(N);
521 }
522}
523
Chris Lattnerc26aefa2005-08-29 21:59:31 +0000524void SelectionDAG::DeleteNode(SDNode *N) {
525 assert(N->use_empty() && "Cannot delete a node that is not dead!");
526
527 // First take this out of the appropriate CSE map.
528 RemoveNodeFromCSEMaps(N);
529
Chris Lattner1e111c72005-09-07 05:37:01 +0000530 // Finally, remove uses due to operands of this node, remove from the
531 // AllNodes list, and delete the node.
532 DeleteNodeNotInCSEMaps(N);
533}
534
535void SelectionDAG::DeleteNodeNotInCSEMaps(SDNode *N) {
536
Chris Lattnerc26aefa2005-08-29 21:59:31 +0000537 // Remove it from the AllNodes list.
Chris Lattnerde202b32005-11-09 23:47:37 +0000538 AllNodes.remove(N);
Chris Lattnerc26aefa2005-08-29 21:59:31 +0000539
540 // Drop all of the operands and decrement used nodes use counts.
Chris Lattner65113b22005-11-08 22:07:03 +0000541 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I)
542 I->Val->removeUser(N);
Chris Lattner63e3f142007-02-04 07:28:00 +0000543 if (N->OperandsNeedDelete)
544 delete[] N->OperandList;
Chris Lattner65113b22005-11-08 22:07:03 +0000545 N->OperandList = 0;
546 N->NumOperands = 0;
Chris Lattnerc26aefa2005-08-29 21:59:31 +0000547
548 delete N;
549}
550
Chris Lattner149c58c2005-08-16 18:17:10 +0000551/// RemoveNodeFromCSEMaps - Take the specified node out of the CSE map that
552/// correspond to it. This is useful when we're about to delete or repurpose
553/// the node. We don't want future request for structurally identical nodes
554/// to return N anymore.
555void SelectionDAG::RemoveNodeFromCSEMaps(SDNode *N) {
Chris Lattner6621e3b2005-09-02 19:15:44 +0000556 bool Erased = false;
Chris Lattner0e12e6e2005-01-07 21:09:16 +0000557 switch (N->getOpcode()) {
Chris Lattner95038592005-10-05 06:35:28 +0000558 case ISD::HANDLENODE: return; // noop.
Chris Lattner36ce6912005-11-29 06:21:05 +0000559 case ISD::STRING:
560 Erased = StringNodes.erase(cast<StringSDNode>(N)->getValue());
561 break;
Chris Lattner7cf7e3f2005-08-09 20:20:18 +0000562 case ISD::CONDCODE:
563 assert(CondCodeNodes[cast<CondCodeSDNode>(N)->get()] &&
564 "Cond code doesn't exist!");
Chris Lattner6621e3b2005-09-02 19:15:44 +0000565 Erased = CondCodeNodes[cast<CondCodeSDNode>(N)->get()] != 0;
Chris Lattner7cf7e3f2005-08-09 20:20:18 +0000566 CondCodeNodes[cast<CondCodeSDNode>(N)->get()] = 0;
567 break;
Chris Lattner0e12e6e2005-01-07 21:09:16 +0000568 case ISD::ExternalSymbol:
Chris Lattner6621e3b2005-09-02 19:15:44 +0000569 Erased = ExternalSymbols.erase(cast<ExternalSymbolSDNode>(N)->getSymbol());
Chris Lattner0e12e6e2005-01-07 21:09:16 +0000570 break;
Andrew Lenharth2a2de662005-10-23 03:40:17 +0000571 case ISD::TargetExternalSymbol:
Chris Lattner809ec112006-01-28 10:09:25 +0000572 Erased =
573 TargetExternalSymbols.erase(cast<ExternalSymbolSDNode>(N)->getSymbol());
Andrew Lenharth2a2de662005-10-23 03:40:17 +0000574 break;
Duncan Sandsf411b832007-10-17 13:49:58 +0000575 case ISD::VALUETYPE: {
576 MVT::ValueType VT = cast<VTSDNode>(N)->getVT();
577 if (MVT::isExtendedVT(VT)) {
578 Erased = ExtendedValueTypeNodes.erase(VT);
579 } else {
580 Erased = ValueTypeNodes[VT] != 0;
581 ValueTypeNodes[VT] = 0;
582 }
Chris Lattner15e4b012005-07-10 00:07:11 +0000583 break;
Duncan Sandsf411b832007-10-17 13:49:58 +0000584 }
Chris Lattner0e12e6e2005-01-07 21:09:16 +0000585 default:
Chris Lattner4a283e92006-08-11 18:38:11 +0000586 // Remove it from the CSE Map.
587 Erased = CSEMap.RemoveNode(N);
Chris Lattner0e12e6e2005-01-07 21:09:16 +0000588 break;
589 }
Chris Lattner6621e3b2005-09-02 19:15:44 +0000590#ifndef NDEBUG
591 // Verify that the node was actually in one of the CSE maps, unless it has a
592 // flag result (which cannot be CSE'd) or is one of the special cases that are
593 // not subject to CSE.
594 if (!Erased && N->getValueType(N->getNumValues()-1) != MVT::Flag &&
Chris Lattner70814bc2006-01-29 07:58:15 +0000595 !N->isTargetOpcode()) {
Dan Gohmanb5bec2b2007-06-19 14:13:56 +0000596 N->dump(this);
Bill Wendling832171c2006-12-07 20:04:42 +0000597 cerr << "\n";
Chris Lattner6621e3b2005-09-02 19:15:44 +0000598 assert(0 && "Node is not in map!");
599 }
600#endif
Chris Lattner0e12e6e2005-01-07 21:09:16 +0000601}
602
Chris Lattner8b8749f2005-08-17 19:00:20 +0000603/// AddNonLeafNodeToCSEMaps - Add the specified node back to the CSE maps. It
604/// has been taken out and modified in some way. If the specified node already
605/// exists in the CSE maps, do not modify the maps, but return the existing node
606/// instead. If it doesn't exist, add it and return null.
607///
608SDNode *SelectionDAG::AddNonLeafNodeToCSEMaps(SDNode *N) {
609 assert(N->getNumOperands() && "This is a leaf node!");
Chris Lattner70814bc2006-01-29 07:58:15 +0000610 if (N->getOpcode() == ISD::HANDLENODE || N->getValueType(0) == MVT::Flag)
Chris Lattnerfe14b342005-12-01 23:14:50 +0000611 return 0; // Never add these nodes.
Chris Lattnerc85a9f32005-11-30 18:20:52 +0000612
Chris Lattner9f8cc692005-12-19 22:21:21 +0000613 // Check that remaining values produced are not flags.
614 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i)
615 if (N->getValueType(i) == MVT::Flag)
616 return 0; // Never CSE anything that produces a flag.
617
Chris Lattnera5682852006-08-07 23:03:03 +0000618 SDNode *New = CSEMap.GetOrInsertNode(N);
619 if (New != N) return New; // Node already existed.
Chris Lattner8b8749f2005-08-17 19:00:20 +0000620 return 0;
Chris Lattner8b8749f2005-08-17 19:00:20 +0000621}
622
Chris Lattnerdf6eb302006-01-28 09:32:45 +0000623/// FindModifiedNodeSlot - Find a slot for the specified node if its operands
624/// were replaced with those specified. If this node is never memoized,
625/// return null, otherwise return a pointer to the slot it would take. If a
626/// node already exists with these operands, the slot will be non-null.
Chris Lattnera5682852006-08-07 23:03:03 +0000627SDNode *SelectionDAG::FindModifiedNodeSlot(SDNode *N, SDOperand Op,
628 void *&InsertPos) {
Chris Lattner70814bc2006-01-29 07:58:15 +0000629 if (N->getOpcode() == ISD::HANDLENODE || N->getValueType(0) == MVT::Flag)
Chris Lattnerdf6eb302006-01-28 09:32:45 +0000630 return 0; // Never add these nodes.
631
632 // Check that remaining values produced are not flags.
633 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i)
634 if (N->getValueType(i) == MVT::Flag)
635 return 0; // Never CSE anything that produces a flag.
636
Chris Lattner63e3f142007-02-04 07:28:00 +0000637 SDOperand Ops[] = { Op };
Jim Laskey583bd472006-10-27 23:46:08 +0000638 FoldingSetNodeID ID;
Chris Lattner63e3f142007-02-04 07:28:00 +0000639 AddNodeIDNode(ID, N->getOpcode(), N->getVTList(), Ops, 1);
Chris Lattnera5682852006-08-07 23:03:03 +0000640 return CSEMap.FindNodeOrInsertPos(ID, InsertPos);
Chris Lattnerdf6eb302006-01-28 09:32:45 +0000641}
642
643/// FindModifiedNodeSlot - Find a slot for the specified node if its operands
644/// were replaced with those specified. If this node is never memoized,
645/// return null, otherwise return a pointer to the slot it would take. If a
646/// node already exists with these operands, the slot will be non-null.
Chris Lattnera5682852006-08-07 23:03:03 +0000647SDNode *SelectionDAG::FindModifiedNodeSlot(SDNode *N,
648 SDOperand Op1, SDOperand Op2,
649 void *&InsertPos) {
650 if (N->getOpcode() == ISD::HANDLENODE || N->getValueType(0) == MVT::Flag)
651 return 0; // Never add these nodes.
652
653 // Check that remaining values produced are not flags.
654 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i)
655 if (N->getValueType(i) == MVT::Flag)
656 return 0; // Never CSE anything that produces a flag.
657
Chris Lattner63e3f142007-02-04 07:28:00 +0000658 SDOperand Ops[] = { Op1, Op2 };
Jim Laskey583bd472006-10-27 23:46:08 +0000659 FoldingSetNodeID ID;
Chris Lattner63e3f142007-02-04 07:28:00 +0000660 AddNodeIDNode(ID, N->getOpcode(), N->getVTList(), Ops, 2);
Chris Lattnera5682852006-08-07 23:03:03 +0000661 return CSEMap.FindNodeOrInsertPos(ID, InsertPos);
662}
663
664
665/// FindModifiedNodeSlot - Find a slot for the specified node if its operands
666/// were replaced with those specified. If this node is never memoized,
667/// return null, otherwise return a pointer to the slot it would take. If a
668/// node already exists with these operands, the slot will be non-null.
669SDNode *SelectionDAG::FindModifiedNodeSlot(SDNode *N,
Chris Lattnerf06f35e2006-08-08 01:09:31 +0000670 const SDOperand *Ops,unsigned NumOps,
Chris Lattnera5682852006-08-07 23:03:03 +0000671 void *&InsertPos) {
Chris Lattner70814bc2006-01-29 07:58:15 +0000672 if (N->getOpcode() == ISD::HANDLENODE || N->getValueType(0) == MVT::Flag)
Chris Lattnerdf6eb302006-01-28 09:32:45 +0000673 return 0; // Never add these nodes.
674
675 // Check that remaining values produced are not flags.
676 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i)
677 if (N->getValueType(i) == MVT::Flag)
678 return 0; // Never CSE anything that produces a flag.
679
Jim Laskey583bd472006-10-27 23:46:08 +0000680 FoldingSetNodeID ID;
Dan Gohman575e2f42007-06-04 15:49:41 +0000681 AddNodeIDNode(ID, N->getOpcode(), N->getVTList(), Ops, NumOps);
Jim Laskey583bd472006-10-27 23:46:08 +0000682
Evan Cheng9629aba2006-10-11 01:47:58 +0000683 if (const LoadSDNode *LD = dyn_cast<LoadSDNode>(N)) {
684 ID.AddInteger(LD->getAddressingMode());
685 ID.AddInteger(LD->getExtensionType());
Dan Gohmanb625f2f2008-01-30 00:15:11 +0000686 ID.AddInteger((unsigned int)(LD->getMemoryVT()));
Evan Cheng9629aba2006-10-11 01:47:58 +0000687 ID.AddInteger(LD->getAlignment());
688 ID.AddInteger(LD->isVolatile());
Evan Cheng8b2794a2006-10-13 21:14:26 +0000689 } else if (const StoreSDNode *ST = dyn_cast<StoreSDNode>(N)) {
690 ID.AddInteger(ST->getAddressingMode());
691 ID.AddInteger(ST->isTruncatingStore());
Dan Gohmanb625f2f2008-01-30 00:15:11 +0000692 ID.AddInteger((unsigned int)(ST->getMemoryVT()));
Evan Cheng8b2794a2006-10-13 21:14:26 +0000693 ID.AddInteger(ST->getAlignment());
694 ID.AddInteger(ST->isVolatile());
Evan Cheng9629aba2006-10-11 01:47:58 +0000695 }
Jim Laskey583bd472006-10-27 23:46:08 +0000696
Chris Lattnera5682852006-08-07 23:03:03 +0000697 return CSEMap.FindNodeOrInsertPos(ID, InsertPos);
Chris Lattnerdf6eb302006-01-28 09:32:45 +0000698}
Chris Lattner8b8749f2005-08-17 19:00:20 +0000699
Chris Lattner0e12e6e2005-01-07 21:09:16 +0000700
Chris Lattner78ec3112003-08-11 14:57:33 +0000701SelectionDAG::~SelectionDAG() {
Chris Lattnerde202b32005-11-09 23:47:37 +0000702 while (!AllNodes.empty()) {
703 SDNode *N = AllNodes.begin();
Chris Lattner213a16c2006-08-14 22:19:25 +0000704 N->SetNextInBucket(0);
Chris Lattner63e3f142007-02-04 07:28:00 +0000705 if (N->OperandsNeedDelete)
706 delete [] N->OperandList;
Chris Lattner65113b22005-11-08 22:07:03 +0000707 N->OperandList = 0;
708 N->NumOperands = 0;
Chris Lattnerde202b32005-11-09 23:47:37 +0000709 AllNodes.pop_front();
Chris Lattner65113b22005-11-08 22:07:03 +0000710 }
Chris Lattner78ec3112003-08-11 14:57:33 +0000711}
712
Chris Lattner0f2287b2005-04-13 02:38:18 +0000713SDOperand SelectionDAG::getZeroExtendInReg(SDOperand Op, MVT::ValueType VT) {
Chris Lattner51679c42005-04-13 19:41:05 +0000714 if (Op.getValueType() == VT) return Op;
Jeff Cohen19bb2282005-05-10 02:22:38 +0000715 int64_t Imm = ~0ULL >> (64-MVT::getSizeInBits(VT));
Chris Lattner0f2287b2005-04-13 02:38:18 +0000716 return getNode(ISD::AND, Op.getValueType(), Op,
717 getConstant(Imm, Op.getValueType()));
718}
719
Chris Lattner36ce6912005-11-29 06:21:05 +0000720SDOperand SelectionDAG::getString(const std::string &Val) {
721 StringSDNode *&N = StringNodes[Val];
722 if (!N) {
723 N = new StringSDNode(Val);
724 AllNodes.push_back(N);
725 }
726 return SDOperand(N, 0);
727}
728
Chris Lattner61b09412006-08-11 21:01:22 +0000729SDOperand SelectionDAG::getConstant(uint64_t Val, MVT::ValueType VT, bool isT) {
Dan Gohman6394b092008-02-08 22:59:30 +0000730 MVT::ValueType EltVT =
731 MVT::isVector(VT) ? MVT::getVectorElementType(VT) : VT;
732
733 return getConstant(APInt(MVT::getSizeInBits(EltVT), Val), VT, isT);
734}
735
736SDOperand SelectionDAG::getConstant(const APInt &Val, MVT::ValueType VT, bool isT) {
Chris Lattner37bfbb42005-08-17 00:34:06 +0000737 assert(MVT::isInteger(VT) && "Cannot create FP integer constant!");
Dan Gohman89081322007-12-12 22:21:26 +0000738
739 MVT::ValueType EltVT =
740 MVT::isVector(VT) ? MVT::getVectorElementType(VT) : VT;
Chris Lattner37bfbb42005-08-17 00:34:06 +0000741
Dan Gohman6394b092008-02-08 22:59:30 +0000742 assert(Val.getBitWidth() == MVT::getSizeInBits(EltVT) &&
743 "APInt size does not match type size!");
Chris Lattner61b09412006-08-11 21:01:22 +0000744
745 unsigned Opc = isT ? ISD::TargetConstant : ISD::Constant;
Jim Laskey583bd472006-10-27 23:46:08 +0000746 FoldingSetNodeID ID;
Dan Gohman89081322007-12-12 22:21:26 +0000747 AddNodeIDNode(ID, Opc, getVTList(EltVT), 0, 0);
Ted Kremenek1f801fa2008-02-11 17:24:50 +0000748 ID.Add(Val);
Chris Lattner61b09412006-08-11 21:01:22 +0000749 void *IP = 0;
Dan Gohman89081322007-12-12 22:21:26 +0000750 SDNode *N = NULL;
751 if ((N = CSEMap.FindNodeOrInsertPos(ID, IP)))
752 if (!MVT::isVector(VT))
753 return SDOperand(N, 0);
754 if (!N) {
755 N = new ConstantSDNode(isT, Val, EltVT);
756 CSEMap.InsertNode(N, IP);
757 AllNodes.push_back(N);
758 }
759
760 SDOperand Result(N, 0);
761 if (MVT::isVector(VT)) {
762 SmallVector<SDOperand, 8> Ops;
763 Ops.assign(MVT::getVectorNumElements(VT), Result);
764 Result = getNode(ISD::BUILD_VECTOR, VT, &Ops[0], Ops.size());
765 }
766 return Result;
Chris Lattner78ec3112003-08-11 14:57:33 +0000767}
768
Chris Lattner0bd48932008-01-17 07:00:52 +0000769SDOperand SelectionDAG::getIntPtrConstant(uint64_t Val, bool isTarget) {
770 return getConstant(Val, TLI.getPointerTy(), isTarget);
771}
772
773
Dale Johannesenf04afdb2007-08-30 00:23:21 +0000774SDOperand SelectionDAG::getConstantFP(const APFloat& V, MVT::ValueType VT,
Chris Lattnerc9f8f412006-08-11 21:55:30 +0000775 bool isTarget) {
Chris Lattnerc3aae252005-01-07 07:46:32 +0000776 assert(MVT::isFloatingPoint(VT) && "Cannot create integer FP constant!");
Dale Johannesenf04afdb2007-08-30 00:23:21 +0000777
Dan Gohman7f321562007-06-25 16:23:39 +0000778 MVT::ValueType EltVT =
779 MVT::isVector(VT) ? MVT::getVectorElementType(VT) : VT;
Chris Lattnerc3aae252005-01-07 07:46:32 +0000780
Chris Lattnerd8658612005-02-17 20:17:32 +0000781 // Do the map lookup using the actual bit pattern for the floating point
782 // value, so that we don't have problems with 0.0 comparing equal to -0.0, and
783 // we don't have issues with SNANs.
Chris Lattnerc9f8f412006-08-11 21:55:30 +0000784 unsigned Opc = isTarget ? ISD::TargetConstantFP : ISD::ConstantFP;
Jim Laskey583bd472006-10-27 23:46:08 +0000785 FoldingSetNodeID ID;
Dan Gohman7f321562007-06-25 16:23:39 +0000786 AddNodeIDNode(ID, Opc, getVTList(EltVT), 0, 0);
Ted Kremenek1f801fa2008-02-11 17:24:50 +0000787 ID.Add(V);
Chris Lattnerc9f8f412006-08-11 21:55:30 +0000788 void *IP = 0;
Evan Chengc908dcd2007-06-29 21:36:04 +0000789 SDNode *N = NULL;
790 if ((N = CSEMap.FindNodeOrInsertPos(ID, IP)))
791 if (!MVT::isVector(VT))
792 return SDOperand(N, 0);
793 if (!N) {
Dale Johannesen9e3d3ab2007-09-14 22:26:36 +0000794 N = new ConstantFPSDNode(isTarget, V, EltVT);
Evan Chengc908dcd2007-06-29 21:36:04 +0000795 CSEMap.InsertNode(N, IP);
796 AllNodes.push_back(N);
797 }
798
Dan Gohman7f321562007-06-25 16:23:39 +0000799 SDOperand Result(N, 0);
800 if (MVT::isVector(VT)) {
801 SmallVector<SDOperand, 8> Ops;
802 Ops.assign(MVT::getVectorNumElements(VT), Result);
803 Result = getNode(ISD::BUILD_VECTOR, VT, &Ops[0], Ops.size());
804 }
805 return Result;
Chris Lattnerc3aae252005-01-07 07:46:32 +0000806}
807
Dale Johannesenf04afdb2007-08-30 00:23:21 +0000808SDOperand SelectionDAG::getConstantFP(double Val, MVT::ValueType VT,
809 bool isTarget) {
810 MVT::ValueType EltVT =
811 MVT::isVector(VT) ? MVT::getVectorElementType(VT) : VT;
812 if (EltVT==MVT::f32)
813 return getConstantFP(APFloat((float)Val), VT, isTarget);
814 else
815 return getConstantFP(APFloat(Val), VT, isTarget);
816}
817
Chris Lattnerc3aae252005-01-07 07:46:32 +0000818SDOperand SelectionDAG::getGlobalAddress(const GlobalValue *GV,
Chris Lattner61b09412006-08-11 21:01:22 +0000819 MVT::ValueType VT, int Offset,
820 bool isTargetGA) {
Lauro Ramos Venanciob3a04172007-04-20 21:38:10 +0000821 const GlobalVariable *GVar = dyn_cast<GlobalVariable>(GV);
822 unsigned Opc;
823 if (GVar && GVar->isThreadLocal())
824 Opc = isTargetGA ? ISD::TargetGlobalTLSAddress : ISD::GlobalTLSAddress;
825 else
826 Opc = isTargetGA ? ISD::TargetGlobalAddress : ISD::GlobalAddress;
Jim Laskey583bd472006-10-27 23:46:08 +0000827 FoldingSetNodeID ID;
Chris Lattner63e3f142007-02-04 07:28:00 +0000828 AddNodeIDNode(ID, Opc, getVTList(VT), 0, 0);
Chris Lattner61b09412006-08-11 21:01:22 +0000829 ID.AddPointer(GV);
830 ID.AddInteger(Offset);
831 void *IP = 0;
832 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
833 return SDOperand(E, 0);
834 SDNode *N = new GlobalAddressSDNode(isTargetGA, GV, VT, Offset);
835 CSEMap.InsertNode(N, IP);
Chris Lattnerc3aae252005-01-07 07:46:32 +0000836 AllNodes.push_back(N);
837 return SDOperand(N, 0);
838}
839
Chris Lattnerc9f8f412006-08-11 21:55:30 +0000840SDOperand SelectionDAG::getFrameIndex(int FI, MVT::ValueType VT,
841 bool isTarget) {
842 unsigned Opc = isTarget ? ISD::TargetFrameIndex : ISD::FrameIndex;
Jim Laskey583bd472006-10-27 23:46:08 +0000843 FoldingSetNodeID ID;
Chris Lattner63e3f142007-02-04 07:28:00 +0000844 AddNodeIDNode(ID, Opc, getVTList(VT), 0, 0);
Chris Lattnerc9f8f412006-08-11 21:55:30 +0000845 ID.AddInteger(FI);
846 void *IP = 0;
847 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
848 return SDOperand(E, 0);
849 SDNode *N = new FrameIndexSDNode(FI, VT, isTarget);
850 CSEMap.InsertNode(N, IP);
Chris Lattnerafb2dd42005-08-25 00:43:01 +0000851 AllNodes.push_back(N);
852 return SDOperand(N, 0);
853}
854
Chris Lattnerc9f8f412006-08-11 21:55:30 +0000855SDOperand SelectionDAG::getJumpTable(int JTI, MVT::ValueType VT, bool isTarget){
856 unsigned Opc = isTarget ? ISD::TargetJumpTable : ISD::JumpTable;
Jim Laskey583bd472006-10-27 23:46:08 +0000857 FoldingSetNodeID ID;
Chris Lattner63e3f142007-02-04 07:28:00 +0000858 AddNodeIDNode(ID, Opc, getVTList(VT), 0, 0);
Chris Lattnerc9f8f412006-08-11 21:55:30 +0000859 ID.AddInteger(JTI);
860 void *IP = 0;
861 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
862 return SDOperand(E, 0);
863 SDNode *N = new JumpTableSDNode(JTI, VT, isTarget);
864 CSEMap.InsertNode(N, IP);
Nate Begeman37efe672006-04-22 18:53:45 +0000865 AllNodes.push_back(N);
866 return SDOperand(N, 0);
867}
868
Evan Chengb8973bd2006-01-31 22:23:14 +0000869SDOperand SelectionDAG::getConstantPool(Constant *C, MVT::ValueType VT,
Chris Lattnerc9f8f412006-08-11 21:55:30 +0000870 unsigned Alignment, int Offset,
871 bool isTarget) {
872 unsigned Opc = isTarget ? ISD::TargetConstantPool : ISD::ConstantPool;
Jim Laskey583bd472006-10-27 23:46:08 +0000873 FoldingSetNodeID ID;
Chris Lattner63e3f142007-02-04 07:28:00 +0000874 AddNodeIDNode(ID, Opc, getVTList(VT), 0, 0);
Chris Lattnerc9f8f412006-08-11 21:55:30 +0000875 ID.AddInteger(Alignment);
876 ID.AddInteger(Offset);
Chris Lattner130fc132006-08-14 20:12:44 +0000877 ID.AddPointer(C);
Chris Lattnerc9f8f412006-08-11 21:55:30 +0000878 void *IP = 0;
879 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
880 return SDOperand(E, 0);
881 SDNode *N = new ConstantPoolSDNode(isTarget, C, VT, Offset, Alignment);
882 CSEMap.InsertNode(N, IP);
Chris Lattner4025a9c2005-08-25 05:03:06 +0000883 AllNodes.push_back(N);
884 return SDOperand(N, 0);
885}
886
Chris Lattnerc3aae252005-01-07 07:46:32 +0000887
Evan Chengd6594ae2006-09-12 21:00:35 +0000888SDOperand SelectionDAG::getConstantPool(MachineConstantPoolValue *C,
889 MVT::ValueType VT,
890 unsigned Alignment, int Offset,
891 bool isTarget) {
892 unsigned Opc = isTarget ? ISD::TargetConstantPool : ISD::ConstantPool;
Jim Laskey583bd472006-10-27 23:46:08 +0000893 FoldingSetNodeID ID;
Chris Lattner63e3f142007-02-04 07:28:00 +0000894 AddNodeIDNode(ID, Opc, getVTList(VT), 0, 0);
Evan Chengd6594ae2006-09-12 21:00:35 +0000895 ID.AddInteger(Alignment);
896 ID.AddInteger(Offset);
Jim Laskey583bd472006-10-27 23:46:08 +0000897 C->AddSelectionDAGCSEId(ID);
Evan Chengd6594ae2006-09-12 21:00:35 +0000898 void *IP = 0;
899 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
900 return SDOperand(E, 0);
901 SDNode *N = new ConstantPoolSDNode(isTarget, C, VT, Offset, Alignment);
902 CSEMap.InsertNode(N, IP);
903 AllNodes.push_back(N);
904 return SDOperand(N, 0);
905}
906
907
Chris Lattnerc3aae252005-01-07 07:46:32 +0000908SDOperand SelectionDAG::getBasicBlock(MachineBasicBlock *MBB) {
Jim Laskey583bd472006-10-27 23:46:08 +0000909 FoldingSetNodeID ID;
Chris Lattner63e3f142007-02-04 07:28:00 +0000910 AddNodeIDNode(ID, ISD::BasicBlock, getVTList(MVT::Other), 0, 0);
Chris Lattner61b09412006-08-11 21:01:22 +0000911 ID.AddPointer(MBB);
912 void *IP = 0;
913 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
914 return SDOperand(E, 0);
915 SDNode *N = new BasicBlockSDNode(MBB);
916 CSEMap.InsertNode(N, IP);
Chris Lattnerc3aae252005-01-07 07:46:32 +0000917 AllNodes.push_back(N);
918 return SDOperand(N, 0);
919}
920
Chris Lattner15e4b012005-07-10 00:07:11 +0000921SDOperand SelectionDAG::getValueType(MVT::ValueType VT) {
Duncan Sandsf411b832007-10-17 13:49:58 +0000922 if (!MVT::isExtendedVT(VT) && (unsigned)VT >= ValueTypeNodes.size())
Chris Lattner15e4b012005-07-10 00:07:11 +0000923 ValueTypeNodes.resize(VT+1);
Chris Lattner15e4b012005-07-10 00:07:11 +0000924
Duncan Sandsf411b832007-10-17 13:49:58 +0000925 SDNode *&N = MVT::isExtendedVT(VT) ?
926 ExtendedValueTypeNodes[VT] : ValueTypeNodes[VT];
927
928 if (N) return SDOperand(N, 0);
929 N = new VTSDNode(VT);
930 AllNodes.push_back(N);
931 return SDOperand(N, 0);
Chris Lattner15e4b012005-07-10 00:07:11 +0000932}
933
Chris Lattnerc3aae252005-01-07 07:46:32 +0000934SDOperand SelectionDAG::getExternalSymbol(const char *Sym, MVT::ValueType VT) {
935 SDNode *&N = ExternalSymbols[Sym];
936 if (N) return SDOperand(N, 0);
Andrew Lenharth2a2de662005-10-23 03:40:17 +0000937 N = new ExternalSymbolSDNode(false, Sym, VT);
938 AllNodes.push_back(N);
939 return SDOperand(N, 0);
940}
941
Chris Lattner809ec112006-01-28 10:09:25 +0000942SDOperand SelectionDAG::getTargetExternalSymbol(const char *Sym,
943 MVT::ValueType VT) {
Andrew Lenharth2a2de662005-10-23 03:40:17 +0000944 SDNode *&N = TargetExternalSymbols[Sym];
945 if (N) return SDOperand(N, 0);
946 N = new ExternalSymbolSDNode(true, Sym, VT);
Chris Lattnerc3aae252005-01-07 07:46:32 +0000947 AllNodes.push_back(N);
948 return SDOperand(N, 0);
949}
950
Chris Lattner7cf7e3f2005-08-09 20:20:18 +0000951SDOperand SelectionDAG::getCondCode(ISD::CondCode Cond) {
952 if ((unsigned)Cond >= CondCodeNodes.size())
953 CondCodeNodes.resize(Cond+1);
954
Chris Lattner079a27a2005-08-09 20:40:02 +0000955 if (CondCodeNodes[Cond] == 0) {
Chris Lattner7cf7e3f2005-08-09 20:20:18 +0000956 CondCodeNodes[Cond] = new CondCodeSDNode(Cond);
Chris Lattner079a27a2005-08-09 20:40:02 +0000957 AllNodes.push_back(CondCodeNodes[Cond]);
958 }
Chris Lattner7cf7e3f2005-08-09 20:20:18 +0000959 return SDOperand(CondCodeNodes[Cond], 0);
960}
961
Chris Lattner0fdd7682005-08-30 22:38:38 +0000962SDOperand SelectionDAG::getRegister(unsigned RegNo, MVT::ValueType VT) {
Jim Laskey583bd472006-10-27 23:46:08 +0000963 FoldingSetNodeID ID;
Chris Lattner63e3f142007-02-04 07:28:00 +0000964 AddNodeIDNode(ID, ISD::Register, getVTList(VT), 0, 0);
Chris Lattner61b09412006-08-11 21:01:22 +0000965 ID.AddInteger(RegNo);
966 void *IP = 0;
967 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
968 return SDOperand(E, 0);
969 SDNode *N = new RegisterSDNode(RegNo, VT);
970 CSEMap.InsertNode(N, IP);
971 AllNodes.push_back(N);
972 return SDOperand(N, 0);
973}
974
Dan Gohman69de1932008-02-06 22:27:42 +0000975SDOperand SelectionDAG::getSrcValue(const Value *V) {
Chris Lattner61b09412006-08-11 21:01:22 +0000976 assert((!V || isa<PointerType>(V->getType())) &&
977 "SrcValue is not a pointer?");
978
Jim Laskey583bd472006-10-27 23:46:08 +0000979 FoldingSetNodeID ID;
Chris Lattner63e3f142007-02-04 07:28:00 +0000980 AddNodeIDNode(ID, ISD::SRCVALUE, getVTList(MVT::Other), 0, 0);
Chris Lattner61b09412006-08-11 21:01:22 +0000981 ID.AddPointer(V);
Dan Gohman69de1932008-02-06 22:27:42 +0000982
Chris Lattner61b09412006-08-11 21:01:22 +0000983 void *IP = 0;
984 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
985 return SDOperand(E, 0);
Dan Gohman69de1932008-02-06 22:27:42 +0000986
987 SDNode *N = new SrcValueSDNode(V);
988 CSEMap.InsertNode(N, IP);
989 AllNodes.push_back(N);
990 return SDOperand(N, 0);
991}
992
993SDOperand SelectionDAG::getMemOperand(const MemOperand &MO) {
994 const Value *v = MO.getValue();
995 assert((!v || isa<PointerType>(v->getType())) &&
996 "SrcValue is not a pointer?");
997
998 FoldingSetNodeID ID;
999 AddNodeIDNode(ID, ISD::MEMOPERAND, getVTList(MVT::Other), 0, 0);
1000 ID.AddPointer(v);
1001 ID.AddInteger(MO.getFlags());
1002 ID.AddInteger(MO.getOffset());
1003 ID.AddInteger(MO.getSize());
1004 ID.AddInteger(MO.getAlignment());
1005
1006 void *IP = 0;
1007 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1008 return SDOperand(E, 0);
1009
1010 SDNode *N = new MemOperandSDNode(MO);
Chris Lattner61b09412006-08-11 21:01:22 +00001011 CSEMap.InsertNode(N, IP);
1012 AllNodes.push_back(N);
1013 return SDOperand(N, 0);
Chris Lattnerd5d0f9b2005-08-16 21:55:35 +00001014}
1015
Chris Lattner37ce9df2007-10-15 17:47:20 +00001016/// CreateStackTemporary - Create a stack temporary, suitable for holding the
1017/// specified value type.
1018SDOperand SelectionDAG::CreateStackTemporary(MVT::ValueType VT) {
1019 MachineFrameInfo *FrameInfo = getMachineFunction().getFrameInfo();
1020 unsigned ByteSize = MVT::getSizeInBits(VT)/8;
1021 const Type *Ty = MVT::getTypeForValueType(VT);
1022 unsigned StackAlign = (unsigned)TLI.getTargetData()->getPrefTypeAlignment(Ty);
1023 int FrameIdx = FrameInfo->CreateStackObject(ByteSize, StackAlign);
1024 return getFrameIndex(FrameIdx, TLI.getPointerTy());
1025}
1026
1027
Chris Lattner51dabfb2006-10-14 00:41:01 +00001028SDOperand SelectionDAG::FoldSetCC(MVT::ValueType VT, SDOperand N1,
1029 SDOperand N2, ISD::CondCode Cond) {
Chris Lattnerc3aae252005-01-07 07:46:32 +00001030 // These setcc operations always fold.
1031 switch (Cond) {
1032 default: break;
1033 case ISD::SETFALSE:
Chris Lattnerf30b73b2005-01-18 02:52:03 +00001034 case ISD::SETFALSE2: return getConstant(0, VT);
Chris Lattnerc3aae252005-01-07 07:46:32 +00001035 case ISD::SETTRUE:
Chris Lattnerf30b73b2005-01-18 02:52:03 +00001036 case ISD::SETTRUE2: return getConstant(1, VT);
Chris Lattnera83385f2006-04-27 05:01:07 +00001037
1038 case ISD::SETOEQ:
1039 case ISD::SETOGT:
1040 case ISD::SETOGE:
1041 case ISD::SETOLT:
1042 case ISD::SETOLE:
1043 case ISD::SETONE:
1044 case ISD::SETO:
1045 case ISD::SETUO:
1046 case ISD::SETUEQ:
1047 case ISD::SETUNE:
1048 assert(!MVT::isInteger(N1.getValueType()) && "Illegal setcc for integer!");
1049 break;
Chris Lattnerc3aae252005-01-07 07:46:32 +00001050 }
Chris Lattner51dabfb2006-10-14 00:41:01 +00001051
Chris Lattner67255a12005-04-07 18:14:58 +00001052 if (ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val)) {
1053 uint64_t C2 = N2C->getValue();
1054 if (ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val)) {
1055 uint64_t C1 = N1C->getValue();
Chris Lattner51dabfb2006-10-14 00:41:01 +00001056
Chris Lattnerc3aae252005-01-07 07:46:32 +00001057 // Sign extend the operands if required
1058 if (ISD::isSignedIntSetCC(Cond)) {
1059 C1 = N1C->getSignExtended();
1060 C2 = N2C->getSignExtended();
1061 }
Chris Lattner51dabfb2006-10-14 00:41:01 +00001062
Chris Lattnerc3aae252005-01-07 07:46:32 +00001063 switch (Cond) {
1064 default: assert(0 && "Unknown integer setcc!");
Chris Lattnerf30b73b2005-01-18 02:52:03 +00001065 case ISD::SETEQ: return getConstant(C1 == C2, VT);
1066 case ISD::SETNE: return getConstant(C1 != C2, VT);
1067 case ISD::SETULT: return getConstant(C1 < C2, VT);
1068 case ISD::SETUGT: return getConstant(C1 > C2, VT);
1069 case ISD::SETULE: return getConstant(C1 <= C2, VT);
1070 case ISD::SETUGE: return getConstant(C1 >= C2, VT);
1071 case ISD::SETLT: return getConstant((int64_t)C1 < (int64_t)C2, VT);
1072 case ISD::SETGT: return getConstant((int64_t)C1 > (int64_t)C2, VT);
1073 case ISD::SETLE: return getConstant((int64_t)C1 <= (int64_t)C2, VT);
1074 case ISD::SETGE: return getConstant((int64_t)C1 >= (int64_t)C2, VT);
Chris Lattnerc3aae252005-01-07 07:46:32 +00001075 }
Chris Lattnerc3aae252005-01-07 07:46:32 +00001076 }
Chris Lattner67255a12005-04-07 18:14:58 +00001077 }
Anton Korobeynikov4c71dfe2008-02-20 11:10:28 +00001078 if (ConstantFPSDNode *N1C = dyn_cast<ConstantFPSDNode>(N1.Val)) {
Chris Lattnerc3aae252005-01-07 07:46:32 +00001079 if (ConstantFPSDNode *N2C = dyn_cast<ConstantFPSDNode>(N2.Val)) {
Dale Johannesen5927d8e2007-10-14 01:56:47 +00001080 // No compile time operations on this type yet.
1081 if (N1C->getValueType(0) == MVT::ppcf128)
1082 return SDOperand();
Dale Johanneseneaf08942007-08-31 04:03:46 +00001083
1084 APFloat::cmpResult R = N1C->getValueAPF().compare(N2C->getValueAPF());
Chris Lattnerc3aae252005-01-07 07:46:32 +00001085 switch (Cond) {
Dale Johanneseneaf08942007-08-31 04:03:46 +00001086 default: break;
Dale Johannesenee847682007-08-31 17:03:33 +00001087 case ISD::SETEQ: if (R==APFloat::cmpUnordered)
1088 return getNode(ISD::UNDEF, VT);
1089 // fall through
1090 case ISD::SETOEQ: return getConstant(R==APFloat::cmpEqual, VT);
1091 case ISD::SETNE: if (R==APFloat::cmpUnordered)
1092 return getNode(ISD::UNDEF, VT);
1093 // fall through
1094 case ISD::SETONE: return getConstant(R==APFloat::cmpGreaterThan ||
Dale Johanneseneaf08942007-08-31 04:03:46 +00001095 R==APFloat::cmpLessThan, VT);
Dale Johannesenee847682007-08-31 17:03:33 +00001096 case ISD::SETLT: if (R==APFloat::cmpUnordered)
1097 return getNode(ISD::UNDEF, VT);
1098 // fall through
1099 case ISD::SETOLT: return getConstant(R==APFloat::cmpLessThan, VT);
1100 case ISD::SETGT: if (R==APFloat::cmpUnordered)
1101 return getNode(ISD::UNDEF, VT);
1102 // fall through
1103 case ISD::SETOGT: return getConstant(R==APFloat::cmpGreaterThan, VT);
1104 case ISD::SETLE: if (R==APFloat::cmpUnordered)
1105 return getNode(ISD::UNDEF, VT);
1106 // fall through
1107 case ISD::SETOLE: return getConstant(R==APFloat::cmpLessThan ||
Dale Johanneseneaf08942007-08-31 04:03:46 +00001108 R==APFloat::cmpEqual, VT);
Dale Johannesenee847682007-08-31 17:03:33 +00001109 case ISD::SETGE: if (R==APFloat::cmpUnordered)
1110 return getNode(ISD::UNDEF, VT);
1111 // fall through
1112 case ISD::SETOGE: return getConstant(R==APFloat::cmpGreaterThan ||
Dale Johanneseneaf08942007-08-31 04:03:46 +00001113 R==APFloat::cmpEqual, VT);
1114 case ISD::SETO: return getConstant(R!=APFloat::cmpUnordered, VT);
1115 case ISD::SETUO: return getConstant(R==APFloat::cmpUnordered, VT);
1116 case ISD::SETUEQ: return getConstant(R==APFloat::cmpUnordered ||
1117 R==APFloat::cmpEqual, VT);
1118 case ISD::SETUNE: return getConstant(R!=APFloat::cmpEqual, VT);
1119 case ISD::SETULT: return getConstant(R==APFloat::cmpUnordered ||
1120 R==APFloat::cmpLessThan, VT);
1121 case ISD::SETUGT: return getConstant(R==APFloat::cmpGreaterThan ||
1122 R==APFloat::cmpUnordered, VT);
1123 case ISD::SETULE: return getConstant(R!=APFloat::cmpGreaterThan, VT);
1124 case ISD::SETUGE: return getConstant(R!=APFloat::cmpLessThan, VT);
Chris Lattnerc3aae252005-01-07 07:46:32 +00001125 }
1126 } else {
1127 // Ensure that the constant occurs on the RHS.
Chris Lattnerbd8625b2005-08-09 23:09:05 +00001128 return getSetCC(VT, N2, N1, ISD::getSetCCSwappedOperands(Cond));
Chris Lattnerc3aae252005-01-07 07:46:32 +00001129 }
Anton Korobeynikov4c71dfe2008-02-20 11:10:28 +00001130 }
1131
Chris Lattner7cf7e3f2005-08-09 20:20:18 +00001132 // Could not fold it.
1133 return SDOperand();
Chris Lattnerc3aae252005-01-07 07:46:32 +00001134}
1135
Dan Gohman2e68b6f2008-02-25 21:11:39 +00001136/// SignBitIsZero - Return true if the sign bit of Op is known to be zero. We
1137/// use this predicate to simplify operations downstream.
1138bool SelectionDAG::SignBitIsZero(SDOperand Op, unsigned Depth) const {
1139 unsigned BitWidth = Op.getValueSizeInBits();
1140 return MaskedValueIsZero(Op, APInt::getSignBit(BitWidth), Depth);
1141}
1142
Dan Gohmanea859be2007-06-22 14:59:07 +00001143/// MaskedValueIsZero - Return true if 'V & Mask' is known to be zero. We use
1144/// this predicate to simplify operations downstream. Mask is known to be zero
1145/// for bits that V cannot have.
Dan Gohman2e68b6f2008-02-25 21:11:39 +00001146bool SelectionDAG::MaskedValueIsZero(SDOperand Op, const APInt &Mask,
Dan Gohmanea859be2007-06-22 14:59:07 +00001147 unsigned Depth) const {
Dan Gohman2e68b6f2008-02-25 21:11:39 +00001148 APInt KnownZero, KnownOne;
Dan Gohmanea859be2007-06-22 14:59:07 +00001149 ComputeMaskedBits(Op, Mask, KnownZero, KnownOne, Depth);
1150 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1151 return (KnownZero & Mask) == Mask;
1152}
1153
1154/// ComputeMaskedBits - Determine which of the bits specified in Mask are
1155/// known to be either zero or one and return them in the KnownZero/KnownOne
1156/// bitsets. This code only analyzes bits in Mask, in order to short-circuit
1157/// processing.
Dan Gohman977a76f2008-02-13 22:28:48 +00001158void SelectionDAG::ComputeMaskedBits(SDOperand Op, const APInt &Mask,
Dan Gohmanfd29e0e2008-02-13 00:35:47 +00001159 APInt &KnownZero, APInt &KnownOne,
Dan Gohmanea859be2007-06-22 14:59:07 +00001160 unsigned Depth) const {
Dan Gohmanfd29e0e2008-02-13 00:35:47 +00001161 unsigned BitWidth = Mask.getBitWidth();
Dan Gohmand9fe41c2008-02-13 23:13:32 +00001162 assert(BitWidth == MVT::getSizeInBits(Op.getValueType()) &&
1163 "Mask size mismatches value type size!");
1164
Dan Gohmanfd29e0e2008-02-13 00:35:47 +00001165 KnownZero = KnownOne = APInt(BitWidth, 0); // Don't know anything.
Dan Gohmanea859be2007-06-22 14:59:07 +00001166 if (Depth == 6 || Mask == 0)
1167 return; // Limit search depth.
1168
Dan Gohmanfd29e0e2008-02-13 00:35:47 +00001169 APInt KnownZero2, KnownOne2;
Dan Gohmanea859be2007-06-22 14:59:07 +00001170
1171 switch (Op.getOpcode()) {
1172 case ISD::Constant:
1173 // We know all of the bits for a constant!
Dan Gohmanfd29e0e2008-02-13 00:35:47 +00001174 KnownOne = cast<ConstantSDNode>(Op)->getAPIntValue() & Mask;
Dan Gohmanea859be2007-06-22 14:59:07 +00001175 KnownZero = ~KnownOne & Mask;
1176 return;
1177 case ISD::AND:
1178 // If either the LHS or the RHS are Zero, the result is zero.
1179 ComputeMaskedBits(Op.getOperand(1), Mask, KnownZero, KnownOne, Depth+1);
Dan Gohman977a76f2008-02-13 22:28:48 +00001180 ComputeMaskedBits(Op.getOperand(0), Mask & ~KnownZero,
1181 KnownZero2, KnownOne2, Depth+1);
Dan Gohmanea859be2007-06-22 14:59:07 +00001182 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1183 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
1184
1185 // Output known-1 bits are only known if set in both the LHS & RHS.
1186 KnownOne &= KnownOne2;
1187 // Output known-0 are known to be clear if zero in either the LHS | RHS.
1188 KnownZero |= KnownZero2;
1189 return;
1190 case ISD::OR:
1191 ComputeMaskedBits(Op.getOperand(1), Mask, KnownZero, KnownOne, Depth+1);
Dan Gohman977a76f2008-02-13 22:28:48 +00001192 ComputeMaskedBits(Op.getOperand(0), Mask & ~KnownOne,
1193 KnownZero2, KnownOne2, Depth+1);
Dan Gohmanea859be2007-06-22 14:59:07 +00001194 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1195 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
1196
1197 // Output known-0 bits are only known if clear in both the LHS & RHS.
1198 KnownZero &= KnownZero2;
1199 // Output known-1 are known to be set if set in either the LHS | RHS.
1200 KnownOne |= KnownOne2;
1201 return;
1202 case ISD::XOR: {
1203 ComputeMaskedBits(Op.getOperand(1), Mask, KnownZero, KnownOne, Depth+1);
1204 ComputeMaskedBits(Op.getOperand(0), Mask, KnownZero2, KnownOne2, Depth+1);
1205 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1206 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
1207
1208 // Output known-0 bits are known if clear or set in both the LHS & RHS.
Dan Gohmanfd29e0e2008-02-13 00:35:47 +00001209 APInt KnownZeroOut = (KnownZero & KnownZero2) | (KnownOne & KnownOne2);
Dan Gohmanea859be2007-06-22 14:59:07 +00001210 // Output known-1 are known to be set if set in only one of the LHS, RHS.
1211 KnownOne = (KnownZero & KnownOne2) | (KnownOne & KnownZero2);
1212 KnownZero = KnownZeroOut;
1213 return;
1214 }
1215 case ISD::SELECT:
1216 ComputeMaskedBits(Op.getOperand(2), Mask, KnownZero, KnownOne, Depth+1);
1217 ComputeMaskedBits(Op.getOperand(1), Mask, KnownZero2, KnownOne2, Depth+1);
1218 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1219 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
1220
1221 // Only known if known in both the LHS and RHS.
1222 KnownOne &= KnownOne2;
1223 KnownZero &= KnownZero2;
1224 return;
1225 case ISD::SELECT_CC:
1226 ComputeMaskedBits(Op.getOperand(3), Mask, KnownZero, KnownOne, Depth+1);
1227 ComputeMaskedBits(Op.getOperand(2), Mask, KnownZero2, KnownOne2, Depth+1);
1228 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1229 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
1230
1231 // Only known if known in both the LHS and RHS.
1232 KnownOne &= KnownOne2;
1233 KnownZero &= KnownZero2;
1234 return;
1235 case ISD::SETCC:
1236 // If we know the result of a setcc has the top bits zero, use this info.
Dan Gohmanfd29e0e2008-02-13 00:35:47 +00001237 if (TLI.getSetCCResultContents() == TargetLowering::ZeroOrOneSetCCResult &&
1238 BitWidth > 1)
1239 KnownZero |= APInt::getHighBitsSet(BitWidth, BitWidth - 1);
Dan Gohmanea859be2007-06-22 14:59:07 +00001240 return;
1241 case ISD::SHL:
1242 // (shl X, C1) & C2 == 0 iff (X & C2 >>u C1) == 0
1243 if (ConstantSDNode *SA = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
Dan Gohmand4cf9922008-02-26 18:50:50 +00001244 unsigned ShAmt = SA->getValue();
1245
1246 // If the shift count is an invalid immediate, don't do anything.
1247 if (ShAmt >= BitWidth)
1248 return;
1249
1250 ComputeMaskedBits(Op.getOperand(0), Mask.lshr(ShAmt),
Dan Gohmanea859be2007-06-22 14:59:07 +00001251 KnownZero, KnownOne, Depth+1);
1252 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
Dan Gohmand4cf9922008-02-26 18:50:50 +00001253 KnownZero <<= ShAmt;
1254 KnownOne <<= ShAmt;
Dan Gohmanfd29e0e2008-02-13 00:35:47 +00001255 // low bits known zero.
Dan Gohmand4cf9922008-02-26 18:50:50 +00001256 KnownZero |= APInt::getLowBitsSet(BitWidth, ShAmt);
Dan Gohmanea859be2007-06-22 14:59:07 +00001257 }
1258 return;
1259 case ISD::SRL:
1260 // (ushr X, C1) & C2 == 0 iff (-1 >> C1) & C2 == 0
1261 if (ConstantSDNode *SA = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
Dan Gohmanea859be2007-06-22 14:59:07 +00001262 unsigned ShAmt = SA->getValue();
1263
Dan Gohmand4cf9922008-02-26 18:50:50 +00001264 // If the shift count is an invalid immediate, don't do anything.
1265 if (ShAmt >= BitWidth)
1266 return;
1267
Dan Gohmanfd29e0e2008-02-13 00:35:47 +00001268 ComputeMaskedBits(Op.getOperand(0), (Mask << ShAmt),
Dan Gohmanea859be2007-06-22 14:59:07 +00001269 KnownZero, KnownOne, Depth+1);
1270 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
Dan Gohmanfd29e0e2008-02-13 00:35:47 +00001271 KnownZero = KnownZero.lshr(ShAmt);
1272 KnownOne = KnownOne.lshr(ShAmt);
Dan Gohmanea859be2007-06-22 14:59:07 +00001273
Dan Gohman72d2fd52008-02-13 22:43:25 +00001274 APInt HighBits = APInt::getHighBitsSet(BitWidth, ShAmt) & Mask;
Dan Gohmanea859be2007-06-22 14:59:07 +00001275 KnownZero |= HighBits; // High bits known zero.
1276 }
1277 return;
1278 case ISD::SRA:
1279 if (ConstantSDNode *SA = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
Dan Gohmanea859be2007-06-22 14:59:07 +00001280 unsigned ShAmt = SA->getValue();
1281
Dan Gohmand4cf9922008-02-26 18:50:50 +00001282 // If the shift count is an invalid immediate, don't do anything.
1283 if (ShAmt >= BitWidth)
1284 return;
1285
Dan Gohmanfd29e0e2008-02-13 00:35:47 +00001286 APInt InDemandedMask = (Mask << ShAmt);
Dan Gohmanea859be2007-06-22 14:59:07 +00001287 // If any of the demanded bits are produced by the sign extension, we also
1288 // demand the input sign bit.
Dan Gohman72d2fd52008-02-13 22:43:25 +00001289 APInt HighBits = APInt::getHighBitsSet(BitWidth, ShAmt) & Mask;
1290 if (HighBits.getBoolValue())
Dan Gohmanfd29e0e2008-02-13 00:35:47 +00001291 InDemandedMask |= APInt::getSignBit(BitWidth);
Dan Gohmanea859be2007-06-22 14:59:07 +00001292
1293 ComputeMaskedBits(Op.getOperand(0), InDemandedMask, KnownZero, KnownOne,
1294 Depth+1);
1295 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
Dan Gohmanfd29e0e2008-02-13 00:35:47 +00001296 KnownZero = KnownZero.lshr(ShAmt);
1297 KnownOne = KnownOne.lshr(ShAmt);
Dan Gohmanea859be2007-06-22 14:59:07 +00001298
1299 // Handle the sign bits.
Dan Gohmanfd29e0e2008-02-13 00:35:47 +00001300 APInt SignBit = APInt::getSignBit(BitWidth);
1301 SignBit = SignBit.lshr(ShAmt); // Adjust to where it is now in the mask.
Dan Gohmanea859be2007-06-22 14:59:07 +00001302
Dan Gohmanca93a432008-02-20 16:30:17 +00001303 if (KnownZero.intersects(SignBit)) {
Dan Gohmanea859be2007-06-22 14:59:07 +00001304 KnownZero |= HighBits; // New bits are known zero.
Dan Gohmanca93a432008-02-20 16:30:17 +00001305 } else if (KnownOne.intersects(SignBit)) {
Dan Gohmanea859be2007-06-22 14:59:07 +00001306 KnownOne |= HighBits; // New bits are known one.
1307 }
1308 }
1309 return;
1310 case ISD::SIGN_EXTEND_INREG: {
1311 MVT::ValueType EVT = cast<VTSDNode>(Op.getOperand(1))->getVT();
Dan Gohman977a76f2008-02-13 22:28:48 +00001312 unsigned EBits = MVT::getSizeInBits(EVT);
Dan Gohmanea859be2007-06-22 14:59:07 +00001313
1314 // Sign extension. Compute the demanded bits in the result that are not
1315 // present in the input.
Dan Gohman977a76f2008-02-13 22:28:48 +00001316 APInt NewBits = APInt::getHighBitsSet(BitWidth, BitWidth - EBits) & Mask;
Dan Gohmanea859be2007-06-22 14:59:07 +00001317
Dan Gohman977a76f2008-02-13 22:28:48 +00001318 APInt InSignBit = APInt::getSignBit(EBits);
1319 APInt InputDemandedBits = Mask & APInt::getLowBitsSet(BitWidth, EBits);
Dan Gohmanea859be2007-06-22 14:59:07 +00001320
1321 // If the sign extended bits are demanded, we know that the sign
1322 // bit is demanded.
Dan Gohmanfd29e0e2008-02-13 00:35:47 +00001323 InSignBit.zext(BitWidth);
Dan Gohman977a76f2008-02-13 22:28:48 +00001324 if (NewBits.getBoolValue())
Dan Gohmanea859be2007-06-22 14:59:07 +00001325 InputDemandedBits |= InSignBit;
1326
1327 ComputeMaskedBits(Op.getOperand(0), InputDemandedBits,
1328 KnownZero, KnownOne, Depth+1);
1329 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1330
1331 // If the sign bit of the input is known set or clear, then we know the
1332 // top bits of the result.
Dan Gohmanca93a432008-02-20 16:30:17 +00001333 if (KnownZero.intersects(InSignBit)) { // Input sign bit known clear
Dan Gohmanea859be2007-06-22 14:59:07 +00001334 KnownZero |= NewBits;
1335 KnownOne &= ~NewBits;
Dan Gohmanca93a432008-02-20 16:30:17 +00001336 } else if (KnownOne.intersects(InSignBit)) { // Input sign bit known set
Dan Gohmanea859be2007-06-22 14:59:07 +00001337 KnownOne |= NewBits;
1338 KnownZero &= ~NewBits;
1339 } else { // Input sign bit unknown
1340 KnownZero &= ~NewBits;
1341 KnownOne &= ~NewBits;
1342 }
1343 return;
1344 }
1345 case ISD::CTTZ:
1346 case ISD::CTLZ:
1347 case ISD::CTPOP: {
Dan Gohmanfd29e0e2008-02-13 00:35:47 +00001348 unsigned LowBits = Log2_32(BitWidth)+1;
1349 KnownZero = APInt::getHighBitsSet(BitWidth, BitWidth - LowBits);
1350 KnownOne = APInt(BitWidth, 0);
Dan Gohmanea859be2007-06-22 14:59:07 +00001351 return;
1352 }
1353 case ISD::LOAD: {
1354 if (ISD::isZEXTLoad(Op.Val)) {
1355 LoadSDNode *LD = cast<LoadSDNode>(Op);
Dan Gohmanb625f2f2008-01-30 00:15:11 +00001356 MVT::ValueType VT = LD->getMemoryVT();
Dan Gohman977a76f2008-02-13 22:28:48 +00001357 unsigned MemBits = MVT::getSizeInBits(VT);
1358 KnownZero |= APInt::getHighBitsSet(BitWidth, BitWidth - MemBits) & Mask;
Dan Gohmanea859be2007-06-22 14:59:07 +00001359 }
1360 return;
1361 }
1362 case ISD::ZERO_EXTEND: {
Dan Gohmanfd29e0e2008-02-13 00:35:47 +00001363 MVT::ValueType InVT = Op.getOperand(0).getValueType();
1364 unsigned InBits = MVT::getSizeInBits(InVT);
Dan Gohman977a76f2008-02-13 22:28:48 +00001365 APInt NewBits = APInt::getHighBitsSet(BitWidth, BitWidth - InBits) & Mask;
1366 APInt InMask = Mask;
1367 InMask.trunc(InBits);
Dan Gohmanfd29e0e2008-02-13 00:35:47 +00001368 KnownZero.trunc(InBits);
1369 KnownOne.trunc(InBits);
Dan Gohman977a76f2008-02-13 22:28:48 +00001370 ComputeMaskedBits(Op.getOperand(0), InMask, KnownZero, KnownOne, Depth+1);
Dan Gohmanfd29e0e2008-02-13 00:35:47 +00001371 KnownZero.zext(BitWidth);
1372 KnownOne.zext(BitWidth);
1373 KnownZero |= NewBits;
Dan Gohmanea859be2007-06-22 14:59:07 +00001374 return;
1375 }
1376 case ISD::SIGN_EXTEND: {
1377 MVT::ValueType InVT = Op.getOperand(0).getValueType();
Dan Gohmanfd29e0e2008-02-13 00:35:47 +00001378 unsigned InBits = MVT::getSizeInBits(InVT);
Dan Gohmanfd29e0e2008-02-13 00:35:47 +00001379 APInt InSignBit = APInt::getSignBit(InBits);
Dan Gohman977a76f2008-02-13 22:28:48 +00001380 APInt NewBits = APInt::getHighBitsSet(BitWidth, BitWidth - InBits) & Mask;
1381 APInt InMask = Mask;
1382 InMask.trunc(InBits);
Dan Gohmanea859be2007-06-22 14:59:07 +00001383
1384 // If any of the sign extended bits are demanded, we know that the sign
Dan Gohman977a76f2008-02-13 22:28:48 +00001385 // bit is demanded. Temporarily set this bit in the mask for our callee.
1386 if (NewBits.getBoolValue())
1387 InMask |= InSignBit;
Dan Gohmanfd29e0e2008-02-13 00:35:47 +00001388
Dan Gohmanfd29e0e2008-02-13 00:35:47 +00001389 KnownZero.trunc(InBits);
1390 KnownOne.trunc(InBits);
Dan Gohman977a76f2008-02-13 22:28:48 +00001391 ComputeMaskedBits(Op.getOperand(0), InMask, KnownZero, KnownOne, Depth+1);
1392
1393 // Note if the sign bit is known to be zero or one.
1394 bool SignBitKnownZero = KnownZero.isNegative();
1395 bool SignBitKnownOne = KnownOne.isNegative();
1396 assert(!(SignBitKnownZero && SignBitKnownOne) &&
1397 "Sign bit can't be known to be both zero and one!");
1398
1399 // If the sign bit wasn't actually demanded by our caller, we don't
1400 // want it set in the KnownZero and KnownOne result values. Reset the
1401 // mask and reapply it to the result values.
1402 InMask = Mask;
1403 InMask.trunc(InBits);
1404 KnownZero &= InMask;
1405 KnownOne &= InMask;
1406
Dan Gohmanfd29e0e2008-02-13 00:35:47 +00001407 KnownZero.zext(BitWidth);
1408 KnownOne.zext(BitWidth);
1409
Dan Gohman977a76f2008-02-13 22:28:48 +00001410 // If the sign bit is known zero or one, the top bits match.
1411 if (SignBitKnownZero)
Dan Gohmanea859be2007-06-22 14:59:07 +00001412 KnownZero |= NewBits;
Dan Gohman977a76f2008-02-13 22:28:48 +00001413 else if (SignBitKnownOne)
Dan Gohmanea859be2007-06-22 14:59:07 +00001414 KnownOne |= NewBits;
Dan Gohmanea859be2007-06-22 14:59:07 +00001415 return;
1416 }
1417 case ISD::ANY_EXTEND: {
Dan Gohmanfd29e0e2008-02-13 00:35:47 +00001418 MVT::ValueType InVT = Op.getOperand(0).getValueType();
1419 unsigned InBits = MVT::getSizeInBits(InVT);
Dan Gohman977a76f2008-02-13 22:28:48 +00001420 APInt InMask = Mask;
1421 InMask.trunc(InBits);
Dan Gohmanfd29e0e2008-02-13 00:35:47 +00001422 KnownZero.trunc(InBits);
1423 KnownOne.trunc(InBits);
Dan Gohman977a76f2008-02-13 22:28:48 +00001424 ComputeMaskedBits(Op.getOperand(0), InMask, KnownZero, KnownOne, Depth+1);
Dan Gohmanfd29e0e2008-02-13 00:35:47 +00001425 KnownZero.zext(BitWidth);
1426 KnownOne.zext(BitWidth);
Dan Gohmanea859be2007-06-22 14:59:07 +00001427 return;
1428 }
1429 case ISD::TRUNCATE: {
Dan Gohmanfd29e0e2008-02-13 00:35:47 +00001430 MVT::ValueType InVT = Op.getOperand(0).getValueType();
1431 unsigned InBits = MVT::getSizeInBits(InVT);
Dan Gohman977a76f2008-02-13 22:28:48 +00001432 APInt InMask = Mask;
1433 InMask.zext(InBits);
Dan Gohmanfd29e0e2008-02-13 00:35:47 +00001434 KnownZero.zext(InBits);
1435 KnownOne.zext(InBits);
Dan Gohman977a76f2008-02-13 22:28:48 +00001436 ComputeMaskedBits(Op.getOperand(0), InMask, KnownZero, KnownOne, Depth+1);
Dan Gohmanea859be2007-06-22 14:59:07 +00001437 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
Dan Gohmanfd29e0e2008-02-13 00:35:47 +00001438 KnownZero.trunc(BitWidth);
1439 KnownOne.trunc(BitWidth);
Dan Gohmanea859be2007-06-22 14:59:07 +00001440 break;
1441 }
1442 case ISD::AssertZext: {
1443 MVT::ValueType VT = cast<VTSDNode>(Op.getOperand(1))->getVT();
Dan Gohmanfd29e0e2008-02-13 00:35:47 +00001444 APInt InMask = APInt::getLowBitsSet(BitWidth, MVT::getSizeInBits(VT));
Dan Gohmanea859be2007-06-22 14:59:07 +00001445 ComputeMaskedBits(Op.getOperand(0), Mask & InMask, KnownZero,
1446 KnownOne, Depth+1);
1447 KnownZero |= (~InMask) & Mask;
1448 return;
1449 }
Chris Lattnerd268a492007-12-22 21:26:52 +00001450 case ISD::FGETSIGN:
1451 // All bits are zero except the low bit.
Dan Gohmanfd29e0e2008-02-13 00:35:47 +00001452 KnownZero = APInt::getHighBitsSet(BitWidth, BitWidth - 1);
Chris Lattnerd268a492007-12-22 21:26:52 +00001453 return;
1454
Dan Gohmanea859be2007-06-22 14:59:07 +00001455 case ISD::ADD: {
1456 // If either the LHS or the RHS are Zero, the result is zero.
1457 ComputeMaskedBits(Op.getOperand(1), Mask, KnownZero, KnownOne, Depth+1);
1458 ComputeMaskedBits(Op.getOperand(0), Mask, KnownZero2, KnownOne2, Depth+1);
1459 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1460 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
1461
1462 // Output known-0 bits are known if clear or set in both the low clear bits
1463 // common to both LHS & RHS. For example, 8+(X<<3) is known to have the
1464 // low 3 bits clear.
Dan Gohman977a76f2008-02-13 22:28:48 +00001465 unsigned KnownZeroOut = std::min(KnownZero.countTrailingOnes(),
1466 KnownZero2.countTrailingOnes());
Dan Gohmanea859be2007-06-22 14:59:07 +00001467
Dan Gohmanfd29e0e2008-02-13 00:35:47 +00001468 KnownZero = APInt::getLowBitsSet(BitWidth, KnownZeroOut);
1469 KnownOne = APInt(BitWidth, 0);
Dan Gohmanea859be2007-06-22 14:59:07 +00001470 return;
1471 }
1472 case ISD::SUB: {
1473 ConstantSDNode *CLHS = dyn_cast<ConstantSDNode>(Op.getOperand(0));
1474 if (!CLHS) return;
1475
1476 // We know that the top bits of C-X are clear if X contains less bits
1477 // than C (i.e. no wrap-around can happen). For example, 20-X is
1478 // positive if we can prove that X is >= 0 and < 16.
Dan Gohman977a76f2008-02-13 22:28:48 +00001479 if (CLHS->getAPIntValue().isNonNegative()) {
Dan Gohmanfd29e0e2008-02-13 00:35:47 +00001480 unsigned NLZ = (CLHS->getAPIntValue()+1).countLeadingZeros();
1481 // NLZ can't be BitWidth with no sign bit
Chris Lattner423be622008-02-14 18:48:56 +00001482 APInt MaskV = APInt::getHighBitsSet(BitWidth, NLZ+1);
Dan Gohmanea859be2007-06-22 14:59:07 +00001483 ComputeMaskedBits(Op.getOperand(1), MaskV, KnownZero, KnownOne, Depth+1);
1484
1485 // If all of the MaskV bits are known to be zero, then we know the output
1486 // top bits are zero, because we now know that the output is from [0-C].
1487 if ((KnownZero & MaskV) == MaskV) {
Dan Gohmanfd29e0e2008-02-13 00:35:47 +00001488 unsigned NLZ2 = CLHS->getAPIntValue().countLeadingZeros();
1489 // Top bits known zero.
1490 KnownZero = APInt::getHighBitsSet(BitWidth, NLZ2) & Mask;
1491 KnownOne = APInt(BitWidth, 0); // No one bits known.
Dan Gohmanea859be2007-06-22 14:59:07 +00001492 } else {
Dan Gohmanfd29e0e2008-02-13 00:35:47 +00001493 KnownZero = KnownOne = APInt(BitWidth, 0); // Otherwise, nothing known.
Dan Gohmanea859be2007-06-22 14:59:07 +00001494 }
1495 }
1496 return;
1497 }
1498 default:
1499 // Allow the target to implement this method for its nodes.
1500 if (Op.getOpcode() >= ISD::BUILTIN_OP_END) {
1501 case ISD::INTRINSIC_WO_CHAIN:
1502 case ISD::INTRINSIC_W_CHAIN:
1503 case ISD::INTRINSIC_VOID:
1504 TLI.computeMaskedBitsForTargetNode(Op, Mask, KnownZero, KnownOne, *this);
1505 }
1506 return;
1507 }
1508}
1509
Dan Gohmanfd29e0e2008-02-13 00:35:47 +00001510/// ComputeMaskedBits - This is a wrapper around the APInt-using
1511/// form of ComputeMaskedBits for use by clients that haven't been converted
1512/// to APInt yet.
1513void SelectionDAG::ComputeMaskedBits(SDOperand Op, uint64_t Mask,
1514 uint64_t &KnownZero, uint64_t &KnownOne,
1515 unsigned Depth) const {
Dan Gohmand9fe41c2008-02-13 23:13:32 +00001516 // The masks are not wide enough to represent this type! Should use APInt.
1517 if (Op.getValueType() == MVT::i128)
1518 return;
1519
Dan Gohmanfd29e0e2008-02-13 00:35:47 +00001520 unsigned NumBits = MVT::getSizeInBits(Op.getValueType());
1521 APInt APIntMask(NumBits, Mask);
1522 APInt APIntKnownZero(NumBits, 0);
1523 APInt APIntKnownOne(NumBits, 0);
1524 ComputeMaskedBits(Op, APIntMask, APIntKnownZero, APIntKnownOne, Depth);
1525 KnownZero = APIntKnownZero.getZExtValue();
1526 KnownOne = APIntKnownOne.getZExtValue();
1527}
1528
Dan Gohmanea859be2007-06-22 14:59:07 +00001529/// ComputeNumSignBits - Return the number of times the sign bit of the
1530/// register is replicated into the other bits. We know that at least 1 bit
1531/// is always equal to the sign bit (itself), but other cases can give us
1532/// information. For example, immediately after an "SRA X, 2", we know that
1533/// the top 3 bits are all equal to each other, so we return 3.
1534unsigned SelectionDAG::ComputeNumSignBits(SDOperand Op, unsigned Depth) const{
1535 MVT::ValueType VT = Op.getValueType();
1536 assert(MVT::isInteger(VT) && "Invalid VT!");
1537 unsigned VTBits = MVT::getSizeInBits(VT);
1538 unsigned Tmp, Tmp2;
1539
1540 if (Depth == 6)
1541 return 1; // Limit search depth.
1542
1543 switch (Op.getOpcode()) {
1544 default: break;
1545 case ISD::AssertSext:
1546 Tmp = MVT::getSizeInBits(cast<VTSDNode>(Op.getOperand(1))->getVT());
1547 return VTBits-Tmp+1;
1548 case ISD::AssertZext:
1549 Tmp = MVT::getSizeInBits(cast<VTSDNode>(Op.getOperand(1))->getVT());
1550 return VTBits-Tmp;
1551
1552 case ISD::Constant: {
1553 uint64_t Val = cast<ConstantSDNode>(Op)->getValue();
1554 // If negative, invert the bits, then look at it.
1555 if (Val & MVT::getIntVTSignBit(VT))
1556 Val = ~Val;
1557
1558 // Shift the bits so they are the leading bits in the int64_t.
1559 Val <<= 64-VTBits;
1560
1561 // Return # leading zeros. We use 'min' here in case Val was zero before
1562 // shifting. We don't want to return '64' as for an i32 "0".
1563 return std::min(VTBits, CountLeadingZeros_64(Val));
1564 }
1565
1566 case ISD::SIGN_EXTEND:
1567 Tmp = VTBits-MVT::getSizeInBits(Op.getOperand(0).getValueType());
1568 return ComputeNumSignBits(Op.getOperand(0), Depth+1) + Tmp;
1569
1570 case ISD::SIGN_EXTEND_INREG:
1571 // Max of the input and what this extends.
1572 Tmp = MVT::getSizeInBits(cast<VTSDNode>(Op.getOperand(1))->getVT());
1573 Tmp = VTBits-Tmp+1;
1574
1575 Tmp2 = ComputeNumSignBits(Op.getOperand(0), Depth+1);
1576 return std::max(Tmp, Tmp2);
1577
1578 case ISD::SRA:
1579 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1);
1580 // SRA X, C -> adds C sign bits.
1581 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
1582 Tmp += C->getValue();
1583 if (Tmp > VTBits) Tmp = VTBits;
1584 }
1585 return Tmp;
1586 case ISD::SHL:
1587 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
1588 // shl destroys sign bits.
1589 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1);
1590 if (C->getValue() >= VTBits || // Bad shift.
1591 C->getValue() >= Tmp) break; // Shifted all sign bits out.
1592 return Tmp - C->getValue();
1593 }
1594 break;
1595 case ISD::AND:
1596 case ISD::OR:
1597 case ISD::XOR: // NOT is handled here.
1598 // Logical binary ops preserve the number of sign bits.
1599 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1);
1600 if (Tmp == 1) return 1; // Early out.
1601 Tmp2 = ComputeNumSignBits(Op.getOperand(1), Depth+1);
1602 return std::min(Tmp, Tmp2);
1603
1604 case ISD::SELECT:
1605 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1);
1606 if (Tmp == 1) return 1; // Early out.
1607 Tmp2 = ComputeNumSignBits(Op.getOperand(1), Depth+1);
1608 return std::min(Tmp, Tmp2);
1609
1610 case ISD::SETCC:
1611 // If setcc returns 0/-1, all bits are sign bits.
1612 if (TLI.getSetCCResultContents() ==
1613 TargetLowering::ZeroOrNegativeOneSetCCResult)
1614 return VTBits;
1615 break;
1616 case ISD::ROTL:
1617 case ISD::ROTR:
1618 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
1619 unsigned RotAmt = C->getValue() & (VTBits-1);
1620
1621 // Handle rotate right by N like a rotate left by 32-N.
1622 if (Op.getOpcode() == ISD::ROTR)
1623 RotAmt = (VTBits-RotAmt) & (VTBits-1);
1624
1625 // If we aren't rotating out all of the known-in sign bits, return the
1626 // number that are left. This handles rotl(sext(x), 1) for example.
1627 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1);
1628 if (Tmp > RotAmt+1) return Tmp-RotAmt;
1629 }
1630 break;
1631 case ISD::ADD:
1632 // Add can have at most one carry bit. Thus we know that the output
1633 // is, at worst, one more bit than the inputs.
1634 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1);
1635 if (Tmp == 1) return 1; // Early out.
1636
1637 // Special case decrementing a value (ADD X, -1):
1638 if (ConstantSDNode *CRHS = dyn_cast<ConstantSDNode>(Op.getOperand(0)))
1639 if (CRHS->isAllOnesValue()) {
1640 uint64_t KnownZero, KnownOne;
1641 uint64_t Mask = MVT::getIntVTBitMask(VT);
1642 ComputeMaskedBits(Op.getOperand(0), Mask, KnownZero, KnownOne, Depth+1);
1643
1644 // If the input is known to be 0 or 1, the output is 0/-1, which is all
1645 // sign bits set.
1646 if ((KnownZero|1) == Mask)
1647 return VTBits;
1648
1649 // If we are subtracting one from a positive number, there is no carry
1650 // out of the result.
1651 if (KnownZero & MVT::getIntVTSignBit(VT))
1652 return Tmp;
1653 }
1654
1655 Tmp2 = ComputeNumSignBits(Op.getOperand(1), Depth+1);
1656 if (Tmp2 == 1) return 1;
1657 return std::min(Tmp, Tmp2)-1;
1658 break;
1659
1660 case ISD::SUB:
1661 Tmp2 = ComputeNumSignBits(Op.getOperand(1), Depth+1);
1662 if (Tmp2 == 1) return 1;
1663
1664 // Handle NEG.
1665 if (ConstantSDNode *CLHS = dyn_cast<ConstantSDNode>(Op.getOperand(0)))
1666 if (CLHS->getValue() == 0) {
1667 uint64_t KnownZero, KnownOne;
1668 uint64_t Mask = MVT::getIntVTBitMask(VT);
1669 ComputeMaskedBits(Op.getOperand(1), Mask, KnownZero, KnownOne, Depth+1);
1670 // If the input is known to be 0 or 1, the output is 0/-1, which is all
1671 // sign bits set.
1672 if ((KnownZero|1) == Mask)
1673 return VTBits;
1674
1675 // If the input is known to be positive (the sign bit is known clear),
1676 // the output of the NEG has the same number of sign bits as the input.
1677 if (KnownZero & MVT::getIntVTSignBit(VT))
1678 return Tmp2;
1679
1680 // Otherwise, we treat this like a SUB.
1681 }
1682
1683 // Sub can have at most one carry bit. Thus we know that the output
1684 // is, at worst, one more bit than the inputs.
1685 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1);
1686 if (Tmp == 1) return 1; // Early out.
1687 return std::min(Tmp, Tmp2)-1;
1688 break;
1689 case ISD::TRUNCATE:
1690 // FIXME: it's tricky to do anything useful for this, but it is an important
1691 // case for targets like X86.
1692 break;
1693 }
1694
1695 // Handle LOADX separately here. EXTLOAD case will fallthrough.
1696 if (Op.getOpcode() == ISD::LOAD) {
1697 LoadSDNode *LD = cast<LoadSDNode>(Op);
1698 unsigned ExtType = LD->getExtensionType();
1699 switch (ExtType) {
1700 default: break;
1701 case ISD::SEXTLOAD: // '17' bits known
Dan Gohmanb625f2f2008-01-30 00:15:11 +00001702 Tmp = MVT::getSizeInBits(LD->getMemoryVT());
Dan Gohmanea859be2007-06-22 14:59:07 +00001703 return VTBits-Tmp+1;
1704 case ISD::ZEXTLOAD: // '16' bits known
Dan Gohmanb625f2f2008-01-30 00:15:11 +00001705 Tmp = MVT::getSizeInBits(LD->getMemoryVT());
Dan Gohmanea859be2007-06-22 14:59:07 +00001706 return VTBits-Tmp;
1707 }
1708 }
1709
1710 // Allow the target to implement this method for its nodes.
1711 if (Op.getOpcode() >= ISD::BUILTIN_OP_END ||
1712 Op.getOpcode() == ISD::INTRINSIC_WO_CHAIN ||
1713 Op.getOpcode() == ISD::INTRINSIC_W_CHAIN ||
1714 Op.getOpcode() == ISD::INTRINSIC_VOID) {
1715 unsigned NumBits = TLI.ComputeNumSignBitsForTargetNode(Op, Depth);
1716 if (NumBits > 1) return NumBits;
1717 }
1718
1719 // Finally, if we can prove that the top bits of the result are 0's or 1's,
1720 // use this information.
1721 uint64_t KnownZero, KnownOne;
1722 uint64_t Mask = MVT::getIntVTBitMask(VT);
1723 ComputeMaskedBits(Op, Mask, KnownZero, KnownOne, Depth);
1724
1725 uint64_t SignBit = MVT::getIntVTSignBit(VT);
1726 if (KnownZero & SignBit) { // SignBit is 0
1727 Mask = KnownZero;
1728 } else if (KnownOne & SignBit) { // SignBit is 1;
1729 Mask = KnownOne;
1730 } else {
1731 // Nothing known.
1732 return 1;
1733 }
1734
1735 // Okay, we know that the sign bit in Mask is set. Use CLZ to determine
1736 // the number of identical bits in the top of the input value.
1737 Mask ^= ~0ULL;
1738 Mask <<= 64-VTBits;
1739 // Return # leading zeros. We use 'min' here in case Val was zero before
1740 // shifting. We don't want to return '64' as for an i32 "0".
1741 return std::min(VTBits, CountLeadingZeros_64(Mask));
1742}
1743
Chris Lattner51dabfb2006-10-14 00:41:01 +00001744
Evan Chenga844bde2008-02-02 04:07:54 +00001745bool SelectionDAG::isVerifiedDebugInfoDesc(SDOperand Op) const {
1746 GlobalAddressSDNode *GA = dyn_cast<GlobalAddressSDNode>(Op);
1747 if (!GA) return false;
1748 GlobalVariable *GV = dyn_cast<GlobalVariable>(GA->getGlobal());
1749 if (!GV) return false;
1750 MachineModuleInfo *MMI = getMachineModuleInfo();
1751 return MMI && MMI->hasDebugInfo() && MMI->isVerified(GV);
1752}
1753
1754
Chris Lattnerc3aae252005-01-07 07:46:32 +00001755/// getNode - Gets or creates the specified node.
Chris Lattner78ec3112003-08-11 14:57:33 +00001756///
Chris Lattnerc3aae252005-01-07 07:46:32 +00001757SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT) {
Jim Laskey583bd472006-10-27 23:46:08 +00001758 FoldingSetNodeID ID;
Chris Lattner63e3f142007-02-04 07:28:00 +00001759 AddNodeIDNode(ID, Opcode, getVTList(VT), 0, 0);
Chris Lattner4a283e92006-08-11 18:38:11 +00001760 void *IP = 0;
1761 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1762 return SDOperand(E, 0);
Chris Lattner3f97eb42007-02-04 08:35:21 +00001763 SDNode *N = new SDNode(Opcode, SDNode::getSDVTList(VT));
Chris Lattner4a283e92006-08-11 18:38:11 +00001764 CSEMap.InsertNode(N, IP);
1765
1766 AllNodes.push_back(N);
Chris Lattnerc3aae252005-01-07 07:46:32 +00001767 return SDOperand(N, 0);
1768}
1769
Chris Lattnerc3aae252005-01-07 07:46:32 +00001770SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
1771 SDOperand Operand) {
Nate Begeman1b5db7a2006-01-16 08:07:10 +00001772 unsigned Tmp1;
Chris Lattner94683772005-12-23 05:30:37 +00001773 // Constant fold unary operations with an integer constant operand.
Chris Lattnerc3aae252005-01-07 07:46:32 +00001774 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Operand.Val)) {
1775 uint64_t Val = C->getValue();
1776 switch (Opcode) {
1777 default: break;
1778 case ISD::SIGN_EXTEND: return getConstant(C->getSignExtended(), VT);
Chris Lattner4ed11b42005-09-02 00:17:32 +00001779 case ISD::ANY_EXTEND:
Chris Lattnerc3aae252005-01-07 07:46:32 +00001780 case ISD::ZERO_EXTEND: return getConstant(Val, VT);
1781 case ISD::TRUNCATE: return getConstant(Val, VT);
Dale Johannesen73328d12007-09-19 23:55:34 +00001782 case ISD::UINT_TO_FP:
1783 case ISD::SINT_TO_FP: {
1784 const uint64_t zero[] = {0, 0};
Dale Johannesendb44bf82007-10-16 23:38:29 +00001785 // No compile time operations on this type.
1786 if (VT==MVT::ppcf128)
1787 break;
Dale Johannesen73328d12007-09-19 23:55:34 +00001788 APFloat apf = APFloat(APInt(MVT::getSizeInBits(VT), 2, zero));
Neil Boothccf596a2007-10-07 11:45:55 +00001789 (void)apf.convertFromZeroExtendedInteger(&Val,
Dale Johannesen910993e2007-09-21 22:09:37 +00001790 MVT::getSizeInBits(Operand.getValueType()),
1791 Opcode==ISD::SINT_TO_FP,
Dale Johannesen88216af2007-09-30 18:19:03 +00001792 APFloat::rmNearestTiesToEven);
Dale Johannesen73328d12007-09-19 23:55:34 +00001793 return getConstantFP(apf, VT);
1794 }
Chris Lattner94683772005-12-23 05:30:37 +00001795 case ISD::BIT_CONVERT:
Chris Lattnere8a30fd2006-03-24 02:20:47 +00001796 if (VT == MVT::f32 && C->getValueType(0) == MVT::i32)
Chris Lattner94683772005-12-23 05:30:37 +00001797 return getConstantFP(BitsToFloat(Val), VT);
Chris Lattnere8a30fd2006-03-24 02:20:47 +00001798 else if (VT == MVT::f64 && C->getValueType(0) == MVT::i64)
Chris Lattner94683772005-12-23 05:30:37 +00001799 return getConstantFP(BitsToDouble(Val), VT);
Chris Lattner94683772005-12-23 05:30:37 +00001800 break;
Nate Begeman1b5db7a2006-01-16 08:07:10 +00001801 case ISD::BSWAP:
1802 switch(VT) {
1803 default: assert(0 && "Invalid bswap!"); break;
1804 case MVT::i16: return getConstant(ByteSwap_16((unsigned short)Val), VT);
1805 case MVT::i32: return getConstant(ByteSwap_32((unsigned)Val), VT);
1806 case MVT::i64: return getConstant(ByteSwap_64(Val), VT);
1807 }
1808 break;
1809 case ISD::CTPOP:
1810 switch(VT) {
1811 default: assert(0 && "Invalid ctpop!"); break;
1812 case MVT::i1: return getConstant(Val != 0, VT);
1813 case MVT::i8:
1814 Tmp1 = (unsigned)Val & 0xFF;
1815 return getConstant(CountPopulation_32(Tmp1), VT);
1816 case MVT::i16:
1817 Tmp1 = (unsigned)Val & 0xFFFF;
1818 return getConstant(CountPopulation_32(Tmp1), VT);
1819 case MVT::i32:
1820 return getConstant(CountPopulation_32((unsigned)Val), VT);
1821 case MVT::i64:
1822 return getConstant(CountPopulation_64(Val), VT);
1823 }
1824 case ISD::CTLZ:
1825 switch(VT) {
1826 default: assert(0 && "Invalid ctlz!"); break;
1827 case MVT::i1: return getConstant(Val == 0, VT);
1828 case MVT::i8:
1829 Tmp1 = (unsigned)Val & 0xFF;
1830 return getConstant(CountLeadingZeros_32(Tmp1)-24, VT);
1831 case MVT::i16:
1832 Tmp1 = (unsigned)Val & 0xFFFF;
1833 return getConstant(CountLeadingZeros_32(Tmp1)-16, VT);
1834 case MVT::i32:
1835 return getConstant(CountLeadingZeros_32((unsigned)Val), VT);
1836 case MVT::i64:
1837 return getConstant(CountLeadingZeros_64(Val), VT);
1838 }
1839 case ISD::CTTZ:
1840 switch(VT) {
1841 default: assert(0 && "Invalid cttz!"); break;
1842 case MVT::i1: return getConstant(Val == 0, VT);
1843 case MVT::i8:
1844 Tmp1 = (unsigned)Val | 0x100;
1845 return getConstant(CountTrailingZeros_32(Tmp1), VT);
1846 case MVT::i16:
1847 Tmp1 = (unsigned)Val | 0x10000;
1848 return getConstant(CountTrailingZeros_32(Tmp1), VT);
1849 case MVT::i32:
1850 return getConstant(CountTrailingZeros_32((unsigned)Val), VT);
1851 case MVT::i64:
1852 return getConstant(CountTrailingZeros_64(Val), VT);
1853 }
Chris Lattnerc3aae252005-01-07 07:46:32 +00001854 }
1855 }
1856
Dale Johannesenc4dd3c32007-08-31 23:34:27 +00001857 // Constant fold unary operations with a floating point constant operand.
1858 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(Operand.Val)) {
1859 APFloat V = C->getValueAPF(); // make copy
Chris Lattner0bd48932008-01-17 07:00:52 +00001860 if (VT != MVT::ppcf128 && Operand.getValueType() != MVT::ppcf128) {
Dale Johannesendb44bf82007-10-16 23:38:29 +00001861 switch (Opcode) {
1862 case ISD::FNEG:
1863 V.changeSign();
1864 return getConstantFP(V, VT);
1865 case ISD::FABS:
1866 V.clearSign();
1867 return getConstantFP(V, VT);
1868 case ISD::FP_ROUND:
1869 case ISD::FP_EXTEND:
1870 // This can return overflow, underflow, or inexact; we don't care.
1871 // FIXME need to be more flexible about rounding mode.
1872 (void) V.convert(VT==MVT::f32 ? APFloat::IEEEsingle :
1873 VT==MVT::f64 ? APFloat::IEEEdouble :
1874 VT==MVT::f80 ? APFloat::x87DoubleExtended :
1875 VT==MVT::f128 ? APFloat::IEEEquad :
1876 APFloat::Bogus,
1877 APFloat::rmNearestTiesToEven);
1878 return getConstantFP(V, VT);
1879 case ISD::FP_TO_SINT:
1880 case ISD::FP_TO_UINT: {
1881 integerPart x;
1882 assert(integerPartWidth >= 64);
1883 // FIXME need to be more flexible about rounding mode.
1884 APFloat::opStatus s = V.convertToInteger(&x, 64U,
1885 Opcode==ISD::FP_TO_SINT,
1886 APFloat::rmTowardZero);
1887 if (s==APFloat::opInvalidOp) // inexact is OK, in fact usual
1888 break;
1889 return getConstant(x, VT);
1890 }
1891 case ISD::BIT_CONVERT:
1892 if (VT == MVT::i32 && C->getValueType(0) == MVT::f32)
1893 return getConstant((uint32_t)V.convertToAPInt().getZExtValue(), VT);
1894 else if (VT == MVT::i64 && C->getValueType(0) == MVT::f64)
1895 return getConstant(V.convertToAPInt().getZExtValue(), VT);
Dale Johannesenc4dd3c32007-08-31 23:34:27 +00001896 break;
Dale Johannesendb44bf82007-10-16 23:38:29 +00001897 }
Chris Lattnerc3aae252005-01-07 07:46:32 +00001898 }
Dale Johannesenc4dd3c32007-08-31 23:34:27 +00001899 }
Chris Lattnerc3aae252005-01-07 07:46:32 +00001900
1901 unsigned OpOpcode = Operand.Val->getOpcode();
1902 switch (Opcode) {
Chris Lattnera93ec3e2005-01-21 18:01:22 +00001903 case ISD::TokenFactor:
1904 return Operand; // Factor of one node? No factor.
Chris Lattner0bd48932008-01-17 07:00:52 +00001905 case ISD::FP_ROUND: assert(0 && "Invalid method to make FP_ROUND node");
Chris Lattnerff33cc42007-04-09 05:23:13 +00001906 case ISD::FP_EXTEND:
1907 assert(MVT::isFloatingPoint(VT) &&
1908 MVT::isFloatingPoint(Operand.getValueType()) && "Invalid FP cast!");
Chris Lattner7e2e0332008-01-16 17:59:31 +00001909 if (Operand.getValueType() == VT) return Operand; // noop conversion.
Chris Lattnerff33cc42007-04-09 05:23:13 +00001910 break;
Chris Lattner0bd48932008-01-17 07:00:52 +00001911 case ISD::SIGN_EXTEND:
Chris Lattnerff33cc42007-04-09 05:23:13 +00001912 assert(MVT::isInteger(VT) && MVT::isInteger(Operand.getValueType()) &&
1913 "Invalid SIGN_EXTEND!");
Chris Lattnerc3aae252005-01-07 07:46:32 +00001914 if (Operand.getValueType() == VT) return Operand; // noop extension
Duncan Sandsaf47b112007-10-16 09:56:48 +00001915 assert(MVT::getSizeInBits(Operand.getValueType()) < MVT::getSizeInBits(VT)
1916 && "Invalid sext node, dst < src!");
Chris Lattnerc3aae252005-01-07 07:46:32 +00001917 if (OpOpcode == ISD::SIGN_EXTEND || OpOpcode == ISD::ZERO_EXTEND)
1918 return getNode(OpOpcode, VT, Operand.Val->getOperand(0));
1919 break;
1920 case ISD::ZERO_EXTEND:
Chris Lattnerff33cc42007-04-09 05:23:13 +00001921 assert(MVT::isInteger(VT) && MVT::isInteger(Operand.getValueType()) &&
1922 "Invalid ZERO_EXTEND!");
Chris Lattnerc3aae252005-01-07 07:46:32 +00001923 if (Operand.getValueType() == VT) return Operand; // noop extension
Duncan Sandsaf47b112007-10-16 09:56:48 +00001924 assert(MVT::getSizeInBits(Operand.getValueType()) < MVT::getSizeInBits(VT)
1925 && "Invalid zext node, dst < src!");
Chris Lattner5a6bace2005-04-07 19:43:53 +00001926 if (OpOpcode == ISD::ZERO_EXTEND) // (zext (zext x)) -> (zext x)
Chris Lattner2f0ca792005-01-12 18:51:15 +00001927 return getNode(ISD::ZERO_EXTEND, VT, Operand.Val->getOperand(0));
Chris Lattnerc3aae252005-01-07 07:46:32 +00001928 break;
Chris Lattner4ed11b42005-09-02 00:17:32 +00001929 case ISD::ANY_EXTEND:
Chris Lattnerff33cc42007-04-09 05:23:13 +00001930 assert(MVT::isInteger(VT) && MVT::isInteger(Operand.getValueType()) &&
1931 "Invalid ANY_EXTEND!");
Chris Lattner4ed11b42005-09-02 00:17:32 +00001932 if (Operand.getValueType() == VT) return Operand; // noop extension
Duncan Sandsaf47b112007-10-16 09:56:48 +00001933 assert(MVT::getSizeInBits(Operand.getValueType()) < MVT::getSizeInBits(VT)
1934 && "Invalid anyext node, dst < src!");
Chris Lattner4ed11b42005-09-02 00:17:32 +00001935 if (OpOpcode == ISD::ZERO_EXTEND || OpOpcode == ISD::SIGN_EXTEND)
1936 // (ext (zext x)) -> (zext x) and (ext (sext x)) -> (sext x)
1937 return getNode(OpOpcode, VT, Operand.Val->getOperand(0));
1938 break;
Chris Lattnerc3aae252005-01-07 07:46:32 +00001939 case ISD::TRUNCATE:
Chris Lattnerff33cc42007-04-09 05:23:13 +00001940 assert(MVT::isInteger(VT) && MVT::isInteger(Operand.getValueType()) &&
1941 "Invalid TRUNCATE!");
Chris Lattnerc3aae252005-01-07 07:46:32 +00001942 if (Operand.getValueType() == VT) return Operand; // noop truncate
Duncan Sandsaf47b112007-10-16 09:56:48 +00001943 assert(MVT::getSizeInBits(Operand.getValueType()) > MVT::getSizeInBits(VT)
1944 && "Invalid truncate node, src < dst!");
Chris Lattnerc3aae252005-01-07 07:46:32 +00001945 if (OpOpcode == ISD::TRUNCATE)
1946 return getNode(ISD::TRUNCATE, VT, Operand.Val->getOperand(0));
Chris Lattner4ed11b42005-09-02 00:17:32 +00001947 else if (OpOpcode == ISD::ZERO_EXTEND || OpOpcode == ISD::SIGN_EXTEND ||
1948 OpOpcode == ISD::ANY_EXTEND) {
Chris Lattnerfd8c39b2005-01-07 21:56:24 +00001949 // If the source is smaller than the dest, we still need an extend.
Duncan Sandsaf47b112007-10-16 09:56:48 +00001950 if (MVT::getSizeInBits(Operand.Val->getOperand(0).getValueType())
1951 < MVT::getSizeInBits(VT))
Chris Lattnerfd8c39b2005-01-07 21:56:24 +00001952 return getNode(OpOpcode, VT, Operand.Val->getOperand(0));
Duncan Sandsaf47b112007-10-16 09:56:48 +00001953 else if (MVT::getSizeInBits(Operand.Val->getOperand(0).getValueType())
1954 > MVT::getSizeInBits(VT))
Chris Lattnerfd8c39b2005-01-07 21:56:24 +00001955 return getNode(ISD::TRUNCATE, VT, Operand.Val->getOperand(0));
1956 else
1957 return Operand.Val->getOperand(0);
1958 }
Chris Lattnerc3aae252005-01-07 07:46:32 +00001959 break;
Chris Lattner35481892005-12-23 00:16:34 +00001960 case ISD::BIT_CONVERT:
1961 // Basic sanity checking.
Chris Lattner70c2a612006-03-31 02:06:56 +00001962 assert(MVT::getSizeInBits(VT) == MVT::getSizeInBits(Operand.getValueType())
Reid Spencera07d5b92006-11-11 20:07:59 +00001963 && "Cannot BIT_CONVERT between types of different sizes!");
Chris Lattner35481892005-12-23 00:16:34 +00001964 if (VT == Operand.getValueType()) return Operand; // noop conversion.
Chris Lattnerc8547d82005-12-23 05:37:50 +00001965 if (OpOpcode == ISD::BIT_CONVERT) // bitconv(bitconv(x)) -> bitconv(x)
1966 return getNode(ISD::BIT_CONVERT, VT, Operand.getOperand(0));
Chris Lattner08da55e2006-04-04 01:02:22 +00001967 if (OpOpcode == ISD::UNDEF)
1968 return getNode(ISD::UNDEF, VT);
Chris Lattner35481892005-12-23 00:16:34 +00001969 break;
Chris Lattnerce872152006-03-19 06:31:19 +00001970 case ISD::SCALAR_TO_VECTOR:
1971 assert(MVT::isVector(VT) && !MVT::isVector(Operand.getValueType()) &&
Dan Gohman51eaa862007-06-14 22:58:02 +00001972 MVT::getVectorElementType(VT) == Operand.getValueType() &&
Chris Lattnerce872152006-03-19 06:31:19 +00001973 "Illegal SCALAR_TO_VECTOR node!");
1974 break;
Chris Lattner485df9b2005-04-09 03:02:46 +00001975 case ISD::FNEG:
Chris Lattner01b3d732005-09-28 22:28:18 +00001976 if (OpOpcode == ISD::FSUB) // -(X-Y) -> (Y-X)
1977 return getNode(ISD::FSUB, VT, Operand.Val->getOperand(1),
Chris Lattner485df9b2005-04-09 03:02:46 +00001978 Operand.Val->getOperand(0));
1979 if (OpOpcode == ISD::FNEG) // --X -> X
1980 return Operand.Val->getOperand(0);
1981 break;
1982 case ISD::FABS:
1983 if (OpOpcode == ISD::FNEG) // abs(-X) -> abs(X)
1984 return getNode(ISD::FABS, VT, Operand.Val->getOperand(0));
1985 break;
Chris Lattnerc3aae252005-01-07 07:46:32 +00001986 }
1987
Chris Lattner43247a12005-08-25 19:12:10 +00001988 SDNode *N;
Chris Lattner0b3e5252006-08-15 19:11:05 +00001989 SDVTList VTs = getVTList(VT);
Chris Lattner43247a12005-08-25 19:12:10 +00001990 if (VT != MVT::Flag) { // Don't CSE flag producing nodes
Jim Laskey583bd472006-10-27 23:46:08 +00001991 FoldingSetNodeID ID;
Chris Lattner3f97eb42007-02-04 08:35:21 +00001992 SDOperand Ops[1] = { Operand };
Chris Lattner63e3f142007-02-04 07:28:00 +00001993 AddNodeIDNode(ID, Opcode, VTs, Ops, 1);
Chris Lattnera5682852006-08-07 23:03:03 +00001994 void *IP = 0;
1995 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1996 return SDOperand(E, 0);
Chris Lattner3f97eb42007-02-04 08:35:21 +00001997 N = new UnarySDNode(Opcode, VTs, Operand);
Chris Lattnera5682852006-08-07 23:03:03 +00001998 CSEMap.InsertNode(N, IP);
Chris Lattner43247a12005-08-25 19:12:10 +00001999 } else {
Chris Lattner3f97eb42007-02-04 08:35:21 +00002000 N = new UnarySDNode(Opcode, VTs, Operand);
Chris Lattner43247a12005-08-25 19:12:10 +00002001 }
Chris Lattnerc3aae252005-01-07 07:46:32 +00002002 AllNodes.push_back(N);
2003 return SDOperand(N, 0);
Chris Lattner78ec3112003-08-11 14:57:33 +00002004}
2005
Chris Lattner36019aa2005-04-18 03:48:41 +00002006
2007
Chris Lattnerc3aae252005-01-07 07:46:32 +00002008SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
2009 SDOperand N1, SDOperand N2) {
Chris Lattner8e1f7ac2008-01-22 19:09:33 +00002010 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val);
2011 ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val);
Chris Lattner76365122005-01-16 02:23:22 +00002012 switch (Opcode) {
Chris Lattner8e1f7ac2008-01-22 19:09:33 +00002013 default: break;
Chris Lattner39908e02005-01-19 18:01:40 +00002014 case ISD::TokenFactor:
2015 assert(VT == MVT::Other && N1.getValueType() == MVT::Other &&
2016 N2.getValueType() == MVT::Other && "Invalid token factor!");
Chris Lattner8e1f7ac2008-01-22 19:09:33 +00002017 // Fold trivial token factors.
2018 if (N1.getOpcode() == ISD::EntryToken) return N2;
2019 if (N2.getOpcode() == ISD::EntryToken) return N1;
Chris Lattner39908e02005-01-19 18:01:40 +00002020 break;
Chris Lattner76365122005-01-16 02:23:22 +00002021 case ISD::AND:
Chris Lattner8e1f7ac2008-01-22 19:09:33 +00002022 assert(MVT::isInteger(VT) && N1.getValueType() == N2.getValueType() &&
2023 N1.getValueType() == VT && "Binary operator types must match!");
2024 // (X & 0) -> 0. This commonly occurs when legalizing i64 values, so it's
2025 // worth handling here.
2026 if (N2C && N2C->getValue() == 0)
2027 return N2;
Chris Lattner9967c152008-01-26 01:05:42 +00002028 if (N2C && N2C->isAllOnesValue()) // X & -1 -> X
2029 return N1;
Chris Lattner8e1f7ac2008-01-22 19:09:33 +00002030 break;
Chris Lattner76365122005-01-16 02:23:22 +00002031 case ISD::OR:
2032 case ISD::XOR:
Chris Lattner8e1f7ac2008-01-22 19:09:33 +00002033 assert(MVT::isInteger(VT) && N1.getValueType() == N2.getValueType() &&
2034 N1.getValueType() == VT && "Binary operator types must match!");
2035 // (X ^| 0) -> X. This commonly occurs when legalizing i64 values, so it's
2036 // worth handling here.
2037 if (N2C && N2C->getValue() == 0)
2038 return N1;
2039 break;
Chris Lattner76365122005-01-16 02:23:22 +00002040 case ISD::UDIV:
2041 case ISD::UREM:
Chris Lattnere5eb6f82005-05-15 05:39:08 +00002042 case ISD::MULHU:
2043 case ISD::MULHS:
Chris Lattner76365122005-01-16 02:23:22 +00002044 assert(MVT::isInteger(VT) && "This operator does not apply to FP types!");
2045 // fall through
2046 case ISD::ADD:
2047 case ISD::SUB:
2048 case ISD::MUL:
2049 case ISD::SDIV:
2050 case ISD::SREM:
Chris Lattner01b3d732005-09-28 22:28:18 +00002051 case ISD::FADD:
2052 case ISD::FSUB:
2053 case ISD::FMUL:
2054 case ISD::FDIV:
2055 case ISD::FREM:
Chris Lattner76365122005-01-16 02:23:22 +00002056 assert(N1.getValueType() == N2.getValueType() &&
2057 N1.getValueType() == VT && "Binary operator types must match!");
2058 break;
Chris Lattnera09f8482006-03-05 05:09:38 +00002059 case ISD::FCOPYSIGN: // N1 and result must match. N1/N2 need not match.
2060 assert(N1.getValueType() == VT &&
2061 MVT::isFloatingPoint(N1.getValueType()) &&
2062 MVT::isFloatingPoint(N2.getValueType()) &&
2063 "Invalid FCOPYSIGN!");
2064 break;
Chris Lattner76365122005-01-16 02:23:22 +00002065 case ISD::SHL:
2066 case ISD::SRA:
2067 case ISD::SRL:
Nate Begeman35ef9132006-01-11 21:21:00 +00002068 case ISD::ROTL:
2069 case ISD::ROTR:
Chris Lattner76365122005-01-16 02:23:22 +00002070 assert(VT == N1.getValueType() &&
2071 "Shift operators return type must be the same as their first arg");
2072 assert(MVT::isInteger(VT) && MVT::isInteger(N2.getValueType()) &&
Chris Lattner068a81e2005-01-17 17:15:02 +00002073 VT != MVT::i1 && "Shifts only work on integers");
Chris Lattner76365122005-01-16 02:23:22 +00002074 break;
Chris Lattner15e4b012005-07-10 00:07:11 +00002075 case ISD::FP_ROUND_INREG: {
2076 MVT::ValueType EVT = cast<VTSDNode>(N2)->getVT();
2077 assert(VT == N1.getValueType() && "Not an inreg round!");
2078 assert(MVT::isFloatingPoint(VT) && MVT::isFloatingPoint(EVT) &&
2079 "Cannot FP_ROUND_INREG integer types");
Duncan Sandsaf47b112007-10-16 09:56:48 +00002080 assert(MVT::getSizeInBits(EVT) <= MVT::getSizeInBits(VT) &&
2081 "Not rounding down!");
Chris Lattner8e1f7ac2008-01-22 19:09:33 +00002082 if (cast<VTSDNode>(N2)->getVT() == VT) return N1; // Not actually rounding.
Chris Lattner15e4b012005-07-10 00:07:11 +00002083 break;
2084 }
Chris Lattner0bd48932008-01-17 07:00:52 +00002085 case ISD::FP_ROUND:
2086 assert(MVT::isFloatingPoint(VT) &&
2087 MVT::isFloatingPoint(N1.getValueType()) &&
2088 MVT::getSizeInBits(VT) <= MVT::getSizeInBits(N1.getValueType()) &&
2089 isa<ConstantSDNode>(N2) && "Invalid FP_ROUND!");
Chris Lattner8e1f7ac2008-01-22 19:09:33 +00002090 if (N1.getValueType() == VT) return N1; // noop conversion.
Chris Lattner0bd48932008-01-17 07:00:52 +00002091 break;
Nate Begeman56eb8682005-08-30 02:44:00 +00002092 case ISD::AssertSext:
Chris Lattner8e1f7ac2008-01-22 19:09:33 +00002093 case ISD::AssertZext: {
2094 MVT::ValueType EVT = cast<VTSDNode>(N2)->getVT();
2095 assert(VT == N1.getValueType() && "Not an inreg extend!");
2096 assert(MVT::isInteger(VT) && MVT::isInteger(EVT) &&
2097 "Cannot *_EXTEND_INREG FP types");
2098 assert(MVT::getSizeInBits(EVT) <= MVT::getSizeInBits(VT) &&
2099 "Not extending!");
Duncan Sandsd885dbd2008-02-10 10:08:52 +00002100 if (VT == EVT) return N1; // noop assertion.
Chris Lattner8e1f7ac2008-01-22 19:09:33 +00002101 break;
2102 }
Chris Lattner15e4b012005-07-10 00:07:11 +00002103 case ISD::SIGN_EXTEND_INREG: {
2104 MVT::ValueType EVT = cast<VTSDNode>(N2)->getVT();
2105 assert(VT == N1.getValueType() && "Not an inreg extend!");
2106 assert(MVT::isInteger(VT) && MVT::isInteger(EVT) &&
2107 "Cannot *_EXTEND_INREG FP types");
Duncan Sandsaf47b112007-10-16 09:56:48 +00002108 assert(MVT::getSizeInBits(EVT) <= MVT::getSizeInBits(VT) &&
2109 "Not extending!");
Chris Lattner8e1f7ac2008-01-22 19:09:33 +00002110 if (EVT == VT) return N1; // Not actually extending
Chris Lattner15e4b012005-07-10 00:07:11 +00002111
Chris Lattner8e1f7ac2008-01-22 19:09:33 +00002112 if (N1C) {
Chris Lattnerb9ebacd2006-05-06 23:05:41 +00002113 int64_t Val = N1C->getValue();
2114 unsigned FromBits = MVT::getSizeInBits(cast<VTSDNode>(N2)->getVT());
2115 Val <<= 64-FromBits;
2116 Val >>= 64-FromBits;
2117 return getConstant(Val, VT);
2118 }
Chris Lattner8e1f7ac2008-01-22 19:09:33 +00002119 break;
2120 }
2121 case ISD::EXTRACT_VECTOR_ELT:
2122 assert(N2C && "Bad EXTRACT_VECTOR_ELT!");
2123
2124 // EXTRACT_VECTOR_ELT of CONCAT_VECTORS is often formed while lowering is
2125 // expanding copies of large vectors from registers.
2126 if (N1.getOpcode() == ISD::CONCAT_VECTORS &&
2127 N1.getNumOperands() > 0) {
2128 unsigned Factor =
2129 MVT::getVectorNumElements(N1.getOperand(0).getValueType());
2130 return getNode(ISD::EXTRACT_VECTOR_ELT, VT,
2131 N1.getOperand(N2C->getValue() / Factor),
2132 getConstant(N2C->getValue() % Factor, N2.getValueType()));
2133 }
2134
2135 // EXTRACT_VECTOR_ELT of BUILD_VECTOR is often formed while lowering is
2136 // expanding large vector constants.
2137 if (N1.getOpcode() == ISD::BUILD_VECTOR)
2138 return N1.getOperand(N2C->getValue());
2139
2140 // EXTRACT_VECTOR_ELT of INSERT_VECTOR_ELT is often formed when vector
2141 // operations are lowered to scalars.
2142 if (N1.getOpcode() == ISD::INSERT_VECTOR_ELT)
2143 if (ConstantSDNode *IEC = dyn_cast<ConstantSDNode>(N1.getOperand(2))) {
2144 if (IEC == N2C)
2145 return N1.getOperand(1);
2146 else
2147 return getNode(ISD::EXTRACT_VECTOR_ELT, VT, N1.getOperand(0), N2);
2148 }
2149 break;
2150 case ISD::EXTRACT_ELEMENT:
2151 assert(N2C && (unsigned)N2C->getValue() < 2 && "Bad EXTRACT_ELEMENT!");
Chris Lattnerb9ebacd2006-05-06 23:05:41 +00002152
Chris Lattner8e1f7ac2008-01-22 19:09:33 +00002153 // EXTRACT_ELEMENT of BUILD_PAIR is often formed while legalize is expanding
2154 // 64-bit integers into 32-bit parts. Instead of building the extract of
2155 // the BUILD_PAIR, only to have legalize rip it apart, just do it now.
2156 if (N1.getOpcode() == ISD::BUILD_PAIR)
2157 return N1.getOperand(N2C->getValue());
2158
2159 // EXTRACT_ELEMENT of a constant int is also very common.
2160 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(N1)) {
2161 unsigned Shift = MVT::getSizeInBits(VT) * N2C->getValue();
2162 return getConstant(C->getValue() >> Shift, VT);
2163 }
2164 break;
Duncan Sandsf83b1f62008-02-20 17:38:09 +00002165 case ISD::EXTRACT_SUBVECTOR:
2166 if (N1.getValueType() == VT) // Trivial extraction.
2167 return N1;
2168 break;
Chris Lattner8e1f7ac2008-01-22 19:09:33 +00002169 }
2170
2171 if (N1C) {
Chris Lattnerc3aae252005-01-07 07:46:32 +00002172 if (N2C) {
2173 uint64_t C1 = N1C->getValue(), C2 = N2C->getValue();
2174 switch (Opcode) {
2175 case ISD::ADD: return getConstant(C1 + C2, VT);
2176 case ISD::SUB: return getConstant(C1 - C2, VT);
2177 case ISD::MUL: return getConstant(C1 * C2, VT);
2178 case ISD::UDIV:
2179 if (C2) return getConstant(C1 / C2, VT);
2180 break;
2181 case ISD::UREM :
2182 if (C2) return getConstant(C1 % C2, VT);
2183 break;
2184 case ISD::SDIV :
2185 if (C2) return getConstant(N1C->getSignExtended() /
2186 N2C->getSignExtended(), VT);
2187 break;
2188 case ISD::SREM :
2189 if (C2) return getConstant(N1C->getSignExtended() %
2190 N2C->getSignExtended(), VT);
2191 break;
2192 case ISD::AND : return getConstant(C1 & C2, VT);
2193 case ISD::OR : return getConstant(C1 | C2, VT);
2194 case ISD::XOR : return getConstant(C1 ^ C2, VT);
Nate Begemanb85dfab2005-08-31 00:27:53 +00002195 case ISD::SHL : return getConstant(C1 << C2, VT);
2196 case ISD::SRL : return getConstant(C1 >> C2, VT);
Chris Lattner8136d1f2005-01-10 00:07:15 +00002197 case ISD::SRA : return getConstant(N1C->getSignExtended() >>(int)C2, VT);
Nate Begeman35ef9132006-01-11 21:21:00 +00002198 case ISD::ROTL :
2199 return getConstant((C1 << C2) | (C1 >> (MVT::getSizeInBits(VT) - C2)),
2200 VT);
2201 case ISD::ROTR :
2202 return getConstant((C1 >> C2) | (C1 << (MVT::getSizeInBits(VT) - C2)),
2203 VT);
Chris Lattnerc3aae252005-01-07 07:46:32 +00002204 default: break;
2205 }
Chris Lattnerc3aae252005-01-07 07:46:32 +00002206 } else { // Cannonicalize constant to RHS if commutative
2207 if (isCommutativeBinOp(Opcode)) {
2208 std::swap(N1C, N2C);
2209 std::swap(N1, N2);
2210 }
2211 }
Chris Lattnerc3aae252005-01-07 07:46:32 +00002212 }
2213
Chris Lattner8e1f7ac2008-01-22 19:09:33 +00002214 // Constant fold FP operations.
Chris Lattnerc3aae252005-01-07 07:46:32 +00002215 ConstantFPSDNode *N1CFP = dyn_cast<ConstantFPSDNode>(N1.Val);
2216 ConstantFPSDNode *N2CFP = dyn_cast<ConstantFPSDNode>(N2.Val);
Chris Lattner15e4b012005-07-10 00:07:11 +00002217 if (N1CFP) {
Chris Lattner8e1f7ac2008-01-22 19:09:33 +00002218 if (!N2CFP && isCommutativeBinOp(Opcode)) {
2219 // Cannonicalize constant to RHS if commutative
2220 std::swap(N1CFP, N2CFP);
2221 std::swap(N1, N2);
2222 } else if (N2CFP && VT != MVT::ppcf128) {
Dale Johannesenc4dd3c32007-08-31 23:34:27 +00002223 APFloat V1 = N1CFP->getValueAPF(), V2 = N2CFP->getValueAPF();
2224 APFloat::opStatus s;
Chris Lattnerc3aae252005-01-07 07:46:32 +00002225 switch (Opcode) {
Dale Johannesenc4dd3c32007-08-31 23:34:27 +00002226 case ISD::FADD:
2227 s = V1.add(V2, APFloat::rmNearestTiesToEven);
Chris Lattner8e1f7ac2008-01-22 19:09:33 +00002228 if (s != APFloat::opInvalidOp)
Dale Johannesenc4dd3c32007-08-31 23:34:27 +00002229 return getConstantFP(V1, VT);
2230 break;
2231 case ISD::FSUB:
2232 s = V1.subtract(V2, APFloat::rmNearestTiesToEven);
2233 if (s!=APFloat::opInvalidOp)
2234 return getConstantFP(V1, VT);
2235 break;
2236 case ISD::FMUL:
2237 s = V1.multiply(V2, APFloat::rmNearestTiesToEven);
2238 if (s!=APFloat::opInvalidOp)
2239 return getConstantFP(V1, VT);
2240 break;
Chris Lattner01b3d732005-09-28 22:28:18 +00002241 case ISD::FDIV:
Dale Johannesenc4dd3c32007-08-31 23:34:27 +00002242 s = V1.divide(V2, APFloat::rmNearestTiesToEven);
2243 if (s!=APFloat::opInvalidOp && s!=APFloat::opDivByZero)
2244 return getConstantFP(V1, VT);
Chris Lattnerc3aae252005-01-07 07:46:32 +00002245 break;
Chris Lattner01b3d732005-09-28 22:28:18 +00002246 case ISD::FREM :
Dale Johannesenc4dd3c32007-08-31 23:34:27 +00002247 s = V1.mod(V2, APFloat::rmNearestTiesToEven);
2248 if (s!=APFloat::opInvalidOp && s!=APFloat::opDivByZero)
2249 return getConstantFP(V1, VT);
Chris Lattnerc3aae252005-01-07 07:46:32 +00002250 break;
Dale Johannesenc4dd3c32007-08-31 23:34:27 +00002251 case ISD::FCOPYSIGN:
2252 V1.copySign(V2);
2253 return getConstantFP(V1, VT);
Chris Lattnerc3aae252005-01-07 07:46:32 +00002254 default: break;
2255 }
Chris Lattnerc3aae252005-01-07 07:46:32 +00002256 }
Chris Lattner15e4b012005-07-10 00:07:11 +00002257 }
Chris Lattner62b57722006-04-20 05:39:12 +00002258
2259 // Canonicalize an UNDEF to the RHS, even over a constant.
2260 if (N1.getOpcode() == ISD::UNDEF) {
2261 if (isCommutativeBinOp(Opcode)) {
2262 std::swap(N1, N2);
2263 } else {
2264 switch (Opcode) {
2265 case ISD::FP_ROUND_INREG:
2266 case ISD::SIGN_EXTEND_INREG:
2267 case ISD::SUB:
2268 case ISD::FSUB:
2269 case ISD::FDIV:
2270 case ISD::FREM:
Chris Lattner2cfd6742006-05-08 17:29:49 +00002271 case ISD::SRA:
Chris Lattner62b57722006-04-20 05:39:12 +00002272 return N1; // fold op(undef, arg2) -> undef
2273 case ISD::UDIV:
2274 case ISD::SDIV:
2275 case ISD::UREM:
2276 case ISD::SREM:
Chris Lattner2cfd6742006-05-08 17:29:49 +00002277 case ISD::SRL:
2278 case ISD::SHL:
Chris Lattner964dd862007-04-25 00:00:45 +00002279 if (!MVT::isVector(VT))
2280 return getConstant(0, VT); // fold op(undef, arg2) -> 0
2281 // For vectors, we can't easily build an all zero vector, just return
2282 // the LHS.
2283 return N2;
Chris Lattner62b57722006-04-20 05:39:12 +00002284 }
2285 }
2286 }
2287
Chris Lattnerb9ebacd2006-05-06 23:05:41 +00002288 // Fold a bunch of operators when the RHS is undef.
Chris Lattner62b57722006-04-20 05:39:12 +00002289 if (N2.getOpcode() == ISD::UNDEF) {
2290 switch (Opcode) {
2291 case ISD::ADD:
Chris Lattner175415e2007-03-04 20:01:46 +00002292 case ISD::ADDC:
2293 case ISD::ADDE:
Chris Lattner62b57722006-04-20 05:39:12 +00002294 case ISD::SUB:
2295 case ISD::FADD:
2296 case ISD::FSUB:
2297 case ISD::FMUL:
2298 case ISD::FDIV:
2299 case ISD::FREM:
2300 case ISD::UDIV:
2301 case ISD::SDIV:
2302 case ISD::UREM:
2303 case ISD::SREM:
2304 case ISD::XOR:
2305 return N2; // fold op(arg1, undef) -> undef
2306 case ISD::MUL:
2307 case ISD::AND:
Chris Lattner2cfd6742006-05-08 17:29:49 +00002308 case ISD::SRL:
2309 case ISD::SHL:
Chris Lattner964dd862007-04-25 00:00:45 +00002310 if (!MVT::isVector(VT))
2311 return getConstant(0, VT); // fold op(arg1, undef) -> 0
2312 // For vectors, we can't easily build an all zero vector, just return
2313 // the LHS.
2314 return N1;
Chris Lattner62b57722006-04-20 05:39:12 +00002315 case ISD::OR:
Chris Lattner964dd862007-04-25 00:00:45 +00002316 if (!MVT::isVector(VT))
2317 return getConstant(MVT::getIntVTBitMask(VT), VT);
2318 // For vectors, we can't easily build an all one vector, just return
2319 // the LHS.
2320 return N1;
Chris Lattner2cfd6742006-05-08 17:29:49 +00002321 case ISD::SRA:
2322 return N1;
Chris Lattner62b57722006-04-20 05:39:12 +00002323 }
2324 }
Chris Lattner15e4b012005-07-10 00:07:11 +00002325
Chris Lattner27e9b412005-05-11 18:57:39 +00002326 // Memoize this node if possible.
2327 SDNode *N;
Chris Lattner0b3e5252006-08-15 19:11:05 +00002328 SDVTList VTs = getVTList(VT);
Chris Lattner70814bc2006-01-29 07:58:15 +00002329 if (VT != MVT::Flag) {
Chris Lattner3f97eb42007-02-04 08:35:21 +00002330 SDOperand Ops[] = { N1, N2 };
Jim Laskey583bd472006-10-27 23:46:08 +00002331 FoldingSetNodeID ID;
Chris Lattner63e3f142007-02-04 07:28:00 +00002332 AddNodeIDNode(ID, Opcode, VTs, Ops, 2);
Chris Lattnera5682852006-08-07 23:03:03 +00002333 void *IP = 0;
2334 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2335 return SDOperand(E, 0);
Chris Lattner3f97eb42007-02-04 08:35:21 +00002336 N = new BinarySDNode(Opcode, VTs, N1, N2);
Chris Lattnera5682852006-08-07 23:03:03 +00002337 CSEMap.InsertNode(N, IP);
Chris Lattner27e9b412005-05-11 18:57:39 +00002338 } else {
Chris Lattner3f97eb42007-02-04 08:35:21 +00002339 N = new BinarySDNode(Opcode, VTs, N1, N2);
Chris Lattner27e9b412005-05-11 18:57:39 +00002340 }
2341
Chris Lattnerc3aae252005-01-07 07:46:32 +00002342 AllNodes.push_back(N);
2343 return SDOperand(N, 0);
2344}
2345
Chris Lattnerc3aae252005-01-07 07:46:32 +00002346SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
2347 SDOperand N1, SDOperand N2, SDOperand N3) {
2348 // Perform various simplifications.
2349 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val);
2350 ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val);
Chris Lattnerc3aae252005-01-07 07:46:32 +00002351 switch (Opcode) {
Chris Lattner7cf7e3f2005-08-09 20:20:18 +00002352 case ISD::SETCC: {
Chris Lattner51dabfb2006-10-14 00:41:01 +00002353 // Use FoldSetCC to simplify SETCC's.
2354 SDOperand Simp = FoldSetCC(VT, N1, N2, cast<CondCodeSDNode>(N3)->get());
Chris Lattner7cf7e3f2005-08-09 20:20:18 +00002355 if (Simp.Val) return Simp;
2356 break;
2357 }
Chris Lattnerc3aae252005-01-07 07:46:32 +00002358 case ISD::SELECT:
Anton Korobeynikov4c71dfe2008-02-20 11:10:28 +00002359 if (N1C) {
2360 if (N1C->getValue())
Chris Lattnerc3aae252005-01-07 07:46:32 +00002361 return N2; // select true, X, Y -> X
Misha Brukmanedf128a2005-04-21 22:36:52 +00002362 else
Chris Lattnerc3aae252005-01-07 07:46:32 +00002363 return N3; // select false, X, Y -> Y
Anton Korobeynikov4c71dfe2008-02-20 11:10:28 +00002364 }
Chris Lattnerc3aae252005-01-07 07:46:32 +00002365
2366 if (N2 == N3) return N2; // select C, X, X -> X
Chris Lattnerc3aae252005-01-07 07:46:32 +00002367 break;
Chris Lattner5351e9b2005-01-07 22:49:57 +00002368 case ISD::BRCOND:
Anton Korobeynikov4c71dfe2008-02-20 11:10:28 +00002369 if (N2C) {
Chris Lattner5351e9b2005-01-07 22:49:57 +00002370 if (N2C->getValue()) // Unconditional branch
2371 return getNode(ISD::BR, MVT::Other, N1, N3);
2372 else
2373 return N1; // Never-taken branch
Anton Korobeynikov4c71dfe2008-02-20 11:10:28 +00002374 }
Chris Lattner7c68ec62005-01-07 23:32:00 +00002375 break;
Chris Lattnerfb194b92006-03-19 23:56:04 +00002376 case ISD::VECTOR_SHUFFLE:
2377 assert(VT == N1.getValueType() && VT == N2.getValueType() &&
2378 MVT::isVector(VT) && MVT::isVector(N3.getValueType()) &&
2379 N3.getOpcode() == ISD::BUILD_VECTOR &&
2380 MVT::getVectorNumElements(VT) == N3.getNumOperands() &&
2381 "Illegal VECTOR_SHUFFLE node!");
2382 break;
Dan Gohman7f321562007-06-25 16:23:39 +00002383 case ISD::BIT_CONVERT:
2384 // Fold bit_convert nodes from a type to themselves.
2385 if (N1.getValueType() == VT)
2386 return N1;
Chris Lattner4829b1c2007-04-12 05:58:43 +00002387 break;
Chris Lattnerc3aae252005-01-07 07:46:32 +00002388 }
2389
Chris Lattner43247a12005-08-25 19:12:10 +00002390 // Memoize node if it doesn't produce a flag.
2391 SDNode *N;
Chris Lattner0b3e5252006-08-15 19:11:05 +00002392 SDVTList VTs = getVTList(VT);
Chris Lattner43247a12005-08-25 19:12:10 +00002393 if (VT != MVT::Flag) {
Chris Lattner3f97eb42007-02-04 08:35:21 +00002394 SDOperand Ops[] = { N1, N2, N3 };
Jim Laskey583bd472006-10-27 23:46:08 +00002395 FoldingSetNodeID ID;
Chris Lattner63e3f142007-02-04 07:28:00 +00002396 AddNodeIDNode(ID, Opcode, VTs, Ops, 3);
Chris Lattnera5682852006-08-07 23:03:03 +00002397 void *IP = 0;
2398 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2399 return SDOperand(E, 0);
Chris Lattner3f97eb42007-02-04 08:35:21 +00002400 N = new TernarySDNode(Opcode, VTs, N1, N2, N3);
Chris Lattnera5682852006-08-07 23:03:03 +00002401 CSEMap.InsertNode(N, IP);
Chris Lattner43247a12005-08-25 19:12:10 +00002402 } else {
Chris Lattner3f97eb42007-02-04 08:35:21 +00002403 N = new TernarySDNode(Opcode, VTs, N1, N2, N3);
Chris Lattner43247a12005-08-25 19:12:10 +00002404 }
Chris Lattnerc3aae252005-01-07 07:46:32 +00002405 AllNodes.push_back(N);
2406 return SDOperand(N, 0);
2407}
2408
2409SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
Jeff Cohen00b168892005-07-27 06:12:32 +00002410 SDOperand N1, SDOperand N2, SDOperand N3,
Andrew Lenharth2d86ea22005-04-27 20:10:01 +00002411 SDOperand N4) {
Chris Lattnerf06f35e2006-08-08 01:09:31 +00002412 SDOperand Ops[] = { N1, N2, N3, N4 };
2413 return getNode(Opcode, VT, Ops, 4);
Andrew Lenharth2d86ea22005-04-27 20:10:01 +00002414}
2415
Chris Lattner9fadb4c2005-07-10 00:29:18 +00002416SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
2417 SDOperand N1, SDOperand N2, SDOperand N3,
2418 SDOperand N4, SDOperand N5) {
Chris Lattnerf06f35e2006-08-08 01:09:31 +00002419 SDOperand Ops[] = { N1, N2, N3, N4, N5 };
2420 return getNode(Opcode, VT, Ops, 5);
Chris Lattner9fadb4c2005-07-10 00:29:18 +00002421}
2422
Rafael Espindola5c0d6ed2007-10-19 10:41:11 +00002423SDOperand SelectionDAG::getMemcpy(SDOperand Chain, SDOperand Dest,
2424 SDOperand Src, SDOperand Size,
2425 SDOperand Align,
2426 SDOperand AlwaysInline) {
2427 SDOperand Ops[] = { Chain, Dest, Src, Size, Align, AlwaysInline };
2428 return getNode(ISD::MEMCPY, MVT::Other, Ops, 6);
2429}
2430
2431SDOperand SelectionDAG::getMemmove(SDOperand Chain, SDOperand Dest,
2432 SDOperand Src, SDOperand Size,
2433 SDOperand Align,
2434 SDOperand AlwaysInline) {
2435 SDOperand Ops[] = { Chain, Dest, Src, Size, Align, AlwaysInline };
2436 return getNode(ISD::MEMMOVE, MVT::Other, Ops, 6);
2437}
2438
2439SDOperand SelectionDAG::getMemset(SDOperand Chain, SDOperand Dest,
2440 SDOperand Src, SDOperand Size,
2441 SDOperand Align,
2442 SDOperand AlwaysInline) {
2443 SDOperand Ops[] = { Chain, Dest, Src, Size, Align, AlwaysInline };
2444 return getNode(ISD::MEMSET, MVT::Other, Ops, 6);
2445}
2446
Andrew Lenharthab0b9492008-02-21 06:45:13 +00002447SDOperand SelectionDAG::getAtomic(unsigned Opcode, SDOperand Chain,
Andrew Lenharthc1c7bd62008-02-21 16:11:38 +00002448 SDOperand Ptr, SDOperand Cmp,
2449 SDOperand Swp, MVT::ValueType VT) {
Andrew Lenharthab0b9492008-02-21 06:45:13 +00002450 assert(Opcode == ISD::ATOMIC_LCS && "Invalid Atomic Op");
Andrew Lenharthc1c7bd62008-02-21 16:11:38 +00002451 assert(Cmp.getValueType() == Swp.getValueType() && "Invalid Atomic Op Types");
2452 SDVTList VTs = getVTList(Cmp.getValueType(), MVT::Other);
Andrew Lenharthab0b9492008-02-21 06:45:13 +00002453 FoldingSetNodeID ID;
Andrew Lenharthc1c7bd62008-02-21 16:11:38 +00002454 SDOperand Ops[] = {Chain, Ptr, Cmp, Swp};
Andrew Lenharthab0b9492008-02-21 06:45:13 +00002455 AddNodeIDNode(ID, Opcode, VTs, Ops, 4);
2456 ID.AddInteger((unsigned int)VT);
2457 void* IP = 0;
2458 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2459 return SDOperand(E, 0);
Andrew Lenharthc1c7bd62008-02-21 16:11:38 +00002460 SDNode* N = new AtomicSDNode(Opcode, VTs, Chain, Ptr, Cmp, Swp, VT);
Andrew Lenharthab0b9492008-02-21 06:45:13 +00002461 CSEMap.InsertNode(N, IP);
2462 AllNodes.push_back(N);
2463 return SDOperand(N, 0);
2464}
2465
2466SDOperand SelectionDAG::getAtomic(unsigned Opcode, SDOperand Chain,
Andrew Lenharthc1c7bd62008-02-21 16:11:38 +00002467 SDOperand Ptr, SDOperand Val,
Andrew Lenharthab0b9492008-02-21 06:45:13 +00002468 MVT::ValueType VT) {
2469 assert((Opcode == ISD::ATOMIC_LAS || Opcode == ISD::ATOMIC_SWAP)
2470 && "Invalid Atomic Op");
Andrew Lenharthc1c7bd62008-02-21 16:11:38 +00002471 SDVTList VTs = getVTList(Val.getValueType(), MVT::Other);
Andrew Lenharthab0b9492008-02-21 06:45:13 +00002472 FoldingSetNodeID ID;
Andrew Lenharthc1c7bd62008-02-21 16:11:38 +00002473 SDOperand Ops[] = {Chain, Ptr, Val};
Andrew Lenharthab0b9492008-02-21 06:45:13 +00002474 AddNodeIDNode(ID, Opcode, VTs, Ops, 3);
2475 ID.AddInteger((unsigned int)VT);
2476 void* IP = 0;
2477 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2478 return SDOperand(E, 0);
Andrew Lenharthc1c7bd62008-02-21 16:11:38 +00002479 SDNode* N = new AtomicSDNode(Opcode, VTs, Chain, Ptr, Val, VT);
Andrew Lenharthab0b9492008-02-21 06:45:13 +00002480 CSEMap.InsertNode(N, IP);
2481 AllNodes.push_back(N);
2482 return SDOperand(N, 0);
2483}
2484
Evan Cheng7038daf2005-12-10 00:37:58 +00002485SDOperand SelectionDAG::getLoad(MVT::ValueType VT,
2486 SDOperand Chain, SDOperand Ptr,
Evan Cheng466685d2006-10-09 20:57:25 +00002487 const Value *SV, int SVOffset,
Christopher Lamb95c218a2007-04-22 23:15:30 +00002488 bool isVolatile, unsigned Alignment) {
Dan Gohman575e2f42007-06-04 15:49:41 +00002489 if (Alignment == 0) { // Ensure that codegen never sees alignment 0
2490 const Type *Ty = 0;
Dan Gohman7f321562007-06-25 16:23:39 +00002491 if (VT != MVT::iPTR) {
Dan Gohman575e2f42007-06-04 15:49:41 +00002492 Ty = MVT::getTypeForValueType(VT);
2493 } else if (SV) {
2494 const PointerType *PT = dyn_cast<PointerType>(SV->getType());
2495 assert(PT && "Value for load must be a pointer");
2496 Ty = PT->getElementType();
2497 }
2498 assert(Ty && "Could not get type information for load");
2499 Alignment = TLI.getTargetData()->getABITypeAlignment(Ty);
2500 }
Chris Lattner0b3e5252006-08-15 19:11:05 +00002501 SDVTList VTs = getVTList(VT, MVT::Other);
Evan Cheng8b2794a2006-10-13 21:14:26 +00002502 SDOperand Undef = getNode(ISD::UNDEF, Ptr.getValueType());
Chris Lattner63e3f142007-02-04 07:28:00 +00002503 SDOperand Ops[] = { Chain, Ptr, Undef };
Jim Laskey583bd472006-10-27 23:46:08 +00002504 FoldingSetNodeID ID;
Chris Lattner63e3f142007-02-04 07:28:00 +00002505 AddNodeIDNode(ID, ISD::LOAD, VTs, Ops, 3);
Evan Cheng466685d2006-10-09 20:57:25 +00002506 ID.AddInteger(ISD::UNINDEXED);
2507 ID.AddInteger(ISD::NON_EXTLOAD);
Chris Lattner3d6992f2007-09-13 06:09:48 +00002508 ID.AddInteger((unsigned int)VT);
Evan Cheng466685d2006-10-09 20:57:25 +00002509 ID.AddInteger(Alignment);
2510 ID.AddInteger(isVolatile);
Chris Lattnera5682852006-08-07 23:03:03 +00002511 void *IP = 0;
2512 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2513 return SDOperand(E, 0);
Chris Lattnerab4ed592007-02-04 07:37:24 +00002514 SDNode *N = new LoadSDNode(Ops, VTs, ISD::UNINDEXED,
Evan Cheng8b2794a2006-10-13 21:14:26 +00002515 ISD::NON_EXTLOAD, VT, SV, SVOffset, Alignment,
2516 isVolatile);
Evan Cheng466685d2006-10-09 20:57:25 +00002517 CSEMap.InsertNode(N, IP);
2518 AllNodes.push_back(N);
2519 return SDOperand(N, 0);
2520}
2521
2522SDOperand SelectionDAG::getExtLoad(ISD::LoadExtType ExtType, MVT::ValueType VT,
Chris Lattnerfea997a2007-02-01 04:55:59 +00002523 SDOperand Chain, SDOperand Ptr,
2524 const Value *SV,
Evan Cheng466685d2006-10-09 20:57:25 +00002525 int SVOffset, MVT::ValueType EVT,
Christopher Lamb95c218a2007-04-22 23:15:30 +00002526 bool isVolatile, unsigned Alignment) {
Evan Cheng466685d2006-10-09 20:57:25 +00002527 // If they are asking for an extending load from/to the same thing, return a
2528 // normal load.
2529 if (VT == EVT)
Duncan Sands5d868b12007-10-19 13:05:40 +00002530 return getLoad(VT, Chain, Ptr, SV, SVOffset, isVolatile, Alignment);
Evan Cheng466685d2006-10-09 20:57:25 +00002531
2532 if (MVT::isVector(VT))
Dan Gohman51eaa862007-06-14 22:58:02 +00002533 assert(EVT == MVT::getVectorElementType(VT) && "Invalid vector extload!");
Evan Cheng466685d2006-10-09 20:57:25 +00002534 else
Duncan Sandsaf47b112007-10-16 09:56:48 +00002535 assert(MVT::getSizeInBits(EVT) < MVT::getSizeInBits(VT) &&
2536 "Should only be an extending load, not truncating!");
Evan Cheng466685d2006-10-09 20:57:25 +00002537 assert((ExtType == ISD::EXTLOAD || MVT::isInteger(VT)) &&
2538 "Cannot sign/zero extend a FP/Vector load!");
2539 assert(MVT::isInteger(VT) == MVT::isInteger(EVT) &&
2540 "Cannot convert from FP to Int or Int -> FP!");
2541
Dan Gohman575e2f42007-06-04 15:49:41 +00002542 if (Alignment == 0) { // Ensure that codegen never sees alignment 0
2543 const Type *Ty = 0;
Dan Gohman7f321562007-06-25 16:23:39 +00002544 if (VT != MVT::iPTR) {
Dan Gohman575e2f42007-06-04 15:49:41 +00002545 Ty = MVT::getTypeForValueType(VT);
2546 } else if (SV) {
2547 const PointerType *PT = dyn_cast<PointerType>(SV->getType());
2548 assert(PT && "Value for load must be a pointer");
2549 Ty = PT->getElementType();
2550 }
2551 assert(Ty && "Could not get type information for load");
2552 Alignment = TLI.getTargetData()->getABITypeAlignment(Ty);
2553 }
Evan Cheng466685d2006-10-09 20:57:25 +00002554 SDVTList VTs = getVTList(VT, MVT::Other);
Evan Cheng8b2794a2006-10-13 21:14:26 +00002555 SDOperand Undef = getNode(ISD::UNDEF, Ptr.getValueType());
Chris Lattner63e3f142007-02-04 07:28:00 +00002556 SDOperand Ops[] = { Chain, Ptr, Undef };
Jim Laskey583bd472006-10-27 23:46:08 +00002557 FoldingSetNodeID ID;
Chris Lattner63e3f142007-02-04 07:28:00 +00002558 AddNodeIDNode(ID, ISD::LOAD, VTs, Ops, 3);
Evan Cheng466685d2006-10-09 20:57:25 +00002559 ID.AddInteger(ISD::UNINDEXED);
2560 ID.AddInteger(ExtType);
Chris Lattner3d6992f2007-09-13 06:09:48 +00002561 ID.AddInteger((unsigned int)EVT);
Evan Cheng466685d2006-10-09 20:57:25 +00002562 ID.AddInteger(Alignment);
2563 ID.AddInteger(isVolatile);
2564 void *IP = 0;
2565 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2566 return SDOperand(E, 0);
Chris Lattnerab4ed592007-02-04 07:37:24 +00002567 SDNode *N = new LoadSDNode(Ops, VTs, ISD::UNINDEXED, ExtType, EVT,
Evan Cheng8b2794a2006-10-13 21:14:26 +00002568 SV, SVOffset, Alignment, isVolatile);
Chris Lattnera5682852006-08-07 23:03:03 +00002569 CSEMap.InsertNode(N, IP);
Evan Cheng7038daf2005-12-10 00:37:58 +00002570 AllNodes.push_back(N);
2571 return SDOperand(N, 0);
2572}
2573
Evan Cheng144d8f02006-11-09 17:55:04 +00002574SDOperand
2575SelectionDAG::getIndexedLoad(SDOperand OrigLoad, SDOperand Base,
2576 SDOperand Offset, ISD::MemIndexedMode AM) {
Evan Cheng2caccca2006-10-17 21:14:32 +00002577 LoadSDNode *LD = cast<LoadSDNode>(OrigLoad);
Evan Cheng5270cf12006-10-26 21:53:40 +00002578 assert(LD->getOffset().getOpcode() == ISD::UNDEF &&
2579 "Load is already a indexed load!");
Evan Cheng2caccca2006-10-17 21:14:32 +00002580 MVT::ValueType VT = OrigLoad.getValueType();
Evan Cheng5270cf12006-10-26 21:53:40 +00002581 SDVTList VTs = getVTList(VT, Base.getValueType(), MVT::Other);
Chris Lattner63e3f142007-02-04 07:28:00 +00002582 SDOperand Ops[] = { LD->getChain(), Base, Offset };
Jim Laskey583bd472006-10-27 23:46:08 +00002583 FoldingSetNodeID ID;
Chris Lattner63e3f142007-02-04 07:28:00 +00002584 AddNodeIDNode(ID, ISD::LOAD, VTs, Ops, 3);
Evan Cheng2caccca2006-10-17 21:14:32 +00002585 ID.AddInteger(AM);
2586 ID.AddInteger(LD->getExtensionType());
Dan Gohmanb625f2f2008-01-30 00:15:11 +00002587 ID.AddInteger((unsigned int)(LD->getMemoryVT()));
Evan Cheng2caccca2006-10-17 21:14:32 +00002588 ID.AddInteger(LD->getAlignment());
2589 ID.AddInteger(LD->isVolatile());
2590 void *IP = 0;
2591 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2592 return SDOperand(E, 0);
Chris Lattnerab4ed592007-02-04 07:37:24 +00002593 SDNode *N = new LoadSDNode(Ops, VTs, AM,
Dan Gohmanb625f2f2008-01-30 00:15:11 +00002594 LD->getExtensionType(), LD->getMemoryVT(),
Evan Cheng2caccca2006-10-17 21:14:32 +00002595 LD->getSrcValue(), LD->getSrcValueOffset(),
2596 LD->getAlignment(), LD->isVolatile());
Evan Cheng2caccca2006-10-17 21:14:32 +00002597 CSEMap.InsertNode(N, IP);
2598 AllNodes.push_back(N);
2599 return SDOperand(N, 0);
2600}
2601
Jeff Cohend41b30d2006-11-05 19:31:28 +00002602SDOperand SelectionDAG::getStore(SDOperand Chain, SDOperand Val,
Evan Cheng8b2794a2006-10-13 21:14:26 +00002603 SDOperand Ptr, const Value *SV, int SVOffset,
Christopher Lamb95c218a2007-04-22 23:15:30 +00002604 bool isVolatile, unsigned Alignment) {
Jeff Cohend41b30d2006-11-05 19:31:28 +00002605 MVT::ValueType VT = Val.getValueType();
Evan Cheng8b2794a2006-10-13 21:14:26 +00002606
Dan Gohman575e2f42007-06-04 15:49:41 +00002607 if (Alignment == 0) { // Ensure that codegen never sees alignment 0
2608 const Type *Ty = 0;
Dan Gohman7f321562007-06-25 16:23:39 +00002609 if (VT != MVT::iPTR) {
Dan Gohman575e2f42007-06-04 15:49:41 +00002610 Ty = MVT::getTypeForValueType(VT);
2611 } else if (SV) {
2612 const PointerType *PT = dyn_cast<PointerType>(SV->getType());
2613 assert(PT && "Value for store must be a pointer");
2614 Ty = PT->getElementType();
2615 }
2616 assert(Ty && "Could not get type information for store");
2617 Alignment = TLI.getTargetData()->getABITypeAlignment(Ty);
2618 }
Evan Chengad071e12006-10-05 22:57:11 +00002619 SDVTList VTs = getVTList(MVT::Other);
Evan Cheng8b2794a2006-10-13 21:14:26 +00002620 SDOperand Undef = getNode(ISD::UNDEF, Ptr.getValueType());
Jeff Cohend41b30d2006-11-05 19:31:28 +00002621 SDOperand Ops[] = { Chain, Val, Ptr, Undef };
Jim Laskey583bd472006-10-27 23:46:08 +00002622 FoldingSetNodeID ID;
2623 AddNodeIDNode(ID, ISD::STORE, VTs, Ops, 4);
Evan Cheng8b2794a2006-10-13 21:14:26 +00002624 ID.AddInteger(ISD::UNINDEXED);
2625 ID.AddInteger(false);
Chris Lattner3d6992f2007-09-13 06:09:48 +00002626 ID.AddInteger((unsigned int)VT);
Evan Cheng8b2794a2006-10-13 21:14:26 +00002627 ID.AddInteger(Alignment);
2628 ID.AddInteger(isVolatile);
Evan Chengad071e12006-10-05 22:57:11 +00002629 void *IP = 0;
2630 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2631 return SDOperand(E, 0);
Chris Lattnerab4ed592007-02-04 07:37:24 +00002632 SDNode *N = new StoreSDNode(Ops, VTs, ISD::UNINDEXED, false,
Evan Cheng8b2794a2006-10-13 21:14:26 +00002633 VT, SV, SVOffset, Alignment, isVolatile);
Evan Cheng8b2794a2006-10-13 21:14:26 +00002634 CSEMap.InsertNode(N, IP);
2635 AllNodes.push_back(N);
2636 return SDOperand(N, 0);
2637}
2638
Jeff Cohend41b30d2006-11-05 19:31:28 +00002639SDOperand SelectionDAG::getTruncStore(SDOperand Chain, SDOperand Val,
Evan Cheng8b2794a2006-10-13 21:14:26 +00002640 SDOperand Ptr, const Value *SV,
2641 int SVOffset, MVT::ValueType SVT,
Christopher Lamb95c218a2007-04-22 23:15:30 +00002642 bool isVolatile, unsigned Alignment) {
Jeff Cohend41b30d2006-11-05 19:31:28 +00002643 MVT::ValueType VT = Val.getValueType();
Duncan Sandsba3b1d12007-10-30 12:40:58 +00002644
2645 if (VT == SVT)
2646 return getStore(Chain, Val, Ptr, SV, SVOffset, isVolatile, Alignment);
Evan Cheng8b2794a2006-10-13 21:14:26 +00002647
Duncan Sandsaf47b112007-10-16 09:56:48 +00002648 assert(MVT::getSizeInBits(VT) > MVT::getSizeInBits(SVT) &&
2649 "Not a truncation?");
Evan Cheng8b2794a2006-10-13 21:14:26 +00002650 assert(MVT::isInteger(VT) == MVT::isInteger(SVT) &&
2651 "Can't do FP-INT conversion!");
2652
Dan Gohman575e2f42007-06-04 15:49:41 +00002653 if (Alignment == 0) { // Ensure that codegen never sees alignment 0
2654 const Type *Ty = 0;
Dan Gohman7f321562007-06-25 16:23:39 +00002655 if (VT != MVT::iPTR) {
Dan Gohman575e2f42007-06-04 15:49:41 +00002656 Ty = MVT::getTypeForValueType(VT);
2657 } else if (SV) {
2658 const PointerType *PT = dyn_cast<PointerType>(SV->getType());
2659 assert(PT && "Value for store must be a pointer");
2660 Ty = PT->getElementType();
2661 }
2662 assert(Ty && "Could not get type information for store");
2663 Alignment = TLI.getTargetData()->getABITypeAlignment(Ty);
2664 }
Evan Cheng8b2794a2006-10-13 21:14:26 +00002665 SDVTList VTs = getVTList(MVT::Other);
2666 SDOperand Undef = getNode(ISD::UNDEF, Ptr.getValueType());
Jeff Cohend41b30d2006-11-05 19:31:28 +00002667 SDOperand Ops[] = { Chain, Val, Ptr, Undef };
Jim Laskey583bd472006-10-27 23:46:08 +00002668 FoldingSetNodeID ID;
2669 AddNodeIDNode(ID, ISD::STORE, VTs, Ops, 4);
Evan Cheng8b2794a2006-10-13 21:14:26 +00002670 ID.AddInteger(ISD::UNINDEXED);
Duncan Sandsba3b1d12007-10-30 12:40:58 +00002671 ID.AddInteger(1);
Chris Lattner3d6992f2007-09-13 06:09:48 +00002672 ID.AddInteger((unsigned int)SVT);
Evan Cheng8b2794a2006-10-13 21:14:26 +00002673 ID.AddInteger(Alignment);
2674 ID.AddInteger(isVolatile);
2675 void *IP = 0;
2676 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2677 return SDOperand(E, 0);
Duncan Sandsba3b1d12007-10-30 12:40:58 +00002678 SDNode *N = new StoreSDNode(Ops, VTs, ISD::UNINDEXED, true,
Evan Cheng8b2794a2006-10-13 21:14:26 +00002679 SVT, SV, SVOffset, Alignment, isVolatile);
Evan Chengad071e12006-10-05 22:57:11 +00002680 CSEMap.InsertNode(N, IP);
2681 AllNodes.push_back(N);
2682 return SDOperand(N, 0);
2683}
2684
Evan Cheng144d8f02006-11-09 17:55:04 +00002685SDOperand
2686SelectionDAG::getIndexedStore(SDOperand OrigStore, SDOperand Base,
2687 SDOperand Offset, ISD::MemIndexedMode AM) {
Evan Cheng9109fb12006-11-05 09:30:09 +00002688 StoreSDNode *ST = cast<StoreSDNode>(OrigStore);
2689 assert(ST->getOffset().getOpcode() == ISD::UNDEF &&
2690 "Store is already a indexed store!");
2691 SDVTList VTs = getVTList(Base.getValueType(), MVT::Other);
2692 SDOperand Ops[] = { ST->getChain(), ST->getValue(), Base, Offset };
2693 FoldingSetNodeID ID;
2694 AddNodeIDNode(ID, ISD::STORE, VTs, Ops, 4);
2695 ID.AddInteger(AM);
2696 ID.AddInteger(ST->isTruncatingStore());
Dan Gohmanb625f2f2008-01-30 00:15:11 +00002697 ID.AddInteger((unsigned int)(ST->getMemoryVT()));
Evan Cheng9109fb12006-11-05 09:30:09 +00002698 ID.AddInteger(ST->getAlignment());
2699 ID.AddInteger(ST->isVolatile());
2700 void *IP = 0;
2701 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2702 return SDOperand(E, 0);
Chris Lattnerab4ed592007-02-04 07:37:24 +00002703 SDNode *N = new StoreSDNode(Ops, VTs, AM,
Dan Gohmanb625f2f2008-01-30 00:15:11 +00002704 ST->isTruncatingStore(), ST->getMemoryVT(),
Evan Cheng9109fb12006-11-05 09:30:09 +00002705 ST->getSrcValue(), ST->getSrcValueOffset(),
2706 ST->getAlignment(), ST->isVolatile());
Evan Cheng9109fb12006-11-05 09:30:09 +00002707 CSEMap.InsertNode(N, IP);
2708 AllNodes.push_back(N);
2709 return SDOperand(N, 0);
2710}
2711
Nate Begemanacc398c2006-01-25 18:21:52 +00002712SDOperand SelectionDAG::getVAArg(MVT::ValueType VT,
2713 SDOperand Chain, SDOperand Ptr,
2714 SDOperand SV) {
Chris Lattnerbd564bf2006-08-08 02:23:42 +00002715 SDOperand Ops[] = { Chain, Ptr, SV };
Chris Lattnerbe384162006-08-16 22:57:46 +00002716 return getNode(ISD::VAARG, getVTList(VT, MVT::Other), Ops, 3);
Nate Begemanacc398c2006-01-25 18:21:52 +00002717}
2718
Andrew Lenharth2d86ea22005-04-27 20:10:01 +00002719SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
Chris Lattnerf06f35e2006-08-08 01:09:31 +00002720 const SDOperand *Ops, unsigned NumOps) {
2721 switch (NumOps) {
Chris Lattnerc3aae252005-01-07 07:46:32 +00002722 case 0: return getNode(Opcode, VT);
Chris Lattner89c34632005-05-14 06:20:26 +00002723 case 1: return getNode(Opcode, VT, Ops[0]);
2724 case 2: return getNode(Opcode, VT, Ops[0], Ops[1]);
2725 case 3: return getNode(Opcode, VT, Ops[0], Ops[1], Ops[2]);
Chris Lattneref847df2005-04-09 03:27:28 +00002726 default: break;
Chris Lattnerc3aae252005-01-07 07:46:32 +00002727 }
Chris Lattnerde202b32005-11-09 23:47:37 +00002728
Chris Lattneref847df2005-04-09 03:27:28 +00002729 switch (Opcode) {
2730 default: break;
Chris Lattner7b2880c2005-08-24 22:44:39 +00002731 case ISD::SELECT_CC: {
Chris Lattnerf06f35e2006-08-08 01:09:31 +00002732 assert(NumOps == 5 && "SELECT_CC takes 5 operands!");
Chris Lattner7b2880c2005-08-24 22:44:39 +00002733 assert(Ops[0].getValueType() == Ops[1].getValueType() &&
2734 "LHS and RHS of condition must have same type!");
2735 assert(Ops[2].getValueType() == Ops[3].getValueType() &&
2736 "True and False arms of SelectCC must have same type!");
2737 assert(Ops[2].getValueType() == VT &&
2738 "select_cc node must be of same type as true and false value!");
Chris Lattner7b2880c2005-08-24 22:44:39 +00002739 break;
2740 }
2741 case ISD::BR_CC: {
Chris Lattnerf06f35e2006-08-08 01:09:31 +00002742 assert(NumOps == 5 && "BR_CC takes 5 operands!");
Chris Lattner7b2880c2005-08-24 22:44:39 +00002743 assert(Ops[2].getValueType() == Ops[3].getValueType() &&
2744 "LHS/RHS of comparison should match types!");
Chris Lattner7b2880c2005-08-24 22:44:39 +00002745 break;
2746 }
Chris Lattneref847df2005-04-09 03:27:28 +00002747 }
2748
Chris Lattner385328c2005-05-14 07:42:29 +00002749 // Memoize nodes.
Chris Lattner43247a12005-08-25 19:12:10 +00002750 SDNode *N;
Chris Lattner0b3e5252006-08-15 19:11:05 +00002751 SDVTList VTs = getVTList(VT);
Chris Lattner43247a12005-08-25 19:12:10 +00002752 if (VT != MVT::Flag) {
Jim Laskey583bd472006-10-27 23:46:08 +00002753 FoldingSetNodeID ID;
2754 AddNodeIDNode(ID, Opcode, VTs, Ops, NumOps);
Chris Lattnera5682852006-08-07 23:03:03 +00002755 void *IP = 0;
2756 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2757 return SDOperand(E, 0);
Chris Lattnerab4ed592007-02-04 07:37:24 +00002758 N = new SDNode(Opcode, VTs, Ops, NumOps);
Chris Lattnera5682852006-08-07 23:03:03 +00002759 CSEMap.InsertNode(N, IP);
Chris Lattner43247a12005-08-25 19:12:10 +00002760 } else {
Chris Lattnerab4ed592007-02-04 07:37:24 +00002761 N = new SDNode(Opcode, VTs, Ops, NumOps);
Chris Lattner43247a12005-08-25 19:12:10 +00002762 }
Chris Lattneref847df2005-04-09 03:27:28 +00002763 AllNodes.push_back(N);
2764 return SDOperand(N, 0);
Chris Lattnerc3aae252005-01-07 07:46:32 +00002765}
2766
Chris Lattner89c34632005-05-14 06:20:26 +00002767SDOperand SelectionDAG::getNode(unsigned Opcode,
2768 std::vector<MVT::ValueType> &ResultTys,
Chris Lattnerf06f35e2006-08-08 01:09:31 +00002769 const SDOperand *Ops, unsigned NumOps) {
Chris Lattner2fa6d3b2006-08-14 23:31:51 +00002770 return getNode(Opcode, getNodeValueTypes(ResultTys), ResultTys.size(),
2771 Ops, NumOps);
2772}
2773
2774SDOperand SelectionDAG::getNode(unsigned Opcode,
2775 const MVT::ValueType *VTs, unsigned NumVTs,
2776 const SDOperand *Ops, unsigned NumOps) {
2777 if (NumVTs == 1)
2778 return getNode(Opcode, VTs[0], Ops, NumOps);
Chris Lattnerbe384162006-08-16 22:57:46 +00002779 return getNode(Opcode, makeVTList(VTs, NumVTs), Ops, NumOps);
2780}
2781
2782SDOperand SelectionDAG::getNode(unsigned Opcode, SDVTList VTList,
2783 const SDOperand *Ops, unsigned NumOps) {
2784 if (VTList.NumVTs == 1)
2785 return getNode(Opcode, VTList.VTs[0], Ops, NumOps);
Chris Lattner89c34632005-05-14 06:20:26 +00002786
Chris Lattner5f056bf2005-07-10 01:55:33 +00002787 switch (Opcode) {
Chris Lattnere89083a2005-05-14 07:25:05 +00002788 // FIXME: figure out how to safely handle things like
2789 // int foo(int x) { return 1 << (x & 255); }
2790 // int bar() { return foo(256); }
2791#if 0
Chris Lattnere89083a2005-05-14 07:25:05 +00002792 case ISD::SRA_PARTS:
2793 case ISD::SRL_PARTS:
2794 case ISD::SHL_PARTS:
2795 if (N3.getOpcode() == ISD::SIGN_EXTEND_INREG &&
Chris Lattner15e4b012005-07-10 00:07:11 +00002796 cast<VTSDNode>(N3.getOperand(1))->getVT() != MVT::i1)
Chris Lattnere89083a2005-05-14 07:25:05 +00002797 return getNode(Opcode, VT, N1, N2, N3.getOperand(0));
2798 else if (N3.getOpcode() == ISD::AND)
2799 if (ConstantSDNode *AndRHS = dyn_cast<ConstantSDNode>(N3.getOperand(1))) {
2800 // If the and is only masking out bits that cannot effect the shift,
2801 // eliminate the and.
2802 unsigned NumBits = MVT::getSizeInBits(VT)*2;
2803 if ((AndRHS->getValue() & (NumBits-1)) == NumBits-1)
2804 return getNode(Opcode, VT, N1, N2, N3.getOperand(0));
2805 }
2806 break;
Chris Lattnere89083a2005-05-14 07:25:05 +00002807#endif
Chris Lattner5f056bf2005-07-10 01:55:33 +00002808 }
Chris Lattner89c34632005-05-14 06:20:26 +00002809
Chris Lattner43247a12005-08-25 19:12:10 +00002810 // Memoize the node unless it returns a flag.
2811 SDNode *N;
Chris Lattnerbe384162006-08-16 22:57:46 +00002812 if (VTList.VTs[VTList.NumVTs-1] != MVT::Flag) {
Jim Laskey583bd472006-10-27 23:46:08 +00002813 FoldingSetNodeID ID;
2814 AddNodeIDNode(ID, Opcode, VTList, Ops, NumOps);
Chris Lattnera5682852006-08-07 23:03:03 +00002815 void *IP = 0;
2816 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2817 return SDOperand(E, 0);
Chris Lattner3f97eb42007-02-04 08:35:21 +00002818 if (NumOps == 1)
2819 N = new UnarySDNode(Opcode, VTList, Ops[0]);
2820 else if (NumOps == 2)
2821 N = new BinarySDNode(Opcode, VTList, Ops[0], Ops[1]);
2822 else if (NumOps == 3)
2823 N = new TernarySDNode(Opcode, VTList, Ops[0], Ops[1], Ops[2]);
2824 else
2825 N = new SDNode(Opcode, VTList, Ops, NumOps);
Chris Lattnera5682852006-08-07 23:03:03 +00002826 CSEMap.InsertNode(N, IP);
Chris Lattner43247a12005-08-25 19:12:10 +00002827 } else {
Chris Lattner3f97eb42007-02-04 08:35:21 +00002828 if (NumOps == 1)
2829 N = new UnarySDNode(Opcode, VTList, Ops[0]);
2830 else if (NumOps == 2)
2831 N = new BinarySDNode(Opcode, VTList, Ops[0], Ops[1]);
2832 else if (NumOps == 3)
2833 N = new TernarySDNode(Opcode, VTList, Ops[0], Ops[1], Ops[2]);
2834 else
2835 N = new SDNode(Opcode, VTList, Ops, NumOps);
Chris Lattner43247a12005-08-25 19:12:10 +00002836 }
Chris Lattner5fa4fa42005-05-14 06:42:57 +00002837 AllNodes.push_back(N);
Chris Lattner89c34632005-05-14 06:20:26 +00002838 return SDOperand(N, 0);
2839}
2840
Dan Gohman08ce9762007-10-08 15:49:58 +00002841SDOperand SelectionDAG::getNode(unsigned Opcode, SDVTList VTList) {
2842 return getNode(Opcode, VTList, 0, 0);
2843}
2844
2845SDOperand SelectionDAG::getNode(unsigned Opcode, SDVTList VTList,
2846 SDOperand N1) {
2847 SDOperand Ops[] = { N1 };
2848 return getNode(Opcode, VTList, Ops, 1);
2849}
2850
2851SDOperand SelectionDAG::getNode(unsigned Opcode, SDVTList VTList,
2852 SDOperand N1, SDOperand N2) {
2853 SDOperand Ops[] = { N1, N2 };
2854 return getNode(Opcode, VTList, Ops, 2);
2855}
2856
2857SDOperand SelectionDAG::getNode(unsigned Opcode, SDVTList VTList,
2858 SDOperand N1, SDOperand N2, SDOperand N3) {
2859 SDOperand Ops[] = { N1, N2, N3 };
2860 return getNode(Opcode, VTList, Ops, 3);
2861}
2862
2863SDOperand SelectionDAG::getNode(unsigned Opcode, SDVTList VTList,
2864 SDOperand N1, SDOperand N2, SDOperand N3,
2865 SDOperand N4) {
2866 SDOperand Ops[] = { N1, N2, N3, N4 };
2867 return getNode(Opcode, VTList, Ops, 4);
2868}
2869
2870SDOperand SelectionDAG::getNode(unsigned Opcode, SDVTList VTList,
2871 SDOperand N1, SDOperand N2, SDOperand N3,
2872 SDOperand N4, SDOperand N5) {
2873 SDOperand Ops[] = { N1, N2, N3, N4, N5 };
2874 return getNode(Opcode, VTList, Ops, 5);
2875}
2876
Chris Lattner70046e92006-08-15 17:46:01 +00002877SDVTList SelectionDAG::getVTList(MVT::ValueType VT) {
Duncan Sandsaf47b112007-10-16 09:56:48 +00002878 return makeVTList(SDNode::getValueTypeList(VT), 1);
Chris Lattnera3255112005-11-08 23:30:28 +00002879}
2880
Chris Lattner70046e92006-08-15 17:46:01 +00002881SDVTList SelectionDAG::getVTList(MVT::ValueType VT1, MVT::ValueType VT2) {
Chris Lattnera3255112005-11-08 23:30:28 +00002882 for (std::list<std::vector<MVT::ValueType> >::iterator I = VTList.begin(),
2883 E = VTList.end(); I != E; ++I) {
Chris Lattnera5682852006-08-07 23:03:03 +00002884 if (I->size() == 2 && (*I)[0] == VT1 && (*I)[1] == VT2)
Chris Lattner70046e92006-08-15 17:46:01 +00002885 return makeVTList(&(*I)[0], 2);
Chris Lattnera3255112005-11-08 23:30:28 +00002886 }
2887 std::vector<MVT::ValueType> V;
2888 V.push_back(VT1);
2889 V.push_back(VT2);
2890 VTList.push_front(V);
Chris Lattner70046e92006-08-15 17:46:01 +00002891 return makeVTList(&(*VTList.begin())[0], 2);
Chris Lattnera3255112005-11-08 23:30:28 +00002892}
Chris Lattner70046e92006-08-15 17:46:01 +00002893SDVTList SelectionDAG::getVTList(MVT::ValueType VT1, MVT::ValueType VT2,
2894 MVT::ValueType VT3) {
Chris Lattner2fa6d3b2006-08-14 23:31:51 +00002895 for (std::list<std::vector<MVT::ValueType> >::iterator I = VTList.begin(),
Chris Lattner70046e92006-08-15 17:46:01 +00002896 E = VTList.end(); I != E; ++I) {
2897 if (I->size() == 3 && (*I)[0] == VT1 && (*I)[1] == VT2 &&
2898 (*I)[2] == VT3)
2899 return makeVTList(&(*I)[0], 3);
2900 }
Chris Lattner2fa6d3b2006-08-14 23:31:51 +00002901 std::vector<MVT::ValueType> V;
2902 V.push_back(VT1);
2903 V.push_back(VT2);
2904 V.push_back(VT3);
2905 VTList.push_front(V);
Chris Lattner70046e92006-08-15 17:46:01 +00002906 return makeVTList(&(*VTList.begin())[0], 3);
2907}
2908
2909SDVTList SelectionDAG::getVTList(const MVT::ValueType *VTs, unsigned NumVTs) {
2910 switch (NumVTs) {
2911 case 0: assert(0 && "Cannot have nodes without results!");
Dan Gohman7f321562007-06-25 16:23:39 +00002912 case 1: return getVTList(VTs[0]);
Chris Lattner70046e92006-08-15 17:46:01 +00002913 case 2: return getVTList(VTs[0], VTs[1]);
2914 case 3: return getVTList(VTs[0], VTs[1], VTs[2]);
2915 default: break;
2916 }
2917
2918 for (std::list<std::vector<MVT::ValueType> >::iterator I = VTList.begin(),
2919 E = VTList.end(); I != E; ++I) {
2920 if (I->size() != NumVTs || VTs[0] != (*I)[0] || VTs[1] != (*I)[1]) continue;
2921
2922 bool NoMatch = false;
2923 for (unsigned i = 2; i != NumVTs; ++i)
2924 if (VTs[i] != (*I)[i]) {
2925 NoMatch = true;
2926 break;
2927 }
2928 if (!NoMatch)
2929 return makeVTList(&*I->begin(), NumVTs);
2930 }
2931
2932 VTList.push_front(std::vector<MVT::ValueType>(VTs, VTs+NumVTs));
2933 return makeVTList(&*VTList.begin()->begin(), NumVTs);
Chris Lattner2fa6d3b2006-08-14 23:31:51 +00002934}
2935
2936
Chris Lattnerdf6eb302006-01-28 09:32:45 +00002937/// UpdateNodeOperands - *Mutate* the specified node in-place to have the
2938/// specified operands. If the resultant node already exists in the DAG,
2939/// this does not modify the specified node, instead it returns the node that
2940/// already exists. If the resultant node does not exist in the DAG, the
2941/// input node is returned. As a degenerate case, if you specify the same
2942/// input operands as the node already has, the input node is returned.
2943SDOperand SelectionDAG::
2944UpdateNodeOperands(SDOperand InN, SDOperand Op) {
2945 SDNode *N = InN.Val;
2946 assert(N->getNumOperands() == 1 && "Update with wrong number of operands");
2947
2948 // Check to see if there is no change.
2949 if (Op == N->getOperand(0)) return InN;
2950
2951 // See if the modified node already exists.
Chris Lattnera5682852006-08-07 23:03:03 +00002952 void *InsertPos = 0;
2953 if (SDNode *Existing = FindModifiedNodeSlot(N, Op, InsertPos))
2954 return SDOperand(Existing, InN.ResNo);
Chris Lattnerdf6eb302006-01-28 09:32:45 +00002955
2956 // Nope it doesn't. Remove the node from it's current place in the maps.
Chris Lattnera5682852006-08-07 23:03:03 +00002957 if (InsertPos)
Chris Lattnerdf6eb302006-01-28 09:32:45 +00002958 RemoveNodeFromCSEMaps(N);
2959
2960 // Now we update the operands.
2961 N->OperandList[0].Val->removeUser(N);
2962 Op.Val->addUser(N);
2963 N->OperandList[0] = Op;
2964
2965 // If this gets put into a CSE map, add it.
Chris Lattnera5682852006-08-07 23:03:03 +00002966 if (InsertPos) CSEMap.InsertNode(N, InsertPos);
Chris Lattnerdf6eb302006-01-28 09:32:45 +00002967 return InN;
2968}
2969
2970SDOperand SelectionDAG::
2971UpdateNodeOperands(SDOperand InN, SDOperand Op1, SDOperand Op2) {
2972 SDNode *N = InN.Val;
2973 assert(N->getNumOperands() == 2 && "Update with wrong number of operands");
2974
2975 // Check to see if there is no change.
Chris Lattnerdf6eb302006-01-28 09:32:45 +00002976 if (Op1 == N->getOperand(0) && Op2 == N->getOperand(1))
2977 return InN; // No operands changed, just return the input node.
2978
2979 // See if the modified node already exists.
Chris Lattnera5682852006-08-07 23:03:03 +00002980 void *InsertPos = 0;
2981 if (SDNode *Existing = FindModifiedNodeSlot(N, Op1, Op2, InsertPos))
2982 return SDOperand(Existing, InN.ResNo);
Chris Lattnerdf6eb302006-01-28 09:32:45 +00002983
2984 // Nope it doesn't. Remove the node from it's current place in the maps.
Chris Lattnera5682852006-08-07 23:03:03 +00002985 if (InsertPos)
Chris Lattnerdf6eb302006-01-28 09:32:45 +00002986 RemoveNodeFromCSEMaps(N);
2987
2988 // Now we update the operands.
2989 if (N->OperandList[0] != Op1) {
2990 N->OperandList[0].Val->removeUser(N);
2991 Op1.Val->addUser(N);
2992 N->OperandList[0] = Op1;
2993 }
2994 if (N->OperandList[1] != Op2) {
2995 N->OperandList[1].Val->removeUser(N);
2996 Op2.Val->addUser(N);
2997 N->OperandList[1] = Op2;
2998 }
2999
3000 // If this gets put into a CSE map, add it.
Chris Lattnera5682852006-08-07 23:03:03 +00003001 if (InsertPos) CSEMap.InsertNode(N, InsertPos);
Chris Lattnerdf6eb302006-01-28 09:32:45 +00003002 return InN;
3003}
3004
3005SDOperand SelectionDAG::
3006UpdateNodeOperands(SDOperand N, SDOperand Op1, SDOperand Op2, SDOperand Op3) {
Chris Lattnerf06f35e2006-08-08 01:09:31 +00003007 SDOperand Ops[] = { Op1, Op2, Op3 };
3008 return UpdateNodeOperands(N, Ops, 3);
Chris Lattnerdf6eb302006-01-28 09:32:45 +00003009}
3010
3011SDOperand SelectionDAG::
3012UpdateNodeOperands(SDOperand N, SDOperand Op1, SDOperand Op2,
3013 SDOperand Op3, SDOperand Op4) {
Chris Lattnerf06f35e2006-08-08 01:09:31 +00003014 SDOperand Ops[] = { Op1, Op2, Op3, Op4 };
3015 return UpdateNodeOperands(N, Ops, 4);
Chris Lattnerdf6eb302006-01-28 09:32:45 +00003016}
3017
3018SDOperand SelectionDAG::
Chris Lattner809ec112006-01-28 10:09:25 +00003019UpdateNodeOperands(SDOperand N, SDOperand Op1, SDOperand Op2,
3020 SDOperand Op3, SDOperand Op4, SDOperand Op5) {
Chris Lattnerf06f35e2006-08-08 01:09:31 +00003021 SDOperand Ops[] = { Op1, Op2, Op3, Op4, Op5 };
3022 return UpdateNodeOperands(N, Ops, 5);
Chris Lattner809ec112006-01-28 10:09:25 +00003023}
3024
3025
3026SDOperand SelectionDAG::
Chris Lattnerf06f35e2006-08-08 01:09:31 +00003027UpdateNodeOperands(SDOperand InN, SDOperand *Ops, unsigned NumOps) {
Chris Lattnerdf6eb302006-01-28 09:32:45 +00003028 SDNode *N = InN.Val;
Chris Lattnerf06f35e2006-08-08 01:09:31 +00003029 assert(N->getNumOperands() == NumOps &&
Chris Lattnerdf6eb302006-01-28 09:32:45 +00003030 "Update with wrong number of operands");
3031
3032 // Check to see if there is no change.
Chris Lattnerdf6eb302006-01-28 09:32:45 +00003033 bool AnyChange = false;
3034 for (unsigned i = 0; i != NumOps; ++i) {
3035 if (Ops[i] != N->getOperand(i)) {
3036 AnyChange = true;
3037 break;
3038 }
3039 }
3040
3041 // No operands changed, just return the input node.
3042 if (!AnyChange) return InN;
3043
3044 // See if the modified node already exists.
Chris Lattnera5682852006-08-07 23:03:03 +00003045 void *InsertPos = 0;
Chris Lattnerf06f35e2006-08-08 01:09:31 +00003046 if (SDNode *Existing = FindModifiedNodeSlot(N, Ops, NumOps, InsertPos))
Chris Lattnera5682852006-08-07 23:03:03 +00003047 return SDOperand(Existing, InN.ResNo);
Chris Lattnerdf6eb302006-01-28 09:32:45 +00003048
3049 // Nope it doesn't. Remove the node from it's current place in the maps.
Chris Lattnera5682852006-08-07 23:03:03 +00003050 if (InsertPos)
Chris Lattnerdf6eb302006-01-28 09:32:45 +00003051 RemoveNodeFromCSEMaps(N);
3052
3053 // Now we update the operands.
3054 for (unsigned i = 0; i != NumOps; ++i) {
3055 if (N->OperandList[i] != Ops[i]) {
3056 N->OperandList[i].Val->removeUser(N);
3057 Ops[i].Val->addUser(N);
3058 N->OperandList[i] = Ops[i];
3059 }
3060 }
3061
3062 // If this gets put into a CSE map, add it.
Chris Lattnera5682852006-08-07 23:03:03 +00003063 if (InsertPos) CSEMap.InsertNode(N, InsertPos);
Chris Lattnerdf6eb302006-01-28 09:32:45 +00003064 return InN;
3065}
3066
3067
Chris Lattnerd429bcd2007-02-04 02:49:29 +00003068/// MorphNodeTo - This frees the operands of the current node, resets the
3069/// opcode, types, and operands to the specified value. This should only be
3070/// used by the SelectionDAG class.
3071void SDNode::MorphNodeTo(unsigned Opc, SDVTList L,
3072 const SDOperand *Ops, unsigned NumOps) {
3073 NodeType = Opc;
3074 ValueList = L.VTs;
3075 NumValues = L.NumVTs;
3076
3077 // Clear the operands list, updating used nodes to remove this from their
3078 // use list.
3079 for (op_iterator I = op_begin(), E = op_end(); I != E; ++I)
3080 I->Val->removeUser(this);
Chris Lattner63e3f142007-02-04 07:28:00 +00003081
3082 // If NumOps is larger than the # of operands we currently have, reallocate
3083 // the operand list.
3084 if (NumOps > NumOperands) {
3085 if (OperandsNeedDelete)
3086 delete [] OperandList;
3087 OperandList = new SDOperand[NumOps];
3088 OperandsNeedDelete = true;
3089 }
Chris Lattnerd429bcd2007-02-04 02:49:29 +00003090
3091 // Assign the new operands.
3092 NumOperands = NumOps;
Chris Lattnerd429bcd2007-02-04 02:49:29 +00003093
3094 for (unsigned i = 0, e = NumOps; i != e; ++i) {
3095 OperandList[i] = Ops[i];
3096 SDNode *N = OperandList[i].Val;
3097 N->Uses.push_back(this);
3098 }
3099}
Chris Lattner149c58c2005-08-16 18:17:10 +00003100
3101/// SelectNodeTo - These are used for target selectors to *mutate* the
3102/// specified node to have the specified return type, Target opcode, and
3103/// operands. Note that target opcodes are stored as
3104/// ISD::BUILTIN_OP_END+TargetOpcode in the node opcode field.
Chris Lattnerc5e6c642005-12-01 18:00:57 +00003105///
3106/// Note that SelectNodeTo returns the resultant node. If there is already a
3107/// node of the specified opcode and operands, it returns that node instead of
3108/// the current one.
Evan Cheng95514ba2006-08-26 08:00:10 +00003109SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
3110 MVT::ValueType VT) {
Chris Lattner0b3e5252006-08-15 19:11:05 +00003111 SDVTList VTs = getVTList(VT);
Jim Laskey583bd472006-10-27 23:46:08 +00003112 FoldingSetNodeID ID;
Chris Lattner63e3f142007-02-04 07:28:00 +00003113 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, 0, 0);
Chris Lattner4a283e92006-08-11 18:38:11 +00003114 void *IP = 0;
3115 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
Evan Cheng95514ba2006-08-26 08:00:10 +00003116 return ON;
Chris Lattner4a283e92006-08-11 18:38:11 +00003117
Chris Lattner7651fa42005-08-24 23:00:29 +00003118 RemoveNodeFromCSEMaps(N);
Chris Lattnerc5e6c642005-12-01 18:00:57 +00003119
Chris Lattnerd429bcd2007-02-04 02:49:29 +00003120 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, 0, 0);
Chris Lattnerc5e6c642005-12-01 18:00:57 +00003121
Chris Lattner4a283e92006-08-11 18:38:11 +00003122 CSEMap.InsertNode(N, IP);
Evan Cheng95514ba2006-08-26 08:00:10 +00003123 return N;
Chris Lattner7651fa42005-08-24 23:00:29 +00003124}
Chris Lattner0fb094f2005-11-19 01:44:53 +00003125
Evan Cheng95514ba2006-08-26 08:00:10 +00003126SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
3127 MVT::ValueType VT, SDOperand Op1) {
Chris Lattnerc5e6c642005-12-01 18:00:57 +00003128 // If an identical node already exists, use it.
Chris Lattner0b3e5252006-08-15 19:11:05 +00003129 SDVTList VTs = getVTList(VT);
Chris Lattner63e3f142007-02-04 07:28:00 +00003130 SDOperand Ops[] = { Op1 };
3131
Jim Laskey583bd472006-10-27 23:46:08 +00003132 FoldingSetNodeID ID;
Chris Lattner63e3f142007-02-04 07:28:00 +00003133 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 1);
Chris Lattnera5682852006-08-07 23:03:03 +00003134 void *IP = 0;
3135 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
Evan Cheng95514ba2006-08-26 08:00:10 +00003136 return ON;
Chris Lattnera5682852006-08-07 23:03:03 +00003137
Chris Lattner149c58c2005-08-16 18:17:10 +00003138 RemoveNodeFromCSEMaps(N);
Chris Lattner63e3f142007-02-04 07:28:00 +00003139 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 1);
Chris Lattnera5682852006-08-07 23:03:03 +00003140 CSEMap.InsertNode(N, IP);
Evan Cheng95514ba2006-08-26 08:00:10 +00003141 return N;
Chris Lattner149c58c2005-08-16 18:17:10 +00003142}
Chris Lattner0fb094f2005-11-19 01:44:53 +00003143
Evan Cheng95514ba2006-08-26 08:00:10 +00003144SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
3145 MVT::ValueType VT, SDOperand Op1,
3146 SDOperand Op2) {
Chris Lattnerc5e6c642005-12-01 18:00:57 +00003147 // If an identical node already exists, use it.
Chris Lattner0b3e5252006-08-15 19:11:05 +00003148 SDVTList VTs = getVTList(VT);
Chris Lattner63e3f142007-02-04 07:28:00 +00003149 SDOperand Ops[] = { Op1, Op2 };
3150
Jim Laskey583bd472006-10-27 23:46:08 +00003151 FoldingSetNodeID ID;
Chris Lattner63e3f142007-02-04 07:28:00 +00003152 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 2);
Chris Lattnera5682852006-08-07 23:03:03 +00003153 void *IP = 0;
3154 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
Evan Cheng95514ba2006-08-26 08:00:10 +00003155 return ON;
Chris Lattnera5682852006-08-07 23:03:03 +00003156
Chris Lattner149c58c2005-08-16 18:17:10 +00003157 RemoveNodeFromCSEMaps(N);
Chris Lattner67612a12007-02-04 02:32:44 +00003158
Chris Lattner63e3f142007-02-04 07:28:00 +00003159 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 2);
Chris Lattnerc5e6c642005-12-01 18:00:57 +00003160
Chris Lattnera5682852006-08-07 23:03:03 +00003161 CSEMap.InsertNode(N, IP); // Memoize the new node.
Evan Cheng95514ba2006-08-26 08:00:10 +00003162 return N;
Chris Lattner149c58c2005-08-16 18:17:10 +00003163}
Chris Lattner0fb094f2005-11-19 01:44:53 +00003164
Evan Cheng95514ba2006-08-26 08:00:10 +00003165SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
3166 MVT::ValueType VT, SDOperand Op1,
3167 SDOperand Op2, SDOperand Op3) {
Chris Lattnerc5e6c642005-12-01 18:00:57 +00003168 // If an identical node already exists, use it.
Chris Lattner0b3e5252006-08-15 19:11:05 +00003169 SDVTList VTs = getVTList(VT);
Chris Lattner63e3f142007-02-04 07:28:00 +00003170 SDOperand Ops[] = { Op1, Op2, Op3 };
Jim Laskey583bd472006-10-27 23:46:08 +00003171 FoldingSetNodeID ID;
Chris Lattner63e3f142007-02-04 07:28:00 +00003172 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 3);
Chris Lattnera5682852006-08-07 23:03:03 +00003173 void *IP = 0;
3174 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
Evan Cheng95514ba2006-08-26 08:00:10 +00003175 return ON;
Chris Lattnera5682852006-08-07 23:03:03 +00003176
Chris Lattner149c58c2005-08-16 18:17:10 +00003177 RemoveNodeFromCSEMaps(N);
Chris Lattner67612a12007-02-04 02:32:44 +00003178
Chris Lattner63e3f142007-02-04 07:28:00 +00003179 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 3);
Chris Lattnerc5e6c642005-12-01 18:00:57 +00003180
Chris Lattnera5682852006-08-07 23:03:03 +00003181 CSEMap.InsertNode(N, IP); // Memoize the new node.
Evan Cheng95514ba2006-08-26 08:00:10 +00003182 return N;
Chris Lattner149c58c2005-08-16 18:17:10 +00003183}
Chris Lattnerc975e1d2005-08-21 22:30:30 +00003184
Evan Cheng95514ba2006-08-26 08:00:10 +00003185SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
Evan Cheng694481e2006-08-27 08:08:54 +00003186 MVT::ValueType VT, const SDOperand *Ops,
3187 unsigned NumOps) {
Chris Lattnerc5e6c642005-12-01 18:00:57 +00003188 // If an identical node already exists, use it.
Chris Lattner0b3e5252006-08-15 19:11:05 +00003189 SDVTList VTs = getVTList(VT);
Jim Laskey583bd472006-10-27 23:46:08 +00003190 FoldingSetNodeID ID;
3191 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, NumOps);
Chris Lattnera5682852006-08-07 23:03:03 +00003192 void *IP = 0;
3193 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
Evan Cheng95514ba2006-08-26 08:00:10 +00003194 return ON;
Chris Lattnera5682852006-08-07 23:03:03 +00003195
Chris Lattner6b09a292005-08-21 18:49:33 +00003196 RemoveNodeFromCSEMaps(N);
Chris Lattnerd429bcd2007-02-04 02:49:29 +00003197 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, NumOps);
Andrew Lenharth7cf11b42006-01-23 21:51:14 +00003198
Chris Lattnera5682852006-08-07 23:03:03 +00003199 CSEMap.InsertNode(N, IP); // Memoize the new node.
Evan Cheng95514ba2006-08-26 08:00:10 +00003200 return N;
Andrew Lenharth7cf11b42006-01-23 21:51:14 +00003201}
Andrew Lenharth8c6f1ee2006-01-23 20:59:12 +00003202
Evan Cheng95514ba2006-08-26 08:00:10 +00003203SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
3204 MVT::ValueType VT1, MVT::ValueType VT2,
3205 SDOperand Op1, SDOperand Op2) {
Chris Lattner0b3e5252006-08-15 19:11:05 +00003206 SDVTList VTs = getVTList(VT1, VT2);
Jim Laskey583bd472006-10-27 23:46:08 +00003207 FoldingSetNodeID ID;
Chris Lattner63e3f142007-02-04 07:28:00 +00003208 SDOperand Ops[] = { Op1, Op2 };
3209 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 2);
Chris Lattnera5682852006-08-07 23:03:03 +00003210 void *IP = 0;
3211 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
Evan Cheng95514ba2006-08-26 08:00:10 +00003212 return ON;
Chris Lattnerc5e6c642005-12-01 18:00:57 +00003213
Chris Lattner0fb094f2005-11-19 01:44:53 +00003214 RemoveNodeFromCSEMaps(N);
Chris Lattner63e3f142007-02-04 07:28:00 +00003215 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 2);
Chris Lattnera5682852006-08-07 23:03:03 +00003216 CSEMap.InsertNode(N, IP); // Memoize the new node.
Evan Cheng95514ba2006-08-26 08:00:10 +00003217 return N;
Chris Lattner0fb094f2005-11-19 01:44:53 +00003218}
3219
Evan Cheng95514ba2006-08-26 08:00:10 +00003220SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
3221 MVT::ValueType VT1, MVT::ValueType VT2,
3222 SDOperand Op1, SDOperand Op2,
3223 SDOperand Op3) {
Chris Lattnerc5e6c642005-12-01 18:00:57 +00003224 // If an identical node already exists, use it.
Chris Lattner0b3e5252006-08-15 19:11:05 +00003225 SDVTList VTs = getVTList(VT1, VT2);
Chris Lattner63e3f142007-02-04 07:28:00 +00003226 SDOperand Ops[] = { Op1, Op2, Op3 };
Jim Laskey583bd472006-10-27 23:46:08 +00003227 FoldingSetNodeID ID;
Chris Lattner63e3f142007-02-04 07:28:00 +00003228 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 3);
Chris Lattnera5682852006-08-07 23:03:03 +00003229 void *IP = 0;
3230 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
Evan Cheng95514ba2006-08-26 08:00:10 +00003231 return ON;
Chris Lattnerc5e6c642005-12-01 18:00:57 +00003232
Chris Lattner0fb094f2005-11-19 01:44:53 +00003233 RemoveNodeFromCSEMaps(N);
Chris Lattner67612a12007-02-04 02:32:44 +00003234
Chris Lattner63e3f142007-02-04 07:28:00 +00003235 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 3);
Chris Lattnera5682852006-08-07 23:03:03 +00003236 CSEMap.InsertNode(N, IP); // Memoize the new node.
Evan Cheng95514ba2006-08-26 08:00:10 +00003237 return N;
Chris Lattner0fb094f2005-11-19 01:44:53 +00003238}
3239
Chris Lattner0fb094f2005-11-19 01:44:53 +00003240
Evan Cheng6ae46c42006-02-09 07:15:23 +00003241/// getTargetNode - These are used for target selectors to create a new node
3242/// with specified return type(s), target opcode, and operands.
3243///
3244/// Note that getTargetNode returns the resultant node. If there is already a
3245/// node of the specified opcode and operands, it returns that node instead of
3246/// the current one.
3247SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT) {
3248 return getNode(ISD::BUILTIN_OP_END+Opcode, VT).Val;
3249}
3250SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
3251 SDOperand Op1) {
3252 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Op1).Val;
3253}
3254SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
3255 SDOperand Op1, SDOperand Op2) {
3256 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Op1, Op2).Val;
3257}
3258SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
Chris Lattnerfea997a2007-02-01 04:55:59 +00003259 SDOperand Op1, SDOperand Op2,
3260 SDOperand Op3) {
Evan Cheng6ae46c42006-02-09 07:15:23 +00003261 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Op1, Op2, Op3).Val;
3262}
3263SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
Chris Lattnerbd564bf2006-08-08 02:23:42 +00003264 const SDOperand *Ops, unsigned NumOps) {
3265 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Ops, NumOps).Val;
Evan Cheng6ae46c42006-02-09 07:15:23 +00003266}
3267SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
Dale Johannesen6eaeff22007-10-10 01:01:31 +00003268 MVT::ValueType VT2) {
3269 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2);
3270 SDOperand Op;
3271 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 2, &Op, 0).Val;
3272}
3273SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
Evan Cheng6ae46c42006-02-09 07:15:23 +00003274 MVT::ValueType VT2, SDOperand Op1) {
Chris Lattner70046e92006-08-15 17:46:01 +00003275 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2);
Chris Lattner2fa6d3b2006-08-14 23:31:51 +00003276 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 2, &Op1, 1).Val;
Evan Cheng6ae46c42006-02-09 07:15:23 +00003277}
3278SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
Chris Lattnera5682852006-08-07 23:03:03 +00003279 MVT::ValueType VT2, SDOperand Op1,
3280 SDOperand Op2) {
Chris Lattner70046e92006-08-15 17:46:01 +00003281 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2);
Chris Lattnerbd564bf2006-08-08 02:23:42 +00003282 SDOperand Ops[] = { Op1, Op2 };
Chris Lattner2fa6d3b2006-08-14 23:31:51 +00003283 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 2, Ops, 2).Val;
Evan Cheng6ae46c42006-02-09 07:15:23 +00003284}
3285SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
Chris Lattnera5682852006-08-07 23:03:03 +00003286 MVT::ValueType VT2, SDOperand Op1,
3287 SDOperand Op2, SDOperand Op3) {
Chris Lattner70046e92006-08-15 17:46:01 +00003288 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2);
Chris Lattnerbd564bf2006-08-08 02:23:42 +00003289 SDOperand Ops[] = { Op1, Op2, Op3 };
Chris Lattner2fa6d3b2006-08-14 23:31:51 +00003290 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 2, Ops, 3).Val;
Evan Cheng6ae46c42006-02-09 07:15:23 +00003291}
Evan Cheng694481e2006-08-27 08:08:54 +00003292SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
3293 MVT::ValueType VT2,
3294 const SDOperand *Ops, unsigned NumOps) {
Chris Lattner70046e92006-08-15 17:46:01 +00003295 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2);
Evan Cheng694481e2006-08-27 08:08:54 +00003296 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 2, Ops, NumOps).Val;
Evan Cheng6ae46c42006-02-09 07:15:23 +00003297}
3298SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
3299 MVT::ValueType VT2, MVT::ValueType VT3,
3300 SDOperand Op1, SDOperand Op2) {
Chris Lattner70046e92006-08-15 17:46:01 +00003301 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2, VT3);
Chris Lattnerbd564bf2006-08-08 02:23:42 +00003302 SDOperand Ops[] = { Op1, Op2 };
Chris Lattner2fa6d3b2006-08-14 23:31:51 +00003303 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 3, Ops, 2).Val;
Evan Cheng6ae46c42006-02-09 07:15:23 +00003304}
Lauro Ramos Venanciob3a04172007-04-20 21:38:10 +00003305SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
3306 MVT::ValueType VT2, MVT::ValueType VT3,
3307 SDOperand Op1, SDOperand Op2,
3308 SDOperand Op3) {
3309 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2, VT3);
3310 SDOperand Ops[] = { Op1, Op2, Op3 };
3311 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 3, Ops, 3).Val;
3312}
Evan Cheng6ae46c42006-02-09 07:15:23 +00003313SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
Evan Cheng694481e2006-08-27 08:08:54 +00003314 MVT::ValueType VT2, MVT::ValueType VT3,
Chris Lattnerbd564bf2006-08-08 02:23:42 +00003315 const SDOperand *Ops, unsigned NumOps) {
Evan Cheng694481e2006-08-27 08:08:54 +00003316 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2, VT3);
3317 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 3, Ops, NumOps).Val;
Evan Cheng6ae46c42006-02-09 07:15:23 +00003318}
Evan Cheng05e69c12007-09-12 23:39:49 +00003319SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
3320 MVT::ValueType VT2, MVT::ValueType VT3,
3321 MVT::ValueType VT4,
3322 const SDOperand *Ops, unsigned NumOps) {
3323 std::vector<MVT::ValueType> VTList;
3324 VTList.push_back(VT1);
3325 VTList.push_back(VT2);
3326 VTList.push_back(VT3);
3327 VTList.push_back(VT4);
3328 const MVT::ValueType *VTs = getNodeValueTypes(VTList);
3329 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 4, Ops, NumOps).Val;
3330}
Evan Cheng39305cf2007-10-05 01:10:49 +00003331SDNode *SelectionDAG::getTargetNode(unsigned Opcode,
3332 std::vector<MVT::ValueType> &ResultTys,
3333 const SDOperand *Ops, unsigned NumOps) {
3334 const MVT::ValueType *VTs = getNodeValueTypes(ResultTys);
3335 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, ResultTys.size(),
3336 Ops, NumOps).Val;
3337}
Evan Cheng6ae46c42006-02-09 07:15:23 +00003338
Chris Lattnerf8dc0612008-02-03 06:49:24 +00003339
Evan Cheng99157a02006-08-07 22:13:29 +00003340/// ReplaceAllUsesWith - Modify anything using 'From' to use 'To' instead.
Chris Lattner8b8749f2005-08-17 19:00:20 +00003341/// This can cause recursive merging of nodes in the DAG.
3342///
Chris Lattner11d049c2008-02-03 03:35:22 +00003343/// This version assumes From has a single result value.
Chris Lattner8b52f212005-08-26 18:36:28 +00003344///
Chris Lattner11d049c2008-02-03 03:35:22 +00003345void SelectionDAG::ReplaceAllUsesWith(SDOperand FromN, SDOperand To,
Chris Lattnerf8dc0612008-02-03 06:49:24 +00003346 DAGUpdateListener *UpdateListener) {
Chris Lattner11d049c2008-02-03 03:35:22 +00003347 SDNode *From = FromN.Val;
Chris Lattner11d049c2008-02-03 03:35:22 +00003348 assert(From->getNumValues() == 1 && FromN.ResNo == 0 &&
Chris Lattner8b52f212005-08-26 18:36:28 +00003349 "Cannot replace with this method!");
Chris Lattner11d049c2008-02-03 03:35:22 +00003350 assert(From != To.Val && "Cannot replace uses of with self");
Chris Lattner8b52f212005-08-26 18:36:28 +00003351
Chris Lattner8b8749f2005-08-17 19:00:20 +00003352 while (!From->use_empty()) {
3353 // Process users until they are all gone.
3354 SDNode *U = *From->use_begin();
3355
3356 // This node is about to morph, remove its old self from the CSE maps.
3357 RemoveNodeFromCSEMaps(U);
3358
Chris Lattner65113b22005-11-08 22:07:03 +00003359 for (SDOperand *I = U->OperandList, *E = U->OperandList+U->NumOperands;
3360 I != E; ++I)
3361 if (I->Val == From) {
Chris Lattner8b52f212005-08-26 18:36:28 +00003362 From->removeUser(U);
Chris Lattner11d049c2008-02-03 03:35:22 +00003363 *I = To;
3364 To.Val->addUser(U);
Chris Lattner8b52f212005-08-26 18:36:28 +00003365 }
3366
3367 // Now that we have modified U, add it back to the CSE maps. If it already
3368 // exists there, recursively merge the results together.
Chris Lattner1e111c72005-09-07 05:37:01 +00003369 if (SDNode *Existing = AddNonLeafNodeToCSEMaps(U)) {
Chris Lattnerf8dc0612008-02-03 06:49:24 +00003370 ReplaceAllUsesWith(U, Existing, UpdateListener);
3371 // U is now dead. Inform the listener if it exists and delete it.
3372 if (UpdateListener)
3373 UpdateListener->NodeDeleted(U);
Chris Lattner1e111c72005-09-07 05:37:01 +00003374 DeleteNodeNotInCSEMaps(U);
Chris Lattnerf8dc0612008-02-03 06:49:24 +00003375 } else {
3376 // If the node doesn't already exist, we updated it. Inform a listener if
3377 // it exists.
3378 if (UpdateListener)
3379 UpdateListener->NodeUpdated(U);
Chris Lattner1e111c72005-09-07 05:37:01 +00003380 }
Chris Lattner8b52f212005-08-26 18:36:28 +00003381 }
3382}
3383
3384/// ReplaceAllUsesWith - Modify anything using 'From' to use 'To' instead.
3385/// This can cause recursive merging of nodes in the DAG.
3386///
3387/// This version assumes From/To have matching types and numbers of result
3388/// values.
3389///
Chris Lattner1e111c72005-09-07 05:37:01 +00003390void SelectionDAG::ReplaceAllUsesWith(SDNode *From, SDNode *To,
Chris Lattnerf8dc0612008-02-03 06:49:24 +00003391 DAGUpdateListener *UpdateListener) {
Chris Lattner8b52f212005-08-26 18:36:28 +00003392 assert(From != To && "Cannot replace uses of with self");
3393 assert(From->getNumValues() == To->getNumValues() &&
3394 "Cannot use this version of ReplaceAllUsesWith!");
Chris Lattner11d049c2008-02-03 03:35:22 +00003395 if (From->getNumValues() == 1) // If possible, use the faster version.
Chris Lattnerf8dc0612008-02-03 06:49:24 +00003396 return ReplaceAllUsesWith(SDOperand(From, 0), SDOperand(To, 0),
3397 UpdateListener);
Chris Lattner8b52f212005-08-26 18:36:28 +00003398
3399 while (!From->use_empty()) {
3400 // Process users until they are all gone.
3401 SDNode *U = *From->use_begin();
3402
3403 // This node is about to morph, remove its old self from the CSE maps.
3404 RemoveNodeFromCSEMaps(U);
3405
Chris Lattner65113b22005-11-08 22:07:03 +00003406 for (SDOperand *I = U->OperandList, *E = U->OperandList+U->NumOperands;
3407 I != E; ++I)
3408 if (I->Val == From) {
Chris Lattner8b8749f2005-08-17 19:00:20 +00003409 From->removeUser(U);
Chris Lattner65113b22005-11-08 22:07:03 +00003410 I->Val = To;
Chris Lattner8b8749f2005-08-17 19:00:20 +00003411 To->addUser(U);
3412 }
3413
3414 // Now that we have modified U, add it back to the CSE maps. If it already
3415 // exists there, recursively merge the results together.
Chris Lattner1e111c72005-09-07 05:37:01 +00003416 if (SDNode *Existing = AddNonLeafNodeToCSEMaps(U)) {
Chris Lattnerf8dc0612008-02-03 06:49:24 +00003417 ReplaceAllUsesWith(U, Existing, UpdateListener);
3418 // U is now dead. Inform the listener if it exists and delete it.
3419 if (UpdateListener)
3420 UpdateListener->NodeDeleted(U);
Chris Lattner1e111c72005-09-07 05:37:01 +00003421 DeleteNodeNotInCSEMaps(U);
Chris Lattnerf8dc0612008-02-03 06:49:24 +00003422 } else {
3423 // If the node doesn't already exist, we updated it. Inform a listener if
3424 // it exists.
3425 if (UpdateListener)
3426 UpdateListener->NodeUpdated(U);
Chris Lattner1e111c72005-09-07 05:37:01 +00003427 }
Chris Lattner8b8749f2005-08-17 19:00:20 +00003428 }
3429}
3430
Chris Lattner8b52f212005-08-26 18:36:28 +00003431/// ReplaceAllUsesWith - Modify anything using 'From' to use 'To' instead.
3432/// This can cause recursive merging of nodes in the DAG.
3433///
3434/// This version can replace From with any result values. To must match the
3435/// number and types of values returned by From.
Chris Lattner7b2880c2005-08-24 22:44:39 +00003436void SelectionDAG::ReplaceAllUsesWith(SDNode *From,
Chris Lattnerb9ea4a32006-08-11 17:46:28 +00003437 const SDOperand *To,
Chris Lattnerf8dc0612008-02-03 06:49:24 +00003438 DAGUpdateListener *UpdateListener) {
Chris Lattner11d049c2008-02-03 03:35:22 +00003439 if (From->getNumValues() == 1) // Handle the simple case efficiently.
Chris Lattnerf8dc0612008-02-03 06:49:24 +00003440 return ReplaceAllUsesWith(SDOperand(From, 0), To[0], UpdateListener);
Chris Lattner7b2880c2005-08-24 22:44:39 +00003441
3442 while (!From->use_empty()) {
3443 // Process users until they are all gone.
3444 SDNode *U = *From->use_begin();
3445
3446 // This node is about to morph, remove its old self from the CSE maps.
3447 RemoveNodeFromCSEMaps(U);
3448
Chris Lattner65113b22005-11-08 22:07:03 +00003449 for (SDOperand *I = U->OperandList, *E = U->OperandList+U->NumOperands;
3450 I != E; ++I)
3451 if (I->Val == From) {
3452 const SDOperand &ToOp = To[I->ResNo];
Chris Lattner7b2880c2005-08-24 22:44:39 +00003453 From->removeUser(U);
Chris Lattner65113b22005-11-08 22:07:03 +00003454 *I = ToOp;
Chris Lattner7b2880c2005-08-24 22:44:39 +00003455 ToOp.Val->addUser(U);
3456 }
3457
3458 // Now that we have modified U, add it back to the CSE maps. If it already
3459 // exists there, recursively merge the results together.
Chris Lattner1e111c72005-09-07 05:37:01 +00003460 if (SDNode *Existing = AddNonLeafNodeToCSEMaps(U)) {
Chris Lattnerf8dc0612008-02-03 06:49:24 +00003461 ReplaceAllUsesWith(U, Existing, UpdateListener);
3462 // U is now dead. Inform the listener if it exists and delete it.
3463 if (UpdateListener)
3464 UpdateListener->NodeDeleted(U);
Chris Lattner1e111c72005-09-07 05:37:01 +00003465 DeleteNodeNotInCSEMaps(U);
Chris Lattnerf8dc0612008-02-03 06:49:24 +00003466 } else {
3467 // If the node doesn't already exist, we updated it. Inform a listener if
3468 // it exists.
3469 if (UpdateListener)
3470 UpdateListener->NodeUpdated(U);
Chris Lattner1e111c72005-09-07 05:37:01 +00003471 }
Chris Lattner7b2880c2005-08-24 22:44:39 +00003472 }
3473}
3474
Chris Lattnerf8dc0612008-02-03 06:49:24 +00003475namespace {
3476 /// ChainedSetUpdaterListener - This class is a DAGUpdateListener that removes
3477 /// any deleted nodes from the set passed into its constructor and recursively
3478 /// notifies another update listener if specified.
3479 class ChainedSetUpdaterListener :
3480 public SelectionDAG::DAGUpdateListener {
3481 SmallSetVector<SDNode*, 16> &Set;
3482 SelectionDAG::DAGUpdateListener *Chain;
3483 public:
3484 ChainedSetUpdaterListener(SmallSetVector<SDNode*, 16> &set,
3485 SelectionDAG::DAGUpdateListener *chain)
3486 : Set(set), Chain(chain) {}
3487
3488 virtual void NodeDeleted(SDNode *N) {
3489 Set.remove(N);
3490 if (Chain) Chain->NodeDeleted(N);
3491 }
3492 virtual void NodeUpdated(SDNode *N) {
3493 if (Chain) Chain->NodeUpdated(N);
3494 }
3495 };
3496}
3497
Chris Lattner012f2412006-02-17 21:58:01 +00003498/// ReplaceAllUsesOfValueWith - Replace any uses of From with To, leaving
3499/// uses of other values produced by From.Val alone. The Deleted vector is
Chris Lattnerf8dc0612008-02-03 06:49:24 +00003500/// handled the same way as for ReplaceAllUsesWith.
Chris Lattner012f2412006-02-17 21:58:01 +00003501void SelectionDAG::ReplaceAllUsesOfValueWith(SDOperand From, SDOperand To,
Chris Lattnerf8dc0612008-02-03 06:49:24 +00003502 DAGUpdateListener *UpdateListener){
Chris Lattner012f2412006-02-17 21:58:01 +00003503 assert(From != To && "Cannot replace a value with itself");
Chris Lattnerf8dc0612008-02-03 06:49:24 +00003504
Chris Lattner012f2412006-02-17 21:58:01 +00003505 // Handle the simple, trivial, case efficiently.
Chris Lattner11d049c2008-02-03 03:35:22 +00003506 if (From.Val->getNumValues() == 1) {
Chris Lattnerf8dc0612008-02-03 06:49:24 +00003507 ReplaceAllUsesWith(From, To, UpdateListener);
Chris Lattner012f2412006-02-17 21:58:01 +00003508 return;
3509 }
Chris Lattnerf8dc0612008-02-03 06:49:24 +00003510
3511 if (From.use_empty()) return;
3512
Chris Lattnercf5640b2007-02-04 00:14:31 +00003513 // Get all of the users of From.Val. We want these in a nice,
3514 // deterministically ordered and uniqued set, so we use a SmallSetVector.
3515 SmallSetVector<SDNode*, 16> Users(From.Val->use_begin(), From.Val->use_end());
Chris Lattner012f2412006-02-17 21:58:01 +00003516
Chris Lattnerf8dc0612008-02-03 06:49:24 +00003517 // When one of the recursive merges deletes nodes from the graph, we need to
3518 // make sure that UpdateListener is notified *and* that the node is removed
3519 // from Users if present. CSUL does this.
3520 ChainedSetUpdaterListener CSUL(Users, UpdateListener);
Chris Lattner01d029b2007-10-15 06:10:22 +00003521
Chris Lattner012f2412006-02-17 21:58:01 +00003522 while (!Users.empty()) {
3523 // We know that this user uses some value of From. If it is the right
3524 // value, update it.
3525 SDNode *User = Users.back();
3526 Users.pop_back();
3527
Chris Lattner01d029b2007-10-15 06:10:22 +00003528 // Scan for an operand that matches From.
3529 SDOperand *Op = User->OperandList, *E = User->OperandList+User->NumOperands;
3530 for (; Op != E; ++Op)
3531 if (*Op == From) break;
3532
3533 // If there are no matches, the user must use some other result of From.
3534 if (Op == E) continue;
3535
3536 // Okay, we know this user needs to be updated. Remove its old self
3537 // from the CSE maps.
3538 RemoveNodeFromCSEMaps(User);
3539
Chris Lattnerf8dc0612008-02-03 06:49:24 +00003540 // Update all operands that match "From" in case there are multiple uses.
Chris Lattner01d029b2007-10-15 06:10:22 +00003541 for (; Op != E; ++Op) {
Chris Lattner012f2412006-02-17 21:58:01 +00003542 if (*Op == From) {
Chris Lattner01d029b2007-10-15 06:10:22 +00003543 From.Val->removeUser(User);
3544 *Op = To;
3545 To.Val->addUser(User);
Chris Lattner012f2412006-02-17 21:58:01 +00003546 }
3547 }
Chris Lattner01d029b2007-10-15 06:10:22 +00003548
3549 // Now that we have modified User, add it back to the CSE maps. If it
3550 // already exists there, recursively merge the results together.
3551 SDNode *Existing = AddNonLeafNodeToCSEMaps(User);
Chris Lattnerf8dc0612008-02-03 06:49:24 +00003552 if (!Existing) {
3553 if (UpdateListener) UpdateListener->NodeUpdated(User);
3554 continue; // Continue on to next user.
3555 }
Chris Lattner01d029b2007-10-15 06:10:22 +00003556
3557 // If there was already an existing matching node, use ReplaceAllUsesWith
Chris Lattnerf8dc0612008-02-03 06:49:24 +00003558 // to replace the dead one with the existing one. This can cause
Chris Lattner01d029b2007-10-15 06:10:22 +00003559 // recursive merging of other unrelated nodes down the line. The merging
Chris Lattnerf8dc0612008-02-03 06:49:24 +00003560 // can cause deletion of nodes that used the old value. To handle this, we
3561 // use CSUL to remove them from the Users set.
3562 ReplaceAllUsesWith(User, Existing, &CSUL);
Chris Lattner01d029b2007-10-15 06:10:22 +00003563
Chris Lattnerf8dc0612008-02-03 06:49:24 +00003564 // User is now dead. Notify a listener if present.
3565 if (UpdateListener) UpdateListener->NodeDeleted(User);
Chris Lattner01d029b2007-10-15 06:10:22 +00003566 DeleteNodeNotInCSEMaps(User);
Chris Lattner012f2412006-02-17 21:58:01 +00003567 }
3568}
3569
Chris Lattner7b2880c2005-08-24 22:44:39 +00003570
Evan Chenge6f35d82006-08-01 08:20:41 +00003571/// AssignNodeIds - Assign a unique node id for each node in the DAG based on
3572/// their allnodes order. It returns the maximum id.
Evan Cheng7c16d772006-07-27 07:36:47 +00003573unsigned SelectionDAG::AssignNodeIds() {
3574 unsigned Id = 0;
Evan Cheng091cba12006-07-27 06:39:06 +00003575 for (allnodes_iterator I = allnodes_begin(), E = allnodes_end(); I != E; ++I){
3576 SDNode *N = I;
3577 N->setNodeId(Id++);
3578 }
3579 return Id;
3580}
3581
Evan Chenge6f35d82006-08-01 08:20:41 +00003582/// AssignTopologicalOrder - Assign a unique node id for each node in the DAG
Evan Chengc384d6c2006-08-02 22:00:34 +00003583/// based on their topological order. It returns the maximum id and a vector
3584/// of the SDNodes* in assigned order by reference.
3585unsigned SelectionDAG::AssignTopologicalOrder(std::vector<SDNode*> &TopOrder) {
Evan Chenge6f35d82006-08-01 08:20:41 +00003586 unsigned DAGSize = AllNodes.size();
Evan Chengc384d6c2006-08-02 22:00:34 +00003587 std::vector<unsigned> InDegree(DAGSize);
3588 std::vector<SDNode*> Sources;
3589
3590 // Use a two pass approach to avoid using a std::map which is slow.
3591 unsigned Id = 0;
Evan Chenge6f35d82006-08-01 08:20:41 +00003592 for (allnodes_iterator I = allnodes_begin(),E = allnodes_end(); I != E; ++I){
3593 SDNode *N = I;
Evan Chengc384d6c2006-08-02 22:00:34 +00003594 N->setNodeId(Id++);
Evan Chenge6f35d82006-08-01 08:20:41 +00003595 unsigned Degree = N->use_size();
Evan Chengc384d6c2006-08-02 22:00:34 +00003596 InDegree[N->getNodeId()] = Degree;
Evan Chenge6f35d82006-08-01 08:20:41 +00003597 if (Degree == 0)
Evan Chengc384d6c2006-08-02 22:00:34 +00003598 Sources.push_back(N);
Evan Chenge6f35d82006-08-01 08:20:41 +00003599 }
3600
Evan Cheng99157a02006-08-07 22:13:29 +00003601 TopOrder.clear();
Evan Chenge6f35d82006-08-01 08:20:41 +00003602 while (!Sources.empty()) {
Evan Chengc384d6c2006-08-02 22:00:34 +00003603 SDNode *N = Sources.back();
3604 Sources.pop_back();
Evan Chenge6f35d82006-08-01 08:20:41 +00003605 TopOrder.push_back(N);
Evan Chenge6f35d82006-08-01 08:20:41 +00003606 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I) {
3607 SDNode *P = I->Val;
Evan Chengc384d6c2006-08-02 22:00:34 +00003608 unsigned Degree = --InDegree[P->getNodeId()];
Evan Chenge6f35d82006-08-01 08:20:41 +00003609 if (Degree == 0)
3610 Sources.push_back(P);
Evan Chenge6f35d82006-08-01 08:20:41 +00003611 }
3612 }
3613
Evan Chengc384d6c2006-08-02 22:00:34 +00003614 // Second pass, assign the actual topological order as node ids.
3615 Id = 0;
3616 for (std::vector<SDNode*>::iterator TI = TopOrder.begin(),TE = TopOrder.end();
3617 TI != TE; ++TI)
3618 (*TI)->setNodeId(Id++);
3619
3620 return Id;
Evan Chenge6f35d82006-08-01 08:20:41 +00003621}
3622
3623
Evan Cheng091cba12006-07-27 06:39:06 +00003624
Jim Laskey58b968b2005-08-17 20:08:02 +00003625//===----------------------------------------------------------------------===//
3626// SDNode Class
3627//===----------------------------------------------------------------------===//
Chris Lattner149c58c2005-08-16 18:17:10 +00003628
Chris Lattner917d2c92006-07-19 00:00:37 +00003629// Out-of-line virtual method to give class a home.
Chris Lattnerc76e3c82007-02-04 02:23:32 +00003630void SDNode::ANCHOR() {}
Chris Lattner3f97eb42007-02-04 08:35:21 +00003631void UnarySDNode::ANCHOR() {}
3632void BinarySDNode::ANCHOR() {}
3633void TernarySDNode::ANCHOR() {}
Chris Lattnerc76e3c82007-02-04 02:23:32 +00003634void HandleSDNode::ANCHOR() {}
3635void StringSDNode::ANCHOR() {}
3636void ConstantSDNode::ANCHOR() {}
3637void ConstantFPSDNode::ANCHOR() {}
3638void GlobalAddressSDNode::ANCHOR() {}
3639void FrameIndexSDNode::ANCHOR() {}
3640void JumpTableSDNode::ANCHOR() {}
3641void ConstantPoolSDNode::ANCHOR() {}
3642void BasicBlockSDNode::ANCHOR() {}
3643void SrcValueSDNode::ANCHOR() {}
Dan Gohman69de1932008-02-06 22:27:42 +00003644void MemOperandSDNode::ANCHOR() {}
Chris Lattnerc76e3c82007-02-04 02:23:32 +00003645void RegisterSDNode::ANCHOR() {}
3646void ExternalSymbolSDNode::ANCHOR() {}
3647void CondCodeSDNode::ANCHOR() {}
3648void VTSDNode::ANCHOR() {}
3649void LoadSDNode::ANCHOR() {}
3650void StoreSDNode::ANCHOR() {}
Andrew Lenharthab0b9492008-02-21 06:45:13 +00003651void AtomicSDNode::ANCHOR() {}
Chris Lattner917d2c92006-07-19 00:00:37 +00003652
Chris Lattner48b85922007-02-04 02:41:42 +00003653HandleSDNode::~HandleSDNode() {
3654 SDVTList VTs = { 0, 0 };
Chris Lattnerd429bcd2007-02-04 02:49:29 +00003655 MorphNodeTo(ISD::HANDLENODE, VTs, 0, 0); // Drops operand uses.
Chris Lattner48b85922007-02-04 02:41:42 +00003656}
3657
Lauro Ramos Venancio2c5c1112007-04-21 20:56:26 +00003658GlobalAddressSDNode::GlobalAddressSDNode(bool isTarget, const GlobalValue *GA,
3659 MVT::ValueType VT, int o)
3660 : SDNode(isa<GlobalVariable>(GA) &&
Dan Gohman275769a2007-07-23 20:24:29 +00003661 cast<GlobalVariable>(GA)->isThreadLocal() ?
Lauro Ramos Venancio2c5c1112007-04-21 20:56:26 +00003662 // Thread Local
3663 (isTarget ? ISD::TargetGlobalTLSAddress : ISD::GlobalTLSAddress) :
3664 // Non Thread Local
3665 (isTarget ? ISD::TargetGlobalAddress : ISD::GlobalAddress),
3666 getSDVTList(VT)), Offset(o) {
3667 TheGlobal = const_cast<GlobalValue*>(GA);
3668}
Chris Lattner48b85922007-02-04 02:41:42 +00003669
Dan Gohman69de1932008-02-06 22:27:42 +00003670/// getMemOperand - Return a MemOperand object describing the memory
3671/// reference performed by this load or store.
3672MemOperand LSBaseSDNode::getMemOperand() const {
3673 int Size = (MVT::getSizeInBits(getMemoryVT()) + 7) >> 3;
3674 int Flags =
3675 getOpcode() == ISD::LOAD ? MemOperand::MOLoad : MemOperand::MOStore;
3676 if (IsVolatile) Flags |= MemOperand::MOVolatile;
3677
3678 // Check if the load references a frame index, and does not have
3679 // an SV attached.
3680 const FrameIndexSDNode *FI =
3681 dyn_cast<const FrameIndexSDNode>(getBasePtr().Val);
3682 if (!getSrcValue() && FI)
Dan Gohman3069b872008-02-07 18:41:25 +00003683 return MemOperand(PseudoSourceValue::getFixedStack(), Flags,
Dan Gohman69de1932008-02-06 22:27:42 +00003684 FI->getIndex(), Size, Alignment);
3685 else
3686 return MemOperand(getSrcValue(), Flags,
3687 getSrcValueOffset(), Size, Alignment);
3688}
3689
Jim Laskey583bd472006-10-27 23:46:08 +00003690/// Profile - Gather unique data for the node.
3691///
3692void SDNode::Profile(FoldingSetNodeID &ID) {
3693 AddNodeIDNode(ID, this);
3694}
3695
Chris Lattnera3255112005-11-08 23:30:28 +00003696/// getValueTypeList - Return a pointer to the specified value type.
3697///
Dan Gohman547ca532008-02-08 03:26:46 +00003698const MVT::ValueType *SDNode::getValueTypeList(MVT::ValueType VT) {
Duncan Sandsaf47b112007-10-16 09:56:48 +00003699 if (MVT::isExtendedVT(VT)) {
3700 static std::set<MVT::ValueType> EVTs;
Dan Gohman547ca532008-02-08 03:26:46 +00003701 return &(*EVTs.insert(VT).first);
Duncan Sandsaf47b112007-10-16 09:56:48 +00003702 } else {
3703 static MVT::ValueType VTs[MVT::LAST_VALUETYPE];
3704 VTs[VT] = VT;
3705 return &VTs[VT];
3706 }
Chris Lattnera3255112005-11-08 23:30:28 +00003707}
Duncan Sandsaf47b112007-10-16 09:56:48 +00003708
Chris Lattner5c884562005-01-12 18:37:47 +00003709/// hasNUsesOfValue - Return true if there are exactly NUSES uses of the
3710/// indicated value. This method ignores uses of other values defined by this
3711/// operation.
Evan Cheng4ee62112006-02-05 06:29:23 +00003712bool SDNode::hasNUsesOfValue(unsigned NUses, unsigned Value) const {
Chris Lattner5c884562005-01-12 18:37:47 +00003713 assert(Value < getNumValues() && "Bad value!");
3714
3715 // If there is only one value, this is easy.
3716 if (getNumValues() == 1)
3717 return use_size() == NUses;
Evan Cheng33d55952007-08-02 05:29:38 +00003718 if (use_size() < NUses) return false;
Chris Lattner5c884562005-01-12 18:37:47 +00003719
Evan Cheng4ee62112006-02-05 06:29:23 +00003720 SDOperand TheValue(const_cast<SDNode *>(this), Value);
Chris Lattner5c884562005-01-12 18:37:47 +00003721
Chris Lattnerd48c5e82007-02-04 00:24:41 +00003722 SmallPtrSet<SDNode*, 32> UsersHandled;
Chris Lattner5c884562005-01-12 18:37:47 +00003723
Chris Lattnerf83482d2006-08-16 20:59:32 +00003724 for (SDNode::use_iterator UI = Uses.begin(), E = Uses.end(); UI != E; ++UI) {
Chris Lattner5c884562005-01-12 18:37:47 +00003725 SDNode *User = *UI;
3726 if (User->getNumOperands() == 1 ||
Chris Lattnerd48c5e82007-02-04 00:24:41 +00003727 UsersHandled.insert(User)) // First time we've seen this?
Chris Lattner5c884562005-01-12 18:37:47 +00003728 for (unsigned i = 0, e = User->getNumOperands(); i != e; ++i)
3729 if (User->getOperand(i) == TheValue) {
3730 if (NUses == 0)
3731 return false; // too many uses
3732 --NUses;
3733 }
3734 }
3735
3736 // Found exactly the right number of uses?
3737 return NUses == 0;
3738}
3739
3740
Evan Cheng33d55952007-08-02 05:29:38 +00003741/// hasAnyUseOfValue - Return true if there are any use of the indicated
3742/// value. This method ignores uses of other values defined by this operation.
3743bool SDNode::hasAnyUseOfValue(unsigned Value) const {
3744 assert(Value < getNumValues() && "Bad value!");
3745
Dan Gohman30359592008-01-29 13:02:09 +00003746 if (use_empty()) return false;
Evan Cheng33d55952007-08-02 05:29:38 +00003747
3748 SDOperand TheValue(const_cast<SDNode *>(this), Value);
3749
3750 SmallPtrSet<SDNode*, 32> UsersHandled;
3751
3752 for (SDNode::use_iterator UI = Uses.begin(), E = Uses.end(); UI != E; ++UI) {
3753 SDNode *User = *UI;
3754 if (User->getNumOperands() == 1 ||
3755 UsersHandled.insert(User)) // First time we've seen this?
3756 for (unsigned i = 0, e = User->getNumOperands(); i != e; ++i)
3757 if (User->getOperand(i) == TheValue) {
3758 return true;
3759 }
3760 }
3761
3762 return false;
3763}
3764
3765
Evan Chenge6e97e62006-11-03 07:31:32 +00003766/// isOnlyUse - Return true if this node is the only use of N.
3767///
Evan Cheng4ee62112006-02-05 06:29:23 +00003768bool SDNode::isOnlyUse(SDNode *N) const {
3769 bool Seen = false;
3770 for (SDNode::use_iterator I = N->use_begin(), E = N->use_end(); I != E; ++I) {
3771 SDNode *User = *I;
3772 if (User == this)
3773 Seen = true;
3774 else
3775 return false;
3776 }
3777
3778 return Seen;
3779}
3780
Evan Chenge6e97e62006-11-03 07:31:32 +00003781/// isOperand - Return true if this node is an operand of N.
3782///
Evan Chengbfa284f2006-03-03 06:42:32 +00003783bool SDOperand::isOperand(SDNode *N) const {
3784 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
3785 if (*this == N->getOperand(i))
3786 return true;
3787 return false;
3788}
3789
Evan Cheng80d8eaa2006-03-03 06:24:54 +00003790bool SDNode::isOperand(SDNode *N) const {
3791 for (unsigned i = 0, e = N->NumOperands; i != e; ++i)
3792 if (this == N->OperandList[i].Val)
3793 return true;
3794 return false;
3795}
Evan Cheng4ee62112006-02-05 06:29:23 +00003796
Chris Lattner572dee72008-01-16 05:49:24 +00003797/// reachesChainWithoutSideEffects - Return true if this operand (which must
3798/// be a chain) reaches the specified operand without crossing any
3799/// side-effecting instructions. In practice, this looks through token
3800/// factors and non-volatile loads. In order to remain efficient, this only
3801/// looks a couple of nodes in, it does not do an exhaustive search.
3802bool SDOperand::reachesChainWithoutSideEffects(SDOperand Dest,
3803 unsigned Depth) const {
3804 if (*this == Dest) return true;
3805
3806 // Don't search too deeply, we just want to be able to see through
3807 // TokenFactor's etc.
3808 if (Depth == 0) return false;
3809
3810 // If this is a token factor, all inputs to the TF happen in parallel. If any
3811 // of the operands of the TF reach dest, then we can do the xform.
3812 if (getOpcode() == ISD::TokenFactor) {
3813 for (unsigned i = 0, e = getNumOperands(); i != e; ++i)
3814 if (getOperand(i).reachesChainWithoutSideEffects(Dest, Depth-1))
3815 return true;
3816 return false;
3817 }
3818
3819 // Loads don't have side effects, look through them.
3820 if (LoadSDNode *Ld = dyn_cast<LoadSDNode>(*this)) {
3821 if (!Ld->isVolatile())
3822 return Ld->getChain().reachesChainWithoutSideEffects(Dest, Depth-1);
3823 }
3824 return false;
3825}
3826
3827
Evan Chengc5fc57d2006-11-03 03:05:24 +00003828static void findPredecessor(SDNode *N, const SDNode *P, bool &found,
Chris Lattnerd48c5e82007-02-04 00:24:41 +00003829 SmallPtrSet<SDNode *, 32> &Visited) {
3830 if (found || !Visited.insert(N))
Evan Chengc5fc57d2006-11-03 03:05:24 +00003831 return;
3832
3833 for (unsigned i = 0, e = N->getNumOperands(); !found && i != e; ++i) {
3834 SDNode *Op = N->getOperand(i).Val;
3835 if (Op == P) {
3836 found = true;
3837 return;
3838 }
3839 findPredecessor(Op, P, found, Visited);
3840 }
3841}
3842
Evan Chenge6e97e62006-11-03 07:31:32 +00003843/// isPredecessor - Return true if this node is a predecessor of N. This node
3844/// is either an operand of N or it can be reached by recursively traversing
3845/// up the operands.
3846/// NOTE: this is an expensive method. Use it carefully.
Evan Chengc5fc57d2006-11-03 03:05:24 +00003847bool SDNode::isPredecessor(SDNode *N) const {
Chris Lattnerd48c5e82007-02-04 00:24:41 +00003848 SmallPtrSet<SDNode *, 32> Visited;
Evan Chengc5fc57d2006-11-03 03:05:24 +00003849 bool found = false;
3850 findPredecessor(N, this, found, Visited);
3851 return found;
3852}
3853
Evan Chengc5484282006-10-04 00:56:09 +00003854uint64_t SDNode::getConstantOperandVal(unsigned Num) const {
3855 assert(Num < NumOperands && "Invalid child # of SDNode!");
3856 return cast<ConstantSDNode>(OperandList[Num])->getValue();
3857}
3858
Reid Spencer577cc322007-04-01 07:32:19 +00003859std::string SDNode::getOperationName(const SelectionDAG *G) const {
Chris Lattnerd75f19f2005-01-10 23:25:25 +00003860 switch (getOpcode()) {
Chris Lattnerf3e133a2005-08-16 18:33:07 +00003861 default:
3862 if (getOpcode() < ISD::BUILTIN_OP_END)
3863 return "<<Unknown DAG Node>>";
3864 else {
Evan Cheng72261582005-12-20 06:22:03 +00003865 if (G) {
Chris Lattnerf3e133a2005-08-16 18:33:07 +00003866 if (const TargetInstrInfo *TII = G->getTarget().getInstrInfo())
Chris Lattner08addbd2005-09-09 22:35:03 +00003867 if (getOpcode()-ISD::BUILTIN_OP_END < TII->getNumOpcodes())
Chris Lattner349c4952008-01-07 03:13:06 +00003868 return TII->get(getOpcode()-ISD::BUILTIN_OP_END).getName();
Evan Cheng115c0362005-12-19 23:11:49 +00003869
Evan Cheng72261582005-12-20 06:22:03 +00003870 TargetLowering &TLI = G->getTargetLoweringInfo();
3871 const char *Name =
3872 TLI.getTargetNodeName(getOpcode());
3873 if (Name) return Name;
3874 }
3875
3876 return "<<Unknown Target Node>>";
Chris Lattnerf3e133a2005-08-16 18:33:07 +00003877 }
3878
Andrew Lenharth22c5c1b2008-02-16 01:24:58 +00003879 case ISD::MEMBARRIER: return "MemBarrier";
Andrew Lenharthab0b9492008-02-21 06:45:13 +00003880 case ISD::ATOMIC_LCS: return "AtomicLCS";
3881 case ISD::ATOMIC_LAS: return "AtomicLAS";
3882 case ISD::ATOMIC_SWAP: return "AtomicSWAP";
Andrew Lenharth95762122005-03-31 21:24:06 +00003883 case ISD::PCMARKER: return "PCMarker";
Andrew Lenharth51b8d542005-11-11 16:47:30 +00003884 case ISD::READCYCLECOUNTER: return "ReadCycleCounter";
Chris Lattner2bf3c262005-05-09 04:08:27 +00003885 case ISD::SRCVALUE: return "SrcValue";
Dan Gohman69de1932008-02-06 22:27:42 +00003886 case ISD::MEMOPERAND: return "MemOperand";
Chris Lattnerd75f19f2005-01-10 23:25:25 +00003887 case ISD::EntryToken: return "EntryToken";
Chris Lattner282c5ca2005-01-13 17:59:10 +00003888 case ISD::TokenFactor: return "TokenFactor";
Nate Begeman56eb8682005-08-30 02:44:00 +00003889 case ISD::AssertSext: return "AssertSext";
3890 case ISD::AssertZext: return "AssertZext";
Evan Cheng1ab7d852006-03-01 00:51:13 +00003891
3892 case ISD::STRING: return "String";
Chris Lattnerd75f19f2005-01-10 23:25:25 +00003893 case ISD::BasicBlock: return "BasicBlock";
Evan Cheng1ab7d852006-03-01 00:51:13 +00003894 case ISD::VALUETYPE: return "ValueType";
Chris Lattnerd5d0f9b2005-08-16 21:55:35 +00003895 case ISD::Register: return "Register";
Evan Cheng1ab7d852006-03-01 00:51:13 +00003896
3897 case ISD::Constant: return "Constant";
3898 case ISD::ConstantFP: return "ConstantFP";
3899 case ISD::GlobalAddress: return "GlobalAddress";
Lauro Ramos Venanciob3a04172007-04-20 21:38:10 +00003900 case ISD::GlobalTLSAddress: return "GlobalTLSAddress";
Evan Cheng1ab7d852006-03-01 00:51:13 +00003901 case ISD::FrameIndex: return "FrameIndex";
Nate Begeman37efe672006-04-22 18:53:45 +00003902 case ISD::JumpTable: return "JumpTable";
Andrew Lenharth82c3d8f2006-10-11 04:29:42 +00003903 case ISD::GLOBAL_OFFSET_TABLE: return "GLOBAL_OFFSET_TABLE";
Nate Begemanbcc5f362007-01-29 22:58:52 +00003904 case ISD::RETURNADDR: return "RETURNADDR";
3905 case ISD::FRAMEADDR: return "FRAMEADDR";
Anton Korobeynikov2365f512007-07-14 14:06:15 +00003906 case ISD::FRAME_TO_ARGS_OFFSET: return "FRAME_TO_ARGS_OFFSET";
Jim Laskeyb180aa12007-02-21 22:53:45 +00003907 case ISD::EXCEPTIONADDR: return "EXCEPTIONADDR";
3908 case ISD::EHSELECTION: return "EHSELECTION";
Anton Korobeynikov2365f512007-07-14 14:06:15 +00003909 case ISD::EH_RETURN: return "EH_RETURN";
Chris Lattner5839bf22005-08-26 17:15:30 +00003910 case ISD::ConstantPool: return "ConstantPool";
Evan Cheng1ab7d852006-03-01 00:51:13 +00003911 case ISD::ExternalSymbol: return "ExternalSymbol";
Chris Lattner48b61a72006-03-28 00:40:33 +00003912 case ISD::INTRINSIC_WO_CHAIN: {
3913 unsigned IID = cast<ConstantSDNode>(getOperand(0))->getValue();
3914 return Intrinsic::getName((Intrinsic::ID)IID);
3915 }
3916 case ISD::INTRINSIC_VOID:
3917 case ISD::INTRINSIC_W_CHAIN: {
3918 unsigned IID = cast<ConstantSDNode>(getOperand(1))->getValue();
Chris Lattner70a248d2006-03-27 06:45:25 +00003919 return Intrinsic::getName((Intrinsic::ID)IID);
Chris Lattner401ec7f2006-03-27 16:10:59 +00003920 }
Evan Cheng1ab7d852006-03-01 00:51:13 +00003921
Chris Lattnerb2827b02006-03-19 00:52:58 +00003922 case ISD::BUILD_VECTOR: return "BUILD_VECTOR";
Evan Cheng1ab7d852006-03-01 00:51:13 +00003923 case ISD::TargetConstant: return "TargetConstant";
3924 case ISD::TargetConstantFP:return "TargetConstantFP";
Evan Cheng1ab7d852006-03-01 00:51:13 +00003925 case ISD::TargetGlobalAddress: return "TargetGlobalAddress";
Lauro Ramos Venanciob3a04172007-04-20 21:38:10 +00003926 case ISD::TargetGlobalTLSAddress: return "TargetGlobalTLSAddress";
Evan Cheng1ab7d852006-03-01 00:51:13 +00003927 case ISD::TargetFrameIndex: return "TargetFrameIndex";
Nate Begeman37efe672006-04-22 18:53:45 +00003928 case ISD::TargetJumpTable: return "TargetJumpTable";
Chris Lattner5839bf22005-08-26 17:15:30 +00003929 case ISD::TargetConstantPool: return "TargetConstantPool";
Evan Cheng1ab7d852006-03-01 00:51:13 +00003930 case ISD::TargetExternalSymbol: return "TargetExternalSymbol";
Evan Cheng1ab7d852006-03-01 00:51:13 +00003931
Chris Lattnerd75f19f2005-01-10 23:25:25 +00003932 case ISD::CopyToReg: return "CopyToReg";
3933 case ISD::CopyFromReg: return "CopyFromReg";
Nate Begemanfc1b1da2005-04-01 22:34:39 +00003934 case ISD::UNDEF: return "undef";
Dan Gohman50b15332007-07-05 20:15:43 +00003935 case ISD::MERGE_VALUES: return "merge_values";
Chris Lattnerce7518c2006-01-26 22:24:51 +00003936 case ISD::INLINEASM: return "inlineasm";
Jim Laskey1ee29252007-01-26 14:34:52 +00003937 case ISD::LABEL: return "label";
Evan Chenga844bde2008-02-02 04:07:54 +00003938 case ISD::DECLARE: return "declare";
Evan Cheng9fda2f92006-02-03 01:33:01 +00003939 case ISD::HANDLENODE: return "handlenode";
Chris Lattnerfdfded52006-04-12 16:20:43 +00003940 case ISD::FORMAL_ARGUMENTS: return "formal_arguments";
Chris Lattnerf4ec8172006-05-16 22:53:20 +00003941 case ISD::CALL: return "call";
Chris Lattnerce7518c2006-01-26 22:24:51 +00003942
Chris Lattnerff9fd0a2005-04-02 04:58:41 +00003943 // Unary operators
3944 case ISD::FABS: return "fabs";
3945 case ISD::FNEG: return "fneg";
Chris Lattner7f644642005-04-28 21:44:03 +00003946 case ISD::FSQRT: return "fsqrt";
3947 case ISD::FSIN: return "fsin";
3948 case ISD::FCOS: return "fcos";
Chris Lattner6ddf8ed2006-09-09 06:03:30 +00003949 case ISD::FPOWI: return "fpowi";
Dan Gohman07f04fd2007-10-11 23:06:37 +00003950 case ISD::FPOW: return "fpow";
Chris Lattnerff9fd0a2005-04-02 04:58:41 +00003951
3952 // Binary operators
Chris Lattnerd75f19f2005-01-10 23:25:25 +00003953 case ISD::ADD: return "add";
3954 case ISD::SUB: return "sub";
3955 case ISD::MUL: return "mul";
Nate Begeman18670542005-04-05 22:36:56 +00003956 case ISD::MULHU: return "mulhu";
3957 case ISD::MULHS: return "mulhs";
Chris Lattnerd75f19f2005-01-10 23:25:25 +00003958 case ISD::SDIV: return "sdiv";
3959 case ISD::UDIV: return "udiv";
3960 case ISD::SREM: return "srem";
3961 case ISD::UREM: return "urem";
Dan Gohmanccd60792007-10-05 14:11:04 +00003962 case ISD::SMUL_LOHI: return "smul_lohi";
3963 case ISD::UMUL_LOHI: return "umul_lohi";
3964 case ISD::SDIVREM: return "sdivrem";
3965 case ISD::UDIVREM: return "divrem";
Chris Lattnerd75f19f2005-01-10 23:25:25 +00003966 case ISD::AND: return "and";
3967 case ISD::OR: return "or";
3968 case ISD::XOR: return "xor";
3969 case ISD::SHL: return "shl";
3970 case ISD::SRA: return "sra";
3971 case ISD::SRL: return "srl";
Nate Begeman35ef9132006-01-11 21:21:00 +00003972 case ISD::ROTL: return "rotl";
3973 case ISD::ROTR: return "rotr";
Chris Lattner01b3d732005-09-28 22:28:18 +00003974 case ISD::FADD: return "fadd";
3975 case ISD::FSUB: return "fsub";
3976 case ISD::FMUL: return "fmul";
3977 case ISD::FDIV: return "fdiv";
3978 case ISD::FREM: return "frem";
Chris Lattnera09f8482006-03-05 05:09:38 +00003979 case ISD::FCOPYSIGN: return "fcopysign";
Chris Lattnerd268a492007-12-22 21:26:52 +00003980 case ISD::FGETSIGN: return "fgetsign";
Chris Lattner0c486bd2006-03-17 19:53:59 +00003981
Chris Lattner7cf7e3f2005-08-09 20:20:18 +00003982 case ISD::SETCC: return "setcc";
3983 case ISD::SELECT: return "select";
Nate Begeman9373a812005-08-10 20:51:12 +00003984 case ISD::SELECT_CC: return "select_cc";
Chris Lattnerb22e35a2006-04-08 22:22:57 +00003985 case ISD::INSERT_VECTOR_ELT: return "insert_vector_elt";
Chris Lattnerb22e35a2006-04-08 22:22:57 +00003986 case ISD::EXTRACT_VECTOR_ELT: return "extract_vector_elt";
Dan Gohman7f321562007-06-25 16:23:39 +00003987 case ISD::CONCAT_VECTORS: return "concat_vectors";
3988 case ISD::EXTRACT_SUBVECTOR: return "extract_subvector";
Chris Lattnerb22e35a2006-04-08 22:22:57 +00003989 case ISD::SCALAR_TO_VECTOR: return "scalar_to_vector";
Chris Lattnerb22e35a2006-04-08 22:22:57 +00003990 case ISD::VECTOR_SHUFFLE: return "vector_shuffle";
Chris Lattnerb6541762007-03-04 20:40:38 +00003991 case ISD::CARRY_FALSE: return "carry_false";
Nate Begeman551bf3f2006-02-17 05:43:56 +00003992 case ISD::ADDC: return "addc";
3993 case ISD::ADDE: return "adde";
3994 case ISD::SUBC: return "subc";
3995 case ISD::SUBE: return "sube";
Chris Lattner41be9512005-04-02 03:30:42 +00003996 case ISD::SHL_PARTS: return "shl_parts";
3997 case ISD::SRA_PARTS: return "sra_parts";
3998 case ISD::SRL_PARTS: return "srl_parts";
Christopher Lamb557c3632007-07-26 07:34:40 +00003999
4000 case ISD::EXTRACT_SUBREG: return "extract_subreg";
4001 case ISD::INSERT_SUBREG: return "insert_subreg";
4002
Chris Lattner7f644642005-04-28 21:44:03 +00004003 // Conversion operators.
Chris Lattnerd75f19f2005-01-10 23:25:25 +00004004 case ISD::SIGN_EXTEND: return "sign_extend";
4005 case ISD::ZERO_EXTEND: return "zero_extend";
Chris Lattner4ed11b42005-09-02 00:17:32 +00004006 case ISD::ANY_EXTEND: return "any_extend";
Chris Lattner859157d2005-01-15 06:17:04 +00004007 case ISD::SIGN_EXTEND_INREG: return "sign_extend_inreg";
Chris Lattnerd75f19f2005-01-10 23:25:25 +00004008 case ISD::TRUNCATE: return "truncate";
4009 case ISD::FP_ROUND: return "fp_round";
Dan Gohman1a024862008-01-31 00:41:03 +00004010 case ISD::FLT_ROUNDS_: return "flt_rounds";
Chris Lattner859157d2005-01-15 06:17:04 +00004011 case ISD::FP_ROUND_INREG: return "fp_round_inreg";
Chris Lattnerd75f19f2005-01-10 23:25:25 +00004012 case ISD::FP_EXTEND: return "fp_extend";
4013
4014 case ISD::SINT_TO_FP: return "sint_to_fp";
4015 case ISD::UINT_TO_FP: return "uint_to_fp";
4016 case ISD::FP_TO_SINT: return "fp_to_sint";
4017 case ISD::FP_TO_UINT: return "fp_to_uint";
Chris Lattner35481892005-12-23 00:16:34 +00004018 case ISD::BIT_CONVERT: return "bit_convert";
Chris Lattnerd75f19f2005-01-10 23:25:25 +00004019
4020 // Control flow instructions
4021 case ISD::BR: return "br";
Nate Begeman37efe672006-04-22 18:53:45 +00004022 case ISD::BRIND: return "brind";
Evan Chengc41cd9c2006-10-30 07:59:36 +00004023 case ISD::BR_JT: return "br_jt";
Chris Lattnerd75f19f2005-01-10 23:25:25 +00004024 case ISD::BRCOND: return "brcond";
Nate Begeman81e80972006-03-17 01:40:33 +00004025 case ISD::BR_CC: return "br_cc";
Chris Lattnerd75f19f2005-01-10 23:25:25 +00004026 case ISD::RET: return "ret";
Chris Lattnera364fa12005-05-12 23:51:40 +00004027 case ISD::CALLSEQ_START: return "callseq_start";
4028 case ISD::CALLSEQ_END: return "callseq_end";
Chris Lattnerd75f19f2005-01-10 23:25:25 +00004029
4030 // Other operators
Nate Begemanacc398c2006-01-25 18:21:52 +00004031 case ISD::LOAD: return "load";
4032 case ISD::STORE: return "store";
Nate Begemanacc398c2006-01-25 18:21:52 +00004033 case ISD::VAARG: return "vaarg";
4034 case ISD::VACOPY: return "vacopy";
4035 case ISD::VAEND: return "vaend";
4036 case ISD::VASTART: return "vastart";
Chris Lattnerd75f19f2005-01-10 23:25:25 +00004037 case ISD::DYNAMIC_STACKALLOC: return "dynamic_stackalloc";
Chris Lattner5a67afc2006-01-13 02:39:42 +00004038 case ISD::EXTRACT_ELEMENT: return "extract_element";
4039 case ISD::BUILD_PAIR: return "build_pair";
4040 case ISD::STACKSAVE: return "stacksave";
4041 case ISD::STACKRESTORE: return "stackrestore";
Anton Korobeynikov66fac792008-01-15 07:02:33 +00004042 case ISD::TRAP: return "trap";
4043
Chris Lattner5a67afc2006-01-13 02:39:42 +00004044 // Block memory operations.
Chris Lattner4c633e82005-01-11 05:57:01 +00004045 case ISD::MEMSET: return "memset";
4046 case ISD::MEMCPY: return "memcpy";
4047 case ISD::MEMMOVE: return "memmove";
Chris Lattnerd75f19f2005-01-10 23:25:25 +00004048
Nate Begeman1b5db7a2006-01-16 08:07:10 +00004049 // Bit manipulation
4050 case ISD::BSWAP: return "bswap";
Chris Lattner276260b2005-05-11 04:50:30 +00004051 case ISD::CTPOP: return "ctpop";
4052 case ISD::CTTZ: return "cttz";
4053 case ISD::CTLZ: return "ctlz";
4054
Chris Lattner36ce6912005-11-29 06:21:05 +00004055 // Debug info
4056 case ISD::LOCATION: return "location";
Jim Laskeyf5395ce2005-12-16 22:45:29 +00004057 case ISD::DEBUG_LOC: return "debug_loc";
Chris Lattner36ce6912005-11-29 06:21:05 +00004058
Duncan Sands36397f52007-07-27 12:58:54 +00004059 // Trampolines
Duncan Sandsf7331b32007-09-11 14:10:23 +00004060 case ISD::TRAMPOLINE: return "trampoline";
Duncan Sands36397f52007-07-27 12:58:54 +00004061
Chris Lattner7cf7e3f2005-08-09 20:20:18 +00004062 case ISD::CONDCODE:
4063 switch (cast<CondCodeSDNode>(this)->get()) {
Chris Lattnerd75f19f2005-01-10 23:25:25 +00004064 default: assert(0 && "Unknown setcc condition!");
Chris Lattner7cf7e3f2005-08-09 20:20:18 +00004065 case ISD::SETOEQ: return "setoeq";
4066 case ISD::SETOGT: return "setogt";
4067 case ISD::SETOGE: return "setoge";
4068 case ISD::SETOLT: return "setolt";
4069 case ISD::SETOLE: return "setole";
4070 case ISD::SETONE: return "setone";
Misha Brukmanedf128a2005-04-21 22:36:52 +00004071
Chris Lattner7cf7e3f2005-08-09 20:20:18 +00004072 case ISD::SETO: return "seto";
4073 case ISD::SETUO: return "setuo";
4074 case ISD::SETUEQ: return "setue";
4075 case ISD::SETUGT: return "setugt";
4076 case ISD::SETUGE: return "setuge";
4077 case ISD::SETULT: return "setult";
4078 case ISD::SETULE: return "setule";
4079 case ISD::SETUNE: return "setune";
Misha Brukmanedf128a2005-04-21 22:36:52 +00004080
Chris Lattner7cf7e3f2005-08-09 20:20:18 +00004081 case ISD::SETEQ: return "seteq";
4082 case ISD::SETGT: return "setgt";
4083 case ISD::SETGE: return "setge";
4084 case ISD::SETLT: return "setlt";
4085 case ISD::SETLE: return "setle";
4086 case ISD::SETNE: return "setne";
Chris Lattnerd75f19f2005-01-10 23:25:25 +00004087 }
4088 }
4089}
Chris Lattnerc3aae252005-01-07 07:46:32 +00004090
Evan Cheng144d8f02006-11-09 17:55:04 +00004091const char *SDNode::getIndexedModeName(ISD::MemIndexedMode AM) {
Evan Cheng2caccca2006-10-17 21:14:32 +00004092 switch (AM) {
4093 default:
4094 return "";
4095 case ISD::PRE_INC:
4096 return "<pre-inc>";
4097 case ISD::PRE_DEC:
4098 return "<pre-dec>";
4099 case ISD::POST_INC:
4100 return "<post-inc>";
4101 case ISD::POST_DEC:
4102 return "<post-dec>";
4103 }
4104}
4105
Chris Lattnerf3e133a2005-08-16 18:33:07 +00004106void SDNode::dump() const { dump(0); }
4107void SDNode::dump(const SelectionDAG *G) const {
Bill Wendling832171c2006-12-07 20:04:42 +00004108 cerr << (void*)this << ": ";
Chris Lattnerc3aae252005-01-07 07:46:32 +00004109
4110 for (unsigned i = 0, e = getNumValues(); i != e; ++i) {
Bill Wendling832171c2006-12-07 20:04:42 +00004111 if (i) cerr << ",";
Chris Lattner4ea69242005-01-15 07:14:32 +00004112 if (getValueType(i) == MVT::Other)
Bill Wendling832171c2006-12-07 20:04:42 +00004113 cerr << "ch";
Chris Lattner4ea69242005-01-15 07:14:32 +00004114 else
Bill Wendling832171c2006-12-07 20:04:42 +00004115 cerr << MVT::getValueTypeString(getValueType(i));
Chris Lattnerc3aae252005-01-07 07:46:32 +00004116 }
Bill Wendling832171c2006-12-07 20:04:42 +00004117 cerr << " = " << getOperationName(G);
Chris Lattnerc3aae252005-01-07 07:46:32 +00004118
Bill Wendling832171c2006-12-07 20:04:42 +00004119 cerr << " ";
Chris Lattnerc3aae252005-01-07 07:46:32 +00004120 for (unsigned i = 0, e = getNumOperands(); i != e; ++i) {
Bill Wendling832171c2006-12-07 20:04:42 +00004121 if (i) cerr << ", ";
4122 cerr << (void*)getOperand(i).Val;
Chris Lattnerc3aae252005-01-07 07:46:32 +00004123 if (unsigned RN = getOperand(i).ResNo)
Bill Wendling832171c2006-12-07 20:04:42 +00004124 cerr << ":" << RN;
Chris Lattnerc3aae252005-01-07 07:46:32 +00004125 }
4126
Evan Chengce254432007-12-11 02:08:35 +00004127 if (!isTargetOpcode() && getOpcode() == ISD::VECTOR_SHUFFLE) {
4128 SDNode *Mask = getOperand(2).Val;
4129 cerr << "<";
4130 for (unsigned i = 0, e = Mask->getNumOperands(); i != e; ++i) {
4131 if (i) cerr << ",";
4132 if (Mask->getOperand(i).getOpcode() == ISD::UNDEF)
4133 cerr << "u";
4134 else
4135 cerr << cast<ConstantSDNode>(Mask->getOperand(i))->getValue();
4136 }
4137 cerr << ">";
4138 }
4139
Chris Lattnerc3aae252005-01-07 07:46:32 +00004140 if (const ConstantSDNode *CSDN = dyn_cast<ConstantSDNode>(this)) {
Bill Wendling832171c2006-12-07 20:04:42 +00004141 cerr << "<" << CSDN->getValue() << ">";
Chris Lattnerc3aae252005-01-07 07:46:32 +00004142 } else if (const ConstantFPSDNode *CSDN = dyn_cast<ConstantFPSDNode>(this)) {
Dale Johannesen9e3d3ab2007-09-14 22:26:36 +00004143 if (&CSDN->getValueAPF().getSemantics()==&APFloat::IEEEsingle)
4144 cerr << "<" << CSDN->getValueAPF().convertToFloat() << ">";
4145 else if (&CSDN->getValueAPF().getSemantics()==&APFloat::IEEEdouble)
4146 cerr << "<" << CSDN->getValueAPF().convertToDouble() << ">";
4147 else {
4148 cerr << "<APFloat(";
4149 CSDN->getValueAPF().convertToAPInt().dump();
4150 cerr << ")>";
4151 }
Misha Brukmanedf128a2005-04-21 22:36:52 +00004152 } else if (const GlobalAddressSDNode *GADN =
Chris Lattnerc3aae252005-01-07 07:46:32 +00004153 dyn_cast<GlobalAddressSDNode>(this)) {
Evan Cheng61ca74b2005-11-30 02:04:11 +00004154 int offset = GADN->getOffset();
Bill Wendling832171c2006-12-07 20:04:42 +00004155 cerr << "<";
Bill Wendlingbcd24982006-12-07 20:28:15 +00004156 WriteAsOperand(*cerr.stream(), GADN->getGlobal()) << ">";
Evan Cheng61ca74b2005-11-30 02:04:11 +00004157 if (offset > 0)
Bill Wendling832171c2006-12-07 20:04:42 +00004158 cerr << " + " << offset;
Evan Cheng61ca74b2005-11-30 02:04:11 +00004159 else
Bill Wendling832171c2006-12-07 20:04:42 +00004160 cerr << " " << offset;
Misha Brukmandedf2bd2005-04-22 04:01:18 +00004161 } else if (const FrameIndexSDNode *FIDN = dyn_cast<FrameIndexSDNode>(this)) {
Bill Wendling832171c2006-12-07 20:04:42 +00004162 cerr << "<" << FIDN->getIndex() << ">";
Evan Cheng6cc31ae2006-11-01 04:48:30 +00004163 } else if (const JumpTableSDNode *JTDN = dyn_cast<JumpTableSDNode>(this)) {
Bill Wendling832171c2006-12-07 20:04:42 +00004164 cerr << "<" << JTDN->getIndex() << ">";
Chris Lattnerc3aae252005-01-07 07:46:32 +00004165 } else if (const ConstantPoolSDNode *CP = dyn_cast<ConstantPoolSDNode>(this)){
Evan Cheng38b73272006-02-26 08:36:57 +00004166 int offset = CP->getOffset();
Evan Chengd6594ae2006-09-12 21:00:35 +00004167 if (CP->isMachineConstantPoolEntry())
Bill Wendling832171c2006-12-07 20:04:42 +00004168 cerr << "<" << *CP->getMachineCPVal() << ">";
Evan Chengd6594ae2006-09-12 21:00:35 +00004169 else
Bill Wendling832171c2006-12-07 20:04:42 +00004170 cerr << "<" << *CP->getConstVal() << ">";
Evan Cheng38b73272006-02-26 08:36:57 +00004171 if (offset > 0)
Bill Wendling832171c2006-12-07 20:04:42 +00004172 cerr << " + " << offset;
Evan Cheng38b73272006-02-26 08:36:57 +00004173 else
Bill Wendling832171c2006-12-07 20:04:42 +00004174 cerr << " " << offset;
Misha Brukmandedf2bd2005-04-22 04:01:18 +00004175 } else if (const BasicBlockSDNode *BBDN = dyn_cast<BasicBlockSDNode>(this)) {
Bill Wendling832171c2006-12-07 20:04:42 +00004176 cerr << "<";
Chris Lattnerc3aae252005-01-07 07:46:32 +00004177 const Value *LBB = (const Value*)BBDN->getBasicBlock()->getBasicBlock();
4178 if (LBB)
Bill Wendling832171c2006-12-07 20:04:42 +00004179 cerr << LBB->getName() << " ";
4180 cerr << (const void*)BBDN->getBasicBlock() << ">";
Chris Lattnerfa164b62005-08-19 21:34:13 +00004181 } else if (const RegisterSDNode *R = dyn_cast<RegisterSDNode>(this)) {
Dan Gohman6f0d0242008-02-10 18:45:23 +00004182 if (G && R->getReg() &&
4183 TargetRegisterInfo::isPhysicalRegister(R->getReg())) {
Bill Wendling832171c2006-12-07 20:04:42 +00004184 cerr << " " <<G->getTarget().getRegisterInfo()->getName(R->getReg());
Chris Lattner7228aa72005-08-19 21:21:16 +00004185 } else {
Bill Wendling832171c2006-12-07 20:04:42 +00004186 cerr << " #" << R->getReg();
Chris Lattner7228aa72005-08-19 21:21:16 +00004187 }
Chris Lattnerc3aae252005-01-07 07:46:32 +00004188 } else if (const ExternalSymbolSDNode *ES =
4189 dyn_cast<ExternalSymbolSDNode>(this)) {
Bill Wendling832171c2006-12-07 20:04:42 +00004190 cerr << "'" << ES->getSymbol() << "'";
Chris Lattner2bf3c262005-05-09 04:08:27 +00004191 } else if (const SrcValueSDNode *M = dyn_cast<SrcValueSDNode>(this)) {
4192 if (M->getValue())
Dan Gohman69de1932008-02-06 22:27:42 +00004193 cerr << "<" << M->getValue() << ">";
Chris Lattner2bf3c262005-05-09 04:08:27 +00004194 else
Dan Gohman69de1932008-02-06 22:27:42 +00004195 cerr << "<null>";
4196 } else if (const MemOperandSDNode *M = dyn_cast<MemOperandSDNode>(this)) {
4197 if (M->MO.getValue())
4198 cerr << "<" << M->MO.getValue() << ":" << M->MO.getOffset() << ">";
4199 else
4200 cerr << "<null:" << M->MO.getOffset() << ">";
Chris Lattnera23e8152005-08-18 03:31:02 +00004201 } else if (const VTSDNode *N = dyn_cast<VTSDNode>(this)) {
Dan Gohman237898a2007-05-24 14:33:05 +00004202 cerr << ":" << MVT::getValueTypeString(N->getVT());
Evan Cheng0ac1c6a2006-10-10 20:05:10 +00004203 } else if (const LoadSDNode *LD = dyn_cast<LoadSDNode>(this)) {
Evan Cheng81310132007-12-18 19:06:30 +00004204 const Value *SrcValue = LD->getSrcValue();
4205 int SrcOffset = LD->getSrcValueOffset();
4206 cerr << " <";
4207 if (SrcValue)
4208 cerr << SrcValue;
4209 else
4210 cerr << "null";
4211 cerr << ":" << SrcOffset << ">";
4212
Evan Cheng0ac1c6a2006-10-10 20:05:10 +00004213 bool doExt = true;
4214 switch (LD->getExtensionType()) {
4215 default: doExt = false; break;
4216 case ISD::EXTLOAD:
Bill Wendling832171c2006-12-07 20:04:42 +00004217 cerr << " <anyext ";
Evan Cheng0ac1c6a2006-10-10 20:05:10 +00004218 break;
4219 case ISD::SEXTLOAD:
Bill Wendling832171c2006-12-07 20:04:42 +00004220 cerr << " <sext ";
Evan Cheng0ac1c6a2006-10-10 20:05:10 +00004221 break;
4222 case ISD::ZEXTLOAD:
Bill Wendling832171c2006-12-07 20:04:42 +00004223 cerr << " <zext ";
Evan Cheng0ac1c6a2006-10-10 20:05:10 +00004224 break;
4225 }
4226 if (doExt)
Dan Gohmanb625f2f2008-01-30 00:15:11 +00004227 cerr << MVT::getValueTypeString(LD->getMemoryVT()) << ">";
Evan Cheng0ac1c6a2006-10-10 20:05:10 +00004228
Evan Cheng144d8f02006-11-09 17:55:04 +00004229 const char *AM = getIndexedModeName(LD->getAddressingMode());
Duncan Sands70d0bd12007-07-19 07:31:58 +00004230 if (*AM)
Bill Wendling832171c2006-12-07 20:04:42 +00004231 cerr << " " << AM;
Evan Cheng81310132007-12-18 19:06:30 +00004232 if (LD->isVolatile())
4233 cerr << " <volatile>";
4234 cerr << " alignment=" << LD->getAlignment();
Evan Cheng2caccca2006-10-17 21:14:32 +00004235 } else if (const StoreSDNode *ST = dyn_cast<StoreSDNode>(this)) {
Evan Cheng88ce93e2007-12-18 07:02:08 +00004236 const Value *SrcValue = ST->getSrcValue();
4237 int SrcOffset = ST->getSrcValueOffset();
4238 cerr << " <";
4239 if (SrcValue)
4240 cerr << SrcValue;
4241 else
4242 cerr << "null";
4243 cerr << ":" << SrcOffset << ">";
Evan Cheng81310132007-12-18 19:06:30 +00004244
4245 if (ST->isTruncatingStore())
4246 cerr << " <trunc "
Dan Gohmanb625f2f2008-01-30 00:15:11 +00004247 << MVT::getValueTypeString(ST->getMemoryVT()) << ">";
Evan Cheng81310132007-12-18 19:06:30 +00004248
4249 const char *AM = getIndexedModeName(ST->getAddressingMode());
4250 if (*AM)
4251 cerr << " " << AM;
4252 if (ST->isVolatile())
4253 cerr << " <volatile>";
4254 cerr << " alignment=" << ST->getAlignment();
Chris Lattnerc3aae252005-01-07 07:46:32 +00004255 }
Chris Lattnerc3aae252005-01-07 07:46:32 +00004256}
4257
Chris Lattnerde202b32005-11-09 23:47:37 +00004258static void DumpNodes(const SDNode *N, unsigned indent, const SelectionDAG *G) {
Chris Lattnerea946cd2005-01-09 20:38:33 +00004259 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
4260 if (N->getOperand(i).Val->hasOneUse())
Chris Lattnerf3e133a2005-08-16 18:33:07 +00004261 DumpNodes(N->getOperand(i).Val, indent+2, G);
Chris Lattnerea946cd2005-01-09 20:38:33 +00004262 else
Bill Wendling832171c2006-12-07 20:04:42 +00004263 cerr << "\n" << std::string(indent+2, ' ')
4264 << (void*)N->getOperand(i).Val << ": <multiple use>";
Misha Brukmanedf128a2005-04-21 22:36:52 +00004265
Chris Lattnerea946cd2005-01-09 20:38:33 +00004266
Bill Wendling832171c2006-12-07 20:04:42 +00004267 cerr << "\n" << std::string(indent, ' ');
Chris Lattnerf3e133a2005-08-16 18:33:07 +00004268 N->dump(G);
Chris Lattnerea946cd2005-01-09 20:38:33 +00004269}
4270
Chris Lattnerc3aae252005-01-07 07:46:32 +00004271void SelectionDAG::dump() const {
Bill Wendling832171c2006-12-07 20:04:42 +00004272 cerr << "SelectionDAG has " << AllNodes.size() << " nodes:";
Chris Lattnerde202b32005-11-09 23:47:37 +00004273 std::vector<const SDNode*> Nodes;
4274 for (allnodes_const_iterator I = allnodes_begin(), E = allnodes_end();
4275 I != E; ++I)
4276 Nodes.push_back(I);
4277
Chris Lattner49d24712005-01-09 20:26:36 +00004278 std::sort(Nodes.begin(), Nodes.end());
4279
4280 for (unsigned i = 0, e = Nodes.size(); i != e; ++i) {
Chris Lattnerea946cd2005-01-09 20:38:33 +00004281 if (!Nodes[i]->hasOneUse() && Nodes[i] != getRoot().Val)
Chris Lattnerf3e133a2005-08-16 18:33:07 +00004282 DumpNodes(Nodes[i], 2, this);
Chris Lattnerc3aae252005-01-07 07:46:32 +00004283 }
Chris Lattnerea946cd2005-01-09 20:38:33 +00004284
Jim Laskey26f7fa72006-10-17 19:33:52 +00004285 if (getRoot().Val) DumpNodes(getRoot().Val, 2, this);
Chris Lattnerea946cd2005-01-09 20:38:33 +00004286
Bill Wendling832171c2006-12-07 20:04:42 +00004287 cerr << "\n\n";
Chris Lattnerc3aae252005-01-07 07:46:32 +00004288}
4289
Evan Chengd6594ae2006-09-12 21:00:35 +00004290const Type *ConstantPoolSDNode::getType() const {
4291 if (isMachineConstantPoolEntry())
4292 return Val.MachineCPVal->getType();
4293 return Val.ConstVal->getType();
4294}