1 //===-- SelectionDAGBuilder.cpp - Selection-DAG building ------------------===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This implements routines for translating from LLVM IR into SelectionDAG IR.
12 //===----------------------------------------------------------------------===//
14 #define DEBUG_TYPE "isel"
15 #include "SelectionDAGBuilder.h"
16 #include "SDNodeDbgValue.h"
17 #include "llvm/ADT/BitVector.h"
18 #include "llvm/ADT/PostOrderIterator.h"
19 #include "llvm/ADT/SmallSet.h"
20 #include "llvm/Analysis/AliasAnalysis.h"
21 #include "llvm/Analysis/ConstantFolding.h"
22 #include "llvm/Analysis/ValueTracking.h"
23 #include "llvm/CallingConv.h"
24 #include "llvm/CodeGen/Analysis.h"
25 #include "llvm/CodeGen/FastISel.h"
26 #include "llvm/CodeGen/FunctionLoweringInfo.h"
27 #include "llvm/CodeGen/GCMetadata.h"
28 #include "llvm/CodeGen/GCStrategy.h"
29 #include "llvm/CodeGen/MachineFrameInfo.h"
30 #include "llvm/CodeGen/MachineFunction.h"
31 #include "llvm/CodeGen/MachineInstrBuilder.h"
32 #include "llvm/CodeGen/MachineJumpTableInfo.h"
33 #include "llvm/CodeGen/MachineModuleInfo.h"
34 #include "llvm/CodeGen/MachineRegisterInfo.h"
35 #include "llvm/CodeGen/SelectionDAG.h"
36 #include "llvm/Constants.h"
37 #include "llvm/DataLayout.h"
38 #include "llvm/DebugInfo.h"
39 #include "llvm/DerivedTypes.h"
40 #include "llvm/Function.h"
41 #include "llvm/GlobalVariable.h"
42 #include "llvm/InlineAsm.h"
43 #include "llvm/Instructions.h"
44 #include "llvm/IntrinsicInst.h"
45 #include "llvm/Intrinsics.h"
46 #include "llvm/LLVMContext.h"
47 #include "llvm/Module.h"
48 #include "llvm/Support/CommandLine.h"
49 #include "llvm/Support/Debug.h"
50 #include "llvm/Support/ErrorHandling.h"
51 #include "llvm/Support/IntegersSubsetMapping.h"
52 #include "llvm/Support/MathExtras.h"
53 #include "llvm/Support/raw_ostream.h"
54 #include "llvm/Target/TargetFrameLowering.h"
55 #include "llvm/Target/TargetInstrInfo.h"
56 #include "llvm/Target/TargetIntrinsicInfo.h"
57 #include "llvm/Target/TargetLibraryInfo.h"
58 #include "llvm/Target/TargetLowering.h"
59 #include "llvm/Target/TargetOptions.h"
63 /// LimitFloatPrecision - Generate low-precision inline sequences for
64 /// some float libcalls (6, 8 or 12 bits).
65 static unsigned LimitFloatPrecision;
67 static cl::opt<unsigned, true>
68 LimitFPPrecision("limit-float-precision",
69 cl::desc("Generate low-precision inline sequences "
70 "for some float libcalls"),
71 cl::location(LimitFloatPrecision),
74 // Limit the width of DAG chains. This is important in general to prevent
75 // prevent DAG-based analysis from blowing up. For example, alias analysis and
76 // load clustering may not complete in reasonable time. It is difficult to
77 // recognize and avoid this situation within each individual analysis, and
78 // future analyses are likely to have the same behavior. Limiting DAG width is
79 // the safe approach, and will be especially important with global DAGs.
81 // MaxParallelChains default is arbitrarily high to avoid affecting
82 // optimization, but could be lowered to improve compile time. Any ld-ld-st-st
83 // sequence over this should have been converted to llvm.memcpy by the
84 // frontend. It easy to induce this behavior with .ll code such as:
85 // %buffer = alloca [4096 x i8]
86 // %data = load [4096 x i8]* %argPtr
87 // store [4096 x i8] %data, [4096 x i8]* %buffer
88 static const unsigned MaxParallelChains = 64;
90 static SDValue getCopyFromPartsVector(SelectionDAG &DAG, DebugLoc DL,
91 const SDValue *Parts, unsigned NumParts,
92 MVT PartVT, EVT ValueVT, const Value *V);
94 /// getCopyFromParts - Create a value that contains the specified legal parts
95 /// combined into the value they represent. If the parts combine to a type
96 /// larger then ValueVT then AssertOp can be used to specify whether the extra
97 /// bits are known to be zero (ISD::AssertZext) or sign extended from ValueVT
98 /// (ISD::AssertSext).
99 static SDValue getCopyFromParts(SelectionDAG &DAG, DebugLoc DL,
100 const SDValue *Parts,
101 unsigned NumParts, MVT PartVT, EVT ValueVT,
103 ISD::NodeType AssertOp = ISD::DELETED_NODE) {
104 if (ValueVT.isVector())
105 return getCopyFromPartsVector(DAG, DL, Parts, NumParts,
108 assert(NumParts > 0 && "No parts to assemble!");
109 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
110 SDValue Val = Parts[0];
113 // Assemble the value from multiple parts.
114 if (ValueVT.isInteger()) {
115 unsigned PartBits = PartVT.getSizeInBits();
116 unsigned ValueBits = ValueVT.getSizeInBits();
118 // Assemble the power of 2 part.
119 unsigned RoundParts = NumParts & (NumParts - 1) ?
120 1 << Log2_32(NumParts) : NumParts;
121 unsigned RoundBits = PartBits * RoundParts;
122 EVT RoundVT = RoundBits == ValueBits ?
123 ValueVT : EVT::getIntegerVT(*DAG.getContext(), RoundBits);
126 EVT HalfVT = EVT::getIntegerVT(*DAG.getContext(), RoundBits/2);
128 if (RoundParts > 2) {
129 Lo = getCopyFromParts(DAG, DL, Parts, RoundParts / 2,
131 Hi = getCopyFromParts(DAG, DL, Parts + RoundParts / 2,
132 RoundParts / 2, PartVT, HalfVT, V);
134 Lo = DAG.getNode(ISD::BITCAST, DL, HalfVT, Parts[0]);
135 Hi = DAG.getNode(ISD::BITCAST, DL, HalfVT, Parts[1]);
138 if (TLI.isBigEndian())
141 Val = DAG.getNode(ISD::BUILD_PAIR, DL, RoundVT, Lo, Hi);
143 if (RoundParts < NumParts) {
144 // Assemble the trailing non-power-of-2 part.
145 unsigned OddParts = NumParts - RoundParts;
146 EVT OddVT = EVT::getIntegerVT(*DAG.getContext(), OddParts * PartBits);
147 Hi = getCopyFromParts(DAG, DL,
148 Parts + RoundParts, OddParts, PartVT, OddVT, V);
150 // Combine the round and odd parts.
152 if (TLI.isBigEndian())
154 EVT TotalVT = EVT::getIntegerVT(*DAG.getContext(), NumParts * PartBits);
155 Hi = DAG.getNode(ISD::ANY_EXTEND, DL, TotalVT, Hi);
156 Hi = DAG.getNode(ISD::SHL, DL, TotalVT, Hi,
157 DAG.getConstant(Lo.getValueType().getSizeInBits(),
158 TLI.getPointerTy()));
159 Lo = DAG.getNode(ISD::ZERO_EXTEND, DL, TotalVT, Lo);
160 Val = DAG.getNode(ISD::OR, DL, TotalVT, Lo, Hi);
162 } else if (PartVT.isFloatingPoint()) {
163 // FP split into multiple FP parts (for ppcf128)
164 assert(ValueVT == EVT(MVT::ppcf128) && PartVT == MVT::f64 &&
167 Lo = DAG.getNode(ISD::BITCAST, DL, EVT(MVT::f64), Parts[0]);
168 Hi = DAG.getNode(ISD::BITCAST, DL, EVT(MVT::f64), Parts[1]);
169 if (TLI.isBigEndian())
171 Val = DAG.getNode(ISD::BUILD_PAIR, DL, ValueVT, Lo, Hi);
173 // FP split into integer parts (soft fp)
174 assert(ValueVT.isFloatingPoint() && PartVT.isInteger() &&
175 !PartVT.isVector() && "Unexpected split");
176 EVT IntVT = EVT::getIntegerVT(*DAG.getContext(), ValueVT.getSizeInBits());
177 Val = getCopyFromParts(DAG, DL, Parts, NumParts, PartVT, IntVT, V);
181 // There is now one part, held in Val. Correct it to match ValueVT.
182 EVT PartEVT = Val.getValueType();
184 if (PartEVT == ValueVT)
187 if (PartEVT.isInteger() && ValueVT.isInteger()) {
188 if (ValueVT.bitsLT(PartEVT)) {
189 // For a truncate, see if we have any information to
190 // indicate whether the truncated bits will always be
191 // zero or sign-extension.
192 if (AssertOp != ISD::DELETED_NODE)
193 Val = DAG.getNode(AssertOp, DL, PartEVT, Val,
194 DAG.getValueType(ValueVT));
195 return DAG.getNode(ISD::TRUNCATE, DL, ValueVT, Val);
197 return DAG.getNode(ISD::ANY_EXTEND, DL, ValueVT, Val);
200 if (PartEVT.isFloatingPoint() && ValueVT.isFloatingPoint()) {
201 // FP_ROUND's are always exact here.
202 if (ValueVT.bitsLT(Val.getValueType()))
203 return DAG.getNode(ISD::FP_ROUND, DL, ValueVT, Val,
204 DAG.getTargetConstant(1, TLI.getPointerTy()));
206 return DAG.getNode(ISD::FP_EXTEND, DL, ValueVT, Val);
209 if (PartEVT.getSizeInBits() == ValueVT.getSizeInBits())
210 return DAG.getNode(ISD::BITCAST, DL, ValueVT, Val);
212 llvm_unreachable("Unknown mismatch!");
215 /// getCopyFromPartsVector - Create a value that contains the specified legal
216 /// parts combined into the value they represent. If the parts combine to a
217 /// type larger then ValueVT then AssertOp can be used to specify whether the
218 /// extra bits are known to be zero (ISD::AssertZext) or sign extended from
219 /// ValueVT (ISD::AssertSext).
220 static SDValue getCopyFromPartsVector(SelectionDAG &DAG, DebugLoc DL,
221 const SDValue *Parts, unsigned NumParts,
222 MVT PartVT, EVT ValueVT, const Value *V) {
223 assert(ValueVT.isVector() && "Not a vector value");
224 assert(NumParts > 0 && "No parts to assemble!");
225 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
226 SDValue Val = Parts[0];
228 // Handle a multi-element vector.
232 unsigned NumIntermediates;
234 TLI.getVectorTypeBreakdown(*DAG.getContext(), ValueVT, IntermediateVT,
235 NumIntermediates, RegisterVT);
236 assert(NumRegs == NumParts && "Part count doesn't match vector breakdown!");
237 NumParts = NumRegs; // Silence a compiler warning.
238 assert(RegisterVT == PartVT && "Part type doesn't match vector breakdown!");
239 assert(RegisterVT == Parts[0].getSimpleValueType() &&
240 "Part type doesn't match part!");
242 // Assemble the parts into intermediate operands.
243 SmallVector<SDValue, 8> Ops(NumIntermediates);
244 if (NumIntermediates == NumParts) {
245 // If the register was not expanded, truncate or copy the value,
247 for (unsigned i = 0; i != NumParts; ++i)
248 Ops[i] = getCopyFromParts(DAG, DL, &Parts[i], 1,
249 PartVT, IntermediateVT, V);
250 } else if (NumParts > 0) {
251 // If the intermediate type was expanded, build the intermediate
252 // operands from the parts.
253 assert(NumParts % NumIntermediates == 0 &&
254 "Must expand into a divisible number of parts!");
255 unsigned Factor = NumParts / NumIntermediates;
256 for (unsigned i = 0; i != NumIntermediates; ++i)
257 Ops[i] = getCopyFromParts(DAG, DL, &Parts[i * Factor], Factor,
258 PartVT, IntermediateVT, V);
261 // Build a vector with BUILD_VECTOR or CONCAT_VECTORS from the
262 // intermediate operands.
263 Val = DAG.getNode(IntermediateVT.isVector() ?
264 ISD::CONCAT_VECTORS : ISD::BUILD_VECTOR, DL,
265 ValueVT, &Ops[0], NumIntermediates);
268 // There is now one part, held in Val. Correct it to match ValueVT.
269 EVT PartEVT = Val.getValueType();
271 if (PartEVT == ValueVT)
274 if (PartEVT.isVector()) {
275 // If the element type of the source/dest vectors are the same, but the
276 // parts vector has more elements than the value vector, then we have a
277 // vector widening case (e.g. <2 x float> -> <4 x float>). Extract the
279 if (PartEVT.getVectorElementType() == ValueVT.getVectorElementType()) {
280 assert(PartEVT.getVectorNumElements() > ValueVT.getVectorNumElements() &&
281 "Cannot narrow, it would be a lossy transformation");
282 return DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, ValueVT, Val,
283 DAG.getIntPtrConstant(0));
286 // Vector/Vector bitcast.
287 if (ValueVT.getSizeInBits() == PartEVT.getSizeInBits())
288 return DAG.getNode(ISD::BITCAST, DL, ValueVT, Val);
290 assert(PartEVT.getVectorNumElements() == ValueVT.getVectorNumElements() &&
291 "Cannot handle this kind of promotion");
292 // Promoted vector extract
293 bool Smaller = ValueVT.bitsLE(PartEVT);
294 return DAG.getNode((Smaller ? ISD::TRUNCATE : ISD::ANY_EXTEND),
299 // Trivial bitcast if the types are the same size and the destination
300 // vector type is legal.
301 if (PartEVT.getSizeInBits() == ValueVT.getSizeInBits() &&
302 TLI.isTypeLegal(ValueVT))
303 return DAG.getNode(ISD::BITCAST, DL, ValueVT, Val);
305 // Handle cases such as i8 -> <1 x i1>
306 if (ValueVT.getVectorNumElements() != 1) {
307 LLVMContext &Ctx = *DAG.getContext();
308 Twine ErrMsg("non-trivial scalar-to-vector conversion");
309 if (const Instruction *I = dyn_cast_or_null<Instruction>(V)) {
310 if (const CallInst *CI = dyn_cast<CallInst>(I))
311 if (isa<InlineAsm>(CI->getCalledValue()))
312 ErrMsg = ErrMsg + ", possible invalid constraint for vector type";
313 Ctx.emitError(I, ErrMsg);
315 Ctx.emitError(ErrMsg);
317 report_fatal_error("Cannot handle scalar-to-vector conversion!");
320 if (ValueVT.getVectorNumElements() == 1 &&
321 ValueVT.getVectorElementType() != PartEVT) {
322 bool Smaller = ValueVT.bitsLE(PartEVT);
323 Val = DAG.getNode((Smaller ? ISD::TRUNCATE : ISD::ANY_EXTEND),
324 DL, ValueVT.getScalarType(), Val);
327 return DAG.getNode(ISD::BUILD_VECTOR, DL, ValueVT, Val);
330 static void getCopyToPartsVector(SelectionDAG &DAG, DebugLoc dl,
331 SDValue Val, SDValue *Parts, unsigned NumParts,
332 MVT PartVT, const Value *V);
334 /// getCopyToParts - Create a series of nodes that contain the specified value
335 /// split into legal parts. If the parts contain more bits than Val, then, for
336 /// integers, ExtendKind can be used to specify how to generate the extra bits.
337 static void getCopyToParts(SelectionDAG &DAG, DebugLoc DL,
338 SDValue Val, SDValue *Parts, unsigned NumParts,
339 MVT PartVT, const Value *V,
340 ISD::NodeType ExtendKind = ISD::ANY_EXTEND) {
341 EVT ValueVT = Val.getValueType();
343 // Handle the vector case separately.
344 if (ValueVT.isVector())
345 return getCopyToPartsVector(DAG, DL, Val, Parts, NumParts, PartVT, V);
347 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
348 unsigned PartBits = PartVT.getSizeInBits();
349 unsigned OrigNumParts = NumParts;
350 assert(TLI.isTypeLegal(PartVT) && "Copying to an illegal type!");
355 assert(!ValueVT.isVector() && "Vector case handled elsewhere");
356 EVT PartEVT = PartVT;
357 if (PartEVT == ValueVT) {
358 assert(NumParts == 1 && "No-op copy with multiple parts!");
363 if (NumParts * PartBits > ValueVT.getSizeInBits()) {
364 // If the parts cover more bits than the value has, promote the value.
365 if (PartVT.isFloatingPoint() && ValueVT.isFloatingPoint()) {
366 assert(NumParts == 1 && "Do not know what to promote to!");
367 Val = DAG.getNode(ISD::FP_EXTEND, DL, PartVT, Val);
369 assert((PartVT.isInteger() || PartVT == MVT::x86mmx) &&
370 ValueVT.isInteger() &&
371 "Unknown mismatch!");
372 ValueVT = EVT::getIntegerVT(*DAG.getContext(), NumParts * PartBits);
373 Val = DAG.getNode(ExtendKind, DL, ValueVT, Val);
374 if (PartVT == MVT::x86mmx)
375 Val = DAG.getNode(ISD::BITCAST, DL, PartVT, Val);
377 } else if (PartBits == ValueVT.getSizeInBits()) {
378 // Different types of the same size.
379 assert(NumParts == 1 && PartEVT != ValueVT);
380 Val = DAG.getNode(ISD::BITCAST, DL, PartVT, Val);
381 } else if (NumParts * PartBits < ValueVT.getSizeInBits()) {
382 // If the parts cover less bits than value has, truncate the value.
383 assert((PartVT.isInteger() || PartVT == MVT::x86mmx) &&
384 ValueVT.isInteger() &&
385 "Unknown mismatch!");
386 ValueVT = EVT::getIntegerVT(*DAG.getContext(), NumParts * PartBits);
387 Val = DAG.getNode(ISD::TRUNCATE, DL, ValueVT, Val);
388 if (PartVT == MVT::x86mmx)
389 Val = DAG.getNode(ISD::BITCAST, DL, PartVT, Val);
392 // The value may have changed - recompute ValueVT.
393 ValueVT = Val.getValueType();
394 assert(NumParts * PartBits == ValueVT.getSizeInBits() &&
395 "Failed to tile the value with PartVT!");
398 if (PartEVT != ValueVT) {
399 LLVMContext &Ctx = *DAG.getContext();
400 Twine ErrMsg("scalar-to-vector conversion failed");
401 if (const Instruction *I = dyn_cast_or_null<Instruction>(V)) {
402 if (const CallInst *CI = dyn_cast<CallInst>(I))
403 if (isa<InlineAsm>(CI->getCalledValue()))
404 ErrMsg = ErrMsg + ", possible invalid constraint for vector type";
405 Ctx.emitError(I, ErrMsg);
407 Ctx.emitError(ErrMsg);
415 // Expand the value into multiple parts.
416 if (NumParts & (NumParts - 1)) {
417 // The number of parts is not a power of 2. Split off and copy the tail.
418 assert(PartVT.isInteger() && ValueVT.isInteger() &&
419 "Do not know what to expand to!");
420 unsigned RoundParts = 1 << Log2_32(NumParts);
421 unsigned RoundBits = RoundParts * PartBits;
422 unsigned OddParts = NumParts - RoundParts;
423 SDValue OddVal = DAG.getNode(ISD::SRL, DL, ValueVT, Val,
424 DAG.getIntPtrConstant(RoundBits));
425 getCopyToParts(DAG, DL, OddVal, Parts + RoundParts, OddParts, PartVT, V);
427 if (TLI.isBigEndian())
428 // The odd parts were reversed by getCopyToParts - unreverse them.
429 std::reverse(Parts + RoundParts, Parts + NumParts);
431 NumParts = RoundParts;
432 ValueVT = EVT::getIntegerVT(*DAG.getContext(), NumParts * PartBits);
433 Val = DAG.getNode(ISD::TRUNCATE, DL, ValueVT, Val);
436 // The number of parts is a power of 2. Repeatedly bisect the value using
438 Parts[0] = DAG.getNode(ISD::BITCAST, DL,
439 EVT::getIntegerVT(*DAG.getContext(),
440 ValueVT.getSizeInBits()),
443 for (unsigned StepSize = NumParts; StepSize > 1; StepSize /= 2) {
444 for (unsigned i = 0; i < NumParts; i += StepSize) {
445 unsigned ThisBits = StepSize * PartBits / 2;
446 EVT ThisVT = EVT::getIntegerVT(*DAG.getContext(), ThisBits);
447 SDValue &Part0 = Parts[i];
448 SDValue &Part1 = Parts[i+StepSize/2];
450 Part1 = DAG.getNode(ISD::EXTRACT_ELEMENT, DL,
451 ThisVT, Part0, DAG.getIntPtrConstant(1));
452 Part0 = DAG.getNode(ISD::EXTRACT_ELEMENT, DL,
453 ThisVT, Part0, DAG.getIntPtrConstant(0));
455 if (ThisBits == PartBits && ThisVT != PartVT) {
456 Part0 = DAG.getNode(ISD::BITCAST, DL, PartVT, Part0);
457 Part1 = DAG.getNode(ISD::BITCAST, DL, PartVT, Part1);
462 if (TLI.isBigEndian())
463 std::reverse(Parts, Parts + OrigNumParts);
467 /// getCopyToPartsVector - Create a series of nodes that contain the specified
468 /// value split into legal parts.
469 static void getCopyToPartsVector(SelectionDAG &DAG, DebugLoc DL,
470 SDValue Val, SDValue *Parts, unsigned NumParts,
471 MVT PartVT, const Value *V) {
472 EVT ValueVT = Val.getValueType();
473 assert(ValueVT.isVector() && "Not a vector");
474 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
477 EVT PartEVT = PartVT;
478 if (PartEVT == ValueVT) {
480 } else if (PartVT.getSizeInBits() == ValueVT.getSizeInBits()) {
481 // Bitconvert vector->vector case.
482 Val = DAG.getNode(ISD::BITCAST, DL, PartVT, Val);
483 } else if (PartVT.isVector() &&
484 PartEVT.getVectorElementType() == ValueVT.getVectorElementType() &&
485 PartEVT.getVectorNumElements() > ValueVT.getVectorNumElements()) {
486 EVT ElementVT = PartVT.getVectorElementType();
487 // Vector widening case, e.g. <2 x float> -> <4 x float>. Shuffle in
489 SmallVector<SDValue, 16> Ops;
490 for (unsigned i = 0, e = ValueVT.getVectorNumElements(); i != e; ++i)
491 Ops.push_back(DAG.getNode(ISD::EXTRACT_VECTOR_ELT, DL,
492 ElementVT, Val, DAG.getIntPtrConstant(i)));
494 for (unsigned i = ValueVT.getVectorNumElements(),
495 e = PartVT.getVectorNumElements(); i != e; ++i)
496 Ops.push_back(DAG.getUNDEF(ElementVT));
498 Val = DAG.getNode(ISD::BUILD_VECTOR, DL, PartVT, &Ops[0], Ops.size());
500 // FIXME: Use CONCAT for 2x -> 4x.
502 //SDValue UndefElts = DAG.getUNDEF(VectorTy);
503 //Val = DAG.getNode(ISD::CONCAT_VECTORS, DL, PartVT, Val, UndefElts);
504 } else if (PartVT.isVector() &&
505 PartEVT.getVectorElementType().bitsGE(
506 ValueVT.getVectorElementType()) &&
507 PartEVT.getVectorNumElements() == ValueVT.getVectorNumElements()) {
509 // Promoted vector extract
510 bool Smaller = PartEVT.bitsLE(ValueVT);
511 Val = DAG.getNode((Smaller ? ISD::TRUNCATE : ISD::ANY_EXTEND),
514 // Vector -> scalar conversion.
515 assert(ValueVT.getVectorNumElements() == 1 &&
516 "Only trivial vector-to-scalar conversions should get here!");
517 Val = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, DL,
518 PartVT, Val, DAG.getIntPtrConstant(0));
520 bool Smaller = ValueVT.bitsLE(PartVT);
521 Val = DAG.getNode((Smaller ? ISD::TRUNCATE : ISD::ANY_EXTEND),
529 // Handle a multi-element vector.
532 unsigned NumIntermediates;
533 unsigned NumRegs = TLI.getVectorTypeBreakdown(*DAG.getContext(), ValueVT,
535 NumIntermediates, RegisterVT);
536 unsigned NumElements = ValueVT.getVectorNumElements();
538 assert(NumRegs == NumParts && "Part count doesn't match vector breakdown!");
539 NumParts = NumRegs; // Silence a compiler warning.
540 assert(RegisterVT == PartVT && "Part type doesn't match vector breakdown!");
542 // Split the vector into intermediate operands.
543 SmallVector<SDValue, 8> Ops(NumIntermediates);
544 for (unsigned i = 0; i != NumIntermediates; ++i) {
545 if (IntermediateVT.isVector())
546 Ops[i] = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL,
548 DAG.getIntPtrConstant(i * (NumElements / NumIntermediates)));
550 Ops[i] = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, DL,
551 IntermediateVT, Val, DAG.getIntPtrConstant(i));
554 // Split the intermediate operands into legal parts.
555 if (NumParts == NumIntermediates) {
556 // If the register was not expanded, promote or copy the value,
558 for (unsigned i = 0; i != NumParts; ++i)
559 getCopyToParts(DAG, DL, Ops[i], &Parts[i], 1, PartVT, V);
560 } else if (NumParts > 0) {
561 // If the intermediate type was expanded, split each the value into
563 assert(NumParts % NumIntermediates == 0 &&
564 "Must expand into a divisible number of parts!");
565 unsigned Factor = NumParts / NumIntermediates;
566 for (unsigned i = 0; i != NumIntermediates; ++i)
567 getCopyToParts(DAG, DL, Ops[i], &Parts[i*Factor], Factor, PartVT, V);
572 /// RegsForValue - This struct represents the registers (physical or virtual)
573 /// that a particular set of values is assigned, and the type information
574 /// about the value. The most common situation is to represent one value at a
575 /// time, but struct or array values are handled element-wise as multiple
576 /// values. The splitting of aggregates is performed recursively, so that we
577 /// never have aggregate-typed registers. The values at this point do not
578 /// necessarily have legal types, so each value may require one or more
579 /// registers of some legal type.
581 struct RegsForValue {
582 /// ValueVTs - The value types of the values, which may not be legal, and
583 /// may need be promoted or synthesized from one or more registers.
585 SmallVector<EVT, 4> ValueVTs;
587 /// RegVTs - The value types of the registers. This is the same size as
588 /// ValueVTs and it records, for each value, what the type of the assigned
589 /// register or registers are. (Individual values are never synthesized
590 /// from more than one type of register.)
592 /// With virtual registers, the contents of RegVTs is redundant with TLI's
593 /// getRegisterType member function, however when with physical registers
594 /// it is necessary to have a separate record of the types.
596 SmallVector<MVT, 4> RegVTs;
598 /// Regs - This list holds the registers assigned to the values.
599 /// Each legal or promoted value requires one register, and each
600 /// expanded value requires multiple registers.
602 SmallVector<unsigned, 4> Regs;
606 RegsForValue(const SmallVector<unsigned, 4> ®s,
607 MVT regvt, EVT valuevt)
608 : ValueVTs(1, valuevt), RegVTs(1, regvt), Regs(regs) {}
610 RegsForValue(LLVMContext &Context, const TargetLowering &tli,
611 unsigned Reg, Type *Ty) {
612 ComputeValueVTs(tli, Ty, ValueVTs);
614 for (unsigned Value = 0, e = ValueVTs.size(); Value != e; ++Value) {
615 EVT ValueVT = ValueVTs[Value];
616 unsigned NumRegs = tli.getNumRegisters(Context, ValueVT);
617 MVT RegisterVT = tli.getRegisterType(Context, ValueVT);
618 for (unsigned i = 0; i != NumRegs; ++i)
619 Regs.push_back(Reg + i);
620 RegVTs.push_back(RegisterVT);
625 /// areValueTypesLegal - Return true if types of all the values are legal.
626 bool areValueTypesLegal(const TargetLowering &TLI) {
627 for (unsigned Value = 0, e = ValueVTs.size(); Value != e; ++Value) {
628 MVT RegisterVT = RegVTs[Value];
629 if (!TLI.isTypeLegal(RegisterVT))
635 /// append - Add the specified values to this one.
636 void append(const RegsForValue &RHS) {
637 ValueVTs.append(RHS.ValueVTs.begin(), RHS.ValueVTs.end());
638 RegVTs.append(RHS.RegVTs.begin(), RHS.RegVTs.end());
639 Regs.append(RHS.Regs.begin(), RHS.Regs.end());
642 /// getCopyFromRegs - Emit a series of CopyFromReg nodes that copies from
643 /// this value and returns the result as a ValueVTs value. This uses
644 /// Chain/Flag as the input and updates them for the output Chain/Flag.
645 /// If the Flag pointer is NULL, no flag is used.
646 SDValue getCopyFromRegs(SelectionDAG &DAG, FunctionLoweringInfo &FuncInfo,
648 SDValue &Chain, SDValue *Flag,
649 const Value *V = 0) const;
651 /// getCopyToRegs - Emit a series of CopyToReg nodes that copies the
652 /// specified value into the registers specified by this object. This uses
653 /// Chain/Flag as the input and updates them for the output Chain/Flag.
654 /// If the Flag pointer is NULL, no flag is used.
655 void getCopyToRegs(SDValue Val, SelectionDAG &DAG, DebugLoc dl,
656 SDValue &Chain, SDValue *Flag, const Value *V) const;
658 /// AddInlineAsmOperands - Add this value to the specified inlineasm node
659 /// operand list. This adds the code marker, matching input operand index
660 /// (if applicable), and includes the number of values added into it.
661 void AddInlineAsmOperands(unsigned Kind,
662 bool HasMatching, unsigned MatchingIdx,
664 std::vector<SDValue> &Ops) const;
668 /// getCopyFromRegs - Emit a series of CopyFromReg nodes that copies from
669 /// this value and returns the result as a ValueVT value. This uses
670 /// Chain/Flag as the input and updates them for the output Chain/Flag.
671 /// If the Flag pointer is NULL, no flag is used.
672 SDValue RegsForValue::getCopyFromRegs(SelectionDAG &DAG,
673 FunctionLoweringInfo &FuncInfo,
675 SDValue &Chain, SDValue *Flag,
676 const Value *V) const {
677 // A Value with type {} or [0 x %t] needs no registers.
678 if (ValueVTs.empty())
681 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
683 // Assemble the legal parts into the final values.
684 SmallVector<SDValue, 4> Values(ValueVTs.size());
685 SmallVector<SDValue, 8> Parts;
686 for (unsigned Value = 0, Part = 0, e = ValueVTs.size(); Value != e; ++Value) {
687 // Copy the legal parts from the registers.
688 EVT ValueVT = ValueVTs[Value];
689 unsigned NumRegs = TLI.getNumRegisters(*DAG.getContext(), ValueVT);
690 MVT RegisterVT = RegVTs[Value];
692 Parts.resize(NumRegs);
693 for (unsigned i = 0; i != NumRegs; ++i) {
696 P = DAG.getCopyFromReg(Chain, dl, Regs[Part+i], RegisterVT);
698 P = DAG.getCopyFromReg(Chain, dl, Regs[Part+i], RegisterVT, *Flag);
699 *Flag = P.getValue(2);
702 Chain = P.getValue(1);
705 // If the source register was virtual and if we know something about it,
706 // add an assert node.
707 if (!TargetRegisterInfo::isVirtualRegister(Regs[Part+i]) ||
708 !RegisterVT.isInteger() || RegisterVT.isVector())
711 const FunctionLoweringInfo::LiveOutInfo *LOI =
712 FuncInfo.GetLiveOutRegInfo(Regs[Part+i]);
716 unsigned RegSize = RegisterVT.getSizeInBits();
717 unsigned NumSignBits = LOI->NumSignBits;
718 unsigned NumZeroBits = LOI->KnownZero.countLeadingOnes();
720 // FIXME: We capture more information than the dag can represent. For
721 // now, just use the tightest assertzext/assertsext possible.
723 EVT FromVT(MVT::Other);
724 if (NumSignBits == RegSize)
725 isSExt = true, FromVT = MVT::i1; // ASSERT SEXT 1
726 else if (NumZeroBits >= RegSize-1)
727 isSExt = false, FromVT = MVT::i1; // ASSERT ZEXT 1
728 else if (NumSignBits > RegSize-8)
729 isSExt = true, FromVT = MVT::i8; // ASSERT SEXT 8
730 else if (NumZeroBits >= RegSize-8)
731 isSExt = false, FromVT = MVT::i8; // ASSERT ZEXT 8
732 else if (NumSignBits > RegSize-16)
733 isSExt = true, FromVT = MVT::i16; // ASSERT SEXT 16
734 else if (NumZeroBits >= RegSize-16)
735 isSExt = false, FromVT = MVT::i16; // ASSERT ZEXT 16
736 else if (NumSignBits > RegSize-32)
737 isSExt = true, FromVT = MVT::i32; // ASSERT SEXT 32
738 else if (NumZeroBits >= RegSize-32)
739 isSExt = false, FromVT = MVT::i32; // ASSERT ZEXT 32
743 // Add an assertion node.
744 assert(FromVT != MVT::Other);
745 Parts[i] = DAG.getNode(isSExt ? ISD::AssertSext : ISD::AssertZext, dl,
746 RegisterVT, P, DAG.getValueType(FromVT));
749 Values[Value] = getCopyFromParts(DAG, dl, Parts.begin(),
750 NumRegs, RegisterVT, ValueVT, V);
755 return DAG.getNode(ISD::MERGE_VALUES, dl,
756 DAG.getVTList(&ValueVTs[0], ValueVTs.size()),
757 &Values[0], ValueVTs.size());
760 /// getCopyToRegs - Emit a series of CopyToReg nodes that copies the
761 /// specified value into the registers specified by this object. This uses
762 /// Chain/Flag as the input and updates them for the output Chain/Flag.
763 /// If the Flag pointer is NULL, no flag is used.
764 void RegsForValue::getCopyToRegs(SDValue Val, SelectionDAG &DAG, DebugLoc dl,
765 SDValue &Chain, SDValue *Flag,
766 const Value *V) const {
767 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
769 // Get the list of the values's legal parts.
770 unsigned NumRegs = Regs.size();
771 SmallVector<SDValue, 8> Parts(NumRegs);
772 for (unsigned Value = 0, Part = 0, e = ValueVTs.size(); Value != e; ++Value) {
773 EVT ValueVT = ValueVTs[Value];
774 unsigned NumParts = TLI.getNumRegisters(*DAG.getContext(), ValueVT);
775 MVT RegisterVT = RegVTs[Value];
776 ISD::NodeType ExtendKind =
777 TLI.isZExtFree(Val, RegisterVT)? ISD::ZERO_EXTEND: ISD::ANY_EXTEND;
779 getCopyToParts(DAG, dl, Val.getValue(Val.getResNo() + Value),
780 &Parts[Part], NumParts, RegisterVT, V, ExtendKind);
784 // Copy the parts into the registers.
785 SmallVector<SDValue, 8> Chains(NumRegs);
786 for (unsigned i = 0; i != NumRegs; ++i) {
789 Part = DAG.getCopyToReg(Chain, dl, Regs[i], Parts[i]);
791 Part = DAG.getCopyToReg(Chain, dl, Regs[i], Parts[i], *Flag);
792 *Flag = Part.getValue(1);
795 Chains[i] = Part.getValue(0);
798 if (NumRegs == 1 || Flag)
799 // If NumRegs > 1 && Flag is used then the use of the last CopyToReg is
800 // flagged to it. That is the CopyToReg nodes and the user are considered
801 // a single scheduling unit. If we create a TokenFactor and return it as
802 // chain, then the TokenFactor is both a predecessor (operand) of the
803 // user as well as a successor (the TF operands are flagged to the user).
804 // c1, f1 = CopyToReg
805 // c2, f2 = CopyToReg
806 // c3 = TokenFactor c1, c2
809 Chain = Chains[NumRegs-1];
811 Chain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, &Chains[0], NumRegs);
814 /// AddInlineAsmOperands - Add this value to the specified inlineasm node
815 /// operand list. This adds the code marker and includes the number of
816 /// values added into it.
817 void RegsForValue::AddInlineAsmOperands(unsigned Code, bool HasMatching,
818 unsigned MatchingIdx,
820 std::vector<SDValue> &Ops) const {
821 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
823 unsigned Flag = InlineAsm::getFlagWord(Code, Regs.size());
825 Flag = InlineAsm::getFlagWordForMatchingOp(Flag, MatchingIdx);
826 else if (!Regs.empty() &&
827 TargetRegisterInfo::isVirtualRegister(Regs.front())) {
828 // Put the register class of the virtual registers in the flag word. That
829 // way, later passes can recompute register class constraints for inline
830 // assembly as well as normal instructions.
831 // Don't do this for tied operands that can use the regclass information
833 const MachineRegisterInfo &MRI = DAG.getMachineFunction().getRegInfo();
834 const TargetRegisterClass *RC = MRI.getRegClass(Regs.front());
835 Flag = InlineAsm::getFlagWordForRegClass(Flag, RC->getID());
838 SDValue Res = DAG.getTargetConstant(Flag, MVT::i32);
841 for (unsigned Value = 0, Reg = 0, e = ValueVTs.size(); Value != e; ++Value) {
842 unsigned NumRegs = TLI.getNumRegisters(*DAG.getContext(), ValueVTs[Value]);
843 MVT RegisterVT = RegVTs[Value];
844 for (unsigned i = 0; i != NumRegs; ++i) {
845 assert(Reg < Regs.size() && "Mismatch in # registers expected");
846 Ops.push_back(DAG.getRegister(Regs[Reg++], RegisterVT));
851 void SelectionDAGBuilder::init(GCFunctionInfo *gfi, AliasAnalysis &aa,
852 const TargetLibraryInfo *li) {
856 TD = DAG.getTarget().getDataLayout();
857 Context = DAG.getContext();
858 LPadToCallSiteMap.clear();
861 /// clear - Clear out the current SelectionDAG and the associated
862 /// state and prepare this SelectionDAGBuilder object to be used
863 /// for a new block. This doesn't clear out information about
864 /// additional blocks that are needed to complete switch lowering
865 /// or PHI node updating; that information is cleared out as it is
867 void SelectionDAGBuilder::clear() {
869 UnusedArgNodeMap.clear();
870 PendingLoads.clear();
871 PendingExports.clear();
872 CurDebugLoc = DebugLoc();
876 /// clearDanglingDebugInfo - Clear the dangling debug information
877 /// map. This function is separated from the clear so that debug
878 /// information that is dangling in a basic block can be properly
879 /// resolved in a different basic block. This allows the
880 /// SelectionDAG to resolve dangling debug information attached
882 void SelectionDAGBuilder::clearDanglingDebugInfo() {
883 DanglingDebugInfoMap.clear();
886 /// getRoot - Return the current virtual root of the Selection DAG,
887 /// flushing any PendingLoad items. This must be done before emitting
888 /// a store or any other node that may need to be ordered after any
889 /// prior load instructions.
891 SDValue SelectionDAGBuilder::getRoot() {
892 if (PendingLoads.empty())
893 return DAG.getRoot();
895 if (PendingLoads.size() == 1) {
896 SDValue Root = PendingLoads[0];
898 PendingLoads.clear();
902 // Otherwise, we have to make a token factor node.
903 SDValue Root = DAG.getNode(ISD::TokenFactor, getCurDebugLoc(), MVT::Other,
904 &PendingLoads[0], PendingLoads.size());
905 PendingLoads.clear();
910 /// getControlRoot - Similar to getRoot, but instead of flushing all the
911 /// PendingLoad items, flush all the PendingExports items. It is necessary
912 /// to do this before emitting a terminator instruction.
914 SDValue SelectionDAGBuilder::getControlRoot() {
915 SDValue Root = DAG.getRoot();
917 if (PendingExports.empty())
920 // Turn all of the CopyToReg chains into one factored node.
921 if (Root.getOpcode() != ISD::EntryToken) {
922 unsigned i = 0, e = PendingExports.size();
923 for (; i != e; ++i) {
924 assert(PendingExports[i].getNode()->getNumOperands() > 1);
925 if (PendingExports[i].getNode()->getOperand(0) == Root)
926 break; // Don't add the root if we already indirectly depend on it.
930 PendingExports.push_back(Root);
933 Root = DAG.getNode(ISD::TokenFactor, getCurDebugLoc(), MVT::Other,
935 PendingExports.size());
936 PendingExports.clear();
941 void SelectionDAGBuilder::AssignOrderingToNode(const SDNode *Node) {
942 if (DAG.GetOrdering(Node) != 0) return; // Already has ordering.
943 DAG.AssignOrdering(Node, SDNodeOrder);
945 for (unsigned I = 0, E = Node->getNumOperands(); I != E; ++I)
946 AssignOrderingToNode(Node->getOperand(I).getNode());
949 void SelectionDAGBuilder::visit(const Instruction &I) {
950 // Set up outgoing PHI node register values before emitting the terminator.
951 if (isa<TerminatorInst>(&I))
952 HandlePHINodesInSuccessorBlocks(I.getParent());
954 CurDebugLoc = I.getDebugLoc();
956 visit(I.getOpcode(), I);
958 if (!isa<TerminatorInst>(&I) && !HasTailCall)
959 CopyToExportRegsIfNeeded(&I);
961 CurDebugLoc = DebugLoc();
964 void SelectionDAGBuilder::visitPHI(const PHINode &) {
965 llvm_unreachable("SelectionDAGBuilder shouldn't visit PHI nodes!");
968 void SelectionDAGBuilder::visit(unsigned Opcode, const User &I) {
969 // Note: this doesn't use InstVisitor, because it has to work with
970 // ConstantExpr's in addition to instructions.
972 default: llvm_unreachable("Unknown instruction type encountered!");
973 // Build the switch statement using the Instruction.def file.
974 #define HANDLE_INST(NUM, OPCODE, CLASS) \
975 case Instruction::OPCODE: visit##OPCODE((const CLASS&)I); break;
976 #include "llvm/Instruction.def"
979 // Assign the ordering to the freshly created DAG nodes.
980 if (NodeMap.count(&I)) {
982 AssignOrderingToNode(getValue(&I).getNode());
986 // resolveDanglingDebugInfo - if we saw an earlier dbg_value referring to V,
987 // generate the debug data structures now that we've seen its definition.
988 void SelectionDAGBuilder::resolveDanglingDebugInfo(const Value *V,
990 DanglingDebugInfo &DDI = DanglingDebugInfoMap[V];
992 const DbgValueInst *DI = DDI.getDI();
993 DebugLoc dl = DDI.getdl();
994 unsigned DbgSDNodeOrder = DDI.getSDNodeOrder();
995 MDNode *Variable = DI->getVariable();
996 uint64_t Offset = DI->getOffset();
999 if (!EmitFuncArgumentDbgValue(V, Variable, Offset, Val)) {
1000 SDV = DAG.getDbgValue(Variable, Val.getNode(),
1001 Val.getResNo(), Offset, dl, DbgSDNodeOrder);
1002 DAG.AddDbgValue(SDV, Val.getNode(), false);
1005 DEBUG(dbgs() << "Dropping debug info for " << DI << "\n");
1006 DanglingDebugInfoMap[V] = DanglingDebugInfo();
1010 /// getValue - Return an SDValue for the given Value.
1011 SDValue SelectionDAGBuilder::getValue(const Value *V) {
1012 // If we already have an SDValue for this value, use it. It's important
1013 // to do this first, so that we don't create a CopyFromReg if we already
1014 // have a regular SDValue.
1015 SDValue &N = NodeMap[V];
1016 if (N.getNode()) return N;
1018 // If there's a virtual register allocated and initialized for this
1020 DenseMap<const Value *, unsigned>::iterator It = FuncInfo.ValueMap.find(V);
1021 if (It != FuncInfo.ValueMap.end()) {
1022 unsigned InReg = It->second;
1023 RegsForValue RFV(*DAG.getContext(), TLI, InReg, V->getType());
1024 SDValue Chain = DAG.getEntryNode();
1025 N = RFV.getCopyFromRegs(DAG, FuncInfo, getCurDebugLoc(), Chain, NULL, V);
1026 resolveDanglingDebugInfo(V, N);
1030 // Otherwise create a new SDValue and remember it.
1031 SDValue Val = getValueImpl(V);
1033 resolveDanglingDebugInfo(V, Val);
1037 /// getNonRegisterValue - Return an SDValue for the given Value, but
1038 /// don't look in FuncInfo.ValueMap for a virtual register.
1039 SDValue SelectionDAGBuilder::getNonRegisterValue(const Value *V) {
1040 // If we already have an SDValue for this value, use it.
1041 SDValue &N = NodeMap[V];
1042 if (N.getNode()) return N;
1044 // Otherwise create a new SDValue and remember it.
1045 SDValue Val = getValueImpl(V);
1047 resolveDanglingDebugInfo(V, Val);
1051 /// getValueImpl - Helper function for getValue and getNonRegisterValue.
1052 /// Create an SDValue for the given value.
1053 SDValue SelectionDAGBuilder::getValueImpl(const Value *V) {
1054 if (const Constant *C = dyn_cast<Constant>(V)) {
1055 EVT VT = TLI.getValueType(V->getType(), true);
1057 if (const ConstantInt *CI = dyn_cast<ConstantInt>(C))
1058 return DAG.getConstant(*CI, VT);
1060 if (const GlobalValue *GV = dyn_cast<GlobalValue>(C))
1061 return DAG.getGlobalAddress(GV, getCurDebugLoc(), VT);
1063 if (isa<ConstantPointerNull>(C))
1064 return DAG.getConstant(0, TLI.getPointerTy());
1066 if (const ConstantFP *CFP = dyn_cast<ConstantFP>(C))
1067 return DAG.getConstantFP(*CFP, VT);
1069 if (isa<UndefValue>(C) && !V->getType()->isAggregateType())
1070 return DAG.getUNDEF(VT);
1072 if (const ConstantExpr *CE = dyn_cast<ConstantExpr>(C)) {
1073 visit(CE->getOpcode(), *CE);
1074 SDValue N1 = NodeMap[V];
1075 assert(N1.getNode() && "visit didn't populate the NodeMap!");
1079 if (isa<ConstantStruct>(C) || isa<ConstantArray>(C)) {
1080 SmallVector<SDValue, 4> Constants;
1081 for (User::const_op_iterator OI = C->op_begin(), OE = C->op_end();
1083 SDNode *Val = getValue(*OI).getNode();
1084 // If the operand is an empty aggregate, there are no values.
1086 // Add each leaf value from the operand to the Constants list
1087 // to form a flattened list of all the values.
1088 for (unsigned i = 0, e = Val->getNumValues(); i != e; ++i)
1089 Constants.push_back(SDValue(Val, i));
1092 return DAG.getMergeValues(&Constants[0], Constants.size(),
1096 if (const ConstantDataSequential *CDS =
1097 dyn_cast<ConstantDataSequential>(C)) {
1098 SmallVector<SDValue, 4> Ops;
1099 for (unsigned i = 0, e = CDS->getNumElements(); i != e; ++i) {
1100 SDNode *Val = getValue(CDS->getElementAsConstant(i)).getNode();
1101 // Add each leaf value from the operand to the Constants list
1102 // to form a flattened list of all the values.
1103 for (unsigned i = 0, e = Val->getNumValues(); i != e; ++i)
1104 Ops.push_back(SDValue(Val, i));
1107 if (isa<ArrayType>(CDS->getType()))
1108 return DAG.getMergeValues(&Ops[0], Ops.size(), getCurDebugLoc());
1109 return NodeMap[V] = DAG.getNode(ISD::BUILD_VECTOR, getCurDebugLoc(),
1110 VT, &Ops[0], Ops.size());
1113 if (C->getType()->isStructTy() || C->getType()->isArrayTy()) {
1114 assert((isa<ConstantAggregateZero>(C) || isa<UndefValue>(C)) &&
1115 "Unknown struct or array constant!");
1117 SmallVector<EVT, 4> ValueVTs;
1118 ComputeValueVTs(TLI, C->getType(), ValueVTs);
1119 unsigned NumElts = ValueVTs.size();
1121 return SDValue(); // empty struct
1122 SmallVector<SDValue, 4> Constants(NumElts);
1123 for (unsigned i = 0; i != NumElts; ++i) {
1124 EVT EltVT = ValueVTs[i];
1125 if (isa<UndefValue>(C))
1126 Constants[i] = DAG.getUNDEF(EltVT);
1127 else if (EltVT.isFloatingPoint())
1128 Constants[i] = DAG.getConstantFP(0, EltVT);
1130 Constants[i] = DAG.getConstant(0, EltVT);
1133 return DAG.getMergeValues(&Constants[0], NumElts,
1137 if (const BlockAddress *BA = dyn_cast<BlockAddress>(C))
1138 return DAG.getBlockAddress(BA, VT);
1140 VectorType *VecTy = cast<VectorType>(V->getType());
1141 unsigned NumElements = VecTy->getNumElements();
1143 // Now that we know the number and type of the elements, get that number of
1144 // elements into the Ops array based on what kind of constant it is.
1145 SmallVector<SDValue, 16> Ops;
1146 if (const ConstantVector *CV = dyn_cast<ConstantVector>(C)) {
1147 for (unsigned i = 0; i != NumElements; ++i)
1148 Ops.push_back(getValue(CV->getOperand(i)));
1150 assert(isa<ConstantAggregateZero>(C) && "Unknown vector constant!");
1151 EVT EltVT = TLI.getValueType(VecTy->getElementType());
1154 if (EltVT.isFloatingPoint())
1155 Op = DAG.getConstantFP(0, EltVT);
1157 Op = DAG.getConstant(0, EltVT);
1158 Ops.assign(NumElements, Op);
1161 // Create a BUILD_VECTOR node.
1162 return NodeMap[V] = DAG.getNode(ISD::BUILD_VECTOR, getCurDebugLoc(),
1163 VT, &Ops[0], Ops.size());
1166 // If this is a static alloca, generate it as the frameindex instead of
1168 if (const AllocaInst *AI = dyn_cast<AllocaInst>(V)) {
1169 DenseMap<const AllocaInst*, int>::iterator SI =
1170 FuncInfo.StaticAllocaMap.find(AI);
1171 if (SI != FuncInfo.StaticAllocaMap.end())
1172 return DAG.getFrameIndex(SI->second, TLI.getPointerTy());
1175 // If this is an instruction which fast-isel has deferred, select it now.
1176 if (const Instruction *Inst = dyn_cast<Instruction>(V)) {
1177 unsigned InReg = FuncInfo.InitializeRegForValue(Inst);
1178 RegsForValue RFV(*DAG.getContext(), TLI, InReg, Inst->getType());
1179 SDValue Chain = DAG.getEntryNode();
1180 return RFV.getCopyFromRegs(DAG, FuncInfo, getCurDebugLoc(), Chain, NULL, V);
1183 llvm_unreachable("Can't get register for value!");
1186 void SelectionDAGBuilder::visitRet(const ReturnInst &I) {
1187 SDValue Chain = getControlRoot();
1188 SmallVector<ISD::OutputArg, 8> Outs;
1189 SmallVector<SDValue, 8> OutVals;
1191 if (!FuncInfo.CanLowerReturn) {
1192 unsigned DemoteReg = FuncInfo.DemoteRegister;
1193 const Function *F = I.getParent()->getParent();
1195 // Emit a store of the return value through the virtual register.
1196 // Leave Outs empty so that LowerReturn won't try to load return
1197 // registers the usual way.
1198 SmallVector<EVT, 1> PtrValueVTs;
1199 ComputeValueVTs(TLI, PointerType::getUnqual(F->getReturnType()),
1202 SDValue RetPtr = DAG.getRegister(DemoteReg, PtrValueVTs[0]);
1203 SDValue RetOp = getValue(I.getOperand(0));
1205 SmallVector<EVT, 4> ValueVTs;
1206 SmallVector<uint64_t, 4> Offsets;
1207 ComputeValueVTs(TLI, I.getOperand(0)->getType(), ValueVTs, &Offsets);
1208 unsigned NumValues = ValueVTs.size();
1210 SmallVector<SDValue, 4> Chains(NumValues);
1211 for (unsigned i = 0; i != NumValues; ++i) {
1212 SDValue Add = DAG.getNode(ISD::ADD, getCurDebugLoc(),
1213 RetPtr.getValueType(), RetPtr,
1214 DAG.getIntPtrConstant(Offsets[i]));
1216 DAG.getStore(Chain, getCurDebugLoc(),
1217 SDValue(RetOp.getNode(), RetOp.getResNo() + i),
1218 // FIXME: better loc info would be nice.
1219 Add, MachinePointerInfo(), false, false, 0);
1222 Chain = DAG.getNode(ISD::TokenFactor, getCurDebugLoc(),
1223 MVT::Other, &Chains[0], NumValues);
1224 } else if (I.getNumOperands() != 0) {
1225 SmallVector<EVT, 4> ValueVTs;
1226 ComputeValueVTs(TLI, I.getOperand(0)->getType(), ValueVTs);
1227 unsigned NumValues = ValueVTs.size();
1229 SDValue RetOp = getValue(I.getOperand(0));
1230 for (unsigned j = 0, f = NumValues; j != f; ++j) {
1231 EVT VT = ValueVTs[j];
1233 ISD::NodeType ExtendKind = ISD::ANY_EXTEND;
1235 const Function *F = I.getParent()->getParent();
1236 if (F->getRetAttributes().hasAttribute(Attribute::SExt))
1237 ExtendKind = ISD::SIGN_EXTEND;
1238 else if (F->getRetAttributes().hasAttribute(Attribute::ZExt))
1239 ExtendKind = ISD::ZERO_EXTEND;
1241 if (ExtendKind != ISD::ANY_EXTEND && VT.isInteger())
1242 VT = TLI.getTypeForExtArgOrReturn(VT.getSimpleVT(), ExtendKind);
1244 unsigned NumParts = TLI.getNumRegisters(*DAG.getContext(), VT);
1245 MVT PartVT = TLI.getRegisterType(*DAG.getContext(), VT);
1246 SmallVector<SDValue, 4> Parts(NumParts);
1247 getCopyToParts(DAG, getCurDebugLoc(),
1248 SDValue(RetOp.getNode(), RetOp.getResNo() + j),
1249 &Parts[0], NumParts, PartVT, &I, ExtendKind);
1251 // 'inreg' on function refers to return value
1252 ISD::ArgFlagsTy Flags = ISD::ArgFlagsTy();
1253 if (F->getRetAttributes().hasAttribute(Attribute::InReg))
1256 // Propagate extension type if any
1257 if (ExtendKind == ISD::SIGN_EXTEND)
1259 else if (ExtendKind == ISD::ZERO_EXTEND)
1262 for (unsigned i = 0; i < NumParts; ++i) {
1263 Outs.push_back(ISD::OutputArg(Flags, Parts[i].getValueType(),
1264 /*isfixed=*/true, 0, 0));
1265 OutVals.push_back(Parts[i]);
1271 bool isVarArg = DAG.getMachineFunction().getFunction()->isVarArg();
1272 CallingConv::ID CallConv =
1273 DAG.getMachineFunction().getFunction()->getCallingConv();
1274 Chain = TLI.LowerReturn(Chain, CallConv, isVarArg,
1275 Outs, OutVals, getCurDebugLoc(), DAG);
1277 // Verify that the target's LowerReturn behaved as expected.
1278 assert(Chain.getNode() && Chain.getValueType() == MVT::Other &&
1279 "LowerReturn didn't return a valid chain!");
1281 // Update the DAG with the new chain value resulting from return lowering.
1285 /// CopyToExportRegsIfNeeded - If the given value has virtual registers
1286 /// created for it, emit nodes to copy the value into the virtual
1288 void SelectionDAGBuilder::CopyToExportRegsIfNeeded(const Value *V) {
1290 if (V->getType()->isEmptyTy())
1293 DenseMap<const Value *, unsigned>::iterator VMI = FuncInfo.ValueMap.find(V);
1294 if (VMI != FuncInfo.ValueMap.end()) {
1295 assert(!V->use_empty() && "Unused value assigned virtual registers!");
1296 CopyValueToVirtualRegister(V, VMI->second);
1300 /// ExportFromCurrentBlock - If this condition isn't known to be exported from
1301 /// the current basic block, add it to ValueMap now so that we'll get a
1303 void SelectionDAGBuilder::ExportFromCurrentBlock(const Value *V) {
1304 // No need to export constants.
1305 if (!isa<Instruction>(V) && !isa<Argument>(V)) return;
1307 // Already exported?
1308 if (FuncInfo.isExportedInst(V)) return;
1310 unsigned Reg = FuncInfo.InitializeRegForValue(V);
1311 CopyValueToVirtualRegister(V, Reg);
1314 bool SelectionDAGBuilder::isExportableFromCurrentBlock(const Value *V,
1315 const BasicBlock *FromBB) {
1316 // The operands of the setcc have to be in this block. We don't know
1317 // how to export them from some other block.
1318 if (const Instruction *VI = dyn_cast<Instruction>(V)) {
1319 // Can export from current BB.
1320 if (VI->getParent() == FromBB)
1323 // Is already exported, noop.
1324 return FuncInfo.isExportedInst(V);
1327 // If this is an argument, we can export it if the BB is the entry block or
1328 // if it is already exported.
1329 if (isa<Argument>(V)) {
1330 if (FromBB == &FromBB->getParent()->getEntryBlock())
1333 // Otherwise, can only export this if it is already exported.
1334 return FuncInfo.isExportedInst(V);
1337 // Otherwise, constants can always be exported.
1341 /// Return branch probability calculated by BranchProbabilityInfo for IR blocks.
1342 uint32_t SelectionDAGBuilder::getEdgeWeight(const MachineBasicBlock *Src,
1343 const MachineBasicBlock *Dst) const {
1344 BranchProbabilityInfo *BPI = FuncInfo.BPI;
1347 const BasicBlock *SrcBB = Src->getBasicBlock();
1348 const BasicBlock *DstBB = Dst->getBasicBlock();
1349 return BPI->getEdgeWeight(SrcBB, DstBB);
1352 void SelectionDAGBuilder::
1353 addSuccessorWithWeight(MachineBasicBlock *Src, MachineBasicBlock *Dst,
1354 uint32_t Weight /* = 0 */) {
1356 Weight = getEdgeWeight(Src, Dst);
1357 Src->addSuccessor(Dst, Weight);
1361 static bool InBlock(const Value *V, const BasicBlock *BB) {
1362 if (const Instruction *I = dyn_cast<Instruction>(V))
1363 return I->getParent() == BB;
1367 /// EmitBranchForMergedCondition - Helper method for FindMergedConditions.
1368 /// This function emits a branch and is used at the leaves of an OR or an
1369 /// AND operator tree.
1372 SelectionDAGBuilder::EmitBranchForMergedCondition(const Value *Cond,
1373 MachineBasicBlock *TBB,
1374 MachineBasicBlock *FBB,
1375 MachineBasicBlock *CurBB,
1376 MachineBasicBlock *SwitchBB) {
1377 const BasicBlock *BB = CurBB->getBasicBlock();
1379 // If the leaf of the tree is a comparison, merge the condition into
1381 if (const CmpInst *BOp = dyn_cast<CmpInst>(Cond)) {
1382 // The operands of the cmp have to be in this block. We don't know
1383 // how to export them from some other block. If this is the first block
1384 // of the sequence, no exporting is needed.
1385 if (CurBB == SwitchBB ||
1386 (isExportableFromCurrentBlock(BOp->getOperand(0), BB) &&
1387 isExportableFromCurrentBlock(BOp->getOperand(1), BB))) {
1388 ISD::CondCode Condition;
1389 if (const ICmpInst *IC = dyn_cast<ICmpInst>(Cond)) {
1390 Condition = getICmpCondCode(IC->getPredicate());
1391 } else if (const FCmpInst *FC = dyn_cast<FCmpInst>(Cond)) {
1392 Condition = getFCmpCondCode(FC->getPredicate());
1393 if (TM.Options.NoNaNsFPMath)
1394 Condition = getFCmpCodeWithoutNaN(Condition);
1396 Condition = ISD::SETEQ; // silence warning.
1397 llvm_unreachable("Unknown compare instruction");
1400 CaseBlock CB(Condition, BOp->getOperand(0),
1401 BOp->getOperand(1), NULL, TBB, FBB, CurBB);
1402 SwitchCases.push_back(CB);
1407 // Create a CaseBlock record representing this branch.
1408 CaseBlock CB(ISD::SETEQ, Cond, ConstantInt::getTrue(*DAG.getContext()),
1409 NULL, TBB, FBB, CurBB);
1410 SwitchCases.push_back(CB);
1413 /// FindMergedConditions - If Cond is an expression like
1414 void SelectionDAGBuilder::FindMergedConditions(const Value *Cond,
1415 MachineBasicBlock *TBB,
1416 MachineBasicBlock *FBB,
1417 MachineBasicBlock *CurBB,
1418 MachineBasicBlock *SwitchBB,
1420 // If this node is not part of the or/and tree, emit it as a branch.
1421 const Instruction *BOp = dyn_cast<Instruction>(Cond);
1422 if (!BOp || !(isa<BinaryOperator>(BOp) || isa<CmpInst>(BOp)) ||
1423 (unsigned)BOp->getOpcode() != Opc || !BOp->hasOneUse() ||
1424 BOp->getParent() != CurBB->getBasicBlock() ||
1425 !InBlock(BOp->getOperand(0), CurBB->getBasicBlock()) ||
1426 !InBlock(BOp->getOperand(1), CurBB->getBasicBlock())) {
1427 EmitBranchForMergedCondition(Cond, TBB, FBB, CurBB, SwitchBB);
1431 // Create TmpBB after CurBB.
1432 MachineFunction::iterator BBI = CurBB;
1433 MachineFunction &MF = DAG.getMachineFunction();
1434 MachineBasicBlock *TmpBB = MF.CreateMachineBasicBlock(CurBB->getBasicBlock());
1435 CurBB->getParent()->insert(++BBI, TmpBB);
1437 if (Opc == Instruction::Or) {
1438 // Codegen X | Y as:
1446 // Emit the LHS condition.
1447 FindMergedConditions(BOp->getOperand(0), TBB, TmpBB, CurBB, SwitchBB, Opc);
1449 // Emit the RHS condition into TmpBB.
1450 FindMergedConditions(BOp->getOperand(1), TBB, FBB, TmpBB, SwitchBB, Opc);
1452 assert(Opc == Instruction::And && "Unknown merge op!");
1453 // Codegen X & Y as:
1460 // This requires creation of TmpBB after CurBB.
1462 // Emit the LHS condition.
1463 FindMergedConditions(BOp->getOperand(0), TmpBB, FBB, CurBB, SwitchBB, Opc);
1465 // Emit the RHS condition into TmpBB.
1466 FindMergedConditions(BOp->getOperand(1), TBB, FBB, TmpBB, SwitchBB, Opc);
1470 /// If the set of cases should be emitted as a series of branches, return true.
1471 /// If we should emit this as a bunch of and/or'd together conditions, return
1474 SelectionDAGBuilder::ShouldEmitAsBranches(const std::vector<CaseBlock> &Cases){
1475 if (Cases.size() != 2) return true;
1477 // If this is two comparisons of the same values or'd or and'd together, they
1478 // will get folded into a single comparison, so don't emit two blocks.
1479 if ((Cases[0].CmpLHS == Cases[1].CmpLHS &&
1480 Cases[0].CmpRHS == Cases[1].CmpRHS) ||
1481 (Cases[0].CmpRHS == Cases[1].CmpLHS &&
1482 Cases[0].CmpLHS == Cases[1].CmpRHS)) {
1486 // Handle: (X != null) | (Y != null) --> (X|Y) != 0
1487 // Handle: (X == null) & (Y == null) --> (X|Y) == 0
1488 if (Cases[0].CmpRHS == Cases[1].CmpRHS &&
1489 Cases[0].CC == Cases[1].CC &&
1490 isa<Constant>(Cases[0].CmpRHS) &&
1491 cast<Constant>(Cases[0].CmpRHS)->isNullValue()) {
1492 if (Cases[0].CC == ISD::SETEQ && Cases[0].TrueBB == Cases[1].ThisBB)
1494 if (Cases[0].CC == ISD::SETNE && Cases[0].FalseBB == Cases[1].ThisBB)
1501 void SelectionDAGBuilder::visitBr(const BranchInst &I) {
1502 MachineBasicBlock *BrMBB = FuncInfo.MBB;
1504 // Update machine-CFG edges.
1505 MachineBasicBlock *Succ0MBB = FuncInfo.MBBMap[I.getSuccessor(0)];
1507 // Figure out which block is immediately after the current one.
1508 MachineBasicBlock *NextBlock = 0;
1509 MachineFunction::iterator BBI = BrMBB;
1510 if (++BBI != FuncInfo.MF->end())
1513 if (I.isUnconditional()) {
1514 // Update machine-CFG edges.
1515 BrMBB->addSuccessor(Succ0MBB);
1517 // If this is not a fall-through branch, emit the branch.
1518 if (Succ0MBB != NextBlock)
1519 DAG.setRoot(DAG.getNode(ISD::BR, getCurDebugLoc(),
1520 MVT::Other, getControlRoot(),
1521 DAG.getBasicBlock(Succ0MBB)));
1526 // If this condition is one of the special cases we handle, do special stuff
1528 const Value *CondVal = I.getCondition();
1529 MachineBasicBlock *Succ1MBB = FuncInfo.MBBMap[I.getSuccessor(1)];
1531 // If this is a series of conditions that are or'd or and'd together, emit
1532 // this as a sequence of branches instead of setcc's with and/or operations.
1533 // As long as jumps are not expensive, this should improve performance.
1534 // For example, instead of something like:
1547 if (const BinaryOperator *BOp = dyn_cast<BinaryOperator>(CondVal)) {
1548 if (!TLI.isJumpExpensive() &&
1550 (BOp->getOpcode() == Instruction::And ||
1551 BOp->getOpcode() == Instruction::Or)) {
1552 FindMergedConditions(BOp, Succ0MBB, Succ1MBB, BrMBB, BrMBB,
1554 // If the compares in later blocks need to use values not currently
1555 // exported from this block, export them now. This block should always
1556 // be the first entry.
1557 assert(SwitchCases[0].ThisBB == BrMBB && "Unexpected lowering!");
1559 // Allow some cases to be rejected.
1560 if (ShouldEmitAsBranches(SwitchCases)) {
1561 for (unsigned i = 1, e = SwitchCases.size(); i != e; ++i) {
1562 ExportFromCurrentBlock(SwitchCases[i].CmpLHS);
1563 ExportFromCurrentBlock(SwitchCases[i].CmpRHS);
1566 // Emit the branch for this block.
1567 visitSwitchCase(SwitchCases[0], BrMBB);
1568 SwitchCases.erase(SwitchCases.begin());
1572 // Okay, we decided not to do this, remove any inserted MBB's and clear
1574 for (unsigned i = 1, e = SwitchCases.size(); i != e; ++i)
1575 FuncInfo.MF->erase(SwitchCases[i].ThisBB);
1577 SwitchCases.clear();
1581 // Create a CaseBlock record representing this branch.
1582 CaseBlock CB(ISD::SETEQ, CondVal, ConstantInt::getTrue(*DAG.getContext()),
1583 NULL, Succ0MBB, Succ1MBB, BrMBB);
1585 // Use visitSwitchCase to actually insert the fast branch sequence for this
1587 visitSwitchCase(CB, BrMBB);
1590 /// visitSwitchCase - Emits the necessary code to represent a single node in
1591 /// the binary search tree resulting from lowering a switch instruction.
1592 void SelectionDAGBuilder::visitSwitchCase(CaseBlock &CB,
1593 MachineBasicBlock *SwitchBB) {
1595 SDValue CondLHS = getValue(CB.CmpLHS);
1596 DebugLoc dl = getCurDebugLoc();
1598 // Build the setcc now.
1599 if (CB.CmpMHS == NULL) {
1600 // Fold "(X == true)" to X and "(X == false)" to !X to
1601 // handle common cases produced by branch lowering.
1602 if (CB.CmpRHS == ConstantInt::getTrue(*DAG.getContext()) &&
1603 CB.CC == ISD::SETEQ)
1605 else if (CB.CmpRHS == ConstantInt::getFalse(*DAG.getContext()) &&
1606 CB.CC == ISD::SETEQ) {
1607 SDValue True = DAG.getConstant(1, CondLHS.getValueType());
1608 Cond = DAG.getNode(ISD::XOR, dl, CondLHS.getValueType(), CondLHS, True);
1610 Cond = DAG.getSetCC(dl, MVT::i1, CondLHS, getValue(CB.CmpRHS), CB.CC);
1612 assert(CB.CC == ISD::SETCC_INVALID &&
1613 "Condition is undefined for to-the-range belonging check.");
1615 const APInt& Low = cast<ConstantInt>(CB.CmpLHS)->getValue();
1616 const APInt& High = cast<ConstantInt>(CB.CmpRHS)->getValue();
1618 SDValue CmpOp = getValue(CB.CmpMHS);
1619 EVT VT = CmpOp.getValueType();
1621 if (cast<ConstantInt>(CB.CmpLHS)->isMinValue(false)) {
1622 Cond = DAG.getSetCC(dl, MVT::i1, CmpOp, DAG.getConstant(High, VT),
1625 SDValue SUB = DAG.getNode(ISD::SUB, dl,
1626 VT, CmpOp, DAG.getConstant(Low, VT));
1627 Cond = DAG.getSetCC(dl, MVT::i1, SUB,
1628 DAG.getConstant(High-Low, VT), ISD::SETULE);
1632 // Update successor info
1633 addSuccessorWithWeight(SwitchBB, CB.TrueBB, CB.TrueWeight);
1634 // TrueBB and FalseBB are always different unless the incoming IR is
1635 // degenerate. This only happens when running llc on weird IR.
1636 if (CB.TrueBB != CB.FalseBB)
1637 addSuccessorWithWeight(SwitchBB, CB.FalseBB, CB.FalseWeight);
1639 // Set NextBlock to be the MBB immediately after the current one, if any.
1640 // This is used to avoid emitting unnecessary branches to the next block.
1641 MachineBasicBlock *NextBlock = 0;
1642 MachineFunction::iterator BBI = SwitchBB;
1643 if (++BBI != FuncInfo.MF->end())
1646 // If the lhs block is the next block, invert the condition so that we can
1647 // fall through to the lhs instead of the rhs block.
1648 if (CB.TrueBB == NextBlock) {
1649 std::swap(CB.TrueBB, CB.FalseBB);
1650 SDValue True = DAG.getConstant(1, Cond.getValueType());
1651 Cond = DAG.getNode(ISD::XOR, dl, Cond.getValueType(), Cond, True);
1654 SDValue BrCond = DAG.getNode(ISD::BRCOND, dl,
1655 MVT::Other, getControlRoot(), Cond,
1656 DAG.getBasicBlock(CB.TrueBB));
1658 // Insert the false branch. Do this even if it's a fall through branch,
1659 // this makes it easier to do DAG optimizations which require inverting
1660 // the branch condition.
1661 BrCond = DAG.getNode(ISD::BR, dl, MVT::Other, BrCond,
1662 DAG.getBasicBlock(CB.FalseBB));
1664 DAG.setRoot(BrCond);
1667 /// visitJumpTable - Emit JumpTable node in the current MBB
1668 void SelectionDAGBuilder::visitJumpTable(JumpTable &JT) {
1669 // Emit the code for the jump table
1670 assert(JT.Reg != -1U && "Should lower JT Header first!");
1671 EVT PTy = TLI.getPointerTy();
1672 SDValue Index = DAG.getCopyFromReg(getControlRoot(), getCurDebugLoc(),
1674 SDValue Table = DAG.getJumpTable(JT.JTI, PTy);
1675 SDValue BrJumpTable = DAG.getNode(ISD::BR_JT, getCurDebugLoc(),
1676 MVT::Other, Index.getValue(1),
1678 DAG.setRoot(BrJumpTable);
1681 /// visitJumpTableHeader - This function emits necessary code to produce index
1682 /// in the JumpTable from switch case.
1683 void SelectionDAGBuilder::visitJumpTableHeader(JumpTable &JT,
1684 JumpTableHeader &JTH,
1685 MachineBasicBlock *SwitchBB) {
1686 // Subtract the lowest switch case value from the value being switched on and
1687 // conditional branch to default mbb if the result is greater than the
1688 // difference between smallest and largest cases.
1689 SDValue SwitchOp = getValue(JTH.SValue);
1690 EVT VT = SwitchOp.getValueType();
1691 SDValue Sub = DAG.getNode(ISD::SUB, getCurDebugLoc(), VT, SwitchOp,
1692 DAG.getConstant(JTH.First, VT));
1694 // The SDNode we just created, which holds the value being switched on minus
1695 // the smallest case value, needs to be copied to a virtual register so it
1696 // can be used as an index into the jump table in a subsequent basic block.
1697 // This value may be smaller or larger than the target's pointer type, and
1698 // therefore require extension or truncating.
1699 SwitchOp = DAG.getZExtOrTrunc(Sub, getCurDebugLoc(), TLI.getPointerTy());
1701 unsigned JumpTableReg = FuncInfo.CreateReg(TLI.getPointerTy());
1702 SDValue CopyTo = DAG.getCopyToReg(getControlRoot(), getCurDebugLoc(),
1703 JumpTableReg, SwitchOp);
1704 JT.Reg = JumpTableReg;
1706 // Emit the range check for the jump table, and branch to the default block
1707 // for the switch statement if the value being switched on exceeds the largest
1708 // case in the switch.
1709 SDValue CMP = DAG.getSetCC(getCurDebugLoc(),
1710 TLI.getSetCCResultType(Sub.getValueType()), Sub,
1711 DAG.getConstant(JTH.Last-JTH.First,VT),
1714 // Set NextBlock to be the MBB immediately after the current one, if any.
1715 // This is used to avoid emitting unnecessary branches to the next block.
1716 MachineBasicBlock *NextBlock = 0;
1717 MachineFunction::iterator BBI = SwitchBB;
1719 if (++BBI != FuncInfo.MF->end())
1722 SDValue BrCond = DAG.getNode(ISD::BRCOND, getCurDebugLoc(),
1723 MVT::Other, CopyTo, CMP,
1724 DAG.getBasicBlock(JT.Default));
1726 if (JT.MBB != NextBlock)
1727 BrCond = DAG.getNode(ISD::BR, getCurDebugLoc(), MVT::Other, BrCond,
1728 DAG.getBasicBlock(JT.MBB));
1730 DAG.setRoot(BrCond);
1733 /// visitBitTestHeader - This function emits necessary code to produce value
1734 /// suitable for "bit tests"
1735 void SelectionDAGBuilder::visitBitTestHeader(BitTestBlock &B,
1736 MachineBasicBlock *SwitchBB) {
1737 // Subtract the minimum value
1738 SDValue SwitchOp = getValue(B.SValue);
1739 EVT VT = SwitchOp.getValueType();
1740 SDValue Sub = DAG.getNode(ISD::SUB, getCurDebugLoc(), VT, SwitchOp,
1741 DAG.getConstant(B.First, VT));
1744 SDValue RangeCmp = DAG.getSetCC(getCurDebugLoc(),
1745 TLI.getSetCCResultType(Sub.getValueType()),
1746 Sub, DAG.getConstant(B.Range, VT),
1749 // Determine the type of the test operands.
1750 bool UsePtrType = false;
1751 if (!TLI.isTypeLegal(VT))
1754 for (unsigned i = 0, e = B.Cases.size(); i != e; ++i)
1755 if (!isUIntN(VT.getSizeInBits(), B.Cases[i].Mask)) {
1756 // Switch table case range are encoded into series of masks.
1757 // Just use pointer type, it's guaranteed to fit.
1763 VT = TLI.getPointerTy();
1764 Sub = DAG.getZExtOrTrunc(Sub, getCurDebugLoc(), VT);
1767 B.RegVT = VT.getSimpleVT();
1768 B.Reg = FuncInfo.CreateReg(B.RegVT);
1769 SDValue CopyTo = DAG.getCopyToReg(getControlRoot(), getCurDebugLoc(),
1772 // Set NextBlock to be the MBB immediately after the current one, if any.
1773 // This is used to avoid emitting unnecessary branches to the next block.
1774 MachineBasicBlock *NextBlock = 0;
1775 MachineFunction::iterator BBI = SwitchBB;
1776 if (++BBI != FuncInfo.MF->end())
1779 MachineBasicBlock* MBB = B.Cases[0].ThisBB;
1781 addSuccessorWithWeight(SwitchBB, B.Default);
1782 addSuccessorWithWeight(SwitchBB, MBB);
1784 SDValue BrRange = DAG.getNode(ISD::BRCOND, getCurDebugLoc(),
1785 MVT::Other, CopyTo, RangeCmp,
1786 DAG.getBasicBlock(B.Default));
1788 if (MBB != NextBlock)
1789 BrRange = DAG.getNode(ISD::BR, getCurDebugLoc(), MVT::Other, CopyTo,
1790 DAG.getBasicBlock(MBB));
1792 DAG.setRoot(BrRange);
1795 /// visitBitTestCase - this function produces one "bit test"
1796 void SelectionDAGBuilder::visitBitTestCase(BitTestBlock &BB,
1797 MachineBasicBlock* NextMBB,
1798 uint32_t BranchWeightToNext,
1801 MachineBasicBlock *SwitchBB) {
1803 SDValue ShiftOp = DAG.getCopyFromReg(getControlRoot(), getCurDebugLoc(),
1806 unsigned PopCount = CountPopulation_64(B.Mask);
1807 if (PopCount == 1) {
1808 // Testing for a single bit; just compare the shift count with what it
1809 // would need to be to shift a 1 bit in that position.
1810 Cmp = DAG.getSetCC(getCurDebugLoc(),
1811 TLI.getSetCCResultType(VT),
1813 DAG.getConstant(CountTrailingZeros_64(B.Mask), VT),
1815 } else if (PopCount == BB.Range) {
1816 // There is only one zero bit in the range, test for it directly.
1817 Cmp = DAG.getSetCC(getCurDebugLoc(),
1818 TLI.getSetCCResultType(VT),
1820 DAG.getConstant(CountTrailingOnes_64(B.Mask), VT),
1823 // Make desired shift
1824 SDValue SwitchVal = DAG.getNode(ISD::SHL, getCurDebugLoc(), VT,
1825 DAG.getConstant(1, VT), ShiftOp);
1827 // Emit bit tests and jumps
1828 SDValue AndOp = DAG.getNode(ISD::AND, getCurDebugLoc(),
1829 VT, SwitchVal, DAG.getConstant(B.Mask, VT));
1830 Cmp = DAG.getSetCC(getCurDebugLoc(),
1831 TLI.getSetCCResultType(VT),
1832 AndOp, DAG.getConstant(0, VT),
1836 // The branch weight from SwitchBB to B.TargetBB is B.ExtraWeight.
1837 addSuccessorWithWeight(SwitchBB, B.TargetBB, B.ExtraWeight);
1838 // The branch weight from SwitchBB to NextMBB is BranchWeightToNext.
1839 addSuccessorWithWeight(SwitchBB, NextMBB, BranchWeightToNext);
1841 SDValue BrAnd = DAG.getNode(ISD::BRCOND, getCurDebugLoc(),
1842 MVT::Other, getControlRoot(),
1843 Cmp, DAG.getBasicBlock(B.TargetBB));
1845 // Set NextBlock to be the MBB immediately after the current one, if any.
1846 // This is used to avoid emitting unnecessary branches to the next block.
1847 MachineBasicBlock *NextBlock = 0;
1848 MachineFunction::iterator BBI = SwitchBB;
1849 if (++BBI != FuncInfo.MF->end())
1852 if (NextMBB != NextBlock)
1853 BrAnd = DAG.getNode(ISD::BR, getCurDebugLoc(), MVT::Other, BrAnd,
1854 DAG.getBasicBlock(NextMBB));
1859 void SelectionDAGBuilder::visitInvoke(const InvokeInst &I) {
1860 MachineBasicBlock *InvokeMBB = FuncInfo.MBB;
1862 // Retrieve successors.
1863 MachineBasicBlock *Return = FuncInfo.MBBMap[I.getSuccessor(0)];
1864 MachineBasicBlock *LandingPad = FuncInfo.MBBMap[I.getSuccessor(1)];
1866 const Value *Callee(I.getCalledValue());
1867 const Function *Fn = dyn_cast<Function>(Callee);
1868 if (isa<InlineAsm>(Callee))
1870 else if (Fn && Fn->isIntrinsic()) {
1871 assert(Fn->getIntrinsicID() == Intrinsic::donothing);
1872 // Ignore invokes to @llvm.donothing: jump directly to the next BB.
1874 LowerCallTo(&I, getValue(Callee), false, LandingPad);
1876 // If the value of the invoke is used outside of its defining block, make it
1877 // available as a virtual register.
1878 CopyToExportRegsIfNeeded(&I);
1880 // Update successor info
1881 addSuccessorWithWeight(InvokeMBB, Return);
1882 addSuccessorWithWeight(InvokeMBB, LandingPad);
1884 // Drop into normal successor.
1885 DAG.setRoot(DAG.getNode(ISD::BR, getCurDebugLoc(),
1886 MVT::Other, getControlRoot(),
1887 DAG.getBasicBlock(Return)));
1890 void SelectionDAGBuilder::visitResume(const ResumeInst &RI) {
1891 llvm_unreachable("SelectionDAGBuilder shouldn't visit resume instructions!");
1894 void SelectionDAGBuilder::visitLandingPad(const LandingPadInst &LP) {
1895 assert(FuncInfo.MBB->isLandingPad() &&
1896 "Call to landingpad not in landing pad!");
1898 MachineBasicBlock *MBB = FuncInfo.MBB;
1899 MachineModuleInfo &MMI = DAG.getMachineFunction().getMMI();
1900 AddLandingPadInfo(LP, MMI, MBB);
1902 // If there aren't registers to copy the values into (e.g., during SjLj
1903 // exceptions), then don't bother to create these DAG nodes.
1904 if (TLI.getExceptionPointerRegister() == 0 &&
1905 TLI.getExceptionSelectorRegister() == 0)
1908 SmallVector<EVT, 2> ValueVTs;
1909 ComputeValueVTs(TLI, LP.getType(), ValueVTs);
1911 // Insert the EXCEPTIONADDR instruction.
1912 assert(FuncInfo.MBB->isLandingPad() &&
1913 "Call to eh.exception not in landing pad!");
1914 SDVTList VTs = DAG.getVTList(TLI.getPointerTy(), MVT::Other);
1916 Ops[0] = DAG.getRoot();
1917 SDValue Op1 = DAG.getNode(ISD::EXCEPTIONADDR, getCurDebugLoc(), VTs, Ops, 1);
1918 SDValue Chain = Op1.getValue(1);
1920 // Insert the EHSELECTION instruction.
1921 VTs = DAG.getVTList(TLI.getPointerTy(), MVT::Other);
1924 SDValue Op2 = DAG.getNode(ISD::EHSELECTION, getCurDebugLoc(), VTs, Ops, 2);
1925 Chain = Op2.getValue(1);
1926 Op2 = DAG.getSExtOrTrunc(Op2, getCurDebugLoc(), MVT::i32);
1930 SDValue Res = DAG.getNode(ISD::MERGE_VALUES, getCurDebugLoc(),
1931 DAG.getVTList(&ValueVTs[0], ValueVTs.size()),
1934 std::pair<SDValue, SDValue> RetPair = std::make_pair(Res, Chain);
1935 setValue(&LP, RetPair.first);
1936 DAG.setRoot(RetPair.second);
1939 /// handleSmallSwitchCaseRange - Emit a series of specific tests (suitable for
1940 /// small case ranges).
1941 bool SelectionDAGBuilder::handleSmallSwitchRange(CaseRec& CR,
1942 CaseRecVector& WorkList,
1944 MachineBasicBlock *Default,
1945 MachineBasicBlock *SwitchBB) {
1946 // Size is the number of Cases represented by this range.
1947 size_t Size = CR.Range.second - CR.Range.first;
1951 // Get the MachineFunction which holds the current MBB. This is used when
1952 // inserting any additional MBBs necessary to represent the switch.
1953 MachineFunction *CurMF = FuncInfo.MF;
1955 // Figure out which block is immediately after the current one.
1956 MachineBasicBlock *NextBlock = 0;
1957 MachineFunction::iterator BBI = CR.CaseBB;
1959 if (++BBI != FuncInfo.MF->end())
1962 BranchProbabilityInfo *BPI = FuncInfo.BPI;
1963 // If any two of the cases has the same destination, and if one value
1964 // is the same as the other, but has one bit unset that the other has set,
1965 // use bit manipulation to do two compares at once. For example:
1966 // "if (X == 6 || X == 4)" -> "if ((X|2) == 6)"
1967 // TODO: This could be extended to merge any 2 cases in switches with 3 cases.
1968 // TODO: Handle cases where CR.CaseBB != SwitchBB.
1969 if (Size == 2 && CR.CaseBB == SwitchBB) {
1970 Case &Small = *CR.Range.first;
1971 Case &Big = *(CR.Range.second-1);
1973 if (Small.Low == Small.High && Big.Low == Big.High && Small.BB == Big.BB) {
1974 const APInt& SmallValue = cast<ConstantInt>(Small.Low)->getValue();
1975 const APInt& BigValue = cast<ConstantInt>(Big.Low)->getValue();
1977 // Check that there is only one bit different.
1978 if (BigValue.countPopulation() == SmallValue.countPopulation() + 1 &&
1979 (SmallValue | BigValue) == BigValue) {
1980 // Isolate the common bit.
1981 APInt CommonBit = BigValue & ~SmallValue;
1982 assert((SmallValue | CommonBit) == BigValue &&
1983 CommonBit.countPopulation() == 1 && "Not a common bit?");
1985 SDValue CondLHS = getValue(SV);
1986 EVT VT = CondLHS.getValueType();
1987 DebugLoc DL = getCurDebugLoc();
1989 SDValue Or = DAG.getNode(ISD::OR, DL, VT, CondLHS,
1990 DAG.getConstant(CommonBit, VT));
1991 SDValue Cond = DAG.getSetCC(DL, MVT::i1,
1992 Or, DAG.getConstant(BigValue, VT),
1995 // Update successor info.
1996 // Both Small and Big will jump to Small.BB, so we sum up the weights.
1997 addSuccessorWithWeight(SwitchBB, Small.BB,
1998 Small.ExtraWeight + Big.ExtraWeight);
1999 addSuccessorWithWeight(SwitchBB, Default,
2000 // The default destination is the first successor in IR.
2001 BPI ? BPI->getEdgeWeight(SwitchBB->getBasicBlock(), (unsigned)0) : 0);
2003 // Insert the true branch.
2004 SDValue BrCond = DAG.getNode(ISD::BRCOND, DL, MVT::Other,
2005 getControlRoot(), Cond,
2006 DAG.getBasicBlock(Small.BB));
2008 // Insert the false branch.
2009 BrCond = DAG.getNode(ISD::BR, DL, MVT::Other, BrCond,
2010 DAG.getBasicBlock(Default));
2012 DAG.setRoot(BrCond);
2018 // Order cases by weight so the most likely case will be checked first.
2019 uint32_t UnhandledWeights = 0;
2021 for (CaseItr I = CR.Range.first, IE = CR.Range.second; I != IE; ++I) {
2022 uint32_t IWeight = I->ExtraWeight;
2023 UnhandledWeights += IWeight;
2024 for (CaseItr J = CR.Range.first; J < I; ++J) {
2025 uint32_t JWeight = J->ExtraWeight;
2026 if (IWeight > JWeight)
2031 // Rearrange the case blocks so that the last one falls through if possible.
2032 Case &BackCase = *(CR.Range.second-1);
2034 NextBlock && Default != NextBlock && BackCase.BB != NextBlock) {
2035 // The last case block won't fall through into 'NextBlock' if we emit the
2036 // branches in this order. See if rearranging a case value would help.
2037 // We start at the bottom as it's the case with the least weight.
2038 for (Case *I = &*(CR.Range.second-2), *E = &*CR.Range.first-1; I != E; --I){
2039 if (I->BB == NextBlock) {
2040 std::swap(*I, BackCase);
2046 // Create a CaseBlock record representing a conditional branch to
2047 // the Case's target mbb if the value being switched on SV is equal
2049 MachineBasicBlock *CurBlock = CR.CaseBB;
2050 for (CaseItr I = CR.Range.first, E = CR.Range.second; I != E; ++I) {
2051 MachineBasicBlock *FallThrough;
2053 FallThrough = CurMF->CreateMachineBasicBlock(CurBlock->getBasicBlock());
2054 CurMF->insert(BBI, FallThrough);
2056 // Put SV in a virtual register to make it available from the new blocks.
2057 ExportFromCurrentBlock(SV);
2059 // If the last case doesn't match, go to the default block.
2060 FallThrough = Default;
2063 const Value *RHS, *LHS, *MHS;
2065 if (I->High == I->Low) {
2066 // This is just small small case range :) containing exactly 1 case
2068 LHS = SV; RHS = I->High; MHS = NULL;
2070 CC = ISD::SETCC_INVALID;
2071 LHS = I->Low; MHS = SV; RHS = I->High;
2074 // The false weight should be sum of all un-handled cases.
2075 UnhandledWeights -= I->ExtraWeight;
2076 CaseBlock CB(CC, LHS, RHS, MHS, /* truebb */ I->BB, /* falsebb */ FallThrough,
2078 /* trueweight */ I->ExtraWeight,
2079 /* falseweight */ UnhandledWeights);
2081 // If emitting the first comparison, just call visitSwitchCase to emit the
2082 // code into the current block. Otherwise, push the CaseBlock onto the
2083 // vector to be later processed by SDISel, and insert the node's MBB
2084 // before the next MBB.
2085 if (CurBlock == SwitchBB)
2086 visitSwitchCase(CB, SwitchBB);
2088 SwitchCases.push_back(CB);
2090 CurBlock = FallThrough;
2096 static inline bool areJTsAllowed(const TargetLowering &TLI) {
2097 return TLI.supportJumpTables() &&
2098 (TLI.isOperationLegalOrCustom(ISD::BR_JT, MVT::Other) ||
2099 TLI.isOperationLegalOrCustom(ISD::BRIND, MVT::Other));
2102 static APInt ComputeRange(const APInt &First, const APInt &Last) {
2103 uint32_t BitWidth = std::max(Last.getBitWidth(), First.getBitWidth()) + 1;
2104 APInt LastExt = Last.zext(BitWidth), FirstExt = First.zext(BitWidth);
2105 return (LastExt - FirstExt + 1ULL);
2108 /// handleJTSwitchCase - Emit jumptable for current switch case range
2109 bool SelectionDAGBuilder::handleJTSwitchCase(CaseRec &CR,
2110 CaseRecVector &WorkList,
2112 MachineBasicBlock *Default,
2113 MachineBasicBlock *SwitchBB) {
2114 Case& FrontCase = *CR.Range.first;
2115 Case& BackCase = *(CR.Range.second-1);
2117 const APInt &First = cast<ConstantInt>(FrontCase.Low)->getValue();
2118 const APInt &Last = cast<ConstantInt>(BackCase.High)->getValue();
2120 APInt TSize(First.getBitWidth(), 0);
2121 for (CaseItr I = CR.Range.first, E = CR.Range.second; I != E; ++I)
2124 if (!areJTsAllowed(TLI) || TSize.ult(TLI.getMinimumJumpTableEntries()))
2127 APInt Range = ComputeRange(First, Last);
2128 // The density is TSize / Range. Require at least 40%.
2129 // It should not be possible for IntTSize to saturate for sane code, but make
2130 // sure we handle Range saturation correctly.
2131 uint64_t IntRange = Range.getLimitedValue(UINT64_MAX/10);
2132 uint64_t IntTSize = TSize.getLimitedValue(UINT64_MAX/10);
2133 if (IntTSize * 10 < IntRange * 4)
2136 DEBUG(dbgs() << "Lowering jump table\n"
2137 << "First entry: " << First << ". Last entry: " << Last << '\n'
2138 << "Range: " << Range << ". Size: " << TSize << ".\n\n");
2140 // Get the MachineFunction which holds the current MBB. This is used when
2141 // inserting any additional MBBs necessary to represent the switch.
2142 MachineFunction *CurMF = FuncInfo.MF;
2144 // Figure out which block is immediately after the current one.
2145 MachineFunction::iterator BBI = CR.CaseBB;
2148 const BasicBlock *LLVMBB = CR.CaseBB->getBasicBlock();
2150 // Create a new basic block to hold the code for loading the address
2151 // of the jump table, and jumping to it. Update successor information;
2152 // we will either branch to the default case for the switch, or the jump
2154 MachineBasicBlock *JumpTableBB = CurMF->CreateMachineBasicBlock(LLVMBB);
2155 CurMF->insert(BBI, JumpTableBB);
2157 addSuccessorWithWeight(CR.CaseBB, Default);
2158 addSuccessorWithWeight(CR.CaseBB, JumpTableBB);
2160 // Build a vector of destination BBs, corresponding to each target
2161 // of the jump table. If the value of the jump table slot corresponds to
2162 // a case statement, push the case's BB onto the vector, otherwise, push
2164 std::vector<MachineBasicBlock*> DestBBs;
2166 for (CaseItr I = CR.Range.first, E = CR.Range.second; I != E; ++TEI) {
2167 const APInt &Low = cast<ConstantInt>(I->Low)->getValue();
2168 const APInt &High = cast<ConstantInt>(I->High)->getValue();
2170 if (Low.ule(TEI) && TEI.ule(High)) {
2171 DestBBs.push_back(I->BB);
2175 DestBBs.push_back(Default);
2179 // Calculate weight for each unique destination in CR.
2180 DenseMap<MachineBasicBlock*, uint32_t> DestWeights;
2182 for (CaseItr I = CR.Range.first, E = CR.Range.second; I != E; ++I) {
2183 DenseMap<MachineBasicBlock*, uint32_t>::iterator Itr =
2184 DestWeights.find(I->BB);
2185 if (Itr != DestWeights.end())
2186 Itr->second += I->ExtraWeight;
2188 DestWeights[I->BB] = I->ExtraWeight;
2191 // Update successor info. Add one edge to each unique successor.
2192 BitVector SuccsHandled(CR.CaseBB->getParent()->getNumBlockIDs());
2193 for (std::vector<MachineBasicBlock*>::iterator I = DestBBs.begin(),
2194 E = DestBBs.end(); I != E; ++I) {
2195 if (!SuccsHandled[(*I)->getNumber()]) {
2196 SuccsHandled[(*I)->getNumber()] = true;
2197 DenseMap<MachineBasicBlock*, uint32_t>::iterator Itr =
2198 DestWeights.find(*I);
2199 addSuccessorWithWeight(JumpTableBB, *I,
2200 Itr != DestWeights.end() ? Itr->second : 0);
2204 // Create a jump table index for this jump table.
2205 unsigned JTEncoding = TLI.getJumpTableEncoding();
2206 unsigned JTI = CurMF->getOrCreateJumpTableInfo(JTEncoding)
2207 ->createJumpTableIndex(DestBBs);
2209 // Set the jump table information so that we can codegen it as a second
2210 // MachineBasicBlock
2211 JumpTable JT(-1U, JTI, JumpTableBB, Default);
2212 JumpTableHeader JTH(First, Last, SV, CR.CaseBB, (CR.CaseBB == SwitchBB));
2213 if (CR.CaseBB == SwitchBB)
2214 visitJumpTableHeader(JT, JTH, SwitchBB);
2216 JTCases.push_back(JumpTableBlock(JTH, JT));
2220 /// handleBTSplitSwitchCase - emit comparison and split binary search tree into
2222 bool SelectionDAGBuilder::handleBTSplitSwitchCase(CaseRec& CR,
2223 CaseRecVector& WorkList,
2225 MachineBasicBlock *Default,
2226 MachineBasicBlock *SwitchBB) {
2227 // Get the MachineFunction which holds the current MBB. This is used when
2228 // inserting any additional MBBs necessary to represent the switch.
2229 MachineFunction *CurMF = FuncInfo.MF;
2231 // Figure out which block is immediately after the current one.
2232 MachineFunction::iterator BBI = CR.CaseBB;
2235 Case& FrontCase = *CR.Range.first;
2236 Case& BackCase = *(CR.Range.second-1);
2237 const BasicBlock *LLVMBB = CR.CaseBB->getBasicBlock();
2239 // Size is the number of Cases represented by this range.
2240 unsigned Size = CR.Range.second - CR.Range.first;
2242 const APInt &First = cast<ConstantInt>(FrontCase.Low)->getValue();
2243 const APInt &Last = cast<ConstantInt>(BackCase.High)->getValue();
2245 CaseItr Pivot = CR.Range.first + Size/2;
2247 // Select optimal pivot, maximizing sum density of LHS and RHS. This will
2248 // (heuristically) allow us to emit JumpTable's later.
2249 APInt TSize(First.getBitWidth(), 0);
2250 for (CaseItr I = CR.Range.first, E = CR.Range.second;
2254 APInt LSize = FrontCase.size();
2255 APInt RSize = TSize-LSize;
2256 DEBUG(dbgs() << "Selecting best pivot: \n"
2257 << "First: " << First << ", Last: " << Last <<'\n'
2258 << "LSize: " << LSize << ", RSize: " << RSize << '\n');
2259 for (CaseItr I = CR.Range.first, J=I+1, E = CR.Range.second;
2261 const APInt &LEnd = cast<ConstantInt>(I->High)->getValue();
2262 const APInt &RBegin = cast<ConstantInt>(J->Low)->getValue();
2263 APInt Range = ComputeRange(LEnd, RBegin);
2264 assert((Range - 2ULL).isNonNegative() &&
2265 "Invalid case distance");
2266 // Use volatile double here to avoid excess precision issues on some hosts,
2267 // e.g. that use 80-bit X87 registers.
2268 volatile double LDensity =
2269 (double)LSize.roundToDouble() /
2270 (LEnd - First + 1ULL).roundToDouble();
2271 volatile double RDensity =
2272 (double)RSize.roundToDouble() /
2273 (Last - RBegin + 1ULL).roundToDouble();
2274 double Metric = Range.logBase2()*(LDensity+RDensity);
2275 // Should always split in some non-trivial place
2276 DEBUG(dbgs() <<"=>Step\n"
2277 << "LEnd: " << LEnd << ", RBegin: " << RBegin << '\n'
2278 << "LDensity: " << LDensity
2279 << ", RDensity: " << RDensity << '\n'
2280 << "Metric: " << Metric << '\n');
2281 if (FMetric < Metric) {
2284 DEBUG(dbgs() << "Current metric set to: " << FMetric << '\n');
2290 if (areJTsAllowed(TLI)) {
2291 // If our case is dense we *really* should handle it earlier!
2292 assert((FMetric > 0) && "Should handle dense range earlier!");
2294 Pivot = CR.Range.first + Size/2;
2297 CaseRange LHSR(CR.Range.first, Pivot);
2298 CaseRange RHSR(Pivot, CR.Range.second);
2299 const Constant *C = Pivot->Low;
2300 MachineBasicBlock *FalseBB = 0, *TrueBB = 0;
2302 // We know that we branch to the LHS if the Value being switched on is
2303 // less than the Pivot value, C. We use this to optimize our binary
2304 // tree a bit, by recognizing that if SV is greater than or equal to the
2305 // LHS's Case Value, and that Case Value is exactly one less than the
2306 // Pivot's Value, then we can branch directly to the LHS's Target,
2307 // rather than creating a leaf node for it.
2308 if ((LHSR.second - LHSR.first) == 1 &&
2309 LHSR.first->High == CR.GE &&
2310 cast<ConstantInt>(C)->getValue() ==
2311 (cast<ConstantInt>(CR.GE)->getValue() + 1LL)) {
2312 TrueBB = LHSR.first->BB;
2314 TrueBB = CurMF->CreateMachineBasicBlock(LLVMBB);
2315 CurMF->insert(BBI, TrueBB);
2316 WorkList.push_back(CaseRec(TrueBB, C, CR.GE, LHSR));
2318 // Put SV in a virtual register to make it available from the new blocks.
2319 ExportFromCurrentBlock(SV);
2322 // Similar to the optimization above, if the Value being switched on is
2323 // known to be less than the Constant CR.LT, and the current Case Value
2324 // is CR.LT - 1, then we can branch directly to the target block for
2325 // the current Case Value, rather than emitting a RHS leaf node for it.
2326 if ((RHSR.second - RHSR.first) == 1 && CR.LT &&
2327 cast<ConstantInt>(RHSR.first->Low)->getValue() ==
2328 (cast<ConstantInt>(CR.LT)->getValue() - 1LL)) {
2329 FalseBB = RHSR.first->BB;
2331 FalseBB = CurMF->CreateMachineBasicBlock(LLVMBB);
2332 CurMF->insert(BBI, FalseBB);
2333 WorkList.push_back(CaseRec(FalseBB,CR.LT,C,RHSR));
2335 // Put SV in a virtual register to make it available from the new blocks.
2336 ExportFromCurrentBlock(SV);
2339 // Create a CaseBlock record representing a conditional branch to
2340 // the LHS node if the value being switched on SV is less than C.
2341 // Otherwise, branch to LHS.
2342 CaseBlock CB(ISD::SETULT, SV, C, NULL, TrueBB, FalseBB, CR.CaseBB);
2344 if (CR.CaseBB == SwitchBB)
2345 visitSwitchCase(CB, SwitchBB);
2347 SwitchCases.push_back(CB);
2352 /// handleBitTestsSwitchCase - if current case range has few destination and
2353 /// range span less, than machine word bitwidth, encode case range into series
2354 /// of masks and emit bit tests with these masks.
2355 bool SelectionDAGBuilder::handleBitTestsSwitchCase(CaseRec& CR,
2356 CaseRecVector& WorkList,
2358 MachineBasicBlock* Default,
2359 MachineBasicBlock *SwitchBB){
2360 EVT PTy = TLI.getPointerTy();
2361 unsigned IntPtrBits = PTy.getSizeInBits();
2363 Case& FrontCase = *CR.Range.first;
2364 Case& BackCase = *(CR.Range.second-1);
2366 // Get the MachineFunction which holds the current MBB. This is used when
2367 // inserting any additional MBBs necessary to represent the switch.
2368 MachineFunction *CurMF = FuncInfo.MF;
2370 // If target does not have legal shift left, do not emit bit tests at all.
2371 if (!TLI.isOperationLegal(ISD::SHL, TLI.getPointerTy()))
2375 for (CaseItr I = CR.Range.first, E = CR.Range.second;
2377 // Single case counts one, case range - two.
2378 numCmps += (I->Low == I->High ? 1 : 2);
2381 // Count unique destinations
2382 SmallSet<MachineBasicBlock*, 4> Dests;
2383 for (CaseItr I = CR.Range.first, E = CR.Range.second; I!=E; ++I) {
2384 Dests.insert(I->BB);
2385 if (Dests.size() > 3)
2386 // Don't bother the code below, if there are too much unique destinations
2389 DEBUG(dbgs() << "Total number of unique destinations: "
2390 << Dests.size() << '\n'
2391 << "Total number of comparisons: " << numCmps << '\n');
2393 // Compute span of values.
2394 const APInt& minValue = cast<ConstantInt>(FrontCase.Low)->getValue();
2395 const APInt& maxValue = cast<ConstantInt>(BackCase.High)->getValue();
2396 APInt cmpRange = maxValue - minValue;
2398 DEBUG(dbgs() << "Compare range: " << cmpRange << '\n'
2399 << "Low bound: " << minValue << '\n'
2400 << "High bound: " << maxValue << '\n');
2402 if (cmpRange.uge(IntPtrBits) ||
2403 (!(Dests.size() == 1 && numCmps >= 3) &&
2404 !(Dests.size() == 2 && numCmps >= 5) &&
2405 !(Dests.size() >= 3 && numCmps >= 6)))
2408 DEBUG(dbgs() << "Emitting bit tests\n");
2409 APInt lowBound = APInt::getNullValue(cmpRange.getBitWidth());
2411 // Optimize the case where all the case values fit in a
2412 // word without having to subtract minValue. In this case,
2413 // we can optimize away the subtraction.
2414 if (maxValue.ult(IntPtrBits)) {
2415 cmpRange = maxValue;
2417 lowBound = minValue;
2420 CaseBitsVector CasesBits;
2421 unsigned i, count = 0;
2423 for (CaseItr I = CR.Range.first, E = CR.Range.second; I!=E; ++I) {
2424 MachineBasicBlock* Dest = I->BB;
2425 for (i = 0; i < count; ++i)
2426 if (Dest == CasesBits[i].BB)
2430 assert((count < 3) && "Too much destinations to test!");
2431 CasesBits.push_back(CaseBits(0, Dest, 0, 0/*Weight*/));
2435 const APInt& lowValue = cast<ConstantInt>(I->Low)->getValue();
2436 const APInt& highValue = cast<ConstantInt>(I->High)->getValue();
2438 uint64_t lo = (lowValue - lowBound).getZExtValue();
2439 uint64_t hi = (highValue - lowBound).getZExtValue();
2440 CasesBits[i].ExtraWeight += I->ExtraWeight;
2442 for (uint64_t j = lo; j <= hi; j++) {
2443 CasesBits[i].Mask |= 1ULL << j;
2444 CasesBits[i].Bits++;
2448 std::sort(CasesBits.begin(), CasesBits.end(), CaseBitsCmp());
2452 // Figure out which block is immediately after the current one.
2453 MachineFunction::iterator BBI = CR.CaseBB;
2456 const BasicBlock *LLVMBB = CR.CaseBB->getBasicBlock();
2458 DEBUG(dbgs() << "Cases:\n");
2459 for (unsigned i = 0, e = CasesBits.size(); i!=e; ++i) {
2460 DEBUG(dbgs() << "Mask: " << CasesBits[i].Mask
2461 << ", Bits: " << CasesBits[i].Bits
2462 << ", BB: " << CasesBits[i].BB << '\n');
2464 MachineBasicBlock *CaseBB = CurMF->CreateMachineBasicBlock(LLVMBB);
2465 CurMF->insert(BBI, CaseBB);
2466 BTC.push_back(BitTestCase(CasesBits[i].Mask,
2468 CasesBits[i].BB, CasesBits[i].ExtraWeight));
2470 // Put SV in a virtual register to make it available from the new blocks.
2471 ExportFromCurrentBlock(SV);
2474 BitTestBlock BTB(lowBound, cmpRange, SV,
2475 -1U, MVT::Other, (CR.CaseBB == SwitchBB),
2476 CR.CaseBB, Default, BTC);
2478 if (CR.CaseBB == SwitchBB)
2479 visitBitTestHeader(BTB, SwitchBB);
2481 BitTestCases.push_back(BTB);
2486 /// Clusterify - Transform simple list of Cases into list of CaseRange's
2487 size_t SelectionDAGBuilder::Clusterify(CaseVector& Cases,
2488 const SwitchInst& SI) {
2490 /// Use a shorter form of declaration, and also
2491 /// show the we want to use CRSBuilder as Clusterifier.
2492 typedef IntegersSubsetMapping<MachineBasicBlock> Clusterifier;
2494 Clusterifier TheClusterifier;
2496 BranchProbabilityInfo *BPI = FuncInfo.BPI;
2497 // Start with "simple" cases
2498 for (SwitchInst::ConstCaseIt i = SI.case_begin(), e = SI.case_end();
2500 const BasicBlock *SuccBB = i.getCaseSuccessor();
2501 MachineBasicBlock *SMBB = FuncInfo.MBBMap[SuccBB];
2503 TheClusterifier.add(i.getCaseValueEx(), SMBB,
2504 BPI ? BPI->getEdgeWeight(SI.getParent(), i.getSuccessorIndex()) : 0);
2507 TheClusterifier.optimize();
2510 for (Clusterifier::RangeIterator i = TheClusterifier.begin(),
2511 e = TheClusterifier.end(); i != e; ++i, ++numCmps) {
2512 Clusterifier::Cluster &C = *i;
2513 // Update edge weight for the cluster.
2514 unsigned W = C.first.Weight;
2516 // FIXME: Currently work with ConstantInt based numbers.
2517 // Changing it to APInt based is a pretty heavy for this commit.
2518 Cases.push_back(Case(C.first.getLow().toConstantInt(),
2519 C.first.getHigh().toConstantInt(), C.second, W));
2521 if (C.first.getLow() != C.first.getHigh())
2522 // A range counts double, since it requires two compares.
2529 void SelectionDAGBuilder::UpdateSplitBlock(MachineBasicBlock *First,
2530 MachineBasicBlock *Last) {
2532 for (unsigned i = 0, e = JTCases.size(); i != e; ++i)
2533 if (JTCases[i].first.HeaderBB == First)
2534 JTCases[i].first.HeaderBB = Last;
2536 // Update BitTestCases.
2537 for (unsigned i = 0, e = BitTestCases.size(); i != e; ++i)
2538 if (BitTestCases[i].Parent == First)
2539 BitTestCases[i].Parent = Last;
2542 void SelectionDAGBuilder::visitSwitch(const SwitchInst &SI) {
2543 MachineBasicBlock *SwitchMBB = FuncInfo.MBB;
2545 // Figure out which block is immediately after the current one.
2546 MachineBasicBlock *NextBlock = 0;
2547 MachineBasicBlock *Default = FuncInfo.MBBMap[SI.getDefaultDest()];
2549 // If there is only the default destination, branch to it if it is not the
2550 // next basic block. Otherwise, just fall through.
2551 if (!SI.getNumCases()) {
2552 // Update machine-CFG edges.
2554 // If this is not a fall-through branch, emit the branch.
2555 SwitchMBB->addSuccessor(Default);
2556 if (Default != NextBlock)
2557 DAG.setRoot(DAG.getNode(ISD::BR, getCurDebugLoc(),
2558 MVT::Other, getControlRoot(),
2559 DAG.getBasicBlock(Default)));
2564 // If there are any non-default case statements, create a vector of Cases
2565 // representing each one, and sort the vector so that we can efficiently
2566 // create a binary search tree from them.
2568 size_t numCmps = Clusterify(Cases, SI);
2569 DEBUG(dbgs() << "Clusterify finished. Total clusters: " << Cases.size()
2570 << ". Total compares: " << numCmps << '\n');
2573 // Get the Value to be switched on and default basic blocks, which will be
2574 // inserted into CaseBlock records, representing basic blocks in the binary
2576 const Value *SV = SI.getCondition();
2578 // Push the initial CaseRec onto the worklist
2579 CaseRecVector WorkList;
2580 WorkList.push_back(CaseRec(SwitchMBB,0,0,
2581 CaseRange(Cases.begin(),Cases.end())));
2583 while (!WorkList.empty()) {
2584 // Grab a record representing a case range to process off the worklist
2585 CaseRec CR = WorkList.back();
2586 WorkList.pop_back();
2588 if (handleBitTestsSwitchCase(CR, WorkList, SV, Default, SwitchMBB))
2591 // If the range has few cases (two or less) emit a series of specific
2593 if (handleSmallSwitchRange(CR, WorkList, SV, Default, SwitchMBB))
2596 // If the switch has more than N blocks, and is at least 40% dense, and the
2597 // target supports indirect branches, then emit a jump table rather than
2598 // lowering the switch to a binary tree of conditional branches.
2599 // N defaults to 4 and is controlled via TLS.getMinimumJumpTableEntries().
2600 if (handleJTSwitchCase(CR, WorkList, SV, Default, SwitchMBB))
2603 // Emit binary tree. We need to pick a pivot, and push left and right ranges
2604 // onto the worklist. Leafs are handled via handleSmallSwitchRange() call.
2605 handleBTSplitSwitchCase(CR, WorkList, SV, Default, SwitchMBB);
2609 void SelectionDAGBuilder::visitIndirectBr(const IndirectBrInst &I) {
2610 MachineBasicBlock *IndirectBrMBB = FuncInfo.MBB;
2612 // Update machine-CFG edges with unique successors.
2613 SmallSet<BasicBlock*, 32> Done;
2614 for (unsigned i = 0, e = I.getNumSuccessors(); i != e; ++i) {
2615 BasicBlock *BB = I.getSuccessor(i);
2616 bool Inserted = Done.insert(BB);
2620 MachineBasicBlock *Succ = FuncInfo.MBBMap[BB];
2621 addSuccessorWithWeight(IndirectBrMBB, Succ);
2624 DAG.setRoot(DAG.getNode(ISD::BRIND, getCurDebugLoc(),
2625 MVT::Other, getControlRoot(),
2626 getValue(I.getAddress())));
2629 void SelectionDAGBuilder::visitFSub(const User &I) {
2630 // -0.0 - X --> fneg
2631 Type *Ty = I.getType();
2632 if (isa<Constant>(I.getOperand(0)) &&
2633 I.getOperand(0) == ConstantFP::getZeroValueForNegation(Ty)) {
2634 SDValue Op2 = getValue(I.getOperand(1));
2635 setValue(&I, DAG.getNode(ISD::FNEG, getCurDebugLoc(),
2636 Op2.getValueType(), Op2));
2640 visitBinary(I, ISD::FSUB);
2643 void SelectionDAGBuilder::visitBinary(const User &I, unsigned OpCode) {
2644 SDValue Op1 = getValue(I.getOperand(0));
2645 SDValue Op2 = getValue(I.getOperand(1));
2646 setValue(&I, DAG.getNode(OpCode, getCurDebugLoc(),
2647 Op1.getValueType(), Op1, Op2));
2650 void SelectionDAGBuilder::visitShift(const User &I, unsigned Opcode) {
2651 SDValue Op1 = getValue(I.getOperand(0));
2652 SDValue Op2 = getValue(I.getOperand(1));
2654 MVT ShiftTy = TLI.getShiftAmountTy(Op2.getValueType());
2656 // Coerce the shift amount to the right type if we can.
2657 if (!I.getType()->isVectorTy() && Op2.getValueType() != ShiftTy) {
2658 unsigned ShiftSize = ShiftTy.getSizeInBits();
2659 unsigned Op2Size = Op2.getValueType().getSizeInBits();
2660 DebugLoc DL = getCurDebugLoc();
2662 // If the operand is smaller than the shift count type, promote it.
2663 if (ShiftSize > Op2Size)
2664 Op2 = DAG.getNode(ISD::ZERO_EXTEND, DL, ShiftTy, Op2);
2666 // If the operand is larger than the shift count type but the shift
2667 // count type has enough bits to represent any shift value, truncate
2668 // it now. This is a common case and it exposes the truncate to
2669 // optimization early.
2670 else if (ShiftSize >= Log2_32_Ceil(Op2.getValueType().getSizeInBits()))
2671 Op2 = DAG.getNode(ISD::TRUNCATE, DL, ShiftTy, Op2);
2672 // Otherwise we'll need to temporarily settle for some other convenient
2673 // type. Type legalization will make adjustments once the shiftee is split.
2675 Op2 = DAG.getZExtOrTrunc(Op2, DL, MVT::i32);
2678 setValue(&I, DAG.getNode(Opcode, getCurDebugLoc(),
2679 Op1.getValueType(), Op1, Op2));
2682 void SelectionDAGBuilder::visitSDiv(const User &I) {
2683 SDValue Op1 = getValue(I.getOperand(0));
2684 SDValue Op2 = getValue(I.getOperand(1));
2686 // Turn exact SDivs into multiplications.
2687 // FIXME: This should be in DAGCombiner, but it doesn't have access to the
2689 if (isa<BinaryOperator>(&I) && cast<BinaryOperator>(&I)->isExact() &&
2690 !isa<ConstantSDNode>(Op1) &&
2691 isa<ConstantSDNode>(Op2) && !cast<ConstantSDNode>(Op2)->isNullValue())
2692 setValue(&I, TLI.BuildExactSDIV(Op1, Op2, getCurDebugLoc(), DAG));
2694 setValue(&I, DAG.getNode(ISD::SDIV, getCurDebugLoc(), Op1.getValueType(),
2698 void SelectionDAGBuilder::visitICmp(const User &I) {
2699 ICmpInst::Predicate predicate = ICmpInst::BAD_ICMP_PREDICATE;
2700 if (const ICmpInst *IC = dyn_cast<ICmpInst>(&I))
2701 predicate = IC->getPredicate();
2702 else if (const ConstantExpr *IC = dyn_cast<ConstantExpr>(&I))
2703 predicate = ICmpInst::Predicate(IC->getPredicate());
2704 SDValue Op1 = getValue(I.getOperand(0));
2705 SDValue Op2 = getValue(I.getOperand(1));
2706 ISD::CondCode Opcode = getICmpCondCode(predicate);
2708 EVT DestVT = TLI.getValueType(I.getType());
2709 setValue(&I, DAG.getSetCC(getCurDebugLoc(), DestVT, Op1, Op2, Opcode));
2712 void SelectionDAGBuilder::visitFCmp(const User &I) {
2713 FCmpInst::Predicate predicate = FCmpInst::BAD_FCMP_PREDICATE;
2714 if (const FCmpInst *FC = dyn_cast<FCmpInst>(&I))
2715 predicate = FC->getPredicate();
2716 else if (const ConstantExpr *FC = dyn_cast<ConstantExpr>(&I))
2717 predicate = FCmpInst::Predicate(FC->getPredicate());
2718 SDValue Op1 = getValue(I.getOperand(0));
2719 SDValue Op2 = getValue(I.getOperand(1));
2720 ISD::CondCode Condition = getFCmpCondCode(predicate);
2721 if (TM.Options.NoNaNsFPMath)
2722 Condition = getFCmpCodeWithoutNaN(Condition);
2723 EVT DestVT = TLI.getValueType(I.getType());
2724 setValue(&I, DAG.getSetCC(getCurDebugLoc(), DestVT, Op1, Op2, Condition));
2727 void SelectionDAGBuilder::visitSelect(const User &I) {
2728 SmallVector<EVT, 4> ValueVTs;
2729 ComputeValueVTs(TLI, I.getType(), ValueVTs);
2730 unsigned NumValues = ValueVTs.size();
2731 if (NumValues == 0) return;
2733 SmallVector<SDValue, 4> Values(NumValues);
2734 SDValue Cond = getValue(I.getOperand(0));
2735 SDValue TrueVal = getValue(I.getOperand(1));
2736 SDValue FalseVal = getValue(I.getOperand(2));
2737 ISD::NodeType OpCode = Cond.getValueType().isVector() ?
2738 ISD::VSELECT : ISD::SELECT;
2740 for (unsigned i = 0; i != NumValues; ++i)
2741 Values[i] = DAG.getNode(OpCode, getCurDebugLoc(),
2742 TrueVal.getNode()->getValueType(TrueVal.getResNo()+i),
2744 SDValue(TrueVal.getNode(),
2745 TrueVal.getResNo() + i),
2746 SDValue(FalseVal.getNode(),
2747 FalseVal.getResNo() + i));
2749 setValue(&I, DAG.getNode(ISD::MERGE_VALUES, getCurDebugLoc(),
2750 DAG.getVTList(&ValueVTs[0], NumValues),
2751 &Values[0], NumValues));
2754 void SelectionDAGBuilder::visitTrunc(const User &I) {
2755 // TruncInst cannot be a no-op cast because sizeof(src) > sizeof(dest).
2756 SDValue N = getValue(I.getOperand(0));
2757 EVT DestVT = TLI.getValueType(I.getType());
2758 setValue(&I, DAG.getNode(ISD::TRUNCATE, getCurDebugLoc(), DestVT, N));
2761 void SelectionDAGBuilder::visitZExt(const User &I) {
2762 // ZExt cannot be a no-op cast because sizeof(src) < sizeof(dest).
2763 // ZExt also can't be a cast to bool for same reason. So, nothing much to do
2764 SDValue N = getValue(I.getOperand(0));
2765 EVT DestVT = TLI.getValueType(I.getType());
2766 setValue(&I, DAG.getNode(ISD::ZERO_EXTEND, getCurDebugLoc(), DestVT, N));
2769 void SelectionDAGBuilder::visitSExt(const User &I) {
2770 // SExt cannot be a no-op cast because sizeof(src) < sizeof(dest).
2771 // SExt also can't be a cast to bool for same reason. So, nothing much to do
2772 SDValue N = getValue(I.getOperand(0));
2773 EVT DestVT = TLI.getValueType(I.getType());
2774 setValue(&I, DAG.getNode(ISD::SIGN_EXTEND, getCurDebugLoc(), DestVT, N));
2777 void SelectionDAGBuilder::visitFPTrunc(const User &I) {
2778 // FPTrunc is never a no-op cast, no need to check
2779 SDValue N = getValue(I.getOperand(0));
2780 EVT DestVT = TLI.getValueType(I.getType());
2781 setValue(&I, DAG.getNode(ISD::FP_ROUND, getCurDebugLoc(),
2783 DAG.getTargetConstant(0, TLI.getPointerTy())));
2786 void SelectionDAGBuilder::visitFPExt(const User &I){
2787 // FPExt is never a no-op cast, no need to check
2788 SDValue N = getValue(I.getOperand(0));
2789 EVT DestVT = TLI.getValueType(I.getType());
2790 setValue(&I, DAG.getNode(ISD::FP_EXTEND, getCurDebugLoc(), DestVT, N));
2793 void SelectionDAGBuilder::visitFPToUI(const User &I) {
2794 // FPToUI is never a no-op cast, no need to check
2795 SDValue N = getValue(I.getOperand(0));
2796 EVT DestVT = TLI.getValueType(I.getType());
2797 setValue(&I, DAG.getNode(ISD::FP_TO_UINT, getCurDebugLoc(), DestVT, N));
2800 void SelectionDAGBuilder::visitFPToSI(const User &I) {
2801 // FPToSI is never a no-op cast, no need to check
2802 SDValue N = getValue(I.getOperand(0));
2803 EVT DestVT = TLI.getValueType(I.getType());
2804 setValue(&I, DAG.getNode(ISD::FP_TO_SINT, getCurDebugLoc(), DestVT, N));
2807 void SelectionDAGBuilder::visitUIToFP(const User &I) {
2808 // UIToFP is never a no-op cast, no need to check
2809 SDValue N = getValue(I.getOperand(0));
2810 EVT DestVT = TLI.getValueType(I.getType());
2811 setValue(&I, DAG.getNode(ISD::UINT_TO_FP, getCurDebugLoc(), DestVT, N));
2814 void SelectionDAGBuilder::visitSIToFP(const User &I){
2815 // SIToFP is never a no-op cast, no need to check
2816 SDValue N = getValue(I.getOperand(0));
2817 EVT DestVT = TLI.getValueType(I.getType());
2818 setValue(&I, DAG.getNode(ISD::SINT_TO_FP, getCurDebugLoc(), DestVT, N));
2821 void SelectionDAGBuilder::visitPtrToInt(const User &I) {
2822 // What to do depends on the size of the integer and the size of the pointer.
2823 // We can either truncate, zero extend, or no-op, accordingly.
2824 SDValue N = getValue(I.getOperand(0));
2825 EVT DestVT = TLI.getValueType(I.getType());
2826 setValue(&I, DAG.getZExtOrTrunc(N, getCurDebugLoc(), DestVT));
2829 void SelectionDAGBuilder::visitIntToPtr(const User &I) {
2830 // What to do depends on the size of the integer and the size of the pointer.
2831 // We can either truncate, zero extend, or no-op, accordingly.
2832 SDValue N = getValue(I.getOperand(0));
2833 EVT DestVT = TLI.getValueType(I.getType());
2834 setValue(&I, DAG.getZExtOrTrunc(N, getCurDebugLoc(), DestVT));
2837 void SelectionDAGBuilder::visitBitCast(const User &I) {
2838 SDValue N = getValue(I.getOperand(0));
2839 EVT DestVT = TLI.getValueType(I.getType());
2841 // BitCast assures us that source and destination are the same size so this is
2842 // either a BITCAST or a no-op.
2843 if (DestVT != N.getValueType())
2844 setValue(&I, DAG.getNode(ISD::BITCAST, getCurDebugLoc(),
2845 DestVT, N)); // convert types.
2847 setValue(&I, N); // noop cast.
2850 void SelectionDAGBuilder::visitInsertElement(const User &I) {
2851 SDValue InVec = getValue(I.getOperand(0));
2852 SDValue InVal = getValue(I.getOperand(1));
2853 SDValue InIdx = DAG.getNode(ISD::ZERO_EXTEND, getCurDebugLoc(),
2855 getValue(I.getOperand(2)));
2856 setValue(&I, DAG.getNode(ISD::INSERT_VECTOR_ELT, getCurDebugLoc(),
2857 TLI.getValueType(I.getType()),
2858 InVec, InVal, InIdx));
2861 void SelectionDAGBuilder::visitExtractElement(const User &I) {
2862 SDValue InVec = getValue(I.getOperand(0));
2863 SDValue InIdx = DAG.getNode(ISD::ZERO_EXTEND, getCurDebugLoc(),
2865 getValue(I.getOperand(1)));
2866 setValue(&I, DAG.getNode(ISD::EXTRACT_VECTOR_ELT, getCurDebugLoc(),
2867 TLI.getValueType(I.getType()), InVec, InIdx));
2870 // Utility for visitShuffleVector - Return true if every element in Mask,
2871 // beginning from position Pos and ending in Pos+Size, falls within the
2872 // specified sequential range [L, L+Pos). or is undef.
2873 static bool isSequentialInRange(const SmallVectorImpl<int> &Mask,
2874 unsigned Pos, unsigned Size, int Low) {
2875 for (unsigned i = Pos, e = Pos+Size; i != e; ++i, ++Low)
2876 if (Mask[i] >= 0 && Mask[i] != Low)
2881 void SelectionDAGBuilder::visitShuffleVector(const User &I) {
2882 SDValue Src1 = getValue(I.getOperand(0));
2883 SDValue Src2 = getValue(I.getOperand(1));
2885 SmallVector<int, 8> Mask;
2886 ShuffleVectorInst::getShuffleMask(cast<Constant>(I.getOperand(2)), Mask);
2887 unsigned MaskNumElts = Mask.size();
2889 EVT VT = TLI.getValueType(I.getType());
2890 EVT SrcVT = Src1.getValueType();
2891 unsigned SrcNumElts = SrcVT.getVectorNumElements();
2893 if (SrcNumElts == MaskNumElts) {
2894 setValue(&I, DAG.getVectorShuffle(VT, getCurDebugLoc(), Src1, Src2,
2899 // Normalize the shuffle vector since mask and vector length don't match.
2900 if (SrcNumElts < MaskNumElts && MaskNumElts % SrcNumElts == 0) {
2901 // Mask is longer than the source vectors and is a multiple of the source
2902 // vectors. We can use concatenate vector to make the mask and vectors
2904 if (SrcNumElts*2 == MaskNumElts) {
2905 // First check for Src1 in low and Src2 in high
2906 if (isSequentialInRange(Mask, 0, SrcNumElts, 0) &&
2907 isSequentialInRange(Mask, SrcNumElts, SrcNumElts, SrcNumElts)) {
2908 // The shuffle is concatenating two vectors together.
2909 setValue(&I, DAG.getNode(ISD::CONCAT_VECTORS, getCurDebugLoc(),
2913 // Then check for Src2 in low and Src1 in high
2914 if (isSequentialInRange(Mask, 0, SrcNumElts, SrcNumElts) &&
2915 isSequentialInRange(Mask, SrcNumElts, SrcNumElts, 0)) {
2916 // The shuffle is concatenating two vectors together.
2917 setValue(&I, DAG.getNode(ISD::CONCAT_VECTORS, getCurDebugLoc(),
2923 // Pad both vectors with undefs to make them the same length as the mask.
2924 unsigned NumConcat = MaskNumElts / SrcNumElts;
2925 bool Src1U = Src1.getOpcode() == ISD::UNDEF;
2926 bool Src2U = Src2.getOpcode() == ISD::UNDEF;
2927 SDValue UndefVal = DAG.getUNDEF(SrcVT);
2929 SmallVector<SDValue, 8> MOps1(NumConcat, UndefVal);
2930 SmallVector<SDValue, 8> MOps2(NumConcat, UndefVal);
2934 Src1 = Src1U ? DAG.getUNDEF(VT) : DAG.getNode(ISD::CONCAT_VECTORS,
2935 getCurDebugLoc(), VT,
2936 &MOps1[0], NumConcat);
2937 Src2 = Src2U ? DAG.getUNDEF(VT) : DAG.getNode(ISD::CONCAT_VECTORS,
2938 getCurDebugLoc(), VT,
2939 &MOps2[0], NumConcat);
2941 // Readjust mask for new input vector length.
2942 SmallVector<int, 8> MappedOps;
2943 for (unsigned i = 0; i != MaskNumElts; ++i) {
2945 if (Idx >= (int)SrcNumElts)
2946 Idx -= SrcNumElts - MaskNumElts;
2947 MappedOps.push_back(Idx);
2950 setValue(&I, DAG.getVectorShuffle(VT, getCurDebugLoc(), Src1, Src2,
2955 if (SrcNumElts > MaskNumElts) {
2956 // Analyze the access pattern of the vector to see if we can extract
2957 // two subvectors and do the shuffle. The analysis is done by calculating
2958 // the range of elements the mask access on both vectors.
2959 int MinRange[2] = { static_cast<int>(SrcNumElts),
2960 static_cast<int>(SrcNumElts)};
2961 int MaxRange[2] = {-1, -1};
2963 for (unsigned i = 0; i != MaskNumElts; ++i) {
2969 if (Idx >= (int)SrcNumElts) {
2973 if (Idx > MaxRange[Input])
2974 MaxRange[Input] = Idx;
2975 if (Idx < MinRange[Input])
2976 MinRange[Input] = Idx;
2979 // Check if the access is smaller than the vector size and can we find
2980 // a reasonable extract index.
2981 int RangeUse[2] = { -1, -1 }; // 0 = Unused, 1 = Extract, -1 = Can not
2983 int StartIdx[2]; // StartIdx to extract from
2984 for (unsigned Input = 0; Input < 2; ++Input) {
2985 if (MinRange[Input] >= (int)SrcNumElts && MaxRange[Input] < 0) {
2986 RangeUse[Input] = 0; // Unused
2987 StartIdx[Input] = 0;
2991 // Find a good start index that is a multiple of the mask length. Then
2992 // see if the rest of the elements are in range.
2993 StartIdx[Input] = (MinRange[Input]/MaskNumElts)*MaskNumElts;
2994 if (MaxRange[Input] - StartIdx[Input] < (int)MaskNumElts &&
2995 StartIdx[Input] + MaskNumElts <= SrcNumElts)
2996 RangeUse[Input] = 1; // Extract from a multiple of the mask length.
2999 if (RangeUse[0] == 0 && RangeUse[1] == 0) {
3000 setValue(&I, DAG.getUNDEF(VT)); // Vectors are not used.
3003 if (RangeUse[0] >= 0 && RangeUse[1] >= 0) {
3004 // Extract appropriate subvector and generate a vector shuffle
3005 for (unsigned Input = 0; Input < 2; ++Input) {
3006 SDValue &Src = Input == 0 ? Src1 : Src2;
3007 if (RangeUse[Input] == 0)
3008 Src = DAG.getUNDEF(VT);
3010 Src = DAG.getNode(ISD::EXTRACT_SUBVECTOR, getCurDebugLoc(), VT,
3011 Src, DAG.getIntPtrConstant(StartIdx[Input]));
3014 // Calculate new mask.
3015 SmallVector<int, 8> MappedOps;
3016 for (unsigned i = 0; i != MaskNumElts; ++i) {
3019 if (Idx < (int)SrcNumElts)
3022 Idx -= SrcNumElts + StartIdx[1] - MaskNumElts;
3024 MappedOps.push_back(Idx);
3027 setValue(&I, DAG.getVectorShuffle(VT, getCurDebugLoc(), Src1, Src2,
3033 // We can't use either concat vectors or extract subvectors so fall back to
3034 // replacing the shuffle with extract and build vector.
3035 // to insert and build vector.
3036 EVT EltVT = VT.getVectorElementType();
3037 EVT PtrVT = TLI.getPointerTy();
3038 SmallVector<SDValue,8> Ops;
3039 for (unsigned i = 0; i != MaskNumElts; ++i) {
3044 Res = DAG.getUNDEF(EltVT);
3046 SDValue &Src = Idx < (int)SrcNumElts ? Src1 : Src2;
3047 if (Idx >= (int)SrcNumElts) Idx -= SrcNumElts;
3049 Res = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, getCurDebugLoc(),
3050 EltVT, Src, DAG.getConstant(Idx, PtrVT));
3056 setValue(&I, DAG.getNode(ISD::BUILD_VECTOR, getCurDebugLoc(),
3057 VT, &Ops[0], Ops.size()));
3060 void SelectionDAGBuilder::visitInsertValue(const InsertValueInst &I) {
3061 const Value *Op0 = I.getOperand(0);
3062 const Value *Op1 = I.getOperand(1);
3063 Type *AggTy = I.getType();
3064 Type *ValTy = Op1->getType();
3065 bool IntoUndef = isa<UndefValue>(Op0);
3066 bool FromUndef = isa<UndefValue>(Op1);
3068 unsigned LinearIndex = ComputeLinearIndex(AggTy, I.getIndices());
3070 SmallVector<EVT, 4> AggValueVTs;
3071 ComputeValueVTs(TLI, AggTy, AggValueVTs);
3072 SmallVector<EVT, 4> ValValueVTs;
3073 ComputeValueVTs(TLI, ValTy, ValValueVTs);
3075 unsigned NumAggValues = AggValueVTs.size();
3076 unsigned NumValValues = ValValueVTs.size();
3077 SmallVector<SDValue, 4> Values(NumAggValues);
3079 SDValue Agg = getValue(Op0);
3081 // Copy the beginning value(s) from the original aggregate.
3082 for (; i != LinearIndex; ++i)
3083 Values[i] = IntoUndef ? DAG.getUNDEF(AggValueVTs[i]) :
3084 SDValue(Agg.getNode(), Agg.getResNo() + i);
3085 // Copy values from the inserted value(s).
3087 SDValue Val = getValue(Op1);
3088 for (; i != LinearIndex + NumValValues; ++i)
3089 Values[i] = FromUndef ? DAG.getUNDEF(AggValueVTs[i]) :
3090 SDValue(Val.getNode(), Val.getResNo() + i - LinearIndex);
3092 // Copy remaining value(s) from the original aggregate.
3093 for (; i != NumAggValues; ++i)
3094 Values[i] = IntoUndef ? DAG.getUNDEF(AggValueVTs[i]) :
3095 SDValue(Agg.getNode(), Agg.getResNo() + i);
3097 setValue(&I, DAG.getNode(ISD::MERGE_VALUES, getCurDebugLoc(),
3098 DAG.getVTList(&AggValueVTs[0], NumAggValues),
3099 &Values[0], NumAggValues));
3102 void SelectionDAGBuilder::visitExtractValue(const ExtractValueInst &I) {
3103 const Value *Op0 = I.getOperand(0);
3104 Type *AggTy = Op0->getType();
3105 Type *ValTy = I.getType();
3106 bool OutOfUndef = isa<UndefValue>(Op0);
3108 unsigned LinearIndex = ComputeLinearIndex(AggTy, I.getIndices());
3110 SmallVector<EVT, 4> ValValueVTs;
3111 ComputeValueVTs(TLI, ValTy, ValValueVTs);
3113 unsigned NumValValues = ValValueVTs.size();
3115 // Ignore a extractvalue that produces an empty object
3116 if (!NumValValues) {
3117 setValue(&I, DAG.getUNDEF(MVT(MVT::Other)));
3121 SmallVector<SDValue, 4> Values(NumValValues);
3123 SDValue Agg = getValue(Op0);
3124 // Copy out the selected value(s).
3125 for (unsigned i = LinearIndex; i != LinearIndex + NumValValues; ++i)
3126 Values[i - LinearIndex] =
3128 DAG.getUNDEF(Agg.getNode()->getValueType(Agg.getResNo() + i)) :
3129 SDValue(Agg.getNode(), Agg.getResNo() + i);
3131 setValue(&I, DAG.getNode(ISD::MERGE_VALUES, getCurDebugLoc(),
3132 DAG.getVTList(&ValValueVTs[0], NumValValues),
3133 &Values[0], NumValValues));
3136 void SelectionDAGBuilder::visitGetElementPtr(const User &I) {
3137 SDValue N = getValue(I.getOperand(0));
3138 // Note that the pointer operand may be a vector of pointers. Take the scalar
3139 // element which holds a pointer.
3140 Type *Ty = I.getOperand(0)->getType()->getScalarType();
3142 for (GetElementPtrInst::const_op_iterator OI = I.op_begin()+1, E = I.op_end();
3144 const Value *Idx = *OI;
3145 if (StructType *StTy = dyn_cast<StructType>(Ty)) {
3146 unsigned Field = cast<Constant>(Idx)->getUniqueInteger().getZExtValue();
3149 uint64_t Offset = TD->getStructLayout(StTy)->getElementOffset(Field);
3150 N = DAG.getNode(ISD::ADD, getCurDebugLoc(), N.getValueType(), N,
3151 DAG.getConstant(Offset, N.getValueType()));
3154 Ty = StTy->getElementType(Field);
3156 Ty = cast<SequentialType>(Ty)->getElementType();
3158 // If this is a constant subscript, handle it quickly.
3159 if (const ConstantInt *CI = dyn_cast<ConstantInt>(Idx)) {
3160 if (CI->isZero()) continue;
3162 TD->getTypeAllocSize(Ty)*cast<ConstantInt>(CI)->getSExtValue();
3164 EVT PTy = TLI.getPointerTy();
3165 unsigned PtrBits = PTy.getSizeInBits();
3167 OffsVal = DAG.getNode(ISD::TRUNCATE, getCurDebugLoc(),
3169 DAG.getConstant(Offs, MVT::i64));
3171 OffsVal = DAG.getIntPtrConstant(Offs);
3173 N = DAG.getNode(ISD::ADD, getCurDebugLoc(), N.getValueType(), N,
3178 // N = N + Idx * ElementSize;
3179 APInt ElementSize = APInt(TLI.getPointerTy().getSizeInBits(),
3180 TD->getTypeAllocSize(Ty));
3181 SDValue IdxN = getValue(Idx);
3183 // If the index is smaller or larger than intptr_t, truncate or extend
3185 IdxN = DAG.getSExtOrTrunc(IdxN, getCurDebugLoc(), N.getValueType());
3187 // If this is a multiply by a power of two, turn it into a shl
3188 // immediately. This is a very common case.
3189 if (ElementSize != 1) {
3190 if (ElementSize.isPowerOf2()) {
3191 unsigned Amt = ElementSize.logBase2();
3192 IdxN = DAG.getNode(ISD::SHL, getCurDebugLoc(),
3193 N.getValueType(), IdxN,
3194 DAG.getConstant(Amt, IdxN.getValueType()));
3196 SDValue Scale = DAG.getConstant(ElementSize, IdxN.getValueType());
3197 IdxN = DAG.getNode(ISD::MUL, getCurDebugLoc(),
3198 N.getValueType(), IdxN, Scale);
3202 N = DAG.getNode(ISD::ADD, getCurDebugLoc(),
3203 N.getValueType(), N, IdxN);
3210 void SelectionDAGBuilder::visitAlloca(const AllocaInst &I) {
3211 // If this is a fixed sized alloca in the entry block of the function,
3212 // allocate it statically on the stack.
3213 if (FuncInfo.StaticAllocaMap.count(&I))
3214 return; // getValue will auto-populate this.
3216 Type *Ty = I.getAllocatedType();
3217 uint64_t TySize = TLI.getDataLayout()->getTypeAllocSize(Ty);
3219 std::max((unsigned)TLI.getDataLayout()->getPrefTypeAlignment(Ty),
3222 SDValue AllocSize = getValue(I.getArraySize());
3224 EVT IntPtr = TLI.getPointerTy();
3225 if (AllocSize.getValueType() != IntPtr)
3226 AllocSize = DAG.getZExtOrTrunc(AllocSize, getCurDebugLoc(), IntPtr);
3228 AllocSize = DAG.getNode(ISD::MUL, getCurDebugLoc(), IntPtr,
3230 DAG.getConstant(TySize, IntPtr));
3232 // Handle alignment. If the requested alignment is less than or equal to
3233 // the stack alignment, ignore it. If the size is greater than or equal to
3234 // the stack alignment, we note this in the DYNAMIC_STACKALLOC node.
3235 unsigned StackAlign = TM.getFrameLowering()->getStackAlignment();
3236 if (Align <= StackAlign)
3239 // Round the size of the allocation up to the stack alignment size
3240 // by add SA-1 to the size.
3241 AllocSize = DAG.getNode(ISD::ADD, getCurDebugLoc(),
3242 AllocSize.getValueType(), AllocSize,
3243 DAG.getIntPtrConstant(StackAlign-1));
3245 // Mask out the low bits for alignment purposes.
3246 AllocSize = DAG.getNode(ISD::AND, getCurDebugLoc(),
3247 AllocSize.getValueType(), AllocSize,
3248 DAG.getIntPtrConstant(~(uint64_t)(StackAlign-1)));
3250 SDValue Ops[] = { getRoot(), AllocSize, DAG.getIntPtrConstant(Align) };
3251 SDVTList VTs = DAG.getVTList(AllocSize.getValueType(), MVT::Other);
3252 SDValue DSA = DAG.getNode(ISD::DYNAMIC_STACKALLOC, getCurDebugLoc(),
3255 DAG.setRoot(DSA.getValue(1));
3257 // Inform the Frame Information that we have just allocated a variable-sized
3259 FuncInfo.MF->getFrameInfo()->CreateVariableSizedObject(Align ? Align : 1);
3262 void SelectionDAGBuilder::visitLoad(const LoadInst &I) {
3264 return visitAtomicLoad(I);
3266 const Value *SV = I.getOperand(0);
3267 SDValue Ptr = getValue(SV);
3269 Type *Ty = I.getType();
3271 bool isVolatile = I.isVolatile();
3272 bool isNonTemporal = I.getMetadata("nontemporal") != 0;
3273 bool isInvariant = I.getMetadata("invariant.load") != 0;
3274 unsigned Alignment = I.getAlignment();
3275 const MDNode *TBAAInfo = I.getMetadata(LLVMContext::MD_tbaa);
3276 const MDNode *Ranges = I.getMetadata(LLVMContext::MD_range);
3278 SmallVector<EVT, 4> ValueVTs;
3279 SmallVector<uint64_t, 4> Offsets;
3280 ComputeValueVTs(TLI, Ty, ValueVTs, &Offsets);
3281 unsigned NumValues = ValueVTs.size();
3286 bool ConstantMemory = false;
3287 if (I.isVolatile() || NumValues > MaxParallelChains)
3288 // Serialize volatile loads with other side effects.
3290 else if (AA->pointsToConstantMemory(
3291 AliasAnalysis::Location(SV, AA->getTypeStoreSize(Ty), TBAAInfo))) {
3292 // Do not serialize (non-volatile) loads of constant memory with anything.
3293 Root = DAG.getEntryNode();
3294 ConstantMemory = true;
3296 // Do not serialize non-volatile loads against each other.
3297 Root = DAG.getRoot();
3300 SmallVector<SDValue, 4> Values(NumValues);
3301 SmallVector<SDValue, 4> Chains(std::min(unsigned(MaxParallelChains),
3303 EVT PtrVT = Ptr.getValueType();
3304 unsigned ChainI = 0;
3305 for (unsigned i = 0; i != NumValues; ++i, ++ChainI) {
3306 // Serializing loads here may result in excessive register pressure, and
3307 // TokenFactor places arbitrary choke points on the scheduler. SD scheduling
3308 // could recover a bit by hoisting nodes upward in the chain by recognizing
3309 // they are side-effect free or do not alias. The optimizer should really
3310 // avoid this case by converting large object/array copies to llvm.memcpy
3311 // (MaxParallelChains should always remain as failsafe).
3312 if (ChainI == MaxParallelChains) {
3313 assert(PendingLoads.empty() && "PendingLoads must be serialized first");
3314 SDValue Chain = DAG.getNode(ISD::TokenFactor, getCurDebugLoc(),
3315 MVT::Other, &Chains[0], ChainI);
3319 SDValue A = DAG.getNode(ISD::ADD, getCurDebugLoc(),
3321 DAG.getConstant(Offsets[i], PtrVT));
3322 SDValue L = DAG.getLoad(ValueVTs[i], getCurDebugLoc(), Root,
3323 A, MachinePointerInfo(SV, Offsets[i]), isVolatile,
3324 isNonTemporal, isInvariant, Alignment, TBAAInfo,
3328 Chains[ChainI] = L.getValue(1);
3331 if (!ConstantMemory) {
3332 SDValue Chain = DAG.getNode(ISD::TokenFactor, getCurDebugLoc(),
3333 MVT::Other, &Chains[0], ChainI);
3337 PendingLoads.push_back(Chain);
3340 setValue(&I, DAG.getNode(ISD::MERGE_VALUES, getCurDebugLoc(),
3341 DAG.getVTList(&ValueVTs[0], NumValues),
3342 &Values[0], NumValues));
3345 void SelectionDAGBuilder::visitStore(const StoreInst &I) {
3347 return visitAtomicStore(I);
3349 const Value *SrcV = I.getOperand(0);
3350 const Value *PtrV = I.getOperand(1);
3352 SmallVector<EVT, 4> ValueVTs;
3353 SmallVector<uint64_t, 4> Offsets;
3354 ComputeValueVTs(TLI, SrcV->getType(), ValueVTs, &Offsets);
3355 unsigned NumValues = ValueVTs.size();
3359 // Get the lowered operands. Note that we do this after
3360 // checking if NumResults is zero, because with zero results
3361 // the operands won't have values in the map.
3362 SDValue Src = getValue(SrcV);
3363 SDValue Ptr = getValue(PtrV);
3365 SDValue Root = getRoot();
3366 SmallVector<SDValue, 4> Chains(std::min(unsigned(MaxParallelChains),
3368 EVT PtrVT = Ptr.getValueType();
3369 bool isVolatile = I.isVolatile();
3370 bool isNonTemporal = I.getMetadata("nontemporal") != 0;
3371 unsigned Alignment = I.getAlignment();
3372 const MDNode *TBAAInfo = I.getMetadata(LLVMContext::MD_tbaa);
3374 unsigned ChainI = 0;
3375 for (unsigned i = 0; i != NumValues; ++i, ++ChainI) {
3376 // See visitLoad comments.
3377 if (ChainI == MaxParallelChains) {
3378 SDValue Chain = DAG.getNode(ISD::TokenFactor, getCurDebugLoc(),
3379 MVT::Other, &Chains[0], ChainI);
3383 SDValue Add = DAG.getNode(ISD::ADD, getCurDebugLoc(), PtrVT, Ptr,
3384 DAG.getConstant(Offsets[i], PtrVT));
3385 SDValue St = DAG.getStore(Root, getCurDebugLoc(),
3386 SDValue(Src.getNode(), Src.getResNo() + i),
3387 Add, MachinePointerInfo(PtrV, Offsets[i]),
3388 isVolatile, isNonTemporal, Alignment, TBAAInfo);
3389 Chains[ChainI] = St;
3392 SDValue StoreNode = DAG.getNode(ISD::TokenFactor, getCurDebugLoc(),
3393 MVT::Other, &Chains[0], ChainI);
3395 AssignOrderingToNode(StoreNode.getNode());
3396 DAG.setRoot(StoreNode);
3399 static SDValue InsertFenceForAtomic(SDValue Chain, AtomicOrdering Order,
3400 SynchronizationScope Scope,
3401 bool Before, DebugLoc dl,
3403 const TargetLowering &TLI) {
3404 // Fence, if necessary
3406 if (Order == AcquireRelease || Order == SequentiallyConsistent)
3408 else if (Order == Acquire || Order == Monotonic)
3411 if (Order == AcquireRelease)
3413 else if (Order == Release || Order == Monotonic)
3418 Ops[1] = DAG.getConstant(Order, TLI.getPointerTy());
3419 Ops[2] = DAG.getConstant(Scope, TLI.getPointerTy());
3420 return DAG.getNode(ISD::ATOMIC_FENCE, dl, MVT::Other, Ops, 3);
3423 void SelectionDAGBuilder::visitAtomicCmpXchg(const AtomicCmpXchgInst &I) {
3424 DebugLoc dl = getCurDebugLoc();
3425 AtomicOrdering Order = I.getOrdering();
3426 SynchronizationScope Scope = I.getSynchScope();
3428 SDValue InChain = getRoot();
3430 if (TLI.getInsertFencesForAtomic())
3431 InChain = InsertFenceForAtomic(InChain, Order, Scope, true, dl,
3435 DAG.getAtomic(ISD::ATOMIC_CMP_SWAP, dl,
3436 getValue(I.getCompareOperand()).getValueType().getSimpleVT(),
3438 getValue(I.getPointerOperand()),
3439 getValue(I.getCompareOperand()),
3440 getValue(I.getNewValOperand()),
3441 MachinePointerInfo(I.getPointerOperand()), 0 /* Alignment */,
3442 TLI.getInsertFencesForAtomic() ? Monotonic : Order,
3445 SDValue OutChain = L.getValue(1);
3447 if (TLI.getInsertFencesForAtomic())
3448 OutChain = InsertFenceForAtomic(OutChain, Order, Scope, false, dl,
3452 DAG.setRoot(OutChain);
3455 void SelectionDAGBuilder::visitAtomicRMW(const AtomicRMWInst &I) {
3456 DebugLoc dl = getCurDebugLoc();
3458 switch (I.getOperation()) {
3459 default: llvm_unreachable("Unknown atomicrmw operation");
3460 case AtomicRMWInst::Xchg: NT = ISD::ATOMIC_SWAP; break;
3461 case AtomicRMWInst::Add: NT = ISD::ATOMIC_LOAD_ADD; break;
3462 case AtomicRMWInst::Sub: NT = ISD::ATOMIC_LOAD_SUB; break;
3463 case AtomicRMWInst::And: NT = ISD::ATOMIC_LOAD_AND; break;
3464 case AtomicRMWInst::Nand: NT = ISD::ATOMIC_LOAD_NAND; break;
3465 case AtomicRMWInst::Or: NT = ISD::ATOMIC_LOAD_OR; break;
3466 case AtomicRMWInst::Xor: NT = ISD::ATOMIC_LOAD_XOR; break;
3467 case AtomicRMWInst::Max: NT = ISD::ATOMIC_LOAD_MAX; break;
3468 case AtomicRMWInst::Min: NT = ISD::ATOMIC_LOAD_MIN; break;
3469 case AtomicRMWInst::UMax: NT = ISD::ATOMIC_LOAD_UMAX; break;
3470 case AtomicRMWInst::UMin: NT = ISD::ATOMIC_LOAD_UMIN; break;
3472 AtomicOrdering Order = I.getOrdering();
3473 SynchronizationScope Scope = I.getSynchScope();
3475 SDValue InChain = getRoot();
3477 if (TLI.getInsertFencesForAtomic())
3478 InChain = InsertFenceForAtomic(InChain, Order, Scope, true, dl,
3482 DAG.getAtomic(NT, dl,
3483 getValue(I.getValOperand()).getValueType().getSimpleVT(),
3485 getValue(I.getPointerOperand()),
3486 getValue(I.getValOperand()),
3487 I.getPointerOperand(), 0 /* Alignment */,
3488 TLI.getInsertFencesForAtomic() ? Monotonic : Order,
3491 SDValue OutChain = L.getValue(1);
3493 if (TLI.getInsertFencesForAtomic())
3494 OutChain = InsertFenceForAtomic(OutChain, Order, Scope, false, dl,
3498 DAG.setRoot(OutChain);
3501 void SelectionDAGBuilder::visitFence(const FenceInst &I) {
3502 DebugLoc dl = getCurDebugLoc();
3505 Ops[1] = DAG.getConstant(I.getOrdering(), TLI.getPointerTy());
3506 Ops[2] = DAG.getConstant(I.getSynchScope(), TLI.getPointerTy());
3507 DAG.setRoot(DAG.getNode(ISD::ATOMIC_FENCE, dl, MVT::Other, Ops, 3));
3510 void SelectionDAGBuilder::visitAtomicLoad(const LoadInst &I) {
3511 DebugLoc dl = getCurDebugLoc();
3512 AtomicOrdering Order = I.getOrdering();
3513 SynchronizationScope Scope = I.getSynchScope();
3515 SDValue InChain = getRoot();
3517 EVT VT = TLI.getValueType(I.getType());
3519 if (I.getAlignment() * 8 < VT.getSizeInBits())
3520 report_fatal_error("Cannot generate unaligned atomic load");
3523 DAG.getAtomic(ISD::ATOMIC_LOAD, dl, VT, VT, InChain,
3524 getValue(I.getPointerOperand()),
3525 I.getPointerOperand(), I.getAlignment(),
3526 TLI.getInsertFencesForAtomic() ? Monotonic : Order,
3529 SDValue OutChain = L.getValue(1);
3531 if (TLI.getInsertFencesForAtomic())
3532 OutChain = InsertFenceForAtomic(OutChain, Order, Scope, false, dl,
3536 DAG.setRoot(OutChain);
3539 void SelectionDAGBuilder::visitAtomicStore(const StoreInst &I) {
3540 DebugLoc dl = getCurDebugLoc();
3542 AtomicOrdering Order = I.getOrdering();
3543 SynchronizationScope Scope = I.getSynchScope();
3545 SDValue InChain = getRoot();
3547 EVT VT = TLI.getValueType(I.getValueOperand()->getType());
3549 if (I.getAlignment() * 8 < VT.getSizeInBits())
3550 report_fatal_error("Cannot generate unaligned atomic store");
3552 if (TLI.getInsertFencesForAtomic())
3553 InChain = InsertFenceForAtomic(InChain, Order, Scope, true, dl,
3557 DAG.getAtomic(ISD::ATOMIC_STORE, dl, VT,
3559 getValue(I.getPointerOperand()),
3560 getValue(I.getValueOperand()),
3561 I.getPointerOperand(), I.getAlignment(),
3562 TLI.getInsertFencesForAtomic() ? Monotonic : Order,
3565 if (TLI.getInsertFencesForAtomic())
3566 OutChain = InsertFenceForAtomic(OutChain, Order, Scope, false, dl,
3569 DAG.setRoot(OutChain);
3572 /// visitTargetIntrinsic - Lower a call of a target intrinsic to an INTRINSIC
3574 void SelectionDAGBuilder::visitTargetIntrinsic(const CallInst &I,
3575 unsigned Intrinsic) {
3576 bool HasChain = !I.doesNotAccessMemory();
3577 bool OnlyLoad = HasChain && I.onlyReadsMemory();
3579 // Build the operand list.
3580 SmallVector<SDValue, 8> Ops;
3581 if (HasChain) { // If this intrinsic has side-effects, chainify it.
3583 // We don't need to serialize loads against other loads.
3584 Ops.push_back(DAG.getRoot());
3586 Ops.push_back(getRoot());
3590 // Info is set by getTgtMemInstrinsic
3591 TargetLowering::IntrinsicInfo Info;
3592 bool IsTgtIntrinsic = TLI.getTgtMemIntrinsic(Info, I, Intrinsic);
3594 // Add the intrinsic ID as an integer operand if it's not a target intrinsic.
3595 if (!IsTgtIntrinsic || Info.opc == ISD::INTRINSIC_VOID ||
3596 Info.opc == ISD::INTRINSIC_W_CHAIN)
3597 Ops.push_back(DAG.getTargetConstant(Intrinsic, TLI.getPointerTy()));
3599 // Add all operands of the call to the operand list.
3600 for (unsigned i = 0, e = I.getNumArgOperands(); i != e; ++i) {
3601 SDValue Op = getValue(I.getArgOperand(i));
3605 SmallVector<EVT, 4> ValueVTs;
3606 ComputeValueVTs(TLI, I.getType(), ValueVTs);
3609 ValueVTs.push_back(MVT::Other);
3611 SDVTList VTs = DAG.getVTList(ValueVTs.data(), ValueVTs.size());
3615 if (IsTgtIntrinsic) {
3616 // This is target intrinsic that touches memory
3617 Result = DAG.getMemIntrinsicNode(Info.opc, getCurDebugLoc(),
3618 VTs, &Ops[0], Ops.size(),
3620 MachinePointerInfo(Info.ptrVal, Info.offset),
3621 Info.align, Info.vol,
3622 Info.readMem, Info.writeMem);
3623 } else if (!HasChain) {
3624 Result = DAG.getNode(ISD::INTRINSIC_WO_CHAIN, getCurDebugLoc(),
3625 VTs, &Ops[0], Ops.size());
3626 } else if (!I.getType()->isVoidTy()) {
3627 Result = DAG.getNode(ISD::INTRINSIC_W_CHAIN, getCurDebugLoc(),
3628 VTs, &Ops[0], Ops.size());
3630 Result = DAG.getNode(ISD::INTRINSIC_VOID, getCurDebugLoc(),
3631 VTs, &Ops[0], Ops.size());
3635 SDValue Chain = Result.getValue(Result.getNode()->getNumValues()-1);
3637 PendingLoads.push_back(Chain);
3642 if (!I.getType()->isVoidTy()) {
3643 if (VectorType *PTy = dyn_cast<VectorType>(I.getType())) {
3644 EVT VT = TLI.getValueType(PTy);
3645 Result = DAG.getNode(ISD::BITCAST, getCurDebugLoc(), VT, Result);
3648 setValue(&I, Result);
3650 // Assign order to result here. If the intrinsic does not produce a result,
3651 // it won't be mapped to a SDNode and visit() will not assign it an order
3654 AssignOrderingToNode(Result.getNode());
3658 /// GetSignificand - Get the significand and build it into a floating-point
3659 /// number with exponent of 1:
3661 /// Op = (Op & 0x007fffff) | 0x3f800000;
3663 /// where Op is the hexidecimal representation of floating point value.
3665 GetSignificand(SelectionDAG &DAG, SDValue Op, DebugLoc dl) {
3666 SDValue t1 = DAG.getNode(ISD::AND, dl, MVT::i32, Op,
3667 DAG.getConstant(0x007fffff, MVT::i32));
3668 SDValue t2 = DAG.getNode(ISD::OR, dl, MVT::i32, t1,
3669 DAG.getConstant(0x3f800000, MVT::i32));
3670 return DAG.getNode(ISD::BITCAST, dl, MVT::f32, t2);
3673 /// GetExponent - Get the exponent:
3675 /// (float)(int)(((Op & 0x7f800000) >> 23) - 127);
3677 /// where Op is the hexidecimal representation of floating point value.
3679 GetExponent(SelectionDAG &DAG, SDValue Op, const TargetLowering &TLI,
3681 SDValue t0 = DAG.getNode(ISD::AND, dl, MVT::i32, Op,
3682 DAG.getConstant(0x7f800000, MVT::i32));
3683 SDValue t1 = DAG.getNode(ISD::SRL, dl, MVT::i32, t0,
3684 DAG.getConstant(23, TLI.getPointerTy()));
3685 SDValue t2 = DAG.getNode(ISD::SUB, dl, MVT::i32, t1,
3686 DAG.getConstant(127, MVT::i32));
3687 return DAG.getNode(ISD::SINT_TO_FP, dl, MVT::f32, t2);
3690 /// getF32Constant - Get 32-bit floating point constant.
3692 getF32Constant(SelectionDAG &DAG, unsigned Flt) {
3693 return DAG.getConstantFP(APFloat(APInt(32, Flt)), MVT::f32);
3696 /// expandExp - Lower an exp intrinsic. Handles the special sequences for
3697 /// limited-precision mode.
3698 static SDValue expandExp(DebugLoc dl, SDValue Op, SelectionDAG &DAG,
3699 const TargetLowering &TLI) {
3700 if (Op.getValueType() == MVT::f32 &&
3701 LimitFloatPrecision > 0 && LimitFloatPrecision <= 18) {
3703 // Put the exponent in the right bit position for later addition to the
3706 // #define LOG2OFe 1.4426950f
3707 // IntegerPartOfX = ((int32_t)(X * LOG2OFe));
3708 SDValue t0 = DAG.getNode(ISD::FMUL, dl, MVT::f32, Op,
3709 getF32Constant(DAG, 0x3fb8aa3b));
3710 SDValue IntegerPartOfX = DAG.getNode(ISD::FP_TO_SINT, dl, MVT::i32, t0);
3712 // FractionalPartOfX = (X * LOG2OFe) - (float)IntegerPartOfX;
3713 SDValue t1 = DAG.getNode(ISD::SINT_TO_FP, dl, MVT::f32, IntegerPartOfX);
3714 SDValue X = DAG.getNode(ISD::FSUB, dl, MVT::f32, t0, t1);
3716 // IntegerPartOfX <<= 23;
3717 IntegerPartOfX = DAG.getNode(ISD::SHL, dl, MVT::i32, IntegerPartOfX,
3718 DAG.getConstant(23, TLI.getPointerTy()));
3720 SDValue TwoToFracPartOfX;
3721 if (LimitFloatPrecision <= 6) {
3722 // For floating-point precision of 6:
3724 // TwoToFractionalPartOfX =
3726 // (0.735607626f + 0.252464424f * x) * x;
3728 // error 0.0144103317, which is 6 bits
3729 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
3730 getF32Constant(DAG, 0x3e814304));
3731 SDValue t3 = DAG.getNode(ISD::FADD, dl, MVT::f32, t2,
3732 getF32Constant(DAG, 0x3f3c50c8));
3733 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X);
3734 TwoToFracPartOfX = DAG.getNode(ISD::FADD, dl, MVT::f32, t4,
3735 getF32Constant(DAG, 0x3f7f5e7e));
3736 } else if (LimitFloatPrecision <= 12) {
3737 // For floating-point precision of 12:
3739 // TwoToFractionalPartOfX =
3742 // (0.224338339f + 0.792043434e-1f * x) * x) * x;
3744 // 0.000107046256 error, which is 13 to 14 bits
3745 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
3746 getF32Constant(DAG, 0x3da235e3));
3747 SDValue t3 = DAG.getNode(ISD::FADD, dl, MVT::f32, t2,
3748 getF32Constant(DAG, 0x3e65b8f3));
3749 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X);
3750 SDValue t5 = DAG.getNode(ISD::FADD, dl, MVT::f32, t4,
3751 getF32Constant(DAG, 0x3f324b07));
3752 SDValue t6 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t5, X);
3753 TwoToFracPartOfX = DAG.getNode(ISD::FADD, dl, MVT::f32, t6,
3754 getF32Constant(DAG, 0x3f7ff8fd));
3755 } else { // LimitFloatPrecision <= 18
3756 // For floating-point precision of 18:
3758 // TwoToFractionalPartOfX =
3762 // (0.554906021e-1f +
3763 // (0.961591928e-2f +
3764 // (0.136028312e-2f + 0.157059148e-3f *x)*x)*x)*x)*x)*x;
3766 // error 2.47208000*10^(-7), which is better than 18 bits
3767 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
3768 getF32Constant(DAG, 0x3924b03e));
3769 SDValue t3 = DAG.getNode(ISD::FADD, dl, MVT::f32, t2,
3770 getF32Constant(DAG, 0x3ab24b87));
3771 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X);
3772 SDValue t5 = DAG.getNode(ISD::FADD, dl, MVT::f32, t4,
3773 getF32Constant(DAG, 0x3c1d8c17));
3774 SDValue t6 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t5, X);
3775 SDValue t7 = DAG.getNode(ISD::FADD, dl, MVT::f32, t6,
3776 getF32Constant(DAG, 0x3d634a1d));
3777 SDValue t8 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t7, X);
3778 SDValue t9 = DAG.getNode(ISD::FADD, dl, MVT::f32, t8,
3779 getF32Constant(DAG, 0x3e75fe14));
3780 SDValue t10 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t9, X);
3781 SDValue t11 = DAG.getNode(ISD::FADD, dl, MVT::f32, t10,
3782 getF32Constant(DAG, 0x3f317234));
3783 SDValue t12 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t11, X);
3784 TwoToFracPartOfX = DAG.getNode(ISD::FADD, dl, MVT::f32, t12,
3785 getF32Constant(DAG, 0x3f800000));
3788 // Add the exponent into the result in integer domain.
3789 SDValue t13 = DAG.getNode(ISD::BITCAST, dl, MVT::i32, TwoToFracPartOfX);
3790 return DAG.getNode(ISD::BITCAST, dl, MVT::f32,
3791 DAG.getNode(ISD::ADD, dl, MVT::i32,
3792 t13, IntegerPartOfX));
3795 // No special expansion.
3796 return DAG.getNode(ISD::FEXP, dl, Op.getValueType(), Op);
3799 /// expandLog - Lower a log intrinsic. Handles the special sequences for
3800 /// limited-precision mode.
3801 static SDValue expandLog(DebugLoc dl, SDValue Op, SelectionDAG &DAG,
3802 const TargetLowering &TLI) {
3803 if (Op.getValueType() == MVT::f32 &&
3804 LimitFloatPrecision > 0 && LimitFloatPrecision <= 18) {
3805 SDValue Op1 = DAG.getNode(ISD::BITCAST, dl, MVT::i32, Op);
3807 // Scale the exponent by log(2) [0.69314718f].
3808 SDValue Exp = GetExponent(DAG, Op1, TLI, dl);
3809 SDValue LogOfExponent = DAG.getNode(ISD::FMUL, dl, MVT::f32, Exp,
3810 getF32Constant(DAG, 0x3f317218));
3812 // Get the significand and build it into a floating-point number with
3814 SDValue X = GetSignificand(DAG, Op1, dl);
3816 SDValue LogOfMantissa;
3817 if (LimitFloatPrecision <= 6) {
3818 // For floating-point precision of 6:
3822 // (1.4034025f - 0.23903021f * x) * x;
3824 // error 0.0034276066, which is better than 8 bits
3825 SDValue t0 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
3826 getF32Constant(DAG, 0xbe74c456));
3827 SDValue t1 = DAG.getNode(ISD::FADD, dl, MVT::f32, t0,
3828 getF32Constant(DAG, 0x3fb3a2b1));
3829 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t1, X);
3830 LogOfMantissa = DAG.getNode(ISD::FSUB, dl, MVT::f32, t2,
3831 getF32Constant(DAG, 0x3f949a29));
3832 } else if (LimitFloatPrecision <= 12) {
3833 // For floating-point precision of 12:
3839 // (0.44717955f - 0.56570851e-1f * x) * x) * x) * x;
3841 // error 0.000061011436, which is 14 bits
3842 SDValue t0 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
3843 getF32Constant(DAG, 0xbd67b6d6));
3844 SDValue t1 = DAG.getNode(ISD::FADD, dl, MVT::f32, t0,
3845 getF32Constant(DAG, 0x3ee4f4b8));
3846 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t1, X);
3847 SDValue t3 = DAG.getNode(ISD::FSUB, dl, MVT::f32, t2,
3848 getF32Constant(DAG, 0x3fbc278b));
3849 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X);
3850 SDValue t5 = DAG.getNode(ISD::FADD, dl, MVT::f32, t4,
3851 getF32Constant(DAG, 0x40348e95));
3852 SDValue t6 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t5, X);
3853 LogOfMantissa = DAG.getNode(ISD::FSUB, dl, MVT::f32, t6,
3854 getF32Constant(DAG, 0x3fdef31a));
3855 } else { // LimitFloatPrecision <= 18
3856 // For floating-point precision of 18:
3864 // (0.19073739f - 0.17809712e-1f * x) * x) * x) * x) * x)*x;
3866 // error 0.0000023660568, which is better than 18 bits
3867 SDValue t0 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
3868 getF32Constant(DAG, 0xbc91e5ac));
3869 SDValue t1 = DAG.getNode(ISD::FADD, dl, MVT::f32, t0,
3870 getF32Constant(DAG, 0x3e4350aa));
3871 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t1, X);
3872 SDValue t3 = DAG.getNode(ISD::FSUB, dl, MVT::f32, t2,
3873 getF32Constant(DAG, 0x3f60d3e3));
3874 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X);
3875 SDValue t5 = DAG.getNode(ISD::FADD, dl, MVT::f32, t4,
3876 getF32Constant(DAG, 0x4011cdf0));
3877 SDValue t6 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t5, X);
3878 SDValue t7 = DAG.getNode(ISD::FSUB, dl, MVT::f32, t6,
3879 getF32Constant(DAG, 0x406cfd1c));
3880 SDValue t8 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t7, X);
3881 SDValue t9 = DAG.getNode(ISD::FADD, dl, MVT::f32, t8,
3882 getF32Constant(DAG, 0x408797cb));
3883 SDValue t10 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t9, X);
3884 LogOfMantissa = DAG.getNode(ISD::FSUB, dl, MVT::f32, t10,
3885 getF32Constant(DAG, 0x4006dcab));
3888 return DAG.getNode(ISD::FADD, dl, MVT::f32, LogOfExponent, LogOfMantissa);
3891 // No special expansion.
3892 return DAG.getNode(ISD::FLOG, dl, Op.getValueType(), Op);
3895 /// expandLog2 - Lower a log2 intrinsic. Handles the special sequences for
3896 /// limited-precision mode.
3897 static SDValue expandLog2(DebugLoc dl, SDValue Op, SelectionDAG &DAG,
3898 const TargetLowering &TLI) {
3899 if (Op.getValueType() == MVT::f32 &&
3900 LimitFloatPrecision > 0 && LimitFloatPrecision <= 18) {
3901 SDValue Op1 = DAG.getNode(ISD::BITCAST, dl, MVT::i32, Op);
3903 // Get the exponent.
3904 SDValue LogOfExponent = GetExponent(DAG, Op1, TLI, dl);
3906 // Get the significand and build it into a floating-point number with
3908 SDValue X = GetSignificand(DAG, Op1, dl);
3910 // Different possible minimax approximations of significand in
3911 // floating-point for various degrees of accuracy over [1,2].
3912 SDValue Log2ofMantissa;
3913 if (LimitFloatPrecision <= 6) {
3914 // For floating-point precision of 6:
3916 // Log2ofMantissa = -1.6749035f + (2.0246817f - .34484768f * x) * x;
3918 // error 0.0049451742, which is more than 7 bits
3919 SDValue t0 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
3920 getF32Constant(DAG, 0xbeb08fe0));
3921 SDValue t1 = DAG.getNode(ISD::FADD, dl, MVT::f32, t0,
3922 getF32Constant(DAG, 0x40019463));
3923 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t1, X);
3924 Log2ofMantissa = DAG.getNode(ISD::FSUB, dl, MVT::f32, t2,
3925 getF32Constant(DAG, 0x3fd6633d));
3926 } else if (LimitFloatPrecision <= 12) {
3927 // For floating-point precision of 12:
3933 // (.645142248f - 0.816157886e-1f * x) * x) * x) * x;
3935 // error 0.0000876136000, which is better than 13 bits
3936 SDValue t0 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
3937 getF32Constant(DAG, 0xbda7262e));
3938 SDValue t1 = DAG.getNode(ISD::FADD, dl, MVT::f32, t0,
3939 getF32Constant(DAG, 0x3f25280b));
3940 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t1, X);
3941 SDValue t3 = DAG.getNode(ISD::FSUB, dl, MVT::f32, t2,
3942 getF32Constant(DAG, 0x4007b923));
3943 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X);
3944 SDValue t5 = DAG.getNode(ISD::FADD, dl, MVT::f32, t4,
3945 getF32Constant(DAG, 0x40823e2f));
3946 SDValue t6 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t5, X);
3947 Log2ofMantissa = DAG.getNode(ISD::FSUB, dl, MVT::f32, t6,
3948 getF32Constant(DAG, 0x4020d29c));
3949 } else { // LimitFloatPrecision <= 18
3950 // For floating-point precision of 18:
3959 // 0.25691327e-1f * x) * x) * x) * x) * x) * x;
3961 // error 0.0000018516, which is better than 18 bits
3962 SDValue t0 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
3963 getF32Constant(DAG, 0xbcd2769e));
3964 SDValue t1 = DAG.getNode(ISD::FADD, dl, MVT::f32, t0,
3965 getF32Constant(DAG, 0x3e8ce0b9));
3966 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t1, X);
3967 SDValue t3 = DAG.getNode(ISD::FSUB, dl, MVT::f32, t2,
3968 getF32Constant(DAG, 0x3fa22ae7));
3969 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X);
3970 SDValue t5 = DAG.getNode(ISD::FADD, dl, MVT::f32, t4,
3971 getF32Constant(DAG, 0x40525723));
3972 SDValue t6 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t5, X);
3973 SDValue t7 = DAG.getNode(ISD::FSUB, dl, MVT::f32, t6,
3974 getF32Constant(DAG, 0x40aaf200));
3975 SDValue t8 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t7, X);
3976 SDValue t9 = DAG.getNode(ISD::FADD, dl, MVT::f32, t8,
3977 getF32Constant(DAG, 0x40c39dad));
3978 SDValue t10 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t9, X);
3979 Log2ofMantissa = DAG.getNode(ISD::FSUB, dl, MVT::f32, t10,
3980 getF32Constant(DAG, 0x4042902c));
3983 return DAG.getNode(ISD::FADD, dl, MVT::f32, LogOfExponent, Log2ofMantissa);
3986 // No special expansion.
3987 return DAG.getNode(ISD::FLOG2, dl, Op.getValueType(), Op);
3990 /// expandLog10 - Lower a log10 intrinsic. Handles the special sequences for
3991 /// limited-precision mode.
3992 static SDValue expandLog10(DebugLoc dl, SDValue Op, SelectionDAG &DAG,
3993 const TargetLowering &TLI) {
3994 if (Op.getValueType() == MVT::f32 &&
3995 LimitFloatPrecision > 0 && LimitFloatPrecision <= 18) {
3996 SDValue Op1 = DAG.getNode(ISD::BITCAST, dl, MVT::i32, Op);
3998 // Scale the exponent by log10(2) [0.30102999f].
3999 SDValue Exp = GetExponent(DAG, Op1, TLI, dl);
4000 SDValue LogOfExponent = DAG.getNode(ISD::FMUL, dl, MVT::f32, Exp,
4001 getF32Constant(DAG, 0x3e9a209a));
4003 // Get the significand and build it into a floating-point number with
4005 SDValue X = GetSignificand(DAG, Op1, dl);
4007 SDValue Log10ofMantissa;
4008 if (LimitFloatPrecision <= 6) {
4009 // For floating-point precision of 6:
4011 // Log10ofMantissa =
4013 // (0.60948995f - 0.10380950f * x) * x;
4015 // error 0.0014886165, which is 6 bits
4016 SDValue t0 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
4017 getF32Constant(DAG, 0xbdd49a13));
4018 SDValue t1 = DAG.getNode(ISD::FADD, dl, MVT::f32, t0,
4019 getF32Constant(DAG, 0x3f1c0789));
4020 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t1, X);
4021 Log10ofMantissa = DAG.getNode(ISD::FSUB, dl, MVT::f32, t2,
4022 getF32Constant(DAG, 0x3f011300));
4023 } else if (LimitFloatPrecision <= 12) {
4024 // For floating-point precision of 12:
4026 // Log10ofMantissa =
4029 // (-0.31664806f + 0.47637168e-1f * x) * x) * x;
4031 // error 0.00019228036, which is better than 12 bits
4032 SDValue t0 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
4033 getF32Constant(DAG, 0x3d431f31));
4034 SDValue t1 = DAG.getNode(ISD::FSUB, dl, MVT::f32, t0,
4035 getF32Constant(DAG, 0x3ea21fb2));
4036 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t1, X);
4037 SDValue t3 = DAG.getNode(ISD::FADD, dl, MVT::f32, t2,
4038 getF32Constant(DAG, 0x3f6ae232));
4039 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X);
4040 Log10ofMantissa = DAG.getNode(ISD::FSUB, dl, MVT::f32, t4,
4041 getF32Constant(DAG, 0x3f25f7c3));
4042 } else { // LimitFloatPrecision <= 18
4043 // For floating-point precision of 18:
4045 // Log10ofMantissa =
4050 // (-0.12539807f + 0.13508273e-1f * x) * x) * x) * x) * x;
4052 // error 0.0000037995730, which is better than 18 bits
4053 SDValue t0 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
4054 getF32Constant(DAG, 0x3c5d51ce));
4055 SDValue t1 = DAG.getNode(ISD::FSUB, dl, MVT::f32, t0,
4056 getF32Constant(DAG, 0x3e00685a));
4057 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t1, X);
4058 SDValue t3 = DAG.getNode(ISD::FADD, dl, MVT::f32, t2,
4059 getF32Constant(DAG, 0x3efb6798));
4060 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X);
4061 SDValue t5 = DAG.getNode(ISD::FSUB, dl, MVT::f32, t4,
4062 getF32Constant(DAG, 0x3f88d192));
4063 SDValue t6 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t5, X);
4064 SDValue t7 = DAG.getNode(ISD::FADD, dl, MVT::f32, t6,
4065 getF32Constant(DAG, 0x3fc4316c));
4066 SDValue t8 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t7, X);
4067 Log10ofMantissa = DAG.getNode(ISD::FSUB, dl, MVT::f32, t8,
4068 getF32Constant(DAG, 0x3f57ce70));
4071 return DAG.getNode(ISD::FADD, dl, MVT::f32, LogOfExponent, Log10ofMantissa);
4074 // No special expansion.
4075 return DAG.getNode(ISD::FLOG10, dl, Op.getValueType(), Op);
4078 /// expandExp2 - Lower an exp2 intrinsic. Handles the special sequences for
4079 /// limited-precision mode.
4080 static SDValue expandExp2(DebugLoc dl, SDValue Op, SelectionDAG &DAG,
4081 const TargetLowering &TLI) {
4082 if (Op.getValueType() == MVT::f32 &&
4083 LimitFloatPrecision > 0 && LimitFloatPrecision <= 18) {
4084 SDValue IntegerPartOfX = DAG.getNode(ISD::FP_TO_SINT, dl, MVT::i32, Op);
4086 // FractionalPartOfX = x - (float)IntegerPartOfX;
4087 SDValue t1 = DAG.getNode(ISD::SINT_TO_FP, dl, MVT::f32, IntegerPartOfX);
4088 SDValue X = DAG.getNode(ISD::FSUB, dl, MVT::f32, Op, t1);
4090 // IntegerPartOfX <<= 23;
4091 IntegerPartOfX = DAG.getNode(ISD::SHL, dl, MVT::i32, IntegerPartOfX,
4092 DAG.getConstant(23, TLI.getPointerTy()));
4094 SDValue TwoToFractionalPartOfX;
4095 if (LimitFloatPrecision <= 6) {
4096 // For floating-point precision of 6:
4098 // TwoToFractionalPartOfX =
4100 // (0.735607626f + 0.252464424f * x) * x;
4102 // error 0.0144103317, which is 6 bits
4103 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
4104 getF32Constant(DAG, 0x3e814304));
4105 SDValue t3 = DAG.getNode(ISD::FADD, dl, MVT::f32, t2,
4106 getF32Constant(DAG, 0x3f3c50c8));
4107 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X);
4108 TwoToFractionalPartOfX = DAG.getNode(ISD::FADD, dl, MVT::f32, t4,
4109 getF32Constant(DAG, 0x3f7f5e7e));
4110 } else if (LimitFloatPrecision <= 12) {
4111 // For floating-point precision of 12:
4113 // TwoToFractionalPartOfX =
4116 // (0.224338339f + 0.792043434e-1f * x) * x) * x;
4118 // error 0.000107046256, which is 13 to 14 bits
4119 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
4120 getF32Constant(DAG, 0x3da235e3));
4121 SDValue t3 = DAG.getNode(ISD::FADD, dl, MVT::f32, t2,
4122 getF32Constant(DAG, 0x3e65b8f3));
4123 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X);
4124 SDValue t5 = DAG.getNode(ISD::FADD, dl, MVT::f32, t4,
4125 getF32Constant(DAG, 0x3f324b07));
4126 SDValue t6 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t5, X);
4127 TwoToFractionalPartOfX = DAG.getNode(ISD::FADD, dl, MVT::f32, t6,
4128 getF32Constant(DAG, 0x3f7ff8fd));
4129 } else { // LimitFloatPrecision <= 18
4130 // For floating-point precision of 18:
4132 // TwoToFractionalPartOfX =
4136 // (0.554906021e-1f +
4137 // (0.961591928e-2f +
4138 // (0.136028312e-2f + 0.157059148e-3f *x)*x)*x)*x)*x)*x;
4139 // error 2.47208000*10^(-7), which is better than 18 bits
4140 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
4141 getF32Constant(DAG, 0x3924b03e));
4142 SDValue t3 = DAG.getNode(ISD::FADD, dl, MVT::f32, t2,
4143 getF32Constant(DAG, 0x3ab24b87));
4144 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X);
4145 SDValue t5 = DAG.getNode(ISD::FADD, dl, MVT::f32, t4,
4146 getF32Constant(DAG, 0x3c1d8c17));
4147 SDValue t6 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t5, X);
4148 SDValue t7 = DAG.getNode(ISD::FADD, dl, MVT::f32, t6,
4149 getF32Constant(DAG, 0x3d634a1d));
4150 SDValue t8 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t7, X);
4151 SDValue t9 = DAG.getNode(ISD::FADD, dl, MVT::f32, t8,
4152 getF32Constant(DAG, 0x3e75fe14));
4153 SDValue t10 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t9, X);
4154 SDValue t11 = DAG.getNode(ISD::FADD, dl, MVT::f32, t10,
4155 getF32Constant(DAG, 0x3f317234));
4156 SDValue t12 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t11, X);
4157 TwoToFractionalPartOfX = DAG.getNode(ISD::FADD, dl, MVT::f32, t12,
4158 getF32Constant(DAG, 0x3f800000));
4161 // Add the exponent into the result in integer domain.
4162 SDValue t13 = DAG.getNode(ISD::BITCAST, dl, MVT::i32,
4163 TwoToFractionalPartOfX);
4164 return DAG.getNode(ISD::BITCAST, dl, MVT::f32,
4165 DAG.getNode(ISD::ADD, dl, MVT::i32,
4166 t13, IntegerPartOfX));
4169 // No special expansion.
4170 return DAG.getNode(ISD::FEXP2, dl, Op.getValueType(), Op);
4173 /// visitPow - Lower a pow intrinsic. Handles the special sequences for
4174 /// limited-precision mode with x == 10.0f.
4175 static SDValue expandPow(DebugLoc dl, SDValue LHS, SDValue RHS,
4176 SelectionDAG &DAG, const TargetLowering &TLI) {
4177 bool IsExp10 = false;
4178 if (LHS.getValueType() == MVT::f32 && LHS.getValueType() == MVT::f32 &&
4179 LimitFloatPrecision > 0 && LimitFloatPrecision <= 18) {
4180 if (ConstantFPSDNode *LHSC = dyn_cast<ConstantFPSDNode>(LHS)) {
4182 IsExp10 = LHSC->isExactlyValue(Ten);
4187 // Put the exponent in the right bit position for later addition to the
4190 // #define LOG2OF10 3.3219281f
4191 // IntegerPartOfX = (int32_t)(x * LOG2OF10);
4192 SDValue t0 = DAG.getNode(ISD::FMUL, dl, MVT::f32, RHS,
4193 getF32Constant(DAG, 0x40549a78));
4194 SDValue IntegerPartOfX = DAG.getNode(ISD::FP_TO_SINT, dl, MVT::i32, t0);
4196 // FractionalPartOfX = x - (float)IntegerPartOfX;
4197 SDValue t1 = DAG.getNode(ISD::SINT_TO_FP, dl, MVT::f32, IntegerPartOfX);
4198 SDValue X = DAG.getNode(ISD::FSUB, dl, MVT::f32, t0, t1);
4200 // IntegerPartOfX <<= 23;
4201 IntegerPartOfX = DAG.getNode(ISD::SHL, dl, MVT::i32, IntegerPartOfX,
4202 DAG.getConstant(23, TLI.getPointerTy()));
4204 SDValue TwoToFractionalPartOfX;
4205 if (LimitFloatPrecision <= 6) {
4206 // For floating-point precision of 6:
4208 // twoToFractionalPartOfX =
4210 // (0.735607626f + 0.252464424f * x) * x;
4212 // error 0.0144103317, which is 6 bits
4213 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
4214 getF32Constant(DAG, 0x3e814304));
4215 SDValue t3 = DAG.getNode(ISD::FADD, dl, MVT::f32, t2,
4216 getF32Constant(DAG, 0x3f3c50c8));
4217 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X);
4218 TwoToFractionalPartOfX = DAG.getNode(ISD::FADD, dl, MVT::f32, t4,
4219 getF32Constant(DAG, 0x3f7f5e7e));
4220 } else if (LimitFloatPrecision <= 12) {
4221 // For floating-point precision of 12:
4223 // TwoToFractionalPartOfX =
4226 // (0.224338339f + 0.792043434e-1f * x) * x) * x;
4228 // error 0.000107046256, which is 13 to 14 bits
4229 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
4230 getF32Constant(DAG, 0x3da235e3));
4231 SDValue t3 = DAG.getNode(ISD::FADD, dl, MVT::f32, t2,
4232 getF32Constant(DAG, 0x3e65b8f3));
4233 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X);
4234 SDValue t5 = DAG.getNode(ISD::FADD, dl, MVT::f32, t4,
4235 getF32Constant(DAG, 0x3f324b07));
4236 SDValue t6 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t5, X);
4237 TwoToFractionalPartOfX = DAG.getNode(ISD::FADD, dl, MVT::f32, t6,
4238 getF32Constant(DAG, 0x3f7ff8fd));
4239 } else { // LimitFloatPrecision <= 18
4240 // For floating-point precision of 18:
4242 // TwoToFractionalPartOfX =
4246 // (0.554906021e-1f +
4247 // (0.961591928e-2f +
4248 // (0.136028312e-2f + 0.157059148e-3f *x)*x)*x)*x)*x)*x;
4249 // error 2.47208000*10^(-7), which is better than 18 bits
4250 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
4251 getF32Constant(DAG, 0x3924b03e));
4252 SDValue t3 = DAG.getNode(ISD::FADD, dl, MVT::f32, t2,
4253 getF32Constant(DAG, 0x3ab24b87));
4254 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X);
4255 SDValue t5 = DAG.getNode(ISD::FADD, dl, MVT::f32, t4,
4256 getF32Constant(DAG, 0x3c1d8c17));
4257 SDValue t6 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t5, X);
4258 SDValue t7 = DAG.getNode(ISD::FADD, dl, MVT::f32, t6,
4259 getF32Constant(DAG, 0x3d634a1d));
4260 SDValue t8 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t7, X);
4261 SDValue t9 = DAG.getNode(ISD::FADD, dl, MVT::f32, t8,
4262 getF32Constant(DAG, 0x3e75fe14));
4263 SDValue t10 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t9, X);
4264 SDValue t11 = DAG.getNode(ISD::FADD, dl, MVT::f32, t10,
4265 getF32Constant(DAG, 0x3f317234));
4266 SDValue t12 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t11, X);
4267 TwoToFractionalPartOfX = DAG.getNode(ISD::FADD, dl, MVT::f32, t12,
4268 getF32Constant(DAG, 0x3f800000));
4271 SDValue t13 = DAG.getNode(ISD::BITCAST, dl,MVT::i32,TwoToFractionalPartOfX);
4272 return DAG.getNode(ISD::BITCAST, dl, MVT::f32,
4273 DAG.getNode(ISD::ADD, dl, MVT::i32,
4274 t13, IntegerPartOfX));
4277 // No special expansion.
4278 return DAG.getNode(ISD::FPOW, dl, LHS.getValueType(), LHS, RHS);
4282 /// ExpandPowI - Expand a llvm.powi intrinsic.
4283 static SDValue ExpandPowI(DebugLoc DL, SDValue LHS, SDValue RHS,
4284 SelectionDAG &DAG) {
4285 // If RHS is a constant, we can expand this out to a multiplication tree,
4286 // otherwise we end up lowering to a call to __powidf2 (for example). When
4287 // optimizing for size, we only want to do this if the expansion would produce
4288 // a small number of multiplies, otherwise we do the full expansion.
4289 if (ConstantSDNode *RHSC = dyn_cast<ConstantSDNode>(RHS)) {
4290 // Get the exponent as a positive value.
4291 unsigned Val = RHSC->getSExtValue();
4292 if ((int)Val < 0) Val = -Val;
4294 // powi(x, 0) -> 1.0
4296 return DAG.getConstantFP(1.0, LHS.getValueType());
4298 const Function *F = DAG.getMachineFunction().getFunction();
4299 if (!F->getAttributes().hasAttribute(AttributeSet::FunctionIndex,
4300 Attribute::OptimizeForSize) ||
4301 // If optimizing for size, don't insert too many multiplies. This
4302 // inserts up to 5 multiplies.
4303 CountPopulation_32(Val)+Log2_32(Val) < 7) {
4304 // We use the simple binary decomposition method to generate the multiply
4305 // sequence. There are more optimal ways to do this (for example,
4306 // powi(x,15) generates one more multiply than it should), but this has
4307 // the benefit of being both really simple and much better than a libcall.
4308 SDValue Res; // Logically starts equal to 1.0
4309 SDValue CurSquare = LHS;
4313 Res = DAG.getNode(ISD::FMUL, DL,Res.getValueType(), Res, CurSquare);
4315 Res = CurSquare; // 1.0*CurSquare.
4318 CurSquare = DAG.getNode(ISD::FMUL, DL, CurSquare.getValueType(),
4319 CurSquare, CurSquare);
4323 // If the original was negative, invert the result, producing 1/(x*x*x).
4324 if (RHSC->getSExtValue() < 0)
4325 Res = DAG.getNode(ISD::FDIV, DL, LHS.getValueType(),
4326 DAG.getConstantFP(1.0, LHS.getValueType()), Res);
4331 // Otherwise, expand to a libcall.
4332 return DAG.getNode(ISD::FPOWI, DL, LHS.getValueType(), LHS, RHS);
4335 // getTruncatedArgReg - Find underlying register used for an truncated
4337 static unsigned getTruncatedArgReg(const SDValue &N) {
4338 if (N.getOpcode() != ISD::TRUNCATE)
4341 const SDValue &Ext = N.getOperand(0);
4342 if (Ext.getOpcode() == ISD::AssertZext || Ext.getOpcode() == ISD::AssertSext){
4343 const SDValue &CFR = Ext.getOperand(0);
4344 if (CFR.getOpcode() == ISD::CopyFromReg)
4345 return cast<RegisterSDNode>(CFR.getOperand(1))->getReg();
4346 if (CFR.getOpcode() == ISD::TRUNCATE)
4347 return getTruncatedArgReg(CFR);
4352 /// EmitFuncArgumentDbgValue - If the DbgValueInst is a dbg_value of a function
4353 /// argument, create the corresponding DBG_VALUE machine instruction for it now.
4354 /// At the end of instruction selection, they will be inserted to the entry BB.
4356 SelectionDAGBuilder::EmitFuncArgumentDbgValue(const Value *V, MDNode *Variable,
4359 const Argument *Arg = dyn_cast<Argument>(V);
4363 MachineFunction &MF = DAG.getMachineFunction();
4364 const TargetInstrInfo *TII = DAG.getTarget().getInstrInfo();
4365 const TargetRegisterInfo *TRI = DAG.getTarget().getRegisterInfo();
4367 // Ignore inlined function arguments here.
4368 DIVariable DV(Variable);
4369 if (DV.isInlinedFnArgument(MF.getFunction()))
4373 // Some arguments' frame index is recorded during argument lowering.
4374 Offset = FuncInfo.getArgumentFrameIndex(Arg);
4376 Reg = TRI->getFrameRegister(MF);
4378 if (!Reg && N.getNode()) {
4379 if (N.getOpcode() == ISD::CopyFromReg)
4380 Reg = cast<RegisterSDNode>(N.getOperand(1))->getReg();
4382 Reg = getTruncatedArgReg(N);
4383 if (Reg && TargetRegisterInfo::isVirtualRegister(Reg)) {
4384 MachineRegisterInfo &RegInfo = MF.getRegInfo();
4385 unsigned PR = RegInfo.getLiveInPhysReg(Reg);
4392 // Check if ValueMap has reg number.
4393 DenseMap<const Value *, unsigned>::iterator VMI = FuncInfo.ValueMap.find(V);
4394 if (VMI != FuncInfo.ValueMap.end())
4398 if (!Reg && N.getNode()) {
4399 // Check if frame index is available.
4400 if (LoadSDNode *LNode = dyn_cast<LoadSDNode>(N.getNode()))
4401 if (FrameIndexSDNode *FINode =
4402 dyn_cast<FrameIndexSDNode>(LNode->getBasePtr().getNode())) {
4403 Reg = TRI->getFrameRegister(MF);
4404 Offset = FINode->getIndex();
4411 MachineInstrBuilder MIB = BuildMI(MF, getCurDebugLoc(),
4412 TII->get(TargetOpcode::DBG_VALUE))
4413 .addReg(Reg, RegState::Debug).addImm(Offset).addMetadata(Variable);
4414 FuncInfo.ArgDbgValues.push_back(&*MIB);
4418 // VisualStudio defines setjmp as _setjmp
4419 #if defined(_MSC_VER) && defined(setjmp) && \
4420 !defined(setjmp_undefined_for_msvc)
4421 # pragma push_macro("setjmp")
4423 # define setjmp_undefined_for_msvc
4426 /// visitIntrinsicCall - Lower the call to the specified intrinsic function. If
4427 /// we want to emit this as a call to a named external function, return the name
4428 /// otherwise lower it and return null.
4430 SelectionDAGBuilder::visitIntrinsicCall(const CallInst &I, unsigned Intrinsic) {
4431 DebugLoc dl = getCurDebugLoc();
4434 switch (Intrinsic) {
4436 // By default, turn this into a target intrinsic node.
4437 visitTargetIntrinsic(I, Intrinsic);
4439 case Intrinsic::vastart: visitVAStart(I); return 0;
4440 case Intrinsic::vaend: visitVAEnd(I); return 0;
4441 case Intrinsic::vacopy: visitVACopy(I); return 0;
4442 case Intrinsic::returnaddress:
4443 setValue(&I, DAG.getNode(ISD::RETURNADDR, dl, TLI.getPointerTy(),
4444 getValue(I.getArgOperand(0))));
4446 case Intrinsic::frameaddress:
4447 setValue(&I, DAG.getNode(ISD::FRAMEADDR, dl, TLI.getPointerTy(),
4448 getValue(I.getArgOperand(0))));
4450 case Intrinsic::setjmp:
4451 return &"_setjmp"[!TLI.usesUnderscoreSetJmp()];
4452 case Intrinsic::longjmp:
4453 return &"_longjmp"[!TLI.usesUnderscoreLongJmp()];
4454 case Intrinsic::memcpy: {
4455 // Assert for address < 256 since we support only user defined address
4457 assert(cast<PointerType>(I.getArgOperand(0)->getType())->getAddressSpace()
4459 cast<PointerType>(I.getArgOperand(1)->getType())->getAddressSpace()
4461 "Unknown address space");
4462 SDValue Op1 = getValue(I.getArgOperand(0));
4463 SDValue Op2 = getValue(I.getArgOperand(1));
4464 SDValue Op3 = getValue(I.getArgOperand(2));
4465 unsigned Align = cast<ConstantInt>(I.getArgOperand(3))->getZExtValue();
4466 bool isVol = cast<ConstantInt>(I.getArgOperand(4))->getZExtValue();
4467 DAG.setRoot(DAG.getMemcpy(getRoot(), dl, Op1, Op2, Op3, Align, isVol, false,
4468 MachinePointerInfo(I.getArgOperand(0)),
4469 MachinePointerInfo(I.getArgOperand(1))));
4472 case Intrinsic::memset: {
4473 // Assert for address < 256 since we support only user defined address
4475 assert(cast<PointerType>(I.getArgOperand(0)->getType())->getAddressSpace()
4477 "Unknown address space");
4478 SDValue Op1 = getValue(I.getArgOperand(0));
4479 SDValue Op2 = getValue(I.getArgOperand(1));
4480 SDValue Op3 = getValue(I.getArgOperand(2));
4481 unsigned Align = cast<ConstantInt>(I.getArgOperand(3))->getZExtValue();
4482 bool isVol = cast<ConstantInt>(I.getArgOperand(4))->getZExtValue();
4483 DAG.setRoot(DAG.getMemset(getRoot(), dl, Op1, Op2, Op3, Align, isVol,
4484 MachinePointerInfo(I.getArgOperand(0))));
4487 case Intrinsic::memmove: {
4488 // Assert for address < 256 since we support only user defined address
4490 assert(cast<PointerType>(I.getArgOperand(0)->getType())->getAddressSpace()
4492 cast<PointerType>(I.getArgOperand(1)->getType())->getAddressSpace()
4494 "Unknown address space");
4495 SDValue Op1 = getValue(I.getArgOperand(0));
4496 SDValue Op2 = getValue(I.getArgOperand(1));
4497 SDValue Op3 = getValue(I.getArgOperand(2));
4498 unsigned Align = cast<ConstantInt>(I.getArgOperand(3))->getZExtValue();
4499 bool isVol = cast<ConstantInt>(I.getArgOperand(4))->getZExtValue();
4500 DAG.setRoot(DAG.getMemmove(getRoot(), dl, Op1, Op2, Op3, Align, isVol,
4501 MachinePointerInfo(I.getArgOperand(0)),
4502 MachinePointerInfo(I.getArgOperand(1))));
4505 case Intrinsic::dbg_declare: {
4506 const DbgDeclareInst &DI = cast<DbgDeclareInst>(I);
4507 MDNode *Variable = DI.getVariable();
4508 const Value *Address = DI.getAddress();
4509 if (!Address || !DIVariable(Variable).Verify()) {
4510 DEBUG(dbgs() << "Dropping debug info for " << DI << "\n");
4514 // Build an entry in DbgOrdering. Debug info input nodes get an SDNodeOrder
4515 // but do not always have a corresponding SDNode built. The SDNodeOrder
4516 // absolute, but not relative, values are different depending on whether
4517 // debug info exists.
4520 // Check if address has undef value.
4521 if (isa<UndefValue>(Address) ||
4522 (Address->use_empty() && !isa<Argument>(Address))) {
4523 DEBUG(dbgs() << "Dropping debug info for " << DI << "\n");
4527 SDValue &N = NodeMap[Address];
4528 if (!N.getNode() && isa<Argument>(Address))
4529 // Check unused arguments map.
4530 N = UnusedArgNodeMap[Address];
4533 if (const BitCastInst *BCI = dyn_cast<BitCastInst>(Address))
4534 Address = BCI->getOperand(0);
4535 // Parameters are handled specially.
4537 (DIVariable(Variable).getTag() == dwarf::DW_TAG_arg_variable ||
4538 isa<Argument>(Address));
4540 const AllocaInst *AI = dyn_cast<AllocaInst>(Address);
4542 if (isParameter && !AI) {
4543 FrameIndexSDNode *FINode = dyn_cast<FrameIndexSDNode>(N.getNode());
4545 // Byval parameter. We have a frame index at this point.
4546 SDV = DAG.getDbgValue(Variable, FINode->getIndex(),
4547 0, dl, SDNodeOrder);
4549 // Address is an argument, so try to emit its dbg value using
4550 // virtual register info from the FuncInfo.ValueMap.
4551 EmitFuncArgumentDbgValue(Address, Variable, 0, N);
4555 SDV = DAG.getDbgValue(Variable, N.getNode(), N.getResNo(),
4556 0, dl, SDNodeOrder);
4558 // Can't do anything with other non-AI cases yet.
4559 DEBUG(dbgs() << "Dropping debug info for " << DI << "\n");
4560 DEBUG(dbgs() << "non-AllocaInst issue for Address: \n\t");
4561 DEBUG(Address->dump());
4564 DAG.AddDbgValue(SDV, N.getNode(), isParameter);
4566 // If Address is an argument then try to emit its dbg value using
4567 // virtual register info from the FuncInfo.ValueMap.
4568 if (!EmitFuncArgumentDbgValue(Address, Variable, 0, N)) {
4569 // If variable is pinned by a alloca in dominating bb then
4570 // use StaticAllocaMap.
4571 if (const AllocaInst *AI = dyn_cast<AllocaInst>(Address)) {
4572 if (AI->getParent() != DI.getParent()) {
4573 DenseMap<const AllocaInst*, int>::iterator SI =
4574 FuncInfo.StaticAllocaMap.find(AI);
4575 if (SI != FuncInfo.StaticAllocaMap.end()) {
4576 SDV = DAG.getDbgValue(Variable, SI->second,
4577 0, dl, SDNodeOrder);
4578 DAG.AddDbgValue(SDV, 0, false);
4583 DEBUG(dbgs() << "Dropping debug info for " << DI << "\n");
4588 case Intrinsic::dbg_value: {
4589 const DbgValueInst &DI = cast<DbgValueInst>(I);
4590 if (!DIVariable(DI.getVariable()).Verify())
4593 MDNode *Variable = DI.getVariable();
4594 uint64_t Offset = DI.getOffset();
4595 const Value *V = DI.getValue();
4599 // Build an entry in DbgOrdering. Debug info input nodes get an SDNodeOrder
4600 // but do not always have a corresponding SDNode built. The SDNodeOrder
4601 // absolute, but not relative, values are different depending on whether
4602 // debug info exists.
4605 if (isa<ConstantInt>(V) || isa<ConstantFP>(V) || isa<UndefValue>(V)) {
4606 SDV = DAG.getDbgValue(Variable, V, Offset, dl, SDNodeOrder);
4607 DAG.AddDbgValue(SDV, 0, false);
4609 // Do not use getValue() in here; we don't want to generate code at
4610 // this point if it hasn't been done yet.
4611 SDValue N = NodeMap[V];
4612 if (!N.getNode() && isa<Argument>(V))
4613 // Check unused arguments map.
4614 N = UnusedArgNodeMap[V];
4616 if (!EmitFuncArgumentDbgValue(V, Variable, Offset, N)) {
4617 SDV = DAG.getDbgValue(Variable, N.getNode(),
4618 N.getResNo(), Offset, dl, SDNodeOrder);
4619 DAG.AddDbgValue(SDV, N.getNode(), false);
4621 } else if (!V->use_empty() ) {
4622 // Do not call getValue(V) yet, as we don't want to generate code.
4623 // Remember it for later.
4624 DanglingDebugInfo DDI(&DI, dl, SDNodeOrder);
4625 DanglingDebugInfoMap[V] = DDI;
4627 // We may expand this to cover more cases. One case where we have no
4628 // data available is an unreferenced parameter.
4629 DEBUG(dbgs() << "Dropping debug info for " << DI << "\n");
4633 // Build a debug info table entry.
4634 if (const BitCastInst *BCI = dyn_cast<BitCastInst>(V))
4635 V = BCI->getOperand(0);
4636 const AllocaInst *AI = dyn_cast<AllocaInst>(V);
4637 // Don't handle byval struct arguments or VLAs, for example.
4639 DEBUG(dbgs() << "Dropping debug location info for:\n " << DI << "\n");
4640 DEBUG(dbgs() << " Last seen at:\n " << *V << "\n");
4643 DenseMap<const AllocaInst*, int>::iterator SI =
4644 FuncInfo.StaticAllocaMap.find(AI);
4645 if (SI == FuncInfo.StaticAllocaMap.end())
4647 int FI = SI->second;
4649 MachineModuleInfo &MMI = DAG.getMachineFunction().getMMI();
4650 if (!DI.getDebugLoc().isUnknown() && MMI.hasDebugInfo())
4651 MMI.setVariableDbgInfo(Variable, FI, DI.getDebugLoc());
4655 case Intrinsic::eh_typeid_for: {
4656 // Find the type id for the given typeinfo.
4657 GlobalVariable *GV = ExtractTypeInfo(I.getArgOperand(0));
4658 unsigned TypeID = DAG.getMachineFunction().getMMI().getTypeIDFor(GV);
4659 Res = DAG.getConstant(TypeID, MVT::i32);
4664 case Intrinsic::eh_return_i32:
4665 case Intrinsic::eh_return_i64:
4666 DAG.getMachineFunction().getMMI().setCallsEHReturn(true);
4667 DAG.setRoot(DAG.getNode(ISD::EH_RETURN, dl,
4670 getValue(I.getArgOperand(0)),
4671 getValue(I.getArgOperand(1))));
4673 case Intrinsic::eh_unwind_init:
4674 DAG.getMachineFunction().getMMI().setCallsUnwindInit(true);
4676 case Intrinsic::eh_dwarf_cfa: {
4677 SDValue CfaArg = DAG.getSExtOrTrunc(getValue(I.getArgOperand(0)), dl,
4678 TLI.getPointerTy());
4679 SDValue Offset = DAG.getNode(ISD::ADD, dl,
4681 DAG.getNode(ISD::FRAME_TO_ARGS_OFFSET, dl,
4682 TLI.getPointerTy()),
4684 SDValue FA = DAG.getNode(ISD::FRAMEADDR, dl,
4686 DAG.getConstant(0, TLI.getPointerTy()));
4687 setValue(&I, DAG.getNode(ISD::ADD, dl, TLI.getPointerTy(),
4691 case Intrinsic::eh_sjlj_callsite: {
4692 MachineModuleInfo &MMI = DAG.getMachineFunction().getMMI();
4693 ConstantInt *CI = dyn_cast<ConstantInt>(I.getArgOperand(0));
4694 assert(CI && "Non-constant call site value in eh.sjlj.callsite!");
4695 assert(MMI.getCurrentCallSite() == 0 && "Overlapping call sites!");
4697 MMI.setCurrentCallSite(CI->getZExtValue());
4700 case Intrinsic::eh_sjlj_functioncontext: {
4701 // Get and store the index of the function context.
4702 MachineFrameInfo *MFI = DAG.getMachineFunction().getFrameInfo();
4704 cast<AllocaInst>(I.getArgOperand(0)->stripPointerCasts());
4705 int FI = FuncInfo.StaticAllocaMap[FnCtx];
4706 MFI->setFunctionContextIndex(FI);
4709 case Intrinsic::eh_sjlj_setjmp: {
4712 Ops[1] = getValue(I.getArgOperand(0));
4713 SDValue Op = DAG.getNode(ISD::EH_SJLJ_SETJMP, dl,
4714 DAG.getVTList(MVT::i32, MVT::Other),
4716 setValue(&I, Op.getValue(0));
4717 DAG.setRoot(Op.getValue(1));
4720 case Intrinsic::eh_sjlj_longjmp: {
4721 DAG.setRoot(DAG.getNode(ISD::EH_SJLJ_LONGJMP, dl, MVT::Other,
4722 getRoot(), getValue(I.getArgOperand(0))));
4726 case Intrinsic::x86_mmx_pslli_w:
4727 case Intrinsic::x86_mmx_pslli_d:
4728 case Intrinsic::x86_mmx_pslli_q:
4729 case Intrinsic::x86_mmx_psrli_w:
4730 case Intrinsic::x86_mmx_psrli_d:
4731 case Intrinsic::x86_mmx_psrli_q:
4732 case Intrinsic::x86_mmx_psrai_w:
4733 case Intrinsic::x86_mmx_psrai_d: {
4734 SDValue ShAmt = getValue(I.getArgOperand(1));
4735 if (isa<ConstantSDNode>(ShAmt)) {
4736 visitTargetIntrinsic(I, Intrinsic);
4739 unsigned NewIntrinsic = 0;
4740 EVT ShAmtVT = MVT::v2i32;
4741 switch (Intrinsic) {
4742 case Intrinsic::x86_mmx_pslli_w:
4743 NewIntrinsic = Intrinsic::x86_mmx_psll_w;
4745 case Intrinsic::x86_mmx_pslli_d:
4746 NewIntrinsic = Intrinsic::x86_mmx_psll_d;
4748 case Intrinsic::x86_mmx_pslli_q:
4749 NewIntrinsic = Intrinsic::x86_mmx_psll_q;
4751 case Intrinsic::x86_mmx_psrli_w:
4752 NewIntrinsic = Intrinsic::x86_mmx_psrl_w;
4754 case Intrinsic::x86_mmx_psrli_d:
4755 NewIntrinsic = Intrinsic::x86_mmx_psrl_d;
4757 case Intrinsic::x86_mmx_psrli_q:
4758 NewIntrinsic = Intrinsic::x86_mmx_psrl_q;
4760 case Intrinsic::x86_mmx_psrai_w:
4761 NewIntrinsic = Intrinsic::x86_mmx_psra_w;
4763 case Intrinsic::x86_mmx_psrai_d:
4764 NewIntrinsic = Intrinsic::x86_mmx_psra_d;
4766 default: llvm_unreachable("Impossible intrinsic"); // Can't reach here.
4769 // The vector shift intrinsics with scalars uses 32b shift amounts but
4770 // the sse2/mmx shift instructions reads 64 bits. Set the upper 32 bits
4772 // We must do this early because v2i32 is not a legal type.
4775 ShOps[1] = DAG.getConstant(0, MVT::i32);
4776 ShAmt = DAG.getNode(ISD::BUILD_VECTOR, dl, ShAmtVT, &ShOps[0], 2);
4777 EVT DestVT = TLI.getValueType(I.getType());
4778 ShAmt = DAG.getNode(ISD::BITCAST, dl, DestVT, ShAmt);
4779 Res = DAG.getNode(ISD::INTRINSIC_WO_CHAIN, dl, DestVT,
4780 DAG.getConstant(NewIntrinsic, MVT::i32),
4781 getValue(I.getArgOperand(0)), ShAmt);
4785 case Intrinsic::x86_avx_vinsertf128_pd_256:
4786 case Intrinsic::x86_avx_vinsertf128_ps_256:
4787 case Intrinsic::x86_avx_vinsertf128_si_256:
4788 case Intrinsic::x86_avx2_vinserti128: {
4789 EVT DestVT = TLI.getValueType(I.getType());
4790 EVT ElVT = TLI.getValueType(I.getArgOperand(1)->getType());
4791 uint64_t Idx = (cast<ConstantInt>(I.getArgOperand(2))->getZExtValue() & 1) *
4792 ElVT.getVectorNumElements();
4793 Res = DAG.getNode(ISD::INSERT_SUBVECTOR, dl, DestVT,
4794 getValue(I.getArgOperand(0)),
4795 getValue(I.getArgOperand(1)),
4796 DAG.getIntPtrConstant(Idx));
4800 case Intrinsic::x86_avx_vextractf128_pd_256:
4801 case Intrinsic::x86_avx_vextractf128_ps_256:
4802 case Intrinsic::x86_avx_vextractf128_si_256:
4803 case Intrinsic::x86_avx2_vextracti128: {
4804 EVT DestVT = TLI.getValueType(I.getType());
4805 uint64_t Idx = (cast<ConstantInt>(I.getArgOperand(1))->getZExtValue() & 1) *
4806 DestVT.getVectorNumElements();
4807 Res = DAG.getNode(ISD::EXTRACT_SUBVECTOR, dl, DestVT,
4808 getValue(I.getArgOperand(0)),
4809 DAG.getIntPtrConstant(Idx));
4813 case Intrinsic::convertff:
4814 case Intrinsic::convertfsi:
4815 case Intrinsic::convertfui:
4816 case Intrinsic::convertsif:
4817 case Intrinsic::convertuif:
4818 case Intrinsic::convertss:
4819 case Intrinsic::convertsu:
4820 case Intrinsic::convertus:
4821 case Intrinsic::convertuu: {
4822 ISD::CvtCode Code = ISD::CVT_INVALID;
4823 switch (Intrinsic) {
4824 default: llvm_unreachable("Impossible intrinsic"); // Can't reach here.
4825 case Intrinsic::convertff: Code = ISD::CVT_FF; break;
4826 case Intrinsic::convertfsi: Code = ISD::CVT_FS; break;
4827 case Intrinsic::convertfui: Code = ISD::CVT_FU; break;
4828 case Intrinsic::convertsif: Code = ISD::CVT_SF; break;
4829 case Intrinsic::convertuif: Code = ISD::CVT_UF; break;
4830 case Intrinsic::convertss: Code = ISD::CVT_SS; break;
4831 case Intrinsic::convertsu: Code = ISD::CVT_SU; break;
4832 case Intrinsic::convertus: Code = ISD::CVT_US; break;
4833 case Intrinsic::convertuu: Code = ISD::CVT_UU; break;
4835 EVT DestVT = TLI.getValueType(I.getType());
4836 const Value *Op1 = I.getArgOperand(0);
4837 Res = DAG.getConvertRndSat(DestVT, dl, getValue(Op1),
4838 DAG.getValueType(DestVT),
4839 DAG.getValueType(getValue(Op1).getValueType()),
4840 getValue(I.getArgOperand(1)),
4841 getValue(I.getArgOperand(2)),
4846 case Intrinsic::powi:
4847 setValue(&I, ExpandPowI(dl, getValue(I.getArgOperand(0)),
4848 getValue(I.getArgOperand(1)), DAG));
4850 case Intrinsic::log:
4851 setValue(&I, expandLog(dl, getValue(I.getArgOperand(0)), DAG, TLI));
4853 case Intrinsic::log2:
4854 setValue(&I, expandLog2(dl, getValue(I.getArgOperand(0)), DAG, TLI));
4856 case Intrinsic::log10:
4857 setValue(&I, expandLog10(dl, getValue(I.getArgOperand(0)), DAG, TLI));
4859 case Intrinsic::exp:
4860 setValue(&I, expandExp(dl, getValue(I.getArgOperand(0)), DAG, TLI));
4862 case Intrinsic::exp2:
4863 setValue(&I, expandExp2(dl, getValue(I.getArgOperand(0)), DAG, TLI));
4865 case Intrinsic::pow:
4866 setValue(&I, expandPow(dl, getValue(I.getArgOperand(0)),
4867 getValue(I.getArgOperand(1)), DAG, TLI));
4869 case Intrinsic::sqrt:
4870 case Intrinsic::fabs:
4871 case Intrinsic::sin:
4872 case Intrinsic::cos:
4873 case Intrinsic::floor:
4874 case Intrinsic::ceil:
4875 case Intrinsic::trunc:
4876 case Intrinsic::rint:
4877 case Intrinsic::nearbyint: {
4879 switch (Intrinsic) {
4880 default: llvm_unreachable("Impossible intrinsic"); // Can't reach here.
4881 case Intrinsic::sqrt: Opcode = ISD::FSQRT; break;
4882 case Intrinsic::fabs: Opcode = ISD::FABS; break;
4883 case Intrinsic::sin: Opcode = ISD::FSIN; break;
4884 case Intrinsic::cos: Opcode = ISD::FCOS; break;
4885 case Intrinsic::floor: Opcode = ISD::FFLOOR; break;
4886 case Intrinsic::ceil: Opcode = ISD::FCEIL; break;
4887 case Intrinsic::trunc: Opcode = ISD::FTRUNC; break;
4888 case Intrinsic::rint: Opcode = ISD::FRINT; break;
4889 case Intrinsic::nearbyint: Opcode = ISD::FNEARBYINT; break;
4892 setValue(&I, DAG.getNode(Opcode, dl,
4893 getValue(I.getArgOperand(0)).getValueType(),
4894 getValue(I.getArgOperand(0))));
4897 case Intrinsic::fma:
4898 setValue(&I, DAG.getNode(ISD::FMA, dl,
4899 getValue(I.getArgOperand(0)).getValueType(),
4900 getValue(I.getArgOperand(0)),
4901 getValue(I.getArgOperand(1)),
4902 getValue(I.getArgOperand(2))));
4904 case Intrinsic::fmuladd: {
4905 EVT VT = TLI.getValueType(I.getType());
4906 if (TM.Options.AllowFPOpFusion != FPOpFusion::Strict &&
4907 TLI.isOperationLegalOrCustom(ISD::FMA, VT) &&
4908 TLI.isFMAFasterThanMulAndAdd(VT)){
4909 setValue(&I, DAG.getNode(ISD::FMA, dl,
4910 getValue(I.getArgOperand(0)).getValueType(),
4911 getValue(I.getArgOperand(0)),
4912 getValue(I.getArgOperand(1)),
4913 getValue(I.getArgOperand(2))));
4915 SDValue Mul = DAG.getNode(ISD::FMUL, dl,
4916 getValue(I.getArgOperand(0)).getValueType(),
4917 getValue(I.getArgOperand(0)),
4918 getValue(I.getArgOperand(1)));
4919 SDValue Add = DAG.getNode(ISD::FADD, dl,
4920 getValue(I.getArgOperand(0)).getValueType(),
4922 getValue(I.getArgOperand(2)));
4927 case Intrinsic::convert_to_fp16:
4928 setValue(&I, DAG.getNode(ISD::FP32_TO_FP16, dl,
4929 MVT::i16, getValue(I.getArgOperand(0))));
4931 case Intrinsic::convert_from_fp16:
4932 setValue(&I, DAG.getNode(ISD::FP16_TO_FP32, dl,
4933 MVT::f32, getValue(I.getArgOperand(0))));
4935 case Intrinsic::pcmarker: {
4936 SDValue Tmp = getValue(I.getArgOperand(0));
4937 DAG.setRoot(DAG.getNode(ISD::PCMARKER, dl, MVT::Other, getRoot(), Tmp));
4940 case Intrinsic::readcyclecounter: {
4941 SDValue Op = getRoot();
4942 Res = DAG.getNode(ISD::READCYCLECOUNTER, dl,
4943 DAG.getVTList(MVT::i64, MVT::Other),
4946 DAG.setRoot(Res.getValue(1));
4949 case Intrinsic::bswap:
4950 setValue(&I, DAG.getNode(ISD::BSWAP, dl,
4951 getValue(I.getArgOperand(0)).getValueType(),
4952 getValue(I.getArgOperand(0))));
4954 case Intrinsic::cttz: {
4955 SDValue Arg = getValue(I.getArgOperand(0));
4956 ConstantInt *CI = cast<ConstantInt>(I.getArgOperand(1));
4957 EVT Ty = Arg.getValueType();
4958 setValue(&I, DAG.getNode(CI->isZero() ? ISD::CTTZ : ISD::CTTZ_ZERO_UNDEF,
4962 case Intrinsic::ctlz: {
4963 SDValue Arg = getValue(I.getArgOperand(0));
4964 ConstantInt *CI = cast<ConstantInt>(I.getArgOperand(1));
4965 EVT Ty = Arg.getValueType();
4966 setValue(&I, DAG.getNode(CI->isZero() ? ISD::CTLZ : ISD::CTLZ_ZERO_UNDEF,
4970 case Intrinsic::ctpop: {
4971 SDValue Arg = getValue(I.getArgOperand(0));
4972 EVT Ty = Arg.getValueType();
4973 setValue(&I, DAG.getNode(ISD::CTPOP, dl, Ty, Arg));
4976 case Intrinsic::stacksave: {
4977 SDValue Op = getRoot();
4978 Res = DAG.getNode(ISD::STACKSAVE, dl,
4979 DAG.getVTList(TLI.getPointerTy(), MVT::Other), &Op, 1);
4981 DAG.setRoot(Res.getValue(1));
4984 case Intrinsic::stackrestore: {
4985 Res = getValue(I.getArgOperand(0));
4986 DAG.setRoot(DAG.getNode(ISD::STACKRESTORE, dl, MVT::Other, getRoot(), Res));
4989 case Intrinsic::stackprotector: {
4990 // Emit code into the DAG to store the stack guard onto the stack.
4991 MachineFunction &MF = DAG.getMachineFunction();
4992 MachineFrameInfo *MFI = MF.getFrameInfo();
4993 EVT PtrTy = TLI.getPointerTy();
4995 SDValue Src = getValue(I.getArgOperand(0)); // The guard's value.
4996 AllocaInst *Slot = cast<AllocaInst>(I.getArgOperand(1));
4998 int FI = FuncInfo.StaticAllocaMap[Slot];
4999 MFI->setStackProtectorIndex(FI);
5001 SDValue FIN = DAG.getFrameIndex(FI, PtrTy);
5003 // Store the stack protector onto the stack.
5004 Res = DAG.getStore(getRoot(), dl, Src, FIN,
5005 MachinePointerInfo::getFixedStack(FI),
5011 case Intrinsic::objectsize: {
5012 // If we don't know by now, we're never going to know.
5013 ConstantInt *CI = dyn_cast<ConstantInt>(I.getArgOperand(1));
5015 assert(CI && "Non-constant type in __builtin_object_size?");
5017 SDValue Arg = getValue(I.getCalledValue());
5018 EVT Ty = Arg.getValueType();
5021 Res = DAG.getConstant(-1ULL, Ty);
5023 Res = DAG.getConstant(0, Ty);
5028 case Intrinsic::var_annotation:
5029 // Discard annotate attributes
5032 case Intrinsic::init_trampoline: {
5033 const Function *F = cast<Function>(I.getArgOperand(1)->stripPointerCasts());
5037 Ops[1] = getValue(I.getArgOperand(0));
5038 Ops[2] = getValue(I.getArgOperand(1));
5039 Ops[3] = getValue(I.getArgOperand(2));
5040 Ops[4] = DAG.getSrcValue(I.getArgOperand(0));
5041 Ops[5] = DAG.getSrcValue(F);
5043 Res = DAG.getNode(ISD::INIT_TRAMPOLINE, dl, MVT::Other, Ops, 6);
5048 case Intrinsic::adjust_trampoline: {
5049 setValue(&I, DAG.getNode(ISD::ADJUST_TRAMPOLINE, dl,
5051 getValue(I.getArgOperand(0))));
5054 case Intrinsic::gcroot:
5056 const Value *Alloca = I.getArgOperand(0)->stripPointerCasts();
5057 const Constant *TypeMap = cast<Constant>(I.getArgOperand(1));
5059 FrameIndexSDNode *FI = cast<FrameIndexSDNode>(getValue(Alloca).getNode());
5060 GFI->addStackRoot(FI->getIndex(), TypeMap);
5063 case Intrinsic::gcread:
5064 case Intrinsic::gcwrite:
5065 llvm_unreachable("GC failed to lower gcread/gcwrite intrinsics!");
5066 case Intrinsic::flt_rounds:
5067 setValue(&I, DAG.getNode(ISD::FLT_ROUNDS_, dl, MVT::i32));
5070 case Intrinsic::expect: {
5071 // Just replace __builtin_expect(exp, c) with EXP.
5072 setValue(&I, getValue(I.getArgOperand(0)));
5076 case Intrinsic::debugtrap:
5077 case Intrinsic::trap: {
5078 StringRef TrapFuncName = TM.Options.getTrapFunctionName();
5079 if (TrapFuncName.empty()) {
5080 ISD::NodeType Op = (Intrinsic == Intrinsic::trap) ?
5081 ISD::TRAP : ISD::DEBUGTRAP;
5082 DAG.setRoot(DAG.getNode(Op, dl,MVT::Other, getRoot()));
5085 TargetLowering::ArgListTy Args;
5087 CallLoweringInfo CLI(getRoot(), I.getType(),
5088 false, false, false, false, 0, CallingConv::C,
5089 /*isTailCall=*/false,
5090 /*doesNotRet=*/false, /*isReturnValueUsed=*/true,
5091 DAG.getExternalSymbol(TrapFuncName.data(), TLI.getPointerTy()),
5093 std::pair<SDValue, SDValue> Result = TLI.LowerCallTo(CLI);
5094 DAG.setRoot(Result.second);
5098 case Intrinsic::uadd_with_overflow:
5099 case Intrinsic::sadd_with_overflow:
5100 case Intrinsic::usub_with_overflow:
5101 case Intrinsic::ssub_with_overflow:
5102 case Intrinsic::umul_with_overflow:
5103 case Intrinsic::smul_with_overflow: {
5105 switch (Intrinsic) {
5106 default: llvm_unreachable("Impossible intrinsic"); // Can't reach here.
5107 case Intrinsic::uadd_with_overflow: Op = ISD::UADDO; break;
5108 case Intrinsic::sadd_with_overflow: Op = ISD::SADDO; break;
5109 case Intrinsic::usub_with_overflow: Op = ISD::USUBO; break;
5110 case Intrinsic::ssub_with_overflow: Op = ISD::SSUBO; break;
5111 case Intrinsic::umul_with_overflow: Op = ISD::UMULO; break;
5112 case Intrinsic::smul_with_overflow: Op = ISD::SMULO; break;
5114 SDValue Op1 = getValue(I.getArgOperand(0));
5115 SDValue Op2 = getValue(I.getArgOperand(1));
5117 SDVTList VTs = DAG.getVTList(Op1.getValueType(), MVT::i1);
5118 setValue(&I, DAG.getNode(Op, dl, VTs, Op1, Op2));
5121 case Intrinsic::prefetch: {
5123 unsigned rw = cast<ConstantInt>(I.getArgOperand(1))->getZExtValue();
5125 Ops[1] = getValue(I.getArgOperand(0));
5126 Ops[2] = getValue(I.getArgOperand(1));
5127 Ops[3] = getValue(I.getArgOperand(2));
5128 Ops[4] = getValue(I.getArgOperand(3));
5129 DAG.setRoot(DAG.getMemIntrinsicNode(ISD::PREFETCH, dl,
5130 DAG.getVTList(MVT::Other),
5132 EVT::getIntegerVT(*Context, 8),
5133 MachinePointerInfo(I.getArgOperand(0)),
5135 false, /* volatile */
5137 rw==1)); /* write */
5140 case Intrinsic::lifetime_start:
5141 case Intrinsic::lifetime_end: {
5142 bool IsStart = (Intrinsic == Intrinsic::lifetime_start);
5143 // Stack coloring is not enabled in O0, discard region information.
5144 if (TM.getOptLevel() == CodeGenOpt::None)
5147 SmallVector<Value *, 4> Allocas;
5148 GetUnderlyingObjects(I.getArgOperand(1), Allocas, TD);
5150 for (SmallVector<Value*, 4>::iterator Object = Allocas.begin(),
5151 E = Allocas.end(); Object != E; ++Object) {
5152 AllocaInst *LifetimeObject = dyn_cast_or_null<AllocaInst>(*Object);
5154 // Could not find an Alloca.
5155 if (!LifetimeObject)
5158 int FI = FuncInfo.StaticAllocaMap[LifetimeObject];
5162 Ops[1] = DAG.getFrameIndex(FI, TLI.getPointerTy(), true);
5163 unsigned Opcode = (IsStart ? ISD::LIFETIME_START : ISD::LIFETIME_END);
5165 Res = DAG.getNode(Opcode, dl, MVT::Other, Ops, 2);
5169 case Intrinsic::invariant_start:
5170 // Discard region information.
5171 setValue(&I, DAG.getUNDEF(TLI.getPointerTy()));
5173 case Intrinsic::invariant_end:
5174 // Discard region information.
5176 case Intrinsic::donothing:
5182 void SelectionDAGBuilder::LowerCallTo(ImmutableCallSite CS, SDValue Callee,
5184 MachineBasicBlock *LandingPad) {
5185 PointerType *PT = cast<PointerType>(CS.getCalledValue()->getType());
5186 FunctionType *FTy = cast<FunctionType>(PT->getElementType());
5187 Type *RetTy = FTy->getReturnType();
5188 MachineModuleInfo &MMI = DAG.getMachineFunction().getMMI();
5189 MCSymbol *BeginLabel = 0;
5191 TargetLowering::ArgListTy Args;
5192 TargetLowering::ArgListEntry Entry;
5193 Args.reserve(CS.arg_size());
5195 // Check whether the function can return without sret-demotion.
5196 SmallVector<ISD::OutputArg, 4> Outs;
5197 GetReturnInfo(RetTy, CS.getAttributes().getRetAttributes(),
5200 bool CanLowerReturn = TLI.CanLowerReturn(CS.getCallingConv(),
5201 DAG.getMachineFunction(),
5202 FTy->isVarArg(), Outs,
5205 SDValue DemoteStackSlot;
5206 int DemoteStackIdx = -100;
5208 if (!CanLowerReturn) {
5209 uint64_t TySize = TLI.getDataLayout()->getTypeAllocSize(
5210 FTy->getReturnType());
5211 unsigned Align = TLI.getDataLayout()->getPrefTypeAlignment(
5212 FTy->getReturnType());
5213 MachineFunction &MF = DAG.getMachineFunction();
5214 DemoteStackIdx = MF.getFrameInfo()->CreateStackObject(TySize, Align, false);
5215 Type *StackSlotPtrType = PointerType::getUnqual(FTy->getReturnType());
5217 DemoteStackSlot = DAG.getFrameIndex(DemoteStackIdx, TLI.getPointerTy());
5218 Entry.Node = DemoteStackSlot;
5219 Entry.Ty = StackSlotPtrType;
5220 Entry.isSExt = false;
5221 Entry.isZExt = false;
5222 Entry.isInReg = false;
5223 Entry.isSRet = true;
5224 Entry.isNest = false;
5225 Entry.isByVal = false;
5226 Entry.Alignment = Align;
5227 Args.push_back(Entry);
5228 RetTy = Type::getVoidTy(FTy->getContext());
5231 for (ImmutableCallSite::arg_iterator i = CS.arg_begin(), e = CS.arg_end();
5233 const Value *V = *i;
5236 if (V->getType()->isEmptyTy())
5239 SDValue ArgNode = getValue(V);
5240 Entry.Node = ArgNode; Entry.Ty = V->getType();
5242 unsigned attrInd = i - CS.arg_begin() + 1;
5243 Entry.isSExt = CS.paramHasAttr(attrInd, Attribute::SExt);
5244 Entry.isZExt = CS.paramHasAttr(attrInd, Attribute::ZExt);
5245 Entry.isInReg = CS.paramHasAttr(attrInd, Attribute::InReg);
5246 Entry.isSRet = CS.paramHasAttr(attrInd, Attribute::StructRet);
5247 Entry.isNest = CS.paramHasAttr(attrInd, Attribute::Nest);
5248 Entry.isByVal = CS.paramHasAttr(attrInd, Attribute::ByVal);
5249 Entry.Alignment = CS.getParamAlignment(attrInd);
5250 Args.push_back(Entry);
5254 // Insert a label before the invoke call to mark the try range. This can be
5255 // used to detect deletion of the invoke via the MachineModuleInfo.
5256 BeginLabel = MMI.getContext().CreateTempSymbol();
5258 // For SjLj, keep track of which landing pads go with which invokes
5259 // so as to maintain the ordering of pads in the LSDA.
5260 unsigned CallSiteIndex = MMI.getCurrentCallSite();
5261 if (CallSiteIndex) {
5262 MMI.setCallSiteBeginLabel(BeginLabel, CallSiteIndex);
5263 LPadToCallSiteMap[LandingPad].push_back(CallSiteIndex);
5265 // Now that the call site is handled, stop tracking it.
5266 MMI.setCurrentCallSite(0);
5269 // Both PendingLoads and PendingExports must be flushed here;
5270 // this call might not return.
5272 DAG.setRoot(DAG.getEHLabel(getCurDebugLoc(), getControlRoot(), BeginLabel));
5275 // Check if target-independent constraints permit a tail call here.
5276 // Target-dependent constraints are checked within TLI.LowerCallTo.
5278 !isInTailCallPosition(CS, CS.getAttributes().getRetAttributes(), TLI))
5282 CallLoweringInfo CLI(getRoot(), RetTy, FTy, isTailCall, Callee, Args, DAG,
5283 getCurDebugLoc(), CS);
5284 std::pair<SDValue,SDValue> Result = TLI.LowerCallTo(CLI);
5285 assert((isTailCall || Result.second.getNode()) &&
5286 "Non-null chain expected with non-tail call!");
5287 assert((Result.second.getNode() || !Result.first.getNode()) &&
5288 "Null value expected with tail call!");
5289 if (Result.first.getNode()) {
5290 setValue(CS.getInstruction(), Result.first);
5291 } else if (!CanLowerReturn && Result.second.getNode()) {
5292 // The instruction result is the result of loading from the
5293 // hidden sret parameter.
5294 SmallVector<EVT, 1> PVTs;
5295 Type *PtrRetTy = PointerType::getUnqual(FTy->getReturnType());
5297 ComputeValueVTs(TLI, PtrRetTy, PVTs);
5298 assert(PVTs.size() == 1 && "Pointers should fit in one register");
5299 EVT PtrVT = PVTs[0];
5301 SmallVector<EVT, 4> RetTys;
5302 SmallVector<uint64_t, 4> Offsets;
5303 RetTy = FTy->getReturnType();
5304 ComputeValueVTs(TLI, RetTy, RetTys, &Offsets);
5306 unsigned NumValues = RetTys.size();
5307 SmallVector<SDValue, 4> Values(NumValues);
5308 SmallVector<SDValue, 4> Chains(NumValues);
5310 for (unsigned i = 0; i < NumValues; ++i) {
5311 SDValue Add = DAG.getNode(ISD::ADD, getCurDebugLoc(), PtrVT,
5313 DAG.getConstant(Offsets[i], PtrVT));
5314 SDValue L = DAG.getLoad(RetTys[i], getCurDebugLoc(), Result.second, Add,
5315 MachinePointerInfo::getFixedStack(DemoteStackIdx, Offsets[i]),
5316 false, false, false, 1);
5318 Chains[i] = L.getValue(1);
5321 SDValue Chain = DAG.getNode(ISD::TokenFactor, getCurDebugLoc(),
5322 MVT::Other, &Chains[0], NumValues);
5323 PendingLoads.push_back(Chain);
5325 setValue(CS.getInstruction(),
5326 DAG.getNode(ISD::MERGE_VALUES, getCurDebugLoc(),
5327 DAG.getVTList(&RetTys[0], RetTys.size()),
5328 &Values[0], Values.size()));
5331 // Assign order to nodes here. If the call does not produce a result, it won't
5332 // be mapped to a SDNode and visit() will not assign it an order number.
5333 if (!Result.second.getNode()) {
5334 // As a special case, a null chain means that a tail call has been emitted and
5335 // the DAG root is already updated.
5338 AssignOrderingToNode(DAG.getRoot().getNode());
5340 DAG.setRoot(Result.second);
5342 AssignOrderingToNode(Result.second.getNode());
5346 // Insert a label at the end of the invoke call to mark the try range. This
5347 // can be used to detect deletion of the invoke via the MachineModuleInfo.
5348 MCSymbol *EndLabel = MMI.getContext().CreateTempSymbol();
5349 DAG.setRoot(DAG.getEHLabel(getCurDebugLoc(), getRoot(), EndLabel));
5351 // Inform MachineModuleInfo of range.
5352 MMI.addInvoke(LandingPad, BeginLabel, EndLabel);
5356 /// IsOnlyUsedInZeroEqualityComparison - Return true if it only matters that the
5357 /// value is equal or not-equal to zero.
5358 static bool IsOnlyUsedInZeroEqualityComparison(const Value *V) {
5359 for (Value::const_use_iterator UI = V->use_begin(), E = V->use_end();
5361 if (const ICmpInst *IC = dyn_cast<ICmpInst>(*UI))
5362 if (IC->isEquality())
5363 if (const Constant *C = dyn_cast<Constant>(IC->getOperand(1)))
5364 if (C->isNullValue())
5366 // Unknown instruction.
5372 static SDValue getMemCmpLoad(const Value *PtrVal, MVT LoadVT,
5374 SelectionDAGBuilder &Builder) {
5376 // Check to see if this load can be trivially constant folded, e.g. if the
5377 // input is from a string literal.
5378 if (const Constant *LoadInput = dyn_cast<Constant>(PtrVal)) {
5379 // Cast pointer to the type we really want to load.
5380 LoadInput = ConstantExpr::getBitCast(const_cast<Constant *>(LoadInput),
5381 PointerType::getUnqual(LoadTy));
5383 if (const Constant *LoadCst =
5384 ConstantFoldLoadFromConstPtr(const_cast<Constant *>(LoadInput),
5386 return Builder.getValue(LoadCst);
5389 // Otherwise, we have to emit the load. If the pointer is to unfoldable but
5390 // still constant memory, the input chain can be the entry node.
5392 bool ConstantMemory = false;
5394 // Do not serialize (non-volatile) loads of constant memory with anything.
5395 if (Builder.AA->pointsToConstantMemory(PtrVal)) {
5396 Root = Builder.DAG.getEntryNode();
5397 ConstantMemory = true;
5399 // Do not serialize non-volatile loads against each other.
5400 Root = Builder.DAG.getRoot();
5403 SDValue Ptr = Builder.getValue(PtrVal);
5404 SDValue LoadVal = Builder.DAG.getLoad(LoadVT, Builder.getCurDebugLoc(), Root,
5405 Ptr, MachinePointerInfo(PtrVal),
5407 false /*nontemporal*/,
5408 false /*isinvariant*/, 1 /* align=1 */);
5410 if (!ConstantMemory)
5411 Builder.PendingLoads.push_back(LoadVal.getValue(1));
5416 /// visitMemCmpCall - See if we can lower a call to memcmp in an optimized form.
5417 /// If so, return true and lower it, otherwise return false and it will be
5418 /// lowered like a normal call.
5419 bool SelectionDAGBuilder::visitMemCmpCall(const CallInst &I) {
5420 // Verify that the prototype makes sense. int memcmp(void*,void*,size_t)
5421 if (I.getNumArgOperands() != 3)
5424 const Value *LHS = I.getArgOperand(0), *RHS = I.getArgOperand(1);
5425 if (!LHS->getType()->isPointerTy() || !RHS->getType()->isPointerTy() ||
5426 !I.getArgOperand(2)->getType()->isIntegerTy() ||
5427 !I.getType()->isIntegerTy())
5430 const ConstantInt *Size = dyn_cast<ConstantInt>(I.getArgOperand(2));
5432 // memcmp(S1,S2,2) != 0 -> (*(short*)LHS != *(short*)RHS) != 0
5433 // memcmp(S1,S2,4) != 0 -> (*(int*)LHS != *(int*)RHS) != 0
5434 if (Size && IsOnlyUsedInZeroEqualityComparison(&I)) {
5435 bool ActuallyDoIt = true;
5438 switch (Size->getZExtValue()) {
5440 LoadVT = MVT::Other;
5442 ActuallyDoIt = false;
5446 LoadTy = Type::getInt16Ty(Size->getContext());
5450 LoadTy = Type::getInt32Ty(Size->getContext());
5454 LoadTy = Type::getInt64Ty(Size->getContext());
5458 LoadVT = MVT::v4i32;
5459 LoadTy = Type::getInt32Ty(Size->getContext());
5460 LoadTy = VectorType::get(LoadTy, 4);
5465 // This turns into unaligned loads. We only do this if the target natively
5466 // supports the MVT we'll be loading or if it is small enough (<= 4) that
5467 // we'll only produce a small number of byte loads.
5469 // Require that we can find a legal MVT, and only do this if the target
5470 // supports unaligned loads of that type. Expanding into byte loads would
5472 if (ActuallyDoIt && Size->getZExtValue() > 4) {
5473 // TODO: Handle 5 byte compare as 4-byte + 1 byte.
5474 // TODO: Handle 8 byte compare on x86-32 as two 32-bit loads.
5475 if (!TLI.isTypeLegal(LoadVT) ||!TLI.allowsUnalignedMemoryAccesses(LoadVT))
5476 ActuallyDoIt = false;
5480 SDValue LHSVal = getMemCmpLoad(LHS, LoadVT, LoadTy, *this);
5481 SDValue RHSVal = getMemCmpLoad(RHS, LoadVT, LoadTy, *this);
5483 SDValue Res = DAG.getSetCC(getCurDebugLoc(), MVT::i1, LHSVal, RHSVal,
5485 EVT CallVT = TLI.getValueType(I.getType(), true);
5486 setValue(&I, DAG.getZExtOrTrunc(Res, getCurDebugLoc(), CallVT));
5495 /// visitUnaryFloatCall - If a call instruction is a unary floating-point
5496 /// operation (as expected), translate it to an SDNode with the specified opcode
5497 /// and return true.
5498 bool SelectionDAGBuilder::visitUnaryFloatCall(const CallInst &I,
5500 // Sanity check that it really is a unary floating-point call.
5501 if (I.getNumArgOperands() != 1 ||
5502 !I.getArgOperand(0)->getType()->isFloatingPointTy() ||
5503 I.getType() != I.getArgOperand(0)->getType() ||
5504 !I.onlyReadsMemory())
5507 SDValue Tmp = getValue(I.getArgOperand(0));
5508 setValue(&I, DAG.getNode(Opcode, getCurDebugLoc(), Tmp.getValueType(), Tmp));
5512 void SelectionDAGBuilder::visitCall(const CallInst &I) {
5513 // Handle inline assembly differently.
5514 if (isa<InlineAsm>(I.getCalledValue())) {
5519 MachineModuleInfo &MMI = DAG.getMachineFunction().getMMI();
5520 ComputeUsesVAFloatArgument(I, &MMI);
5522 const char *RenameFn = 0;
5523 if (Function *F = I.getCalledFunction()) {
5524 if (F->isDeclaration()) {
5525 if (const TargetIntrinsicInfo *II = TM.getIntrinsicInfo()) {
5526 if (unsigned IID = II->getIntrinsicID(F)) {
5527 RenameFn = visitIntrinsicCall(I, IID);
5532 if (unsigned IID = F->getIntrinsicID()) {
5533 RenameFn = visitIntrinsicCall(I, IID);
5539 // Check for well-known libc/libm calls. If the function is internal, it
5540 // can't be a library call.
5542 if (!F->hasLocalLinkage() && F->hasName() &&
5543 LibInfo->getLibFunc(F->getName(), Func) &&
5544 LibInfo->hasOptimizedCodeGen(Func)) {
5547 case LibFunc::copysign:
5548 case LibFunc::copysignf:
5549 case LibFunc::copysignl:
5550 if (I.getNumArgOperands() == 2 && // Basic sanity checks.
5551 I.getArgOperand(0)->getType()->isFloatingPointTy() &&
5552 I.getType() == I.getArgOperand(0)->getType() &&
5553 I.getType() == I.getArgOperand(1)->getType() &&
5554 I.onlyReadsMemory()) {
5555 SDValue LHS = getValue(I.getArgOperand(0));
5556 SDValue RHS = getValue(I.getArgOperand(1));
5557 setValue(&I, DAG.getNode(ISD::FCOPYSIGN, getCurDebugLoc(),
5558 LHS.getValueType(), LHS, RHS));
5563 case LibFunc::fabsf:
5564 case LibFunc::fabsl:
5565 if (visitUnaryFloatCall(I, ISD::FABS))
5571 if (visitUnaryFloatCall(I, ISD::FSIN))
5577 if (visitUnaryFloatCall(I, ISD::FCOS))
5581 case LibFunc::sqrtf:
5582 case LibFunc::sqrtl:
5583 if (visitUnaryFloatCall(I, ISD::FSQRT))
5586 case LibFunc::floor:
5587 case LibFunc::floorf:
5588 case LibFunc::floorl:
5589 if (visitUnaryFloatCall(I, ISD::FFLOOR))
5592 case LibFunc::nearbyint:
5593 case LibFunc::nearbyintf:
5594 case LibFunc::nearbyintl:
5595 if (visitUnaryFloatCall(I, ISD::FNEARBYINT))
5599 case LibFunc::ceilf:
5600 case LibFunc::ceill:
5601 if (visitUnaryFloatCall(I, ISD::FCEIL))
5605 case LibFunc::rintf:
5606 case LibFunc::rintl:
5607 if (visitUnaryFloatCall(I, ISD::FRINT))
5610 case LibFunc::trunc:
5611 case LibFunc::truncf:
5612 case LibFunc::truncl:
5613 if (visitUnaryFloatCall(I, ISD::FTRUNC))
5617 case LibFunc::log2f:
5618 case LibFunc::log2l:
5619 if (visitUnaryFloatCall(I, ISD::FLOG2))
5623 case LibFunc::exp2f:
5624 case LibFunc::exp2l:
5625 if (visitUnaryFloatCall(I, ISD::FEXP2))
5628 case LibFunc::memcmp:
5629 if (visitMemCmpCall(I))
5638 Callee = getValue(I.getCalledValue());
5640 Callee = DAG.getExternalSymbol(RenameFn, TLI.getPointerTy());
5642 // Check if we can potentially perform a tail call. More detailed checking is
5643 // be done within LowerCallTo, after more information about the call is known.
5644 LowerCallTo(&I, Callee, I.isTailCall());
5649 /// AsmOperandInfo - This contains information for each constraint that we are
5651 class SDISelAsmOperandInfo : public TargetLowering::AsmOperandInfo {
5653 /// CallOperand - If this is the result output operand or a clobber
5654 /// this is null, otherwise it is the incoming operand to the CallInst.
5655 /// This gets modified as the asm is processed.
5656 SDValue CallOperand;
5658 /// AssignedRegs - If this is a register or register class operand, this
5659 /// contains the set of register corresponding to the operand.
5660 RegsForValue AssignedRegs;
5662 explicit SDISelAsmOperandInfo(const TargetLowering::AsmOperandInfo &info)
5663 : TargetLowering::AsmOperandInfo(info), CallOperand(0,0) {
5666 /// getCallOperandValEVT - Return the EVT of the Value* that this operand
5667 /// corresponds to. If there is no Value* for this operand, it returns
5669 EVT getCallOperandValEVT(LLVMContext &Context,
5670 const TargetLowering &TLI,
5671 const DataLayout *TD) const {
5672 if (CallOperandVal == 0) return MVT::Other;
5674 if (isa<BasicBlock>(CallOperandVal))
5675 return TLI.getPointerTy();
5677 llvm::Type *OpTy = CallOperandVal->getType();
5679 // FIXME: code duplicated from TargetLowering::ParseConstraints().
5680 // If this is an indirect operand, the operand is a pointer to the
5683 llvm::PointerType *PtrTy = dyn_cast<PointerType>(OpTy);
5685 report_fatal_error("Indirect operand for inline asm not a pointer!");
5686 OpTy = PtrTy->getElementType();
5689 // Look for vector wrapped in a struct. e.g. { <16 x i8> }.
5690 if (StructType *STy = dyn_cast<StructType>(OpTy))
5691 if (STy->getNumElements() == 1)
5692 OpTy = STy->getElementType(0);
5694 // If OpTy is not a single value, it may be a struct/union that we
5695 // can tile with integers.
5696 if (!OpTy->isSingleValueType() && OpTy->isSized()) {
5697 unsigned BitSize = TD->getTypeSizeInBits(OpTy);
5706 OpTy = IntegerType::get(Context, BitSize);
5711 return TLI.getValueType(OpTy, true);
5715 typedef SmallVector<SDISelAsmOperandInfo,16> SDISelAsmOperandInfoVector;
5717 } // end anonymous namespace
5719 /// GetRegistersForValue - Assign registers (virtual or physical) for the
5720 /// specified operand. We prefer to assign virtual registers, to allow the
5721 /// register allocator to handle the assignment process. However, if the asm
5722 /// uses features that we can't model on machineinstrs, we have SDISel do the
5723 /// allocation. This produces generally horrible, but correct, code.
5725 /// OpInfo describes the operand.
5727 static void GetRegistersForValue(SelectionDAG &DAG,
5728 const TargetLowering &TLI,
5730 SDISelAsmOperandInfo &OpInfo) {
5731 LLVMContext &Context = *DAG.getContext();
5733 MachineFunction &MF = DAG.getMachineFunction();
5734 SmallVector<unsigned, 4> Regs;
5736 // If this is a constraint for a single physreg, or a constraint for a
5737 // register class, find it.
5738 std::pair<unsigned, const TargetRegisterClass*> PhysReg =
5739 TLI.getRegForInlineAsmConstraint(OpInfo.ConstraintCode,
5740 OpInfo.ConstraintVT);
5742 unsigned NumRegs = 1;
5743 if (OpInfo.ConstraintVT != MVT::Other) {
5744 // If this is a FP input in an integer register (or visa versa) insert a bit
5745 // cast of the input value. More generally, handle any case where the input
5746 // value disagrees with the register class we plan to stick this in.
5747 if (OpInfo.Type == InlineAsm::isInput &&
5748 PhysReg.second && !PhysReg.second->hasType(OpInfo.ConstraintVT)) {
5749 // Try to convert to the first EVT that the reg class contains. If the
5750 // types are identical size, use a bitcast to convert (e.g. two differing
5752 MVT RegVT = *PhysReg.second->vt_begin();
5753 if (RegVT.getSizeInBits() == OpInfo.ConstraintVT.getSizeInBits()) {
5754 OpInfo.CallOperand = DAG.getNode(ISD::BITCAST, DL,
5755 RegVT, OpInfo.CallOperand);
5756 OpInfo.ConstraintVT = RegVT;
5757 } else if (RegVT.isInteger() && OpInfo.ConstraintVT.isFloatingPoint()) {
5758 // If the input is a FP value and we want it in FP registers, do a
5759 // bitcast to the corresponding integer type. This turns an f64 value
5760 // into i64, which can be passed with two i32 values on a 32-bit
5762 RegVT = MVT::getIntegerVT(OpInfo.ConstraintVT.getSizeInBits());
5763 OpInfo.CallOperand = DAG.getNode(ISD::BITCAST, DL,
5764 RegVT, OpInfo.CallOperand);
5765 OpInfo.ConstraintVT = RegVT;
5769 NumRegs = TLI.getNumRegisters(Context, OpInfo.ConstraintVT);
5773 EVT ValueVT = OpInfo.ConstraintVT;
5775 // If this is a constraint for a specific physical register, like {r17},
5777 if (unsigned AssignedReg = PhysReg.first) {
5778 const TargetRegisterClass *RC = PhysReg.second;
5779 if (OpInfo.ConstraintVT == MVT::Other)
5780 ValueVT = *RC->vt_begin();
5782 // Get the actual register value type. This is important, because the user
5783 // may have asked for (e.g.) the AX register in i32 type. We need to
5784 // remember that AX is actually i16 to get the right extension.
5785 RegVT = *RC->vt_begin();
5787 // This is a explicit reference to a physical register.
5788 Regs.push_back(AssignedReg);
5790 // If this is an expanded reference, add the rest of the regs to Regs.
5792 TargetRegisterClass::iterator I = RC->begin();
5793 for (; *I != AssignedReg; ++I)
5794 assert(I != RC->end() && "Didn't find reg!");
5796 // Already added the first reg.
5798 for (; NumRegs; --NumRegs, ++I) {
5799 assert(I != RC->end() && "Ran out of registers to allocate!");
5804 OpInfo.AssignedRegs = RegsForValue(Regs, RegVT, ValueVT);
5808 // Otherwise, if this was a reference to an LLVM register class, create vregs
5809 // for this reference.
5810 if (const TargetRegisterClass *RC = PhysReg.second) {
5811 RegVT = *RC->vt_begin();
5812 if (OpInfo.ConstraintVT == MVT::Other)
5815 // Create the appropriate number of virtual registers.
5816 MachineRegisterInfo &RegInfo = MF.getRegInfo();
5817 for (; NumRegs; --NumRegs)
5818 Regs.push_back(RegInfo.createVirtualRegister(RC));
5820 OpInfo.AssignedRegs = RegsForValue(Regs, RegVT, ValueVT);
5824 // Otherwise, we couldn't allocate enough registers for this.
5827 /// visitInlineAsm - Handle a call to an InlineAsm object.
5829 void SelectionDAGBuilder::visitInlineAsm(ImmutableCallSite CS) {
5830 const InlineAsm *IA = cast<InlineAsm>(CS.getCalledValue());
5832 /// ConstraintOperands - Information about all of the constraints.
5833 SDISelAsmOperandInfoVector ConstraintOperands;
5835 TargetLowering::AsmOperandInfoVector
5836 TargetConstraints = TLI.ParseConstraints(CS);
5838 bool hasMemory = false;
5840 unsigned ArgNo = 0; // ArgNo - The argument of the CallInst.
5841 unsigned ResNo = 0; // ResNo - The result number of the next output.
5842 for (unsigned i = 0, e = TargetConstraints.size(); i != e; ++i) {
5843 ConstraintOperands.push_back(SDISelAsmOperandInfo(TargetConstraints[i]));
5844 SDISelAsmOperandInfo &OpInfo = ConstraintOperands.back();
5846 MVT OpVT = MVT::Other;
5848 // Compute the value type for each operand.
5849 switch (OpInfo.Type) {
5850 case InlineAsm::isOutput:
5851 // Indirect outputs just consume an argument.
5852 if (OpInfo.isIndirect) {
5853 OpInfo.CallOperandVal = const_cast<Value *>(CS.getArgument(ArgNo++));
5857 // The return value of the call is this value. As such, there is no
5858 // corresponding argument.
5859 assert(!CS.getType()->isVoidTy() && "Bad inline asm!");
5860 if (StructType *STy = dyn_cast<StructType>(CS.getType())) {
5861 OpVT = TLI.getSimpleValueType(STy->getElementType(ResNo));
5863 assert(ResNo == 0 && "Asm only has one result!");
5864 OpVT = TLI.getSimpleValueType(CS.getType());
5868 case InlineAsm::isInput:
5869 OpInfo.CallOperandVal = const_cast<Value *>(CS.getArgument(ArgNo++));
5871 case InlineAsm::isClobber:
5876 // If this is an input or an indirect output, process the call argument.
5877 // BasicBlocks are labels, currently appearing only in asm's.
5878 if (OpInfo.CallOperandVal) {
5879 if (const BasicBlock *BB = dyn_cast<BasicBlock>(OpInfo.CallOperandVal)) {
5880 OpInfo.CallOperand = DAG.getBasicBlock(FuncInfo.MBBMap[BB]);
5882 OpInfo.CallOperand = getValue(OpInfo.CallOperandVal);
5885 OpVT = OpInfo.getCallOperandValEVT(*DAG.getContext(), TLI, TD).
5889 OpInfo.ConstraintVT = OpVT;
5891 // Indirect operand accesses access memory.
5892 if (OpInfo.isIndirect)
5895 for (unsigned j = 0, ee = OpInfo.Codes.size(); j != ee; ++j) {
5896 TargetLowering::ConstraintType
5897 CType = TLI.getConstraintType(OpInfo.Codes[j]);
5898 if (CType == TargetLowering::C_Memory) {
5906 SDValue Chain, Flag;
5908 // We won't need to flush pending loads if this asm doesn't touch
5909 // memory and is nonvolatile.
5910 if (hasMemory || IA->hasSideEffects())
5913 Chain = DAG.getRoot();
5915 // Second pass over the constraints: compute which constraint option to use
5916 // and assign registers to constraints that want a specific physreg.
5917 for (unsigned i = 0, e = ConstraintOperands.size(); i != e; ++i) {
5918 SDISelAsmOperandInfo &OpInfo = ConstraintOperands[i];
5920 // If this is an output operand with a matching input operand, look up the
5921 // matching input. If their types mismatch, e.g. one is an integer, the
5922 // other is floating point, or their sizes are different, flag it as an
5924 if (OpInfo.hasMatchingInput()) {
5925 SDISelAsmOperandInfo &Input = ConstraintOperands[OpInfo.MatchingInput];
5927 if (OpInfo.ConstraintVT != Input.ConstraintVT) {
5928 std::pair<unsigned, const TargetRegisterClass*> MatchRC =
5929 TLI.getRegForInlineAsmConstraint(OpInfo.ConstraintCode,
5930 OpInfo.ConstraintVT);
5931 std::pair<unsigned, const TargetRegisterClass*> InputRC =
5932 TLI.getRegForInlineAsmConstraint(Input.ConstraintCode,
5933 Input.ConstraintVT);
5934 if ((OpInfo.ConstraintVT.isInteger() !=
5935 Input.ConstraintVT.isInteger()) ||
5936 (MatchRC.second != InputRC.second)) {
5937 report_fatal_error("Unsupported asm: input constraint"
5938 " with a matching output constraint of"
5939 " incompatible type!");
5941 Input.ConstraintVT = OpInfo.ConstraintVT;
5945 // Compute the constraint code and ConstraintType to use.
5946 TLI.ComputeConstraintToUse(OpInfo, OpInfo.CallOperand, &DAG);
5948 // If this is a memory input, and if the operand is not indirect, do what we
5949 // need to to provide an address for the memory input.
5950 if (OpInfo.ConstraintType == TargetLowering::C_Memory &&
5951 !OpInfo.isIndirect) {
5952 assert((OpInfo.isMultipleAlternative ||
5953 (OpInfo.Type == InlineAsm::isInput)) &&
5954 "Can only indirectify direct input operands!");
5956 // Memory operands really want the address of the value. If we don't have
5957 // an indirect input, put it in the constpool if we can, otherwise spill
5958 // it to a stack slot.
5959 // TODO: This isn't quite right. We need to handle these according to
5960 // the addressing mode that the constraint wants. Also, this may take
5961 // an additional register for the computation and we don't want that
5964 // If the operand is a float, integer, or vector constant, spill to a
5965 // constant pool entry to get its address.
5966 const Value *OpVal = OpInfo.CallOperandVal;
5967 if (isa<ConstantFP>(OpVal) || isa<ConstantInt>(OpVal) ||
5968 isa<ConstantVector>(OpVal) || isa<ConstantDataVector>(OpVal)) {
5969 OpInfo.CallOperand = DAG.getConstantPool(cast<Constant>(OpVal),
5970 TLI.getPointerTy());
5972 // Otherwise, create a stack slot and emit a store to it before the
5974 Type *Ty = OpVal->getType();
5975 uint64_t TySize = TLI.getDataLayout()->getTypeAllocSize(Ty);
5976 unsigned Align = TLI.getDataLayout()->getPrefTypeAlignment(Ty);
5977 MachineFunction &MF = DAG.getMachineFunction();
5978 int SSFI = MF.getFrameInfo()->CreateStackObject(TySize, Align, false);
5979 SDValue StackSlot = DAG.getFrameIndex(SSFI, TLI.getPointerTy());
5980 Chain = DAG.getStore(Chain, getCurDebugLoc(),
5981 OpInfo.CallOperand, StackSlot,
5982 MachinePointerInfo::getFixedStack(SSFI),
5984 OpInfo.CallOperand = StackSlot;
5987 // There is no longer a Value* corresponding to this operand.
5988 OpInfo.CallOperandVal = 0;
5990 // It is now an indirect operand.
5991 OpInfo.isIndirect = true;
5994 // If this constraint is for a specific register, allocate it before
5996 if (OpInfo.ConstraintType == TargetLowering::C_Register)
5997 GetRegistersForValue(DAG, TLI, getCurDebugLoc(), OpInfo);
6000 // Second pass - Loop over all of the operands, assigning virtual or physregs
6001 // to register class operands.
6002 for (unsigned i = 0, e = ConstraintOperands.size(); i != e; ++i) {
6003 SDISelAsmOperandInfo &OpInfo = ConstraintOperands[i];
6005 // C_Register operands have already been allocated, Other/Memory don't need
6007 if (OpInfo.ConstraintType == TargetLowering::C_RegisterClass)
6008 GetRegistersForValue(DAG, TLI, getCurDebugLoc(), OpInfo);
6011 // AsmNodeOperands - The operands for the ISD::INLINEASM node.
6012 std::vector<SDValue> AsmNodeOperands;
6013 AsmNodeOperands.push_back(SDValue()); // reserve space for input chain
6014 AsmNodeOperands.push_back(
6015 DAG.getTargetExternalSymbol(IA->getAsmString().c_str(),
6016 TLI.getPointerTy()));
6018 // If we have a !srcloc metadata node associated with it, we want to attach
6019 // this to the ultimately generated inline asm machineinstr. To do this, we
6020 // pass in the third operand as this (potentially null) inline asm MDNode.
6021 const MDNode *SrcLoc = CS.getInstruction()->getMetadata("srcloc");
6022 AsmNodeOperands.push_back(DAG.getMDNode(SrcLoc));
6024 // Remember the HasSideEffect, AlignStack, AsmDialect, MayLoad and MayStore
6025 // bits as operand 3.
6026 unsigned ExtraInfo = 0;
6027 if (IA->hasSideEffects())
6028 ExtraInfo |= InlineAsm::Extra_HasSideEffects;
6029 if (IA->isAlignStack())
6030 ExtraInfo |= InlineAsm::Extra_IsAlignStack;
6031 // Set the asm dialect.
6032 ExtraInfo |= IA->getDialect() * InlineAsm::Extra_AsmDialect;
6034 // Determine if this InlineAsm MayLoad or MayStore based on the constraints.
6035 for (unsigned i = 0, e = TargetConstraints.size(); i != e; ++i) {
6036 TargetLowering::AsmOperandInfo &OpInfo = TargetConstraints[i];
6038 // Compute the constraint code and ConstraintType to use.
6039 TLI.ComputeConstraintToUse(OpInfo, SDValue());
6041 // Ideally, we would only check against memory constraints. However, the
6042 // meaning of an other constraint can be target-specific and we can't easily
6043 // reason about it. Therefore, be conservative and set MayLoad/MayStore
6044 // for other constriants as well.
6045 if (OpInfo.ConstraintType == TargetLowering::C_Memory ||
6046 OpInfo.ConstraintType == TargetLowering::C_Other) {
6047 if (OpInfo.Type == InlineAsm::isInput)
6048 ExtraInfo |= InlineAsm::Extra_MayLoad;
6049 else if (OpInfo.Type == InlineAsm::isOutput)
6050 ExtraInfo |= InlineAsm::Extra_MayStore;
6054 AsmNodeOperands.push_back(DAG.getTargetConstant(ExtraInfo,
6055 TLI.getPointerTy()));
6057 // Loop over all of the inputs, copying the operand values into the
6058 // appropriate registers and processing the output regs.
6059 RegsForValue RetValRegs;
6061 // IndirectStoresToEmit - The set of stores to emit after the inline asm node.
6062 std::vector<std::pair<RegsForValue, Value*> > IndirectStoresToEmit;
6064 for (unsigned i = 0, e = ConstraintOperands.size(); i != e; ++i) {
6065 SDISelAsmOperandInfo &OpInfo = ConstraintOperands[i];
6067 switch (OpInfo.Type) {
6068 case InlineAsm::isOutput: {
6069 if (OpInfo.ConstraintType != TargetLowering::C_RegisterClass &&
6070 OpInfo.ConstraintType != TargetLowering::C_Register) {
6071 // Memory output, or 'other' output (e.g. 'X' constraint).
6072 assert(OpInfo.isIndirect && "Memory output must be indirect operand");
6074 // Add information to the INLINEASM node to know about this output.
6075 unsigned OpFlags = InlineAsm::getFlagWord(InlineAsm::Kind_Mem, 1);
6076 AsmNodeOperands.push_back(DAG.getTargetConstant(OpFlags,
6077 TLI.getPointerTy()));
6078 AsmNodeOperands.push_back(OpInfo.CallOperand);
6082 // Otherwise, this is a register or register class output.
6084 // Copy the output from the appropriate register. Find a register that
6086 if (OpInfo.AssignedRegs.Regs.empty()) {
6087 LLVMContext &Ctx = *DAG.getContext();
6088 Ctx.emitError(CS.getInstruction(),
6089 "couldn't allocate output register for constraint '" +
6090 Twine(OpInfo.ConstraintCode) + "'");
6094 // If this is an indirect operand, store through the pointer after the
6096 if (OpInfo.isIndirect) {
6097 IndirectStoresToEmit.push_back(std::make_pair(OpInfo.AssignedRegs,
6098 OpInfo.CallOperandVal));
6100 // This is the result value of the call.
6101 assert(!CS.getType()->isVoidTy() && "Bad inline asm!");
6102 // Concatenate this output onto the outputs list.
6103 RetValRegs.append(OpInfo.AssignedRegs);
6106 // Add information to the INLINEASM node to know that this register is
6108 OpInfo.AssignedRegs.AddInlineAsmOperands(OpInfo.isEarlyClobber ?
6109 InlineAsm::Kind_RegDefEarlyClobber :
6110 InlineAsm::Kind_RegDef,
6117 case InlineAsm::isInput: {
6118 SDValue InOperandVal = OpInfo.CallOperand;
6120 if (OpInfo.isMatchingInputConstraint()) { // Matching constraint?
6121 // If this is required to match an output register we have already set,
6122 // just use its register.
6123 unsigned OperandNo = OpInfo.getMatchedOperand();
6125 // Scan until we find the definition we already emitted of this operand.
6126 // When we find it, create a RegsForValue operand.
6127 unsigned CurOp = InlineAsm::Op_FirstOperand;
6128 for (; OperandNo; --OperandNo) {
6129 // Advance to the next operand.
6131 cast<ConstantSDNode>(AsmNodeOperands[CurOp])->getZExtValue();
6132 assert((InlineAsm::isRegDefKind(OpFlag) ||
6133 InlineAsm::isRegDefEarlyClobberKind(OpFlag) ||
6134 InlineAsm::isMemKind(OpFlag)) && "Skipped past definitions?");
6135 CurOp += InlineAsm::getNumOperandRegisters(OpFlag)+1;
6139 cast<ConstantSDNode>(AsmNodeOperands[CurOp])->getZExtValue();
6140 if (InlineAsm::isRegDefKind(OpFlag) ||
6141 InlineAsm::isRegDefEarlyClobberKind(OpFlag)) {
6142 // Add (OpFlag&0xffff)>>3 registers to MatchedRegs.
6143 if (OpInfo.isIndirect) {
6144 // This happens on gcc/testsuite/gcc.dg/pr8788-1.c
6145 LLVMContext &Ctx = *DAG.getContext();
6146 Ctx.emitError(CS.getInstruction(), "inline asm not supported yet:"
6147 " don't know how to handle tied "
6148 "indirect register inputs");
6151 RegsForValue MatchedRegs;
6152 MatchedRegs.ValueVTs.push_back(InOperandVal.getValueType());
6153 MVT RegVT = AsmNodeOperands[CurOp+1].getSimpleValueType();
6154 MatchedRegs.RegVTs.push_back(RegVT);
6155 MachineRegisterInfo &RegInfo = DAG.getMachineFunction().getRegInfo();
6156 for (unsigned i = 0, e = InlineAsm::getNumOperandRegisters(OpFlag);
6158 MatchedRegs.Regs.push_back
6159 (RegInfo.createVirtualRegister(TLI.getRegClassFor(RegVT)));
6161 // Use the produced MatchedRegs object to
6162 MatchedRegs.getCopyToRegs(InOperandVal, DAG, getCurDebugLoc(),
6163 Chain, &Flag, CS.getInstruction());
6164 MatchedRegs.AddInlineAsmOperands(InlineAsm::Kind_RegUse,
6165 true, OpInfo.getMatchedOperand(),
6166 DAG, AsmNodeOperands);
6170 assert(InlineAsm::isMemKind(OpFlag) && "Unknown matching constraint!");
6171 assert(InlineAsm::getNumOperandRegisters(OpFlag) == 1 &&
6172 "Unexpected number of operands");
6173 // Add information to the INLINEASM node to know about this input.
6174 // See InlineAsm.h isUseOperandTiedToDef.
6175 OpFlag = InlineAsm::getFlagWordForMatchingOp(OpFlag,
6176 OpInfo.getMatchedOperand());
6177 AsmNodeOperands.push_back(DAG.getTargetConstant(OpFlag,
6178 TLI.getPointerTy()));
6179 AsmNodeOperands.push_back(AsmNodeOperands[CurOp+1]);
6183 // Treat indirect 'X' constraint as memory.
6184 if (OpInfo.ConstraintType == TargetLowering::C_Other &&
6186 OpInfo.ConstraintType = TargetLowering::C_Memory;
6188 if (OpInfo.ConstraintType == TargetLowering::C_Other) {
6189 std::vector<SDValue> Ops;
6190 TLI.LowerAsmOperandForConstraint(InOperandVal, OpInfo.ConstraintCode,
6193 LLVMContext &Ctx = *DAG.getContext();
6194 Ctx.emitError(CS.getInstruction(),
6195 "invalid operand for inline asm constraint '" +
6196 Twine(OpInfo.ConstraintCode) + "'");
6200 // Add information to the INLINEASM node to know about this input.
6201 unsigned ResOpType =
6202 InlineAsm::getFlagWord(InlineAsm::Kind_Imm, Ops.size());
6203 AsmNodeOperands.push_back(DAG.getTargetConstant(ResOpType,
6204 TLI.getPointerTy()));
6205 AsmNodeOperands.insert(AsmNodeOperands.end(), Ops.begin(), Ops.end());
6209 if (OpInfo.ConstraintType == TargetLowering::C_Memory) {
6210 assert(OpInfo.isIndirect && "Operand must be indirect to be a mem!");
6211 assert(InOperandVal.getValueType() == TLI.getPointerTy() &&
6212 "Memory operands expect pointer values");
6214 // Add information to the INLINEASM node to know about this input.
6215 unsigned ResOpType = InlineAsm::getFlagWord(InlineAsm::Kind_Mem, 1);
6216 AsmNodeOperands.push_back(DAG.getTargetConstant(ResOpType,
6217 TLI.getPointerTy()));
6218 AsmNodeOperands.push_back(InOperandVal);
6222 assert((OpInfo.ConstraintType == TargetLowering::C_RegisterClass ||
6223 OpInfo.ConstraintType == TargetLowering::C_Register) &&
6224 "Unknown constraint type!");
6226 // TODO: Support this.
6227 if (OpInfo.isIndirect) {
6228 LLVMContext &Ctx = *DAG.getContext();
6229 Ctx.emitError(CS.getInstruction(),
6230 "Don't know how to handle indirect register inputs yet "
6231 "for constraint '" + Twine(OpInfo.ConstraintCode) + "'");
6235 // Copy the input into the appropriate registers.
6236 if (OpInfo.AssignedRegs.Regs.empty()) {
6237 LLVMContext &Ctx = *DAG.getContext();
6238 Ctx.emitError(CS.getInstruction(),
6239 "couldn't allocate input reg for constraint '" +
6240 Twine(OpInfo.ConstraintCode) + "'");
6244 OpInfo.AssignedRegs.getCopyToRegs(InOperandVal, DAG, getCurDebugLoc(),
6245 Chain, &Flag, CS.getInstruction());
6247 OpInfo.AssignedRegs.AddInlineAsmOperands(InlineAsm::Kind_RegUse, false, 0,
6248 DAG, AsmNodeOperands);
6251 case InlineAsm::isClobber: {
6252 // Add the clobbered value to the operand list, so that the register
6253 // allocator is aware that the physreg got clobbered.
6254 if (!OpInfo.AssignedRegs.Regs.empty())
6255 OpInfo.AssignedRegs.AddInlineAsmOperands(InlineAsm::Kind_Clobber,
6263 // Finish up input operands. Set the input chain and add the flag last.
6264 AsmNodeOperands[InlineAsm::Op_InputChain] = Chain;
6265 if (Flag.getNode()) AsmNodeOperands.push_back(Flag);
6267 Chain = DAG.getNode(ISD::INLINEASM, getCurDebugLoc(),
6268 DAG.getVTList(MVT::Other, MVT::Glue),
6269 &AsmNodeOperands[0], AsmNodeOperands.size());
6270 Flag = Chain.getValue(1);
6272 // If this asm returns a register value, copy the result from that register
6273 // and set it as the value of the call.
6274 if (!RetValRegs.Regs.empty()) {
6275 SDValue Val = RetValRegs.getCopyFromRegs(DAG, FuncInfo, getCurDebugLoc(),
6276 Chain, &Flag, CS.getInstruction());
6278 // FIXME: Why don't we do this for inline asms with MRVs?
6279 if (CS.getType()->isSingleValueType() && CS.getType()->isSized()) {
6280 EVT ResultType = TLI.getValueType(CS.getType());
6282 // If any of the results of the inline asm is a vector, it may have the
6283 // wrong width/num elts. This can happen for register classes that can
6284 // contain multiple different value types. The preg or vreg allocated may
6285 // not have the same VT as was expected. Convert it to the right type
6286 // with bit_convert.
6287 if (ResultType != Val.getValueType() && Val.getValueType().isVector()) {
6288 Val = DAG.getNode(ISD::BITCAST, getCurDebugLoc(),
6291 } else if (ResultType != Val.getValueType() &&
6292 ResultType.isInteger() && Val.getValueType().isInteger()) {
6293 // If a result value was tied to an input value, the computed result may
6294 // have a wider width than the expected result. Extract the relevant
6296 Val = DAG.getNode(ISD::TRUNCATE, getCurDebugLoc(), ResultType, Val);
6299 assert(ResultType == Val.getValueType() && "Asm result value mismatch!");
6302 setValue(CS.getInstruction(), Val);
6303 // Don't need to use this as a chain in this case.
6304 if (!IA->hasSideEffects() && !hasMemory && IndirectStoresToEmit.empty())
6308 std::vector<std::pair<SDValue, const Value *> > StoresToEmit;
6310 // Process indirect outputs, first output all of the flagged copies out of
6312 for (unsigned i = 0, e = IndirectStoresToEmit.size(); i != e; ++i) {
6313 RegsForValue &OutRegs = IndirectStoresToEmit[i].first;
6314 const Value *Ptr = IndirectStoresToEmit[i].second;
6315 SDValue OutVal = OutRegs.getCopyFromRegs(DAG, FuncInfo, getCurDebugLoc(),
6317 StoresToEmit.push_back(std::make_pair(OutVal, Ptr));
6320 // Emit the non-flagged stores from the physregs.
6321 SmallVector<SDValue, 8> OutChains;
6322 for (unsigned i = 0, e = StoresToEmit.size(); i != e; ++i) {
6323 SDValue Val = DAG.getStore(Chain, getCurDebugLoc(),
6324 StoresToEmit[i].first,
6325 getValue(StoresToEmit[i].second),
6326 MachinePointerInfo(StoresToEmit[i].second),
6328 OutChains.push_back(Val);
6331 if (!OutChains.empty())
6332 Chain = DAG.getNode(ISD::TokenFactor, getCurDebugLoc(), MVT::Other,
6333 &OutChains[0], OutChains.size());
6338 void SelectionDAGBuilder::visitVAStart(const CallInst &I) {
6339 DAG.setRoot(DAG.getNode(ISD::VASTART, getCurDebugLoc(),
6340 MVT::Other, getRoot(),
6341 getValue(I.getArgOperand(0)),
6342 DAG.getSrcValue(I.getArgOperand(0))));
6345 void SelectionDAGBuilder::visitVAArg(const VAArgInst &I) {
6346 const DataLayout &TD = *TLI.getDataLayout();
6347 SDValue V = DAG.getVAArg(TLI.getValueType(I.getType()), getCurDebugLoc(),
6348 getRoot(), getValue(I.getOperand(0)),
6349 DAG.getSrcValue(I.getOperand(0)),
6350 TD.getABITypeAlignment(I.getType()));
6352 DAG.setRoot(V.getValue(1));
6355 void SelectionDAGBuilder::visitVAEnd(const CallInst &I) {
6356 DAG.setRoot(DAG.getNode(ISD::VAEND, getCurDebugLoc(),
6357 MVT::Other, getRoot(),
6358 getValue(I.getArgOperand(0)),
6359 DAG.getSrcValue(I.getArgOperand(0))));
6362 void SelectionDAGBuilder::visitVACopy(const CallInst &I) {
6363 DAG.setRoot(DAG.getNode(ISD::VACOPY, getCurDebugLoc(),
6364 MVT::Other, getRoot(),
6365 getValue(I.getArgOperand(0)),
6366 getValue(I.getArgOperand(1)),
6367 DAG.getSrcValue(I.getArgOperand(0)),
6368 DAG.getSrcValue(I.getArgOperand(1))));
6371 /// TargetLowering::LowerCallTo - This is the default LowerCallTo
6372 /// implementation, which just calls LowerCall.
6373 /// FIXME: When all targets are
6374 /// migrated to using LowerCall, this hook should be integrated into SDISel.
6375 std::pair<SDValue, SDValue>
6376 TargetLowering::LowerCallTo(TargetLowering::CallLoweringInfo &CLI) const {
6377 // Handle all of the outgoing arguments.
6379 CLI.OutVals.clear();
6380 ArgListTy &Args = CLI.Args;
6381 for (unsigned i = 0, e = Args.size(); i != e; ++i) {
6382 SmallVector<EVT, 4> ValueVTs;
6383 ComputeValueVTs(*this, Args[i].Ty, ValueVTs);
6384 for (unsigned Value = 0, NumValues = ValueVTs.size();
6385 Value != NumValues; ++Value) {
6386 EVT VT = ValueVTs[Value];
6387 Type *ArgTy = VT.getTypeForEVT(CLI.RetTy->getContext());
6388 SDValue Op = SDValue(Args[i].Node.getNode(),
6389 Args[i].Node.getResNo() + Value);
6390 ISD::ArgFlagsTy Flags;
6391 unsigned OriginalAlignment =
6392 getDataLayout()->getABITypeAlignment(ArgTy);
6398 if (Args[i].isInReg)
6402 if (Args[i].isByVal) {
6404 PointerType *Ty = cast<PointerType>(Args[i].Ty);
6405 Type *ElementTy = Ty->getElementType();
6406 Flags.setByValSize(getDataLayout()->getTypeAllocSize(ElementTy));
6407 // For ByVal, alignment should come from FE. BE will guess if this
6408 // info is not there but there are cases it cannot get right.
6409 unsigned FrameAlign;
6410 if (Args[i].Alignment)
6411 FrameAlign = Args[i].Alignment;
6413 FrameAlign = getByValTypeAlignment(ElementTy);
6414 Flags.setByValAlign(FrameAlign);
6418 Flags.setOrigAlign(OriginalAlignment);
6420 MVT PartVT = getRegisterType(CLI.RetTy->getContext(), VT);
6421 unsigned NumParts = getNumRegisters(CLI.RetTy->getContext(), VT);
6422 SmallVector<SDValue, 4> Parts(NumParts);
6423 ISD::NodeType ExtendKind = ISD::ANY_EXTEND;
6426 ExtendKind = ISD::SIGN_EXTEND;
6427 else if (Args[i].isZExt)
6428 ExtendKind = ISD::ZERO_EXTEND;
6430 getCopyToParts(CLI.DAG, CLI.DL, Op, &Parts[0], NumParts,
6431 PartVT, CLI.CS ? CLI.CS->getInstruction() : 0, ExtendKind);
6433 for (unsigned j = 0; j != NumParts; ++j) {
6434 // if it isn't first piece, alignment must be 1
6435 ISD::OutputArg MyFlags(Flags, Parts[j].getValueType(),
6436 i < CLI.NumFixedArgs,
6437 i, j*Parts[j].getValueType().getStoreSize());
6438 if (NumParts > 1 && j == 0)
6439 MyFlags.Flags.setSplit();
6441 MyFlags.Flags.setOrigAlign(1);
6443 CLI.Outs.push_back(MyFlags);
6444 CLI.OutVals.push_back(Parts[j]);
6449 // Handle the incoming return values from the call.
6451 SmallVector<EVT, 4> RetTys;
6452 ComputeValueVTs(*this, CLI.RetTy, RetTys);
6453 for (unsigned I = 0, E = RetTys.size(); I != E; ++I) {
6455 MVT RegisterVT = getRegisterType(CLI.RetTy->getContext(), VT);
6456 unsigned NumRegs = getNumRegisters(CLI.RetTy->getContext(), VT);
6457 for (unsigned i = 0; i != NumRegs; ++i) {
6458 ISD::InputArg MyFlags;
6459 MyFlags.VT = RegisterVT;
6460 MyFlags.Used = CLI.IsReturnValueUsed;
6462 MyFlags.Flags.setSExt();
6464 MyFlags.Flags.setZExt();
6466 MyFlags.Flags.setInReg();
6467 CLI.Ins.push_back(MyFlags);
6471 SmallVector<SDValue, 4> InVals;
6472 CLI.Chain = LowerCall(CLI, InVals);
6474 // Verify that the target's LowerCall behaved as expected.
6475 assert(CLI.Chain.getNode() && CLI.Chain.getValueType() == MVT::Other &&
6476 "LowerCall didn't return a valid chain!");
6477 assert((!CLI.IsTailCall || InVals.empty()) &&
6478 "LowerCall emitted a return value for a tail call!");
6479 assert((CLI.IsTailCall || InVals.size() == CLI.Ins.size()) &&
6480 "LowerCall didn't emit the correct number of values!");
6482 // For a tail call, the return value is merely live-out and there aren't
6483 // any nodes in the DAG representing it. Return a special value to
6484 // indicate that a tail call has been emitted and no more Instructions
6485 // should be processed in the current block.
6486 if (CLI.IsTailCall) {
6487 CLI.DAG.setRoot(CLI.Chain);
6488 return std::make_pair(SDValue(), SDValue());
6491 DEBUG(for (unsigned i = 0, e = CLI.Ins.size(); i != e; ++i) {
6492 assert(InVals[i].getNode() &&
6493 "LowerCall emitted a null value!");
6494 assert(EVT(CLI.Ins[i].VT) == InVals[i].getValueType() &&
6495 "LowerCall emitted a value with the wrong type!");
6498 // Collect the legal value parts into potentially illegal values
6499 // that correspond to the original function's return values.
6500 ISD::NodeType AssertOp = ISD::DELETED_NODE;
6502 AssertOp = ISD::AssertSext;
6503 else if (CLI.RetZExt)
6504 AssertOp = ISD::AssertZext;
6505 SmallVector<SDValue, 4> ReturnValues;
6506 unsigned CurReg = 0;
6507 for (unsigned I = 0, E = RetTys.size(); I != E; ++I) {
6509 MVT RegisterVT = getRegisterType(CLI.RetTy->getContext(), VT);
6510 unsigned NumRegs = getNumRegisters(CLI.RetTy->getContext(), VT);
6512 ReturnValues.push_back(getCopyFromParts(CLI.DAG, CLI.DL, &InVals[CurReg],
6513 NumRegs, RegisterVT, VT, NULL,
6518 // For a function returning void, there is no return value. We can't create
6519 // such a node, so we just return a null return value in that case. In
6520 // that case, nothing will actually look at the value.
6521 if (ReturnValues.empty())
6522 return std::make_pair(SDValue(), CLI.Chain);
6524 SDValue Res = CLI.DAG.getNode(ISD::MERGE_VALUES, CLI.DL,
6525 CLI.DAG.getVTList(&RetTys[0], RetTys.size()),
6526 &ReturnValues[0], ReturnValues.size());
6527 return std::make_pair(Res, CLI.Chain);
6530 void TargetLowering::LowerOperationWrapper(SDNode *N,
6531 SmallVectorImpl<SDValue> &Results,
6532 SelectionDAG &DAG) const {
6533 SDValue Res = LowerOperation(SDValue(N, 0), DAG);
6535 Results.push_back(Res);
6538 SDValue TargetLowering::LowerOperation(SDValue Op, SelectionDAG &DAG) const {
6539 llvm_unreachable("LowerOperation not implemented for this target!");
6543 SelectionDAGBuilder::CopyValueToVirtualRegister(const Value *V, unsigned Reg) {
6544 SDValue Op = getNonRegisterValue(V);
6545 assert((Op.getOpcode() != ISD::CopyFromReg ||
6546 cast<RegisterSDNode>(Op.getOperand(1))->getReg() != Reg) &&
6547 "Copy from a reg to the same reg!");
6548 assert(!TargetRegisterInfo::isPhysicalRegister(Reg) && "Is a physreg");
6550 RegsForValue RFV(V->getContext(), TLI, Reg, V->getType());
6551 SDValue Chain = DAG.getEntryNode();
6552 RFV.getCopyToRegs(Op, DAG, getCurDebugLoc(), Chain, 0, V);
6553 PendingExports.push_back(Chain);
6556 #include "llvm/CodeGen/SelectionDAGISel.h"
6558 /// isOnlyUsedInEntryBlock - If the specified argument is only used in the
6559 /// entry block, return true. This includes arguments used by switches, since
6560 /// the switch may expand into multiple basic blocks.
6561 static bool isOnlyUsedInEntryBlock(const Argument *A, bool FastISel) {
6562 // With FastISel active, we may be splitting blocks, so force creation
6563 // of virtual registers for all non-dead arguments.
6565 return A->use_empty();
6567 const BasicBlock *Entry = A->getParent()->begin();
6568 for (Value::const_use_iterator UI = A->use_begin(), E = A->use_end();
6570 const User *U = *UI;
6571 if (cast<Instruction>(U)->getParent() != Entry || isa<SwitchInst>(U))
6572 return false; // Use not in entry block.
6577 void SelectionDAGISel::LowerArguments(const BasicBlock *LLVMBB) {
6578 // If this is the entry block, emit arguments.
6579 const Function &F = *LLVMBB->getParent();
6580 SelectionDAG &DAG = SDB->DAG;
6581 DebugLoc dl = SDB->getCurDebugLoc();
6582 const DataLayout *TD = TLI.getDataLayout();
6583 SmallVector<ISD::InputArg, 16> Ins;
6585 // Check whether the function can return without sret-demotion.
6586 SmallVector<ISD::OutputArg, 4> Outs;
6587 GetReturnInfo(F.getReturnType(), F.getAttributes().getRetAttributes(),
6590 if (!FuncInfo->CanLowerReturn) {
6591 // Put in an sret pointer parameter before all the other parameters.
6592 SmallVector<EVT, 1> ValueVTs;
6593 ComputeValueVTs(TLI, PointerType::getUnqual(F.getReturnType()), ValueVTs);
6595 // NOTE: Assuming that a pointer will never break down to more than one VT
6597 ISD::ArgFlagsTy Flags;
6599 MVT RegisterVT = TLI.getRegisterType(*DAG.getContext(), ValueVTs[0]);
6600 ISD::InputArg RetArg(Flags, RegisterVT, true, 0, 0);
6601 Ins.push_back(RetArg);
6604 // Set up the incoming argument description vector.
6606 for (Function::const_arg_iterator I = F.arg_begin(), E = F.arg_end();
6607 I != E; ++I, ++Idx) {
6608 SmallVector<EVT, 4> ValueVTs;
6609 ComputeValueVTs(TLI, I->getType(), ValueVTs);
6610 bool isArgValueUsed = !I->use_empty();
6611 for (unsigned Value = 0, NumValues = ValueVTs.size();
6612 Value != NumValues; ++Value) {
6613 EVT VT = ValueVTs[Value];
6614 Type *ArgTy = VT.getTypeForEVT(*DAG.getContext());
6615 ISD::ArgFlagsTy Flags;
6616 unsigned OriginalAlignment =
6617 TD->getABITypeAlignment(ArgTy);
6619 if (F.getAttributes().hasAttribute(Idx, Attribute::ZExt))
6621 if (F.getAttributes().hasAttribute(Idx, Attribute::SExt))
6623 if (F.getAttributes().hasAttribute(Idx, Attribute::InReg))
6625 if (F.getAttributes().hasAttribute(Idx, Attribute::StructRet))
6627 if (F.getAttributes().hasAttribute(Idx, Attribute::ByVal)) {
6629 PointerType *Ty = cast<PointerType>(I->getType());
6630 Type *ElementTy = Ty->getElementType();
6631 Flags.setByValSize(TD->getTypeAllocSize(ElementTy));
6632 // For ByVal, alignment should be passed from FE. BE will guess if
6633 // this info is not there but there are cases it cannot get right.
6634 unsigned FrameAlign;
6635 if (F.getParamAlignment(Idx))
6636 FrameAlign = F.getParamAlignment(Idx);
6638 FrameAlign = TLI.getByValTypeAlignment(ElementTy);
6639 Flags.setByValAlign(FrameAlign);
6641 if (F.getAttributes().hasAttribute(Idx, Attribute::Nest))
6643 Flags.setOrigAlign(OriginalAlignment);
6645 MVT RegisterVT = TLI.getRegisterType(*CurDAG->getContext(), VT);
6646 unsigned NumRegs = TLI.getNumRegisters(*CurDAG->getContext(), VT);
6647 for (unsigned i = 0; i != NumRegs; ++i) {
6648 ISD::InputArg MyFlags(Flags, RegisterVT, isArgValueUsed,
6649 Idx-1, i*RegisterVT.getStoreSize());
6650 if (NumRegs > 1 && i == 0)
6651 MyFlags.Flags.setSplit();
6652 // if it isn't first piece, alignment must be 1
6654 MyFlags.Flags.setOrigAlign(1);
6655 Ins.push_back(MyFlags);
6660 // Call the target to set up the argument values.
6661 SmallVector<SDValue, 8> InVals;
6662 SDValue NewRoot = TLI.LowerFormalArguments(DAG.getRoot(), F.getCallingConv(),
6666 // Verify that the target's LowerFormalArguments behaved as expected.
6667 assert(NewRoot.getNode() && NewRoot.getValueType() == MVT::Other &&
6668 "LowerFormalArguments didn't return a valid chain!");
6669 assert(InVals.size() == Ins.size() &&
6670 "LowerFormalArguments didn't emit the correct number of values!");
6672 for (unsigned i = 0, e = Ins.size(); i != e; ++i) {
6673 assert(InVals[i].getNode() &&
6674 "LowerFormalArguments emitted a null value!");
6675 assert(EVT(Ins[i].VT) == InVals[i].getValueType() &&
6676 "LowerFormalArguments emitted a value with the wrong type!");
6680 // Update the DAG with the new chain value resulting from argument lowering.
6681 DAG.setRoot(NewRoot);
6683 // Set up the argument values.
6686 if (!FuncInfo->CanLowerReturn) {
6687 // Create a virtual register for the sret pointer, and put in a copy
6688 // from the sret argument into it.
6689 SmallVector<EVT, 1> ValueVTs;
6690 ComputeValueVTs(TLI, PointerType::getUnqual(F.getReturnType()), ValueVTs);
6691 MVT VT = ValueVTs[0].getSimpleVT();
6692 MVT RegVT = TLI.getRegisterType(*CurDAG->getContext(), VT);
6693 ISD::NodeType AssertOp = ISD::DELETED_NODE;
6694 SDValue ArgValue = getCopyFromParts(DAG, dl, &InVals[0], 1,
6695 RegVT, VT, NULL, AssertOp);
6697 MachineFunction& MF = SDB->DAG.getMachineFunction();
6698 MachineRegisterInfo& RegInfo = MF.getRegInfo();
6699 unsigned SRetReg = RegInfo.createVirtualRegister(TLI.getRegClassFor(RegVT));
6700 FuncInfo->DemoteRegister = SRetReg;
6701 NewRoot = SDB->DAG.getCopyToReg(NewRoot, SDB->getCurDebugLoc(),
6703 DAG.setRoot(NewRoot);
6705 // i indexes lowered arguments. Bump it past the hidden sret argument.
6706 // Idx indexes LLVM arguments. Don't touch it.
6710 for (Function::const_arg_iterator I = F.arg_begin(), E = F.arg_end(); I != E;
6712 SmallVector<SDValue, 4> ArgValues;
6713 SmallVector<EVT, 4> ValueVTs;
6714 ComputeValueVTs(TLI, I->getType(), ValueVTs);
6715 unsigned NumValues = ValueVTs.size();
6717 // If this argument is unused then remember its value. It is used to generate
6718 // debugging information.
6719 if (I->use_empty() && NumValues)
6720 SDB->setUnusedArgValue(I, InVals[i]);
6722 for (unsigned Val = 0; Val != NumValues; ++Val) {
6723 EVT VT = ValueVTs[Val];
6724 MVT PartVT = TLI.getRegisterType(*CurDAG->getContext(), VT);
6725 unsigned NumParts = TLI.getNumRegisters(*CurDAG->getContext(), VT);
6727 if (!I->use_empty()) {
6728 ISD::NodeType AssertOp = ISD::DELETED_NODE;
6729 if (F.getAttributes().hasAttribute(Idx, Attribute::SExt))
6730 AssertOp = ISD::AssertSext;
6731 else if (F.getAttributes().hasAttribute(Idx, Attribute::ZExt))
6732 AssertOp = ISD::AssertZext;
6734 ArgValues.push_back(getCopyFromParts(DAG, dl, &InVals[i],
6735 NumParts, PartVT, VT,
6742 // We don't need to do anything else for unused arguments.
6743 if (ArgValues.empty())
6746 // Note down frame index.
6747 if (FrameIndexSDNode *FI =
6748 dyn_cast<FrameIndexSDNode>(ArgValues[0].getNode()))
6749 FuncInfo->setArgumentFrameIndex(I, FI->getIndex());
6751 SDValue Res = DAG.getMergeValues(&ArgValues[0], NumValues,
6752 SDB->getCurDebugLoc());
6754 SDB->setValue(I, Res);
6755 if (!TM.Options.EnableFastISel && Res.getOpcode() == ISD::BUILD_PAIR) {
6756 if (LoadSDNode *LNode =
6757 dyn_cast<LoadSDNode>(Res.getOperand(0).getNode()))
6758 if (FrameIndexSDNode *FI =
6759 dyn_cast<FrameIndexSDNode>(LNode->getBasePtr().getNode()))
6760 FuncInfo->setArgumentFrameIndex(I, FI->getIndex());
6763 // If this argument is live outside of the entry block, insert a copy from
6764 // wherever we got it to the vreg that other BB's will reference it as.
6765 if (!TM.Options.EnableFastISel && Res.getOpcode() == ISD::CopyFromReg) {
6766 // If we can, though, try to skip creating an unnecessary vreg.
6767 // FIXME: This isn't very clean... it would be nice to make this more
6768 // general. It's also subtly incompatible with the hacks FastISel
6770 unsigned Reg = cast<RegisterSDNode>(Res.getOperand(1))->getReg();
6771 if (TargetRegisterInfo::isVirtualRegister(Reg)) {
6772 FuncInfo->ValueMap[I] = Reg;
6776 if (!isOnlyUsedInEntryBlock(I, TM.Options.EnableFastISel)) {
6777 FuncInfo->InitializeRegForValue(I);
6778 SDB->CopyToExportRegsIfNeeded(I);
6782 assert(i == InVals.size() && "Argument register count mismatch!");
6784 // Finally, if the target has anything special to do, allow it to do so.
6785 // FIXME: this should insert code into the DAG!
6786 EmitFunctionEntryCode();
6789 /// Handle PHI nodes in successor blocks. Emit code into the SelectionDAG to
6790 /// ensure constants are generated when needed. Remember the virtual registers
6791 /// that need to be added to the Machine PHI nodes as input. We cannot just
6792 /// directly add them, because expansion might result in multiple MBB's for one
6793 /// BB. As such, the start of the BB might correspond to a different MBB than
6797 SelectionDAGBuilder::HandlePHINodesInSuccessorBlocks(const BasicBlock *LLVMBB) {
6798 const TerminatorInst *TI = LLVMBB->getTerminator();
6800 SmallPtrSet<MachineBasicBlock *, 4> SuccsHandled;
6802 // Check successor nodes' PHI nodes that expect a constant to be available
6804 for (unsigned succ = 0, e = TI->getNumSuccessors(); succ != e; ++succ) {
6805 const BasicBlock *SuccBB = TI->getSuccessor(succ);
6806 if (!isa<PHINode>(SuccBB->begin())) continue;
6807 MachineBasicBlock *SuccMBB = FuncInfo.MBBMap[SuccBB];
6809 // If this terminator has multiple identical successors (common for
6810 // switches), only handle each succ once.
6811 if (!SuccsHandled.insert(SuccMBB)) continue;
6813 MachineBasicBlock::iterator MBBI = SuccMBB->begin();
6815 // At this point we know that there is a 1-1 correspondence between LLVM PHI
6816 // nodes and Machine PHI nodes, but the incoming operands have not been
6818 for (BasicBlock::const_iterator I = SuccBB->begin();
6819 const PHINode *PN = dyn_cast<PHINode>(I); ++I) {
6820 // Ignore dead phi's.
6821 if (PN->use_empty()) continue;
6824 if (PN->getType()->isEmptyTy())
6828 const Value *PHIOp = PN->getIncomingValueForBlock(LLVMBB);
6830 if (const Constant *C = dyn_cast<Constant>(PHIOp)) {
6831 unsigned &RegOut = ConstantsOut[C];
6833 RegOut = FuncInfo.CreateRegs(C->getType());
6834 CopyValueToVirtualRegister(C, RegOut);
6838 DenseMap<const Value *, unsigned>::iterator I =
6839 FuncInfo.ValueMap.find(PHIOp);
6840 if (I != FuncInfo.ValueMap.end())
6843 assert(isa<AllocaInst>(PHIOp) &&
6844 FuncInfo.StaticAllocaMap.count(cast<AllocaInst>(PHIOp)) &&
6845 "Didn't codegen value into a register!??");
6846 Reg = FuncInfo.CreateRegs(PHIOp->getType());
6847 CopyValueToVirtualRegister(PHIOp, Reg);
6851 // Remember that this register needs to added to the machine PHI node as
6852 // the input for this MBB.
6853 SmallVector<EVT, 4> ValueVTs;
6854 ComputeValueVTs(TLI, PN->getType(), ValueVTs);
6855 for (unsigned vti = 0, vte = ValueVTs.size(); vti != vte; ++vti) {
6856 EVT VT = ValueVTs[vti];
6857 unsigned NumRegisters = TLI.getNumRegisters(*DAG.getContext(), VT);
6858 for (unsigned i = 0, e = NumRegisters; i != e; ++i)
6859 FuncInfo.PHINodesToUpdate.push_back(std::make_pair(MBBI++, Reg+i));
6860 Reg += NumRegisters;
6864 ConstantsOut.clear();