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/Optional.h"
19 #include "llvm/ADT/SmallSet.h"
20 #include "llvm/Analysis/AliasAnalysis.h"
21 #include "llvm/Analysis/BranchProbabilityInfo.h"
22 #include "llvm/Analysis/ConstantFolding.h"
23 #include "llvm/Analysis/ValueTracking.h"
24 #include "llvm/CodeGen/Analysis.h"
25 #include "llvm/CodeGen/FastISel.h"
26 #include "llvm/CodeGen/FunctionLoweringInfo.h"
27 #include "llvm/CodeGen/GCMetadata.h"
28 #include "llvm/CodeGen/GCStrategy.h"
29 #include "llvm/CodeGen/MachineFrameInfo.h"
30 #include "llvm/CodeGen/MachineFunction.h"
31 #include "llvm/CodeGen/MachineInstrBuilder.h"
32 #include "llvm/CodeGen/MachineJumpTableInfo.h"
33 #include "llvm/CodeGen/MachineModuleInfo.h"
34 #include "llvm/CodeGen/MachineRegisterInfo.h"
35 #include "llvm/CodeGen/SelectionDAG.h"
36 #include "llvm/CodeGen/StackMaps.h"
37 #include "llvm/IR/CallingConv.h"
38 #include "llvm/IR/Constants.h"
39 #include "llvm/IR/DataLayout.h"
40 #include "llvm/IR/DebugInfo.h"
41 #include "llvm/IR/DerivedTypes.h"
42 #include "llvm/IR/Function.h"
43 #include "llvm/IR/GlobalVariable.h"
44 #include "llvm/IR/InlineAsm.h"
45 #include "llvm/IR/Instructions.h"
46 #include "llvm/IR/IntrinsicInst.h"
47 #include "llvm/IR/Intrinsics.h"
48 #include "llvm/IR/LLVMContext.h"
49 #include "llvm/IR/Module.h"
50 #include "llvm/Support/CommandLine.h"
51 #include "llvm/Support/Debug.h"
52 #include "llvm/Support/ErrorHandling.h"
53 #include "llvm/Support/MathExtras.h"
54 #include "llvm/Support/raw_ostream.h"
55 #include "llvm/Target/TargetFrameLowering.h"
56 #include "llvm/Target/TargetInstrInfo.h"
57 #include "llvm/Target/TargetIntrinsicInfo.h"
58 #include "llvm/Target/TargetLibraryInfo.h"
59 #include "llvm/Target/TargetLowering.h"
60 #include "llvm/Target/TargetOptions.h"
61 #include "llvm/Target/TargetSelectionDAGInfo.h"
65 /// LimitFloatPrecision - Generate low-precision inline sequences for
66 /// some float libcalls (6, 8 or 12 bits).
67 static unsigned LimitFloatPrecision;
69 static cl::opt<unsigned, true>
70 LimitFPPrecision("limit-float-precision",
71 cl::desc("Generate low-precision inline sequences "
72 "for some float libcalls"),
73 cl::location(LimitFloatPrecision),
76 // Limit the width of DAG chains. This is important in general to prevent
77 // prevent DAG-based analysis from blowing up. For example, alias analysis and
78 // load clustering may not complete in reasonable time. It is difficult to
79 // recognize and avoid this situation within each individual analysis, and
80 // future analyses are likely to have the same behavior. Limiting DAG width is
81 // the safe approach, and will be especially important with global DAGs.
83 // MaxParallelChains default is arbitrarily high to avoid affecting
84 // optimization, but could be lowered to improve compile time. Any ld-ld-st-st
85 // sequence over this should have been converted to llvm.memcpy by the
86 // frontend. It easy to induce this behavior with .ll code such as:
87 // %buffer = alloca [4096 x i8]
88 // %data = load [4096 x i8]* %argPtr
89 // store [4096 x i8] %data, [4096 x i8]* %buffer
90 static const unsigned MaxParallelChains = 64;
92 static SDValue getCopyFromPartsVector(SelectionDAG &DAG, SDLoc DL,
93 const SDValue *Parts, unsigned NumParts,
94 MVT PartVT, EVT ValueVT, const Value *V);
96 /// getCopyFromParts - Create a value that contains the specified legal parts
97 /// combined into the value they represent. If the parts combine to a type
98 /// larger then ValueVT then AssertOp can be used to specify whether the extra
99 /// bits are known to be zero (ISD::AssertZext) or sign extended from ValueVT
100 /// (ISD::AssertSext).
101 static SDValue getCopyFromParts(SelectionDAG &DAG, SDLoc DL,
102 const SDValue *Parts,
103 unsigned NumParts, MVT PartVT, EVT ValueVT,
105 ISD::NodeType AssertOp = ISD::DELETED_NODE) {
106 if (ValueVT.isVector())
107 return getCopyFromPartsVector(DAG, DL, Parts, NumParts,
110 assert(NumParts > 0 && "No parts to assemble!");
111 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
112 SDValue Val = Parts[0];
115 // Assemble the value from multiple parts.
116 if (ValueVT.isInteger()) {
117 unsigned PartBits = PartVT.getSizeInBits();
118 unsigned ValueBits = ValueVT.getSizeInBits();
120 // Assemble the power of 2 part.
121 unsigned RoundParts = NumParts & (NumParts - 1) ?
122 1 << Log2_32(NumParts) : NumParts;
123 unsigned RoundBits = PartBits * RoundParts;
124 EVT RoundVT = RoundBits == ValueBits ?
125 ValueVT : EVT::getIntegerVT(*DAG.getContext(), RoundBits);
128 EVT HalfVT = EVT::getIntegerVT(*DAG.getContext(), RoundBits/2);
130 if (RoundParts > 2) {
131 Lo = getCopyFromParts(DAG, DL, Parts, RoundParts / 2,
133 Hi = getCopyFromParts(DAG, DL, Parts + RoundParts / 2,
134 RoundParts / 2, PartVT, HalfVT, V);
136 Lo = DAG.getNode(ISD::BITCAST, DL, HalfVT, Parts[0]);
137 Hi = DAG.getNode(ISD::BITCAST, DL, HalfVT, Parts[1]);
140 if (TLI.isBigEndian())
143 Val = DAG.getNode(ISD::BUILD_PAIR, DL, RoundVT, Lo, Hi);
145 if (RoundParts < NumParts) {
146 // Assemble the trailing non-power-of-2 part.
147 unsigned OddParts = NumParts - RoundParts;
148 EVT OddVT = EVT::getIntegerVT(*DAG.getContext(), OddParts * PartBits);
149 Hi = getCopyFromParts(DAG, DL,
150 Parts + RoundParts, OddParts, PartVT, OddVT, V);
152 // Combine the round and odd parts.
154 if (TLI.isBigEndian())
156 EVT TotalVT = EVT::getIntegerVT(*DAG.getContext(), NumParts * PartBits);
157 Hi = DAG.getNode(ISD::ANY_EXTEND, DL, TotalVT, Hi);
158 Hi = DAG.getNode(ISD::SHL, DL, TotalVT, Hi,
159 DAG.getConstant(Lo.getValueType().getSizeInBits(),
160 TLI.getPointerTy()));
161 Lo = DAG.getNode(ISD::ZERO_EXTEND, DL, TotalVT, Lo);
162 Val = DAG.getNode(ISD::OR, DL, TotalVT, Lo, Hi);
164 } else if (PartVT.isFloatingPoint()) {
165 // FP split into multiple FP parts (for ppcf128)
166 assert(ValueVT == EVT(MVT::ppcf128) && PartVT == MVT::f64 &&
169 Lo = DAG.getNode(ISD::BITCAST, DL, EVT(MVT::f64), Parts[0]);
170 Hi = DAG.getNode(ISD::BITCAST, DL, EVT(MVT::f64), Parts[1]);
171 if (TLI.isBigEndian())
173 Val = DAG.getNode(ISD::BUILD_PAIR, DL, ValueVT, Lo, Hi);
175 // FP split into integer parts (soft fp)
176 assert(ValueVT.isFloatingPoint() && PartVT.isInteger() &&
177 !PartVT.isVector() && "Unexpected split");
178 EVT IntVT = EVT::getIntegerVT(*DAG.getContext(), ValueVT.getSizeInBits());
179 Val = getCopyFromParts(DAG, DL, Parts, NumParts, PartVT, IntVT, V);
183 // There is now one part, held in Val. Correct it to match ValueVT.
184 EVT PartEVT = Val.getValueType();
186 if (PartEVT == ValueVT)
189 if (PartEVT.isInteger() && ValueVT.isInteger()) {
190 if (ValueVT.bitsLT(PartEVT)) {
191 // For a truncate, see if we have any information to
192 // indicate whether the truncated bits will always be
193 // zero or sign-extension.
194 if (AssertOp != ISD::DELETED_NODE)
195 Val = DAG.getNode(AssertOp, DL, PartEVT, Val,
196 DAG.getValueType(ValueVT));
197 return DAG.getNode(ISD::TRUNCATE, DL, ValueVT, Val);
199 return DAG.getNode(ISD::ANY_EXTEND, DL, ValueVT, Val);
202 if (PartEVT.isFloatingPoint() && ValueVT.isFloatingPoint()) {
203 // FP_ROUND's are always exact here.
204 if (ValueVT.bitsLT(Val.getValueType()))
205 return DAG.getNode(ISD::FP_ROUND, DL, ValueVT, Val,
206 DAG.getTargetConstant(1, TLI.getPointerTy()));
208 return DAG.getNode(ISD::FP_EXTEND, DL, ValueVT, Val);
211 if (PartEVT.getSizeInBits() == ValueVT.getSizeInBits())
212 return DAG.getNode(ISD::BITCAST, DL, ValueVT, Val);
214 llvm_unreachable("Unknown mismatch!");
217 /// getCopyFromPartsVector - Create a value that contains the specified legal
218 /// parts combined into the value they represent. If the parts combine to a
219 /// type larger then ValueVT then AssertOp can be used to specify whether the
220 /// extra bits are known to be zero (ISD::AssertZext) or sign extended from
221 /// ValueVT (ISD::AssertSext).
222 static SDValue getCopyFromPartsVector(SelectionDAG &DAG, SDLoc DL,
223 const SDValue *Parts, unsigned NumParts,
224 MVT PartVT, EVT ValueVT, const Value *V) {
225 assert(ValueVT.isVector() && "Not a vector value");
226 assert(NumParts > 0 && "No parts to assemble!");
227 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
228 SDValue Val = Parts[0];
230 // Handle a multi-element vector.
234 unsigned NumIntermediates;
236 TLI.getVectorTypeBreakdown(*DAG.getContext(), ValueVT, IntermediateVT,
237 NumIntermediates, RegisterVT);
238 assert(NumRegs == NumParts && "Part count doesn't match vector breakdown!");
239 NumParts = NumRegs; // Silence a compiler warning.
240 assert(RegisterVT == PartVT && "Part type doesn't match vector breakdown!");
241 assert(RegisterVT == Parts[0].getSimpleValueType() &&
242 "Part type doesn't match part!");
244 // Assemble the parts into intermediate operands.
245 SmallVector<SDValue, 8> Ops(NumIntermediates);
246 if (NumIntermediates == NumParts) {
247 // If the register was not expanded, truncate or copy the value,
249 for (unsigned i = 0; i != NumParts; ++i)
250 Ops[i] = getCopyFromParts(DAG, DL, &Parts[i], 1,
251 PartVT, IntermediateVT, V);
252 } else if (NumParts > 0) {
253 // If the intermediate type was expanded, build the intermediate
254 // operands from the parts.
255 assert(NumParts % NumIntermediates == 0 &&
256 "Must expand into a divisible number of parts!");
257 unsigned Factor = NumParts / NumIntermediates;
258 for (unsigned i = 0; i != NumIntermediates; ++i)
259 Ops[i] = getCopyFromParts(DAG, DL, &Parts[i * Factor], Factor,
260 PartVT, IntermediateVT, V);
263 // Build a vector with BUILD_VECTOR or CONCAT_VECTORS from the
264 // intermediate operands.
265 Val = DAG.getNode(IntermediateVT.isVector() ?
266 ISD::CONCAT_VECTORS : ISD::BUILD_VECTOR, DL,
267 ValueVT, &Ops[0], NumIntermediates);
270 // There is now one part, held in Val. Correct it to match ValueVT.
271 EVT PartEVT = Val.getValueType();
273 if (PartEVT == ValueVT)
276 if (PartEVT.isVector()) {
277 // If the element type of the source/dest vectors are the same, but the
278 // parts vector has more elements than the value vector, then we have a
279 // vector widening case (e.g. <2 x float> -> <4 x float>). Extract the
281 if (PartEVT.getVectorElementType() == ValueVT.getVectorElementType()) {
282 assert(PartEVT.getVectorNumElements() > ValueVT.getVectorNumElements() &&
283 "Cannot narrow, it would be a lossy transformation");
284 return DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, ValueVT, Val,
285 DAG.getConstant(0, TLI.getVectorIdxTy()));
288 // Vector/Vector bitcast.
289 if (ValueVT.getSizeInBits() == PartEVT.getSizeInBits())
290 return DAG.getNode(ISD::BITCAST, DL, ValueVT, Val);
292 assert(PartEVT.getVectorNumElements() == ValueVT.getVectorNumElements() &&
293 "Cannot handle this kind of promotion");
294 // Promoted vector extract
295 bool Smaller = ValueVT.bitsLE(PartEVT);
296 return DAG.getNode((Smaller ? ISD::TRUNCATE : ISD::ANY_EXTEND),
301 // Trivial bitcast if the types are the same size and the destination
302 // vector type is legal.
303 if (PartEVT.getSizeInBits() == ValueVT.getSizeInBits() &&
304 TLI.isTypeLegal(ValueVT))
305 return DAG.getNode(ISD::BITCAST, DL, ValueVT, Val);
307 // Handle cases such as i8 -> <1 x i1>
308 if (ValueVT.getVectorNumElements() != 1) {
309 LLVMContext &Ctx = *DAG.getContext();
310 Twine ErrMsg("non-trivial scalar-to-vector conversion");
311 if (const Instruction *I = dyn_cast_or_null<Instruction>(V)) {
312 if (const CallInst *CI = dyn_cast<CallInst>(I))
313 if (isa<InlineAsm>(CI->getCalledValue()))
314 ErrMsg = ErrMsg + ", possible invalid constraint for vector type";
315 Ctx.emitError(I, ErrMsg);
317 Ctx.emitError(ErrMsg);
319 return DAG.getUNDEF(ValueVT);
322 if (ValueVT.getVectorNumElements() == 1 &&
323 ValueVT.getVectorElementType() != PartEVT) {
324 bool Smaller = ValueVT.bitsLE(PartEVT);
325 Val = DAG.getNode((Smaller ? ISD::TRUNCATE : ISD::ANY_EXTEND),
326 DL, ValueVT.getScalarType(), Val);
329 return DAG.getNode(ISD::BUILD_VECTOR, DL, ValueVT, Val);
332 static void getCopyToPartsVector(SelectionDAG &DAG, SDLoc dl,
333 SDValue Val, SDValue *Parts, unsigned NumParts,
334 MVT PartVT, const Value *V);
336 /// getCopyToParts - Create a series of nodes that contain the specified value
337 /// split into legal parts. If the parts contain more bits than Val, then, for
338 /// integers, ExtendKind can be used to specify how to generate the extra bits.
339 static void getCopyToParts(SelectionDAG &DAG, SDLoc DL,
340 SDValue Val, SDValue *Parts, unsigned NumParts,
341 MVT PartVT, const Value *V,
342 ISD::NodeType ExtendKind = ISD::ANY_EXTEND) {
343 EVT ValueVT = Val.getValueType();
345 // Handle the vector case separately.
346 if (ValueVT.isVector())
347 return getCopyToPartsVector(DAG, DL, Val, Parts, NumParts, PartVT, V);
349 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
350 unsigned PartBits = PartVT.getSizeInBits();
351 unsigned OrigNumParts = NumParts;
352 assert(TLI.isTypeLegal(PartVT) && "Copying to an illegal type!");
357 assert(!ValueVT.isVector() && "Vector case handled elsewhere");
358 EVT PartEVT = PartVT;
359 if (PartEVT == ValueVT) {
360 assert(NumParts == 1 && "No-op copy with multiple parts!");
365 if (NumParts * PartBits > ValueVT.getSizeInBits()) {
366 // If the parts cover more bits than the value has, promote the value.
367 if (PartVT.isFloatingPoint() && ValueVT.isFloatingPoint()) {
368 assert(NumParts == 1 && "Do not know what to promote to!");
369 Val = DAG.getNode(ISD::FP_EXTEND, DL, PartVT, Val);
371 assert((PartVT.isInteger() || PartVT == MVT::x86mmx) &&
372 ValueVT.isInteger() &&
373 "Unknown mismatch!");
374 ValueVT = EVT::getIntegerVT(*DAG.getContext(), NumParts * PartBits);
375 Val = DAG.getNode(ExtendKind, DL, ValueVT, Val);
376 if (PartVT == MVT::x86mmx)
377 Val = DAG.getNode(ISD::BITCAST, DL, PartVT, Val);
379 } else if (PartBits == ValueVT.getSizeInBits()) {
380 // Different types of the same size.
381 assert(NumParts == 1 && PartEVT != ValueVT);
382 Val = DAG.getNode(ISD::BITCAST, DL, PartVT, Val);
383 } else if (NumParts * PartBits < ValueVT.getSizeInBits()) {
384 // If the parts cover less bits than value has, truncate the value.
385 assert((PartVT.isInteger() || PartVT == MVT::x86mmx) &&
386 ValueVT.isInteger() &&
387 "Unknown mismatch!");
388 ValueVT = EVT::getIntegerVT(*DAG.getContext(), NumParts * PartBits);
389 Val = DAG.getNode(ISD::TRUNCATE, DL, ValueVT, Val);
390 if (PartVT == MVT::x86mmx)
391 Val = DAG.getNode(ISD::BITCAST, DL, PartVT, Val);
394 // The value may have changed - recompute ValueVT.
395 ValueVT = Val.getValueType();
396 assert(NumParts * PartBits == ValueVT.getSizeInBits() &&
397 "Failed to tile the value with PartVT!");
400 if (PartEVT != ValueVT) {
401 LLVMContext &Ctx = *DAG.getContext();
402 Twine ErrMsg("scalar-to-vector conversion failed");
403 if (const Instruction *I = dyn_cast_or_null<Instruction>(V)) {
404 if (const CallInst *CI = dyn_cast<CallInst>(I))
405 if (isa<InlineAsm>(CI->getCalledValue()))
406 ErrMsg = ErrMsg + ", possible invalid constraint for vector type";
407 Ctx.emitError(I, ErrMsg);
409 Ctx.emitError(ErrMsg);
417 // Expand the value into multiple parts.
418 if (NumParts & (NumParts - 1)) {
419 // The number of parts is not a power of 2. Split off and copy the tail.
420 assert(PartVT.isInteger() && ValueVT.isInteger() &&
421 "Do not know what to expand to!");
422 unsigned RoundParts = 1 << Log2_32(NumParts);
423 unsigned RoundBits = RoundParts * PartBits;
424 unsigned OddParts = NumParts - RoundParts;
425 SDValue OddVal = DAG.getNode(ISD::SRL, DL, ValueVT, Val,
426 DAG.getIntPtrConstant(RoundBits));
427 getCopyToParts(DAG, DL, OddVal, Parts + RoundParts, OddParts, PartVT, V);
429 if (TLI.isBigEndian())
430 // The odd parts were reversed by getCopyToParts - unreverse them.
431 std::reverse(Parts + RoundParts, Parts + NumParts);
433 NumParts = RoundParts;
434 ValueVT = EVT::getIntegerVT(*DAG.getContext(), NumParts * PartBits);
435 Val = DAG.getNode(ISD::TRUNCATE, DL, ValueVT, Val);
438 // The number of parts is a power of 2. Repeatedly bisect the value using
440 Parts[0] = DAG.getNode(ISD::BITCAST, DL,
441 EVT::getIntegerVT(*DAG.getContext(),
442 ValueVT.getSizeInBits()),
445 for (unsigned StepSize = NumParts; StepSize > 1; StepSize /= 2) {
446 for (unsigned i = 0; i < NumParts; i += StepSize) {
447 unsigned ThisBits = StepSize * PartBits / 2;
448 EVT ThisVT = EVT::getIntegerVT(*DAG.getContext(), ThisBits);
449 SDValue &Part0 = Parts[i];
450 SDValue &Part1 = Parts[i+StepSize/2];
452 Part1 = DAG.getNode(ISD::EXTRACT_ELEMENT, DL,
453 ThisVT, Part0, DAG.getIntPtrConstant(1));
454 Part0 = DAG.getNode(ISD::EXTRACT_ELEMENT, DL,
455 ThisVT, Part0, DAG.getIntPtrConstant(0));
457 if (ThisBits == PartBits && ThisVT != PartVT) {
458 Part0 = DAG.getNode(ISD::BITCAST, DL, PartVT, Part0);
459 Part1 = DAG.getNode(ISD::BITCAST, DL, PartVT, Part1);
464 if (TLI.isBigEndian())
465 std::reverse(Parts, Parts + OrigNumParts);
469 /// getCopyToPartsVector - Create a series of nodes that contain the specified
470 /// value split into legal parts.
471 static void getCopyToPartsVector(SelectionDAG &DAG, SDLoc DL,
472 SDValue Val, SDValue *Parts, unsigned NumParts,
473 MVT PartVT, const Value *V) {
474 EVT ValueVT = Val.getValueType();
475 assert(ValueVT.isVector() && "Not a vector");
476 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
479 EVT PartEVT = PartVT;
480 if (PartEVT == ValueVT) {
482 } else if (PartVT.getSizeInBits() == ValueVT.getSizeInBits()) {
483 // Bitconvert vector->vector case.
484 Val = DAG.getNode(ISD::BITCAST, DL, PartVT, Val);
485 } else if (PartVT.isVector() &&
486 PartEVT.getVectorElementType() == ValueVT.getVectorElementType() &&
487 PartEVT.getVectorNumElements() > ValueVT.getVectorNumElements()) {
488 EVT ElementVT = PartVT.getVectorElementType();
489 // Vector widening case, e.g. <2 x float> -> <4 x float>. Shuffle in
491 SmallVector<SDValue, 16> Ops;
492 for (unsigned i = 0, e = ValueVT.getVectorNumElements(); i != e; ++i)
493 Ops.push_back(DAG.getNode(ISD::EXTRACT_VECTOR_ELT, DL,
494 ElementVT, Val, DAG.getConstant(i,
495 TLI.getVectorIdxTy())));
497 for (unsigned i = ValueVT.getVectorNumElements(),
498 e = PartVT.getVectorNumElements(); i != e; ++i)
499 Ops.push_back(DAG.getUNDEF(ElementVT));
501 Val = DAG.getNode(ISD::BUILD_VECTOR, DL, PartVT, &Ops[0], Ops.size());
503 // FIXME: Use CONCAT for 2x -> 4x.
505 //SDValue UndefElts = DAG.getUNDEF(VectorTy);
506 //Val = DAG.getNode(ISD::CONCAT_VECTORS, DL, PartVT, Val, UndefElts);
507 } else if (PartVT.isVector() &&
508 PartEVT.getVectorElementType().bitsGE(
509 ValueVT.getVectorElementType()) &&
510 PartEVT.getVectorNumElements() == ValueVT.getVectorNumElements()) {
512 // Promoted vector extract
513 bool Smaller = PartEVT.bitsLE(ValueVT);
514 Val = DAG.getNode((Smaller ? ISD::TRUNCATE : ISD::ANY_EXTEND),
517 // Vector -> scalar conversion.
518 assert(ValueVT.getVectorNumElements() == 1 &&
519 "Only trivial vector-to-scalar conversions should get here!");
520 Val = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, DL,
521 PartVT, Val, DAG.getConstant(0, TLI.getVectorIdxTy()));
523 bool Smaller = ValueVT.bitsLE(PartVT);
524 Val = DAG.getNode((Smaller ? ISD::TRUNCATE : ISD::ANY_EXTEND),
532 // Handle a multi-element vector.
535 unsigned NumIntermediates;
536 unsigned NumRegs = TLI.getVectorTypeBreakdown(*DAG.getContext(), ValueVT,
538 NumIntermediates, RegisterVT);
539 unsigned NumElements = ValueVT.getVectorNumElements();
541 assert(NumRegs == NumParts && "Part count doesn't match vector breakdown!");
542 NumParts = NumRegs; // Silence a compiler warning.
543 assert(RegisterVT == PartVT && "Part type doesn't match vector breakdown!");
545 // Split the vector into intermediate operands.
546 SmallVector<SDValue, 8> Ops(NumIntermediates);
547 for (unsigned i = 0; i != NumIntermediates; ++i) {
548 if (IntermediateVT.isVector())
549 Ops[i] = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL,
551 DAG.getConstant(i * (NumElements / NumIntermediates),
552 TLI.getVectorIdxTy()));
554 Ops[i] = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, DL,
556 DAG.getConstant(i, TLI.getVectorIdxTy()));
559 // Split the intermediate operands into legal parts.
560 if (NumParts == NumIntermediates) {
561 // If the register was not expanded, promote or copy the value,
563 for (unsigned i = 0; i != NumParts; ++i)
564 getCopyToParts(DAG, DL, Ops[i], &Parts[i], 1, PartVT, V);
565 } else if (NumParts > 0) {
566 // If the intermediate type was expanded, split each the value into
568 assert(NumParts % NumIntermediates == 0 &&
569 "Must expand into a divisible number of parts!");
570 unsigned Factor = NumParts / NumIntermediates;
571 for (unsigned i = 0; i != NumIntermediates; ++i)
572 getCopyToParts(DAG, DL, Ops[i], &Parts[i*Factor], Factor, PartVT, V);
577 /// RegsForValue - This struct represents the registers (physical or virtual)
578 /// that a particular set of values is assigned, and the type information
579 /// about the value. The most common situation is to represent one value at a
580 /// time, but struct or array values are handled element-wise as multiple
581 /// values. The splitting of aggregates is performed recursively, so that we
582 /// never have aggregate-typed registers. The values at this point do not
583 /// necessarily have legal types, so each value may require one or more
584 /// registers of some legal type.
586 struct RegsForValue {
587 /// ValueVTs - The value types of the values, which may not be legal, and
588 /// may need be promoted or synthesized from one or more registers.
590 SmallVector<EVT, 4> ValueVTs;
592 /// RegVTs - The value types of the registers. This is the same size as
593 /// ValueVTs and it records, for each value, what the type of the assigned
594 /// register or registers are. (Individual values are never synthesized
595 /// from more than one type of register.)
597 /// With virtual registers, the contents of RegVTs is redundant with TLI's
598 /// getRegisterType member function, however when with physical registers
599 /// it is necessary to have a separate record of the types.
601 SmallVector<MVT, 4> RegVTs;
603 /// Regs - This list holds the registers assigned to the values.
604 /// Each legal or promoted value requires one register, and each
605 /// expanded value requires multiple registers.
607 SmallVector<unsigned, 4> Regs;
611 RegsForValue(const SmallVector<unsigned, 4> ®s,
612 MVT regvt, EVT valuevt)
613 : ValueVTs(1, valuevt), RegVTs(1, regvt), Regs(regs) {}
615 RegsForValue(LLVMContext &Context, const TargetLowering &tli,
616 unsigned Reg, Type *Ty) {
617 ComputeValueVTs(tli, Ty, ValueVTs);
619 for (unsigned Value = 0, e = ValueVTs.size(); Value != e; ++Value) {
620 EVT ValueVT = ValueVTs[Value];
621 unsigned NumRegs = tli.getNumRegisters(Context, ValueVT);
622 MVT RegisterVT = tli.getRegisterType(Context, ValueVT);
623 for (unsigned i = 0; i != NumRegs; ++i)
624 Regs.push_back(Reg + i);
625 RegVTs.push_back(RegisterVT);
630 /// areValueTypesLegal - Return true if types of all the values are legal.
631 bool areValueTypesLegal(const TargetLowering &TLI) {
632 for (unsigned Value = 0, e = ValueVTs.size(); Value != e; ++Value) {
633 MVT RegisterVT = RegVTs[Value];
634 if (!TLI.isTypeLegal(RegisterVT))
640 /// append - Add the specified values to this one.
641 void append(const RegsForValue &RHS) {
642 ValueVTs.append(RHS.ValueVTs.begin(), RHS.ValueVTs.end());
643 RegVTs.append(RHS.RegVTs.begin(), RHS.RegVTs.end());
644 Regs.append(RHS.Regs.begin(), RHS.Regs.end());
647 /// getCopyFromRegs - Emit a series of CopyFromReg nodes that copies from
648 /// this value and returns the result as a ValueVTs value. This uses
649 /// Chain/Flag as the input and updates them for the output Chain/Flag.
650 /// If the Flag pointer is NULL, no flag is used.
651 SDValue getCopyFromRegs(SelectionDAG &DAG, FunctionLoweringInfo &FuncInfo,
653 SDValue &Chain, SDValue *Flag,
654 const Value *V = 0) const;
656 /// getCopyToRegs - Emit a series of CopyToReg nodes that copies the
657 /// specified value into the registers specified by this object. This uses
658 /// Chain/Flag as the input and updates them for the output Chain/Flag.
659 /// If the Flag pointer is NULL, no flag is used.
660 void getCopyToRegs(SDValue Val, SelectionDAG &DAG, SDLoc dl,
661 SDValue &Chain, SDValue *Flag, const Value *V) const;
663 /// AddInlineAsmOperands - Add this value to the specified inlineasm node
664 /// operand list. This adds the code marker, matching input operand index
665 /// (if applicable), and includes the number of values added into it.
666 void AddInlineAsmOperands(unsigned Kind,
667 bool HasMatching, unsigned MatchingIdx,
669 std::vector<SDValue> &Ops) const;
673 /// getCopyFromRegs - Emit a series of CopyFromReg nodes that copies from
674 /// this value and returns the result as a ValueVT value. This uses
675 /// Chain/Flag as the input and updates them for the output Chain/Flag.
676 /// If the Flag pointer is NULL, no flag is used.
677 SDValue RegsForValue::getCopyFromRegs(SelectionDAG &DAG,
678 FunctionLoweringInfo &FuncInfo,
680 SDValue &Chain, SDValue *Flag,
681 const Value *V) const {
682 // A Value with type {} or [0 x %t] needs no registers.
683 if (ValueVTs.empty())
686 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
688 // Assemble the legal parts into the final values.
689 SmallVector<SDValue, 4> Values(ValueVTs.size());
690 SmallVector<SDValue, 8> Parts;
691 for (unsigned Value = 0, Part = 0, e = ValueVTs.size(); Value != e; ++Value) {
692 // Copy the legal parts from the registers.
693 EVT ValueVT = ValueVTs[Value];
694 unsigned NumRegs = TLI.getNumRegisters(*DAG.getContext(), ValueVT);
695 MVT RegisterVT = RegVTs[Value];
697 Parts.resize(NumRegs);
698 for (unsigned i = 0; i != NumRegs; ++i) {
701 P = DAG.getCopyFromReg(Chain, dl, Regs[Part+i], RegisterVT);
703 P = DAG.getCopyFromReg(Chain, dl, Regs[Part+i], RegisterVT, *Flag);
704 *Flag = P.getValue(2);
707 Chain = P.getValue(1);
710 // If the source register was virtual and if we know something about it,
711 // add an assert node.
712 if (!TargetRegisterInfo::isVirtualRegister(Regs[Part+i]) ||
713 !RegisterVT.isInteger() || RegisterVT.isVector())
716 const FunctionLoweringInfo::LiveOutInfo *LOI =
717 FuncInfo.GetLiveOutRegInfo(Regs[Part+i]);
721 unsigned RegSize = RegisterVT.getSizeInBits();
722 unsigned NumSignBits = LOI->NumSignBits;
723 unsigned NumZeroBits = LOI->KnownZero.countLeadingOnes();
725 if (NumZeroBits == RegSize) {
726 // The current value is a zero.
727 // Explicitly express that as it would be easier for
728 // optimizations to kick in.
729 Parts[i] = DAG.getConstant(0, RegisterVT);
733 // FIXME: We capture more information than the dag can represent. For
734 // now, just use the tightest assertzext/assertsext possible.
736 EVT FromVT(MVT::Other);
737 if (NumSignBits == RegSize)
738 isSExt = true, FromVT = MVT::i1; // ASSERT SEXT 1
739 else if (NumZeroBits >= RegSize-1)
740 isSExt = false, FromVT = MVT::i1; // ASSERT ZEXT 1
741 else if (NumSignBits > RegSize-8)
742 isSExt = true, FromVT = MVT::i8; // ASSERT SEXT 8
743 else if (NumZeroBits >= RegSize-8)
744 isSExt = false, FromVT = MVT::i8; // ASSERT ZEXT 8
745 else if (NumSignBits > RegSize-16)
746 isSExt = true, FromVT = MVT::i16; // ASSERT SEXT 16
747 else if (NumZeroBits >= RegSize-16)
748 isSExt = false, FromVT = MVT::i16; // ASSERT ZEXT 16
749 else if (NumSignBits > RegSize-32)
750 isSExt = true, FromVT = MVT::i32; // ASSERT SEXT 32
751 else if (NumZeroBits >= RegSize-32)
752 isSExt = false, FromVT = MVT::i32; // ASSERT ZEXT 32
756 // Add an assertion node.
757 assert(FromVT != MVT::Other);
758 Parts[i] = DAG.getNode(isSExt ? ISD::AssertSext : ISD::AssertZext, dl,
759 RegisterVT, P, DAG.getValueType(FromVT));
762 Values[Value] = getCopyFromParts(DAG, dl, Parts.begin(),
763 NumRegs, RegisterVT, ValueVT, V);
768 return DAG.getNode(ISD::MERGE_VALUES, dl,
769 DAG.getVTList(&ValueVTs[0], ValueVTs.size()),
770 &Values[0], ValueVTs.size());
773 /// getCopyToRegs - Emit a series of CopyToReg nodes that copies the
774 /// specified value into the registers specified by this object. This uses
775 /// Chain/Flag as the input and updates them for the output Chain/Flag.
776 /// If the Flag pointer is NULL, no flag is used.
777 void RegsForValue::getCopyToRegs(SDValue Val, SelectionDAG &DAG, SDLoc dl,
778 SDValue &Chain, SDValue *Flag,
779 const Value *V) const {
780 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
782 // Get the list of the values's legal parts.
783 unsigned NumRegs = Regs.size();
784 SmallVector<SDValue, 8> Parts(NumRegs);
785 for (unsigned Value = 0, Part = 0, e = ValueVTs.size(); Value != e; ++Value) {
786 EVT ValueVT = ValueVTs[Value];
787 unsigned NumParts = TLI.getNumRegisters(*DAG.getContext(), ValueVT);
788 MVT RegisterVT = RegVTs[Value];
789 ISD::NodeType ExtendKind =
790 TLI.isZExtFree(Val, RegisterVT)? ISD::ZERO_EXTEND: ISD::ANY_EXTEND;
792 getCopyToParts(DAG, dl, Val.getValue(Val.getResNo() + Value),
793 &Parts[Part], NumParts, RegisterVT, V, ExtendKind);
797 // Copy the parts into the registers.
798 SmallVector<SDValue, 8> Chains(NumRegs);
799 for (unsigned i = 0; i != NumRegs; ++i) {
802 Part = DAG.getCopyToReg(Chain, dl, Regs[i], Parts[i]);
804 Part = DAG.getCopyToReg(Chain, dl, Regs[i], Parts[i], *Flag);
805 *Flag = Part.getValue(1);
808 Chains[i] = Part.getValue(0);
811 if (NumRegs == 1 || Flag)
812 // If NumRegs > 1 && Flag is used then the use of the last CopyToReg is
813 // flagged to it. That is the CopyToReg nodes and the user are considered
814 // a single scheduling unit. If we create a TokenFactor and return it as
815 // chain, then the TokenFactor is both a predecessor (operand) of the
816 // user as well as a successor (the TF operands are flagged to the user).
817 // c1, f1 = CopyToReg
818 // c2, f2 = CopyToReg
819 // c3 = TokenFactor c1, c2
822 Chain = Chains[NumRegs-1];
824 Chain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, &Chains[0], NumRegs);
827 /// AddInlineAsmOperands - Add this value to the specified inlineasm node
828 /// operand list. This adds the code marker and includes the number of
829 /// values added into it.
830 void RegsForValue::AddInlineAsmOperands(unsigned Code, bool HasMatching,
831 unsigned MatchingIdx,
833 std::vector<SDValue> &Ops) const {
834 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
836 unsigned Flag = InlineAsm::getFlagWord(Code, Regs.size());
838 Flag = InlineAsm::getFlagWordForMatchingOp(Flag, MatchingIdx);
839 else if (!Regs.empty() &&
840 TargetRegisterInfo::isVirtualRegister(Regs.front())) {
841 // Put the register class of the virtual registers in the flag word. That
842 // way, later passes can recompute register class constraints for inline
843 // assembly as well as normal instructions.
844 // Don't do this for tied operands that can use the regclass information
846 const MachineRegisterInfo &MRI = DAG.getMachineFunction().getRegInfo();
847 const TargetRegisterClass *RC = MRI.getRegClass(Regs.front());
848 Flag = InlineAsm::getFlagWordForRegClass(Flag, RC->getID());
851 SDValue Res = DAG.getTargetConstant(Flag, MVT::i32);
854 unsigned SP = TLI.getStackPointerRegisterToSaveRestore();
855 for (unsigned Value = 0, Reg = 0, e = ValueVTs.size(); Value != e; ++Value) {
856 unsigned NumRegs = TLI.getNumRegisters(*DAG.getContext(), ValueVTs[Value]);
857 MVT RegisterVT = RegVTs[Value];
858 for (unsigned i = 0; i != NumRegs; ++i) {
859 assert(Reg < Regs.size() && "Mismatch in # registers expected");
860 unsigned TheReg = Regs[Reg++];
861 Ops.push_back(DAG.getRegister(TheReg, RegisterVT));
863 if (TheReg == SP && Code == InlineAsm::Kind_Clobber) {
864 // If we clobbered the stack pointer, MFI should know about it.
865 assert(DAG.getMachineFunction().getFrameInfo()->
866 hasInlineAsmWithSPAdjust());
872 void SelectionDAGBuilder::init(GCFunctionInfo *gfi, AliasAnalysis &aa,
873 const TargetLibraryInfo *li) {
877 DL = DAG.getTarget().getDataLayout();
878 Context = DAG.getContext();
879 LPadToCallSiteMap.clear();
882 /// clear - Clear out the current SelectionDAG and the associated
883 /// state and prepare this SelectionDAGBuilder object to be used
884 /// for a new block. This doesn't clear out information about
885 /// additional blocks that are needed to complete switch lowering
886 /// or PHI node updating; that information is cleared out as it is
888 void SelectionDAGBuilder::clear() {
890 UnusedArgNodeMap.clear();
891 PendingLoads.clear();
892 PendingExports.clear();
895 SDNodeOrder = LowestSDNodeOrder;
898 /// clearDanglingDebugInfo - Clear the dangling debug information
899 /// map. This function is separated from the clear so that debug
900 /// information that is dangling in a basic block can be properly
901 /// resolved in a different basic block. This allows the
902 /// SelectionDAG to resolve dangling debug information attached
904 void SelectionDAGBuilder::clearDanglingDebugInfo() {
905 DanglingDebugInfoMap.clear();
908 /// getRoot - Return the current virtual root of the Selection DAG,
909 /// flushing any PendingLoad items. This must be done before emitting
910 /// a store or any other node that may need to be ordered after any
911 /// prior load instructions.
913 SDValue SelectionDAGBuilder::getRoot() {
914 if (PendingLoads.empty())
915 return DAG.getRoot();
917 if (PendingLoads.size() == 1) {
918 SDValue Root = PendingLoads[0];
920 PendingLoads.clear();
924 // Otherwise, we have to make a token factor node.
925 SDValue Root = DAG.getNode(ISD::TokenFactor, getCurSDLoc(), MVT::Other,
926 &PendingLoads[0], PendingLoads.size());
927 PendingLoads.clear();
932 /// getControlRoot - Similar to getRoot, but instead of flushing all the
933 /// PendingLoad items, flush all the PendingExports items. It is necessary
934 /// to do this before emitting a terminator instruction.
936 SDValue SelectionDAGBuilder::getControlRoot() {
937 SDValue Root = DAG.getRoot();
939 if (PendingExports.empty())
942 // Turn all of the CopyToReg chains into one factored node.
943 if (Root.getOpcode() != ISD::EntryToken) {
944 unsigned i = 0, e = PendingExports.size();
945 for (; i != e; ++i) {
946 assert(PendingExports[i].getNode()->getNumOperands() > 1);
947 if (PendingExports[i].getNode()->getOperand(0) == Root)
948 break; // Don't add the root if we already indirectly depend on it.
952 PendingExports.push_back(Root);
955 Root = DAG.getNode(ISD::TokenFactor, getCurSDLoc(), MVT::Other,
957 PendingExports.size());
958 PendingExports.clear();
963 void SelectionDAGBuilder::visit(const Instruction &I) {
964 // Set up outgoing PHI node register values before emitting the terminator.
965 if (isa<TerminatorInst>(&I))
966 HandlePHINodesInSuccessorBlocks(I.getParent());
972 visit(I.getOpcode(), I);
974 if (!isa<TerminatorInst>(&I) && !HasTailCall)
975 CopyToExportRegsIfNeeded(&I);
980 void SelectionDAGBuilder::visitPHI(const PHINode &) {
981 llvm_unreachable("SelectionDAGBuilder shouldn't visit PHI nodes!");
984 void SelectionDAGBuilder::visit(unsigned Opcode, const User &I) {
985 // Note: this doesn't use InstVisitor, because it has to work with
986 // ConstantExpr's in addition to instructions.
988 default: llvm_unreachable("Unknown instruction type encountered!");
989 // Build the switch statement using the Instruction.def file.
990 #define HANDLE_INST(NUM, OPCODE, CLASS) \
991 case Instruction::OPCODE: visit##OPCODE((const CLASS&)I); break;
992 #include "llvm/IR/Instruction.def"
996 // resolveDanglingDebugInfo - if we saw an earlier dbg_value referring to V,
997 // generate the debug data structures now that we've seen its definition.
998 void SelectionDAGBuilder::resolveDanglingDebugInfo(const Value *V,
1000 DanglingDebugInfo &DDI = DanglingDebugInfoMap[V];
1002 const DbgValueInst *DI = DDI.getDI();
1003 DebugLoc dl = DDI.getdl();
1004 unsigned DbgSDNodeOrder = DDI.getSDNodeOrder();
1005 MDNode *Variable = DI->getVariable();
1006 uint64_t Offset = DI->getOffset();
1008 if (Val.getNode()) {
1009 if (!EmitFuncArgumentDbgValue(V, Variable, Offset, Val)) {
1010 SDV = DAG.getDbgValue(Variable, Val.getNode(),
1011 Val.getResNo(), Offset, dl, DbgSDNodeOrder);
1012 DAG.AddDbgValue(SDV, Val.getNode(), false);
1015 DEBUG(dbgs() << "Dropping debug info for " << *DI << "\n");
1016 DanglingDebugInfoMap[V] = DanglingDebugInfo();
1020 /// getValue - Return an SDValue for the given Value.
1021 SDValue SelectionDAGBuilder::getValue(const Value *V) {
1022 // If we already have an SDValue for this value, use it. It's important
1023 // to do this first, so that we don't create a CopyFromReg if we already
1024 // have a regular SDValue.
1025 SDValue &N = NodeMap[V];
1026 if (N.getNode()) return N;
1028 // If there's a virtual register allocated and initialized for this
1030 DenseMap<const Value *, unsigned>::iterator It = FuncInfo.ValueMap.find(V);
1031 if (It != FuncInfo.ValueMap.end()) {
1032 unsigned InReg = It->second;
1033 RegsForValue RFV(*DAG.getContext(), *TM.getTargetLowering(),
1034 InReg, V->getType());
1035 SDValue Chain = DAG.getEntryNode();
1036 N = RFV.getCopyFromRegs(DAG, FuncInfo, getCurSDLoc(), Chain, NULL, V);
1037 resolveDanglingDebugInfo(V, N);
1041 // Otherwise create a new SDValue and remember it.
1042 SDValue Val = getValueImpl(V);
1044 resolveDanglingDebugInfo(V, Val);
1048 /// getNonRegisterValue - Return an SDValue for the given Value, but
1049 /// don't look in FuncInfo.ValueMap for a virtual register.
1050 SDValue SelectionDAGBuilder::getNonRegisterValue(const Value *V) {
1051 // If we already have an SDValue for this value, use it.
1052 SDValue &N = NodeMap[V];
1053 if (N.getNode()) return N;
1055 // Otherwise create a new SDValue and remember it.
1056 SDValue Val = getValueImpl(V);
1058 resolveDanglingDebugInfo(V, Val);
1062 /// getValueImpl - Helper function for getValue and getNonRegisterValue.
1063 /// Create an SDValue for the given value.
1064 SDValue SelectionDAGBuilder::getValueImpl(const Value *V) {
1065 const TargetLowering *TLI = TM.getTargetLowering();
1067 if (const Constant *C = dyn_cast<Constant>(V)) {
1068 EVT VT = TLI->getValueType(V->getType(), true);
1070 if (const ConstantInt *CI = dyn_cast<ConstantInt>(C))
1071 return DAG.getConstant(*CI, VT);
1073 if (const GlobalValue *GV = dyn_cast<GlobalValue>(C))
1074 return DAG.getGlobalAddress(GV, getCurSDLoc(), VT);
1076 if (isa<ConstantPointerNull>(C)) {
1077 unsigned AS = V->getType()->getPointerAddressSpace();
1078 return DAG.getConstant(0, TLI->getPointerTy(AS));
1081 if (const ConstantFP *CFP = dyn_cast<ConstantFP>(C))
1082 return DAG.getConstantFP(*CFP, VT);
1084 if (isa<UndefValue>(C) && !V->getType()->isAggregateType())
1085 return DAG.getUNDEF(VT);
1087 if (const ConstantExpr *CE = dyn_cast<ConstantExpr>(C)) {
1088 visit(CE->getOpcode(), *CE);
1089 SDValue N1 = NodeMap[V];
1090 assert(N1.getNode() && "visit didn't populate the NodeMap!");
1094 if (isa<ConstantStruct>(C) || isa<ConstantArray>(C)) {
1095 SmallVector<SDValue, 4> Constants;
1096 for (User::const_op_iterator OI = C->op_begin(), OE = C->op_end();
1098 SDNode *Val = getValue(*OI).getNode();
1099 // If the operand is an empty aggregate, there are no values.
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 Constants.push_back(SDValue(Val, i));
1107 return DAG.getMergeValues(&Constants[0], Constants.size(),
1111 if (const ConstantDataSequential *CDS =
1112 dyn_cast<ConstantDataSequential>(C)) {
1113 SmallVector<SDValue, 4> Ops;
1114 for (unsigned i = 0, e = CDS->getNumElements(); i != e; ++i) {
1115 SDNode *Val = getValue(CDS->getElementAsConstant(i)).getNode();
1116 // Add each leaf value from the operand to the Constants list
1117 // to form a flattened list of all the values.
1118 for (unsigned i = 0, e = Val->getNumValues(); i != e; ++i)
1119 Ops.push_back(SDValue(Val, i));
1122 if (isa<ArrayType>(CDS->getType()))
1123 return DAG.getMergeValues(&Ops[0], Ops.size(), getCurSDLoc());
1124 return NodeMap[V] = DAG.getNode(ISD::BUILD_VECTOR, getCurSDLoc(),
1125 VT, &Ops[0], Ops.size());
1128 if (C->getType()->isStructTy() || C->getType()->isArrayTy()) {
1129 assert((isa<ConstantAggregateZero>(C) || isa<UndefValue>(C)) &&
1130 "Unknown struct or array constant!");
1132 SmallVector<EVT, 4> ValueVTs;
1133 ComputeValueVTs(*TLI, C->getType(), ValueVTs);
1134 unsigned NumElts = ValueVTs.size();
1136 return SDValue(); // empty struct
1137 SmallVector<SDValue, 4> Constants(NumElts);
1138 for (unsigned i = 0; i != NumElts; ++i) {
1139 EVT EltVT = ValueVTs[i];
1140 if (isa<UndefValue>(C))
1141 Constants[i] = DAG.getUNDEF(EltVT);
1142 else if (EltVT.isFloatingPoint())
1143 Constants[i] = DAG.getConstantFP(0, EltVT);
1145 Constants[i] = DAG.getConstant(0, EltVT);
1148 return DAG.getMergeValues(&Constants[0], NumElts,
1152 if (const BlockAddress *BA = dyn_cast<BlockAddress>(C))
1153 return DAG.getBlockAddress(BA, VT);
1155 VectorType *VecTy = cast<VectorType>(V->getType());
1156 unsigned NumElements = VecTy->getNumElements();
1158 // Now that we know the number and type of the elements, get that number of
1159 // elements into the Ops array based on what kind of constant it is.
1160 SmallVector<SDValue, 16> Ops;
1161 if (const ConstantVector *CV = dyn_cast<ConstantVector>(C)) {
1162 for (unsigned i = 0; i != NumElements; ++i)
1163 Ops.push_back(getValue(CV->getOperand(i)));
1165 assert(isa<ConstantAggregateZero>(C) && "Unknown vector constant!");
1166 EVT EltVT = TLI->getValueType(VecTy->getElementType());
1169 if (EltVT.isFloatingPoint())
1170 Op = DAG.getConstantFP(0, EltVT);
1172 Op = DAG.getConstant(0, EltVT);
1173 Ops.assign(NumElements, Op);
1176 // Create a BUILD_VECTOR node.
1177 return NodeMap[V] = DAG.getNode(ISD::BUILD_VECTOR, getCurSDLoc(),
1178 VT, &Ops[0], Ops.size());
1181 // If this is a static alloca, generate it as the frameindex instead of
1183 if (const AllocaInst *AI = dyn_cast<AllocaInst>(V)) {
1184 DenseMap<const AllocaInst*, int>::iterator SI =
1185 FuncInfo.StaticAllocaMap.find(AI);
1186 if (SI != FuncInfo.StaticAllocaMap.end())
1187 return DAG.getFrameIndex(SI->second, TLI->getPointerTy());
1190 // If this is an instruction which fast-isel has deferred, select it now.
1191 if (const Instruction *Inst = dyn_cast<Instruction>(V)) {
1192 unsigned InReg = FuncInfo.InitializeRegForValue(Inst);
1193 RegsForValue RFV(*DAG.getContext(), *TLI, InReg, Inst->getType());
1194 SDValue Chain = DAG.getEntryNode();
1195 return RFV.getCopyFromRegs(DAG, FuncInfo, getCurSDLoc(), Chain, NULL, V);
1198 llvm_unreachable("Can't get register for value!");
1201 void SelectionDAGBuilder::visitRet(const ReturnInst &I) {
1202 const TargetLowering *TLI = TM.getTargetLowering();
1203 SDValue Chain = getControlRoot();
1204 SmallVector<ISD::OutputArg, 8> Outs;
1205 SmallVector<SDValue, 8> OutVals;
1207 if (!FuncInfo.CanLowerReturn) {
1208 unsigned DemoteReg = FuncInfo.DemoteRegister;
1209 const Function *F = I.getParent()->getParent();
1211 // Emit a store of the return value through the virtual register.
1212 // Leave Outs empty so that LowerReturn won't try to load return
1213 // registers the usual way.
1214 SmallVector<EVT, 1> PtrValueVTs;
1215 ComputeValueVTs(*TLI, PointerType::getUnqual(F->getReturnType()),
1218 SDValue RetPtr = DAG.getRegister(DemoteReg, PtrValueVTs[0]);
1219 SDValue RetOp = getValue(I.getOperand(0));
1221 SmallVector<EVT, 4> ValueVTs;
1222 SmallVector<uint64_t, 4> Offsets;
1223 ComputeValueVTs(*TLI, I.getOperand(0)->getType(), ValueVTs, &Offsets);
1224 unsigned NumValues = ValueVTs.size();
1226 SmallVector<SDValue, 4> Chains(NumValues);
1227 for (unsigned i = 0; i != NumValues; ++i) {
1228 SDValue Add = DAG.getNode(ISD::ADD, getCurSDLoc(),
1229 RetPtr.getValueType(), RetPtr,
1230 DAG.getIntPtrConstant(Offsets[i]));
1232 DAG.getStore(Chain, getCurSDLoc(),
1233 SDValue(RetOp.getNode(), RetOp.getResNo() + i),
1234 // FIXME: better loc info would be nice.
1235 Add, MachinePointerInfo(), false, false, 0);
1238 Chain = DAG.getNode(ISD::TokenFactor, getCurSDLoc(),
1239 MVT::Other, &Chains[0], NumValues);
1240 } else if (I.getNumOperands() != 0) {
1241 SmallVector<EVT, 4> ValueVTs;
1242 ComputeValueVTs(*TLI, I.getOperand(0)->getType(), ValueVTs);
1243 unsigned NumValues = ValueVTs.size();
1245 SDValue RetOp = getValue(I.getOperand(0));
1246 for (unsigned j = 0, f = NumValues; j != f; ++j) {
1247 EVT VT = ValueVTs[j];
1249 ISD::NodeType ExtendKind = ISD::ANY_EXTEND;
1251 const Function *F = I.getParent()->getParent();
1252 if (F->getAttributes().hasAttribute(AttributeSet::ReturnIndex,
1254 ExtendKind = ISD::SIGN_EXTEND;
1255 else if (F->getAttributes().hasAttribute(AttributeSet::ReturnIndex,
1257 ExtendKind = ISD::ZERO_EXTEND;
1259 if (ExtendKind != ISD::ANY_EXTEND && VT.isInteger())
1260 VT = TLI->getTypeForExtArgOrReturn(VT.getSimpleVT(), ExtendKind);
1262 unsigned NumParts = TLI->getNumRegisters(*DAG.getContext(), VT);
1263 MVT PartVT = TLI->getRegisterType(*DAG.getContext(), VT);
1264 SmallVector<SDValue, 4> Parts(NumParts);
1265 getCopyToParts(DAG, getCurSDLoc(),
1266 SDValue(RetOp.getNode(), RetOp.getResNo() + j),
1267 &Parts[0], NumParts, PartVT, &I, ExtendKind);
1269 // 'inreg' on function refers to return value
1270 ISD::ArgFlagsTy Flags = ISD::ArgFlagsTy();
1271 if (F->getAttributes().hasAttribute(AttributeSet::ReturnIndex,
1275 // Propagate extension type if any
1276 if (ExtendKind == ISD::SIGN_EXTEND)
1278 else if (ExtendKind == ISD::ZERO_EXTEND)
1281 for (unsigned i = 0; i < NumParts; ++i) {
1282 Outs.push_back(ISD::OutputArg(Flags, Parts[i].getValueType(),
1283 VT, /*isfixed=*/true, 0, 0));
1284 OutVals.push_back(Parts[i]);
1290 bool isVarArg = DAG.getMachineFunction().getFunction()->isVarArg();
1291 CallingConv::ID CallConv =
1292 DAG.getMachineFunction().getFunction()->getCallingConv();
1293 Chain = TM.getTargetLowering()->LowerReturn(Chain, CallConv, isVarArg,
1294 Outs, OutVals, getCurSDLoc(),
1297 // Verify that the target's LowerReturn behaved as expected.
1298 assert(Chain.getNode() && Chain.getValueType() == MVT::Other &&
1299 "LowerReturn didn't return a valid chain!");
1301 // Update the DAG with the new chain value resulting from return lowering.
1305 /// CopyToExportRegsIfNeeded - If the given value has virtual registers
1306 /// created for it, emit nodes to copy the value into the virtual
1308 void SelectionDAGBuilder::CopyToExportRegsIfNeeded(const Value *V) {
1310 if (V->getType()->isEmptyTy())
1313 DenseMap<const Value *, unsigned>::iterator VMI = FuncInfo.ValueMap.find(V);
1314 if (VMI != FuncInfo.ValueMap.end()) {
1315 assert(!V->use_empty() && "Unused value assigned virtual registers!");
1316 CopyValueToVirtualRegister(V, VMI->second);
1320 /// ExportFromCurrentBlock - If this condition isn't known to be exported from
1321 /// the current basic block, add it to ValueMap now so that we'll get a
1323 void SelectionDAGBuilder::ExportFromCurrentBlock(const Value *V) {
1324 // No need to export constants.
1325 if (!isa<Instruction>(V) && !isa<Argument>(V)) return;
1327 // Already exported?
1328 if (FuncInfo.isExportedInst(V)) return;
1330 unsigned Reg = FuncInfo.InitializeRegForValue(V);
1331 CopyValueToVirtualRegister(V, Reg);
1334 bool SelectionDAGBuilder::isExportableFromCurrentBlock(const Value *V,
1335 const BasicBlock *FromBB) {
1336 // The operands of the setcc have to be in this block. We don't know
1337 // how to export them from some other block.
1338 if (const Instruction *VI = dyn_cast<Instruction>(V)) {
1339 // Can export from current BB.
1340 if (VI->getParent() == FromBB)
1343 // Is already exported, noop.
1344 return FuncInfo.isExportedInst(V);
1347 // If this is an argument, we can export it if the BB is the entry block or
1348 // if it is already exported.
1349 if (isa<Argument>(V)) {
1350 if (FromBB == &FromBB->getParent()->getEntryBlock())
1353 // Otherwise, can only export this if it is already exported.
1354 return FuncInfo.isExportedInst(V);
1357 // Otherwise, constants can always be exported.
1361 /// Return branch probability calculated by BranchProbabilityInfo for IR blocks.
1362 uint32_t SelectionDAGBuilder::getEdgeWeight(const MachineBasicBlock *Src,
1363 const MachineBasicBlock *Dst) const {
1364 BranchProbabilityInfo *BPI = FuncInfo.BPI;
1367 const BasicBlock *SrcBB = Src->getBasicBlock();
1368 const BasicBlock *DstBB = Dst->getBasicBlock();
1369 return BPI->getEdgeWeight(SrcBB, DstBB);
1372 void SelectionDAGBuilder::
1373 addSuccessorWithWeight(MachineBasicBlock *Src, MachineBasicBlock *Dst,
1374 uint32_t Weight /* = 0 */) {
1376 Weight = getEdgeWeight(Src, Dst);
1377 Src->addSuccessor(Dst, Weight);
1381 static bool InBlock(const Value *V, const BasicBlock *BB) {
1382 if (const Instruction *I = dyn_cast<Instruction>(V))
1383 return I->getParent() == BB;
1387 /// EmitBranchForMergedCondition - Helper method for FindMergedConditions.
1388 /// This function emits a branch and is used at the leaves of an OR or an
1389 /// AND operator tree.
1392 SelectionDAGBuilder::EmitBranchForMergedCondition(const Value *Cond,
1393 MachineBasicBlock *TBB,
1394 MachineBasicBlock *FBB,
1395 MachineBasicBlock *CurBB,
1396 MachineBasicBlock *SwitchBB,
1399 const BasicBlock *BB = CurBB->getBasicBlock();
1401 // If the leaf of the tree is a comparison, merge the condition into
1403 if (const CmpInst *BOp = dyn_cast<CmpInst>(Cond)) {
1404 // The operands of the cmp have to be in this block. We don't know
1405 // how to export them from some other block. If this is the first block
1406 // of the sequence, no exporting is needed.
1407 if (CurBB == SwitchBB ||
1408 (isExportableFromCurrentBlock(BOp->getOperand(0), BB) &&
1409 isExportableFromCurrentBlock(BOp->getOperand(1), BB))) {
1410 ISD::CondCode Condition;
1411 if (const ICmpInst *IC = dyn_cast<ICmpInst>(Cond)) {
1412 Condition = getICmpCondCode(IC->getPredicate());
1413 } else if (const FCmpInst *FC = dyn_cast<FCmpInst>(Cond)) {
1414 Condition = getFCmpCondCode(FC->getPredicate());
1415 if (TM.Options.NoNaNsFPMath)
1416 Condition = getFCmpCodeWithoutNaN(Condition);
1418 Condition = ISD::SETEQ; // silence warning.
1419 llvm_unreachable("Unknown compare instruction");
1422 CaseBlock CB(Condition, BOp->getOperand(0),
1423 BOp->getOperand(1), NULL, TBB, FBB, CurBB, TWeight, FWeight);
1424 SwitchCases.push_back(CB);
1429 // Create a CaseBlock record representing this branch.
1430 CaseBlock CB(ISD::SETEQ, Cond, ConstantInt::getTrue(*DAG.getContext()),
1431 NULL, TBB, FBB, CurBB, TWeight, FWeight);
1432 SwitchCases.push_back(CB);
1435 /// Scale down both weights to fit into uint32_t.
1436 static void ScaleWeights(uint64_t &NewTrue, uint64_t &NewFalse) {
1437 uint64_t NewMax = (NewTrue > NewFalse) ? NewTrue : NewFalse;
1438 uint32_t Scale = (NewMax / UINT32_MAX) + 1;
1439 NewTrue = NewTrue / Scale;
1440 NewFalse = NewFalse / Scale;
1443 /// FindMergedConditions - If Cond is an expression like
1444 void SelectionDAGBuilder::FindMergedConditions(const Value *Cond,
1445 MachineBasicBlock *TBB,
1446 MachineBasicBlock *FBB,
1447 MachineBasicBlock *CurBB,
1448 MachineBasicBlock *SwitchBB,
1449 unsigned Opc, uint32_t TWeight,
1451 // If this node is not part of the or/and tree, emit it as a branch.
1452 const Instruction *BOp = dyn_cast<Instruction>(Cond);
1453 if (!BOp || !(isa<BinaryOperator>(BOp) || isa<CmpInst>(BOp)) ||
1454 (unsigned)BOp->getOpcode() != Opc || !BOp->hasOneUse() ||
1455 BOp->getParent() != CurBB->getBasicBlock() ||
1456 !InBlock(BOp->getOperand(0), CurBB->getBasicBlock()) ||
1457 !InBlock(BOp->getOperand(1), CurBB->getBasicBlock())) {
1458 EmitBranchForMergedCondition(Cond, TBB, FBB, CurBB, SwitchBB,
1463 // Create TmpBB after CurBB.
1464 MachineFunction::iterator BBI = CurBB;
1465 MachineFunction &MF = DAG.getMachineFunction();
1466 MachineBasicBlock *TmpBB = MF.CreateMachineBasicBlock(CurBB->getBasicBlock());
1467 CurBB->getParent()->insert(++BBI, TmpBB);
1469 if (Opc == Instruction::Or) {
1470 // Codegen X | Y as:
1479 // We have flexibility in setting Prob for BB1 and Prob for TmpBB.
1480 // The requirement is that
1481 // TrueProb for BB1 + (FalseProb for BB1 * TrueProb for TmpBB)
1482 // = TrueProb for orignal BB.
1483 // Assuming the orignal weights are A and B, one choice is to set BB1's
1484 // weights to A and A+2B, and set TmpBB's weights to A and 2B. This choice
1486 // TrueProb for BB1 == FalseProb for BB1 * TrueProb for TmpBB.
1487 // Another choice is to assume TrueProb for BB1 equals to TrueProb for
1488 // TmpBB, but the math is more complicated.
1490 uint64_t NewTrueWeight = TWeight;
1491 uint64_t NewFalseWeight = (uint64_t)TWeight + 2 * (uint64_t)FWeight;
1492 ScaleWeights(NewTrueWeight, NewFalseWeight);
1493 // Emit the LHS condition.
1494 FindMergedConditions(BOp->getOperand(0), TBB, TmpBB, CurBB, SwitchBB, Opc,
1495 NewTrueWeight, NewFalseWeight);
1497 NewTrueWeight = TWeight;
1498 NewFalseWeight = 2 * (uint64_t)FWeight;
1499 ScaleWeights(NewTrueWeight, NewFalseWeight);
1500 // Emit the RHS condition into TmpBB.
1501 FindMergedConditions(BOp->getOperand(1), TBB, FBB, TmpBB, SwitchBB, Opc,
1502 NewTrueWeight, NewFalseWeight);
1504 assert(Opc == Instruction::And && "Unknown merge op!");
1505 // Codegen X & Y as:
1513 // This requires creation of TmpBB after CurBB.
1515 // We have flexibility in setting Prob for BB1 and Prob for TmpBB.
1516 // The requirement is that
1517 // FalseProb for BB1 + (TrueProb for BB1 * FalseProb for TmpBB)
1518 // = FalseProb for orignal BB.
1519 // Assuming the orignal weights are A and B, one choice is to set BB1's
1520 // weights to 2A+B and B, and set TmpBB's weights to 2A and B. This choice
1522 // FalseProb for BB1 == TrueProb for BB1 * FalseProb for TmpBB.
1524 uint64_t NewTrueWeight = 2 * (uint64_t)TWeight + (uint64_t)FWeight;
1525 uint64_t NewFalseWeight = FWeight;
1526 ScaleWeights(NewTrueWeight, NewFalseWeight);
1527 // Emit the LHS condition.
1528 FindMergedConditions(BOp->getOperand(0), TmpBB, FBB, CurBB, SwitchBB, Opc,
1529 NewTrueWeight, NewFalseWeight);
1531 NewTrueWeight = 2 * (uint64_t)TWeight;
1532 NewFalseWeight = FWeight;
1533 ScaleWeights(NewTrueWeight, NewFalseWeight);
1534 // Emit the RHS condition into TmpBB.
1535 FindMergedConditions(BOp->getOperand(1), TBB, FBB, TmpBB, SwitchBB, Opc,
1536 NewTrueWeight, NewFalseWeight);
1540 /// If the set of cases should be emitted as a series of branches, return true.
1541 /// If we should emit this as a bunch of and/or'd together conditions, return
1544 SelectionDAGBuilder::ShouldEmitAsBranches(const std::vector<CaseBlock> &Cases) {
1545 if (Cases.size() != 2) return true;
1547 // If this is two comparisons of the same values or'd or and'd together, they
1548 // will get folded into a single comparison, so don't emit two blocks.
1549 if ((Cases[0].CmpLHS == Cases[1].CmpLHS &&
1550 Cases[0].CmpRHS == Cases[1].CmpRHS) ||
1551 (Cases[0].CmpRHS == Cases[1].CmpLHS &&
1552 Cases[0].CmpLHS == Cases[1].CmpRHS)) {
1556 // Handle: (X != null) | (Y != null) --> (X|Y) != 0
1557 // Handle: (X == null) & (Y == null) --> (X|Y) == 0
1558 if (Cases[0].CmpRHS == Cases[1].CmpRHS &&
1559 Cases[0].CC == Cases[1].CC &&
1560 isa<Constant>(Cases[0].CmpRHS) &&
1561 cast<Constant>(Cases[0].CmpRHS)->isNullValue()) {
1562 if (Cases[0].CC == ISD::SETEQ && Cases[0].TrueBB == Cases[1].ThisBB)
1564 if (Cases[0].CC == ISD::SETNE && Cases[0].FalseBB == Cases[1].ThisBB)
1571 void SelectionDAGBuilder::visitBr(const BranchInst &I) {
1572 MachineBasicBlock *BrMBB = FuncInfo.MBB;
1574 // Update machine-CFG edges.
1575 MachineBasicBlock *Succ0MBB = FuncInfo.MBBMap[I.getSuccessor(0)];
1577 // Figure out which block is immediately after the current one.
1578 MachineBasicBlock *NextBlock = 0;
1579 MachineFunction::iterator BBI = BrMBB;
1580 if (++BBI != FuncInfo.MF->end())
1583 if (I.isUnconditional()) {
1584 // Update machine-CFG edges.
1585 BrMBB->addSuccessor(Succ0MBB);
1587 // If this is not a fall-through branch, emit the branch.
1588 if (Succ0MBB != NextBlock)
1589 DAG.setRoot(DAG.getNode(ISD::BR, getCurSDLoc(),
1590 MVT::Other, getControlRoot(),
1591 DAG.getBasicBlock(Succ0MBB)));
1596 // If this condition is one of the special cases we handle, do special stuff
1598 const Value *CondVal = I.getCondition();
1599 MachineBasicBlock *Succ1MBB = FuncInfo.MBBMap[I.getSuccessor(1)];
1601 // If this is a series of conditions that are or'd or and'd together, emit
1602 // this as a sequence of branches instead of setcc's with and/or operations.
1603 // As long as jumps are not expensive, this should improve performance.
1604 // For example, instead of something like:
1617 if (const BinaryOperator *BOp = dyn_cast<BinaryOperator>(CondVal)) {
1618 if (!TM.getTargetLowering()->isJumpExpensive() &&
1620 (BOp->getOpcode() == Instruction::And ||
1621 BOp->getOpcode() == Instruction::Or)) {
1622 FindMergedConditions(BOp, Succ0MBB, Succ1MBB, BrMBB, BrMBB,
1623 BOp->getOpcode(), getEdgeWeight(BrMBB, Succ0MBB),
1624 getEdgeWeight(BrMBB, Succ1MBB));
1625 // If the compares in later blocks need to use values not currently
1626 // exported from this block, export them now. This block should always
1627 // be the first entry.
1628 assert(SwitchCases[0].ThisBB == BrMBB && "Unexpected lowering!");
1630 // Allow some cases to be rejected.
1631 if (ShouldEmitAsBranches(SwitchCases)) {
1632 for (unsigned i = 1, e = SwitchCases.size(); i != e; ++i) {
1633 ExportFromCurrentBlock(SwitchCases[i].CmpLHS);
1634 ExportFromCurrentBlock(SwitchCases[i].CmpRHS);
1637 // Emit the branch for this block.
1638 visitSwitchCase(SwitchCases[0], BrMBB);
1639 SwitchCases.erase(SwitchCases.begin());
1643 // Okay, we decided not to do this, remove any inserted MBB's and clear
1645 for (unsigned i = 1, e = SwitchCases.size(); i != e; ++i)
1646 FuncInfo.MF->erase(SwitchCases[i].ThisBB);
1648 SwitchCases.clear();
1652 // Create a CaseBlock record representing this branch.
1653 CaseBlock CB(ISD::SETEQ, CondVal, ConstantInt::getTrue(*DAG.getContext()),
1654 NULL, Succ0MBB, Succ1MBB, BrMBB);
1656 // Use visitSwitchCase to actually insert the fast branch sequence for this
1658 visitSwitchCase(CB, BrMBB);
1661 /// visitSwitchCase - Emits the necessary code to represent a single node in
1662 /// the binary search tree resulting from lowering a switch instruction.
1663 void SelectionDAGBuilder::visitSwitchCase(CaseBlock &CB,
1664 MachineBasicBlock *SwitchBB) {
1666 SDValue CondLHS = getValue(CB.CmpLHS);
1667 SDLoc dl = getCurSDLoc();
1669 // Build the setcc now.
1670 if (CB.CmpMHS == NULL) {
1671 // Fold "(X == true)" to X and "(X == false)" to !X to
1672 // handle common cases produced by branch lowering.
1673 if (CB.CmpRHS == ConstantInt::getTrue(*DAG.getContext()) &&
1674 CB.CC == ISD::SETEQ)
1676 else if (CB.CmpRHS == ConstantInt::getFalse(*DAG.getContext()) &&
1677 CB.CC == ISD::SETEQ) {
1678 SDValue True = DAG.getConstant(1, CondLHS.getValueType());
1679 Cond = DAG.getNode(ISD::XOR, dl, CondLHS.getValueType(), CondLHS, True);
1681 Cond = DAG.getSetCC(dl, MVT::i1, CondLHS, getValue(CB.CmpRHS), CB.CC);
1683 assert(CB.CC == ISD::SETLE && "Can handle only LE ranges now");
1685 const APInt& Low = cast<ConstantInt>(CB.CmpLHS)->getValue();
1686 const APInt& High = cast<ConstantInt>(CB.CmpRHS)->getValue();
1688 SDValue CmpOp = getValue(CB.CmpMHS);
1689 EVT VT = CmpOp.getValueType();
1691 if (cast<ConstantInt>(CB.CmpLHS)->isMinValue(true)) {
1692 Cond = DAG.getSetCC(dl, MVT::i1, CmpOp, DAG.getConstant(High, VT),
1695 SDValue SUB = DAG.getNode(ISD::SUB, dl,
1696 VT, CmpOp, DAG.getConstant(Low, VT));
1697 Cond = DAG.getSetCC(dl, MVT::i1, SUB,
1698 DAG.getConstant(High-Low, VT), ISD::SETULE);
1702 // Update successor info
1703 addSuccessorWithWeight(SwitchBB, CB.TrueBB, CB.TrueWeight);
1704 // TrueBB and FalseBB are always different unless the incoming IR is
1705 // degenerate. This only happens when running llc on weird IR.
1706 if (CB.TrueBB != CB.FalseBB)
1707 addSuccessorWithWeight(SwitchBB, CB.FalseBB, CB.FalseWeight);
1709 // Set NextBlock to be the MBB immediately after the current one, if any.
1710 // This is used to avoid emitting unnecessary branches to the next block.
1711 MachineBasicBlock *NextBlock = 0;
1712 MachineFunction::iterator BBI = SwitchBB;
1713 if (++BBI != FuncInfo.MF->end())
1716 // If the lhs block is the next block, invert the condition so that we can
1717 // fall through to the lhs instead of the rhs block.
1718 if (CB.TrueBB == NextBlock) {
1719 std::swap(CB.TrueBB, CB.FalseBB);
1720 SDValue True = DAG.getConstant(1, Cond.getValueType());
1721 Cond = DAG.getNode(ISD::XOR, dl, Cond.getValueType(), Cond, True);
1724 SDValue BrCond = DAG.getNode(ISD::BRCOND, dl,
1725 MVT::Other, getControlRoot(), Cond,
1726 DAG.getBasicBlock(CB.TrueBB));
1728 // Insert the false branch. Do this even if it's a fall through branch,
1729 // this makes it easier to do DAG optimizations which require inverting
1730 // the branch condition.
1731 BrCond = DAG.getNode(ISD::BR, dl, MVT::Other, BrCond,
1732 DAG.getBasicBlock(CB.FalseBB));
1734 DAG.setRoot(BrCond);
1737 /// visitJumpTable - Emit JumpTable node in the current MBB
1738 void SelectionDAGBuilder::visitJumpTable(JumpTable &JT) {
1739 // Emit the code for the jump table
1740 assert(JT.Reg != -1U && "Should lower JT Header first!");
1741 EVT PTy = TM.getTargetLowering()->getPointerTy();
1742 SDValue Index = DAG.getCopyFromReg(getControlRoot(), getCurSDLoc(),
1744 SDValue Table = DAG.getJumpTable(JT.JTI, PTy);
1745 SDValue BrJumpTable = DAG.getNode(ISD::BR_JT, getCurSDLoc(),
1746 MVT::Other, Index.getValue(1),
1748 DAG.setRoot(BrJumpTable);
1751 /// visitJumpTableHeader - This function emits necessary code to produce index
1752 /// in the JumpTable from switch case.
1753 void SelectionDAGBuilder::visitJumpTableHeader(JumpTable &JT,
1754 JumpTableHeader &JTH,
1755 MachineBasicBlock *SwitchBB) {
1756 // Subtract the lowest switch case value from the value being switched on and
1757 // conditional branch to default mbb if the result is greater than the
1758 // difference between smallest and largest cases.
1759 SDValue SwitchOp = getValue(JTH.SValue);
1760 EVT VT = SwitchOp.getValueType();
1761 SDValue Sub = DAG.getNode(ISD::SUB, getCurSDLoc(), VT, SwitchOp,
1762 DAG.getConstant(JTH.First, VT));
1764 // The SDNode we just created, which holds the value being switched on minus
1765 // the smallest case value, needs to be copied to a virtual register so it
1766 // can be used as an index into the jump table in a subsequent basic block.
1767 // This value may be smaller or larger than the target's pointer type, and
1768 // therefore require extension or truncating.
1769 const TargetLowering *TLI = TM.getTargetLowering();
1770 SwitchOp = DAG.getZExtOrTrunc(Sub, getCurSDLoc(), TLI->getPointerTy());
1772 unsigned JumpTableReg = FuncInfo.CreateReg(TLI->getPointerTy());
1773 SDValue CopyTo = DAG.getCopyToReg(getControlRoot(), getCurSDLoc(),
1774 JumpTableReg, SwitchOp);
1775 JT.Reg = JumpTableReg;
1777 // Emit the range check for the jump table, and branch to the default block
1778 // for the switch statement if the value being switched on exceeds the largest
1779 // case in the switch.
1780 SDValue CMP = DAG.getSetCC(getCurSDLoc(),
1781 TLI->getSetCCResultType(*DAG.getContext(),
1782 Sub.getValueType()),
1784 DAG.getConstant(JTH.Last - JTH.First,VT),
1787 // Set NextBlock to be the MBB immediately after the current one, if any.
1788 // This is used to avoid emitting unnecessary branches to the next block.
1789 MachineBasicBlock *NextBlock = 0;
1790 MachineFunction::iterator BBI = SwitchBB;
1792 if (++BBI != FuncInfo.MF->end())
1795 SDValue BrCond = DAG.getNode(ISD::BRCOND, getCurSDLoc(),
1796 MVT::Other, CopyTo, CMP,
1797 DAG.getBasicBlock(JT.Default));
1799 if (JT.MBB != NextBlock)
1800 BrCond = DAG.getNode(ISD::BR, getCurSDLoc(), MVT::Other, BrCond,
1801 DAG.getBasicBlock(JT.MBB));
1803 DAG.setRoot(BrCond);
1806 /// Codegen a new tail for a stack protector check ParentMBB which has had its
1807 /// tail spliced into a stack protector check success bb.
1809 /// For a high level explanation of how this fits into the stack protector
1810 /// generation see the comment on the declaration of class
1811 /// StackProtectorDescriptor.
1812 void SelectionDAGBuilder::visitSPDescriptorParent(StackProtectorDescriptor &SPD,
1813 MachineBasicBlock *ParentBB) {
1815 // First create the loads to the guard/stack slot for the comparison.
1816 const TargetLowering *TLI = TM.getTargetLowering();
1817 EVT PtrTy = TLI->getPointerTy();
1819 MachineFrameInfo *MFI = ParentBB->getParent()->getFrameInfo();
1820 int FI = MFI->getStackProtectorIndex();
1822 const Value *IRGuard = SPD.getGuard();
1823 SDValue GuardPtr = getValue(IRGuard);
1824 SDValue StackSlotPtr = DAG.getFrameIndex(FI, PtrTy);
1827 TLI->getDataLayout()->getPrefTypeAlignment(IRGuard->getType());
1828 SDValue Guard = DAG.getLoad(PtrTy, getCurSDLoc(), DAG.getEntryNode(),
1829 GuardPtr, MachinePointerInfo(IRGuard, 0),
1830 true, false, false, Align);
1832 SDValue StackSlot = DAG.getLoad(PtrTy, getCurSDLoc(), DAG.getEntryNode(),
1834 MachinePointerInfo::getFixedStack(FI),
1835 true, false, false, Align);
1837 // Perform the comparison via a subtract/getsetcc.
1838 EVT VT = Guard.getValueType();
1839 SDValue Sub = DAG.getNode(ISD::SUB, getCurSDLoc(), VT, Guard, StackSlot);
1841 SDValue Cmp = DAG.getSetCC(getCurSDLoc(),
1842 TLI->getSetCCResultType(*DAG.getContext(),
1843 Sub.getValueType()),
1844 Sub, DAG.getConstant(0, VT),
1847 // If the sub is not 0, then we know the guard/stackslot do not equal, so
1848 // branch to failure MBB.
1849 SDValue BrCond = DAG.getNode(ISD::BRCOND, getCurSDLoc(),
1850 MVT::Other, StackSlot.getOperand(0),
1851 Cmp, DAG.getBasicBlock(SPD.getFailureMBB()));
1852 // Otherwise branch to success MBB.
1853 SDValue Br = DAG.getNode(ISD::BR, getCurSDLoc(),
1855 DAG.getBasicBlock(SPD.getSuccessMBB()));
1860 /// Codegen the failure basic block for a stack protector check.
1862 /// A failure stack protector machine basic block consists simply of a call to
1863 /// __stack_chk_fail().
1865 /// For a high level explanation of how this fits into the stack protector
1866 /// generation see the comment on the declaration of class
1867 /// StackProtectorDescriptor.
1869 SelectionDAGBuilder::visitSPDescriptorFailure(StackProtectorDescriptor &SPD) {
1870 const TargetLowering *TLI = TM.getTargetLowering();
1871 SDValue Chain = TLI->makeLibCall(DAG, RTLIB::STACKPROTECTOR_CHECK_FAIL,
1872 MVT::isVoid, 0, 0, false, getCurSDLoc(),
1873 false, false).second;
1877 /// visitBitTestHeader - This function emits necessary code to produce value
1878 /// suitable for "bit tests"
1879 void SelectionDAGBuilder::visitBitTestHeader(BitTestBlock &B,
1880 MachineBasicBlock *SwitchBB) {
1881 // Subtract the minimum value
1882 SDValue SwitchOp = getValue(B.SValue);
1883 EVT VT = SwitchOp.getValueType();
1884 SDValue Sub = DAG.getNode(ISD::SUB, getCurSDLoc(), VT, SwitchOp,
1885 DAG.getConstant(B.First, VT));
1888 const TargetLowering *TLI = TM.getTargetLowering();
1889 SDValue RangeCmp = DAG.getSetCC(getCurSDLoc(),
1890 TLI->getSetCCResultType(*DAG.getContext(),
1891 Sub.getValueType()),
1892 Sub, DAG.getConstant(B.Range, VT),
1895 // Determine the type of the test operands.
1896 bool UsePtrType = false;
1897 if (!TLI->isTypeLegal(VT))
1900 for (unsigned i = 0, e = B.Cases.size(); i != e; ++i)
1901 if (!isUIntN(VT.getSizeInBits(), B.Cases[i].Mask)) {
1902 // Switch table case range are encoded into series of masks.
1903 // Just use pointer type, it's guaranteed to fit.
1909 VT = TLI->getPointerTy();
1910 Sub = DAG.getZExtOrTrunc(Sub, getCurSDLoc(), VT);
1913 B.RegVT = VT.getSimpleVT();
1914 B.Reg = FuncInfo.CreateReg(B.RegVT);
1915 SDValue CopyTo = DAG.getCopyToReg(getControlRoot(), getCurSDLoc(),
1918 // Set NextBlock to be the MBB immediately after the current one, if any.
1919 // This is used to avoid emitting unnecessary branches to the next block.
1920 MachineBasicBlock *NextBlock = 0;
1921 MachineFunction::iterator BBI = SwitchBB;
1922 if (++BBI != FuncInfo.MF->end())
1925 MachineBasicBlock* MBB = B.Cases[0].ThisBB;
1927 addSuccessorWithWeight(SwitchBB, B.Default);
1928 addSuccessorWithWeight(SwitchBB, MBB);
1930 SDValue BrRange = DAG.getNode(ISD::BRCOND, getCurSDLoc(),
1931 MVT::Other, CopyTo, RangeCmp,
1932 DAG.getBasicBlock(B.Default));
1934 if (MBB != NextBlock)
1935 BrRange = DAG.getNode(ISD::BR, getCurSDLoc(), MVT::Other, CopyTo,
1936 DAG.getBasicBlock(MBB));
1938 DAG.setRoot(BrRange);
1941 /// visitBitTestCase - this function produces one "bit test"
1942 void SelectionDAGBuilder::visitBitTestCase(BitTestBlock &BB,
1943 MachineBasicBlock* NextMBB,
1944 uint32_t BranchWeightToNext,
1947 MachineBasicBlock *SwitchBB) {
1949 SDValue ShiftOp = DAG.getCopyFromReg(getControlRoot(), getCurSDLoc(),
1952 unsigned PopCount = CountPopulation_64(B.Mask);
1953 const TargetLowering *TLI = TM.getTargetLowering();
1954 if (PopCount == 1) {
1955 // Testing for a single bit; just compare the shift count with what it
1956 // would need to be to shift a 1 bit in that position.
1957 Cmp = DAG.getSetCC(getCurSDLoc(),
1958 TLI->getSetCCResultType(*DAG.getContext(), VT),
1960 DAG.getConstant(countTrailingZeros(B.Mask), VT),
1962 } else if (PopCount == BB.Range) {
1963 // There is only one zero bit in the range, test for it directly.
1964 Cmp = DAG.getSetCC(getCurSDLoc(),
1965 TLI->getSetCCResultType(*DAG.getContext(), VT),
1967 DAG.getConstant(CountTrailingOnes_64(B.Mask), VT),
1970 // Make desired shift
1971 SDValue SwitchVal = DAG.getNode(ISD::SHL, getCurSDLoc(), VT,
1972 DAG.getConstant(1, VT), ShiftOp);
1974 // Emit bit tests and jumps
1975 SDValue AndOp = DAG.getNode(ISD::AND, getCurSDLoc(),
1976 VT, SwitchVal, DAG.getConstant(B.Mask, VT));
1977 Cmp = DAG.getSetCC(getCurSDLoc(),
1978 TLI->getSetCCResultType(*DAG.getContext(), VT),
1979 AndOp, DAG.getConstant(0, VT),
1983 // The branch weight from SwitchBB to B.TargetBB is B.ExtraWeight.
1984 addSuccessorWithWeight(SwitchBB, B.TargetBB, B.ExtraWeight);
1985 // The branch weight from SwitchBB to NextMBB is BranchWeightToNext.
1986 addSuccessorWithWeight(SwitchBB, NextMBB, BranchWeightToNext);
1988 SDValue BrAnd = DAG.getNode(ISD::BRCOND, getCurSDLoc(),
1989 MVT::Other, getControlRoot(),
1990 Cmp, DAG.getBasicBlock(B.TargetBB));
1992 // Set NextBlock to be the MBB immediately after the current one, if any.
1993 // This is used to avoid emitting unnecessary branches to the next block.
1994 MachineBasicBlock *NextBlock = 0;
1995 MachineFunction::iterator BBI = SwitchBB;
1996 if (++BBI != FuncInfo.MF->end())
1999 if (NextMBB != NextBlock)
2000 BrAnd = DAG.getNode(ISD::BR, getCurSDLoc(), MVT::Other, BrAnd,
2001 DAG.getBasicBlock(NextMBB));
2006 void SelectionDAGBuilder::visitInvoke(const InvokeInst &I) {
2007 MachineBasicBlock *InvokeMBB = FuncInfo.MBB;
2009 // Retrieve successors.
2010 MachineBasicBlock *Return = FuncInfo.MBBMap[I.getSuccessor(0)];
2011 MachineBasicBlock *LandingPad = FuncInfo.MBBMap[I.getSuccessor(1)];
2013 const Value *Callee(I.getCalledValue());
2014 const Function *Fn = dyn_cast<Function>(Callee);
2015 if (isa<InlineAsm>(Callee))
2017 else if (Fn && Fn->isIntrinsic()) {
2018 assert(Fn->getIntrinsicID() == Intrinsic::donothing);
2019 // Ignore invokes to @llvm.donothing: jump directly to the next BB.
2021 LowerCallTo(&I, getValue(Callee), false, LandingPad);
2023 // If the value of the invoke is used outside of its defining block, make it
2024 // available as a virtual register.
2025 CopyToExportRegsIfNeeded(&I);
2027 // Update successor info
2028 addSuccessorWithWeight(InvokeMBB, Return);
2029 addSuccessorWithWeight(InvokeMBB, LandingPad);
2031 // Drop into normal successor.
2032 DAG.setRoot(DAG.getNode(ISD::BR, getCurSDLoc(),
2033 MVT::Other, getControlRoot(),
2034 DAG.getBasicBlock(Return)));
2037 void SelectionDAGBuilder::visitResume(const ResumeInst &RI) {
2038 llvm_unreachable("SelectionDAGBuilder shouldn't visit resume instructions!");
2041 void SelectionDAGBuilder::visitLandingPad(const LandingPadInst &LP) {
2042 assert(FuncInfo.MBB->isLandingPad() &&
2043 "Call to landingpad not in landing pad!");
2045 MachineBasicBlock *MBB = FuncInfo.MBB;
2046 MachineModuleInfo &MMI = DAG.getMachineFunction().getMMI();
2047 AddLandingPadInfo(LP, MMI, MBB);
2049 // If there aren't registers to copy the values into (e.g., during SjLj
2050 // exceptions), then don't bother to create these DAG nodes.
2051 const TargetLowering *TLI = TM.getTargetLowering();
2052 if (TLI->getExceptionPointerRegister() == 0 &&
2053 TLI->getExceptionSelectorRegister() == 0)
2056 SmallVector<EVT, 2> ValueVTs;
2057 ComputeValueVTs(*TLI, LP.getType(), ValueVTs);
2058 assert(ValueVTs.size() == 2 && "Only two-valued landingpads are supported");
2060 // Get the two live-in registers as SDValues. The physregs have already been
2061 // copied into virtual registers.
2063 Ops[0] = DAG.getZExtOrTrunc(
2064 DAG.getCopyFromReg(DAG.getEntryNode(), getCurSDLoc(),
2065 FuncInfo.ExceptionPointerVirtReg, TLI->getPointerTy()),
2066 getCurSDLoc(), ValueVTs[0]);
2067 Ops[1] = DAG.getZExtOrTrunc(
2068 DAG.getCopyFromReg(DAG.getEntryNode(), getCurSDLoc(),
2069 FuncInfo.ExceptionSelectorVirtReg, TLI->getPointerTy()),
2070 getCurSDLoc(), ValueVTs[1]);
2073 SDValue Res = DAG.getNode(ISD::MERGE_VALUES, getCurSDLoc(),
2074 DAG.getVTList(&ValueVTs[0], ValueVTs.size()),
2079 /// handleSmallSwitchCaseRange - Emit a series of specific tests (suitable for
2080 /// small case ranges).
2081 bool SelectionDAGBuilder::handleSmallSwitchRange(CaseRec& CR,
2082 CaseRecVector& WorkList,
2084 MachineBasicBlock *Default,
2085 MachineBasicBlock *SwitchBB) {
2086 // Size is the number of Cases represented by this range.
2087 size_t Size = CR.Range.second - CR.Range.first;
2091 // Get the MachineFunction which holds the current MBB. This is used when
2092 // inserting any additional MBBs necessary to represent the switch.
2093 MachineFunction *CurMF = FuncInfo.MF;
2095 // Figure out which block is immediately after the current one.
2096 MachineBasicBlock *NextBlock = 0;
2097 MachineFunction::iterator BBI = CR.CaseBB;
2099 if (++BBI != FuncInfo.MF->end())
2102 BranchProbabilityInfo *BPI = FuncInfo.BPI;
2103 // If any two of the cases has the same destination, and if one value
2104 // is the same as the other, but has one bit unset that the other has set,
2105 // use bit manipulation to do two compares at once. For example:
2106 // "if (X == 6 || X == 4)" -> "if ((X|2) == 6)"
2107 // TODO: This could be extended to merge any 2 cases in switches with 3 cases.
2108 // TODO: Handle cases where CR.CaseBB != SwitchBB.
2109 if (Size == 2 && CR.CaseBB == SwitchBB) {
2110 Case &Small = *CR.Range.first;
2111 Case &Big = *(CR.Range.second-1);
2113 if (Small.Low == Small.High && Big.Low == Big.High && Small.BB == Big.BB) {
2114 const APInt& SmallValue = cast<ConstantInt>(Small.Low)->getValue();
2115 const APInt& BigValue = cast<ConstantInt>(Big.Low)->getValue();
2117 // Check that there is only one bit different.
2118 if (BigValue.countPopulation() == SmallValue.countPopulation() + 1 &&
2119 (SmallValue | BigValue) == BigValue) {
2120 // Isolate the common bit.
2121 APInt CommonBit = BigValue & ~SmallValue;
2122 assert((SmallValue | CommonBit) == BigValue &&
2123 CommonBit.countPopulation() == 1 && "Not a common bit?");
2125 SDValue CondLHS = getValue(SV);
2126 EVT VT = CondLHS.getValueType();
2127 SDLoc DL = getCurSDLoc();
2129 SDValue Or = DAG.getNode(ISD::OR, DL, VT, CondLHS,
2130 DAG.getConstant(CommonBit, VT));
2131 SDValue Cond = DAG.getSetCC(DL, MVT::i1,
2132 Or, DAG.getConstant(BigValue, VT),
2135 // Update successor info.
2136 // Both Small and Big will jump to Small.BB, so we sum up the weights.
2137 addSuccessorWithWeight(SwitchBB, Small.BB,
2138 Small.ExtraWeight + Big.ExtraWeight);
2139 addSuccessorWithWeight(SwitchBB, Default,
2140 // The default destination is the first successor in IR.
2141 BPI ? BPI->getEdgeWeight(SwitchBB->getBasicBlock(), (unsigned)0) : 0);
2143 // Insert the true branch.
2144 SDValue BrCond = DAG.getNode(ISD::BRCOND, DL, MVT::Other,
2145 getControlRoot(), Cond,
2146 DAG.getBasicBlock(Small.BB));
2148 // Insert the false branch.
2149 BrCond = DAG.getNode(ISD::BR, DL, MVT::Other, BrCond,
2150 DAG.getBasicBlock(Default));
2152 DAG.setRoot(BrCond);
2158 // Order cases by weight so the most likely case will be checked first.
2159 uint32_t UnhandledWeights = 0;
2161 for (CaseItr I = CR.Range.first, IE = CR.Range.second; I != IE; ++I) {
2162 uint32_t IWeight = I->ExtraWeight;
2163 UnhandledWeights += IWeight;
2164 for (CaseItr J = CR.Range.first; J < I; ++J) {
2165 uint32_t JWeight = J->ExtraWeight;
2166 if (IWeight > JWeight)
2171 // Rearrange the case blocks so that the last one falls through if possible.
2172 Case &BackCase = *(CR.Range.second-1);
2174 NextBlock && Default != NextBlock && BackCase.BB != NextBlock) {
2175 // The last case block won't fall through into 'NextBlock' if we emit the
2176 // branches in this order. See if rearranging a case value would help.
2177 // We start at the bottom as it's the case with the least weight.
2178 for (Case *I = &*(CR.Range.second-2), *E = &*CR.Range.first-1; I != E; --I)
2179 if (I->BB == NextBlock) {
2180 std::swap(*I, BackCase);
2185 // Create a CaseBlock record representing a conditional branch to
2186 // the Case's target mbb if the value being switched on SV is equal
2188 MachineBasicBlock *CurBlock = CR.CaseBB;
2189 for (CaseItr I = CR.Range.first, E = CR.Range.second; I != E; ++I) {
2190 MachineBasicBlock *FallThrough;
2192 FallThrough = CurMF->CreateMachineBasicBlock(CurBlock->getBasicBlock());
2193 CurMF->insert(BBI, FallThrough);
2195 // Put SV in a virtual register to make it available from the new blocks.
2196 ExportFromCurrentBlock(SV);
2198 // If the last case doesn't match, go to the default block.
2199 FallThrough = Default;
2202 const Value *RHS, *LHS, *MHS;
2204 if (I->High == I->Low) {
2205 // This is just small small case range :) containing exactly 1 case
2207 LHS = SV; RHS = I->High; MHS = NULL;
2210 LHS = I->Low; MHS = SV; RHS = I->High;
2213 // The false weight should be sum of all un-handled cases.
2214 UnhandledWeights -= I->ExtraWeight;
2215 CaseBlock CB(CC, LHS, RHS, MHS, /* truebb */ I->BB, /* falsebb */ FallThrough,
2217 /* trueweight */ I->ExtraWeight,
2218 /* falseweight */ UnhandledWeights);
2220 // If emitting the first comparison, just call visitSwitchCase to emit the
2221 // code into the current block. Otherwise, push the CaseBlock onto the
2222 // vector to be later processed by SDISel, and insert the node's MBB
2223 // before the next MBB.
2224 if (CurBlock == SwitchBB)
2225 visitSwitchCase(CB, SwitchBB);
2227 SwitchCases.push_back(CB);
2229 CurBlock = FallThrough;
2235 static inline bool areJTsAllowed(const TargetLowering &TLI) {
2236 return TLI.supportJumpTables() &&
2237 (TLI.isOperationLegalOrCustom(ISD::BR_JT, MVT::Other) ||
2238 TLI.isOperationLegalOrCustom(ISD::BRIND, MVT::Other));
2241 static APInt ComputeRange(const APInt &First, const APInt &Last) {
2242 uint32_t BitWidth = std::max(Last.getBitWidth(), First.getBitWidth()) + 1;
2243 APInt LastExt = Last.sext(BitWidth), FirstExt = First.sext(BitWidth);
2244 return (LastExt - FirstExt + 1ULL);
2247 /// handleJTSwitchCase - Emit jumptable for current switch case range
2248 bool SelectionDAGBuilder::handleJTSwitchCase(CaseRec &CR,
2249 CaseRecVector &WorkList,
2251 MachineBasicBlock *Default,
2252 MachineBasicBlock *SwitchBB) {
2253 Case& FrontCase = *CR.Range.first;
2254 Case& BackCase = *(CR.Range.second-1);
2256 const APInt &First = cast<ConstantInt>(FrontCase.Low)->getValue();
2257 const APInt &Last = cast<ConstantInt>(BackCase.High)->getValue();
2259 APInt TSize(First.getBitWidth(), 0);
2260 for (CaseItr I = CR.Range.first, E = CR.Range.second; I != E; ++I)
2263 const TargetLowering *TLI = TM.getTargetLowering();
2264 if (!areJTsAllowed(*TLI) || TSize.ult(TLI->getMinimumJumpTableEntries()))
2267 APInt Range = ComputeRange(First, Last);
2268 // The density is TSize / Range. Require at least 40%.
2269 // It should not be possible for IntTSize to saturate for sane code, but make
2270 // sure we handle Range saturation correctly.
2271 uint64_t IntRange = Range.getLimitedValue(UINT64_MAX/10);
2272 uint64_t IntTSize = TSize.getLimitedValue(UINT64_MAX/10);
2273 if (IntTSize * 10 < IntRange * 4)
2276 DEBUG(dbgs() << "Lowering jump table\n"
2277 << "First entry: " << First << ". Last entry: " << Last << '\n'
2278 << "Range: " << Range << ". Size: " << TSize << ".\n\n");
2280 // Get the MachineFunction which holds the current MBB. This is used when
2281 // inserting any additional MBBs necessary to represent the switch.
2282 MachineFunction *CurMF = FuncInfo.MF;
2284 // Figure out which block is immediately after the current one.
2285 MachineFunction::iterator BBI = CR.CaseBB;
2288 const BasicBlock *LLVMBB = CR.CaseBB->getBasicBlock();
2290 // Create a new basic block to hold the code for loading the address
2291 // of the jump table, and jumping to it. Update successor information;
2292 // we will either branch to the default case for the switch, or the jump
2294 MachineBasicBlock *JumpTableBB = CurMF->CreateMachineBasicBlock(LLVMBB);
2295 CurMF->insert(BBI, JumpTableBB);
2297 addSuccessorWithWeight(CR.CaseBB, Default);
2298 addSuccessorWithWeight(CR.CaseBB, JumpTableBB);
2300 // Build a vector of destination BBs, corresponding to each target
2301 // of the jump table. If the value of the jump table slot corresponds to
2302 // a case statement, push the case's BB onto the vector, otherwise, push
2304 std::vector<MachineBasicBlock*> DestBBs;
2306 for (CaseItr I = CR.Range.first, E = CR.Range.second; I != E; ++TEI) {
2307 const APInt &Low = cast<ConstantInt>(I->Low)->getValue();
2308 const APInt &High = cast<ConstantInt>(I->High)->getValue();
2310 if (Low.sle(TEI) && TEI.sle(High)) {
2311 DestBBs.push_back(I->BB);
2315 DestBBs.push_back(Default);
2319 // Calculate weight for each unique destination in CR.
2320 DenseMap<MachineBasicBlock*, uint32_t> DestWeights;
2322 for (CaseItr I = CR.Range.first, E = CR.Range.second; I != E; ++I) {
2323 DenseMap<MachineBasicBlock*, uint32_t>::iterator Itr =
2324 DestWeights.find(I->BB);
2325 if (Itr != DestWeights.end())
2326 Itr->second += I->ExtraWeight;
2328 DestWeights[I->BB] = I->ExtraWeight;
2331 // Update successor info. Add one edge to each unique successor.
2332 BitVector SuccsHandled(CR.CaseBB->getParent()->getNumBlockIDs());
2333 for (std::vector<MachineBasicBlock*>::iterator I = DestBBs.begin(),
2334 E = DestBBs.end(); I != E; ++I) {
2335 if (!SuccsHandled[(*I)->getNumber()]) {
2336 SuccsHandled[(*I)->getNumber()] = true;
2337 DenseMap<MachineBasicBlock*, uint32_t>::iterator Itr =
2338 DestWeights.find(*I);
2339 addSuccessorWithWeight(JumpTableBB, *I,
2340 Itr != DestWeights.end() ? Itr->second : 0);
2344 // Create a jump table index for this jump table.
2345 unsigned JTEncoding = TLI->getJumpTableEncoding();
2346 unsigned JTI = CurMF->getOrCreateJumpTableInfo(JTEncoding)
2347 ->createJumpTableIndex(DestBBs);
2349 // Set the jump table information so that we can codegen it as a second
2350 // MachineBasicBlock
2351 JumpTable JT(-1U, JTI, JumpTableBB, Default);
2352 JumpTableHeader JTH(First, Last, SV, CR.CaseBB, (CR.CaseBB == SwitchBB));
2353 if (CR.CaseBB == SwitchBB)
2354 visitJumpTableHeader(JT, JTH, SwitchBB);
2356 JTCases.push_back(JumpTableBlock(JTH, JT));
2360 /// handleBTSplitSwitchCase - emit comparison and split binary search tree into
2362 bool SelectionDAGBuilder::handleBTSplitSwitchCase(CaseRec& CR,
2363 CaseRecVector& WorkList,
2365 MachineBasicBlock* Default,
2366 MachineBasicBlock* SwitchBB) {
2367 // Get the MachineFunction which holds the current MBB. This is used when
2368 // inserting any additional MBBs necessary to represent the switch.
2369 MachineFunction *CurMF = FuncInfo.MF;
2371 // Figure out which block is immediately after the current one.
2372 MachineFunction::iterator BBI = CR.CaseBB;
2375 Case& FrontCase = *CR.Range.first;
2376 Case& BackCase = *(CR.Range.second-1);
2377 const BasicBlock *LLVMBB = CR.CaseBB->getBasicBlock();
2379 // Size is the number of Cases represented by this range.
2380 unsigned Size = CR.Range.second - CR.Range.first;
2382 const APInt &First = cast<ConstantInt>(FrontCase.Low)->getValue();
2383 const APInt &Last = cast<ConstantInt>(BackCase.High)->getValue();
2385 CaseItr Pivot = CR.Range.first + Size/2;
2387 // Select optimal pivot, maximizing sum density of LHS and RHS. This will
2388 // (heuristically) allow us to emit JumpTable's later.
2389 APInt TSize(First.getBitWidth(), 0);
2390 for (CaseItr I = CR.Range.first, E = CR.Range.second;
2394 APInt LSize = FrontCase.size();
2395 APInt RSize = TSize-LSize;
2396 DEBUG(dbgs() << "Selecting best pivot: \n"
2397 << "First: " << First << ", Last: " << Last <<'\n'
2398 << "LSize: " << LSize << ", RSize: " << RSize << '\n');
2399 for (CaseItr I = CR.Range.first, J=I+1, E = CR.Range.second;
2401 const APInt &LEnd = cast<ConstantInt>(I->High)->getValue();
2402 const APInt &RBegin = cast<ConstantInt>(J->Low)->getValue();
2403 APInt Range = ComputeRange(LEnd, RBegin);
2404 assert((Range - 2ULL).isNonNegative() &&
2405 "Invalid case distance");
2406 // Use volatile double here to avoid excess precision issues on some hosts,
2407 // e.g. that use 80-bit X87 registers.
2408 volatile double LDensity =
2409 (double)LSize.roundToDouble() /
2410 (LEnd - First + 1ULL).roundToDouble();
2411 volatile double RDensity =
2412 (double)RSize.roundToDouble() /
2413 (Last - RBegin + 1ULL).roundToDouble();
2414 volatile double Metric = Range.logBase2()*(LDensity+RDensity);
2415 // Should always split in some non-trivial place
2416 DEBUG(dbgs() <<"=>Step\n"
2417 << "LEnd: " << LEnd << ", RBegin: " << RBegin << '\n'
2418 << "LDensity: " << LDensity
2419 << ", RDensity: " << RDensity << '\n'
2420 << "Metric: " << Metric << '\n');
2421 if (FMetric < Metric) {
2424 DEBUG(dbgs() << "Current metric set to: " << FMetric << '\n');
2431 const TargetLowering *TLI = TM.getTargetLowering();
2432 if (areJTsAllowed(*TLI)) {
2433 // If our case is dense we *really* should handle it earlier!
2434 assert((FMetric > 0) && "Should handle dense range earlier!");
2436 Pivot = CR.Range.first + Size/2;
2439 CaseRange LHSR(CR.Range.first, Pivot);
2440 CaseRange RHSR(Pivot, CR.Range.second);
2441 const Constant *C = Pivot->Low;
2442 MachineBasicBlock *FalseBB = 0, *TrueBB = 0;
2444 // We know that we branch to the LHS if the Value being switched on is
2445 // less than the Pivot value, C. We use this to optimize our binary
2446 // tree a bit, by recognizing that if SV is greater than or equal to the
2447 // LHS's Case Value, and that Case Value is exactly one less than the
2448 // Pivot's Value, then we can branch directly to the LHS's Target,
2449 // rather than creating a leaf node for it.
2450 if ((LHSR.second - LHSR.first) == 1 &&
2451 LHSR.first->High == CR.GE &&
2452 cast<ConstantInt>(C)->getValue() ==
2453 (cast<ConstantInt>(CR.GE)->getValue() + 1LL)) {
2454 TrueBB = LHSR.first->BB;
2456 TrueBB = CurMF->CreateMachineBasicBlock(LLVMBB);
2457 CurMF->insert(BBI, TrueBB);
2458 WorkList.push_back(CaseRec(TrueBB, C, CR.GE, LHSR));
2460 // Put SV in a virtual register to make it available from the new blocks.
2461 ExportFromCurrentBlock(SV);
2464 // Similar to the optimization above, if the Value being switched on is
2465 // known to be less than the Constant CR.LT, and the current Case Value
2466 // is CR.LT - 1, then we can branch directly to the target block for
2467 // the current Case Value, rather than emitting a RHS leaf node for it.
2468 if ((RHSR.second - RHSR.first) == 1 && CR.LT &&
2469 cast<ConstantInt>(RHSR.first->Low)->getValue() ==
2470 (cast<ConstantInt>(CR.LT)->getValue() - 1LL)) {
2471 FalseBB = RHSR.first->BB;
2473 FalseBB = CurMF->CreateMachineBasicBlock(LLVMBB);
2474 CurMF->insert(BBI, FalseBB);
2475 WorkList.push_back(CaseRec(FalseBB,CR.LT,C,RHSR));
2477 // Put SV in a virtual register to make it available from the new blocks.
2478 ExportFromCurrentBlock(SV);
2481 // Create a CaseBlock record representing a conditional branch to
2482 // the LHS node if the value being switched on SV is less than C.
2483 // Otherwise, branch to LHS.
2484 CaseBlock CB(ISD::SETLT, SV, C, NULL, TrueBB, FalseBB, CR.CaseBB);
2486 if (CR.CaseBB == SwitchBB)
2487 visitSwitchCase(CB, SwitchBB);
2489 SwitchCases.push_back(CB);
2494 /// handleBitTestsSwitchCase - if current case range has few destination and
2495 /// range span less, than machine word bitwidth, encode case range into series
2496 /// of masks and emit bit tests with these masks.
2497 bool SelectionDAGBuilder::handleBitTestsSwitchCase(CaseRec& CR,
2498 CaseRecVector& WorkList,
2500 MachineBasicBlock* Default,
2501 MachineBasicBlock* SwitchBB) {
2502 const TargetLowering *TLI = TM.getTargetLowering();
2503 EVT PTy = TLI->getPointerTy();
2504 unsigned IntPtrBits = PTy.getSizeInBits();
2506 Case& FrontCase = *CR.Range.first;
2507 Case& BackCase = *(CR.Range.second-1);
2509 // Get the MachineFunction which holds the current MBB. This is used when
2510 // inserting any additional MBBs necessary to represent the switch.
2511 MachineFunction *CurMF = FuncInfo.MF;
2513 // If target does not have legal shift left, do not emit bit tests at all.
2514 if (!TLI->isOperationLegal(ISD::SHL, PTy))
2518 for (CaseItr I = CR.Range.first, E = CR.Range.second;
2520 // Single case counts one, case range - two.
2521 numCmps += (I->Low == I->High ? 1 : 2);
2524 // Count unique destinations
2525 SmallSet<MachineBasicBlock*, 4> Dests;
2526 for (CaseItr I = CR.Range.first, E = CR.Range.second; I!=E; ++I) {
2527 Dests.insert(I->BB);
2528 if (Dests.size() > 3)
2529 // Don't bother the code below, if there are too much unique destinations
2532 DEBUG(dbgs() << "Total number of unique destinations: "
2533 << Dests.size() << '\n'
2534 << "Total number of comparisons: " << numCmps << '\n');
2536 // Compute span of values.
2537 const APInt& minValue = cast<ConstantInt>(FrontCase.Low)->getValue();
2538 const APInt& maxValue = cast<ConstantInt>(BackCase.High)->getValue();
2539 APInt cmpRange = maxValue - minValue;
2541 DEBUG(dbgs() << "Compare range: " << cmpRange << '\n'
2542 << "Low bound: " << minValue << '\n'
2543 << "High bound: " << maxValue << '\n');
2545 if (cmpRange.uge(IntPtrBits) ||
2546 (!(Dests.size() == 1 && numCmps >= 3) &&
2547 !(Dests.size() == 2 && numCmps >= 5) &&
2548 !(Dests.size() >= 3 && numCmps >= 6)))
2551 DEBUG(dbgs() << "Emitting bit tests\n");
2552 APInt lowBound = APInt::getNullValue(cmpRange.getBitWidth());
2554 // Optimize the case where all the case values fit in a
2555 // word without having to subtract minValue. In this case,
2556 // we can optimize away the subtraction.
2557 if (minValue.isNonNegative() && maxValue.slt(IntPtrBits)) {
2558 cmpRange = maxValue;
2560 lowBound = minValue;
2563 CaseBitsVector CasesBits;
2564 unsigned i, count = 0;
2566 for (CaseItr I = CR.Range.first, E = CR.Range.second; I!=E; ++I) {
2567 MachineBasicBlock* Dest = I->BB;
2568 for (i = 0; i < count; ++i)
2569 if (Dest == CasesBits[i].BB)
2573 assert((count < 3) && "Too much destinations to test!");
2574 CasesBits.push_back(CaseBits(0, Dest, 0, 0/*Weight*/));
2578 const APInt& lowValue = cast<ConstantInt>(I->Low)->getValue();
2579 const APInt& highValue = cast<ConstantInt>(I->High)->getValue();
2581 uint64_t lo = (lowValue - lowBound).getZExtValue();
2582 uint64_t hi = (highValue - lowBound).getZExtValue();
2583 CasesBits[i].ExtraWeight += I->ExtraWeight;
2585 for (uint64_t j = lo; j <= hi; j++) {
2586 CasesBits[i].Mask |= 1ULL << j;
2587 CasesBits[i].Bits++;
2591 std::sort(CasesBits.begin(), CasesBits.end(), CaseBitsCmp());
2595 // Figure out which block is immediately after the current one.
2596 MachineFunction::iterator BBI = CR.CaseBB;
2599 const BasicBlock *LLVMBB = CR.CaseBB->getBasicBlock();
2601 DEBUG(dbgs() << "Cases:\n");
2602 for (unsigned i = 0, e = CasesBits.size(); i!=e; ++i) {
2603 DEBUG(dbgs() << "Mask: " << CasesBits[i].Mask
2604 << ", Bits: " << CasesBits[i].Bits
2605 << ", BB: " << CasesBits[i].BB << '\n');
2607 MachineBasicBlock *CaseBB = CurMF->CreateMachineBasicBlock(LLVMBB);
2608 CurMF->insert(BBI, CaseBB);
2609 BTC.push_back(BitTestCase(CasesBits[i].Mask,
2611 CasesBits[i].BB, CasesBits[i].ExtraWeight));
2613 // Put SV in a virtual register to make it available from the new blocks.
2614 ExportFromCurrentBlock(SV);
2617 BitTestBlock BTB(lowBound, cmpRange, SV,
2618 -1U, MVT::Other, (CR.CaseBB == SwitchBB),
2619 CR.CaseBB, Default, BTC);
2621 if (CR.CaseBB == SwitchBB)
2622 visitBitTestHeader(BTB, SwitchBB);
2624 BitTestCases.push_back(BTB);
2629 /// Clusterify - Transform simple list of Cases into list of CaseRange's
2630 size_t SelectionDAGBuilder::Clusterify(CaseVector& Cases,
2631 const SwitchInst& SI) {
2634 BranchProbabilityInfo *BPI = FuncInfo.BPI;
2635 // Start with "simple" cases
2636 for (SwitchInst::ConstCaseIt i = SI.case_begin(), e = SI.case_end();
2638 const BasicBlock *SuccBB = i.getCaseSuccessor();
2639 MachineBasicBlock *SMBB = FuncInfo.MBBMap[SuccBB];
2641 uint32_t ExtraWeight =
2642 BPI ? BPI->getEdgeWeight(SI.getParent(), i.getSuccessorIndex()) : 0;
2644 Cases.push_back(Case(i.getCaseValue(), i.getCaseValue(),
2645 SMBB, ExtraWeight));
2647 std::sort(Cases.begin(), Cases.end(), CaseCmp());
2649 // Merge case into clusters
2650 if (Cases.size() >= 2)
2651 // Must recompute end() each iteration because it may be
2652 // invalidated by erase if we hold on to it
2653 for (CaseItr I = Cases.begin(), J = std::next(Cases.begin());
2654 J != Cases.end(); ) {
2655 const APInt& nextValue = cast<ConstantInt>(J->Low)->getValue();
2656 const APInt& currentValue = cast<ConstantInt>(I->High)->getValue();
2657 MachineBasicBlock* nextBB = J->BB;
2658 MachineBasicBlock* currentBB = I->BB;
2660 // If the two neighboring cases go to the same destination, merge them
2661 // into a single case.
2662 if ((nextValue - currentValue == 1) && (currentBB == nextBB)) {
2664 I->ExtraWeight += J->ExtraWeight;
2671 for (CaseItr I=Cases.begin(), E=Cases.end(); I!=E; ++I, ++numCmps) {
2672 if (I->Low != I->High)
2673 // A range counts double, since it requires two compares.
2680 void SelectionDAGBuilder::UpdateSplitBlock(MachineBasicBlock *First,
2681 MachineBasicBlock *Last) {
2683 for (unsigned i = 0, e = JTCases.size(); i != e; ++i)
2684 if (JTCases[i].first.HeaderBB == First)
2685 JTCases[i].first.HeaderBB = Last;
2687 // Update BitTestCases.
2688 for (unsigned i = 0, e = BitTestCases.size(); i != e; ++i)
2689 if (BitTestCases[i].Parent == First)
2690 BitTestCases[i].Parent = Last;
2693 void SelectionDAGBuilder::visitSwitch(const SwitchInst &SI) {
2694 MachineBasicBlock *SwitchMBB = FuncInfo.MBB;
2696 // Figure out which block is immediately after the current one.
2697 MachineBasicBlock *NextBlock = 0;
2698 MachineBasicBlock *Default = FuncInfo.MBBMap[SI.getDefaultDest()];
2700 // If there is only the default destination, branch to it if it is not the
2701 // next basic block. Otherwise, just fall through.
2702 if (!SI.getNumCases()) {
2703 // Update machine-CFG edges.
2705 // If this is not a fall-through branch, emit the branch.
2706 SwitchMBB->addSuccessor(Default);
2707 if (Default != NextBlock)
2708 DAG.setRoot(DAG.getNode(ISD::BR, getCurSDLoc(),
2709 MVT::Other, getControlRoot(),
2710 DAG.getBasicBlock(Default)));
2715 // If there are any non-default case statements, create a vector of Cases
2716 // representing each one, and sort the vector so that we can efficiently
2717 // create a binary search tree from them.
2719 size_t numCmps = Clusterify(Cases, SI);
2720 DEBUG(dbgs() << "Clusterify finished. Total clusters: " << Cases.size()
2721 << ". Total compares: " << numCmps << '\n');
2724 // Get the Value to be switched on and default basic blocks, which will be
2725 // inserted into CaseBlock records, representing basic blocks in the binary
2727 const Value *SV = SI.getCondition();
2729 // Push the initial CaseRec onto the worklist
2730 CaseRecVector WorkList;
2731 WorkList.push_back(CaseRec(SwitchMBB,0,0,
2732 CaseRange(Cases.begin(),Cases.end())));
2734 while (!WorkList.empty()) {
2735 // Grab a record representing a case range to process off the worklist
2736 CaseRec CR = WorkList.back();
2737 WorkList.pop_back();
2739 if (handleBitTestsSwitchCase(CR, WorkList, SV, Default, SwitchMBB))
2742 // If the range has few cases (two or less) emit a series of specific
2744 if (handleSmallSwitchRange(CR, WorkList, SV, Default, SwitchMBB))
2747 // If the switch has more than N blocks, and is at least 40% dense, and the
2748 // target supports indirect branches, then emit a jump table rather than
2749 // lowering the switch to a binary tree of conditional branches.
2750 // N defaults to 4 and is controlled via TLS.getMinimumJumpTableEntries().
2751 if (handleJTSwitchCase(CR, WorkList, SV, Default, SwitchMBB))
2754 // Emit binary tree. We need to pick a pivot, and push left and right ranges
2755 // onto the worklist. Leafs are handled via handleSmallSwitchRange() call.
2756 handleBTSplitSwitchCase(CR, WorkList, SV, Default, SwitchMBB);
2760 void SelectionDAGBuilder::visitIndirectBr(const IndirectBrInst &I) {
2761 MachineBasicBlock *IndirectBrMBB = FuncInfo.MBB;
2763 // Update machine-CFG edges with unique successors.
2764 SmallSet<BasicBlock*, 32> Done;
2765 for (unsigned i = 0, e = I.getNumSuccessors(); i != e; ++i) {
2766 BasicBlock *BB = I.getSuccessor(i);
2767 bool Inserted = Done.insert(BB);
2771 MachineBasicBlock *Succ = FuncInfo.MBBMap[BB];
2772 addSuccessorWithWeight(IndirectBrMBB, Succ);
2775 DAG.setRoot(DAG.getNode(ISD::BRIND, getCurSDLoc(),
2776 MVT::Other, getControlRoot(),
2777 getValue(I.getAddress())));
2780 void SelectionDAGBuilder::visitFSub(const User &I) {
2781 // -0.0 - X --> fneg
2782 Type *Ty = I.getType();
2783 if (isa<Constant>(I.getOperand(0)) &&
2784 I.getOperand(0) == ConstantFP::getZeroValueForNegation(Ty)) {
2785 SDValue Op2 = getValue(I.getOperand(1));
2786 setValue(&I, DAG.getNode(ISD::FNEG, getCurSDLoc(),
2787 Op2.getValueType(), Op2));
2791 visitBinary(I, ISD::FSUB);
2794 void SelectionDAGBuilder::visitBinary(const User &I, unsigned OpCode) {
2795 SDValue Op1 = getValue(I.getOperand(0));
2796 SDValue Op2 = getValue(I.getOperand(1));
2797 setValue(&I, DAG.getNode(OpCode, getCurSDLoc(),
2798 Op1.getValueType(), Op1, Op2));
2801 void SelectionDAGBuilder::visitShift(const User &I, unsigned Opcode) {
2802 SDValue Op1 = getValue(I.getOperand(0));
2803 SDValue Op2 = getValue(I.getOperand(1));
2805 EVT ShiftTy = TM.getTargetLowering()->getShiftAmountTy(Op2.getValueType());
2807 // Coerce the shift amount to the right type if we can.
2808 if (!I.getType()->isVectorTy() && Op2.getValueType() != ShiftTy) {
2809 unsigned ShiftSize = ShiftTy.getSizeInBits();
2810 unsigned Op2Size = Op2.getValueType().getSizeInBits();
2811 SDLoc DL = getCurSDLoc();
2813 // If the operand is smaller than the shift count type, promote it.
2814 if (ShiftSize > Op2Size)
2815 Op2 = DAG.getNode(ISD::ZERO_EXTEND, DL, ShiftTy, Op2);
2817 // If the operand is larger than the shift count type but the shift
2818 // count type has enough bits to represent any shift value, truncate
2819 // it now. This is a common case and it exposes the truncate to
2820 // optimization early.
2821 else if (ShiftSize >= Log2_32_Ceil(Op2.getValueType().getSizeInBits()))
2822 Op2 = DAG.getNode(ISD::TRUNCATE, DL, ShiftTy, Op2);
2823 // Otherwise we'll need to temporarily settle for some other convenient
2824 // type. Type legalization will make adjustments once the shiftee is split.
2826 Op2 = DAG.getZExtOrTrunc(Op2, DL, MVT::i32);
2829 setValue(&I, DAG.getNode(Opcode, getCurSDLoc(),
2830 Op1.getValueType(), Op1, Op2));
2833 void SelectionDAGBuilder::visitSDiv(const User &I) {
2834 SDValue Op1 = getValue(I.getOperand(0));
2835 SDValue Op2 = getValue(I.getOperand(1));
2837 // Turn exact SDivs into multiplications.
2838 // FIXME: This should be in DAGCombiner, but it doesn't have access to the
2840 if (isa<BinaryOperator>(&I) && cast<BinaryOperator>(&I)->isExact() &&
2841 !isa<ConstantSDNode>(Op1) &&
2842 isa<ConstantSDNode>(Op2) && !cast<ConstantSDNode>(Op2)->isNullValue())
2843 setValue(&I, TM.getTargetLowering()->BuildExactSDIV(Op1, Op2,
2844 getCurSDLoc(), DAG));
2846 setValue(&I, DAG.getNode(ISD::SDIV, getCurSDLoc(), Op1.getValueType(),
2850 void SelectionDAGBuilder::visitICmp(const User &I) {
2851 ICmpInst::Predicate predicate = ICmpInst::BAD_ICMP_PREDICATE;
2852 if (const ICmpInst *IC = dyn_cast<ICmpInst>(&I))
2853 predicate = IC->getPredicate();
2854 else if (const ConstantExpr *IC = dyn_cast<ConstantExpr>(&I))
2855 predicate = ICmpInst::Predicate(IC->getPredicate());
2856 SDValue Op1 = getValue(I.getOperand(0));
2857 SDValue Op2 = getValue(I.getOperand(1));
2858 ISD::CondCode Opcode = getICmpCondCode(predicate);
2860 EVT DestVT = TM.getTargetLowering()->getValueType(I.getType());
2861 setValue(&I, DAG.getSetCC(getCurSDLoc(), DestVT, Op1, Op2, Opcode));
2864 void SelectionDAGBuilder::visitFCmp(const User &I) {
2865 FCmpInst::Predicate predicate = FCmpInst::BAD_FCMP_PREDICATE;
2866 if (const FCmpInst *FC = dyn_cast<FCmpInst>(&I))
2867 predicate = FC->getPredicate();
2868 else if (const ConstantExpr *FC = dyn_cast<ConstantExpr>(&I))
2869 predicate = FCmpInst::Predicate(FC->getPredicate());
2870 SDValue Op1 = getValue(I.getOperand(0));
2871 SDValue Op2 = getValue(I.getOperand(1));
2872 ISD::CondCode Condition = getFCmpCondCode(predicate);
2873 if (TM.Options.NoNaNsFPMath)
2874 Condition = getFCmpCodeWithoutNaN(Condition);
2875 EVT DestVT = TM.getTargetLowering()->getValueType(I.getType());
2876 setValue(&I, DAG.getSetCC(getCurSDLoc(), DestVT, Op1, Op2, Condition));
2879 void SelectionDAGBuilder::visitSelect(const User &I) {
2880 SmallVector<EVT, 4> ValueVTs;
2881 ComputeValueVTs(*TM.getTargetLowering(), I.getType(), ValueVTs);
2882 unsigned NumValues = ValueVTs.size();
2883 if (NumValues == 0) return;
2885 SmallVector<SDValue, 4> Values(NumValues);
2886 SDValue Cond = getValue(I.getOperand(0));
2887 SDValue TrueVal = getValue(I.getOperand(1));
2888 SDValue FalseVal = getValue(I.getOperand(2));
2889 ISD::NodeType OpCode = Cond.getValueType().isVector() ?
2890 ISD::VSELECT : ISD::SELECT;
2892 for (unsigned i = 0; i != NumValues; ++i)
2893 Values[i] = DAG.getNode(OpCode, getCurSDLoc(),
2894 TrueVal.getNode()->getValueType(TrueVal.getResNo()+i),
2896 SDValue(TrueVal.getNode(),
2897 TrueVal.getResNo() + i),
2898 SDValue(FalseVal.getNode(),
2899 FalseVal.getResNo() + i));
2901 setValue(&I, DAG.getNode(ISD::MERGE_VALUES, getCurSDLoc(),
2902 DAG.getVTList(&ValueVTs[0], NumValues),
2903 &Values[0], NumValues));
2906 void SelectionDAGBuilder::visitTrunc(const User &I) {
2907 // TruncInst cannot be a no-op cast because sizeof(src) > sizeof(dest).
2908 SDValue N = getValue(I.getOperand(0));
2909 EVT DestVT = TM.getTargetLowering()->getValueType(I.getType());
2910 setValue(&I, DAG.getNode(ISD::TRUNCATE, getCurSDLoc(), DestVT, N));
2913 void SelectionDAGBuilder::visitZExt(const User &I) {
2914 // ZExt cannot be a no-op cast because sizeof(src) < sizeof(dest).
2915 // ZExt also can't be a cast to bool for same reason. So, nothing much to do
2916 SDValue N = getValue(I.getOperand(0));
2917 EVT DestVT = TM.getTargetLowering()->getValueType(I.getType());
2918 setValue(&I, DAG.getNode(ISD::ZERO_EXTEND, getCurSDLoc(), DestVT, N));
2921 void SelectionDAGBuilder::visitSExt(const User &I) {
2922 // SExt cannot be a no-op cast because sizeof(src) < sizeof(dest).
2923 // SExt also can't be a cast to bool for same reason. So, nothing much to do
2924 SDValue N = getValue(I.getOperand(0));
2925 EVT DestVT = TM.getTargetLowering()->getValueType(I.getType());
2926 setValue(&I, DAG.getNode(ISD::SIGN_EXTEND, getCurSDLoc(), DestVT, N));
2929 void SelectionDAGBuilder::visitFPTrunc(const User &I) {
2930 // FPTrunc is never a no-op cast, no need to check
2931 SDValue N = getValue(I.getOperand(0));
2932 const TargetLowering *TLI = TM.getTargetLowering();
2933 EVT DestVT = TLI->getValueType(I.getType());
2934 setValue(&I, DAG.getNode(ISD::FP_ROUND, getCurSDLoc(),
2936 DAG.getTargetConstant(0, TLI->getPointerTy())));
2939 void SelectionDAGBuilder::visitFPExt(const User &I) {
2940 // FPExt is never a no-op cast, no need to check
2941 SDValue N = getValue(I.getOperand(0));
2942 EVT DestVT = TM.getTargetLowering()->getValueType(I.getType());
2943 setValue(&I, DAG.getNode(ISD::FP_EXTEND, getCurSDLoc(), DestVT, N));
2946 void SelectionDAGBuilder::visitFPToUI(const User &I) {
2947 // FPToUI is never a no-op cast, no need to check
2948 SDValue N = getValue(I.getOperand(0));
2949 EVT DestVT = TM.getTargetLowering()->getValueType(I.getType());
2950 setValue(&I, DAG.getNode(ISD::FP_TO_UINT, getCurSDLoc(), DestVT, N));
2953 void SelectionDAGBuilder::visitFPToSI(const User &I) {
2954 // FPToSI is never a no-op cast, no need to check
2955 SDValue N = getValue(I.getOperand(0));
2956 EVT DestVT = TM.getTargetLowering()->getValueType(I.getType());
2957 setValue(&I, DAG.getNode(ISD::FP_TO_SINT, getCurSDLoc(), DestVT, N));
2960 void SelectionDAGBuilder::visitUIToFP(const User &I) {
2961 // UIToFP is never a no-op cast, no need to check
2962 SDValue N = getValue(I.getOperand(0));
2963 EVT DestVT = TM.getTargetLowering()->getValueType(I.getType());
2964 setValue(&I, DAG.getNode(ISD::UINT_TO_FP, getCurSDLoc(), DestVT, N));
2967 void SelectionDAGBuilder::visitSIToFP(const User &I) {
2968 // SIToFP is never a no-op cast, no need to check
2969 SDValue N = getValue(I.getOperand(0));
2970 EVT DestVT = TM.getTargetLowering()->getValueType(I.getType());
2971 setValue(&I, DAG.getNode(ISD::SINT_TO_FP, getCurSDLoc(), DestVT, N));
2974 void SelectionDAGBuilder::visitPtrToInt(const User &I) {
2975 // What to do depends on the size of the integer and the size of the pointer.
2976 // We can either truncate, zero extend, or no-op, accordingly.
2977 SDValue N = getValue(I.getOperand(0));
2978 EVT DestVT = TM.getTargetLowering()->getValueType(I.getType());
2979 setValue(&I, DAG.getZExtOrTrunc(N, getCurSDLoc(), DestVT));
2982 void SelectionDAGBuilder::visitIntToPtr(const User &I) {
2983 // What to do depends on the size of the integer and the size of the pointer.
2984 // We can either truncate, zero extend, or no-op, accordingly.
2985 SDValue N = getValue(I.getOperand(0));
2986 EVT DestVT = TM.getTargetLowering()->getValueType(I.getType());
2987 setValue(&I, DAG.getZExtOrTrunc(N, getCurSDLoc(), DestVT));
2990 void SelectionDAGBuilder::visitBitCast(const User &I) {
2991 SDValue N = getValue(I.getOperand(0));
2992 EVT DestVT = TM.getTargetLowering()->getValueType(I.getType());
2994 // BitCast assures us that source and destination are the same size so this is
2995 // either a BITCAST or a no-op.
2996 if (DestVT != N.getValueType())
2997 setValue(&I, DAG.getNode(ISD::BITCAST, getCurSDLoc(),
2998 DestVT, N)); // convert types.
2999 // Check if the original LLVM IR Operand was a ConstantInt, because getValue()
3000 // might fold any kind of constant expression to an integer constant and that
3001 // is not what we are looking for. Only regcognize a bitcast of a genuine
3002 // constant integer as an opaque constant.
3003 else if(ConstantInt *C = dyn_cast<ConstantInt>(I.getOperand(0)))
3004 setValue(&I, DAG.getConstant(C->getValue(), DestVT, /*isTarget=*/false,
3007 setValue(&I, N); // noop cast.
3010 void SelectionDAGBuilder::visitAddrSpaceCast(const User &I) {
3011 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
3012 const Value *SV = I.getOperand(0);
3013 SDValue N = getValue(SV);
3014 EVT DestVT = TM.getTargetLowering()->getValueType(I.getType());
3016 unsigned SrcAS = SV->getType()->getPointerAddressSpace();
3017 unsigned DestAS = I.getType()->getPointerAddressSpace();
3019 if (!TLI.isNoopAddrSpaceCast(SrcAS, DestAS))
3020 N = DAG.getAddrSpaceCast(getCurSDLoc(), DestVT, N, SrcAS, DestAS);
3025 void SelectionDAGBuilder::visitInsertElement(const User &I) {
3026 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
3027 SDValue InVec = getValue(I.getOperand(0));
3028 SDValue InVal = getValue(I.getOperand(1));
3029 SDValue InIdx = DAG.getSExtOrTrunc(getValue(I.getOperand(2)),
3030 getCurSDLoc(), TLI.getVectorIdxTy());
3031 setValue(&I, DAG.getNode(ISD::INSERT_VECTOR_ELT, getCurSDLoc(),
3032 TM.getTargetLowering()->getValueType(I.getType()),
3033 InVec, InVal, InIdx));
3036 void SelectionDAGBuilder::visitExtractElement(const User &I) {
3037 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
3038 SDValue InVec = getValue(I.getOperand(0));
3039 SDValue InIdx = DAG.getSExtOrTrunc(getValue(I.getOperand(1)),
3040 getCurSDLoc(), TLI.getVectorIdxTy());
3041 setValue(&I, DAG.getNode(ISD::EXTRACT_VECTOR_ELT, getCurSDLoc(),
3042 TM.getTargetLowering()->getValueType(I.getType()),
3046 // Utility for visitShuffleVector - Return true if every element in Mask,
3047 // beginning from position Pos and ending in Pos+Size, falls within the
3048 // specified sequential range [L, L+Pos). or is undef.
3049 static bool isSequentialInRange(const SmallVectorImpl<int> &Mask,
3050 unsigned Pos, unsigned Size, int Low) {
3051 for (unsigned i = Pos, e = Pos+Size; i != e; ++i, ++Low)
3052 if (Mask[i] >= 0 && Mask[i] != Low)
3057 void SelectionDAGBuilder::visitShuffleVector(const User &I) {
3058 SDValue Src1 = getValue(I.getOperand(0));
3059 SDValue Src2 = getValue(I.getOperand(1));
3061 SmallVector<int, 8> Mask;
3062 ShuffleVectorInst::getShuffleMask(cast<Constant>(I.getOperand(2)), Mask);
3063 unsigned MaskNumElts = Mask.size();
3065 const TargetLowering *TLI = TM.getTargetLowering();
3066 EVT VT = TLI->getValueType(I.getType());
3067 EVT SrcVT = Src1.getValueType();
3068 unsigned SrcNumElts = SrcVT.getVectorNumElements();
3070 if (SrcNumElts == MaskNumElts) {
3071 setValue(&I, DAG.getVectorShuffle(VT, getCurSDLoc(), Src1, Src2,
3076 // Normalize the shuffle vector since mask and vector length don't match.
3077 if (SrcNumElts < MaskNumElts && MaskNumElts % SrcNumElts == 0) {
3078 // Mask is longer than the source vectors and is a multiple of the source
3079 // vectors. We can use concatenate vector to make the mask and vectors
3081 if (SrcNumElts*2 == MaskNumElts) {
3082 // First check for Src1 in low and Src2 in high
3083 if (isSequentialInRange(Mask, 0, SrcNumElts, 0) &&
3084 isSequentialInRange(Mask, SrcNumElts, SrcNumElts, SrcNumElts)) {
3085 // The shuffle is concatenating two vectors together.
3086 setValue(&I, DAG.getNode(ISD::CONCAT_VECTORS, getCurSDLoc(),
3090 // Then check for Src2 in low and Src1 in high
3091 if (isSequentialInRange(Mask, 0, SrcNumElts, SrcNumElts) &&
3092 isSequentialInRange(Mask, SrcNumElts, SrcNumElts, 0)) {
3093 // The shuffle is concatenating two vectors together.
3094 setValue(&I, DAG.getNode(ISD::CONCAT_VECTORS, getCurSDLoc(),
3100 // Pad both vectors with undefs to make them the same length as the mask.
3101 unsigned NumConcat = MaskNumElts / SrcNumElts;
3102 bool Src1U = Src1.getOpcode() == ISD::UNDEF;
3103 bool Src2U = Src2.getOpcode() == ISD::UNDEF;
3104 SDValue UndefVal = DAG.getUNDEF(SrcVT);
3106 SmallVector<SDValue, 8> MOps1(NumConcat, UndefVal);
3107 SmallVector<SDValue, 8> MOps2(NumConcat, UndefVal);
3111 Src1 = Src1U ? DAG.getUNDEF(VT) : DAG.getNode(ISD::CONCAT_VECTORS,
3113 &MOps1[0], NumConcat);
3114 Src2 = Src2U ? DAG.getUNDEF(VT) : DAG.getNode(ISD::CONCAT_VECTORS,
3116 &MOps2[0], NumConcat);
3118 // Readjust mask for new input vector length.
3119 SmallVector<int, 8> MappedOps;
3120 for (unsigned i = 0; i != MaskNumElts; ++i) {
3122 if (Idx >= (int)SrcNumElts)
3123 Idx -= SrcNumElts - MaskNumElts;
3124 MappedOps.push_back(Idx);
3127 setValue(&I, DAG.getVectorShuffle(VT, getCurSDLoc(), Src1, Src2,
3132 if (SrcNumElts > MaskNumElts) {
3133 // Analyze the access pattern of the vector to see if we can extract
3134 // two subvectors and do the shuffle. The analysis is done by calculating
3135 // the range of elements the mask access on both vectors.
3136 int MinRange[2] = { static_cast<int>(SrcNumElts),
3137 static_cast<int>(SrcNumElts)};
3138 int MaxRange[2] = {-1, -1};
3140 for (unsigned i = 0; i != MaskNumElts; ++i) {
3146 if (Idx >= (int)SrcNumElts) {
3150 if (Idx > MaxRange[Input])
3151 MaxRange[Input] = Idx;
3152 if (Idx < MinRange[Input])
3153 MinRange[Input] = Idx;
3156 // Check if the access is smaller than the vector size and can we find
3157 // a reasonable extract index.
3158 int RangeUse[2] = { -1, -1 }; // 0 = Unused, 1 = Extract, -1 = Can not
3160 int StartIdx[2]; // StartIdx to extract from
3161 for (unsigned Input = 0; Input < 2; ++Input) {
3162 if (MinRange[Input] >= (int)SrcNumElts && MaxRange[Input] < 0) {
3163 RangeUse[Input] = 0; // Unused
3164 StartIdx[Input] = 0;
3168 // Find a good start index that is a multiple of the mask length. Then
3169 // see if the rest of the elements are in range.
3170 StartIdx[Input] = (MinRange[Input]/MaskNumElts)*MaskNumElts;
3171 if (MaxRange[Input] - StartIdx[Input] < (int)MaskNumElts &&
3172 StartIdx[Input] + MaskNumElts <= SrcNumElts)
3173 RangeUse[Input] = 1; // Extract from a multiple of the mask length.
3176 if (RangeUse[0] == 0 && RangeUse[1] == 0) {
3177 setValue(&I, DAG.getUNDEF(VT)); // Vectors are not used.
3180 if (RangeUse[0] >= 0 && RangeUse[1] >= 0) {
3181 // Extract appropriate subvector and generate a vector shuffle
3182 for (unsigned Input = 0; Input < 2; ++Input) {
3183 SDValue &Src = Input == 0 ? Src1 : Src2;
3184 if (RangeUse[Input] == 0)
3185 Src = DAG.getUNDEF(VT);
3187 Src = DAG.getNode(ISD::EXTRACT_SUBVECTOR, getCurSDLoc(), VT,
3188 Src, DAG.getConstant(StartIdx[Input],
3189 TLI->getVectorIdxTy()));
3192 // Calculate new mask.
3193 SmallVector<int, 8> MappedOps;
3194 for (unsigned i = 0; i != MaskNumElts; ++i) {
3197 if (Idx < (int)SrcNumElts)
3200 Idx -= SrcNumElts + StartIdx[1] - MaskNumElts;
3202 MappedOps.push_back(Idx);
3205 setValue(&I, DAG.getVectorShuffle(VT, getCurSDLoc(), Src1, Src2,
3211 // We can't use either concat vectors or extract subvectors so fall back to
3212 // replacing the shuffle with extract and build vector.
3213 // to insert and build vector.
3214 EVT EltVT = VT.getVectorElementType();
3215 EVT IdxVT = TLI->getVectorIdxTy();
3216 SmallVector<SDValue,8> Ops;
3217 for (unsigned i = 0; i != MaskNumElts; ++i) {
3222 Res = DAG.getUNDEF(EltVT);
3224 SDValue &Src = Idx < (int)SrcNumElts ? Src1 : Src2;
3225 if (Idx >= (int)SrcNumElts) Idx -= SrcNumElts;
3227 Res = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, getCurSDLoc(),
3228 EltVT, Src, DAG.getConstant(Idx, IdxVT));
3234 setValue(&I, DAG.getNode(ISD::BUILD_VECTOR, getCurSDLoc(),
3235 VT, &Ops[0], Ops.size()));
3238 void SelectionDAGBuilder::visitInsertValue(const InsertValueInst &I) {
3239 const Value *Op0 = I.getOperand(0);
3240 const Value *Op1 = I.getOperand(1);
3241 Type *AggTy = I.getType();
3242 Type *ValTy = Op1->getType();
3243 bool IntoUndef = isa<UndefValue>(Op0);
3244 bool FromUndef = isa<UndefValue>(Op1);
3246 unsigned LinearIndex = ComputeLinearIndex(AggTy, I.getIndices());
3248 const TargetLowering *TLI = TM.getTargetLowering();
3249 SmallVector<EVT, 4> AggValueVTs;
3250 ComputeValueVTs(*TLI, AggTy, AggValueVTs);
3251 SmallVector<EVT, 4> ValValueVTs;
3252 ComputeValueVTs(*TLI, ValTy, ValValueVTs);
3254 unsigned NumAggValues = AggValueVTs.size();
3255 unsigned NumValValues = ValValueVTs.size();
3256 SmallVector<SDValue, 4> Values(NumAggValues);
3258 SDValue Agg = getValue(Op0);
3260 // Copy the beginning value(s) from the original aggregate.
3261 for (; i != LinearIndex; ++i)
3262 Values[i] = IntoUndef ? DAG.getUNDEF(AggValueVTs[i]) :
3263 SDValue(Agg.getNode(), Agg.getResNo() + i);
3264 // Copy values from the inserted value(s).
3266 SDValue Val = getValue(Op1);
3267 for (; i != LinearIndex + NumValValues; ++i)
3268 Values[i] = FromUndef ? DAG.getUNDEF(AggValueVTs[i]) :
3269 SDValue(Val.getNode(), Val.getResNo() + i - LinearIndex);
3271 // Copy remaining value(s) from the original aggregate.
3272 for (; i != NumAggValues; ++i)
3273 Values[i] = IntoUndef ? DAG.getUNDEF(AggValueVTs[i]) :
3274 SDValue(Agg.getNode(), Agg.getResNo() + i);
3276 setValue(&I, DAG.getNode(ISD::MERGE_VALUES, getCurSDLoc(),
3277 DAG.getVTList(&AggValueVTs[0], NumAggValues),
3278 &Values[0], NumAggValues));
3281 void SelectionDAGBuilder::visitExtractValue(const ExtractValueInst &I) {
3282 const Value *Op0 = I.getOperand(0);
3283 Type *AggTy = Op0->getType();
3284 Type *ValTy = I.getType();
3285 bool OutOfUndef = isa<UndefValue>(Op0);
3287 unsigned LinearIndex = ComputeLinearIndex(AggTy, I.getIndices());
3289 const TargetLowering *TLI = TM.getTargetLowering();
3290 SmallVector<EVT, 4> ValValueVTs;
3291 ComputeValueVTs(*TLI, ValTy, ValValueVTs);
3293 unsigned NumValValues = ValValueVTs.size();
3295 // Ignore a extractvalue that produces an empty object
3296 if (!NumValValues) {
3297 setValue(&I, DAG.getUNDEF(MVT(MVT::Other)));
3301 SmallVector<SDValue, 4> Values(NumValValues);
3303 SDValue Agg = getValue(Op0);
3304 // Copy out the selected value(s).
3305 for (unsigned i = LinearIndex; i != LinearIndex + NumValValues; ++i)
3306 Values[i - LinearIndex] =
3308 DAG.getUNDEF(Agg.getNode()->getValueType(Agg.getResNo() + i)) :
3309 SDValue(Agg.getNode(), Agg.getResNo() + i);
3311 setValue(&I, DAG.getNode(ISD::MERGE_VALUES, getCurSDLoc(),
3312 DAG.getVTList(&ValValueVTs[0], NumValValues),
3313 &Values[0], NumValValues));
3316 void SelectionDAGBuilder::visitGetElementPtr(const User &I) {
3317 Value *Op0 = I.getOperand(0);
3318 // Note that the pointer operand may be a vector of pointers. Take the scalar
3319 // element which holds a pointer.
3320 Type *Ty = Op0->getType()->getScalarType();
3321 unsigned AS = Ty->getPointerAddressSpace();
3322 SDValue N = getValue(Op0);
3324 for (GetElementPtrInst::const_op_iterator OI = I.op_begin()+1, E = I.op_end();
3326 const Value *Idx = *OI;
3327 if (StructType *StTy = dyn_cast<StructType>(Ty)) {
3328 unsigned Field = cast<Constant>(Idx)->getUniqueInteger().getZExtValue();
3331 uint64_t Offset = DL->getStructLayout(StTy)->getElementOffset(Field);
3332 N = DAG.getNode(ISD::ADD, getCurSDLoc(), N.getValueType(), N,
3333 DAG.getConstant(Offset, N.getValueType()));
3336 Ty = StTy->getElementType(Field);
3338 Ty = cast<SequentialType>(Ty)->getElementType();
3340 // If this is a constant subscript, handle it quickly.
3341 const TargetLowering *TLI = TM.getTargetLowering();
3342 if (const ConstantInt *CI = dyn_cast<ConstantInt>(Idx)) {
3343 if (CI->isZero()) continue;
3345 DL->getTypeAllocSize(Ty)*cast<ConstantInt>(CI)->getSExtValue();
3347 EVT PTy = TLI->getPointerTy(AS);
3348 unsigned PtrBits = PTy.getSizeInBits();
3350 OffsVal = DAG.getNode(ISD::TRUNCATE, getCurSDLoc(), PTy,
3351 DAG.getConstant(Offs, MVT::i64));
3353 OffsVal = DAG.getConstant(Offs, PTy);
3355 N = DAG.getNode(ISD::ADD, getCurSDLoc(), N.getValueType(), N,
3360 // N = N + Idx * ElementSize;
3361 APInt ElementSize = APInt(TLI->getPointerSizeInBits(AS),
3362 DL->getTypeAllocSize(Ty));
3363 SDValue IdxN = getValue(Idx);
3365 // If the index is smaller or larger than intptr_t, truncate or extend
3367 IdxN = DAG.getSExtOrTrunc(IdxN, getCurSDLoc(), N.getValueType());
3369 // If this is a multiply by a power of two, turn it into a shl
3370 // immediately. This is a very common case.
3371 if (ElementSize != 1) {
3372 if (ElementSize.isPowerOf2()) {
3373 unsigned Amt = ElementSize.logBase2();
3374 IdxN = DAG.getNode(ISD::SHL, getCurSDLoc(),
3375 N.getValueType(), IdxN,
3376 DAG.getConstant(Amt, IdxN.getValueType()));
3378 SDValue Scale = DAG.getConstant(ElementSize, IdxN.getValueType());
3379 IdxN = DAG.getNode(ISD::MUL, getCurSDLoc(),
3380 N.getValueType(), IdxN, Scale);
3384 N = DAG.getNode(ISD::ADD, getCurSDLoc(),
3385 N.getValueType(), N, IdxN);
3392 void SelectionDAGBuilder::visitAlloca(const AllocaInst &I) {
3393 // If this is a fixed sized alloca in the entry block of the function,
3394 // allocate it statically on the stack.
3395 if (FuncInfo.StaticAllocaMap.count(&I))
3396 return; // getValue will auto-populate this.
3398 Type *Ty = I.getAllocatedType();
3399 const TargetLowering *TLI = TM.getTargetLowering();
3400 uint64_t TySize = TLI->getDataLayout()->getTypeAllocSize(Ty);
3402 std::max((unsigned)TLI->getDataLayout()->getPrefTypeAlignment(Ty),
3405 SDValue AllocSize = getValue(I.getArraySize());
3407 EVT IntPtr = TLI->getPointerTy();
3408 if (AllocSize.getValueType() != IntPtr)
3409 AllocSize = DAG.getZExtOrTrunc(AllocSize, getCurSDLoc(), IntPtr);
3411 AllocSize = DAG.getNode(ISD::MUL, getCurSDLoc(), IntPtr,
3413 DAG.getConstant(TySize, IntPtr));
3415 // Handle alignment. If the requested alignment is less than or equal to
3416 // the stack alignment, ignore it. If the size is greater than or equal to
3417 // the stack alignment, we note this in the DYNAMIC_STACKALLOC node.
3418 unsigned StackAlign = TM.getFrameLowering()->getStackAlignment();
3419 if (Align <= StackAlign)
3422 // Round the size of the allocation up to the stack alignment size
3423 // by add SA-1 to the size.
3424 AllocSize = DAG.getNode(ISD::ADD, getCurSDLoc(),
3425 AllocSize.getValueType(), AllocSize,
3426 DAG.getIntPtrConstant(StackAlign-1));
3428 // Mask out the low bits for alignment purposes.
3429 AllocSize = DAG.getNode(ISD::AND, getCurSDLoc(),
3430 AllocSize.getValueType(), AllocSize,
3431 DAG.getIntPtrConstant(~(uint64_t)(StackAlign-1)));
3433 SDValue Ops[] = { getRoot(), AllocSize, DAG.getIntPtrConstant(Align) };
3434 SDVTList VTs = DAG.getVTList(AllocSize.getValueType(), MVT::Other);
3435 SDValue DSA = DAG.getNode(ISD::DYNAMIC_STACKALLOC, getCurSDLoc(),
3438 DAG.setRoot(DSA.getValue(1));
3440 assert(FuncInfo.MF->getFrameInfo()->hasVarSizedObjects());
3443 void SelectionDAGBuilder::visitLoad(const LoadInst &I) {
3445 return visitAtomicLoad(I);
3447 const Value *SV = I.getOperand(0);
3448 SDValue Ptr = getValue(SV);
3450 Type *Ty = I.getType();
3452 bool isVolatile = I.isVolatile();
3453 bool isNonTemporal = I.getMetadata("nontemporal") != 0;
3454 bool isInvariant = I.getMetadata("invariant.load") != 0;
3455 unsigned Alignment = I.getAlignment();
3456 const MDNode *TBAAInfo = I.getMetadata(LLVMContext::MD_tbaa);
3457 const MDNode *Ranges = I.getMetadata(LLVMContext::MD_range);
3459 SmallVector<EVT, 4> ValueVTs;
3460 SmallVector<uint64_t, 4> Offsets;
3461 ComputeValueVTs(*TM.getTargetLowering(), Ty, ValueVTs, &Offsets);
3462 unsigned NumValues = ValueVTs.size();
3467 bool ConstantMemory = false;
3468 if (isVolatile || NumValues > MaxParallelChains)
3469 // Serialize volatile loads with other side effects.
3471 else if (AA->pointsToConstantMemory(
3472 AliasAnalysis::Location(SV, AA->getTypeStoreSize(Ty), TBAAInfo))) {
3473 // Do not serialize (non-volatile) loads of constant memory with anything.
3474 Root = DAG.getEntryNode();
3475 ConstantMemory = true;
3477 // Do not serialize non-volatile loads against each other.
3478 Root = DAG.getRoot();
3481 const TargetLowering *TLI = TM.getTargetLowering();
3483 Root = TLI->prepareVolatileOrAtomicLoad(Root, getCurSDLoc(), DAG);
3485 SmallVector<SDValue, 4> Values(NumValues);
3486 SmallVector<SDValue, 4> Chains(std::min(unsigned(MaxParallelChains),
3488 EVT PtrVT = Ptr.getValueType();
3489 unsigned ChainI = 0;
3490 for (unsigned i = 0; i != NumValues; ++i, ++ChainI) {
3491 // Serializing loads here may result in excessive register pressure, and
3492 // TokenFactor places arbitrary choke points on the scheduler. SD scheduling
3493 // could recover a bit by hoisting nodes upward in the chain by recognizing
3494 // they are side-effect free or do not alias. The optimizer should really
3495 // avoid this case by converting large object/array copies to llvm.memcpy
3496 // (MaxParallelChains should always remain as failsafe).
3497 if (ChainI == MaxParallelChains) {
3498 assert(PendingLoads.empty() && "PendingLoads must be serialized first");
3499 SDValue Chain = DAG.getNode(ISD::TokenFactor, getCurSDLoc(),
3500 MVT::Other, &Chains[0], ChainI);
3504 SDValue A = DAG.getNode(ISD::ADD, getCurSDLoc(),
3506 DAG.getConstant(Offsets[i], PtrVT));
3507 SDValue L = DAG.getLoad(ValueVTs[i], getCurSDLoc(), Root,
3508 A, MachinePointerInfo(SV, Offsets[i]), isVolatile,
3509 isNonTemporal, isInvariant, Alignment, TBAAInfo,
3513 Chains[ChainI] = L.getValue(1);
3516 if (!ConstantMemory) {
3517 SDValue Chain = DAG.getNode(ISD::TokenFactor, getCurSDLoc(),
3518 MVT::Other, &Chains[0], ChainI);
3522 PendingLoads.push_back(Chain);
3525 setValue(&I, DAG.getNode(ISD::MERGE_VALUES, getCurSDLoc(),
3526 DAG.getVTList(&ValueVTs[0], NumValues),
3527 &Values[0], NumValues));
3530 void SelectionDAGBuilder::visitStore(const StoreInst &I) {
3532 return visitAtomicStore(I);
3534 const Value *SrcV = I.getOperand(0);
3535 const Value *PtrV = I.getOperand(1);
3537 SmallVector<EVT, 4> ValueVTs;
3538 SmallVector<uint64_t, 4> Offsets;
3539 ComputeValueVTs(*TM.getTargetLowering(), SrcV->getType(), ValueVTs, &Offsets);
3540 unsigned NumValues = ValueVTs.size();
3544 // Get the lowered operands. Note that we do this after
3545 // checking if NumResults is zero, because with zero results
3546 // the operands won't have values in the map.
3547 SDValue Src = getValue(SrcV);
3548 SDValue Ptr = getValue(PtrV);
3550 SDValue Root = getRoot();
3551 SmallVector<SDValue, 4> Chains(std::min(unsigned(MaxParallelChains),
3553 EVT PtrVT = Ptr.getValueType();
3554 bool isVolatile = I.isVolatile();
3555 bool isNonTemporal = I.getMetadata("nontemporal") != 0;
3556 unsigned Alignment = I.getAlignment();
3557 const MDNode *TBAAInfo = I.getMetadata(LLVMContext::MD_tbaa);
3559 unsigned ChainI = 0;
3560 for (unsigned i = 0; i != NumValues; ++i, ++ChainI) {
3561 // See visitLoad comments.
3562 if (ChainI == MaxParallelChains) {
3563 SDValue Chain = DAG.getNode(ISD::TokenFactor, getCurSDLoc(),
3564 MVT::Other, &Chains[0], ChainI);
3568 SDValue Add = DAG.getNode(ISD::ADD, getCurSDLoc(), PtrVT, Ptr,
3569 DAG.getConstant(Offsets[i], PtrVT));
3570 SDValue St = DAG.getStore(Root, getCurSDLoc(),
3571 SDValue(Src.getNode(), Src.getResNo() + i),
3572 Add, MachinePointerInfo(PtrV, Offsets[i]),
3573 isVolatile, isNonTemporal, Alignment, TBAAInfo);
3574 Chains[ChainI] = St;
3577 SDValue StoreNode = DAG.getNode(ISD::TokenFactor, getCurSDLoc(),
3578 MVT::Other, &Chains[0], ChainI);
3579 DAG.setRoot(StoreNode);
3582 static SDValue InsertFenceForAtomic(SDValue Chain, AtomicOrdering Order,
3583 SynchronizationScope Scope,
3584 bool Before, SDLoc dl,
3586 const TargetLowering &TLI) {
3587 // Fence, if necessary
3589 if (Order == AcquireRelease || Order == SequentiallyConsistent)
3591 else if (Order == Acquire || Order == Monotonic)
3594 if (Order == AcquireRelease)
3596 else if (Order == Release || Order == Monotonic)
3601 Ops[1] = DAG.getConstant(Order, TLI.getPointerTy());
3602 Ops[2] = DAG.getConstant(Scope, TLI.getPointerTy());
3603 return DAG.getNode(ISD::ATOMIC_FENCE, dl, MVT::Other, Ops, 3);
3606 void SelectionDAGBuilder::visitAtomicCmpXchg(const AtomicCmpXchgInst &I) {
3607 SDLoc dl = getCurSDLoc();
3608 AtomicOrdering Order = I.getOrdering();
3609 SynchronizationScope Scope = I.getSynchScope();
3611 SDValue InChain = getRoot();
3613 const TargetLowering *TLI = TM.getTargetLowering();
3614 if (TLI->getInsertFencesForAtomic())
3615 InChain = InsertFenceForAtomic(InChain, Order, Scope, true, dl,
3619 DAG.getAtomic(ISD::ATOMIC_CMP_SWAP, dl,
3620 getValue(I.getCompareOperand()).getSimpleValueType(),
3622 getValue(I.getPointerOperand()),
3623 getValue(I.getCompareOperand()),
3624 getValue(I.getNewValOperand()),
3625 MachinePointerInfo(I.getPointerOperand()), 0 /* Alignment */,
3626 TLI->getInsertFencesForAtomic() ? Monotonic : Order,
3629 SDValue OutChain = L.getValue(1);
3631 if (TLI->getInsertFencesForAtomic())
3632 OutChain = InsertFenceForAtomic(OutChain, Order, Scope, false, dl,
3636 DAG.setRoot(OutChain);
3639 void SelectionDAGBuilder::visitAtomicRMW(const AtomicRMWInst &I) {
3640 SDLoc dl = getCurSDLoc();
3642 switch (I.getOperation()) {
3643 default: llvm_unreachable("Unknown atomicrmw operation");
3644 case AtomicRMWInst::Xchg: NT = ISD::ATOMIC_SWAP; break;
3645 case AtomicRMWInst::Add: NT = ISD::ATOMIC_LOAD_ADD; break;
3646 case AtomicRMWInst::Sub: NT = ISD::ATOMIC_LOAD_SUB; break;
3647 case AtomicRMWInst::And: NT = ISD::ATOMIC_LOAD_AND; break;
3648 case AtomicRMWInst::Nand: NT = ISD::ATOMIC_LOAD_NAND; break;
3649 case AtomicRMWInst::Or: NT = ISD::ATOMIC_LOAD_OR; break;
3650 case AtomicRMWInst::Xor: NT = ISD::ATOMIC_LOAD_XOR; break;
3651 case AtomicRMWInst::Max: NT = ISD::ATOMIC_LOAD_MAX; break;
3652 case AtomicRMWInst::Min: NT = ISD::ATOMIC_LOAD_MIN; break;
3653 case AtomicRMWInst::UMax: NT = ISD::ATOMIC_LOAD_UMAX; break;
3654 case AtomicRMWInst::UMin: NT = ISD::ATOMIC_LOAD_UMIN; break;
3656 AtomicOrdering Order = I.getOrdering();
3657 SynchronizationScope Scope = I.getSynchScope();
3659 SDValue InChain = getRoot();
3661 const TargetLowering *TLI = TM.getTargetLowering();
3662 if (TLI->getInsertFencesForAtomic())
3663 InChain = InsertFenceForAtomic(InChain, Order, Scope, true, dl,
3667 DAG.getAtomic(NT, dl,
3668 getValue(I.getValOperand()).getSimpleValueType(),
3670 getValue(I.getPointerOperand()),
3671 getValue(I.getValOperand()),
3672 I.getPointerOperand(), 0 /* Alignment */,
3673 TLI->getInsertFencesForAtomic() ? Monotonic : Order,
3676 SDValue OutChain = L.getValue(1);
3678 if (TLI->getInsertFencesForAtomic())
3679 OutChain = InsertFenceForAtomic(OutChain, Order, Scope, false, dl,
3683 DAG.setRoot(OutChain);
3686 void SelectionDAGBuilder::visitFence(const FenceInst &I) {
3687 SDLoc dl = getCurSDLoc();
3688 const TargetLowering *TLI = TM.getTargetLowering();
3691 Ops[1] = DAG.getConstant(I.getOrdering(), TLI->getPointerTy());
3692 Ops[2] = DAG.getConstant(I.getSynchScope(), TLI->getPointerTy());
3693 DAG.setRoot(DAG.getNode(ISD::ATOMIC_FENCE, dl, MVT::Other, Ops, 3));
3696 void SelectionDAGBuilder::visitAtomicLoad(const LoadInst &I) {
3697 SDLoc dl = getCurSDLoc();
3698 AtomicOrdering Order = I.getOrdering();
3699 SynchronizationScope Scope = I.getSynchScope();
3701 SDValue InChain = getRoot();
3703 const TargetLowering *TLI = TM.getTargetLowering();
3704 EVT VT = TLI->getValueType(I.getType());
3706 if (I.getAlignment() < VT.getSizeInBits() / 8)
3707 report_fatal_error("Cannot generate unaligned atomic load");
3709 InChain = TLI->prepareVolatileOrAtomicLoad(InChain, dl, DAG);
3711 DAG.getAtomic(ISD::ATOMIC_LOAD, dl, VT, VT, InChain,
3712 getValue(I.getPointerOperand()),
3713 I.getPointerOperand(), I.getAlignment(),
3714 TLI->getInsertFencesForAtomic() ? Monotonic : Order,
3717 SDValue OutChain = L.getValue(1);
3719 if (TLI->getInsertFencesForAtomic())
3720 OutChain = InsertFenceForAtomic(OutChain, Order, Scope, false, dl,
3724 DAG.setRoot(OutChain);
3727 void SelectionDAGBuilder::visitAtomicStore(const StoreInst &I) {
3728 SDLoc dl = getCurSDLoc();
3730 AtomicOrdering Order = I.getOrdering();
3731 SynchronizationScope Scope = I.getSynchScope();
3733 SDValue InChain = getRoot();
3735 const TargetLowering *TLI = TM.getTargetLowering();
3736 EVT VT = TLI->getValueType(I.getValueOperand()->getType());
3738 if (I.getAlignment() < VT.getSizeInBits() / 8)
3739 report_fatal_error("Cannot generate unaligned atomic store");
3741 if (TLI->getInsertFencesForAtomic())
3742 InChain = InsertFenceForAtomic(InChain, Order, Scope, true, dl,
3746 DAG.getAtomic(ISD::ATOMIC_STORE, dl, VT,
3748 getValue(I.getPointerOperand()),
3749 getValue(I.getValueOperand()),
3750 I.getPointerOperand(), I.getAlignment(),
3751 TLI->getInsertFencesForAtomic() ? Monotonic : Order,
3754 if (TLI->getInsertFencesForAtomic())
3755 OutChain = InsertFenceForAtomic(OutChain, Order, Scope, false, dl,
3758 DAG.setRoot(OutChain);
3761 /// visitTargetIntrinsic - Lower a call of a target intrinsic to an INTRINSIC
3763 void SelectionDAGBuilder::visitTargetIntrinsic(const CallInst &I,
3764 unsigned Intrinsic) {
3765 bool HasChain = !I.doesNotAccessMemory();
3766 bool OnlyLoad = HasChain && I.onlyReadsMemory();
3768 // Build the operand list.
3769 SmallVector<SDValue, 8> Ops;
3770 if (HasChain) { // If this intrinsic has side-effects, chainify it.
3772 // We don't need to serialize loads against other loads.
3773 Ops.push_back(DAG.getRoot());
3775 Ops.push_back(getRoot());
3779 // Info is set by getTgtMemInstrinsic
3780 TargetLowering::IntrinsicInfo Info;
3781 const TargetLowering *TLI = TM.getTargetLowering();
3782 bool IsTgtIntrinsic = TLI->getTgtMemIntrinsic(Info, I, Intrinsic);
3784 // Add the intrinsic ID as an integer operand if it's not a target intrinsic.
3785 if (!IsTgtIntrinsic || Info.opc == ISD::INTRINSIC_VOID ||
3786 Info.opc == ISD::INTRINSIC_W_CHAIN)
3787 Ops.push_back(DAG.getTargetConstant(Intrinsic, TLI->getPointerTy()));
3789 // Add all operands of the call to the operand list.
3790 for (unsigned i = 0, e = I.getNumArgOperands(); i != e; ++i) {
3791 SDValue Op = getValue(I.getArgOperand(i));
3795 SmallVector<EVT, 4> ValueVTs;
3796 ComputeValueVTs(*TLI, I.getType(), ValueVTs);
3799 ValueVTs.push_back(MVT::Other);
3801 SDVTList VTs = DAG.getVTList(ValueVTs.data(), ValueVTs.size());
3805 if (IsTgtIntrinsic) {
3806 // This is target intrinsic that touches memory
3807 Result = DAG.getMemIntrinsicNode(Info.opc, getCurSDLoc(),
3808 VTs, &Ops[0], Ops.size(),
3810 MachinePointerInfo(Info.ptrVal, Info.offset),
3811 Info.align, Info.vol,
3812 Info.readMem, Info.writeMem);
3813 } else if (!HasChain) {
3814 Result = DAG.getNode(ISD::INTRINSIC_WO_CHAIN, getCurSDLoc(),
3815 VTs, &Ops[0], Ops.size());
3816 } else if (!I.getType()->isVoidTy()) {
3817 Result = DAG.getNode(ISD::INTRINSIC_W_CHAIN, getCurSDLoc(),
3818 VTs, &Ops[0], Ops.size());
3820 Result = DAG.getNode(ISD::INTRINSIC_VOID, getCurSDLoc(),
3821 VTs, &Ops[0], Ops.size());
3825 SDValue Chain = Result.getValue(Result.getNode()->getNumValues()-1);
3827 PendingLoads.push_back(Chain);
3832 if (!I.getType()->isVoidTy()) {
3833 if (VectorType *PTy = dyn_cast<VectorType>(I.getType())) {
3834 EVT VT = TLI->getValueType(PTy);
3835 Result = DAG.getNode(ISD::BITCAST, getCurSDLoc(), VT, Result);
3838 setValue(&I, Result);
3842 /// GetSignificand - Get the significand and build it into a floating-point
3843 /// number with exponent of 1:
3845 /// Op = (Op & 0x007fffff) | 0x3f800000;
3847 /// where Op is the hexadecimal representation of floating point value.
3849 GetSignificand(SelectionDAG &DAG, SDValue Op, SDLoc dl) {
3850 SDValue t1 = DAG.getNode(ISD::AND, dl, MVT::i32, Op,
3851 DAG.getConstant(0x007fffff, MVT::i32));
3852 SDValue t2 = DAG.getNode(ISD::OR, dl, MVT::i32, t1,
3853 DAG.getConstant(0x3f800000, MVT::i32));
3854 return DAG.getNode(ISD::BITCAST, dl, MVT::f32, t2);
3857 /// GetExponent - Get the exponent:
3859 /// (float)(int)(((Op & 0x7f800000) >> 23) - 127);
3861 /// where Op is the hexadecimal representation of floating point value.
3863 GetExponent(SelectionDAG &DAG, SDValue Op, const TargetLowering &TLI,
3865 SDValue t0 = DAG.getNode(ISD::AND, dl, MVT::i32, Op,
3866 DAG.getConstant(0x7f800000, MVT::i32));
3867 SDValue t1 = DAG.getNode(ISD::SRL, dl, MVT::i32, t0,
3868 DAG.getConstant(23, TLI.getPointerTy()));
3869 SDValue t2 = DAG.getNode(ISD::SUB, dl, MVT::i32, t1,
3870 DAG.getConstant(127, MVT::i32));
3871 return DAG.getNode(ISD::SINT_TO_FP, dl, MVT::f32, t2);
3874 /// getF32Constant - Get 32-bit floating point constant.
3876 getF32Constant(SelectionDAG &DAG, unsigned Flt) {
3877 return DAG.getConstantFP(APFloat(APFloat::IEEEsingle, APInt(32, Flt)),
3881 /// expandExp - Lower an exp intrinsic. Handles the special sequences for
3882 /// limited-precision mode.
3883 static SDValue expandExp(SDLoc dl, SDValue Op, SelectionDAG &DAG,
3884 const TargetLowering &TLI) {
3885 if (Op.getValueType() == MVT::f32 &&
3886 LimitFloatPrecision > 0 && LimitFloatPrecision <= 18) {
3888 // Put the exponent in the right bit position for later addition to the
3891 // #define LOG2OFe 1.4426950f
3892 // IntegerPartOfX = ((int32_t)(X * LOG2OFe));
3893 SDValue t0 = DAG.getNode(ISD::FMUL, dl, MVT::f32, Op,
3894 getF32Constant(DAG, 0x3fb8aa3b));
3895 SDValue IntegerPartOfX = DAG.getNode(ISD::FP_TO_SINT, dl, MVT::i32, t0);
3897 // FractionalPartOfX = (X * LOG2OFe) - (float)IntegerPartOfX;
3898 SDValue t1 = DAG.getNode(ISD::SINT_TO_FP, dl, MVT::f32, IntegerPartOfX);
3899 SDValue X = DAG.getNode(ISD::FSUB, dl, MVT::f32, t0, t1);
3901 // IntegerPartOfX <<= 23;
3902 IntegerPartOfX = DAG.getNode(ISD::SHL, dl, MVT::i32, IntegerPartOfX,
3903 DAG.getConstant(23, TLI.getPointerTy()));
3905 SDValue TwoToFracPartOfX;
3906 if (LimitFloatPrecision <= 6) {
3907 // For floating-point precision of 6:
3909 // TwoToFractionalPartOfX =
3911 // (0.735607626f + 0.252464424f * x) * x;
3913 // error 0.0144103317, which is 6 bits
3914 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
3915 getF32Constant(DAG, 0x3e814304));
3916 SDValue t3 = DAG.getNode(ISD::FADD, dl, MVT::f32, t2,
3917 getF32Constant(DAG, 0x3f3c50c8));
3918 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X);
3919 TwoToFracPartOfX = DAG.getNode(ISD::FADD, dl, MVT::f32, t4,
3920 getF32Constant(DAG, 0x3f7f5e7e));
3921 } else if (LimitFloatPrecision <= 12) {
3922 // For floating-point precision of 12:
3924 // TwoToFractionalPartOfX =
3927 // (0.224338339f + 0.792043434e-1f * x) * x) * x;
3929 // 0.000107046256 error, which is 13 to 14 bits
3930 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
3931 getF32Constant(DAG, 0x3da235e3));
3932 SDValue t3 = DAG.getNode(ISD::FADD, dl, MVT::f32, t2,
3933 getF32Constant(DAG, 0x3e65b8f3));
3934 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X);
3935 SDValue t5 = DAG.getNode(ISD::FADD, dl, MVT::f32, t4,
3936 getF32Constant(DAG, 0x3f324b07));
3937 SDValue t6 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t5, X);
3938 TwoToFracPartOfX = DAG.getNode(ISD::FADD, dl, MVT::f32, t6,
3939 getF32Constant(DAG, 0x3f7ff8fd));
3940 } else { // LimitFloatPrecision <= 18
3941 // For floating-point precision of 18:
3943 // TwoToFractionalPartOfX =
3947 // (0.554906021e-1f +
3948 // (0.961591928e-2f +
3949 // (0.136028312e-2f + 0.157059148e-3f *x)*x)*x)*x)*x)*x;
3951 // error 2.47208000*10^(-7), which is better than 18 bits
3952 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
3953 getF32Constant(DAG, 0x3924b03e));
3954 SDValue t3 = DAG.getNode(ISD::FADD, dl, MVT::f32, t2,
3955 getF32Constant(DAG, 0x3ab24b87));
3956 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X);
3957 SDValue t5 = DAG.getNode(ISD::FADD, dl, MVT::f32, t4,
3958 getF32Constant(DAG, 0x3c1d8c17));
3959 SDValue t6 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t5, X);
3960 SDValue t7 = DAG.getNode(ISD::FADD, dl, MVT::f32, t6,
3961 getF32Constant(DAG, 0x3d634a1d));
3962 SDValue t8 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t7, X);
3963 SDValue t9 = DAG.getNode(ISD::FADD, dl, MVT::f32, t8,
3964 getF32Constant(DAG, 0x3e75fe14));
3965 SDValue t10 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t9, X);
3966 SDValue t11 = DAG.getNode(ISD::FADD, dl, MVT::f32, t10,
3967 getF32Constant(DAG, 0x3f317234));
3968 SDValue t12 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t11, X);
3969 TwoToFracPartOfX = DAG.getNode(ISD::FADD, dl, MVT::f32, t12,
3970 getF32Constant(DAG, 0x3f800000));
3973 // Add the exponent into the result in integer domain.
3974 SDValue t13 = DAG.getNode(ISD::BITCAST, dl, MVT::i32, TwoToFracPartOfX);
3975 return DAG.getNode(ISD::BITCAST, dl, MVT::f32,
3976 DAG.getNode(ISD::ADD, dl, MVT::i32,
3977 t13, IntegerPartOfX));
3980 // No special expansion.
3981 return DAG.getNode(ISD::FEXP, dl, Op.getValueType(), Op);
3984 /// expandLog - Lower a log intrinsic. Handles the special sequences for
3985 /// limited-precision mode.
3986 static SDValue expandLog(SDLoc dl, SDValue Op, SelectionDAG &DAG,
3987 const TargetLowering &TLI) {
3988 if (Op.getValueType() == MVT::f32 &&
3989 LimitFloatPrecision > 0 && LimitFloatPrecision <= 18) {
3990 SDValue Op1 = DAG.getNode(ISD::BITCAST, dl, MVT::i32, Op);
3992 // Scale the exponent by log(2) [0.69314718f].
3993 SDValue Exp = GetExponent(DAG, Op1, TLI, dl);
3994 SDValue LogOfExponent = DAG.getNode(ISD::FMUL, dl, MVT::f32, Exp,
3995 getF32Constant(DAG, 0x3f317218));
3997 // Get the significand and build it into a floating-point number with
3999 SDValue X = GetSignificand(DAG, Op1, dl);
4001 SDValue LogOfMantissa;
4002 if (LimitFloatPrecision <= 6) {
4003 // For floating-point precision of 6:
4007 // (1.4034025f - 0.23903021f * x) * x;
4009 // error 0.0034276066, which is better than 8 bits
4010 SDValue t0 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
4011 getF32Constant(DAG, 0xbe74c456));
4012 SDValue t1 = DAG.getNode(ISD::FADD, dl, MVT::f32, t0,
4013 getF32Constant(DAG, 0x3fb3a2b1));
4014 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t1, X);
4015 LogOfMantissa = DAG.getNode(ISD::FSUB, dl, MVT::f32, t2,
4016 getF32Constant(DAG, 0x3f949a29));
4017 } else if (LimitFloatPrecision <= 12) {
4018 // For floating-point precision of 12:
4024 // (0.44717955f - 0.56570851e-1f * x) * x) * x) * x;
4026 // error 0.000061011436, which is 14 bits
4027 SDValue t0 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
4028 getF32Constant(DAG, 0xbd67b6d6));
4029 SDValue t1 = DAG.getNode(ISD::FADD, dl, MVT::f32, t0,
4030 getF32Constant(DAG, 0x3ee4f4b8));
4031 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t1, X);
4032 SDValue t3 = DAG.getNode(ISD::FSUB, dl, MVT::f32, t2,
4033 getF32Constant(DAG, 0x3fbc278b));
4034 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X);
4035 SDValue t5 = DAG.getNode(ISD::FADD, dl, MVT::f32, t4,
4036 getF32Constant(DAG, 0x40348e95));
4037 SDValue t6 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t5, X);
4038 LogOfMantissa = DAG.getNode(ISD::FSUB, dl, MVT::f32, t6,
4039 getF32Constant(DAG, 0x3fdef31a));
4040 } else { // LimitFloatPrecision <= 18
4041 // For floating-point precision of 18:
4049 // (0.19073739f - 0.17809712e-1f * x) * x) * x) * x) * x)*x;
4051 // error 0.0000023660568, which is better than 18 bits
4052 SDValue t0 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
4053 getF32Constant(DAG, 0xbc91e5ac));
4054 SDValue t1 = DAG.getNode(ISD::FADD, dl, MVT::f32, t0,
4055 getF32Constant(DAG, 0x3e4350aa));
4056 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t1, X);
4057 SDValue t3 = DAG.getNode(ISD::FSUB, dl, MVT::f32, t2,
4058 getF32Constant(DAG, 0x3f60d3e3));
4059 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X);
4060 SDValue t5 = DAG.getNode(ISD::FADD, dl, MVT::f32, t4,
4061 getF32Constant(DAG, 0x4011cdf0));
4062 SDValue t6 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t5, X);
4063 SDValue t7 = DAG.getNode(ISD::FSUB, dl, MVT::f32, t6,
4064 getF32Constant(DAG, 0x406cfd1c));
4065 SDValue t8 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t7, X);
4066 SDValue t9 = DAG.getNode(ISD::FADD, dl, MVT::f32, t8,
4067 getF32Constant(DAG, 0x408797cb));
4068 SDValue t10 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t9, X);
4069 LogOfMantissa = DAG.getNode(ISD::FSUB, dl, MVT::f32, t10,
4070 getF32Constant(DAG, 0x4006dcab));
4073 return DAG.getNode(ISD::FADD, dl, MVT::f32, LogOfExponent, LogOfMantissa);
4076 // No special expansion.
4077 return DAG.getNode(ISD::FLOG, dl, Op.getValueType(), Op);
4080 /// expandLog2 - Lower a log2 intrinsic. Handles the special sequences for
4081 /// limited-precision mode.
4082 static SDValue expandLog2(SDLoc dl, SDValue Op, SelectionDAG &DAG,
4083 const TargetLowering &TLI) {
4084 if (Op.getValueType() == MVT::f32 &&
4085 LimitFloatPrecision > 0 && LimitFloatPrecision <= 18) {
4086 SDValue Op1 = DAG.getNode(ISD::BITCAST, dl, MVT::i32, Op);
4088 // Get the exponent.
4089 SDValue LogOfExponent = GetExponent(DAG, Op1, TLI, dl);
4091 // Get the significand and build it into a floating-point number with
4093 SDValue X = GetSignificand(DAG, Op1, dl);
4095 // Different possible minimax approximations of significand in
4096 // floating-point for various degrees of accuracy over [1,2].
4097 SDValue Log2ofMantissa;
4098 if (LimitFloatPrecision <= 6) {
4099 // For floating-point precision of 6:
4101 // Log2ofMantissa = -1.6749035f + (2.0246817f - .34484768f * x) * x;
4103 // error 0.0049451742, which is more than 7 bits
4104 SDValue t0 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
4105 getF32Constant(DAG, 0xbeb08fe0));
4106 SDValue t1 = DAG.getNode(ISD::FADD, dl, MVT::f32, t0,
4107 getF32Constant(DAG, 0x40019463));
4108 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t1, X);
4109 Log2ofMantissa = DAG.getNode(ISD::FSUB, dl, MVT::f32, t2,
4110 getF32Constant(DAG, 0x3fd6633d));
4111 } else if (LimitFloatPrecision <= 12) {
4112 // For floating-point precision of 12:
4118 // (.645142248f - 0.816157886e-1f * x) * x) * x) * x;
4120 // error 0.0000876136000, which is better than 13 bits
4121 SDValue t0 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
4122 getF32Constant(DAG, 0xbda7262e));
4123 SDValue t1 = DAG.getNode(ISD::FADD, dl, MVT::f32, t0,
4124 getF32Constant(DAG, 0x3f25280b));
4125 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t1, X);
4126 SDValue t3 = DAG.getNode(ISD::FSUB, dl, MVT::f32, t2,
4127 getF32Constant(DAG, 0x4007b923));
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, 0x40823e2f));
4131 SDValue t6 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t5, X);
4132 Log2ofMantissa = DAG.getNode(ISD::FSUB, dl, MVT::f32, t6,
4133 getF32Constant(DAG, 0x4020d29c));
4134 } else { // LimitFloatPrecision <= 18
4135 // For floating-point precision of 18:
4144 // 0.25691327e-1f * x) * x) * x) * x) * x) * x;
4146 // error 0.0000018516, which is better than 18 bits
4147 SDValue t0 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
4148 getF32Constant(DAG, 0xbcd2769e));
4149 SDValue t1 = DAG.getNode(ISD::FADD, dl, MVT::f32, t0,
4150 getF32Constant(DAG, 0x3e8ce0b9));
4151 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t1, X);
4152 SDValue t3 = DAG.getNode(ISD::FSUB, dl, MVT::f32, t2,
4153 getF32Constant(DAG, 0x3fa22ae7));
4154 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X);
4155 SDValue t5 = DAG.getNode(ISD::FADD, dl, MVT::f32, t4,
4156 getF32Constant(DAG, 0x40525723));
4157 SDValue t6 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t5, X);
4158 SDValue t7 = DAG.getNode(ISD::FSUB, dl, MVT::f32, t6,
4159 getF32Constant(DAG, 0x40aaf200));
4160 SDValue t8 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t7, X);
4161 SDValue t9 = DAG.getNode(ISD::FADD, dl, MVT::f32, t8,
4162 getF32Constant(DAG, 0x40c39dad));
4163 SDValue t10 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t9, X);
4164 Log2ofMantissa = DAG.getNode(ISD::FSUB, dl, MVT::f32, t10,
4165 getF32Constant(DAG, 0x4042902c));
4168 return DAG.getNode(ISD::FADD, dl, MVT::f32, LogOfExponent, Log2ofMantissa);
4171 // No special expansion.
4172 return DAG.getNode(ISD::FLOG2, dl, Op.getValueType(), Op);
4175 /// expandLog10 - Lower a log10 intrinsic. Handles the special sequences for
4176 /// limited-precision mode.
4177 static SDValue expandLog10(SDLoc dl, SDValue Op, SelectionDAG &DAG,
4178 const TargetLowering &TLI) {
4179 if (Op.getValueType() == MVT::f32 &&
4180 LimitFloatPrecision > 0 && LimitFloatPrecision <= 18) {
4181 SDValue Op1 = DAG.getNode(ISD::BITCAST, dl, MVT::i32, Op);
4183 // Scale the exponent by log10(2) [0.30102999f].
4184 SDValue Exp = GetExponent(DAG, Op1, TLI, dl);
4185 SDValue LogOfExponent = DAG.getNode(ISD::FMUL, dl, MVT::f32, Exp,
4186 getF32Constant(DAG, 0x3e9a209a));
4188 // Get the significand and build it into a floating-point number with
4190 SDValue X = GetSignificand(DAG, Op1, dl);
4192 SDValue Log10ofMantissa;
4193 if (LimitFloatPrecision <= 6) {
4194 // For floating-point precision of 6:
4196 // Log10ofMantissa =
4198 // (0.60948995f - 0.10380950f * x) * x;
4200 // error 0.0014886165, which is 6 bits
4201 SDValue t0 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
4202 getF32Constant(DAG, 0xbdd49a13));
4203 SDValue t1 = DAG.getNode(ISD::FADD, dl, MVT::f32, t0,
4204 getF32Constant(DAG, 0x3f1c0789));
4205 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t1, X);
4206 Log10ofMantissa = DAG.getNode(ISD::FSUB, dl, MVT::f32, t2,
4207 getF32Constant(DAG, 0x3f011300));
4208 } else if (LimitFloatPrecision <= 12) {
4209 // For floating-point precision of 12:
4211 // Log10ofMantissa =
4214 // (-0.31664806f + 0.47637168e-1f * x) * x) * x;
4216 // error 0.00019228036, which is better than 12 bits
4217 SDValue t0 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
4218 getF32Constant(DAG, 0x3d431f31));
4219 SDValue t1 = DAG.getNode(ISD::FSUB, dl, MVT::f32, t0,
4220 getF32Constant(DAG, 0x3ea21fb2));
4221 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t1, X);
4222 SDValue t3 = DAG.getNode(ISD::FADD, dl, MVT::f32, t2,
4223 getF32Constant(DAG, 0x3f6ae232));
4224 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X);
4225 Log10ofMantissa = DAG.getNode(ISD::FSUB, dl, MVT::f32, t4,
4226 getF32Constant(DAG, 0x3f25f7c3));
4227 } else { // LimitFloatPrecision <= 18
4228 // For floating-point precision of 18:
4230 // Log10ofMantissa =
4235 // (-0.12539807f + 0.13508273e-1f * x) * x) * x) * x) * x;
4237 // error 0.0000037995730, which is better than 18 bits
4238 SDValue t0 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
4239 getF32Constant(DAG, 0x3c5d51ce));
4240 SDValue t1 = DAG.getNode(ISD::FSUB, dl, MVT::f32, t0,
4241 getF32Constant(DAG, 0x3e00685a));
4242 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t1, X);
4243 SDValue t3 = DAG.getNode(ISD::FADD, dl, MVT::f32, t2,
4244 getF32Constant(DAG, 0x3efb6798));
4245 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X);
4246 SDValue t5 = DAG.getNode(ISD::FSUB, dl, MVT::f32, t4,
4247 getF32Constant(DAG, 0x3f88d192));
4248 SDValue t6 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t5, X);
4249 SDValue t7 = DAG.getNode(ISD::FADD, dl, MVT::f32, t6,
4250 getF32Constant(DAG, 0x3fc4316c));
4251 SDValue t8 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t7, X);
4252 Log10ofMantissa = DAG.getNode(ISD::FSUB, dl, MVT::f32, t8,
4253 getF32Constant(DAG, 0x3f57ce70));
4256 return DAG.getNode(ISD::FADD, dl, MVT::f32, LogOfExponent, Log10ofMantissa);
4259 // No special expansion.
4260 return DAG.getNode(ISD::FLOG10, dl, Op.getValueType(), Op);
4263 /// expandExp2 - Lower an exp2 intrinsic. Handles the special sequences for
4264 /// limited-precision mode.
4265 static SDValue expandExp2(SDLoc dl, SDValue Op, SelectionDAG &DAG,
4266 const TargetLowering &TLI) {
4267 if (Op.getValueType() == MVT::f32 &&
4268 LimitFloatPrecision > 0 && LimitFloatPrecision <= 18) {
4269 SDValue IntegerPartOfX = DAG.getNode(ISD::FP_TO_SINT, dl, MVT::i32, Op);
4271 // FractionalPartOfX = x - (float)IntegerPartOfX;
4272 SDValue t1 = DAG.getNode(ISD::SINT_TO_FP, dl, MVT::f32, IntegerPartOfX);
4273 SDValue X = DAG.getNode(ISD::FSUB, dl, MVT::f32, Op, t1);
4275 // IntegerPartOfX <<= 23;
4276 IntegerPartOfX = DAG.getNode(ISD::SHL, dl, MVT::i32, IntegerPartOfX,
4277 DAG.getConstant(23, TLI.getPointerTy()));
4279 SDValue TwoToFractionalPartOfX;
4280 if (LimitFloatPrecision <= 6) {
4281 // For floating-point precision of 6:
4283 // TwoToFractionalPartOfX =
4285 // (0.735607626f + 0.252464424f * x) * x;
4287 // error 0.0144103317, which is 6 bits
4288 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
4289 getF32Constant(DAG, 0x3e814304));
4290 SDValue t3 = DAG.getNode(ISD::FADD, dl, MVT::f32, t2,
4291 getF32Constant(DAG, 0x3f3c50c8));
4292 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X);
4293 TwoToFractionalPartOfX = DAG.getNode(ISD::FADD, dl, MVT::f32, t4,
4294 getF32Constant(DAG, 0x3f7f5e7e));
4295 } else if (LimitFloatPrecision <= 12) {
4296 // For floating-point precision of 12:
4298 // TwoToFractionalPartOfX =
4301 // (0.224338339f + 0.792043434e-1f * x) * x) * x;
4303 // error 0.000107046256, which is 13 to 14 bits
4304 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
4305 getF32Constant(DAG, 0x3da235e3));
4306 SDValue t3 = DAG.getNode(ISD::FADD, dl, MVT::f32, t2,
4307 getF32Constant(DAG, 0x3e65b8f3));
4308 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X);
4309 SDValue t5 = DAG.getNode(ISD::FADD, dl, MVT::f32, t4,
4310 getF32Constant(DAG, 0x3f324b07));
4311 SDValue t6 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t5, X);
4312 TwoToFractionalPartOfX = DAG.getNode(ISD::FADD, dl, MVT::f32, t6,
4313 getF32Constant(DAG, 0x3f7ff8fd));
4314 } else { // LimitFloatPrecision <= 18
4315 // For floating-point precision of 18:
4317 // TwoToFractionalPartOfX =
4321 // (0.554906021e-1f +
4322 // (0.961591928e-2f +
4323 // (0.136028312e-2f + 0.157059148e-3f *x)*x)*x)*x)*x)*x;
4324 // error 2.47208000*10^(-7), which is better than 18 bits
4325 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
4326 getF32Constant(DAG, 0x3924b03e));
4327 SDValue t3 = DAG.getNode(ISD::FADD, dl, MVT::f32, t2,
4328 getF32Constant(DAG, 0x3ab24b87));
4329 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X);
4330 SDValue t5 = DAG.getNode(ISD::FADD, dl, MVT::f32, t4,
4331 getF32Constant(DAG, 0x3c1d8c17));
4332 SDValue t6 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t5, X);
4333 SDValue t7 = DAG.getNode(ISD::FADD, dl, MVT::f32, t6,
4334 getF32Constant(DAG, 0x3d634a1d));
4335 SDValue t8 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t7, X);
4336 SDValue t9 = DAG.getNode(ISD::FADD, dl, MVT::f32, t8,
4337 getF32Constant(DAG, 0x3e75fe14));
4338 SDValue t10 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t9, X);
4339 SDValue t11 = DAG.getNode(ISD::FADD, dl, MVT::f32, t10,
4340 getF32Constant(DAG, 0x3f317234));
4341 SDValue t12 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t11, X);
4342 TwoToFractionalPartOfX = DAG.getNode(ISD::FADD, dl, MVT::f32, t12,
4343 getF32Constant(DAG, 0x3f800000));
4346 // Add the exponent into the result in integer domain.
4347 SDValue t13 = DAG.getNode(ISD::BITCAST, dl, MVT::i32,
4348 TwoToFractionalPartOfX);
4349 return DAG.getNode(ISD::BITCAST, dl, MVT::f32,
4350 DAG.getNode(ISD::ADD, dl, MVT::i32,
4351 t13, IntegerPartOfX));
4354 // No special expansion.
4355 return DAG.getNode(ISD::FEXP2, dl, Op.getValueType(), Op);
4358 /// visitPow - Lower a pow intrinsic. Handles the special sequences for
4359 /// limited-precision mode with x == 10.0f.
4360 static SDValue expandPow(SDLoc dl, SDValue LHS, SDValue RHS,
4361 SelectionDAG &DAG, const TargetLowering &TLI) {
4362 bool IsExp10 = false;
4363 if (LHS.getValueType() == MVT::f32 && RHS.getValueType() == MVT::f32 &&
4364 LimitFloatPrecision > 0 && LimitFloatPrecision <= 18) {
4365 if (ConstantFPSDNode *LHSC = dyn_cast<ConstantFPSDNode>(LHS)) {
4367 IsExp10 = LHSC->isExactlyValue(Ten);
4372 // Put the exponent in the right bit position for later addition to the
4375 // #define LOG2OF10 3.3219281f
4376 // IntegerPartOfX = (int32_t)(x * LOG2OF10);
4377 SDValue t0 = DAG.getNode(ISD::FMUL, dl, MVT::f32, RHS,
4378 getF32Constant(DAG, 0x40549a78));
4379 SDValue IntegerPartOfX = DAG.getNode(ISD::FP_TO_SINT, dl, MVT::i32, t0);
4381 // FractionalPartOfX = x - (float)IntegerPartOfX;
4382 SDValue t1 = DAG.getNode(ISD::SINT_TO_FP, dl, MVT::f32, IntegerPartOfX);
4383 SDValue X = DAG.getNode(ISD::FSUB, dl, MVT::f32, t0, t1);
4385 // IntegerPartOfX <<= 23;
4386 IntegerPartOfX = DAG.getNode(ISD::SHL, dl, MVT::i32, IntegerPartOfX,
4387 DAG.getConstant(23, TLI.getPointerTy()));
4389 SDValue TwoToFractionalPartOfX;
4390 if (LimitFloatPrecision <= 6) {
4391 // For floating-point precision of 6:
4393 // twoToFractionalPartOfX =
4395 // (0.735607626f + 0.252464424f * x) * x;
4397 // error 0.0144103317, which is 6 bits
4398 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
4399 getF32Constant(DAG, 0x3e814304));
4400 SDValue t3 = DAG.getNode(ISD::FADD, dl, MVT::f32, t2,
4401 getF32Constant(DAG, 0x3f3c50c8));
4402 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X);
4403 TwoToFractionalPartOfX = DAG.getNode(ISD::FADD, dl, MVT::f32, t4,
4404 getF32Constant(DAG, 0x3f7f5e7e));
4405 } else if (LimitFloatPrecision <= 12) {
4406 // For floating-point precision of 12:
4408 // TwoToFractionalPartOfX =
4411 // (0.224338339f + 0.792043434e-1f * x) * x) * x;
4413 // error 0.000107046256, which is 13 to 14 bits
4414 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
4415 getF32Constant(DAG, 0x3da235e3));
4416 SDValue t3 = DAG.getNode(ISD::FADD, dl, MVT::f32, t2,
4417 getF32Constant(DAG, 0x3e65b8f3));
4418 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X);
4419 SDValue t5 = DAG.getNode(ISD::FADD, dl, MVT::f32, t4,
4420 getF32Constant(DAG, 0x3f324b07));
4421 SDValue t6 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t5, X);
4422 TwoToFractionalPartOfX = DAG.getNode(ISD::FADD, dl, MVT::f32, t6,
4423 getF32Constant(DAG, 0x3f7ff8fd));
4424 } else { // LimitFloatPrecision <= 18
4425 // For floating-point precision of 18:
4427 // TwoToFractionalPartOfX =
4431 // (0.554906021e-1f +
4432 // (0.961591928e-2f +
4433 // (0.136028312e-2f + 0.157059148e-3f *x)*x)*x)*x)*x)*x;
4434 // error 2.47208000*10^(-7), which is better than 18 bits
4435 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
4436 getF32Constant(DAG, 0x3924b03e));
4437 SDValue t3 = DAG.getNode(ISD::FADD, dl, MVT::f32, t2,
4438 getF32Constant(DAG, 0x3ab24b87));
4439 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X);
4440 SDValue t5 = DAG.getNode(ISD::FADD, dl, MVT::f32, t4,
4441 getF32Constant(DAG, 0x3c1d8c17));
4442 SDValue t6 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t5, X);
4443 SDValue t7 = DAG.getNode(ISD::FADD, dl, MVT::f32, t6,
4444 getF32Constant(DAG, 0x3d634a1d));
4445 SDValue t8 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t7, X);
4446 SDValue t9 = DAG.getNode(ISD::FADD, dl, MVT::f32, t8,
4447 getF32Constant(DAG, 0x3e75fe14));
4448 SDValue t10 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t9, X);
4449 SDValue t11 = DAG.getNode(ISD::FADD, dl, MVT::f32, t10,
4450 getF32Constant(DAG, 0x3f317234));
4451 SDValue t12 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t11, X);
4452 TwoToFractionalPartOfX = DAG.getNode(ISD::FADD, dl, MVT::f32, t12,
4453 getF32Constant(DAG, 0x3f800000));
4456 SDValue t13 = DAG.getNode(ISD::BITCAST, dl,MVT::i32,TwoToFractionalPartOfX);
4457 return DAG.getNode(ISD::BITCAST, dl, MVT::f32,
4458 DAG.getNode(ISD::ADD, dl, MVT::i32,
4459 t13, IntegerPartOfX));
4462 // No special expansion.
4463 return DAG.getNode(ISD::FPOW, dl, LHS.getValueType(), LHS, RHS);
4467 /// ExpandPowI - Expand a llvm.powi intrinsic.
4468 static SDValue ExpandPowI(SDLoc DL, SDValue LHS, SDValue RHS,
4469 SelectionDAG &DAG) {
4470 // If RHS is a constant, we can expand this out to a multiplication tree,
4471 // otherwise we end up lowering to a call to __powidf2 (for example). When
4472 // optimizing for size, we only want to do this if the expansion would produce
4473 // a small number of multiplies, otherwise we do the full expansion.
4474 if (ConstantSDNode *RHSC = dyn_cast<ConstantSDNode>(RHS)) {
4475 // Get the exponent as a positive value.
4476 unsigned Val = RHSC->getSExtValue();
4477 if ((int)Val < 0) Val = -Val;
4479 // powi(x, 0) -> 1.0
4481 return DAG.getConstantFP(1.0, LHS.getValueType());
4483 const Function *F = DAG.getMachineFunction().getFunction();
4484 if (!F->getAttributes().hasAttribute(AttributeSet::FunctionIndex,
4485 Attribute::OptimizeForSize) ||
4486 // If optimizing for size, don't insert too many multiplies. This
4487 // inserts up to 5 multiplies.
4488 CountPopulation_32(Val)+Log2_32(Val) < 7) {
4489 // We use the simple binary decomposition method to generate the multiply
4490 // sequence. There are more optimal ways to do this (for example,
4491 // powi(x,15) generates one more multiply than it should), but this has
4492 // the benefit of being both really simple and much better than a libcall.
4493 SDValue Res; // Logically starts equal to 1.0
4494 SDValue CurSquare = LHS;
4498 Res = DAG.getNode(ISD::FMUL, DL,Res.getValueType(), Res, CurSquare);
4500 Res = CurSquare; // 1.0*CurSquare.
4503 CurSquare = DAG.getNode(ISD::FMUL, DL, CurSquare.getValueType(),
4504 CurSquare, CurSquare);
4508 // If the original was negative, invert the result, producing 1/(x*x*x).
4509 if (RHSC->getSExtValue() < 0)
4510 Res = DAG.getNode(ISD::FDIV, DL, LHS.getValueType(),
4511 DAG.getConstantFP(1.0, LHS.getValueType()), Res);
4516 // Otherwise, expand to a libcall.
4517 return DAG.getNode(ISD::FPOWI, DL, LHS.getValueType(), LHS, RHS);
4520 // getTruncatedArgReg - Find underlying register used for an truncated
4522 static unsigned getTruncatedArgReg(const SDValue &N) {
4523 if (N.getOpcode() != ISD::TRUNCATE)
4526 const SDValue &Ext = N.getOperand(0);
4527 if (Ext.getOpcode() == ISD::AssertZext ||
4528 Ext.getOpcode() == ISD::AssertSext) {
4529 const SDValue &CFR = Ext.getOperand(0);
4530 if (CFR.getOpcode() == ISD::CopyFromReg)
4531 return cast<RegisterSDNode>(CFR.getOperand(1))->getReg();
4532 if (CFR.getOpcode() == ISD::TRUNCATE)
4533 return getTruncatedArgReg(CFR);
4538 /// EmitFuncArgumentDbgValue - If the DbgValueInst is a dbg_value of a function
4539 /// argument, create the corresponding DBG_VALUE machine instruction for it now.
4540 /// At the end of instruction selection, they will be inserted to the entry BB.
4542 SelectionDAGBuilder::EmitFuncArgumentDbgValue(const Value *V, MDNode *Variable,
4545 const Argument *Arg = dyn_cast<Argument>(V);
4549 MachineFunction &MF = DAG.getMachineFunction();
4550 const TargetInstrInfo *TII = DAG.getTarget().getInstrInfo();
4552 // Ignore inlined function arguments here.
4553 DIVariable DV(Variable);
4554 if (DV.isInlinedFnArgument(MF.getFunction()))
4557 Optional<MachineOperand> Op;
4558 // Some arguments' frame index is recorded during argument lowering.
4559 if (int FI = FuncInfo.getArgumentFrameIndex(Arg))
4560 Op = MachineOperand::CreateFI(FI);
4562 if (!Op && N.getNode()) {
4564 if (N.getOpcode() == ISD::CopyFromReg)
4565 Reg = cast<RegisterSDNode>(N.getOperand(1))->getReg();
4567 Reg = getTruncatedArgReg(N);
4568 if (Reg && TargetRegisterInfo::isVirtualRegister(Reg)) {
4569 MachineRegisterInfo &RegInfo = MF.getRegInfo();
4570 unsigned PR = RegInfo.getLiveInPhysReg(Reg);
4575 Op = MachineOperand::CreateReg(Reg, false);
4579 // Check if ValueMap has reg number.
4580 DenseMap<const Value *, unsigned>::iterator VMI = FuncInfo.ValueMap.find(V);
4581 if (VMI != FuncInfo.ValueMap.end())
4582 Op = MachineOperand::CreateReg(VMI->second, false);
4585 if (!Op && N.getNode())
4586 // Check if frame index is available.
4587 if (LoadSDNode *LNode = dyn_cast<LoadSDNode>(N.getNode()))
4588 if (FrameIndexSDNode *FINode =
4589 dyn_cast<FrameIndexSDNode>(LNode->getBasePtr().getNode()))
4590 Op = MachineOperand::CreateFI(FINode->getIndex());
4595 // FIXME: This does not handle register-indirect values at offset 0.
4596 bool IsIndirect = Offset != 0;
4598 FuncInfo.ArgDbgValues.push_back(BuildMI(MF, getCurDebugLoc(),
4599 TII->get(TargetOpcode::DBG_VALUE),
4601 Op->getReg(), Offset, Variable));
4603 FuncInfo.ArgDbgValues.push_back(
4604 BuildMI(MF, getCurDebugLoc(), TII->get(TargetOpcode::DBG_VALUE))
4605 .addOperand(*Op).addImm(Offset).addMetadata(Variable));
4610 // VisualStudio defines setjmp as _setjmp
4611 #if defined(_MSC_VER) && defined(setjmp) && \
4612 !defined(setjmp_undefined_for_msvc)
4613 # pragma push_macro("setjmp")
4615 # define setjmp_undefined_for_msvc
4618 /// visitIntrinsicCall - Lower the call to the specified intrinsic function. If
4619 /// we want to emit this as a call to a named external function, return the name
4620 /// otherwise lower it and return null.
4622 SelectionDAGBuilder::visitIntrinsicCall(const CallInst &I, unsigned Intrinsic) {
4623 const TargetLowering *TLI = TM.getTargetLowering();
4624 SDLoc sdl = getCurSDLoc();
4625 DebugLoc dl = getCurDebugLoc();
4628 switch (Intrinsic) {
4630 // By default, turn this into a target intrinsic node.
4631 visitTargetIntrinsic(I, Intrinsic);
4633 case Intrinsic::vastart: visitVAStart(I); return 0;
4634 case Intrinsic::vaend: visitVAEnd(I); return 0;
4635 case Intrinsic::vacopy: visitVACopy(I); return 0;
4636 case Intrinsic::returnaddress:
4637 setValue(&I, DAG.getNode(ISD::RETURNADDR, sdl, TLI->getPointerTy(),
4638 getValue(I.getArgOperand(0))));
4640 case Intrinsic::frameaddress:
4641 setValue(&I, DAG.getNode(ISD::FRAMEADDR, sdl, TLI->getPointerTy(),
4642 getValue(I.getArgOperand(0))));
4644 case Intrinsic::setjmp:
4645 return &"_setjmp"[!TLI->usesUnderscoreSetJmp()];
4646 case Intrinsic::longjmp:
4647 return &"_longjmp"[!TLI->usesUnderscoreLongJmp()];
4648 case Intrinsic::memcpy: {
4649 // Assert for address < 256 since we support only user defined address
4651 assert(cast<PointerType>(I.getArgOperand(0)->getType())->getAddressSpace()
4653 cast<PointerType>(I.getArgOperand(1)->getType())->getAddressSpace()
4655 "Unknown address space");
4656 SDValue Op1 = getValue(I.getArgOperand(0));
4657 SDValue Op2 = getValue(I.getArgOperand(1));
4658 SDValue Op3 = getValue(I.getArgOperand(2));
4659 unsigned Align = cast<ConstantInt>(I.getArgOperand(3))->getZExtValue();
4661 Align = 1; // @llvm.memcpy defines 0 and 1 to both mean no alignment.
4662 bool isVol = cast<ConstantInt>(I.getArgOperand(4))->getZExtValue();
4663 DAG.setRoot(DAG.getMemcpy(getRoot(), sdl, Op1, Op2, Op3, Align, isVol, false,
4664 MachinePointerInfo(I.getArgOperand(0)),
4665 MachinePointerInfo(I.getArgOperand(1))));
4668 case Intrinsic::memset: {
4669 // Assert for address < 256 since we support only user defined address
4671 assert(cast<PointerType>(I.getArgOperand(0)->getType())->getAddressSpace()
4673 "Unknown address space");
4674 SDValue Op1 = getValue(I.getArgOperand(0));
4675 SDValue Op2 = getValue(I.getArgOperand(1));
4676 SDValue Op3 = getValue(I.getArgOperand(2));
4677 unsigned Align = cast<ConstantInt>(I.getArgOperand(3))->getZExtValue();
4679 Align = 1; // @llvm.memset defines 0 and 1 to both mean no alignment.
4680 bool isVol = cast<ConstantInt>(I.getArgOperand(4))->getZExtValue();
4681 DAG.setRoot(DAG.getMemset(getRoot(), sdl, Op1, Op2, Op3, Align, isVol,
4682 MachinePointerInfo(I.getArgOperand(0))));
4685 case Intrinsic::memmove: {
4686 // Assert for address < 256 since we support only user defined address
4688 assert(cast<PointerType>(I.getArgOperand(0)->getType())->getAddressSpace()
4690 cast<PointerType>(I.getArgOperand(1)->getType())->getAddressSpace()
4692 "Unknown address space");
4693 SDValue Op1 = getValue(I.getArgOperand(0));
4694 SDValue Op2 = getValue(I.getArgOperand(1));
4695 SDValue Op3 = getValue(I.getArgOperand(2));
4696 unsigned Align = cast<ConstantInt>(I.getArgOperand(3))->getZExtValue();
4698 Align = 1; // @llvm.memmove defines 0 and 1 to both mean no alignment.
4699 bool isVol = cast<ConstantInt>(I.getArgOperand(4))->getZExtValue();
4700 DAG.setRoot(DAG.getMemmove(getRoot(), sdl, Op1, Op2, Op3, Align, isVol,
4701 MachinePointerInfo(I.getArgOperand(0)),
4702 MachinePointerInfo(I.getArgOperand(1))));
4705 case Intrinsic::dbg_declare: {
4706 const DbgDeclareInst &DI = cast<DbgDeclareInst>(I);
4707 MDNode *Variable = DI.getVariable();
4708 const Value *Address = DI.getAddress();
4709 DIVariable DIVar(Variable);
4710 assert((!DIVar || DIVar.isVariable()) &&
4711 "Variable in DbgDeclareInst should be either null or a DIVariable.");
4712 if (!Address || !DIVar) {
4713 DEBUG(dbgs() << "Dropping debug info for " << DI << "\n");
4717 // Check if address has undef value.
4718 if (isa<UndefValue>(Address) ||
4719 (Address->use_empty() && !isa<Argument>(Address))) {
4720 DEBUG(dbgs() << "Dropping debug info for " << DI << "\n");
4724 SDValue &N = NodeMap[Address];
4725 if (!N.getNode() && isa<Argument>(Address))
4726 // Check unused arguments map.
4727 N = UnusedArgNodeMap[Address];
4730 if (const BitCastInst *BCI = dyn_cast<BitCastInst>(Address))
4731 Address = BCI->getOperand(0);
4732 // Parameters are handled specially.
4734 (DIVariable(Variable).getTag() == dwarf::DW_TAG_arg_variable ||
4735 isa<Argument>(Address));
4737 const AllocaInst *AI = dyn_cast<AllocaInst>(Address);
4739 if (isParameter && !AI) {
4740 FrameIndexSDNode *FINode = dyn_cast<FrameIndexSDNode>(N.getNode());
4742 // Byval parameter. We have a frame index at this point.
4743 SDV = DAG.getDbgValue(Variable, FINode->getIndex(),
4744 0, dl, SDNodeOrder);
4746 // Address is an argument, so try to emit its dbg value using
4747 // virtual register info from the FuncInfo.ValueMap.
4748 EmitFuncArgumentDbgValue(Address, Variable, 0, N);
4752 SDV = DAG.getDbgValue(Variable, N.getNode(), N.getResNo(),
4753 0, dl, SDNodeOrder);
4755 // Can't do anything with other non-AI cases yet.
4756 DEBUG(dbgs() << "Dropping debug info for " << DI << "\n");
4757 DEBUG(dbgs() << "non-AllocaInst issue for Address: \n\t");
4758 DEBUG(Address->dump());
4761 DAG.AddDbgValue(SDV, N.getNode(), isParameter);
4763 // If Address is an argument then try to emit its dbg value using
4764 // virtual register info from the FuncInfo.ValueMap.
4765 if (!EmitFuncArgumentDbgValue(Address, Variable, 0, N)) {
4766 // If variable is pinned by a alloca in dominating bb then
4767 // use StaticAllocaMap.
4768 if (const AllocaInst *AI = dyn_cast<AllocaInst>(Address)) {
4769 if (AI->getParent() != DI.getParent()) {
4770 DenseMap<const AllocaInst*, int>::iterator SI =
4771 FuncInfo.StaticAllocaMap.find(AI);
4772 if (SI != FuncInfo.StaticAllocaMap.end()) {
4773 SDV = DAG.getDbgValue(Variable, SI->second,
4774 0, dl, SDNodeOrder);
4775 DAG.AddDbgValue(SDV, 0, false);
4780 DEBUG(dbgs() << "Dropping debug info for " << DI << "\n");
4785 case Intrinsic::dbg_value: {
4786 const DbgValueInst &DI = cast<DbgValueInst>(I);
4787 DIVariable DIVar(DI.getVariable());
4788 assert((!DIVar || DIVar.isVariable()) &&
4789 "Variable in DbgValueInst should be either null or a DIVariable.");
4793 MDNode *Variable = DI.getVariable();
4794 uint64_t Offset = DI.getOffset();
4795 const Value *V = DI.getValue();
4800 if (isa<ConstantInt>(V) || isa<ConstantFP>(V) || isa<UndefValue>(V)) {
4801 SDV = DAG.getDbgValue(Variable, V, Offset, dl, SDNodeOrder);
4802 DAG.AddDbgValue(SDV, 0, false);
4804 // Do not use getValue() in here; we don't want to generate code at
4805 // this point if it hasn't been done yet.
4806 SDValue N = NodeMap[V];
4807 if (!N.getNode() && isa<Argument>(V))
4808 // Check unused arguments map.
4809 N = UnusedArgNodeMap[V];
4811 if (!EmitFuncArgumentDbgValue(V, Variable, Offset, N)) {
4812 SDV = DAG.getDbgValue(Variable, N.getNode(),
4813 N.getResNo(), Offset, dl, SDNodeOrder);
4814 DAG.AddDbgValue(SDV, N.getNode(), false);
4816 } else if (!V->use_empty() ) {
4817 // Do not call getValue(V) yet, as we don't want to generate code.
4818 // Remember it for later.
4819 DanglingDebugInfo DDI(&DI, dl, SDNodeOrder);
4820 DanglingDebugInfoMap[V] = DDI;
4822 // We may expand this to cover more cases. One case where we have no
4823 // data available is an unreferenced parameter.
4824 DEBUG(dbgs() << "Dropping debug info for " << DI << "\n");
4828 // Build a debug info table entry.
4829 if (const BitCastInst *BCI = dyn_cast<BitCastInst>(V))
4830 V = BCI->getOperand(0);
4831 const AllocaInst *AI = dyn_cast<AllocaInst>(V);
4832 // Don't handle byval struct arguments or VLAs, for example.
4834 DEBUG(dbgs() << "Dropping debug location info for:\n " << DI << "\n");
4835 DEBUG(dbgs() << " Last seen at:\n " << *V << "\n");
4838 DenseMap<const AllocaInst*, int>::iterator SI =
4839 FuncInfo.StaticAllocaMap.find(AI);
4840 if (SI == FuncInfo.StaticAllocaMap.end())
4842 int FI = SI->second;
4844 MachineModuleInfo &MMI = DAG.getMachineFunction().getMMI();
4845 if (!DI.getDebugLoc().isUnknown() && MMI.hasDebugInfo())
4846 MMI.setVariableDbgInfo(Variable, FI, DI.getDebugLoc());
4850 case Intrinsic::eh_typeid_for: {
4851 // Find the type id for the given typeinfo.
4852 GlobalVariable *GV = ExtractTypeInfo(I.getArgOperand(0));
4853 unsigned TypeID = DAG.getMachineFunction().getMMI().getTypeIDFor(GV);
4854 Res = DAG.getConstant(TypeID, MVT::i32);
4859 case Intrinsic::eh_return_i32:
4860 case Intrinsic::eh_return_i64:
4861 DAG.getMachineFunction().getMMI().setCallsEHReturn(true);
4862 DAG.setRoot(DAG.getNode(ISD::EH_RETURN, sdl,
4865 getValue(I.getArgOperand(0)),
4866 getValue(I.getArgOperand(1))));
4868 case Intrinsic::eh_unwind_init:
4869 DAG.getMachineFunction().getMMI().setCallsUnwindInit(true);
4871 case Intrinsic::eh_dwarf_cfa: {
4872 SDValue CfaArg = DAG.getSExtOrTrunc(getValue(I.getArgOperand(0)), sdl,
4873 TLI->getPointerTy());
4874 SDValue Offset = DAG.getNode(ISD::ADD, sdl,
4875 CfaArg.getValueType(),
4876 DAG.getNode(ISD::FRAME_TO_ARGS_OFFSET, sdl,
4877 CfaArg.getValueType()),
4879 SDValue FA = DAG.getNode(ISD::FRAMEADDR, sdl,
4880 TLI->getPointerTy(),
4881 DAG.getConstant(0, TLI->getPointerTy()));
4882 setValue(&I, DAG.getNode(ISD::ADD, sdl, FA.getValueType(),
4886 case Intrinsic::eh_sjlj_callsite: {
4887 MachineModuleInfo &MMI = DAG.getMachineFunction().getMMI();
4888 ConstantInt *CI = dyn_cast<ConstantInt>(I.getArgOperand(0));
4889 assert(CI && "Non-constant call site value in eh.sjlj.callsite!");
4890 assert(MMI.getCurrentCallSite() == 0 && "Overlapping call sites!");
4892 MMI.setCurrentCallSite(CI->getZExtValue());
4895 case Intrinsic::eh_sjlj_functioncontext: {
4896 // Get and store the index of the function context.
4897 MachineFrameInfo *MFI = DAG.getMachineFunction().getFrameInfo();
4899 cast<AllocaInst>(I.getArgOperand(0)->stripPointerCasts());
4900 int FI = FuncInfo.StaticAllocaMap[FnCtx];
4901 MFI->setFunctionContextIndex(FI);
4904 case Intrinsic::eh_sjlj_setjmp: {
4907 Ops[1] = getValue(I.getArgOperand(0));
4908 SDValue Op = DAG.getNode(ISD::EH_SJLJ_SETJMP, sdl,
4909 DAG.getVTList(MVT::i32, MVT::Other),
4911 setValue(&I, Op.getValue(0));
4912 DAG.setRoot(Op.getValue(1));
4915 case Intrinsic::eh_sjlj_longjmp: {
4916 DAG.setRoot(DAG.getNode(ISD::EH_SJLJ_LONGJMP, sdl, MVT::Other,
4917 getRoot(), getValue(I.getArgOperand(0))));
4921 case Intrinsic::x86_mmx_pslli_w:
4922 case Intrinsic::x86_mmx_pslli_d:
4923 case Intrinsic::x86_mmx_pslli_q:
4924 case Intrinsic::x86_mmx_psrli_w:
4925 case Intrinsic::x86_mmx_psrli_d:
4926 case Intrinsic::x86_mmx_psrli_q:
4927 case Intrinsic::x86_mmx_psrai_w:
4928 case Intrinsic::x86_mmx_psrai_d: {
4929 SDValue ShAmt = getValue(I.getArgOperand(1));
4930 if (isa<ConstantSDNode>(ShAmt)) {
4931 visitTargetIntrinsic(I, Intrinsic);
4934 unsigned NewIntrinsic = 0;
4935 EVT ShAmtVT = MVT::v2i32;
4936 switch (Intrinsic) {
4937 case Intrinsic::x86_mmx_pslli_w:
4938 NewIntrinsic = Intrinsic::x86_mmx_psll_w;
4940 case Intrinsic::x86_mmx_pslli_d:
4941 NewIntrinsic = Intrinsic::x86_mmx_psll_d;
4943 case Intrinsic::x86_mmx_pslli_q:
4944 NewIntrinsic = Intrinsic::x86_mmx_psll_q;
4946 case Intrinsic::x86_mmx_psrli_w:
4947 NewIntrinsic = Intrinsic::x86_mmx_psrl_w;
4949 case Intrinsic::x86_mmx_psrli_d:
4950 NewIntrinsic = Intrinsic::x86_mmx_psrl_d;
4952 case Intrinsic::x86_mmx_psrli_q:
4953 NewIntrinsic = Intrinsic::x86_mmx_psrl_q;
4955 case Intrinsic::x86_mmx_psrai_w:
4956 NewIntrinsic = Intrinsic::x86_mmx_psra_w;
4958 case Intrinsic::x86_mmx_psrai_d:
4959 NewIntrinsic = Intrinsic::x86_mmx_psra_d;
4961 default: llvm_unreachable("Impossible intrinsic"); // Can't reach here.
4964 // The vector shift intrinsics with scalars uses 32b shift amounts but
4965 // the sse2/mmx shift instructions reads 64 bits. Set the upper 32 bits
4967 // We must do this early because v2i32 is not a legal type.
4970 ShOps[1] = DAG.getConstant(0, MVT::i32);
4971 ShAmt = DAG.getNode(ISD::BUILD_VECTOR, sdl, ShAmtVT, &ShOps[0], 2);
4972 EVT DestVT = TLI->getValueType(I.getType());
4973 ShAmt = DAG.getNode(ISD::BITCAST, sdl, DestVT, ShAmt);
4974 Res = DAG.getNode(ISD::INTRINSIC_WO_CHAIN, sdl, DestVT,
4975 DAG.getConstant(NewIntrinsic, MVT::i32),
4976 getValue(I.getArgOperand(0)), ShAmt);
4980 case Intrinsic::x86_avx_vinsertf128_pd_256:
4981 case Intrinsic::x86_avx_vinsertf128_ps_256:
4982 case Intrinsic::x86_avx_vinsertf128_si_256:
4983 case Intrinsic::x86_avx2_vinserti128: {
4984 EVT DestVT = TLI->getValueType(I.getType());
4985 EVT ElVT = TLI->getValueType(I.getArgOperand(1)->getType());
4986 uint64_t Idx = (cast<ConstantInt>(I.getArgOperand(2))->getZExtValue() & 1) *
4987 ElVT.getVectorNumElements();
4988 Res = DAG.getNode(ISD::INSERT_SUBVECTOR, sdl, DestVT,
4989 getValue(I.getArgOperand(0)),
4990 getValue(I.getArgOperand(1)),
4991 DAG.getConstant(Idx, TLI->getVectorIdxTy()));
4995 case Intrinsic::x86_avx_vextractf128_pd_256:
4996 case Intrinsic::x86_avx_vextractf128_ps_256:
4997 case Intrinsic::x86_avx_vextractf128_si_256:
4998 case Intrinsic::x86_avx2_vextracti128: {
4999 EVT DestVT = TLI->getValueType(I.getType());
5000 uint64_t Idx = (cast<ConstantInt>(I.getArgOperand(1))->getZExtValue() & 1) *
5001 DestVT.getVectorNumElements();
5002 Res = DAG.getNode(ISD::EXTRACT_SUBVECTOR, sdl, DestVT,
5003 getValue(I.getArgOperand(0)),
5004 DAG.getConstant(Idx, TLI->getVectorIdxTy()));
5008 case Intrinsic::convertff:
5009 case Intrinsic::convertfsi:
5010 case Intrinsic::convertfui:
5011 case Intrinsic::convertsif:
5012 case Intrinsic::convertuif:
5013 case Intrinsic::convertss:
5014 case Intrinsic::convertsu:
5015 case Intrinsic::convertus:
5016 case Intrinsic::convertuu: {
5017 ISD::CvtCode Code = ISD::CVT_INVALID;
5018 switch (Intrinsic) {
5019 default: llvm_unreachable("Impossible intrinsic"); // Can't reach here.
5020 case Intrinsic::convertff: Code = ISD::CVT_FF; break;
5021 case Intrinsic::convertfsi: Code = ISD::CVT_FS; break;
5022 case Intrinsic::convertfui: Code = ISD::CVT_FU; break;
5023 case Intrinsic::convertsif: Code = ISD::CVT_SF; break;
5024 case Intrinsic::convertuif: Code = ISD::CVT_UF; break;
5025 case Intrinsic::convertss: Code = ISD::CVT_SS; break;
5026 case Intrinsic::convertsu: Code = ISD::CVT_SU; break;
5027 case Intrinsic::convertus: Code = ISD::CVT_US; break;
5028 case Intrinsic::convertuu: Code = ISD::CVT_UU; break;
5030 EVT DestVT = TLI->getValueType(I.getType());
5031 const Value *Op1 = I.getArgOperand(0);
5032 Res = DAG.getConvertRndSat(DestVT, sdl, getValue(Op1),
5033 DAG.getValueType(DestVT),
5034 DAG.getValueType(getValue(Op1).getValueType()),
5035 getValue(I.getArgOperand(1)),
5036 getValue(I.getArgOperand(2)),
5041 case Intrinsic::powi:
5042 setValue(&I, ExpandPowI(sdl, getValue(I.getArgOperand(0)),
5043 getValue(I.getArgOperand(1)), DAG));
5045 case Intrinsic::log:
5046 setValue(&I, expandLog(sdl, getValue(I.getArgOperand(0)), DAG, *TLI));
5048 case Intrinsic::log2:
5049 setValue(&I, expandLog2(sdl, getValue(I.getArgOperand(0)), DAG, *TLI));
5051 case Intrinsic::log10:
5052 setValue(&I, expandLog10(sdl, getValue(I.getArgOperand(0)), DAG, *TLI));
5054 case Intrinsic::exp:
5055 setValue(&I, expandExp(sdl, getValue(I.getArgOperand(0)), DAG, *TLI));
5057 case Intrinsic::exp2:
5058 setValue(&I, expandExp2(sdl, getValue(I.getArgOperand(0)), DAG, *TLI));
5060 case Intrinsic::pow:
5061 setValue(&I, expandPow(sdl, getValue(I.getArgOperand(0)),
5062 getValue(I.getArgOperand(1)), DAG, *TLI));
5064 case Intrinsic::sqrt:
5065 case Intrinsic::fabs:
5066 case Intrinsic::sin:
5067 case Intrinsic::cos:
5068 case Intrinsic::floor:
5069 case Intrinsic::ceil:
5070 case Intrinsic::trunc:
5071 case Intrinsic::rint:
5072 case Intrinsic::nearbyint:
5073 case Intrinsic::round: {
5075 switch (Intrinsic) {
5076 default: llvm_unreachable("Impossible intrinsic"); // Can't reach here.
5077 case Intrinsic::sqrt: Opcode = ISD::FSQRT; break;
5078 case Intrinsic::fabs: Opcode = ISD::FABS; break;
5079 case Intrinsic::sin: Opcode = ISD::FSIN; break;
5080 case Intrinsic::cos: Opcode = ISD::FCOS; break;
5081 case Intrinsic::floor: Opcode = ISD::FFLOOR; break;
5082 case Intrinsic::ceil: Opcode = ISD::FCEIL; break;
5083 case Intrinsic::trunc: Opcode = ISD::FTRUNC; break;
5084 case Intrinsic::rint: Opcode = ISD::FRINT; break;
5085 case Intrinsic::nearbyint: Opcode = ISD::FNEARBYINT; break;
5086 case Intrinsic::round: Opcode = ISD::FROUND; break;
5089 setValue(&I, DAG.getNode(Opcode, sdl,
5090 getValue(I.getArgOperand(0)).getValueType(),
5091 getValue(I.getArgOperand(0))));
5094 case Intrinsic::copysign:
5095 setValue(&I, DAG.getNode(ISD::FCOPYSIGN, sdl,
5096 getValue(I.getArgOperand(0)).getValueType(),
5097 getValue(I.getArgOperand(0)),
5098 getValue(I.getArgOperand(1))));
5100 case Intrinsic::fma:
5101 setValue(&I, DAG.getNode(ISD::FMA, sdl,
5102 getValue(I.getArgOperand(0)).getValueType(),
5103 getValue(I.getArgOperand(0)),
5104 getValue(I.getArgOperand(1)),
5105 getValue(I.getArgOperand(2))));
5107 case Intrinsic::fmuladd: {
5108 EVT VT = TLI->getValueType(I.getType());
5109 if (TM.Options.AllowFPOpFusion != FPOpFusion::Strict &&
5110 TLI->isFMAFasterThanFMulAndFAdd(VT)) {
5111 setValue(&I, DAG.getNode(ISD::FMA, sdl,
5112 getValue(I.getArgOperand(0)).getValueType(),
5113 getValue(I.getArgOperand(0)),
5114 getValue(I.getArgOperand(1)),
5115 getValue(I.getArgOperand(2))));
5117 SDValue Mul = DAG.getNode(ISD::FMUL, sdl,
5118 getValue(I.getArgOperand(0)).getValueType(),
5119 getValue(I.getArgOperand(0)),
5120 getValue(I.getArgOperand(1)));
5121 SDValue Add = DAG.getNode(ISD::FADD, sdl,
5122 getValue(I.getArgOperand(0)).getValueType(),
5124 getValue(I.getArgOperand(2)));
5129 case Intrinsic::convert_to_fp16:
5130 setValue(&I, DAG.getNode(ISD::FP32_TO_FP16, sdl,
5131 MVT::i16, getValue(I.getArgOperand(0))));
5133 case Intrinsic::convert_from_fp16:
5134 setValue(&I, DAG.getNode(ISD::FP16_TO_FP32, sdl,
5135 MVT::f32, getValue(I.getArgOperand(0))));
5137 case Intrinsic::pcmarker: {
5138 SDValue Tmp = getValue(I.getArgOperand(0));
5139 DAG.setRoot(DAG.getNode(ISD::PCMARKER, sdl, MVT::Other, getRoot(), Tmp));
5142 case Intrinsic::readcyclecounter: {
5143 SDValue Op = getRoot();
5144 Res = DAG.getNode(ISD::READCYCLECOUNTER, sdl,
5145 DAG.getVTList(MVT::i64, MVT::Other),
5148 DAG.setRoot(Res.getValue(1));
5151 case Intrinsic::bswap:
5152 setValue(&I, DAG.getNode(ISD::BSWAP, sdl,
5153 getValue(I.getArgOperand(0)).getValueType(),
5154 getValue(I.getArgOperand(0))));
5156 case Intrinsic::cttz: {
5157 SDValue Arg = getValue(I.getArgOperand(0));
5158 ConstantInt *CI = cast<ConstantInt>(I.getArgOperand(1));
5159 EVT Ty = Arg.getValueType();
5160 setValue(&I, DAG.getNode(CI->isZero() ? ISD::CTTZ : ISD::CTTZ_ZERO_UNDEF,
5164 case Intrinsic::ctlz: {
5165 SDValue Arg = getValue(I.getArgOperand(0));
5166 ConstantInt *CI = cast<ConstantInt>(I.getArgOperand(1));
5167 EVT Ty = Arg.getValueType();
5168 setValue(&I, DAG.getNode(CI->isZero() ? ISD::CTLZ : ISD::CTLZ_ZERO_UNDEF,
5172 case Intrinsic::ctpop: {
5173 SDValue Arg = getValue(I.getArgOperand(0));
5174 EVT Ty = Arg.getValueType();
5175 setValue(&I, DAG.getNode(ISD::CTPOP, sdl, Ty, Arg));
5178 case Intrinsic::stacksave: {
5179 SDValue Op = getRoot();
5180 Res = DAG.getNode(ISD::STACKSAVE, sdl,
5181 DAG.getVTList(TLI->getPointerTy(), MVT::Other), &Op, 1);
5183 DAG.setRoot(Res.getValue(1));
5186 case Intrinsic::stackrestore: {
5187 Res = getValue(I.getArgOperand(0));
5188 DAG.setRoot(DAG.getNode(ISD::STACKRESTORE, sdl, MVT::Other, getRoot(), Res));
5191 case Intrinsic::stackprotector: {
5192 // Emit code into the DAG to store the stack guard onto the stack.
5193 MachineFunction &MF = DAG.getMachineFunction();
5194 MachineFrameInfo *MFI = MF.getFrameInfo();
5195 EVT PtrTy = TLI->getPointerTy();
5197 SDValue Src = getValue(I.getArgOperand(0)); // The guard's value.
5198 AllocaInst *Slot = cast<AllocaInst>(I.getArgOperand(1));
5200 int FI = FuncInfo.StaticAllocaMap[Slot];
5201 MFI->setStackProtectorIndex(FI);
5203 SDValue FIN = DAG.getFrameIndex(FI, PtrTy);
5205 // Store the stack protector onto the stack.
5206 Res = DAG.getStore(getRoot(), sdl, Src, FIN,
5207 MachinePointerInfo::getFixedStack(FI),
5213 case Intrinsic::objectsize: {
5214 // If we don't know by now, we're never going to know.
5215 ConstantInt *CI = dyn_cast<ConstantInt>(I.getArgOperand(1));
5217 assert(CI && "Non-constant type in __builtin_object_size?");
5219 SDValue Arg = getValue(I.getCalledValue());
5220 EVT Ty = Arg.getValueType();
5223 Res = DAG.getConstant(-1ULL, Ty);
5225 Res = DAG.getConstant(0, Ty);
5230 case Intrinsic::annotation:
5231 case Intrinsic::ptr_annotation:
5232 // Drop the intrinsic, but forward the value
5233 setValue(&I, getValue(I.getOperand(0)));
5235 case Intrinsic::var_annotation:
5236 // Discard annotate attributes
5239 case Intrinsic::init_trampoline: {
5240 const Function *F = cast<Function>(I.getArgOperand(1)->stripPointerCasts());
5244 Ops[1] = getValue(I.getArgOperand(0));
5245 Ops[2] = getValue(I.getArgOperand(1));
5246 Ops[3] = getValue(I.getArgOperand(2));
5247 Ops[4] = DAG.getSrcValue(I.getArgOperand(0));
5248 Ops[5] = DAG.getSrcValue(F);
5250 Res = DAG.getNode(ISD::INIT_TRAMPOLINE, sdl, MVT::Other, Ops, 6);
5255 case Intrinsic::adjust_trampoline: {
5256 setValue(&I, DAG.getNode(ISD::ADJUST_TRAMPOLINE, sdl,
5257 TLI->getPointerTy(),
5258 getValue(I.getArgOperand(0))));
5261 case Intrinsic::gcroot:
5263 const Value *Alloca = I.getArgOperand(0)->stripPointerCasts();
5264 const Constant *TypeMap = cast<Constant>(I.getArgOperand(1));
5266 FrameIndexSDNode *FI = cast<FrameIndexSDNode>(getValue(Alloca).getNode());
5267 GFI->addStackRoot(FI->getIndex(), TypeMap);
5270 case Intrinsic::gcread:
5271 case Intrinsic::gcwrite:
5272 llvm_unreachable("GC failed to lower gcread/gcwrite intrinsics!");
5273 case Intrinsic::flt_rounds:
5274 setValue(&I, DAG.getNode(ISD::FLT_ROUNDS_, sdl, MVT::i32));
5277 case Intrinsic::expect: {
5278 // Just replace __builtin_expect(exp, c) with EXP.
5279 setValue(&I, getValue(I.getArgOperand(0)));
5283 case Intrinsic::debugtrap:
5284 case Intrinsic::trap: {
5285 StringRef TrapFuncName = TM.Options.getTrapFunctionName();
5286 if (TrapFuncName.empty()) {
5287 ISD::NodeType Op = (Intrinsic == Intrinsic::trap) ?
5288 ISD::TRAP : ISD::DEBUGTRAP;
5289 DAG.setRoot(DAG.getNode(Op, sdl,MVT::Other, getRoot()));
5292 TargetLowering::ArgListTy Args;
5294 CallLoweringInfo CLI(getRoot(), I.getType(),
5295 false, false, false, false, 0, CallingConv::C,
5296 /*isTailCall=*/false,
5297 /*doesNotRet=*/false, /*isReturnValueUsed=*/true,
5298 DAG.getExternalSymbol(TrapFuncName.data(),
5299 TLI->getPointerTy()),
5301 std::pair<SDValue, SDValue> Result = TLI->LowerCallTo(CLI);
5302 DAG.setRoot(Result.second);
5306 case Intrinsic::uadd_with_overflow:
5307 case Intrinsic::sadd_with_overflow:
5308 case Intrinsic::usub_with_overflow:
5309 case Intrinsic::ssub_with_overflow:
5310 case Intrinsic::umul_with_overflow:
5311 case Intrinsic::smul_with_overflow: {
5313 switch (Intrinsic) {
5314 default: llvm_unreachable("Impossible intrinsic"); // Can't reach here.
5315 case Intrinsic::uadd_with_overflow: Op = ISD::UADDO; break;
5316 case Intrinsic::sadd_with_overflow: Op = ISD::SADDO; break;
5317 case Intrinsic::usub_with_overflow: Op = ISD::USUBO; break;
5318 case Intrinsic::ssub_with_overflow: Op = ISD::SSUBO; break;
5319 case Intrinsic::umul_with_overflow: Op = ISD::UMULO; break;
5320 case Intrinsic::smul_with_overflow: Op = ISD::SMULO; break;
5322 SDValue Op1 = getValue(I.getArgOperand(0));
5323 SDValue Op2 = getValue(I.getArgOperand(1));
5325 SDVTList VTs = DAG.getVTList(Op1.getValueType(), MVT::i1);
5326 setValue(&I, DAG.getNode(Op, sdl, VTs, Op1, Op2));
5329 case Intrinsic::prefetch: {
5331 unsigned rw = cast<ConstantInt>(I.getArgOperand(1))->getZExtValue();
5333 Ops[1] = getValue(I.getArgOperand(0));
5334 Ops[2] = getValue(I.getArgOperand(1));
5335 Ops[3] = getValue(I.getArgOperand(2));
5336 Ops[4] = getValue(I.getArgOperand(3));
5337 DAG.setRoot(DAG.getMemIntrinsicNode(ISD::PREFETCH, sdl,
5338 DAG.getVTList(MVT::Other),
5340 EVT::getIntegerVT(*Context, 8),
5341 MachinePointerInfo(I.getArgOperand(0)),
5343 false, /* volatile */
5345 rw==1)); /* write */
5348 case Intrinsic::lifetime_start:
5349 case Intrinsic::lifetime_end: {
5350 bool IsStart = (Intrinsic == Intrinsic::lifetime_start);
5351 // Stack coloring is not enabled in O0, discard region information.
5352 if (TM.getOptLevel() == CodeGenOpt::None)
5355 SmallVector<Value *, 4> Allocas;
5356 GetUnderlyingObjects(I.getArgOperand(1), Allocas, DL);
5358 for (SmallVectorImpl<Value*>::iterator Object = Allocas.begin(),
5359 E = Allocas.end(); Object != E; ++Object) {
5360 AllocaInst *LifetimeObject = dyn_cast_or_null<AllocaInst>(*Object);
5362 // Could not find an Alloca.
5363 if (!LifetimeObject)
5366 int FI = FuncInfo.StaticAllocaMap[LifetimeObject];
5370 Ops[1] = DAG.getFrameIndex(FI, TLI->getPointerTy(), true);
5371 unsigned Opcode = (IsStart ? ISD::LIFETIME_START : ISD::LIFETIME_END);
5373 Res = DAG.getNode(Opcode, sdl, MVT::Other, Ops, 2);
5378 case Intrinsic::invariant_start:
5379 // Discard region information.
5380 setValue(&I, DAG.getUNDEF(TLI->getPointerTy()));
5382 case Intrinsic::invariant_end:
5383 // Discard region information.
5385 case Intrinsic::stackprotectorcheck: {
5386 // Do not actually emit anything for this basic block. Instead we initialize
5387 // the stack protector descriptor and export the guard variable so we can
5388 // access it in FinishBasicBlock.
5389 const BasicBlock *BB = I.getParent();
5390 SPDescriptor.initialize(BB, FuncInfo.MBBMap[BB], I);
5391 ExportFromCurrentBlock(SPDescriptor.getGuard());
5393 // Flush our exports since we are going to process a terminator.
5394 (void)getControlRoot();
5397 case Intrinsic::donothing:
5400 case Intrinsic::experimental_stackmap: {
5404 case Intrinsic::experimental_patchpoint_void:
5405 case Intrinsic::experimental_patchpoint_i64: {
5412 void SelectionDAGBuilder::LowerCallTo(ImmutableCallSite CS, SDValue Callee,
5414 MachineBasicBlock *LandingPad) {
5415 PointerType *PT = cast<PointerType>(CS.getCalledValue()->getType());
5416 FunctionType *FTy = cast<FunctionType>(PT->getElementType());
5417 Type *RetTy = FTy->getReturnType();
5418 MachineModuleInfo &MMI = DAG.getMachineFunction().getMMI();
5419 MCSymbol *BeginLabel = 0;
5421 TargetLowering::ArgListTy Args;
5422 TargetLowering::ArgListEntry Entry;
5423 Args.reserve(CS.arg_size());
5425 // Check whether the function can return without sret-demotion.
5426 SmallVector<ISD::OutputArg, 4> Outs;
5427 const TargetLowering *TLI = TM.getTargetLowering();
5428 GetReturnInfo(RetTy, CS.getAttributes(), Outs, *TLI);
5430 bool CanLowerReturn = TLI->CanLowerReturn(CS.getCallingConv(),
5431 DAG.getMachineFunction(),
5432 FTy->isVarArg(), Outs,
5435 SDValue DemoteStackSlot;
5436 int DemoteStackIdx = -100;
5438 if (!CanLowerReturn) {
5439 assert(!CS.hasInAllocaArgument() &&
5440 "sret demotion is incompatible with inalloca");
5441 uint64_t TySize = TLI->getDataLayout()->getTypeAllocSize(
5442 FTy->getReturnType());
5443 unsigned Align = TLI->getDataLayout()->getPrefTypeAlignment(
5444 FTy->getReturnType());
5445 MachineFunction &MF = DAG.getMachineFunction();
5446 DemoteStackIdx = MF.getFrameInfo()->CreateStackObject(TySize, Align, false);
5447 Type *StackSlotPtrType = PointerType::getUnqual(FTy->getReturnType());
5449 DemoteStackSlot = DAG.getFrameIndex(DemoteStackIdx, TLI->getPointerTy());
5450 Entry.Node = DemoteStackSlot;
5451 Entry.Ty = StackSlotPtrType;
5452 Entry.isSExt = false;
5453 Entry.isZExt = false;
5454 Entry.isInReg = false;
5455 Entry.isSRet = true;
5456 Entry.isNest = false;
5457 Entry.isByVal = false;
5458 Entry.isReturned = false;
5459 Entry.Alignment = Align;
5460 Args.push_back(Entry);
5461 RetTy = Type::getVoidTy(FTy->getContext());
5464 for (ImmutableCallSite::arg_iterator i = CS.arg_begin(), e = CS.arg_end();
5466 const Value *V = *i;
5469 if (V->getType()->isEmptyTy())
5472 SDValue ArgNode = getValue(V);
5473 Entry.Node = ArgNode; Entry.Ty = V->getType();
5475 // Skip the first return-type Attribute to get to params.
5476 Entry.setAttributes(&CS, i - CS.arg_begin() + 1);
5477 Args.push_back(Entry);
5481 // Insert a label before the invoke call to mark the try range. This can be
5482 // used to detect deletion of the invoke via the MachineModuleInfo.
5483 BeginLabel = MMI.getContext().CreateTempSymbol();
5485 // For SjLj, keep track of which landing pads go with which invokes
5486 // so as to maintain the ordering of pads in the LSDA.
5487 unsigned CallSiteIndex = MMI.getCurrentCallSite();
5488 if (CallSiteIndex) {
5489 MMI.setCallSiteBeginLabel(BeginLabel, CallSiteIndex);
5490 LPadToCallSiteMap[LandingPad].push_back(CallSiteIndex);
5492 // Now that the call site is handled, stop tracking it.
5493 MMI.setCurrentCallSite(0);
5496 // Both PendingLoads and PendingExports must be flushed here;
5497 // this call might not return.
5499 DAG.setRoot(DAG.getEHLabel(getCurSDLoc(), getControlRoot(), BeginLabel));
5502 // Check if target-independent constraints permit a tail call here.
5503 // Target-dependent constraints are checked within TLI->LowerCallTo.
5504 if (isTailCall && !isInTailCallPosition(CS, *TLI))
5508 CallLoweringInfo CLI(getRoot(), RetTy, FTy, isTailCall, Callee, Args, DAG,
5510 std::pair<SDValue,SDValue> Result = TLI->LowerCallTo(CLI);
5511 assert((isTailCall || Result.second.getNode()) &&
5512 "Non-null chain expected with non-tail call!");
5513 assert((Result.second.getNode() || !Result.first.getNode()) &&
5514 "Null value expected with tail call!");
5515 if (Result.first.getNode()) {
5516 setValue(CS.getInstruction(), Result.first);
5517 } else if (!CanLowerReturn && Result.second.getNode()) {
5518 // The instruction result is the result of loading from the
5519 // hidden sret parameter.
5520 SmallVector<EVT, 1> PVTs;
5521 Type *PtrRetTy = PointerType::getUnqual(FTy->getReturnType());
5523 ComputeValueVTs(*TLI, PtrRetTy, PVTs);
5524 assert(PVTs.size() == 1 && "Pointers should fit in one register");
5525 EVT PtrVT = PVTs[0];
5527 SmallVector<EVT, 4> RetTys;
5528 SmallVector<uint64_t, 4> Offsets;
5529 RetTy = FTy->getReturnType();
5530 ComputeValueVTs(*TLI, RetTy, RetTys, &Offsets);
5532 unsigned NumValues = RetTys.size();
5533 SmallVector<SDValue, 4> Values(NumValues);
5534 SmallVector<SDValue, 4> Chains(NumValues);
5536 for (unsigned i = 0; i < NumValues; ++i) {
5537 SDValue Add = DAG.getNode(ISD::ADD, getCurSDLoc(), PtrVT,
5539 DAG.getConstant(Offsets[i], PtrVT));
5540 SDValue L = DAG.getLoad(RetTys[i], getCurSDLoc(), Result.second, Add,
5541 MachinePointerInfo::getFixedStack(DemoteStackIdx, Offsets[i]),
5542 false, false, false, 1);
5544 Chains[i] = L.getValue(1);
5547 SDValue Chain = DAG.getNode(ISD::TokenFactor, getCurSDLoc(),
5548 MVT::Other, &Chains[0], NumValues);
5549 PendingLoads.push_back(Chain);
5551 setValue(CS.getInstruction(),
5552 DAG.getNode(ISD::MERGE_VALUES, getCurSDLoc(),
5553 DAG.getVTList(&RetTys[0], RetTys.size()),
5554 &Values[0], Values.size()));
5557 if (!Result.second.getNode()) {
5558 // As a special case, a null chain means that a tail call has been emitted
5559 // and the DAG root is already updated.
5562 // Since there's no actual continuation from this block, nothing can be
5563 // relying on us setting vregs for them.
5564 PendingExports.clear();
5566 DAG.setRoot(Result.second);
5570 // Insert a label at the end of the invoke call to mark the try range. This
5571 // can be used to detect deletion of the invoke via the MachineModuleInfo.
5572 MCSymbol *EndLabel = MMI.getContext().CreateTempSymbol();
5573 DAG.setRoot(DAG.getEHLabel(getCurSDLoc(), getRoot(), EndLabel));
5575 // Inform MachineModuleInfo of range.
5576 MMI.addInvoke(LandingPad, BeginLabel, EndLabel);
5580 /// IsOnlyUsedInZeroEqualityComparison - Return true if it only matters that the
5581 /// value is equal or not-equal to zero.
5582 static bool IsOnlyUsedInZeroEqualityComparison(const Value *V) {
5583 for (const User *U : V->users()) {
5584 if (const ICmpInst *IC = dyn_cast<ICmpInst>(U))
5585 if (IC->isEquality())
5586 if (const Constant *C = dyn_cast<Constant>(IC->getOperand(1)))
5587 if (C->isNullValue())
5589 // Unknown instruction.
5595 static SDValue getMemCmpLoad(const Value *PtrVal, MVT LoadVT,
5597 SelectionDAGBuilder &Builder) {
5599 // Check to see if this load can be trivially constant folded, e.g. if the
5600 // input is from a string literal.
5601 if (const Constant *LoadInput = dyn_cast<Constant>(PtrVal)) {
5602 // Cast pointer to the type we really want to load.
5603 LoadInput = ConstantExpr::getBitCast(const_cast<Constant *>(LoadInput),
5604 PointerType::getUnqual(LoadTy));
5606 if (const Constant *LoadCst =
5607 ConstantFoldLoadFromConstPtr(const_cast<Constant *>(LoadInput),
5609 return Builder.getValue(LoadCst);
5612 // Otherwise, we have to emit the load. If the pointer is to unfoldable but
5613 // still constant memory, the input chain can be the entry node.
5615 bool ConstantMemory = false;
5617 // Do not serialize (non-volatile) loads of constant memory with anything.
5618 if (Builder.AA->pointsToConstantMemory(PtrVal)) {
5619 Root = Builder.DAG.getEntryNode();
5620 ConstantMemory = true;
5622 // Do not serialize non-volatile loads against each other.
5623 Root = Builder.DAG.getRoot();
5626 SDValue Ptr = Builder.getValue(PtrVal);
5627 SDValue LoadVal = Builder.DAG.getLoad(LoadVT, Builder.getCurSDLoc(), Root,
5628 Ptr, MachinePointerInfo(PtrVal),
5630 false /*nontemporal*/,
5631 false /*isinvariant*/, 1 /* align=1 */);
5633 if (!ConstantMemory)
5634 Builder.PendingLoads.push_back(LoadVal.getValue(1));
5638 /// processIntegerCallValue - Record the value for an instruction that
5639 /// produces an integer result, converting the type where necessary.
5640 void SelectionDAGBuilder::processIntegerCallValue(const Instruction &I,
5643 EVT VT = TM.getTargetLowering()->getValueType(I.getType(), true);
5645 Value = DAG.getSExtOrTrunc(Value, getCurSDLoc(), VT);
5647 Value = DAG.getZExtOrTrunc(Value, getCurSDLoc(), VT);
5648 setValue(&I, Value);
5651 /// visitMemCmpCall - See if we can lower a call to memcmp in an optimized form.
5652 /// If so, return true and lower it, otherwise return false and it will be
5653 /// lowered like a normal call.
5654 bool SelectionDAGBuilder::visitMemCmpCall(const CallInst &I) {
5655 // Verify that the prototype makes sense. int memcmp(void*,void*,size_t)
5656 if (I.getNumArgOperands() != 3)
5659 const Value *LHS = I.getArgOperand(0), *RHS = I.getArgOperand(1);
5660 if (!LHS->getType()->isPointerTy() || !RHS->getType()->isPointerTy() ||
5661 !I.getArgOperand(2)->getType()->isIntegerTy() ||
5662 !I.getType()->isIntegerTy())
5665 const Value *Size = I.getArgOperand(2);
5666 const ConstantInt *CSize = dyn_cast<ConstantInt>(Size);
5667 if (CSize && CSize->getZExtValue() == 0) {
5668 EVT CallVT = TM.getTargetLowering()->getValueType(I.getType(), true);
5669 setValue(&I, DAG.getConstant(0, CallVT));
5673 const TargetSelectionDAGInfo &TSI = DAG.getSelectionDAGInfo();
5674 std::pair<SDValue, SDValue> Res =
5675 TSI.EmitTargetCodeForMemcmp(DAG, getCurSDLoc(), DAG.getRoot(),
5676 getValue(LHS), getValue(RHS), getValue(Size),
5677 MachinePointerInfo(LHS),
5678 MachinePointerInfo(RHS));
5679 if (Res.first.getNode()) {
5680 processIntegerCallValue(I, Res.first, true);
5681 PendingLoads.push_back(Res.second);
5685 // memcmp(S1,S2,2) != 0 -> (*(short*)LHS != *(short*)RHS) != 0
5686 // memcmp(S1,S2,4) != 0 -> (*(int*)LHS != *(int*)RHS) != 0
5687 if (CSize && IsOnlyUsedInZeroEqualityComparison(&I)) {
5688 bool ActuallyDoIt = true;
5691 switch (CSize->getZExtValue()) {
5693 LoadVT = MVT::Other;
5695 ActuallyDoIt = false;
5699 LoadTy = Type::getInt16Ty(CSize->getContext());
5703 LoadTy = Type::getInt32Ty(CSize->getContext());
5707 LoadTy = Type::getInt64Ty(CSize->getContext());
5711 LoadVT = MVT::v4i32;
5712 LoadTy = Type::getInt32Ty(CSize->getContext());
5713 LoadTy = VectorType::get(LoadTy, 4);
5718 // This turns into unaligned loads. We only do this if the target natively
5719 // supports the MVT we'll be loading or if it is small enough (<= 4) that
5720 // we'll only produce a small number of byte loads.
5722 // Require that we can find a legal MVT, and only do this if the target
5723 // supports unaligned loads of that type. Expanding into byte loads would
5725 const TargetLowering *TLI = TM.getTargetLowering();
5726 if (ActuallyDoIt && CSize->getZExtValue() > 4) {
5727 unsigned DstAS = LHS->getType()->getPointerAddressSpace();
5728 unsigned SrcAS = RHS->getType()->getPointerAddressSpace();
5729 // TODO: Handle 5 byte compare as 4-byte + 1 byte.
5730 // TODO: Handle 8 byte compare on x86-32 as two 32-bit loads.
5731 if (!TLI->isTypeLegal(LoadVT) ||
5732 !TLI->allowsUnalignedMemoryAccesses(LoadVT, SrcAS) ||
5733 !TLI->allowsUnalignedMemoryAccesses(LoadVT, DstAS))
5734 ActuallyDoIt = false;
5738 SDValue LHSVal = getMemCmpLoad(LHS, LoadVT, LoadTy, *this);
5739 SDValue RHSVal = getMemCmpLoad(RHS, LoadVT, LoadTy, *this);
5741 SDValue Res = DAG.getSetCC(getCurSDLoc(), MVT::i1, LHSVal, RHSVal,
5743 processIntegerCallValue(I, Res, false);
5752 /// visitMemChrCall -- See if we can lower a memchr call into an optimized
5753 /// form. If so, return true and lower it, otherwise return false and it
5754 /// will be lowered like a normal call.
5755 bool SelectionDAGBuilder::visitMemChrCall(const CallInst &I) {
5756 // Verify that the prototype makes sense. void *memchr(void *, int, size_t)
5757 if (I.getNumArgOperands() != 3)
5760 const Value *Src = I.getArgOperand(0);
5761 const Value *Char = I.getArgOperand(1);
5762 const Value *Length = I.getArgOperand(2);
5763 if (!Src->getType()->isPointerTy() ||
5764 !Char->getType()->isIntegerTy() ||
5765 !Length->getType()->isIntegerTy() ||
5766 !I.getType()->isPointerTy())
5769 const TargetSelectionDAGInfo &TSI = DAG.getSelectionDAGInfo();
5770 std::pair<SDValue, SDValue> Res =
5771 TSI.EmitTargetCodeForMemchr(DAG, getCurSDLoc(), DAG.getRoot(),
5772 getValue(Src), getValue(Char), getValue(Length),
5773 MachinePointerInfo(Src));
5774 if (Res.first.getNode()) {
5775 setValue(&I, Res.first);
5776 PendingLoads.push_back(Res.second);
5783 /// visitStrCpyCall -- See if we can lower a strcpy or stpcpy call into an
5784 /// optimized form. If so, return true and lower it, otherwise return false
5785 /// and it will be lowered like a normal call.
5786 bool SelectionDAGBuilder::visitStrCpyCall(const CallInst &I, bool isStpcpy) {
5787 // Verify that the prototype makes sense. char *strcpy(char *, char *)
5788 if (I.getNumArgOperands() != 2)
5791 const Value *Arg0 = I.getArgOperand(0), *Arg1 = I.getArgOperand(1);
5792 if (!Arg0->getType()->isPointerTy() ||
5793 !Arg1->getType()->isPointerTy() ||
5794 !I.getType()->isPointerTy())
5797 const TargetSelectionDAGInfo &TSI = DAG.getSelectionDAGInfo();
5798 std::pair<SDValue, SDValue> Res =
5799 TSI.EmitTargetCodeForStrcpy(DAG, getCurSDLoc(), getRoot(),
5800 getValue(Arg0), getValue(Arg1),
5801 MachinePointerInfo(Arg0),
5802 MachinePointerInfo(Arg1), isStpcpy);
5803 if (Res.first.getNode()) {
5804 setValue(&I, Res.first);
5805 DAG.setRoot(Res.second);
5812 /// visitStrCmpCall - See if we can lower a call to strcmp in an optimized form.
5813 /// If so, return true and lower it, otherwise return false and it will be
5814 /// lowered like a normal call.
5815 bool SelectionDAGBuilder::visitStrCmpCall(const CallInst &I) {
5816 // Verify that the prototype makes sense. int strcmp(void*,void*)
5817 if (I.getNumArgOperands() != 2)
5820 const Value *Arg0 = I.getArgOperand(0), *Arg1 = I.getArgOperand(1);
5821 if (!Arg0->getType()->isPointerTy() ||
5822 !Arg1->getType()->isPointerTy() ||
5823 !I.getType()->isIntegerTy())
5826 const TargetSelectionDAGInfo &TSI = DAG.getSelectionDAGInfo();
5827 std::pair<SDValue, SDValue> Res =
5828 TSI.EmitTargetCodeForStrcmp(DAG, getCurSDLoc(), DAG.getRoot(),
5829 getValue(Arg0), getValue(Arg1),
5830 MachinePointerInfo(Arg0),
5831 MachinePointerInfo(Arg1));
5832 if (Res.first.getNode()) {
5833 processIntegerCallValue(I, Res.first, true);
5834 PendingLoads.push_back(Res.second);
5841 /// visitStrLenCall -- See if we can lower a strlen call into an optimized
5842 /// form. If so, return true and lower it, otherwise return false and it
5843 /// will be lowered like a normal call.
5844 bool SelectionDAGBuilder::visitStrLenCall(const CallInst &I) {
5845 // Verify that the prototype makes sense. size_t strlen(char *)
5846 if (I.getNumArgOperands() != 1)
5849 const Value *Arg0 = I.getArgOperand(0);
5850 if (!Arg0->getType()->isPointerTy() || !I.getType()->isIntegerTy())
5853 const TargetSelectionDAGInfo &TSI = DAG.getSelectionDAGInfo();
5854 std::pair<SDValue, SDValue> Res =
5855 TSI.EmitTargetCodeForStrlen(DAG, getCurSDLoc(), DAG.getRoot(),
5856 getValue(Arg0), MachinePointerInfo(Arg0));
5857 if (Res.first.getNode()) {
5858 processIntegerCallValue(I, Res.first, false);
5859 PendingLoads.push_back(Res.second);
5866 /// visitStrNLenCall -- See if we can lower a strnlen call into an optimized
5867 /// form. If so, return true and lower it, otherwise return false and it
5868 /// will be lowered like a normal call.
5869 bool SelectionDAGBuilder::visitStrNLenCall(const CallInst &I) {
5870 // Verify that the prototype makes sense. size_t strnlen(char *, size_t)
5871 if (I.getNumArgOperands() != 2)
5874 const Value *Arg0 = I.getArgOperand(0), *Arg1 = I.getArgOperand(1);
5875 if (!Arg0->getType()->isPointerTy() ||
5876 !Arg1->getType()->isIntegerTy() ||
5877 !I.getType()->isIntegerTy())
5880 const TargetSelectionDAGInfo &TSI = DAG.getSelectionDAGInfo();
5881 std::pair<SDValue, SDValue> Res =
5882 TSI.EmitTargetCodeForStrnlen(DAG, getCurSDLoc(), DAG.getRoot(),
5883 getValue(Arg0), getValue(Arg1),
5884 MachinePointerInfo(Arg0));
5885 if (Res.first.getNode()) {
5886 processIntegerCallValue(I, Res.first, false);
5887 PendingLoads.push_back(Res.second);
5894 /// visitUnaryFloatCall - If a call instruction is a unary floating-point
5895 /// operation (as expected), translate it to an SDNode with the specified opcode
5896 /// and return true.
5897 bool SelectionDAGBuilder::visitUnaryFloatCall(const CallInst &I,
5899 // Sanity check that it really is a unary floating-point call.
5900 if (I.getNumArgOperands() != 1 ||
5901 !I.getArgOperand(0)->getType()->isFloatingPointTy() ||
5902 I.getType() != I.getArgOperand(0)->getType() ||
5903 !I.onlyReadsMemory())
5906 SDValue Tmp = getValue(I.getArgOperand(0));
5907 setValue(&I, DAG.getNode(Opcode, getCurSDLoc(), Tmp.getValueType(), Tmp));
5911 void SelectionDAGBuilder::visitCall(const CallInst &I) {
5912 // Handle inline assembly differently.
5913 if (isa<InlineAsm>(I.getCalledValue())) {
5918 MachineModuleInfo &MMI = DAG.getMachineFunction().getMMI();
5919 ComputeUsesVAFloatArgument(I, &MMI);
5921 const char *RenameFn = 0;
5922 if (Function *F = I.getCalledFunction()) {
5923 if (F->isDeclaration()) {
5924 if (const TargetIntrinsicInfo *II = TM.getIntrinsicInfo()) {
5925 if (unsigned IID = II->getIntrinsicID(F)) {
5926 RenameFn = visitIntrinsicCall(I, IID);
5931 if (unsigned IID = F->getIntrinsicID()) {
5932 RenameFn = visitIntrinsicCall(I, IID);
5938 // Check for well-known libc/libm calls. If the function is internal, it
5939 // can't be a library call.
5941 if (!F->hasLocalLinkage() && F->hasName() &&
5942 LibInfo->getLibFunc(F->getName(), Func) &&
5943 LibInfo->hasOptimizedCodeGen(Func)) {
5946 case LibFunc::copysign:
5947 case LibFunc::copysignf:
5948 case LibFunc::copysignl:
5949 if (I.getNumArgOperands() == 2 && // Basic sanity checks.
5950 I.getArgOperand(0)->getType()->isFloatingPointTy() &&
5951 I.getType() == I.getArgOperand(0)->getType() &&
5952 I.getType() == I.getArgOperand(1)->getType() &&
5953 I.onlyReadsMemory()) {
5954 SDValue LHS = getValue(I.getArgOperand(0));
5955 SDValue RHS = getValue(I.getArgOperand(1));
5956 setValue(&I, DAG.getNode(ISD::FCOPYSIGN, getCurSDLoc(),
5957 LHS.getValueType(), LHS, RHS));
5962 case LibFunc::fabsf:
5963 case LibFunc::fabsl:
5964 if (visitUnaryFloatCall(I, ISD::FABS))
5970 if (visitUnaryFloatCall(I, ISD::FSIN))
5976 if (visitUnaryFloatCall(I, ISD::FCOS))
5980 case LibFunc::sqrtf:
5981 case LibFunc::sqrtl:
5982 case LibFunc::sqrt_finite:
5983 case LibFunc::sqrtf_finite:
5984 case LibFunc::sqrtl_finite:
5985 if (visitUnaryFloatCall(I, ISD::FSQRT))
5988 case LibFunc::floor:
5989 case LibFunc::floorf:
5990 case LibFunc::floorl:
5991 if (visitUnaryFloatCall(I, ISD::FFLOOR))
5994 case LibFunc::nearbyint:
5995 case LibFunc::nearbyintf:
5996 case LibFunc::nearbyintl:
5997 if (visitUnaryFloatCall(I, ISD::FNEARBYINT))
6001 case LibFunc::ceilf:
6002 case LibFunc::ceill:
6003 if (visitUnaryFloatCall(I, ISD::FCEIL))
6007 case LibFunc::rintf:
6008 case LibFunc::rintl:
6009 if (visitUnaryFloatCall(I, ISD::FRINT))
6012 case LibFunc::round:
6013 case LibFunc::roundf:
6014 case LibFunc::roundl:
6015 if (visitUnaryFloatCall(I, ISD::FROUND))
6018 case LibFunc::trunc:
6019 case LibFunc::truncf:
6020 case LibFunc::truncl:
6021 if (visitUnaryFloatCall(I, ISD::FTRUNC))
6025 case LibFunc::log2f:
6026 case LibFunc::log2l:
6027 if (visitUnaryFloatCall(I, ISD::FLOG2))
6031 case LibFunc::exp2f:
6032 case LibFunc::exp2l:
6033 if (visitUnaryFloatCall(I, ISD::FEXP2))
6036 case LibFunc::memcmp:
6037 if (visitMemCmpCall(I))
6040 case LibFunc::memchr:
6041 if (visitMemChrCall(I))
6044 case LibFunc::strcpy:
6045 if (visitStrCpyCall(I, false))
6048 case LibFunc::stpcpy:
6049 if (visitStrCpyCall(I, true))
6052 case LibFunc::strcmp:
6053 if (visitStrCmpCall(I))
6056 case LibFunc::strlen:
6057 if (visitStrLenCall(I))
6060 case LibFunc::strnlen:
6061 if (visitStrNLenCall(I))
6070 Callee = getValue(I.getCalledValue());
6072 Callee = DAG.getExternalSymbol(RenameFn,
6073 TM.getTargetLowering()->getPointerTy());
6075 // Check if we can potentially perform a tail call. More detailed checking is
6076 // be done within LowerCallTo, after more information about the call is known.
6077 LowerCallTo(&I, Callee, I.isTailCall());
6082 /// AsmOperandInfo - This contains information for each constraint that we are
6084 class SDISelAsmOperandInfo : public TargetLowering::AsmOperandInfo {
6086 /// CallOperand - If this is the result output operand or a clobber
6087 /// this is null, otherwise it is the incoming operand to the CallInst.
6088 /// This gets modified as the asm is processed.
6089 SDValue CallOperand;
6091 /// AssignedRegs - If this is a register or register class operand, this
6092 /// contains the set of register corresponding to the operand.
6093 RegsForValue AssignedRegs;
6095 explicit SDISelAsmOperandInfo(const TargetLowering::AsmOperandInfo &info)
6096 : TargetLowering::AsmOperandInfo(info), CallOperand(0,0) {
6099 /// getCallOperandValEVT - Return the EVT of the Value* that this operand
6100 /// corresponds to. If there is no Value* for this operand, it returns
6102 EVT getCallOperandValEVT(LLVMContext &Context,
6103 const TargetLowering &TLI,
6104 const DataLayout *DL) const {
6105 if (CallOperandVal == 0) return MVT::Other;
6107 if (isa<BasicBlock>(CallOperandVal))
6108 return TLI.getPointerTy();
6110 llvm::Type *OpTy = CallOperandVal->getType();
6112 // FIXME: code duplicated from TargetLowering::ParseConstraints().
6113 // If this is an indirect operand, the operand is a pointer to the
6116 llvm::PointerType *PtrTy = dyn_cast<PointerType>(OpTy);
6118 report_fatal_error("Indirect operand for inline asm not a pointer!");
6119 OpTy = PtrTy->getElementType();
6122 // Look for vector wrapped in a struct. e.g. { <16 x i8> }.
6123 if (StructType *STy = dyn_cast<StructType>(OpTy))
6124 if (STy->getNumElements() == 1)
6125 OpTy = STy->getElementType(0);
6127 // If OpTy is not a single value, it may be a struct/union that we
6128 // can tile with integers.
6129 if (!OpTy->isSingleValueType() && OpTy->isSized()) {
6130 unsigned BitSize = DL->getTypeSizeInBits(OpTy);
6139 OpTy = IntegerType::get(Context, BitSize);
6144 return TLI.getValueType(OpTy, true);
6148 typedef SmallVector<SDISelAsmOperandInfo,16> SDISelAsmOperandInfoVector;
6150 } // end anonymous namespace
6152 /// GetRegistersForValue - Assign registers (virtual or physical) for the
6153 /// specified operand. We prefer to assign virtual registers, to allow the
6154 /// register allocator to handle the assignment process. However, if the asm
6155 /// uses features that we can't model on machineinstrs, we have SDISel do the
6156 /// allocation. This produces generally horrible, but correct, code.
6158 /// OpInfo describes the operand.
6160 static void GetRegistersForValue(SelectionDAG &DAG,
6161 const TargetLowering &TLI,
6163 SDISelAsmOperandInfo &OpInfo) {
6164 LLVMContext &Context = *DAG.getContext();
6166 MachineFunction &MF = DAG.getMachineFunction();
6167 SmallVector<unsigned, 4> Regs;
6169 // If this is a constraint for a single physreg, or a constraint for a
6170 // register class, find it.
6171 std::pair<unsigned, const TargetRegisterClass*> PhysReg =
6172 TLI.getRegForInlineAsmConstraint(OpInfo.ConstraintCode,
6173 OpInfo.ConstraintVT);
6175 unsigned NumRegs = 1;
6176 if (OpInfo.ConstraintVT != MVT::Other) {
6177 // If this is a FP input in an integer register (or visa versa) insert a bit
6178 // cast of the input value. More generally, handle any case where the input
6179 // value disagrees with the register class we plan to stick this in.
6180 if (OpInfo.Type == InlineAsm::isInput &&
6181 PhysReg.second && !PhysReg.second->hasType(OpInfo.ConstraintVT)) {
6182 // Try to convert to the first EVT that the reg class contains. If the
6183 // types are identical size, use a bitcast to convert (e.g. two differing
6185 MVT RegVT = *PhysReg.second->vt_begin();
6186 if (RegVT.getSizeInBits() == OpInfo.ConstraintVT.getSizeInBits()) {
6187 OpInfo.CallOperand = DAG.getNode(ISD::BITCAST, DL,
6188 RegVT, OpInfo.CallOperand);
6189 OpInfo.ConstraintVT = RegVT;
6190 } else if (RegVT.isInteger() && OpInfo.ConstraintVT.isFloatingPoint()) {
6191 // If the input is a FP value and we want it in FP registers, do a
6192 // bitcast to the corresponding integer type. This turns an f64 value
6193 // into i64, which can be passed with two i32 values on a 32-bit
6195 RegVT = MVT::getIntegerVT(OpInfo.ConstraintVT.getSizeInBits());
6196 OpInfo.CallOperand = DAG.getNode(ISD::BITCAST, DL,
6197 RegVT, OpInfo.CallOperand);
6198 OpInfo.ConstraintVT = RegVT;
6202 NumRegs = TLI.getNumRegisters(Context, OpInfo.ConstraintVT);
6206 EVT ValueVT = OpInfo.ConstraintVT;
6208 // If this is a constraint for a specific physical register, like {r17},
6210 if (unsigned AssignedReg = PhysReg.first) {
6211 const TargetRegisterClass *RC = PhysReg.second;
6212 if (OpInfo.ConstraintVT == MVT::Other)
6213 ValueVT = *RC->vt_begin();
6215 // Get the actual register value type. This is important, because the user
6216 // may have asked for (e.g.) the AX register in i32 type. We need to
6217 // remember that AX is actually i16 to get the right extension.
6218 RegVT = *RC->vt_begin();
6220 // This is a explicit reference to a physical register.
6221 Regs.push_back(AssignedReg);
6223 // If this is an expanded reference, add the rest of the regs to Regs.
6225 TargetRegisterClass::iterator I = RC->begin();
6226 for (; *I != AssignedReg; ++I)
6227 assert(I != RC->end() && "Didn't find reg!");
6229 // Already added the first reg.
6231 for (; NumRegs; --NumRegs, ++I) {
6232 assert(I != RC->end() && "Ran out of registers to allocate!");
6237 OpInfo.AssignedRegs = RegsForValue(Regs, RegVT, ValueVT);
6241 // Otherwise, if this was a reference to an LLVM register class, create vregs
6242 // for this reference.
6243 if (const TargetRegisterClass *RC = PhysReg.second) {
6244 RegVT = *RC->vt_begin();
6245 if (OpInfo.ConstraintVT == MVT::Other)
6248 // Create the appropriate number of virtual registers.
6249 MachineRegisterInfo &RegInfo = MF.getRegInfo();
6250 for (; NumRegs; --NumRegs)
6251 Regs.push_back(RegInfo.createVirtualRegister(RC));
6253 OpInfo.AssignedRegs = RegsForValue(Regs, RegVT, ValueVT);
6257 // Otherwise, we couldn't allocate enough registers for this.
6260 /// visitInlineAsm - Handle a call to an InlineAsm object.
6262 void SelectionDAGBuilder::visitInlineAsm(ImmutableCallSite CS) {
6263 const InlineAsm *IA = cast<InlineAsm>(CS.getCalledValue());
6265 /// ConstraintOperands - Information about all of the constraints.
6266 SDISelAsmOperandInfoVector ConstraintOperands;
6268 const TargetLowering *TLI = TM.getTargetLowering();
6269 TargetLowering::AsmOperandInfoVector
6270 TargetConstraints = TLI->ParseConstraints(CS);
6272 bool hasMemory = false;
6274 unsigned ArgNo = 0; // ArgNo - The argument of the CallInst.
6275 unsigned ResNo = 0; // ResNo - The result number of the next output.
6276 for (unsigned i = 0, e = TargetConstraints.size(); i != e; ++i) {
6277 ConstraintOperands.push_back(SDISelAsmOperandInfo(TargetConstraints[i]));
6278 SDISelAsmOperandInfo &OpInfo = ConstraintOperands.back();
6280 MVT OpVT = MVT::Other;
6282 // Compute the value type for each operand.
6283 switch (OpInfo.Type) {
6284 case InlineAsm::isOutput:
6285 // Indirect outputs just consume an argument.
6286 if (OpInfo.isIndirect) {
6287 OpInfo.CallOperandVal = const_cast<Value *>(CS.getArgument(ArgNo++));
6291 // The return value of the call is this value. As such, there is no
6292 // corresponding argument.
6293 assert(!CS.getType()->isVoidTy() && "Bad inline asm!");
6294 if (StructType *STy = dyn_cast<StructType>(CS.getType())) {
6295 OpVT = TLI->getSimpleValueType(STy->getElementType(ResNo));
6297 assert(ResNo == 0 && "Asm only has one result!");
6298 OpVT = TLI->getSimpleValueType(CS.getType());
6302 case InlineAsm::isInput:
6303 OpInfo.CallOperandVal = const_cast<Value *>(CS.getArgument(ArgNo++));
6305 case InlineAsm::isClobber:
6310 // If this is an input or an indirect output, process the call argument.
6311 // BasicBlocks are labels, currently appearing only in asm's.
6312 if (OpInfo.CallOperandVal) {
6313 if (const BasicBlock *BB = dyn_cast<BasicBlock>(OpInfo.CallOperandVal)) {
6314 OpInfo.CallOperand = DAG.getBasicBlock(FuncInfo.MBBMap[BB]);
6316 OpInfo.CallOperand = getValue(OpInfo.CallOperandVal);
6319 OpVT = OpInfo.getCallOperandValEVT(*DAG.getContext(), *TLI, DL).
6323 OpInfo.ConstraintVT = OpVT;
6325 // Indirect operand accesses access memory.
6326 if (OpInfo.isIndirect)
6329 for (unsigned j = 0, ee = OpInfo.Codes.size(); j != ee; ++j) {
6330 TargetLowering::ConstraintType
6331 CType = TLI->getConstraintType(OpInfo.Codes[j]);
6332 if (CType == TargetLowering::C_Memory) {
6340 SDValue Chain, Flag;
6342 // We won't need to flush pending loads if this asm doesn't touch
6343 // memory and is nonvolatile.
6344 if (hasMemory || IA->hasSideEffects())
6347 Chain = DAG.getRoot();
6349 // Second pass over the constraints: compute which constraint option to use
6350 // and assign registers to constraints that want a specific physreg.
6351 for (unsigned i = 0, e = ConstraintOperands.size(); i != e; ++i) {
6352 SDISelAsmOperandInfo &OpInfo = ConstraintOperands[i];
6354 // If this is an output operand with a matching input operand, look up the
6355 // matching input. If their types mismatch, e.g. one is an integer, the
6356 // other is floating point, or their sizes are different, flag it as an
6358 if (OpInfo.hasMatchingInput()) {
6359 SDISelAsmOperandInfo &Input = ConstraintOperands[OpInfo.MatchingInput];
6361 if (OpInfo.ConstraintVT != Input.ConstraintVT) {
6362 std::pair<unsigned, const TargetRegisterClass*> MatchRC =
6363 TLI->getRegForInlineAsmConstraint(OpInfo.ConstraintCode,
6364 OpInfo.ConstraintVT);
6365 std::pair<unsigned, const TargetRegisterClass*> InputRC =
6366 TLI->getRegForInlineAsmConstraint(Input.ConstraintCode,
6367 Input.ConstraintVT);
6368 if ((OpInfo.ConstraintVT.isInteger() !=
6369 Input.ConstraintVT.isInteger()) ||
6370 (MatchRC.second != InputRC.second)) {
6371 report_fatal_error("Unsupported asm: input constraint"
6372 " with a matching output constraint of"
6373 " incompatible type!");
6375 Input.ConstraintVT = OpInfo.ConstraintVT;
6379 // Compute the constraint code and ConstraintType to use.
6380 TLI->ComputeConstraintToUse(OpInfo, OpInfo.CallOperand, &DAG);
6382 if (OpInfo.ConstraintType == TargetLowering::C_Memory &&
6383 OpInfo.Type == InlineAsm::isClobber)
6386 // If this is a memory input, and if the operand is not indirect, do what we
6387 // need to to provide an address for the memory input.
6388 if (OpInfo.ConstraintType == TargetLowering::C_Memory &&
6389 !OpInfo.isIndirect) {
6390 assert((OpInfo.isMultipleAlternative ||
6391 (OpInfo.Type == InlineAsm::isInput)) &&
6392 "Can only indirectify direct input operands!");
6394 // Memory operands really want the address of the value. If we don't have
6395 // an indirect input, put it in the constpool if we can, otherwise spill
6396 // it to a stack slot.
6397 // TODO: This isn't quite right. We need to handle these according to
6398 // the addressing mode that the constraint wants. Also, this may take
6399 // an additional register for the computation and we don't want that
6402 // If the operand is a float, integer, or vector constant, spill to a
6403 // constant pool entry to get its address.
6404 const Value *OpVal = OpInfo.CallOperandVal;
6405 if (isa<ConstantFP>(OpVal) || isa<ConstantInt>(OpVal) ||
6406 isa<ConstantVector>(OpVal) || isa<ConstantDataVector>(OpVal)) {
6407 OpInfo.CallOperand = DAG.getConstantPool(cast<Constant>(OpVal),
6408 TLI->getPointerTy());
6410 // Otherwise, create a stack slot and emit a store to it before the
6412 Type *Ty = OpVal->getType();
6413 uint64_t TySize = TLI->getDataLayout()->getTypeAllocSize(Ty);
6414 unsigned Align = TLI->getDataLayout()->getPrefTypeAlignment(Ty);
6415 MachineFunction &MF = DAG.getMachineFunction();
6416 int SSFI = MF.getFrameInfo()->CreateStackObject(TySize, Align, false);
6417 SDValue StackSlot = DAG.getFrameIndex(SSFI, TLI->getPointerTy());
6418 Chain = DAG.getStore(Chain, getCurSDLoc(),
6419 OpInfo.CallOperand, StackSlot,
6420 MachinePointerInfo::getFixedStack(SSFI),
6422 OpInfo.CallOperand = StackSlot;
6425 // There is no longer a Value* corresponding to this operand.
6426 OpInfo.CallOperandVal = 0;
6428 // It is now an indirect operand.
6429 OpInfo.isIndirect = true;
6432 // If this constraint is for a specific register, allocate it before
6434 if (OpInfo.ConstraintType == TargetLowering::C_Register)
6435 GetRegistersForValue(DAG, *TLI, getCurSDLoc(), OpInfo);
6438 // Second pass - Loop over all of the operands, assigning virtual or physregs
6439 // to register class operands.
6440 for (unsigned i = 0, e = ConstraintOperands.size(); i != e; ++i) {
6441 SDISelAsmOperandInfo &OpInfo = ConstraintOperands[i];
6443 // C_Register operands have already been allocated, Other/Memory don't need
6445 if (OpInfo.ConstraintType == TargetLowering::C_RegisterClass)
6446 GetRegistersForValue(DAG, *TLI, getCurSDLoc(), OpInfo);
6449 // AsmNodeOperands - The operands for the ISD::INLINEASM node.
6450 std::vector<SDValue> AsmNodeOperands;
6451 AsmNodeOperands.push_back(SDValue()); // reserve space for input chain
6452 AsmNodeOperands.push_back(
6453 DAG.getTargetExternalSymbol(IA->getAsmString().c_str(),
6454 TLI->getPointerTy()));
6456 // If we have a !srcloc metadata node associated with it, we want to attach
6457 // this to the ultimately generated inline asm machineinstr. To do this, we
6458 // pass in the third operand as this (potentially null) inline asm MDNode.
6459 const MDNode *SrcLoc = CS.getInstruction()->getMetadata("srcloc");
6460 AsmNodeOperands.push_back(DAG.getMDNode(SrcLoc));
6462 // Remember the HasSideEffect, AlignStack, AsmDialect, MayLoad and MayStore
6463 // bits as operand 3.
6464 unsigned ExtraInfo = 0;
6465 if (IA->hasSideEffects())
6466 ExtraInfo |= InlineAsm::Extra_HasSideEffects;
6467 if (IA->isAlignStack())
6468 ExtraInfo |= InlineAsm::Extra_IsAlignStack;
6469 // Set the asm dialect.
6470 ExtraInfo |= IA->getDialect() * InlineAsm::Extra_AsmDialect;
6472 // Determine if this InlineAsm MayLoad or MayStore based on the constraints.
6473 for (unsigned i = 0, e = TargetConstraints.size(); i != e; ++i) {
6474 TargetLowering::AsmOperandInfo &OpInfo = TargetConstraints[i];
6476 // Compute the constraint code and ConstraintType to use.
6477 TLI->ComputeConstraintToUse(OpInfo, SDValue());
6479 // Ideally, we would only check against memory constraints. However, the
6480 // meaning of an other constraint can be target-specific and we can't easily
6481 // reason about it. Therefore, be conservative and set MayLoad/MayStore
6482 // for other constriants as well.
6483 if (OpInfo.ConstraintType == TargetLowering::C_Memory ||
6484 OpInfo.ConstraintType == TargetLowering::C_Other) {
6485 if (OpInfo.Type == InlineAsm::isInput)
6486 ExtraInfo |= InlineAsm::Extra_MayLoad;
6487 else if (OpInfo.Type == InlineAsm::isOutput)
6488 ExtraInfo |= InlineAsm::Extra_MayStore;
6489 else if (OpInfo.Type == InlineAsm::isClobber)
6490 ExtraInfo |= (InlineAsm::Extra_MayLoad | InlineAsm::Extra_MayStore);
6494 AsmNodeOperands.push_back(DAG.getTargetConstant(ExtraInfo,
6495 TLI->getPointerTy()));
6497 // Loop over all of the inputs, copying the operand values into the
6498 // appropriate registers and processing the output regs.
6499 RegsForValue RetValRegs;
6501 // IndirectStoresToEmit - The set of stores to emit after the inline asm node.
6502 std::vector<std::pair<RegsForValue, Value*> > IndirectStoresToEmit;
6504 for (unsigned i = 0, e = ConstraintOperands.size(); i != e; ++i) {
6505 SDISelAsmOperandInfo &OpInfo = ConstraintOperands[i];
6507 switch (OpInfo.Type) {
6508 case InlineAsm::isOutput: {
6509 if (OpInfo.ConstraintType != TargetLowering::C_RegisterClass &&
6510 OpInfo.ConstraintType != TargetLowering::C_Register) {
6511 // Memory output, or 'other' output (e.g. 'X' constraint).
6512 assert(OpInfo.isIndirect && "Memory output must be indirect operand");
6514 // Add information to the INLINEASM node to know about this output.
6515 unsigned OpFlags = InlineAsm::getFlagWord(InlineAsm::Kind_Mem, 1);
6516 AsmNodeOperands.push_back(DAG.getTargetConstant(OpFlags,
6517 TLI->getPointerTy()));
6518 AsmNodeOperands.push_back(OpInfo.CallOperand);
6522 // Otherwise, this is a register or register class output.
6524 // Copy the output from the appropriate register. Find a register that
6526 if (OpInfo.AssignedRegs.Regs.empty()) {
6527 LLVMContext &Ctx = *DAG.getContext();
6528 Ctx.emitError(CS.getInstruction(),
6529 "couldn't allocate output register for constraint '" +
6530 Twine(OpInfo.ConstraintCode) + "'");
6534 // If this is an indirect operand, store through the pointer after the
6536 if (OpInfo.isIndirect) {
6537 IndirectStoresToEmit.push_back(std::make_pair(OpInfo.AssignedRegs,
6538 OpInfo.CallOperandVal));
6540 // This is the result value of the call.
6541 assert(!CS.getType()->isVoidTy() && "Bad inline asm!");
6542 // Concatenate this output onto the outputs list.
6543 RetValRegs.append(OpInfo.AssignedRegs);
6546 // Add information to the INLINEASM node to know that this register is
6549 .AddInlineAsmOperands(OpInfo.isEarlyClobber
6550 ? InlineAsm::Kind_RegDefEarlyClobber
6551 : InlineAsm::Kind_RegDef,
6552 false, 0, DAG, AsmNodeOperands);
6555 case InlineAsm::isInput: {
6556 SDValue InOperandVal = OpInfo.CallOperand;
6558 if (OpInfo.isMatchingInputConstraint()) { // Matching constraint?
6559 // If this is required to match an output register we have already set,
6560 // just use its register.
6561 unsigned OperandNo = OpInfo.getMatchedOperand();
6563 // Scan until we find the definition we already emitted of this operand.
6564 // When we find it, create a RegsForValue operand.
6565 unsigned CurOp = InlineAsm::Op_FirstOperand;
6566 for (; OperandNo; --OperandNo) {
6567 // Advance to the next operand.
6569 cast<ConstantSDNode>(AsmNodeOperands[CurOp])->getZExtValue();
6570 assert((InlineAsm::isRegDefKind(OpFlag) ||
6571 InlineAsm::isRegDefEarlyClobberKind(OpFlag) ||
6572 InlineAsm::isMemKind(OpFlag)) && "Skipped past definitions?");
6573 CurOp += InlineAsm::getNumOperandRegisters(OpFlag)+1;
6577 cast<ConstantSDNode>(AsmNodeOperands[CurOp])->getZExtValue();
6578 if (InlineAsm::isRegDefKind(OpFlag) ||
6579 InlineAsm::isRegDefEarlyClobberKind(OpFlag)) {
6580 // Add (OpFlag&0xffff)>>3 registers to MatchedRegs.
6581 if (OpInfo.isIndirect) {
6582 // This happens on gcc/testsuite/gcc.dg/pr8788-1.c
6583 LLVMContext &Ctx = *DAG.getContext();
6584 Ctx.emitError(CS.getInstruction(), "inline asm not supported yet:"
6585 " don't know how to handle tied "
6586 "indirect register inputs");
6590 RegsForValue MatchedRegs;
6591 MatchedRegs.ValueVTs.push_back(InOperandVal.getValueType());
6592 MVT RegVT = AsmNodeOperands[CurOp+1].getSimpleValueType();
6593 MatchedRegs.RegVTs.push_back(RegVT);
6594 MachineRegisterInfo &RegInfo = DAG.getMachineFunction().getRegInfo();
6595 for (unsigned i = 0, e = InlineAsm::getNumOperandRegisters(OpFlag);
6597 if (const TargetRegisterClass *RC = TLI->getRegClassFor(RegVT))
6598 MatchedRegs.Regs.push_back(RegInfo.createVirtualRegister(RC));
6600 LLVMContext &Ctx = *DAG.getContext();
6601 Ctx.emitError(CS.getInstruction(),
6602 "inline asm error: This value"
6603 " type register class is not natively supported!");
6607 // Use the produced MatchedRegs object to
6608 MatchedRegs.getCopyToRegs(InOperandVal, DAG, getCurSDLoc(),
6609 Chain, &Flag, CS.getInstruction());
6610 MatchedRegs.AddInlineAsmOperands(InlineAsm::Kind_RegUse,
6611 true, OpInfo.getMatchedOperand(),
6612 DAG, AsmNodeOperands);
6616 assert(InlineAsm::isMemKind(OpFlag) && "Unknown matching constraint!");
6617 assert(InlineAsm::getNumOperandRegisters(OpFlag) == 1 &&
6618 "Unexpected number of operands");
6619 // Add information to the INLINEASM node to know about this input.
6620 // See InlineAsm.h isUseOperandTiedToDef.
6621 OpFlag = InlineAsm::getFlagWordForMatchingOp(OpFlag,
6622 OpInfo.getMatchedOperand());
6623 AsmNodeOperands.push_back(DAG.getTargetConstant(OpFlag,
6624 TLI->getPointerTy()));
6625 AsmNodeOperands.push_back(AsmNodeOperands[CurOp+1]);
6629 // Treat indirect 'X' constraint as memory.
6630 if (OpInfo.ConstraintType == TargetLowering::C_Other &&
6632 OpInfo.ConstraintType = TargetLowering::C_Memory;
6634 if (OpInfo.ConstraintType == TargetLowering::C_Other) {
6635 std::vector<SDValue> Ops;
6636 TLI->LowerAsmOperandForConstraint(InOperandVal, OpInfo.ConstraintCode,
6639 LLVMContext &Ctx = *DAG.getContext();
6640 Ctx.emitError(CS.getInstruction(),
6641 "invalid operand for inline asm constraint '" +
6642 Twine(OpInfo.ConstraintCode) + "'");
6646 // Add information to the INLINEASM node to know about this input.
6647 unsigned ResOpType =
6648 InlineAsm::getFlagWord(InlineAsm::Kind_Imm, Ops.size());
6649 AsmNodeOperands.push_back(DAG.getTargetConstant(ResOpType,
6650 TLI->getPointerTy()));
6651 AsmNodeOperands.insert(AsmNodeOperands.end(), Ops.begin(), Ops.end());
6655 if (OpInfo.ConstraintType == TargetLowering::C_Memory) {
6656 assert(OpInfo.isIndirect && "Operand must be indirect to be a mem!");
6657 assert(InOperandVal.getValueType() == TLI->getPointerTy() &&
6658 "Memory operands expect pointer values");
6660 // Add information to the INLINEASM node to know about this input.
6661 unsigned ResOpType = InlineAsm::getFlagWord(InlineAsm::Kind_Mem, 1);
6662 AsmNodeOperands.push_back(DAG.getTargetConstant(ResOpType,
6663 TLI->getPointerTy()));
6664 AsmNodeOperands.push_back(InOperandVal);
6668 assert((OpInfo.ConstraintType == TargetLowering::C_RegisterClass ||
6669 OpInfo.ConstraintType == TargetLowering::C_Register) &&
6670 "Unknown constraint type!");
6672 // TODO: Support this.
6673 if (OpInfo.isIndirect) {
6674 LLVMContext &Ctx = *DAG.getContext();
6675 Ctx.emitError(CS.getInstruction(),
6676 "Don't know how to handle indirect register inputs yet "
6677 "for constraint '" +
6678 Twine(OpInfo.ConstraintCode) + "'");
6682 // Copy the input into the appropriate registers.
6683 if (OpInfo.AssignedRegs.Regs.empty()) {
6684 LLVMContext &Ctx = *DAG.getContext();
6685 Ctx.emitError(CS.getInstruction(),
6686 "couldn't allocate input reg for constraint '" +
6687 Twine(OpInfo.ConstraintCode) + "'");
6691 OpInfo.AssignedRegs.getCopyToRegs(InOperandVal, DAG, getCurSDLoc(),
6692 Chain, &Flag, CS.getInstruction());
6694 OpInfo.AssignedRegs.AddInlineAsmOperands(InlineAsm::Kind_RegUse, false, 0,
6695 DAG, AsmNodeOperands);
6698 case InlineAsm::isClobber: {
6699 // Add the clobbered value to the operand list, so that the register
6700 // allocator is aware that the physreg got clobbered.
6701 if (!OpInfo.AssignedRegs.Regs.empty())
6702 OpInfo.AssignedRegs.AddInlineAsmOperands(InlineAsm::Kind_Clobber,
6710 // Finish up input operands. Set the input chain and add the flag last.
6711 AsmNodeOperands[InlineAsm::Op_InputChain] = Chain;
6712 if (Flag.getNode()) AsmNodeOperands.push_back(Flag);
6714 Chain = DAG.getNode(ISD::INLINEASM, getCurSDLoc(),
6715 DAG.getVTList(MVT::Other, MVT::Glue),
6716 &AsmNodeOperands[0], AsmNodeOperands.size());
6717 Flag = Chain.getValue(1);
6719 // If this asm returns a register value, copy the result from that register
6720 // and set it as the value of the call.
6721 if (!RetValRegs.Regs.empty()) {
6722 SDValue Val = RetValRegs.getCopyFromRegs(DAG, FuncInfo, getCurSDLoc(),
6723 Chain, &Flag, CS.getInstruction());
6725 // FIXME: Why don't we do this for inline asms with MRVs?
6726 if (CS.getType()->isSingleValueType() && CS.getType()->isSized()) {
6727 EVT ResultType = TLI->getValueType(CS.getType());
6729 // If any of the results of the inline asm is a vector, it may have the
6730 // wrong width/num elts. This can happen for register classes that can
6731 // contain multiple different value types. The preg or vreg allocated may
6732 // not have the same VT as was expected. Convert it to the right type
6733 // with bit_convert.
6734 if (ResultType != Val.getValueType() && Val.getValueType().isVector()) {
6735 Val = DAG.getNode(ISD::BITCAST, getCurSDLoc(),
6738 } else if (ResultType != Val.getValueType() &&
6739 ResultType.isInteger() && Val.getValueType().isInteger()) {
6740 // If a result value was tied to an input value, the computed result may
6741 // have a wider width than the expected result. Extract the relevant
6743 Val = DAG.getNode(ISD::TRUNCATE, getCurSDLoc(), ResultType, Val);
6746 assert(ResultType == Val.getValueType() && "Asm result value mismatch!");
6749 setValue(CS.getInstruction(), Val);
6750 // Don't need to use this as a chain in this case.
6751 if (!IA->hasSideEffects() && !hasMemory && IndirectStoresToEmit.empty())
6755 std::vector<std::pair<SDValue, const Value *> > StoresToEmit;
6757 // Process indirect outputs, first output all of the flagged copies out of
6759 for (unsigned i = 0, e = IndirectStoresToEmit.size(); i != e; ++i) {
6760 RegsForValue &OutRegs = IndirectStoresToEmit[i].first;
6761 const Value *Ptr = IndirectStoresToEmit[i].second;
6762 SDValue OutVal = OutRegs.getCopyFromRegs(DAG, FuncInfo, getCurSDLoc(),
6764 StoresToEmit.push_back(std::make_pair(OutVal, Ptr));
6767 // Emit the non-flagged stores from the physregs.
6768 SmallVector<SDValue, 8> OutChains;
6769 for (unsigned i = 0, e = StoresToEmit.size(); i != e; ++i) {
6770 SDValue Val = DAG.getStore(Chain, getCurSDLoc(),
6771 StoresToEmit[i].first,
6772 getValue(StoresToEmit[i].second),
6773 MachinePointerInfo(StoresToEmit[i].second),
6775 OutChains.push_back(Val);
6778 if (!OutChains.empty())
6779 Chain = DAG.getNode(ISD::TokenFactor, getCurSDLoc(), MVT::Other,
6780 &OutChains[0], OutChains.size());
6785 void SelectionDAGBuilder::visitVAStart(const CallInst &I) {
6786 DAG.setRoot(DAG.getNode(ISD::VASTART, getCurSDLoc(),
6787 MVT::Other, getRoot(),
6788 getValue(I.getArgOperand(0)),
6789 DAG.getSrcValue(I.getArgOperand(0))));
6792 void SelectionDAGBuilder::visitVAArg(const VAArgInst &I) {
6793 const TargetLowering *TLI = TM.getTargetLowering();
6794 const DataLayout &DL = *TLI->getDataLayout();
6795 SDValue V = DAG.getVAArg(TLI->getValueType(I.getType()), getCurSDLoc(),
6796 getRoot(), getValue(I.getOperand(0)),
6797 DAG.getSrcValue(I.getOperand(0)),
6798 DL.getABITypeAlignment(I.getType()));
6800 DAG.setRoot(V.getValue(1));
6803 void SelectionDAGBuilder::visitVAEnd(const CallInst &I) {
6804 DAG.setRoot(DAG.getNode(ISD::VAEND, getCurSDLoc(),
6805 MVT::Other, getRoot(),
6806 getValue(I.getArgOperand(0)),
6807 DAG.getSrcValue(I.getArgOperand(0))));
6810 void SelectionDAGBuilder::visitVACopy(const CallInst &I) {
6811 DAG.setRoot(DAG.getNode(ISD::VACOPY, getCurSDLoc(),
6812 MVT::Other, getRoot(),
6813 getValue(I.getArgOperand(0)),
6814 getValue(I.getArgOperand(1)),
6815 DAG.getSrcValue(I.getArgOperand(0)),
6816 DAG.getSrcValue(I.getArgOperand(1))));
6819 /// \brief Lower an argument list according to the target calling convention.
6821 /// \return A tuple of <return-value, token-chain>
6823 /// This is a helper for lowering intrinsics that follow a target calling
6824 /// convention or require stack pointer adjustment. Only a subset of the
6825 /// intrinsic's operands need to participate in the calling convention.
6826 std::pair<SDValue, SDValue>
6827 SelectionDAGBuilder::LowerCallOperands(const CallInst &CI, unsigned ArgIdx,
6828 unsigned NumArgs, SDValue Callee,
6830 TargetLowering::ArgListTy Args;
6831 Args.reserve(NumArgs);
6833 // Populate the argument list.
6834 // Attributes for args start at offset 1, after the return attribute.
6835 ImmutableCallSite CS(&CI);
6836 for (unsigned ArgI = ArgIdx, ArgE = ArgIdx + NumArgs, AttrI = ArgIdx + 1;
6837 ArgI != ArgE; ++ArgI) {
6838 const Value *V = CI.getOperand(ArgI);
6840 assert(!V->getType()->isEmptyTy() && "Empty type passed to intrinsic.");
6842 TargetLowering::ArgListEntry Entry;
6843 Entry.Node = getValue(V);
6844 Entry.Ty = V->getType();
6845 Entry.setAttributes(&CS, AttrI);
6846 Args.push_back(Entry);
6849 Type *retTy = useVoidTy ? Type::getVoidTy(*DAG.getContext()) : CI.getType();
6850 TargetLowering::CallLoweringInfo CLI(getRoot(), retTy, /*retSExt*/ false,
6851 /*retZExt*/ false, /*isVarArg*/ false, /*isInReg*/ false, NumArgs,
6852 CI.getCallingConv(), /*isTailCall*/ false, /*doesNotReturn*/ false,
6853 /*isReturnValueUsed*/ CI.use_empty(), Callee, Args, DAG, getCurSDLoc());
6855 const TargetLowering *TLI = TM.getTargetLowering();
6856 return TLI->LowerCallTo(CLI);
6859 /// \brief Add a stack map intrinsic call's live variable operands to a stackmap
6860 /// or patchpoint target node's operand list.
6862 /// Constants are converted to TargetConstants purely as an optimization to
6863 /// avoid constant materialization and register allocation.
6865 /// FrameIndex operands are converted to TargetFrameIndex so that ISEL does not
6866 /// generate addess computation nodes, and so ExpandISelPseudo can convert the
6867 /// TargetFrameIndex into a DirectMemRefOp StackMap location. This avoids
6868 /// address materialization and register allocation, but may also be required
6869 /// for correctness. If a StackMap (or PatchPoint) intrinsic directly uses an
6870 /// alloca in the entry block, then the runtime may assume that the alloca's
6871 /// StackMap location can be read immediately after compilation and that the
6872 /// location is valid at any point during execution (this is similar to the
6873 /// assumption made by the llvm.gcroot intrinsic). If the alloca's location were
6874 /// only available in a register, then the runtime would need to trap when
6875 /// execution reaches the StackMap in order to read the alloca's location.
6876 static void addStackMapLiveVars(const CallInst &CI, unsigned StartIdx,
6877 SmallVectorImpl<SDValue> &Ops,
6878 SelectionDAGBuilder &Builder) {
6879 for (unsigned i = StartIdx, e = CI.getNumArgOperands(); i != e; ++i) {
6880 SDValue OpVal = Builder.getValue(CI.getArgOperand(i));
6881 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(OpVal)) {
6883 Builder.DAG.getTargetConstant(StackMaps::ConstantOp, MVT::i64));
6885 Builder.DAG.getTargetConstant(C->getSExtValue(), MVT::i64));
6886 } else if (FrameIndexSDNode *FI = dyn_cast<FrameIndexSDNode>(OpVal)) {
6887 const TargetLowering &TLI = Builder.DAG.getTargetLoweringInfo();
6889 Builder.DAG.getTargetFrameIndex(FI->getIndex(), TLI.getPointerTy()));
6891 Ops.push_back(OpVal);
6895 /// \brief Lower llvm.experimental.stackmap directly to its target opcode.
6896 void SelectionDAGBuilder::visitStackmap(const CallInst &CI) {
6897 // void @llvm.experimental.stackmap(i32 <id>, i32 <numShadowBytes>,
6898 // [live variables...])
6900 assert(CI.getType()->isVoidTy() && "Stackmap cannot return a value.");
6902 SDValue Chain, InFlag, Callee, NullPtr;
6903 SmallVector<SDValue, 32> Ops;
6905 SDLoc DL = getCurSDLoc();
6906 Callee = getValue(CI.getCalledValue());
6907 NullPtr = DAG.getIntPtrConstant(0, true);
6909 // The stackmap intrinsic only records the live variables (the arguemnts
6910 // passed to it) and emits NOPS (if requested). Unlike the patchpoint
6911 // intrinsic, this won't be lowered to a function call. This means we don't
6912 // have to worry about calling conventions and target specific lowering code.
6913 // Instead we perform the call lowering right here.
6915 // chain, flag = CALLSEQ_START(chain, 0)
6916 // chain, flag = STACKMAP(id, nbytes, ..., chain, flag)
6917 // chain, flag = CALLSEQ_END(chain, 0, 0, flag)
6919 Chain = DAG.getCALLSEQ_START(getRoot(), NullPtr, DL);
6920 InFlag = Chain.getValue(1);
6922 // Add the <id> and <numBytes> constants.
6923 SDValue IDVal = getValue(CI.getOperand(PatchPointOpers::IDPos));
6924 Ops.push_back(DAG.getTargetConstant(
6925 cast<ConstantSDNode>(IDVal)->getZExtValue(), MVT::i64));
6926 SDValue NBytesVal = getValue(CI.getOperand(PatchPointOpers::NBytesPos));
6927 Ops.push_back(DAG.getTargetConstant(
6928 cast<ConstantSDNode>(NBytesVal)->getZExtValue(), MVT::i32));
6930 // Push live variables for the stack map.
6931 addStackMapLiveVars(CI, 2, Ops, *this);
6933 // We are not pushing any register mask info here on the operands list,
6934 // because the stackmap doesn't clobber anything.
6936 // Push the chain and the glue flag.
6937 Ops.push_back(Chain);
6938 Ops.push_back(InFlag);
6940 // Create the STACKMAP node.
6941 SDVTList NodeTys = DAG.getVTList(MVT::Other, MVT::Glue);
6942 SDNode *SM = DAG.getMachineNode(TargetOpcode::STACKMAP, DL, NodeTys, Ops);
6943 Chain = SDValue(SM, 0);
6944 InFlag = Chain.getValue(1);
6946 Chain = DAG.getCALLSEQ_END(Chain, NullPtr, NullPtr, InFlag, DL);
6948 // Stackmaps don't generate values, so nothing goes into the NodeMap.
6950 // Set the root to the target-lowered call chain.
6953 // Inform the Frame Information that we have a stackmap in this function.
6954 FuncInfo.MF->getFrameInfo()->setHasStackMap();
6957 /// \brief Lower llvm.experimental.patchpoint directly to its target opcode.
6958 void SelectionDAGBuilder::visitPatchpoint(const CallInst &CI) {
6959 // void|i64 @llvm.experimental.patchpoint.void|i64(i64 <id>,
6964 // [live variables...])
6966 CallingConv::ID CC = CI.getCallingConv();
6967 bool isAnyRegCC = CC == CallingConv::AnyReg;
6968 bool hasDef = !CI.getType()->isVoidTy();
6969 SDValue Callee = getValue(CI.getOperand(2)); // <target>
6971 // Get the real number of arguments participating in the call <numArgs>
6972 SDValue NArgVal = getValue(CI.getArgOperand(PatchPointOpers::NArgPos));
6973 unsigned NumArgs = cast<ConstantSDNode>(NArgVal)->getZExtValue();
6975 // Skip the four meta args: <id>, <numNopBytes>, <target>, <numArgs>
6976 // Intrinsics include all meta-operands up to but not including CC.
6977 unsigned NumMetaOpers = PatchPointOpers::CCPos;
6978 assert(CI.getNumArgOperands() >= NumMetaOpers + NumArgs &&
6979 "Not enough arguments provided to the patchpoint intrinsic");
6981 // For AnyRegCC the arguments are lowered later on manually.
6982 unsigned NumCallArgs = isAnyRegCC ? 0 : NumArgs;
6983 std::pair<SDValue, SDValue> Result =
6984 LowerCallOperands(CI, NumMetaOpers, NumCallArgs, Callee, isAnyRegCC);
6986 // Set the root to the target-lowered call chain.
6987 SDValue Chain = Result.second;
6990 SDNode *CallEnd = Chain.getNode();
6991 if (hasDef && (CallEnd->getOpcode() == ISD::CopyFromReg))
6992 CallEnd = CallEnd->getOperand(0).getNode();
6994 /// Get a call instruction from the call sequence chain.
6995 /// Tail calls are not allowed.
6996 assert(CallEnd->getOpcode() == ISD::CALLSEQ_END &&
6997 "Expected a callseq node.");
6998 SDNode *Call = CallEnd->getOperand(0).getNode();
6999 bool hasGlue = Call->getGluedNode();
7001 // Replace the target specific call node with the patchable intrinsic.
7002 SmallVector<SDValue, 8> Ops;
7004 // Add the <id> and <numBytes> constants.
7005 SDValue IDVal = getValue(CI.getOperand(PatchPointOpers::IDPos));
7006 Ops.push_back(DAG.getTargetConstant(
7007 cast<ConstantSDNode>(IDVal)->getZExtValue(), MVT::i64));
7008 SDValue NBytesVal = getValue(CI.getOperand(PatchPointOpers::NBytesPos));
7009 Ops.push_back(DAG.getTargetConstant(
7010 cast<ConstantSDNode>(NBytesVal)->getZExtValue(), MVT::i32));
7012 // Assume that the Callee is a constant address.
7013 // FIXME: handle function symbols in the future.
7015 DAG.getIntPtrConstant(cast<ConstantSDNode>(Callee)->getZExtValue(),
7016 /*isTarget=*/true));
7018 // Adjust <numArgs> to account for any arguments that have been passed on the
7020 // Call Node: Chain, Target, {Args}, RegMask, [Glue]
7021 unsigned NumCallRegArgs = Call->getNumOperands() - (hasGlue ? 4 : 3);
7022 NumCallRegArgs = isAnyRegCC ? NumArgs : NumCallRegArgs;
7023 Ops.push_back(DAG.getTargetConstant(NumCallRegArgs, MVT::i32));
7025 // Add the calling convention
7026 Ops.push_back(DAG.getTargetConstant((unsigned)CC, MVT::i32));
7028 // Add the arguments we omitted previously. The register allocator should
7029 // place these in any free register.
7031 for (unsigned i = NumMetaOpers, e = NumMetaOpers + NumArgs; i != e; ++i)
7032 Ops.push_back(getValue(CI.getArgOperand(i)));
7034 // Push the arguments from the call instruction up to the register mask.
7035 SDNode::op_iterator e = hasGlue ? Call->op_end()-2 : Call->op_end()-1;
7036 for (SDNode::op_iterator i = Call->op_begin()+2; i != e; ++i)
7039 // Push live variables for the stack map.
7040 addStackMapLiveVars(CI, NumMetaOpers + NumArgs, Ops, *this);
7042 // Push the register mask info.
7044 Ops.push_back(*(Call->op_end()-2));
7046 Ops.push_back(*(Call->op_end()-1));
7048 // Push the chain (this is originally the first operand of the call, but
7049 // becomes now the last or second to last operand).
7050 Ops.push_back(*(Call->op_begin()));
7052 // Push the glue flag (last operand).
7054 Ops.push_back(*(Call->op_end()-1));
7057 if (isAnyRegCC && hasDef) {
7058 // Create the return types based on the intrinsic definition
7059 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
7060 SmallVector<EVT, 3> ValueVTs;
7061 ComputeValueVTs(TLI, CI.getType(), ValueVTs);
7062 assert(ValueVTs.size() == 1 && "Expected only one return value type.");
7064 // There is always a chain and a glue type at the end
7065 ValueVTs.push_back(MVT::Other);
7066 ValueVTs.push_back(MVT::Glue);
7067 NodeTys = DAG.getVTList(ValueVTs.data(), ValueVTs.size());
7069 NodeTys = DAG.getVTList(MVT::Other, MVT::Glue);
7071 // Replace the target specific call node with a PATCHPOINT node.
7072 MachineSDNode *MN = DAG.getMachineNode(TargetOpcode::PATCHPOINT,
7073 getCurSDLoc(), NodeTys, Ops);
7075 // Update the NodeMap.
7078 setValue(&CI, SDValue(MN, 0));
7080 setValue(&CI, Result.first);
7083 // Fixup the consumers of the intrinsic. The chain and glue may be used in the
7084 // call sequence. Furthermore the location of the chain and glue can change
7085 // when the AnyReg calling convention is used and the intrinsic returns a
7087 if (isAnyRegCC && hasDef) {
7088 SDValue From[] = {SDValue(Call, 0), SDValue(Call, 1)};
7089 SDValue To[] = {SDValue(MN, 1), SDValue(MN, 2)};
7090 DAG.ReplaceAllUsesOfValuesWith(From, To, 2);
7092 DAG.ReplaceAllUsesWith(Call, MN);
7093 DAG.DeleteNode(Call);
7095 // Inform the Frame Information that we have a patchpoint in this function.
7096 FuncInfo.MF->getFrameInfo()->setHasPatchPoint();
7099 /// TargetLowering::LowerCallTo - This is the default LowerCallTo
7100 /// implementation, which just calls LowerCall.
7101 /// FIXME: When all targets are
7102 /// migrated to using LowerCall, this hook should be integrated into SDISel.
7103 std::pair<SDValue, SDValue>
7104 TargetLowering::LowerCallTo(TargetLowering::CallLoweringInfo &CLI) const {
7105 // Handle the incoming return values from the call.
7107 SmallVector<EVT, 4> RetTys;
7108 ComputeValueVTs(*this, CLI.RetTy, RetTys);
7109 for (unsigned I = 0, E = RetTys.size(); I != E; ++I) {
7111 MVT RegisterVT = getRegisterType(CLI.RetTy->getContext(), VT);
7112 unsigned NumRegs = getNumRegisters(CLI.RetTy->getContext(), VT);
7113 for (unsigned i = 0; i != NumRegs; ++i) {
7114 ISD::InputArg MyFlags;
7115 MyFlags.VT = RegisterVT;
7117 MyFlags.Used = CLI.IsReturnValueUsed;
7119 MyFlags.Flags.setSExt();
7121 MyFlags.Flags.setZExt();
7123 MyFlags.Flags.setInReg();
7124 CLI.Ins.push_back(MyFlags);
7128 // Handle all of the outgoing arguments.
7130 CLI.OutVals.clear();
7131 ArgListTy &Args = CLI.Args;
7132 for (unsigned i = 0, e = Args.size(); i != e; ++i) {
7133 SmallVector<EVT, 4> ValueVTs;
7134 ComputeValueVTs(*this, Args[i].Ty, ValueVTs);
7135 for (unsigned Value = 0, NumValues = ValueVTs.size();
7136 Value != NumValues; ++Value) {
7137 EVT VT = ValueVTs[Value];
7138 Type *ArgTy = VT.getTypeForEVT(CLI.RetTy->getContext());
7139 SDValue Op = SDValue(Args[i].Node.getNode(),
7140 Args[i].Node.getResNo() + Value);
7141 ISD::ArgFlagsTy Flags;
7142 unsigned OriginalAlignment =
7143 getDataLayout()->getABITypeAlignment(ArgTy);
7149 if (Args[i].isInReg)
7153 if (Args[i].isByVal)
7155 if (Args[i].isInAlloca) {
7156 Flags.setInAlloca();
7157 // Set the byval flag for CCAssignFn callbacks that don't know about
7158 // inalloca. This way we can know how many bytes we should've allocated
7159 // and how many bytes a callee cleanup function will pop. If we port
7160 // inalloca to more targets, we'll have to add custom inalloca handling
7161 // in the various CC lowering callbacks.
7164 if (Args[i].isByVal || Args[i].isInAlloca) {
7165 PointerType *Ty = cast<PointerType>(Args[i].Ty);
7166 Type *ElementTy = Ty->getElementType();
7167 Flags.setByValSize(getDataLayout()->getTypeAllocSize(ElementTy));
7168 // For ByVal, alignment should come from FE. BE will guess if this
7169 // info is not there but there are cases it cannot get right.
7170 unsigned FrameAlign;
7171 if (Args[i].Alignment)
7172 FrameAlign = Args[i].Alignment;
7174 FrameAlign = getByValTypeAlignment(ElementTy);
7175 Flags.setByValAlign(FrameAlign);
7179 Flags.setOrigAlign(OriginalAlignment);
7181 MVT PartVT = getRegisterType(CLI.RetTy->getContext(), VT);
7182 unsigned NumParts = getNumRegisters(CLI.RetTy->getContext(), VT);
7183 SmallVector<SDValue, 4> Parts(NumParts);
7184 ISD::NodeType ExtendKind = ISD::ANY_EXTEND;
7187 ExtendKind = ISD::SIGN_EXTEND;
7188 else if (Args[i].isZExt)
7189 ExtendKind = ISD::ZERO_EXTEND;
7191 // Conservatively only handle 'returned' on non-vectors for now
7192 if (Args[i].isReturned && !Op.getValueType().isVector()) {
7193 assert(CLI.RetTy == Args[i].Ty && RetTys.size() == NumValues &&
7194 "unexpected use of 'returned'");
7195 // Before passing 'returned' to the target lowering code, ensure that
7196 // either the register MVT and the actual EVT are the same size or that
7197 // the return value and argument are extended in the same way; in these
7198 // cases it's safe to pass the argument register value unchanged as the
7199 // return register value (although it's at the target's option whether
7201 // TODO: allow code generation to take advantage of partially preserved
7202 // registers rather than clobbering the entire register when the
7203 // parameter extension method is not compatible with the return
7205 if ((NumParts * PartVT.getSizeInBits() == VT.getSizeInBits()) ||
7206 (ExtendKind != ISD::ANY_EXTEND &&
7207 CLI.RetSExt == Args[i].isSExt && CLI.RetZExt == Args[i].isZExt))
7208 Flags.setReturned();
7211 getCopyToParts(CLI.DAG, CLI.DL, Op, &Parts[0], NumParts,
7212 PartVT, CLI.CS ? CLI.CS->getInstruction() : 0, ExtendKind);
7214 for (unsigned j = 0; j != NumParts; ++j) {
7215 // if it isn't first piece, alignment must be 1
7216 ISD::OutputArg MyFlags(Flags, Parts[j].getValueType(), VT,
7217 i < CLI.NumFixedArgs,
7218 i, j*Parts[j].getValueType().getStoreSize());
7219 if (NumParts > 1 && j == 0)
7220 MyFlags.Flags.setSplit();
7222 MyFlags.Flags.setOrigAlign(1);
7224 CLI.Outs.push_back(MyFlags);
7225 CLI.OutVals.push_back(Parts[j]);
7230 SmallVector<SDValue, 4> InVals;
7231 CLI.Chain = LowerCall(CLI, InVals);
7233 // Verify that the target's LowerCall behaved as expected.
7234 assert(CLI.Chain.getNode() && CLI.Chain.getValueType() == MVT::Other &&
7235 "LowerCall didn't return a valid chain!");
7236 assert((!CLI.IsTailCall || InVals.empty()) &&
7237 "LowerCall emitted a return value for a tail call!");
7238 assert((CLI.IsTailCall || InVals.size() == CLI.Ins.size()) &&
7239 "LowerCall didn't emit the correct number of values!");
7241 // For a tail call, the return value is merely live-out and there aren't
7242 // any nodes in the DAG representing it. Return a special value to
7243 // indicate that a tail call has been emitted and no more Instructions
7244 // should be processed in the current block.
7245 if (CLI.IsTailCall) {
7246 CLI.DAG.setRoot(CLI.Chain);
7247 return std::make_pair(SDValue(), SDValue());
7250 DEBUG(for (unsigned i = 0, e = CLI.Ins.size(); i != e; ++i) {
7251 assert(InVals[i].getNode() &&
7252 "LowerCall emitted a null value!");
7253 assert(EVT(CLI.Ins[i].VT) == InVals[i].getValueType() &&
7254 "LowerCall emitted a value with the wrong type!");
7257 // Collect the legal value parts into potentially illegal values
7258 // that correspond to the original function's return values.
7259 ISD::NodeType AssertOp = ISD::DELETED_NODE;
7261 AssertOp = ISD::AssertSext;
7262 else if (CLI.RetZExt)
7263 AssertOp = ISD::AssertZext;
7264 SmallVector<SDValue, 4> ReturnValues;
7265 unsigned CurReg = 0;
7266 for (unsigned I = 0, E = RetTys.size(); I != E; ++I) {
7268 MVT RegisterVT = getRegisterType(CLI.RetTy->getContext(), VT);
7269 unsigned NumRegs = getNumRegisters(CLI.RetTy->getContext(), VT);
7271 ReturnValues.push_back(getCopyFromParts(CLI.DAG, CLI.DL, &InVals[CurReg],
7272 NumRegs, RegisterVT, VT, NULL,
7277 // For a function returning void, there is no return value. We can't create
7278 // such a node, so we just return a null return value in that case. In
7279 // that case, nothing will actually look at the value.
7280 if (ReturnValues.empty())
7281 return std::make_pair(SDValue(), CLI.Chain);
7283 SDValue Res = CLI.DAG.getNode(ISD::MERGE_VALUES, CLI.DL,
7284 CLI.DAG.getVTList(&RetTys[0], RetTys.size()),
7285 &ReturnValues[0], ReturnValues.size());
7286 return std::make_pair(Res, CLI.Chain);
7289 void TargetLowering::LowerOperationWrapper(SDNode *N,
7290 SmallVectorImpl<SDValue> &Results,
7291 SelectionDAG &DAG) const {
7292 SDValue Res = LowerOperation(SDValue(N, 0), DAG);
7294 Results.push_back(Res);
7297 SDValue TargetLowering::LowerOperation(SDValue Op, SelectionDAG &DAG) const {
7298 llvm_unreachable("LowerOperation not implemented for this target!");
7302 SelectionDAGBuilder::CopyValueToVirtualRegister(const Value *V, unsigned Reg) {
7303 SDValue Op = getNonRegisterValue(V);
7304 assert((Op.getOpcode() != ISD::CopyFromReg ||
7305 cast<RegisterSDNode>(Op.getOperand(1))->getReg() != Reg) &&
7306 "Copy from a reg to the same reg!");
7307 assert(!TargetRegisterInfo::isPhysicalRegister(Reg) && "Is a physreg");
7309 const TargetLowering *TLI = TM.getTargetLowering();
7310 RegsForValue RFV(V->getContext(), *TLI, Reg, V->getType());
7311 SDValue Chain = DAG.getEntryNode();
7312 RFV.getCopyToRegs(Op, DAG, getCurSDLoc(), Chain, 0, V);
7313 PendingExports.push_back(Chain);
7316 #include "llvm/CodeGen/SelectionDAGISel.h"
7318 /// isOnlyUsedInEntryBlock - If the specified argument is only used in the
7319 /// entry block, return true. This includes arguments used by switches, since
7320 /// the switch may expand into multiple basic blocks.
7321 static bool isOnlyUsedInEntryBlock(const Argument *A, bool FastISel) {
7322 // With FastISel active, we may be splitting blocks, so force creation
7323 // of virtual registers for all non-dead arguments.
7325 return A->use_empty();
7327 const BasicBlock *Entry = A->getParent()->begin();
7328 for (const User *U : A->users())
7329 if (cast<Instruction>(U)->getParent() != Entry || isa<SwitchInst>(U))
7330 return false; // Use not in entry block.
7335 void SelectionDAGISel::LowerArguments(const Function &F) {
7336 SelectionDAG &DAG = SDB->DAG;
7337 SDLoc dl = SDB->getCurSDLoc();
7338 const TargetLowering *TLI = getTargetLowering();
7339 const DataLayout *DL = TLI->getDataLayout();
7340 SmallVector<ISD::InputArg, 16> Ins;
7342 if (!FuncInfo->CanLowerReturn) {
7343 // Put in an sret pointer parameter before all the other parameters.
7344 SmallVector<EVT, 1> ValueVTs;
7345 ComputeValueVTs(*getTargetLowering(),
7346 PointerType::getUnqual(F.getReturnType()), ValueVTs);
7348 // NOTE: Assuming that a pointer will never break down to more than one VT
7350 ISD::ArgFlagsTy Flags;
7352 MVT RegisterVT = TLI->getRegisterType(*DAG.getContext(), ValueVTs[0]);
7353 ISD::InputArg RetArg(Flags, RegisterVT, ValueVTs[0], true, 0, 0);
7354 Ins.push_back(RetArg);
7357 // Set up the incoming argument description vector.
7359 for (Function::const_arg_iterator I = F.arg_begin(), E = F.arg_end();
7360 I != E; ++I, ++Idx) {
7361 SmallVector<EVT, 4> ValueVTs;
7362 ComputeValueVTs(*TLI, I->getType(), ValueVTs);
7363 bool isArgValueUsed = !I->use_empty();
7364 unsigned PartBase = 0;
7365 for (unsigned Value = 0, NumValues = ValueVTs.size();
7366 Value != NumValues; ++Value) {
7367 EVT VT = ValueVTs[Value];
7368 Type *ArgTy = VT.getTypeForEVT(*DAG.getContext());
7369 ISD::ArgFlagsTy Flags;
7370 unsigned OriginalAlignment =
7371 DL->getABITypeAlignment(ArgTy);
7373 if (F.getAttributes().hasAttribute(Idx, Attribute::ZExt))
7375 if (F.getAttributes().hasAttribute(Idx, Attribute::SExt))
7377 if (F.getAttributes().hasAttribute(Idx, Attribute::InReg))
7379 if (F.getAttributes().hasAttribute(Idx, Attribute::StructRet))
7381 if (F.getAttributes().hasAttribute(Idx, Attribute::ByVal))
7383 if (F.getAttributes().hasAttribute(Idx, Attribute::InAlloca)) {
7384 Flags.setInAlloca();
7385 // Set the byval flag for CCAssignFn callbacks that don't know about
7386 // inalloca. This way we can know how many bytes we should've allocated
7387 // and how many bytes a callee cleanup function will pop. If we port
7388 // inalloca to more targets, we'll have to add custom inalloca handling
7389 // in the various CC lowering callbacks.
7392 if (Flags.isByVal() || Flags.isInAlloca()) {
7393 PointerType *Ty = cast<PointerType>(I->getType());
7394 Type *ElementTy = Ty->getElementType();
7395 Flags.setByValSize(DL->getTypeAllocSize(ElementTy));
7396 // For ByVal, alignment should be passed from FE. BE will guess if
7397 // this info is not there but there are cases it cannot get right.
7398 unsigned FrameAlign;
7399 if (F.getParamAlignment(Idx))
7400 FrameAlign = F.getParamAlignment(Idx);
7402 FrameAlign = TLI->getByValTypeAlignment(ElementTy);
7403 Flags.setByValAlign(FrameAlign);
7405 if (F.getAttributes().hasAttribute(Idx, Attribute::Nest))
7407 Flags.setOrigAlign(OriginalAlignment);
7409 MVT RegisterVT = TLI->getRegisterType(*CurDAG->getContext(), VT);
7410 unsigned NumRegs = TLI->getNumRegisters(*CurDAG->getContext(), VT);
7411 for (unsigned i = 0; i != NumRegs; ++i) {
7412 ISD::InputArg MyFlags(Flags, RegisterVT, VT, isArgValueUsed,
7413 Idx-1, PartBase+i*RegisterVT.getStoreSize());
7414 if (NumRegs > 1 && i == 0)
7415 MyFlags.Flags.setSplit();
7416 // if it isn't first piece, alignment must be 1
7418 MyFlags.Flags.setOrigAlign(1);
7419 Ins.push_back(MyFlags);
7421 PartBase += VT.getStoreSize();
7425 // Call the target to set up the argument values.
7426 SmallVector<SDValue, 8> InVals;
7427 SDValue NewRoot = TLI->LowerFormalArguments(DAG.getRoot(), F.getCallingConv(),
7431 // Verify that the target's LowerFormalArguments behaved as expected.
7432 assert(NewRoot.getNode() && NewRoot.getValueType() == MVT::Other &&
7433 "LowerFormalArguments didn't return a valid chain!");
7434 assert(InVals.size() == Ins.size() &&
7435 "LowerFormalArguments didn't emit the correct number of values!");
7437 for (unsigned i = 0, e = Ins.size(); i != e; ++i) {
7438 assert(InVals[i].getNode() &&
7439 "LowerFormalArguments emitted a null value!");
7440 assert(EVT(Ins[i].VT) == InVals[i].getValueType() &&
7441 "LowerFormalArguments emitted a value with the wrong type!");
7445 // Update the DAG with the new chain value resulting from argument lowering.
7446 DAG.setRoot(NewRoot);
7448 // Set up the argument values.
7451 if (!FuncInfo->CanLowerReturn) {
7452 // Create a virtual register for the sret pointer, and put in a copy
7453 // from the sret argument into it.
7454 SmallVector<EVT, 1> ValueVTs;
7455 ComputeValueVTs(*TLI, PointerType::getUnqual(F.getReturnType()), ValueVTs);
7456 MVT VT = ValueVTs[0].getSimpleVT();
7457 MVT RegVT = TLI->getRegisterType(*CurDAG->getContext(), VT);
7458 ISD::NodeType AssertOp = ISD::DELETED_NODE;
7459 SDValue ArgValue = getCopyFromParts(DAG, dl, &InVals[0], 1,
7460 RegVT, VT, NULL, AssertOp);
7462 MachineFunction& MF = SDB->DAG.getMachineFunction();
7463 MachineRegisterInfo& RegInfo = MF.getRegInfo();
7464 unsigned SRetReg = RegInfo.createVirtualRegister(TLI->getRegClassFor(RegVT));
7465 FuncInfo->DemoteRegister = SRetReg;
7466 NewRoot = SDB->DAG.getCopyToReg(NewRoot, SDB->getCurSDLoc(),
7468 DAG.setRoot(NewRoot);
7470 // i indexes lowered arguments. Bump it past the hidden sret argument.
7471 // Idx indexes LLVM arguments. Don't touch it.
7475 for (Function::const_arg_iterator I = F.arg_begin(), E = F.arg_end(); I != E;
7477 SmallVector<SDValue, 4> ArgValues;
7478 SmallVector<EVT, 4> ValueVTs;
7479 ComputeValueVTs(*TLI, I->getType(), ValueVTs);
7480 unsigned NumValues = ValueVTs.size();
7482 // If this argument is unused then remember its value. It is used to generate
7483 // debugging information.
7484 if (I->use_empty() && NumValues) {
7485 SDB->setUnusedArgValue(I, InVals[i]);
7487 // Also remember any frame index for use in FastISel.
7488 if (FrameIndexSDNode *FI =
7489 dyn_cast<FrameIndexSDNode>(InVals[i].getNode()))
7490 FuncInfo->setArgumentFrameIndex(I, FI->getIndex());
7493 for (unsigned Val = 0; Val != NumValues; ++Val) {
7494 EVT VT = ValueVTs[Val];
7495 MVT PartVT = TLI->getRegisterType(*CurDAG->getContext(), VT);
7496 unsigned NumParts = TLI->getNumRegisters(*CurDAG->getContext(), VT);
7498 if (!I->use_empty()) {
7499 ISD::NodeType AssertOp = ISD::DELETED_NODE;
7500 if (F.getAttributes().hasAttribute(Idx, Attribute::SExt))
7501 AssertOp = ISD::AssertSext;
7502 else if (F.getAttributes().hasAttribute(Idx, Attribute::ZExt))
7503 AssertOp = ISD::AssertZext;
7505 ArgValues.push_back(getCopyFromParts(DAG, dl, &InVals[i],
7506 NumParts, PartVT, VT,
7513 // We don't need to do anything else for unused arguments.
7514 if (ArgValues.empty())
7517 // Note down frame index.
7518 if (FrameIndexSDNode *FI =
7519 dyn_cast<FrameIndexSDNode>(ArgValues[0].getNode()))
7520 FuncInfo->setArgumentFrameIndex(I, FI->getIndex());
7522 SDValue Res = DAG.getMergeValues(&ArgValues[0], NumValues,
7523 SDB->getCurSDLoc());
7525 SDB->setValue(I, Res);
7526 if (!TM.Options.EnableFastISel && Res.getOpcode() == ISD::BUILD_PAIR) {
7527 if (LoadSDNode *LNode =
7528 dyn_cast<LoadSDNode>(Res.getOperand(0).getNode()))
7529 if (FrameIndexSDNode *FI =
7530 dyn_cast<FrameIndexSDNode>(LNode->getBasePtr().getNode()))
7531 FuncInfo->setArgumentFrameIndex(I, FI->getIndex());
7534 // If this argument is live outside of the entry block, insert a copy from
7535 // wherever we got it to the vreg that other BB's will reference it as.
7536 if (!TM.Options.EnableFastISel && Res.getOpcode() == ISD::CopyFromReg) {
7537 // If we can, though, try to skip creating an unnecessary vreg.
7538 // FIXME: This isn't very clean... it would be nice to make this more
7539 // general. It's also subtly incompatible with the hacks FastISel
7541 unsigned Reg = cast<RegisterSDNode>(Res.getOperand(1))->getReg();
7542 if (TargetRegisterInfo::isVirtualRegister(Reg)) {
7543 FuncInfo->ValueMap[I] = Reg;
7547 if (!isOnlyUsedInEntryBlock(I, TM.Options.EnableFastISel)) {
7548 FuncInfo->InitializeRegForValue(I);
7549 SDB->CopyToExportRegsIfNeeded(I);
7553 assert(i == InVals.size() && "Argument register count mismatch!");
7555 // Finally, if the target has anything special to do, allow it to do so.
7556 // FIXME: this should insert code into the DAG!
7557 EmitFunctionEntryCode();
7560 /// Handle PHI nodes in successor blocks. Emit code into the SelectionDAG to
7561 /// ensure constants are generated when needed. Remember the virtual registers
7562 /// that need to be added to the Machine PHI nodes as input. We cannot just
7563 /// directly add them, because expansion might result in multiple MBB's for one
7564 /// BB. As such, the start of the BB might correspond to a different MBB than
7568 SelectionDAGBuilder::HandlePHINodesInSuccessorBlocks(const BasicBlock *LLVMBB) {
7569 const TerminatorInst *TI = LLVMBB->getTerminator();
7571 SmallPtrSet<MachineBasicBlock *, 4> SuccsHandled;
7573 // Check successor nodes' PHI nodes that expect a constant to be available
7575 for (unsigned succ = 0, e = TI->getNumSuccessors(); succ != e; ++succ) {
7576 const BasicBlock *SuccBB = TI->getSuccessor(succ);
7577 if (!isa<PHINode>(SuccBB->begin())) continue;
7578 MachineBasicBlock *SuccMBB = FuncInfo.MBBMap[SuccBB];
7580 // If this terminator has multiple identical successors (common for
7581 // switches), only handle each succ once.
7582 if (!SuccsHandled.insert(SuccMBB)) continue;
7584 MachineBasicBlock::iterator MBBI = SuccMBB->begin();
7586 // At this point we know that there is a 1-1 correspondence between LLVM PHI
7587 // nodes and Machine PHI nodes, but the incoming operands have not been
7589 for (BasicBlock::const_iterator I = SuccBB->begin();
7590 const PHINode *PN = dyn_cast<PHINode>(I); ++I) {
7591 // Ignore dead phi's.
7592 if (PN->use_empty()) continue;
7595 if (PN->getType()->isEmptyTy())
7599 const Value *PHIOp = PN->getIncomingValueForBlock(LLVMBB);
7601 if (const Constant *C = dyn_cast<Constant>(PHIOp)) {
7602 unsigned &RegOut = ConstantsOut[C];
7604 RegOut = FuncInfo.CreateRegs(C->getType());
7605 CopyValueToVirtualRegister(C, RegOut);
7609 DenseMap<const Value *, unsigned>::iterator I =
7610 FuncInfo.ValueMap.find(PHIOp);
7611 if (I != FuncInfo.ValueMap.end())
7614 assert(isa<AllocaInst>(PHIOp) &&
7615 FuncInfo.StaticAllocaMap.count(cast<AllocaInst>(PHIOp)) &&
7616 "Didn't codegen value into a register!??");
7617 Reg = FuncInfo.CreateRegs(PHIOp->getType());
7618 CopyValueToVirtualRegister(PHIOp, Reg);
7622 // Remember that this register needs to added to the machine PHI node as
7623 // the input for this MBB.
7624 SmallVector<EVT, 4> ValueVTs;
7625 const TargetLowering *TLI = TM.getTargetLowering();
7626 ComputeValueVTs(*TLI, PN->getType(), ValueVTs);
7627 for (unsigned vti = 0, vte = ValueVTs.size(); vti != vte; ++vti) {
7628 EVT VT = ValueVTs[vti];
7629 unsigned NumRegisters = TLI->getNumRegisters(*DAG.getContext(), VT);
7630 for (unsigned i = 0, e = NumRegisters; i != e; ++i)
7631 FuncInfo.PHINodesToUpdate.push_back(std::make_pair(MBBI++, Reg+i));
7632 Reg += NumRegisters;
7637 ConstantsOut.clear();
7640 /// Add a successor MBB to ParentMBB< creating a new MachineBB for BB if SuccMBB
7643 SelectionDAGBuilder::StackProtectorDescriptor::
7644 AddSuccessorMBB(const BasicBlock *BB,
7645 MachineBasicBlock *ParentMBB,
7646 MachineBasicBlock *SuccMBB) {
7647 // If SuccBB has not been created yet, create it.
7649 MachineFunction *MF = ParentMBB->getParent();
7650 MachineFunction::iterator BBI = ParentMBB;
7651 SuccMBB = MF->CreateMachineBasicBlock(BB);
7652 MF->insert(++BBI, SuccMBB);
7654 // Add it as a successor of ParentMBB.
7655 ParentMBB->addSuccessor(SuccMBB);