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 #include "SelectionDAGBuilder.h"
15 #include "SDNodeDbgValue.h"
16 #include "llvm/ADT/BitVector.h"
17 #include "llvm/ADT/Optional.h"
18 #include "llvm/ADT/SmallSet.h"
19 #include "llvm/ADT/Statistic.h"
20 #include "llvm/Analysis/AliasAnalysis.h"
21 #include "llvm/Analysis/BranchProbabilityInfo.h"
22 #include "llvm/Analysis/ConstantFolding.h"
23 #include "llvm/Analysis/TargetLibraryInfo.h"
24 #include "llvm/Analysis/ValueTracking.h"
25 #include "llvm/CodeGen/Analysis.h"
26 #include "llvm/CodeGen/FastISel.h"
27 #include "llvm/CodeGen/FunctionLoweringInfo.h"
28 #include "llvm/CodeGen/GCMetadata.h"
29 #include "llvm/CodeGen/GCStrategy.h"
30 #include "llvm/CodeGen/MachineFrameInfo.h"
31 #include "llvm/CodeGen/MachineFunction.h"
32 #include "llvm/CodeGen/MachineInstrBuilder.h"
33 #include "llvm/CodeGen/MachineJumpTableInfo.h"
34 #include "llvm/CodeGen/MachineModuleInfo.h"
35 #include "llvm/CodeGen/MachineRegisterInfo.h"
36 #include "llvm/CodeGen/SelectionDAG.h"
37 #include "llvm/CodeGen/StackMaps.h"
38 #include "llvm/IR/CallingConv.h"
39 #include "llvm/IR/Constants.h"
40 #include "llvm/IR/DataLayout.h"
41 #include "llvm/IR/DebugInfo.h"
42 #include "llvm/IR/DerivedTypes.h"
43 #include "llvm/IR/Function.h"
44 #include "llvm/IR/GlobalVariable.h"
45 #include "llvm/IR/InlineAsm.h"
46 #include "llvm/IR/Instructions.h"
47 #include "llvm/IR/IntrinsicInst.h"
48 #include "llvm/IR/Intrinsics.h"
49 #include "llvm/IR/LLVMContext.h"
50 #include "llvm/IR/Module.h"
51 #include "llvm/IR/Statepoint.h"
52 #include "llvm/MC/MCSymbol.h"
53 #include "llvm/Support/CommandLine.h"
54 #include "llvm/Support/Debug.h"
55 #include "llvm/Support/ErrorHandling.h"
56 #include "llvm/Support/MathExtras.h"
57 #include "llvm/Support/raw_ostream.h"
58 #include "llvm/Target/TargetFrameLowering.h"
59 #include "llvm/Target/TargetInstrInfo.h"
60 #include "llvm/Target/TargetIntrinsicInfo.h"
61 #include "llvm/Target/TargetLowering.h"
62 #include "llvm/Target/TargetOptions.h"
63 #include "llvm/Target/TargetSelectionDAGInfo.h"
64 #include "llvm/Target/TargetSubtargetInfo.h"
68 #define DEBUG_TYPE "isel"
70 /// LimitFloatPrecision - Generate low-precision inline sequences for
71 /// some float libcalls (6, 8 or 12 bits).
72 static unsigned LimitFloatPrecision;
74 static cl::opt<unsigned, true>
75 LimitFPPrecision("limit-float-precision",
76 cl::desc("Generate low-precision inline sequences "
77 "for some float libcalls"),
78 cl::location(LimitFloatPrecision),
81 // Limit the width of DAG chains. This is important in general to prevent
82 // prevent DAG-based analysis from blowing up. For example, alias analysis and
83 // load clustering may not complete in reasonable time. It is difficult to
84 // recognize and avoid this situation within each individual analysis, and
85 // future analyses are likely to have the same behavior. Limiting DAG width is
86 // the safe approach, and will be especially important with global DAGs.
88 // MaxParallelChains default is arbitrarily high to avoid affecting
89 // optimization, but could be lowered to improve compile time. Any ld-ld-st-st
90 // sequence over this should have been converted to llvm.memcpy by the
91 // frontend. It easy to induce this behavior with .ll code such as:
92 // %buffer = alloca [4096 x i8]
93 // %data = load [4096 x i8]* %argPtr
94 // store [4096 x i8] %data, [4096 x i8]* %buffer
95 static const unsigned MaxParallelChains = 64;
97 static SDValue getCopyFromPartsVector(SelectionDAG &DAG, SDLoc DL,
98 const SDValue *Parts, unsigned NumParts,
99 MVT PartVT, EVT ValueVT, const Value *V);
101 /// getCopyFromParts - Create a value that contains the specified legal parts
102 /// combined into the value they represent. If the parts combine to a type
103 /// larger then ValueVT then AssertOp can be used to specify whether the extra
104 /// bits are known to be zero (ISD::AssertZext) or sign extended from ValueVT
105 /// (ISD::AssertSext).
106 static SDValue getCopyFromParts(SelectionDAG &DAG, SDLoc DL,
107 const SDValue *Parts,
108 unsigned NumParts, MVT PartVT, EVT ValueVT,
110 ISD::NodeType AssertOp = ISD::DELETED_NODE) {
111 if (ValueVT.isVector())
112 return getCopyFromPartsVector(DAG, DL, Parts, NumParts,
115 assert(NumParts > 0 && "No parts to assemble!");
116 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
117 SDValue Val = Parts[0];
120 // Assemble the value from multiple parts.
121 if (ValueVT.isInteger()) {
122 unsigned PartBits = PartVT.getSizeInBits();
123 unsigned ValueBits = ValueVT.getSizeInBits();
125 // Assemble the power of 2 part.
126 unsigned RoundParts = NumParts & (NumParts - 1) ?
127 1 << Log2_32(NumParts) : NumParts;
128 unsigned RoundBits = PartBits * RoundParts;
129 EVT RoundVT = RoundBits == ValueBits ?
130 ValueVT : EVT::getIntegerVT(*DAG.getContext(), RoundBits);
133 EVT HalfVT = EVT::getIntegerVT(*DAG.getContext(), RoundBits/2);
135 if (RoundParts > 2) {
136 Lo = getCopyFromParts(DAG, DL, Parts, RoundParts / 2,
138 Hi = getCopyFromParts(DAG, DL, Parts + RoundParts / 2,
139 RoundParts / 2, PartVT, HalfVT, V);
141 Lo = DAG.getNode(ISD::BITCAST, DL, HalfVT, Parts[0]);
142 Hi = DAG.getNode(ISD::BITCAST, DL, HalfVT, Parts[1]);
145 if (TLI.isBigEndian())
148 Val = DAG.getNode(ISD::BUILD_PAIR, DL, RoundVT, Lo, Hi);
150 if (RoundParts < NumParts) {
151 // Assemble the trailing non-power-of-2 part.
152 unsigned OddParts = NumParts - RoundParts;
153 EVT OddVT = EVT::getIntegerVT(*DAG.getContext(), OddParts * PartBits);
154 Hi = getCopyFromParts(DAG, DL,
155 Parts + RoundParts, OddParts, PartVT, OddVT, V);
157 // Combine the round and odd parts.
159 if (TLI.isBigEndian())
161 EVT TotalVT = EVT::getIntegerVT(*DAG.getContext(), NumParts * PartBits);
162 Hi = DAG.getNode(ISD::ANY_EXTEND, DL, TotalVT, Hi);
163 Hi = DAG.getNode(ISD::SHL, DL, TotalVT, Hi,
164 DAG.getConstant(Lo.getValueType().getSizeInBits(),
165 TLI.getPointerTy()));
166 Lo = DAG.getNode(ISD::ZERO_EXTEND, DL, TotalVT, Lo);
167 Val = DAG.getNode(ISD::OR, DL, TotalVT, Lo, Hi);
169 } else if (PartVT.isFloatingPoint()) {
170 // FP split into multiple FP parts (for ppcf128)
171 assert(ValueVT == EVT(MVT::ppcf128) && PartVT == MVT::f64 &&
174 Lo = DAG.getNode(ISD::BITCAST, DL, EVT(MVT::f64), Parts[0]);
175 Hi = DAG.getNode(ISD::BITCAST, DL, EVT(MVT::f64), Parts[1]);
176 if (TLI.hasBigEndianPartOrdering(ValueVT))
178 Val = DAG.getNode(ISD::BUILD_PAIR, DL, ValueVT, Lo, Hi);
180 // FP split into integer parts (soft fp)
181 assert(ValueVT.isFloatingPoint() && PartVT.isInteger() &&
182 !PartVT.isVector() && "Unexpected split");
183 EVT IntVT = EVT::getIntegerVT(*DAG.getContext(), ValueVT.getSizeInBits());
184 Val = getCopyFromParts(DAG, DL, Parts, NumParts, PartVT, IntVT, V);
188 // There is now one part, held in Val. Correct it to match ValueVT.
189 EVT PartEVT = Val.getValueType();
191 if (PartEVT == ValueVT)
194 if (PartEVT.isInteger() && ValueVT.isInteger()) {
195 if (ValueVT.bitsLT(PartEVT)) {
196 // For a truncate, see if we have any information to
197 // indicate whether the truncated bits will always be
198 // zero or sign-extension.
199 if (AssertOp != ISD::DELETED_NODE)
200 Val = DAG.getNode(AssertOp, DL, PartEVT, Val,
201 DAG.getValueType(ValueVT));
202 return DAG.getNode(ISD::TRUNCATE, DL, ValueVT, Val);
204 return DAG.getNode(ISD::ANY_EXTEND, DL, ValueVT, Val);
207 if (PartEVT.isFloatingPoint() && ValueVT.isFloatingPoint()) {
208 // FP_ROUND's are always exact here.
209 if (ValueVT.bitsLT(Val.getValueType()))
210 return DAG.getNode(ISD::FP_ROUND, DL, ValueVT, Val,
211 DAG.getTargetConstant(1, TLI.getPointerTy()));
213 return DAG.getNode(ISD::FP_EXTEND, DL, ValueVT, Val);
216 if (PartEVT.getSizeInBits() == ValueVT.getSizeInBits())
217 return DAG.getNode(ISD::BITCAST, DL, ValueVT, Val);
219 llvm_unreachable("Unknown mismatch!");
222 static void diagnosePossiblyInvalidConstraint(LLVMContext &Ctx, const Value *V,
223 const Twine &ErrMsg) {
224 const Instruction *I = dyn_cast_or_null<Instruction>(V);
226 return Ctx.emitError(ErrMsg);
228 const char *AsmError = ", possible invalid constraint for vector type";
229 if (const CallInst *CI = dyn_cast<CallInst>(I))
230 if (isa<InlineAsm>(CI->getCalledValue()))
231 return Ctx.emitError(I, ErrMsg + AsmError);
233 return Ctx.emitError(I, ErrMsg);
236 /// getCopyFromPartsVector - Create a value that contains the specified legal
237 /// parts combined into the value they represent. If the parts combine to a
238 /// type larger then ValueVT then AssertOp can be used to specify whether the
239 /// extra bits are known to be zero (ISD::AssertZext) or sign extended from
240 /// ValueVT (ISD::AssertSext).
241 static SDValue getCopyFromPartsVector(SelectionDAG &DAG, SDLoc DL,
242 const SDValue *Parts, unsigned NumParts,
243 MVT PartVT, EVT ValueVT, const Value *V) {
244 assert(ValueVT.isVector() && "Not a vector value");
245 assert(NumParts > 0 && "No parts to assemble!");
246 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
247 SDValue Val = Parts[0];
249 // Handle a multi-element vector.
253 unsigned NumIntermediates;
255 TLI.getVectorTypeBreakdown(*DAG.getContext(), ValueVT, IntermediateVT,
256 NumIntermediates, RegisterVT);
257 assert(NumRegs == NumParts && "Part count doesn't match vector breakdown!");
258 NumParts = NumRegs; // Silence a compiler warning.
259 assert(RegisterVT == PartVT && "Part type doesn't match vector breakdown!");
260 assert(RegisterVT == Parts[0].getSimpleValueType() &&
261 "Part type doesn't match part!");
263 // Assemble the parts into intermediate operands.
264 SmallVector<SDValue, 8> Ops(NumIntermediates);
265 if (NumIntermediates == NumParts) {
266 // If the register was not expanded, truncate or copy the value,
268 for (unsigned i = 0; i != NumParts; ++i)
269 Ops[i] = getCopyFromParts(DAG, DL, &Parts[i], 1,
270 PartVT, IntermediateVT, V);
271 } else if (NumParts > 0) {
272 // If the intermediate type was expanded, build the intermediate
273 // operands from the parts.
274 assert(NumParts % NumIntermediates == 0 &&
275 "Must expand into a divisible number of parts!");
276 unsigned Factor = NumParts / NumIntermediates;
277 for (unsigned i = 0; i != NumIntermediates; ++i)
278 Ops[i] = getCopyFromParts(DAG, DL, &Parts[i * Factor], Factor,
279 PartVT, IntermediateVT, V);
282 // Build a vector with BUILD_VECTOR or CONCAT_VECTORS from the
283 // intermediate operands.
284 Val = DAG.getNode(IntermediateVT.isVector() ? ISD::CONCAT_VECTORS
289 // There is now one part, held in Val. Correct it to match ValueVT.
290 EVT PartEVT = Val.getValueType();
292 if (PartEVT == ValueVT)
295 if (PartEVT.isVector()) {
296 // If the element type of the source/dest vectors are the same, but the
297 // parts vector has more elements than the value vector, then we have a
298 // vector widening case (e.g. <2 x float> -> <4 x float>). Extract the
300 if (PartEVT.getVectorElementType() == ValueVT.getVectorElementType()) {
301 assert(PartEVT.getVectorNumElements() > ValueVT.getVectorNumElements() &&
302 "Cannot narrow, it would be a lossy transformation");
303 return DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, ValueVT, Val,
304 DAG.getConstant(0, TLI.getVectorIdxTy()));
307 // Vector/Vector bitcast.
308 if (ValueVT.getSizeInBits() == PartEVT.getSizeInBits())
309 return DAG.getNode(ISD::BITCAST, DL, ValueVT, Val);
311 assert(PartEVT.getVectorNumElements() == ValueVT.getVectorNumElements() &&
312 "Cannot handle this kind of promotion");
313 // Promoted vector extract
314 bool Smaller = ValueVT.bitsLE(PartEVT);
315 return DAG.getNode((Smaller ? ISD::TRUNCATE : ISD::ANY_EXTEND),
320 // Trivial bitcast if the types are the same size and the destination
321 // vector type is legal.
322 if (PartEVT.getSizeInBits() == ValueVT.getSizeInBits() &&
323 TLI.isTypeLegal(ValueVT))
324 return DAG.getNode(ISD::BITCAST, DL, ValueVT, Val);
326 // Handle cases such as i8 -> <1 x i1>
327 if (ValueVT.getVectorNumElements() != 1) {
328 diagnosePossiblyInvalidConstraint(*DAG.getContext(), V,
329 "non-trivial scalar-to-vector conversion");
330 return DAG.getUNDEF(ValueVT);
333 if (ValueVT.getVectorNumElements() == 1 &&
334 ValueVT.getVectorElementType() != PartEVT) {
335 bool Smaller = ValueVT.bitsLE(PartEVT);
336 Val = DAG.getNode((Smaller ? ISD::TRUNCATE : ISD::ANY_EXTEND),
337 DL, ValueVT.getScalarType(), Val);
340 return DAG.getNode(ISD::BUILD_VECTOR, DL, ValueVT, Val);
343 static void getCopyToPartsVector(SelectionDAG &DAG, SDLoc dl,
344 SDValue Val, SDValue *Parts, unsigned NumParts,
345 MVT PartVT, const Value *V);
347 /// getCopyToParts - Create a series of nodes that contain the specified value
348 /// split into legal parts. If the parts contain more bits than Val, then, for
349 /// integers, ExtendKind can be used to specify how to generate the extra bits.
350 static void getCopyToParts(SelectionDAG &DAG, SDLoc DL,
351 SDValue Val, SDValue *Parts, unsigned NumParts,
352 MVT PartVT, const Value *V,
353 ISD::NodeType ExtendKind = ISD::ANY_EXTEND) {
354 EVT ValueVT = Val.getValueType();
356 // Handle the vector case separately.
357 if (ValueVT.isVector())
358 return getCopyToPartsVector(DAG, DL, Val, Parts, NumParts, PartVT, V);
360 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
361 unsigned PartBits = PartVT.getSizeInBits();
362 unsigned OrigNumParts = NumParts;
363 assert(TLI.isTypeLegal(PartVT) && "Copying to an illegal type!");
368 assert(!ValueVT.isVector() && "Vector case handled elsewhere");
369 EVT PartEVT = PartVT;
370 if (PartEVT == ValueVT) {
371 assert(NumParts == 1 && "No-op copy with multiple parts!");
376 if (NumParts * PartBits > ValueVT.getSizeInBits()) {
377 // If the parts cover more bits than the value has, promote the value.
378 if (PartVT.isFloatingPoint() && ValueVT.isFloatingPoint()) {
379 assert(NumParts == 1 && "Do not know what to promote to!");
380 Val = DAG.getNode(ISD::FP_EXTEND, DL, PartVT, Val);
382 assert((PartVT.isInteger() || PartVT == MVT::x86mmx) &&
383 ValueVT.isInteger() &&
384 "Unknown mismatch!");
385 ValueVT = EVT::getIntegerVT(*DAG.getContext(), NumParts * PartBits);
386 Val = DAG.getNode(ExtendKind, DL, ValueVT, Val);
387 if (PartVT == MVT::x86mmx)
388 Val = DAG.getNode(ISD::BITCAST, DL, PartVT, Val);
390 } else if (PartBits == ValueVT.getSizeInBits()) {
391 // Different types of the same size.
392 assert(NumParts == 1 && PartEVT != ValueVT);
393 Val = DAG.getNode(ISD::BITCAST, DL, PartVT, Val);
394 } else if (NumParts * PartBits < ValueVT.getSizeInBits()) {
395 // If the parts cover less bits than value has, truncate the value.
396 assert((PartVT.isInteger() || PartVT == MVT::x86mmx) &&
397 ValueVT.isInteger() &&
398 "Unknown mismatch!");
399 ValueVT = EVT::getIntegerVT(*DAG.getContext(), NumParts * PartBits);
400 Val = DAG.getNode(ISD::TRUNCATE, DL, ValueVT, Val);
401 if (PartVT == MVT::x86mmx)
402 Val = DAG.getNode(ISD::BITCAST, DL, PartVT, Val);
405 // The value may have changed - recompute ValueVT.
406 ValueVT = Val.getValueType();
407 assert(NumParts * PartBits == ValueVT.getSizeInBits() &&
408 "Failed to tile the value with PartVT!");
411 if (PartEVT != ValueVT)
412 diagnosePossiblyInvalidConstraint(*DAG.getContext(), V,
413 "scalar-to-vector conversion failed");
419 // Expand the value into multiple parts.
420 if (NumParts & (NumParts - 1)) {
421 // The number of parts is not a power of 2. Split off and copy the tail.
422 assert(PartVT.isInteger() && ValueVT.isInteger() &&
423 "Do not know what to expand to!");
424 unsigned RoundParts = 1 << Log2_32(NumParts);
425 unsigned RoundBits = RoundParts * PartBits;
426 unsigned OddParts = NumParts - RoundParts;
427 SDValue OddVal = DAG.getNode(ISD::SRL, DL, ValueVT, Val,
428 DAG.getIntPtrConstant(RoundBits));
429 getCopyToParts(DAG, DL, OddVal, Parts + RoundParts, OddParts, PartVT, V);
431 if (TLI.isBigEndian())
432 // The odd parts were reversed by getCopyToParts - unreverse them.
433 std::reverse(Parts + RoundParts, Parts + NumParts);
435 NumParts = RoundParts;
436 ValueVT = EVT::getIntegerVT(*DAG.getContext(), NumParts * PartBits);
437 Val = DAG.getNode(ISD::TRUNCATE, DL, ValueVT, Val);
440 // The number of parts is a power of 2. Repeatedly bisect the value using
442 Parts[0] = DAG.getNode(ISD::BITCAST, DL,
443 EVT::getIntegerVT(*DAG.getContext(),
444 ValueVT.getSizeInBits()),
447 for (unsigned StepSize = NumParts; StepSize > 1; StepSize /= 2) {
448 for (unsigned i = 0; i < NumParts; i += StepSize) {
449 unsigned ThisBits = StepSize * PartBits / 2;
450 EVT ThisVT = EVT::getIntegerVT(*DAG.getContext(), ThisBits);
451 SDValue &Part0 = Parts[i];
452 SDValue &Part1 = Parts[i+StepSize/2];
454 Part1 = DAG.getNode(ISD::EXTRACT_ELEMENT, DL,
455 ThisVT, Part0, DAG.getIntPtrConstant(1));
456 Part0 = DAG.getNode(ISD::EXTRACT_ELEMENT, DL,
457 ThisVT, Part0, DAG.getIntPtrConstant(0));
459 if (ThisBits == PartBits && ThisVT != PartVT) {
460 Part0 = DAG.getNode(ISD::BITCAST, DL, PartVT, Part0);
461 Part1 = DAG.getNode(ISD::BITCAST, DL, PartVT, Part1);
466 if (TLI.isBigEndian())
467 std::reverse(Parts, Parts + OrigNumParts);
471 /// getCopyToPartsVector - Create a series of nodes that contain the specified
472 /// value split into legal parts.
473 static void getCopyToPartsVector(SelectionDAG &DAG, SDLoc DL,
474 SDValue Val, SDValue *Parts, unsigned NumParts,
475 MVT PartVT, const Value *V) {
476 EVT ValueVT = Val.getValueType();
477 assert(ValueVT.isVector() && "Not a vector");
478 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
481 EVT PartEVT = PartVT;
482 if (PartEVT == ValueVT) {
484 } else if (PartVT.getSizeInBits() == ValueVT.getSizeInBits()) {
485 // Bitconvert vector->vector case.
486 Val = DAG.getNode(ISD::BITCAST, DL, PartVT, Val);
487 } else if (PartVT.isVector() &&
488 PartEVT.getVectorElementType() == ValueVT.getVectorElementType() &&
489 PartEVT.getVectorNumElements() > ValueVT.getVectorNumElements()) {
490 EVT ElementVT = PartVT.getVectorElementType();
491 // Vector widening case, e.g. <2 x float> -> <4 x float>. Shuffle in
493 SmallVector<SDValue, 16> Ops;
494 for (unsigned i = 0, e = ValueVT.getVectorNumElements(); i != e; ++i)
495 Ops.push_back(DAG.getNode(ISD::EXTRACT_VECTOR_ELT, DL,
496 ElementVT, Val, DAG.getConstant(i,
497 TLI.getVectorIdxTy())));
499 for (unsigned i = ValueVT.getVectorNumElements(),
500 e = PartVT.getVectorNumElements(); i != e; ++i)
501 Ops.push_back(DAG.getUNDEF(ElementVT));
503 Val = DAG.getNode(ISD::BUILD_VECTOR, DL, PartVT, Ops);
505 // FIXME: Use CONCAT for 2x -> 4x.
507 //SDValue UndefElts = DAG.getUNDEF(VectorTy);
508 //Val = DAG.getNode(ISD::CONCAT_VECTORS, DL, PartVT, Val, UndefElts);
509 } else if (PartVT.isVector() &&
510 PartEVT.getVectorElementType().bitsGE(
511 ValueVT.getVectorElementType()) &&
512 PartEVT.getVectorNumElements() == ValueVT.getVectorNumElements()) {
514 // Promoted vector extract
515 bool Smaller = PartEVT.bitsLE(ValueVT);
516 Val = DAG.getNode((Smaller ? ISD::TRUNCATE : ISD::ANY_EXTEND),
519 // Vector -> scalar conversion.
520 assert(ValueVT.getVectorNumElements() == 1 &&
521 "Only trivial vector-to-scalar conversions should get here!");
522 Val = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, DL,
523 PartVT, Val, DAG.getConstant(0, TLI.getVectorIdxTy()));
525 bool Smaller = ValueVT.bitsLE(PartVT);
526 Val = DAG.getNode((Smaller ? ISD::TRUNCATE : ISD::ANY_EXTEND),
534 // Handle a multi-element vector.
537 unsigned NumIntermediates;
538 unsigned NumRegs = TLI.getVectorTypeBreakdown(*DAG.getContext(), ValueVT,
540 NumIntermediates, RegisterVT);
541 unsigned NumElements = ValueVT.getVectorNumElements();
543 assert(NumRegs == NumParts && "Part count doesn't match vector breakdown!");
544 NumParts = NumRegs; // Silence a compiler warning.
545 assert(RegisterVT == PartVT && "Part type doesn't match vector breakdown!");
547 // Split the vector into intermediate operands.
548 SmallVector<SDValue, 8> Ops(NumIntermediates);
549 for (unsigned i = 0; i != NumIntermediates; ++i) {
550 if (IntermediateVT.isVector())
551 Ops[i] = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL,
553 DAG.getConstant(i * (NumElements / NumIntermediates),
554 TLI.getVectorIdxTy()));
556 Ops[i] = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, DL,
558 DAG.getConstant(i, TLI.getVectorIdxTy()));
561 // Split the intermediate operands into legal parts.
562 if (NumParts == NumIntermediates) {
563 // If the register was not expanded, promote or copy the value,
565 for (unsigned i = 0; i != NumParts; ++i)
566 getCopyToParts(DAG, DL, Ops[i], &Parts[i], 1, PartVT, V);
567 } else if (NumParts > 0) {
568 // If the intermediate type was expanded, split each the value into
570 assert(NumIntermediates != 0 && "division by zero");
571 assert(NumParts % NumIntermediates == 0 &&
572 "Must expand into a divisible number of parts!");
573 unsigned Factor = NumParts / NumIntermediates;
574 for (unsigned i = 0; i != NumIntermediates; ++i)
575 getCopyToParts(DAG, DL, Ops[i], &Parts[i*Factor], Factor, PartVT, V);
580 /// RegsForValue - This struct represents the registers (physical or virtual)
581 /// that a particular set of values is assigned, and the type information
582 /// about the value. The most common situation is to represent one value at a
583 /// time, but struct or array values are handled element-wise as multiple
584 /// values. The splitting of aggregates is performed recursively, so that we
585 /// never have aggregate-typed registers. The values at this point do not
586 /// necessarily have legal types, so each value may require one or more
587 /// registers of some legal type.
589 struct RegsForValue {
590 /// ValueVTs - The value types of the values, which may not be legal, and
591 /// may need be promoted or synthesized from one or more registers.
593 SmallVector<EVT, 4> ValueVTs;
595 /// RegVTs - The value types of the registers. This is the same size as
596 /// ValueVTs and it records, for each value, what the type of the assigned
597 /// register or registers are. (Individual values are never synthesized
598 /// from more than one type of register.)
600 /// With virtual registers, the contents of RegVTs is redundant with TLI's
601 /// getRegisterType member function, however when with physical registers
602 /// it is necessary to have a separate record of the types.
604 SmallVector<MVT, 4> RegVTs;
606 /// Regs - This list holds the registers assigned to the values.
607 /// Each legal or promoted value requires one register, and each
608 /// expanded value requires multiple registers.
610 SmallVector<unsigned, 4> Regs;
614 RegsForValue(const SmallVector<unsigned, 4> ®s,
615 MVT regvt, EVT valuevt)
616 : ValueVTs(1, valuevt), RegVTs(1, regvt), Regs(regs) {}
618 RegsForValue(LLVMContext &Context, const TargetLowering &tli,
619 unsigned Reg, Type *Ty) {
620 ComputeValueVTs(tli, Ty, ValueVTs);
622 for (unsigned Value = 0, e = ValueVTs.size(); Value != e; ++Value) {
623 EVT ValueVT = ValueVTs[Value];
624 unsigned NumRegs = tli.getNumRegisters(Context, ValueVT);
625 MVT RegisterVT = tli.getRegisterType(Context, ValueVT);
626 for (unsigned i = 0; i != NumRegs; ++i)
627 Regs.push_back(Reg + i);
628 RegVTs.push_back(RegisterVT);
633 /// append - Add the specified values to this one.
634 void append(const RegsForValue &RHS) {
635 ValueVTs.append(RHS.ValueVTs.begin(), RHS.ValueVTs.end());
636 RegVTs.append(RHS.RegVTs.begin(), RHS.RegVTs.end());
637 Regs.append(RHS.Regs.begin(), RHS.Regs.end());
640 /// getCopyFromRegs - Emit a series of CopyFromReg nodes that copies from
641 /// this value and returns the result as a ValueVTs value. This uses
642 /// Chain/Flag as the input and updates them for the output Chain/Flag.
643 /// If the Flag pointer is NULL, no flag is used.
644 SDValue getCopyFromRegs(SelectionDAG &DAG, FunctionLoweringInfo &FuncInfo,
646 SDValue &Chain, SDValue *Flag,
647 const Value *V = nullptr) const;
649 /// getCopyToRegs - Emit a series of CopyToReg nodes that copies the
650 /// specified value into the registers specified by this object. This uses
651 /// Chain/Flag as the input and updates them for the output Chain/Flag.
652 /// If the Flag pointer is NULL, no flag is used.
654 getCopyToRegs(SDValue Val, SelectionDAG &DAG, SDLoc dl, SDValue &Chain,
655 SDValue *Flag, const Value *V,
656 ISD::NodeType PreferredExtendType = ISD::ANY_EXTEND) const;
658 /// AddInlineAsmOperands - Add this value to the specified inlineasm node
659 /// operand list. This adds the code marker, matching input operand index
660 /// (if applicable), and includes the number of values added into it.
661 void AddInlineAsmOperands(unsigned Kind,
662 bool HasMatching, unsigned MatchingIdx,
664 std::vector<SDValue> &Ops) const;
668 /// getCopyFromRegs - Emit a series of CopyFromReg nodes that copies from
669 /// this value and returns the result as a ValueVT value. This uses
670 /// Chain/Flag as the input and updates them for the output Chain/Flag.
671 /// If the Flag pointer is NULL, no flag is used.
672 SDValue RegsForValue::getCopyFromRegs(SelectionDAG &DAG,
673 FunctionLoweringInfo &FuncInfo,
675 SDValue &Chain, SDValue *Flag,
676 const Value *V) const {
677 // A Value with type {} or [0 x %t] needs no registers.
678 if (ValueVTs.empty())
681 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
683 // Assemble the legal parts into the final values.
684 SmallVector<SDValue, 4> Values(ValueVTs.size());
685 SmallVector<SDValue, 8> Parts;
686 for (unsigned Value = 0, Part = 0, e = ValueVTs.size(); Value != e; ++Value) {
687 // Copy the legal parts from the registers.
688 EVT ValueVT = ValueVTs[Value];
689 unsigned NumRegs = TLI.getNumRegisters(*DAG.getContext(), ValueVT);
690 MVT RegisterVT = RegVTs[Value];
692 Parts.resize(NumRegs);
693 for (unsigned i = 0; i != NumRegs; ++i) {
696 P = DAG.getCopyFromReg(Chain, dl, Regs[Part+i], RegisterVT);
698 P = DAG.getCopyFromReg(Chain, dl, Regs[Part+i], RegisterVT, *Flag);
699 *Flag = P.getValue(2);
702 Chain = P.getValue(1);
705 // If the source register was virtual and if we know something about it,
706 // add an assert node.
707 if (!TargetRegisterInfo::isVirtualRegister(Regs[Part+i]) ||
708 !RegisterVT.isInteger() || RegisterVT.isVector())
711 const FunctionLoweringInfo::LiveOutInfo *LOI =
712 FuncInfo.GetLiveOutRegInfo(Regs[Part+i]);
716 unsigned RegSize = RegisterVT.getSizeInBits();
717 unsigned NumSignBits = LOI->NumSignBits;
718 unsigned NumZeroBits = LOI->KnownZero.countLeadingOnes();
720 if (NumZeroBits == RegSize) {
721 // The current value is a zero.
722 // Explicitly express that as it would be easier for
723 // optimizations to kick in.
724 Parts[i] = DAG.getConstant(0, RegisterVT);
728 // FIXME: We capture more information than the dag can represent. For
729 // now, just use the tightest assertzext/assertsext possible.
731 EVT FromVT(MVT::Other);
732 if (NumSignBits == RegSize)
733 isSExt = true, FromVT = MVT::i1; // ASSERT SEXT 1
734 else if (NumZeroBits >= RegSize-1)
735 isSExt = false, FromVT = MVT::i1; // ASSERT ZEXT 1
736 else if (NumSignBits > RegSize-8)
737 isSExt = true, FromVT = MVT::i8; // ASSERT SEXT 8
738 else if (NumZeroBits >= RegSize-8)
739 isSExt = false, FromVT = MVT::i8; // ASSERT ZEXT 8
740 else if (NumSignBits > RegSize-16)
741 isSExt = true, FromVT = MVT::i16; // ASSERT SEXT 16
742 else if (NumZeroBits >= RegSize-16)
743 isSExt = false, FromVT = MVT::i16; // ASSERT ZEXT 16
744 else if (NumSignBits > RegSize-32)
745 isSExt = true, FromVT = MVT::i32; // ASSERT SEXT 32
746 else if (NumZeroBits >= RegSize-32)
747 isSExt = false, FromVT = MVT::i32; // ASSERT ZEXT 32
751 // Add an assertion node.
752 assert(FromVT != MVT::Other);
753 Parts[i] = DAG.getNode(isSExt ? ISD::AssertSext : ISD::AssertZext, dl,
754 RegisterVT, P, DAG.getValueType(FromVT));
757 Values[Value] = getCopyFromParts(DAG, dl, Parts.begin(),
758 NumRegs, RegisterVT, ValueVT, V);
763 return DAG.getNode(ISD::MERGE_VALUES, dl, DAG.getVTList(ValueVTs), Values);
766 /// getCopyToRegs - Emit a series of CopyToReg nodes that copies the
767 /// specified value into the registers specified by this object. This uses
768 /// Chain/Flag as the input and updates them for the output Chain/Flag.
769 /// If the Flag pointer is NULL, no flag is used.
770 void RegsForValue::getCopyToRegs(SDValue Val, SelectionDAG &DAG, SDLoc dl,
771 SDValue &Chain, SDValue *Flag, const Value *V,
772 ISD::NodeType PreferredExtendType) const {
773 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
774 ISD::NodeType ExtendKind = PreferredExtendType;
776 // Get the list of the values's legal parts.
777 unsigned NumRegs = Regs.size();
778 SmallVector<SDValue, 8> Parts(NumRegs);
779 for (unsigned Value = 0, Part = 0, e = ValueVTs.size(); Value != e; ++Value) {
780 EVT ValueVT = ValueVTs[Value];
781 unsigned NumParts = TLI.getNumRegisters(*DAG.getContext(), ValueVT);
782 MVT RegisterVT = RegVTs[Value];
784 if (ExtendKind == ISD::ANY_EXTEND && TLI.isZExtFree(Val, RegisterVT))
785 ExtendKind = ISD::ZERO_EXTEND;
787 getCopyToParts(DAG, dl, Val.getValue(Val.getResNo() + Value),
788 &Parts[Part], NumParts, RegisterVT, V, ExtendKind);
792 // Copy the parts into the registers.
793 SmallVector<SDValue, 8> Chains(NumRegs);
794 for (unsigned i = 0; i != NumRegs; ++i) {
797 Part = DAG.getCopyToReg(Chain, dl, Regs[i], Parts[i]);
799 Part = DAG.getCopyToReg(Chain, dl, Regs[i], Parts[i], *Flag);
800 *Flag = Part.getValue(1);
803 Chains[i] = Part.getValue(0);
806 if (NumRegs == 1 || Flag)
807 // If NumRegs > 1 && Flag is used then the use of the last CopyToReg is
808 // flagged to it. That is the CopyToReg nodes and the user are considered
809 // a single scheduling unit. If we create a TokenFactor and return it as
810 // chain, then the TokenFactor is both a predecessor (operand) of the
811 // user as well as a successor (the TF operands are flagged to the user).
812 // c1, f1 = CopyToReg
813 // c2, f2 = CopyToReg
814 // c3 = TokenFactor c1, c2
817 Chain = Chains[NumRegs-1];
819 Chain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Chains);
822 /// AddInlineAsmOperands - Add this value to the specified inlineasm node
823 /// operand list. This adds the code marker and includes the number of
824 /// values added into it.
825 void RegsForValue::AddInlineAsmOperands(unsigned Code, bool HasMatching,
826 unsigned MatchingIdx,
828 std::vector<SDValue> &Ops) const {
829 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
831 unsigned Flag = InlineAsm::getFlagWord(Code, Regs.size());
833 Flag = InlineAsm::getFlagWordForMatchingOp(Flag, MatchingIdx);
834 else if (!Regs.empty() &&
835 TargetRegisterInfo::isVirtualRegister(Regs.front())) {
836 // Put the register class of the virtual registers in the flag word. That
837 // way, later passes can recompute register class constraints for inline
838 // assembly as well as normal instructions.
839 // Don't do this for tied operands that can use the regclass information
841 const MachineRegisterInfo &MRI = DAG.getMachineFunction().getRegInfo();
842 const TargetRegisterClass *RC = MRI.getRegClass(Regs.front());
843 Flag = InlineAsm::getFlagWordForRegClass(Flag, RC->getID());
846 SDValue Res = DAG.getTargetConstant(Flag, MVT::i32);
849 unsigned SP = TLI.getStackPointerRegisterToSaveRestore();
850 for (unsigned Value = 0, Reg = 0, e = ValueVTs.size(); Value != e; ++Value) {
851 unsigned NumRegs = TLI.getNumRegisters(*DAG.getContext(), ValueVTs[Value]);
852 MVT RegisterVT = RegVTs[Value];
853 for (unsigned i = 0; i != NumRegs; ++i) {
854 assert(Reg < Regs.size() && "Mismatch in # registers expected");
855 unsigned TheReg = Regs[Reg++];
856 Ops.push_back(DAG.getRegister(TheReg, RegisterVT));
858 if (TheReg == SP && Code == InlineAsm::Kind_Clobber) {
859 // If we clobbered the stack pointer, MFI should know about it.
860 assert(DAG.getMachineFunction().getFrameInfo()->
861 hasInlineAsmWithSPAdjust());
867 void SelectionDAGBuilder::init(GCFunctionInfo *gfi, AliasAnalysis &aa,
868 const TargetLibraryInfo *li) {
872 DL = DAG.getTarget().getDataLayout();
873 Context = DAG.getContext();
874 LPadToCallSiteMap.clear();
877 /// clear - Clear out the current SelectionDAG and the associated
878 /// state and prepare this SelectionDAGBuilder object to be used
879 /// for a new block. This doesn't clear out information about
880 /// additional blocks that are needed to complete switch lowering
881 /// or PHI node updating; that information is cleared out as it is
883 void SelectionDAGBuilder::clear() {
885 UnusedArgNodeMap.clear();
886 PendingLoads.clear();
887 PendingExports.clear();
890 SDNodeOrder = LowestSDNodeOrder;
891 StatepointLowering.clear();
894 /// clearDanglingDebugInfo - Clear the dangling debug information
895 /// map. This function is separated from the clear so that debug
896 /// information that is dangling in a basic block can be properly
897 /// resolved in a different basic block. This allows the
898 /// SelectionDAG to resolve dangling debug information attached
900 void SelectionDAGBuilder::clearDanglingDebugInfo() {
901 DanglingDebugInfoMap.clear();
904 /// getRoot - Return the current virtual root of the Selection DAG,
905 /// flushing any PendingLoad items. This must be done before emitting
906 /// a store or any other node that may need to be ordered after any
907 /// prior load instructions.
909 SDValue SelectionDAGBuilder::getRoot() {
910 if (PendingLoads.empty())
911 return DAG.getRoot();
913 if (PendingLoads.size() == 1) {
914 SDValue Root = PendingLoads[0];
916 PendingLoads.clear();
920 // Otherwise, we have to make a token factor node.
921 SDValue Root = DAG.getNode(ISD::TokenFactor, getCurSDLoc(), MVT::Other,
923 PendingLoads.clear();
928 /// getControlRoot - Similar to getRoot, but instead of flushing all the
929 /// PendingLoad items, flush all the PendingExports items. It is necessary
930 /// to do this before emitting a terminator instruction.
932 SDValue SelectionDAGBuilder::getControlRoot() {
933 SDValue Root = DAG.getRoot();
935 if (PendingExports.empty())
938 // Turn all of the CopyToReg chains into one factored node.
939 if (Root.getOpcode() != ISD::EntryToken) {
940 unsigned i = 0, e = PendingExports.size();
941 for (; i != e; ++i) {
942 assert(PendingExports[i].getNode()->getNumOperands() > 1);
943 if (PendingExports[i].getNode()->getOperand(0) == Root)
944 break; // Don't add the root if we already indirectly depend on it.
948 PendingExports.push_back(Root);
951 Root = DAG.getNode(ISD::TokenFactor, getCurSDLoc(), MVT::Other,
953 PendingExports.clear();
958 void SelectionDAGBuilder::visit(const Instruction &I) {
959 // Set up outgoing PHI node register values before emitting the terminator.
960 if (isa<TerminatorInst>(&I))
961 HandlePHINodesInSuccessorBlocks(I.getParent());
967 visit(I.getOpcode(), I);
969 if (!isa<TerminatorInst>(&I) && !HasTailCall)
970 CopyToExportRegsIfNeeded(&I);
975 void SelectionDAGBuilder::visitPHI(const PHINode &) {
976 llvm_unreachable("SelectionDAGBuilder shouldn't visit PHI nodes!");
979 void SelectionDAGBuilder::visit(unsigned Opcode, const User &I) {
980 // Note: this doesn't use InstVisitor, because it has to work with
981 // ConstantExpr's in addition to instructions.
983 default: llvm_unreachable("Unknown instruction type encountered!");
984 // Build the switch statement using the Instruction.def file.
985 #define HANDLE_INST(NUM, OPCODE, CLASS) \
986 case Instruction::OPCODE: visit##OPCODE((const CLASS&)I); break;
987 #include "llvm/IR/Instruction.def"
991 // resolveDanglingDebugInfo - if we saw an earlier dbg_value referring to V,
992 // generate the debug data structures now that we've seen its definition.
993 void SelectionDAGBuilder::resolveDanglingDebugInfo(const Value *V,
995 DanglingDebugInfo &DDI = DanglingDebugInfoMap[V];
997 const DbgValueInst *DI = DDI.getDI();
998 DebugLoc dl = DDI.getdl();
999 unsigned DbgSDNodeOrder = DDI.getSDNodeOrder();
1000 MDNode *Variable = DI->getVariable();
1001 MDNode *Expr = DI->getExpression();
1002 uint64_t Offset = DI->getOffset();
1003 // A dbg.value for an alloca is always indirect.
1004 bool IsIndirect = isa<AllocaInst>(V) || Offset != 0;
1006 if (Val.getNode()) {
1007 if (!EmitFuncArgumentDbgValue(V, Variable, Expr, Offset, IsIndirect,
1009 SDV = DAG.getDbgValue(Variable, Expr, Val.getNode(), Val.getResNo(),
1010 IsIndirect, Offset, dl, DbgSDNodeOrder);
1011 DAG.AddDbgValue(SDV, Val.getNode(), false);
1014 DEBUG(dbgs() << "Dropping debug info for " << *DI << "\n");
1015 DanglingDebugInfoMap[V] = DanglingDebugInfo();
1019 /// getCopyFromRegs - If there was virtual register allocated for the value V
1020 /// emit CopyFromReg of the specified type Ty. Return empty SDValue() otherwise.
1021 SDValue SelectionDAGBuilder::getCopyFromRegs(const Value *V, Type *Ty) {
1022 DenseMap<const Value *, unsigned>::iterator It = FuncInfo.ValueMap.find(V);
1025 if (It != FuncInfo.ValueMap.end()) {
1026 unsigned InReg = It->second;
1027 RegsForValue RFV(*DAG.getContext(), DAG.getTargetLoweringInfo(), InReg,
1029 SDValue Chain = DAG.getEntryNode();
1030 res = RFV.getCopyFromRegs(DAG, FuncInfo, getCurSDLoc(), Chain, nullptr, V);
1031 resolveDanglingDebugInfo(V, res);
1037 /// getValue - Return an SDValue for the given Value.
1038 SDValue SelectionDAGBuilder::getValue(const Value *V) {
1039 // If we already have an SDValue for this value, use it. It's important
1040 // to do this first, so that we don't create a CopyFromReg if we already
1041 // have a regular SDValue.
1042 SDValue &N = NodeMap[V];
1043 if (N.getNode()) return N;
1045 // If there's a virtual register allocated and initialized for this
1047 SDValue copyFromReg = getCopyFromRegs(V, V->getType());
1048 if (copyFromReg.getNode()) {
1052 // Otherwise create a new SDValue and remember it.
1053 SDValue Val = getValueImpl(V);
1055 resolveDanglingDebugInfo(V, Val);
1059 /// getNonRegisterValue - Return an SDValue for the given Value, but
1060 /// don't look in FuncInfo.ValueMap for a virtual register.
1061 SDValue SelectionDAGBuilder::getNonRegisterValue(const Value *V) {
1062 // If we already have an SDValue for this value, use it.
1063 SDValue &N = NodeMap[V];
1064 if (N.getNode()) return N;
1066 // Otherwise create a new SDValue and remember it.
1067 SDValue Val = getValueImpl(V);
1069 resolveDanglingDebugInfo(V, Val);
1073 /// getValueImpl - Helper function for getValue and getNonRegisterValue.
1074 /// Create an SDValue for the given value.
1075 SDValue SelectionDAGBuilder::getValueImpl(const Value *V) {
1076 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
1078 if (const Constant *C = dyn_cast<Constant>(V)) {
1079 EVT VT = TLI.getValueType(V->getType(), true);
1081 if (const ConstantInt *CI = dyn_cast<ConstantInt>(C))
1082 return DAG.getConstant(*CI, VT);
1084 if (const GlobalValue *GV = dyn_cast<GlobalValue>(C))
1085 return DAG.getGlobalAddress(GV, getCurSDLoc(), VT);
1087 if (isa<ConstantPointerNull>(C)) {
1088 unsigned AS = V->getType()->getPointerAddressSpace();
1089 return DAG.getConstant(0, TLI.getPointerTy(AS));
1092 if (const ConstantFP *CFP = dyn_cast<ConstantFP>(C))
1093 return DAG.getConstantFP(*CFP, VT);
1095 if (isa<UndefValue>(C) && !V->getType()->isAggregateType())
1096 return DAG.getUNDEF(VT);
1098 if (const ConstantExpr *CE = dyn_cast<ConstantExpr>(C)) {
1099 visit(CE->getOpcode(), *CE);
1100 SDValue N1 = NodeMap[V];
1101 assert(N1.getNode() && "visit didn't populate the NodeMap!");
1105 if (isa<ConstantStruct>(C) || isa<ConstantArray>(C)) {
1106 SmallVector<SDValue, 4> Constants;
1107 for (User::const_op_iterator OI = C->op_begin(), OE = C->op_end();
1109 SDNode *Val = getValue(*OI).getNode();
1110 // If the operand is an empty aggregate, there are no values.
1112 // Add each leaf value from the operand to the Constants list
1113 // to form a flattened list of all the values.
1114 for (unsigned i = 0, e = Val->getNumValues(); i != e; ++i)
1115 Constants.push_back(SDValue(Val, i));
1118 return DAG.getMergeValues(Constants, getCurSDLoc());
1121 if (const ConstantDataSequential *CDS =
1122 dyn_cast<ConstantDataSequential>(C)) {
1123 SmallVector<SDValue, 4> Ops;
1124 for (unsigned i = 0, e = CDS->getNumElements(); i != e; ++i) {
1125 SDNode *Val = getValue(CDS->getElementAsConstant(i)).getNode();
1126 // Add each leaf value from the operand to the Constants list
1127 // to form a flattened list of all the values.
1128 for (unsigned i = 0, e = Val->getNumValues(); i != e; ++i)
1129 Ops.push_back(SDValue(Val, i));
1132 if (isa<ArrayType>(CDS->getType()))
1133 return DAG.getMergeValues(Ops, getCurSDLoc());
1134 return NodeMap[V] = DAG.getNode(ISD::BUILD_VECTOR, getCurSDLoc(),
1138 if (C->getType()->isStructTy() || C->getType()->isArrayTy()) {
1139 assert((isa<ConstantAggregateZero>(C) || isa<UndefValue>(C)) &&
1140 "Unknown struct or array constant!");
1142 SmallVector<EVT, 4> ValueVTs;
1143 ComputeValueVTs(TLI, C->getType(), ValueVTs);
1144 unsigned NumElts = ValueVTs.size();
1146 return SDValue(); // empty struct
1147 SmallVector<SDValue, 4> Constants(NumElts);
1148 for (unsigned i = 0; i != NumElts; ++i) {
1149 EVT EltVT = ValueVTs[i];
1150 if (isa<UndefValue>(C))
1151 Constants[i] = DAG.getUNDEF(EltVT);
1152 else if (EltVT.isFloatingPoint())
1153 Constants[i] = DAG.getConstantFP(0, EltVT);
1155 Constants[i] = DAG.getConstant(0, EltVT);
1158 return DAG.getMergeValues(Constants, getCurSDLoc());
1161 if (const BlockAddress *BA = dyn_cast<BlockAddress>(C))
1162 return DAG.getBlockAddress(BA, VT);
1164 VectorType *VecTy = cast<VectorType>(V->getType());
1165 unsigned NumElements = VecTy->getNumElements();
1167 // Now that we know the number and type of the elements, get that number of
1168 // elements into the Ops array based on what kind of constant it is.
1169 SmallVector<SDValue, 16> Ops;
1170 if (const ConstantVector *CV = dyn_cast<ConstantVector>(C)) {
1171 for (unsigned i = 0; i != NumElements; ++i)
1172 Ops.push_back(getValue(CV->getOperand(i)));
1174 assert(isa<ConstantAggregateZero>(C) && "Unknown vector constant!");
1175 EVT EltVT = TLI.getValueType(VecTy->getElementType());
1178 if (EltVT.isFloatingPoint())
1179 Op = DAG.getConstantFP(0, EltVT);
1181 Op = DAG.getConstant(0, EltVT);
1182 Ops.assign(NumElements, Op);
1185 // Create a BUILD_VECTOR node.
1186 return NodeMap[V] = DAG.getNode(ISD::BUILD_VECTOR, getCurSDLoc(), VT, Ops);
1189 // If this is a static alloca, generate it as the frameindex instead of
1191 if (const AllocaInst *AI = dyn_cast<AllocaInst>(V)) {
1192 DenseMap<const AllocaInst*, int>::iterator SI =
1193 FuncInfo.StaticAllocaMap.find(AI);
1194 if (SI != FuncInfo.StaticAllocaMap.end())
1195 return DAG.getFrameIndex(SI->second, TLI.getPointerTy());
1198 // If this is an instruction which fast-isel has deferred, select it now.
1199 if (const Instruction *Inst = dyn_cast<Instruction>(V)) {
1200 unsigned InReg = FuncInfo.InitializeRegForValue(Inst);
1201 RegsForValue RFV(*DAG.getContext(), TLI, InReg, Inst->getType());
1202 SDValue Chain = DAG.getEntryNode();
1203 return RFV.getCopyFromRegs(DAG, FuncInfo, getCurSDLoc(), Chain, nullptr, V);
1206 llvm_unreachable("Can't get register for value!");
1209 void SelectionDAGBuilder::visitRet(const ReturnInst &I) {
1210 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
1211 SDValue Chain = getControlRoot();
1212 SmallVector<ISD::OutputArg, 8> Outs;
1213 SmallVector<SDValue, 8> OutVals;
1215 if (!FuncInfo.CanLowerReturn) {
1216 unsigned DemoteReg = FuncInfo.DemoteRegister;
1217 const Function *F = I.getParent()->getParent();
1219 // Emit a store of the return value through the virtual register.
1220 // Leave Outs empty so that LowerReturn won't try to load return
1221 // registers the usual way.
1222 SmallVector<EVT, 1> PtrValueVTs;
1223 ComputeValueVTs(TLI, PointerType::getUnqual(F->getReturnType()),
1226 SDValue RetPtr = DAG.getRegister(DemoteReg, PtrValueVTs[0]);
1227 SDValue RetOp = getValue(I.getOperand(0));
1229 SmallVector<EVT, 4> ValueVTs;
1230 SmallVector<uint64_t, 4> Offsets;
1231 ComputeValueVTs(TLI, I.getOperand(0)->getType(), ValueVTs, &Offsets);
1232 unsigned NumValues = ValueVTs.size();
1234 SmallVector<SDValue, 4> Chains(NumValues);
1235 for (unsigned i = 0; i != NumValues; ++i) {
1236 SDValue Add = DAG.getNode(ISD::ADD, getCurSDLoc(),
1237 RetPtr.getValueType(), RetPtr,
1238 DAG.getIntPtrConstant(Offsets[i]));
1240 DAG.getStore(Chain, getCurSDLoc(),
1241 SDValue(RetOp.getNode(), RetOp.getResNo() + i),
1242 // FIXME: better loc info would be nice.
1243 Add, MachinePointerInfo(), false, false, 0);
1246 Chain = DAG.getNode(ISD::TokenFactor, getCurSDLoc(),
1247 MVT::Other, Chains);
1248 } else if (I.getNumOperands() != 0) {
1249 SmallVector<EVT, 4> ValueVTs;
1250 ComputeValueVTs(TLI, I.getOperand(0)->getType(), ValueVTs);
1251 unsigned NumValues = ValueVTs.size();
1253 SDValue RetOp = getValue(I.getOperand(0));
1255 const Function *F = I.getParent()->getParent();
1257 ISD::NodeType ExtendKind = ISD::ANY_EXTEND;
1258 if (F->getAttributes().hasAttribute(AttributeSet::ReturnIndex,
1260 ExtendKind = ISD::SIGN_EXTEND;
1261 else if (F->getAttributes().hasAttribute(AttributeSet::ReturnIndex,
1263 ExtendKind = ISD::ZERO_EXTEND;
1265 LLVMContext &Context = F->getContext();
1266 bool RetInReg = F->getAttributes().hasAttribute(AttributeSet::ReturnIndex,
1269 for (unsigned j = 0; j != NumValues; ++j) {
1270 EVT VT = ValueVTs[j];
1272 if (ExtendKind != ISD::ANY_EXTEND && VT.isInteger())
1273 VT = TLI.getTypeForExtArgOrReturn(Context, VT, ExtendKind);
1275 unsigned NumParts = TLI.getNumRegisters(Context, VT);
1276 MVT PartVT = TLI.getRegisterType(Context, VT);
1277 SmallVector<SDValue, 4> Parts(NumParts);
1278 getCopyToParts(DAG, getCurSDLoc(),
1279 SDValue(RetOp.getNode(), RetOp.getResNo() + j),
1280 &Parts[0], NumParts, PartVT, &I, ExtendKind);
1282 // 'inreg' on function refers to return value
1283 ISD::ArgFlagsTy Flags = ISD::ArgFlagsTy();
1287 // Propagate extension type if any
1288 if (ExtendKind == ISD::SIGN_EXTEND)
1290 else if (ExtendKind == ISD::ZERO_EXTEND)
1293 for (unsigned i = 0; i < NumParts; ++i) {
1294 Outs.push_back(ISD::OutputArg(Flags, Parts[i].getValueType(),
1295 VT, /*isfixed=*/true, 0, 0));
1296 OutVals.push_back(Parts[i]);
1302 bool isVarArg = DAG.getMachineFunction().getFunction()->isVarArg();
1303 CallingConv::ID CallConv =
1304 DAG.getMachineFunction().getFunction()->getCallingConv();
1305 Chain = DAG.getTargetLoweringInfo().LowerReturn(
1306 Chain, CallConv, isVarArg, Outs, OutVals, getCurSDLoc(), DAG);
1308 // Verify that the target's LowerReturn behaved as expected.
1309 assert(Chain.getNode() && Chain.getValueType() == MVT::Other &&
1310 "LowerReturn didn't return a valid chain!");
1312 // Update the DAG with the new chain value resulting from return lowering.
1316 /// CopyToExportRegsIfNeeded - If the given value has virtual registers
1317 /// created for it, emit nodes to copy the value into the virtual
1319 void SelectionDAGBuilder::CopyToExportRegsIfNeeded(const Value *V) {
1321 if (V->getType()->isEmptyTy())
1324 DenseMap<const Value *, unsigned>::iterator VMI = FuncInfo.ValueMap.find(V);
1325 if (VMI != FuncInfo.ValueMap.end()) {
1326 assert(!V->use_empty() && "Unused value assigned virtual registers!");
1327 CopyValueToVirtualRegister(V, VMI->second);
1331 /// ExportFromCurrentBlock - If this condition isn't known to be exported from
1332 /// the current basic block, add it to ValueMap now so that we'll get a
1334 void SelectionDAGBuilder::ExportFromCurrentBlock(const Value *V) {
1335 // No need to export constants.
1336 if (!isa<Instruction>(V) && !isa<Argument>(V)) return;
1338 // Already exported?
1339 if (FuncInfo.isExportedInst(V)) return;
1341 unsigned Reg = FuncInfo.InitializeRegForValue(V);
1342 CopyValueToVirtualRegister(V, Reg);
1345 bool SelectionDAGBuilder::isExportableFromCurrentBlock(const Value *V,
1346 const BasicBlock *FromBB) {
1347 // The operands of the setcc have to be in this block. We don't know
1348 // how to export them from some other block.
1349 if (const Instruction *VI = dyn_cast<Instruction>(V)) {
1350 // Can export from current BB.
1351 if (VI->getParent() == FromBB)
1354 // Is already exported, noop.
1355 return FuncInfo.isExportedInst(V);
1358 // If this is an argument, we can export it if the BB is the entry block or
1359 // if it is already exported.
1360 if (isa<Argument>(V)) {
1361 if (FromBB == &FromBB->getParent()->getEntryBlock())
1364 // Otherwise, can only export this if it is already exported.
1365 return FuncInfo.isExportedInst(V);
1368 // Otherwise, constants can always be exported.
1372 /// Return branch probability calculated by BranchProbabilityInfo for IR blocks.
1373 uint32_t SelectionDAGBuilder::getEdgeWeight(const MachineBasicBlock *Src,
1374 const MachineBasicBlock *Dst) const {
1375 BranchProbabilityInfo *BPI = FuncInfo.BPI;
1378 const BasicBlock *SrcBB = Src->getBasicBlock();
1379 const BasicBlock *DstBB = Dst->getBasicBlock();
1380 return BPI->getEdgeWeight(SrcBB, DstBB);
1383 void SelectionDAGBuilder::
1384 addSuccessorWithWeight(MachineBasicBlock *Src, MachineBasicBlock *Dst,
1385 uint32_t Weight /* = 0 */) {
1387 Weight = getEdgeWeight(Src, Dst);
1388 Src->addSuccessor(Dst, Weight);
1392 static bool InBlock(const Value *V, const BasicBlock *BB) {
1393 if (const Instruction *I = dyn_cast<Instruction>(V))
1394 return I->getParent() == BB;
1398 /// EmitBranchForMergedCondition - Helper method for FindMergedConditions.
1399 /// This function emits a branch and is used at the leaves of an OR or an
1400 /// AND operator tree.
1403 SelectionDAGBuilder::EmitBranchForMergedCondition(const Value *Cond,
1404 MachineBasicBlock *TBB,
1405 MachineBasicBlock *FBB,
1406 MachineBasicBlock *CurBB,
1407 MachineBasicBlock *SwitchBB,
1410 const BasicBlock *BB = CurBB->getBasicBlock();
1412 // If the leaf of the tree is a comparison, merge the condition into
1414 if (const CmpInst *BOp = dyn_cast<CmpInst>(Cond)) {
1415 // The operands of the cmp have to be in this block. We don't know
1416 // how to export them from some other block. If this is the first block
1417 // of the sequence, no exporting is needed.
1418 if (CurBB == SwitchBB ||
1419 (isExportableFromCurrentBlock(BOp->getOperand(0), BB) &&
1420 isExportableFromCurrentBlock(BOp->getOperand(1), BB))) {
1421 ISD::CondCode Condition;
1422 if (const ICmpInst *IC = dyn_cast<ICmpInst>(Cond)) {
1423 Condition = getICmpCondCode(IC->getPredicate());
1424 } else if (const FCmpInst *FC = dyn_cast<FCmpInst>(Cond)) {
1425 Condition = getFCmpCondCode(FC->getPredicate());
1426 if (TM.Options.NoNaNsFPMath)
1427 Condition = getFCmpCodeWithoutNaN(Condition);
1429 (void)Condition; // silence warning.
1430 llvm_unreachable("Unknown compare instruction");
1433 CaseBlock CB(Condition, BOp->getOperand(0), BOp->getOperand(1), nullptr,
1434 TBB, FBB, CurBB, TWeight, FWeight);
1435 SwitchCases.push_back(CB);
1440 // Create a CaseBlock record representing this branch.
1441 CaseBlock CB(ISD::SETEQ, Cond, ConstantInt::getTrue(*DAG.getContext()),
1442 nullptr, TBB, FBB, CurBB, TWeight, FWeight);
1443 SwitchCases.push_back(CB);
1446 /// Scale down both weights to fit into uint32_t.
1447 static void ScaleWeights(uint64_t &NewTrue, uint64_t &NewFalse) {
1448 uint64_t NewMax = (NewTrue > NewFalse) ? NewTrue : NewFalse;
1449 uint32_t Scale = (NewMax / UINT32_MAX) + 1;
1450 NewTrue = NewTrue / Scale;
1451 NewFalse = NewFalse / Scale;
1454 /// FindMergedConditions - If Cond is an expression like
1455 void SelectionDAGBuilder::FindMergedConditions(const Value *Cond,
1456 MachineBasicBlock *TBB,
1457 MachineBasicBlock *FBB,
1458 MachineBasicBlock *CurBB,
1459 MachineBasicBlock *SwitchBB,
1460 unsigned Opc, uint32_t TWeight,
1462 // If this node is not part of the or/and tree, emit it as a branch.
1463 const Instruction *BOp = dyn_cast<Instruction>(Cond);
1464 if (!BOp || !(isa<BinaryOperator>(BOp) || isa<CmpInst>(BOp)) ||
1465 (unsigned)BOp->getOpcode() != Opc || !BOp->hasOneUse() ||
1466 BOp->getParent() != CurBB->getBasicBlock() ||
1467 !InBlock(BOp->getOperand(0), CurBB->getBasicBlock()) ||
1468 !InBlock(BOp->getOperand(1), CurBB->getBasicBlock())) {
1469 EmitBranchForMergedCondition(Cond, TBB, FBB, CurBB, SwitchBB,
1474 // Create TmpBB after CurBB.
1475 MachineFunction::iterator BBI = CurBB;
1476 MachineFunction &MF = DAG.getMachineFunction();
1477 MachineBasicBlock *TmpBB = MF.CreateMachineBasicBlock(CurBB->getBasicBlock());
1478 CurBB->getParent()->insert(++BBI, TmpBB);
1480 if (Opc == Instruction::Or) {
1481 // Codegen X | Y as:
1490 // We have flexibility in setting Prob for BB1 and Prob for TmpBB.
1491 // The requirement is that
1492 // TrueProb for BB1 + (FalseProb for BB1 * TrueProb for TmpBB)
1493 // = TrueProb for orignal BB.
1494 // Assuming the orignal weights are A and B, one choice is to set BB1's
1495 // weights to A and A+2B, and set TmpBB's weights to A and 2B. This choice
1497 // TrueProb for BB1 == FalseProb for BB1 * TrueProb for TmpBB.
1498 // Another choice is to assume TrueProb for BB1 equals to TrueProb for
1499 // TmpBB, but the math is more complicated.
1501 uint64_t NewTrueWeight = TWeight;
1502 uint64_t NewFalseWeight = (uint64_t)TWeight + 2 * (uint64_t)FWeight;
1503 ScaleWeights(NewTrueWeight, NewFalseWeight);
1504 // Emit the LHS condition.
1505 FindMergedConditions(BOp->getOperand(0), TBB, TmpBB, CurBB, SwitchBB, Opc,
1506 NewTrueWeight, NewFalseWeight);
1508 NewTrueWeight = TWeight;
1509 NewFalseWeight = 2 * (uint64_t)FWeight;
1510 ScaleWeights(NewTrueWeight, NewFalseWeight);
1511 // Emit the RHS condition into TmpBB.
1512 FindMergedConditions(BOp->getOperand(1), TBB, FBB, TmpBB, SwitchBB, Opc,
1513 NewTrueWeight, NewFalseWeight);
1515 assert(Opc == Instruction::And && "Unknown merge op!");
1516 // Codegen X & Y as:
1524 // This requires creation of TmpBB after CurBB.
1526 // We have flexibility in setting Prob for BB1 and Prob for TmpBB.
1527 // The requirement is that
1528 // FalseProb for BB1 + (TrueProb for BB1 * FalseProb for TmpBB)
1529 // = FalseProb for orignal BB.
1530 // Assuming the orignal weights are A and B, one choice is to set BB1's
1531 // weights to 2A+B and B, and set TmpBB's weights to 2A and B. This choice
1533 // FalseProb for BB1 == TrueProb for BB1 * FalseProb for TmpBB.
1535 uint64_t NewTrueWeight = 2 * (uint64_t)TWeight + (uint64_t)FWeight;
1536 uint64_t NewFalseWeight = FWeight;
1537 ScaleWeights(NewTrueWeight, NewFalseWeight);
1538 // Emit the LHS condition.
1539 FindMergedConditions(BOp->getOperand(0), TmpBB, FBB, CurBB, SwitchBB, Opc,
1540 NewTrueWeight, NewFalseWeight);
1542 NewTrueWeight = 2 * (uint64_t)TWeight;
1543 NewFalseWeight = FWeight;
1544 ScaleWeights(NewTrueWeight, NewFalseWeight);
1545 // Emit the RHS condition into TmpBB.
1546 FindMergedConditions(BOp->getOperand(1), TBB, FBB, TmpBB, SwitchBB, Opc,
1547 NewTrueWeight, NewFalseWeight);
1551 /// If the set of cases should be emitted as a series of branches, return true.
1552 /// If we should emit this as a bunch of and/or'd together conditions, return
1555 SelectionDAGBuilder::ShouldEmitAsBranches(const std::vector<CaseBlock> &Cases) {
1556 if (Cases.size() != 2) return true;
1558 // If this is two comparisons of the same values or'd or and'd together, they
1559 // will get folded into a single comparison, so don't emit two blocks.
1560 if ((Cases[0].CmpLHS == Cases[1].CmpLHS &&
1561 Cases[0].CmpRHS == Cases[1].CmpRHS) ||
1562 (Cases[0].CmpRHS == Cases[1].CmpLHS &&
1563 Cases[0].CmpLHS == Cases[1].CmpRHS)) {
1567 // Handle: (X != null) | (Y != null) --> (X|Y) != 0
1568 // Handle: (X == null) & (Y == null) --> (X|Y) == 0
1569 if (Cases[0].CmpRHS == Cases[1].CmpRHS &&
1570 Cases[0].CC == Cases[1].CC &&
1571 isa<Constant>(Cases[0].CmpRHS) &&
1572 cast<Constant>(Cases[0].CmpRHS)->isNullValue()) {
1573 if (Cases[0].CC == ISD::SETEQ && Cases[0].TrueBB == Cases[1].ThisBB)
1575 if (Cases[0].CC == ISD::SETNE && Cases[0].FalseBB == Cases[1].ThisBB)
1582 void SelectionDAGBuilder::visitBr(const BranchInst &I) {
1583 MachineBasicBlock *BrMBB = FuncInfo.MBB;
1585 // Update machine-CFG edges.
1586 MachineBasicBlock *Succ0MBB = FuncInfo.MBBMap[I.getSuccessor(0)];
1588 // Figure out which block is immediately after the current one.
1589 MachineBasicBlock *NextBlock = nullptr;
1590 MachineFunction::iterator BBI = BrMBB;
1591 if (++BBI != FuncInfo.MF->end())
1594 if (I.isUnconditional()) {
1595 // Update machine-CFG edges.
1596 BrMBB->addSuccessor(Succ0MBB);
1598 // If this is not a fall-through branch or optimizations are switched off,
1600 if (Succ0MBB != NextBlock || TM.getOptLevel() == CodeGenOpt::None)
1601 DAG.setRoot(DAG.getNode(ISD::BR, getCurSDLoc(),
1602 MVT::Other, getControlRoot(),
1603 DAG.getBasicBlock(Succ0MBB)));
1608 // If this condition is one of the special cases we handle, do special stuff
1610 const Value *CondVal = I.getCondition();
1611 MachineBasicBlock *Succ1MBB = FuncInfo.MBBMap[I.getSuccessor(1)];
1613 // If this is a series of conditions that are or'd or and'd together, emit
1614 // this as a sequence of branches instead of setcc's with and/or operations.
1615 // As long as jumps are not expensive, this should improve performance.
1616 // For example, instead of something like:
1629 if (const BinaryOperator *BOp = dyn_cast<BinaryOperator>(CondVal)) {
1630 if (!DAG.getTargetLoweringInfo().isJumpExpensive() &&
1631 BOp->hasOneUse() && (BOp->getOpcode() == Instruction::And ||
1632 BOp->getOpcode() == Instruction::Or)) {
1633 FindMergedConditions(BOp, Succ0MBB, Succ1MBB, BrMBB, BrMBB,
1634 BOp->getOpcode(), getEdgeWeight(BrMBB, Succ0MBB),
1635 getEdgeWeight(BrMBB, Succ1MBB));
1636 // If the compares in later blocks need to use values not currently
1637 // exported from this block, export them now. This block should always
1638 // be the first entry.
1639 assert(SwitchCases[0].ThisBB == BrMBB && "Unexpected lowering!");
1641 // Allow some cases to be rejected.
1642 if (ShouldEmitAsBranches(SwitchCases)) {
1643 for (unsigned i = 1, e = SwitchCases.size(); i != e; ++i) {
1644 ExportFromCurrentBlock(SwitchCases[i].CmpLHS);
1645 ExportFromCurrentBlock(SwitchCases[i].CmpRHS);
1648 // Emit the branch for this block.
1649 visitSwitchCase(SwitchCases[0], BrMBB);
1650 SwitchCases.erase(SwitchCases.begin());
1654 // Okay, we decided not to do this, remove any inserted MBB's and clear
1656 for (unsigned i = 1, e = SwitchCases.size(); i != e; ++i)
1657 FuncInfo.MF->erase(SwitchCases[i].ThisBB);
1659 SwitchCases.clear();
1663 // Create a CaseBlock record representing this branch.
1664 CaseBlock CB(ISD::SETEQ, CondVal, ConstantInt::getTrue(*DAG.getContext()),
1665 nullptr, Succ0MBB, Succ1MBB, BrMBB);
1667 // Use visitSwitchCase to actually insert the fast branch sequence for this
1669 visitSwitchCase(CB, BrMBB);
1672 /// visitSwitchCase - Emits the necessary code to represent a single node in
1673 /// the binary search tree resulting from lowering a switch instruction.
1674 void SelectionDAGBuilder::visitSwitchCase(CaseBlock &CB,
1675 MachineBasicBlock *SwitchBB) {
1677 SDValue CondLHS = getValue(CB.CmpLHS);
1678 SDLoc dl = getCurSDLoc();
1680 // Build the setcc now.
1682 // Fold "(X == true)" to X and "(X == false)" to !X to
1683 // handle common cases produced by branch lowering.
1684 if (CB.CmpRHS == ConstantInt::getTrue(*DAG.getContext()) &&
1685 CB.CC == ISD::SETEQ)
1687 else if (CB.CmpRHS == ConstantInt::getFalse(*DAG.getContext()) &&
1688 CB.CC == ISD::SETEQ) {
1689 SDValue True = DAG.getConstant(1, CondLHS.getValueType());
1690 Cond = DAG.getNode(ISD::XOR, dl, CondLHS.getValueType(), CondLHS, True);
1692 Cond = DAG.getSetCC(dl, MVT::i1, CondLHS, getValue(CB.CmpRHS), CB.CC);
1694 assert(CB.CC == ISD::SETLE && "Can handle only LE ranges now");
1696 const APInt& Low = cast<ConstantInt>(CB.CmpLHS)->getValue();
1697 const APInt& High = cast<ConstantInt>(CB.CmpRHS)->getValue();
1699 SDValue CmpOp = getValue(CB.CmpMHS);
1700 EVT VT = CmpOp.getValueType();
1702 if (cast<ConstantInt>(CB.CmpLHS)->isMinValue(true)) {
1703 Cond = DAG.getSetCC(dl, MVT::i1, CmpOp, DAG.getConstant(High, VT),
1706 SDValue SUB = DAG.getNode(ISD::SUB, dl,
1707 VT, CmpOp, DAG.getConstant(Low, VT));
1708 Cond = DAG.getSetCC(dl, MVT::i1, SUB,
1709 DAG.getConstant(High-Low, VT), ISD::SETULE);
1713 // Update successor info
1714 addSuccessorWithWeight(SwitchBB, CB.TrueBB, CB.TrueWeight);
1715 // TrueBB and FalseBB are always different unless the incoming IR is
1716 // degenerate. This only happens when running llc on weird IR.
1717 if (CB.TrueBB != CB.FalseBB)
1718 addSuccessorWithWeight(SwitchBB, CB.FalseBB, CB.FalseWeight);
1720 // Set NextBlock to be the MBB immediately after the current one, if any.
1721 // This is used to avoid emitting unnecessary branches to the next block.
1722 MachineBasicBlock *NextBlock = nullptr;
1723 MachineFunction::iterator BBI = SwitchBB;
1724 if (++BBI != FuncInfo.MF->end())
1727 // If the lhs block is the next block, invert the condition so that we can
1728 // fall through to the lhs instead of the rhs block.
1729 if (CB.TrueBB == NextBlock) {
1730 std::swap(CB.TrueBB, CB.FalseBB);
1731 SDValue True = DAG.getConstant(1, Cond.getValueType());
1732 Cond = DAG.getNode(ISD::XOR, dl, Cond.getValueType(), Cond, True);
1735 SDValue BrCond = DAG.getNode(ISD::BRCOND, dl,
1736 MVT::Other, getControlRoot(), Cond,
1737 DAG.getBasicBlock(CB.TrueBB));
1739 // Insert the false branch. Do this even if it's a fall through branch,
1740 // this makes it easier to do DAG optimizations which require inverting
1741 // the branch condition.
1742 BrCond = DAG.getNode(ISD::BR, dl, MVT::Other, BrCond,
1743 DAG.getBasicBlock(CB.FalseBB));
1745 DAG.setRoot(BrCond);
1748 /// visitJumpTable - Emit JumpTable node in the current MBB
1749 void SelectionDAGBuilder::visitJumpTable(JumpTable &JT) {
1750 // Emit the code for the jump table
1751 assert(JT.Reg != -1U && "Should lower JT Header first!");
1752 EVT PTy = DAG.getTargetLoweringInfo().getPointerTy();
1753 SDValue Index = DAG.getCopyFromReg(getControlRoot(), getCurSDLoc(),
1755 SDValue Table = DAG.getJumpTable(JT.JTI, PTy);
1756 SDValue BrJumpTable = DAG.getNode(ISD::BR_JT, getCurSDLoc(),
1757 MVT::Other, Index.getValue(1),
1759 DAG.setRoot(BrJumpTable);
1762 /// visitJumpTableHeader - This function emits necessary code to produce index
1763 /// in the JumpTable from switch case.
1764 void SelectionDAGBuilder::visitJumpTableHeader(JumpTable &JT,
1765 JumpTableHeader &JTH,
1766 MachineBasicBlock *SwitchBB) {
1767 // Subtract the lowest switch case value from the value being switched on and
1768 // conditional branch to default mbb if the result is greater than the
1769 // difference between smallest and largest cases.
1770 SDValue SwitchOp = getValue(JTH.SValue);
1771 EVT VT = SwitchOp.getValueType();
1772 SDValue Sub = DAG.getNode(ISD::SUB, getCurSDLoc(), VT, SwitchOp,
1773 DAG.getConstant(JTH.First, VT));
1775 // The SDNode we just created, which holds the value being switched on minus
1776 // the smallest case value, needs to be copied to a virtual register so it
1777 // can be used as an index into the jump table in a subsequent basic block.
1778 // This value may be smaller or larger than the target's pointer type, and
1779 // therefore require extension or truncating.
1780 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
1781 SwitchOp = DAG.getZExtOrTrunc(Sub, getCurSDLoc(), TLI.getPointerTy());
1783 unsigned JumpTableReg = FuncInfo.CreateReg(TLI.getPointerTy());
1784 SDValue CopyTo = DAG.getCopyToReg(getControlRoot(), getCurSDLoc(),
1785 JumpTableReg, SwitchOp);
1786 JT.Reg = JumpTableReg;
1788 // Emit the range check for the jump table, and branch to the default block
1789 // for the switch statement if the value being switched on exceeds the largest
1790 // case in the switch.
1792 DAG.getSetCC(getCurSDLoc(), TLI.getSetCCResultType(*DAG.getContext(),
1793 Sub.getValueType()),
1794 Sub, DAG.getConstant(JTH.Last - JTH.First, VT), ISD::SETUGT);
1796 // Set NextBlock to be the MBB immediately after the current one, if any.
1797 // This is used to avoid emitting unnecessary branches to the next block.
1798 MachineBasicBlock *NextBlock = nullptr;
1799 MachineFunction::iterator BBI = SwitchBB;
1801 if (++BBI != FuncInfo.MF->end())
1804 SDValue BrCond = DAG.getNode(ISD::BRCOND, getCurSDLoc(),
1805 MVT::Other, CopyTo, CMP,
1806 DAG.getBasicBlock(JT.Default));
1808 if (JT.MBB != NextBlock)
1809 BrCond = DAG.getNode(ISD::BR, getCurSDLoc(), MVT::Other, BrCond,
1810 DAG.getBasicBlock(JT.MBB));
1812 DAG.setRoot(BrCond);
1815 /// Codegen a new tail for a stack protector check ParentMBB which has had its
1816 /// tail spliced into a stack protector check success bb.
1818 /// For a high level explanation of how this fits into the stack protector
1819 /// generation see the comment on the declaration of class
1820 /// StackProtectorDescriptor.
1821 void SelectionDAGBuilder::visitSPDescriptorParent(StackProtectorDescriptor &SPD,
1822 MachineBasicBlock *ParentBB) {
1824 // First create the loads to the guard/stack slot for the comparison.
1825 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
1826 EVT PtrTy = TLI.getPointerTy();
1828 MachineFrameInfo *MFI = ParentBB->getParent()->getFrameInfo();
1829 int FI = MFI->getStackProtectorIndex();
1831 const Value *IRGuard = SPD.getGuard();
1832 SDValue GuardPtr = getValue(IRGuard);
1833 SDValue StackSlotPtr = DAG.getFrameIndex(FI, PtrTy);
1836 TLI.getDataLayout()->getPrefTypeAlignment(IRGuard->getType());
1840 // If GuardReg is set and useLoadStackGuardNode returns true, retrieve the
1841 // guard value from the virtual register holding the value. Otherwise, emit a
1842 // volatile load to retrieve the stack guard value.
1843 unsigned GuardReg = SPD.getGuardReg();
1845 if (GuardReg && TLI.useLoadStackGuardNode())
1846 Guard = DAG.getCopyFromReg(DAG.getEntryNode(), getCurSDLoc(), GuardReg,
1849 Guard = DAG.getLoad(PtrTy, getCurSDLoc(), DAG.getEntryNode(),
1850 GuardPtr, MachinePointerInfo(IRGuard, 0),
1851 true, false, false, Align);
1853 SDValue StackSlot = DAG.getLoad(PtrTy, getCurSDLoc(), DAG.getEntryNode(),
1855 MachinePointerInfo::getFixedStack(FI),
1856 true, false, false, Align);
1858 // Perform the comparison via a subtract/getsetcc.
1859 EVT VT = Guard.getValueType();
1860 SDValue Sub = DAG.getNode(ISD::SUB, getCurSDLoc(), VT, Guard, StackSlot);
1863 DAG.getSetCC(getCurSDLoc(), TLI.getSetCCResultType(*DAG.getContext(),
1864 Sub.getValueType()),
1865 Sub, DAG.getConstant(0, VT), ISD::SETNE);
1867 // If the sub is not 0, then we know the guard/stackslot do not equal, so
1868 // branch to failure MBB.
1869 SDValue BrCond = DAG.getNode(ISD::BRCOND, getCurSDLoc(),
1870 MVT::Other, StackSlot.getOperand(0),
1871 Cmp, DAG.getBasicBlock(SPD.getFailureMBB()));
1872 // Otherwise branch to success MBB.
1873 SDValue Br = DAG.getNode(ISD::BR, getCurSDLoc(),
1875 DAG.getBasicBlock(SPD.getSuccessMBB()));
1880 /// Codegen the failure basic block for a stack protector check.
1882 /// A failure stack protector machine basic block consists simply of a call to
1883 /// __stack_chk_fail().
1885 /// For a high level explanation of how this fits into the stack protector
1886 /// generation see the comment on the declaration of class
1887 /// StackProtectorDescriptor.
1889 SelectionDAGBuilder::visitSPDescriptorFailure(StackProtectorDescriptor &SPD) {
1890 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
1892 TLI.makeLibCall(DAG, RTLIB::STACKPROTECTOR_CHECK_FAIL, MVT::isVoid,
1893 nullptr, 0, false, getCurSDLoc(), false, false).second;
1897 /// visitBitTestHeader - This function emits necessary code to produce value
1898 /// suitable for "bit tests"
1899 void SelectionDAGBuilder::visitBitTestHeader(BitTestBlock &B,
1900 MachineBasicBlock *SwitchBB) {
1901 // Subtract the minimum value
1902 SDValue SwitchOp = getValue(B.SValue);
1903 EVT VT = SwitchOp.getValueType();
1904 SDValue Sub = DAG.getNode(ISD::SUB, getCurSDLoc(), VT, SwitchOp,
1905 DAG.getConstant(B.First, VT));
1908 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
1910 DAG.getSetCC(getCurSDLoc(), TLI.getSetCCResultType(*DAG.getContext(),
1911 Sub.getValueType()),
1912 Sub, DAG.getConstant(B.Range, VT), ISD::SETUGT);
1914 // Determine the type of the test operands.
1915 bool UsePtrType = false;
1916 if (!TLI.isTypeLegal(VT))
1919 for (unsigned i = 0, e = B.Cases.size(); i != e; ++i)
1920 if (!isUIntN(VT.getSizeInBits(), B.Cases[i].Mask)) {
1921 // Switch table case range are encoded into series of masks.
1922 // Just use pointer type, it's guaranteed to fit.
1928 VT = TLI.getPointerTy();
1929 Sub = DAG.getZExtOrTrunc(Sub, getCurSDLoc(), VT);
1932 B.RegVT = VT.getSimpleVT();
1933 B.Reg = FuncInfo.CreateReg(B.RegVT);
1934 SDValue CopyTo = DAG.getCopyToReg(getControlRoot(), getCurSDLoc(),
1937 // Set NextBlock to be the MBB immediately after the current one, if any.
1938 // This is used to avoid emitting unnecessary branches to the next block.
1939 MachineBasicBlock *NextBlock = nullptr;
1940 MachineFunction::iterator BBI = SwitchBB;
1941 if (++BBI != FuncInfo.MF->end())
1944 MachineBasicBlock* MBB = B.Cases[0].ThisBB;
1946 addSuccessorWithWeight(SwitchBB, B.Default);
1947 addSuccessorWithWeight(SwitchBB, MBB);
1949 SDValue BrRange = DAG.getNode(ISD::BRCOND, getCurSDLoc(),
1950 MVT::Other, CopyTo, RangeCmp,
1951 DAG.getBasicBlock(B.Default));
1953 if (MBB != NextBlock)
1954 BrRange = DAG.getNode(ISD::BR, getCurSDLoc(), MVT::Other, CopyTo,
1955 DAG.getBasicBlock(MBB));
1957 DAG.setRoot(BrRange);
1960 /// visitBitTestCase - this function produces one "bit test"
1961 void SelectionDAGBuilder::visitBitTestCase(BitTestBlock &BB,
1962 MachineBasicBlock* NextMBB,
1963 uint32_t BranchWeightToNext,
1966 MachineBasicBlock *SwitchBB) {
1968 SDValue ShiftOp = DAG.getCopyFromReg(getControlRoot(), getCurSDLoc(),
1971 unsigned PopCount = countPopulation(B.Mask);
1972 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
1973 if (PopCount == 1) {
1974 // Testing for a single bit; just compare the shift count with what it
1975 // would need to be to shift a 1 bit in that position.
1977 getCurSDLoc(), TLI.getSetCCResultType(*DAG.getContext(), VT), ShiftOp,
1978 DAG.getConstant(countTrailingZeros(B.Mask), VT), ISD::SETEQ);
1979 } else if (PopCount == BB.Range) {
1980 // There is only one zero bit in the range, test for it directly.
1982 getCurSDLoc(), TLI.getSetCCResultType(*DAG.getContext(), VT), ShiftOp,
1983 DAG.getConstant(countTrailingOnes(B.Mask), VT), ISD::SETNE);
1985 // Make desired shift
1986 SDValue SwitchVal = DAG.getNode(ISD::SHL, getCurSDLoc(), VT,
1987 DAG.getConstant(1, VT), ShiftOp);
1989 // Emit bit tests and jumps
1990 SDValue AndOp = DAG.getNode(ISD::AND, getCurSDLoc(),
1991 VT, SwitchVal, DAG.getConstant(B.Mask, VT));
1992 Cmp = DAG.getSetCC(getCurSDLoc(),
1993 TLI.getSetCCResultType(*DAG.getContext(), VT), AndOp,
1994 DAG.getConstant(0, VT), ISD::SETNE);
1997 // The branch weight from SwitchBB to B.TargetBB is B.ExtraWeight.
1998 addSuccessorWithWeight(SwitchBB, B.TargetBB, B.ExtraWeight);
1999 // The branch weight from SwitchBB to NextMBB is BranchWeightToNext.
2000 addSuccessorWithWeight(SwitchBB, NextMBB, BranchWeightToNext);
2002 SDValue BrAnd = DAG.getNode(ISD::BRCOND, getCurSDLoc(),
2003 MVT::Other, getControlRoot(),
2004 Cmp, DAG.getBasicBlock(B.TargetBB));
2006 // Set NextBlock to be the MBB immediately after the current one, if any.
2007 // This is used to avoid emitting unnecessary branches to the next block.
2008 MachineBasicBlock *NextBlock = nullptr;
2009 MachineFunction::iterator BBI = SwitchBB;
2010 if (++BBI != FuncInfo.MF->end())
2013 if (NextMBB != NextBlock)
2014 BrAnd = DAG.getNode(ISD::BR, getCurSDLoc(), MVT::Other, BrAnd,
2015 DAG.getBasicBlock(NextMBB));
2020 void SelectionDAGBuilder::visitInvoke(const InvokeInst &I) {
2021 MachineBasicBlock *InvokeMBB = FuncInfo.MBB;
2023 // Retrieve successors.
2024 MachineBasicBlock *Return = FuncInfo.MBBMap[I.getSuccessor(0)];
2025 MachineBasicBlock *LandingPad = FuncInfo.MBBMap[I.getSuccessor(1)];
2027 const Value *Callee(I.getCalledValue());
2028 const Function *Fn = dyn_cast<Function>(Callee);
2029 if (isa<InlineAsm>(Callee))
2031 else if (Fn && Fn->isIntrinsic()) {
2032 switch (Fn->getIntrinsicID()) {
2034 llvm_unreachable("Cannot invoke this intrinsic");
2035 case Intrinsic::donothing:
2036 // Ignore invokes to @llvm.donothing: jump directly to the next BB.
2038 case Intrinsic::experimental_patchpoint_void:
2039 case Intrinsic::experimental_patchpoint_i64:
2040 visitPatchpoint(&I, LandingPad);
2042 case Intrinsic::experimental_gc_statepoint:
2043 LowerStatepoint(ImmutableStatepoint(&I), LandingPad);
2047 LowerCallTo(&I, getValue(Callee), false, LandingPad);
2049 // If the value of the invoke is used outside of its defining block, make it
2050 // available as a virtual register.
2051 // We already took care of the exported value for the statepoint instruction
2052 // during call to the LowerStatepoint.
2053 if (!isStatepoint(I)) {
2054 CopyToExportRegsIfNeeded(&I);
2057 // Update successor info
2058 addSuccessorWithWeight(InvokeMBB, Return);
2059 addSuccessorWithWeight(InvokeMBB, LandingPad);
2061 // Drop into normal successor.
2062 DAG.setRoot(DAG.getNode(ISD::BR, getCurSDLoc(),
2063 MVT::Other, getControlRoot(),
2064 DAG.getBasicBlock(Return)));
2067 void SelectionDAGBuilder::visitResume(const ResumeInst &RI) {
2068 llvm_unreachable("SelectionDAGBuilder shouldn't visit resume instructions!");
2071 void SelectionDAGBuilder::visitLandingPad(const LandingPadInst &LP) {
2072 assert(FuncInfo.MBB->isLandingPad() &&
2073 "Call to landingpad not in landing pad!");
2075 MachineBasicBlock *MBB = FuncInfo.MBB;
2076 MachineModuleInfo &MMI = DAG.getMachineFunction().getMMI();
2077 AddLandingPadInfo(LP, MMI, MBB);
2079 // If there aren't registers to copy the values into (e.g., during SjLj
2080 // exceptions), then don't bother to create these DAG nodes.
2081 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
2082 if (TLI.getExceptionPointerRegister() == 0 &&
2083 TLI.getExceptionSelectorRegister() == 0)
2086 SmallVector<EVT, 2> ValueVTs;
2087 ComputeValueVTs(TLI, LP.getType(), ValueVTs);
2088 assert(ValueVTs.size() == 2 && "Only two-valued landingpads are supported");
2090 // Get the two live-in registers as SDValues. The physregs have already been
2091 // copied into virtual registers.
2093 if (FuncInfo.ExceptionPointerVirtReg) {
2094 Ops[0] = DAG.getZExtOrTrunc(
2095 DAG.getCopyFromReg(DAG.getEntryNode(), getCurSDLoc(),
2096 FuncInfo.ExceptionPointerVirtReg, TLI.getPointerTy()),
2097 getCurSDLoc(), ValueVTs[0]);
2099 Ops[0] = DAG.getConstant(0, TLI.getPointerTy());
2101 Ops[1] = DAG.getZExtOrTrunc(
2102 DAG.getCopyFromReg(DAG.getEntryNode(), getCurSDLoc(),
2103 FuncInfo.ExceptionSelectorVirtReg, TLI.getPointerTy()),
2104 getCurSDLoc(), ValueVTs[1]);
2107 SDValue Res = DAG.getNode(ISD::MERGE_VALUES, getCurSDLoc(),
2108 DAG.getVTList(ValueVTs), Ops);
2113 SelectionDAGBuilder::visitLandingPadClauseBB(GlobalValue *ClauseGV,
2114 MachineBasicBlock *LPadBB) {
2115 SDValue Chain = getControlRoot();
2117 // Get the typeid that we will dispatch on later.
2118 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
2119 const TargetRegisterClass *RC = TLI.getRegClassFor(TLI.getPointerTy());
2120 unsigned VReg = FuncInfo.MF->getRegInfo().createVirtualRegister(RC);
2121 unsigned TypeID = DAG.getMachineFunction().getMMI().getTypeIDFor(ClauseGV);
2122 SDValue Sel = DAG.getConstant(TypeID, TLI.getPointerTy());
2123 Chain = DAG.getCopyToReg(Chain, getCurSDLoc(), VReg, Sel);
2125 // Branch to the main landing pad block.
2126 MachineBasicBlock *ClauseMBB = FuncInfo.MBB;
2127 ClauseMBB->addSuccessor(LPadBB);
2128 DAG.setRoot(DAG.getNode(ISD::BR, getCurSDLoc(), MVT::Other, Chain,
2129 DAG.getBasicBlock(LPadBB)));
2133 /// handleSmallSwitchCaseRange - Emit a series of specific tests (suitable for
2134 /// small case ranges).
2135 bool SelectionDAGBuilder::handleSmallSwitchRange(CaseRec& CR,
2136 CaseRecVector& WorkList,
2138 MachineBasicBlock *Default,
2139 MachineBasicBlock *SwitchBB) {
2140 // Size is the number of Cases represented by this range.
2141 size_t Size = CR.Range.second - CR.Range.first;
2145 // Get the MachineFunction which holds the current MBB. This is used when
2146 // inserting any additional MBBs necessary to represent the switch.
2147 MachineFunction *CurMF = FuncInfo.MF;
2149 // Figure out which block is immediately after the current one.
2150 MachineBasicBlock *NextBlock = nullptr;
2151 MachineFunction::iterator BBI = CR.CaseBB;
2153 if (++BBI != FuncInfo.MF->end())
2156 BranchProbabilityInfo *BPI = FuncInfo.BPI;
2157 // If any two of the cases has the same destination, and if one value
2158 // is the same as the other, but has one bit unset that the other has set,
2159 // use bit manipulation to do two compares at once. For example:
2160 // "if (X == 6 || X == 4)" -> "if ((X|2) == 6)"
2161 // TODO: This could be extended to merge any 2 cases in switches with 3 cases.
2162 // TODO: Handle cases where CR.CaseBB != SwitchBB.
2163 if (Size == 2 && CR.CaseBB == SwitchBB) {
2164 Case &Small = *CR.Range.first;
2165 Case &Big = *(CR.Range.second-1);
2167 if (Small.Low == Small.High && Big.Low == Big.High && Small.BB == Big.BB) {
2168 const APInt& SmallValue = Small.Low->getValue();
2169 const APInt& BigValue = Big.Low->getValue();
2171 // Check that there is only one bit different.
2172 if (BigValue.countPopulation() == SmallValue.countPopulation() + 1 &&
2173 (SmallValue | BigValue) == BigValue) {
2174 // Isolate the common bit.
2175 APInt CommonBit = BigValue & ~SmallValue;
2176 assert((SmallValue | CommonBit) == BigValue &&
2177 CommonBit.countPopulation() == 1 && "Not a common bit?");
2179 SDValue CondLHS = getValue(SV);
2180 EVT VT = CondLHS.getValueType();
2181 SDLoc DL = getCurSDLoc();
2183 SDValue Or = DAG.getNode(ISD::OR, DL, VT, CondLHS,
2184 DAG.getConstant(CommonBit, VT));
2185 SDValue Cond = DAG.getSetCC(DL, MVT::i1,
2186 Or, DAG.getConstant(BigValue, VT),
2189 // Update successor info.
2190 // Both Small and Big will jump to Small.BB, so we sum up the weights.
2191 addSuccessorWithWeight(SwitchBB, Small.BB,
2192 Small.ExtraWeight + Big.ExtraWeight);
2193 addSuccessorWithWeight(SwitchBB, Default,
2194 // The default destination is the first successor in IR.
2195 BPI ? BPI->getEdgeWeight(SwitchBB->getBasicBlock(), (unsigned)0) : 0);
2197 // Insert the true branch.
2198 SDValue BrCond = DAG.getNode(ISD::BRCOND, DL, MVT::Other,
2199 getControlRoot(), Cond,
2200 DAG.getBasicBlock(Small.BB));
2202 // Insert the false branch.
2203 BrCond = DAG.getNode(ISD::BR, DL, MVT::Other, BrCond,
2204 DAG.getBasicBlock(Default));
2206 DAG.setRoot(BrCond);
2212 // Order cases by weight so the most likely case will be checked first.
2213 uint32_t UnhandledWeights = 0;
2215 for (CaseItr I = CR.Range.first, IE = CR.Range.second; I != IE; ++I) {
2216 uint32_t IWeight = I->ExtraWeight;
2217 UnhandledWeights += IWeight;
2218 for (CaseItr J = CR.Range.first; J < I; ++J) {
2219 uint32_t JWeight = J->ExtraWeight;
2220 if (IWeight > JWeight)
2225 // Rearrange the case blocks so that the last one falls through if possible.
2226 Case &BackCase = *(CR.Range.second-1);
2228 NextBlock && Default != NextBlock && BackCase.BB != NextBlock) {
2229 // The last case block won't fall through into 'NextBlock' if we emit the
2230 // branches in this order. See if rearranging a case value would help.
2231 // We start at the bottom as it's the case with the least weight.
2232 for (Case *I = &*(CR.Range.second-2), *E = &*CR.Range.first-1; I != E; --I)
2233 if (I->BB == NextBlock) {
2234 std::swap(*I, BackCase);
2239 // Create a CaseBlock record representing a conditional branch to
2240 // the Case's target mbb if the value being switched on SV is equal
2242 MachineBasicBlock *CurBlock = CR.CaseBB;
2243 for (CaseItr I = CR.Range.first, E = CR.Range.second; I != E; ++I) {
2244 MachineBasicBlock *FallThrough;
2246 FallThrough = CurMF->CreateMachineBasicBlock(CurBlock->getBasicBlock());
2247 CurMF->insert(BBI, FallThrough);
2249 // Put SV in a virtual register to make it available from the new blocks.
2250 ExportFromCurrentBlock(SV);
2252 // If the last case doesn't match, go to the default block.
2253 FallThrough = Default;
2256 const Value *RHS, *LHS, *MHS;
2258 if (I->High == I->Low) {
2259 // This is just small small case range :) containing exactly 1 case
2261 LHS = SV; RHS = I->High; MHS = nullptr;
2264 LHS = I->Low; MHS = SV; RHS = I->High;
2267 // The false weight should be sum of all un-handled cases.
2268 UnhandledWeights -= I->ExtraWeight;
2269 CaseBlock CB(CC, LHS, RHS, MHS, /* truebb */ I->BB, /* falsebb */ FallThrough,
2271 /* trueweight */ I->ExtraWeight,
2272 /* falseweight */ UnhandledWeights);
2274 // If emitting the first comparison, just call visitSwitchCase to emit the
2275 // code into the current block. Otherwise, push the CaseBlock onto the
2276 // vector to be later processed by SDISel, and insert the node's MBB
2277 // before the next MBB.
2278 if (CurBlock == SwitchBB)
2279 visitSwitchCase(CB, SwitchBB);
2281 SwitchCases.push_back(CB);
2283 CurBlock = FallThrough;
2289 static inline bool areJTsAllowed(const TargetLowering &TLI) {
2290 return TLI.isOperationLegalOrCustom(ISD::BR_JT, MVT::Other) ||
2291 TLI.isOperationLegalOrCustom(ISD::BRIND, MVT::Other);
2294 static APInt ComputeRange(const APInt &First, const APInt &Last) {
2295 uint32_t BitWidth = std::max(Last.getBitWidth(), First.getBitWidth()) + 1;
2296 APInt LastExt = Last.sext(BitWidth), FirstExt = First.sext(BitWidth);
2297 return (LastExt - FirstExt + 1ULL);
2300 /// handleJTSwitchCase - Emit jumptable for current switch case range
2301 bool SelectionDAGBuilder::handleJTSwitchCase(CaseRec &CR,
2302 CaseRecVector &WorkList,
2304 MachineBasicBlock *Default,
2305 MachineBasicBlock *SwitchBB) {
2306 Case& FrontCase = *CR.Range.first;
2307 Case& BackCase = *(CR.Range.second-1);
2309 const APInt &First = FrontCase.Low->getValue();
2310 const APInt &Last = BackCase.High->getValue();
2312 APInt TSize(First.getBitWidth(), 0);
2313 for (CaseItr I = CR.Range.first, E = CR.Range.second; I != E; ++I)
2316 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
2317 if (!areJTsAllowed(TLI) || TSize.ult(TLI.getMinimumJumpTableEntries()))
2320 APInt Range = ComputeRange(First, Last);
2321 // The density is TSize / Range. Require at least 40%.
2322 // It should not be possible for IntTSize to saturate for sane code, but make
2323 // sure we handle Range saturation correctly.
2324 uint64_t IntRange = Range.getLimitedValue(UINT64_MAX/10);
2325 uint64_t IntTSize = TSize.getLimitedValue(UINT64_MAX/10);
2326 if (IntTSize * 10 < IntRange * 4)
2329 DEBUG(dbgs() << "Lowering jump table\n"
2330 << "First entry: " << First << ". Last entry: " << Last << '\n'
2331 << "Range: " << Range << ". Size: " << TSize << ".\n\n");
2333 // Get the MachineFunction which holds the current MBB. This is used when
2334 // inserting any additional MBBs necessary to represent the switch.
2335 MachineFunction *CurMF = FuncInfo.MF;
2337 // Figure out which block is immediately after the current one.
2338 MachineFunction::iterator BBI = CR.CaseBB;
2341 const BasicBlock *LLVMBB = CR.CaseBB->getBasicBlock();
2343 // Create a new basic block to hold the code for loading the address
2344 // of the jump table, and jumping to it. Update successor information;
2345 // we will either branch to the default case for the switch, or the jump
2347 MachineBasicBlock *JumpTableBB = CurMF->CreateMachineBasicBlock(LLVMBB);
2348 CurMF->insert(BBI, JumpTableBB);
2350 addSuccessorWithWeight(CR.CaseBB, Default);
2351 addSuccessorWithWeight(CR.CaseBB, JumpTableBB);
2353 // Build a vector of destination BBs, corresponding to each target
2354 // of the jump table. If the value of the jump table slot corresponds to
2355 // a case statement, push the case's BB onto the vector, otherwise, push
2357 std::vector<MachineBasicBlock*> DestBBs;
2359 for (CaseItr I = CR.Range.first, E = CR.Range.second; I != E; ++TEI) {
2360 const APInt &Low = I->Low->getValue();
2361 const APInt &High = I->High->getValue();
2363 if (Low.sle(TEI) && TEI.sle(High)) {
2364 DestBBs.push_back(I->BB);
2368 DestBBs.push_back(Default);
2372 // Calculate weight for each unique destination in CR.
2373 DenseMap<MachineBasicBlock*, uint32_t> DestWeights;
2375 for (CaseItr I = CR.Range.first, E = CR.Range.second; I != E; ++I) {
2376 DenseMap<MachineBasicBlock*, uint32_t>::iterator Itr =
2377 DestWeights.find(I->BB);
2378 if (Itr != DestWeights.end())
2379 Itr->second += I->ExtraWeight;
2381 DestWeights[I->BB] = I->ExtraWeight;
2384 // Update successor info. Add one edge to each unique successor.
2385 BitVector SuccsHandled(CR.CaseBB->getParent()->getNumBlockIDs());
2386 for (std::vector<MachineBasicBlock*>::iterator I = DestBBs.begin(),
2387 E = DestBBs.end(); I != E; ++I) {
2388 if (!SuccsHandled[(*I)->getNumber()]) {
2389 SuccsHandled[(*I)->getNumber()] = true;
2390 DenseMap<MachineBasicBlock*, uint32_t>::iterator Itr =
2391 DestWeights.find(*I);
2392 addSuccessorWithWeight(JumpTableBB, *I,
2393 Itr != DestWeights.end() ? Itr->second : 0);
2397 // Create a jump table index for this jump table.
2398 unsigned JTEncoding = TLI.getJumpTableEncoding();
2399 unsigned JTI = CurMF->getOrCreateJumpTableInfo(JTEncoding)
2400 ->createJumpTableIndex(DestBBs);
2402 // Set the jump table information so that we can codegen it as a second
2403 // MachineBasicBlock
2404 JumpTable JT(-1U, JTI, JumpTableBB, Default);
2405 JumpTableHeader JTH(First, Last, SV, CR.CaseBB, (CR.CaseBB == SwitchBB));
2406 if (CR.CaseBB == SwitchBB)
2407 visitJumpTableHeader(JT, JTH, SwitchBB);
2409 JTCases.push_back(JumpTableBlock(JTH, JT));
2413 /// handleBTSplitSwitchCase - emit comparison and split binary search tree into
2415 bool SelectionDAGBuilder::handleBTSplitSwitchCase(CaseRec& CR,
2416 CaseRecVector& WorkList,
2418 MachineBasicBlock* SwitchBB) {
2419 Case& FrontCase = *CR.Range.first;
2420 Case& BackCase = *(CR.Range.second-1);
2422 // Size is the number of Cases represented by this range.
2423 unsigned Size = CR.Range.second - CR.Range.first;
2425 const APInt &First = FrontCase.Low->getValue();
2426 const APInt &Last = BackCase.High->getValue();
2428 CaseItr Pivot = CR.Range.first + Size/2;
2430 // Select optimal pivot, maximizing sum density of LHS and RHS. This will
2431 // (heuristically) allow us to emit JumpTable's later.
2432 APInt TSize(First.getBitWidth(), 0);
2433 for (CaseItr I = CR.Range.first, E = CR.Range.second;
2437 APInt LSize = FrontCase.size();
2438 APInt RSize = TSize-LSize;
2439 DEBUG(dbgs() << "Selecting best pivot: \n"
2440 << "First: " << First << ", Last: " << Last <<'\n'
2441 << "LSize: " << LSize << ", RSize: " << RSize << '\n');
2442 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
2443 for (CaseItr I = CR.Range.first, J=I+1, E = CR.Range.second;
2445 const APInt &LEnd = I->High->getValue();
2446 const APInt &RBegin = J->Low->getValue();
2447 APInt Range = ComputeRange(LEnd, RBegin);
2448 assert((Range - 2ULL).isNonNegative() &&
2449 "Invalid case distance");
2450 // Use volatile double here to avoid excess precision issues on some hosts,
2451 // e.g. that use 80-bit X87 registers.
2452 // Only consider the density of sub-ranges that actually have sufficient
2453 // entries to be lowered as a jump table.
2454 volatile double LDensity =
2455 LSize.ult(TLI.getMinimumJumpTableEntries())
2457 : LSize.roundToDouble() / (LEnd - First + 1ULL).roundToDouble();
2458 volatile double RDensity =
2459 RSize.ult(TLI.getMinimumJumpTableEntries())
2461 : RSize.roundToDouble() / (Last - RBegin + 1ULL).roundToDouble();
2462 volatile double Metric = Range.logBase2() * (LDensity + RDensity);
2463 // Should always split in some non-trivial place
2464 DEBUG(dbgs() <<"=>Step\n"
2465 << "LEnd: " << LEnd << ", RBegin: " << RBegin << '\n'
2466 << "LDensity: " << LDensity
2467 << ", RDensity: " << RDensity << '\n'
2468 << "Metric: " << Metric << '\n');
2469 if (FMetric < Metric) {
2472 DEBUG(dbgs() << "Current metric set to: " << FMetric << '\n');
2479 if (FMetric == 0 || !areJTsAllowed(TLI))
2480 Pivot = CR.Range.first + Size/2;
2481 splitSwitchCase(CR, Pivot, WorkList, SV, SwitchBB);
2485 void SelectionDAGBuilder::splitSwitchCase(CaseRec &CR, CaseItr Pivot,
2486 CaseRecVector &WorkList,
2488 MachineBasicBlock *SwitchBB) {
2489 // Get the MachineFunction which holds the current MBB. This is used when
2490 // inserting any additional MBBs necessary to represent the switch.
2491 MachineFunction *CurMF = FuncInfo.MF;
2493 // Figure out which block is immediately after the current one.
2494 MachineFunction::iterator BBI = CR.CaseBB;
2497 const BasicBlock *LLVMBB = CR.CaseBB->getBasicBlock();
2499 CaseRange LHSR(CR.Range.first, Pivot);
2500 CaseRange RHSR(Pivot, CR.Range.second);
2501 const ConstantInt *C = Pivot->Low;
2502 MachineBasicBlock *FalseBB = nullptr, *TrueBB = nullptr;
2504 // We know that we branch to the LHS if the Value being switched on is
2505 // less than the Pivot value, C. We use this to optimize our binary
2506 // tree a bit, by recognizing that if SV is greater than or equal to the
2507 // LHS's Case Value, and that Case Value is exactly one less than the
2508 // Pivot's Value, then we can branch directly to the LHS's Target,
2509 // rather than creating a leaf node for it.
2510 if ((LHSR.second - LHSR.first) == 1 && LHSR.first->High == CR.GE &&
2511 C->getValue() == (CR.GE->getValue() + 1LL)) {
2512 TrueBB = LHSR.first->BB;
2514 TrueBB = CurMF->CreateMachineBasicBlock(LLVMBB);
2515 CurMF->insert(BBI, TrueBB);
2516 WorkList.push_back(CaseRec(TrueBB, C, CR.GE, LHSR));
2518 // Put SV in a virtual register to make it available from the new blocks.
2519 ExportFromCurrentBlock(SV);
2522 // Similar to the optimization above, if the Value being switched on is
2523 // known to be less than the Constant CR.LT, and the current Case Value
2524 // is CR.LT - 1, then we can branch directly to the target block for
2525 // the current Case Value, rather than emitting a RHS leaf node for it.
2526 if ((RHSR.second - RHSR.first) == 1 && CR.LT &&
2527 RHSR.first->Low->getValue() == (CR.LT->getValue() - 1LL)) {
2528 FalseBB = RHSR.first->BB;
2530 FalseBB = CurMF->CreateMachineBasicBlock(LLVMBB);
2531 CurMF->insert(BBI, FalseBB);
2532 WorkList.push_back(CaseRec(FalseBB, CR.LT, C, RHSR));
2534 // Put SV in a virtual register to make it available from the new blocks.
2535 ExportFromCurrentBlock(SV);
2538 // Create a CaseBlock record representing a conditional branch to
2539 // the LHS node if the value being switched on SV is less than C.
2540 // Otherwise, branch to LHS.
2541 CaseBlock CB(ISD::SETLT, SV, C, nullptr, TrueBB, FalseBB, CR.CaseBB);
2543 if (CR.CaseBB == SwitchBB)
2544 visitSwitchCase(CB, SwitchBB);
2546 SwitchCases.push_back(CB);
2549 /// handleBitTestsSwitchCase - if current case range has few destination and
2550 /// range span less, than machine word bitwidth, encode case range into series
2551 /// of masks and emit bit tests with these masks.
2552 bool SelectionDAGBuilder::handleBitTestsSwitchCase(CaseRec& CR,
2553 CaseRecVector& WorkList,
2555 MachineBasicBlock* Default,
2556 MachineBasicBlock* SwitchBB) {
2557 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
2558 EVT PTy = TLI.getPointerTy();
2559 unsigned IntPtrBits = PTy.getSizeInBits();
2561 Case& FrontCase = *CR.Range.first;
2562 Case& BackCase = *(CR.Range.second-1);
2564 // Get the MachineFunction which holds the current MBB. This is used when
2565 // inserting any additional MBBs necessary to represent the switch.
2566 MachineFunction *CurMF = FuncInfo.MF;
2568 // If target does not have legal shift left, do not emit bit tests at all.
2569 if (!TLI.isOperationLegal(ISD::SHL, PTy))
2573 for (CaseItr I = CR.Range.first, E = CR.Range.second; I != E; ++I) {
2574 // Single case counts one, case range - two.
2575 numCmps += (I->Low == I->High ? 1 : 2);
2578 // Count unique destinations
2579 SmallSet<MachineBasicBlock*, 4> Dests;
2580 for (CaseItr I = CR.Range.first, E = CR.Range.second; I != E; ++I) {
2581 Dests.insert(I->BB);
2582 if (Dests.size() > 3)
2583 // Don't bother the code below, if there are too much unique destinations
2586 DEBUG(dbgs() << "Total number of unique destinations: "
2587 << Dests.size() << '\n'
2588 << "Total number of comparisons: " << numCmps << '\n');
2590 // Compute span of values.
2591 const APInt& minValue = FrontCase.Low->getValue();
2592 const APInt& maxValue = BackCase.High->getValue();
2593 APInt cmpRange = maxValue - minValue;
2595 DEBUG(dbgs() << "Compare range: " << cmpRange << '\n'
2596 << "Low bound: " << minValue << '\n'
2597 << "High bound: " << maxValue << '\n');
2599 if (cmpRange.uge(IntPtrBits) ||
2600 (!(Dests.size() == 1 && numCmps >= 3) &&
2601 !(Dests.size() == 2 && numCmps >= 5) &&
2602 !(Dests.size() >= 3 && numCmps >= 6)))
2605 DEBUG(dbgs() << "Emitting bit tests\n");
2606 APInt lowBound = APInt::getNullValue(cmpRange.getBitWidth());
2608 // Optimize the case where all the case values fit in a
2609 // word without having to subtract minValue. In this case,
2610 // we can optimize away the subtraction.
2611 if (minValue.isNonNegative() && maxValue.slt(IntPtrBits)) {
2612 cmpRange = maxValue;
2614 lowBound = minValue;
2617 CaseBitsVector CasesBits;
2618 unsigned i, count = 0;
2620 for (CaseItr I = CR.Range.first, E = CR.Range.second; I!=E; ++I) {
2621 MachineBasicBlock* Dest = I->BB;
2622 for (i = 0; i < count; ++i)
2623 if (Dest == CasesBits[i].BB)
2627 assert((count < 3) && "Too much destinations to test!");
2628 CasesBits.push_back(CaseBits(0, Dest, 0, 0/*Weight*/));
2632 const APInt& lowValue = I->Low->getValue();
2633 const APInt& highValue = I->High->getValue();
2635 uint64_t lo = (lowValue - lowBound).getZExtValue();
2636 uint64_t hi = (highValue - lowBound).getZExtValue();
2637 CasesBits[i].ExtraWeight += I->ExtraWeight;
2639 for (uint64_t j = lo; j <= hi; j++) {
2640 CasesBits[i].Mask |= 1ULL << j;
2641 CasesBits[i].Bits++;
2645 std::sort(CasesBits.begin(), CasesBits.end(), CaseBitsCmp());
2649 // Figure out which block is immediately after the current one.
2650 MachineFunction::iterator BBI = CR.CaseBB;
2653 const BasicBlock *LLVMBB = CR.CaseBB->getBasicBlock();
2655 DEBUG(dbgs() << "Cases:\n");
2656 for (unsigned i = 0, e = CasesBits.size(); i!=e; ++i) {
2657 DEBUG(dbgs() << "Mask: " << CasesBits[i].Mask
2658 << ", Bits: " << CasesBits[i].Bits
2659 << ", BB: " << CasesBits[i].BB << '\n');
2661 MachineBasicBlock *CaseBB = CurMF->CreateMachineBasicBlock(LLVMBB);
2662 CurMF->insert(BBI, CaseBB);
2663 BTC.push_back(BitTestCase(CasesBits[i].Mask,
2665 CasesBits[i].BB, CasesBits[i].ExtraWeight));
2667 // Put SV in a virtual register to make it available from the new blocks.
2668 ExportFromCurrentBlock(SV);
2671 BitTestBlock BTB(lowBound, cmpRange, SV,
2672 -1U, MVT::Other, (CR.CaseBB == SwitchBB),
2673 CR.CaseBB, Default, std::move(BTC));
2675 if (CR.CaseBB == SwitchBB)
2676 visitBitTestHeader(BTB, SwitchBB);
2678 BitTestCases.push_back(std::move(BTB));
2683 /// Clusterify - Transform simple list of Cases into list of CaseRange's
2684 void SelectionDAGBuilder::Clusterify(CaseVector& Cases,
2685 const SwitchInst& SI) {
2686 BranchProbabilityInfo *BPI = FuncInfo.BPI;
2687 // Start with "simple" cases.
2688 for (SwitchInst::ConstCaseIt i : SI.cases()) {
2689 const BasicBlock *SuccBB = i.getCaseSuccessor();
2690 MachineBasicBlock *SMBB = FuncInfo.MBBMap[SuccBB];
2692 uint32_t ExtraWeight =
2693 BPI ? BPI->getEdgeWeight(SI.getParent(), i.getSuccessorIndex()) : 0;
2695 Cases.push_back(Case(i.getCaseValue(), i.getCaseValue(),
2696 SMBB, ExtraWeight));
2698 std::sort(Cases.begin(), Cases.end(), CaseCmp());
2700 // Merge case into clusters
2701 if (Cases.size() >= 2)
2702 // Must recompute end() each iteration because it may be
2703 // invalidated by erase if we hold on to it
2704 for (CaseItr I = Cases.begin(), J = std::next(Cases.begin());
2705 J != Cases.end(); ) {
2706 const APInt& nextValue = J->Low->getValue();
2707 const APInt& currentValue = I->High->getValue();
2708 MachineBasicBlock* nextBB = J->BB;
2709 MachineBasicBlock* currentBB = I->BB;
2711 // If the two neighboring cases go to the same destination, merge them
2712 // into a single case.
2713 if ((nextValue - currentValue == 1) && (currentBB == nextBB)) {
2715 I->ExtraWeight += J->ExtraWeight;
2724 for (auto &I : Cases)
2725 // A range counts double, since it requires two compares.
2726 numCmps += I.Low != I.High ? 2 : 1;
2728 dbgs() << "Clusterify finished. Total clusters: " << Cases.size()
2729 << ". Total compares: " << numCmps << '\n';
2733 void SelectionDAGBuilder::UpdateSplitBlock(MachineBasicBlock *First,
2734 MachineBasicBlock *Last) {
2736 for (unsigned i = 0, e = JTCases.size(); i != e; ++i)
2737 if (JTCases[i].first.HeaderBB == First)
2738 JTCases[i].first.HeaderBB = Last;
2740 // Update BitTestCases.
2741 for (unsigned i = 0, e = BitTestCases.size(); i != e; ++i)
2742 if (BitTestCases[i].Parent == First)
2743 BitTestCases[i].Parent = Last;
2746 void SelectionDAGBuilder::visitSwitch(const SwitchInst &SI) {
2747 MachineBasicBlock *SwitchMBB = FuncInfo.MBB;
2749 // Figure out which block is immediately after the current one.
2750 MachineBasicBlock *NextBlock = nullptr;
2751 if (SwitchMBB + 1 != FuncInfo.MF->end())
2752 NextBlock = SwitchMBB + 1;
2755 // Create a vector of Cases, sorted so that we can efficiently create a binary
2756 // search tree from them.
2758 Clusterify(Cases, SI);
2760 // Get the default destination MBB.
2761 MachineBasicBlock *Default = FuncInfo.MBBMap[SI.getDefaultDest()];
2763 if (isa<UnreachableInst>(SI.getDefaultDest()->getFirstNonPHIOrDbg()) &&
2765 // Replace an unreachable default destination with the most popular case
2767 DenseMap<const BasicBlock *, unsigned> Popularity;
2768 unsigned MaxPop = 0;
2769 const BasicBlock *MaxBB = nullptr;
2770 for (auto I : SI.cases()) {
2771 const BasicBlock *BB = I.getCaseSuccessor();
2772 if (++Popularity[BB] > MaxPop) {
2773 MaxPop = Popularity[BB];
2781 Default = FuncInfo.MBBMap[MaxBB];
2783 // Remove cases that were pointing to the destination that is now the default.
2784 Cases.erase(std::remove_if(Cases.begin(), Cases.end(),
2785 [&](const Case &C) { return C.BB == Default; }),
2789 // If there is only the default destination, go there directly.
2790 if (Cases.empty()) {
2791 // Update machine-CFG edges.
2792 SwitchMBB->addSuccessor(Default);
2794 // If this is not a fall-through branch, emit the branch.
2795 if (Default != NextBlock) {
2796 DAG.setRoot(DAG.getNode(ISD::BR, getCurSDLoc(), MVT::Other,
2797 getControlRoot(), DAG.getBasicBlock(Default)));
2802 // Get the Value to be switched on.
2803 const Value *SV = SI.getCondition();
2805 // Push the initial CaseRec onto the worklist
2806 CaseRecVector WorkList;
2807 WorkList.push_back(CaseRec(SwitchMBB,nullptr,nullptr,
2808 CaseRange(Cases.begin(),Cases.end())));
2810 while (!WorkList.empty()) {
2811 // Grab a record representing a case range to process off the worklist
2812 CaseRec CR = WorkList.back();
2813 WorkList.pop_back();
2815 if (handleBitTestsSwitchCase(CR, WorkList, SV, Default, SwitchMBB))
2818 // If the range has few cases (two or less) emit a series of specific
2820 if (handleSmallSwitchRange(CR, WorkList, SV, Default, SwitchMBB))
2823 // If the switch has more than N blocks, and is at least 40% dense, and the
2824 // target supports indirect branches, then emit a jump table rather than
2825 // lowering the switch to a binary tree of conditional branches.
2826 // N defaults to 4 and is controlled via TLS.getMinimumJumpTableEntries().
2827 if (handleJTSwitchCase(CR, WorkList, SV, Default, SwitchMBB))
2830 // Emit binary tree. We need to pick a pivot, and push left and right ranges
2831 // onto the worklist. Leafs are handled via handleSmallSwitchRange() call.
2832 handleBTSplitSwitchCase(CR, WorkList, SV, SwitchMBB);
2836 void SelectionDAGBuilder::visitIndirectBr(const IndirectBrInst &I) {
2837 MachineBasicBlock *IndirectBrMBB = FuncInfo.MBB;
2839 // Update machine-CFG edges with unique successors.
2840 SmallSet<BasicBlock*, 32> Done;
2841 for (unsigned i = 0, e = I.getNumSuccessors(); i != e; ++i) {
2842 BasicBlock *BB = I.getSuccessor(i);
2843 bool Inserted = Done.insert(BB).second;
2847 MachineBasicBlock *Succ = FuncInfo.MBBMap[BB];
2848 addSuccessorWithWeight(IndirectBrMBB, Succ);
2851 DAG.setRoot(DAG.getNode(ISD::BRIND, getCurSDLoc(),
2852 MVT::Other, getControlRoot(),
2853 getValue(I.getAddress())));
2856 void SelectionDAGBuilder::visitUnreachable(const UnreachableInst &I) {
2857 if (DAG.getTarget().Options.TrapUnreachable)
2858 DAG.setRoot(DAG.getNode(ISD::TRAP, getCurSDLoc(), MVT::Other, DAG.getRoot()));
2861 void SelectionDAGBuilder::visitFSub(const User &I) {
2862 // -0.0 - X --> fneg
2863 Type *Ty = I.getType();
2864 if (isa<Constant>(I.getOperand(0)) &&
2865 I.getOperand(0) == ConstantFP::getZeroValueForNegation(Ty)) {
2866 SDValue Op2 = getValue(I.getOperand(1));
2867 setValue(&I, DAG.getNode(ISD::FNEG, getCurSDLoc(),
2868 Op2.getValueType(), Op2));
2872 visitBinary(I, ISD::FSUB);
2875 void SelectionDAGBuilder::visitBinary(const User &I, unsigned OpCode) {
2876 SDValue Op1 = getValue(I.getOperand(0));
2877 SDValue Op2 = getValue(I.getOperand(1));
2882 if (const OverflowingBinaryOperator *OFBinOp =
2883 dyn_cast<const OverflowingBinaryOperator>(&I)) {
2884 nuw = OFBinOp->hasNoUnsignedWrap();
2885 nsw = OFBinOp->hasNoSignedWrap();
2887 if (const PossiblyExactOperator *ExactOp =
2888 dyn_cast<const PossiblyExactOperator>(&I))
2889 exact = ExactOp->isExact();
2891 SDValue BinNodeValue = DAG.getNode(OpCode, getCurSDLoc(), Op1.getValueType(),
2892 Op1, Op2, nuw, nsw, exact);
2893 setValue(&I, BinNodeValue);
2896 void SelectionDAGBuilder::visitShift(const User &I, unsigned Opcode) {
2897 SDValue Op1 = getValue(I.getOperand(0));
2898 SDValue Op2 = getValue(I.getOperand(1));
2901 DAG.getTargetLoweringInfo().getShiftAmountTy(Op2.getValueType());
2903 // Coerce the shift amount to the right type if we can.
2904 if (!I.getType()->isVectorTy() && Op2.getValueType() != ShiftTy) {
2905 unsigned ShiftSize = ShiftTy.getSizeInBits();
2906 unsigned Op2Size = Op2.getValueType().getSizeInBits();
2907 SDLoc DL = getCurSDLoc();
2909 // If the operand is smaller than the shift count type, promote it.
2910 if (ShiftSize > Op2Size)
2911 Op2 = DAG.getNode(ISD::ZERO_EXTEND, DL, ShiftTy, Op2);
2913 // If the operand is larger than the shift count type but the shift
2914 // count type has enough bits to represent any shift value, truncate
2915 // it now. This is a common case and it exposes the truncate to
2916 // optimization early.
2917 else if (ShiftSize >= Log2_32_Ceil(Op2.getValueType().getSizeInBits()))
2918 Op2 = DAG.getNode(ISD::TRUNCATE, DL, ShiftTy, Op2);
2919 // Otherwise we'll need to temporarily settle for some other convenient
2920 // type. Type legalization will make adjustments once the shiftee is split.
2922 Op2 = DAG.getZExtOrTrunc(Op2, DL, MVT::i32);
2929 if (Opcode == ISD::SRL || Opcode == ISD::SRA || Opcode == ISD::SHL) {
2931 if (const OverflowingBinaryOperator *OFBinOp =
2932 dyn_cast<const OverflowingBinaryOperator>(&I)) {
2933 nuw = OFBinOp->hasNoUnsignedWrap();
2934 nsw = OFBinOp->hasNoSignedWrap();
2936 if (const PossiblyExactOperator *ExactOp =
2937 dyn_cast<const PossiblyExactOperator>(&I))
2938 exact = ExactOp->isExact();
2941 SDValue Res = DAG.getNode(Opcode, getCurSDLoc(), Op1.getValueType(), Op1, Op2,
2946 void SelectionDAGBuilder::visitSDiv(const User &I) {
2947 SDValue Op1 = getValue(I.getOperand(0));
2948 SDValue Op2 = getValue(I.getOperand(1));
2950 // Turn exact SDivs into multiplications.
2951 // FIXME: This should be in DAGCombiner, but it doesn't have access to the
2953 if (isa<BinaryOperator>(&I) && cast<BinaryOperator>(&I)->isExact() &&
2954 !isa<ConstantSDNode>(Op1) &&
2955 isa<ConstantSDNode>(Op2) && !cast<ConstantSDNode>(Op2)->isNullValue())
2956 setValue(&I, DAG.getTargetLoweringInfo()
2957 .BuildExactSDIV(Op1, Op2, getCurSDLoc(), DAG));
2959 setValue(&I, DAG.getNode(ISD::SDIV, getCurSDLoc(), Op1.getValueType(),
2963 void SelectionDAGBuilder::visitICmp(const User &I) {
2964 ICmpInst::Predicate predicate = ICmpInst::BAD_ICMP_PREDICATE;
2965 if (const ICmpInst *IC = dyn_cast<ICmpInst>(&I))
2966 predicate = IC->getPredicate();
2967 else if (const ConstantExpr *IC = dyn_cast<ConstantExpr>(&I))
2968 predicate = ICmpInst::Predicate(IC->getPredicate());
2969 SDValue Op1 = getValue(I.getOperand(0));
2970 SDValue Op2 = getValue(I.getOperand(1));
2971 ISD::CondCode Opcode = getICmpCondCode(predicate);
2973 EVT DestVT = DAG.getTargetLoweringInfo().getValueType(I.getType());
2974 setValue(&I, DAG.getSetCC(getCurSDLoc(), DestVT, Op1, Op2, Opcode));
2977 void SelectionDAGBuilder::visitFCmp(const User &I) {
2978 FCmpInst::Predicate predicate = FCmpInst::BAD_FCMP_PREDICATE;
2979 if (const FCmpInst *FC = dyn_cast<FCmpInst>(&I))
2980 predicate = FC->getPredicate();
2981 else if (const ConstantExpr *FC = dyn_cast<ConstantExpr>(&I))
2982 predicate = FCmpInst::Predicate(FC->getPredicate());
2983 SDValue Op1 = getValue(I.getOperand(0));
2984 SDValue Op2 = getValue(I.getOperand(1));
2985 ISD::CondCode Condition = getFCmpCondCode(predicate);
2986 if (TM.Options.NoNaNsFPMath)
2987 Condition = getFCmpCodeWithoutNaN(Condition);
2988 EVT DestVT = DAG.getTargetLoweringInfo().getValueType(I.getType());
2989 setValue(&I, DAG.getSetCC(getCurSDLoc(), DestVT, Op1, Op2, Condition));
2992 void SelectionDAGBuilder::visitSelect(const User &I) {
2993 SmallVector<EVT, 4> ValueVTs;
2994 ComputeValueVTs(DAG.getTargetLoweringInfo(), I.getType(), ValueVTs);
2995 unsigned NumValues = ValueVTs.size();
2996 if (NumValues == 0) return;
2998 SmallVector<SDValue, 4> Values(NumValues);
2999 SDValue Cond = getValue(I.getOperand(0));
3000 SDValue TrueVal = getValue(I.getOperand(1));
3001 SDValue FalseVal = getValue(I.getOperand(2));
3002 ISD::NodeType OpCode = Cond.getValueType().isVector() ?
3003 ISD::VSELECT : ISD::SELECT;
3005 for (unsigned i = 0; i != NumValues; ++i)
3006 Values[i] = DAG.getNode(OpCode, getCurSDLoc(),
3007 TrueVal.getNode()->getValueType(TrueVal.getResNo()+i),
3009 SDValue(TrueVal.getNode(),
3010 TrueVal.getResNo() + i),
3011 SDValue(FalseVal.getNode(),
3012 FalseVal.getResNo() + i));
3014 setValue(&I, DAG.getNode(ISD::MERGE_VALUES, getCurSDLoc(),
3015 DAG.getVTList(ValueVTs), Values));
3018 void SelectionDAGBuilder::visitTrunc(const User &I) {
3019 // TruncInst cannot be a no-op cast because sizeof(src) > sizeof(dest).
3020 SDValue N = getValue(I.getOperand(0));
3021 EVT DestVT = DAG.getTargetLoweringInfo().getValueType(I.getType());
3022 setValue(&I, DAG.getNode(ISD::TRUNCATE, getCurSDLoc(), DestVT, N));
3025 void SelectionDAGBuilder::visitZExt(const User &I) {
3026 // ZExt cannot be a no-op cast because sizeof(src) < sizeof(dest).
3027 // ZExt also can't be a cast to bool for same reason. So, nothing much to do
3028 SDValue N = getValue(I.getOperand(0));
3029 EVT DestVT = DAG.getTargetLoweringInfo().getValueType(I.getType());
3030 setValue(&I, DAG.getNode(ISD::ZERO_EXTEND, getCurSDLoc(), DestVT, N));
3033 void SelectionDAGBuilder::visitSExt(const User &I) {
3034 // SExt cannot be a no-op cast because sizeof(src) < sizeof(dest).
3035 // SExt also can't be a cast to bool for same reason. So, nothing much to do
3036 SDValue N = getValue(I.getOperand(0));
3037 EVT DestVT = DAG.getTargetLoweringInfo().getValueType(I.getType());
3038 setValue(&I, DAG.getNode(ISD::SIGN_EXTEND, getCurSDLoc(), DestVT, N));
3041 void SelectionDAGBuilder::visitFPTrunc(const User &I) {
3042 // FPTrunc is never a no-op cast, no need to check
3043 SDValue N = getValue(I.getOperand(0));
3044 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
3045 EVT DestVT = TLI.getValueType(I.getType());
3046 setValue(&I, DAG.getNode(ISD::FP_ROUND, getCurSDLoc(), DestVT, N,
3047 DAG.getTargetConstant(0, TLI.getPointerTy())));
3050 void SelectionDAGBuilder::visitFPExt(const User &I) {
3051 // FPExt is never a no-op cast, no need to check
3052 SDValue N = getValue(I.getOperand(0));
3053 EVT DestVT = DAG.getTargetLoweringInfo().getValueType(I.getType());
3054 setValue(&I, DAG.getNode(ISD::FP_EXTEND, getCurSDLoc(), DestVT, N));
3057 void SelectionDAGBuilder::visitFPToUI(const User &I) {
3058 // FPToUI is never a no-op cast, no need to check
3059 SDValue N = getValue(I.getOperand(0));
3060 EVT DestVT = DAG.getTargetLoweringInfo().getValueType(I.getType());
3061 setValue(&I, DAG.getNode(ISD::FP_TO_UINT, getCurSDLoc(), DestVT, N));
3064 void SelectionDAGBuilder::visitFPToSI(const User &I) {
3065 // FPToSI is never a no-op cast, no need to check
3066 SDValue N = getValue(I.getOperand(0));
3067 EVT DestVT = DAG.getTargetLoweringInfo().getValueType(I.getType());
3068 setValue(&I, DAG.getNode(ISD::FP_TO_SINT, getCurSDLoc(), DestVT, N));
3071 void SelectionDAGBuilder::visitUIToFP(const User &I) {
3072 // UIToFP is never a no-op cast, no need to check
3073 SDValue N = getValue(I.getOperand(0));
3074 EVT DestVT = DAG.getTargetLoweringInfo().getValueType(I.getType());
3075 setValue(&I, DAG.getNode(ISD::UINT_TO_FP, getCurSDLoc(), DestVT, N));
3078 void SelectionDAGBuilder::visitSIToFP(const User &I) {
3079 // SIToFP is never a no-op cast, no need to check
3080 SDValue N = getValue(I.getOperand(0));
3081 EVT DestVT = DAG.getTargetLoweringInfo().getValueType(I.getType());
3082 setValue(&I, DAG.getNode(ISD::SINT_TO_FP, getCurSDLoc(), DestVT, N));
3085 void SelectionDAGBuilder::visitPtrToInt(const User &I) {
3086 // What to do depends on the size of the integer and the size of the pointer.
3087 // We can either truncate, zero extend, or no-op, accordingly.
3088 SDValue N = getValue(I.getOperand(0));
3089 EVT DestVT = DAG.getTargetLoweringInfo().getValueType(I.getType());
3090 setValue(&I, DAG.getZExtOrTrunc(N, getCurSDLoc(), DestVT));
3093 void SelectionDAGBuilder::visitIntToPtr(const User &I) {
3094 // What to do depends on the size of the integer and the size of the pointer.
3095 // We can either truncate, zero extend, or no-op, accordingly.
3096 SDValue N = getValue(I.getOperand(0));
3097 EVT DestVT = DAG.getTargetLoweringInfo().getValueType(I.getType());
3098 setValue(&I, DAG.getZExtOrTrunc(N, getCurSDLoc(), DestVT));
3101 void SelectionDAGBuilder::visitBitCast(const User &I) {
3102 SDValue N = getValue(I.getOperand(0));
3103 EVT DestVT = DAG.getTargetLoweringInfo().getValueType(I.getType());
3105 // BitCast assures us that source and destination are the same size so this is
3106 // either a BITCAST or a no-op.
3107 if (DestVT != N.getValueType())
3108 setValue(&I, DAG.getNode(ISD::BITCAST, getCurSDLoc(),
3109 DestVT, N)); // convert types.
3110 // Check if the original LLVM IR Operand was a ConstantInt, because getValue()
3111 // might fold any kind of constant expression to an integer constant and that
3112 // is not what we are looking for. Only regcognize a bitcast of a genuine
3113 // constant integer as an opaque constant.
3114 else if(ConstantInt *C = dyn_cast<ConstantInt>(I.getOperand(0)))
3115 setValue(&I, DAG.getConstant(C->getValue(), DestVT, /*isTarget=*/false,
3118 setValue(&I, N); // noop cast.
3121 void SelectionDAGBuilder::visitAddrSpaceCast(const User &I) {
3122 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
3123 const Value *SV = I.getOperand(0);
3124 SDValue N = getValue(SV);
3125 EVT DestVT = TLI.getValueType(I.getType());
3127 unsigned SrcAS = SV->getType()->getPointerAddressSpace();
3128 unsigned DestAS = I.getType()->getPointerAddressSpace();
3130 if (!TLI.isNoopAddrSpaceCast(SrcAS, DestAS))
3131 N = DAG.getAddrSpaceCast(getCurSDLoc(), DestVT, N, SrcAS, DestAS);
3136 void SelectionDAGBuilder::visitInsertElement(const User &I) {
3137 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
3138 SDValue InVec = getValue(I.getOperand(0));
3139 SDValue InVal = getValue(I.getOperand(1));
3140 SDValue InIdx = DAG.getSExtOrTrunc(getValue(I.getOperand(2)),
3141 getCurSDLoc(), TLI.getVectorIdxTy());
3142 setValue(&I, DAG.getNode(ISD::INSERT_VECTOR_ELT, getCurSDLoc(),
3143 TLI.getValueType(I.getType()), InVec, InVal, InIdx));
3146 void SelectionDAGBuilder::visitExtractElement(const User &I) {
3147 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
3148 SDValue InVec = getValue(I.getOperand(0));
3149 SDValue InIdx = DAG.getSExtOrTrunc(getValue(I.getOperand(1)),
3150 getCurSDLoc(), TLI.getVectorIdxTy());
3151 setValue(&I, DAG.getNode(ISD::EXTRACT_VECTOR_ELT, getCurSDLoc(),
3152 TLI.getValueType(I.getType()), InVec, InIdx));
3155 // Utility for visitShuffleVector - Return true if every element in Mask,
3156 // beginning from position Pos and ending in Pos+Size, falls within the
3157 // specified sequential range [L, L+Pos). or is undef.
3158 static bool isSequentialInRange(const SmallVectorImpl<int> &Mask,
3159 unsigned Pos, unsigned Size, int Low) {
3160 for (unsigned i = Pos, e = Pos+Size; i != e; ++i, ++Low)
3161 if (Mask[i] >= 0 && Mask[i] != Low)
3166 void SelectionDAGBuilder::visitShuffleVector(const User &I) {
3167 SDValue Src1 = getValue(I.getOperand(0));
3168 SDValue Src2 = getValue(I.getOperand(1));
3170 SmallVector<int, 8> Mask;
3171 ShuffleVectorInst::getShuffleMask(cast<Constant>(I.getOperand(2)), Mask);
3172 unsigned MaskNumElts = Mask.size();
3174 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
3175 EVT VT = TLI.getValueType(I.getType());
3176 EVT SrcVT = Src1.getValueType();
3177 unsigned SrcNumElts = SrcVT.getVectorNumElements();
3179 if (SrcNumElts == MaskNumElts) {
3180 setValue(&I, DAG.getVectorShuffle(VT, getCurSDLoc(), Src1, Src2,
3185 // Normalize the shuffle vector since mask and vector length don't match.
3186 if (SrcNumElts < MaskNumElts && MaskNumElts % SrcNumElts == 0) {
3187 // Mask is longer than the source vectors and is a multiple of the source
3188 // vectors. We can use concatenate vector to make the mask and vectors
3190 if (SrcNumElts*2 == MaskNumElts) {
3191 // First check for Src1 in low and Src2 in high
3192 if (isSequentialInRange(Mask, 0, SrcNumElts, 0) &&
3193 isSequentialInRange(Mask, SrcNumElts, SrcNumElts, SrcNumElts)) {
3194 // The shuffle is concatenating two vectors together.
3195 setValue(&I, DAG.getNode(ISD::CONCAT_VECTORS, getCurSDLoc(),
3199 // Then check for Src2 in low and Src1 in high
3200 if (isSequentialInRange(Mask, 0, SrcNumElts, SrcNumElts) &&
3201 isSequentialInRange(Mask, SrcNumElts, SrcNumElts, 0)) {
3202 // The shuffle is concatenating two vectors together.
3203 setValue(&I, DAG.getNode(ISD::CONCAT_VECTORS, getCurSDLoc(),
3209 // Pad both vectors with undefs to make them the same length as the mask.
3210 unsigned NumConcat = MaskNumElts / SrcNumElts;
3211 bool Src1U = Src1.getOpcode() == ISD::UNDEF;
3212 bool Src2U = Src2.getOpcode() == ISD::UNDEF;
3213 SDValue UndefVal = DAG.getUNDEF(SrcVT);
3215 SmallVector<SDValue, 8> MOps1(NumConcat, UndefVal);
3216 SmallVector<SDValue, 8> MOps2(NumConcat, UndefVal);
3220 Src1 = Src1U ? DAG.getUNDEF(VT) : DAG.getNode(ISD::CONCAT_VECTORS,
3221 getCurSDLoc(), VT, MOps1);
3222 Src2 = Src2U ? DAG.getUNDEF(VT) : DAG.getNode(ISD::CONCAT_VECTORS,
3223 getCurSDLoc(), VT, MOps2);
3225 // Readjust mask for new input vector length.
3226 SmallVector<int, 8> MappedOps;
3227 for (unsigned i = 0; i != MaskNumElts; ++i) {
3229 if (Idx >= (int)SrcNumElts)
3230 Idx -= SrcNumElts - MaskNumElts;
3231 MappedOps.push_back(Idx);
3234 setValue(&I, DAG.getVectorShuffle(VT, getCurSDLoc(), Src1, Src2,
3239 if (SrcNumElts > MaskNumElts) {
3240 // Analyze the access pattern of the vector to see if we can extract
3241 // two subvectors and do the shuffle. The analysis is done by calculating
3242 // the range of elements the mask access on both vectors.
3243 int MinRange[2] = { static_cast<int>(SrcNumElts),
3244 static_cast<int>(SrcNumElts)};
3245 int MaxRange[2] = {-1, -1};
3247 for (unsigned i = 0; i != MaskNumElts; ++i) {
3253 if (Idx >= (int)SrcNumElts) {
3257 if (Idx > MaxRange[Input])
3258 MaxRange[Input] = Idx;
3259 if (Idx < MinRange[Input])
3260 MinRange[Input] = Idx;
3263 // Check if the access is smaller than the vector size and can we find
3264 // a reasonable extract index.
3265 int RangeUse[2] = { -1, -1 }; // 0 = Unused, 1 = Extract, -1 = Can not
3267 int StartIdx[2]; // StartIdx to extract from
3268 for (unsigned Input = 0; Input < 2; ++Input) {
3269 if (MinRange[Input] >= (int)SrcNumElts && MaxRange[Input] < 0) {
3270 RangeUse[Input] = 0; // Unused
3271 StartIdx[Input] = 0;
3275 // Find a good start index that is a multiple of the mask length. Then
3276 // see if the rest of the elements are in range.
3277 StartIdx[Input] = (MinRange[Input]/MaskNumElts)*MaskNumElts;
3278 if (MaxRange[Input] - StartIdx[Input] < (int)MaskNumElts &&
3279 StartIdx[Input] + MaskNumElts <= SrcNumElts)
3280 RangeUse[Input] = 1; // Extract from a multiple of the mask length.
3283 if (RangeUse[0] == 0 && RangeUse[1] == 0) {
3284 setValue(&I, DAG.getUNDEF(VT)); // Vectors are not used.
3287 if (RangeUse[0] >= 0 && RangeUse[1] >= 0) {
3288 // Extract appropriate subvector and generate a vector shuffle
3289 for (unsigned Input = 0; Input < 2; ++Input) {
3290 SDValue &Src = Input == 0 ? Src1 : Src2;
3291 if (RangeUse[Input] == 0)
3292 Src = DAG.getUNDEF(VT);
3295 ISD::EXTRACT_SUBVECTOR, getCurSDLoc(), VT, Src,
3296 DAG.getConstant(StartIdx[Input], TLI.getVectorIdxTy()));
3299 // Calculate new mask.
3300 SmallVector<int, 8> MappedOps;
3301 for (unsigned i = 0; i != MaskNumElts; ++i) {
3304 if (Idx < (int)SrcNumElts)
3307 Idx -= SrcNumElts + StartIdx[1] - MaskNumElts;
3309 MappedOps.push_back(Idx);
3312 setValue(&I, DAG.getVectorShuffle(VT, getCurSDLoc(), Src1, Src2,
3318 // We can't use either concat vectors or extract subvectors so fall back to
3319 // replacing the shuffle with extract and build vector.
3320 // to insert and build vector.
3321 EVT EltVT = VT.getVectorElementType();
3322 EVT IdxVT = TLI.getVectorIdxTy();
3323 SmallVector<SDValue,8> Ops;
3324 for (unsigned i = 0; i != MaskNumElts; ++i) {
3329 Res = DAG.getUNDEF(EltVT);
3331 SDValue &Src = Idx < (int)SrcNumElts ? Src1 : Src2;
3332 if (Idx >= (int)SrcNumElts) Idx -= SrcNumElts;
3334 Res = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, getCurSDLoc(),
3335 EltVT, Src, DAG.getConstant(Idx, IdxVT));
3341 setValue(&I, DAG.getNode(ISD::BUILD_VECTOR, getCurSDLoc(), VT, Ops));
3344 void SelectionDAGBuilder::visitInsertValue(const InsertValueInst &I) {
3345 const Value *Op0 = I.getOperand(0);
3346 const Value *Op1 = I.getOperand(1);
3347 Type *AggTy = I.getType();
3348 Type *ValTy = Op1->getType();
3349 bool IntoUndef = isa<UndefValue>(Op0);
3350 bool FromUndef = isa<UndefValue>(Op1);
3352 unsigned LinearIndex = ComputeLinearIndex(AggTy, I.getIndices());
3354 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
3355 SmallVector<EVT, 4> AggValueVTs;
3356 ComputeValueVTs(TLI, AggTy, AggValueVTs);
3357 SmallVector<EVT, 4> ValValueVTs;
3358 ComputeValueVTs(TLI, ValTy, ValValueVTs);
3360 unsigned NumAggValues = AggValueVTs.size();
3361 unsigned NumValValues = ValValueVTs.size();
3362 SmallVector<SDValue, 4> Values(NumAggValues);
3364 // Ignore an insertvalue that produces an empty object
3365 if (!NumAggValues) {
3366 setValue(&I, DAG.getUNDEF(MVT(MVT::Other)));
3370 SDValue Agg = getValue(Op0);
3372 // Copy the beginning value(s) from the original aggregate.
3373 for (; i != LinearIndex; ++i)
3374 Values[i] = IntoUndef ? DAG.getUNDEF(AggValueVTs[i]) :
3375 SDValue(Agg.getNode(), Agg.getResNo() + i);
3376 // Copy values from the inserted value(s).
3378 SDValue Val = getValue(Op1);
3379 for (; i != LinearIndex + NumValValues; ++i)
3380 Values[i] = FromUndef ? DAG.getUNDEF(AggValueVTs[i]) :
3381 SDValue(Val.getNode(), Val.getResNo() + i - LinearIndex);
3383 // Copy remaining value(s) from the original aggregate.
3384 for (; i != NumAggValues; ++i)
3385 Values[i] = IntoUndef ? DAG.getUNDEF(AggValueVTs[i]) :
3386 SDValue(Agg.getNode(), Agg.getResNo() + i);
3388 setValue(&I, DAG.getNode(ISD::MERGE_VALUES, getCurSDLoc(),
3389 DAG.getVTList(AggValueVTs), Values));
3392 void SelectionDAGBuilder::visitExtractValue(const ExtractValueInst &I) {
3393 const Value *Op0 = I.getOperand(0);
3394 Type *AggTy = Op0->getType();
3395 Type *ValTy = I.getType();
3396 bool OutOfUndef = isa<UndefValue>(Op0);
3398 unsigned LinearIndex = ComputeLinearIndex(AggTy, I.getIndices());
3400 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
3401 SmallVector<EVT, 4> ValValueVTs;
3402 ComputeValueVTs(TLI, ValTy, ValValueVTs);
3404 unsigned NumValValues = ValValueVTs.size();
3406 // Ignore a extractvalue that produces an empty object
3407 if (!NumValValues) {
3408 setValue(&I, DAG.getUNDEF(MVT(MVT::Other)));
3412 SmallVector<SDValue, 4> Values(NumValValues);
3414 SDValue Agg = getValue(Op0);
3415 // Copy out the selected value(s).
3416 for (unsigned i = LinearIndex; i != LinearIndex + NumValValues; ++i)
3417 Values[i - LinearIndex] =
3419 DAG.getUNDEF(Agg.getNode()->getValueType(Agg.getResNo() + i)) :
3420 SDValue(Agg.getNode(), Agg.getResNo() + i);
3422 setValue(&I, DAG.getNode(ISD::MERGE_VALUES, getCurSDLoc(),
3423 DAG.getVTList(ValValueVTs), Values));
3426 void SelectionDAGBuilder::visitGetElementPtr(const User &I) {
3427 Value *Op0 = I.getOperand(0);
3428 // Note that the pointer operand may be a vector of pointers. Take the scalar
3429 // element which holds a pointer.
3430 Type *Ty = Op0->getType()->getScalarType();
3431 unsigned AS = Ty->getPointerAddressSpace();
3432 SDValue N = getValue(Op0);
3434 for (GetElementPtrInst::const_op_iterator OI = I.op_begin()+1, E = I.op_end();
3436 const Value *Idx = *OI;
3437 if (StructType *StTy = dyn_cast<StructType>(Ty)) {
3438 unsigned Field = cast<Constant>(Idx)->getUniqueInteger().getZExtValue();
3441 uint64_t Offset = DL->getStructLayout(StTy)->getElementOffset(Field);
3442 N = DAG.getNode(ISD::ADD, getCurSDLoc(), N.getValueType(), N,
3443 DAG.getConstant(Offset, N.getValueType()));
3446 Ty = StTy->getElementType(Field);
3448 Ty = cast<SequentialType>(Ty)->getElementType();
3449 MVT PtrTy = DAG.getTargetLoweringInfo().getPointerTy(AS);
3450 unsigned PtrSize = PtrTy.getSizeInBits();
3451 APInt ElementSize(PtrSize, DL->getTypeAllocSize(Ty));
3453 // If this is a constant subscript, handle it quickly.
3454 if (const auto *CI = dyn_cast<ConstantInt>(Idx)) {
3457 APInt Offs = ElementSize * CI->getValue().sextOrTrunc(PtrSize);
3458 SDValue OffsVal = DAG.getConstant(Offs, PtrTy);
3459 N = DAG.getNode(ISD::ADD, getCurSDLoc(), N.getValueType(), N, OffsVal);
3463 // N = N + Idx * ElementSize;
3464 SDValue IdxN = getValue(Idx);
3466 // If the index is smaller or larger than intptr_t, truncate or extend
3468 IdxN = DAG.getSExtOrTrunc(IdxN, getCurSDLoc(), N.getValueType());
3470 // If this is a multiply by a power of two, turn it into a shl
3471 // immediately. This is a very common case.
3472 if (ElementSize != 1) {
3473 if (ElementSize.isPowerOf2()) {
3474 unsigned Amt = ElementSize.logBase2();
3475 IdxN = DAG.getNode(ISD::SHL, getCurSDLoc(),
3476 N.getValueType(), IdxN,
3477 DAG.getConstant(Amt, IdxN.getValueType()));
3479 SDValue Scale = DAG.getConstant(ElementSize, IdxN.getValueType());
3480 IdxN = DAG.getNode(ISD::MUL, getCurSDLoc(),
3481 N.getValueType(), IdxN, Scale);
3485 N = DAG.getNode(ISD::ADD, getCurSDLoc(),
3486 N.getValueType(), N, IdxN);
3493 void SelectionDAGBuilder::visitAlloca(const AllocaInst &I) {
3494 // If this is a fixed sized alloca in the entry block of the function,
3495 // allocate it statically on the stack.
3496 if (FuncInfo.StaticAllocaMap.count(&I))
3497 return; // getValue will auto-populate this.
3499 Type *Ty = I.getAllocatedType();
3500 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
3501 uint64_t TySize = TLI.getDataLayout()->getTypeAllocSize(Ty);
3503 std::max((unsigned)TLI.getDataLayout()->getPrefTypeAlignment(Ty),
3506 SDValue AllocSize = getValue(I.getArraySize());
3508 EVT IntPtr = TLI.getPointerTy();
3509 if (AllocSize.getValueType() != IntPtr)
3510 AllocSize = DAG.getZExtOrTrunc(AllocSize, getCurSDLoc(), IntPtr);
3512 AllocSize = DAG.getNode(ISD::MUL, getCurSDLoc(), IntPtr,
3514 DAG.getConstant(TySize, IntPtr));
3516 // Handle alignment. If the requested alignment is less than or equal to
3517 // the stack alignment, ignore it. If the size is greater than or equal to
3518 // the stack alignment, we note this in the DYNAMIC_STACKALLOC node.
3519 unsigned StackAlign =
3520 DAG.getSubtarget().getFrameLowering()->getStackAlignment();
3521 if (Align <= StackAlign)
3524 // Round the size of the allocation up to the stack alignment size
3525 // by add SA-1 to the size.
3526 AllocSize = DAG.getNode(ISD::ADD, getCurSDLoc(),
3527 AllocSize.getValueType(), AllocSize,
3528 DAG.getIntPtrConstant(StackAlign-1));
3530 // Mask out the low bits for alignment purposes.
3531 AllocSize = DAG.getNode(ISD::AND, getCurSDLoc(),
3532 AllocSize.getValueType(), AllocSize,
3533 DAG.getIntPtrConstant(~(uint64_t)(StackAlign-1)));
3535 SDValue Ops[] = { getRoot(), AllocSize, DAG.getIntPtrConstant(Align) };
3536 SDVTList VTs = DAG.getVTList(AllocSize.getValueType(), MVT::Other);
3537 SDValue DSA = DAG.getNode(ISD::DYNAMIC_STACKALLOC, getCurSDLoc(), VTs, Ops);
3539 DAG.setRoot(DSA.getValue(1));
3541 assert(FuncInfo.MF->getFrameInfo()->hasVarSizedObjects());
3544 void SelectionDAGBuilder::visitLoad(const LoadInst &I) {
3546 return visitAtomicLoad(I);
3548 const Value *SV = I.getOperand(0);
3549 SDValue Ptr = getValue(SV);
3551 Type *Ty = I.getType();
3553 bool isVolatile = I.isVolatile();
3554 bool isNonTemporal = I.getMetadata(LLVMContext::MD_nontemporal) != nullptr;
3555 bool isInvariant = I.getMetadata(LLVMContext::MD_invariant_load) != nullptr;
3556 unsigned Alignment = I.getAlignment();
3559 I.getAAMetadata(AAInfo);
3560 const MDNode *Ranges = I.getMetadata(LLVMContext::MD_range);
3562 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
3563 SmallVector<EVT, 4> ValueVTs;
3564 SmallVector<uint64_t, 4> Offsets;
3565 ComputeValueVTs(TLI, Ty, ValueVTs, &Offsets);
3566 unsigned NumValues = ValueVTs.size();
3571 bool ConstantMemory = false;
3572 if (isVolatile || NumValues > MaxParallelChains)
3573 // Serialize volatile loads with other side effects.
3575 else if (AA->pointsToConstantMemory(
3576 AliasAnalysis::Location(SV, AA->getTypeStoreSize(Ty), AAInfo))) {
3577 // Do not serialize (non-volatile) loads of constant memory with anything.
3578 Root = DAG.getEntryNode();
3579 ConstantMemory = true;
3581 // Do not serialize non-volatile loads against each other.
3582 Root = DAG.getRoot();
3586 Root = TLI.prepareVolatileOrAtomicLoad(Root, getCurSDLoc(), DAG);
3588 SmallVector<SDValue, 4> Values(NumValues);
3589 SmallVector<SDValue, 4> Chains(std::min(unsigned(MaxParallelChains),
3591 EVT PtrVT = Ptr.getValueType();
3592 unsigned ChainI = 0;
3593 for (unsigned i = 0; i != NumValues; ++i, ++ChainI) {
3594 // Serializing loads here may result in excessive register pressure, and
3595 // TokenFactor places arbitrary choke points on the scheduler. SD scheduling
3596 // could recover a bit by hoisting nodes upward in the chain by recognizing
3597 // they are side-effect free or do not alias. The optimizer should really
3598 // avoid this case by converting large object/array copies to llvm.memcpy
3599 // (MaxParallelChains should always remain as failsafe).
3600 if (ChainI == MaxParallelChains) {
3601 assert(PendingLoads.empty() && "PendingLoads must be serialized first");
3602 SDValue Chain = DAG.getNode(ISD::TokenFactor, getCurSDLoc(), MVT::Other,
3603 makeArrayRef(Chains.data(), ChainI));
3607 SDValue A = DAG.getNode(ISD::ADD, getCurSDLoc(),
3609 DAG.getConstant(Offsets[i], PtrVT));
3610 SDValue L = DAG.getLoad(ValueVTs[i], getCurSDLoc(), Root,
3611 A, MachinePointerInfo(SV, Offsets[i]), isVolatile,
3612 isNonTemporal, isInvariant, Alignment, AAInfo,
3616 Chains[ChainI] = L.getValue(1);
3619 if (!ConstantMemory) {
3620 SDValue Chain = DAG.getNode(ISD::TokenFactor, getCurSDLoc(), MVT::Other,
3621 makeArrayRef(Chains.data(), ChainI));
3625 PendingLoads.push_back(Chain);
3628 setValue(&I, DAG.getNode(ISD::MERGE_VALUES, getCurSDLoc(),
3629 DAG.getVTList(ValueVTs), Values));
3632 void SelectionDAGBuilder::visitStore(const StoreInst &I) {
3634 return visitAtomicStore(I);
3636 const Value *SrcV = I.getOperand(0);
3637 const Value *PtrV = I.getOperand(1);
3639 SmallVector<EVT, 4> ValueVTs;
3640 SmallVector<uint64_t, 4> Offsets;
3641 ComputeValueVTs(DAG.getTargetLoweringInfo(), SrcV->getType(),
3642 ValueVTs, &Offsets);
3643 unsigned NumValues = ValueVTs.size();
3647 // Get the lowered operands. Note that we do this after
3648 // checking if NumResults is zero, because with zero results
3649 // the operands won't have values in the map.
3650 SDValue Src = getValue(SrcV);
3651 SDValue Ptr = getValue(PtrV);
3653 SDValue Root = getRoot();
3654 SmallVector<SDValue, 4> Chains(std::min(unsigned(MaxParallelChains),
3656 EVT PtrVT = Ptr.getValueType();
3657 bool isVolatile = I.isVolatile();
3658 bool isNonTemporal = I.getMetadata(LLVMContext::MD_nontemporal) != nullptr;
3659 unsigned Alignment = I.getAlignment();
3662 I.getAAMetadata(AAInfo);
3664 unsigned ChainI = 0;
3665 for (unsigned i = 0; i != NumValues; ++i, ++ChainI) {
3666 // See visitLoad comments.
3667 if (ChainI == MaxParallelChains) {
3668 SDValue Chain = DAG.getNode(ISD::TokenFactor, getCurSDLoc(), MVT::Other,
3669 makeArrayRef(Chains.data(), ChainI));
3673 SDValue Add = DAG.getNode(ISD::ADD, getCurSDLoc(), PtrVT, Ptr,
3674 DAG.getConstant(Offsets[i], PtrVT));
3675 SDValue St = DAG.getStore(Root, getCurSDLoc(),
3676 SDValue(Src.getNode(), Src.getResNo() + i),
3677 Add, MachinePointerInfo(PtrV, Offsets[i]),
3678 isVolatile, isNonTemporal, Alignment, AAInfo);
3679 Chains[ChainI] = St;
3682 SDValue StoreNode = DAG.getNode(ISD::TokenFactor, getCurSDLoc(), MVT::Other,
3683 makeArrayRef(Chains.data(), ChainI));
3684 DAG.setRoot(StoreNode);
3687 void SelectionDAGBuilder::visitMaskedStore(const CallInst &I) {
3688 SDLoc sdl = getCurSDLoc();
3690 // llvm.masked.store.*(Src0, Ptr, alignemt, Mask)
3691 Value *PtrOperand = I.getArgOperand(1);
3692 SDValue Ptr = getValue(PtrOperand);
3693 SDValue Src0 = getValue(I.getArgOperand(0));
3694 SDValue Mask = getValue(I.getArgOperand(3));
3695 EVT VT = Src0.getValueType();
3696 unsigned Alignment = (cast<ConstantInt>(I.getArgOperand(2)))->getZExtValue();
3698 Alignment = DAG.getEVTAlignment(VT);
3701 I.getAAMetadata(AAInfo);
3703 MachineMemOperand *MMO =
3704 DAG.getMachineFunction().
3705 getMachineMemOperand(MachinePointerInfo(PtrOperand),
3706 MachineMemOperand::MOStore, VT.getStoreSize(),
3708 SDValue StoreNode = DAG.getMaskedStore(getRoot(), sdl, Src0, Ptr, Mask, VT,
3710 DAG.setRoot(StoreNode);
3711 setValue(&I, StoreNode);
3714 void SelectionDAGBuilder::visitMaskedLoad(const CallInst &I) {
3715 SDLoc sdl = getCurSDLoc();
3717 // @llvm.masked.load.*(Ptr, alignment, Mask, Src0)
3718 Value *PtrOperand = I.getArgOperand(0);
3719 SDValue Ptr = getValue(PtrOperand);
3720 SDValue Src0 = getValue(I.getArgOperand(3));
3721 SDValue Mask = getValue(I.getArgOperand(2));
3723 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
3724 EVT VT = TLI.getValueType(I.getType());
3725 unsigned Alignment = (cast<ConstantInt>(I.getArgOperand(1)))->getZExtValue();
3727 Alignment = DAG.getEVTAlignment(VT);
3730 I.getAAMetadata(AAInfo);
3731 const MDNode *Ranges = I.getMetadata(LLVMContext::MD_range);
3733 SDValue InChain = DAG.getRoot();
3734 if (AA->pointsToConstantMemory(
3735 AliasAnalysis::Location(PtrOperand,
3736 AA->getTypeStoreSize(I.getType()),
3738 // Do not serialize (non-volatile) loads of constant memory with anything.
3739 InChain = DAG.getEntryNode();
3742 MachineMemOperand *MMO =
3743 DAG.getMachineFunction().
3744 getMachineMemOperand(MachinePointerInfo(PtrOperand),
3745 MachineMemOperand::MOLoad, VT.getStoreSize(),
3746 Alignment, AAInfo, Ranges);
3748 SDValue Load = DAG.getMaskedLoad(VT, sdl, InChain, Ptr, Mask, Src0, VT, MMO,
3750 SDValue OutChain = Load.getValue(1);
3751 DAG.setRoot(OutChain);
3755 void SelectionDAGBuilder::visitAtomicCmpXchg(const AtomicCmpXchgInst &I) {
3756 SDLoc dl = getCurSDLoc();
3757 AtomicOrdering SuccessOrder = I.getSuccessOrdering();
3758 AtomicOrdering FailureOrder = I.getFailureOrdering();
3759 SynchronizationScope Scope = I.getSynchScope();
3761 SDValue InChain = getRoot();
3763 MVT MemVT = getValue(I.getCompareOperand()).getSimpleValueType();
3764 SDVTList VTs = DAG.getVTList(MemVT, MVT::i1, MVT::Other);
3765 SDValue L = DAG.getAtomicCmpSwap(
3766 ISD::ATOMIC_CMP_SWAP_WITH_SUCCESS, dl, MemVT, VTs, InChain,
3767 getValue(I.getPointerOperand()), getValue(I.getCompareOperand()),
3768 getValue(I.getNewValOperand()), MachinePointerInfo(I.getPointerOperand()),
3769 /*Alignment=*/ 0, SuccessOrder, FailureOrder, Scope);
3771 SDValue OutChain = L.getValue(2);
3774 DAG.setRoot(OutChain);
3777 void SelectionDAGBuilder::visitAtomicRMW(const AtomicRMWInst &I) {
3778 SDLoc dl = getCurSDLoc();
3780 switch (I.getOperation()) {
3781 default: llvm_unreachable("Unknown atomicrmw operation");
3782 case AtomicRMWInst::Xchg: NT = ISD::ATOMIC_SWAP; break;
3783 case AtomicRMWInst::Add: NT = ISD::ATOMIC_LOAD_ADD; break;
3784 case AtomicRMWInst::Sub: NT = ISD::ATOMIC_LOAD_SUB; break;
3785 case AtomicRMWInst::And: NT = ISD::ATOMIC_LOAD_AND; break;
3786 case AtomicRMWInst::Nand: NT = ISD::ATOMIC_LOAD_NAND; break;
3787 case AtomicRMWInst::Or: NT = ISD::ATOMIC_LOAD_OR; break;
3788 case AtomicRMWInst::Xor: NT = ISD::ATOMIC_LOAD_XOR; break;
3789 case AtomicRMWInst::Max: NT = ISD::ATOMIC_LOAD_MAX; break;
3790 case AtomicRMWInst::Min: NT = ISD::ATOMIC_LOAD_MIN; break;
3791 case AtomicRMWInst::UMax: NT = ISD::ATOMIC_LOAD_UMAX; break;
3792 case AtomicRMWInst::UMin: NT = ISD::ATOMIC_LOAD_UMIN; break;
3794 AtomicOrdering Order = I.getOrdering();
3795 SynchronizationScope Scope = I.getSynchScope();
3797 SDValue InChain = getRoot();
3800 DAG.getAtomic(NT, dl,
3801 getValue(I.getValOperand()).getSimpleValueType(),
3803 getValue(I.getPointerOperand()),
3804 getValue(I.getValOperand()),
3805 I.getPointerOperand(),
3806 /* Alignment=*/ 0, Order, Scope);
3808 SDValue OutChain = L.getValue(1);
3811 DAG.setRoot(OutChain);
3814 void SelectionDAGBuilder::visitFence(const FenceInst &I) {
3815 SDLoc dl = getCurSDLoc();
3816 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
3819 Ops[1] = DAG.getConstant(I.getOrdering(), TLI.getPointerTy());
3820 Ops[2] = DAG.getConstant(I.getSynchScope(), TLI.getPointerTy());
3821 DAG.setRoot(DAG.getNode(ISD::ATOMIC_FENCE, dl, MVT::Other, Ops));
3824 void SelectionDAGBuilder::visitAtomicLoad(const LoadInst &I) {
3825 SDLoc dl = getCurSDLoc();
3826 AtomicOrdering Order = I.getOrdering();
3827 SynchronizationScope Scope = I.getSynchScope();
3829 SDValue InChain = getRoot();
3831 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
3832 EVT VT = TLI.getValueType(I.getType());
3834 if (I.getAlignment() < VT.getSizeInBits() / 8)
3835 report_fatal_error("Cannot generate unaligned atomic load");
3837 MachineMemOperand *MMO =
3838 DAG.getMachineFunction().
3839 getMachineMemOperand(MachinePointerInfo(I.getPointerOperand()),
3840 MachineMemOperand::MOVolatile |
3841 MachineMemOperand::MOLoad,
3843 I.getAlignment() ? I.getAlignment() :
3844 DAG.getEVTAlignment(VT));
3846 InChain = TLI.prepareVolatileOrAtomicLoad(InChain, dl, DAG);
3848 DAG.getAtomic(ISD::ATOMIC_LOAD, dl, VT, VT, InChain,
3849 getValue(I.getPointerOperand()), MMO,
3852 SDValue OutChain = L.getValue(1);
3855 DAG.setRoot(OutChain);
3858 void SelectionDAGBuilder::visitAtomicStore(const StoreInst &I) {
3859 SDLoc dl = getCurSDLoc();
3861 AtomicOrdering Order = I.getOrdering();
3862 SynchronizationScope Scope = I.getSynchScope();
3864 SDValue InChain = getRoot();
3866 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
3867 EVT VT = TLI.getValueType(I.getValueOperand()->getType());
3869 if (I.getAlignment() < VT.getSizeInBits() / 8)
3870 report_fatal_error("Cannot generate unaligned atomic store");
3873 DAG.getAtomic(ISD::ATOMIC_STORE, dl, VT,
3875 getValue(I.getPointerOperand()),
3876 getValue(I.getValueOperand()),
3877 I.getPointerOperand(), I.getAlignment(),
3880 DAG.setRoot(OutChain);
3883 /// visitTargetIntrinsic - Lower a call of a target intrinsic to an INTRINSIC
3885 void SelectionDAGBuilder::visitTargetIntrinsic(const CallInst &I,
3886 unsigned Intrinsic) {
3887 bool HasChain = !I.doesNotAccessMemory();
3888 bool OnlyLoad = HasChain && I.onlyReadsMemory();
3890 // Build the operand list.
3891 SmallVector<SDValue, 8> Ops;
3892 if (HasChain) { // If this intrinsic has side-effects, chainify it.
3894 // We don't need to serialize loads against other loads.
3895 Ops.push_back(DAG.getRoot());
3897 Ops.push_back(getRoot());
3901 // Info is set by getTgtMemInstrinsic
3902 TargetLowering::IntrinsicInfo Info;
3903 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
3904 bool IsTgtIntrinsic = TLI.getTgtMemIntrinsic(Info, I, Intrinsic);
3906 // Add the intrinsic ID as an integer operand if it's not a target intrinsic.
3907 if (!IsTgtIntrinsic || Info.opc == ISD::INTRINSIC_VOID ||
3908 Info.opc == ISD::INTRINSIC_W_CHAIN)
3909 Ops.push_back(DAG.getTargetConstant(Intrinsic, TLI.getPointerTy()));
3911 // Add all operands of the call to the operand list.
3912 for (unsigned i = 0, e = I.getNumArgOperands(); i != e; ++i) {
3913 SDValue Op = getValue(I.getArgOperand(i));
3917 SmallVector<EVT, 4> ValueVTs;
3918 ComputeValueVTs(TLI, I.getType(), ValueVTs);
3921 ValueVTs.push_back(MVT::Other);
3923 SDVTList VTs = DAG.getVTList(ValueVTs);
3927 if (IsTgtIntrinsic) {
3928 // This is target intrinsic that touches memory
3929 Result = DAG.getMemIntrinsicNode(Info.opc, getCurSDLoc(),
3930 VTs, Ops, Info.memVT,
3931 MachinePointerInfo(Info.ptrVal, Info.offset),
3932 Info.align, Info.vol,
3933 Info.readMem, Info.writeMem, Info.size);
3934 } else if (!HasChain) {
3935 Result = DAG.getNode(ISD::INTRINSIC_WO_CHAIN, getCurSDLoc(), VTs, Ops);
3936 } else if (!I.getType()->isVoidTy()) {
3937 Result = DAG.getNode(ISD::INTRINSIC_W_CHAIN, getCurSDLoc(), VTs, Ops);
3939 Result = DAG.getNode(ISD::INTRINSIC_VOID, getCurSDLoc(), VTs, Ops);
3943 SDValue Chain = Result.getValue(Result.getNode()->getNumValues()-1);
3945 PendingLoads.push_back(Chain);
3950 if (!I.getType()->isVoidTy()) {
3951 if (VectorType *PTy = dyn_cast<VectorType>(I.getType())) {
3952 EVT VT = TLI.getValueType(PTy);
3953 Result = DAG.getNode(ISD::BITCAST, getCurSDLoc(), VT, Result);
3956 setValue(&I, Result);
3960 /// GetSignificand - Get the significand and build it into a floating-point
3961 /// number with exponent of 1:
3963 /// Op = (Op & 0x007fffff) | 0x3f800000;
3965 /// where Op is the hexadecimal representation of floating point value.
3967 GetSignificand(SelectionDAG &DAG, SDValue Op, SDLoc dl) {
3968 SDValue t1 = DAG.getNode(ISD::AND, dl, MVT::i32, Op,
3969 DAG.getConstant(0x007fffff, MVT::i32));
3970 SDValue t2 = DAG.getNode(ISD::OR, dl, MVT::i32, t1,
3971 DAG.getConstant(0x3f800000, MVT::i32));
3972 return DAG.getNode(ISD::BITCAST, dl, MVT::f32, t2);
3975 /// GetExponent - Get the exponent:
3977 /// (float)(int)(((Op & 0x7f800000) >> 23) - 127);
3979 /// where Op is the hexadecimal representation of floating point value.
3981 GetExponent(SelectionDAG &DAG, SDValue Op, const TargetLowering &TLI,
3983 SDValue t0 = DAG.getNode(ISD::AND, dl, MVT::i32, Op,
3984 DAG.getConstant(0x7f800000, MVT::i32));
3985 SDValue t1 = DAG.getNode(ISD::SRL, dl, MVT::i32, t0,
3986 DAG.getConstant(23, TLI.getPointerTy()));
3987 SDValue t2 = DAG.getNode(ISD::SUB, dl, MVT::i32, t1,
3988 DAG.getConstant(127, MVT::i32));
3989 return DAG.getNode(ISD::SINT_TO_FP, dl, MVT::f32, t2);
3992 /// getF32Constant - Get 32-bit floating point constant.
3994 getF32Constant(SelectionDAG &DAG, unsigned Flt) {
3995 return DAG.getConstantFP(APFloat(APFloat::IEEEsingle, APInt(32, Flt)),
3999 static SDValue getLimitedPrecisionExp2(SDValue t0, SDLoc dl,
4000 SelectionDAG &DAG) {
4001 // IntegerPartOfX = ((int32_t)(t0);
4002 SDValue IntegerPartOfX = DAG.getNode(ISD::FP_TO_SINT, dl, MVT::i32, t0);
4004 // FractionalPartOfX = t0 - (float)IntegerPartOfX;
4005 SDValue t1 = DAG.getNode(ISD::SINT_TO_FP, dl, MVT::f32, IntegerPartOfX);
4006 SDValue X = DAG.getNode(ISD::FSUB, dl, MVT::f32, t0, t1);
4008 // IntegerPartOfX <<= 23;
4009 IntegerPartOfX = DAG.getNode(
4010 ISD::SHL, dl, MVT::i32, IntegerPartOfX,
4011 DAG.getConstant(23, DAG.getTargetLoweringInfo().getPointerTy()));
4013 SDValue TwoToFractionalPartOfX;
4014 if (LimitFloatPrecision <= 6) {
4015 // For floating-point precision of 6:
4017 // TwoToFractionalPartOfX =
4019 // (0.735607626f + 0.252464424f * x) * x;
4021 // error 0.0144103317, which is 6 bits
4022 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
4023 getF32Constant(DAG, 0x3e814304));
4024 SDValue t3 = DAG.getNode(ISD::FADD, dl, MVT::f32, t2,
4025 getF32Constant(DAG, 0x3f3c50c8));
4026 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X);
4027 TwoToFractionalPartOfX = DAG.getNode(ISD::FADD, dl, MVT::f32, t4,
4028 getF32Constant(DAG, 0x3f7f5e7e));
4029 } else if (LimitFloatPrecision <= 12) {
4030 // For floating-point precision of 12:
4032 // TwoToFractionalPartOfX =
4035 // (0.224338339f + 0.792043434e-1f * x) * x) * x;
4037 // error 0.000107046256, which is 13 to 14 bits
4038 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
4039 getF32Constant(DAG, 0x3da235e3));
4040 SDValue t3 = DAG.getNode(ISD::FADD, dl, MVT::f32, t2,
4041 getF32Constant(DAG, 0x3e65b8f3));
4042 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X);
4043 SDValue t5 = DAG.getNode(ISD::FADD, dl, MVT::f32, t4,
4044 getF32Constant(DAG, 0x3f324b07));
4045 SDValue t6 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t5, X);
4046 TwoToFractionalPartOfX = DAG.getNode(ISD::FADD, dl, MVT::f32, t6,
4047 getF32Constant(DAG, 0x3f7ff8fd));
4048 } else { // LimitFloatPrecision <= 18
4049 // For floating-point precision of 18:
4051 // TwoToFractionalPartOfX =
4055 // (0.554906021e-1f +
4056 // (0.961591928e-2f +
4057 // (0.136028312e-2f + 0.157059148e-3f *x)*x)*x)*x)*x)*x;
4058 // error 2.47208000*10^(-7), which is better than 18 bits
4059 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
4060 getF32Constant(DAG, 0x3924b03e));
4061 SDValue t3 = DAG.getNode(ISD::FADD, dl, MVT::f32, t2,
4062 getF32Constant(DAG, 0x3ab24b87));
4063 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X);
4064 SDValue t5 = DAG.getNode(ISD::FADD, dl, MVT::f32, t4,
4065 getF32Constant(DAG, 0x3c1d8c17));
4066 SDValue t6 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t5, X);
4067 SDValue t7 = DAG.getNode(ISD::FADD, dl, MVT::f32, t6,
4068 getF32Constant(DAG, 0x3d634a1d));
4069 SDValue t8 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t7, X);
4070 SDValue t9 = DAG.getNode(ISD::FADD, dl, MVT::f32, t8,
4071 getF32Constant(DAG, 0x3e75fe14));
4072 SDValue t10 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t9, X);
4073 SDValue t11 = DAG.getNode(ISD::FADD, dl, MVT::f32, t10,
4074 getF32Constant(DAG, 0x3f317234));
4075 SDValue t12 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t11, X);
4076 TwoToFractionalPartOfX = DAG.getNode(ISD::FADD, dl, MVT::f32, t12,
4077 getF32Constant(DAG, 0x3f800000));
4080 // Add the exponent into the result in integer domain.
4081 SDValue t13 = DAG.getNode(ISD::BITCAST, dl, MVT::i32, TwoToFractionalPartOfX);
4082 return DAG.getNode(ISD::BITCAST, dl, MVT::f32,
4083 DAG.getNode(ISD::ADD, dl, MVT::i32, t13, IntegerPartOfX));
4086 /// expandExp - Lower an exp intrinsic. Handles the special sequences for
4087 /// limited-precision mode.
4088 static SDValue expandExp(SDLoc dl, SDValue Op, SelectionDAG &DAG,
4089 const TargetLowering &TLI) {
4090 if (Op.getValueType() == MVT::f32 &&
4091 LimitFloatPrecision > 0 && LimitFloatPrecision <= 18) {
4093 // Put the exponent in the right bit position for later addition to the
4096 // #define LOG2OFe 1.4426950f
4097 // t0 = Op * LOG2OFe
4098 SDValue t0 = DAG.getNode(ISD::FMUL, dl, MVT::f32, Op,
4099 getF32Constant(DAG, 0x3fb8aa3b));
4100 return getLimitedPrecisionExp2(t0, dl, DAG);
4103 // No special expansion.
4104 return DAG.getNode(ISD::FEXP, dl, Op.getValueType(), Op);
4107 /// expandLog - Lower a log intrinsic. Handles the special sequences for
4108 /// limited-precision mode.
4109 static SDValue expandLog(SDLoc dl, SDValue Op, SelectionDAG &DAG,
4110 const TargetLowering &TLI) {
4111 if (Op.getValueType() == MVT::f32 &&
4112 LimitFloatPrecision > 0 && LimitFloatPrecision <= 18) {
4113 SDValue Op1 = DAG.getNode(ISD::BITCAST, dl, MVT::i32, Op);
4115 // Scale the exponent by log(2) [0.69314718f].
4116 SDValue Exp = GetExponent(DAG, Op1, TLI, dl);
4117 SDValue LogOfExponent = DAG.getNode(ISD::FMUL, dl, MVT::f32, Exp,
4118 getF32Constant(DAG, 0x3f317218));
4120 // Get the significand and build it into a floating-point number with
4122 SDValue X = GetSignificand(DAG, Op1, dl);
4124 SDValue LogOfMantissa;
4125 if (LimitFloatPrecision <= 6) {
4126 // For floating-point precision of 6:
4130 // (1.4034025f - 0.23903021f * x) * x;
4132 // error 0.0034276066, which is better than 8 bits
4133 SDValue t0 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
4134 getF32Constant(DAG, 0xbe74c456));
4135 SDValue t1 = DAG.getNode(ISD::FADD, dl, MVT::f32, t0,
4136 getF32Constant(DAG, 0x3fb3a2b1));
4137 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t1, X);
4138 LogOfMantissa = DAG.getNode(ISD::FSUB, dl, MVT::f32, t2,
4139 getF32Constant(DAG, 0x3f949a29));
4140 } else if (LimitFloatPrecision <= 12) {
4141 // For floating-point precision of 12:
4147 // (0.44717955f - 0.56570851e-1f * x) * x) * x) * x;
4149 // error 0.000061011436, which is 14 bits
4150 SDValue t0 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
4151 getF32Constant(DAG, 0xbd67b6d6));
4152 SDValue t1 = DAG.getNode(ISD::FADD, dl, MVT::f32, t0,
4153 getF32Constant(DAG, 0x3ee4f4b8));
4154 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t1, X);
4155 SDValue t3 = DAG.getNode(ISD::FSUB, dl, MVT::f32, t2,
4156 getF32Constant(DAG, 0x3fbc278b));
4157 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X);
4158 SDValue t5 = DAG.getNode(ISD::FADD, dl, MVT::f32, t4,
4159 getF32Constant(DAG, 0x40348e95));
4160 SDValue t6 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t5, X);
4161 LogOfMantissa = DAG.getNode(ISD::FSUB, dl, MVT::f32, t6,
4162 getF32Constant(DAG, 0x3fdef31a));
4163 } else { // LimitFloatPrecision <= 18
4164 // For floating-point precision of 18:
4172 // (0.19073739f - 0.17809712e-1f * x) * x) * x) * x) * x)*x;
4174 // error 0.0000023660568, which is better than 18 bits
4175 SDValue t0 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
4176 getF32Constant(DAG, 0xbc91e5ac));
4177 SDValue t1 = DAG.getNode(ISD::FADD, dl, MVT::f32, t0,
4178 getF32Constant(DAG, 0x3e4350aa));
4179 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t1, X);
4180 SDValue t3 = DAG.getNode(ISD::FSUB, dl, MVT::f32, t2,
4181 getF32Constant(DAG, 0x3f60d3e3));
4182 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X);
4183 SDValue t5 = DAG.getNode(ISD::FADD, dl, MVT::f32, t4,
4184 getF32Constant(DAG, 0x4011cdf0));
4185 SDValue t6 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t5, X);
4186 SDValue t7 = DAG.getNode(ISD::FSUB, dl, MVT::f32, t6,
4187 getF32Constant(DAG, 0x406cfd1c));
4188 SDValue t8 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t7, X);
4189 SDValue t9 = DAG.getNode(ISD::FADD, dl, MVT::f32, t8,
4190 getF32Constant(DAG, 0x408797cb));
4191 SDValue t10 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t9, X);
4192 LogOfMantissa = DAG.getNode(ISD::FSUB, dl, MVT::f32, t10,
4193 getF32Constant(DAG, 0x4006dcab));
4196 return DAG.getNode(ISD::FADD, dl, MVT::f32, LogOfExponent, LogOfMantissa);
4199 // No special expansion.
4200 return DAG.getNode(ISD::FLOG, dl, Op.getValueType(), Op);
4203 /// expandLog2 - Lower a log2 intrinsic. Handles the special sequences for
4204 /// limited-precision mode.
4205 static SDValue expandLog2(SDLoc dl, SDValue Op, SelectionDAG &DAG,
4206 const TargetLowering &TLI) {
4207 if (Op.getValueType() == MVT::f32 &&
4208 LimitFloatPrecision > 0 && LimitFloatPrecision <= 18) {
4209 SDValue Op1 = DAG.getNode(ISD::BITCAST, dl, MVT::i32, Op);
4211 // Get the exponent.
4212 SDValue LogOfExponent = GetExponent(DAG, Op1, TLI, dl);
4214 // Get the significand and build it into a floating-point number with
4216 SDValue X = GetSignificand(DAG, Op1, dl);
4218 // Different possible minimax approximations of significand in
4219 // floating-point for various degrees of accuracy over [1,2].
4220 SDValue Log2ofMantissa;
4221 if (LimitFloatPrecision <= 6) {
4222 // For floating-point precision of 6:
4224 // Log2ofMantissa = -1.6749035f + (2.0246817f - .34484768f * x) * x;
4226 // error 0.0049451742, which is more than 7 bits
4227 SDValue t0 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
4228 getF32Constant(DAG, 0xbeb08fe0));
4229 SDValue t1 = DAG.getNode(ISD::FADD, dl, MVT::f32, t0,
4230 getF32Constant(DAG, 0x40019463));
4231 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t1, X);
4232 Log2ofMantissa = DAG.getNode(ISD::FSUB, dl, MVT::f32, t2,
4233 getF32Constant(DAG, 0x3fd6633d));
4234 } else if (LimitFloatPrecision <= 12) {
4235 // For floating-point precision of 12:
4241 // (.645142248f - 0.816157886e-1f * x) * x) * x) * x;
4243 // error 0.0000876136000, which is better than 13 bits
4244 SDValue t0 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
4245 getF32Constant(DAG, 0xbda7262e));
4246 SDValue t1 = DAG.getNode(ISD::FADD, dl, MVT::f32, t0,
4247 getF32Constant(DAG, 0x3f25280b));
4248 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t1, X);
4249 SDValue t3 = DAG.getNode(ISD::FSUB, dl, MVT::f32, t2,
4250 getF32Constant(DAG, 0x4007b923));
4251 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X);
4252 SDValue t5 = DAG.getNode(ISD::FADD, dl, MVT::f32, t4,
4253 getF32Constant(DAG, 0x40823e2f));
4254 SDValue t6 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t5, X);
4255 Log2ofMantissa = DAG.getNode(ISD::FSUB, dl, MVT::f32, t6,
4256 getF32Constant(DAG, 0x4020d29c));
4257 } else { // LimitFloatPrecision <= 18
4258 // For floating-point precision of 18:
4267 // 0.25691327e-1f * x) * x) * x) * x) * x) * x;
4269 // error 0.0000018516, which is better than 18 bits
4270 SDValue t0 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
4271 getF32Constant(DAG, 0xbcd2769e));
4272 SDValue t1 = DAG.getNode(ISD::FADD, dl, MVT::f32, t0,
4273 getF32Constant(DAG, 0x3e8ce0b9));
4274 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t1, X);
4275 SDValue t3 = DAG.getNode(ISD::FSUB, dl, MVT::f32, t2,
4276 getF32Constant(DAG, 0x3fa22ae7));
4277 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X);
4278 SDValue t5 = DAG.getNode(ISD::FADD, dl, MVT::f32, t4,
4279 getF32Constant(DAG, 0x40525723));
4280 SDValue t6 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t5, X);
4281 SDValue t7 = DAG.getNode(ISD::FSUB, dl, MVT::f32, t6,
4282 getF32Constant(DAG, 0x40aaf200));
4283 SDValue t8 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t7, X);
4284 SDValue t9 = DAG.getNode(ISD::FADD, dl, MVT::f32, t8,
4285 getF32Constant(DAG, 0x40c39dad));
4286 SDValue t10 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t9, X);
4287 Log2ofMantissa = DAG.getNode(ISD::FSUB, dl, MVT::f32, t10,
4288 getF32Constant(DAG, 0x4042902c));
4291 return DAG.getNode(ISD::FADD, dl, MVT::f32, LogOfExponent, Log2ofMantissa);
4294 // No special expansion.
4295 return DAG.getNode(ISD::FLOG2, dl, Op.getValueType(), Op);
4298 /// expandLog10 - Lower a log10 intrinsic. Handles the special sequences for
4299 /// limited-precision mode.
4300 static SDValue expandLog10(SDLoc dl, SDValue Op, SelectionDAG &DAG,
4301 const TargetLowering &TLI) {
4302 if (Op.getValueType() == MVT::f32 &&
4303 LimitFloatPrecision > 0 && LimitFloatPrecision <= 18) {
4304 SDValue Op1 = DAG.getNode(ISD::BITCAST, dl, MVT::i32, Op);
4306 // Scale the exponent by log10(2) [0.30102999f].
4307 SDValue Exp = GetExponent(DAG, Op1, TLI, dl);
4308 SDValue LogOfExponent = DAG.getNode(ISD::FMUL, dl, MVT::f32, Exp,
4309 getF32Constant(DAG, 0x3e9a209a));
4311 // Get the significand and build it into a floating-point number with
4313 SDValue X = GetSignificand(DAG, Op1, dl);
4315 SDValue Log10ofMantissa;
4316 if (LimitFloatPrecision <= 6) {
4317 // For floating-point precision of 6:
4319 // Log10ofMantissa =
4321 // (0.60948995f - 0.10380950f * x) * x;
4323 // error 0.0014886165, which is 6 bits
4324 SDValue t0 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
4325 getF32Constant(DAG, 0xbdd49a13));
4326 SDValue t1 = DAG.getNode(ISD::FADD, dl, MVT::f32, t0,
4327 getF32Constant(DAG, 0x3f1c0789));
4328 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t1, X);
4329 Log10ofMantissa = DAG.getNode(ISD::FSUB, dl, MVT::f32, t2,
4330 getF32Constant(DAG, 0x3f011300));
4331 } else if (LimitFloatPrecision <= 12) {
4332 // For floating-point precision of 12:
4334 // Log10ofMantissa =
4337 // (-0.31664806f + 0.47637168e-1f * x) * x) * x;
4339 // error 0.00019228036, which is better than 12 bits
4340 SDValue t0 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
4341 getF32Constant(DAG, 0x3d431f31));
4342 SDValue t1 = DAG.getNode(ISD::FSUB, dl, MVT::f32, t0,
4343 getF32Constant(DAG, 0x3ea21fb2));
4344 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t1, X);
4345 SDValue t3 = DAG.getNode(ISD::FADD, dl, MVT::f32, t2,
4346 getF32Constant(DAG, 0x3f6ae232));
4347 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X);
4348 Log10ofMantissa = DAG.getNode(ISD::FSUB, dl, MVT::f32, t4,
4349 getF32Constant(DAG, 0x3f25f7c3));
4350 } else { // LimitFloatPrecision <= 18
4351 // For floating-point precision of 18:
4353 // Log10ofMantissa =
4358 // (-0.12539807f + 0.13508273e-1f * x) * x) * x) * x) * x;
4360 // error 0.0000037995730, which is better than 18 bits
4361 SDValue t0 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
4362 getF32Constant(DAG, 0x3c5d51ce));
4363 SDValue t1 = DAG.getNode(ISD::FSUB, dl, MVT::f32, t0,
4364 getF32Constant(DAG, 0x3e00685a));
4365 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t1, X);
4366 SDValue t3 = DAG.getNode(ISD::FADD, dl, MVT::f32, t2,
4367 getF32Constant(DAG, 0x3efb6798));
4368 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X);
4369 SDValue t5 = DAG.getNode(ISD::FSUB, dl, MVT::f32, t4,
4370 getF32Constant(DAG, 0x3f88d192));
4371 SDValue t6 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t5, X);
4372 SDValue t7 = DAG.getNode(ISD::FADD, dl, MVT::f32, t6,
4373 getF32Constant(DAG, 0x3fc4316c));
4374 SDValue t8 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t7, X);
4375 Log10ofMantissa = DAG.getNode(ISD::FSUB, dl, MVT::f32, t8,
4376 getF32Constant(DAG, 0x3f57ce70));
4379 return DAG.getNode(ISD::FADD, dl, MVT::f32, LogOfExponent, Log10ofMantissa);
4382 // No special expansion.
4383 return DAG.getNode(ISD::FLOG10, dl, Op.getValueType(), Op);
4386 /// expandExp2 - Lower an exp2 intrinsic. Handles the special sequences for
4387 /// limited-precision mode.
4388 static SDValue expandExp2(SDLoc dl, SDValue Op, SelectionDAG &DAG,
4389 const TargetLowering &TLI) {
4390 if (Op.getValueType() == MVT::f32 &&
4391 LimitFloatPrecision > 0 && LimitFloatPrecision <= 18)
4392 return getLimitedPrecisionExp2(Op, dl, DAG);
4394 // No special expansion.
4395 return DAG.getNode(ISD::FEXP2, dl, Op.getValueType(), Op);
4398 /// visitPow - Lower a pow intrinsic. Handles the special sequences for
4399 /// limited-precision mode with x == 10.0f.
4400 static SDValue expandPow(SDLoc dl, SDValue LHS, SDValue RHS,
4401 SelectionDAG &DAG, const TargetLowering &TLI) {
4402 bool IsExp10 = false;
4403 if (LHS.getValueType() == MVT::f32 && RHS.getValueType() == MVT::f32 &&
4404 LimitFloatPrecision > 0 && LimitFloatPrecision <= 18) {
4405 if (ConstantFPSDNode *LHSC = dyn_cast<ConstantFPSDNode>(LHS)) {
4407 IsExp10 = LHSC->isExactlyValue(Ten);
4412 // Put the exponent in the right bit position for later addition to the
4415 // #define LOG2OF10 3.3219281f
4416 // t0 = Op * LOG2OF10;
4417 SDValue t0 = DAG.getNode(ISD::FMUL, dl, MVT::f32, RHS,
4418 getF32Constant(DAG, 0x40549a78));
4419 return getLimitedPrecisionExp2(t0, dl, DAG);
4422 // No special expansion.
4423 return DAG.getNode(ISD::FPOW, dl, LHS.getValueType(), LHS, RHS);
4427 /// ExpandPowI - Expand a llvm.powi intrinsic.
4428 static SDValue ExpandPowI(SDLoc DL, SDValue LHS, SDValue RHS,
4429 SelectionDAG &DAG) {
4430 // If RHS is a constant, we can expand this out to a multiplication tree,
4431 // otherwise we end up lowering to a call to __powidf2 (for example). When
4432 // optimizing for size, we only want to do this if the expansion would produce
4433 // a small number of multiplies, otherwise we do the full expansion.
4434 if (ConstantSDNode *RHSC = dyn_cast<ConstantSDNode>(RHS)) {
4435 // Get the exponent as a positive value.
4436 unsigned Val = RHSC->getSExtValue();
4437 if ((int)Val < 0) Val = -Val;
4439 // powi(x, 0) -> 1.0
4441 return DAG.getConstantFP(1.0, LHS.getValueType());
4443 const Function *F = DAG.getMachineFunction().getFunction();
4444 if (!F->hasFnAttribute(Attribute::OptimizeForSize) ||
4445 // If optimizing for size, don't insert too many multiplies. This
4446 // inserts up to 5 multiplies.
4447 countPopulation(Val) + Log2_32(Val) < 7) {
4448 // We use the simple binary decomposition method to generate the multiply
4449 // sequence. There are more optimal ways to do this (for example,
4450 // powi(x,15) generates one more multiply than it should), but this has
4451 // the benefit of being both really simple and much better than a libcall.
4452 SDValue Res; // Logically starts equal to 1.0
4453 SDValue CurSquare = LHS;
4457 Res = DAG.getNode(ISD::FMUL, DL,Res.getValueType(), Res, CurSquare);
4459 Res = CurSquare; // 1.0*CurSquare.
4462 CurSquare = DAG.getNode(ISD::FMUL, DL, CurSquare.getValueType(),
4463 CurSquare, CurSquare);
4467 // If the original was negative, invert the result, producing 1/(x*x*x).
4468 if (RHSC->getSExtValue() < 0)
4469 Res = DAG.getNode(ISD::FDIV, DL, LHS.getValueType(),
4470 DAG.getConstantFP(1.0, LHS.getValueType()), Res);
4475 // Otherwise, expand to a libcall.
4476 return DAG.getNode(ISD::FPOWI, DL, LHS.getValueType(), LHS, RHS);
4479 // getTruncatedArgReg - Find underlying register used for an truncated
4481 static unsigned getTruncatedArgReg(const SDValue &N) {
4482 if (N.getOpcode() != ISD::TRUNCATE)
4485 const SDValue &Ext = N.getOperand(0);
4486 if (Ext.getOpcode() == ISD::AssertZext ||
4487 Ext.getOpcode() == ISD::AssertSext) {
4488 const SDValue &CFR = Ext.getOperand(0);
4489 if (CFR.getOpcode() == ISD::CopyFromReg)
4490 return cast<RegisterSDNode>(CFR.getOperand(1))->getReg();
4491 if (CFR.getOpcode() == ISD::TRUNCATE)
4492 return getTruncatedArgReg(CFR);
4497 /// EmitFuncArgumentDbgValue - If the DbgValueInst is a dbg_value of a function
4498 /// argument, create the corresponding DBG_VALUE machine instruction for it now.
4499 /// At the end of instruction selection, they will be inserted to the entry BB.
4500 bool SelectionDAGBuilder::EmitFuncArgumentDbgValue(const Value *V,
4502 MDNode *Expr, int64_t Offset,
4505 const Argument *Arg = dyn_cast<Argument>(V);
4509 MachineFunction &MF = DAG.getMachineFunction();
4510 const TargetInstrInfo *TII = DAG.getSubtarget().getInstrInfo();
4512 // Ignore inlined function arguments here.
4513 DIVariable DV(Variable);
4514 if (DV.isInlinedFnArgument(MF.getFunction()))
4517 Optional<MachineOperand> Op;
4518 // Some arguments' frame index is recorded during argument lowering.
4519 if (int FI = FuncInfo.getArgumentFrameIndex(Arg))
4520 Op = MachineOperand::CreateFI(FI);
4522 if (!Op && N.getNode()) {
4524 if (N.getOpcode() == ISD::CopyFromReg)
4525 Reg = cast<RegisterSDNode>(N.getOperand(1))->getReg();
4527 Reg = getTruncatedArgReg(N);
4528 if (Reg && TargetRegisterInfo::isVirtualRegister(Reg)) {
4529 MachineRegisterInfo &RegInfo = MF.getRegInfo();
4530 unsigned PR = RegInfo.getLiveInPhysReg(Reg);
4535 Op = MachineOperand::CreateReg(Reg, false);
4539 // Check if ValueMap has reg number.
4540 DenseMap<const Value *, unsigned>::iterator VMI = FuncInfo.ValueMap.find(V);
4541 if (VMI != FuncInfo.ValueMap.end())
4542 Op = MachineOperand::CreateReg(VMI->second, false);
4545 if (!Op && N.getNode())
4546 // Check if frame index is available.
4547 if (LoadSDNode *LNode = dyn_cast<LoadSDNode>(N.getNode()))
4548 if (FrameIndexSDNode *FINode =
4549 dyn_cast<FrameIndexSDNode>(LNode->getBasePtr().getNode()))
4550 Op = MachineOperand::CreateFI(FINode->getIndex());
4556 FuncInfo.ArgDbgValues.push_back(
4557 BuildMI(MF, getCurDebugLoc(), TII->get(TargetOpcode::DBG_VALUE),
4558 IsIndirect, Op->getReg(), Offset, Variable, Expr));
4560 FuncInfo.ArgDbgValues.push_back(
4561 BuildMI(MF, getCurDebugLoc(), TII->get(TargetOpcode::DBG_VALUE))
4564 .addMetadata(Variable)
4565 .addMetadata(Expr));
4570 // VisualStudio defines setjmp as _setjmp
4571 #if defined(_MSC_VER) && defined(setjmp) && \
4572 !defined(setjmp_undefined_for_msvc)
4573 # pragma push_macro("setjmp")
4575 # define setjmp_undefined_for_msvc
4578 /// visitIntrinsicCall - Lower the call to the specified intrinsic function. If
4579 /// we want to emit this as a call to a named external function, return the name
4580 /// otherwise lower it and return null.
4582 SelectionDAGBuilder::visitIntrinsicCall(const CallInst &I, unsigned Intrinsic) {
4583 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
4584 SDLoc sdl = getCurSDLoc();
4585 DebugLoc dl = getCurDebugLoc();
4588 switch (Intrinsic) {
4590 // By default, turn this into a target intrinsic node.
4591 visitTargetIntrinsic(I, Intrinsic);
4593 case Intrinsic::vastart: visitVAStart(I); return nullptr;
4594 case Intrinsic::vaend: visitVAEnd(I); return nullptr;
4595 case Intrinsic::vacopy: visitVACopy(I); return nullptr;
4596 case Intrinsic::returnaddress:
4597 setValue(&I, DAG.getNode(ISD::RETURNADDR, sdl, TLI.getPointerTy(),
4598 getValue(I.getArgOperand(0))));
4600 case Intrinsic::frameaddress:
4601 setValue(&I, DAG.getNode(ISD::FRAMEADDR, sdl, TLI.getPointerTy(),
4602 getValue(I.getArgOperand(0))));
4604 case Intrinsic::read_register: {
4605 Value *Reg = I.getArgOperand(0);
4607 DAG.getMDNode(cast<MDNode>(cast<MetadataAsValue>(Reg)->getMetadata()));
4608 EVT VT = TLI.getValueType(I.getType());
4609 setValue(&I, DAG.getNode(ISD::READ_REGISTER, sdl, VT, RegName));
4612 case Intrinsic::write_register: {
4613 Value *Reg = I.getArgOperand(0);
4614 Value *RegValue = I.getArgOperand(1);
4615 SDValue Chain = getValue(RegValue).getOperand(0);
4617 DAG.getMDNode(cast<MDNode>(cast<MetadataAsValue>(Reg)->getMetadata()));
4618 DAG.setRoot(DAG.getNode(ISD::WRITE_REGISTER, sdl, MVT::Other, Chain,
4619 RegName, getValue(RegValue)));
4622 case Intrinsic::setjmp:
4623 return &"_setjmp"[!TLI.usesUnderscoreSetJmp()];
4624 case Intrinsic::longjmp:
4625 return &"_longjmp"[!TLI.usesUnderscoreLongJmp()];
4626 case Intrinsic::memcpy: {
4627 // FIXME: this definition of "user defined address space" is x86-specific
4628 // Assert for address < 256 since we support only user defined address
4630 assert(cast<PointerType>(I.getArgOperand(0)->getType())->getAddressSpace()
4632 cast<PointerType>(I.getArgOperand(1)->getType())->getAddressSpace()
4634 "Unknown address space");
4635 SDValue Op1 = getValue(I.getArgOperand(0));
4636 SDValue Op2 = getValue(I.getArgOperand(1));
4637 SDValue Op3 = getValue(I.getArgOperand(2));
4638 unsigned Align = cast<ConstantInt>(I.getArgOperand(3))->getZExtValue();
4640 Align = 1; // @llvm.memcpy defines 0 and 1 to both mean no alignment.
4641 bool isVol = cast<ConstantInt>(I.getArgOperand(4))->getZExtValue();
4642 DAG.setRoot(DAG.getMemcpy(getRoot(), sdl, Op1, Op2, Op3, Align, isVol, false,
4643 MachinePointerInfo(I.getArgOperand(0)),
4644 MachinePointerInfo(I.getArgOperand(1))));
4647 case Intrinsic::memset: {
4648 // FIXME: this definition of "user defined address space" is x86-specific
4649 // Assert for address < 256 since we support only user defined address
4651 assert(cast<PointerType>(I.getArgOperand(0)->getType())->getAddressSpace()
4653 "Unknown address space");
4654 SDValue Op1 = getValue(I.getArgOperand(0));
4655 SDValue Op2 = getValue(I.getArgOperand(1));
4656 SDValue Op3 = getValue(I.getArgOperand(2));
4657 unsigned Align = cast<ConstantInt>(I.getArgOperand(3))->getZExtValue();
4659 Align = 1; // @llvm.memset defines 0 and 1 to both mean no alignment.
4660 bool isVol = cast<ConstantInt>(I.getArgOperand(4))->getZExtValue();
4661 DAG.setRoot(DAG.getMemset(getRoot(), sdl, Op1, Op2, Op3, Align, isVol,
4662 MachinePointerInfo(I.getArgOperand(0))));
4665 case Intrinsic::memmove: {
4666 // FIXME: this definition of "user defined address space" is x86-specific
4667 // Assert for address < 256 since we support only user defined address
4669 assert(cast<PointerType>(I.getArgOperand(0)->getType())->getAddressSpace()
4671 cast<PointerType>(I.getArgOperand(1)->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.memmove defines 0 and 1 to both mean no alignment.
4680 bool isVol = cast<ConstantInt>(I.getArgOperand(4))->getZExtValue();
4681 DAG.setRoot(DAG.getMemmove(getRoot(), sdl, Op1, Op2, Op3, Align, isVol,
4682 MachinePointerInfo(I.getArgOperand(0)),
4683 MachinePointerInfo(I.getArgOperand(1))));
4686 case Intrinsic::dbg_declare: {
4687 const DbgDeclareInst &DI = cast<DbgDeclareInst>(I);
4688 MDNode *Variable = DI.getVariable();
4689 MDNode *Expression = DI.getExpression();
4690 const Value *Address = DI.getAddress();
4691 DIVariable DIVar(Variable);
4692 assert((!DIVar || DIVar.isVariable()) &&
4693 "Variable in DbgDeclareInst should be either null or a DIVariable.");
4694 if (!Address || !DIVar) {
4695 DEBUG(dbgs() << "Dropping debug info for " << DI << "\n");
4699 // Check if address has undef value.
4700 if (isa<UndefValue>(Address) ||
4701 (Address->use_empty() && !isa<Argument>(Address))) {
4702 DEBUG(dbgs() << "Dropping debug info for " << DI << "\n");
4706 SDValue &N = NodeMap[Address];
4707 if (!N.getNode() && isa<Argument>(Address))
4708 // Check unused arguments map.
4709 N = UnusedArgNodeMap[Address];
4712 if (const BitCastInst *BCI = dyn_cast<BitCastInst>(Address))
4713 Address = BCI->getOperand(0);
4714 // Parameters are handled specially.
4716 (DIVariable(Variable).getTag() == dwarf::DW_TAG_arg_variable ||
4717 isa<Argument>(Address));
4719 const AllocaInst *AI = dyn_cast<AllocaInst>(Address);
4721 if (isParameter && !AI) {
4722 FrameIndexSDNode *FINode = dyn_cast<FrameIndexSDNode>(N.getNode());
4724 // Byval parameter. We have a frame index at this point.
4725 SDV = DAG.getFrameIndexDbgValue(
4726 Variable, Expression, FINode->getIndex(), 0, dl, SDNodeOrder);
4728 // Address is an argument, so try to emit its dbg value using
4729 // virtual register info from the FuncInfo.ValueMap.
4730 EmitFuncArgumentDbgValue(Address, Variable, Expression, 0, false, N);
4734 SDV = DAG.getDbgValue(Variable, Expression, N.getNode(), N.getResNo(),
4735 true, 0, dl, SDNodeOrder);
4737 // Can't do anything with other non-AI cases yet.
4738 DEBUG(dbgs() << "Dropping debug info for " << DI << "\n");
4739 DEBUG(dbgs() << "non-AllocaInst issue for Address: \n\t");
4740 DEBUG(Address->dump());
4743 DAG.AddDbgValue(SDV, N.getNode(), isParameter);
4745 // If Address is an argument then try to emit its dbg value using
4746 // virtual register info from the FuncInfo.ValueMap.
4747 if (!EmitFuncArgumentDbgValue(Address, Variable, Expression, 0, false,
4749 // If variable is pinned by a alloca in dominating bb then
4750 // use StaticAllocaMap.
4751 if (const AllocaInst *AI = dyn_cast<AllocaInst>(Address)) {
4752 if (AI->getParent() != DI.getParent()) {
4753 DenseMap<const AllocaInst*, int>::iterator SI =
4754 FuncInfo.StaticAllocaMap.find(AI);
4755 if (SI != FuncInfo.StaticAllocaMap.end()) {
4756 SDV = DAG.getFrameIndexDbgValue(Variable, Expression, SI->second,
4757 0, dl, SDNodeOrder);
4758 DAG.AddDbgValue(SDV, nullptr, false);
4763 DEBUG(dbgs() << "Dropping debug info for " << DI << "\n");
4768 case Intrinsic::dbg_value: {
4769 const DbgValueInst &DI = cast<DbgValueInst>(I);
4770 DIVariable DIVar(DI.getVariable());
4771 assert((!DIVar || DIVar.isVariable()) &&
4772 "Variable in DbgValueInst should be either null or a DIVariable.");
4776 MDNode *Variable = DI.getVariable();
4777 MDNode *Expression = DI.getExpression();
4778 uint64_t Offset = DI.getOffset();
4779 const Value *V = DI.getValue();
4784 if (isa<ConstantInt>(V) || isa<ConstantFP>(V) || isa<UndefValue>(V)) {
4785 SDV = DAG.getConstantDbgValue(Variable, Expression, V, Offset, dl,
4787 DAG.AddDbgValue(SDV, nullptr, false);
4789 // Do not use getValue() in here; we don't want to generate code at
4790 // this point if it hasn't been done yet.
4791 SDValue N = NodeMap[V];
4792 if (!N.getNode() && isa<Argument>(V))
4793 // Check unused arguments map.
4794 N = UnusedArgNodeMap[V];
4796 // A dbg.value for an alloca is always indirect.
4797 bool IsIndirect = isa<AllocaInst>(V) || Offset != 0;
4798 if (!EmitFuncArgumentDbgValue(V, Variable, Expression, Offset,
4800 SDV = DAG.getDbgValue(Variable, Expression, N.getNode(), N.getResNo(),
4801 IsIndirect, Offset, dl, SDNodeOrder);
4802 DAG.AddDbgValue(SDV, N.getNode(), false);
4804 } else if (!V->use_empty() ) {
4805 // Do not call getValue(V) yet, as we don't want to generate code.
4806 // Remember it for later.
4807 DanglingDebugInfo DDI(&DI, dl, SDNodeOrder);
4808 DanglingDebugInfoMap[V] = DDI;
4810 // We may expand this to cover more cases. One case where we have no
4811 // data available is an unreferenced parameter.
4812 DEBUG(dbgs() << "Dropping debug info for " << DI << "\n");
4816 // Build a debug info table entry.
4817 if (const BitCastInst *BCI = dyn_cast<BitCastInst>(V))
4818 V = BCI->getOperand(0);
4819 const AllocaInst *AI = dyn_cast<AllocaInst>(V);
4820 // Don't handle byval struct arguments or VLAs, for example.
4822 DEBUG(dbgs() << "Dropping debug location info for:\n " << DI << "\n");
4823 DEBUG(dbgs() << " Last seen at:\n " << *V << "\n");
4826 DenseMap<const AllocaInst*, int>::iterator SI =
4827 FuncInfo.StaticAllocaMap.find(AI);
4828 if (SI == FuncInfo.StaticAllocaMap.end())
4829 return nullptr; // VLAs.
4833 case Intrinsic::eh_typeid_for: {
4834 // Find the type id for the given typeinfo.
4835 GlobalValue *GV = ExtractTypeInfo(I.getArgOperand(0));
4836 unsigned TypeID = DAG.getMachineFunction().getMMI().getTypeIDFor(GV);
4837 Res = DAG.getConstant(TypeID, MVT::i32);
4842 case Intrinsic::eh_return_i32:
4843 case Intrinsic::eh_return_i64:
4844 DAG.getMachineFunction().getMMI().setCallsEHReturn(true);
4845 DAG.setRoot(DAG.getNode(ISD::EH_RETURN, sdl,
4848 getValue(I.getArgOperand(0)),
4849 getValue(I.getArgOperand(1))));
4851 case Intrinsic::eh_unwind_init:
4852 DAG.getMachineFunction().getMMI().setCallsUnwindInit(true);
4854 case Intrinsic::eh_dwarf_cfa: {
4855 SDValue CfaArg = DAG.getSExtOrTrunc(getValue(I.getArgOperand(0)), sdl,
4856 TLI.getPointerTy());
4857 SDValue Offset = DAG.getNode(ISD::ADD, sdl,
4858 CfaArg.getValueType(),
4859 DAG.getNode(ISD::FRAME_TO_ARGS_OFFSET, sdl,
4860 CfaArg.getValueType()),
4862 SDValue FA = DAG.getNode(ISD::FRAMEADDR, sdl, TLI.getPointerTy(),
4863 DAG.getConstant(0, TLI.getPointerTy()));
4864 setValue(&I, DAG.getNode(ISD::ADD, sdl, FA.getValueType(),
4868 case Intrinsic::eh_sjlj_callsite: {
4869 MachineModuleInfo &MMI = DAG.getMachineFunction().getMMI();
4870 ConstantInt *CI = dyn_cast<ConstantInt>(I.getArgOperand(0));
4871 assert(CI && "Non-constant call site value in eh.sjlj.callsite!");
4872 assert(MMI.getCurrentCallSite() == 0 && "Overlapping call sites!");
4874 MMI.setCurrentCallSite(CI->getZExtValue());
4877 case Intrinsic::eh_sjlj_functioncontext: {
4878 // Get and store the index of the function context.
4879 MachineFrameInfo *MFI = DAG.getMachineFunction().getFrameInfo();
4881 cast<AllocaInst>(I.getArgOperand(0)->stripPointerCasts());
4882 int FI = FuncInfo.StaticAllocaMap[FnCtx];
4883 MFI->setFunctionContextIndex(FI);
4886 case Intrinsic::eh_sjlj_setjmp: {
4889 Ops[1] = getValue(I.getArgOperand(0));
4890 SDValue Op = DAG.getNode(ISD::EH_SJLJ_SETJMP, sdl,
4891 DAG.getVTList(MVT::i32, MVT::Other), Ops);
4892 setValue(&I, Op.getValue(0));
4893 DAG.setRoot(Op.getValue(1));
4896 case Intrinsic::eh_sjlj_longjmp: {
4897 DAG.setRoot(DAG.getNode(ISD::EH_SJLJ_LONGJMP, sdl, MVT::Other,
4898 getRoot(), getValue(I.getArgOperand(0))));
4902 case Intrinsic::masked_load:
4905 case Intrinsic::masked_store:
4906 visitMaskedStore(I);
4908 case Intrinsic::x86_mmx_pslli_w:
4909 case Intrinsic::x86_mmx_pslli_d:
4910 case Intrinsic::x86_mmx_pslli_q:
4911 case Intrinsic::x86_mmx_psrli_w:
4912 case Intrinsic::x86_mmx_psrli_d:
4913 case Intrinsic::x86_mmx_psrli_q:
4914 case Intrinsic::x86_mmx_psrai_w:
4915 case Intrinsic::x86_mmx_psrai_d: {
4916 SDValue ShAmt = getValue(I.getArgOperand(1));
4917 if (isa<ConstantSDNode>(ShAmt)) {
4918 visitTargetIntrinsic(I, Intrinsic);
4921 unsigned NewIntrinsic = 0;
4922 EVT ShAmtVT = MVT::v2i32;
4923 switch (Intrinsic) {
4924 case Intrinsic::x86_mmx_pslli_w:
4925 NewIntrinsic = Intrinsic::x86_mmx_psll_w;
4927 case Intrinsic::x86_mmx_pslli_d:
4928 NewIntrinsic = Intrinsic::x86_mmx_psll_d;
4930 case Intrinsic::x86_mmx_pslli_q:
4931 NewIntrinsic = Intrinsic::x86_mmx_psll_q;
4933 case Intrinsic::x86_mmx_psrli_w:
4934 NewIntrinsic = Intrinsic::x86_mmx_psrl_w;
4936 case Intrinsic::x86_mmx_psrli_d:
4937 NewIntrinsic = Intrinsic::x86_mmx_psrl_d;
4939 case Intrinsic::x86_mmx_psrli_q:
4940 NewIntrinsic = Intrinsic::x86_mmx_psrl_q;
4942 case Intrinsic::x86_mmx_psrai_w:
4943 NewIntrinsic = Intrinsic::x86_mmx_psra_w;
4945 case Intrinsic::x86_mmx_psrai_d:
4946 NewIntrinsic = Intrinsic::x86_mmx_psra_d;
4948 default: llvm_unreachable("Impossible intrinsic"); // Can't reach here.
4951 // The vector shift intrinsics with scalars uses 32b shift amounts but
4952 // the sse2/mmx shift instructions reads 64 bits. Set the upper 32 bits
4954 // We must do this early because v2i32 is not a legal type.
4957 ShOps[1] = DAG.getConstant(0, MVT::i32);
4958 ShAmt = DAG.getNode(ISD::BUILD_VECTOR, sdl, ShAmtVT, ShOps);
4959 EVT DestVT = TLI.getValueType(I.getType());
4960 ShAmt = DAG.getNode(ISD::BITCAST, sdl, DestVT, ShAmt);
4961 Res = DAG.getNode(ISD::INTRINSIC_WO_CHAIN, sdl, DestVT,
4962 DAG.getConstant(NewIntrinsic, MVT::i32),
4963 getValue(I.getArgOperand(0)), ShAmt);
4967 case Intrinsic::convertff:
4968 case Intrinsic::convertfsi:
4969 case Intrinsic::convertfui:
4970 case Intrinsic::convertsif:
4971 case Intrinsic::convertuif:
4972 case Intrinsic::convertss:
4973 case Intrinsic::convertsu:
4974 case Intrinsic::convertus:
4975 case Intrinsic::convertuu: {
4976 ISD::CvtCode Code = ISD::CVT_INVALID;
4977 switch (Intrinsic) {
4978 default: llvm_unreachable("Impossible intrinsic"); // Can't reach here.
4979 case Intrinsic::convertff: Code = ISD::CVT_FF; break;
4980 case Intrinsic::convertfsi: Code = ISD::CVT_FS; break;
4981 case Intrinsic::convertfui: Code = ISD::CVT_FU; break;
4982 case Intrinsic::convertsif: Code = ISD::CVT_SF; break;
4983 case Intrinsic::convertuif: Code = ISD::CVT_UF; break;
4984 case Intrinsic::convertss: Code = ISD::CVT_SS; break;
4985 case Intrinsic::convertsu: Code = ISD::CVT_SU; break;
4986 case Intrinsic::convertus: Code = ISD::CVT_US; break;
4987 case Intrinsic::convertuu: Code = ISD::CVT_UU; break;
4989 EVT DestVT = TLI.getValueType(I.getType());
4990 const Value *Op1 = I.getArgOperand(0);
4991 Res = DAG.getConvertRndSat(DestVT, sdl, getValue(Op1),
4992 DAG.getValueType(DestVT),
4993 DAG.getValueType(getValue(Op1).getValueType()),
4994 getValue(I.getArgOperand(1)),
4995 getValue(I.getArgOperand(2)),
5000 case Intrinsic::powi:
5001 setValue(&I, ExpandPowI(sdl, getValue(I.getArgOperand(0)),
5002 getValue(I.getArgOperand(1)), DAG));
5004 case Intrinsic::log:
5005 setValue(&I, expandLog(sdl, getValue(I.getArgOperand(0)), DAG, TLI));
5007 case Intrinsic::log2:
5008 setValue(&I, expandLog2(sdl, getValue(I.getArgOperand(0)), DAG, TLI));
5010 case Intrinsic::log10:
5011 setValue(&I, expandLog10(sdl, getValue(I.getArgOperand(0)), DAG, TLI));
5013 case Intrinsic::exp:
5014 setValue(&I, expandExp(sdl, getValue(I.getArgOperand(0)), DAG, TLI));
5016 case Intrinsic::exp2:
5017 setValue(&I, expandExp2(sdl, getValue(I.getArgOperand(0)), DAG, TLI));
5019 case Intrinsic::pow:
5020 setValue(&I, expandPow(sdl, getValue(I.getArgOperand(0)),
5021 getValue(I.getArgOperand(1)), DAG, TLI));
5023 case Intrinsic::sqrt:
5024 case Intrinsic::fabs:
5025 case Intrinsic::sin:
5026 case Intrinsic::cos:
5027 case Intrinsic::floor:
5028 case Intrinsic::ceil:
5029 case Intrinsic::trunc:
5030 case Intrinsic::rint:
5031 case Intrinsic::nearbyint:
5032 case Intrinsic::round: {
5034 switch (Intrinsic) {
5035 default: llvm_unreachable("Impossible intrinsic"); // Can't reach here.
5036 case Intrinsic::sqrt: Opcode = ISD::FSQRT; break;
5037 case Intrinsic::fabs: Opcode = ISD::FABS; break;
5038 case Intrinsic::sin: Opcode = ISD::FSIN; break;
5039 case Intrinsic::cos: Opcode = ISD::FCOS; break;
5040 case Intrinsic::floor: Opcode = ISD::FFLOOR; break;
5041 case Intrinsic::ceil: Opcode = ISD::FCEIL; break;
5042 case Intrinsic::trunc: Opcode = ISD::FTRUNC; break;
5043 case Intrinsic::rint: Opcode = ISD::FRINT; break;
5044 case Intrinsic::nearbyint: Opcode = ISD::FNEARBYINT; break;
5045 case Intrinsic::round: Opcode = ISD::FROUND; break;
5048 setValue(&I, DAG.getNode(Opcode, sdl,
5049 getValue(I.getArgOperand(0)).getValueType(),
5050 getValue(I.getArgOperand(0))));
5053 case Intrinsic::minnum:
5054 setValue(&I, DAG.getNode(ISD::FMINNUM, sdl,
5055 getValue(I.getArgOperand(0)).getValueType(),
5056 getValue(I.getArgOperand(0)),
5057 getValue(I.getArgOperand(1))));
5059 case Intrinsic::maxnum:
5060 setValue(&I, DAG.getNode(ISD::FMAXNUM, sdl,
5061 getValue(I.getArgOperand(0)).getValueType(),
5062 getValue(I.getArgOperand(0)),
5063 getValue(I.getArgOperand(1))));
5065 case Intrinsic::copysign:
5066 setValue(&I, DAG.getNode(ISD::FCOPYSIGN, sdl,
5067 getValue(I.getArgOperand(0)).getValueType(),
5068 getValue(I.getArgOperand(0)),
5069 getValue(I.getArgOperand(1))));
5071 case Intrinsic::fma:
5072 setValue(&I, DAG.getNode(ISD::FMA, sdl,
5073 getValue(I.getArgOperand(0)).getValueType(),
5074 getValue(I.getArgOperand(0)),
5075 getValue(I.getArgOperand(1)),
5076 getValue(I.getArgOperand(2))));
5078 case Intrinsic::fmuladd: {
5079 EVT VT = TLI.getValueType(I.getType());
5080 if (TM.Options.AllowFPOpFusion != FPOpFusion::Strict &&
5081 TLI.isFMAFasterThanFMulAndFAdd(VT)) {
5082 setValue(&I, DAG.getNode(ISD::FMA, sdl,
5083 getValue(I.getArgOperand(0)).getValueType(),
5084 getValue(I.getArgOperand(0)),
5085 getValue(I.getArgOperand(1)),
5086 getValue(I.getArgOperand(2))));
5088 SDValue Mul = DAG.getNode(ISD::FMUL, sdl,
5089 getValue(I.getArgOperand(0)).getValueType(),
5090 getValue(I.getArgOperand(0)),
5091 getValue(I.getArgOperand(1)));
5092 SDValue Add = DAG.getNode(ISD::FADD, sdl,
5093 getValue(I.getArgOperand(0)).getValueType(),
5095 getValue(I.getArgOperand(2)));
5100 case Intrinsic::convert_to_fp16:
5101 setValue(&I, DAG.getNode(ISD::BITCAST, sdl, MVT::i16,
5102 DAG.getNode(ISD::FP_ROUND, sdl, MVT::f16,
5103 getValue(I.getArgOperand(0)),
5104 DAG.getTargetConstant(0, MVT::i32))));
5106 case Intrinsic::convert_from_fp16:
5108 DAG.getNode(ISD::FP_EXTEND, sdl, TLI.getValueType(I.getType()),
5109 DAG.getNode(ISD::BITCAST, sdl, MVT::f16,
5110 getValue(I.getArgOperand(0)))));
5112 case Intrinsic::pcmarker: {
5113 SDValue Tmp = getValue(I.getArgOperand(0));
5114 DAG.setRoot(DAG.getNode(ISD::PCMARKER, sdl, MVT::Other, getRoot(), Tmp));
5117 case Intrinsic::readcyclecounter: {
5118 SDValue Op = getRoot();
5119 Res = DAG.getNode(ISD::READCYCLECOUNTER, sdl,
5120 DAG.getVTList(MVT::i64, MVT::Other), Op);
5122 DAG.setRoot(Res.getValue(1));
5125 case Intrinsic::bswap:
5126 setValue(&I, DAG.getNode(ISD::BSWAP, sdl,
5127 getValue(I.getArgOperand(0)).getValueType(),
5128 getValue(I.getArgOperand(0))));
5130 case Intrinsic::cttz: {
5131 SDValue Arg = getValue(I.getArgOperand(0));
5132 ConstantInt *CI = cast<ConstantInt>(I.getArgOperand(1));
5133 EVT Ty = Arg.getValueType();
5134 setValue(&I, DAG.getNode(CI->isZero() ? ISD::CTTZ : ISD::CTTZ_ZERO_UNDEF,
5138 case Intrinsic::ctlz: {
5139 SDValue Arg = getValue(I.getArgOperand(0));
5140 ConstantInt *CI = cast<ConstantInt>(I.getArgOperand(1));
5141 EVT Ty = Arg.getValueType();
5142 setValue(&I, DAG.getNode(CI->isZero() ? ISD::CTLZ : ISD::CTLZ_ZERO_UNDEF,
5146 case Intrinsic::ctpop: {
5147 SDValue Arg = getValue(I.getArgOperand(0));
5148 EVT Ty = Arg.getValueType();
5149 setValue(&I, DAG.getNode(ISD::CTPOP, sdl, Ty, Arg));
5152 case Intrinsic::stacksave: {
5153 SDValue Op = getRoot();
5154 Res = DAG.getNode(ISD::STACKSAVE, sdl,
5155 DAG.getVTList(TLI.getPointerTy(), MVT::Other), Op);
5157 DAG.setRoot(Res.getValue(1));
5160 case Intrinsic::stackrestore: {
5161 Res = getValue(I.getArgOperand(0));
5162 DAG.setRoot(DAG.getNode(ISD::STACKRESTORE, sdl, MVT::Other, getRoot(), Res));
5165 case Intrinsic::stackprotector: {
5166 // Emit code into the DAG to store the stack guard onto the stack.
5167 MachineFunction &MF = DAG.getMachineFunction();
5168 MachineFrameInfo *MFI = MF.getFrameInfo();
5169 EVT PtrTy = TLI.getPointerTy();
5170 SDValue Src, Chain = getRoot();
5171 const Value *Ptr = cast<LoadInst>(I.getArgOperand(0))->getPointerOperand();
5172 const GlobalVariable *GV = dyn_cast<GlobalVariable>(Ptr);
5174 // See if Ptr is a bitcast. If it is, look through it and see if we can get
5175 // global variable __stack_chk_guard.
5177 if (const Operator *BC = dyn_cast<Operator>(Ptr))
5178 if (BC->getOpcode() == Instruction::BitCast)
5179 GV = dyn_cast<GlobalVariable>(BC->getOperand(0));
5181 if (GV && TLI.useLoadStackGuardNode()) {
5182 // Emit a LOAD_STACK_GUARD node.
5183 MachineSDNode *Node = DAG.getMachineNode(TargetOpcode::LOAD_STACK_GUARD,
5185 MachinePointerInfo MPInfo(GV);
5186 MachineInstr::mmo_iterator MemRefs = MF.allocateMemRefsArray(1);
5187 unsigned Flags = MachineMemOperand::MOLoad |
5188 MachineMemOperand::MOInvariant;
5189 *MemRefs = MF.getMachineMemOperand(MPInfo, Flags,
5190 PtrTy.getSizeInBits() / 8,
5191 DAG.getEVTAlignment(PtrTy));
5192 Node->setMemRefs(MemRefs, MemRefs + 1);
5194 // Copy the guard value to a virtual register so that it can be
5195 // retrieved in the epilogue.
5196 Src = SDValue(Node, 0);
5197 const TargetRegisterClass *RC =
5198 TLI.getRegClassFor(Src.getSimpleValueType());
5199 unsigned Reg = MF.getRegInfo().createVirtualRegister(RC);
5201 SPDescriptor.setGuardReg(Reg);
5202 Chain = DAG.getCopyToReg(Chain, sdl, Reg, Src);
5204 Src = getValue(I.getArgOperand(0)); // The guard's value.
5207 AllocaInst *Slot = cast<AllocaInst>(I.getArgOperand(1));
5209 int FI = FuncInfo.StaticAllocaMap[Slot];
5210 MFI->setStackProtectorIndex(FI);
5212 SDValue FIN = DAG.getFrameIndex(FI, PtrTy);
5214 // Store the stack protector onto the stack.
5215 Res = DAG.getStore(Chain, sdl, Src, FIN,
5216 MachinePointerInfo::getFixedStack(FI),
5222 case Intrinsic::objectsize: {
5223 // If we don't know by now, we're never going to know.
5224 ConstantInt *CI = dyn_cast<ConstantInt>(I.getArgOperand(1));
5226 assert(CI && "Non-constant type in __builtin_object_size?");
5228 SDValue Arg = getValue(I.getCalledValue());
5229 EVT Ty = Arg.getValueType();
5232 Res = DAG.getConstant(-1ULL, Ty);
5234 Res = DAG.getConstant(0, Ty);
5239 case Intrinsic::annotation:
5240 case Intrinsic::ptr_annotation:
5241 // Drop the intrinsic, but forward the value
5242 setValue(&I, getValue(I.getOperand(0)));
5244 case Intrinsic::assume:
5245 case Intrinsic::var_annotation:
5246 // Discard annotate attributes and assumptions
5249 case Intrinsic::init_trampoline: {
5250 const Function *F = cast<Function>(I.getArgOperand(1)->stripPointerCasts());
5254 Ops[1] = getValue(I.getArgOperand(0));
5255 Ops[2] = getValue(I.getArgOperand(1));
5256 Ops[3] = getValue(I.getArgOperand(2));
5257 Ops[4] = DAG.getSrcValue(I.getArgOperand(0));
5258 Ops[5] = DAG.getSrcValue(F);
5260 Res = DAG.getNode(ISD::INIT_TRAMPOLINE, sdl, MVT::Other, Ops);
5265 case Intrinsic::adjust_trampoline: {
5266 setValue(&I, DAG.getNode(ISD::ADJUST_TRAMPOLINE, sdl,
5268 getValue(I.getArgOperand(0))));
5271 case Intrinsic::gcroot:
5273 const Value *Alloca = I.getArgOperand(0)->stripPointerCasts();
5274 const Constant *TypeMap = cast<Constant>(I.getArgOperand(1));
5276 FrameIndexSDNode *FI = cast<FrameIndexSDNode>(getValue(Alloca).getNode());
5277 GFI->addStackRoot(FI->getIndex(), TypeMap);
5280 case Intrinsic::gcread:
5281 case Intrinsic::gcwrite:
5282 llvm_unreachable("GC failed to lower gcread/gcwrite intrinsics!");
5283 case Intrinsic::flt_rounds:
5284 setValue(&I, DAG.getNode(ISD::FLT_ROUNDS_, sdl, MVT::i32));
5287 case Intrinsic::expect: {
5288 // Just replace __builtin_expect(exp, c) with EXP.
5289 setValue(&I, getValue(I.getArgOperand(0)));
5293 case Intrinsic::debugtrap:
5294 case Intrinsic::trap: {
5295 StringRef TrapFuncName = TM.Options.getTrapFunctionName();
5296 if (TrapFuncName.empty()) {
5297 ISD::NodeType Op = (Intrinsic == Intrinsic::trap) ?
5298 ISD::TRAP : ISD::DEBUGTRAP;
5299 DAG.setRoot(DAG.getNode(Op, sdl,MVT::Other, getRoot()));
5302 TargetLowering::ArgListTy Args;
5304 TargetLowering::CallLoweringInfo CLI(DAG);
5305 CLI.setDebugLoc(sdl).setChain(getRoot())
5306 .setCallee(CallingConv::C, I.getType(),
5307 DAG.getExternalSymbol(TrapFuncName.data(), TLI.getPointerTy()),
5308 std::move(Args), 0);
5310 std::pair<SDValue, SDValue> Result = TLI.LowerCallTo(CLI);
5311 DAG.setRoot(Result.second);
5315 case Intrinsic::uadd_with_overflow:
5316 case Intrinsic::sadd_with_overflow:
5317 case Intrinsic::usub_with_overflow:
5318 case Intrinsic::ssub_with_overflow:
5319 case Intrinsic::umul_with_overflow:
5320 case Intrinsic::smul_with_overflow: {
5322 switch (Intrinsic) {
5323 default: llvm_unreachable("Impossible intrinsic"); // Can't reach here.
5324 case Intrinsic::uadd_with_overflow: Op = ISD::UADDO; break;
5325 case Intrinsic::sadd_with_overflow: Op = ISD::SADDO; break;
5326 case Intrinsic::usub_with_overflow: Op = ISD::USUBO; break;
5327 case Intrinsic::ssub_with_overflow: Op = ISD::SSUBO; break;
5328 case Intrinsic::umul_with_overflow: Op = ISD::UMULO; break;
5329 case Intrinsic::smul_with_overflow: Op = ISD::SMULO; break;
5331 SDValue Op1 = getValue(I.getArgOperand(0));
5332 SDValue Op2 = getValue(I.getArgOperand(1));
5334 SDVTList VTs = DAG.getVTList(Op1.getValueType(), MVT::i1);
5335 setValue(&I, DAG.getNode(Op, sdl, VTs, Op1, Op2));
5338 case Intrinsic::prefetch: {
5340 unsigned rw = cast<ConstantInt>(I.getArgOperand(1))->getZExtValue();
5342 Ops[1] = getValue(I.getArgOperand(0));
5343 Ops[2] = getValue(I.getArgOperand(1));
5344 Ops[3] = getValue(I.getArgOperand(2));
5345 Ops[4] = getValue(I.getArgOperand(3));
5346 DAG.setRoot(DAG.getMemIntrinsicNode(ISD::PREFETCH, sdl,
5347 DAG.getVTList(MVT::Other), Ops,
5348 EVT::getIntegerVT(*Context, 8),
5349 MachinePointerInfo(I.getArgOperand(0)),
5351 false, /* volatile */
5353 rw==1)); /* write */
5356 case Intrinsic::lifetime_start:
5357 case Intrinsic::lifetime_end: {
5358 bool IsStart = (Intrinsic == Intrinsic::lifetime_start);
5359 // Stack coloring is not enabled in O0, discard region information.
5360 if (TM.getOptLevel() == CodeGenOpt::None)
5363 SmallVector<Value *, 4> Allocas;
5364 GetUnderlyingObjects(I.getArgOperand(1), Allocas, *DL);
5366 for (SmallVectorImpl<Value*>::iterator Object = Allocas.begin(),
5367 E = Allocas.end(); Object != E; ++Object) {
5368 AllocaInst *LifetimeObject = dyn_cast_or_null<AllocaInst>(*Object);
5370 // Could not find an Alloca.
5371 if (!LifetimeObject)
5374 // First check that the Alloca is static, otherwise it won't have a
5375 // valid frame index.
5376 auto SI = FuncInfo.StaticAllocaMap.find(LifetimeObject);
5377 if (SI == FuncInfo.StaticAllocaMap.end())
5380 int FI = SI->second;
5384 Ops[1] = DAG.getFrameIndex(FI, TLI.getPointerTy(), true);
5385 unsigned Opcode = (IsStart ? ISD::LIFETIME_START : ISD::LIFETIME_END);
5387 Res = DAG.getNode(Opcode, sdl, MVT::Other, Ops);
5392 case Intrinsic::invariant_start:
5393 // Discard region information.
5394 setValue(&I, DAG.getUNDEF(TLI.getPointerTy()));
5396 case Intrinsic::invariant_end:
5397 // Discard region information.
5399 case Intrinsic::stackprotectorcheck: {
5400 // Do not actually emit anything for this basic block. Instead we initialize
5401 // the stack protector descriptor and export the guard variable so we can
5402 // access it in FinishBasicBlock.
5403 const BasicBlock *BB = I.getParent();
5404 SPDescriptor.initialize(BB, FuncInfo.MBBMap[BB], I);
5405 ExportFromCurrentBlock(SPDescriptor.getGuard());
5407 // Flush our exports since we are going to process a terminator.
5408 (void)getControlRoot();
5411 case Intrinsic::clear_cache:
5412 return TLI.getClearCacheBuiltinName();
5413 case Intrinsic::donothing:
5416 case Intrinsic::experimental_stackmap: {
5420 case Intrinsic::experimental_patchpoint_void:
5421 case Intrinsic::experimental_patchpoint_i64: {
5422 visitPatchpoint(&I);
5425 case Intrinsic::experimental_gc_statepoint: {
5429 case Intrinsic::experimental_gc_result_int:
5430 case Intrinsic::experimental_gc_result_float:
5431 case Intrinsic::experimental_gc_result_ptr:
5432 case Intrinsic::experimental_gc_result: {
5436 case Intrinsic::experimental_gc_relocate: {
5440 case Intrinsic::instrprof_increment:
5441 llvm_unreachable("instrprof failed to lower an increment");
5443 case Intrinsic::frameescape: {
5444 MachineFunction &MF = DAG.getMachineFunction();
5445 const TargetInstrInfo *TII = DAG.getSubtarget().getInstrInfo();
5447 // Directly emit some FRAME_ALLOC machine instrs. Label assignment emission
5448 // is the same on all targets.
5449 for (unsigned Idx = 0, E = I.getNumArgOperands(); Idx < E; ++Idx) {
5451 cast<AllocaInst>(I.getArgOperand(Idx)->stripPointerCasts());
5452 assert(FuncInfo.StaticAllocaMap.count(Slot) &&
5453 "can only escape static allocas");
5454 int FI = FuncInfo.StaticAllocaMap[Slot];
5455 MCSymbol *FrameAllocSym =
5456 MF.getMMI().getContext().getOrCreateFrameAllocSymbol(MF.getName(),
5458 BuildMI(*FuncInfo.MBB, FuncInfo.InsertPt, dl,
5459 TII->get(TargetOpcode::FRAME_ALLOC))
5460 .addSym(FrameAllocSym)
5467 case Intrinsic::framerecover: {
5468 // i8* @llvm.framerecover(i8* %fn, i8* %fp, i32 %idx)
5469 MachineFunction &MF = DAG.getMachineFunction();
5470 MVT PtrVT = TLI.getPointerTy(0);
5472 // Get the symbol that defines the frame offset.
5473 auto *Fn = cast<Function>(I.getArgOperand(0)->stripPointerCasts());
5474 auto *Idx = cast<ConstantInt>(I.getArgOperand(2));
5475 unsigned IdxVal = unsigned(Idx->getLimitedValue(INT_MAX));
5476 MCSymbol *FrameAllocSym =
5477 MF.getMMI().getContext().getOrCreateFrameAllocSymbol(Fn->getName(),
5480 // Create a TargetExternalSymbol for the label to avoid any target lowering
5481 // that would make this PC relative.
5482 StringRef Name = FrameAllocSym->getName();
5483 assert(Name.data()[Name.size()] == '\0' && "not null terminated");
5484 SDValue OffsetSym = DAG.getTargetExternalSymbol(Name.data(), PtrVT);
5486 DAG.getNode(ISD::FRAME_ALLOC_RECOVER, sdl, PtrVT, OffsetSym);
5488 // Add the offset to the FP.
5489 Value *FP = I.getArgOperand(1);
5490 SDValue FPVal = getValue(FP);
5491 SDValue Add = DAG.getNode(ISD::ADD, sdl, PtrVT, FPVal, OffsetVal);
5496 case Intrinsic::eh_begincatch:
5497 case Intrinsic::eh_endcatch:
5498 llvm_unreachable("begin/end catch intrinsics not lowered in codegen");
5502 std::pair<SDValue, SDValue>
5503 SelectionDAGBuilder::lowerInvokable(TargetLowering::CallLoweringInfo &CLI,
5504 MachineBasicBlock *LandingPad) {
5505 MachineModuleInfo &MMI = DAG.getMachineFunction().getMMI();
5506 MCSymbol *BeginLabel = nullptr;
5509 // Insert a label before the invoke call to mark the try range. This can be
5510 // used to detect deletion of the invoke via the MachineModuleInfo.
5511 BeginLabel = MMI.getContext().CreateTempSymbol();
5513 // For SjLj, keep track of which landing pads go with which invokes
5514 // so as to maintain the ordering of pads in the LSDA.
5515 unsigned CallSiteIndex = MMI.getCurrentCallSite();
5516 if (CallSiteIndex) {
5517 MMI.setCallSiteBeginLabel(BeginLabel, CallSiteIndex);
5518 LPadToCallSiteMap[LandingPad].push_back(CallSiteIndex);
5520 // Now that the call site is handled, stop tracking it.
5521 MMI.setCurrentCallSite(0);
5524 // Both PendingLoads and PendingExports must be flushed here;
5525 // this call might not return.
5527 DAG.setRoot(DAG.getEHLabel(getCurSDLoc(), getControlRoot(), BeginLabel));
5529 CLI.setChain(getRoot());
5531 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
5532 std::pair<SDValue, SDValue> Result = TLI.LowerCallTo(CLI);
5534 assert((CLI.IsTailCall || Result.second.getNode()) &&
5535 "Non-null chain expected with non-tail call!");
5536 assert((Result.second.getNode() || !Result.first.getNode()) &&
5537 "Null value expected with tail call!");
5539 if (!Result.second.getNode()) {
5540 // As a special case, a null chain means that a tail call has been emitted
5541 // and the DAG root is already updated.
5544 // Since there's no actual continuation from this block, nothing can be
5545 // relying on us setting vregs for them.
5546 PendingExports.clear();
5548 DAG.setRoot(Result.second);
5552 // Insert a label at the end of the invoke call to mark the try range. This
5553 // can be used to detect deletion of the invoke via the MachineModuleInfo.
5554 MCSymbol *EndLabel = MMI.getContext().CreateTempSymbol();
5555 DAG.setRoot(DAG.getEHLabel(getCurSDLoc(), getRoot(), EndLabel));
5557 // Inform MachineModuleInfo of range.
5558 MMI.addInvoke(LandingPad, BeginLabel, EndLabel);
5564 void SelectionDAGBuilder::LowerCallTo(ImmutableCallSite CS, SDValue Callee,
5566 MachineBasicBlock *LandingPad) {
5567 PointerType *PT = cast<PointerType>(CS.getCalledValue()->getType());
5568 FunctionType *FTy = cast<FunctionType>(PT->getElementType());
5569 Type *RetTy = FTy->getReturnType();
5571 TargetLowering::ArgListTy Args;
5572 TargetLowering::ArgListEntry Entry;
5573 Args.reserve(CS.arg_size());
5575 for (ImmutableCallSite::arg_iterator i = CS.arg_begin(), e = CS.arg_end();
5577 const Value *V = *i;
5580 if (V->getType()->isEmptyTy())
5583 SDValue ArgNode = getValue(V);
5584 Entry.Node = ArgNode; Entry.Ty = V->getType();
5586 // Skip the first return-type Attribute to get to params.
5587 Entry.setAttributes(&CS, i - CS.arg_begin() + 1);
5588 Args.push_back(Entry);
5591 // Check if target-independent constraints permit a tail call here.
5592 // Target-dependent constraints are checked within TLI->LowerCallTo.
5593 if (isTailCall && !isInTailCallPosition(CS, DAG.getTarget()))
5596 TargetLowering::CallLoweringInfo CLI(DAG);
5597 CLI.setDebugLoc(getCurSDLoc()).setChain(getRoot())
5598 .setCallee(RetTy, FTy, Callee, std::move(Args), CS)
5599 .setTailCall(isTailCall);
5600 std::pair<SDValue,SDValue> Result = lowerInvokable(CLI, LandingPad);
5602 if (Result.first.getNode())
5603 setValue(CS.getInstruction(), Result.first);
5606 /// IsOnlyUsedInZeroEqualityComparison - Return true if it only matters that the
5607 /// value is equal or not-equal to zero.
5608 static bool IsOnlyUsedInZeroEqualityComparison(const Value *V) {
5609 for (const User *U : V->users()) {
5610 if (const ICmpInst *IC = dyn_cast<ICmpInst>(U))
5611 if (IC->isEquality())
5612 if (const Constant *C = dyn_cast<Constant>(IC->getOperand(1)))
5613 if (C->isNullValue())
5615 // Unknown instruction.
5621 static SDValue getMemCmpLoad(const Value *PtrVal, MVT LoadVT,
5623 SelectionDAGBuilder &Builder) {
5625 // Check to see if this load can be trivially constant folded, e.g. if the
5626 // input is from a string literal.
5627 if (const Constant *LoadInput = dyn_cast<Constant>(PtrVal)) {
5628 // Cast pointer to the type we really want to load.
5629 LoadInput = ConstantExpr::getBitCast(const_cast<Constant *>(LoadInput),
5630 PointerType::getUnqual(LoadTy));
5632 if (const Constant *LoadCst = ConstantFoldLoadFromConstPtr(
5633 const_cast<Constant *>(LoadInput), *Builder.DL))
5634 return Builder.getValue(LoadCst);
5637 // Otherwise, we have to emit the load. If the pointer is to unfoldable but
5638 // still constant memory, the input chain can be the entry node.
5640 bool ConstantMemory = false;
5642 // Do not serialize (non-volatile) loads of constant memory with anything.
5643 if (Builder.AA->pointsToConstantMemory(PtrVal)) {
5644 Root = Builder.DAG.getEntryNode();
5645 ConstantMemory = true;
5647 // Do not serialize non-volatile loads against each other.
5648 Root = Builder.DAG.getRoot();
5651 SDValue Ptr = Builder.getValue(PtrVal);
5652 SDValue LoadVal = Builder.DAG.getLoad(LoadVT, Builder.getCurSDLoc(), Root,
5653 Ptr, MachinePointerInfo(PtrVal),
5655 false /*nontemporal*/,
5656 false /*isinvariant*/, 1 /* align=1 */);
5658 if (!ConstantMemory)
5659 Builder.PendingLoads.push_back(LoadVal.getValue(1));
5663 /// processIntegerCallValue - Record the value for an instruction that
5664 /// produces an integer result, converting the type where necessary.
5665 void SelectionDAGBuilder::processIntegerCallValue(const Instruction &I,
5668 EVT VT = DAG.getTargetLoweringInfo().getValueType(I.getType(), true);
5670 Value = DAG.getSExtOrTrunc(Value, getCurSDLoc(), VT);
5672 Value = DAG.getZExtOrTrunc(Value, getCurSDLoc(), VT);
5673 setValue(&I, Value);
5676 /// visitMemCmpCall - See if we can lower a call to memcmp in an optimized form.
5677 /// If so, return true and lower it, otherwise return false and it will be
5678 /// lowered like a normal call.
5679 bool SelectionDAGBuilder::visitMemCmpCall(const CallInst &I) {
5680 // Verify that the prototype makes sense. int memcmp(void*,void*,size_t)
5681 if (I.getNumArgOperands() != 3)
5684 const Value *LHS = I.getArgOperand(0), *RHS = I.getArgOperand(1);
5685 if (!LHS->getType()->isPointerTy() || !RHS->getType()->isPointerTy() ||
5686 !I.getArgOperand(2)->getType()->isIntegerTy() ||
5687 !I.getType()->isIntegerTy())
5690 const Value *Size = I.getArgOperand(2);
5691 const ConstantInt *CSize = dyn_cast<ConstantInt>(Size);
5692 if (CSize && CSize->getZExtValue() == 0) {
5693 EVT CallVT = DAG.getTargetLoweringInfo().getValueType(I.getType(), true);
5694 setValue(&I, DAG.getConstant(0, CallVT));
5698 const TargetSelectionDAGInfo &TSI = DAG.getSelectionDAGInfo();
5699 std::pair<SDValue, SDValue> Res =
5700 TSI.EmitTargetCodeForMemcmp(DAG, getCurSDLoc(), DAG.getRoot(),
5701 getValue(LHS), getValue(RHS), getValue(Size),
5702 MachinePointerInfo(LHS),
5703 MachinePointerInfo(RHS));
5704 if (Res.first.getNode()) {
5705 processIntegerCallValue(I, Res.first, true);
5706 PendingLoads.push_back(Res.second);
5710 // memcmp(S1,S2,2) != 0 -> (*(short*)LHS != *(short*)RHS) != 0
5711 // memcmp(S1,S2,4) != 0 -> (*(int*)LHS != *(int*)RHS) != 0
5712 if (CSize && IsOnlyUsedInZeroEqualityComparison(&I)) {
5713 bool ActuallyDoIt = true;
5716 switch (CSize->getZExtValue()) {
5718 LoadVT = MVT::Other;
5720 ActuallyDoIt = false;
5724 LoadTy = Type::getInt16Ty(CSize->getContext());
5728 LoadTy = Type::getInt32Ty(CSize->getContext());
5732 LoadTy = Type::getInt64Ty(CSize->getContext());
5736 LoadVT = MVT::v4i32;
5737 LoadTy = Type::getInt32Ty(CSize->getContext());
5738 LoadTy = VectorType::get(LoadTy, 4);
5743 // This turns into unaligned loads. We only do this if the target natively
5744 // supports the MVT we'll be loading or if it is small enough (<= 4) that
5745 // we'll only produce a small number of byte loads.
5747 // Require that we can find a legal MVT, and only do this if the target
5748 // supports unaligned loads of that type. Expanding into byte loads would
5750 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
5751 if (ActuallyDoIt && CSize->getZExtValue() > 4) {
5752 unsigned DstAS = LHS->getType()->getPointerAddressSpace();
5753 unsigned SrcAS = RHS->getType()->getPointerAddressSpace();
5754 // TODO: Handle 5 byte compare as 4-byte + 1 byte.
5755 // TODO: Handle 8 byte compare on x86-32 as two 32-bit loads.
5756 // TODO: Check alignment of src and dest ptrs.
5757 if (!TLI.isTypeLegal(LoadVT) ||
5758 !TLI.allowsMisalignedMemoryAccesses(LoadVT, SrcAS) ||
5759 !TLI.allowsMisalignedMemoryAccesses(LoadVT, DstAS))
5760 ActuallyDoIt = false;
5764 SDValue LHSVal = getMemCmpLoad(LHS, LoadVT, LoadTy, *this);
5765 SDValue RHSVal = getMemCmpLoad(RHS, LoadVT, LoadTy, *this);
5767 SDValue Res = DAG.getSetCC(getCurSDLoc(), MVT::i1, LHSVal, RHSVal,
5769 processIntegerCallValue(I, Res, false);
5778 /// visitMemChrCall -- See if we can lower a memchr call into an optimized
5779 /// form. If so, return true and lower it, otherwise return false and it
5780 /// will be lowered like a normal call.
5781 bool SelectionDAGBuilder::visitMemChrCall(const CallInst &I) {
5782 // Verify that the prototype makes sense. void *memchr(void *, int, size_t)
5783 if (I.getNumArgOperands() != 3)
5786 const Value *Src = I.getArgOperand(0);
5787 const Value *Char = I.getArgOperand(1);
5788 const Value *Length = I.getArgOperand(2);
5789 if (!Src->getType()->isPointerTy() ||
5790 !Char->getType()->isIntegerTy() ||
5791 !Length->getType()->isIntegerTy() ||
5792 !I.getType()->isPointerTy())
5795 const TargetSelectionDAGInfo &TSI = DAG.getSelectionDAGInfo();
5796 std::pair<SDValue, SDValue> Res =
5797 TSI.EmitTargetCodeForMemchr(DAG, getCurSDLoc(), DAG.getRoot(),
5798 getValue(Src), getValue(Char), getValue(Length),
5799 MachinePointerInfo(Src));
5800 if (Res.first.getNode()) {
5801 setValue(&I, Res.first);
5802 PendingLoads.push_back(Res.second);
5809 /// visitStrCpyCall -- See if we can lower a strcpy or stpcpy call into an
5810 /// optimized form. If so, return true and lower it, otherwise return false
5811 /// and it will be lowered like a normal call.
5812 bool SelectionDAGBuilder::visitStrCpyCall(const CallInst &I, bool isStpcpy) {
5813 // Verify that the prototype makes sense. char *strcpy(char *, char *)
5814 if (I.getNumArgOperands() != 2)
5817 const Value *Arg0 = I.getArgOperand(0), *Arg1 = I.getArgOperand(1);
5818 if (!Arg0->getType()->isPointerTy() ||
5819 !Arg1->getType()->isPointerTy() ||
5820 !I.getType()->isPointerTy())
5823 const TargetSelectionDAGInfo &TSI = DAG.getSelectionDAGInfo();
5824 std::pair<SDValue, SDValue> Res =
5825 TSI.EmitTargetCodeForStrcpy(DAG, getCurSDLoc(), getRoot(),
5826 getValue(Arg0), getValue(Arg1),
5827 MachinePointerInfo(Arg0),
5828 MachinePointerInfo(Arg1), isStpcpy);
5829 if (Res.first.getNode()) {
5830 setValue(&I, Res.first);
5831 DAG.setRoot(Res.second);
5838 /// visitStrCmpCall - See if we can lower a call to strcmp in an optimized form.
5839 /// If so, return true and lower it, otherwise return false and it will be
5840 /// lowered like a normal call.
5841 bool SelectionDAGBuilder::visitStrCmpCall(const CallInst &I) {
5842 // Verify that the prototype makes sense. int strcmp(void*,void*)
5843 if (I.getNumArgOperands() != 2)
5846 const Value *Arg0 = I.getArgOperand(0), *Arg1 = I.getArgOperand(1);
5847 if (!Arg0->getType()->isPointerTy() ||
5848 !Arg1->getType()->isPointerTy() ||
5849 !I.getType()->isIntegerTy())
5852 const TargetSelectionDAGInfo &TSI = DAG.getSelectionDAGInfo();
5853 std::pair<SDValue, SDValue> Res =
5854 TSI.EmitTargetCodeForStrcmp(DAG, getCurSDLoc(), DAG.getRoot(),
5855 getValue(Arg0), getValue(Arg1),
5856 MachinePointerInfo(Arg0),
5857 MachinePointerInfo(Arg1));
5858 if (Res.first.getNode()) {
5859 processIntegerCallValue(I, Res.first, true);
5860 PendingLoads.push_back(Res.second);
5867 /// visitStrLenCall -- See if we can lower a strlen call into an optimized
5868 /// form. If so, return true and lower it, otherwise return false and it
5869 /// will be lowered like a normal call.
5870 bool SelectionDAGBuilder::visitStrLenCall(const CallInst &I) {
5871 // Verify that the prototype makes sense. size_t strlen(char *)
5872 if (I.getNumArgOperands() != 1)
5875 const Value *Arg0 = I.getArgOperand(0);
5876 if (!Arg0->getType()->isPointerTy() || !I.getType()->isIntegerTy())
5879 const TargetSelectionDAGInfo &TSI = DAG.getSelectionDAGInfo();
5880 std::pair<SDValue, SDValue> Res =
5881 TSI.EmitTargetCodeForStrlen(DAG, getCurSDLoc(), DAG.getRoot(),
5882 getValue(Arg0), MachinePointerInfo(Arg0));
5883 if (Res.first.getNode()) {
5884 processIntegerCallValue(I, Res.first, false);
5885 PendingLoads.push_back(Res.second);
5892 /// visitStrNLenCall -- See if we can lower a strnlen call into an optimized
5893 /// form. If so, return true and lower it, otherwise return false and it
5894 /// will be lowered like a normal call.
5895 bool SelectionDAGBuilder::visitStrNLenCall(const CallInst &I) {
5896 // Verify that the prototype makes sense. size_t strnlen(char *, size_t)
5897 if (I.getNumArgOperands() != 2)
5900 const Value *Arg0 = I.getArgOperand(0), *Arg1 = I.getArgOperand(1);
5901 if (!Arg0->getType()->isPointerTy() ||
5902 !Arg1->getType()->isIntegerTy() ||
5903 !I.getType()->isIntegerTy())
5906 const TargetSelectionDAGInfo &TSI = DAG.getSelectionDAGInfo();
5907 std::pair<SDValue, SDValue> Res =
5908 TSI.EmitTargetCodeForStrnlen(DAG, getCurSDLoc(), DAG.getRoot(),
5909 getValue(Arg0), getValue(Arg1),
5910 MachinePointerInfo(Arg0));
5911 if (Res.first.getNode()) {
5912 processIntegerCallValue(I, Res.first, false);
5913 PendingLoads.push_back(Res.second);
5920 /// visitUnaryFloatCall - If a call instruction is a unary floating-point
5921 /// operation (as expected), translate it to an SDNode with the specified opcode
5922 /// and return true.
5923 bool SelectionDAGBuilder::visitUnaryFloatCall(const CallInst &I,
5925 // Sanity check that it really is a unary floating-point call.
5926 if (I.getNumArgOperands() != 1 ||
5927 !I.getArgOperand(0)->getType()->isFloatingPointTy() ||
5928 I.getType() != I.getArgOperand(0)->getType() ||
5929 !I.onlyReadsMemory())
5932 SDValue Tmp = getValue(I.getArgOperand(0));
5933 setValue(&I, DAG.getNode(Opcode, getCurSDLoc(), Tmp.getValueType(), Tmp));
5937 /// visitBinaryFloatCall - If a call instruction is a binary floating-point
5938 /// operation (as expected), translate it to an SDNode with the specified opcode
5939 /// and return true.
5940 bool SelectionDAGBuilder::visitBinaryFloatCall(const CallInst &I,
5942 // Sanity check that it really is a binary floating-point call.
5943 if (I.getNumArgOperands() != 2 ||
5944 !I.getArgOperand(0)->getType()->isFloatingPointTy() ||
5945 I.getType() != I.getArgOperand(0)->getType() ||
5946 I.getType() != I.getArgOperand(1)->getType() ||
5947 !I.onlyReadsMemory())
5950 SDValue Tmp0 = getValue(I.getArgOperand(0));
5951 SDValue Tmp1 = getValue(I.getArgOperand(1));
5952 EVT VT = Tmp0.getValueType();
5953 setValue(&I, DAG.getNode(Opcode, getCurSDLoc(), VT, Tmp0, Tmp1));
5957 void SelectionDAGBuilder::visitCall(const CallInst &I) {
5958 // Handle inline assembly differently.
5959 if (isa<InlineAsm>(I.getCalledValue())) {
5964 MachineModuleInfo &MMI = DAG.getMachineFunction().getMMI();
5965 ComputeUsesVAFloatArgument(I, &MMI);
5967 const char *RenameFn = nullptr;
5968 if (Function *F = I.getCalledFunction()) {
5969 if (F->isDeclaration()) {
5970 if (const TargetIntrinsicInfo *II = TM.getIntrinsicInfo()) {
5971 if (unsigned IID = II->getIntrinsicID(F)) {
5972 RenameFn = visitIntrinsicCall(I, IID);
5977 if (unsigned IID = F->getIntrinsicID()) {
5978 RenameFn = visitIntrinsicCall(I, IID);
5984 // Check for well-known libc/libm calls. If the function is internal, it
5985 // can't be a library call.
5987 if (!F->hasLocalLinkage() && F->hasName() &&
5988 LibInfo->getLibFunc(F->getName(), Func) &&
5989 LibInfo->hasOptimizedCodeGen(Func)) {
5992 case LibFunc::copysign:
5993 case LibFunc::copysignf:
5994 case LibFunc::copysignl:
5995 if (I.getNumArgOperands() == 2 && // Basic sanity checks.
5996 I.getArgOperand(0)->getType()->isFloatingPointTy() &&
5997 I.getType() == I.getArgOperand(0)->getType() &&
5998 I.getType() == I.getArgOperand(1)->getType() &&
5999 I.onlyReadsMemory()) {
6000 SDValue LHS = getValue(I.getArgOperand(0));
6001 SDValue RHS = getValue(I.getArgOperand(1));
6002 setValue(&I, DAG.getNode(ISD::FCOPYSIGN, getCurSDLoc(),
6003 LHS.getValueType(), LHS, RHS));
6008 case LibFunc::fabsf:
6009 case LibFunc::fabsl:
6010 if (visitUnaryFloatCall(I, ISD::FABS))
6014 case LibFunc::fminf:
6015 case LibFunc::fminl:
6016 if (visitBinaryFloatCall(I, ISD::FMINNUM))
6020 case LibFunc::fmaxf:
6021 case LibFunc::fmaxl:
6022 if (visitBinaryFloatCall(I, ISD::FMAXNUM))
6028 if (visitUnaryFloatCall(I, ISD::FSIN))
6034 if (visitUnaryFloatCall(I, ISD::FCOS))
6038 case LibFunc::sqrtf:
6039 case LibFunc::sqrtl:
6040 case LibFunc::sqrt_finite:
6041 case LibFunc::sqrtf_finite:
6042 case LibFunc::sqrtl_finite:
6043 if (visitUnaryFloatCall(I, ISD::FSQRT))
6046 case LibFunc::floor:
6047 case LibFunc::floorf:
6048 case LibFunc::floorl:
6049 if (visitUnaryFloatCall(I, ISD::FFLOOR))
6052 case LibFunc::nearbyint:
6053 case LibFunc::nearbyintf:
6054 case LibFunc::nearbyintl:
6055 if (visitUnaryFloatCall(I, ISD::FNEARBYINT))
6059 case LibFunc::ceilf:
6060 case LibFunc::ceill:
6061 if (visitUnaryFloatCall(I, ISD::FCEIL))
6065 case LibFunc::rintf:
6066 case LibFunc::rintl:
6067 if (visitUnaryFloatCall(I, ISD::FRINT))
6070 case LibFunc::round:
6071 case LibFunc::roundf:
6072 case LibFunc::roundl:
6073 if (visitUnaryFloatCall(I, ISD::FROUND))
6076 case LibFunc::trunc:
6077 case LibFunc::truncf:
6078 case LibFunc::truncl:
6079 if (visitUnaryFloatCall(I, ISD::FTRUNC))
6083 case LibFunc::log2f:
6084 case LibFunc::log2l:
6085 if (visitUnaryFloatCall(I, ISD::FLOG2))
6089 case LibFunc::exp2f:
6090 case LibFunc::exp2l:
6091 if (visitUnaryFloatCall(I, ISD::FEXP2))
6094 case LibFunc::memcmp:
6095 if (visitMemCmpCall(I))
6098 case LibFunc::memchr:
6099 if (visitMemChrCall(I))
6102 case LibFunc::strcpy:
6103 if (visitStrCpyCall(I, false))
6106 case LibFunc::stpcpy:
6107 if (visitStrCpyCall(I, true))
6110 case LibFunc::strcmp:
6111 if (visitStrCmpCall(I))
6114 case LibFunc::strlen:
6115 if (visitStrLenCall(I))
6118 case LibFunc::strnlen:
6119 if (visitStrNLenCall(I))
6128 Callee = getValue(I.getCalledValue());
6130 Callee = DAG.getExternalSymbol(RenameFn,
6131 DAG.getTargetLoweringInfo().getPointerTy());
6133 // Check if we can potentially perform a tail call. More detailed checking is
6134 // be done within LowerCallTo, after more information about the call is known.
6135 LowerCallTo(&I, Callee, I.isTailCall());
6140 /// AsmOperandInfo - This contains information for each constraint that we are
6142 class SDISelAsmOperandInfo : public TargetLowering::AsmOperandInfo {
6144 /// CallOperand - If this is the result output operand or a clobber
6145 /// this is null, otherwise it is the incoming operand to the CallInst.
6146 /// This gets modified as the asm is processed.
6147 SDValue CallOperand;
6149 /// AssignedRegs - If this is a register or register class operand, this
6150 /// contains the set of register corresponding to the operand.
6151 RegsForValue AssignedRegs;
6153 explicit SDISelAsmOperandInfo(const TargetLowering::AsmOperandInfo &info)
6154 : TargetLowering::AsmOperandInfo(info), CallOperand(nullptr,0) {
6157 /// getCallOperandValEVT - Return the EVT of the Value* that this operand
6158 /// corresponds to. If there is no Value* for this operand, it returns
6160 EVT getCallOperandValEVT(LLVMContext &Context,
6161 const TargetLowering &TLI,
6162 const DataLayout *DL) const {
6163 if (!CallOperandVal) return MVT::Other;
6165 if (isa<BasicBlock>(CallOperandVal))
6166 return TLI.getPointerTy();
6168 llvm::Type *OpTy = CallOperandVal->getType();
6170 // FIXME: code duplicated from TargetLowering::ParseConstraints().
6171 // If this is an indirect operand, the operand is a pointer to the
6174 llvm::PointerType *PtrTy = dyn_cast<PointerType>(OpTy);
6176 report_fatal_error("Indirect operand for inline asm not a pointer!");
6177 OpTy = PtrTy->getElementType();
6180 // Look for vector wrapped in a struct. e.g. { <16 x i8> }.
6181 if (StructType *STy = dyn_cast<StructType>(OpTy))
6182 if (STy->getNumElements() == 1)
6183 OpTy = STy->getElementType(0);
6185 // If OpTy is not a single value, it may be a struct/union that we
6186 // can tile with integers.
6187 if (!OpTy->isSingleValueType() && OpTy->isSized()) {
6188 unsigned BitSize = DL->getTypeSizeInBits(OpTy);
6197 OpTy = IntegerType::get(Context, BitSize);
6202 return TLI.getValueType(OpTy, true);
6206 typedef SmallVector<SDISelAsmOperandInfo,16> SDISelAsmOperandInfoVector;
6208 } // end anonymous namespace
6210 /// GetRegistersForValue - Assign registers (virtual or physical) for the
6211 /// specified operand. We prefer to assign virtual registers, to allow the
6212 /// register allocator to handle the assignment process. However, if the asm
6213 /// uses features that we can't model on machineinstrs, we have SDISel do the
6214 /// allocation. This produces generally horrible, but correct, code.
6216 /// OpInfo describes the operand.
6218 static void GetRegistersForValue(SelectionDAG &DAG,
6219 const TargetLowering &TLI,
6221 SDISelAsmOperandInfo &OpInfo) {
6222 LLVMContext &Context = *DAG.getContext();
6224 MachineFunction &MF = DAG.getMachineFunction();
6225 SmallVector<unsigned, 4> Regs;
6227 // If this is a constraint for a single physreg, or a constraint for a
6228 // register class, find it.
6229 std::pair<unsigned, const TargetRegisterClass *> PhysReg =
6230 TLI.getRegForInlineAsmConstraint(MF.getSubtarget().getRegisterInfo(),
6231 OpInfo.ConstraintCode,
6232 OpInfo.ConstraintVT);
6234 unsigned NumRegs = 1;
6235 if (OpInfo.ConstraintVT != MVT::Other) {
6236 // If this is a FP input in an integer register (or visa versa) insert a bit
6237 // cast of the input value. More generally, handle any case where the input
6238 // value disagrees with the register class we plan to stick this in.
6239 if (OpInfo.Type == InlineAsm::isInput &&
6240 PhysReg.second && !PhysReg.second->hasType(OpInfo.ConstraintVT)) {
6241 // Try to convert to the first EVT that the reg class contains. If the
6242 // types are identical size, use a bitcast to convert (e.g. two differing
6244 MVT RegVT = *PhysReg.second->vt_begin();
6245 if (RegVT.getSizeInBits() == OpInfo.CallOperand.getValueSizeInBits()) {
6246 OpInfo.CallOperand = DAG.getNode(ISD::BITCAST, DL,
6247 RegVT, OpInfo.CallOperand);
6248 OpInfo.ConstraintVT = RegVT;
6249 } else if (RegVT.isInteger() && OpInfo.ConstraintVT.isFloatingPoint()) {
6250 // If the input is a FP value and we want it in FP registers, do a
6251 // bitcast to the corresponding integer type. This turns an f64 value
6252 // into i64, which can be passed with two i32 values on a 32-bit
6254 RegVT = MVT::getIntegerVT(OpInfo.ConstraintVT.getSizeInBits());
6255 OpInfo.CallOperand = DAG.getNode(ISD::BITCAST, DL,
6256 RegVT, OpInfo.CallOperand);
6257 OpInfo.ConstraintVT = RegVT;
6261 NumRegs = TLI.getNumRegisters(Context, OpInfo.ConstraintVT);
6265 EVT ValueVT = OpInfo.ConstraintVT;
6267 // If this is a constraint for a specific physical register, like {r17},
6269 if (unsigned AssignedReg = PhysReg.first) {
6270 const TargetRegisterClass *RC = PhysReg.second;
6271 if (OpInfo.ConstraintVT == MVT::Other)
6272 ValueVT = *RC->vt_begin();
6274 // Get the actual register value type. This is important, because the user
6275 // may have asked for (e.g.) the AX register in i32 type. We need to
6276 // remember that AX is actually i16 to get the right extension.
6277 RegVT = *RC->vt_begin();
6279 // This is a explicit reference to a physical register.
6280 Regs.push_back(AssignedReg);
6282 // If this is an expanded reference, add the rest of the regs to Regs.
6284 TargetRegisterClass::iterator I = RC->begin();
6285 for (; *I != AssignedReg; ++I)
6286 assert(I != RC->end() && "Didn't find reg!");
6288 // Already added the first reg.
6290 for (; NumRegs; --NumRegs, ++I) {
6291 assert(I != RC->end() && "Ran out of registers to allocate!");
6296 OpInfo.AssignedRegs = RegsForValue(Regs, RegVT, ValueVT);
6300 // Otherwise, if this was a reference to an LLVM register class, create vregs
6301 // for this reference.
6302 if (const TargetRegisterClass *RC = PhysReg.second) {
6303 RegVT = *RC->vt_begin();
6304 if (OpInfo.ConstraintVT == MVT::Other)
6307 // Create the appropriate number of virtual registers.
6308 MachineRegisterInfo &RegInfo = MF.getRegInfo();
6309 for (; NumRegs; --NumRegs)
6310 Regs.push_back(RegInfo.createVirtualRegister(RC));
6312 OpInfo.AssignedRegs = RegsForValue(Regs, RegVT, ValueVT);
6316 // Otherwise, we couldn't allocate enough registers for this.
6319 /// visitInlineAsm - Handle a call to an InlineAsm object.
6321 void SelectionDAGBuilder::visitInlineAsm(ImmutableCallSite CS) {
6322 const InlineAsm *IA = cast<InlineAsm>(CS.getCalledValue());
6324 /// ConstraintOperands - Information about all of the constraints.
6325 SDISelAsmOperandInfoVector ConstraintOperands;
6327 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
6328 TargetLowering::AsmOperandInfoVector TargetConstraints =
6329 TLI.ParseConstraints(DAG.getSubtarget().getRegisterInfo(), CS);
6331 bool hasMemory = false;
6333 unsigned ArgNo = 0; // ArgNo - The argument of the CallInst.
6334 unsigned ResNo = 0; // ResNo - The result number of the next output.
6335 for (unsigned i = 0, e = TargetConstraints.size(); i != e; ++i) {
6336 ConstraintOperands.push_back(SDISelAsmOperandInfo(TargetConstraints[i]));
6337 SDISelAsmOperandInfo &OpInfo = ConstraintOperands.back();
6339 MVT OpVT = MVT::Other;
6341 // Compute the value type for each operand.
6342 switch (OpInfo.Type) {
6343 case InlineAsm::isOutput:
6344 // Indirect outputs just consume an argument.
6345 if (OpInfo.isIndirect) {
6346 OpInfo.CallOperandVal = const_cast<Value *>(CS.getArgument(ArgNo++));
6350 // The return value of the call is this value. As such, there is no
6351 // corresponding argument.
6352 assert(!CS.getType()->isVoidTy() && "Bad inline asm!");
6353 if (StructType *STy = dyn_cast<StructType>(CS.getType())) {
6354 OpVT = TLI.getSimpleValueType(STy->getElementType(ResNo));
6356 assert(ResNo == 0 && "Asm only has one result!");
6357 OpVT = TLI.getSimpleValueType(CS.getType());
6361 case InlineAsm::isInput:
6362 OpInfo.CallOperandVal = const_cast<Value *>(CS.getArgument(ArgNo++));
6364 case InlineAsm::isClobber:
6369 // If this is an input or an indirect output, process the call argument.
6370 // BasicBlocks are labels, currently appearing only in asm's.
6371 if (OpInfo.CallOperandVal) {
6372 if (const BasicBlock *BB = dyn_cast<BasicBlock>(OpInfo.CallOperandVal)) {
6373 OpInfo.CallOperand = DAG.getBasicBlock(FuncInfo.MBBMap[BB]);
6375 OpInfo.CallOperand = getValue(OpInfo.CallOperandVal);
6379 OpInfo.getCallOperandValEVT(*DAG.getContext(), TLI, DL).getSimpleVT();
6382 OpInfo.ConstraintVT = OpVT;
6384 // Indirect operand accesses access memory.
6385 if (OpInfo.isIndirect)
6388 for (unsigned j = 0, ee = OpInfo.Codes.size(); j != ee; ++j) {
6389 TargetLowering::ConstraintType
6390 CType = TLI.getConstraintType(OpInfo.Codes[j]);
6391 if (CType == TargetLowering::C_Memory) {
6399 SDValue Chain, Flag;
6401 // We won't need to flush pending loads if this asm doesn't touch
6402 // memory and is nonvolatile.
6403 if (hasMemory || IA->hasSideEffects())
6406 Chain = DAG.getRoot();
6408 // Second pass over the constraints: compute which constraint option to use
6409 // and assign registers to constraints that want a specific physreg.
6410 for (unsigned i = 0, e = ConstraintOperands.size(); i != e; ++i) {
6411 SDISelAsmOperandInfo &OpInfo = ConstraintOperands[i];
6413 // If this is an output operand with a matching input operand, look up the
6414 // matching input. If their types mismatch, e.g. one is an integer, the
6415 // other is floating point, or their sizes are different, flag it as an
6417 if (OpInfo.hasMatchingInput()) {
6418 SDISelAsmOperandInfo &Input = ConstraintOperands[OpInfo.MatchingInput];
6420 if (OpInfo.ConstraintVT != Input.ConstraintVT) {
6421 const TargetRegisterInfo *TRI = DAG.getSubtarget().getRegisterInfo();
6422 std::pair<unsigned, const TargetRegisterClass *> MatchRC =
6423 TLI.getRegForInlineAsmConstraint(TRI, OpInfo.ConstraintCode,
6424 OpInfo.ConstraintVT);
6425 std::pair<unsigned, const TargetRegisterClass *> InputRC =
6426 TLI.getRegForInlineAsmConstraint(TRI, Input.ConstraintCode,
6427 Input.ConstraintVT);
6428 if ((OpInfo.ConstraintVT.isInteger() !=
6429 Input.ConstraintVT.isInteger()) ||
6430 (MatchRC.second != InputRC.second)) {
6431 report_fatal_error("Unsupported asm: input constraint"
6432 " with a matching output constraint of"
6433 " incompatible type!");
6435 Input.ConstraintVT = OpInfo.ConstraintVT;
6439 // Compute the constraint code and ConstraintType to use.
6440 TLI.ComputeConstraintToUse(OpInfo, OpInfo.CallOperand, &DAG);
6442 if (OpInfo.ConstraintType == TargetLowering::C_Memory &&
6443 OpInfo.Type == InlineAsm::isClobber)
6446 // If this is a memory input, and if the operand is not indirect, do what we
6447 // need to to provide an address for the memory input.
6448 if (OpInfo.ConstraintType == TargetLowering::C_Memory &&
6449 !OpInfo.isIndirect) {
6450 assert((OpInfo.isMultipleAlternative ||
6451 (OpInfo.Type == InlineAsm::isInput)) &&
6452 "Can only indirectify direct input operands!");
6454 // Memory operands really want the address of the value. If we don't have
6455 // an indirect input, put it in the constpool if we can, otherwise spill
6456 // it to a stack slot.
6457 // TODO: This isn't quite right. We need to handle these according to
6458 // the addressing mode that the constraint wants. Also, this may take
6459 // an additional register for the computation and we don't want that
6462 // If the operand is a float, integer, or vector constant, spill to a
6463 // constant pool entry to get its address.
6464 const Value *OpVal = OpInfo.CallOperandVal;
6465 if (isa<ConstantFP>(OpVal) || isa<ConstantInt>(OpVal) ||
6466 isa<ConstantVector>(OpVal) || isa<ConstantDataVector>(OpVal)) {
6467 OpInfo.CallOperand = DAG.getConstantPool(cast<Constant>(OpVal),
6468 TLI.getPointerTy());
6470 // Otherwise, create a stack slot and emit a store to it before the
6472 Type *Ty = OpVal->getType();
6473 uint64_t TySize = TLI.getDataLayout()->getTypeAllocSize(Ty);
6474 unsigned Align = TLI.getDataLayout()->getPrefTypeAlignment(Ty);
6475 MachineFunction &MF = DAG.getMachineFunction();
6476 int SSFI = MF.getFrameInfo()->CreateStackObject(TySize, Align, false);
6477 SDValue StackSlot = DAG.getFrameIndex(SSFI, TLI.getPointerTy());
6478 Chain = DAG.getStore(Chain, getCurSDLoc(),
6479 OpInfo.CallOperand, StackSlot,
6480 MachinePointerInfo::getFixedStack(SSFI),
6482 OpInfo.CallOperand = StackSlot;
6485 // There is no longer a Value* corresponding to this operand.
6486 OpInfo.CallOperandVal = nullptr;
6488 // It is now an indirect operand.
6489 OpInfo.isIndirect = true;
6492 // If this constraint is for a specific register, allocate it before
6494 if (OpInfo.ConstraintType == TargetLowering::C_Register)
6495 GetRegistersForValue(DAG, TLI, getCurSDLoc(), OpInfo);
6498 // Second pass - Loop over all of the operands, assigning virtual or physregs
6499 // to register class operands.
6500 for (unsigned i = 0, e = ConstraintOperands.size(); i != e; ++i) {
6501 SDISelAsmOperandInfo &OpInfo = ConstraintOperands[i];
6503 // C_Register operands have already been allocated, Other/Memory don't need
6505 if (OpInfo.ConstraintType == TargetLowering::C_RegisterClass)
6506 GetRegistersForValue(DAG, TLI, getCurSDLoc(), OpInfo);
6509 // AsmNodeOperands - The operands for the ISD::INLINEASM node.
6510 std::vector<SDValue> AsmNodeOperands;
6511 AsmNodeOperands.push_back(SDValue()); // reserve space for input chain
6512 AsmNodeOperands.push_back(
6513 DAG.getTargetExternalSymbol(IA->getAsmString().c_str(),
6514 TLI.getPointerTy()));
6516 // If we have a !srcloc metadata node associated with it, we want to attach
6517 // this to the ultimately generated inline asm machineinstr. To do this, we
6518 // pass in the third operand as this (potentially null) inline asm MDNode.
6519 const MDNode *SrcLoc = CS.getInstruction()->getMetadata("srcloc");
6520 AsmNodeOperands.push_back(DAG.getMDNode(SrcLoc));
6522 // Remember the HasSideEffect, AlignStack, AsmDialect, MayLoad and MayStore
6523 // bits as operand 3.
6524 unsigned ExtraInfo = 0;
6525 if (IA->hasSideEffects())
6526 ExtraInfo |= InlineAsm::Extra_HasSideEffects;
6527 if (IA->isAlignStack())
6528 ExtraInfo |= InlineAsm::Extra_IsAlignStack;
6529 // Set the asm dialect.
6530 ExtraInfo |= IA->getDialect() * InlineAsm::Extra_AsmDialect;
6532 // Determine if this InlineAsm MayLoad or MayStore based on the constraints.
6533 for (unsigned i = 0, e = TargetConstraints.size(); i != e; ++i) {
6534 TargetLowering::AsmOperandInfo &OpInfo = TargetConstraints[i];
6536 // Compute the constraint code and ConstraintType to use.
6537 TLI.ComputeConstraintToUse(OpInfo, SDValue());
6539 // Ideally, we would only check against memory constraints. However, the
6540 // meaning of an other constraint can be target-specific and we can't easily
6541 // reason about it. Therefore, be conservative and set MayLoad/MayStore
6542 // for other constriants as well.
6543 if (OpInfo.ConstraintType == TargetLowering::C_Memory ||
6544 OpInfo.ConstraintType == TargetLowering::C_Other) {
6545 if (OpInfo.Type == InlineAsm::isInput)
6546 ExtraInfo |= InlineAsm::Extra_MayLoad;
6547 else if (OpInfo.Type == InlineAsm::isOutput)
6548 ExtraInfo |= InlineAsm::Extra_MayStore;
6549 else if (OpInfo.Type == InlineAsm::isClobber)
6550 ExtraInfo |= (InlineAsm::Extra_MayLoad | InlineAsm::Extra_MayStore);
6554 AsmNodeOperands.push_back(DAG.getTargetConstant(ExtraInfo,
6555 TLI.getPointerTy()));
6557 // Loop over all of the inputs, copying the operand values into the
6558 // appropriate registers and processing the output regs.
6559 RegsForValue RetValRegs;
6561 // IndirectStoresToEmit - The set of stores to emit after the inline asm node.
6562 std::vector<std::pair<RegsForValue, Value*> > IndirectStoresToEmit;
6564 for (unsigned i = 0, e = ConstraintOperands.size(); i != e; ++i) {
6565 SDISelAsmOperandInfo &OpInfo = ConstraintOperands[i];
6567 switch (OpInfo.Type) {
6568 case InlineAsm::isOutput: {
6569 if (OpInfo.ConstraintType != TargetLowering::C_RegisterClass &&
6570 OpInfo.ConstraintType != TargetLowering::C_Register) {
6571 // Memory output, or 'other' output (e.g. 'X' constraint).
6572 assert(OpInfo.isIndirect && "Memory output must be indirect operand");
6574 unsigned ConstraintID =
6575 TLI.getInlineAsmMemConstraint(OpInfo.ConstraintCode);
6576 assert(ConstraintID != InlineAsm::Constraint_Unknown &&
6577 "Failed to convert memory constraint code to constraint id.");
6579 // Add information to the INLINEASM node to know about this output.
6580 unsigned OpFlags = InlineAsm::getFlagWord(InlineAsm::Kind_Mem, 1);
6581 OpFlags = InlineAsm::getFlagWordForMem(OpFlags, ConstraintID);
6582 AsmNodeOperands.push_back(DAG.getTargetConstant(OpFlags, MVT::i32));
6583 AsmNodeOperands.push_back(OpInfo.CallOperand);
6587 // Otherwise, this is a register or register class output.
6589 // Copy the output from the appropriate register. Find a register that
6591 if (OpInfo.AssignedRegs.Regs.empty()) {
6592 LLVMContext &Ctx = *DAG.getContext();
6593 Ctx.emitError(CS.getInstruction(),
6594 "couldn't allocate output register for constraint '" +
6595 Twine(OpInfo.ConstraintCode) + "'");
6599 // If this is an indirect operand, store through the pointer after the
6601 if (OpInfo.isIndirect) {
6602 IndirectStoresToEmit.push_back(std::make_pair(OpInfo.AssignedRegs,
6603 OpInfo.CallOperandVal));
6605 // This is the result value of the call.
6606 assert(!CS.getType()->isVoidTy() && "Bad inline asm!");
6607 // Concatenate this output onto the outputs list.
6608 RetValRegs.append(OpInfo.AssignedRegs);
6611 // Add information to the INLINEASM node to know that this register is
6614 .AddInlineAsmOperands(OpInfo.isEarlyClobber
6615 ? InlineAsm::Kind_RegDefEarlyClobber
6616 : InlineAsm::Kind_RegDef,
6617 false, 0, DAG, AsmNodeOperands);
6620 case InlineAsm::isInput: {
6621 SDValue InOperandVal = OpInfo.CallOperand;
6623 if (OpInfo.isMatchingInputConstraint()) { // Matching constraint?
6624 // If this is required to match an output register we have already set,
6625 // just use its register.
6626 unsigned OperandNo = OpInfo.getMatchedOperand();
6628 // Scan until we find the definition we already emitted of this operand.
6629 // When we find it, create a RegsForValue operand.
6630 unsigned CurOp = InlineAsm::Op_FirstOperand;
6631 for (; OperandNo; --OperandNo) {
6632 // Advance to the next operand.
6634 cast<ConstantSDNode>(AsmNodeOperands[CurOp])->getZExtValue();
6635 assert((InlineAsm::isRegDefKind(OpFlag) ||
6636 InlineAsm::isRegDefEarlyClobberKind(OpFlag) ||
6637 InlineAsm::isMemKind(OpFlag)) && "Skipped past definitions?");
6638 CurOp += InlineAsm::getNumOperandRegisters(OpFlag)+1;
6642 cast<ConstantSDNode>(AsmNodeOperands[CurOp])->getZExtValue();
6643 if (InlineAsm::isRegDefKind(OpFlag) ||
6644 InlineAsm::isRegDefEarlyClobberKind(OpFlag)) {
6645 // Add (OpFlag&0xffff)>>3 registers to MatchedRegs.
6646 if (OpInfo.isIndirect) {
6647 // This happens on gcc/testsuite/gcc.dg/pr8788-1.c
6648 LLVMContext &Ctx = *DAG.getContext();
6649 Ctx.emitError(CS.getInstruction(), "inline asm not supported yet:"
6650 " don't know how to handle tied "
6651 "indirect register inputs");
6655 RegsForValue MatchedRegs;
6656 MatchedRegs.ValueVTs.push_back(InOperandVal.getValueType());
6657 MVT RegVT = AsmNodeOperands[CurOp+1].getSimpleValueType();
6658 MatchedRegs.RegVTs.push_back(RegVT);
6659 MachineRegisterInfo &RegInfo = DAG.getMachineFunction().getRegInfo();
6660 for (unsigned i = 0, e = InlineAsm::getNumOperandRegisters(OpFlag);
6662 if (const TargetRegisterClass *RC = TLI.getRegClassFor(RegVT))
6663 MatchedRegs.Regs.push_back(RegInfo.createVirtualRegister(RC));
6665 LLVMContext &Ctx = *DAG.getContext();
6666 Ctx.emitError(CS.getInstruction(),
6667 "inline asm error: This value"
6668 " type register class is not natively supported!");
6672 // Use the produced MatchedRegs object to
6673 MatchedRegs.getCopyToRegs(InOperandVal, DAG, getCurSDLoc(),
6674 Chain, &Flag, CS.getInstruction());
6675 MatchedRegs.AddInlineAsmOperands(InlineAsm::Kind_RegUse,
6676 true, OpInfo.getMatchedOperand(),
6677 DAG, AsmNodeOperands);
6681 assert(InlineAsm::isMemKind(OpFlag) && "Unknown matching constraint!");
6682 assert(InlineAsm::getNumOperandRegisters(OpFlag) == 1 &&
6683 "Unexpected number of operands");
6684 // Add information to the INLINEASM node to know about this input.
6685 // See InlineAsm.h isUseOperandTiedToDef.
6686 OpFlag = InlineAsm::convertMemFlagWordToMatchingFlagWord(OpFlag);
6687 OpFlag = InlineAsm::getFlagWordForMatchingOp(OpFlag,
6688 OpInfo.getMatchedOperand());
6689 AsmNodeOperands.push_back(DAG.getTargetConstant(OpFlag,
6690 TLI.getPointerTy()));
6691 AsmNodeOperands.push_back(AsmNodeOperands[CurOp+1]);
6695 // Treat indirect 'X' constraint as memory.
6696 if (OpInfo.ConstraintType == TargetLowering::C_Other &&
6698 OpInfo.ConstraintType = TargetLowering::C_Memory;
6700 if (OpInfo.ConstraintType == TargetLowering::C_Other) {
6701 std::vector<SDValue> Ops;
6702 TLI.LowerAsmOperandForConstraint(InOperandVal, OpInfo.ConstraintCode,
6705 LLVMContext &Ctx = *DAG.getContext();
6706 Ctx.emitError(CS.getInstruction(),
6707 "invalid operand for inline asm constraint '" +
6708 Twine(OpInfo.ConstraintCode) + "'");
6712 // Add information to the INLINEASM node to know about this input.
6713 unsigned ResOpType =
6714 InlineAsm::getFlagWord(InlineAsm::Kind_Imm, Ops.size());
6715 AsmNodeOperands.push_back(DAG.getTargetConstant(ResOpType,
6716 TLI.getPointerTy()));
6717 AsmNodeOperands.insert(AsmNodeOperands.end(), Ops.begin(), Ops.end());
6721 if (OpInfo.ConstraintType == TargetLowering::C_Memory) {
6722 assert(OpInfo.isIndirect && "Operand must be indirect to be a mem!");
6723 assert(InOperandVal.getValueType() == TLI.getPointerTy() &&
6724 "Memory operands expect pointer values");
6726 unsigned ConstraintID =
6727 TLI.getInlineAsmMemConstraint(OpInfo.ConstraintCode);
6728 assert(ConstraintID != InlineAsm::Constraint_Unknown &&
6729 "Failed to convert memory constraint code to constraint id.");
6731 // Add information to the INLINEASM node to know about this input.
6732 unsigned ResOpType = InlineAsm::getFlagWord(InlineAsm::Kind_Mem, 1);
6733 ResOpType = InlineAsm::getFlagWordForMem(ResOpType, ConstraintID);
6734 AsmNodeOperands.push_back(DAG.getTargetConstant(ResOpType, MVT::i32));
6735 AsmNodeOperands.push_back(InOperandVal);
6739 assert((OpInfo.ConstraintType == TargetLowering::C_RegisterClass ||
6740 OpInfo.ConstraintType == TargetLowering::C_Register) &&
6741 "Unknown constraint type!");
6743 // TODO: Support this.
6744 if (OpInfo.isIndirect) {
6745 LLVMContext &Ctx = *DAG.getContext();
6746 Ctx.emitError(CS.getInstruction(),
6747 "Don't know how to handle indirect register inputs yet "
6748 "for constraint '" +
6749 Twine(OpInfo.ConstraintCode) + "'");
6753 // Copy the input into the appropriate registers.
6754 if (OpInfo.AssignedRegs.Regs.empty()) {
6755 LLVMContext &Ctx = *DAG.getContext();
6756 Ctx.emitError(CS.getInstruction(),
6757 "couldn't allocate input reg for constraint '" +
6758 Twine(OpInfo.ConstraintCode) + "'");
6762 OpInfo.AssignedRegs.getCopyToRegs(InOperandVal, DAG, getCurSDLoc(),
6763 Chain, &Flag, CS.getInstruction());
6765 OpInfo.AssignedRegs.AddInlineAsmOperands(InlineAsm::Kind_RegUse, false, 0,
6766 DAG, AsmNodeOperands);
6769 case InlineAsm::isClobber: {
6770 // Add the clobbered value to the operand list, so that the register
6771 // allocator is aware that the physreg got clobbered.
6772 if (!OpInfo.AssignedRegs.Regs.empty())
6773 OpInfo.AssignedRegs.AddInlineAsmOperands(InlineAsm::Kind_Clobber,
6781 // Finish up input operands. Set the input chain and add the flag last.
6782 AsmNodeOperands[InlineAsm::Op_InputChain] = Chain;
6783 if (Flag.getNode()) AsmNodeOperands.push_back(Flag);
6785 Chain = DAG.getNode(ISD::INLINEASM, getCurSDLoc(),
6786 DAG.getVTList(MVT::Other, MVT::Glue), AsmNodeOperands);
6787 Flag = Chain.getValue(1);
6789 // If this asm returns a register value, copy the result from that register
6790 // and set it as the value of the call.
6791 if (!RetValRegs.Regs.empty()) {
6792 SDValue Val = RetValRegs.getCopyFromRegs(DAG, FuncInfo, getCurSDLoc(),
6793 Chain, &Flag, CS.getInstruction());
6795 // FIXME: Why don't we do this for inline asms with MRVs?
6796 if (CS.getType()->isSingleValueType() && CS.getType()->isSized()) {
6797 EVT ResultType = TLI.getValueType(CS.getType());
6799 // If any of the results of the inline asm is a vector, it may have the
6800 // wrong width/num elts. This can happen for register classes that can
6801 // contain multiple different value types. The preg or vreg allocated may
6802 // not have the same VT as was expected. Convert it to the right type
6803 // with bit_convert.
6804 if (ResultType != Val.getValueType() && Val.getValueType().isVector()) {
6805 Val = DAG.getNode(ISD::BITCAST, getCurSDLoc(),
6808 } else if (ResultType != Val.getValueType() &&
6809 ResultType.isInteger() && Val.getValueType().isInteger()) {
6810 // If a result value was tied to an input value, the computed result may
6811 // have a wider width than the expected result. Extract the relevant
6813 Val = DAG.getNode(ISD::TRUNCATE, getCurSDLoc(), ResultType, Val);
6816 assert(ResultType == Val.getValueType() && "Asm result value mismatch!");
6819 setValue(CS.getInstruction(), Val);
6820 // Don't need to use this as a chain in this case.
6821 if (!IA->hasSideEffects() && !hasMemory && IndirectStoresToEmit.empty())
6825 std::vector<std::pair<SDValue, const Value *> > StoresToEmit;
6827 // Process indirect outputs, first output all of the flagged copies out of
6829 for (unsigned i = 0, e = IndirectStoresToEmit.size(); i != e; ++i) {
6830 RegsForValue &OutRegs = IndirectStoresToEmit[i].first;
6831 const Value *Ptr = IndirectStoresToEmit[i].second;
6832 SDValue OutVal = OutRegs.getCopyFromRegs(DAG, FuncInfo, getCurSDLoc(),
6834 StoresToEmit.push_back(std::make_pair(OutVal, Ptr));
6837 // Emit the non-flagged stores from the physregs.
6838 SmallVector<SDValue, 8> OutChains;
6839 for (unsigned i = 0, e = StoresToEmit.size(); i != e; ++i) {
6840 SDValue Val = DAG.getStore(Chain, getCurSDLoc(),
6841 StoresToEmit[i].first,
6842 getValue(StoresToEmit[i].second),
6843 MachinePointerInfo(StoresToEmit[i].second),
6845 OutChains.push_back(Val);
6848 if (!OutChains.empty())
6849 Chain = DAG.getNode(ISD::TokenFactor, getCurSDLoc(), MVT::Other, OutChains);
6854 void SelectionDAGBuilder::visitVAStart(const CallInst &I) {
6855 DAG.setRoot(DAG.getNode(ISD::VASTART, getCurSDLoc(),
6856 MVT::Other, getRoot(),
6857 getValue(I.getArgOperand(0)),
6858 DAG.getSrcValue(I.getArgOperand(0))));
6861 void SelectionDAGBuilder::visitVAArg(const VAArgInst &I) {
6862 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
6863 const DataLayout &DL = *TLI.getDataLayout();
6864 SDValue V = DAG.getVAArg(TLI.getValueType(I.getType()), getCurSDLoc(),
6865 getRoot(), getValue(I.getOperand(0)),
6866 DAG.getSrcValue(I.getOperand(0)),
6867 DL.getABITypeAlignment(I.getType()));
6869 DAG.setRoot(V.getValue(1));
6872 void SelectionDAGBuilder::visitVAEnd(const CallInst &I) {
6873 DAG.setRoot(DAG.getNode(ISD::VAEND, getCurSDLoc(),
6874 MVT::Other, getRoot(),
6875 getValue(I.getArgOperand(0)),
6876 DAG.getSrcValue(I.getArgOperand(0))));
6879 void SelectionDAGBuilder::visitVACopy(const CallInst &I) {
6880 DAG.setRoot(DAG.getNode(ISD::VACOPY, getCurSDLoc(),
6881 MVT::Other, getRoot(),
6882 getValue(I.getArgOperand(0)),
6883 getValue(I.getArgOperand(1)),
6884 DAG.getSrcValue(I.getArgOperand(0)),
6885 DAG.getSrcValue(I.getArgOperand(1))));
6888 /// \brief Lower an argument list according to the target calling convention.
6890 /// \return A tuple of <return-value, token-chain>
6892 /// This is a helper for lowering intrinsics that follow a target calling
6893 /// convention or require stack pointer adjustment. Only a subset of the
6894 /// intrinsic's operands need to participate in the calling convention.
6895 std::pair<SDValue, SDValue>
6896 SelectionDAGBuilder::lowerCallOperands(ImmutableCallSite CS, unsigned ArgIdx,
6897 unsigned NumArgs, SDValue Callee,
6899 MachineBasicBlock *LandingPad,
6900 bool IsPatchPoint) {
6901 TargetLowering::ArgListTy Args;
6902 Args.reserve(NumArgs);
6904 // Populate the argument list.
6905 // Attributes for args start at offset 1, after the return attribute.
6906 for (unsigned ArgI = ArgIdx, ArgE = ArgIdx + NumArgs, AttrI = ArgIdx + 1;
6907 ArgI != ArgE; ++ArgI) {
6908 const Value *V = CS->getOperand(ArgI);
6910 assert(!V->getType()->isEmptyTy() && "Empty type passed to intrinsic.");
6912 TargetLowering::ArgListEntry Entry;
6913 Entry.Node = getValue(V);
6914 Entry.Ty = V->getType();
6915 Entry.setAttributes(&CS, AttrI);
6916 Args.push_back(Entry);
6919 Type *retTy = UseVoidTy ? Type::getVoidTy(*DAG.getContext()) : CS->getType();
6920 TargetLowering::CallLoweringInfo CLI(DAG);
6921 CLI.setDebugLoc(getCurSDLoc()).setChain(getRoot())
6922 .setCallee(CS.getCallingConv(), retTy, Callee, std::move(Args), NumArgs)
6923 .setDiscardResult(CS->use_empty()).setIsPatchPoint(IsPatchPoint);
6925 return lowerInvokable(CLI, LandingPad);
6928 /// \brief Add a stack map intrinsic call's live variable operands to a stackmap
6929 /// or patchpoint target node's operand list.
6931 /// Constants are converted to TargetConstants purely as an optimization to
6932 /// avoid constant materialization and register allocation.
6934 /// FrameIndex operands are converted to TargetFrameIndex so that ISEL does not
6935 /// generate addess computation nodes, and so ExpandISelPseudo can convert the
6936 /// TargetFrameIndex into a DirectMemRefOp StackMap location. This avoids
6937 /// address materialization and register allocation, but may also be required
6938 /// for correctness. If a StackMap (or PatchPoint) intrinsic directly uses an
6939 /// alloca in the entry block, then the runtime may assume that the alloca's
6940 /// StackMap location can be read immediately after compilation and that the
6941 /// location is valid at any point during execution (this is similar to the
6942 /// assumption made by the llvm.gcroot intrinsic). If the alloca's location were
6943 /// only available in a register, then the runtime would need to trap when
6944 /// execution reaches the StackMap in order to read the alloca's location.
6945 static void addStackMapLiveVars(ImmutableCallSite CS, unsigned StartIdx,
6946 SmallVectorImpl<SDValue> &Ops,
6947 SelectionDAGBuilder &Builder) {
6948 for (unsigned i = StartIdx, e = CS.arg_size(); i != e; ++i) {
6949 SDValue OpVal = Builder.getValue(CS.getArgument(i));
6950 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(OpVal)) {
6952 Builder.DAG.getTargetConstant(StackMaps::ConstantOp, MVT::i64));
6954 Builder.DAG.getTargetConstant(C->getSExtValue(), MVT::i64));
6955 } else if (FrameIndexSDNode *FI = dyn_cast<FrameIndexSDNode>(OpVal)) {
6956 const TargetLowering &TLI = Builder.DAG.getTargetLoweringInfo();
6958 Builder.DAG.getTargetFrameIndex(FI->getIndex(), TLI.getPointerTy()));
6960 Ops.push_back(OpVal);
6964 /// \brief Lower llvm.experimental.stackmap directly to its target opcode.
6965 void SelectionDAGBuilder::visitStackmap(const CallInst &CI) {
6966 // void @llvm.experimental.stackmap(i32 <id>, i32 <numShadowBytes>,
6967 // [live variables...])
6969 assert(CI.getType()->isVoidTy() && "Stackmap cannot return a value.");
6971 SDValue Chain, InFlag, Callee, NullPtr;
6972 SmallVector<SDValue, 32> Ops;
6974 SDLoc DL = getCurSDLoc();
6975 Callee = getValue(CI.getCalledValue());
6976 NullPtr = DAG.getIntPtrConstant(0, true);
6978 // The stackmap intrinsic only records the live variables (the arguemnts
6979 // passed to it) and emits NOPS (if requested). Unlike the patchpoint
6980 // intrinsic, this won't be lowered to a function call. This means we don't
6981 // have to worry about calling conventions and target specific lowering code.
6982 // Instead we perform the call lowering right here.
6984 // chain, flag = CALLSEQ_START(chain, 0)
6985 // chain, flag = STACKMAP(id, nbytes, ..., chain, flag)
6986 // chain, flag = CALLSEQ_END(chain, 0, 0, flag)
6988 Chain = DAG.getCALLSEQ_START(getRoot(), NullPtr, DL);
6989 InFlag = Chain.getValue(1);
6991 // Add the <id> and <numBytes> constants.
6992 SDValue IDVal = getValue(CI.getOperand(PatchPointOpers::IDPos));
6993 Ops.push_back(DAG.getTargetConstant(
6994 cast<ConstantSDNode>(IDVal)->getZExtValue(), MVT::i64));
6995 SDValue NBytesVal = getValue(CI.getOperand(PatchPointOpers::NBytesPos));
6996 Ops.push_back(DAG.getTargetConstant(
6997 cast<ConstantSDNode>(NBytesVal)->getZExtValue(), MVT::i32));
6999 // Push live variables for the stack map.
7000 addStackMapLiveVars(&CI, 2, Ops, *this);
7002 // We are not pushing any register mask info here on the operands list,
7003 // because the stackmap doesn't clobber anything.
7005 // Push the chain and the glue flag.
7006 Ops.push_back(Chain);
7007 Ops.push_back(InFlag);
7009 // Create the STACKMAP node.
7010 SDVTList NodeTys = DAG.getVTList(MVT::Other, MVT::Glue);
7011 SDNode *SM = DAG.getMachineNode(TargetOpcode::STACKMAP, DL, NodeTys, Ops);
7012 Chain = SDValue(SM, 0);
7013 InFlag = Chain.getValue(1);
7015 Chain = DAG.getCALLSEQ_END(Chain, NullPtr, NullPtr, InFlag, DL);
7017 // Stackmaps don't generate values, so nothing goes into the NodeMap.
7019 // Set the root to the target-lowered call chain.
7022 // Inform the Frame Information that we have a stackmap in this function.
7023 FuncInfo.MF->getFrameInfo()->setHasStackMap();
7026 /// \brief Lower llvm.experimental.patchpoint directly to its target opcode.
7027 void SelectionDAGBuilder::visitPatchpoint(ImmutableCallSite CS,
7028 MachineBasicBlock *LandingPad) {
7029 // void|i64 @llvm.experimental.patchpoint.void|i64(i64 <id>,
7034 // [live variables...])
7036 CallingConv::ID CC = CS.getCallingConv();
7037 bool IsAnyRegCC = CC == CallingConv::AnyReg;
7038 bool HasDef = !CS->getType()->isVoidTy();
7039 SDValue Callee = getValue(CS->getOperand(2)); // <target>
7041 // Get the real number of arguments participating in the call <numArgs>
7042 SDValue NArgVal = getValue(CS.getArgument(PatchPointOpers::NArgPos));
7043 unsigned NumArgs = cast<ConstantSDNode>(NArgVal)->getZExtValue();
7045 // Skip the four meta args: <id>, <numNopBytes>, <target>, <numArgs>
7046 // Intrinsics include all meta-operands up to but not including CC.
7047 unsigned NumMetaOpers = PatchPointOpers::CCPos;
7048 assert(CS.arg_size() >= NumMetaOpers + NumArgs &&
7049 "Not enough arguments provided to the patchpoint intrinsic");
7051 // For AnyRegCC the arguments are lowered later on manually.
7052 unsigned NumCallArgs = IsAnyRegCC ? 0 : NumArgs;
7053 std::pair<SDValue, SDValue> Result =
7054 lowerCallOperands(CS, NumMetaOpers, NumCallArgs, Callee, IsAnyRegCC,
7057 SDNode *CallEnd = Result.second.getNode();
7058 if (HasDef && (CallEnd->getOpcode() == ISD::CopyFromReg))
7059 CallEnd = CallEnd->getOperand(0).getNode();
7061 /// Get a call instruction from the call sequence chain.
7062 /// Tail calls are not allowed.
7063 assert(CallEnd->getOpcode() == ISD::CALLSEQ_END &&
7064 "Expected a callseq node.");
7065 SDNode *Call = CallEnd->getOperand(0).getNode();
7066 bool HasGlue = Call->getGluedNode();
7068 // Replace the target specific call node with the patchable intrinsic.
7069 SmallVector<SDValue, 8> Ops;
7071 // Add the <id> and <numBytes> constants.
7072 SDValue IDVal = getValue(CS->getOperand(PatchPointOpers::IDPos));
7073 Ops.push_back(DAG.getTargetConstant(
7074 cast<ConstantSDNode>(IDVal)->getZExtValue(), MVT::i64));
7075 SDValue NBytesVal = getValue(CS->getOperand(PatchPointOpers::NBytesPos));
7076 Ops.push_back(DAG.getTargetConstant(
7077 cast<ConstantSDNode>(NBytesVal)->getZExtValue(), MVT::i32));
7079 // Assume that the Callee is a constant address.
7080 // FIXME: handle function symbols in the future.
7082 DAG.getIntPtrConstant(cast<ConstantSDNode>(Callee)->getZExtValue(),
7083 /*isTarget=*/true));
7085 // Adjust <numArgs> to account for any arguments that have been passed on the
7087 // Call Node: Chain, Target, {Args}, RegMask, [Glue]
7088 unsigned NumCallRegArgs = Call->getNumOperands() - (HasGlue ? 4 : 3);
7089 NumCallRegArgs = IsAnyRegCC ? NumArgs : NumCallRegArgs;
7090 Ops.push_back(DAG.getTargetConstant(NumCallRegArgs, MVT::i32));
7092 // Add the calling convention
7093 Ops.push_back(DAG.getTargetConstant((unsigned)CC, MVT::i32));
7095 // Add the arguments we omitted previously. The register allocator should
7096 // place these in any free register.
7098 for (unsigned i = NumMetaOpers, e = NumMetaOpers + NumArgs; i != e; ++i)
7099 Ops.push_back(getValue(CS.getArgument(i)));
7101 // Push the arguments from the call instruction up to the register mask.
7102 SDNode::op_iterator e = HasGlue ? Call->op_end()-2 : Call->op_end()-1;
7103 Ops.append(Call->op_begin() + 2, e);
7105 // Push live variables for the stack map.
7106 addStackMapLiveVars(CS, NumMetaOpers + NumArgs, Ops, *this);
7108 // Push the register mask info.
7110 Ops.push_back(*(Call->op_end()-2));
7112 Ops.push_back(*(Call->op_end()-1));
7114 // Push the chain (this is originally the first operand of the call, but
7115 // becomes now the last or second to last operand).
7116 Ops.push_back(*(Call->op_begin()));
7118 // Push the glue flag (last operand).
7120 Ops.push_back(*(Call->op_end()-1));
7123 if (IsAnyRegCC && HasDef) {
7124 // Create the return types based on the intrinsic definition
7125 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
7126 SmallVector<EVT, 3> ValueVTs;
7127 ComputeValueVTs(TLI, CS->getType(), ValueVTs);
7128 assert(ValueVTs.size() == 1 && "Expected only one return value type.");
7130 // There is always a chain and a glue type at the end
7131 ValueVTs.push_back(MVT::Other);
7132 ValueVTs.push_back(MVT::Glue);
7133 NodeTys = DAG.getVTList(ValueVTs);
7135 NodeTys = DAG.getVTList(MVT::Other, MVT::Glue);
7137 // Replace the target specific call node with a PATCHPOINT node.
7138 MachineSDNode *MN = DAG.getMachineNode(TargetOpcode::PATCHPOINT,
7139 getCurSDLoc(), NodeTys, Ops);
7141 // Update the NodeMap.
7144 setValue(CS.getInstruction(), SDValue(MN, 0));
7146 setValue(CS.getInstruction(), Result.first);
7149 // Fixup the consumers of the intrinsic. The chain and glue may be used in the
7150 // call sequence. Furthermore the location of the chain and glue can change
7151 // when the AnyReg calling convention is used and the intrinsic returns a
7153 if (IsAnyRegCC && HasDef) {
7154 SDValue From[] = {SDValue(Call, 0), SDValue(Call, 1)};
7155 SDValue To[] = {SDValue(MN, 1), SDValue(MN, 2)};
7156 DAG.ReplaceAllUsesOfValuesWith(From, To, 2);
7158 DAG.ReplaceAllUsesWith(Call, MN);
7159 DAG.DeleteNode(Call);
7161 // Inform the Frame Information that we have a patchpoint in this function.
7162 FuncInfo.MF->getFrameInfo()->setHasPatchPoint();
7165 /// Returns an AttributeSet representing the attributes applied to the return
7166 /// value of the given call.
7167 static AttributeSet getReturnAttrs(TargetLowering::CallLoweringInfo &CLI) {
7168 SmallVector<Attribute::AttrKind, 2> Attrs;
7170 Attrs.push_back(Attribute::SExt);
7172 Attrs.push_back(Attribute::ZExt);
7174 Attrs.push_back(Attribute::InReg);
7176 return AttributeSet::get(CLI.RetTy->getContext(), AttributeSet::ReturnIndex,
7180 /// TargetLowering::LowerCallTo - This is the default LowerCallTo
7181 /// implementation, which just calls LowerCall.
7182 /// FIXME: When all targets are
7183 /// migrated to using LowerCall, this hook should be integrated into SDISel.
7184 std::pair<SDValue, SDValue>
7185 TargetLowering::LowerCallTo(TargetLowering::CallLoweringInfo &CLI) const {
7186 // Handle the incoming return values from the call.
7188 Type *OrigRetTy = CLI.RetTy;
7189 SmallVector<EVT, 4> RetTys;
7190 SmallVector<uint64_t, 4> Offsets;
7191 ComputeValueVTs(*this, CLI.RetTy, RetTys, &Offsets);
7193 SmallVector<ISD::OutputArg, 4> Outs;
7194 GetReturnInfo(CLI.RetTy, getReturnAttrs(CLI), Outs, *this);
7196 bool CanLowerReturn =
7197 this->CanLowerReturn(CLI.CallConv, CLI.DAG.getMachineFunction(),
7198 CLI.IsVarArg, Outs, CLI.RetTy->getContext());
7200 SDValue DemoteStackSlot;
7201 int DemoteStackIdx = -100;
7202 if (!CanLowerReturn) {
7203 // FIXME: equivalent assert?
7204 // assert(!CS.hasInAllocaArgument() &&
7205 // "sret demotion is incompatible with inalloca");
7206 uint64_t TySize = getDataLayout()->getTypeAllocSize(CLI.RetTy);
7207 unsigned Align = getDataLayout()->getPrefTypeAlignment(CLI.RetTy);
7208 MachineFunction &MF = CLI.DAG.getMachineFunction();
7209 DemoteStackIdx = MF.getFrameInfo()->CreateStackObject(TySize, Align, false);
7210 Type *StackSlotPtrType = PointerType::getUnqual(CLI.RetTy);
7212 DemoteStackSlot = CLI.DAG.getFrameIndex(DemoteStackIdx, getPointerTy());
7214 Entry.Node = DemoteStackSlot;
7215 Entry.Ty = StackSlotPtrType;
7216 Entry.isSExt = false;
7217 Entry.isZExt = false;
7218 Entry.isInReg = false;
7219 Entry.isSRet = true;
7220 Entry.isNest = false;
7221 Entry.isByVal = false;
7222 Entry.isReturned = false;
7223 Entry.Alignment = Align;
7224 CLI.getArgs().insert(CLI.getArgs().begin(), Entry);
7225 CLI.RetTy = Type::getVoidTy(CLI.RetTy->getContext());
7227 for (unsigned I = 0, E = RetTys.size(); I != E; ++I) {
7229 MVT RegisterVT = getRegisterType(CLI.RetTy->getContext(), VT);
7230 unsigned NumRegs = getNumRegisters(CLI.RetTy->getContext(), VT);
7231 for (unsigned i = 0; i != NumRegs; ++i) {
7232 ISD::InputArg MyFlags;
7233 MyFlags.VT = RegisterVT;
7235 MyFlags.Used = CLI.IsReturnValueUsed;
7237 MyFlags.Flags.setSExt();
7239 MyFlags.Flags.setZExt();
7241 MyFlags.Flags.setInReg();
7242 CLI.Ins.push_back(MyFlags);
7247 // Handle all of the outgoing arguments.
7249 CLI.OutVals.clear();
7250 ArgListTy &Args = CLI.getArgs();
7251 for (unsigned i = 0, e = Args.size(); i != e; ++i) {
7252 SmallVector<EVT, 4> ValueVTs;
7253 ComputeValueVTs(*this, Args[i].Ty, ValueVTs);
7254 Type *FinalType = Args[i].Ty;
7255 if (Args[i].isByVal)
7256 FinalType = cast<PointerType>(Args[i].Ty)->getElementType();
7257 bool NeedsRegBlock = functionArgumentNeedsConsecutiveRegisters(
7258 FinalType, CLI.CallConv, CLI.IsVarArg);
7259 for (unsigned Value = 0, NumValues = ValueVTs.size(); Value != NumValues;
7261 EVT VT = ValueVTs[Value];
7262 Type *ArgTy = VT.getTypeForEVT(CLI.RetTy->getContext());
7263 SDValue Op = SDValue(Args[i].Node.getNode(),
7264 Args[i].Node.getResNo() + Value);
7265 ISD::ArgFlagsTy Flags;
7266 unsigned OriginalAlignment = getDataLayout()->getABITypeAlignment(ArgTy);
7272 if (Args[i].isInReg)
7276 if (Args[i].isByVal)
7278 if (Args[i].isInAlloca) {
7279 Flags.setInAlloca();
7280 // Set the byval flag for CCAssignFn callbacks that don't know about
7281 // inalloca. This way we can know how many bytes we should've allocated
7282 // and how many bytes a callee cleanup function will pop. If we port
7283 // inalloca to more targets, we'll have to add custom inalloca handling
7284 // in the various CC lowering callbacks.
7287 if (Args[i].isByVal || Args[i].isInAlloca) {
7288 PointerType *Ty = cast<PointerType>(Args[i].Ty);
7289 Type *ElementTy = Ty->getElementType();
7290 Flags.setByValSize(getDataLayout()->getTypeAllocSize(ElementTy));
7291 // For ByVal, alignment should come from FE. BE will guess if this
7292 // info is not there but there are cases it cannot get right.
7293 unsigned FrameAlign;
7294 if (Args[i].Alignment)
7295 FrameAlign = Args[i].Alignment;
7297 FrameAlign = getByValTypeAlignment(ElementTy);
7298 Flags.setByValAlign(FrameAlign);
7303 Flags.setInConsecutiveRegs();
7304 Flags.setOrigAlign(OriginalAlignment);
7306 MVT PartVT = getRegisterType(CLI.RetTy->getContext(), VT);
7307 unsigned NumParts = getNumRegisters(CLI.RetTy->getContext(), VT);
7308 SmallVector<SDValue, 4> Parts(NumParts);
7309 ISD::NodeType ExtendKind = ISD::ANY_EXTEND;
7312 ExtendKind = ISD::SIGN_EXTEND;
7313 else if (Args[i].isZExt)
7314 ExtendKind = ISD::ZERO_EXTEND;
7316 // Conservatively only handle 'returned' on non-vectors for now
7317 if (Args[i].isReturned && !Op.getValueType().isVector()) {
7318 assert(CLI.RetTy == Args[i].Ty && RetTys.size() == NumValues &&
7319 "unexpected use of 'returned'");
7320 // Before passing 'returned' to the target lowering code, ensure that
7321 // either the register MVT and the actual EVT are the same size or that
7322 // the return value and argument are extended in the same way; in these
7323 // cases it's safe to pass the argument register value unchanged as the
7324 // return register value (although it's at the target's option whether
7326 // TODO: allow code generation to take advantage of partially preserved
7327 // registers rather than clobbering the entire register when the
7328 // parameter extension method is not compatible with the return
7330 if ((NumParts * PartVT.getSizeInBits() == VT.getSizeInBits()) ||
7331 (ExtendKind != ISD::ANY_EXTEND &&
7332 CLI.RetSExt == Args[i].isSExt && CLI.RetZExt == Args[i].isZExt))
7333 Flags.setReturned();
7336 getCopyToParts(CLI.DAG, CLI.DL, Op, &Parts[0], NumParts, PartVT,
7337 CLI.CS ? CLI.CS->getInstruction() : nullptr, ExtendKind);
7339 for (unsigned j = 0; j != NumParts; ++j) {
7340 // if it isn't first piece, alignment must be 1
7341 ISD::OutputArg MyFlags(Flags, Parts[j].getValueType(), VT,
7342 i < CLI.NumFixedArgs,
7343 i, j*Parts[j].getValueType().getStoreSize());
7344 if (NumParts > 1 && j == 0)
7345 MyFlags.Flags.setSplit();
7347 MyFlags.Flags.setOrigAlign(1);
7349 CLI.Outs.push_back(MyFlags);
7350 CLI.OutVals.push_back(Parts[j]);
7353 if (NeedsRegBlock && Value == NumValues - 1)
7354 CLI.Outs[CLI.Outs.size() - 1].Flags.setInConsecutiveRegsLast();
7358 SmallVector<SDValue, 4> InVals;
7359 CLI.Chain = LowerCall(CLI, InVals);
7361 // Verify that the target's LowerCall behaved as expected.
7362 assert(CLI.Chain.getNode() && CLI.Chain.getValueType() == MVT::Other &&
7363 "LowerCall didn't return a valid chain!");
7364 assert((!CLI.IsTailCall || InVals.empty()) &&
7365 "LowerCall emitted a return value for a tail call!");
7366 assert((CLI.IsTailCall || InVals.size() == CLI.Ins.size()) &&
7367 "LowerCall didn't emit the correct number of values!");
7369 // For a tail call, the return value is merely live-out and there aren't
7370 // any nodes in the DAG representing it. Return a special value to
7371 // indicate that a tail call has been emitted and no more Instructions
7372 // should be processed in the current block.
7373 if (CLI.IsTailCall) {
7374 CLI.DAG.setRoot(CLI.Chain);
7375 return std::make_pair(SDValue(), SDValue());
7378 DEBUG(for (unsigned i = 0, e = CLI.Ins.size(); i != e; ++i) {
7379 assert(InVals[i].getNode() &&
7380 "LowerCall emitted a null value!");
7381 assert(EVT(CLI.Ins[i].VT) == InVals[i].getValueType() &&
7382 "LowerCall emitted a value with the wrong type!");
7385 SmallVector<SDValue, 4> ReturnValues;
7386 if (!CanLowerReturn) {
7387 // The instruction result is the result of loading from the
7388 // hidden sret parameter.
7389 SmallVector<EVT, 1> PVTs;
7390 Type *PtrRetTy = PointerType::getUnqual(OrigRetTy);
7392 ComputeValueVTs(*this, PtrRetTy, PVTs);
7393 assert(PVTs.size() == 1 && "Pointers should fit in one register");
7394 EVT PtrVT = PVTs[0];
7396 unsigned NumValues = RetTys.size();
7397 ReturnValues.resize(NumValues);
7398 SmallVector<SDValue, 4> Chains(NumValues);
7400 for (unsigned i = 0; i < NumValues; ++i) {
7401 SDValue Add = CLI.DAG.getNode(ISD::ADD, CLI.DL, PtrVT, DemoteStackSlot,
7402 CLI.DAG.getConstant(Offsets[i], PtrVT));
7403 SDValue L = CLI.DAG.getLoad(
7404 RetTys[i], CLI.DL, CLI.Chain, Add,
7405 MachinePointerInfo::getFixedStack(DemoteStackIdx, Offsets[i]), false,
7407 ReturnValues[i] = L;
7408 Chains[i] = L.getValue(1);
7411 CLI.Chain = CLI.DAG.getNode(ISD::TokenFactor, CLI.DL, MVT::Other, Chains);
7413 // Collect the legal value parts into potentially illegal values
7414 // that correspond to the original function's return values.
7415 ISD::NodeType AssertOp = ISD::DELETED_NODE;
7417 AssertOp = ISD::AssertSext;
7418 else if (CLI.RetZExt)
7419 AssertOp = ISD::AssertZext;
7420 unsigned CurReg = 0;
7421 for (unsigned I = 0, E = RetTys.size(); I != E; ++I) {
7423 MVT RegisterVT = getRegisterType(CLI.RetTy->getContext(), VT);
7424 unsigned NumRegs = getNumRegisters(CLI.RetTy->getContext(), VT);
7426 ReturnValues.push_back(getCopyFromParts(CLI.DAG, CLI.DL, &InVals[CurReg],
7427 NumRegs, RegisterVT, VT, nullptr,
7432 // For a function returning void, there is no return value. We can't create
7433 // such a node, so we just return a null return value in that case. In
7434 // that case, nothing will actually look at the value.
7435 if (ReturnValues.empty())
7436 return std::make_pair(SDValue(), CLI.Chain);
7439 SDValue Res = CLI.DAG.getNode(ISD::MERGE_VALUES, CLI.DL,
7440 CLI.DAG.getVTList(RetTys), ReturnValues);
7441 return std::make_pair(Res, CLI.Chain);
7444 void TargetLowering::LowerOperationWrapper(SDNode *N,
7445 SmallVectorImpl<SDValue> &Results,
7446 SelectionDAG &DAG) const {
7447 SDValue Res = LowerOperation(SDValue(N, 0), DAG);
7449 Results.push_back(Res);
7452 SDValue TargetLowering::LowerOperation(SDValue Op, SelectionDAG &DAG) const {
7453 llvm_unreachable("LowerOperation not implemented for this target!");
7457 SelectionDAGBuilder::CopyValueToVirtualRegister(const Value *V, unsigned Reg) {
7458 SDValue Op = getNonRegisterValue(V);
7459 assert((Op.getOpcode() != ISD::CopyFromReg ||
7460 cast<RegisterSDNode>(Op.getOperand(1))->getReg() != Reg) &&
7461 "Copy from a reg to the same reg!");
7462 assert(!TargetRegisterInfo::isPhysicalRegister(Reg) && "Is a physreg");
7464 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
7465 RegsForValue RFV(V->getContext(), TLI, Reg, V->getType());
7466 SDValue Chain = DAG.getEntryNode();
7468 ISD::NodeType ExtendType = (FuncInfo.PreferredExtendType.find(V) ==
7469 FuncInfo.PreferredExtendType.end())
7471 : FuncInfo.PreferredExtendType[V];
7472 RFV.getCopyToRegs(Op, DAG, getCurSDLoc(), Chain, nullptr, V, ExtendType);
7473 PendingExports.push_back(Chain);
7476 #include "llvm/CodeGen/SelectionDAGISel.h"
7478 /// isOnlyUsedInEntryBlock - If the specified argument is only used in the
7479 /// entry block, return true. This includes arguments used by switches, since
7480 /// the switch may expand into multiple basic blocks.
7481 static bool isOnlyUsedInEntryBlock(const Argument *A, bool FastISel) {
7482 // With FastISel active, we may be splitting blocks, so force creation
7483 // of virtual registers for all non-dead arguments.
7485 return A->use_empty();
7487 const BasicBlock *Entry = A->getParent()->begin();
7488 for (const User *U : A->users())
7489 if (cast<Instruction>(U)->getParent() != Entry || isa<SwitchInst>(U))
7490 return false; // Use not in entry block.
7495 void SelectionDAGISel::LowerArguments(const Function &F) {
7496 SelectionDAG &DAG = SDB->DAG;
7497 SDLoc dl = SDB->getCurSDLoc();
7498 const DataLayout *DL = TLI->getDataLayout();
7499 SmallVector<ISD::InputArg, 16> Ins;
7501 if (!FuncInfo->CanLowerReturn) {
7502 // Put in an sret pointer parameter before all the other parameters.
7503 SmallVector<EVT, 1> ValueVTs;
7504 ComputeValueVTs(*TLI, PointerType::getUnqual(F.getReturnType()), ValueVTs);
7506 // NOTE: Assuming that a pointer will never break down to more than one VT
7508 ISD::ArgFlagsTy Flags;
7510 MVT RegisterVT = TLI->getRegisterType(*DAG.getContext(), ValueVTs[0]);
7511 ISD::InputArg RetArg(Flags, RegisterVT, ValueVTs[0], true,
7512 ISD::InputArg::NoArgIndex, 0);
7513 Ins.push_back(RetArg);
7516 // Set up the incoming argument description vector.
7518 for (Function::const_arg_iterator I = F.arg_begin(), E = F.arg_end();
7519 I != E; ++I, ++Idx) {
7520 SmallVector<EVT, 4> ValueVTs;
7521 ComputeValueVTs(*TLI, I->getType(), ValueVTs);
7522 bool isArgValueUsed = !I->use_empty();
7523 unsigned PartBase = 0;
7524 Type *FinalType = I->getType();
7525 if (F.getAttributes().hasAttribute(Idx, Attribute::ByVal))
7526 FinalType = cast<PointerType>(FinalType)->getElementType();
7527 bool NeedsRegBlock = TLI->functionArgumentNeedsConsecutiveRegisters(
7528 FinalType, F.getCallingConv(), F.isVarArg());
7529 for (unsigned Value = 0, NumValues = ValueVTs.size();
7530 Value != NumValues; ++Value) {
7531 EVT VT = ValueVTs[Value];
7532 Type *ArgTy = VT.getTypeForEVT(*DAG.getContext());
7533 ISD::ArgFlagsTy Flags;
7534 unsigned OriginalAlignment = DL->getABITypeAlignment(ArgTy);
7536 if (F.getAttributes().hasAttribute(Idx, Attribute::ZExt))
7538 if (F.getAttributes().hasAttribute(Idx, Attribute::SExt))
7540 if (F.getAttributes().hasAttribute(Idx, Attribute::InReg))
7542 if (F.getAttributes().hasAttribute(Idx, Attribute::StructRet))
7544 if (F.getAttributes().hasAttribute(Idx, Attribute::ByVal))
7546 if (F.getAttributes().hasAttribute(Idx, Attribute::InAlloca)) {
7547 Flags.setInAlloca();
7548 // Set the byval flag for CCAssignFn callbacks that don't know about
7549 // inalloca. This way we can know how many bytes we should've allocated
7550 // and how many bytes a callee cleanup function will pop. If we port
7551 // inalloca to more targets, we'll have to add custom inalloca handling
7552 // in the various CC lowering callbacks.
7555 if (Flags.isByVal() || Flags.isInAlloca()) {
7556 PointerType *Ty = cast<PointerType>(I->getType());
7557 Type *ElementTy = Ty->getElementType();
7558 Flags.setByValSize(DL->getTypeAllocSize(ElementTy));
7559 // For ByVal, alignment should be passed from FE. BE will guess if
7560 // this info is not there but there are cases it cannot get right.
7561 unsigned FrameAlign;
7562 if (F.getParamAlignment(Idx))
7563 FrameAlign = F.getParamAlignment(Idx);
7565 FrameAlign = TLI->getByValTypeAlignment(ElementTy);
7566 Flags.setByValAlign(FrameAlign);
7568 if (F.getAttributes().hasAttribute(Idx, Attribute::Nest))
7571 Flags.setInConsecutiveRegs();
7572 Flags.setOrigAlign(OriginalAlignment);
7574 MVT RegisterVT = TLI->getRegisterType(*CurDAG->getContext(), VT);
7575 unsigned NumRegs = TLI->getNumRegisters(*CurDAG->getContext(), VT);
7576 for (unsigned i = 0; i != NumRegs; ++i) {
7577 ISD::InputArg MyFlags(Flags, RegisterVT, VT, isArgValueUsed,
7578 Idx-1, PartBase+i*RegisterVT.getStoreSize());
7579 if (NumRegs > 1 && i == 0)
7580 MyFlags.Flags.setSplit();
7581 // if it isn't first piece, alignment must be 1
7583 MyFlags.Flags.setOrigAlign(1);
7584 Ins.push_back(MyFlags);
7586 if (NeedsRegBlock && Value == NumValues - 1)
7587 Ins[Ins.size() - 1].Flags.setInConsecutiveRegsLast();
7588 PartBase += VT.getStoreSize();
7592 // Call the target to set up the argument values.
7593 SmallVector<SDValue, 8> InVals;
7594 SDValue NewRoot = TLI->LowerFormalArguments(
7595 DAG.getRoot(), F.getCallingConv(), F.isVarArg(), Ins, dl, DAG, InVals);
7597 // Verify that the target's LowerFormalArguments behaved as expected.
7598 assert(NewRoot.getNode() && NewRoot.getValueType() == MVT::Other &&
7599 "LowerFormalArguments didn't return a valid chain!");
7600 assert(InVals.size() == Ins.size() &&
7601 "LowerFormalArguments didn't emit the correct number of values!");
7603 for (unsigned i = 0, e = Ins.size(); i != e; ++i) {
7604 assert(InVals[i].getNode() &&
7605 "LowerFormalArguments emitted a null value!");
7606 assert(EVT(Ins[i].VT) == InVals[i].getValueType() &&
7607 "LowerFormalArguments emitted a value with the wrong type!");
7611 // Update the DAG with the new chain value resulting from argument lowering.
7612 DAG.setRoot(NewRoot);
7614 // Set up the argument values.
7617 if (!FuncInfo->CanLowerReturn) {
7618 // Create a virtual register for the sret pointer, and put in a copy
7619 // from the sret argument into it.
7620 SmallVector<EVT, 1> ValueVTs;
7621 ComputeValueVTs(*TLI, PointerType::getUnqual(F.getReturnType()), ValueVTs);
7622 MVT VT = ValueVTs[0].getSimpleVT();
7623 MVT RegVT = TLI->getRegisterType(*CurDAG->getContext(), VT);
7624 ISD::NodeType AssertOp = ISD::DELETED_NODE;
7625 SDValue ArgValue = getCopyFromParts(DAG, dl, &InVals[0], 1,
7626 RegVT, VT, nullptr, AssertOp);
7628 MachineFunction& MF = SDB->DAG.getMachineFunction();
7629 MachineRegisterInfo& RegInfo = MF.getRegInfo();
7630 unsigned SRetReg = RegInfo.createVirtualRegister(TLI->getRegClassFor(RegVT));
7631 FuncInfo->DemoteRegister = SRetReg;
7633 SDB->DAG.getCopyToReg(NewRoot, SDB->getCurSDLoc(), SRetReg, ArgValue);
7634 DAG.setRoot(NewRoot);
7636 // i indexes lowered arguments. Bump it past the hidden sret argument.
7637 // Idx indexes LLVM arguments. Don't touch it.
7641 for (Function::const_arg_iterator I = F.arg_begin(), E = F.arg_end(); I != E;
7643 SmallVector<SDValue, 4> ArgValues;
7644 SmallVector<EVT, 4> ValueVTs;
7645 ComputeValueVTs(*TLI, I->getType(), ValueVTs);
7646 unsigned NumValues = ValueVTs.size();
7648 // If this argument is unused then remember its value. It is used to generate
7649 // debugging information.
7650 if (I->use_empty() && NumValues) {
7651 SDB->setUnusedArgValue(I, InVals[i]);
7653 // Also remember any frame index for use in FastISel.
7654 if (FrameIndexSDNode *FI =
7655 dyn_cast<FrameIndexSDNode>(InVals[i].getNode()))
7656 FuncInfo->setArgumentFrameIndex(I, FI->getIndex());
7659 for (unsigned Val = 0; Val != NumValues; ++Val) {
7660 EVT VT = ValueVTs[Val];
7661 MVT PartVT = TLI->getRegisterType(*CurDAG->getContext(), VT);
7662 unsigned NumParts = TLI->getNumRegisters(*CurDAG->getContext(), VT);
7664 if (!I->use_empty()) {
7665 ISD::NodeType AssertOp = ISD::DELETED_NODE;
7666 if (F.getAttributes().hasAttribute(Idx, Attribute::SExt))
7667 AssertOp = ISD::AssertSext;
7668 else if (F.getAttributes().hasAttribute(Idx, Attribute::ZExt))
7669 AssertOp = ISD::AssertZext;
7671 ArgValues.push_back(getCopyFromParts(DAG, dl, &InVals[i],
7672 NumParts, PartVT, VT,
7673 nullptr, AssertOp));
7679 // We don't need to do anything else for unused arguments.
7680 if (ArgValues.empty())
7683 // Note down frame index.
7684 if (FrameIndexSDNode *FI =
7685 dyn_cast<FrameIndexSDNode>(ArgValues[0].getNode()))
7686 FuncInfo->setArgumentFrameIndex(I, FI->getIndex());
7688 SDValue Res = DAG.getMergeValues(makeArrayRef(ArgValues.data(), NumValues),
7689 SDB->getCurSDLoc());
7691 SDB->setValue(I, Res);
7692 if (!TM.Options.EnableFastISel && Res.getOpcode() == ISD::BUILD_PAIR) {
7693 if (LoadSDNode *LNode =
7694 dyn_cast<LoadSDNode>(Res.getOperand(0).getNode()))
7695 if (FrameIndexSDNode *FI =
7696 dyn_cast<FrameIndexSDNode>(LNode->getBasePtr().getNode()))
7697 FuncInfo->setArgumentFrameIndex(I, FI->getIndex());
7700 // If this argument is live outside of the entry block, insert a copy from
7701 // wherever we got it to the vreg that other BB's will reference it as.
7702 if (!TM.Options.EnableFastISel && Res.getOpcode() == ISD::CopyFromReg) {
7703 // If we can, though, try to skip creating an unnecessary vreg.
7704 // FIXME: This isn't very clean... it would be nice to make this more
7705 // general. It's also subtly incompatible with the hacks FastISel
7707 unsigned Reg = cast<RegisterSDNode>(Res.getOperand(1))->getReg();
7708 if (TargetRegisterInfo::isVirtualRegister(Reg)) {
7709 FuncInfo->ValueMap[I] = Reg;
7713 if (!isOnlyUsedInEntryBlock(I, TM.Options.EnableFastISel)) {
7714 FuncInfo->InitializeRegForValue(I);
7715 SDB->CopyToExportRegsIfNeeded(I);
7719 assert(i == InVals.size() && "Argument register count mismatch!");
7721 // Finally, if the target has anything special to do, allow it to do so.
7722 EmitFunctionEntryCode();
7725 /// Handle PHI nodes in successor blocks. Emit code into the SelectionDAG to
7726 /// ensure constants are generated when needed. Remember the virtual registers
7727 /// that need to be added to the Machine PHI nodes as input. We cannot just
7728 /// directly add them, because expansion might result in multiple MBB's for one
7729 /// BB. As such, the start of the BB might correspond to a different MBB than
7733 SelectionDAGBuilder::HandlePHINodesInSuccessorBlocks(const BasicBlock *LLVMBB) {
7734 const TerminatorInst *TI = LLVMBB->getTerminator();
7736 SmallPtrSet<MachineBasicBlock *, 4> SuccsHandled;
7738 // Check PHI nodes in successors that expect a value to be available from this
7740 for (unsigned succ = 0, e = TI->getNumSuccessors(); succ != e; ++succ) {
7741 const BasicBlock *SuccBB = TI->getSuccessor(succ);
7742 if (!isa<PHINode>(SuccBB->begin())) continue;
7743 MachineBasicBlock *SuccMBB = FuncInfo.MBBMap[SuccBB];
7745 // If this terminator has multiple identical successors (common for
7746 // switches), only handle each succ once.
7747 if (!SuccsHandled.insert(SuccMBB).second)
7750 MachineBasicBlock::iterator MBBI = SuccMBB->begin();
7752 // At this point we know that there is a 1-1 correspondence between LLVM PHI
7753 // nodes and Machine PHI nodes, but the incoming operands have not been
7755 for (BasicBlock::const_iterator I = SuccBB->begin();
7756 const PHINode *PN = dyn_cast<PHINode>(I); ++I) {
7757 // Ignore dead phi's.
7758 if (PN->use_empty()) continue;
7761 if (PN->getType()->isEmptyTy())
7765 const Value *PHIOp = PN->getIncomingValueForBlock(LLVMBB);
7767 if (const Constant *C = dyn_cast<Constant>(PHIOp)) {
7768 unsigned &RegOut = ConstantsOut[C];
7770 RegOut = FuncInfo.CreateRegs(C->getType());
7771 CopyValueToVirtualRegister(C, RegOut);
7775 DenseMap<const Value *, unsigned>::iterator I =
7776 FuncInfo.ValueMap.find(PHIOp);
7777 if (I != FuncInfo.ValueMap.end())
7780 assert(isa<AllocaInst>(PHIOp) &&
7781 FuncInfo.StaticAllocaMap.count(cast<AllocaInst>(PHIOp)) &&
7782 "Didn't codegen value into a register!??");
7783 Reg = FuncInfo.CreateRegs(PHIOp->getType());
7784 CopyValueToVirtualRegister(PHIOp, Reg);
7788 // Remember that this register needs to added to the machine PHI node as
7789 // the input for this MBB.
7790 SmallVector<EVT, 4> ValueVTs;
7791 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
7792 ComputeValueVTs(TLI, PN->getType(), ValueVTs);
7793 for (unsigned vti = 0, vte = ValueVTs.size(); vti != vte; ++vti) {
7794 EVT VT = ValueVTs[vti];
7795 unsigned NumRegisters = TLI.getNumRegisters(*DAG.getContext(), VT);
7796 for (unsigned i = 0, e = NumRegisters; i != e; ++i)
7797 FuncInfo.PHINodesToUpdate.push_back(std::make_pair(MBBI++, Reg+i));
7798 Reg += NumRegisters;
7803 ConstantsOut.clear();
7806 /// Add a successor MBB to ParentMBB< creating a new MachineBB for BB if SuccMBB
7809 SelectionDAGBuilder::StackProtectorDescriptor::
7810 AddSuccessorMBB(const BasicBlock *BB,
7811 MachineBasicBlock *ParentMBB,
7813 MachineBasicBlock *SuccMBB) {
7814 // If SuccBB has not been created yet, create it.
7816 MachineFunction *MF = ParentMBB->getParent();
7817 MachineFunction::iterator BBI = ParentMBB;
7818 SuccMBB = MF->CreateMachineBasicBlock(BB);
7819 MF->insert(++BBI, SuccMBB);
7821 // Add it as a successor of ParentMBB.
7822 ParentMBB->addSuccessor(
7823 SuccMBB, BranchProbabilityInfo::getBranchWeightStackProtector(IsLikely));