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/SmallSet.h"
19 #include "llvm/Analysis/AliasAnalysis.h"
20 #include "llvm/Analysis/BranchProbabilityInfo.h"
21 #include "llvm/Analysis/ConstantFolding.h"
22 #include "llvm/Analysis/ValueTracking.h"
23 #include "llvm/CodeGen/Analysis.h"
24 #include "llvm/CodeGen/FastISel.h"
25 #include "llvm/CodeGen/FunctionLoweringInfo.h"
26 #include "llvm/CodeGen/GCMetadata.h"
27 #include "llvm/CodeGen/GCStrategy.h"
28 #include "llvm/CodeGen/MachineFrameInfo.h"
29 #include "llvm/CodeGen/MachineFunction.h"
30 #include "llvm/CodeGen/MachineInstrBuilder.h"
31 #include "llvm/CodeGen/MachineJumpTableInfo.h"
32 #include "llvm/CodeGen/MachineModuleInfo.h"
33 #include "llvm/CodeGen/MachineRegisterInfo.h"
34 #include "llvm/CodeGen/SelectionDAG.h"
35 #include "llvm/DebugInfo.h"
36 #include "llvm/IR/CallingConv.h"
37 #include "llvm/IR/Constants.h"
38 #include "llvm/IR/DataLayout.h"
39 #include "llvm/IR/DerivedTypes.h"
40 #include "llvm/IR/Function.h"
41 #include "llvm/IR/GlobalVariable.h"
42 #include "llvm/IR/InlineAsm.h"
43 #include "llvm/IR/Instructions.h"
44 #include "llvm/IR/IntrinsicInst.h"
45 #include "llvm/IR/Intrinsics.h"
46 #include "llvm/IR/LLVMContext.h"
47 #include "llvm/IR/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/IR/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->getAttributes().hasAttribute(AttributeSet::ReturnIndex,
1238 ExtendKind = ISD::SIGN_EXTEND;
1239 else if (F->getAttributes().hasAttribute(AttributeSet::ReturnIndex,
1241 ExtendKind = ISD::ZERO_EXTEND;
1243 if (ExtendKind != ISD::ANY_EXTEND && VT.isInteger())
1244 VT = TLI.getTypeForExtArgOrReturn(VT.getSimpleVT(), ExtendKind);
1246 unsigned NumParts = TLI.getNumRegisters(*DAG.getContext(), VT);
1247 MVT PartVT = TLI.getRegisterType(*DAG.getContext(), VT);
1248 SmallVector<SDValue, 4> Parts(NumParts);
1249 getCopyToParts(DAG, getCurDebugLoc(),
1250 SDValue(RetOp.getNode(), RetOp.getResNo() + j),
1251 &Parts[0], NumParts, PartVT, &I, ExtendKind);
1253 // 'inreg' on function refers to return value
1254 ISD::ArgFlagsTy Flags = ISD::ArgFlagsTy();
1255 if (F->getAttributes().hasAttribute(AttributeSet::ReturnIndex,
1259 // Propagate extension type if any
1260 if (ExtendKind == ISD::SIGN_EXTEND)
1262 else if (ExtendKind == ISD::ZERO_EXTEND)
1265 for (unsigned i = 0; i < NumParts; ++i) {
1266 Outs.push_back(ISD::OutputArg(Flags, Parts[i].getValueType(),
1267 /*isfixed=*/true, 0, 0));
1268 OutVals.push_back(Parts[i]);
1274 bool isVarArg = DAG.getMachineFunction().getFunction()->isVarArg();
1275 CallingConv::ID CallConv =
1276 DAG.getMachineFunction().getFunction()->getCallingConv();
1277 Chain = TLI.LowerReturn(Chain, CallConv, isVarArg,
1278 Outs, OutVals, getCurDebugLoc(), DAG);
1280 // Verify that the target's LowerReturn behaved as expected.
1281 assert(Chain.getNode() && Chain.getValueType() == MVT::Other &&
1282 "LowerReturn didn't return a valid chain!");
1284 // Update the DAG with the new chain value resulting from return lowering.
1288 /// CopyToExportRegsIfNeeded - If the given value has virtual registers
1289 /// created for it, emit nodes to copy the value into the virtual
1291 void SelectionDAGBuilder::CopyToExportRegsIfNeeded(const Value *V) {
1293 if (V->getType()->isEmptyTy())
1296 DenseMap<const Value *, unsigned>::iterator VMI = FuncInfo.ValueMap.find(V);
1297 if (VMI != FuncInfo.ValueMap.end()) {
1298 assert(!V->use_empty() && "Unused value assigned virtual registers!");
1299 CopyValueToVirtualRegister(V, VMI->second);
1303 /// ExportFromCurrentBlock - If this condition isn't known to be exported from
1304 /// the current basic block, add it to ValueMap now so that we'll get a
1306 void SelectionDAGBuilder::ExportFromCurrentBlock(const Value *V) {
1307 // No need to export constants.
1308 if (!isa<Instruction>(V) && !isa<Argument>(V)) return;
1310 // Already exported?
1311 if (FuncInfo.isExportedInst(V)) return;
1313 unsigned Reg = FuncInfo.InitializeRegForValue(V);
1314 CopyValueToVirtualRegister(V, Reg);
1317 bool SelectionDAGBuilder::isExportableFromCurrentBlock(const Value *V,
1318 const BasicBlock *FromBB) {
1319 // The operands of the setcc have to be in this block. We don't know
1320 // how to export them from some other block.
1321 if (const Instruction *VI = dyn_cast<Instruction>(V)) {
1322 // Can export from current BB.
1323 if (VI->getParent() == FromBB)
1326 // Is already exported, noop.
1327 return FuncInfo.isExportedInst(V);
1330 // If this is an argument, we can export it if the BB is the entry block or
1331 // if it is already exported.
1332 if (isa<Argument>(V)) {
1333 if (FromBB == &FromBB->getParent()->getEntryBlock())
1336 // Otherwise, can only export this if it is already exported.
1337 return FuncInfo.isExportedInst(V);
1340 // Otherwise, constants can always be exported.
1344 /// Return branch probability calculated by BranchProbabilityInfo for IR blocks.
1345 uint32_t SelectionDAGBuilder::getEdgeWeight(const MachineBasicBlock *Src,
1346 const MachineBasicBlock *Dst) const {
1347 BranchProbabilityInfo *BPI = FuncInfo.BPI;
1350 const BasicBlock *SrcBB = Src->getBasicBlock();
1351 const BasicBlock *DstBB = Dst->getBasicBlock();
1352 return BPI->getEdgeWeight(SrcBB, DstBB);
1355 void SelectionDAGBuilder::
1356 addSuccessorWithWeight(MachineBasicBlock *Src, MachineBasicBlock *Dst,
1357 uint32_t Weight /* = 0 */) {
1359 Weight = getEdgeWeight(Src, Dst);
1360 Src->addSuccessor(Dst, Weight);
1364 static bool InBlock(const Value *V, const BasicBlock *BB) {
1365 if (const Instruction *I = dyn_cast<Instruction>(V))
1366 return I->getParent() == BB;
1370 /// EmitBranchForMergedCondition - Helper method for FindMergedConditions.
1371 /// This function emits a branch and is used at the leaves of an OR or an
1372 /// AND operator tree.
1375 SelectionDAGBuilder::EmitBranchForMergedCondition(const Value *Cond,
1376 MachineBasicBlock *TBB,
1377 MachineBasicBlock *FBB,
1378 MachineBasicBlock *CurBB,
1379 MachineBasicBlock *SwitchBB) {
1380 const BasicBlock *BB = CurBB->getBasicBlock();
1382 // If the leaf of the tree is a comparison, merge the condition into
1384 if (const CmpInst *BOp = dyn_cast<CmpInst>(Cond)) {
1385 // The operands of the cmp have to be in this block. We don't know
1386 // how to export them from some other block. If this is the first block
1387 // of the sequence, no exporting is needed.
1388 if (CurBB == SwitchBB ||
1389 (isExportableFromCurrentBlock(BOp->getOperand(0), BB) &&
1390 isExportableFromCurrentBlock(BOp->getOperand(1), BB))) {
1391 ISD::CondCode Condition;
1392 if (const ICmpInst *IC = dyn_cast<ICmpInst>(Cond)) {
1393 Condition = getICmpCondCode(IC->getPredicate());
1394 } else if (const FCmpInst *FC = dyn_cast<FCmpInst>(Cond)) {
1395 Condition = getFCmpCondCode(FC->getPredicate());
1396 if (TM.Options.NoNaNsFPMath)
1397 Condition = getFCmpCodeWithoutNaN(Condition);
1399 Condition = ISD::SETEQ; // silence warning.
1400 llvm_unreachable("Unknown compare instruction");
1403 CaseBlock CB(Condition, BOp->getOperand(0),
1404 BOp->getOperand(1), NULL, TBB, FBB, CurBB);
1405 SwitchCases.push_back(CB);
1410 // Create a CaseBlock record representing this branch.
1411 CaseBlock CB(ISD::SETEQ, Cond, ConstantInt::getTrue(*DAG.getContext()),
1412 NULL, TBB, FBB, CurBB);
1413 SwitchCases.push_back(CB);
1416 /// FindMergedConditions - If Cond is an expression like
1417 void SelectionDAGBuilder::FindMergedConditions(const Value *Cond,
1418 MachineBasicBlock *TBB,
1419 MachineBasicBlock *FBB,
1420 MachineBasicBlock *CurBB,
1421 MachineBasicBlock *SwitchBB,
1423 // If this node is not part of the or/and tree, emit it as a branch.
1424 const Instruction *BOp = dyn_cast<Instruction>(Cond);
1425 if (!BOp || !(isa<BinaryOperator>(BOp) || isa<CmpInst>(BOp)) ||
1426 (unsigned)BOp->getOpcode() != Opc || !BOp->hasOneUse() ||
1427 BOp->getParent() != CurBB->getBasicBlock() ||
1428 !InBlock(BOp->getOperand(0), CurBB->getBasicBlock()) ||
1429 !InBlock(BOp->getOperand(1), CurBB->getBasicBlock())) {
1430 EmitBranchForMergedCondition(Cond, TBB, FBB, CurBB, SwitchBB);
1434 // Create TmpBB after CurBB.
1435 MachineFunction::iterator BBI = CurBB;
1436 MachineFunction &MF = DAG.getMachineFunction();
1437 MachineBasicBlock *TmpBB = MF.CreateMachineBasicBlock(CurBB->getBasicBlock());
1438 CurBB->getParent()->insert(++BBI, TmpBB);
1440 if (Opc == Instruction::Or) {
1441 // Codegen X | Y as:
1449 // Emit the LHS condition.
1450 FindMergedConditions(BOp->getOperand(0), TBB, TmpBB, CurBB, SwitchBB, Opc);
1452 // Emit the RHS condition into TmpBB.
1453 FindMergedConditions(BOp->getOperand(1), TBB, FBB, TmpBB, SwitchBB, Opc);
1455 assert(Opc == Instruction::And && "Unknown merge op!");
1456 // Codegen X & Y as:
1463 // This requires creation of TmpBB after CurBB.
1465 // Emit the LHS condition.
1466 FindMergedConditions(BOp->getOperand(0), TmpBB, FBB, CurBB, SwitchBB, Opc);
1468 // Emit the RHS condition into TmpBB.
1469 FindMergedConditions(BOp->getOperand(1), TBB, FBB, TmpBB, SwitchBB, Opc);
1473 /// If the set of cases should be emitted as a series of branches, return true.
1474 /// If we should emit this as a bunch of and/or'd together conditions, return
1477 SelectionDAGBuilder::ShouldEmitAsBranches(const std::vector<CaseBlock> &Cases){
1478 if (Cases.size() != 2) return true;
1480 // If this is two comparisons of the same values or'd or and'd together, they
1481 // will get folded into a single comparison, so don't emit two blocks.
1482 if ((Cases[0].CmpLHS == Cases[1].CmpLHS &&
1483 Cases[0].CmpRHS == Cases[1].CmpRHS) ||
1484 (Cases[0].CmpRHS == Cases[1].CmpLHS &&
1485 Cases[0].CmpLHS == Cases[1].CmpRHS)) {
1489 // Handle: (X != null) | (Y != null) --> (X|Y) != 0
1490 // Handle: (X == null) & (Y == null) --> (X|Y) == 0
1491 if (Cases[0].CmpRHS == Cases[1].CmpRHS &&
1492 Cases[0].CC == Cases[1].CC &&
1493 isa<Constant>(Cases[0].CmpRHS) &&
1494 cast<Constant>(Cases[0].CmpRHS)->isNullValue()) {
1495 if (Cases[0].CC == ISD::SETEQ && Cases[0].TrueBB == Cases[1].ThisBB)
1497 if (Cases[0].CC == ISD::SETNE && Cases[0].FalseBB == Cases[1].ThisBB)
1504 void SelectionDAGBuilder::visitBr(const BranchInst &I) {
1505 MachineBasicBlock *BrMBB = FuncInfo.MBB;
1507 // Update machine-CFG edges.
1508 MachineBasicBlock *Succ0MBB = FuncInfo.MBBMap[I.getSuccessor(0)];
1510 // Figure out which block is immediately after the current one.
1511 MachineBasicBlock *NextBlock = 0;
1512 MachineFunction::iterator BBI = BrMBB;
1513 if (++BBI != FuncInfo.MF->end())
1516 if (I.isUnconditional()) {
1517 // Update machine-CFG edges.
1518 BrMBB->addSuccessor(Succ0MBB);
1520 // If this is not a fall-through branch, emit the branch.
1521 if (Succ0MBB != NextBlock)
1522 DAG.setRoot(DAG.getNode(ISD::BR, getCurDebugLoc(),
1523 MVT::Other, getControlRoot(),
1524 DAG.getBasicBlock(Succ0MBB)));
1529 // If this condition is one of the special cases we handle, do special stuff
1531 const Value *CondVal = I.getCondition();
1532 MachineBasicBlock *Succ1MBB = FuncInfo.MBBMap[I.getSuccessor(1)];
1534 // If this is a series of conditions that are or'd or and'd together, emit
1535 // this as a sequence of branches instead of setcc's with and/or operations.
1536 // As long as jumps are not expensive, this should improve performance.
1537 // For example, instead of something like:
1550 if (const BinaryOperator *BOp = dyn_cast<BinaryOperator>(CondVal)) {
1551 if (!TLI.isJumpExpensive() &&
1553 (BOp->getOpcode() == Instruction::And ||
1554 BOp->getOpcode() == Instruction::Or)) {
1555 FindMergedConditions(BOp, Succ0MBB, Succ1MBB, BrMBB, BrMBB,
1557 // If the compares in later blocks need to use values not currently
1558 // exported from this block, export them now. This block should always
1559 // be the first entry.
1560 assert(SwitchCases[0].ThisBB == BrMBB && "Unexpected lowering!");
1562 // Allow some cases to be rejected.
1563 if (ShouldEmitAsBranches(SwitchCases)) {
1564 for (unsigned i = 1, e = SwitchCases.size(); i != e; ++i) {
1565 ExportFromCurrentBlock(SwitchCases[i].CmpLHS);
1566 ExportFromCurrentBlock(SwitchCases[i].CmpRHS);
1569 // Emit the branch for this block.
1570 visitSwitchCase(SwitchCases[0], BrMBB);
1571 SwitchCases.erase(SwitchCases.begin());
1575 // Okay, we decided not to do this, remove any inserted MBB's and clear
1577 for (unsigned i = 1, e = SwitchCases.size(); i != e; ++i)
1578 FuncInfo.MF->erase(SwitchCases[i].ThisBB);
1580 SwitchCases.clear();
1584 // Create a CaseBlock record representing this branch.
1585 CaseBlock CB(ISD::SETEQ, CondVal, ConstantInt::getTrue(*DAG.getContext()),
1586 NULL, Succ0MBB, Succ1MBB, BrMBB);
1588 // Use visitSwitchCase to actually insert the fast branch sequence for this
1590 visitSwitchCase(CB, BrMBB);
1593 /// visitSwitchCase - Emits the necessary code to represent a single node in
1594 /// the binary search tree resulting from lowering a switch instruction.
1595 void SelectionDAGBuilder::visitSwitchCase(CaseBlock &CB,
1596 MachineBasicBlock *SwitchBB) {
1598 SDValue CondLHS = getValue(CB.CmpLHS);
1599 DebugLoc dl = getCurDebugLoc();
1601 // Build the setcc now.
1602 if (CB.CmpMHS == NULL) {
1603 // Fold "(X == true)" to X and "(X == false)" to !X to
1604 // handle common cases produced by branch lowering.
1605 if (CB.CmpRHS == ConstantInt::getTrue(*DAG.getContext()) &&
1606 CB.CC == ISD::SETEQ)
1608 else if (CB.CmpRHS == ConstantInt::getFalse(*DAG.getContext()) &&
1609 CB.CC == ISD::SETEQ) {
1610 SDValue True = DAG.getConstant(1, CondLHS.getValueType());
1611 Cond = DAG.getNode(ISD::XOR, dl, CondLHS.getValueType(), CondLHS, True);
1613 Cond = DAG.getSetCC(dl, MVT::i1, CondLHS, getValue(CB.CmpRHS), CB.CC);
1615 assert(CB.CC == ISD::SETCC_INVALID &&
1616 "Condition is undefined for to-the-range belonging check.");
1618 const APInt& Low = cast<ConstantInt>(CB.CmpLHS)->getValue();
1619 const APInt& High = cast<ConstantInt>(CB.CmpRHS)->getValue();
1621 SDValue CmpOp = getValue(CB.CmpMHS);
1622 EVT VT = CmpOp.getValueType();
1624 if (cast<ConstantInt>(CB.CmpLHS)->isMinValue(false)) {
1625 Cond = DAG.getSetCC(dl, MVT::i1, CmpOp, DAG.getConstant(High, VT),
1628 SDValue SUB = DAG.getNode(ISD::SUB, dl,
1629 VT, CmpOp, DAG.getConstant(Low, VT));
1630 Cond = DAG.getSetCC(dl, MVT::i1, SUB,
1631 DAG.getConstant(High-Low, VT), ISD::SETULE);
1635 // Update successor info
1636 addSuccessorWithWeight(SwitchBB, CB.TrueBB, CB.TrueWeight);
1637 // TrueBB and FalseBB are always different unless the incoming IR is
1638 // degenerate. This only happens when running llc on weird IR.
1639 if (CB.TrueBB != CB.FalseBB)
1640 addSuccessorWithWeight(SwitchBB, CB.FalseBB, CB.FalseWeight);
1642 // Set NextBlock to be the MBB immediately after the current one, if any.
1643 // This is used to avoid emitting unnecessary branches to the next block.
1644 MachineBasicBlock *NextBlock = 0;
1645 MachineFunction::iterator BBI = SwitchBB;
1646 if (++BBI != FuncInfo.MF->end())
1649 // If the lhs block is the next block, invert the condition so that we can
1650 // fall through to the lhs instead of the rhs block.
1651 if (CB.TrueBB == NextBlock) {
1652 std::swap(CB.TrueBB, CB.FalseBB);
1653 SDValue True = DAG.getConstant(1, Cond.getValueType());
1654 Cond = DAG.getNode(ISD::XOR, dl, Cond.getValueType(), Cond, True);
1657 SDValue BrCond = DAG.getNode(ISD::BRCOND, dl,
1658 MVT::Other, getControlRoot(), Cond,
1659 DAG.getBasicBlock(CB.TrueBB));
1661 // Insert the false branch. Do this even if it's a fall through branch,
1662 // this makes it easier to do DAG optimizations which require inverting
1663 // the branch condition.
1664 BrCond = DAG.getNode(ISD::BR, dl, MVT::Other, BrCond,
1665 DAG.getBasicBlock(CB.FalseBB));
1667 DAG.setRoot(BrCond);
1670 /// visitJumpTable - Emit JumpTable node in the current MBB
1671 void SelectionDAGBuilder::visitJumpTable(JumpTable &JT) {
1672 // Emit the code for the jump table
1673 assert(JT.Reg != -1U && "Should lower JT Header first!");
1674 EVT PTy = TLI.getPointerTy();
1675 SDValue Index = DAG.getCopyFromReg(getControlRoot(), getCurDebugLoc(),
1677 SDValue Table = DAG.getJumpTable(JT.JTI, PTy);
1678 SDValue BrJumpTable = DAG.getNode(ISD::BR_JT, getCurDebugLoc(),
1679 MVT::Other, Index.getValue(1),
1681 DAG.setRoot(BrJumpTable);
1684 /// visitJumpTableHeader - This function emits necessary code to produce index
1685 /// in the JumpTable from switch case.
1686 void SelectionDAGBuilder::visitJumpTableHeader(JumpTable &JT,
1687 JumpTableHeader &JTH,
1688 MachineBasicBlock *SwitchBB) {
1689 // Subtract the lowest switch case value from the value being switched on and
1690 // conditional branch to default mbb if the result is greater than the
1691 // difference between smallest and largest cases.
1692 SDValue SwitchOp = getValue(JTH.SValue);
1693 EVT VT = SwitchOp.getValueType();
1694 SDValue Sub = DAG.getNode(ISD::SUB, getCurDebugLoc(), VT, SwitchOp,
1695 DAG.getConstant(JTH.First, VT));
1697 // The SDNode we just created, which holds the value being switched on minus
1698 // the smallest case value, needs to be copied to a virtual register so it
1699 // can be used as an index into the jump table in a subsequent basic block.
1700 // This value may be smaller or larger than the target's pointer type, and
1701 // therefore require extension or truncating.
1702 SwitchOp = DAG.getZExtOrTrunc(Sub, getCurDebugLoc(), TLI.getPointerTy());
1704 unsigned JumpTableReg = FuncInfo.CreateReg(TLI.getPointerTy());
1705 SDValue CopyTo = DAG.getCopyToReg(getControlRoot(), getCurDebugLoc(),
1706 JumpTableReg, SwitchOp);
1707 JT.Reg = JumpTableReg;
1709 // Emit the range check for the jump table, and branch to the default block
1710 // for the switch statement if the value being switched on exceeds the largest
1711 // case in the switch.
1712 SDValue CMP = DAG.getSetCC(getCurDebugLoc(),
1713 TLI.getSetCCResultType(Sub.getValueType()), Sub,
1714 DAG.getConstant(JTH.Last-JTH.First,VT),
1717 // Set NextBlock to be the MBB immediately after the current one, if any.
1718 // This is used to avoid emitting unnecessary branches to the next block.
1719 MachineBasicBlock *NextBlock = 0;
1720 MachineFunction::iterator BBI = SwitchBB;
1722 if (++BBI != FuncInfo.MF->end())
1725 SDValue BrCond = DAG.getNode(ISD::BRCOND, getCurDebugLoc(),
1726 MVT::Other, CopyTo, CMP,
1727 DAG.getBasicBlock(JT.Default));
1729 if (JT.MBB != NextBlock)
1730 BrCond = DAG.getNode(ISD::BR, getCurDebugLoc(), MVT::Other, BrCond,
1731 DAG.getBasicBlock(JT.MBB));
1733 DAG.setRoot(BrCond);
1736 /// visitBitTestHeader - This function emits necessary code to produce value
1737 /// suitable for "bit tests"
1738 void SelectionDAGBuilder::visitBitTestHeader(BitTestBlock &B,
1739 MachineBasicBlock *SwitchBB) {
1740 // Subtract the minimum value
1741 SDValue SwitchOp = getValue(B.SValue);
1742 EVT VT = SwitchOp.getValueType();
1743 SDValue Sub = DAG.getNode(ISD::SUB, getCurDebugLoc(), VT, SwitchOp,
1744 DAG.getConstant(B.First, VT));
1747 SDValue RangeCmp = DAG.getSetCC(getCurDebugLoc(),
1748 TLI.getSetCCResultType(Sub.getValueType()),
1749 Sub, DAG.getConstant(B.Range, VT),
1752 // Determine the type of the test operands.
1753 bool UsePtrType = false;
1754 if (!TLI.isTypeLegal(VT))
1757 for (unsigned i = 0, e = B.Cases.size(); i != e; ++i)
1758 if (!isUIntN(VT.getSizeInBits(), B.Cases[i].Mask)) {
1759 // Switch table case range are encoded into series of masks.
1760 // Just use pointer type, it's guaranteed to fit.
1766 VT = TLI.getPointerTy();
1767 Sub = DAG.getZExtOrTrunc(Sub, getCurDebugLoc(), VT);
1770 B.RegVT = VT.getSimpleVT();
1771 B.Reg = FuncInfo.CreateReg(B.RegVT);
1772 SDValue CopyTo = DAG.getCopyToReg(getControlRoot(), getCurDebugLoc(),
1775 // Set NextBlock to be the MBB immediately after the current one, if any.
1776 // This is used to avoid emitting unnecessary branches to the next block.
1777 MachineBasicBlock *NextBlock = 0;
1778 MachineFunction::iterator BBI = SwitchBB;
1779 if (++BBI != FuncInfo.MF->end())
1782 MachineBasicBlock* MBB = B.Cases[0].ThisBB;
1784 addSuccessorWithWeight(SwitchBB, B.Default);
1785 addSuccessorWithWeight(SwitchBB, MBB);
1787 SDValue BrRange = DAG.getNode(ISD::BRCOND, getCurDebugLoc(),
1788 MVT::Other, CopyTo, RangeCmp,
1789 DAG.getBasicBlock(B.Default));
1791 if (MBB != NextBlock)
1792 BrRange = DAG.getNode(ISD::BR, getCurDebugLoc(), MVT::Other, CopyTo,
1793 DAG.getBasicBlock(MBB));
1795 DAG.setRoot(BrRange);
1798 /// visitBitTestCase - this function produces one "bit test"
1799 void SelectionDAGBuilder::visitBitTestCase(BitTestBlock &BB,
1800 MachineBasicBlock* NextMBB,
1801 uint32_t BranchWeightToNext,
1804 MachineBasicBlock *SwitchBB) {
1806 SDValue ShiftOp = DAG.getCopyFromReg(getControlRoot(), getCurDebugLoc(),
1809 unsigned PopCount = CountPopulation_64(B.Mask);
1810 if (PopCount == 1) {
1811 // Testing for a single bit; just compare the shift count with what it
1812 // would need to be to shift a 1 bit in that position.
1813 Cmp = DAG.getSetCC(getCurDebugLoc(),
1814 TLI.getSetCCResultType(VT),
1816 DAG.getConstant(CountTrailingZeros_64(B.Mask), VT),
1818 } else if (PopCount == BB.Range) {
1819 // There is only one zero bit in the range, test for it directly.
1820 Cmp = DAG.getSetCC(getCurDebugLoc(),
1821 TLI.getSetCCResultType(VT),
1823 DAG.getConstant(CountTrailingOnes_64(B.Mask), VT),
1826 // Make desired shift
1827 SDValue SwitchVal = DAG.getNode(ISD::SHL, getCurDebugLoc(), VT,
1828 DAG.getConstant(1, VT), ShiftOp);
1830 // Emit bit tests and jumps
1831 SDValue AndOp = DAG.getNode(ISD::AND, getCurDebugLoc(),
1832 VT, SwitchVal, DAG.getConstant(B.Mask, VT));
1833 Cmp = DAG.getSetCC(getCurDebugLoc(),
1834 TLI.getSetCCResultType(VT),
1835 AndOp, DAG.getConstant(0, VT),
1839 // The branch weight from SwitchBB to B.TargetBB is B.ExtraWeight.
1840 addSuccessorWithWeight(SwitchBB, B.TargetBB, B.ExtraWeight);
1841 // The branch weight from SwitchBB to NextMBB is BranchWeightToNext.
1842 addSuccessorWithWeight(SwitchBB, NextMBB, BranchWeightToNext);
1844 SDValue BrAnd = DAG.getNode(ISD::BRCOND, getCurDebugLoc(),
1845 MVT::Other, getControlRoot(),
1846 Cmp, DAG.getBasicBlock(B.TargetBB));
1848 // Set NextBlock to be the MBB immediately after the current one, if any.
1849 // This is used to avoid emitting unnecessary branches to the next block.
1850 MachineBasicBlock *NextBlock = 0;
1851 MachineFunction::iterator BBI = SwitchBB;
1852 if (++BBI != FuncInfo.MF->end())
1855 if (NextMBB != NextBlock)
1856 BrAnd = DAG.getNode(ISD::BR, getCurDebugLoc(), MVT::Other, BrAnd,
1857 DAG.getBasicBlock(NextMBB));
1862 void SelectionDAGBuilder::visitInvoke(const InvokeInst &I) {
1863 MachineBasicBlock *InvokeMBB = FuncInfo.MBB;
1865 // Retrieve successors.
1866 MachineBasicBlock *Return = FuncInfo.MBBMap[I.getSuccessor(0)];
1867 MachineBasicBlock *LandingPad = FuncInfo.MBBMap[I.getSuccessor(1)];
1869 const Value *Callee(I.getCalledValue());
1870 const Function *Fn = dyn_cast<Function>(Callee);
1871 if (isa<InlineAsm>(Callee))
1873 else if (Fn && Fn->isIntrinsic()) {
1874 assert(Fn->getIntrinsicID() == Intrinsic::donothing);
1875 // Ignore invokes to @llvm.donothing: jump directly to the next BB.
1877 LowerCallTo(&I, getValue(Callee), false, LandingPad);
1879 // If the value of the invoke is used outside of its defining block, make it
1880 // available as a virtual register.
1881 CopyToExportRegsIfNeeded(&I);
1883 // Update successor info
1884 addSuccessorWithWeight(InvokeMBB, Return);
1885 addSuccessorWithWeight(InvokeMBB, LandingPad);
1887 // Drop into normal successor.
1888 DAG.setRoot(DAG.getNode(ISD::BR, getCurDebugLoc(),
1889 MVT::Other, getControlRoot(),
1890 DAG.getBasicBlock(Return)));
1893 void SelectionDAGBuilder::visitResume(const ResumeInst &RI) {
1894 llvm_unreachable("SelectionDAGBuilder shouldn't visit resume instructions!");
1897 void SelectionDAGBuilder::visitLandingPad(const LandingPadInst &LP) {
1898 assert(FuncInfo.MBB->isLandingPad() &&
1899 "Call to landingpad not in landing pad!");
1901 MachineBasicBlock *MBB = FuncInfo.MBB;
1902 MachineModuleInfo &MMI = DAG.getMachineFunction().getMMI();
1903 AddLandingPadInfo(LP, MMI, MBB);
1905 // If there aren't registers to copy the values into (e.g., during SjLj
1906 // exceptions), then don't bother to create these DAG nodes.
1907 if (TLI.getExceptionPointerRegister() == 0 &&
1908 TLI.getExceptionSelectorRegister() == 0)
1911 SmallVector<EVT, 2> ValueVTs;
1912 ComputeValueVTs(TLI, LP.getType(), ValueVTs);
1914 // Insert the EXCEPTIONADDR instruction.
1915 assert(FuncInfo.MBB->isLandingPad() &&
1916 "Call to eh.exception not in landing pad!");
1917 SDVTList VTs = DAG.getVTList(TLI.getPointerTy(), MVT::Other);
1919 Ops[0] = DAG.getRoot();
1920 SDValue Op1 = DAG.getNode(ISD::EXCEPTIONADDR, getCurDebugLoc(), VTs, Ops, 1);
1921 SDValue Chain = Op1.getValue(1);
1923 // Insert the EHSELECTION instruction.
1924 VTs = DAG.getVTList(TLI.getPointerTy(), MVT::Other);
1927 SDValue Op2 = DAG.getNode(ISD::EHSELECTION, getCurDebugLoc(), VTs, Ops, 2);
1928 Chain = Op2.getValue(1);
1929 Op2 = DAG.getSExtOrTrunc(Op2, getCurDebugLoc(), MVT::i32);
1933 SDValue Res = DAG.getNode(ISD::MERGE_VALUES, getCurDebugLoc(),
1934 DAG.getVTList(&ValueVTs[0], ValueVTs.size()),
1937 std::pair<SDValue, SDValue> RetPair = std::make_pair(Res, Chain);
1938 setValue(&LP, RetPair.first);
1939 DAG.setRoot(RetPair.second);
1942 /// handleSmallSwitchCaseRange - Emit a series of specific tests (suitable for
1943 /// small case ranges).
1944 bool SelectionDAGBuilder::handleSmallSwitchRange(CaseRec& CR,
1945 CaseRecVector& WorkList,
1947 MachineBasicBlock *Default,
1948 MachineBasicBlock *SwitchBB) {
1949 // Size is the number of Cases represented by this range.
1950 size_t Size = CR.Range.second - CR.Range.first;
1954 // Get the MachineFunction which holds the current MBB. This is used when
1955 // inserting any additional MBBs necessary to represent the switch.
1956 MachineFunction *CurMF = FuncInfo.MF;
1958 // Figure out which block is immediately after the current one.
1959 MachineBasicBlock *NextBlock = 0;
1960 MachineFunction::iterator BBI = CR.CaseBB;
1962 if (++BBI != FuncInfo.MF->end())
1965 BranchProbabilityInfo *BPI = FuncInfo.BPI;
1966 // If any two of the cases has the same destination, and if one value
1967 // is the same as the other, but has one bit unset that the other has set,
1968 // use bit manipulation to do two compares at once. For example:
1969 // "if (X == 6 || X == 4)" -> "if ((X|2) == 6)"
1970 // TODO: This could be extended to merge any 2 cases in switches with 3 cases.
1971 // TODO: Handle cases where CR.CaseBB != SwitchBB.
1972 if (Size == 2 && CR.CaseBB == SwitchBB) {
1973 Case &Small = *CR.Range.first;
1974 Case &Big = *(CR.Range.second-1);
1976 if (Small.Low == Small.High && Big.Low == Big.High && Small.BB == Big.BB) {
1977 const APInt& SmallValue = cast<ConstantInt>(Small.Low)->getValue();
1978 const APInt& BigValue = cast<ConstantInt>(Big.Low)->getValue();
1980 // Check that there is only one bit different.
1981 if (BigValue.countPopulation() == SmallValue.countPopulation() + 1 &&
1982 (SmallValue | BigValue) == BigValue) {
1983 // Isolate the common bit.
1984 APInt CommonBit = BigValue & ~SmallValue;
1985 assert((SmallValue | CommonBit) == BigValue &&
1986 CommonBit.countPopulation() == 1 && "Not a common bit?");
1988 SDValue CondLHS = getValue(SV);
1989 EVT VT = CondLHS.getValueType();
1990 DebugLoc DL = getCurDebugLoc();
1992 SDValue Or = DAG.getNode(ISD::OR, DL, VT, CondLHS,
1993 DAG.getConstant(CommonBit, VT));
1994 SDValue Cond = DAG.getSetCC(DL, MVT::i1,
1995 Or, DAG.getConstant(BigValue, VT),
1998 // Update successor info.
1999 // Both Small and Big will jump to Small.BB, so we sum up the weights.
2000 addSuccessorWithWeight(SwitchBB, Small.BB,
2001 Small.ExtraWeight + Big.ExtraWeight);
2002 addSuccessorWithWeight(SwitchBB, Default,
2003 // The default destination is the first successor in IR.
2004 BPI ? BPI->getEdgeWeight(SwitchBB->getBasicBlock(), (unsigned)0) : 0);
2006 // Insert the true branch.
2007 SDValue BrCond = DAG.getNode(ISD::BRCOND, DL, MVT::Other,
2008 getControlRoot(), Cond,
2009 DAG.getBasicBlock(Small.BB));
2011 // Insert the false branch.
2012 BrCond = DAG.getNode(ISD::BR, DL, MVT::Other, BrCond,
2013 DAG.getBasicBlock(Default));
2015 DAG.setRoot(BrCond);
2021 // Order cases by weight so the most likely case will be checked first.
2022 uint32_t UnhandledWeights = 0;
2024 for (CaseItr I = CR.Range.first, IE = CR.Range.second; I != IE; ++I) {
2025 uint32_t IWeight = I->ExtraWeight;
2026 UnhandledWeights += IWeight;
2027 for (CaseItr J = CR.Range.first; J < I; ++J) {
2028 uint32_t JWeight = J->ExtraWeight;
2029 if (IWeight > JWeight)
2034 // Rearrange the case blocks so that the last one falls through if possible.
2035 Case &BackCase = *(CR.Range.second-1);
2037 NextBlock && Default != NextBlock && BackCase.BB != NextBlock) {
2038 // The last case block won't fall through into 'NextBlock' if we emit the
2039 // branches in this order. See if rearranging a case value would help.
2040 // We start at the bottom as it's the case with the least weight.
2041 for (Case *I = &*(CR.Range.second-2), *E = &*CR.Range.first-1; I != E; --I){
2042 if (I->BB == NextBlock) {
2043 std::swap(*I, BackCase);
2049 // Create a CaseBlock record representing a conditional branch to
2050 // the Case's target mbb if the value being switched on SV is equal
2052 MachineBasicBlock *CurBlock = CR.CaseBB;
2053 for (CaseItr I = CR.Range.first, E = CR.Range.second; I != E; ++I) {
2054 MachineBasicBlock *FallThrough;
2056 FallThrough = CurMF->CreateMachineBasicBlock(CurBlock->getBasicBlock());
2057 CurMF->insert(BBI, FallThrough);
2059 // Put SV in a virtual register to make it available from the new blocks.
2060 ExportFromCurrentBlock(SV);
2062 // If the last case doesn't match, go to the default block.
2063 FallThrough = Default;
2066 const Value *RHS, *LHS, *MHS;
2068 if (I->High == I->Low) {
2069 // This is just small small case range :) containing exactly 1 case
2071 LHS = SV; RHS = I->High; MHS = NULL;
2073 CC = ISD::SETCC_INVALID;
2074 LHS = I->Low; MHS = SV; RHS = I->High;
2077 // The false weight should be sum of all un-handled cases.
2078 UnhandledWeights -= I->ExtraWeight;
2079 CaseBlock CB(CC, LHS, RHS, MHS, /* truebb */ I->BB, /* falsebb */ FallThrough,
2081 /* trueweight */ I->ExtraWeight,
2082 /* falseweight */ UnhandledWeights);
2084 // If emitting the first comparison, just call visitSwitchCase to emit the
2085 // code into the current block. Otherwise, push the CaseBlock onto the
2086 // vector to be later processed by SDISel, and insert the node's MBB
2087 // before the next MBB.
2088 if (CurBlock == SwitchBB)
2089 visitSwitchCase(CB, SwitchBB);
2091 SwitchCases.push_back(CB);
2093 CurBlock = FallThrough;
2099 static inline bool areJTsAllowed(const TargetLowering &TLI) {
2100 return TLI.supportJumpTables() &&
2101 (TLI.isOperationLegalOrCustom(ISD::BR_JT, MVT::Other) ||
2102 TLI.isOperationLegalOrCustom(ISD::BRIND, MVT::Other));
2105 static APInt ComputeRange(const APInt &First, const APInt &Last) {
2106 uint32_t BitWidth = std::max(Last.getBitWidth(), First.getBitWidth()) + 1;
2107 APInt LastExt = Last.zext(BitWidth), FirstExt = First.zext(BitWidth);
2108 return (LastExt - FirstExt + 1ULL);
2111 /// handleJTSwitchCase - Emit jumptable for current switch case range
2112 bool SelectionDAGBuilder::handleJTSwitchCase(CaseRec &CR,
2113 CaseRecVector &WorkList,
2115 MachineBasicBlock *Default,
2116 MachineBasicBlock *SwitchBB) {
2117 Case& FrontCase = *CR.Range.first;
2118 Case& BackCase = *(CR.Range.second-1);
2120 const APInt &First = cast<ConstantInt>(FrontCase.Low)->getValue();
2121 const APInt &Last = cast<ConstantInt>(BackCase.High)->getValue();
2123 APInt TSize(First.getBitWidth(), 0);
2124 for (CaseItr I = CR.Range.first, E = CR.Range.second; I != E; ++I)
2127 if (!areJTsAllowed(TLI) || TSize.ult(TLI.getMinimumJumpTableEntries()))
2130 APInt Range = ComputeRange(First, Last);
2131 // The density is TSize / Range. Require at least 40%.
2132 // It should not be possible for IntTSize to saturate for sane code, but make
2133 // sure we handle Range saturation correctly.
2134 uint64_t IntRange = Range.getLimitedValue(UINT64_MAX/10);
2135 uint64_t IntTSize = TSize.getLimitedValue(UINT64_MAX/10);
2136 if (IntTSize * 10 < IntRange * 4)
2139 DEBUG(dbgs() << "Lowering jump table\n"
2140 << "First entry: " << First << ". Last entry: " << Last << '\n'
2141 << "Range: " << Range << ". Size: " << TSize << ".\n\n");
2143 // Get the MachineFunction which holds the current MBB. This is used when
2144 // inserting any additional MBBs necessary to represent the switch.
2145 MachineFunction *CurMF = FuncInfo.MF;
2147 // Figure out which block is immediately after the current one.
2148 MachineFunction::iterator BBI = CR.CaseBB;
2151 const BasicBlock *LLVMBB = CR.CaseBB->getBasicBlock();
2153 // Create a new basic block to hold the code for loading the address
2154 // of the jump table, and jumping to it. Update successor information;
2155 // we will either branch to the default case for the switch, or the jump
2157 MachineBasicBlock *JumpTableBB = CurMF->CreateMachineBasicBlock(LLVMBB);
2158 CurMF->insert(BBI, JumpTableBB);
2160 addSuccessorWithWeight(CR.CaseBB, Default);
2161 addSuccessorWithWeight(CR.CaseBB, JumpTableBB);
2163 // Build a vector of destination BBs, corresponding to each target
2164 // of the jump table. If the value of the jump table slot corresponds to
2165 // a case statement, push the case's BB onto the vector, otherwise, push
2167 std::vector<MachineBasicBlock*> DestBBs;
2169 for (CaseItr I = CR.Range.first, E = CR.Range.second; I != E; ++TEI) {
2170 const APInt &Low = cast<ConstantInt>(I->Low)->getValue();
2171 const APInt &High = cast<ConstantInt>(I->High)->getValue();
2173 if (Low.ule(TEI) && TEI.ule(High)) {
2174 DestBBs.push_back(I->BB);
2178 DestBBs.push_back(Default);
2182 // Calculate weight for each unique destination in CR.
2183 DenseMap<MachineBasicBlock*, uint32_t> DestWeights;
2185 for (CaseItr I = CR.Range.first, E = CR.Range.second; I != E; ++I) {
2186 DenseMap<MachineBasicBlock*, uint32_t>::iterator Itr =
2187 DestWeights.find(I->BB);
2188 if (Itr != DestWeights.end())
2189 Itr->second += I->ExtraWeight;
2191 DestWeights[I->BB] = I->ExtraWeight;
2194 // Update successor info. Add one edge to each unique successor.
2195 BitVector SuccsHandled(CR.CaseBB->getParent()->getNumBlockIDs());
2196 for (std::vector<MachineBasicBlock*>::iterator I = DestBBs.begin(),
2197 E = DestBBs.end(); I != E; ++I) {
2198 if (!SuccsHandled[(*I)->getNumber()]) {
2199 SuccsHandled[(*I)->getNumber()] = true;
2200 DenseMap<MachineBasicBlock*, uint32_t>::iterator Itr =
2201 DestWeights.find(*I);
2202 addSuccessorWithWeight(JumpTableBB, *I,
2203 Itr != DestWeights.end() ? Itr->second : 0);
2207 // Create a jump table index for this jump table.
2208 unsigned JTEncoding = TLI.getJumpTableEncoding();
2209 unsigned JTI = CurMF->getOrCreateJumpTableInfo(JTEncoding)
2210 ->createJumpTableIndex(DestBBs);
2212 // Set the jump table information so that we can codegen it as a second
2213 // MachineBasicBlock
2214 JumpTable JT(-1U, JTI, JumpTableBB, Default);
2215 JumpTableHeader JTH(First, Last, SV, CR.CaseBB, (CR.CaseBB == SwitchBB));
2216 if (CR.CaseBB == SwitchBB)
2217 visitJumpTableHeader(JT, JTH, SwitchBB);
2219 JTCases.push_back(JumpTableBlock(JTH, JT));
2223 /// handleBTSplitSwitchCase - emit comparison and split binary search tree into
2225 bool SelectionDAGBuilder::handleBTSplitSwitchCase(CaseRec& CR,
2226 CaseRecVector& WorkList,
2228 MachineBasicBlock *Default,
2229 MachineBasicBlock *SwitchBB) {
2230 // Get the MachineFunction which holds the current MBB. This is used when
2231 // inserting any additional MBBs necessary to represent the switch.
2232 MachineFunction *CurMF = FuncInfo.MF;
2234 // Figure out which block is immediately after the current one.
2235 MachineFunction::iterator BBI = CR.CaseBB;
2238 Case& FrontCase = *CR.Range.first;
2239 Case& BackCase = *(CR.Range.second-1);
2240 const BasicBlock *LLVMBB = CR.CaseBB->getBasicBlock();
2242 // Size is the number of Cases represented by this range.
2243 unsigned Size = CR.Range.second - CR.Range.first;
2245 const APInt &First = cast<ConstantInt>(FrontCase.Low)->getValue();
2246 const APInt &Last = cast<ConstantInt>(BackCase.High)->getValue();
2248 CaseItr Pivot = CR.Range.first + Size/2;
2250 // Select optimal pivot, maximizing sum density of LHS and RHS. This will
2251 // (heuristically) allow us to emit JumpTable's later.
2252 APInt TSize(First.getBitWidth(), 0);
2253 for (CaseItr I = CR.Range.first, E = CR.Range.second;
2257 APInt LSize = FrontCase.size();
2258 APInt RSize = TSize-LSize;
2259 DEBUG(dbgs() << "Selecting best pivot: \n"
2260 << "First: " << First << ", Last: " << Last <<'\n'
2261 << "LSize: " << LSize << ", RSize: " << RSize << '\n');
2262 for (CaseItr I = CR.Range.first, J=I+1, E = CR.Range.second;
2264 const APInt &LEnd = cast<ConstantInt>(I->High)->getValue();
2265 const APInt &RBegin = cast<ConstantInt>(J->Low)->getValue();
2266 APInt Range = ComputeRange(LEnd, RBegin);
2267 assert((Range - 2ULL).isNonNegative() &&
2268 "Invalid case distance");
2269 // Use volatile double here to avoid excess precision issues on some hosts,
2270 // e.g. that use 80-bit X87 registers.
2271 volatile double LDensity =
2272 (double)LSize.roundToDouble() /
2273 (LEnd - First + 1ULL).roundToDouble();
2274 volatile double RDensity =
2275 (double)RSize.roundToDouble() /
2276 (Last - RBegin + 1ULL).roundToDouble();
2277 double Metric = Range.logBase2()*(LDensity+RDensity);
2278 // Should always split in some non-trivial place
2279 DEBUG(dbgs() <<"=>Step\n"
2280 << "LEnd: " << LEnd << ", RBegin: " << RBegin << '\n'
2281 << "LDensity: " << LDensity
2282 << ", RDensity: " << RDensity << '\n'
2283 << "Metric: " << Metric << '\n');
2284 if (FMetric < Metric) {
2287 DEBUG(dbgs() << "Current metric set to: " << FMetric << '\n');
2293 if (areJTsAllowed(TLI)) {
2294 // If our case is dense we *really* should handle it earlier!
2295 assert((FMetric > 0) && "Should handle dense range earlier!");
2297 Pivot = CR.Range.first + Size/2;
2300 CaseRange LHSR(CR.Range.first, Pivot);
2301 CaseRange RHSR(Pivot, CR.Range.second);
2302 const Constant *C = Pivot->Low;
2303 MachineBasicBlock *FalseBB = 0, *TrueBB = 0;
2305 // We know that we branch to the LHS if the Value being switched on is
2306 // less than the Pivot value, C. We use this to optimize our binary
2307 // tree a bit, by recognizing that if SV is greater than or equal to the
2308 // LHS's Case Value, and that Case Value is exactly one less than the
2309 // Pivot's Value, then we can branch directly to the LHS's Target,
2310 // rather than creating a leaf node for it.
2311 if ((LHSR.second - LHSR.first) == 1 &&
2312 LHSR.first->High == CR.GE &&
2313 cast<ConstantInt>(C)->getValue() ==
2314 (cast<ConstantInt>(CR.GE)->getValue() + 1LL)) {
2315 TrueBB = LHSR.first->BB;
2317 TrueBB = CurMF->CreateMachineBasicBlock(LLVMBB);
2318 CurMF->insert(BBI, TrueBB);
2319 WorkList.push_back(CaseRec(TrueBB, C, CR.GE, LHSR));
2321 // Put SV in a virtual register to make it available from the new blocks.
2322 ExportFromCurrentBlock(SV);
2325 // Similar to the optimization above, if the Value being switched on is
2326 // known to be less than the Constant CR.LT, and the current Case Value
2327 // is CR.LT - 1, then we can branch directly to the target block for
2328 // the current Case Value, rather than emitting a RHS leaf node for it.
2329 if ((RHSR.second - RHSR.first) == 1 && CR.LT &&
2330 cast<ConstantInt>(RHSR.first->Low)->getValue() ==
2331 (cast<ConstantInt>(CR.LT)->getValue() - 1LL)) {
2332 FalseBB = RHSR.first->BB;
2334 FalseBB = CurMF->CreateMachineBasicBlock(LLVMBB);
2335 CurMF->insert(BBI, FalseBB);
2336 WorkList.push_back(CaseRec(FalseBB,CR.LT,C,RHSR));
2338 // Put SV in a virtual register to make it available from the new blocks.
2339 ExportFromCurrentBlock(SV);
2342 // Create a CaseBlock record representing a conditional branch to
2343 // the LHS node if the value being switched on SV is less than C.
2344 // Otherwise, branch to LHS.
2345 CaseBlock CB(ISD::SETULT, SV, C, NULL, TrueBB, FalseBB, CR.CaseBB);
2347 if (CR.CaseBB == SwitchBB)
2348 visitSwitchCase(CB, SwitchBB);
2350 SwitchCases.push_back(CB);
2355 /// handleBitTestsSwitchCase - if current case range has few destination and
2356 /// range span less, than machine word bitwidth, encode case range into series
2357 /// of masks and emit bit tests with these masks.
2358 bool SelectionDAGBuilder::handleBitTestsSwitchCase(CaseRec& CR,
2359 CaseRecVector& WorkList,
2361 MachineBasicBlock* Default,
2362 MachineBasicBlock *SwitchBB){
2363 EVT PTy = TLI.getPointerTy();
2364 unsigned IntPtrBits = PTy.getSizeInBits();
2366 Case& FrontCase = *CR.Range.first;
2367 Case& BackCase = *(CR.Range.second-1);
2369 // Get the MachineFunction which holds the current MBB. This is used when
2370 // inserting any additional MBBs necessary to represent the switch.
2371 MachineFunction *CurMF = FuncInfo.MF;
2373 // If target does not have legal shift left, do not emit bit tests at all.
2374 if (!TLI.isOperationLegal(ISD::SHL, TLI.getPointerTy()))
2378 for (CaseItr I = CR.Range.first, E = CR.Range.second;
2380 // Single case counts one, case range - two.
2381 numCmps += (I->Low == I->High ? 1 : 2);
2384 // Count unique destinations
2385 SmallSet<MachineBasicBlock*, 4> Dests;
2386 for (CaseItr I = CR.Range.first, E = CR.Range.second; I!=E; ++I) {
2387 Dests.insert(I->BB);
2388 if (Dests.size() > 3)
2389 // Don't bother the code below, if there are too much unique destinations
2392 DEBUG(dbgs() << "Total number of unique destinations: "
2393 << Dests.size() << '\n'
2394 << "Total number of comparisons: " << numCmps << '\n');
2396 // Compute span of values.
2397 const APInt& minValue = cast<ConstantInt>(FrontCase.Low)->getValue();
2398 const APInt& maxValue = cast<ConstantInt>(BackCase.High)->getValue();
2399 APInt cmpRange = maxValue - minValue;
2401 DEBUG(dbgs() << "Compare range: " << cmpRange << '\n'
2402 << "Low bound: " << minValue << '\n'
2403 << "High bound: " << maxValue << '\n');
2405 if (cmpRange.uge(IntPtrBits) ||
2406 (!(Dests.size() == 1 && numCmps >= 3) &&
2407 !(Dests.size() == 2 && numCmps >= 5) &&
2408 !(Dests.size() >= 3 && numCmps >= 6)))
2411 DEBUG(dbgs() << "Emitting bit tests\n");
2412 APInt lowBound = APInt::getNullValue(cmpRange.getBitWidth());
2414 // Optimize the case where all the case values fit in a
2415 // word without having to subtract minValue. In this case,
2416 // we can optimize away the subtraction.
2417 if (maxValue.ult(IntPtrBits)) {
2418 cmpRange = maxValue;
2420 lowBound = minValue;
2423 CaseBitsVector CasesBits;
2424 unsigned i, count = 0;
2426 for (CaseItr I = CR.Range.first, E = CR.Range.second; I!=E; ++I) {
2427 MachineBasicBlock* Dest = I->BB;
2428 for (i = 0; i < count; ++i)
2429 if (Dest == CasesBits[i].BB)
2433 assert((count < 3) && "Too much destinations to test!");
2434 CasesBits.push_back(CaseBits(0, Dest, 0, 0/*Weight*/));
2438 const APInt& lowValue = cast<ConstantInt>(I->Low)->getValue();
2439 const APInt& highValue = cast<ConstantInt>(I->High)->getValue();
2441 uint64_t lo = (lowValue - lowBound).getZExtValue();
2442 uint64_t hi = (highValue - lowBound).getZExtValue();
2443 CasesBits[i].ExtraWeight += I->ExtraWeight;
2445 for (uint64_t j = lo; j <= hi; j++) {
2446 CasesBits[i].Mask |= 1ULL << j;
2447 CasesBits[i].Bits++;
2451 std::sort(CasesBits.begin(), CasesBits.end(), CaseBitsCmp());
2455 // Figure out which block is immediately after the current one.
2456 MachineFunction::iterator BBI = CR.CaseBB;
2459 const BasicBlock *LLVMBB = CR.CaseBB->getBasicBlock();
2461 DEBUG(dbgs() << "Cases:\n");
2462 for (unsigned i = 0, e = CasesBits.size(); i!=e; ++i) {
2463 DEBUG(dbgs() << "Mask: " << CasesBits[i].Mask
2464 << ", Bits: " << CasesBits[i].Bits
2465 << ", BB: " << CasesBits[i].BB << '\n');
2467 MachineBasicBlock *CaseBB = CurMF->CreateMachineBasicBlock(LLVMBB);
2468 CurMF->insert(BBI, CaseBB);
2469 BTC.push_back(BitTestCase(CasesBits[i].Mask,
2471 CasesBits[i].BB, CasesBits[i].ExtraWeight));
2473 // Put SV in a virtual register to make it available from the new blocks.
2474 ExportFromCurrentBlock(SV);
2477 BitTestBlock BTB(lowBound, cmpRange, SV,
2478 -1U, MVT::Other, (CR.CaseBB == SwitchBB),
2479 CR.CaseBB, Default, BTC);
2481 if (CR.CaseBB == SwitchBB)
2482 visitBitTestHeader(BTB, SwitchBB);
2484 BitTestCases.push_back(BTB);
2489 /// Clusterify - Transform simple list of Cases into list of CaseRange's
2490 size_t SelectionDAGBuilder::Clusterify(CaseVector& Cases,
2491 const SwitchInst& SI) {
2493 /// Use a shorter form of declaration, and also
2494 /// show the we want to use CRSBuilder as Clusterifier.
2495 typedef IntegersSubsetMapping<MachineBasicBlock> Clusterifier;
2497 Clusterifier TheClusterifier;
2499 BranchProbabilityInfo *BPI = FuncInfo.BPI;
2500 // Start with "simple" cases
2501 for (SwitchInst::ConstCaseIt i = SI.case_begin(), e = SI.case_end();
2503 const BasicBlock *SuccBB = i.getCaseSuccessor();
2504 MachineBasicBlock *SMBB = FuncInfo.MBBMap[SuccBB];
2506 TheClusterifier.add(i.getCaseValueEx(), SMBB,
2507 BPI ? BPI->getEdgeWeight(SI.getParent(), i.getSuccessorIndex()) : 0);
2510 TheClusterifier.optimize();
2513 for (Clusterifier::RangeIterator i = TheClusterifier.begin(),
2514 e = TheClusterifier.end(); i != e; ++i, ++numCmps) {
2515 Clusterifier::Cluster &C = *i;
2516 // Update edge weight for the cluster.
2517 unsigned W = C.first.Weight;
2519 // FIXME: Currently work with ConstantInt based numbers.
2520 // Changing it to APInt based is a pretty heavy for this commit.
2521 Cases.push_back(Case(C.first.getLow().toConstantInt(),
2522 C.first.getHigh().toConstantInt(), C.second, W));
2524 if (C.first.getLow() != C.first.getHigh())
2525 // A range counts double, since it requires two compares.
2532 void SelectionDAGBuilder::UpdateSplitBlock(MachineBasicBlock *First,
2533 MachineBasicBlock *Last) {
2535 for (unsigned i = 0, e = JTCases.size(); i != e; ++i)
2536 if (JTCases[i].first.HeaderBB == First)
2537 JTCases[i].first.HeaderBB = Last;
2539 // Update BitTestCases.
2540 for (unsigned i = 0, e = BitTestCases.size(); i != e; ++i)
2541 if (BitTestCases[i].Parent == First)
2542 BitTestCases[i].Parent = Last;
2545 void SelectionDAGBuilder::visitSwitch(const SwitchInst &SI) {
2546 MachineBasicBlock *SwitchMBB = FuncInfo.MBB;
2548 // Figure out which block is immediately after the current one.
2549 MachineBasicBlock *NextBlock = 0;
2550 MachineBasicBlock *Default = FuncInfo.MBBMap[SI.getDefaultDest()];
2552 // If there is only the default destination, branch to it if it is not the
2553 // next basic block. Otherwise, just fall through.
2554 if (!SI.getNumCases()) {
2555 // Update machine-CFG edges.
2557 // If this is not a fall-through branch, emit the branch.
2558 SwitchMBB->addSuccessor(Default);
2559 if (Default != NextBlock)
2560 DAG.setRoot(DAG.getNode(ISD::BR, getCurDebugLoc(),
2561 MVT::Other, getControlRoot(),
2562 DAG.getBasicBlock(Default)));
2567 // If there are any non-default case statements, create a vector of Cases
2568 // representing each one, and sort the vector so that we can efficiently
2569 // create a binary search tree from them.
2571 size_t numCmps = Clusterify(Cases, SI);
2572 DEBUG(dbgs() << "Clusterify finished. Total clusters: " << Cases.size()
2573 << ". Total compares: " << numCmps << '\n');
2576 // Get the Value to be switched on and default basic blocks, which will be
2577 // inserted into CaseBlock records, representing basic blocks in the binary
2579 const Value *SV = SI.getCondition();
2581 // Push the initial CaseRec onto the worklist
2582 CaseRecVector WorkList;
2583 WorkList.push_back(CaseRec(SwitchMBB,0,0,
2584 CaseRange(Cases.begin(),Cases.end())));
2586 while (!WorkList.empty()) {
2587 // Grab a record representing a case range to process off the worklist
2588 CaseRec CR = WorkList.back();
2589 WorkList.pop_back();
2591 if (handleBitTestsSwitchCase(CR, WorkList, SV, Default, SwitchMBB))
2594 // If the range has few cases (two or less) emit a series of specific
2596 if (handleSmallSwitchRange(CR, WorkList, SV, Default, SwitchMBB))
2599 // If the switch has more than N blocks, and is at least 40% dense, and the
2600 // target supports indirect branches, then emit a jump table rather than
2601 // lowering the switch to a binary tree of conditional branches.
2602 // N defaults to 4 and is controlled via TLS.getMinimumJumpTableEntries().
2603 if (handleJTSwitchCase(CR, WorkList, SV, Default, SwitchMBB))
2606 // Emit binary tree. We need to pick a pivot, and push left and right ranges
2607 // onto the worklist. Leafs are handled via handleSmallSwitchRange() call.
2608 handleBTSplitSwitchCase(CR, WorkList, SV, Default, SwitchMBB);
2612 void SelectionDAGBuilder::visitIndirectBr(const IndirectBrInst &I) {
2613 MachineBasicBlock *IndirectBrMBB = FuncInfo.MBB;
2615 // Update machine-CFG edges with unique successors.
2616 SmallSet<BasicBlock*, 32> Done;
2617 for (unsigned i = 0, e = I.getNumSuccessors(); i != e; ++i) {
2618 BasicBlock *BB = I.getSuccessor(i);
2619 bool Inserted = Done.insert(BB);
2623 MachineBasicBlock *Succ = FuncInfo.MBBMap[BB];
2624 addSuccessorWithWeight(IndirectBrMBB, Succ);
2627 DAG.setRoot(DAG.getNode(ISD::BRIND, getCurDebugLoc(),
2628 MVT::Other, getControlRoot(),
2629 getValue(I.getAddress())));
2632 void SelectionDAGBuilder::visitFSub(const User &I) {
2633 // -0.0 - X --> fneg
2634 Type *Ty = I.getType();
2635 if (isa<Constant>(I.getOperand(0)) &&
2636 I.getOperand(0) == ConstantFP::getZeroValueForNegation(Ty)) {
2637 SDValue Op2 = getValue(I.getOperand(1));
2638 setValue(&I, DAG.getNode(ISD::FNEG, getCurDebugLoc(),
2639 Op2.getValueType(), Op2));
2643 visitBinary(I, ISD::FSUB);
2646 void SelectionDAGBuilder::visitBinary(const User &I, unsigned OpCode) {
2647 SDValue Op1 = getValue(I.getOperand(0));
2648 SDValue Op2 = getValue(I.getOperand(1));
2649 setValue(&I, DAG.getNode(OpCode, getCurDebugLoc(),
2650 Op1.getValueType(), Op1, Op2));
2653 void SelectionDAGBuilder::visitShift(const User &I, unsigned Opcode) {
2654 SDValue Op1 = getValue(I.getOperand(0));
2655 SDValue Op2 = getValue(I.getOperand(1));
2657 MVT ShiftTy = TLI.getShiftAmountTy(Op2.getValueType());
2659 // Coerce the shift amount to the right type if we can.
2660 if (!I.getType()->isVectorTy() && Op2.getValueType() != ShiftTy) {
2661 unsigned ShiftSize = ShiftTy.getSizeInBits();
2662 unsigned Op2Size = Op2.getValueType().getSizeInBits();
2663 DebugLoc DL = getCurDebugLoc();
2665 // If the operand is smaller than the shift count type, promote it.
2666 if (ShiftSize > Op2Size)
2667 Op2 = DAG.getNode(ISD::ZERO_EXTEND, DL, ShiftTy, Op2);
2669 // If the operand is larger than the shift count type but the shift
2670 // count type has enough bits to represent any shift value, truncate
2671 // it now. This is a common case and it exposes the truncate to
2672 // optimization early.
2673 else if (ShiftSize >= Log2_32_Ceil(Op2.getValueType().getSizeInBits()))
2674 Op2 = DAG.getNode(ISD::TRUNCATE, DL, ShiftTy, Op2);
2675 // Otherwise we'll need to temporarily settle for some other convenient
2676 // type. Type legalization will make adjustments once the shiftee is split.
2678 Op2 = DAG.getZExtOrTrunc(Op2, DL, MVT::i32);
2681 setValue(&I, DAG.getNode(Opcode, getCurDebugLoc(),
2682 Op1.getValueType(), Op1, Op2));
2685 void SelectionDAGBuilder::visitSDiv(const User &I) {
2686 SDValue Op1 = getValue(I.getOperand(0));
2687 SDValue Op2 = getValue(I.getOperand(1));
2689 // Turn exact SDivs into multiplications.
2690 // FIXME: This should be in DAGCombiner, but it doesn't have access to the
2692 if (isa<BinaryOperator>(&I) && cast<BinaryOperator>(&I)->isExact() &&
2693 !isa<ConstantSDNode>(Op1) &&
2694 isa<ConstantSDNode>(Op2) && !cast<ConstantSDNode>(Op2)->isNullValue())
2695 setValue(&I, TLI.BuildExactSDIV(Op1, Op2, getCurDebugLoc(), DAG));
2697 setValue(&I, DAG.getNode(ISD::SDIV, getCurDebugLoc(), Op1.getValueType(),
2701 void SelectionDAGBuilder::visitICmp(const User &I) {
2702 ICmpInst::Predicate predicate = ICmpInst::BAD_ICMP_PREDICATE;
2703 if (const ICmpInst *IC = dyn_cast<ICmpInst>(&I))
2704 predicate = IC->getPredicate();
2705 else if (const ConstantExpr *IC = dyn_cast<ConstantExpr>(&I))
2706 predicate = ICmpInst::Predicate(IC->getPredicate());
2707 SDValue Op1 = getValue(I.getOperand(0));
2708 SDValue Op2 = getValue(I.getOperand(1));
2709 ISD::CondCode Opcode = getICmpCondCode(predicate);
2711 EVT DestVT = TLI.getValueType(I.getType());
2712 setValue(&I, DAG.getSetCC(getCurDebugLoc(), DestVT, Op1, Op2, Opcode));
2715 void SelectionDAGBuilder::visitFCmp(const User &I) {
2716 FCmpInst::Predicate predicate = FCmpInst::BAD_FCMP_PREDICATE;
2717 if (const FCmpInst *FC = dyn_cast<FCmpInst>(&I))
2718 predicate = FC->getPredicate();
2719 else if (const ConstantExpr *FC = dyn_cast<ConstantExpr>(&I))
2720 predicate = FCmpInst::Predicate(FC->getPredicate());
2721 SDValue Op1 = getValue(I.getOperand(0));
2722 SDValue Op2 = getValue(I.getOperand(1));
2723 ISD::CondCode Condition = getFCmpCondCode(predicate);
2724 if (TM.Options.NoNaNsFPMath)
2725 Condition = getFCmpCodeWithoutNaN(Condition);
2726 EVT DestVT = TLI.getValueType(I.getType());
2727 setValue(&I, DAG.getSetCC(getCurDebugLoc(), DestVT, Op1, Op2, Condition));
2730 void SelectionDAGBuilder::visitSelect(const User &I) {
2731 SmallVector<EVT, 4> ValueVTs;
2732 ComputeValueVTs(TLI, I.getType(), ValueVTs);
2733 unsigned NumValues = ValueVTs.size();
2734 if (NumValues == 0) return;
2736 SmallVector<SDValue, 4> Values(NumValues);
2737 SDValue Cond = getValue(I.getOperand(0));
2738 SDValue TrueVal = getValue(I.getOperand(1));
2739 SDValue FalseVal = getValue(I.getOperand(2));
2740 ISD::NodeType OpCode = Cond.getValueType().isVector() ?
2741 ISD::VSELECT : ISD::SELECT;
2743 for (unsigned i = 0; i != NumValues; ++i)
2744 Values[i] = DAG.getNode(OpCode, getCurDebugLoc(),
2745 TrueVal.getNode()->getValueType(TrueVal.getResNo()+i),
2747 SDValue(TrueVal.getNode(),
2748 TrueVal.getResNo() + i),
2749 SDValue(FalseVal.getNode(),
2750 FalseVal.getResNo() + i));
2752 setValue(&I, DAG.getNode(ISD::MERGE_VALUES, getCurDebugLoc(),
2753 DAG.getVTList(&ValueVTs[0], NumValues),
2754 &Values[0], NumValues));
2757 void SelectionDAGBuilder::visitTrunc(const User &I) {
2758 // TruncInst cannot be a no-op cast because sizeof(src) > sizeof(dest).
2759 SDValue N = getValue(I.getOperand(0));
2760 EVT DestVT = TLI.getValueType(I.getType());
2761 setValue(&I, DAG.getNode(ISD::TRUNCATE, getCurDebugLoc(), DestVT, N));
2764 void SelectionDAGBuilder::visitZExt(const User &I) {
2765 // ZExt cannot be a no-op cast because sizeof(src) < sizeof(dest).
2766 // ZExt also can't be a cast to bool for same reason. So, nothing much to do
2767 SDValue N = getValue(I.getOperand(0));
2768 EVT DestVT = TLI.getValueType(I.getType());
2769 setValue(&I, DAG.getNode(ISD::ZERO_EXTEND, getCurDebugLoc(), DestVT, N));
2772 void SelectionDAGBuilder::visitSExt(const User &I) {
2773 // SExt cannot be a no-op cast because sizeof(src) < sizeof(dest).
2774 // SExt also can't be a cast to bool for same reason. So, nothing much to do
2775 SDValue N = getValue(I.getOperand(0));
2776 EVT DestVT = TLI.getValueType(I.getType());
2777 setValue(&I, DAG.getNode(ISD::SIGN_EXTEND, getCurDebugLoc(), DestVT, N));
2780 void SelectionDAGBuilder::visitFPTrunc(const User &I) {
2781 // FPTrunc is never a no-op cast, no need to check
2782 SDValue N = getValue(I.getOperand(0));
2783 EVT DestVT = TLI.getValueType(I.getType());
2784 setValue(&I, DAG.getNode(ISD::FP_ROUND, getCurDebugLoc(),
2786 DAG.getTargetConstant(0, TLI.getPointerTy())));
2789 void SelectionDAGBuilder::visitFPExt(const User &I){
2790 // FPExt is never a no-op cast, no need to check
2791 SDValue N = getValue(I.getOperand(0));
2792 EVT DestVT = TLI.getValueType(I.getType());
2793 setValue(&I, DAG.getNode(ISD::FP_EXTEND, getCurDebugLoc(), DestVT, N));
2796 void SelectionDAGBuilder::visitFPToUI(const User &I) {
2797 // FPToUI is never a no-op cast, no need to check
2798 SDValue N = getValue(I.getOperand(0));
2799 EVT DestVT = TLI.getValueType(I.getType());
2800 setValue(&I, DAG.getNode(ISD::FP_TO_UINT, getCurDebugLoc(), DestVT, N));
2803 void SelectionDAGBuilder::visitFPToSI(const User &I) {
2804 // FPToSI is never a no-op cast, no need to check
2805 SDValue N = getValue(I.getOperand(0));
2806 EVT DestVT = TLI.getValueType(I.getType());
2807 setValue(&I, DAG.getNode(ISD::FP_TO_SINT, getCurDebugLoc(), DestVT, N));
2810 void SelectionDAGBuilder::visitUIToFP(const User &I) {
2811 // UIToFP is never a no-op cast, no need to check
2812 SDValue N = getValue(I.getOperand(0));
2813 EVT DestVT = TLI.getValueType(I.getType());
2814 setValue(&I, DAG.getNode(ISD::UINT_TO_FP, getCurDebugLoc(), DestVT, N));
2817 void SelectionDAGBuilder::visitSIToFP(const User &I){
2818 // SIToFP is never a no-op cast, no need to check
2819 SDValue N = getValue(I.getOperand(0));
2820 EVT DestVT = TLI.getValueType(I.getType());
2821 setValue(&I, DAG.getNode(ISD::SINT_TO_FP, getCurDebugLoc(), DestVT, N));
2824 void SelectionDAGBuilder::visitPtrToInt(const User &I) {
2825 // What to do depends on the size of the integer and the size of the pointer.
2826 // We can either truncate, zero extend, or no-op, accordingly.
2827 SDValue N = getValue(I.getOperand(0));
2828 EVT DestVT = TLI.getValueType(I.getType());
2829 setValue(&I, DAG.getZExtOrTrunc(N, getCurDebugLoc(), DestVT));
2832 void SelectionDAGBuilder::visitIntToPtr(const User &I) {
2833 // What to do depends on the size of the integer and the size of the pointer.
2834 // We can either truncate, zero extend, or no-op, accordingly.
2835 SDValue N = getValue(I.getOperand(0));
2836 EVT DestVT = TLI.getValueType(I.getType());
2837 setValue(&I, DAG.getZExtOrTrunc(N, getCurDebugLoc(), DestVT));
2840 void SelectionDAGBuilder::visitBitCast(const User &I) {
2841 SDValue N = getValue(I.getOperand(0));
2842 EVT DestVT = TLI.getValueType(I.getType());
2844 // BitCast assures us that source and destination are the same size so this is
2845 // either a BITCAST or a no-op.
2846 if (DestVT != N.getValueType())
2847 setValue(&I, DAG.getNode(ISD::BITCAST, getCurDebugLoc(),
2848 DestVT, N)); // convert types.
2850 setValue(&I, N); // noop cast.
2853 void SelectionDAGBuilder::visitInsertElement(const User &I) {
2854 SDValue InVec = getValue(I.getOperand(0));
2855 SDValue InVal = getValue(I.getOperand(1));
2856 SDValue InIdx = DAG.getNode(ISD::ZERO_EXTEND, getCurDebugLoc(),
2858 getValue(I.getOperand(2)));
2859 setValue(&I, DAG.getNode(ISD::INSERT_VECTOR_ELT, getCurDebugLoc(),
2860 TLI.getValueType(I.getType()),
2861 InVec, InVal, InIdx));
2864 void SelectionDAGBuilder::visitExtractElement(const User &I) {
2865 SDValue InVec = getValue(I.getOperand(0));
2866 SDValue InIdx = DAG.getNode(ISD::ZERO_EXTEND, getCurDebugLoc(),
2868 getValue(I.getOperand(1)));
2869 setValue(&I, DAG.getNode(ISD::EXTRACT_VECTOR_ELT, getCurDebugLoc(),
2870 TLI.getValueType(I.getType()), InVec, InIdx));
2873 // Utility for visitShuffleVector - Return true if every element in Mask,
2874 // beginning from position Pos and ending in Pos+Size, falls within the
2875 // specified sequential range [L, L+Pos). or is undef.
2876 static bool isSequentialInRange(const SmallVectorImpl<int> &Mask,
2877 unsigned Pos, unsigned Size, int Low) {
2878 for (unsigned i = Pos, e = Pos+Size; i != e; ++i, ++Low)
2879 if (Mask[i] >= 0 && Mask[i] != Low)
2884 void SelectionDAGBuilder::visitShuffleVector(const User &I) {
2885 SDValue Src1 = getValue(I.getOperand(0));
2886 SDValue Src2 = getValue(I.getOperand(1));
2888 SmallVector<int, 8> Mask;
2889 ShuffleVectorInst::getShuffleMask(cast<Constant>(I.getOperand(2)), Mask);
2890 unsigned MaskNumElts = Mask.size();
2892 EVT VT = TLI.getValueType(I.getType());
2893 EVT SrcVT = Src1.getValueType();
2894 unsigned SrcNumElts = SrcVT.getVectorNumElements();
2896 if (SrcNumElts == MaskNumElts) {
2897 setValue(&I, DAG.getVectorShuffle(VT, getCurDebugLoc(), Src1, Src2,
2902 // Normalize the shuffle vector since mask and vector length don't match.
2903 if (SrcNumElts < MaskNumElts && MaskNumElts % SrcNumElts == 0) {
2904 // Mask is longer than the source vectors and is a multiple of the source
2905 // vectors. We can use concatenate vector to make the mask and vectors
2907 if (SrcNumElts*2 == MaskNumElts) {
2908 // First check for Src1 in low and Src2 in high
2909 if (isSequentialInRange(Mask, 0, SrcNumElts, 0) &&
2910 isSequentialInRange(Mask, SrcNumElts, SrcNumElts, SrcNumElts)) {
2911 // The shuffle is concatenating two vectors together.
2912 setValue(&I, DAG.getNode(ISD::CONCAT_VECTORS, getCurDebugLoc(),
2916 // Then check for Src2 in low and Src1 in high
2917 if (isSequentialInRange(Mask, 0, SrcNumElts, SrcNumElts) &&
2918 isSequentialInRange(Mask, SrcNumElts, SrcNumElts, 0)) {
2919 // The shuffle is concatenating two vectors together.
2920 setValue(&I, DAG.getNode(ISD::CONCAT_VECTORS, getCurDebugLoc(),
2926 // Pad both vectors with undefs to make them the same length as the mask.
2927 unsigned NumConcat = MaskNumElts / SrcNumElts;
2928 bool Src1U = Src1.getOpcode() == ISD::UNDEF;
2929 bool Src2U = Src2.getOpcode() == ISD::UNDEF;
2930 SDValue UndefVal = DAG.getUNDEF(SrcVT);
2932 SmallVector<SDValue, 8> MOps1(NumConcat, UndefVal);
2933 SmallVector<SDValue, 8> MOps2(NumConcat, UndefVal);
2937 Src1 = Src1U ? DAG.getUNDEF(VT) : DAG.getNode(ISD::CONCAT_VECTORS,
2938 getCurDebugLoc(), VT,
2939 &MOps1[0], NumConcat);
2940 Src2 = Src2U ? DAG.getUNDEF(VT) : DAG.getNode(ISD::CONCAT_VECTORS,
2941 getCurDebugLoc(), VT,
2942 &MOps2[0], NumConcat);
2944 // Readjust mask for new input vector length.
2945 SmallVector<int, 8> MappedOps;
2946 for (unsigned i = 0; i != MaskNumElts; ++i) {
2948 if (Idx >= (int)SrcNumElts)
2949 Idx -= SrcNumElts - MaskNumElts;
2950 MappedOps.push_back(Idx);
2953 setValue(&I, DAG.getVectorShuffle(VT, getCurDebugLoc(), Src1, Src2,
2958 if (SrcNumElts > MaskNumElts) {
2959 // Analyze the access pattern of the vector to see if we can extract
2960 // two subvectors and do the shuffle. The analysis is done by calculating
2961 // the range of elements the mask access on both vectors.
2962 int MinRange[2] = { static_cast<int>(SrcNumElts),
2963 static_cast<int>(SrcNumElts)};
2964 int MaxRange[2] = {-1, -1};
2966 for (unsigned i = 0; i != MaskNumElts; ++i) {
2972 if (Idx >= (int)SrcNumElts) {
2976 if (Idx > MaxRange[Input])
2977 MaxRange[Input] = Idx;
2978 if (Idx < MinRange[Input])
2979 MinRange[Input] = Idx;
2982 // Check if the access is smaller than the vector size and can we find
2983 // a reasonable extract index.
2984 int RangeUse[2] = { -1, -1 }; // 0 = Unused, 1 = Extract, -1 = Can not
2986 int StartIdx[2]; // StartIdx to extract from
2987 for (unsigned Input = 0; Input < 2; ++Input) {
2988 if (MinRange[Input] >= (int)SrcNumElts && MaxRange[Input] < 0) {
2989 RangeUse[Input] = 0; // Unused
2990 StartIdx[Input] = 0;
2994 // Find a good start index that is a multiple of the mask length. Then
2995 // see if the rest of the elements are in range.
2996 StartIdx[Input] = (MinRange[Input]/MaskNumElts)*MaskNumElts;
2997 if (MaxRange[Input] - StartIdx[Input] < (int)MaskNumElts &&
2998 StartIdx[Input] + MaskNumElts <= SrcNumElts)
2999 RangeUse[Input] = 1; // Extract from a multiple of the mask length.
3002 if (RangeUse[0] == 0 && RangeUse[1] == 0) {
3003 setValue(&I, DAG.getUNDEF(VT)); // Vectors are not used.
3006 if (RangeUse[0] >= 0 && RangeUse[1] >= 0) {
3007 // Extract appropriate subvector and generate a vector shuffle
3008 for (unsigned Input = 0; Input < 2; ++Input) {
3009 SDValue &Src = Input == 0 ? Src1 : Src2;
3010 if (RangeUse[Input] == 0)
3011 Src = DAG.getUNDEF(VT);
3013 Src = DAG.getNode(ISD::EXTRACT_SUBVECTOR, getCurDebugLoc(), VT,
3014 Src, DAG.getIntPtrConstant(StartIdx[Input]));
3017 // Calculate new mask.
3018 SmallVector<int, 8> MappedOps;
3019 for (unsigned i = 0; i != MaskNumElts; ++i) {
3022 if (Idx < (int)SrcNumElts)
3025 Idx -= SrcNumElts + StartIdx[1] - MaskNumElts;
3027 MappedOps.push_back(Idx);
3030 setValue(&I, DAG.getVectorShuffle(VT, getCurDebugLoc(), Src1, Src2,
3036 // We can't use either concat vectors or extract subvectors so fall back to
3037 // replacing the shuffle with extract and build vector.
3038 // to insert and build vector.
3039 EVT EltVT = VT.getVectorElementType();
3040 EVT PtrVT = TLI.getPointerTy();
3041 SmallVector<SDValue,8> Ops;
3042 for (unsigned i = 0; i != MaskNumElts; ++i) {
3047 Res = DAG.getUNDEF(EltVT);
3049 SDValue &Src = Idx < (int)SrcNumElts ? Src1 : Src2;
3050 if (Idx >= (int)SrcNumElts) Idx -= SrcNumElts;
3052 Res = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, getCurDebugLoc(),
3053 EltVT, Src, DAG.getConstant(Idx, PtrVT));
3059 setValue(&I, DAG.getNode(ISD::BUILD_VECTOR, getCurDebugLoc(),
3060 VT, &Ops[0], Ops.size()));
3063 void SelectionDAGBuilder::visitInsertValue(const InsertValueInst &I) {
3064 const Value *Op0 = I.getOperand(0);
3065 const Value *Op1 = I.getOperand(1);
3066 Type *AggTy = I.getType();
3067 Type *ValTy = Op1->getType();
3068 bool IntoUndef = isa<UndefValue>(Op0);
3069 bool FromUndef = isa<UndefValue>(Op1);
3071 unsigned LinearIndex = ComputeLinearIndex(AggTy, I.getIndices());
3073 SmallVector<EVT, 4> AggValueVTs;
3074 ComputeValueVTs(TLI, AggTy, AggValueVTs);
3075 SmallVector<EVT, 4> ValValueVTs;
3076 ComputeValueVTs(TLI, ValTy, ValValueVTs);
3078 unsigned NumAggValues = AggValueVTs.size();
3079 unsigned NumValValues = ValValueVTs.size();
3080 SmallVector<SDValue, 4> Values(NumAggValues);
3082 SDValue Agg = getValue(Op0);
3084 // Copy the beginning value(s) from the original aggregate.
3085 for (; i != LinearIndex; ++i)
3086 Values[i] = IntoUndef ? DAG.getUNDEF(AggValueVTs[i]) :
3087 SDValue(Agg.getNode(), Agg.getResNo() + i);
3088 // Copy values from the inserted value(s).
3090 SDValue Val = getValue(Op1);
3091 for (; i != LinearIndex + NumValValues; ++i)
3092 Values[i] = FromUndef ? DAG.getUNDEF(AggValueVTs[i]) :
3093 SDValue(Val.getNode(), Val.getResNo() + i - LinearIndex);
3095 // Copy remaining value(s) from the original aggregate.
3096 for (; i != NumAggValues; ++i)
3097 Values[i] = IntoUndef ? DAG.getUNDEF(AggValueVTs[i]) :
3098 SDValue(Agg.getNode(), Agg.getResNo() + i);
3100 setValue(&I, DAG.getNode(ISD::MERGE_VALUES, getCurDebugLoc(),
3101 DAG.getVTList(&AggValueVTs[0], NumAggValues),
3102 &Values[0], NumAggValues));
3105 void SelectionDAGBuilder::visitExtractValue(const ExtractValueInst &I) {
3106 const Value *Op0 = I.getOperand(0);
3107 Type *AggTy = Op0->getType();
3108 Type *ValTy = I.getType();
3109 bool OutOfUndef = isa<UndefValue>(Op0);
3111 unsigned LinearIndex = ComputeLinearIndex(AggTy, I.getIndices());
3113 SmallVector<EVT, 4> ValValueVTs;
3114 ComputeValueVTs(TLI, ValTy, ValValueVTs);
3116 unsigned NumValValues = ValValueVTs.size();
3118 // Ignore a extractvalue that produces an empty object
3119 if (!NumValValues) {
3120 setValue(&I, DAG.getUNDEF(MVT(MVT::Other)));
3124 SmallVector<SDValue, 4> Values(NumValValues);
3126 SDValue Agg = getValue(Op0);
3127 // Copy out the selected value(s).
3128 for (unsigned i = LinearIndex; i != LinearIndex + NumValValues; ++i)
3129 Values[i - LinearIndex] =
3131 DAG.getUNDEF(Agg.getNode()->getValueType(Agg.getResNo() + i)) :
3132 SDValue(Agg.getNode(), Agg.getResNo() + i);
3134 setValue(&I, DAG.getNode(ISD::MERGE_VALUES, getCurDebugLoc(),
3135 DAG.getVTList(&ValValueVTs[0], NumValValues),
3136 &Values[0], NumValValues));
3139 void SelectionDAGBuilder::visitGetElementPtr(const User &I) {
3140 SDValue N = getValue(I.getOperand(0));
3141 // Note that the pointer operand may be a vector of pointers. Take the scalar
3142 // element which holds a pointer.
3143 Type *Ty = I.getOperand(0)->getType()->getScalarType();
3145 for (GetElementPtrInst::const_op_iterator OI = I.op_begin()+1, E = I.op_end();
3147 const Value *Idx = *OI;
3148 if (StructType *StTy = dyn_cast<StructType>(Ty)) {
3149 unsigned Field = cast<Constant>(Idx)->getUniqueInteger().getZExtValue();
3152 uint64_t Offset = TD->getStructLayout(StTy)->getElementOffset(Field);
3153 N = DAG.getNode(ISD::ADD, getCurDebugLoc(), N.getValueType(), N,
3154 DAG.getConstant(Offset, N.getValueType()));
3157 Ty = StTy->getElementType(Field);
3159 Ty = cast<SequentialType>(Ty)->getElementType();
3161 // If this is a constant subscript, handle it quickly.
3162 if (const ConstantInt *CI = dyn_cast<ConstantInt>(Idx)) {
3163 if (CI->isZero()) continue;
3165 TD->getTypeAllocSize(Ty)*cast<ConstantInt>(CI)->getSExtValue();
3167 EVT PTy = TLI.getPointerTy();
3168 unsigned PtrBits = PTy.getSizeInBits();
3170 OffsVal = DAG.getNode(ISD::TRUNCATE, getCurDebugLoc(),
3172 DAG.getConstant(Offs, MVT::i64));
3174 OffsVal = DAG.getIntPtrConstant(Offs);
3176 N = DAG.getNode(ISD::ADD, getCurDebugLoc(), N.getValueType(), N,
3181 // N = N + Idx * ElementSize;
3182 APInt ElementSize = APInt(TLI.getPointerTy().getSizeInBits(),
3183 TD->getTypeAllocSize(Ty));
3184 SDValue IdxN = getValue(Idx);
3186 // If the index is smaller or larger than intptr_t, truncate or extend
3188 IdxN = DAG.getSExtOrTrunc(IdxN, getCurDebugLoc(), N.getValueType());
3190 // If this is a multiply by a power of two, turn it into a shl
3191 // immediately. This is a very common case.
3192 if (ElementSize != 1) {
3193 if (ElementSize.isPowerOf2()) {
3194 unsigned Amt = ElementSize.logBase2();
3195 IdxN = DAG.getNode(ISD::SHL, getCurDebugLoc(),
3196 N.getValueType(), IdxN,
3197 DAG.getConstant(Amt, IdxN.getValueType()));
3199 SDValue Scale = DAG.getConstant(ElementSize, IdxN.getValueType());
3200 IdxN = DAG.getNode(ISD::MUL, getCurDebugLoc(),
3201 N.getValueType(), IdxN, Scale);
3205 N = DAG.getNode(ISD::ADD, getCurDebugLoc(),
3206 N.getValueType(), N, IdxN);
3213 void SelectionDAGBuilder::visitAlloca(const AllocaInst &I) {
3214 // If this is a fixed sized alloca in the entry block of the function,
3215 // allocate it statically on the stack.
3216 if (FuncInfo.StaticAllocaMap.count(&I))
3217 return; // getValue will auto-populate this.
3219 Type *Ty = I.getAllocatedType();
3220 uint64_t TySize = TLI.getDataLayout()->getTypeAllocSize(Ty);
3222 std::max((unsigned)TLI.getDataLayout()->getPrefTypeAlignment(Ty),
3225 SDValue AllocSize = getValue(I.getArraySize());
3227 EVT IntPtr = TLI.getPointerTy();
3228 if (AllocSize.getValueType() != IntPtr)
3229 AllocSize = DAG.getZExtOrTrunc(AllocSize, getCurDebugLoc(), IntPtr);
3231 AllocSize = DAG.getNode(ISD::MUL, getCurDebugLoc(), IntPtr,
3233 DAG.getConstant(TySize, IntPtr));
3235 // Handle alignment. If the requested alignment is less than or equal to
3236 // the stack alignment, ignore it. If the size is greater than or equal to
3237 // the stack alignment, we note this in the DYNAMIC_STACKALLOC node.
3238 unsigned StackAlign = TM.getFrameLowering()->getStackAlignment();
3239 if (Align <= StackAlign)
3242 // Round the size of the allocation up to the stack alignment size
3243 // by add SA-1 to the size.
3244 AllocSize = DAG.getNode(ISD::ADD, getCurDebugLoc(),
3245 AllocSize.getValueType(), AllocSize,
3246 DAG.getIntPtrConstant(StackAlign-1));
3248 // Mask out the low bits for alignment purposes.
3249 AllocSize = DAG.getNode(ISD::AND, getCurDebugLoc(),
3250 AllocSize.getValueType(), AllocSize,
3251 DAG.getIntPtrConstant(~(uint64_t)(StackAlign-1)));
3253 SDValue Ops[] = { getRoot(), AllocSize, DAG.getIntPtrConstant(Align) };
3254 SDVTList VTs = DAG.getVTList(AllocSize.getValueType(), MVT::Other);
3255 SDValue DSA = DAG.getNode(ISD::DYNAMIC_STACKALLOC, getCurDebugLoc(),
3258 DAG.setRoot(DSA.getValue(1));
3260 // Inform the Frame Information that we have just allocated a variable-sized
3262 FuncInfo.MF->getFrameInfo()->CreateVariableSizedObject(Align ? Align : 1,
3263 I.getAlignment(), &I);
3266 void SelectionDAGBuilder::visitLoad(const LoadInst &I) {
3268 return visitAtomicLoad(I);
3270 const Value *SV = I.getOperand(0);
3271 SDValue Ptr = getValue(SV);
3273 Type *Ty = I.getType();
3275 bool isVolatile = I.isVolatile();
3276 bool isNonTemporal = I.getMetadata("nontemporal") != 0;
3277 bool isInvariant = I.getMetadata("invariant.load") != 0;
3278 unsigned Alignment = I.getAlignment();
3279 const MDNode *TBAAInfo = I.getMetadata(LLVMContext::MD_tbaa);
3280 const MDNode *Ranges = I.getMetadata(LLVMContext::MD_range);
3282 SmallVector<EVT, 4> ValueVTs;
3283 SmallVector<uint64_t, 4> Offsets;
3284 ComputeValueVTs(TLI, Ty, ValueVTs, &Offsets);
3285 unsigned NumValues = ValueVTs.size();
3290 bool ConstantMemory = false;
3291 if (I.isVolatile() || NumValues > MaxParallelChains)
3292 // Serialize volatile loads with other side effects.
3294 else if (AA->pointsToConstantMemory(
3295 AliasAnalysis::Location(SV, AA->getTypeStoreSize(Ty), TBAAInfo))) {
3296 // Do not serialize (non-volatile) loads of constant memory with anything.
3297 Root = DAG.getEntryNode();
3298 ConstantMemory = true;
3300 // Do not serialize non-volatile loads against each other.
3301 Root = DAG.getRoot();
3304 SmallVector<SDValue, 4> Values(NumValues);
3305 SmallVector<SDValue, 4> Chains(std::min(unsigned(MaxParallelChains),
3307 EVT PtrVT = Ptr.getValueType();
3308 unsigned ChainI = 0;
3309 for (unsigned i = 0; i != NumValues; ++i, ++ChainI) {
3310 // Serializing loads here may result in excessive register pressure, and
3311 // TokenFactor places arbitrary choke points on the scheduler. SD scheduling
3312 // could recover a bit by hoisting nodes upward in the chain by recognizing
3313 // they are side-effect free or do not alias. The optimizer should really
3314 // avoid this case by converting large object/array copies to llvm.memcpy
3315 // (MaxParallelChains should always remain as failsafe).
3316 if (ChainI == MaxParallelChains) {
3317 assert(PendingLoads.empty() && "PendingLoads must be serialized first");
3318 SDValue Chain = DAG.getNode(ISD::TokenFactor, getCurDebugLoc(),
3319 MVT::Other, &Chains[0], ChainI);
3323 SDValue A = DAG.getNode(ISD::ADD, getCurDebugLoc(),
3325 DAG.getConstant(Offsets[i], PtrVT));
3326 SDValue L = DAG.getLoad(ValueVTs[i], getCurDebugLoc(), Root,
3327 A, MachinePointerInfo(SV, Offsets[i]), isVolatile,
3328 isNonTemporal, isInvariant, Alignment, TBAAInfo,
3332 Chains[ChainI] = L.getValue(1);
3335 if (!ConstantMemory) {
3336 SDValue Chain = DAG.getNode(ISD::TokenFactor, getCurDebugLoc(),
3337 MVT::Other, &Chains[0], ChainI);
3341 PendingLoads.push_back(Chain);
3344 setValue(&I, DAG.getNode(ISD::MERGE_VALUES, getCurDebugLoc(),
3345 DAG.getVTList(&ValueVTs[0], NumValues),
3346 &Values[0], NumValues));
3349 void SelectionDAGBuilder::visitStore(const StoreInst &I) {
3351 return visitAtomicStore(I);
3353 const Value *SrcV = I.getOperand(0);
3354 const Value *PtrV = I.getOperand(1);
3356 SmallVector<EVT, 4> ValueVTs;
3357 SmallVector<uint64_t, 4> Offsets;
3358 ComputeValueVTs(TLI, SrcV->getType(), ValueVTs, &Offsets);
3359 unsigned NumValues = ValueVTs.size();
3363 // Get the lowered operands. Note that we do this after
3364 // checking if NumResults is zero, because with zero results
3365 // the operands won't have values in the map.
3366 SDValue Src = getValue(SrcV);
3367 SDValue Ptr = getValue(PtrV);
3369 SDValue Root = getRoot();
3370 SmallVector<SDValue, 4> Chains(std::min(unsigned(MaxParallelChains),
3372 EVT PtrVT = Ptr.getValueType();
3373 bool isVolatile = I.isVolatile();
3374 bool isNonTemporal = I.getMetadata("nontemporal") != 0;
3375 unsigned Alignment = I.getAlignment();
3376 const MDNode *TBAAInfo = I.getMetadata(LLVMContext::MD_tbaa);
3378 unsigned ChainI = 0;
3379 for (unsigned i = 0; i != NumValues; ++i, ++ChainI) {
3380 // See visitLoad comments.
3381 if (ChainI == MaxParallelChains) {
3382 SDValue Chain = DAG.getNode(ISD::TokenFactor, getCurDebugLoc(),
3383 MVT::Other, &Chains[0], ChainI);
3387 SDValue Add = DAG.getNode(ISD::ADD, getCurDebugLoc(), PtrVT, Ptr,
3388 DAG.getConstant(Offsets[i], PtrVT));
3389 SDValue St = DAG.getStore(Root, getCurDebugLoc(),
3390 SDValue(Src.getNode(), Src.getResNo() + i),
3391 Add, MachinePointerInfo(PtrV, Offsets[i]),
3392 isVolatile, isNonTemporal, Alignment, TBAAInfo);
3393 Chains[ChainI] = St;
3396 SDValue StoreNode = DAG.getNode(ISD::TokenFactor, getCurDebugLoc(),
3397 MVT::Other, &Chains[0], ChainI);
3399 AssignOrderingToNode(StoreNode.getNode());
3400 DAG.setRoot(StoreNode);
3403 static SDValue InsertFenceForAtomic(SDValue Chain, AtomicOrdering Order,
3404 SynchronizationScope Scope,
3405 bool Before, DebugLoc dl,
3407 const TargetLowering &TLI) {
3408 // Fence, if necessary
3410 if (Order == AcquireRelease || Order == SequentiallyConsistent)
3412 else if (Order == Acquire || Order == Monotonic)
3415 if (Order == AcquireRelease)
3417 else if (Order == Release || Order == Monotonic)
3422 Ops[1] = DAG.getConstant(Order, TLI.getPointerTy());
3423 Ops[2] = DAG.getConstant(Scope, TLI.getPointerTy());
3424 return DAG.getNode(ISD::ATOMIC_FENCE, dl, MVT::Other, Ops, 3);
3427 void SelectionDAGBuilder::visitAtomicCmpXchg(const AtomicCmpXchgInst &I) {
3428 DebugLoc dl = getCurDebugLoc();
3429 AtomicOrdering Order = I.getOrdering();
3430 SynchronizationScope Scope = I.getSynchScope();
3432 SDValue InChain = getRoot();
3434 if (TLI.getInsertFencesForAtomic())
3435 InChain = InsertFenceForAtomic(InChain, Order, Scope, true, dl,
3439 DAG.getAtomic(ISD::ATOMIC_CMP_SWAP, dl,
3440 getValue(I.getCompareOperand()).getValueType().getSimpleVT(),
3442 getValue(I.getPointerOperand()),
3443 getValue(I.getCompareOperand()),
3444 getValue(I.getNewValOperand()),
3445 MachinePointerInfo(I.getPointerOperand()), 0 /* Alignment */,
3446 TLI.getInsertFencesForAtomic() ? Monotonic : Order,
3449 SDValue OutChain = L.getValue(1);
3451 if (TLI.getInsertFencesForAtomic())
3452 OutChain = InsertFenceForAtomic(OutChain, Order, Scope, false, dl,
3456 DAG.setRoot(OutChain);
3459 void SelectionDAGBuilder::visitAtomicRMW(const AtomicRMWInst &I) {
3460 DebugLoc dl = getCurDebugLoc();
3462 switch (I.getOperation()) {
3463 default: llvm_unreachable("Unknown atomicrmw operation");
3464 case AtomicRMWInst::Xchg: NT = ISD::ATOMIC_SWAP; break;
3465 case AtomicRMWInst::Add: NT = ISD::ATOMIC_LOAD_ADD; break;
3466 case AtomicRMWInst::Sub: NT = ISD::ATOMIC_LOAD_SUB; break;
3467 case AtomicRMWInst::And: NT = ISD::ATOMIC_LOAD_AND; break;
3468 case AtomicRMWInst::Nand: NT = ISD::ATOMIC_LOAD_NAND; break;
3469 case AtomicRMWInst::Or: NT = ISD::ATOMIC_LOAD_OR; break;
3470 case AtomicRMWInst::Xor: NT = ISD::ATOMIC_LOAD_XOR; break;
3471 case AtomicRMWInst::Max: NT = ISD::ATOMIC_LOAD_MAX; break;
3472 case AtomicRMWInst::Min: NT = ISD::ATOMIC_LOAD_MIN; break;
3473 case AtomicRMWInst::UMax: NT = ISD::ATOMIC_LOAD_UMAX; break;
3474 case AtomicRMWInst::UMin: NT = ISD::ATOMIC_LOAD_UMIN; break;
3476 AtomicOrdering Order = I.getOrdering();
3477 SynchronizationScope Scope = I.getSynchScope();
3479 SDValue InChain = getRoot();
3481 if (TLI.getInsertFencesForAtomic())
3482 InChain = InsertFenceForAtomic(InChain, Order, Scope, true, dl,
3486 DAG.getAtomic(NT, dl,
3487 getValue(I.getValOperand()).getValueType().getSimpleVT(),
3489 getValue(I.getPointerOperand()),
3490 getValue(I.getValOperand()),
3491 I.getPointerOperand(), 0 /* Alignment */,
3492 TLI.getInsertFencesForAtomic() ? Monotonic : Order,
3495 SDValue OutChain = L.getValue(1);
3497 if (TLI.getInsertFencesForAtomic())
3498 OutChain = InsertFenceForAtomic(OutChain, Order, Scope, false, dl,
3502 DAG.setRoot(OutChain);
3505 void SelectionDAGBuilder::visitFence(const FenceInst &I) {
3506 DebugLoc dl = getCurDebugLoc();
3509 Ops[1] = DAG.getConstant(I.getOrdering(), TLI.getPointerTy());
3510 Ops[2] = DAG.getConstant(I.getSynchScope(), TLI.getPointerTy());
3511 DAG.setRoot(DAG.getNode(ISD::ATOMIC_FENCE, dl, MVT::Other, Ops, 3));
3514 void SelectionDAGBuilder::visitAtomicLoad(const LoadInst &I) {
3515 DebugLoc dl = getCurDebugLoc();
3516 AtomicOrdering Order = I.getOrdering();
3517 SynchronizationScope Scope = I.getSynchScope();
3519 SDValue InChain = getRoot();
3521 EVT VT = TLI.getValueType(I.getType());
3523 if (I.getAlignment() < VT.getSizeInBits() / 8)
3524 report_fatal_error("Cannot generate unaligned atomic load");
3527 DAG.getAtomic(ISD::ATOMIC_LOAD, dl, VT, VT, InChain,
3528 getValue(I.getPointerOperand()),
3529 I.getPointerOperand(), I.getAlignment(),
3530 TLI.getInsertFencesForAtomic() ? Monotonic : Order,
3533 SDValue OutChain = L.getValue(1);
3535 if (TLI.getInsertFencesForAtomic())
3536 OutChain = InsertFenceForAtomic(OutChain, Order, Scope, false, dl,
3540 DAG.setRoot(OutChain);
3543 void SelectionDAGBuilder::visitAtomicStore(const StoreInst &I) {
3544 DebugLoc dl = getCurDebugLoc();
3546 AtomicOrdering Order = I.getOrdering();
3547 SynchronizationScope Scope = I.getSynchScope();
3549 SDValue InChain = getRoot();
3551 EVT VT = TLI.getValueType(I.getValueOperand()->getType());
3553 if (I.getAlignment() < VT.getSizeInBits() / 8)
3554 report_fatal_error("Cannot generate unaligned atomic store");
3556 if (TLI.getInsertFencesForAtomic())
3557 InChain = InsertFenceForAtomic(InChain, Order, Scope, true, dl,
3561 DAG.getAtomic(ISD::ATOMIC_STORE, dl, VT,
3563 getValue(I.getPointerOperand()),
3564 getValue(I.getValueOperand()),
3565 I.getPointerOperand(), I.getAlignment(),
3566 TLI.getInsertFencesForAtomic() ? Monotonic : Order,
3569 if (TLI.getInsertFencesForAtomic())
3570 OutChain = InsertFenceForAtomic(OutChain, Order, Scope, false, dl,
3573 DAG.setRoot(OutChain);
3576 /// visitTargetIntrinsic - Lower a call of a target intrinsic to an INTRINSIC
3578 void SelectionDAGBuilder::visitTargetIntrinsic(const CallInst &I,
3579 unsigned Intrinsic) {
3580 bool HasChain = !I.doesNotAccessMemory();
3581 bool OnlyLoad = HasChain && I.onlyReadsMemory();
3583 // Build the operand list.
3584 SmallVector<SDValue, 8> Ops;
3585 if (HasChain) { // If this intrinsic has side-effects, chainify it.
3587 // We don't need to serialize loads against other loads.
3588 Ops.push_back(DAG.getRoot());
3590 Ops.push_back(getRoot());
3594 // Info is set by getTgtMemInstrinsic
3595 TargetLowering::IntrinsicInfo Info;
3596 bool IsTgtIntrinsic = TLI.getTgtMemIntrinsic(Info, I, Intrinsic);
3598 // Add the intrinsic ID as an integer operand if it's not a target intrinsic.
3599 if (!IsTgtIntrinsic || Info.opc == ISD::INTRINSIC_VOID ||
3600 Info.opc == ISD::INTRINSIC_W_CHAIN)
3601 Ops.push_back(DAG.getTargetConstant(Intrinsic, TLI.getPointerTy()));
3603 // Add all operands of the call to the operand list.
3604 for (unsigned i = 0, e = I.getNumArgOperands(); i != e; ++i) {
3605 SDValue Op = getValue(I.getArgOperand(i));
3609 SmallVector<EVT, 4> ValueVTs;
3610 ComputeValueVTs(TLI, I.getType(), ValueVTs);
3613 ValueVTs.push_back(MVT::Other);
3615 SDVTList VTs = DAG.getVTList(ValueVTs.data(), ValueVTs.size());
3619 if (IsTgtIntrinsic) {
3620 // This is target intrinsic that touches memory
3621 Result = DAG.getMemIntrinsicNode(Info.opc, getCurDebugLoc(),
3622 VTs, &Ops[0], Ops.size(),
3624 MachinePointerInfo(Info.ptrVal, Info.offset),
3625 Info.align, Info.vol,
3626 Info.readMem, Info.writeMem);
3627 } else if (!HasChain) {
3628 Result = DAG.getNode(ISD::INTRINSIC_WO_CHAIN, getCurDebugLoc(),
3629 VTs, &Ops[0], Ops.size());
3630 } else if (!I.getType()->isVoidTy()) {
3631 Result = DAG.getNode(ISD::INTRINSIC_W_CHAIN, getCurDebugLoc(),
3632 VTs, &Ops[0], Ops.size());
3634 Result = DAG.getNode(ISD::INTRINSIC_VOID, getCurDebugLoc(),
3635 VTs, &Ops[0], Ops.size());
3639 SDValue Chain = Result.getValue(Result.getNode()->getNumValues()-1);
3641 PendingLoads.push_back(Chain);
3646 if (!I.getType()->isVoidTy()) {
3647 if (VectorType *PTy = dyn_cast<VectorType>(I.getType())) {
3648 EVT VT = TLI.getValueType(PTy);
3649 Result = DAG.getNode(ISD::BITCAST, getCurDebugLoc(), VT, Result);
3652 setValue(&I, Result);
3654 // Assign order to result here. If the intrinsic does not produce a result,
3655 // it won't be mapped to a SDNode and visit() will not assign it an order
3658 AssignOrderingToNode(Result.getNode());
3662 /// GetSignificand - Get the significand and build it into a floating-point
3663 /// number with exponent of 1:
3665 /// Op = (Op & 0x007fffff) | 0x3f800000;
3667 /// where Op is the hexidecimal representation of floating point value.
3669 GetSignificand(SelectionDAG &DAG, SDValue Op, DebugLoc dl) {
3670 SDValue t1 = DAG.getNode(ISD::AND, dl, MVT::i32, Op,
3671 DAG.getConstant(0x007fffff, MVT::i32));
3672 SDValue t2 = DAG.getNode(ISD::OR, dl, MVT::i32, t1,
3673 DAG.getConstant(0x3f800000, MVT::i32));
3674 return DAG.getNode(ISD::BITCAST, dl, MVT::f32, t2);
3677 /// GetExponent - Get the exponent:
3679 /// (float)(int)(((Op & 0x7f800000) >> 23) - 127);
3681 /// where Op is the hexidecimal representation of floating point value.
3683 GetExponent(SelectionDAG &DAG, SDValue Op, const TargetLowering &TLI,
3685 SDValue t0 = DAG.getNode(ISD::AND, dl, MVT::i32, Op,
3686 DAG.getConstant(0x7f800000, MVT::i32));
3687 SDValue t1 = DAG.getNode(ISD::SRL, dl, MVT::i32, t0,
3688 DAG.getConstant(23, TLI.getPointerTy()));
3689 SDValue t2 = DAG.getNode(ISD::SUB, dl, MVT::i32, t1,
3690 DAG.getConstant(127, MVT::i32));
3691 return DAG.getNode(ISD::SINT_TO_FP, dl, MVT::f32, t2);
3694 /// getF32Constant - Get 32-bit floating point constant.
3696 getF32Constant(SelectionDAG &DAG, unsigned Flt) {
3697 return DAG.getConstantFP(APFloat(APFloat::IEEEsingle, APInt(32, Flt)),
3701 /// expandExp - Lower an exp intrinsic. Handles the special sequences for
3702 /// limited-precision mode.
3703 static SDValue expandExp(DebugLoc dl, SDValue Op, SelectionDAG &DAG,
3704 const TargetLowering &TLI) {
3705 if (Op.getValueType() == MVT::f32 &&
3706 LimitFloatPrecision > 0 && LimitFloatPrecision <= 18) {
3708 // Put the exponent in the right bit position for later addition to the
3711 // #define LOG2OFe 1.4426950f
3712 // IntegerPartOfX = ((int32_t)(X * LOG2OFe));
3713 SDValue t0 = DAG.getNode(ISD::FMUL, dl, MVT::f32, Op,
3714 getF32Constant(DAG, 0x3fb8aa3b));
3715 SDValue IntegerPartOfX = DAG.getNode(ISD::FP_TO_SINT, dl, MVT::i32, t0);
3717 // FractionalPartOfX = (X * LOG2OFe) - (float)IntegerPartOfX;
3718 SDValue t1 = DAG.getNode(ISD::SINT_TO_FP, dl, MVT::f32, IntegerPartOfX);
3719 SDValue X = DAG.getNode(ISD::FSUB, dl, MVT::f32, t0, t1);
3721 // IntegerPartOfX <<= 23;
3722 IntegerPartOfX = DAG.getNode(ISD::SHL, dl, MVT::i32, IntegerPartOfX,
3723 DAG.getConstant(23, TLI.getPointerTy()));
3725 SDValue TwoToFracPartOfX;
3726 if (LimitFloatPrecision <= 6) {
3727 // For floating-point precision of 6:
3729 // TwoToFractionalPartOfX =
3731 // (0.735607626f + 0.252464424f * x) * x;
3733 // error 0.0144103317, which is 6 bits
3734 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
3735 getF32Constant(DAG, 0x3e814304));
3736 SDValue t3 = DAG.getNode(ISD::FADD, dl, MVT::f32, t2,
3737 getF32Constant(DAG, 0x3f3c50c8));
3738 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X);
3739 TwoToFracPartOfX = DAG.getNode(ISD::FADD, dl, MVT::f32, t4,
3740 getF32Constant(DAG, 0x3f7f5e7e));
3741 } else if (LimitFloatPrecision <= 12) {
3742 // For floating-point precision of 12:
3744 // TwoToFractionalPartOfX =
3747 // (0.224338339f + 0.792043434e-1f * x) * x) * x;
3749 // 0.000107046256 error, which is 13 to 14 bits
3750 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
3751 getF32Constant(DAG, 0x3da235e3));
3752 SDValue t3 = DAG.getNode(ISD::FADD, dl, MVT::f32, t2,
3753 getF32Constant(DAG, 0x3e65b8f3));
3754 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X);
3755 SDValue t5 = DAG.getNode(ISD::FADD, dl, MVT::f32, t4,
3756 getF32Constant(DAG, 0x3f324b07));
3757 SDValue t6 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t5, X);
3758 TwoToFracPartOfX = DAG.getNode(ISD::FADD, dl, MVT::f32, t6,
3759 getF32Constant(DAG, 0x3f7ff8fd));
3760 } else { // LimitFloatPrecision <= 18
3761 // For floating-point precision of 18:
3763 // TwoToFractionalPartOfX =
3767 // (0.554906021e-1f +
3768 // (0.961591928e-2f +
3769 // (0.136028312e-2f + 0.157059148e-3f *x)*x)*x)*x)*x)*x;
3771 // error 2.47208000*10^(-7), which is better than 18 bits
3772 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
3773 getF32Constant(DAG, 0x3924b03e));
3774 SDValue t3 = DAG.getNode(ISD::FADD, dl, MVT::f32, t2,
3775 getF32Constant(DAG, 0x3ab24b87));
3776 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X);
3777 SDValue t5 = DAG.getNode(ISD::FADD, dl, MVT::f32, t4,
3778 getF32Constant(DAG, 0x3c1d8c17));
3779 SDValue t6 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t5, X);
3780 SDValue t7 = DAG.getNode(ISD::FADD, dl, MVT::f32, t6,
3781 getF32Constant(DAG, 0x3d634a1d));
3782 SDValue t8 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t7, X);
3783 SDValue t9 = DAG.getNode(ISD::FADD, dl, MVT::f32, t8,
3784 getF32Constant(DAG, 0x3e75fe14));
3785 SDValue t10 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t9, X);
3786 SDValue t11 = DAG.getNode(ISD::FADD, dl, MVT::f32, t10,
3787 getF32Constant(DAG, 0x3f317234));
3788 SDValue t12 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t11, X);
3789 TwoToFracPartOfX = DAG.getNode(ISD::FADD, dl, MVT::f32, t12,
3790 getF32Constant(DAG, 0x3f800000));
3793 // Add the exponent into the result in integer domain.
3794 SDValue t13 = DAG.getNode(ISD::BITCAST, dl, MVT::i32, TwoToFracPartOfX);
3795 return DAG.getNode(ISD::BITCAST, dl, MVT::f32,
3796 DAG.getNode(ISD::ADD, dl, MVT::i32,
3797 t13, IntegerPartOfX));
3800 // No special expansion.
3801 return DAG.getNode(ISD::FEXP, dl, Op.getValueType(), Op);
3804 /// expandLog - Lower a log intrinsic. Handles the special sequences for
3805 /// limited-precision mode.
3806 static SDValue expandLog(DebugLoc dl, SDValue Op, SelectionDAG &DAG,
3807 const TargetLowering &TLI) {
3808 if (Op.getValueType() == MVT::f32 &&
3809 LimitFloatPrecision > 0 && LimitFloatPrecision <= 18) {
3810 SDValue Op1 = DAG.getNode(ISD::BITCAST, dl, MVT::i32, Op);
3812 // Scale the exponent by log(2) [0.69314718f].
3813 SDValue Exp = GetExponent(DAG, Op1, TLI, dl);
3814 SDValue LogOfExponent = DAG.getNode(ISD::FMUL, dl, MVT::f32, Exp,
3815 getF32Constant(DAG, 0x3f317218));
3817 // Get the significand and build it into a floating-point number with
3819 SDValue X = GetSignificand(DAG, Op1, dl);
3821 SDValue LogOfMantissa;
3822 if (LimitFloatPrecision <= 6) {
3823 // For floating-point precision of 6:
3827 // (1.4034025f - 0.23903021f * x) * x;
3829 // error 0.0034276066, which is better than 8 bits
3830 SDValue t0 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
3831 getF32Constant(DAG, 0xbe74c456));
3832 SDValue t1 = DAG.getNode(ISD::FADD, dl, MVT::f32, t0,
3833 getF32Constant(DAG, 0x3fb3a2b1));
3834 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t1, X);
3835 LogOfMantissa = DAG.getNode(ISD::FSUB, dl, MVT::f32, t2,
3836 getF32Constant(DAG, 0x3f949a29));
3837 } else if (LimitFloatPrecision <= 12) {
3838 // For floating-point precision of 12:
3844 // (0.44717955f - 0.56570851e-1f * x) * x) * x) * x;
3846 // error 0.000061011436, which is 14 bits
3847 SDValue t0 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
3848 getF32Constant(DAG, 0xbd67b6d6));
3849 SDValue t1 = DAG.getNode(ISD::FADD, dl, MVT::f32, t0,
3850 getF32Constant(DAG, 0x3ee4f4b8));
3851 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t1, X);
3852 SDValue t3 = DAG.getNode(ISD::FSUB, dl, MVT::f32, t2,
3853 getF32Constant(DAG, 0x3fbc278b));
3854 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X);
3855 SDValue t5 = DAG.getNode(ISD::FADD, dl, MVT::f32, t4,
3856 getF32Constant(DAG, 0x40348e95));
3857 SDValue t6 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t5, X);
3858 LogOfMantissa = DAG.getNode(ISD::FSUB, dl, MVT::f32, t6,
3859 getF32Constant(DAG, 0x3fdef31a));
3860 } else { // LimitFloatPrecision <= 18
3861 // For floating-point precision of 18:
3869 // (0.19073739f - 0.17809712e-1f * x) * x) * x) * x) * x)*x;
3871 // error 0.0000023660568, which is better than 18 bits
3872 SDValue t0 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
3873 getF32Constant(DAG, 0xbc91e5ac));
3874 SDValue t1 = DAG.getNode(ISD::FADD, dl, MVT::f32, t0,
3875 getF32Constant(DAG, 0x3e4350aa));
3876 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t1, X);
3877 SDValue t3 = DAG.getNode(ISD::FSUB, dl, MVT::f32, t2,
3878 getF32Constant(DAG, 0x3f60d3e3));
3879 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X);
3880 SDValue t5 = DAG.getNode(ISD::FADD, dl, MVT::f32, t4,
3881 getF32Constant(DAG, 0x4011cdf0));
3882 SDValue t6 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t5, X);
3883 SDValue t7 = DAG.getNode(ISD::FSUB, dl, MVT::f32, t6,
3884 getF32Constant(DAG, 0x406cfd1c));
3885 SDValue t8 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t7, X);
3886 SDValue t9 = DAG.getNode(ISD::FADD, dl, MVT::f32, t8,
3887 getF32Constant(DAG, 0x408797cb));
3888 SDValue t10 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t9, X);
3889 LogOfMantissa = DAG.getNode(ISD::FSUB, dl, MVT::f32, t10,
3890 getF32Constant(DAG, 0x4006dcab));
3893 return DAG.getNode(ISD::FADD, dl, MVT::f32, LogOfExponent, LogOfMantissa);
3896 // No special expansion.
3897 return DAG.getNode(ISD::FLOG, dl, Op.getValueType(), Op);
3900 /// expandLog2 - Lower a log2 intrinsic. Handles the special sequences for
3901 /// limited-precision mode.
3902 static SDValue expandLog2(DebugLoc dl, SDValue Op, SelectionDAG &DAG,
3903 const TargetLowering &TLI) {
3904 if (Op.getValueType() == MVT::f32 &&
3905 LimitFloatPrecision > 0 && LimitFloatPrecision <= 18) {
3906 SDValue Op1 = DAG.getNode(ISD::BITCAST, dl, MVT::i32, Op);
3908 // Get the exponent.
3909 SDValue LogOfExponent = GetExponent(DAG, Op1, TLI, dl);
3911 // Get the significand and build it into a floating-point number with
3913 SDValue X = GetSignificand(DAG, Op1, dl);
3915 // Different possible minimax approximations of significand in
3916 // floating-point for various degrees of accuracy over [1,2].
3917 SDValue Log2ofMantissa;
3918 if (LimitFloatPrecision <= 6) {
3919 // For floating-point precision of 6:
3921 // Log2ofMantissa = -1.6749035f + (2.0246817f - .34484768f * x) * x;
3923 // error 0.0049451742, which is more than 7 bits
3924 SDValue t0 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
3925 getF32Constant(DAG, 0xbeb08fe0));
3926 SDValue t1 = DAG.getNode(ISD::FADD, dl, MVT::f32, t0,
3927 getF32Constant(DAG, 0x40019463));
3928 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t1, X);
3929 Log2ofMantissa = DAG.getNode(ISD::FSUB, dl, MVT::f32, t2,
3930 getF32Constant(DAG, 0x3fd6633d));
3931 } else if (LimitFloatPrecision <= 12) {
3932 // For floating-point precision of 12:
3938 // (.645142248f - 0.816157886e-1f * x) * x) * x) * x;
3940 // error 0.0000876136000, which is better than 13 bits
3941 SDValue t0 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
3942 getF32Constant(DAG, 0xbda7262e));
3943 SDValue t1 = DAG.getNode(ISD::FADD, dl, MVT::f32, t0,
3944 getF32Constant(DAG, 0x3f25280b));
3945 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t1, X);
3946 SDValue t3 = DAG.getNode(ISD::FSUB, dl, MVT::f32, t2,
3947 getF32Constant(DAG, 0x4007b923));
3948 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X);
3949 SDValue t5 = DAG.getNode(ISD::FADD, dl, MVT::f32, t4,
3950 getF32Constant(DAG, 0x40823e2f));
3951 SDValue t6 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t5, X);
3952 Log2ofMantissa = DAG.getNode(ISD::FSUB, dl, MVT::f32, t6,
3953 getF32Constant(DAG, 0x4020d29c));
3954 } else { // LimitFloatPrecision <= 18
3955 // For floating-point precision of 18:
3964 // 0.25691327e-1f * x) * x) * x) * x) * x) * x;
3966 // error 0.0000018516, which is better than 18 bits
3967 SDValue t0 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
3968 getF32Constant(DAG, 0xbcd2769e));
3969 SDValue t1 = DAG.getNode(ISD::FADD, dl, MVT::f32, t0,
3970 getF32Constant(DAG, 0x3e8ce0b9));
3971 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t1, X);
3972 SDValue t3 = DAG.getNode(ISD::FSUB, dl, MVT::f32, t2,
3973 getF32Constant(DAG, 0x3fa22ae7));
3974 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X);
3975 SDValue t5 = DAG.getNode(ISD::FADD, dl, MVT::f32, t4,
3976 getF32Constant(DAG, 0x40525723));
3977 SDValue t6 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t5, X);
3978 SDValue t7 = DAG.getNode(ISD::FSUB, dl, MVT::f32, t6,
3979 getF32Constant(DAG, 0x40aaf200));
3980 SDValue t8 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t7, X);
3981 SDValue t9 = DAG.getNode(ISD::FADD, dl, MVT::f32, t8,
3982 getF32Constant(DAG, 0x40c39dad));
3983 SDValue t10 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t9, X);
3984 Log2ofMantissa = DAG.getNode(ISD::FSUB, dl, MVT::f32, t10,
3985 getF32Constant(DAG, 0x4042902c));
3988 return DAG.getNode(ISD::FADD, dl, MVT::f32, LogOfExponent, Log2ofMantissa);
3991 // No special expansion.
3992 return DAG.getNode(ISD::FLOG2, dl, Op.getValueType(), Op);
3995 /// expandLog10 - Lower a log10 intrinsic. Handles the special sequences for
3996 /// limited-precision mode.
3997 static SDValue expandLog10(DebugLoc dl, SDValue Op, SelectionDAG &DAG,
3998 const TargetLowering &TLI) {
3999 if (Op.getValueType() == MVT::f32 &&
4000 LimitFloatPrecision > 0 && LimitFloatPrecision <= 18) {
4001 SDValue Op1 = DAG.getNode(ISD::BITCAST, dl, MVT::i32, Op);
4003 // Scale the exponent by log10(2) [0.30102999f].
4004 SDValue Exp = GetExponent(DAG, Op1, TLI, dl);
4005 SDValue LogOfExponent = DAG.getNode(ISD::FMUL, dl, MVT::f32, Exp,
4006 getF32Constant(DAG, 0x3e9a209a));
4008 // Get the significand and build it into a floating-point number with
4010 SDValue X = GetSignificand(DAG, Op1, dl);
4012 SDValue Log10ofMantissa;
4013 if (LimitFloatPrecision <= 6) {
4014 // For floating-point precision of 6:
4016 // Log10ofMantissa =
4018 // (0.60948995f - 0.10380950f * x) * x;
4020 // error 0.0014886165, which is 6 bits
4021 SDValue t0 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
4022 getF32Constant(DAG, 0xbdd49a13));
4023 SDValue t1 = DAG.getNode(ISD::FADD, dl, MVT::f32, t0,
4024 getF32Constant(DAG, 0x3f1c0789));
4025 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t1, X);
4026 Log10ofMantissa = DAG.getNode(ISD::FSUB, dl, MVT::f32, t2,
4027 getF32Constant(DAG, 0x3f011300));
4028 } else if (LimitFloatPrecision <= 12) {
4029 // For floating-point precision of 12:
4031 // Log10ofMantissa =
4034 // (-0.31664806f + 0.47637168e-1f * x) * x) * x;
4036 // error 0.00019228036, which is better than 12 bits
4037 SDValue t0 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
4038 getF32Constant(DAG, 0x3d431f31));
4039 SDValue t1 = DAG.getNode(ISD::FSUB, dl, MVT::f32, t0,
4040 getF32Constant(DAG, 0x3ea21fb2));
4041 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t1, X);
4042 SDValue t3 = DAG.getNode(ISD::FADD, dl, MVT::f32, t2,
4043 getF32Constant(DAG, 0x3f6ae232));
4044 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X);
4045 Log10ofMantissa = DAG.getNode(ISD::FSUB, dl, MVT::f32, t4,
4046 getF32Constant(DAG, 0x3f25f7c3));
4047 } else { // LimitFloatPrecision <= 18
4048 // For floating-point precision of 18:
4050 // Log10ofMantissa =
4055 // (-0.12539807f + 0.13508273e-1f * x) * x) * x) * x) * x;
4057 // error 0.0000037995730, which is better than 18 bits
4058 SDValue t0 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
4059 getF32Constant(DAG, 0x3c5d51ce));
4060 SDValue t1 = DAG.getNode(ISD::FSUB, dl, MVT::f32, t0,
4061 getF32Constant(DAG, 0x3e00685a));
4062 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t1, X);
4063 SDValue t3 = DAG.getNode(ISD::FADD, dl, MVT::f32, t2,
4064 getF32Constant(DAG, 0x3efb6798));
4065 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X);
4066 SDValue t5 = DAG.getNode(ISD::FSUB, dl, MVT::f32, t4,
4067 getF32Constant(DAG, 0x3f88d192));
4068 SDValue t6 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t5, X);
4069 SDValue t7 = DAG.getNode(ISD::FADD, dl, MVT::f32, t6,
4070 getF32Constant(DAG, 0x3fc4316c));
4071 SDValue t8 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t7, X);
4072 Log10ofMantissa = DAG.getNode(ISD::FSUB, dl, MVT::f32, t8,
4073 getF32Constant(DAG, 0x3f57ce70));
4076 return DAG.getNode(ISD::FADD, dl, MVT::f32, LogOfExponent, Log10ofMantissa);
4079 // No special expansion.
4080 return DAG.getNode(ISD::FLOG10, dl, Op.getValueType(), Op);
4083 /// expandExp2 - Lower an exp2 intrinsic. Handles the special sequences for
4084 /// limited-precision mode.
4085 static SDValue expandExp2(DebugLoc dl, SDValue Op, SelectionDAG &DAG,
4086 const TargetLowering &TLI) {
4087 if (Op.getValueType() == MVT::f32 &&
4088 LimitFloatPrecision > 0 && LimitFloatPrecision <= 18) {
4089 SDValue IntegerPartOfX = DAG.getNode(ISD::FP_TO_SINT, dl, MVT::i32, Op);
4091 // FractionalPartOfX = x - (float)IntegerPartOfX;
4092 SDValue t1 = DAG.getNode(ISD::SINT_TO_FP, dl, MVT::f32, IntegerPartOfX);
4093 SDValue X = DAG.getNode(ISD::FSUB, dl, MVT::f32, Op, t1);
4095 // IntegerPartOfX <<= 23;
4096 IntegerPartOfX = DAG.getNode(ISD::SHL, dl, MVT::i32, IntegerPartOfX,
4097 DAG.getConstant(23, TLI.getPointerTy()));
4099 SDValue TwoToFractionalPartOfX;
4100 if (LimitFloatPrecision <= 6) {
4101 // For floating-point precision of 6:
4103 // TwoToFractionalPartOfX =
4105 // (0.735607626f + 0.252464424f * x) * x;
4107 // error 0.0144103317, which is 6 bits
4108 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
4109 getF32Constant(DAG, 0x3e814304));
4110 SDValue t3 = DAG.getNode(ISD::FADD, dl, MVT::f32, t2,
4111 getF32Constant(DAG, 0x3f3c50c8));
4112 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X);
4113 TwoToFractionalPartOfX = DAG.getNode(ISD::FADD, dl, MVT::f32, t4,
4114 getF32Constant(DAG, 0x3f7f5e7e));
4115 } else if (LimitFloatPrecision <= 12) {
4116 // For floating-point precision of 12:
4118 // TwoToFractionalPartOfX =
4121 // (0.224338339f + 0.792043434e-1f * x) * x) * x;
4123 // error 0.000107046256, which is 13 to 14 bits
4124 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
4125 getF32Constant(DAG, 0x3da235e3));
4126 SDValue t3 = DAG.getNode(ISD::FADD, dl, MVT::f32, t2,
4127 getF32Constant(DAG, 0x3e65b8f3));
4128 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X);
4129 SDValue t5 = DAG.getNode(ISD::FADD, dl, MVT::f32, t4,
4130 getF32Constant(DAG, 0x3f324b07));
4131 SDValue t6 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t5, X);
4132 TwoToFractionalPartOfX = DAG.getNode(ISD::FADD, dl, MVT::f32, t6,
4133 getF32Constant(DAG, 0x3f7ff8fd));
4134 } else { // LimitFloatPrecision <= 18
4135 // For floating-point precision of 18:
4137 // TwoToFractionalPartOfX =
4141 // (0.554906021e-1f +
4142 // (0.961591928e-2f +
4143 // (0.136028312e-2f + 0.157059148e-3f *x)*x)*x)*x)*x)*x;
4144 // error 2.47208000*10^(-7), which is better than 18 bits
4145 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
4146 getF32Constant(DAG, 0x3924b03e));
4147 SDValue t3 = DAG.getNode(ISD::FADD, dl, MVT::f32, t2,
4148 getF32Constant(DAG, 0x3ab24b87));
4149 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X);
4150 SDValue t5 = DAG.getNode(ISD::FADD, dl, MVT::f32, t4,
4151 getF32Constant(DAG, 0x3c1d8c17));
4152 SDValue t6 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t5, X);
4153 SDValue t7 = DAG.getNode(ISD::FADD, dl, MVT::f32, t6,
4154 getF32Constant(DAG, 0x3d634a1d));
4155 SDValue t8 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t7, X);
4156 SDValue t9 = DAG.getNode(ISD::FADD, dl, MVT::f32, t8,
4157 getF32Constant(DAG, 0x3e75fe14));
4158 SDValue t10 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t9, X);
4159 SDValue t11 = DAG.getNode(ISD::FADD, dl, MVT::f32, t10,
4160 getF32Constant(DAG, 0x3f317234));
4161 SDValue t12 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t11, X);
4162 TwoToFractionalPartOfX = DAG.getNode(ISD::FADD, dl, MVT::f32, t12,
4163 getF32Constant(DAG, 0x3f800000));
4166 // Add the exponent into the result in integer domain.
4167 SDValue t13 = DAG.getNode(ISD::BITCAST, dl, MVT::i32,
4168 TwoToFractionalPartOfX);
4169 return DAG.getNode(ISD::BITCAST, dl, MVT::f32,
4170 DAG.getNode(ISD::ADD, dl, MVT::i32,
4171 t13, IntegerPartOfX));
4174 // No special expansion.
4175 return DAG.getNode(ISD::FEXP2, dl, Op.getValueType(), Op);
4178 /// visitPow - Lower a pow intrinsic. Handles the special sequences for
4179 /// limited-precision mode with x == 10.0f.
4180 static SDValue expandPow(DebugLoc dl, SDValue LHS, SDValue RHS,
4181 SelectionDAG &DAG, const TargetLowering &TLI) {
4182 bool IsExp10 = false;
4183 if (LHS.getValueType() == MVT::f32 && LHS.getValueType() == MVT::f32 &&
4184 LimitFloatPrecision > 0 && LimitFloatPrecision <= 18) {
4185 if (ConstantFPSDNode *LHSC = dyn_cast<ConstantFPSDNode>(LHS)) {
4187 IsExp10 = LHSC->isExactlyValue(Ten);
4192 // Put the exponent in the right bit position for later addition to the
4195 // #define LOG2OF10 3.3219281f
4196 // IntegerPartOfX = (int32_t)(x * LOG2OF10);
4197 SDValue t0 = DAG.getNode(ISD::FMUL, dl, MVT::f32, RHS,
4198 getF32Constant(DAG, 0x40549a78));
4199 SDValue IntegerPartOfX = DAG.getNode(ISD::FP_TO_SINT, dl, MVT::i32, t0);
4201 // FractionalPartOfX = x - (float)IntegerPartOfX;
4202 SDValue t1 = DAG.getNode(ISD::SINT_TO_FP, dl, MVT::f32, IntegerPartOfX);
4203 SDValue X = DAG.getNode(ISD::FSUB, dl, MVT::f32, t0, t1);
4205 // IntegerPartOfX <<= 23;
4206 IntegerPartOfX = DAG.getNode(ISD::SHL, dl, MVT::i32, IntegerPartOfX,
4207 DAG.getConstant(23, TLI.getPointerTy()));
4209 SDValue TwoToFractionalPartOfX;
4210 if (LimitFloatPrecision <= 6) {
4211 // For floating-point precision of 6:
4213 // twoToFractionalPartOfX =
4215 // (0.735607626f + 0.252464424f * x) * x;
4217 // error 0.0144103317, which is 6 bits
4218 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
4219 getF32Constant(DAG, 0x3e814304));
4220 SDValue t3 = DAG.getNode(ISD::FADD, dl, MVT::f32, t2,
4221 getF32Constant(DAG, 0x3f3c50c8));
4222 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X);
4223 TwoToFractionalPartOfX = DAG.getNode(ISD::FADD, dl, MVT::f32, t4,
4224 getF32Constant(DAG, 0x3f7f5e7e));
4225 } else if (LimitFloatPrecision <= 12) {
4226 // For floating-point precision of 12:
4228 // TwoToFractionalPartOfX =
4231 // (0.224338339f + 0.792043434e-1f * x) * x) * x;
4233 // error 0.000107046256, which is 13 to 14 bits
4234 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
4235 getF32Constant(DAG, 0x3da235e3));
4236 SDValue t3 = DAG.getNode(ISD::FADD, dl, MVT::f32, t2,
4237 getF32Constant(DAG, 0x3e65b8f3));
4238 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X);
4239 SDValue t5 = DAG.getNode(ISD::FADD, dl, MVT::f32, t4,
4240 getF32Constant(DAG, 0x3f324b07));
4241 SDValue t6 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t5, X);
4242 TwoToFractionalPartOfX = DAG.getNode(ISD::FADD, dl, MVT::f32, t6,
4243 getF32Constant(DAG, 0x3f7ff8fd));
4244 } else { // LimitFloatPrecision <= 18
4245 // For floating-point precision of 18:
4247 // TwoToFractionalPartOfX =
4251 // (0.554906021e-1f +
4252 // (0.961591928e-2f +
4253 // (0.136028312e-2f + 0.157059148e-3f *x)*x)*x)*x)*x)*x;
4254 // error 2.47208000*10^(-7), which is better than 18 bits
4255 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
4256 getF32Constant(DAG, 0x3924b03e));
4257 SDValue t3 = DAG.getNode(ISD::FADD, dl, MVT::f32, t2,
4258 getF32Constant(DAG, 0x3ab24b87));
4259 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X);
4260 SDValue t5 = DAG.getNode(ISD::FADD, dl, MVT::f32, t4,
4261 getF32Constant(DAG, 0x3c1d8c17));
4262 SDValue t6 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t5, X);
4263 SDValue t7 = DAG.getNode(ISD::FADD, dl, MVT::f32, t6,
4264 getF32Constant(DAG, 0x3d634a1d));
4265 SDValue t8 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t7, X);
4266 SDValue t9 = DAG.getNode(ISD::FADD, dl, MVT::f32, t8,
4267 getF32Constant(DAG, 0x3e75fe14));
4268 SDValue t10 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t9, X);
4269 SDValue t11 = DAG.getNode(ISD::FADD, dl, MVT::f32, t10,
4270 getF32Constant(DAG, 0x3f317234));
4271 SDValue t12 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t11, X);
4272 TwoToFractionalPartOfX = DAG.getNode(ISD::FADD, dl, MVT::f32, t12,
4273 getF32Constant(DAG, 0x3f800000));
4276 SDValue t13 = DAG.getNode(ISD::BITCAST, dl,MVT::i32,TwoToFractionalPartOfX);
4277 return DAG.getNode(ISD::BITCAST, dl, MVT::f32,
4278 DAG.getNode(ISD::ADD, dl, MVT::i32,
4279 t13, IntegerPartOfX));
4282 // No special expansion.
4283 return DAG.getNode(ISD::FPOW, dl, LHS.getValueType(), LHS, RHS);
4287 /// ExpandPowI - Expand a llvm.powi intrinsic.
4288 static SDValue ExpandPowI(DebugLoc DL, SDValue LHS, SDValue RHS,
4289 SelectionDAG &DAG) {
4290 // If RHS is a constant, we can expand this out to a multiplication tree,
4291 // otherwise we end up lowering to a call to __powidf2 (for example). When
4292 // optimizing for size, we only want to do this if the expansion would produce
4293 // a small number of multiplies, otherwise we do the full expansion.
4294 if (ConstantSDNode *RHSC = dyn_cast<ConstantSDNode>(RHS)) {
4295 // Get the exponent as a positive value.
4296 unsigned Val = RHSC->getSExtValue();
4297 if ((int)Val < 0) Val = -Val;
4299 // powi(x, 0) -> 1.0
4301 return DAG.getConstantFP(1.0, LHS.getValueType());
4303 const Function *F = DAG.getMachineFunction().getFunction();
4304 if (!F->getAttributes().hasAttribute(AttributeSet::FunctionIndex,
4305 Attribute::OptimizeForSize) ||
4306 // If optimizing for size, don't insert too many multiplies. This
4307 // inserts up to 5 multiplies.
4308 CountPopulation_32(Val)+Log2_32(Val) < 7) {
4309 // We use the simple binary decomposition method to generate the multiply
4310 // sequence. There are more optimal ways to do this (for example,
4311 // powi(x,15) generates one more multiply than it should), but this has
4312 // the benefit of being both really simple and much better than a libcall.
4313 SDValue Res; // Logically starts equal to 1.0
4314 SDValue CurSquare = LHS;
4318 Res = DAG.getNode(ISD::FMUL, DL,Res.getValueType(), Res, CurSquare);
4320 Res = CurSquare; // 1.0*CurSquare.
4323 CurSquare = DAG.getNode(ISD::FMUL, DL, CurSquare.getValueType(),
4324 CurSquare, CurSquare);
4328 // If the original was negative, invert the result, producing 1/(x*x*x).
4329 if (RHSC->getSExtValue() < 0)
4330 Res = DAG.getNode(ISD::FDIV, DL, LHS.getValueType(),
4331 DAG.getConstantFP(1.0, LHS.getValueType()), Res);
4336 // Otherwise, expand to a libcall.
4337 return DAG.getNode(ISD::FPOWI, DL, LHS.getValueType(), LHS, RHS);
4340 // getTruncatedArgReg - Find underlying register used for an truncated
4342 static unsigned getTruncatedArgReg(const SDValue &N) {
4343 if (N.getOpcode() != ISD::TRUNCATE)
4346 const SDValue &Ext = N.getOperand(0);
4347 if (Ext.getOpcode() == ISD::AssertZext || Ext.getOpcode() == ISD::AssertSext){
4348 const SDValue &CFR = Ext.getOperand(0);
4349 if (CFR.getOpcode() == ISD::CopyFromReg)
4350 return cast<RegisterSDNode>(CFR.getOperand(1))->getReg();
4351 if (CFR.getOpcode() == ISD::TRUNCATE)
4352 return getTruncatedArgReg(CFR);
4357 /// EmitFuncArgumentDbgValue - If the DbgValueInst is a dbg_value of a function
4358 /// argument, create the corresponding DBG_VALUE machine instruction for it now.
4359 /// At the end of instruction selection, they will be inserted to the entry BB.
4361 SelectionDAGBuilder::EmitFuncArgumentDbgValue(const Value *V, MDNode *Variable,
4364 const Argument *Arg = dyn_cast<Argument>(V);
4368 MachineFunction &MF = DAG.getMachineFunction();
4369 const TargetInstrInfo *TII = DAG.getTarget().getInstrInfo();
4370 const TargetRegisterInfo *TRI = DAG.getTarget().getRegisterInfo();
4372 // Ignore inlined function arguments here.
4373 DIVariable DV(Variable);
4374 if (DV.isInlinedFnArgument(MF.getFunction()))
4378 // Some arguments' frame index is recorded during argument lowering.
4379 Offset = FuncInfo.getArgumentFrameIndex(Arg);
4381 Reg = TRI->getFrameRegister(MF);
4383 if (!Reg && N.getNode()) {
4384 if (N.getOpcode() == ISD::CopyFromReg)
4385 Reg = cast<RegisterSDNode>(N.getOperand(1))->getReg();
4387 Reg = getTruncatedArgReg(N);
4388 if (Reg && TargetRegisterInfo::isVirtualRegister(Reg)) {
4389 MachineRegisterInfo &RegInfo = MF.getRegInfo();
4390 unsigned PR = RegInfo.getLiveInPhysReg(Reg);
4397 // Check if ValueMap has reg number.
4398 DenseMap<const Value *, unsigned>::iterator VMI = FuncInfo.ValueMap.find(V);
4399 if (VMI != FuncInfo.ValueMap.end())
4403 if (!Reg && N.getNode()) {
4404 // Check if frame index is available.
4405 if (LoadSDNode *LNode = dyn_cast<LoadSDNode>(N.getNode()))
4406 if (FrameIndexSDNode *FINode =
4407 dyn_cast<FrameIndexSDNode>(LNode->getBasePtr().getNode())) {
4408 Reg = TRI->getFrameRegister(MF);
4409 Offset = FINode->getIndex();
4416 MachineInstrBuilder MIB = BuildMI(MF, getCurDebugLoc(),
4417 TII->get(TargetOpcode::DBG_VALUE))
4418 .addReg(Reg, RegState::Debug).addImm(Offset).addMetadata(Variable);
4419 FuncInfo.ArgDbgValues.push_back(&*MIB);
4423 // VisualStudio defines setjmp as _setjmp
4424 #if defined(_MSC_VER) && defined(setjmp) && \
4425 !defined(setjmp_undefined_for_msvc)
4426 # pragma push_macro("setjmp")
4428 # define setjmp_undefined_for_msvc
4431 /// visitIntrinsicCall - Lower the call to the specified intrinsic function. If
4432 /// we want to emit this as a call to a named external function, return the name
4433 /// otherwise lower it and return null.
4435 SelectionDAGBuilder::visitIntrinsicCall(const CallInst &I, unsigned Intrinsic) {
4436 DebugLoc dl = getCurDebugLoc();
4439 switch (Intrinsic) {
4441 // By default, turn this into a target intrinsic node.
4442 visitTargetIntrinsic(I, Intrinsic);
4444 case Intrinsic::vastart: visitVAStart(I); return 0;
4445 case Intrinsic::vaend: visitVAEnd(I); return 0;
4446 case Intrinsic::vacopy: visitVACopy(I); return 0;
4447 case Intrinsic::returnaddress:
4448 setValue(&I, DAG.getNode(ISD::RETURNADDR, dl, TLI.getPointerTy(),
4449 getValue(I.getArgOperand(0))));
4451 case Intrinsic::frameaddress:
4452 setValue(&I, DAG.getNode(ISD::FRAMEADDR, dl, TLI.getPointerTy(),
4453 getValue(I.getArgOperand(0))));
4455 case Intrinsic::setjmp:
4456 return &"_setjmp"[!TLI.usesUnderscoreSetJmp()];
4457 case Intrinsic::longjmp:
4458 return &"_longjmp"[!TLI.usesUnderscoreLongJmp()];
4459 case Intrinsic::memcpy: {
4460 // Assert for address < 256 since we support only user defined address
4462 assert(cast<PointerType>(I.getArgOperand(0)->getType())->getAddressSpace()
4464 cast<PointerType>(I.getArgOperand(1)->getType())->getAddressSpace()
4466 "Unknown address space");
4467 SDValue Op1 = getValue(I.getArgOperand(0));
4468 SDValue Op2 = getValue(I.getArgOperand(1));
4469 SDValue Op3 = getValue(I.getArgOperand(2));
4470 unsigned Align = cast<ConstantInt>(I.getArgOperand(3))->getZExtValue();
4471 bool isVol = cast<ConstantInt>(I.getArgOperand(4))->getZExtValue();
4472 DAG.setRoot(DAG.getMemcpy(getRoot(), dl, Op1, Op2, Op3, Align, isVol, false,
4473 MachinePointerInfo(I.getArgOperand(0)),
4474 MachinePointerInfo(I.getArgOperand(1))));
4477 case Intrinsic::memset: {
4478 // Assert for address < 256 since we support only user defined address
4480 assert(cast<PointerType>(I.getArgOperand(0)->getType())->getAddressSpace()
4482 "Unknown address space");
4483 SDValue Op1 = getValue(I.getArgOperand(0));
4484 SDValue Op2 = getValue(I.getArgOperand(1));
4485 SDValue Op3 = getValue(I.getArgOperand(2));
4486 unsigned Align = cast<ConstantInt>(I.getArgOperand(3))->getZExtValue();
4487 bool isVol = cast<ConstantInt>(I.getArgOperand(4))->getZExtValue();
4488 DAG.setRoot(DAG.getMemset(getRoot(), dl, Op1, Op2, Op3, Align, isVol,
4489 MachinePointerInfo(I.getArgOperand(0))));
4492 case Intrinsic::memmove: {
4493 // Assert for address < 256 since we support only user defined address
4495 assert(cast<PointerType>(I.getArgOperand(0)->getType())->getAddressSpace()
4497 cast<PointerType>(I.getArgOperand(1)->getType())->getAddressSpace()
4499 "Unknown address space");
4500 SDValue Op1 = getValue(I.getArgOperand(0));
4501 SDValue Op2 = getValue(I.getArgOperand(1));
4502 SDValue Op3 = getValue(I.getArgOperand(2));
4503 unsigned Align = cast<ConstantInt>(I.getArgOperand(3))->getZExtValue();
4504 bool isVol = cast<ConstantInt>(I.getArgOperand(4))->getZExtValue();
4505 DAG.setRoot(DAG.getMemmove(getRoot(), dl, Op1, Op2, Op3, Align, isVol,
4506 MachinePointerInfo(I.getArgOperand(0)),
4507 MachinePointerInfo(I.getArgOperand(1))));
4510 case Intrinsic::dbg_declare: {
4511 const DbgDeclareInst &DI = cast<DbgDeclareInst>(I);
4512 MDNode *Variable = DI.getVariable();
4513 const Value *Address = DI.getAddress();
4514 if (!Address || !DIVariable(Variable).Verify()) {
4515 DEBUG(dbgs() << "Dropping debug info for " << DI << "\n");
4519 // Build an entry in DbgOrdering. Debug info input nodes get an SDNodeOrder
4520 // but do not always have a corresponding SDNode built. The SDNodeOrder
4521 // absolute, but not relative, values are different depending on whether
4522 // debug info exists.
4525 // Check if address has undef value.
4526 if (isa<UndefValue>(Address) ||
4527 (Address->use_empty() && !isa<Argument>(Address))) {
4528 DEBUG(dbgs() << "Dropping debug info for " << DI << "\n");
4532 SDValue &N = NodeMap[Address];
4533 if (!N.getNode() && isa<Argument>(Address))
4534 // Check unused arguments map.
4535 N = UnusedArgNodeMap[Address];
4538 if (const BitCastInst *BCI = dyn_cast<BitCastInst>(Address))
4539 Address = BCI->getOperand(0);
4540 // Parameters are handled specially.
4542 (DIVariable(Variable).getTag() == dwarf::DW_TAG_arg_variable ||
4543 isa<Argument>(Address));
4545 const AllocaInst *AI = dyn_cast<AllocaInst>(Address);
4547 if (isParameter && !AI) {
4548 FrameIndexSDNode *FINode = dyn_cast<FrameIndexSDNode>(N.getNode());
4550 // Byval parameter. We have a frame index at this point.
4551 SDV = DAG.getDbgValue(Variable, FINode->getIndex(),
4552 0, dl, SDNodeOrder);
4554 // Address is an argument, so try to emit its dbg value using
4555 // virtual register info from the FuncInfo.ValueMap.
4556 EmitFuncArgumentDbgValue(Address, Variable, 0, N);
4560 SDV = DAG.getDbgValue(Variable, N.getNode(), N.getResNo(),
4561 0, dl, SDNodeOrder);
4563 // Can't do anything with other non-AI cases yet.
4564 DEBUG(dbgs() << "Dropping debug info for " << DI << "\n");
4565 DEBUG(dbgs() << "non-AllocaInst issue for Address: \n\t");
4566 DEBUG(Address->dump());
4569 DAG.AddDbgValue(SDV, N.getNode(), isParameter);
4571 // If Address is an argument then try to emit its dbg value using
4572 // virtual register info from the FuncInfo.ValueMap.
4573 if (!EmitFuncArgumentDbgValue(Address, Variable, 0, N)) {
4574 // If variable is pinned by a alloca in dominating bb then
4575 // use StaticAllocaMap.
4576 if (const AllocaInst *AI = dyn_cast<AllocaInst>(Address)) {
4577 if (AI->getParent() != DI.getParent()) {
4578 DenseMap<const AllocaInst*, int>::iterator SI =
4579 FuncInfo.StaticAllocaMap.find(AI);
4580 if (SI != FuncInfo.StaticAllocaMap.end()) {
4581 SDV = DAG.getDbgValue(Variable, SI->second,
4582 0, dl, SDNodeOrder);
4583 DAG.AddDbgValue(SDV, 0, false);
4588 DEBUG(dbgs() << "Dropping debug info for " << DI << "\n");
4593 case Intrinsic::dbg_value: {
4594 const DbgValueInst &DI = cast<DbgValueInst>(I);
4595 if (!DIVariable(DI.getVariable()).Verify())
4598 MDNode *Variable = DI.getVariable();
4599 uint64_t Offset = DI.getOffset();
4600 const Value *V = DI.getValue();
4604 // Build an entry in DbgOrdering. Debug info input nodes get an SDNodeOrder
4605 // but do not always have a corresponding SDNode built. The SDNodeOrder
4606 // absolute, but not relative, values are different depending on whether
4607 // debug info exists.
4610 if (isa<ConstantInt>(V) || isa<ConstantFP>(V) || isa<UndefValue>(V)) {
4611 SDV = DAG.getDbgValue(Variable, V, Offset, dl, SDNodeOrder);
4612 DAG.AddDbgValue(SDV, 0, false);
4614 // Do not use getValue() in here; we don't want to generate code at
4615 // this point if it hasn't been done yet.
4616 SDValue N = NodeMap[V];
4617 if (!N.getNode() && isa<Argument>(V))
4618 // Check unused arguments map.
4619 N = UnusedArgNodeMap[V];
4621 if (!EmitFuncArgumentDbgValue(V, Variable, Offset, N)) {
4622 SDV = DAG.getDbgValue(Variable, N.getNode(),
4623 N.getResNo(), Offset, dl, SDNodeOrder);
4624 DAG.AddDbgValue(SDV, N.getNode(), false);
4626 } else if (!V->use_empty() ) {
4627 // Do not call getValue(V) yet, as we don't want to generate code.
4628 // Remember it for later.
4629 DanglingDebugInfo DDI(&DI, dl, SDNodeOrder);
4630 DanglingDebugInfoMap[V] = DDI;
4632 // We may expand this to cover more cases. One case where we have no
4633 // data available is an unreferenced parameter.
4634 DEBUG(dbgs() << "Dropping debug info for " << DI << "\n");
4638 // Build a debug info table entry.
4639 if (const BitCastInst *BCI = dyn_cast<BitCastInst>(V))
4640 V = BCI->getOperand(0);
4641 const AllocaInst *AI = dyn_cast<AllocaInst>(V);
4642 // Don't handle byval struct arguments or VLAs, for example.
4644 DEBUG(dbgs() << "Dropping debug location info for:\n " << DI << "\n");
4645 DEBUG(dbgs() << " Last seen at:\n " << *V << "\n");
4648 DenseMap<const AllocaInst*, int>::iterator SI =
4649 FuncInfo.StaticAllocaMap.find(AI);
4650 if (SI == FuncInfo.StaticAllocaMap.end())
4652 int FI = SI->second;
4654 MachineModuleInfo &MMI = DAG.getMachineFunction().getMMI();
4655 if (!DI.getDebugLoc().isUnknown() && MMI.hasDebugInfo())
4656 MMI.setVariableDbgInfo(Variable, FI, DI.getDebugLoc());
4660 case Intrinsic::eh_typeid_for: {
4661 // Find the type id for the given typeinfo.
4662 GlobalVariable *GV = ExtractTypeInfo(I.getArgOperand(0));
4663 unsigned TypeID = DAG.getMachineFunction().getMMI().getTypeIDFor(GV);
4664 Res = DAG.getConstant(TypeID, MVT::i32);
4669 case Intrinsic::eh_return_i32:
4670 case Intrinsic::eh_return_i64:
4671 DAG.getMachineFunction().getMMI().setCallsEHReturn(true);
4672 DAG.setRoot(DAG.getNode(ISD::EH_RETURN, dl,
4675 getValue(I.getArgOperand(0)),
4676 getValue(I.getArgOperand(1))));
4678 case Intrinsic::eh_unwind_init:
4679 DAG.getMachineFunction().getMMI().setCallsUnwindInit(true);
4681 case Intrinsic::eh_dwarf_cfa: {
4682 SDValue CfaArg = DAG.getSExtOrTrunc(getValue(I.getArgOperand(0)), dl,
4683 TLI.getPointerTy());
4684 SDValue Offset = DAG.getNode(ISD::ADD, dl,
4686 DAG.getNode(ISD::FRAME_TO_ARGS_OFFSET, dl,
4687 TLI.getPointerTy()),
4689 SDValue FA = DAG.getNode(ISD::FRAMEADDR, dl,
4691 DAG.getConstant(0, TLI.getPointerTy()));
4692 setValue(&I, DAG.getNode(ISD::ADD, dl, TLI.getPointerTy(),
4696 case Intrinsic::eh_sjlj_callsite: {
4697 MachineModuleInfo &MMI = DAG.getMachineFunction().getMMI();
4698 ConstantInt *CI = dyn_cast<ConstantInt>(I.getArgOperand(0));
4699 assert(CI && "Non-constant call site value in eh.sjlj.callsite!");
4700 assert(MMI.getCurrentCallSite() == 0 && "Overlapping call sites!");
4702 MMI.setCurrentCallSite(CI->getZExtValue());
4705 case Intrinsic::eh_sjlj_functioncontext: {
4706 // Get and store the index of the function context.
4707 MachineFrameInfo *MFI = DAG.getMachineFunction().getFrameInfo();
4709 cast<AllocaInst>(I.getArgOperand(0)->stripPointerCasts());
4710 int FI = FuncInfo.StaticAllocaMap[FnCtx];
4711 MFI->setFunctionContextIndex(FI);
4714 case Intrinsic::eh_sjlj_setjmp: {
4717 Ops[1] = getValue(I.getArgOperand(0));
4718 SDValue Op = DAG.getNode(ISD::EH_SJLJ_SETJMP, dl,
4719 DAG.getVTList(MVT::i32, MVT::Other),
4721 setValue(&I, Op.getValue(0));
4722 DAG.setRoot(Op.getValue(1));
4725 case Intrinsic::eh_sjlj_longjmp: {
4726 DAG.setRoot(DAG.getNode(ISD::EH_SJLJ_LONGJMP, dl, MVT::Other,
4727 getRoot(), getValue(I.getArgOperand(0))));
4731 case Intrinsic::x86_mmx_pslli_w:
4732 case Intrinsic::x86_mmx_pslli_d:
4733 case Intrinsic::x86_mmx_pslli_q:
4734 case Intrinsic::x86_mmx_psrli_w:
4735 case Intrinsic::x86_mmx_psrli_d:
4736 case Intrinsic::x86_mmx_psrli_q:
4737 case Intrinsic::x86_mmx_psrai_w:
4738 case Intrinsic::x86_mmx_psrai_d: {
4739 SDValue ShAmt = getValue(I.getArgOperand(1));
4740 if (isa<ConstantSDNode>(ShAmt)) {
4741 visitTargetIntrinsic(I, Intrinsic);
4744 unsigned NewIntrinsic = 0;
4745 EVT ShAmtVT = MVT::v2i32;
4746 switch (Intrinsic) {
4747 case Intrinsic::x86_mmx_pslli_w:
4748 NewIntrinsic = Intrinsic::x86_mmx_psll_w;
4750 case Intrinsic::x86_mmx_pslli_d:
4751 NewIntrinsic = Intrinsic::x86_mmx_psll_d;
4753 case Intrinsic::x86_mmx_pslli_q:
4754 NewIntrinsic = Intrinsic::x86_mmx_psll_q;
4756 case Intrinsic::x86_mmx_psrli_w:
4757 NewIntrinsic = Intrinsic::x86_mmx_psrl_w;
4759 case Intrinsic::x86_mmx_psrli_d:
4760 NewIntrinsic = Intrinsic::x86_mmx_psrl_d;
4762 case Intrinsic::x86_mmx_psrli_q:
4763 NewIntrinsic = Intrinsic::x86_mmx_psrl_q;
4765 case Intrinsic::x86_mmx_psrai_w:
4766 NewIntrinsic = Intrinsic::x86_mmx_psra_w;
4768 case Intrinsic::x86_mmx_psrai_d:
4769 NewIntrinsic = Intrinsic::x86_mmx_psra_d;
4771 default: llvm_unreachable("Impossible intrinsic"); // Can't reach here.
4774 // The vector shift intrinsics with scalars uses 32b shift amounts but
4775 // the sse2/mmx shift instructions reads 64 bits. Set the upper 32 bits
4777 // We must do this early because v2i32 is not a legal type.
4780 ShOps[1] = DAG.getConstant(0, MVT::i32);
4781 ShAmt = DAG.getNode(ISD::BUILD_VECTOR, dl, ShAmtVT, &ShOps[0], 2);
4782 EVT DestVT = TLI.getValueType(I.getType());
4783 ShAmt = DAG.getNode(ISD::BITCAST, dl, DestVT, ShAmt);
4784 Res = DAG.getNode(ISD::INTRINSIC_WO_CHAIN, dl, DestVT,
4785 DAG.getConstant(NewIntrinsic, MVT::i32),
4786 getValue(I.getArgOperand(0)), ShAmt);
4790 case Intrinsic::x86_avx_vinsertf128_pd_256:
4791 case Intrinsic::x86_avx_vinsertf128_ps_256:
4792 case Intrinsic::x86_avx_vinsertf128_si_256:
4793 case Intrinsic::x86_avx2_vinserti128: {
4794 EVT DestVT = TLI.getValueType(I.getType());
4795 EVT ElVT = TLI.getValueType(I.getArgOperand(1)->getType());
4796 uint64_t Idx = (cast<ConstantInt>(I.getArgOperand(2))->getZExtValue() & 1) *
4797 ElVT.getVectorNumElements();
4798 Res = DAG.getNode(ISD::INSERT_SUBVECTOR, dl, DestVT,
4799 getValue(I.getArgOperand(0)),
4800 getValue(I.getArgOperand(1)),
4801 DAG.getIntPtrConstant(Idx));
4805 case Intrinsic::x86_avx_vextractf128_pd_256:
4806 case Intrinsic::x86_avx_vextractf128_ps_256:
4807 case Intrinsic::x86_avx_vextractf128_si_256:
4808 case Intrinsic::x86_avx2_vextracti128: {
4809 EVT DestVT = TLI.getValueType(I.getType());
4810 uint64_t Idx = (cast<ConstantInt>(I.getArgOperand(1))->getZExtValue() & 1) *
4811 DestVT.getVectorNumElements();
4812 Res = DAG.getNode(ISD::EXTRACT_SUBVECTOR, dl, DestVT,
4813 getValue(I.getArgOperand(0)),
4814 DAG.getIntPtrConstant(Idx));
4818 case Intrinsic::convertff:
4819 case Intrinsic::convertfsi:
4820 case Intrinsic::convertfui:
4821 case Intrinsic::convertsif:
4822 case Intrinsic::convertuif:
4823 case Intrinsic::convertss:
4824 case Intrinsic::convertsu:
4825 case Intrinsic::convertus:
4826 case Intrinsic::convertuu: {
4827 ISD::CvtCode Code = ISD::CVT_INVALID;
4828 switch (Intrinsic) {
4829 default: llvm_unreachable("Impossible intrinsic"); // Can't reach here.
4830 case Intrinsic::convertff: Code = ISD::CVT_FF; break;
4831 case Intrinsic::convertfsi: Code = ISD::CVT_FS; break;
4832 case Intrinsic::convertfui: Code = ISD::CVT_FU; break;
4833 case Intrinsic::convertsif: Code = ISD::CVT_SF; break;
4834 case Intrinsic::convertuif: Code = ISD::CVT_UF; break;
4835 case Intrinsic::convertss: Code = ISD::CVT_SS; break;
4836 case Intrinsic::convertsu: Code = ISD::CVT_SU; break;
4837 case Intrinsic::convertus: Code = ISD::CVT_US; break;
4838 case Intrinsic::convertuu: Code = ISD::CVT_UU; break;
4840 EVT DestVT = TLI.getValueType(I.getType());
4841 const Value *Op1 = I.getArgOperand(0);
4842 Res = DAG.getConvertRndSat(DestVT, dl, getValue(Op1),
4843 DAG.getValueType(DestVT),
4844 DAG.getValueType(getValue(Op1).getValueType()),
4845 getValue(I.getArgOperand(1)),
4846 getValue(I.getArgOperand(2)),
4851 case Intrinsic::powi:
4852 setValue(&I, ExpandPowI(dl, getValue(I.getArgOperand(0)),
4853 getValue(I.getArgOperand(1)), DAG));
4855 case Intrinsic::log:
4856 setValue(&I, expandLog(dl, getValue(I.getArgOperand(0)), DAG, TLI));
4858 case Intrinsic::log2:
4859 setValue(&I, expandLog2(dl, getValue(I.getArgOperand(0)), DAG, TLI));
4861 case Intrinsic::log10:
4862 setValue(&I, expandLog10(dl, getValue(I.getArgOperand(0)), DAG, TLI));
4864 case Intrinsic::exp:
4865 setValue(&I, expandExp(dl, getValue(I.getArgOperand(0)), DAG, TLI));
4867 case Intrinsic::exp2:
4868 setValue(&I, expandExp2(dl, getValue(I.getArgOperand(0)), DAG, TLI));
4870 case Intrinsic::pow:
4871 setValue(&I, expandPow(dl, getValue(I.getArgOperand(0)),
4872 getValue(I.getArgOperand(1)), DAG, TLI));
4874 case Intrinsic::sqrt:
4875 case Intrinsic::fabs:
4876 case Intrinsic::sin:
4877 case Intrinsic::cos:
4878 case Intrinsic::floor:
4879 case Intrinsic::ceil:
4880 case Intrinsic::trunc:
4881 case Intrinsic::rint:
4882 case Intrinsic::nearbyint: {
4884 switch (Intrinsic) {
4885 default: llvm_unreachable("Impossible intrinsic"); // Can't reach here.
4886 case Intrinsic::sqrt: Opcode = ISD::FSQRT; break;
4887 case Intrinsic::fabs: Opcode = ISD::FABS; break;
4888 case Intrinsic::sin: Opcode = ISD::FSIN; break;
4889 case Intrinsic::cos: Opcode = ISD::FCOS; break;
4890 case Intrinsic::floor: Opcode = ISD::FFLOOR; break;
4891 case Intrinsic::ceil: Opcode = ISD::FCEIL; break;
4892 case Intrinsic::trunc: Opcode = ISD::FTRUNC; break;
4893 case Intrinsic::rint: Opcode = ISD::FRINT; break;
4894 case Intrinsic::nearbyint: Opcode = ISD::FNEARBYINT; break;
4897 setValue(&I, DAG.getNode(Opcode, dl,
4898 getValue(I.getArgOperand(0)).getValueType(),
4899 getValue(I.getArgOperand(0))));
4902 case Intrinsic::fma:
4903 setValue(&I, DAG.getNode(ISD::FMA, dl,
4904 getValue(I.getArgOperand(0)).getValueType(),
4905 getValue(I.getArgOperand(0)),
4906 getValue(I.getArgOperand(1)),
4907 getValue(I.getArgOperand(2))));
4909 case Intrinsic::fmuladd: {
4910 EVT VT = TLI.getValueType(I.getType());
4911 if (TM.Options.AllowFPOpFusion != FPOpFusion::Strict &&
4912 TLI.isOperationLegalOrCustom(ISD::FMA, VT) &&
4913 TLI.isFMAFasterThanMulAndAdd(VT)){
4914 setValue(&I, DAG.getNode(ISD::FMA, dl,
4915 getValue(I.getArgOperand(0)).getValueType(),
4916 getValue(I.getArgOperand(0)),
4917 getValue(I.getArgOperand(1)),
4918 getValue(I.getArgOperand(2))));
4920 SDValue Mul = DAG.getNode(ISD::FMUL, dl,
4921 getValue(I.getArgOperand(0)).getValueType(),
4922 getValue(I.getArgOperand(0)),
4923 getValue(I.getArgOperand(1)));
4924 SDValue Add = DAG.getNode(ISD::FADD, dl,
4925 getValue(I.getArgOperand(0)).getValueType(),
4927 getValue(I.getArgOperand(2)));
4932 case Intrinsic::convert_to_fp16:
4933 setValue(&I, DAG.getNode(ISD::FP32_TO_FP16, dl,
4934 MVT::i16, getValue(I.getArgOperand(0))));
4936 case Intrinsic::convert_from_fp16:
4937 setValue(&I, DAG.getNode(ISD::FP16_TO_FP32, dl,
4938 MVT::f32, getValue(I.getArgOperand(0))));
4940 case Intrinsic::pcmarker: {
4941 SDValue Tmp = getValue(I.getArgOperand(0));
4942 DAG.setRoot(DAG.getNode(ISD::PCMARKER, dl, MVT::Other, getRoot(), Tmp));
4945 case Intrinsic::readcyclecounter: {
4946 SDValue Op = getRoot();
4947 Res = DAG.getNode(ISD::READCYCLECOUNTER, dl,
4948 DAG.getVTList(MVT::i64, MVT::Other),
4951 DAG.setRoot(Res.getValue(1));
4954 case Intrinsic::bswap:
4955 setValue(&I, DAG.getNode(ISD::BSWAP, dl,
4956 getValue(I.getArgOperand(0)).getValueType(),
4957 getValue(I.getArgOperand(0))));
4959 case Intrinsic::cttz: {
4960 SDValue Arg = getValue(I.getArgOperand(0));
4961 ConstantInt *CI = cast<ConstantInt>(I.getArgOperand(1));
4962 EVT Ty = Arg.getValueType();
4963 setValue(&I, DAG.getNode(CI->isZero() ? ISD::CTTZ : ISD::CTTZ_ZERO_UNDEF,
4967 case Intrinsic::ctlz: {
4968 SDValue Arg = getValue(I.getArgOperand(0));
4969 ConstantInt *CI = cast<ConstantInt>(I.getArgOperand(1));
4970 EVT Ty = Arg.getValueType();
4971 setValue(&I, DAG.getNode(CI->isZero() ? ISD::CTLZ : ISD::CTLZ_ZERO_UNDEF,
4975 case Intrinsic::ctpop: {
4976 SDValue Arg = getValue(I.getArgOperand(0));
4977 EVT Ty = Arg.getValueType();
4978 setValue(&I, DAG.getNode(ISD::CTPOP, dl, Ty, Arg));
4981 case Intrinsic::stacksave: {
4982 SDValue Op = getRoot();
4983 Res = DAG.getNode(ISD::STACKSAVE, dl,
4984 DAG.getVTList(TLI.getPointerTy(), MVT::Other), &Op, 1);
4986 DAG.setRoot(Res.getValue(1));
4989 case Intrinsic::stackrestore: {
4990 Res = getValue(I.getArgOperand(0));
4991 DAG.setRoot(DAG.getNode(ISD::STACKRESTORE, dl, MVT::Other, getRoot(), Res));
4994 case Intrinsic::stackprotector: {
4995 // Emit code into the DAG to store the stack guard onto the stack.
4996 MachineFunction &MF = DAG.getMachineFunction();
4997 MachineFrameInfo *MFI = MF.getFrameInfo();
4998 EVT PtrTy = TLI.getPointerTy();
5000 SDValue Src = getValue(I.getArgOperand(0)); // The guard's value.
5001 AllocaInst *Slot = cast<AllocaInst>(I.getArgOperand(1));
5003 int FI = FuncInfo.StaticAllocaMap[Slot];
5004 MFI->setStackProtectorIndex(FI);
5006 SDValue FIN = DAG.getFrameIndex(FI, PtrTy);
5008 // Store the stack protector onto the stack.
5009 Res = DAG.getStore(getRoot(), dl, Src, FIN,
5010 MachinePointerInfo::getFixedStack(FI),
5016 case Intrinsic::objectsize: {
5017 // If we don't know by now, we're never going to know.
5018 ConstantInt *CI = dyn_cast<ConstantInt>(I.getArgOperand(1));
5020 assert(CI && "Non-constant type in __builtin_object_size?");
5022 SDValue Arg = getValue(I.getCalledValue());
5023 EVT Ty = Arg.getValueType();
5026 Res = DAG.getConstant(-1ULL, Ty);
5028 Res = DAG.getConstant(0, Ty);
5033 case Intrinsic::var_annotation:
5034 // Discard annotate attributes
5037 case Intrinsic::init_trampoline: {
5038 const Function *F = cast<Function>(I.getArgOperand(1)->stripPointerCasts());
5042 Ops[1] = getValue(I.getArgOperand(0));
5043 Ops[2] = getValue(I.getArgOperand(1));
5044 Ops[3] = getValue(I.getArgOperand(2));
5045 Ops[4] = DAG.getSrcValue(I.getArgOperand(0));
5046 Ops[5] = DAG.getSrcValue(F);
5048 Res = DAG.getNode(ISD::INIT_TRAMPOLINE, dl, MVT::Other, Ops, 6);
5053 case Intrinsic::adjust_trampoline: {
5054 setValue(&I, DAG.getNode(ISD::ADJUST_TRAMPOLINE, dl,
5056 getValue(I.getArgOperand(0))));
5059 case Intrinsic::gcroot:
5061 const Value *Alloca = I.getArgOperand(0)->stripPointerCasts();
5062 const Constant *TypeMap = cast<Constant>(I.getArgOperand(1));
5064 FrameIndexSDNode *FI = cast<FrameIndexSDNode>(getValue(Alloca).getNode());
5065 GFI->addStackRoot(FI->getIndex(), TypeMap);
5068 case Intrinsic::gcread:
5069 case Intrinsic::gcwrite:
5070 llvm_unreachable("GC failed to lower gcread/gcwrite intrinsics!");
5071 case Intrinsic::flt_rounds:
5072 setValue(&I, DAG.getNode(ISD::FLT_ROUNDS_, dl, MVT::i32));
5075 case Intrinsic::expect: {
5076 // Just replace __builtin_expect(exp, c) with EXP.
5077 setValue(&I, getValue(I.getArgOperand(0)));
5081 case Intrinsic::debugtrap:
5082 case Intrinsic::trap: {
5083 StringRef TrapFuncName = TM.Options.getTrapFunctionName();
5084 if (TrapFuncName.empty()) {
5085 ISD::NodeType Op = (Intrinsic == Intrinsic::trap) ?
5086 ISD::TRAP : ISD::DEBUGTRAP;
5087 DAG.setRoot(DAG.getNode(Op, dl,MVT::Other, getRoot()));
5090 TargetLowering::ArgListTy Args;
5092 CallLoweringInfo CLI(getRoot(), I.getType(),
5093 false, false, false, false, 0, CallingConv::C,
5094 /*isTailCall=*/false,
5095 /*doesNotRet=*/false, /*isReturnValueUsed=*/true,
5096 DAG.getExternalSymbol(TrapFuncName.data(), TLI.getPointerTy()),
5098 std::pair<SDValue, SDValue> Result = TLI.LowerCallTo(CLI);
5099 DAG.setRoot(Result.second);
5103 case Intrinsic::uadd_with_overflow:
5104 case Intrinsic::sadd_with_overflow:
5105 case Intrinsic::usub_with_overflow:
5106 case Intrinsic::ssub_with_overflow:
5107 case Intrinsic::umul_with_overflow:
5108 case Intrinsic::smul_with_overflow: {
5110 switch (Intrinsic) {
5111 default: llvm_unreachable("Impossible intrinsic"); // Can't reach here.
5112 case Intrinsic::uadd_with_overflow: Op = ISD::UADDO; break;
5113 case Intrinsic::sadd_with_overflow: Op = ISD::SADDO; break;
5114 case Intrinsic::usub_with_overflow: Op = ISD::USUBO; break;
5115 case Intrinsic::ssub_with_overflow: Op = ISD::SSUBO; break;
5116 case Intrinsic::umul_with_overflow: Op = ISD::UMULO; break;
5117 case Intrinsic::smul_with_overflow: Op = ISD::SMULO; break;
5119 SDValue Op1 = getValue(I.getArgOperand(0));
5120 SDValue Op2 = getValue(I.getArgOperand(1));
5122 SDVTList VTs = DAG.getVTList(Op1.getValueType(), MVT::i1);
5123 setValue(&I, DAG.getNode(Op, dl, VTs, Op1, Op2));
5126 case Intrinsic::prefetch: {
5128 unsigned rw = cast<ConstantInt>(I.getArgOperand(1))->getZExtValue();
5130 Ops[1] = getValue(I.getArgOperand(0));
5131 Ops[2] = getValue(I.getArgOperand(1));
5132 Ops[3] = getValue(I.getArgOperand(2));
5133 Ops[4] = getValue(I.getArgOperand(3));
5134 DAG.setRoot(DAG.getMemIntrinsicNode(ISD::PREFETCH, dl,
5135 DAG.getVTList(MVT::Other),
5137 EVT::getIntegerVT(*Context, 8),
5138 MachinePointerInfo(I.getArgOperand(0)),
5140 false, /* volatile */
5142 rw==1)); /* write */
5145 case Intrinsic::lifetime_start:
5146 case Intrinsic::lifetime_end: {
5147 bool IsStart = (Intrinsic == Intrinsic::lifetime_start);
5148 // Stack coloring is not enabled in O0, discard region information.
5149 if (TM.getOptLevel() == CodeGenOpt::None)
5152 SmallVector<Value *, 4> Allocas;
5153 GetUnderlyingObjects(I.getArgOperand(1), Allocas, TD);
5155 for (SmallVector<Value*, 4>::iterator Object = Allocas.begin(),
5156 E = Allocas.end(); Object != E; ++Object) {
5157 AllocaInst *LifetimeObject = dyn_cast_or_null<AllocaInst>(*Object);
5159 // Could not find an Alloca.
5160 if (!LifetimeObject)
5163 int FI = FuncInfo.StaticAllocaMap[LifetimeObject];
5167 Ops[1] = DAG.getFrameIndex(FI, TLI.getPointerTy(), true);
5168 unsigned Opcode = (IsStart ? ISD::LIFETIME_START : ISD::LIFETIME_END);
5170 Res = DAG.getNode(Opcode, dl, MVT::Other, Ops, 2);
5175 case Intrinsic::invariant_start:
5176 // Discard region information.
5177 setValue(&I, DAG.getUNDEF(TLI.getPointerTy()));
5179 case Intrinsic::invariant_end:
5180 // Discard region information.
5182 case Intrinsic::donothing:
5188 void SelectionDAGBuilder::LowerCallTo(ImmutableCallSite CS, SDValue Callee,
5190 MachineBasicBlock *LandingPad) {
5191 PointerType *PT = cast<PointerType>(CS.getCalledValue()->getType());
5192 FunctionType *FTy = cast<FunctionType>(PT->getElementType());
5193 Type *RetTy = FTy->getReturnType();
5194 MachineModuleInfo &MMI = DAG.getMachineFunction().getMMI();
5195 MCSymbol *BeginLabel = 0;
5197 TargetLowering::ArgListTy Args;
5198 TargetLowering::ArgListEntry Entry;
5199 Args.reserve(CS.arg_size());
5201 // Check whether the function can return without sret-demotion.
5202 SmallVector<ISD::OutputArg, 4> Outs;
5203 GetReturnInfo(RetTy, CS.getAttributes(), Outs, TLI);
5205 bool CanLowerReturn = TLI.CanLowerReturn(CS.getCallingConv(),
5206 DAG.getMachineFunction(),
5207 FTy->isVarArg(), Outs,
5210 SDValue DemoteStackSlot;
5211 int DemoteStackIdx = -100;
5213 if (!CanLowerReturn) {
5214 uint64_t TySize = TLI.getDataLayout()->getTypeAllocSize(
5215 FTy->getReturnType());
5216 unsigned Align = TLI.getDataLayout()->getPrefTypeAlignment(
5217 FTy->getReturnType());
5218 MachineFunction &MF = DAG.getMachineFunction();
5219 DemoteStackIdx = MF.getFrameInfo()->CreateStackObject(TySize, Align, false);
5220 Type *StackSlotPtrType = PointerType::getUnqual(FTy->getReturnType());
5222 DemoteStackSlot = DAG.getFrameIndex(DemoteStackIdx, TLI.getPointerTy());
5223 Entry.Node = DemoteStackSlot;
5224 Entry.Ty = StackSlotPtrType;
5225 Entry.isSExt = false;
5226 Entry.isZExt = false;
5227 Entry.isInReg = false;
5228 Entry.isSRet = true;
5229 Entry.isNest = false;
5230 Entry.isByVal = false;
5231 Entry.Alignment = Align;
5232 Args.push_back(Entry);
5233 RetTy = Type::getVoidTy(FTy->getContext());
5236 for (ImmutableCallSite::arg_iterator i = CS.arg_begin(), e = CS.arg_end();
5238 const Value *V = *i;
5241 if (V->getType()->isEmptyTy())
5244 SDValue ArgNode = getValue(V);
5245 Entry.Node = ArgNode; Entry.Ty = V->getType();
5247 unsigned attrInd = i - CS.arg_begin() + 1;
5248 Entry.isSExt = CS.paramHasAttr(attrInd, Attribute::SExt);
5249 Entry.isZExt = CS.paramHasAttr(attrInd, Attribute::ZExt);
5250 Entry.isInReg = CS.paramHasAttr(attrInd, Attribute::InReg);
5251 Entry.isSRet = CS.paramHasAttr(attrInd, Attribute::StructRet);
5252 Entry.isNest = CS.paramHasAttr(attrInd, Attribute::Nest);
5253 Entry.isByVal = CS.paramHasAttr(attrInd, Attribute::ByVal);
5254 Entry.Alignment = CS.getParamAlignment(attrInd);
5255 Args.push_back(Entry);
5259 // Insert a label before the invoke call to mark the try range. This can be
5260 // used to detect deletion of the invoke via the MachineModuleInfo.
5261 BeginLabel = MMI.getContext().CreateTempSymbol();
5263 // For SjLj, keep track of which landing pads go with which invokes
5264 // so as to maintain the ordering of pads in the LSDA.
5265 unsigned CallSiteIndex = MMI.getCurrentCallSite();
5266 if (CallSiteIndex) {
5267 MMI.setCallSiteBeginLabel(BeginLabel, CallSiteIndex);
5268 LPadToCallSiteMap[LandingPad].push_back(CallSiteIndex);
5270 // Now that the call site is handled, stop tracking it.
5271 MMI.setCurrentCallSite(0);
5274 // Both PendingLoads and PendingExports must be flushed here;
5275 // this call might not return.
5277 DAG.setRoot(DAG.getEHLabel(getCurDebugLoc(), getControlRoot(), BeginLabel));
5280 // Check if target-independent constraints permit a tail call here.
5281 // Target-dependent constraints are checked within TLI.LowerCallTo.
5282 if (isTailCall && !isInTailCallPosition(CS, TLI))
5286 CallLoweringInfo CLI(getRoot(), RetTy, FTy, isTailCall, Callee, Args, DAG,
5287 getCurDebugLoc(), CS);
5288 std::pair<SDValue,SDValue> Result = TLI.LowerCallTo(CLI);
5289 assert((isTailCall || Result.second.getNode()) &&
5290 "Non-null chain expected with non-tail call!");
5291 assert((Result.second.getNode() || !Result.first.getNode()) &&
5292 "Null value expected with tail call!");
5293 if (Result.first.getNode()) {
5294 setValue(CS.getInstruction(), Result.first);
5295 } else if (!CanLowerReturn && Result.second.getNode()) {
5296 // The instruction result is the result of loading from the
5297 // hidden sret parameter.
5298 SmallVector<EVT, 1> PVTs;
5299 Type *PtrRetTy = PointerType::getUnqual(FTy->getReturnType());
5301 ComputeValueVTs(TLI, PtrRetTy, PVTs);
5302 assert(PVTs.size() == 1 && "Pointers should fit in one register");
5303 EVT PtrVT = PVTs[0];
5305 SmallVector<EVT, 4> RetTys;
5306 SmallVector<uint64_t, 4> Offsets;
5307 RetTy = FTy->getReturnType();
5308 ComputeValueVTs(TLI, RetTy, RetTys, &Offsets);
5310 unsigned NumValues = RetTys.size();
5311 SmallVector<SDValue, 4> Values(NumValues);
5312 SmallVector<SDValue, 4> Chains(NumValues);
5314 for (unsigned i = 0; i < NumValues; ++i) {
5315 SDValue Add = DAG.getNode(ISD::ADD, getCurDebugLoc(), PtrVT,
5317 DAG.getConstant(Offsets[i], PtrVT));
5318 SDValue L = DAG.getLoad(RetTys[i], getCurDebugLoc(), Result.second, Add,
5319 MachinePointerInfo::getFixedStack(DemoteStackIdx, Offsets[i]),
5320 false, false, false, 1);
5322 Chains[i] = L.getValue(1);
5325 SDValue Chain = DAG.getNode(ISD::TokenFactor, getCurDebugLoc(),
5326 MVT::Other, &Chains[0], NumValues);
5327 PendingLoads.push_back(Chain);
5329 setValue(CS.getInstruction(),
5330 DAG.getNode(ISD::MERGE_VALUES, getCurDebugLoc(),
5331 DAG.getVTList(&RetTys[0], RetTys.size()),
5332 &Values[0], Values.size()));
5335 // Assign order to nodes here. If the call does not produce a result, it won't
5336 // be mapped to a SDNode and visit() will not assign it an order number.
5337 if (!Result.second.getNode()) {
5338 // As a special case, a null chain means that a tail call has been emitted and
5339 // the DAG root is already updated.
5342 AssignOrderingToNode(DAG.getRoot().getNode());
5344 DAG.setRoot(Result.second);
5346 AssignOrderingToNode(Result.second.getNode());
5350 // Insert a label at the end of the invoke call to mark the try range. This
5351 // can be used to detect deletion of the invoke via the MachineModuleInfo.
5352 MCSymbol *EndLabel = MMI.getContext().CreateTempSymbol();
5353 DAG.setRoot(DAG.getEHLabel(getCurDebugLoc(), getRoot(), EndLabel));
5355 // Inform MachineModuleInfo of range.
5356 MMI.addInvoke(LandingPad, BeginLabel, EndLabel);
5360 /// IsOnlyUsedInZeroEqualityComparison - Return true if it only matters that the
5361 /// value is equal or not-equal to zero.
5362 static bool IsOnlyUsedInZeroEqualityComparison(const Value *V) {
5363 for (Value::const_use_iterator UI = V->use_begin(), E = V->use_end();
5365 if (const ICmpInst *IC = dyn_cast<ICmpInst>(*UI))
5366 if (IC->isEquality())
5367 if (const Constant *C = dyn_cast<Constant>(IC->getOperand(1)))
5368 if (C->isNullValue())
5370 // Unknown instruction.
5376 static SDValue getMemCmpLoad(const Value *PtrVal, MVT LoadVT,
5378 SelectionDAGBuilder &Builder) {
5380 // Check to see if this load can be trivially constant folded, e.g. if the
5381 // input is from a string literal.
5382 if (const Constant *LoadInput = dyn_cast<Constant>(PtrVal)) {
5383 // Cast pointer to the type we really want to load.
5384 LoadInput = ConstantExpr::getBitCast(const_cast<Constant *>(LoadInput),
5385 PointerType::getUnqual(LoadTy));
5387 if (const Constant *LoadCst =
5388 ConstantFoldLoadFromConstPtr(const_cast<Constant *>(LoadInput),
5390 return Builder.getValue(LoadCst);
5393 // Otherwise, we have to emit the load. If the pointer is to unfoldable but
5394 // still constant memory, the input chain can be the entry node.
5396 bool ConstantMemory = false;
5398 // Do not serialize (non-volatile) loads of constant memory with anything.
5399 if (Builder.AA->pointsToConstantMemory(PtrVal)) {
5400 Root = Builder.DAG.getEntryNode();
5401 ConstantMemory = true;
5403 // Do not serialize non-volatile loads against each other.
5404 Root = Builder.DAG.getRoot();
5407 SDValue Ptr = Builder.getValue(PtrVal);
5408 SDValue LoadVal = Builder.DAG.getLoad(LoadVT, Builder.getCurDebugLoc(), Root,
5409 Ptr, MachinePointerInfo(PtrVal),
5411 false /*nontemporal*/,
5412 false /*isinvariant*/, 1 /* align=1 */);
5414 if (!ConstantMemory)
5415 Builder.PendingLoads.push_back(LoadVal.getValue(1));
5420 /// visitMemCmpCall - See if we can lower a call to memcmp in an optimized form.
5421 /// If so, return true and lower it, otherwise return false and it will be
5422 /// lowered like a normal call.
5423 bool SelectionDAGBuilder::visitMemCmpCall(const CallInst &I) {
5424 // Verify that the prototype makes sense. int memcmp(void*,void*,size_t)
5425 if (I.getNumArgOperands() != 3)
5428 const Value *LHS = I.getArgOperand(0), *RHS = I.getArgOperand(1);
5429 if (!LHS->getType()->isPointerTy() || !RHS->getType()->isPointerTy() ||
5430 !I.getArgOperand(2)->getType()->isIntegerTy() ||
5431 !I.getType()->isIntegerTy())
5434 const ConstantInt *Size = dyn_cast<ConstantInt>(I.getArgOperand(2));
5436 // memcmp(S1,S2,2) != 0 -> (*(short*)LHS != *(short*)RHS) != 0
5437 // memcmp(S1,S2,4) != 0 -> (*(int*)LHS != *(int*)RHS) != 0
5438 if (Size && IsOnlyUsedInZeroEqualityComparison(&I)) {
5439 bool ActuallyDoIt = true;
5442 switch (Size->getZExtValue()) {
5444 LoadVT = MVT::Other;
5446 ActuallyDoIt = false;
5450 LoadTy = Type::getInt16Ty(Size->getContext());
5454 LoadTy = Type::getInt32Ty(Size->getContext());
5458 LoadTy = Type::getInt64Ty(Size->getContext());
5462 LoadVT = MVT::v4i32;
5463 LoadTy = Type::getInt32Ty(Size->getContext());
5464 LoadTy = VectorType::get(LoadTy, 4);
5469 // This turns into unaligned loads. We only do this if the target natively
5470 // supports the MVT we'll be loading or if it is small enough (<= 4) that
5471 // we'll only produce a small number of byte loads.
5473 // Require that we can find a legal MVT, and only do this if the target
5474 // supports unaligned loads of that type. Expanding into byte loads would
5476 if (ActuallyDoIt && Size->getZExtValue() > 4) {
5477 // TODO: Handle 5 byte compare as 4-byte + 1 byte.
5478 // TODO: Handle 8 byte compare on x86-32 as two 32-bit loads.
5479 if (!TLI.isTypeLegal(LoadVT) ||!TLI.allowsUnalignedMemoryAccesses(LoadVT))
5480 ActuallyDoIt = false;
5484 SDValue LHSVal = getMemCmpLoad(LHS, LoadVT, LoadTy, *this);
5485 SDValue RHSVal = getMemCmpLoad(RHS, LoadVT, LoadTy, *this);
5487 SDValue Res = DAG.getSetCC(getCurDebugLoc(), MVT::i1, LHSVal, RHSVal,
5489 EVT CallVT = TLI.getValueType(I.getType(), true);
5490 setValue(&I, DAG.getZExtOrTrunc(Res, getCurDebugLoc(), CallVT));
5499 /// visitUnaryFloatCall - If a call instruction is a unary floating-point
5500 /// operation (as expected), translate it to an SDNode with the specified opcode
5501 /// and return true.
5502 bool SelectionDAGBuilder::visitUnaryFloatCall(const CallInst &I,
5504 // Sanity check that it really is a unary floating-point call.
5505 if (I.getNumArgOperands() != 1 ||
5506 !I.getArgOperand(0)->getType()->isFloatingPointTy() ||
5507 I.getType() != I.getArgOperand(0)->getType() ||
5508 !I.onlyReadsMemory())
5511 SDValue Tmp = getValue(I.getArgOperand(0));
5512 setValue(&I, DAG.getNode(Opcode, getCurDebugLoc(), Tmp.getValueType(), Tmp));
5516 void SelectionDAGBuilder::visitCall(const CallInst &I) {
5517 // Handle inline assembly differently.
5518 if (isa<InlineAsm>(I.getCalledValue())) {
5523 MachineModuleInfo &MMI = DAG.getMachineFunction().getMMI();
5524 ComputeUsesVAFloatArgument(I, &MMI);
5526 const char *RenameFn = 0;
5527 if (Function *F = I.getCalledFunction()) {
5528 if (F->isDeclaration()) {
5529 if (const TargetIntrinsicInfo *II = TM.getIntrinsicInfo()) {
5530 if (unsigned IID = II->getIntrinsicID(F)) {
5531 RenameFn = visitIntrinsicCall(I, IID);
5536 if (unsigned IID = F->getIntrinsicID()) {
5537 RenameFn = visitIntrinsicCall(I, IID);
5543 // Check for well-known libc/libm calls. If the function is internal, it
5544 // can't be a library call.
5546 if (!F->hasLocalLinkage() && F->hasName() &&
5547 LibInfo->getLibFunc(F->getName(), Func) &&
5548 LibInfo->hasOptimizedCodeGen(Func)) {
5551 case LibFunc::copysign:
5552 case LibFunc::copysignf:
5553 case LibFunc::copysignl:
5554 if (I.getNumArgOperands() == 2 && // Basic sanity checks.
5555 I.getArgOperand(0)->getType()->isFloatingPointTy() &&
5556 I.getType() == I.getArgOperand(0)->getType() &&
5557 I.getType() == I.getArgOperand(1)->getType() &&
5558 I.onlyReadsMemory()) {
5559 SDValue LHS = getValue(I.getArgOperand(0));
5560 SDValue RHS = getValue(I.getArgOperand(1));
5561 setValue(&I, DAG.getNode(ISD::FCOPYSIGN, getCurDebugLoc(),
5562 LHS.getValueType(), LHS, RHS));
5567 case LibFunc::fabsf:
5568 case LibFunc::fabsl:
5569 if (visitUnaryFloatCall(I, ISD::FABS))
5575 if (visitUnaryFloatCall(I, ISD::FSIN))
5581 if (visitUnaryFloatCall(I, ISD::FCOS))
5585 case LibFunc::sqrtf:
5586 case LibFunc::sqrtl:
5587 if (visitUnaryFloatCall(I, ISD::FSQRT))
5590 case LibFunc::floor:
5591 case LibFunc::floorf:
5592 case LibFunc::floorl:
5593 if (visitUnaryFloatCall(I, ISD::FFLOOR))
5596 case LibFunc::nearbyint:
5597 case LibFunc::nearbyintf:
5598 case LibFunc::nearbyintl:
5599 if (visitUnaryFloatCall(I, ISD::FNEARBYINT))
5603 case LibFunc::ceilf:
5604 case LibFunc::ceill:
5605 if (visitUnaryFloatCall(I, ISD::FCEIL))
5609 case LibFunc::rintf:
5610 case LibFunc::rintl:
5611 if (visitUnaryFloatCall(I, ISD::FRINT))
5614 case LibFunc::trunc:
5615 case LibFunc::truncf:
5616 case LibFunc::truncl:
5617 if (visitUnaryFloatCall(I, ISD::FTRUNC))
5621 case LibFunc::log2f:
5622 case LibFunc::log2l:
5623 if (visitUnaryFloatCall(I, ISD::FLOG2))
5627 case LibFunc::exp2f:
5628 case LibFunc::exp2l:
5629 if (visitUnaryFloatCall(I, ISD::FEXP2))
5632 case LibFunc::memcmp:
5633 if (visitMemCmpCall(I))
5642 Callee = getValue(I.getCalledValue());
5644 Callee = DAG.getExternalSymbol(RenameFn, TLI.getPointerTy());
5646 // Check if we can potentially perform a tail call. More detailed checking is
5647 // be done within LowerCallTo, after more information about the call is known.
5648 LowerCallTo(&I, Callee, I.isTailCall());
5653 /// AsmOperandInfo - This contains information for each constraint that we are
5655 class SDISelAsmOperandInfo : public TargetLowering::AsmOperandInfo {
5657 /// CallOperand - If this is the result output operand or a clobber
5658 /// this is null, otherwise it is the incoming operand to the CallInst.
5659 /// This gets modified as the asm is processed.
5660 SDValue CallOperand;
5662 /// AssignedRegs - If this is a register or register class operand, this
5663 /// contains the set of register corresponding to the operand.
5664 RegsForValue AssignedRegs;
5666 explicit SDISelAsmOperandInfo(const TargetLowering::AsmOperandInfo &info)
5667 : TargetLowering::AsmOperandInfo(info), CallOperand(0,0) {
5670 /// getCallOperandValEVT - Return the EVT of the Value* that this operand
5671 /// corresponds to. If there is no Value* for this operand, it returns
5673 EVT getCallOperandValEVT(LLVMContext &Context,
5674 const TargetLowering &TLI,
5675 const DataLayout *TD) const {
5676 if (CallOperandVal == 0) return MVT::Other;
5678 if (isa<BasicBlock>(CallOperandVal))
5679 return TLI.getPointerTy();
5681 llvm::Type *OpTy = CallOperandVal->getType();
5683 // FIXME: code duplicated from TargetLowering::ParseConstraints().
5684 // If this is an indirect operand, the operand is a pointer to the
5687 llvm::PointerType *PtrTy = dyn_cast<PointerType>(OpTy);
5689 report_fatal_error("Indirect operand for inline asm not a pointer!");
5690 OpTy = PtrTy->getElementType();
5693 // Look for vector wrapped in a struct. e.g. { <16 x i8> }.
5694 if (StructType *STy = dyn_cast<StructType>(OpTy))
5695 if (STy->getNumElements() == 1)
5696 OpTy = STy->getElementType(0);
5698 // If OpTy is not a single value, it may be a struct/union that we
5699 // can tile with integers.
5700 if (!OpTy->isSingleValueType() && OpTy->isSized()) {
5701 unsigned BitSize = TD->getTypeSizeInBits(OpTy);
5710 OpTy = IntegerType::get(Context, BitSize);
5715 return TLI.getValueType(OpTy, true);
5719 typedef SmallVector<SDISelAsmOperandInfo,16> SDISelAsmOperandInfoVector;
5721 } // end anonymous namespace
5723 /// GetRegistersForValue - Assign registers (virtual or physical) for the
5724 /// specified operand. We prefer to assign virtual registers, to allow the
5725 /// register allocator to handle the assignment process. However, if the asm
5726 /// uses features that we can't model on machineinstrs, we have SDISel do the
5727 /// allocation. This produces generally horrible, but correct, code.
5729 /// OpInfo describes the operand.
5731 static void GetRegistersForValue(SelectionDAG &DAG,
5732 const TargetLowering &TLI,
5734 SDISelAsmOperandInfo &OpInfo) {
5735 LLVMContext &Context = *DAG.getContext();
5737 MachineFunction &MF = DAG.getMachineFunction();
5738 SmallVector<unsigned, 4> Regs;
5740 // If this is a constraint for a single physreg, or a constraint for a
5741 // register class, find it.
5742 std::pair<unsigned, const TargetRegisterClass*> PhysReg =
5743 TLI.getRegForInlineAsmConstraint(OpInfo.ConstraintCode,
5744 OpInfo.ConstraintVT);
5746 unsigned NumRegs = 1;
5747 if (OpInfo.ConstraintVT != MVT::Other) {
5748 // If this is a FP input in an integer register (or visa versa) insert a bit
5749 // cast of the input value. More generally, handle any case where the input
5750 // value disagrees with the register class we plan to stick this in.
5751 if (OpInfo.Type == InlineAsm::isInput &&
5752 PhysReg.second && !PhysReg.second->hasType(OpInfo.ConstraintVT)) {
5753 // Try to convert to the first EVT that the reg class contains. If the
5754 // types are identical size, use a bitcast to convert (e.g. two differing
5756 MVT RegVT = *PhysReg.second->vt_begin();
5757 if (RegVT.getSizeInBits() == OpInfo.ConstraintVT.getSizeInBits()) {
5758 OpInfo.CallOperand = DAG.getNode(ISD::BITCAST, DL,
5759 RegVT, OpInfo.CallOperand);
5760 OpInfo.ConstraintVT = RegVT;
5761 } else if (RegVT.isInteger() && OpInfo.ConstraintVT.isFloatingPoint()) {
5762 // If the input is a FP value and we want it in FP registers, do a
5763 // bitcast to the corresponding integer type. This turns an f64 value
5764 // into i64, which can be passed with two i32 values on a 32-bit
5766 RegVT = MVT::getIntegerVT(OpInfo.ConstraintVT.getSizeInBits());
5767 OpInfo.CallOperand = DAG.getNode(ISD::BITCAST, DL,
5768 RegVT, OpInfo.CallOperand);
5769 OpInfo.ConstraintVT = RegVT;
5773 NumRegs = TLI.getNumRegisters(Context, OpInfo.ConstraintVT);
5777 EVT ValueVT = OpInfo.ConstraintVT;
5779 // If this is a constraint for a specific physical register, like {r17},
5781 if (unsigned AssignedReg = PhysReg.first) {
5782 const TargetRegisterClass *RC = PhysReg.second;
5783 if (OpInfo.ConstraintVT == MVT::Other)
5784 ValueVT = *RC->vt_begin();
5786 // Get the actual register value type. This is important, because the user
5787 // may have asked for (e.g.) the AX register in i32 type. We need to
5788 // remember that AX is actually i16 to get the right extension.
5789 RegVT = *RC->vt_begin();
5791 // This is a explicit reference to a physical register.
5792 Regs.push_back(AssignedReg);
5794 // If this is an expanded reference, add the rest of the regs to Regs.
5796 TargetRegisterClass::iterator I = RC->begin();
5797 for (; *I != AssignedReg; ++I)
5798 assert(I != RC->end() && "Didn't find reg!");
5800 // Already added the first reg.
5802 for (; NumRegs; --NumRegs, ++I) {
5803 assert(I != RC->end() && "Ran out of registers to allocate!");
5808 OpInfo.AssignedRegs = RegsForValue(Regs, RegVT, ValueVT);
5812 // Otherwise, if this was a reference to an LLVM register class, create vregs
5813 // for this reference.
5814 if (const TargetRegisterClass *RC = PhysReg.second) {
5815 RegVT = *RC->vt_begin();
5816 if (OpInfo.ConstraintVT == MVT::Other)
5819 // Create the appropriate number of virtual registers.
5820 MachineRegisterInfo &RegInfo = MF.getRegInfo();
5821 for (; NumRegs; --NumRegs)
5822 Regs.push_back(RegInfo.createVirtualRegister(RC));
5824 OpInfo.AssignedRegs = RegsForValue(Regs, RegVT, ValueVT);
5828 // Otherwise, we couldn't allocate enough registers for this.
5831 /// visitInlineAsm - Handle a call to an InlineAsm object.
5833 void SelectionDAGBuilder::visitInlineAsm(ImmutableCallSite CS) {
5834 const InlineAsm *IA = cast<InlineAsm>(CS.getCalledValue());
5836 /// ConstraintOperands - Information about all of the constraints.
5837 SDISelAsmOperandInfoVector ConstraintOperands;
5839 TargetLowering::AsmOperandInfoVector
5840 TargetConstraints = TLI.ParseConstraints(CS);
5842 bool hasMemory = false;
5844 unsigned ArgNo = 0; // ArgNo - The argument of the CallInst.
5845 unsigned ResNo = 0; // ResNo - The result number of the next output.
5846 for (unsigned i = 0, e = TargetConstraints.size(); i != e; ++i) {
5847 ConstraintOperands.push_back(SDISelAsmOperandInfo(TargetConstraints[i]));
5848 SDISelAsmOperandInfo &OpInfo = ConstraintOperands.back();
5850 MVT OpVT = MVT::Other;
5852 // Compute the value type for each operand.
5853 switch (OpInfo.Type) {
5854 case InlineAsm::isOutput:
5855 // Indirect outputs just consume an argument.
5856 if (OpInfo.isIndirect) {
5857 OpInfo.CallOperandVal = const_cast<Value *>(CS.getArgument(ArgNo++));
5861 // The return value of the call is this value. As such, there is no
5862 // corresponding argument.
5863 assert(!CS.getType()->isVoidTy() && "Bad inline asm!");
5864 if (StructType *STy = dyn_cast<StructType>(CS.getType())) {
5865 OpVT = TLI.getSimpleValueType(STy->getElementType(ResNo));
5867 assert(ResNo == 0 && "Asm only has one result!");
5868 OpVT = TLI.getSimpleValueType(CS.getType());
5872 case InlineAsm::isInput:
5873 OpInfo.CallOperandVal = const_cast<Value *>(CS.getArgument(ArgNo++));
5875 case InlineAsm::isClobber:
5880 // If this is an input or an indirect output, process the call argument.
5881 // BasicBlocks are labels, currently appearing only in asm's.
5882 if (OpInfo.CallOperandVal) {
5883 if (const BasicBlock *BB = dyn_cast<BasicBlock>(OpInfo.CallOperandVal)) {
5884 OpInfo.CallOperand = DAG.getBasicBlock(FuncInfo.MBBMap[BB]);
5886 OpInfo.CallOperand = getValue(OpInfo.CallOperandVal);
5889 OpVT = OpInfo.getCallOperandValEVT(*DAG.getContext(), TLI, TD).
5893 OpInfo.ConstraintVT = OpVT;
5895 // Indirect operand accesses access memory.
5896 if (OpInfo.isIndirect)
5899 for (unsigned j = 0, ee = OpInfo.Codes.size(); j != ee; ++j) {
5900 TargetLowering::ConstraintType
5901 CType = TLI.getConstraintType(OpInfo.Codes[j]);
5902 if (CType == TargetLowering::C_Memory) {
5910 SDValue Chain, Flag;
5912 // We won't need to flush pending loads if this asm doesn't touch
5913 // memory and is nonvolatile.
5914 if (hasMemory || IA->hasSideEffects())
5917 Chain = DAG.getRoot();
5919 // Second pass over the constraints: compute which constraint option to use
5920 // and assign registers to constraints that want a specific physreg.
5921 for (unsigned i = 0, e = ConstraintOperands.size(); i != e; ++i) {
5922 SDISelAsmOperandInfo &OpInfo = ConstraintOperands[i];
5924 // If this is an output operand with a matching input operand, look up the
5925 // matching input. If their types mismatch, e.g. one is an integer, the
5926 // other is floating point, or their sizes are different, flag it as an
5928 if (OpInfo.hasMatchingInput()) {
5929 SDISelAsmOperandInfo &Input = ConstraintOperands[OpInfo.MatchingInput];
5931 if (OpInfo.ConstraintVT != Input.ConstraintVT) {
5932 std::pair<unsigned, const TargetRegisterClass*> MatchRC =
5933 TLI.getRegForInlineAsmConstraint(OpInfo.ConstraintCode,
5934 OpInfo.ConstraintVT);
5935 std::pair<unsigned, const TargetRegisterClass*> InputRC =
5936 TLI.getRegForInlineAsmConstraint(Input.ConstraintCode,
5937 Input.ConstraintVT);
5938 if ((OpInfo.ConstraintVT.isInteger() !=
5939 Input.ConstraintVT.isInteger()) ||
5940 (MatchRC.second != InputRC.second)) {
5941 report_fatal_error("Unsupported asm: input constraint"
5942 " with a matching output constraint of"
5943 " incompatible type!");
5945 Input.ConstraintVT = OpInfo.ConstraintVT;
5949 // Compute the constraint code and ConstraintType to use.
5950 TLI.ComputeConstraintToUse(OpInfo, OpInfo.CallOperand, &DAG);
5952 if (OpInfo.ConstraintType == TargetLowering::C_Memory &&
5953 OpInfo.Type == InlineAsm::isClobber)
5956 // If this is a memory input, and if the operand is not indirect, do what we
5957 // need to to provide an address for the memory input.
5958 if (OpInfo.ConstraintType == TargetLowering::C_Memory &&
5959 !OpInfo.isIndirect) {
5960 assert((OpInfo.isMultipleAlternative ||
5961 (OpInfo.Type == InlineAsm::isInput)) &&
5962 "Can only indirectify direct input operands!");
5964 // Memory operands really want the address of the value. If we don't have
5965 // an indirect input, put it in the constpool if we can, otherwise spill
5966 // it to a stack slot.
5967 // TODO: This isn't quite right. We need to handle these according to
5968 // the addressing mode that the constraint wants. Also, this may take
5969 // an additional register for the computation and we don't want that
5972 // If the operand is a float, integer, or vector constant, spill to a
5973 // constant pool entry to get its address.
5974 const Value *OpVal = OpInfo.CallOperandVal;
5975 if (isa<ConstantFP>(OpVal) || isa<ConstantInt>(OpVal) ||
5976 isa<ConstantVector>(OpVal) || isa<ConstantDataVector>(OpVal)) {
5977 OpInfo.CallOperand = DAG.getConstantPool(cast<Constant>(OpVal),
5978 TLI.getPointerTy());
5980 // Otherwise, create a stack slot and emit a store to it before the
5982 Type *Ty = OpVal->getType();
5983 uint64_t TySize = TLI.getDataLayout()->getTypeAllocSize(Ty);
5984 unsigned Align = TLI.getDataLayout()->getPrefTypeAlignment(Ty);
5985 MachineFunction &MF = DAG.getMachineFunction();
5986 int SSFI = MF.getFrameInfo()->CreateStackObject(TySize, Align, false);
5987 SDValue StackSlot = DAG.getFrameIndex(SSFI, TLI.getPointerTy());
5988 Chain = DAG.getStore(Chain, getCurDebugLoc(),
5989 OpInfo.CallOperand, StackSlot,
5990 MachinePointerInfo::getFixedStack(SSFI),
5992 OpInfo.CallOperand = StackSlot;
5995 // There is no longer a Value* corresponding to this operand.
5996 OpInfo.CallOperandVal = 0;
5998 // It is now an indirect operand.
5999 OpInfo.isIndirect = true;
6002 // If this constraint is for a specific register, allocate it before
6004 if (OpInfo.ConstraintType == TargetLowering::C_Register)
6005 GetRegistersForValue(DAG, TLI, getCurDebugLoc(), OpInfo);
6008 // Second pass - Loop over all of the operands, assigning virtual or physregs
6009 // to register class operands.
6010 for (unsigned i = 0, e = ConstraintOperands.size(); i != e; ++i) {
6011 SDISelAsmOperandInfo &OpInfo = ConstraintOperands[i];
6013 // C_Register operands have already been allocated, Other/Memory don't need
6015 if (OpInfo.ConstraintType == TargetLowering::C_RegisterClass)
6016 GetRegistersForValue(DAG, TLI, getCurDebugLoc(), OpInfo);
6019 // AsmNodeOperands - The operands for the ISD::INLINEASM node.
6020 std::vector<SDValue> AsmNodeOperands;
6021 AsmNodeOperands.push_back(SDValue()); // reserve space for input chain
6022 AsmNodeOperands.push_back(
6023 DAG.getTargetExternalSymbol(IA->getAsmString().c_str(),
6024 TLI.getPointerTy()));
6026 // If we have a !srcloc metadata node associated with it, we want to attach
6027 // this to the ultimately generated inline asm machineinstr. To do this, we
6028 // pass in the third operand as this (potentially null) inline asm MDNode.
6029 const MDNode *SrcLoc = CS.getInstruction()->getMetadata("srcloc");
6030 AsmNodeOperands.push_back(DAG.getMDNode(SrcLoc));
6032 // Remember the HasSideEffect, AlignStack, AsmDialect, MayLoad and MayStore
6033 // bits as operand 3.
6034 unsigned ExtraInfo = 0;
6035 if (IA->hasSideEffects())
6036 ExtraInfo |= InlineAsm::Extra_HasSideEffects;
6037 if (IA->isAlignStack())
6038 ExtraInfo |= InlineAsm::Extra_IsAlignStack;
6039 // Set the asm dialect.
6040 ExtraInfo |= IA->getDialect() * InlineAsm::Extra_AsmDialect;
6042 // Determine if this InlineAsm MayLoad or MayStore based on the constraints.
6043 for (unsigned i = 0, e = TargetConstraints.size(); i != e; ++i) {
6044 TargetLowering::AsmOperandInfo &OpInfo = TargetConstraints[i];
6046 // Compute the constraint code and ConstraintType to use.
6047 TLI.ComputeConstraintToUse(OpInfo, SDValue());
6049 // Ideally, we would only check against memory constraints. However, the
6050 // meaning of an other constraint can be target-specific and we can't easily
6051 // reason about it. Therefore, be conservative and set MayLoad/MayStore
6052 // for other constriants as well.
6053 if (OpInfo.ConstraintType == TargetLowering::C_Memory ||
6054 OpInfo.ConstraintType == TargetLowering::C_Other) {
6055 if (OpInfo.Type == InlineAsm::isInput)
6056 ExtraInfo |= InlineAsm::Extra_MayLoad;
6057 else if (OpInfo.Type == InlineAsm::isOutput)
6058 ExtraInfo |= InlineAsm::Extra_MayStore;
6059 else if (OpInfo.Type == InlineAsm::isClobber)
6060 ExtraInfo |= (InlineAsm::Extra_MayLoad | InlineAsm::Extra_MayStore);
6064 AsmNodeOperands.push_back(DAG.getTargetConstant(ExtraInfo,
6065 TLI.getPointerTy()));
6067 // Loop over all of the inputs, copying the operand values into the
6068 // appropriate registers and processing the output regs.
6069 RegsForValue RetValRegs;
6071 // IndirectStoresToEmit - The set of stores to emit after the inline asm node.
6072 std::vector<std::pair<RegsForValue, Value*> > IndirectStoresToEmit;
6074 for (unsigned i = 0, e = ConstraintOperands.size(); i != e; ++i) {
6075 SDISelAsmOperandInfo &OpInfo = ConstraintOperands[i];
6077 switch (OpInfo.Type) {
6078 case InlineAsm::isOutput: {
6079 if (OpInfo.ConstraintType != TargetLowering::C_RegisterClass &&
6080 OpInfo.ConstraintType != TargetLowering::C_Register) {
6081 // Memory output, or 'other' output (e.g. 'X' constraint).
6082 assert(OpInfo.isIndirect && "Memory output must be indirect operand");
6084 // Add information to the INLINEASM node to know about this output.
6085 unsigned OpFlags = InlineAsm::getFlagWord(InlineAsm::Kind_Mem, 1);
6086 AsmNodeOperands.push_back(DAG.getTargetConstant(OpFlags,
6087 TLI.getPointerTy()));
6088 AsmNodeOperands.push_back(OpInfo.CallOperand);
6092 // Otherwise, this is a register or register class output.
6094 // Copy the output from the appropriate register. Find a register that
6096 if (OpInfo.AssignedRegs.Regs.empty()) {
6097 LLVMContext &Ctx = *DAG.getContext();
6098 Ctx.emitError(CS.getInstruction(),
6099 "couldn't allocate output register for constraint '" +
6100 Twine(OpInfo.ConstraintCode) + "'");
6104 // If this is an indirect operand, store through the pointer after the
6106 if (OpInfo.isIndirect) {
6107 IndirectStoresToEmit.push_back(std::make_pair(OpInfo.AssignedRegs,
6108 OpInfo.CallOperandVal));
6110 // This is the result value of the call.
6111 assert(!CS.getType()->isVoidTy() && "Bad inline asm!");
6112 // Concatenate this output onto the outputs list.
6113 RetValRegs.append(OpInfo.AssignedRegs);
6116 // Add information to the INLINEASM node to know that this register is
6118 OpInfo.AssignedRegs.AddInlineAsmOperands(OpInfo.isEarlyClobber ?
6119 InlineAsm::Kind_RegDefEarlyClobber :
6120 InlineAsm::Kind_RegDef,
6127 case InlineAsm::isInput: {
6128 SDValue InOperandVal = OpInfo.CallOperand;
6130 if (OpInfo.isMatchingInputConstraint()) { // Matching constraint?
6131 // If this is required to match an output register we have already set,
6132 // just use its register.
6133 unsigned OperandNo = OpInfo.getMatchedOperand();
6135 // Scan until we find the definition we already emitted of this operand.
6136 // When we find it, create a RegsForValue operand.
6137 unsigned CurOp = InlineAsm::Op_FirstOperand;
6138 for (; OperandNo; --OperandNo) {
6139 // Advance to the next operand.
6141 cast<ConstantSDNode>(AsmNodeOperands[CurOp])->getZExtValue();
6142 assert((InlineAsm::isRegDefKind(OpFlag) ||
6143 InlineAsm::isRegDefEarlyClobberKind(OpFlag) ||
6144 InlineAsm::isMemKind(OpFlag)) && "Skipped past definitions?");
6145 CurOp += InlineAsm::getNumOperandRegisters(OpFlag)+1;
6149 cast<ConstantSDNode>(AsmNodeOperands[CurOp])->getZExtValue();
6150 if (InlineAsm::isRegDefKind(OpFlag) ||
6151 InlineAsm::isRegDefEarlyClobberKind(OpFlag)) {
6152 // Add (OpFlag&0xffff)>>3 registers to MatchedRegs.
6153 if (OpInfo.isIndirect) {
6154 // This happens on gcc/testsuite/gcc.dg/pr8788-1.c
6155 LLVMContext &Ctx = *DAG.getContext();
6156 Ctx.emitError(CS.getInstruction(), "inline asm not supported yet:"
6157 " don't know how to handle tied "
6158 "indirect register inputs");
6161 RegsForValue MatchedRegs;
6162 MatchedRegs.ValueVTs.push_back(InOperandVal.getValueType());
6163 MVT RegVT = AsmNodeOperands[CurOp+1].getSimpleValueType();
6164 MatchedRegs.RegVTs.push_back(RegVT);
6165 MachineRegisterInfo &RegInfo = DAG.getMachineFunction().getRegInfo();
6166 for (unsigned i = 0, e = InlineAsm::getNumOperandRegisters(OpFlag);
6168 MatchedRegs.Regs.push_back
6169 (RegInfo.createVirtualRegister(TLI.getRegClassFor(RegVT)));
6171 // Use the produced MatchedRegs object to
6172 MatchedRegs.getCopyToRegs(InOperandVal, DAG, getCurDebugLoc(),
6173 Chain, &Flag, CS.getInstruction());
6174 MatchedRegs.AddInlineAsmOperands(InlineAsm::Kind_RegUse,
6175 true, OpInfo.getMatchedOperand(),
6176 DAG, AsmNodeOperands);
6180 assert(InlineAsm::isMemKind(OpFlag) && "Unknown matching constraint!");
6181 assert(InlineAsm::getNumOperandRegisters(OpFlag) == 1 &&
6182 "Unexpected number of operands");
6183 // Add information to the INLINEASM node to know about this input.
6184 // See InlineAsm.h isUseOperandTiedToDef.
6185 OpFlag = InlineAsm::getFlagWordForMatchingOp(OpFlag,
6186 OpInfo.getMatchedOperand());
6187 AsmNodeOperands.push_back(DAG.getTargetConstant(OpFlag,
6188 TLI.getPointerTy()));
6189 AsmNodeOperands.push_back(AsmNodeOperands[CurOp+1]);
6193 // Treat indirect 'X' constraint as memory.
6194 if (OpInfo.ConstraintType == TargetLowering::C_Other &&
6196 OpInfo.ConstraintType = TargetLowering::C_Memory;
6198 if (OpInfo.ConstraintType == TargetLowering::C_Other) {
6199 std::vector<SDValue> Ops;
6200 TLI.LowerAsmOperandForConstraint(InOperandVal, OpInfo.ConstraintCode,
6203 LLVMContext &Ctx = *DAG.getContext();
6204 Ctx.emitError(CS.getInstruction(),
6205 "invalid operand for inline asm constraint '" +
6206 Twine(OpInfo.ConstraintCode) + "'");
6210 // Add information to the INLINEASM node to know about this input.
6211 unsigned ResOpType =
6212 InlineAsm::getFlagWord(InlineAsm::Kind_Imm, Ops.size());
6213 AsmNodeOperands.push_back(DAG.getTargetConstant(ResOpType,
6214 TLI.getPointerTy()));
6215 AsmNodeOperands.insert(AsmNodeOperands.end(), Ops.begin(), Ops.end());
6219 if (OpInfo.ConstraintType == TargetLowering::C_Memory) {
6220 assert(OpInfo.isIndirect && "Operand must be indirect to be a mem!");
6221 assert(InOperandVal.getValueType() == TLI.getPointerTy() &&
6222 "Memory operands expect pointer values");
6224 // Add information to the INLINEASM node to know about this input.
6225 unsigned ResOpType = InlineAsm::getFlagWord(InlineAsm::Kind_Mem, 1);
6226 AsmNodeOperands.push_back(DAG.getTargetConstant(ResOpType,
6227 TLI.getPointerTy()));
6228 AsmNodeOperands.push_back(InOperandVal);
6232 assert((OpInfo.ConstraintType == TargetLowering::C_RegisterClass ||
6233 OpInfo.ConstraintType == TargetLowering::C_Register) &&
6234 "Unknown constraint type!");
6236 // TODO: Support this.
6237 if (OpInfo.isIndirect) {
6238 LLVMContext &Ctx = *DAG.getContext();
6239 Ctx.emitError(CS.getInstruction(),
6240 "Don't know how to handle indirect register inputs yet "
6241 "for constraint '" + Twine(OpInfo.ConstraintCode) + "'");
6245 // Copy the input into the appropriate registers.
6246 if (OpInfo.AssignedRegs.Regs.empty()) {
6247 LLVMContext &Ctx = *DAG.getContext();
6248 Ctx.emitError(CS.getInstruction(),
6249 "couldn't allocate input reg for constraint '" +
6250 Twine(OpInfo.ConstraintCode) + "'");
6254 OpInfo.AssignedRegs.getCopyToRegs(InOperandVal, DAG, getCurDebugLoc(),
6255 Chain, &Flag, CS.getInstruction());
6257 OpInfo.AssignedRegs.AddInlineAsmOperands(InlineAsm::Kind_RegUse, false, 0,
6258 DAG, AsmNodeOperands);
6261 case InlineAsm::isClobber: {
6262 // Add the clobbered value to the operand list, so that the register
6263 // allocator is aware that the physreg got clobbered.
6264 if (!OpInfo.AssignedRegs.Regs.empty())
6265 OpInfo.AssignedRegs.AddInlineAsmOperands(InlineAsm::Kind_Clobber,
6273 // Finish up input operands. Set the input chain and add the flag last.
6274 AsmNodeOperands[InlineAsm::Op_InputChain] = Chain;
6275 if (Flag.getNode()) AsmNodeOperands.push_back(Flag);
6277 Chain = DAG.getNode(ISD::INLINEASM, getCurDebugLoc(),
6278 DAG.getVTList(MVT::Other, MVT::Glue),
6279 &AsmNodeOperands[0], AsmNodeOperands.size());
6280 Flag = Chain.getValue(1);
6282 // If this asm returns a register value, copy the result from that register
6283 // and set it as the value of the call.
6284 if (!RetValRegs.Regs.empty()) {
6285 SDValue Val = RetValRegs.getCopyFromRegs(DAG, FuncInfo, getCurDebugLoc(),
6286 Chain, &Flag, CS.getInstruction());
6288 // FIXME: Why don't we do this for inline asms with MRVs?
6289 if (CS.getType()->isSingleValueType() && CS.getType()->isSized()) {
6290 EVT ResultType = TLI.getValueType(CS.getType());
6292 // If any of the results of the inline asm is a vector, it may have the
6293 // wrong width/num elts. This can happen for register classes that can
6294 // contain multiple different value types. The preg or vreg allocated may
6295 // not have the same VT as was expected. Convert it to the right type
6296 // with bit_convert.
6297 if (ResultType != Val.getValueType() && Val.getValueType().isVector()) {
6298 Val = DAG.getNode(ISD::BITCAST, getCurDebugLoc(),
6301 } else if (ResultType != Val.getValueType() &&
6302 ResultType.isInteger() && Val.getValueType().isInteger()) {
6303 // If a result value was tied to an input value, the computed result may
6304 // have a wider width than the expected result. Extract the relevant
6306 Val = DAG.getNode(ISD::TRUNCATE, getCurDebugLoc(), ResultType, Val);
6309 assert(ResultType == Val.getValueType() && "Asm result value mismatch!");
6312 setValue(CS.getInstruction(), Val);
6313 // Don't need to use this as a chain in this case.
6314 if (!IA->hasSideEffects() && !hasMemory && IndirectStoresToEmit.empty())
6318 std::vector<std::pair<SDValue, const Value *> > StoresToEmit;
6320 // Process indirect outputs, first output all of the flagged copies out of
6322 for (unsigned i = 0, e = IndirectStoresToEmit.size(); i != e; ++i) {
6323 RegsForValue &OutRegs = IndirectStoresToEmit[i].first;
6324 const Value *Ptr = IndirectStoresToEmit[i].second;
6325 SDValue OutVal = OutRegs.getCopyFromRegs(DAG, FuncInfo, getCurDebugLoc(),
6327 StoresToEmit.push_back(std::make_pair(OutVal, Ptr));
6330 // Emit the non-flagged stores from the physregs.
6331 SmallVector<SDValue, 8> OutChains;
6332 for (unsigned i = 0, e = StoresToEmit.size(); i != e; ++i) {
6333 SDValue Val = DAG.getStore(Chain, getCurDebugLoc(),
6334 StoresToEmit[i].first,
6335 getValue(StoresToEmit[i].second),
6336 MachinePointerInfo(StoresToEmit[i].second),
6338 OutChains.push_back(Val);
6341 if (!OutChains.empty())
6342 Chain = DAG.getNode(ISD::TokenFactor, getCurDebugLoc(), MVT::Other,
6343 &OutChains[0], OutChains.size());
6348 void SelectionDAGBuilder::visitVAStart(const CallInst &I) {
6349 DAG.setRoot(DAG.getNode(ISD::VASTART, getCurDebugLoc(),
6350 MVT::Other, getRoot(),
6351 getValue(I.getArgOperand(0)),
6352 DAG.getSrcValue(I.getArgOperand(0))));
6355 void SelectionDAGBuilder::visitVAArg(const VAArgInst &I) {
6356 const DataLayout &TD = *TLI.getDataLayout();
6357 SDValue V = DAG.getVAArg(TLI.getValueType(I.getType()), getCurDebugLoc(),
6358 getRoot(), getValue(I.getOperand(0)),
6359 DAG.getSrcValue(I.getOperand(0)),
6360 TD.getABITypeAlignment(I.getType()));
6362 DAG.setRoot(V.getValue(1));
6365 void SelectionDAGBuilder::visitVAEnd(const CallInst &I) {
6366 DAG.setRoot(DAG.getNode(ISD::VAEND, getCurDebugLoc(),
6367 MVT::Other, getRoot(),
6368 getValue(I.getArgOperand(0)),
6369 DAG.getSrcValue(I.getArgOperand(0))));
6372 void SelectionDAGBuilder::visitVACopy(const CallInst &I) {
6373 DAG.setRoot(DAG.getNode(ISD::VACOPY, getCurDebugLoc(),
6374 MVT::Other, getRoot(),
6375 getValue(I.getArgOperand(0)),
6376 getValue(I.getArgOperand(1)),
6377 DAG.getSrcValue(I.getArgOperand(0)),
6378 DAG.getSrcValue(I.getArgOperand(1))));
6381 /// TargetLowering::LowerCallTo - This is the default LowerCallTo
6382 /// implementation, which just calls LowerCall.
6383 /// FIXME: When all targets are
6384 /// migrated to using LowerCall, this hook should be integrated into SDISel.
6385 std::pair<SDValue, SDValue>
6386 TargetLowering::LowerCallTo(TargetLowering::CallLoweringInfo &CLI) const {
6387 // Handle all of the outgoing arguments.
6389 CLI.OutVals.clear();
6390 ArgListTy &Args = CLI.Args;
6391 for (unsigned i = 0, e = Args.size(); i != e; ++i) {
6392 SmallVector<EVT, 4> ValueVTs;
6393 ComputeValueVTs(*this, Args[i].Ty, ValueVTs);
6394 for (unsigned Value = 0, NumValues = ValueVTs.size();
6395 Value != NumValues; ++Value) {
6396 EVT VT = ValueVTs[Value];
6397 Type *ArgTy = VT.getTypeForEVT(CLI.RetTy->getContext());
6398 SDValue Op = SDValue(Args[i].Node.getNode(),
6399 Args[i].Node.getResNo() + Value);
6400 ISD::ArgFlagsTy Flags;
6401 unsigned OriginalAlignment =
6402 getDataLayout()->getABITypeAlignment(ArgTy);
6408 if (Args[i].isInReg)
6412 if (Args[i].isByVal) {
6414 PointerType *Ty = cast<PointerType>(Args[i].Ty);
6415 Type *ElementTy = Ty->getElementType();
6416 Flags.setByValSize(getDataLayout()->getTypeAllocSize(ElementTy));
6417 // For ByVal, alignment should come from FE. BE will guess if this
6418 // info is not there but there are cases it cannot get right.
6419 unsigned FrameAlign;
6420 if (Args[i].Alignment)
6421 FrameAlign = Args[i].Alignment;
6423 FrameAlign = getByValTypeAlignment(ElementTy);
6424 Flags.setByValAlign(FrameAlign);
6428 Flags.setOrigAlign(OriginalAlignment);
6430 MVT PartVT = getRegisterType(CLI.RetTy->getContext(), VT);
6431 unsigned NumParts = getNumRegisters(CLI.RetTy->getContext(), VT);
6432 SmallVector<SDValue, 4> Parts(NumParts);
6433 ISD::NodeType ExtendKind = ISD::ANY_EXTEND;
6436 ExtendKind = ISD::SIGN_EXTEND;
6437 else if (Args[i].isZExt)
6438 ExtendKind = ISD::ZERO_EXTEND;
6440 getCopyToParts(CLI.DAG, CLI.DL, Op, &Parts[0], NumParts,
6441 PartVT, CLI.CS ? CLI.CS->getInstruction() : 0, ExtendKind);
6443 for (unsigned j = 0; j != NumParts; ++j) {
6444 // if it isn't first piece, alignment must be 1
6445 ISD::OutputArg MyFlags(Flags, Parts[j].getValueType(),
6446 i < CLI.NumFixedArgs,
6447 i, j*Parts[j].getValueType().getStoreSize());
6448 if (NumParts > 1 && j == 0)
6449 MyFlags.Flags.setSplit();
6451 MyFlags.Flags.setOrigAlign(1);
6453 CLI.Outs.push_back(MyFlags);
6454 CLI.OutVals.push_back(Parts[j]);
6459 // Handle the incoming return values from the call.
6461 SmallVector<EVT, 4> RetTys;
6462 ComputeValueVTs(*this, CLI.RetTy, RetTys);
6463 for (unsigned I = 0, E = RetTys.size(); I != E; ++I) {
6465 MVT RegisterVT = getRegisterType(CLI.RetTy->getContext(), VT);
6466 unsigned NumRegs = getNumRegisters(CLI.RetTy->getContext(), VT);
6467 for (unsigned i = 0; i != NumRegs; ++i) {
6468 ISD::InputArg MyFlags;
6469 MyFlags.VT = RegisterVT;
6470 MyFlags.Used = CLI.IsReturnValueUsed;
6472 MyFlags.Flags.setSExt();
6474 MyFlags.Flags.setZExt();
6476 MyFlags.Flags.setInReg();
6477 CLI.Ins.push_back(MyFlags);
6481 SmallVector<SDValue, 4> InVals;
6482 CLI.Chain = LowerCall(CLI, InVals);
6484 // Verify that the target's LowerCall behaved as expected.
6485 assert(CLI.Chain.getNode() && CLI.Chain.getValueType() == MVT::Other &&
6486 "LowerCall didn't return a valid chain!");
6487 assert((!CLI.IsTailCall || InVals.empty()) &&
6488 "LowerCall emitted a return value for a tail call!");
6489 assert((CLI.IsTailCall || InVals.size() == CLI.Ins.size()) &&
6490 "LowerCall didn't emit the correct number of values!");
6492 // For a tail call, the return value is merely live-out and there aren't
6493 // any nodes in the DAG representing it. Return a special value to
6494 // indicate that a tail call has been emitted and no more Instructions
6495 // should be processed in the current block.
6496 if (CLI.IsTailCall) {
6497 CLI.DAG.setRoot(CLI.Chain);
6498 return std::make_pair(SDValue(), SDValue());
6501 DEBUG(for (unsigned i = 0, e = CLI.Ins.size(); i != e; ++i) {
6502 assert(InVals[i].getNode() &&
6503 "LowerCall emitted a null value!");
6504 assert(EVT(CLI.Ins[i].VT) == InVals[i].getValueType() &&
6505 "LowerCall emitted a value with the wrong type!");
6508 // Collect the legal value parts into potentially illegal values
6509 // that correspond to the original function's return values.
6510 ISD::NodeType AssertOp = ISD::DELETED_NODE;
6512 AssertOp = ISD::AssertSext;
6513 else if (CLI.RetZExt)
6514 AssertOp = ISD::AssertZext;
6515 SmallVector<SDValue, 4> ReturnValues;
6516 unsigned CurReg = 0;
6517 for (unsigned I = 0, E = RetTys.size(); I != E; ++I) {
6519 MVT RegisterVT = getRegisterType(CLI.RetTy->getContext(), VT);
6520 unsigned NumRegs = getNumRegisters(CLI.RetTy->getContext(), VT);
6522 ReturnValues.push_back(getCopyFromParts(CLI.DAG, CLI.DL, &InVals[CurReg],
6523 NumRegs, RegisterVT, VT, NULL,
6528 // For a function returning void, there is no return value. We can't create
6529 // such a node, so we just return a null return value in that case. In
6530 // that case, nothing will actually look at the value.
6531 if (ReturnValues.empty())
6532 return std::make_pair(SDValue(), CLI.Chain);
6534 SDValue Res = CLI.DAG.getNode(ISD::MERGE_VALUES, CLI.DL,
6535 CLI.DAG.getVTList(&RetTys[0], RetTys.size()),
6536 &ReturnValues[0], ReturnValues.size());
6537 return std::make_pair(Res, CLI.Chain);
6540 void TargetLowering::LowerOperationWrapper(SDNode *N,
6541 SmallVectorImpl<SDValue> &Results,
6542 SelectionDAG &DAG) const {
6543 SDValue Res = LowerOperation(SDValue(N, 0), DAG);
6545 Results.push_back(Res);
6548 SDValue TargetLowering::LowerOperation(SDValue Op, SelectionDAG &DAG) const {
6549 llvm_unreachable("LowerOperation not implemented for this target!");
6553 SelectionDAGBuilder::CopyValueToVirtualRegister(const Value *V, unsigned Reg) {
6554 SDValue Op = getNonRegisterValue(V);
6555 assert((Op.getOpcode() != ISD::CopyFromReg ||
6556 cast<RegisterSDNode>(Op.getOperand(1))->getReg() != Reg) &&
6557 "Copy from a reg to the same reg!");
6558 assert(!TargetRegisterInfo::isPhysicalRegister(Reg) && "Is a physreg");
6560 RegsForValue RFV(V->getContext(), TLI, Reg, V->getType());
6561 SDValue Chain = DAG.getEntryNode();
6562 RFV.getCopyToRegs(Op, DAG, getCurDebugLoc(), Chain, 0, V);
6563 PendingExports.push_back(Chain);
6566 #include "llvm/CodeGen/SelectionDAGISel.h"
6568 /// isOnlyUsedInEntryBlock - If the specified argument is only used in the
6569 /// entry block, return true. This includes arguments used by switches, since
6570 /// the switch may expand into multiple basic blocks.
6571 static bool isOnlyUsedInEntryBlock(const Argument *A, bool FastISel) {
6572 // With FastISel active, we may be splitting blocks, so force creation
6573 // of virtual registers for all non-dead arguments.
6575 return A->use_empty();
6577 const BasicBlock *Entry = A->getParent()->begin();
6578 for (Value::const_use_iterator UI = A->use_begin(), E = A->use_end();
6580 const User *U = *UI;
6581 if (cast<Instruction>(U)->getParent() != Entry || isa<SwitchInst>(U))
6582 return false; // Use not in entry block.
6587 void SelectionDAGISel::LowerArguments(const BasicBlock *LLVMBB) {
6588 // If this is the entry block, emit arguments.
6589 const Function &F = *LLVMBB->getParent();
6590 SelectionDAG &DAG = SDB->DAG;
6591 DebugLoc dl = SDB->getCurDebugLoc();
6592 const DataLayout *TD = TLI.getDataLayout();
6593 SmallVector<ISD::InputArg, 16> Ins;
6595 // Check whether the function can return without sret-demotion.
6596 SmallVector<ISD::OutputArg, 4> Outs;
6597 GetReturnInfo(F.getReturnType(), F.getAttributes(), Outs, TLI);
6599 if (!FuncInfo->CanLowerReturn) {
6600 // Put in an sret pointer parameter before all the other parameters.
6601 SmallVector<EVT, 1> ValueVTs;
6602 ComputeValueVTs(TLI, PointerType::getUnqual(F.getReturnType()), ValueVTs);
6604 // NOTE: Assuming that a pointer will never break down to more than one VT
6606 ISD::ArgFlagsTy Flags;
6608 MVT RegisterVT = TLI.getRegisterType(*DAG.getContext(), ValueVTs[0]);
6609 ISD::InputArg RetArg(Flags, RegisterVT, true, 0, 0);
6610 Ins.push_back(RetArg);
6613 // Set up the incoming argument description vector.
6615 for (Function::const_arg_iterator I = F.arg_begin(), E = F.arg_end();
6616 I != E; ++I, ++Idx) {
6617 SmallVector<EVT, 4> ValueVTs;
6618 ComputeValueVTs(TLI, I->getType(), ValueVTs);
6619 bool isArgValueUsed = !I->use_empty();
6620 for (unsigned Value = 0, NumValues = ValueVTs.size();
6621 Value != NumValues; ++Value) {
6622 EVT VT = ValueVTs[Value];
6623 Type *ArgTy = VT.getTypeForEVT(*DAG.getContext());
6624 ISD::ArgFlagsTy Flags;
6625 unsigned OriginalAlignment =
6626 TD->getABITypeAlignment(ArgTy);
6628 if (F.getAttributes().hasAttribute(Idx, Attribute::ZExt))
6630 if (F.getAttributes().hasAttribute(Idx, Attribute::SExt))
6632 if (F.getAttributes().hasAttribute(Idx, Attribute::InReg))
6634 if (F.getAttributes().hasAttribute(Idx, Attribute::StructRet))
6636 if (F.getAttributes().hasAttribute(Idx, Attribute::ByVal)) {
6638 PointerType *Ty = cast<PointerType>(I->getType());
6639 Type *ElementTy = Ty->getElementType();
6640 Flags.setByValSize(TD->getTypeAllocSize(ElementTy));
6641 // For ByVal, alignment should be passed from FE. BE will guess if
6642 // this info is not there but there are cases it cannot get right.
6643 unsigned FrameAlign;
6644 if (F.getParamAlignment(Idx))
6645 FrameAlign = F.getParamAlignment(Idx);
6647 FrameAlign = TLI.getByValTypeAlignment(ElementTy);
6648 Flags.setByValAlign(FrameAlign);
6650 if (F.getAttributes().hasAttribute(Idx, Attribute::Nest))
6652 Flags.setOrigAlign(OriginalAlignment);
6654 MVT RegisterVT = TLI.getRegisterType(*CurDAG->getContext(), VT);
6655 unsigned NumRegs = TLI.getNumRegisters(*CurDAG->getContext(), VT);
6656 for (unsigned i = 0; i != NumRegs; ++i) {
6657 ISD::InputArg MyFlags(Flags, RegisterVT, isArgValueUsed,
6658 Idx-1, i*RegisterVT.getStoreSize());
6659 if (NumRegs > 1 && i == 0)
6660 MyFlags.Flags.setSplit();
6661 // if it isn't first piece, alignment must be 1
6663 MyFlags.Flags.setOrigAlign(1);
6664 Ins.push_back(MyFlags);
6669 // Call the target to set up the argument values.
6670 SmallVector<SDValue, 8> InVals;
6671 SDValue NewRoot = TLI.LowerFormalArguments(DAG.getRoot(), F.getCallingConv(),
6675 // Verify that the target's LowerFormalArguments behaved as expected.
6676 assert(NewRoot.getNode() && NewRoot.getValueType() == MVT::Other &&
6677 "LowerFormalArguments didn't return a valid chain!");
6678 assert(InVals.size() == Ins.size() &&
6679 "LowerFormalArguments didn't emit the correct number of values!");
6681 for (unsigned i = 0, e = Ins.size(); i != e; ++i) {
6682 assert(InVals[i].getNode() &&
6683 "LowerFormalArguments emitted a null value!");
6684 assert(EVT(Ins[i].VT) == InVals[i].getValueType() &&
6685 "LowerFormalArguments emitted a value with the wrong type!");
6689 // Update the DAG with the new chain value resulting from argument lowering.
6690 DAG.setRoot(NewRoot);
6692 // Set up the argument values.
6695 if (!FuncInfo->CanLowerReturn) {
6696 // Create a virtual register for the sret pointer, and put in a copy
6697 // from the sret argument into it.
6698 SmallVector<EVT, 1> ValueVTs;
6699 ComputeValueVTs(TLI, PointerType::getUnqual(F.getReturnType()), ValueVTs);
6700 MVT VT = ValueVTs[0].getSimpleVT();
6701 MVT RegVT = TLI.getRegisterType(*CurDAG->getContext(), VT);
6702 ISD::NodeType AssertOp = ISD::DELETED_NODE;
6703 SDValue ArgValue = getCopyFromParts(DAG, dl, &InVals[0], 1,
6704 RegVT, VT, NULL, AssertOp);
6706 MachineFunction& MF = SDB->DAG.getMachineFunction();
6707 MachineRegisterInfo& RegInfo = MF.getRegInfo();
6708 unsigned SRetReg = RegInfo.createVirtualRegister(TLI.getRegClassFor(RegVT));
6709 FuncInfo->DemoteRegister = SRetReg;
6710 NewRoot = SDB->DAG.getCopyToReg(NewRoot, SDB->getCurDebugLoc(),
6712 DAG.setRoot(NewRoot);
6714 // i indexes lowered arguments. Bump it past the hidden sret argument.
6715 // Idx indexes LLVM arguments. Don't touch it.
6719 for (Function::const_arg_iterator I = F.arg_begin(), E = F.arg_end(); I != E;
6721 SmallVector<SDValue, 4> ArgValues;
6722 SmallVector<EVT, 4> ValueVTs;
6723 ComputeValueVTs(TLI, I->getType(), ValueVTs);
6724 unsigned NumValues = ValueVTs.size();
6726 // If this argument is unused then remember its value. It is used to generate
6727 // debugging information.
6728 if (I->use_empty() && NumValues)
6729 SDB->setUnusedArgValue(I, InVals[i]);
6731 for (unsigned Val = 0; Val != NumValues; ++Val) {
6732 EVT VT = ValueVTs[Val];
6733 MVT PartVT = TLI.getRegisterType(*CurDAG->getContext(), VT);
6734 unsigned NumParts = TLI.getNumRegisters(*CurDAG->getContext(), VT);
6736 if (!I->use_empty()) {
6737 ISD::NodeType AssertOp = ISD::DELETED_NODE;
6738 if (F.getAttributes().hasAttribute(Idx, Attribute::SExt))
6739 AssertOp = ISD::AssertSext;
6740 else if (F.getAttributes().hasAttribute(Idx, Attribute::ZExt))
6741 AssertOp = ISD::AssertZext;
6743 ArgValues.push_back(getCopyFromParts(DAG, dl, &InVals[i],
6744 NumParts, PartVT, VT,
6751 // We don't need to do anything else for unused arguments.
6752 if (ArgValues.empty())
6755 // Note down frame index.
6756 if (FrameIndexSDNode *FI =
6757 dyn_cast<FrameIndexSDNode>(ArgValues[0].getNode()))
6758 FuncInfo->setArgumentFrameIndex(I, FI->getIndex());
6760 SDValue Res = DAG.getMergeValues(&ArgValues[0], NumValues,
6761 SDB->getCurDebugLoc());
6763 SDB->setValue(I, Res);
6764 if (!TM.Options.EnableFastISel && Res.getOpcode() == ISD::BUILD_PAIR) {
6765 if (LoadSDNode *LNode =
6766 dyn_cast<LoadSDNode>(Res.getOperand(0).getNode()))
6767 if (FrameIndexSDNode *FI =
6768 dyn_cast<FrameIndexSDNode>(LNode->getBasePtr().getNode()))
6769 FuncInfo->setArgumentFrameIndex(I, FI->getIndex());
6772 // If this argument is live outside of the entry block, insert a copy from
6773 // wherever we got it to the vreg that other BB's will reference it as.
6774 if (!TM.Options.EnableFastISel && Res.getOpcode() == ISD::CopyFromReg) {
6775 // If we can, though, try to skip creating an unnecessary vreg.
6776 // FIXME: This isn't very clean... it would be nice to make this more
6777 // general. It's also subtly incompatible with the hacks FastISel
6779 unsigned Reg = cast<RegisterSDNode>(Res.getOperand(1))->getReg();
6780 if (TargetRegisterInfo::isVirtualRegister(Reg)) {
6781 FuncInfo->ValueMap[I] = Reg;
6785 if (!isOnlyUsedInEntryBlock(I, TM.Options.EnableFastISel)) {
6786 FuncInfo->InitializeRegForValue(I);
6787 SDB->CopyToExportRegsIfNeeded(I);
6791 assert(i == InVals.size() && "Argument register count mismatch!");
6793 // Finally, if the target has anything special to do, allow it to do so.
6794 // FIXME: this should insert code into the DAG!
6795 EmitFunctionEntryCode();
6798 /// Handle PHI nodes in successor blocks. Emit code into the SelectionDAG to
6799 /// ensure constants are generated when needed. Remember the virtual registers
6800 /// that need to be added to the Machine PHI nodes as input. We cannot just
6801 /// directly add them, because expansion might result in multiple MBB's for one
6802 /// BB. As such, the start of the BB might correspond to a different MBB than
6806 SelectionDAGBuilder::HandlePHINodesInSuccessorBlocks(const BasicBlock *LLVMBB) {
6807 const TerminatorInst *TI = LLVMBB->getTerminator();
6809 SmallPtrSet<MachineBasicBlock *, 4> SuccsHandled;
6811 // Check successor nodes' PHI nodes that expect a constant to be available
6813 for (unsigned succ = 0, e = TI->getNumSuccessors(); succ != e; ++succ) {
6814 const BasicBlock *SuccBB = TI->getSuccessor(succ);
6815 if (!isa<PHINode>(SuccBB->begin())) continue;
6816 MachineBasicBlock *SuccMBB = FuncInfo.MBBMap[SuccBB];
6818 // If this terminator has multiple identical successors (common for
6819 // switches), only handle each succ once.
6820 if (!SuccsHandled.insert(SuccMBB)) continue;
6822 MachineBasicBlock::iterator MBBI = SuccMBB->begin();
6824 // At this point we know that there is a 1-1 correspondence between LLVM PHI
6825 // nodes and Machine PHI nodes, but the incoming operands have not been
6827 for (BasicBlock::const_iterator I = SuccBB->begin();
6828 const PHINode *PN = dyn_cast<PHINode>(I); ++I) {
6829 // Ignore dead phi's.
6830 if (PN->use_empty()) continue;
6833 if (PN->getType()->isEmptyTy())
6837 const Value *PHIOp = PN->getIncomingValueForBlock(LLVMBB);
6839 if (const Constant *C = dyn_cast<Constant>(PHIOp)) {
6840 unsigned &RegOut = ConstantsOut[C];
6842 RegOut = FuncInfo.CreateRegs(C->getType());
6843 CopyValueToVirtualRegister(C, RegOut);
6847 DenseMap<const Value *, unsigned>::iterator I =
6848 FuncInfo.ValueMap.find(PHIOp);
6849 if (I != FuncInfo.ValueMap.end())
6852 assert(isa<AllocaInst>(PHIOp) &&
6853 FuncInfo.StaticAllocaMap.count(cast<AllocaInst>(PHIOp)) &&
6854 "Didn't codegen value into a register!??");
6855 Reg = FuncInfo.CreateRegs(PHIOp->getType());
6856 CopyValueToVirtualRegister(PHIOp, Reg);
6860 // Remember that this register needs to added to the machine PHI node as
6861 // the input for this MBB.
6862 SmallVector<EVT, 4> ValueVTs;
6863 ComputeValueVTs(TLI, PN->getType(), ValueVTs);
6864 for (unsigned vti = 0, vte = ValueVTs.size(); vti != vte; ++vti) {
6865 EVT VT = ValueVTs[vti];
6866 unsigned NumRegisters = TLI.getNumRegisters(*DAG.getContext(), VT);
6867 for (unsigned i = 0, e = NumRegisters; i != e; ++i)
6868 FuncInfo.PHINodesToUpdate.push_back(std::make_pair(MBBI++, Reg+i));
6869 Reg += NumRegisters;
6873 ConstantsOut.clear();