1 //===-- SelectionDAGBuild.cpp - Selection-DAG building --------------------===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This implements routines for translating from LLVM IR into SelectionDAG IR.
12 //===----------------------------------------------------------------------===//
14 #define DEBUG_TYPE "isel"
15 #include "SelectionDAGBuild.h"
16 #include "llvm/ADT/BitVector.h"
17 #include "llvm/ADT/SmallSet.h"
18 #include "llvm/Analysis/AliasAnalysis.h"
19 #include "llvm/Constants.h"
20 #include "llvm/CallingConv.h"
21 #include "llvm/DerivedTypes.h"
22 #include "llvm/Function.h"
23 #include "llvm/GlobalVariable.h"
24 #include "llvm/InlineAsm.h"
25 #include "llvm/Instructions.h"
26 #include "llvm/Intrinsics.h"
27 #include "llvm/IntrinsicInst.h"
28 #include "llvm/Module.h"
29 #include "llvm/CodeGen/FastISel.h"
30 #include "llvm/CodeGen/GCStrategy.h"
31 #include "llvm/CodeGen/GCMetadata.h"
32 #include "llvm/CodeGen/MachineFunction.h"
33 #include "llvm/CodeGen/MachineFrameInfo.h"
34 #include "llvm/CodeGen/MachineInstrBuilder.h"
35 #include "llvm/CodeGen/MachineJumpTableInfo.h"
36 #include "llvm/CodeGen/MachineModuleInfo.h"
37 #include "llvm/CodeGen/MachineRegisterInfo.h"
38 #include "llvm/CodeGen/PseudoSourceValue.h"
39 #include "llvm/CodeGen/SelectionDAG.h"
40 #include "llvm/CodeGen/DwarfWriter.h"
41 #include "llvm/Analysis/DebugInfo.h"
42 #include "llvm/Target/TargetRegisterInfo.h"
43 #include "llvm/Target/TargetData.h"
44 #include "llvm/Target/TargetFrameInfo.h"
45 #include "llvm/Target/TargetInstrInfo.h"
46 #include "llvm/Target/TargetIntrinsicInfo.h"
47 #include "llvm/Target/TargetLowering.h"
48 #include "llvm/Target/TargetMachine.h"
49 #include "llvm/Target/TargetOptions.h"
50 #include "llvm/Support/Compiler.h"
51 #include "llvm/Support/CommandLine.h"
52 #include "llvm/Support/Debug.h"
53 #include "llvm/Support/MathExtras.h"
54 #include "llvm/Support/raw_ostream.h"
58 /// LimitFloatPrecision - Generate low-precision inline sequences for
59 /// some float libcalls (6, 8 or 12 bits).
60 static unsigned LimitFloatPrecision;
62 static cl::opt<unsigned, true>
63 LimitFPPrecision("limit-float-precision",
64 cl::desc("Generate low-precision inline sequences "
65 "for some float libcalls"),
66 cl::location(LimitFloatPrecision),
69 /// ComputeLinearIndex - Given an LLVM IR aggregate type and a sequence
70 /// of insertvalue or extractvalue indices that identify a member, return
71 /// the linearized index of the start of the member.
73 static unsigned ComputeLinearIndex(const TargetLowering &TLI, const Type *Ty,
74 const unsigned *Indices,
75 const unsigned *IndicesEnd,
76 unsigned CurIndex = 0) {
77 // Base case: We're done.
78 if (Indices && Indices == IndicesEnd)
81 // Given a struct type, recursively traverse the elements.
82 if (const StructType *STy = dyn_cast<StructType>(Ty)) {
83 for (StructType::element_iterator EB = STy->element_begin(),
85 EE = STy->element_end();
87 if (Indices && *Indices == unsigned(EI - EB))
88 return ComputeLinearIndex(TLI, *EI, Indices+1, IndicesEnd, CurIndex);
89 CurIndex = ComputeLinearIndex(TLI, *EI, 0, 0, CurIndex);
93 // Given an array type, recursively traverse the elements.
94 else if (const ArrayType *ATy = dyn_cast<ArrayType>(Ty)) {
95 const Type *EltTy = ATy->getElementType();
96 for (unsigned i = 0, e = ATy->getNumElements(); i != e; ++i) {
97 if (Indices && *Indices == i)
98 return ComputeLinearIndex(TLI, EltTy, Indices+1, IndicesEnd, CurIndex);
99 CurIndex = ComputeLinearIndex(TLI, EltTy, 0, 0, CurIndex);
103 // We haven't found the type we're looking for, so keep searching.
107 /// ComputeValueVTs - Given an LLVM IR type, compute a sequence of
108 /// MVTs that represent all the individual underlying
109 /// non-aggregate types that comprise it.
111 /// If Offsets is non-null, it points to a vector to be filled in
112 /// with the in-memory offsets of each of the individual values.
114 static void ComputeValueVTs(const TargetLowering &TLI, const Type *Ty,
115 SmallVectorImpl<MVT> &ValueVTs,
116 SmallVectorImpl<uint64_t> *Offsets = 0,
117 uint64_t StartingOffset = 0) {
118 // Given a struct type, recursively traverse the elements.
119 if (const StructType *STy = dyn_cast<StructType>(Ty)) {
120 const StructLayout *SL = TLI.getTargetData()->getStructLayout(STy);
121 for (StructType::element_iterator EB = STy->element_begin(),
123 EE = STy->element_end();
125 ComputeValueVTs(TLI, *EI, ValueVTs, Offsets,
126 StartingOffset + SL->getElementOffset(EI - EB));
129 // Given an array type, recursively traverse the elements.
130 if (const ArrayType *ATy = dyn_cast<ArrayType>(Ty)) {
131 const Type *EltTy = ATy->getElementType();
132 uint64_t EltSize = TLI.getTargetData()->getTypePaddedSize(EltTy);
133 for (unsigned i = 0, e = ATy->getNumElements(); i != e; ++i)
134 ComputeValueVTs(TLI, EltTy, ValueVTs, Offsets,
135 StartingOffset + i * EltSize);
138 // Base case: we can get an MVT for this LLVM IR type.
139 ValueVTs.push_back(TLI.getValueType(Ty));
141 Offsets->push_back(StartingOffset);
145 /// RegsForValue - This struct represents the registers (physical or virtual)
146 /// that a particular set of values is assigned, and the type information about
147 /// the value. The most common situation is to represent one value at a time,
148 /// but struct or array values are handled element-wise as multiple values.
149 /// The splitting of aggregates is performed recursively, so that we never
150 /// have aggregate-typed registers. The values at this point do not necessarily
151 /// have legal types, so each value may require one or more registers of some
154 struct VISIBILITY_HIDDEN RegsForValue {
155 /// TLI - The TargetLowering object.
157 const TargetLowering *TLI;
159 /// ValueVTs - The value types of the values, which may not be legal, and
160 /// may need be promoted or synthesized from one or more registers.
162 SmallVector<MVT, 4> ValueVTs;
164 /// RegVTs - The value types of the registers. This is the same size as
165 /// ValueVTs and it records, for each value, what the type of the assigned
166 /// register or registers are. (Individual values are never synthesized
167 /// from more than one type of register.)
169 /// With virtual registers, the contents of RegVTs is redundant with TLI's
170 /// getRegisterType member function, however when with physical registers
171 /// it is necessary to have a separate record of the types.
173 SmallVector<MVT, 4> RegVTs;
175 /// Regs - This list holds the registers assigned to the values.
176 /// Each legal or promoted value requires one register, and each
177 /// expanded value requires multiple registers.
179 SmallVector<unsigned, 4> Regs;
181 RegsForValue() : TLI(0) {}
183 RegsForValue(const TargetLowering &tli,
184 const SmallVector<unsigned, 4> ®s,
185 MVT regvt, MVT valuevt)
186 : TLI(&tli), ValueVTs(1, valuevt), RegVTs(1, regvt), Regs(regs) {}
187 RegsForValue(const TargetLowering &tli,
188 const SmallVector<unsigned, 4> ®s,
189 const SmallVector<MVT, 4> ®vts,
190 const SmallVector<MVT, 4> &valuevts)
191 : TLI(&tli), ValueVTs(valuevts), RegVTs(regvts), Regs(regs) {}
192 RegsForValue(const TargetLowering &tli,
193 unsigned Reg, const Type *Ty) : TLI(&tli) {
194 ComputeValueVTs(tli, Ty, ValueVTs);
196 for (unsigned Value = 0, e = ValueVTs.size(); Value != e; ++Value) {
197 MVT ValueVT = ValueVTs[Value];
198 unsigned NumRegs = TLI->getNumRegisters(ValueVT);
199 MVT RegisterVT = TLI->getRegisterType(ValueVT);
200 for (unsigned i = 0; i != NumRegs; ++i)
201 Regs.push_back(Reg + i);
202 RegVTs.push_back(RegisterVT);
207 /// append - Add the specified values to this one.
208 void append(const RegsForValue &RHS) {
210 ValueVTs.append(RHS.ValueVTs.begin(), RHS.ValueVTs.end());
211 RegVTs.append(RHS.RegVTs.begin(), RHS.RegVTs.end());
212 Regs.append(RHS.Regs.begin(), RHS.Regs.end());
216 /// getCopyFromRegs - Emit a series of CopyFromReg nodes that copies from
217 /// this value and returns the result as a ValueVTs value. This uses
218 /// Chain/Flag as the input and updates them for the output Chain/Flag.
219 /// If the Flag pointer is NULL, no flag is used.
220 SDValue getCopyFromRegs(SelectionDAG &DAG, DebugLoc dl,
221 SDValue &Chain, SDValue *Flag) const;
223 /// getCopyToRegs - Emit a series of CopyToReg nodes that copies the
224 /// specified value into the registers specified by this object. This uses
225 /// Chain/Flag as the input and updates them for the output Chain/Flag.
226 /// If the Flag pointer is NULL, no flag is used.
227 void getCopyToRegs(SDValue Val, SelectionDAG &DAG, DebugLoc dl,
228 SDValue &Chain, SDValue *Flag) const;
230 /// AddInlineAsmOperands - Add this value to the specified inlineasm node
231 /// operand list. This adds the code marker, matching input operand index
232 /// (if applicable), and includes the number of values added into it.
233 void AddInlineAsmOperands(unsigned Code,
234 bool HasMatching, unsigned MatchingIdx,
235 SelectionDAG &DAG, std::vector<SDValue> &Ops) const;
239 /// isUsedOutsideOfDefiningBlock - Return true if this instruction is used by
240 /// PHI nodes or outside of the basic block that defines it, or used by a
241 /// switch or atomic instruction, which may expand to multiple basic blocks.
242 static bool isUsedOutsideOfDefiningBlock(Instruction *I) {
243 if (isa<PHINode>(I)) return true;
244 BasicBlock *BB = I->getParent();
245 for (Value::use_iterator UI = I->use_begin(), E = I->use_end(); UI != E; ++UI)
246 if (cast<Instruction>(*UI)->getParent() != BB || isa<PHINode>(*UI))
251 /// isOnlyUsedInEntryBlock - If the specified argument is only used in the
252 /// entry block, return true. This includes arguments used by switches, since
253 /// the switch may expand into multiple basic blocks.
254 static bool isOnlyUsedInEntryBlock(Argument *A, bool EnableFastISel) {
255 // With FastISel active, we may be splitting blocks, so force creation
256 // of virtual registers for all non-dead arguments.
257 // Don't force virtual registers for byval arguments though, because
258 // fast-isel can't handle those in all cases.
259 if (EnableFastISel && !A->hasByValAttr())
260 return A->use_empty();
262 BasicBlock *Entry = A->getParent()->begin();
263 for (Value::use_iterator UI = A->use_begin(), E = A->use_end(); UI != E; ++UI)
264 if (cast<Instruction>(*UI)->getParent() != Entry || isa<SwitchInst>(*UI))
265 return false; // Use not in entry block.
269 FunctionLoweringInfo::FunctionLoweringInfo(TargetLowering &tli)
273 void FunctionLoweringInfo::set(Function &fn, MachineFunction &mf,
275 bool EnableFastISel) {
278 RegInfo = &MF->getRegInfo();
280 // Create a vreg for each argument register that is not dead and is used
281 // outside of the entry block for the function.
282 for (Function::arg_iterator AI = Fn->arg_begin(), E = Fn->arg_end();
284 if (!isOnlyUsedInEntryBlock(AI, EnableFastISel))
285 InitializeRegForValue(AI);
287 // Initialize the mapping of values to registers. This is only set up for
288 // instruction values that are used outside of the block that defines
290 Function::iterator BB = Fn->begin(), EB = Fn->end();
291 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I)
292 if (AllocaInst *AI = dyn_cast<AllocaInst>(I))
293 if (ConstantInt *CUI = dyn_cast<ConstantInt>(AI->getArraySize())) {
294 const Type *Ty = AI->getAllocatedType();
295 uint64_t TySize = TLI.getTargetData()->getTypePaddedSize(Ty);
297 std::max((unsigned)TLI.getTargetData()->getPrefTypeAlignment(Ty),
300 TySize *= CUI->getZExtValue(); // Get total allocated size.
301 if (TySize == 0) TySize = 1; // Don't create zero-sized stack objects.
302 StaticAllocaMap[AI] =
303 MF->getFrameInfo()->CreateStackObject(TySize, Align);
306 for (; BB != EB; ++BB)
307 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I)
308 if (!I->use_empty() && isUsedOutsideOfDefiningBlock(I))
309 if (!isa<AllocaInst>(I) ||
310 !StaticAllocaMap.count(cast<AllocaInst>(I)))
311 InitializeRegForValue(I);
313 // Create an initial MachineBasicBlock for each LLVM BasicBlock in F. This
314 // also creates the initial PHI MachineInstrs, though none of the input
315 // operands are populated.
316 for (BB = Fn->begin(), EB = Fn->end(); BB != EB; ++BB) {
317 MachineBasicBlock *MBB = mf.CreateMachineBasicBlock(BB);
321 // Create Machine PHI nodes for LLVM PHI nodes, lowering them as
325 for (BasicBlock::iterator
326 I = BB->begin(), E = BB->end(); I != E; ++I) {
327 if (CallInst *CI = dyn_cast<CallInst>(I)) {
328 if (Function *F = CI->getCalledFunction()) {
329 switch (F->getIntrinsicID()) {
331 case Intrinsic::dbg_stoppoint: {
332 DwarfWriter *DW = DAG.getDwarfWriter();
333 DbgStopPointInst *SPI = cast<DbgStopPointInst>(I);
335 if (DW && DW->ValidDebugInfo(SPI->getContext())) {
336 DICompileUnit CU(cast<GlobalVariable>(SPI->getContext()));
338 unsigned SrcFile = DW->getOrCreateSourceID(CU.getDirectory(Dir),
340 unsigned idx = MF->getOrCreateDebugLocID(SrcFile,
343 DL = DebugLoc::get(idx);
348 case Intrinsic::dbg_func_start: {
349 DwarfWriter *DW = DAG.getDwarfWriter();
351 DbgFuncStartInst *FSI = cast<DbgFuncStartInst>(I);
352 Value *SP = FSI->getSubprogram();
354 if (DW->ValidDebugInfo(SP)) {
355 DISubprogram Subprogram(cast<GlobalVariable>(SP));
356 DICompileUnit CU(Subprogram.getCompileUnit());
358 unsigned SrcFile = DW->getOrCreateSourceID(CU.getDirectory(Dir),
360 unsigned Line = Subprogram.getLineNumber();
361 DL = DebugLoc::get(MF->getOrCreateDebugLocID(SrcFile, Line, 0));
371 PN = dyn_cast<PHINode>(I);
372 if (!PN || PN->use_empty()) continue;
374 unsigned PHIReg = ValueMap[PN];
375 assert(PHIReg && "PHI node does not have an assigned virtual register!");
377 SmallVector<MVT, 4> ValueVTs;
378 ComputeValueVTs(TLI, PN->getType(), ValueVTs);
379 for (unsigned vti = 0, vte = ValueVTs.size(); vti != vte; ++vti) {
380 MVT VT = ValueVTs[vti];
381 unsigned NumRegisters = TLI.getNumRegisters(VT);
382 const TargetInstrInfo *TII = MF->getTarget().getInstrInfo();
383 for (unsigned i = 0; i != NumRegisters; ++i)
384 BuildMI(MBB, DL, TII->get(TargetInstrInfo::PHI), PHIReg + i);
385 PHIReg += NumRegisters;
391 unsigned FunctionLoweringInfo::MakeReg(MVT VT) {
392 return RegInfo->createVirtualRegister(TLI.getRegClassFor(VT));
395 /// CreateRegForValue - Allocate the appropriate number of virtual registers of
396 /// the correctly promoted or expanded types. Assign these registers
397 /// consecutive vreg numbers and return the first assigned number.
399 /// In the case that the given value has struct or array type, this function
400 /// will assign registers for each member or element.
402 unsigned FunctionLoweringInfo::CreateRegForValue(const Value *V) {
403 SmallVector<MVT, 4> ValueVTs;
404 ComputeValueVTs(TLI, V->getType(), ValueVTs);
406 unsigned FirstReg = 0;
407 for (unsigned Value = 0, e = ValueVTs.size(); Value != e; ++Value) {
408 MVT ValueVT = ValueVTs[Value];
409 MVT RegisterVT = TLI.getRegisterType(ValueVT);
411 unsigned NumRegs = TLI.getNumRegisters(ValueVT);
412 for (unsigned i = 0; i != NumRegs; ++i) {
413 unsigned R = MakeReg(RegisterVT);
414 if (!FirstReg) FirstReg = R;
420 /// getCopyFromParts - Create a value that contains the specified legal parts
421 /// combined into the value they represent. If the parts combine to a type
422 /// larger then ValueVT then AssertOp can be used to specify whether the extra
423 /// bits are known to be zero (ISD::AssertZext) or sign extended from ValueVT
424 /// (ISD::AssertSext).
425 static SDValue getCopyFromParts(SelectionDAG &DAG, DebugLoc dl,
426 const SDValue *Parts,
427 unsigned NumParts, MVT PartVT, MVT ValueVT,
428 ISD::NodeType AssertOp = ISD::DELETED_NODE) {
429 assert(NumParts > 0 && "No parts to assemble!");
430 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
431 SDValue Val = Parts[0];
434 // Assemble the value from multiple parts.
435 if (!ValueVT.isVector()) {
436 unsigned PartBits = PartVT.getSizeInBits();
437 unsigned ValueBits = ValueVT.getSizeInBits();
439 // Assemble the power of 2 part.
440 unsigned RoundParts = NumParts & (NumParts - 1) ?
441 1 << Log2_32(NumParts) : NumParts;
442 unsigned RoundBits = PartBits * RoundParts;
443 MVT RoundVT = RoundBits == ValueBits ?
444 ValueVT : MVT::getIntegerVT(RoundBits);
447 MVT HalfVT = ValueVT.isInteger() ?
448 MVT::getIntegerVT(RoundBits/2) :
449 MVT::getFloatingPointVT(RoundBits/2);
451 if (RoundParts > 2) {
452 Lo = getCopyFromParts(DAG, dl, Parts, RoundParts/2, PartVT, HalfVT);
453 Hi = getCopyFromParts(DAG, dl, Parts+RoundParts/2, RoundParts/2,
456 Lo = DAG.getNode(ISD::BIT_CONVERT, dl, HalfVT, Parts[0]);
457 Hi = DAG.getNode(ISD::BIT_CONVERT, dl, HalfVT, Parts[1]);
459 if (TLI.isBigEndian())
461 Val = DAG.getNode(ISD::BUILD_PAIR, dl, RoundVT, Lo, Hi);
463 if (RoundParts < NumParts) {
464 // Assemble the trailing non-power-of-2 part.
465 unsigned OddParts = NumParts - RoundParts;
466 MVT OddVT = MVT::getIntegerVT(OddParts * PartBits);
467 Hi = getCopyFromParts(DAG, dl,
468 Parts+RoundParts, OddParts, PartVT, OddVT);
470 // Combine the round and odd parts.
472 if (TLI.isBigEndian())
474 MVT TotalVT = MVT::getIntegerVT(NumParts * PartBits);
475 Hi = DAG.getNode(ISD::ANY_EXTEND, dl, TotalVT, Hi);
476 Hi = DAG.getNode(ISD::SHL, dl, TotalVT, Hi,
477 DAG.getConstant(Lo.getValueType().getSizeInBits(),
478 TLI.getPointerTy()));
479 Lo = DAG.getNode(ISD::ZERO_EXTEND, dl, TotalVT, Lo);
480 Val = DAG.getNode(ISD::OR, dl, TotalVT, Lo, Hi);
483 // Handle a multi-element vector.
484 MVT IntermediateVT, RegisterVT;
485 unsigned NumIntermediates;
487 TLI.getVectorTypeBreakdown(ValueVT, IntermediateVT, NumIntermediates,
489 assert(NumRegs == NumParts && "Part count doesn't match vector breakdown!");
490 NumParts = NumRegs; // Silence a compiler warning.
491 assert(RegisterVT == PartVT && "Part type doesn't match vector breakdown!");
492 assert(RegisterVT == Parts[0].getValueType() &&
493 "Part type doesn't match part!");
495 // Assemble the parts into intermediate operands.
496 SmallVector<SDValue, 8> Ops(NumIntermediates);
497 if (NumIntermediates == NumParts) {
498 // If the register was not expanded, truncate or copy the value,
500 for (unsigned i = 0; i != NumParts; ++i)
501 Ops[i] = getCopyFromParts(DAG, dl, &Parts[i], 1,
502 PartVT, IntermediateVT);
503 } else if (NumParts > 0) {
504 // If the intermediate type was expanded, build the intermediate operands
506 assert(NumParts % NumIntermediates == 0 &&
507 "Must expand into a divisible number of parts!");
508 unsigned Factor = NumParts / NumIntermediates;
509 for (unsigned i = 0; i != NumIntermediates; ++i)
510 Ops[i] = getCopyFromParts(DAG, dl, &Parts[i * Factor], Factor,
511 PartVT, IntermediateVT);
514 // Build a vector with BUILD_VECTOR or CONCAT_VECTORS from the intermediate
516 Val = DAG.getNode(IntermediateVT.isVector() ?
517 ISD::CONCAT_VECTORS : ISD::BUILD_VECTOR, dl,
518 ValueVT, &Ops[0], NumIntermediates);
522 // There is now one part, held in Val. Correct it to match ValueVT.
523 PartVT = Val.getValueType();
525 if (PartVT == ValueVT)
528 if (PartVT.isVector()) {
529 assert(ValueVT.isVector() && "Unknown vector conversion!");
530 return DAG.getNode(ISD::BIT_CONVERT, dl, ValueVT, Val);
533 if (ValueVT.isVector()) {
534 assert(ValueVT.getVectorElementType() == PartVT &&
535 ValueVT.getVectorNumElements() == 1 &&
536 "Only trivial scalar-to-vector conversions should get here!");
537 return DAG.getNode(ISD::BUILD_VECTOR, dl, ValueVT, Val);
540 if (PartVT.isInteger() &&
541 ValueVT.isInteger()) {
542 if (ValueVT.bitsLT(PartVT)) {
543 // For a truncate, see if we have any information to
544 // indicate whether the truncated bits will always be
545 // zero or sign-extension.
546 if (AssertOp != ISD::DELETED_NODE)
547 Val = DAG.getNode(AssertOp, dl, PartVT, Val,
548 DAG.getValueType(ValueVT));
549 return DAG.getNode(ISD::TRUNCATE, dl, ValueVT, Val);
551 return DAG.getNode(ISD::ANY_EXTEND, dl, ValueVT, Val);
555 if (PartVT.isFloatingPoint() && ValueVT.isFloatingPoint()) {
556 if (ValueVT.bitsLT(Val.getValueType()))
557 // FP_ROUND's are always exact here.
558 return DAG.getNode(ISD::FP_ROUND, dl, ValueVT, Val,
559 DAG.getIntPtrConstant(1));
560 return DAG.getNode(ISD::FP_EXTEND, dl, ValueVT, Val);
563 if (PartVT.getSizeInBits() == ValueVT.getSizeInBits())
564 return DAG.getNode(ISD::BIT_CONVERT, dl, ValueVT, Val);
566 assert(0 && "Unknown mismatch!");
570 /// getCopyToParts - Create a series of nodes that contain the specified value
571 /// split into legal parts. If the parts contain more bits than Val, then, for
572 /// integers, ExtendKind can be used to specify how to generate the extra bits.
573 static void getCopyToParts(SelectionDAG &DAG, DebugLoc dl, SDValue Val,
574 SDValue *Parts, unsigned NumParts, MVT PartVT,
575 ISD::NodeType ExtendKind = ISD::ANY_EXTEND) {
576 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
577 MVT PtrVT = TLI.getPointerTy();
578 MVT ValueVT = Val.getValueType();
579 unsigned PartBits = PartVT.getSizeInBits();
580 unsigned OrigNumParts = NumParts;
581 assert(TLI.isTypeLegal(PartVT) && "Copying to an illegal type!");
586 if (!ValueVT.isVector()) {
587 if (PartVT == ValueVT) {
588 assert(NumParts == 1 && "No-op copy with multiple parts!");
593 if (NumParts * PartBits > ValueVT.getSizeInBits()) {
594 // If the parts cover more bits than the value has, promote the value.
595 if (PartVT.isFloatingPoint() && ValueVT.isFloatingPoint()) {
596 assert(NumParts == 1 && "Do not know what to promote to!");
597 Val = DAG.getNode(ISD::FP_EXTEND, dl, PartVT, Val);
598 } else if (PartVT.isInteger() && ValueVT.isInteger()) {
599 ValueVT = MVT::getIntegerVT(NumParts * PartBits);
600 Val = DAG.getNode(ExtendKind, dl, ValueVT, Val);
602 assert(0 && "Unknown mismatch!");
604 } else if (PartBits == ValueVT.getSizeInBits()) {
605 // Different types of the same size.
606 assert(NumParts == 1 && PartVT != ValueVT);
607 Val = DAG.getNode(ISD::BIT_CONVERT, dl, PartVT, Val);
608 } else if (NumParts * PartBits < ValueVT.getSizeInBits()) {
609 // If the parts cover less bits than value has, truncate the value.
610 if (PartVT.isInteger() && ValueVT.isInteger()) {
611 ValueVT = MVT::getIntegerVT(NumParts * PartBits);
612 Val = DAG.getNode(ISD::TRUNCATE, dl, ValueVT, Val);
614 assert(0 && "Unknown mismatch!");
618 // The value may have changed - recompute ValueVT.
619 ValueVT = Val.getValueType();
620 assert(NumParts * PartBits == ValueVT.getSizeInBits() &&
621 "Failed to tile the value with PartVT!");
624 assert(PartVT == ValueVT && "Type conversion failed!");
629 // Expand the value into multiple parts.
630 if (NumParts & (NumParts - 1)) {
631 // The number of parts is not a power of 2. Split off and copy the tail.
632 assert(PartVT.isInteger() && ValueVT.isInteger() &&
633 "Do not know what to expand to!");
634 unsigned RoundParts = 1 << Log2_32(NumParts);
635 unsigned RoundBits = RoundParts * PartBits;
636 unsigned OddParts = NumParts - RoundParts;
637 SDValue OddVal = DAG.getNode(ISD::SRL, dl, ValueVT, Val,
638 DAG.getConstant(RoundBits,
639 TLI.getPointerTy()));
640 getCopyToParts(DAG, dl, OddVal, Parts + RoundParts, OddParts, PartVT);
641 if (TLI.isBigEndian())
642 // The odd parts were reversed by getCopyToParts - unreverse them.
643 std::reverse(Parts + RoundParts, Parts + NumParts);
644 NumParts = RoundParts;
645 ValueVT = MVT::getIntegerVT(NumParts * PartBits);
646 Val = DAG.getNode(ISD::TRUNCATE, dl, ValueVT, Val);
649 // The number of parts is a power of 2. Repeatedly bisect the value using
651 Parts[0] = DAG.getNode(ISD::BIT_CONVERT, dl,
652 MVT::getIntegerVT(ValueVT.getSizeInBits()),
654 for (unsigned StepSize = NumParts; StepSize > 1; StepSize /= 2) {
655 for (unsigned i = 0; i < NumParts; i += StepSize) {
656 unsigned ThisBits = StepSize * PartBits / 2;
657 MVT ThisVT = MVT::getIntegerVT (ThisBits);
658 SDValue &Part0 = Parts[i];
659 SDValue &Part1 = Parts[i+StepSize/2];
661 Part1 = DAG.getNode(ISD::EXTRACT_ELEMENT, dl,
663 DAG.getConstant(1, PtrVT));
664 Part0 = DAG.getNode(ISD::EXTRACT_ELEMENT, dl,
666 DAG.getConstant(0, PtrVT));
668 if (ThisBits == PartBits && ThisVT != PartVT) {
669 Part0 = DAG.getNode(ISD::BIT_CONVERT, dl,
671 Part1 = DAG.getNode(ISD::BIT_CONVERT, dl,
677 if (TLI.isBigEndian())
678 std::reverse(Parts, Parts + OrigNumParts);
685 if (PartVT != ValueVT) {
686 if (PartVT.isVector()) {
687 Val = DAG.getNode(ISD::BIT_CONVERT, dl, PartVT, Val);
689 assert(ValueVT.getVectorElementType() == PartVT &&
690 ValueVT.getVectorNumElements() == 1 &&
691 "Only trivial vector-to-scalar conversions should get here!");
692 Val = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl,
694 DAG.getConstant(0, PtrVT));
702 // Handle a multi-element vector.
703 MVT IntermediateVT, RegisterVT;
704 unsigned NumIntermediates;
705 unsigned NumRegs = TLI
706 .getVectorTypeBreakdown(ValueVT, IntermediateVT, NumIntermediates,
708 unsigned NumElements = ValueVT.getVectorNumElements();
710 assert(NumRegs == NumParts && "Part count doesn't match vector breakdown!");
711 NumParts = NumRegs; // Silence a compiler warning.
712 assert(RegisterVT == PartVT && "Part type doesn't match vector breakdown!");
714 // Split the vector into intermediate operands.
715 SmallVector<SDValue, 8> Ops(NumIntermediates);
716 for (unsigned i = 0; i != NumIntermediates; ++i)
717 if (IntermediateVT.isVector())
718 Ops[i] = DAG.getNode(ISD::EXTRACT_SUBVECTOR, dl,
720 DAG.getConstant(i * (NumElements / NumIntermediates),
723 Ops[i] = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl,
725 DAG.getConstant(i, PtrVT));
727 // Split the intermediate operands into legal parts.
728 if (NumParts == NumIntermediates) {
729 // If the register was not expanded, promote or copy the value,
731 for (unsigned i = 0; i != NumParts; ++i)
732 getCopyToParts(DAG, dl, Ops[i], &Parts[i], 1, PartVT);
733 } else if (NumParts > 0) {
734 // If the intermediate type was expanded, split each the value into
736 assert(NumParts % NumIntermediates == 0 &&
737 "Must expand into a divisible number of parts!");
738 unsigned Factor = NumParts / NumIntermediates;
739 for (unsigned i = 0; i != NumIntermediates; ++i)
740 getCopyToParts(DAG, dl, Ops[i], &Parts[i * Factor], Factor, PartVT);
745 void SelectionDAGLowering::init(GCFunctionInfo *gfi, AliasAnalysis &aa) {
748 TD = DAG.getTarget().getTargetData();
751 /// clear - Clear out the curret SelectionDAG and the associated
752 /// state and prepare this SelectionDAGLowering object to be used
753 /// for a new block. This doesn't clear out information about
754 /// additional blocks that are needed to complete switch lowering
755 /// or PHI node updating; that information is cleared out as it is
757 void SelectionDAGLowering::clear() {
759 PendingLoads.clear();
760 PendingExports.clear();
762 CurDebugLoc = DebugLoc::getUnknownLoc();
765 /// getRoot - Return the current virtual root of the Selection DAG,
766 /// flushing any PendingLoad items. This must be done before emitting
767 /// a store or any other node that may need to be ordered after any
768 /// prior load instructions.
770 SDValue SelectionDAGLowering::getRoot() {
771 if (PendingLoads.empty())
772 return DAG.getRoot();
774 if (PendingLoads.size() == 1) {
775 SDValue Root = PendingLoads[0];
777 PendingLoads.clear();
781 // Otherwise, we have to make a token factor node.
782 SDValue Root = DAG.getNode(ISD::TokenFactor, getCurDebugLoc(), MVT::Other,
783 &PendingLoads[0], PendingLoads.size());
784 PendingLoads.clear();
789 /// getControlRoot - Similar to getRoot, but instead of flushing all the
790 /// PendingLoad items, flush all the PendingExports items. It is necessary
791 /// to do this before emitting a terminator instruction.
793 SDValue SelectionDAGLowering::getControlRoot() {
794 SDValue Root = DAG.getRoot();
796 if (PendingExports.empty())
799 // Turn all of the CopyToReg chains into one factored node.
800 if (Root.getOpcode() != ISD::EntryToken) {
801 unsigned i = 0, e = PendingExports.size();
802 for (; i != e; ++i) {
803 assert(PendingExports[i].getNode()->getNumOperands() > 1);
804 if (PendingExports[i].getNode()->getOperand(0) == Root)
805 break; // Don't add the root if we already indirectly depend on it.
809 PendingExports.push_back(Root);
812 Root = DAG.getNode(ISD::TokenFactor, getCurDebugLoc(), MVT::Other,
814 PendingExports.size());
815 PendingExports.clear();
820 void SelectionDAGLowering::visit(Instruction &I) {
821 visit(I.getOpcode(), I);
824 void SelectionDAGLowering::visit(unsigned Opcode, User &I) {
825 // Note: this doesn't use InstVisitor, because it has to work with
826 // ConstantExpr's in addition to instructions.
828 default: assert(0 && "Unknown instruction type encountered!");
830 // Build the switch statement using the Instruction.def file.
831 #define HANDLE_INST(NUM, OPCODE, CLASS) \
832 case Instruction::OPCODE:return visit##OPCODE((CLASS&)I);
833 #include "llvm/Instruction.def"
837 void SelectionDAGLowering::visitAdd(User &I) {
838 if (I.getType()->isFPOrFPVector())
839 visitBinary(I, ISD::FADD);
841 visitBinary(I, ISD::ADD);
844 void SelectionDAGLowering::visitMul(User &I) {
845 if (I.getType()->isFPOrFPVector())
846 visitBinary(I, ISD::FMUL);
848 visitBinary(I, ISD::MUL);
851 SDValue SelectionDAGLowering::getValue(const Value *V) {
852 SDValue &N = NodeMap[V];
853 if (N.getNode()) return N;
855 if (Constant *C = const_cast<Constant*>(dyn_cast<Constant>(V))) {
856 MVT VT = TLI.getValueType(V->getType(), true);
858 if (ConstantInt *CI = dyn_cast<ConstantInt>(C))
859 return N = DAG.getConstant(*CI, VT);
861 if (GlobalValue *GV = dyn_cast<GlobalValue>(C))
862 return N = DAG.getGlobalAddress(GV, VT);
864 if (isa<ConstantPointerNull>(C))
865 return N = DAG.getConstant(0, TLI.getPointerTy());
867 if (ConstantFP *CFP = dyn_cast<ConstantFP>(C))
868 return N = DAG.getConstantFP(*CFP, VT);
870 if (isa<UndefValue>(C) && !isa<VectorType>(V->getType()) &&
871 !V->getType()->isAggregateType())
872 return N = DAG.getUNDEF(VT);
874 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(C)) {
875 visit(CE->getOpcode(), *CE);
876 SDValue N1 = NodeMap[V];
877 assert(N1.getNode() && "visit didn't populate the ValueMap!");
881 if (isa<ConstantStruct>(C) || isa<ConstantArray>(C)) {
882 SmallVector<SDValue, 4> Constants;
883 for (User::const_op_iterator OI = C->op_begin(), OE = C->op_end();
885 SDNode *Val = getValue(*OI).getNode();
886 for (unsigned i = 0, e = Val->getNumValues(); i != e; ++i)
887 Constants.push_back(SDValue(Val, i));
889 return DAG.getMergeValues(&Constants[0], Constants.size(),
893 if (isa<StructType>(C->getType()) || isa<ArrayType>(C->getType())) {
894 assert((isa<ConstantAggregateZero>(C) || isa<UndefValue>(C)) &&
895 "Unknown struct or array constant!");
897 SmallVector<MVT, 4> ValueVTs;
898 ComputeValueVTs(TLI, C->getType(), ValueVTs);
899 unsigned NumElts = ValueVTs.size();
901 return SDValue(); // empty struct
902 SmallVector<SDValue, 4> Constants(NumElts);
903 for (unsigned i = 0; i != NumElts; ++i) {
904 MVT EltVT = ValueVTs[i];
905 if (isa<UndefValue>(C))
906 Constants[i] = DAG.getUNDEF(EltVT);
907 else if (EltVT.isFloatingPoint())
908 Constants[i] = DAG.getConstantFP(0, EltVT);
910 Constants[i] = DAG.getConstant(0, EltVT);
912 return DAG.getMergeValues(&Constants[0], NumElts, getCurDebugLoc());
915 const VectorType *VecTy = cast<VectorType>(V->getType());
916 unsigned NumElements = VecTy->getNumElements();
918 // Now that we know the number and type of the elements, get that number of
919 // elements into the Ops array based on what kind of constant it is.
920 SmallVector<SDValue, 16> Ops;
921 if (ConstantVector *CP = dyn_cast<ConstantVector>(C)) {
922 for (unsigned i = 0; i != NumElements; ++i)
923 Ops.push_back(getValue(CP->getOperand(i)));
925 assert((isa<ConstantAggregateZero>(C) || isa<UndefValue>(C)) &&
926 "Unknown vector constant!");
927 MVT EltVT = TLI.getValueType(VecTy->getElementType());
930 if (isa<UndefValue>(C))
931 Op = DAG.getUNDEF(EltVT);
932 else if (EltVT.isFloatingPoint())
933 Op = DAG.getConstantFP(0, EltVT);
935 Op = DAG.getConstant(0, EltVT);
936 Ops.assign(NumElements, Op);
939 // Create a BUILD_VECTOR node.
940 return NodeMap[V] = DAG.getNode(ISD::BUILD_VECTOR, getCurDebugLoc(),
941 VT, &Ops[0], Ops.size());
944 // If this is a static alloca, generate it as the frameindex instead of
946 if (const AllocaInst *AI = dyn_cast<AllocaInst>(V)) {
947 DenseMap<const AllocaInst*, int>::iterator SI =
948 FuncInfo.StaticAllocaMap.find(AI);
949 if (SI != FuncInfo.StaticAllocaMap.end())
950 return DAG.getFrameIndex(SI->second, TLI.getPointerTy());
953 unsigned InReg = FuncInfo.ValueMap[V];
954 assert(InReg && "Value not in map!");
956 RegsForValue RFV(TLI, InReg, V->getType());
957 SDValue Chain = DAG.getEntryNode();
958 return RFV.getCopyFromRegs(DAG, getCurDebugLoc(), Chain, NULL);
962 void SelectionDAGLowering::visitRet(ReturnInst &I) {
963 if (I.getNumOperands() == 0) {
964 DAG.setRoot(DAG.getNode(ISD::RET, getCurDebugLoc(),
965 MVT::Other, getControlRoot()));
969 SmallVector<SDValue, 8> NewValues;
970 NewValues.push_back(getControlRoot());
971 for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i) {
972 SmallVector<MVT, 4> ValueVTs;
973 ComputeValueVTs(TLI, I.getOperand(i)->getType(), ValueVTs);
974 unsigned NumValues = ValueVTs.size();
975 if (NumValues == 0) continue;
977 SDValue RetOp = getValue(I.getOperand(i));
978 for (unsigned j = 0, f = NumValues; j != f; ++j) {
979 MVT VT = ValueVTs[j];
981 ISD::NodeType ExtendKind = ISD::ANY_EXTEND;
983 const Function *F = I.getParent()->getParent();
984 if (F->paramHasAttr(0, Attribute::SExt))
985 ExtendKind = ISD::SIGN_EXTEND;
986 else if (F->paramHasAttr(0, Attribute::ZExt))
987 ExtendKind = ISD::ZERO_EXTEND;
989 // FIXME: C calling convention requires the return type to be promoted to
990 // at least 32-bit. But this is not necessary for non-C calling
991 // conventions. The frontend should mark functions whose return values
992 // require promoting with signext or zeroext attributes.
993 if (ExtendKind != ISD::ANY_EXTEND && VT.isInteger()) {
994 MVT MinVT = TLI.getRegisterType(MVT::i32);
995 if (VT.bitsLT(MinVT))
999 unsigned NumParts = TLI.getNumRegisters(VT);
1000 MVT PartVT = TLI.getRegisterType(VT);
1001 SmallVector<SDValue, 4> Parts(NumParts);
1002 getCopyToParts(DAG, getCurDebugLoc(),
1003 SDValue(RetOp.getNode(), RetOp.getResNo() + j),
1004 &Parts[0], NumParts, PartVT, ExtendKind);
1006 // 'inreg' on function refers to return value
1007 ISD::ArgFlagsTy Flags = ISD::ArgFlagsTy();
1008 if (F->paramHasAttr(0, Attribute::InReg))
1010 for (unsigned i = 0; i < NumParts; ++i) {
1011 NewValues.push_back(Parts[i]);
1012 NewValues.push_back(DAG.getArgFlags(Flags));
1016 DAG.setRoot(DAG.getNode(ISD::RET, getCurDebugLoc(), MVT::Other,
1017 &NewValues[0], NewValues.size()));
1020 /// ExportFromCurrentBlock - If this condition isn't known to be exported from
1021 /// the current basic block, add it to ValueMap now so that we'll get a
1023 void SelectionDAGLowering::ExportFromCurrentBlock(Value *V) {
1024 // No need to export constants.
1025 if (!isa<Instruction>(V) && !isa<Argument>(V)) return;
1027 // Already exported?
1028 if (FuncInfo.isExportedInst(V)) return;
1030 unsigned Reg = FuncInfo.InitializeRegForValue(V);
1031 CopyValueToVirtualRegister(V, Reg);
1034 bool SelectionDAGLowering::isExportableFromCurrentBlock(Value *V,
1035 const BasicBlock *FromBB) {
1036 // The operands of the setcc have to be in this block. We don't know
1037 // how to export them from some other block.
1038 if (Instruction *VI = dyn_cast<Instruction>(V)) {
1039 // Can export from current BB.
1040 if (VI->getParent() == FromBB)
1043 // Is already exported, noop.
1044 return FuncInfo.isExportedInst(V);
1047 // If this is an argument, we can export it if the BB is the entry block or
1048 // if it is already exported.
1049 if (isa<Argument>(V)) {
1050 if (FromBB == &FromBB->getParent()->getEntryBlock())
1053 // Otherwise, can only export this if it is already exported.
1054 return FuncInfo.isExportedInst(V);
1057 // Otherwise, constants can always be exported.
1061 static bool InBlock(const Value *V, const BasicBlock *BB) {
1062 if (const Instruction *I = dyn_cast<Instruction>(V))
1063 return I->getParent() == BB;
1067 /// getFCmpCondCode - Return the ISD condition code corresponding to
1068 /// the given LLVM IR floating-point condition code. This includes
1069 /// consideration of global floating-point math flags.
1071 static ISD::CondCode getFCmpCondCode(FCmpInst::Predicate Pred) {
1072 ISD::CondCode FPC, FOC;
1074 case FCmpInst::FCMP_FALSE: FOC = FPC = ISD::SETFALSE; break;
1075 case FCmpInst::FCMP_OEQ: FOC = ISD::SETEQ; FPC = ISD::SETOEQ; break;
1076 case FCmpInst::FCMP_OGT: FOC = ISD::SETGT; FPC = ISD::SETOGT; break;
1077 case FCmpInst::FCMP_OGE: FOC = ISD::SETGE; FPC = ISD::SETOGE; break;
1078 case FCmpInst::FCMP_OLT: FOC = ISD::SETLT; FPC = ISD::SETOLT; break;
1079 case FCmpInst::FCMP_OLE: FOC = ISD::SETLE; FPC = ISD::SETOLE; break;
1080 case FCmpInst::FCMP_ONE: FOC = ISD::SETNE; FPC = ISD::SETONE; break;
1081 case FCmpInst::FCMP_ORD: FOC = FPC = ISD::SETO; break;
1082 case FCmpInst::FCMP_UNO: FOC = FPC = ISD::SETUO; break;
1083 case FCmpInst::FCMP_UEQ: FOC = ISD::SETEQ; FPC = ISD::SETUEQ; break;
1084 case FCmpInst::FCMP_UGT: FOC = ISD::SETGT; FPC = ISD::SETUGT; break;
1085 case FCmpInst::FCMP_UGE: FOC = ISD::SETGE; FPC = ISD::SETUGE; break;
1086 case FCmpInst::FCMP_ULT: FOC = ISD::SETLT; FPC = ISD::SETULT; break;
1087 case FCmpInst::FCMP_ULE: FOC = ISD::SETLE; FPC = ISD::SETULE; break;
1088 case FCmpInst::FCMP_UNE: FOC = ISD::SETNE; FPC = ISD::SETUNE; break;
1089 case FCmpInst::FCMP_TRUE: FOC = FPC = ISD::SETTRUE; break;
1091 assert(0 && "Invalid FCmp predicate opcode!");
1092 FOC = FPC = ISD::SETFALSE;
1095 if (FiniteOnlyFPMath())
1101 /// getICmpCondCode - Return the ISD condition code corresponding to
1102 /// the given LLVM IR integer condition code.
1104 static ISD::CondCode getICmpCondCode(ICmpInst::Predicate Pred) {
1106 case ICmpInst::ICMP_EQ: return ISD::SETEQ;
1107 case ICmpInst::ICMP_NE: return ISD::SETNE;
1108 case ICmpInst::ICMP_SLE: return ISD::SETLE;
1109 case ICmpInst::ICMP_ULE: return ISD::SETULE;
1110 case ICmpInst::ICMP_SGE: return ISD::SETGE;
1111 case ICmpInst::ICMP_UGE: return ISD::SETUGE;
1112 case ICmpInst::ICMP_SLT: return ISD::SETLT;
1113 case ICmpInst::ICMP_ULT: return ISD::SETULT;
1114 case ICmpInst::ICMP_SGT: return ISD::SETGT;
1115 case ICmpInst::ICMP_UGT: return ISD::SETUGT;
1117 assert(0 && "Invalid ICmp predicate opcode!");
1122 /// EmitBranchForMergedCondition - Helper method for FindMergedConditions.
1123 /// This function emits a branch and is used at the leaves of an OR or an
1124 /// AND operator tree.
1127 SelectionDAGLowering::EmitBranchForMergedCondition(Value *Cond,
1128 MachineBasicBlock *TBB,
1129 MachineBasicBlock *FBB,
1130 MachineBasicBlock *CurBB) {
1131 const BasicBlock *BB = CurBB->getBasicBlock();
1133 // If the leaf of the tree is a comparison, merge the condition into
1135 if (CmpInst *BOp = dyn_cast<CmpInst>(Cond)) {
1136 // The operands of the cmp have to be in this block. We don't know
1137 // how to export them from some other block. If this is the first block
1138 // of the sequence, no exporting is needed.
1139 if (CurBB == CurMBB ||
1140 (isExportableFromCurrentBlock(BOp->getOperand(0), BB) &&
1141 isExportableFromCurrentBlock(BOp->getOperand(1), BB))) {
1142 ISD::CondCode Condition;
1143 if (ICmpInst *IC = dyn_cast<ICmpInst>(Cond)) {
1144 Condition = getICmpCondCode(IC->getPredicate());
1145 } else if (FCmpInst *FC = dyn_cast<FCmpInst>(Cond)) {
1146 Condition = getFCmpCondCode(FC->getPredicate());
1148 Condition = ISD::SETEQ; // silence warning.
1149 assert(0 && "Unknown compare instruction");
1152 CaseBlock CB(Condition, BOp->getOperand(0),
1153 BOp->getOperand(1), NULL, TBB, FBB, CurBB);
1154 SwitchCases.push_back(CB);
1159 // Create a CaseBlock record representing this branch.
1160 CaseBlock CB(ISD::SETEQ, Cond, ConstantInt::getTrue(),
1161 NULL, TBB, FBB, CurBB);
1162 SwitchCases.push_back(CB);
1165 /// FindMergedConditions - If Cond is an expression like
1166 void SelectionDAGLowering::FindMergedConditions(Value *Cond,
1167 MachineBasicBlock *TBB,
1168 MachineBasicBlock *FBB,
1169 MachineBasicBlock *CurBB,
1171 // If this node is not part of the or/and tree, emit it as a branch.
1172 Instruction *BOp = dyn_cast<Instruction>(Cond);
1173 if (!BOp || !(isa<BinaryOperator>(BOp) || isa<CmpInst>(BOp)) ||
1174 (unsigned)BOp->getOpcode() != Opc || !BOp->hasOneUse() ||
1175 BOp->getParent() != CurBB->getBasicBlock() ||
1176 !InBlock(BOp->getOperand(0), CurBB->getBasicBlock()) ||
1177 !InBlock(BOp->getOperand(1), CurBB->getBasicBlock())) {
1178 EmitBranchForMergedCondition(Cond, TBB, FBB, CurBB);
1182 // Create TmpBB after CurBB.
1183 MachineFunction::iterator BBI = CurBB;
1184 MachineFunction &MF = DAG.getMachineFunction();
1185 MachineBasicBlock *TmpBB = MF.CreateMachineBasicBlock(CurBB->getBasicBlock());
1186 CurBB->getParent()->insert(++BBI, TmpBB);
1188 if (Opc == Instruction::Or) {
1189 // Codegen X | Y as:
1197 // Emit the LHS condition.
1198 FindMergedConditions(BOp->getOperand(0), TBB, TmpBB, CurBB, Opc);
1200 // Emit the RHS condition into TmpBB.
1201 FindMergedConditions(BOp->getOperand(1), TBB, FBB, TmpBB, Opc);
1203 assert(Opc == Instruction::And && "Unknown merge op!");
1204 // Codegen X & Y as:
1211 // This requires creation of TmpBB after CurBB.
1213 // Emit the LHS condition.
1214 FindMergedConditions(BOp->getOperand(0), TmpBB, FBB, CurBB, Opc);
1216 // Emit the RHS condition into TmpBB.
1217 FindMergedConditions(BOp->getOperand(1), TBB, FBB, TmpBB, Opc);
1221 /// If the set of cases should be emitted as a series of branches, return true.
1222 /// If we should emit this as a bunch of and/or'd together conditions, return
1225 SelectionDAGLowering::ShouldEmitAsBranches(const std::vector<CaseBlock> &Cases){
1226 if (Cases.size() != 2) return true;
1228 // If this is two comparisons of the same values or'd or and'd together, they
1229 // will get folded into a single comparison, so don't emit two blocks.
1230 if ((Cases[0].CmpLHS == Cases[1].CmpLHS &&
1231 Cases[0].CmpRHS == Cases[1].CmpRHS) ||
1232 (Cases[0].CmpRHS == Cases[1].CmpLHS &&
1233 Cases[0].CmpLHS == Cases[1].CmpRHS)) {
1240 void SelectionDAGLowering::visitBr(BranchInst &I) {
1241 // Update machine-CFG edges.
1242 MachineBasicBlock *Succ0MBB = FuncInfo.MBBMap[I.getSuccessor(0)];
1244 // Figure out which block is immediately after the current one.
1245 MachineBasicBlock *NextBlock = 0;
1246 MachineFunction::iterator BBI = CurMBB;
1247 if (++BBI != CurMBB->getParent()->end())
1250 if (I.isUnconditional()) {
1251 // Update machine-CFG edges.
1252 CurMBB->addSuccessor(Succ0MBB);
1254 // If this is not a fall-through branch, emit the branch.
1255 if (Succ0MBB != NextBlock)
1256 DAG.setRoot(DAG.getNode(ISD::BR, getCurDebugLoc(),
1257 MVT::Other, getControlRoot(),
1258 DAG.getBasicBlock(Succ0MBB)));
1262 // If this condition is one of the special cases we handle, do special stuff
1264 Value *CondVal = I.getCondition();
1265 MachineBasicBlock *Succ1MBB = FuncInfo.MBBMap[I.getSuccessor(1)];
1267 // If this is a series of conditions that are or'd or and'd together, emit
1268 // this as a sequence of branches instead of setcc's with and/or operations.
1269 // For example, instead of something like:
1282 if (BinaryOperator *BOp = dyn_cast<BinaryOperator>(CondVal)) {
1283 if (BOp->hasOneUse() &&
1284 (BOp->getOpcode() == Instruction::And ||
1285 BOp->getOpcode() == Instruction::Or)) {
1286 FindMergedConditions(BOp, Succ0MBB, Succ1MBB, CurMBB, BOp->getOpcode());
1287 // If the compares in later blocks need to use values not currently
1288 // exported from this block, export them now. This block should always
1289 // be the first entry.
1290 assert(SwitchCases[0].ThisBB == CurMBB && "Unexpected lowering!");
1292 // Allow some cases to be rejected.
1293 if (ShouldEmitAsBranches(SwitchCases)) {
1294 for (unsigned i = 1, e = SwitchCases.size(); i != e; ++i) {
1295 ExportFromCurrentBlock(SwitchCases[i].CmpLHS);
1296 ExportFromCurrentBlock(SwitchCases[i].CmpRHS);
1299 // Emit the branch for this block.
1300 visitSwitchCase(SwitchCases[0]);
1301 SwitchCases.erase(SwitchCases.begin());
1305 // Okay, we decided not to do this, remove any inserted MBB's and clear
1307 for (unsigned i = 1, e = SwitchCases.size(); i != e; ++i)
1308 CurMBB->getParent()->erase(SwitchCases[i].ThisBB);
1310 SwitchCases.clear();
1314 // Create a CaseBlock record representing this branch.
1315 CaseBlock CB(ISD::SETEQ, CondVal, ConstantInt::getTrue(),
1316 NULL, Succ0MBB, Succ1MBB, CurMBB);
1317 // Use visitSwitchCase to actually insert the fast branch sequence for this
1319 visitSwitchCase(CB);
1322 /// visitSwitchCase - Emits the necessary code to represent a single node in
1323 /// the binary search tree resulting from lowering a switch instruction.
1324 void SelectionDAGLowering::visitSwitchCase(CaseBlock &CB) {
1326 SDValue CondLHS = getValue(CB.CmpLHS);
1327 DebugLoc dl = getCurDebugLoc();
1329 // Build the setcc now.
1330 if (CB.CmpMHS == NULL) {
1331 // Fold "(X == true)" to X and "(X == false)" to !X to
1332 // handle common cases produced by branch lowering.
1333 if (CB.CmpRHS == ConstantInt::getTrue() && CB.CC == ISD::SETEQ)
1335 else if (CB.CmpRHS == ConstantInt::getFalse() && CB.CC == ISD::SETEQ) {
1336 SDValue True = DAG.getConstant(1, CondLHS.getValueType());
1337 Cond = DAG.getNode(ISD::XOR, dl, CondLHS.getValueType(), CondLHS, True);
1339 Cond = DAG.getSetCC(dl, MVT::i1, CondLHS, getValue(CB.CmpRHS), CB.CC);
1341 assert(CB.CC == ISD::SETLE && "Can handle only LE ranges now");
1343 const APInt& Low = cast<ConstantInt>(CB.CmpLHS)->getValue();
1344 const APInt& High = cast<ConstantInt>(CB.CmpRHS)->getValue();
1346 SDValue CmpOp = getValue(CB.CmpMHS);
1347 MVT VT = CmpOp.getValueType();
1349 if (cast<ConstantInt>(CB.CmpLHS)->isMinValue(true)) {
1350 Cond = DAG.getSetCC(dl, MVT::i1, CmpOp, DAG.getConstant(High, VT),
1353 SDValue SUB = DAG.getNode(ISD::SUB, dl,
1354 VT, CmpOp, DAG.getConstant(Low, VT));
1355 Cond = DAG.getSetCC(dl, MVT::i1, SUB,
1356 DAG.getConstant(High-Low, VT), ISD::SETULE);
1360 // Update successor info
1361 CurMBB->addSuccessor(CB.TrueBB);
1362 CurMBB->addSuccessor(CB.FalseBB);
1364 // Set NextBlock to be the MBB immediately after the current one, if any.
1365 // This is used to avoid emitting unnecessary branches to the next block.
1366 MachineBasicBlock *NextBlock = 0;
1367 MachineFunction::iterator BBI = CurMBB;
1368 if (++BBI != CurMBB->getParent()->end())
1371 // If the lhs block is the next block, invert the condition so that we can
1372 // fall through to the lhs instead of the rhs block.
1373 if (CB.TrueBB == NextBlock) {
1374 std::swap(CB.TrueBB, CB.FalseBB);
1375 SDValue True = DAG.getConstant(1, Cond.getValueType());
1376 Cond = DAG.getNode(ISD::XOR, dl, Cond.getValueType(), Cond, True);
1378 SDValue BrCond = DAG.getNode(ISD::BRCOND, dl,
1379 MVT::Other, getControlRoot(), Cond,
1380 DAG.getBasicBlock(CB.TrueBB));
1382 // If the branch was constant folded, fix up the CFG.
1383 if (BrCond.getOpcode() == ISD::BR) {
1384 CurMBB->removeSuccessor(CB.FalseBB);
1385 DAG.setRoot(BrCond);
1387 // Otherwise, go ahead and insert the false branch.
1388 if (BrCond == getControlRoot())
1389 CurMBB->removeSuccessor(CB.TrueBB);
1391 if (CB.FalseBB == NextBlock)
1392 DAG.setRoot(BrCond);
1394 DAG.setRoot(DAG.getNode(ISD::BR, dl, MVT::Other, BrCond,
1395 DAG.getBasicBlock(CB.FalseBB)));
1399 /// visitJumpTable - Emit JumpTable node in the current MBB
1400 void SelectionDAGLowering::visitJumpTable(JumpTable &JT) {
1401 // Emit the code for the jump table
1402 assert(JT.Reg != -1U && "Should lower JT Header first!");
1403 MVT PTy = TLI.getPointerTy();
1404 SDValue Index = DAG.getCopyFromReg(getControlRoot(), getCurDebugLoc(),
1406 SDValue Table = DAG.getJumpTable(JT.JTI, PTy);
1407 DAG.setRoot(DAG.getNode(ISD::BR_JT, getCurDebugLoc(),
1408 MVT::Other, Index.getValue(1),
1412 /// visitJumpTableHeader - This function emits necessary code to produce index
1413 /// in the JumpTable from switch case.
1414 void SelectionDAGLowering::visitJumpTableHeader(JumpTable &JT,
1415 JumpTableHeader &JTH) {
1416 // Subtract the lowest switch case value from the value being switched on and
1417 // conditional branch to default mbb if the result is greater than the
1418 // difference between smallest and largest cases.
1419 SDValue SwitchOp = getValue(JTH.SValue);
1420 MVT VT = SwitchOp.getValueType();
1421 SDValue SUB = DAG.getNode(ISD::SUB, getCurDebugLoc(), VT, SwitchOp,
1422 DAG.getConstant(JTH.First, VT));
1424 // The SDNode we just created, which holds the value being switched on minus
1425 // the the smallest case value, needs to be copied to a virtual register so it
1426 // can be used as an index into the jump table in a subsequent basic block.
1427 // This value may be smaller or larger than the target's pointer type, and
1428 // therefore require extension or truncating.
1429 if (VT.bitsGT(TLI.getPointerTy()))
1430 SwitchOp = DAG.getNode(ISD::TRUNCATE, getCurDebugLoc(),
1431 TLI.getPointerTy(), SUB);
1433 SwitchOp = DAG.getNode(ISD::ZERO_EXTEND, getCurDebugLoc(),
1434 TLI.getPointerTy(), SUB);
1436 unsigned JumpTableReg = FuncInfo.MakeReg(TLI.getPointerTy());
1437 SDValue CopyTo = DAG.getCopyToReg(getControlRoot(), getCurDebugLoc(),
1438 JumpTableReg, SwitchOp);
1439 JT.Reg = JumpTableReg;
1441 // Emit the range check for the jump table, and branch to the default block
1442 // for the switch statement if the value being switched on exceeds the largest
1443 // case in the switch.
1444 SDValue CMP = DAG.getSetCC(getCurDebugLoc(),
1445 TLI.getSetCCResultType(SUB.getValueType()), SUB,
1446 DAG.getConstant(JTH.Last-JTH.First,VT),
1449 // Set NextBlock to be the MBB immediately after the current one, if any.
1450 // This is used to avoid emitting unnecessary branches to the next block.
1451 MachineBasicBlock *NextBlock = 0;
1452 MachineFunction::iterator BBI = CurMBB;
1453 if (++BBI != CurMBB->getParent()->end())
1456 SDValue BrCond = DAG.getNode(ISD::BRCOND, getCurDebugLoc(),
1457 MVT::Other, CopyTo, CMP,
1458 DAG.getBasicBlock(JT.Default));
1460 if (JT.MBB == NextBlock)
1461 DAG.setRoot(BrCond);
1463 DAG.setRoot(DAG.getNode(ISD::BR, getCurDebugLoc(), MVT::Other, BrCond,
1464 DAG.getBasicBlock(JT.MBB)));
1467 /// visitBitTestHeader - This function emits necessary code to produce value
1468 /// suitable for "bit tests"
1469 void SelectionDAGLowering::visitBitTestHeader(BitTestBlock &B) {
1470 // Subtract the minimum value
1471 SDValue SwitchOp = getValue(B.SValue);
1472 MVT VT = SwitchOp.getValueType();
1473 SDValue SUB = DAG.getNode(ISD::SUB, getCurDebugLoc(), VT, SwitchOp,
1474 DAG.getConstant(B.First, VT));
1477 SDValue RangeCmp = DAG.getSetCC(getCurDebugLoc(),
1478 TLI.getSetCCResultType(SUB.getValueType()),
1479 SUB, DAG.getConstant(B.Range, VT),
1483 if (VT.bitsGT(TLI.getPointerTy()))
1484 ShiftOp = DAG.getNode(ISD::TRUNCATE, getCurDebugLoc(),
1485 TLI.getPointerTy(), SUB);
1487 ShiftOp = DAG.getNode(ISD::ZERO_EXTEND, getCurDebugLoc(),
1488 TLI.getPointerTy(), SUB);
1490 B.Reg = FuncInfo.MakeReg(TLI.getPointerTy());
1491 SDValue CopyTo = DAG.getCopyToReg(getControlRoot(), getCurDebugLoc(),
1494 // Set NextBlock to be the MBB immediately after the current one, if any.
1495 // This is used to avoid emitting unnecessary branches to the next block.
1496 MachineBasicBlock *NextBlock = 0;
1497 MachineFunction::iterator BBI = CurMBB;
1498 if (++BBI != CurMBB->getParent()->end())
1501 MachineBasicBlock* MBB = B.Cases[0].ThisBB;
1503 CurMBB->addSuccessor(B.Default);
1504 CurMBB->addSuccessor(MBB);
1506 SDValue BrRange = DAG.getNode(ISD::BRCOND, getCurDebugLoc(),
1507 MVT::Other, CopyTo, RangeCmp,
1508 DAG.getBasicBlock(B.Default));
1510 if (MBB == NextBlock)
1511 DAG.setRoot(BrRange);
1513 DAG.setRoot(DAG.getNode(ISD::BR, getCurDebugLoc(), MVT::Other, CopyTo,
1514 DAG.getBasicBlock(MBB)));
1517 /// visitBitTestCase - this function produces one "bit test"
1518 void SelectionDAGLowering::visitBitTestCase(MachineBasicBlock* NextMBB,
1521 // Make desired shift
1522 SDValue ShiftOp = DAG.getCopyFromReg(getControlRoot(), getCurDebugLoc(), Reg,
1523 TLI.getPointerTy());
1524 SDValue SwitchVal = DAG.getNode(ISD::SHL, getCurDebugLoc(),
1526 DAG.getConstant(1, TLI.getPointerTy()),
1529 // Emit bit tests and jumps
1530 SDValue AndOp = DAG.getNode(ISD::AND, getCurDebugLoc(),
1531 TLI.getPointerTy(), SwitchVal,
1532 DAG.getConstant(B.Mask, TLI.getPointerTy()));
1533 SDValue AndCmp = DAG.getSetCC(getCurDebugLoc(),
1534 TLI.getSetCCResultType(AndOp.getValueType()),
1535 AndOp, DAG.getConstant(0, TLI.getPointerTy()),
1538 CurMBB->addSuccessor(B.TargetBB);
1539 CurMBB->addSuccessor(NextMBB);
1541 SDValue BrAnd = DAG.getNode(ISD::BRCOND, getCurDebugLoc(),
1542 MVT::Other, getControlRoot(),
1543 AndCmp, DAG.getBasicBlock(B.TargetBB));
1545 // Set NextBlock to be the MBB immediately after the current one, if any.
1546 // This is used to avoid emitting unnecessary branches to the next block.
1547 MachineBasicBlock *NextBlock = 0;
1548 MachineFunction::iterator BBI = CurMBB;
1549 if (++BBI != CurMBB->getParent()->end())
1552 if (NextMBB == NextBlock)
1555 DAG.setRoot(DAG.getNode(ISD::BR, getCurDebugLoc(), MVT::Other, BrAnd,
1556 DAG.getBasicBlock(NextMBB)));
1559 void SelectionDAGLowering::visitInvoke(InvokeInst &I) {
1560 // Retrieve successors.
1561 MachineBasicBlock *Return = FuncInfo.MBBMap[I.getSuccessor(0)];
1562 MachineBasicBlock *LandingPad = FuncInfo.MBBMap[I.getSuccessor(1)];
1564 const Value *Callee(I.getCalledValue());
1565 if (isa<InlineAsm>(Callee))
1568 LowerCallTo(&I, getValue(Callee), false, LandingPad);
1570 // If the value of the invoke is used outside of its defining block, make it
1571 // available as a virtual register.
1572 if (!I.use_empty()) {
1573 DenseMap<const Value*, unsigned>::iterator VMI = FuncInfo.ValueMap.find(&I);
1574 if (VMI != FuncInfo.ValueMap.end())
1575 CopyValueToVirtualRegister(&I, VMI->second);
1578 // Update successor info
1579 CurMBB->addSuccessor(Return);
1580 CurMBB->addSuccessor(LandingPad);
1582 // Drop into normal successor.
1583 DAG.setRoot(DAG.getNode(ISD::BR, getCurDebugLoc(),
1584 MVT::Other, getControlRoot(),
1585 DAG.getBasicBlock(Return)));
1588 void SelectionDAGLowering::visitUnwind(UnwindInst &I) {
1591 /// handleSmallSwitchCaseRange - Emit a series of specific tests (suitable for
1592 /// small case ranges).
1593 bool SelectionDAGLowering::handleSmallSwitchRange(CaseRec& CR,
1594 CaseRecVector& WorkList,
1596 MachineBasicBlock* Default) {
1597 Case& BackCase = *(CR.Range.second-1);
1599 // Size is the number of Cases represented by this range.
1600 size_t Size = CR.Range.second - CR.Range.first;
1604 // Get the MachineFunction which holds the current MBB. This is used when
1605 // inserting any additional MBBs necessary to represent the switch.
1606 MachineFunction *CurMF = CurMBB->getParent();
1608 // Figure out which block is immediately after the current one.
1609 MachineBasicBlock *NextBlock = 0;
1610 MachineFunction::iterator BBI = CR.CaseBB;
1612 if (++BBI != CurMBB->getParent()->end())
1615 // TODO: If any two of the cases has the same destination, and if one value
1616 // is the same as the other, but has one bit unset that the other has set,
1617 // use bit manipulation to do two compares at once. For example:
1618 // "if (X == 6 || X == 4)" -> "if ((X|2) == 6)"
1620 // Rearrange the case blocks so that the last one falls through if possible.
1621 if (NextBlock && Default != NextBlock && BackCase.BB != NextBlock) {
1622 // The last case block won't fall through into 'NextBlock' if we emit the
1623 // branches in this order. See if rearranging a case value would help.
1624 for (CaseItr I = CR.Range.first, E = CR.Range.second-1; I != E; ++I) {
1625 if (I->BB == NextBlock) {
1626 std::swap(*I, BackCase);
1632 // Create a CaseBlock record representing a conditional branch to
1633 // the Case's target mbb if the value being switched on SV is equal
1635 MachineBasicBlock *CurBlock = CR.CaseBB;
1636 for (CaseItr I = CR.Range.first, E = CR.Range.second; I != E; ++I) {
1637 MachineBasicBlock *FallThrough;
1639 FallThrough = CurMF->CreateMachineBasicBlock(CurBlock->getBasicBlock());
1640 CurMF->insert(BBI, FallThrough);
1642 // Put SV in a virtual register to make it available from the new blocks.
1643 ExportFromCurrentBlock(SV);
1645 // If the last case doesn't match, go to the default block.
1646 FallThrough = Default;
1649 Value *RHS, *LHS, *MHS;
1651 if (I->High == I->Low) {
1652 // This is just small small case range :) containing exactly 1 case
1654 LHS = SV; RHS = I->High; MHS = NULL;
1657 LHS = I->Low; MHS = SV; RHS = I->High;
1659 CaseBlock CB(CC, LHS, RHS, MHS, I->BB, FallThrough, CurBlock);
1661 // If emitting the first comparison, just call visitSwitchCase to emit the
1662 // code into the current block. Otherwise, push the CaseBlock onto the
1663 // vector to be later processed by SDISel, and insert the node's MBB
1664 // before the next MBB.
1665 if (CurBlock == CurMBB)
1666 visitSwitchCase(CB);
1668 SwitchCases.push_back(CB);
1670 CurBlock = FallThrough;
1676 static inline bool areJTsAllowed(const TargetLowering &TLI) {
1677 return !DisableJumpTables &&
1678 (TLI.isOperationLegalOrCustom(ISD::BR_JT, MVT::Other) ||
1679 TLI.isOperationLegalOrCustom(ISD::BRIND, MVT::Other));
1682 static APInt ComputeRange(const APInt &First, const APInt &Last) {
1683 APInt LastExt(Last), FirstExt(First);
1684 uint32_t BitWidth = std::max(Last.getBitWidth(), First.getBitWidth()) + 1;
1685 LastExt.sext(BitWidth); FirstExt.sext(BitWidth);
1686 return (LastExt - FirstExt + 1ULL);
1689 /// handleJTSwitchCase - Emit jumptable for current switch case range
1690 bool SelectionDAGLowering::handleJTSwitchCase(CaseRec& CR,
1691 CaseRecVector& WorkList,
1693 MachineBasicBlock* Default) {
1694 Case& FrontCase = *CR.Range.first;
1695 Case& BackCase = *(CR.Range.second-1);
1697 const APInt& First = cast<ConstantInt>(FrontCase.Low)->getValue();
1698 const APInt& Last = cast<ConstantInt>(BackCase.High)->getValue();
1701 for (CaseItr I = CR.Range.first, E = CR.Range.second;
1705 if (!areJTsAllowed(TLI) || TSize <= 3)
1708 APInt Range = ComputeRange(First, Last);
1709 double Density = (double)TSize / Range.roundToDouble();
1713 DEBUG(errs() << "Lowering jump table\n"
1714 << "First entry: " << First << ". Last entry: " << Last << '\n'
1715 << "Range: " << Range
1716 << "Size: " << TSize << ". Density: " << Density << "\n\n");
1718 // Get the MachineFunction which holds the current MBB. This is used when
1719 // inserting any additional MBBs necessary to represent the switch.
1720 MachineFunction *CurMF = CurMBB->getParent();
1722 // Figure out which block is immediately after the current one.
1723 MachineBasicBlock *NextBlock = 0;
1724 MachineFunction::iterator BBI = CR.CaseBB;
1726 if (++BBI != CurMBB->getParent()->end())
1729 const BasicBlock *LLVMBB = CR.CaseBB->getBasicBlock();
1731 // Create a new basic block to hold the code for loading the address
1732 // of the jump table, and jumping to it. Update successor information;
1733 // we will either branch to the default case for the switch, or the jump
1735 MachineBasicBlock *JumpTableBB = CurMF->CreateMachineBasicBlock(LLVMBB);
1736 CurMF->insert(BBI, JumpTableBB);
1737 CR.CaseBB->addSuccessor(Default);
1738 CR.CaseBB->addSuccessor(JumpTableBB);
1740 // Build a vector of destination BBs, corresponding to each target
1741 // of the jump table. If the value of the jump table slot corresponds to
1742 // a case statement, push the case's BB onto the vector, otherwise, push
1744 std::vector<MachineBasicBlock*> DestBBs;
1746 for (CaseItr I = CR.Range.first, E = CR.Range.second; I != E; ++TEI) {
1747 const APInt& Low = cast<ConstantInt>(I->Low)->getValue();
1748 const APInt& High = cast<ConstantInt>(I->High)->getValue();
1750 if (Low.sle(TEI) && TEI.sle(High)) {
1751 DestBBs.push_back(I->BB);
1755 DestBBs.push_back(Default);
1759 // Update successor info. Add one edge to each unique successor.
1760 BitVector SuccsHandled(CR.CaseBB->getParent()->getNumBlockIDs());
1761 for (std::vector<MachineBasicBlock*>::iterator I = DestBBs.begin(),
1762 E = DestBBs.end(); I != E; ++I) {
1763 if (!SuccsHandled[(*I)->getNumber()]) {
1764 SuccsHandled[(*I)->getNumber()] = true;
1765 JumpTableBB->addSuccessor(*I);
1769 // Create a jump table index for this jump table, or return an existing
1771 unsigned JTI = CurMF->getJumpTableInfo()->getJumpTableIndex(DestBBs);
1773 // Set the jump table information so that we can codegen it as a second
1774 // MachineBasicBlock
1775 JumpTable JT(-1U, JTI, JumpTableBB, Default);
1776 JumpTableHeader JTH(First, Last, SV, CR.CaseBB, (CR.CaseBB == CurMBB));
1777 if (CR.CaseBB == CurMBB)
1778 visitJumpTableHeader(JT, JTH);
1780 JTCases.push_back(JumpTableBlock(JTH, JT));
1785 /// handleBTSplitSwitchCase - emit comparison and split binary search tree into
1787 bool SelectionDAGLowering::handleBTSplitSwitchCase(CaseRec& CR,
1788 CaseRecVector& WorkList,
1790 MachineBasicBlock* Default) {
1791 // Get the MachineFunction which holds the current MBB. This is used when
1792 // inserting any additional MBBs necessary to represent the switch.
1793 MachineFunction *CurMF = CurMBB->getParent();
1795 // Figure out which block is immediately after the current one.
1796 MachineBasicBlock *NextBlock = 0;
1797 MachineFunction::iterator BBI = CR.CaseBB;
1799 if (++BBI != CurMBB->getParent()->end())
1802 Case& FrontCase = *CR.Range.first;
1803 Case& BackCase = *(CR.Range.second-1);
1804 const BasicBlock *LLVMBB = CR.CaseBB->getBasicBlock();
1806 // Size is the number of Cases represented by this range.
1807 unsigned Size = CR.Range.second - CR.Range.first;
1809 const APInt& First = cast<ConstantInt>(FrontCase.Low)->getValue();
1810 const APInt& Last = cast<ConstantInt>(BackCase.High)->getValue();
1812 CaseItr Pivot = CR.Range.first + Size/2;
1814 // Select optimal pivot, maximizing sum density of LHS and RHS. This will
1815 // (heuristically) allow us to emit JumpTable's later.
1817 for (CaseItr I = CR.Range.first, E = CR.Range.second;
1821 size_t LSize = FrontCase.size();
1822 size_t RSize = TSize-LSize;
1823 DEBUG(errs() << "Selecting best pivot: \n"
1824 << "First: " << First << ", Last: " << Last <<'\n'
1825 << "LSize: " << LSize << ", RSize: " << RSize << '\n');
1826 for (CaseItr I = CR.Range.first, J=I+1, E = CR.Range.second;
1828 const APInt& LEnd = cast<ConstantInt>(I->High)->getValue();
1829 const APInt& RBegin = cast<ConstantInt>(J->Low)->getValue();
1830 APInt Range = ComputeRange(LEnd, RBegin);
1831 assert((Range - 2ULL).isNonNegative() &&
1832 "Invalid case distance");
1833 double LDensity = (double)LSize / (LEnd - First + 1ULL).roundToDouble();
1834 double RDensity = (double)RSize / (Last - RBegin + 1ULL).roundToDouble();
1835 double Metric = Range.logBase2()*(LDensity+RDensity);
1836 // Should always split in some non-trivial place
1837 DEBUG(errs() <<"=>Step\n"
1838 << "LEnd: " << LEnd << ", RBegin: " << RBegin << '\n'
1839 << "LDensity: " << LDensity
1840 << ", RDensity: " << RDensity << '\n'
1841 << "Metric: " << Metric << '\n');
1842 if (FMetric < Metric) {
1845 DEBUG(errs() << "Current metric set to: " << FMetric << '\n');
1851 if (areJTsAllowed(TLI)) {
1852 // If our case is dense we *really* should handle it earlier!
1853 assert((FMetric > 0) && "Should handle dense range earlier!");
1855 Pivot = CR.Range.first + Size/2;
1858 CaseRange LHSR(CR.Range.first, Pivot);
1859 CaseRange RHSR(Pivot, CR.Range.second);
1860 Constant *C = Pivot->Low;
1861 MachineBasicBlock *FalseBB = 0, *TrueBB = 0;
1863 // We know that we branch to the LHS if the Value being switched on is
1864 // less than the Pivot value, C. We use this to optimize our binary
1865 // tree a bit, by recognizing that if SV is greater than or equal to the
1866 // LHS's Case Value, and that Case Value is exactly one less than the
1867 // Pivot's Value, then we can branch directly to the LHS's Target,
1868 // rather than creating a leaf node for it.
1869 if ((LHSR.second - LHSR.first) == 1 &&
1870 LHSR.first->High == CR.GE &&
1871 cast<ConstantInt>(C)->getValue() ==
1872 (cast<ConstantInt>(CR.GE)->getValue() + 1LL)) {
1873 TrueBB = LHSR.first->BB;
1875 TrueBB = CurMF->CreateMachineBasicBlock(LLVMBB);
1876 CurMF->insert(BBI, TrueBB);
1877 WorkList.push_back(CaseRec(TrueBB, C, CR.GE, LHSR));
1879 // Put SV in a virtual register to make it available from the new blocks.
1880 ExportFromCurrentBlock(SV);
1883 // Similar to the optimization above, if the Value being switched on is
1884 // known to be less than the Constant CR.LT, and the current Case Value
1885 // is CR.LT - 1, then we can branch directly to the target block for
1886 // the current Case Value, rather than emitting a RHS leaf node for it.
1887 if ((RHSR.second - RHSR.first) == 1 && CR.LT &&
1888 cast<ConstantInt>(RHSR.first->Low)->getValue() ==
1889 (cast<ConstantInt>(CR.LT)->getValue() - 1LL)) {
1890 FalseBB = RHSR.first->BB;
1892 FalseBB = CurMF->CreateMachineBasicBlock(LLVMBB);
1893 CurMF->insert(BBI, FalseBB);
1894 WorkList.push_back(CaseRec(FalseBB,CR.LT,C,RHSR));
1896 // Put SV in a virtual register to make it available from the new blocks.
1897 ExportFromCurrentBlock(SV);
1900 // Create a CaseBlock record representing a conditional branch to
1901 // the LHS node if the value being switched on SV is less than C.
1902 // Otherwise, branch to LHS.
1903 CaseBlock CB(ISD::SETLT, SV, C, NULL, TrueBB, FalseBB, CR.CaseBB);
1905 if (CR.CaseBB == CurMBB)
1906 visitSwitchCase(CB);
1908 SwitchCases.push_back(CB);
1913 /// handleBitTestsSwitchCase - if current case range has few destination and
1914 /// range span less, than machine word bitwidth, encode case range into series
1915 /// of masks and emit bit tests with these masks.
1916 bool SelectionDAGLowering::handleBitTestsSwitchCase(CaseRec& CR,
1917 CaseRecVector& WorkList,
1919 MachineBasicBlock* Default){
1920 unsigned IntPtrBits = TLI.getPointerTy().getSizeInBits();
1922 Case& FrontCase = *CR.Range.first;
1923 Case& BackCase = *(CR.Range.second-1);
1925 // Get the MachineFunction which holds the current MBB. This is used when
1926 // inserting any additional MBBs necessary to represent the switch.
1927 MachineFunction *CurMF = CurMBB->getParent();
1930 for (CaseItr I = CR.Range.first, E = CR.Range.second;
1932 // Single case counts one, case range - two.
1933 numCmps += (I->Low == I->High ? 1 : 2);
1936 // Count unique destinations
1937 SmallSet<MachineBasicBlock*, 4> Dests;
1938 for (CaseItr I = CR.Range.first, E = CR.Range.second; I!=E; ++I) {
1939 Dests.insert(I->BB);
1940 if (Dests.size() > 3)
1941 // Don't bother the code below, if there are too much unique destinations
1944 DEBUG(errs() << "Total number of unique destinations: " << Dests.size() << '\n'
1945 << "Total number of comparisons: " << numCmps << '\n');
1947 // Compute span of values.
1948 const APInt& minValue = cast<ConstantInt>(FrontCase.Low)->getValue();
1949 const APInt& maxValue = cast<ConstantInt>(BackCase.High)->getValue();
1950 APInt cmpRange = maxValue - minValue;
1952 DEBUG(errs() << "Compare range: " << cmpRange << '\n'
1953 << "Low bound: " << minValue << '\n'
1954 << "High bound: " << maxValue << '\n');
1956 if (cmpRange.uge(APInt(cmpRange.getBitWidth(), IntPtrBits)) ||
1957 (!(Dests.size() == 1 && numCmps >= 3) &&
1958 !(Dests.size() == 2 && numCmps >= 5) &&
1959 !(Dests.size() >= 3 && numCmps >= 6)))
1962 DEBUG(errs() << "Emitting bit tests\n");
1963 APInt lowBound = APInt::getNullValue(cmpRange.getBitWidth());
1965 // Optimize the case where all the case values fit in a
1966 // word without having to subtract minValue. In this case,
1967 // we can optimize away the subtraction.
1968 if (minValue.isNonNegative() &&
1969 maxValue.slt(APInt(maxValue.getBitWidth(), IntPtrBits))) {
1970 cmpRange = maxValue;
1972 lowBound = minValue;
1975 CaseBitsVector CasesBits;
1976 unsigned i, count = 0;
1978 for (CaseItr I = CR.Range.first, E = CR.Range.second; I!=E; ++I) {
1979 MachineBasicBlock* Dest = I->BB;
1980 for (i = 0; i < count; ++i)
1981 if (Dest == CasesBits[i].BB)
1985 assert((count < 3) && "Too much destinations to test!");
1986 CasesBits.push_back(CaseBits(0, Dest, 0));
1990 const APInt& lowValue = cast<ConstantInt>(I->Low)->getValue();
1991 const APInt& highValue = cast<ConstantInt>(I->High)->getValue();
1993 uint64_t lo = (lowValue - lowBound).getZExtValue();
1994 uint64_t hi = (highValue - lowBound).getZExtValue();
1996 for (uint64_t j = lo; j <= hi; j++) {
1997 CasesBits[i].Mask |= 1ULL << j;
1998 CasesBits[i].Bits++;
2002 std::sort(CasesBits.begin(), CasesBits.end(), CaseBitsCmp());
2006 // Figure out which block is immediately after the current one.
2007 MachineFunction::iterator BBI = CR.CaseBB;
2010 const BasicBlock *LLVMBB = CR.CaseBB->getBasicBlock();
2012 DEBUG(errs() << "Cases:\n");
2013 for (unsigned i = 0, e = CasesBits.size(); i!=e; ++i) {
2014 DEBUG(errs() << "Mask: " << CasesBits[i].Mask
2015 << ", Bits: " << CasesBits[i].Bits
2016 << ", BB: " << CasesBits[i].BB << '\n');
2018 MachineBasicBlock *CaseBB = CurMF->CreateMachineBasicBlock(LLVMBB);
2019 CurMF->insert(BBI, CaseBB);
2020 BTC.push_back(BitTestCase(CasesBits[i].Mask,
2024 // Put SV in a virtual register to make it available from the new blocks.
2025 ExportFromCurrentBlock(SV);
2028 BitTestBlock BTB(lowBound, cmpRange, SV,
2029 -1U, (CR.CaseBB == CurMBB),
2030 CR.CaseBB, Default, BTC);
2032 if (CR.CaseBB == CurMBB)
2033 visitBitTestHeader(BTB);
2035 BitTestCases.push_back(BTB);
2041 /// Clusterify - Transform simple list of Cases into list of CaseRange's
2042 size_t SelectionDAGLowering::Clusterify(CaseVector& Cases,
2043 const SwitchInst& SI) {
2046 // Start with "simple" cases
2047 for (size_t i = 1; i < SI.getNumSuccessors(); ++i) {
2048 MachineBasicBlock *SMBB = FuncInfo.MBBMap[SI.getSuccessor(i)];
2049 Cases.push_back(Case(SI.getSuccessorValue(i),
2050 SI.getSuccessorValue(i),
2053 std::sort(Cases.begin(), Cases.end(), CaseCmp());
2055 // Merge case into clusters
2056 if (Cases.size() >= 2)
2057 // Must recompute end() each iteration because it may be
2058 // invalidated by erase if we hold on to it
2059 for (CaseItr I = Cases.begin(), J = ++(Cases.begin()); J != Cases.end(); ) {
2060 const APInt& nextValue = cast<ConstantInt>(J->Low)->getValue();
2061 const APInt& currentValue = cast<ConstantInt>(I->High)->getValue();
2062 MachineBasicBlock* nextBB = J->BB;
2063 MachineBasicBlock* currentBB = I->BB;
2065 // If the two neighboring cases go to the same destination, merge them
2066 // into a single case.
2067 if ((nextValue - currentValue == 1) && (currentBB == nextBB)) {
2075 for (CaseItr I=Cases.begin(), E=Cases.end(); I!=E; ++I, ++numCmps) {
2076 if (I->Low != I->High)
2077 // A range counts double, since it requires two compares.
2084 void SelectionDAGLowering::visitSwitch(SwitchInst &SI) {
2085 // Figure out which block is immediately after the current one.
2086 MachineBasicBlock *NextBlock = 0;
2087 MachineFunction::iterator BBI = CurMBB;
2089 MachineBasicBlock *Default = FuncInfo.MBBMap[SI.getDefaultDest()];
2091 // If there is only the default destination, branch to it if it is not the
2092 // next basic block. Otherwise, just fall through.
2093 if (SI.getNumOperands() == 2) {
2094 // Update machine-CFG edges.
2096 // If this is not a fall-through branch, emit the branch.
2097 CurMBB->addSuccessor(Default);
2098 if (Default != NextBlock)
2099 DAG.setRoot(DAG.getNode(ISD::BR, getCurDebugLoc(),
2100 MVT::Other, getControlRoot(),
2101 DAG.getBasicBlock(Default)));
2105 // If there are any non-default case statements, create a vector of Cases
2106 // representing each one, and sort the vector so that we can efficiently
2107 // create a binary search tree from them.
2109 size_t numCmps = Clusterify(Cases, SI);
2110 DEBUG(errs() << "Clusterify finished. Total clusters: " << Cases.size()
2111 << ". Total compares: " << numCmps << '\n');
2114 // Get the Value to be switched on and default basic blocks, which will be
2115 // inserted into CaseBlock records, representing basic blocks in the binary
2117 Value *SV = SI.getOperand(0);
2119 // Push the initial CaseRec onto the worklist
2120 CaseRecVector WorkList;
2121 WorkList.push_back(CaseRec(CurMBB,0,0,CaseRange(Cases.begin(),Cases.end())));
2123 while (!WorkList.empty()) {
2124 // Grab a record representing a case range to process off the worklist
2125 CaseRec CR = WorkList.back();
2126 WorkList.pop_back();
2128 if (handleBitTestsSwitchCase(CR, WorkList, SV, Default))
2131 // If the range has few cases (two or less) emit a series of specific
2133 if (handleSmallSwitchRange(CR, WorkList, SV, Default))
2136 // If the switch has more than 5 blocks, and at least 40% dense, and the
2137 // target supports indirect branches, then emit a jump table rather than
2138 // lowering the switch to a binary tree of conditional branches.
2139 if (handleJTSwitchCase(CR, WorkList, SV, Default))
2142 // Emit binary tree. We need to pick a pivot, and push left and right ranges
2143 // onto the worklist. Leafs are handled via handleSmallSwitchRange() call.
2144 handleBTSplitSwitchCase(CR, WorkList, SV, Default);
2149 void SelectionDAGLowering::visitSub(User &I) {
2150 // -0.0 - X --> fneg
2151 const Type *Ty = I.getType();
2152 if (isa<VectorType>(Ty)) {
2153 if (ConstantVector *CV = dyn_cast<ConstantVector>(I.getOperand(0))) {
2154 const VectorType *DestTy = cast<VectorType>(I.getType());
2155 const Type *ElTy = DestTy->getElementType();
2156 if (ElTy->isFloatingPoint()) {
2157 unsigned VL = DestTy->getNumElements();
2158 std::vector<Constant*> NZ(VL, ConstantFP::getNegativeZero(ElTy));
2159 Constant *CNZ = ConstantVector::get(&NZ[0], NZ.size());
2161 SDValue Op2 = getValue(I.getOperand(1));
2162 setValue(&I, DAG.getNode(ISD::FNEG, getCurDebugLoc(),
2163 Op2.getValueType(), Op2));
2169 if (Ty->isFloatingPoint()) {
2170 if (ConstantFP *CFP = dyn_cast<ConstantFP>(I.getOperand(0)))
2171 if (CFP->isExactlyValue(ConstantFP::getNegativeZero(Ty)->getValueAPF())) {
2172 SDValue Op2 = getValue(I.getOperand(1));
2173 setValue(&I, DAG.getNode(ISD::FNEG, getCurDebugLoc(),
2174 Op2.getValueType(), Op2));
2179 visitBinary(I, Ty->isFPOrFPVector() ? ISD::FSUB : ISD::SUB);
2182 void SelectionDAGLowering::visitBinary(User &I, unsigned OpCode) {
2183 SDValue Op1 = getValue(I.getOperand(0));
2184 SDValue Op2 = getValue(I.getOperand(1));
2186 setValue(&I, DAG.getNode(OpCode, getCurDebugLoc(),
2187 Op1.getValueType(), Op1, Op2));
2190 void SelectionDAGLowering::visitShift(User &I, unsigned Opcode) {
2191 SDValue Op1 = getValue(I.getOperand(0));
2192 SDValue Op2 = getValue(I.getOperand(1));
2193 if (!isa<VectorType>(I.getType()) &&
2194 Op2.getValueType() != TLI.getShiftAmountTy()) {
2195 // If the operand is smaller than the shift count type, promote it.
2196 if (TLI.getShiftAmountTy().bitsGT(Op2.getValueType()))
2197 Op2 = DAG.getNode(ISD::ANY_EXTEND, getCurDebugLoc(),
2198 TLI.getShiftAmountTy(), Op2);
2199 // If the operand is larger than the shift count type but the shift
2200 // count type has enough bits to represent any shift value, truncate
2201 // it now. This is a common case and it exposes the truncate to
2202 // optimization early.
2203 else if (TLI.getShiftAmountTy().getSizeInBits() >=
2204 Log2_32_Ceil(Op2.getValueType().getSizeInBits()))
2205 Op2 = DAG.getNode(ISD::TRUNCATE, getCurDebugLoc(),
2206 TLI.getShiftAmountTy(), Op2);
2207 // Otherwise we'll need to temporarily settle for some other
2208 // convenient type; type legalization will make adjustments as
2210 else if (TLI.getPointerTy().bitsLT(Op2.getValueType()))
2211 Op2 = DAG.getNode(ISD::TRUNCATE, getCurDebugLoc(),
2212 TLI.getPointerTy(), Op2);
2213 else if (TLI.getPointerTy().bitsGT(Op2.getValueType()))
2214 Op2 = DAG.getNode(ISD::ANY_EXTEND, getCurDebugLoc(),
2215 TLI.getPointerTy(), Op2);
2218 setValue(&I, DAG.getNode(Opcode, getCurDebugLoc(),
2219 Op1.getValueType(), Op1, Op2));
2222 void SelectionDAGLowering::visitICmp(User &I) {
2223 ICmpInst::Predicate predicate = ICmpInst::BAD_ICMP_PREDICATE;
2224 if (ICmpInst *IC = dyn_cast<ICmpInst>(&I))
2225 predicate = IC->getPredicate();
2226 else if (ConstantExpr *IC = dyn_cast<ConstantExpr>(&I))
2227 predicate = ICmpInst::Predicate(IC->getPredicate());
2228 SDValue Op1 = getValue(I.getOperand(0));
2229 SDValue Op2 = getValue(I.getOperand(1));
2230 ISD::CondCode Opcode = getICmpCondCode(predicate);
2231 setValue(&I, DAG.getSetCC(getCurDebugLoc(),MVT::i1, Op1, Op2, Opcode));
2234 void SelectionDAGLowering::visitFCmp(User &I) {
2235 FCmpInst::Predicate predicate = FCmpInst::BAD_FCMP_PREDICATE;
2236 if (FCmpInst *FC = dyn_cast<FCmpInst>(&I))
2237 predicate = FC->getPredicate();
2238 else if (ConstantExpr *FC = dyn_cast<ConstantExpr>(&I))
2239 predicate = FCmpInst::Predicate(FC->getPredicate());
2240 SDValue Op1 = getValue(I.getOperand(0));
2241 SDValue Op2 = getValue(I.getOperand(1));
2242 ISD::CondCode Condition = getFCmpCondCode(predicate);
2243 setValue(&I, DAG.getSetCC(getCurDebugLoc(), MVT::i1, Op1, Op2, Condition));
2246 void SelectionDAGLowering::visitVICmp(User &I) {
2247 ICmpInst::Predicate predicate = ICmpInst::BAD_ICMP_PREDICATE;
2248 if (VICmpInst *IC = dyn_cast<VICmpInst>(&I))
2249 predicate = IC->getPredicate();
2250 else if (ConstantExpr *IC = dyn_cast<ConstantExpr>(&I))
2251 predicate = ICmpInst::Predicate(IC->getPredicate());
2252 SDValue Op1 = getValue(I.getOperand(0));
2253 SDValue Op2 = getValue(I.getOperand(1));
2254 ISD::CondCode Opcode = getICmpCondCode(predicate);
2255 setValue(&I, DAG.getVSetCC(getCurDebugLoc(), Op1.getValueType(),
2259 void SelectionDAGLowering::visitVFCmp(User &I) {
2260 FCmpInst::Predicate predicate = FCmpInst::BAD_FCMP_PREDICATE;
2261 if (VFCmpInst *FC = dyn_cast<VFCmpInst>(&I))
2262 predicate = FC->getPredicate();
2263 else if (ConstantExpr *FC = dyn_cast<ConstantExpr>(&I))
2264 predicate = FCmpInst::Predicate(FC->getPredicate());
2265 SDValue Op1 = getValue(I.getOperand(0));
2266 SDValue Op2 = getValue(I.getOperand(1));
2267 ISD::CondCode Condition = getFCmpCondCode(predicate);
2268 MVT DestVT = TLI.getValueType(I.getType());
2270 setValue(&I, DAG.getVSetCC(getCurDebugLoc(), DestVT, Op1, Op2, Condition));
2273 void SelectionDAGLowering::visitSelect(User &I) {
2274 SmallVector<MVT, 4> ValueVTs;
2275 ComputeValueVTs(TLI, I.getType(), ValueVTs);
2276 unsigned NumValues = ValueVTs.size();
2277 if (NumValues != 0) {
2278 SmallVector<SDValue, 4> Values(NumValues);
2279 SDValue Cond = getValue(I.getOperand(0));
2280 SDValue TrueVal = getValue(I.getOperand(1));
2281 SDValue FalseVal = getValue(I.getOperand(2));
2283 for (unsigned i = 0; i != NumValues; ++i)
2284 Values[i] = DAG.getNode(ISD::SELECT, getCurDebugLoc(),
2285 TrueVal.getValueType(), Cond,
2286 SDValue(TrueVal.getNode(), TrueVal.getResNo() + i),
2287 SDValue(FalseVal.getNode(), FalseVal.getResNo() + i));
2289 setValue(&I, DAG.getNode(ISD::MERGE_VALUES, getCurDebugLoc(),
2290 DAG.getVTList(&ValueVTs[0], NumValues),
2291 &Values[0], NumValues));
2296 void SelectionDAGLowering::visitTrunc(User &I) {
2297 // TruncInst cannot be a no-op cast because sizeof(src) > sizeof(dest).
2298 SDValue N = getValue(I.getOperand(0));
2299 MVT DestVT = TLI.getValueType(I.getType());
2300 setValue(&I, DAG.getNode(ISD::TRUNCATE, getCurDebugLoc(), DestVT, N));
2303 void SelectionDAGLowering::visitZExt(User &I) {
2304 // ZExt cannot be a no-op cast because sizeof(src) < sizeof(dest).
2305 // ZExt also can't be a cast to bool for same reason. So, nothing much to do
2306 SDValue N = getValue(I.getOperand(0));
2307 MVT DestVT = TLI.getValueType(I.getType());
2308 setValue(&I, DAG.getNode(ISD::ZERO_EXTEND, getCurDebugLoc(), DestVT, N));
2311 void SelectionDAGLowering::visitSExt(User &I) {
2312 // SExt cannot be a no-op cast because sizeof(src) < sizeof(dest).
2313 // SExt also can't be a cast to bool for same reason. So, nothing much to do
2314 SDValue N = getValue(I.getOperand(0));
2315 MVT DestVT = TLI.getValueType(I.getType());
2316 setValue(&I, DAG.getNode(ISD::SIGN_EXTEND, getCurDebugLoc(), DestVT, N));
2319 void SelectionDAGLowering::visitFPTrunc(User &I) {
2320 // FPTrunc is never a no-op cast, no need to check
2321 SDValue N = getValue(I.getOperand(0));
2322 MVT DestVT = TLI.getValueType(I.getType());
2323 setValue(&I, DAG.getNode(ISD::FP_ROUND, getCurDebugLoc(),
2324 DestVT, N, DAG.getIntPtrConstant(0)));
2327 void SelectionDAGLowering::visitFPExt(User &I){
2328 // FPTrunc is never a no-op cast, no need to check
2329 SDValue N = getValue(I.getOperand(0));
2330 MVT DestVT = TLI.getValueType(I.getType());
2331 setValue(&I, DAG.getNode(ISD::FP_EXTEND, getCurDebugLoc(), DestVT, N));
2334 void SelectionDAGLowering::visitFPToUI(User &I) {
2335 // FPToUI is never a no-op cast, no need to check
2336 SDValue N = getValue(I.getOperand(0));
2337 MVT DestVT = TLI.getValueType(I.getType());
2338 setValue(&I, DAG.getNode(ISD::FP_TO_UINT, getCurDebugLoc(), DestVT, N));
2341 void SelectionDAGLowering::visitFPToSI(User &I) {
2342 // FPToSI is never a no-op cast, no need to check
2343 SDValue N = getValue(I.getOperand(0));
2344 MVT DestVT = TLI.getValueType(I.getType());
2345 setValue(&I, DAG.getNode(ISD::FP_TO_SINT, getCurDebugLoc(), DestVT, N));
2348 void SelectionDAGLowering::visitUIToFP(User &I) {
2349 // UIToFP is never a no-op cast, no need to check
2350 SDValue N = getValue(I.getOperand(0));
2351 MVT DestVT = TLI.getValueType(I.getType());
2352 setValue(&I, DAG.getNode(ISD::UINT_TO_FP, getCurDebugLoc(), DestVT, N));
2355 void SelectionDAGLowering::visitSIToFP(User &I){
2356 // SIToFP is never a no-op cast, no need to check
2357 SDValue N = getValue(I.getOperand(0));
2358 MVT DestVT = TLI.getValueType(I.getType());
2359 setValue(&I, DAG.getNode(ISD::SINT_TO_FP, getCurDebugLoc(), DestVT, N));
2362 void SelectionDAGLowering::visitPtrToInt(User &I) {
2363 // What to do depends on the size of the integer and the size of the pointer.
2364 // We can either truncate, zero extend, or no-op, accordingly.
2365 SDValue N = getValue(I.getOperand(0));
2366 MVT SrcVT = N.getValueType();
2367 MVT DestVT = TLI.getValueType(I.getType());
2369 if (DestVT.bitsLT(SrcVT))
2370 Result = DAG.getNode(ISD::TRUNCATE, getCurDebugLoc(), DestVT, N);
2372 // Note: ZERO_EXTEND can handle cases where the sizes are equal too
2373 Result = DAG.getNode(ISD::ZERO_EXTEND, getCurDebugLoc(), DestVT, N);
2374 setValue(&I, Result);
2377 void SelectionDAGLowering::visitIntToPtr(User &I) {
2378 // What to do depends on the size of the integer and the size of the pointer.
2379 // We can either truncate, zero extend, or no-op, accordingly.
2380 SDValue N = getValue(I.getOperand(0));
2381 MVT SrcVT = N.getValueType();
2382 MVT DestVT = TLI.getValueType(I.getType());
2383 if (DestVT.bitsLT(SrcVT))
2384 setValue(&I, DAG.getNode(ISD::TRUNCATE, getCurDebugLoc(), DestVT, N));
2386 // Note: ZERO_EXTEND can handle cases where the sizes are equal too
2387 setValue(&I, DAG.getNode(ISD::ZERO_EXTEND, getCurDebugLoc(),
2391 void SelectionDAGLowering::visitBitCast(User &I) {
2392 SDValue N = getValue(I.getOperand(0));
2393 MVT DestVT = TLI.getValueType(I.getType());
2395 // BitCast assures us that source and destination are the same size so this
2396 // is either a BIT_CONVERT or a no-op.
2397 if (DestVT != N.getValueType())
2398 setValue(&I, DAG.getNode(ISD::BIT_CONVERT, getCurDebugLoc(),
2399 DestVT, N)); // convert types
2401 setValue(&I, N); // noop cast.
2404 void SelectionDAGLowering::visitInsertElement(User &I) {
2405 SDValue InVec = getValue(I.getOperand(0));
2406 SDValue InVal = getValue(I.getOperand(1));
2407 SDValue InIdx = DAG.getNode(ISD::ZERO_EXTEND, getCurDebugLoc(),
2409 getValue(I.getOperand(2)));
2411 setValue(&I, DAG.getNode(ISD::INSERT_VECTOR_ELT, getCurDebugLoc(),
2412 TLI.getValueType(I.getType()),
2413 InVec, InVal, InIdx));
2416 void SelectionDAGLowering::visitExtractElement(User &I) {
2417 SDValue InVec = getValue(I.getOperand(0));
2418 SDValue InIdx = DAG.getNode(ISD::ZERO_EXTEND, getCurDebugLoc(),
2420 getValue(I.getOperand(1)));
2421 setValue(&I, DAG.getNode(ISD::EXTRACT_VECTOR_ELT, getCurDebugLoc(),
2422 TLI.getValueType(I.getType()), InVec, InIdx));
2426 // Utility for visitShuffleVector - Returns true if the mask is mask starting
2427 // from SIndx and increasing to the element length (undefs are allowed).
2428 static bool SequentialMask(SDValue Mask, unsigned SIndx) {
2429 unsigned MaskNumElts = Mask.getNumOperands();
2430 for (unsigned i = 0; i != MaskNumElts; ++i) {
2431 if (Mask.getOperand(i).getOpcode() != ISD::UNDEF) {
2432 unsigned Idx = cast<ConstantSDNode>(Mask.getOperand(i))->getZExtValue();
2433 if (Idx != i + SIndx)
2440 void SelectionDAGLowering::visitShuffleVector(User &I) {
2441 SDValue Src1 = getValue(I.getOperand(0));
2442 SDValue Src2 = getValue(I.getOperand(1));
2443 SDValue Mask = getValue(I.getOperand(2));
2445 MVT VT = TLI.getValueType(I.getType());
2446 MVT SrcVT = Src1.getValueType();
2447 int MaskNumElts = Mask.getNumOperands();
2448 int SrcNumElts = SrcVT.getVectorNumElements();
2450 if (SrcNumElts == MaskNumElts) {
2451 setValue(&I, DAG.getNode(ISD::VECTOR_SHUFFLE, getCurDebugLoc(),
2452 VT, Src1, Src2, Mask));
2456 // Normalize the shuffle vector since mask and vector length don't match.
2457 MVT MaskEltVT = Mask.getValueType().getVectorElementType();
2459 if (SrcNumElts < MaskNumElts && MaskNumElts % SrcNumElts == 0) {
2460 // Mask is longer than the source vectors and is a multiple of the source
2461 // vectors. We can use concatenate vector to make the mask and vectors
2463 if (SrcNumElts*2 == MaskNumElts && SequentialMask(Mask, 0)) {
2464 // The shuffle is concatenating two vectors together.
2465 setValue(&I, DAG.getNode(ISD::CONCAT_VECTORS, getCurDebugLoc(),
2470 // Pad both vectors with undefs to make them the same length as the mask.
2471 unsigned NumConcat = MaskNumElts / SrcNumElts;
2472 SDValue UndefVal = DAG.getUNDEF(SrcVT);
2474 SDValue* MOps1 = new SDValue[NumConcat];
2475 SDValue* MOps2 = new SDValue[NumConcat];
2478 for (unsigned i = 1; i != NumConcat; ++i) {
2479 MOps1[i] = UndefVal;
2480 MOps2[i] = UndefVal;
2482 Src1 = DAG.getNode(ISD::CONCAT_VECTORS, getCurDebugLoc(),
2483 VT, MOps1, NumConcat);
2484 Src2 = DAG.getNode(ISD::CONCAT_VECTORS, getCurDebugLoc(),
2485 VT, MOps2, NumConcat);
2490 // Readjust mask for new input vector length.
2491 SmallVector<SDValue, 8> MappedOps;
2492 for (int i = 0; i != MaskNumElts; ++i) {
2493 if (Mask.getOperand(i).getOpcode() == ISD::UNDEF) {
2494 MappedOps.push_back(Mask.getOperand(i));
2496 int Idx = cast<ConstantSDNode>(Mask.getOperand(i))->getZExtValue();
2497 if (Idx < SrcNumElts)
2498 MappedOps.push_back(DAG.getConstant(Idx, MaskEltVT));
2500 MappedOps.push_back(DAG.getConstant(Idx + MaskNumElts - SrcNumElts,
2504 Mask = DAG.getNode(ISD::BUILD_VECTOR, getCurDebugLoc(),
2505 Mask.getValueType(),
2506 &MappedOps[0], MappedOps.size());
2508 setValue(&I, DAG.getNode(ISD::VECTOR_SHUFFLE, getCurDebugLoc(),
2509 VT, Src1, Src2, Mask));
2513 if (SrcNumElts > MaskNumElts) {
2514 // Resulting vector is shorter than the incoming vector.
2515 if (SrcNumElts == MaskNumElts && SequentialMask(Mask,0)) {
2516 // Shuffle extracts 1st vector.
2521 if (SrcNumElts == MaskNumElts && SequentialMask(Mask,MaskNumElts)) {
2522 // Shuffle extracts 2nd vector.
2527 // Analyze the access pattern of the vector to see if we can extract
2528 // two subvectors and do the shuffle. The analysis is done by calculating
2529 // the range of elements the mask access on both vectors.
2530 int MinRange[2] = { SrcNumElts+1, SrcNumElts+1};
2531 int MaxRange[2] = {-1, -1};
2533 for (int i = 0; i != MaskNumElts; ++i) {
2534 SDValue Arg = Mask.getOperand(i);
2535 if (Arg.getOpcode() != ISD::UNDEF) {
2536 assert(isa<ConstantSDNode>(Arg) && "Invalid VECTOR_SHUFFLE mask!");
2537 int Idx = cast<ConstantSDNode>(Arg)->getZExtValue();
2539 if (Idx >= SrcNumElts) {
2543 if (Idx > MaxRange[Input])
2544 MaxRange[Input] = Idx;
2545 if (Idx < MinRange[Input])
2546 MinRange[Input] = Idx;
2550 // Check if the access is smaller than the vector size and can we find
2551 // a reasonable extract index.
2552 int RangeUse[2] = { 2, 2 }; // 0 = Unused, 1 = Extract, 2 = Can not Extract.
2553 int StartIdx[2]; // StartIdx to extract from
2554 for (int Input=0; Input < 2; ++Input) {
2555 if (MinRange[Input] == SrcNumElts+1 && MaxRange[Input] == -1) {
2556 RangeUse[Input] = 0; // Unused
2557 StartIdx[Input] = 0;
2558 } else if (MaxRange[Input] - MinRange[Input] < MaskNumElts) {
2559 // Fits within range but we should see if we can find a good
2560 // start index that is a multiple of the mask length.
2561 if (MaxRange[Input] < MaskNumElts) {
2562 RangeUse[Input] = 1; // Extract from beginning of the vector
2563 StartIdx[Input] = 0;
2565 StartIdx[Input] = (MinRange[Input]/MaskNumElts)*MaskNumElts;
2566 if (MaxRange[Input] - StartIdx[Input] < MaskNumElts &&
2567 StartIdx[Input] + MaskNumElts < SrcNumElts)
2568 RangeUse[Input] = 1; // Extract from a multiple of the mask length.
2573 if (RangeUse[0] == 0 && RangeUse[0] == 0) {
2574 setValue(&I, DAG.getUNDEF(VT)); // Vectors are not used.
2577 else if (RangeUse[0] < 2 && RangeUse[1] < 2) {
2578 // Extract appropriate subvector and generate a vector shuffle
2579 for (int Input=0; Input < 2; ++Input) {
2580 SDValue& Src = Input == 0 ? Src1 : Src2;
2581 if (RangeUse[Input] == 0) {
2582 Src = DAG.getUNDEF(VT);
2584 Src = DAG.getNode(ISD::EXTRACT_SUBVECTOR, getCurDebugLoc(), VT,
2585 Src, DAG.getIntPtrConstant(StartIdx[Input]));
2588 // Calculate new mask.
2589 SmallVector<SDValue, 8> MappedOps;
2590 for (int i = 0; i != MaskNumElts; ++i) {
2591 SDValue Arg = Mask.getOperand(i);
2592 if (Arg.getOpcode() == ISD::UNDEF) {
2593 MappedOps.push_back(Arg);
2595 int Idx = cast<ConstantSDNode>(Arg)->getZExtValue();
2596 if (Idx < SrcNumElts)
2597 MappedOps.push_back(DAG.getConstant(Idx - StartIdx[0], MaskEltVT));
2599 Idx = Idx - SrcNumElts - StartIdx[1] + MaskNumElts;
2600 MappedOps.push_back(DAG.getConstant(Idx, MaskEltVT));
2604 Mask = DAG.getNode(ISD::BUILD_VECTOR, getCurDebugLoc(),
2605 Mask.getValueType(),
2606 &MappedOps[0], MappedOps.size());
2607 setValue(&I, DAG.getNode(ISD::VECTOR_SHUFFLE, getCurDebugLoc(),
2608 VT, Src1, Src2, Mask));
2613 // We can't use either concat vectors or extract subvectors so fall back to
2614 // replacing the shuffle with extract and build vector.
2615 // to insert and build vector.
2616 MVT EltVT = VT.getVectorElementType();
2617 MVT PtrVT = TLI.getPointerTy();
2618 SmallVector<SDValue,8> Ops;
2619 for (int i = 0; i != MaskNumElts; ++i) {
2620 SDValue Arg = Mask.getOperand(i);
2621 if (Arg.getOpcode() == ISD::UNDEF) {
2622 Ops.push_back(DAG.getUNDEF(EltVT));
2624 assert(isa<ConstantSDNode>(Arg) && "Invalid VECTOR_SHUFFLE mask!");
2625 int Idx = cast<ConstantSDNode>(Arg)->getZExtValue();
2626 if (Idx < SrcNumElts)
2627 Ops.push_back(DAG.getNode(ISD::EXTRACT_VECTOR_ELT, getCurDebugLoc(),
2628 EltVT, Src1, DAG.getConstant(Idx, PtrVT)));
2630 Ops.push_back(DAG.getNode(ISD::EXTRACT_VECTOR_ELT, getCurDebugLoc(),
2632 DAG.getConstant(Idx - SrcNumElts, PtrVT)));
2635 setValue(&I, DAG.getNode(ISD::BUILD_VECTOR, getCurDebugLoc(),
2636 VT, &Ops[0], Ops.size()));
2639 void SelectionDAGLowering::visitInsertValue(InsertValueInst &I) {
2640 const Value *Op0 = I.getOperand(0);
2641 const Value *Op1 = I.getOperand(1);
2642 const Type *AggTy = I.getType();
2643 const Type *ValTy = Op1->getType();
2644 bool IntoUndef = isa<UndefValue>(Op0);
2645 bool FromUndef = isa<UndefValue>(Op1);
2647 unsigned LinearIndex = ComputeLinearIndex(TLI, AggTy,
2648 I.idx_begin(), I.idx_end());
2650 SmallVector<MVT, 4> AggValueVTs;
2651 ComputeValueVTs(TLI, AggTy, AggValueVTs);
2652 SmallVector<MVT, 4> ValValueVTs;
2653 ComputeValueVTs(TLI, ValTy, ValValueVTs);
2655 unsigned NumAggValues = AggValueVTs.size();
2656 unsigned NumValValues = ValValueVTs.size();
2657 SmallVector<SDValue, 4> Values(NumAggValues);
2659 SDValue Agg = getValue(Op0);
2660 SDValue Val = getValue(Op1);
2662 // Copy the beginning value(s) from the original aggregate.
2663 for (; i != LinearIndex; ++i)
2664 Values[i] = IntoUndef ? DAG.getUNDEF(AggValueVTs[i]) :
2665 SDValue(Agg.getNode(), Agg.getResNo() + i);
2666 // Copy values from the inserted value(s).
2667 for (; i != LinearIndex + NumValValues; ++i)
2668 Values[i] = FromUndef ? DAG.getUNDEF(AggValueVTs[i]) :
2669 SDValue(Val.getNode(), Val.getResNo() + i - LinearIndex);
2670 // Copy remaining value(s) from the original aggregate.
2671 for (; i != NumAggValues; ++i)
2672 Values[i] = IntoUndef ? DAG.getUNDEF(AggValueVTs[i]) :
2673 SDValue(Agg.getNode(), Agg.getResNo() + i);
2675 setValue(&I, DAG.getNode(ISD::MERGE_VALUES, getCurDebugLoc(),
2676 DAG.getVTList(&AggValueVTs[0], NumAggValues),
2677 &Values[0], NumAggValues));
2680 void SelectionDAGLowering::visitExtractValue(ExtractValueInst &I) {
2681 const Value *Op0 = I.getOperand(0);
2682 const Type *AggTy = Op0->getType();
2683 const Type *ValTy = I.getType();
2684 bool OutOfUndef = isa<UndefValue>(Op0);
2686 unsigned LinearIndex = ComputeLinearIndex(TLI, AggTy,
2687 I.idx_begin(), I.idx_end());
2689 SmallVector<MVT, 4> ValValueVTs;
2690 ComputeValueVTs(TLI, ValTy, ValValueVTs);
2692 unsigned NumValValues = ValValueVTs.size();
2693 SmallVector<SDValue, 4> Values(NumValValues);
2695 SDValue Agg = getValue(Op0);
2696 // Copy out the selected value(s).
2697 for (unsigned i = LinearIndex; i != LinearIndex + NumValValues; ++i)
2698 Values[i - LinearIndex] =
2700 DAG.getUNDEF(Agg.getNode()->getValueType(Agg.getResNo() + i)) :
2701 SDValue(Agg.getNode(), Agg.getResNo() + i);
2703 setValue(&I, DAG.getNode(ISD::MERGE_VALUES, getCurDebugLoc(),
2704 DAG.getVTList(&ValValueVTs[0], NumValValues),
2705 &Values[0], NumValValues));
2709 void SelectionDAGLowering::visitGetElementPtr(User &I) {
2710 SDValue N = getValue(I.getOperand(0));
2711 const Type *Ty = I.getOperand(0)->getType();
2713 for (GetElementPtrInst::op_iterator OI = I.op_begin()+1, E = I.op_end();
2716 if (const StructType *StTy = dyn_cast<StructType>(Ty)) {
2717 unsigned Field = cast<ConstantInt>(Idx)->getZExtValue();
2720 uint64_t Offset = TD->getStructLayout(StTy)->getElementOffset(Field);
2721 N = DAG.getNode(ISD::ADD, getCurDebugLoc(), N.getValueType(), N,
2722 DAG.getIntPtrConstant(Offset));
2724 Ty = StTy->getElementType(Field);
2726 Ty = cast<SequentialType>(Ty)->getElementType();
2728 // If this is a constant subscript, handle it quickly.
2729 if (ConstantInt *CI = dyn_cast<ConstantInt>(Idx)) {
2730 if (CI->getZExtValue() == 0) continue;
2732 TD->getTypePaddedSize(Ty)*cast<ConstantInt>(CI)->getSExtValue();
2734 unsigned PtrBits = TLI.getPointerTy().getSizeInBits();
2736 OffsVal = DAG.getNode(ISD::TRUNCATE, getCurDebugLoc(),
2738 DAG.getConstant(Offs, MVT::i64));
2740 OffsVal = DAG.getIntPtrConstant(Offs);
2741 N = DAG.getNode(ISD::ADD, getCurDebugLoc(), N.getValueType(), N,
2746 // N = N + Idx * ElementSize;
2747 uint64_t ElementSize = TD->getTypePaddedSize(Ty);
2748 SDValue IdxN = getValue(Idx);
2750 // If the index is smaller or larger than intptr_t, truncate or extend
2752 if (IdxN.getValueType().bitsLT(N.getValueType()))
2753 IdxN = DAG.getNode(ISD::SIGN_EXTEND, getCurDebugLoc(),
2754 N.getValueType(), IdxN);
2755 else if (IdxN.getValueType().bitsGT(N.getValueType()))
2756 IdxN = DAG.getNode(ISD::TRUNCATE, getCurDebugLoc(),
2757 N.getValueType(), IdxN);
2759 // If this is a multiply by a power of two, turn it into a shl
2760 // immediately. This is a very common case.
2761 if (ElementSize != 1) {
2762 if (isPowerOf2_64(ElementSize)) {
2763 unsigned Amt = Log2_64(ElementSize);
2764 IdxN = DAG.getNode(ISD::SHL, getCurDebugLoc(),
2765 N.getValueType(), IdxN,
2766 DAG.getConstant(Amt, TLI.getPointerTy()));
2768 SDValue Scale = DAG.getIntPtrConstant(ElementSize);
2769 IdxN = DAG.getNode(ISD::MUL, getCurDebugLoc(),
2770 N.getValueType(), IdxN, Scale);
2774 N = DAG.getNode(ISD::ADD, getCurDebugLoc(),
2775 N.getValueType(), N, IdxN);
2781 void SelectionDAGLowering::visitAlloca(AllocaInst &I) {
2782 // If this is a fixed sized alloca in the entry block of the function,
2783 // allocate it statically on the stack.
2784 if (FuncInfo.StaticAllocaMap.count(&I))
2785 return; // getValue will auto-populate this.
2787 const Type *Ty = I.getAllocatedType();
2788 uint64_t TySize = TLI.getTargetData()->getTypePaddedSize(Ty);
2790 std::max((unsigned)TLI.getTargetData()->getPrefTypeAlignment(Ty),
2793 SDValue AllocSize = getValue(I.getArraySize());
2795 AllocSize = DAG.getNode(ISD::MUL, getCurDebugLoc(), AllocSize.getValueType(),
2797 DAG.getConstant(TySize, AllocSize.getValueType()));
2801 MVT IntPtr = TLI.getPointerTy();
2802 if (IntPtr.bitsLT(AllocSize.getValueType()))
2803 AllocSize = DAG.getNode(ISD::TRUNCATE, getCurDebugLoc(),
2805 else if (IntPtr.bitsGT(AllocSize.getValueType()))
2806 AllocSize = DAG.getNode(ISD::ZERO_EXTEND, getCurDebugLoc(),
2809 // Handle alignment. If the requested alignment is less than or equal to
2810 // the stack alignment, ignore it. If the size is greater than or equal to
2811 // the stack alignment, we note this in the DYNAMIC_STACKALLOC node.
2812 unsigned StackAlign =
2813 TLI.getTargetMachine().getFrameInfo()->getStackAlignment();
2814 if (Align <= StackAlign)
2817 // Round the size of the allocation up to the stack alignment size
2818 // by add SA-1 to the size.
2819 AllocSize = DAG.getNode(ISD::ADD, getCurDebugLoc(),
2820 AllocSize.getValueType(), AllocSize,
2821 DAG.getIntPtrConstant(StackAlign-1));
2822 // Mask out the low bits for alignment purposes.
2823 AllocSize = DAG.getNode(ISD::AND, getCurDebugLoc(),
2824 AllocSize.getValueType(), AllocSize,
2825 DAG.getIntPtrConstant(~(uint64_t)(StackAlign-1)));
2827 SDValue Ops[] = { getRoot(), AllocSize, DAG.getIntPtrConstant(Align) };
2828 SDVTList VTs = DAG.getVTList(AllocSize.getValueType(), MVT::Other);
2829 SDValue DSA = DAG.getNode(ISD::DYNAMIC_STACKALLOC, getCurDebugLoc(),
2832 DAG.setRoot(DSA.getValue(1));
2834 // Inform the Frame Information that we have just allocated a variable-sized
2836 CurMBB->getParent()->getFrameInfo()->CreateVariableSizedObject();
2839 void SelectionDAGLowering::visitLoad(LoadInst &I) {
2840 const Value *SV = I.getOperand(0);
2841 SDValue Ptr = getValue(SV);
2843 const Type *Ty = I.getType();
2844 bool isVolatile = I.isVolatile();
2845 unsigned Alignment = I.getAlignment();
2847 SmallVector<MVT, 4> ValueVTs;
2848 SmallVector<uint64_t, 4> Offsets;
2849 ComputeValueVTs(TLI, Ty, ValueVTs, &Offsets);
2850 unsigned NumValues = ValueVTs.size();
2855 bool ConstantMemory = false;
2857 // Serialize volatile loads with other side effects.
2859 else if (AA->pointsToConstantMemory(SV)) {
2860 // Do not serialize (non-volatile) loads of constant memory with anything.
2861 Root = DAG.getEntryNode();
2862 ConstantMemory = true;
2864 // Do not serialize non-volatile loads against each other.
2865 Root = DAG.getRoot();
2868 SmallVector<SDValue, 4> Values(NumValues);
2869 SmallVector<SDValue, 4> Chains(NumValues);
2870 MVT PtrVT = Ptr.getValueType();
2871 for (unsigned i = 0; i != NumValues; ++i) {
2872 SDValue L = DAG.getLoad(ValueVTs[i], getCurDebugLoc(), Root,
2873 DAG.getNode(ISD::ADD, getCurDebugLoc(),
2875 DAG.getConstant(Offsets[i], PtrVT)),
2877 isVolatile, Alignment);
2879 Chains[i] = L.getValue(1);
2882 if (!ConstantMemory) {
2883 SDValue Chain = DAG.getNode(ISD::TokenFactor, getCurDebugLoc(),
2885 &Chains[0], NumValues);
2889 PendingLoads.push_back(Chain);
2892 setValue(&I, DAG.getNode(ISD::MERGE_VALUES, getCurDebugLoc(),
2893 DAG.getVTList(&ValueVTs[0], NumValues),
2894 &Values[0], NumValues));
2898 void SelectionDAGLowering::visitStore(StoreInst &I) {
2899 Value *SrcV = I.getOperand(0);
2900 Value *PtrV = I.getOperand(1);
2902 SmallVector<MVT, 4> ValueVTs;
2903 SmallVector<uint64_t, 4> Offsets;
2904 ComputeValueVTs(TLI, SrcV->getType(), ValueVTs, &Offsets);
2905 unsigned NumValues = ValueVTs.size();
2909 // Get the lowered operands. Note that we do this after
2910 // checking if NumResults is zero, because with zero results
2911 // the operands won't have values in the map.
2912 SDValue Src = getValue(SrcV);
2913 SDValue Ptr = getValue(PtrV);
2915 SDValue Root = getRoot();
2916 SmallVector<SDValue, 4> Chains(NumValues);
2917 MVT PtrVT = Ptr.getValueType();
2918 bool isVolatile = I.isVolatile();
2919 unsigned Alignment = I.getAlignment();
2920 for (unsigned i = 0; i != NumValues; ++i)
2921 Chains[i] = DAG.getStore(Root, getCurDebugLoc(),
2922 SDValue(Src.getNode(), Src.getResNo() + i),
2923 DAG.getNode(ISD::ADD, getCurDebugLoc(),
2925 DAG.getConstant(Offsets[i], PtrVT)),
2927 isVolatile, Alignment);
2929 DAG.setRoot(DAG.getNode(ISD::TokenFactor, getCurDebugLoc(),
2930 MVT::Other, &Chains[0], NumValues));
2933 /// visitTargetIntrinsic - Lower a call of a target intrinsic to an INTRINSIC
2935 void SelectionDAGLowering::visitTargetIntrinsic(CallInst &I,
2936 unsigned Intrinsic) {
2937 bool HasChain = !I.doesNotAccessMemory();
2938 bool OnlyLoad = HasChain && I.onlyReadsMemory();
2940 // Build the operand list.
2941 SmallVector<SDValue, 8> Ops;
2942 if (HasChain) { // If this intrinsic has side-effects, chainify it.
2944 // We don't need to serialize loads against other loads.
2945 Ops.push_back(DAG.getRoot());
2947 Ops.push_back(getRoot());
2951 // Info is set by getTgtMemInstrinsic
2952 TargetLowering::IntrinsicInfo Info;
2953 bool IsTgtIntrinsic = TLI.getTgtMemIntrinsic(Info, I, Intrinsic);
2955 // Add the intrinsic ID as an integer operand if it's not a target intrinsic.
2956 if (!IsTgtIntrinsic)
2957 Ops.push_back(DAG.getConstant(Intrinsic, TLI.getPointerTy()));
2959 // Add all operands of the call to the operand list.
2960 for (unsigned i = 1, e = I.getNumOperands(); i != e; ++i) {
2961 SDValue Op = getValue(I.getOperand(i));
2962 assert(TLI.isTypeLegal(Op.getValueType()) &&
2963 "Intrinsic uses a non-legal type?");
2967 std::vector<MVT> VTArray;
2968 if (I.getType() != Type::VoidTy) {
2969 MVT VT = TLI.getValueType(I.getType());
2970 if (VT.isVector()) {
2971 const VectorType *DestTy = cast<VectorType>(I.getType());
2972 MVT EltVT = TLI.getValueType(DestTy->getElementType());
2974 VT = MVT::getVectorVT(EltVT, DestTy->getNumElements());
2975 assert(VT != MVT::Other && "Intrinsic uses a non-legal type?");
2978 assert(TLI.isTypeLegal(VT) && "Intrinsic uses a non-legal type?");
2979 VTArray.push_back(VT);
2982 VTArray.push_back(MVT::Other);
2984 SDVTList VTs = DAG.getVTList(&VTArray[0], VTArray.size());
2988 if (IsTgtIntrinsic) {
2989 // This is target intrinsic that touches memory
2990 Result = DAG.getMemIntrinsicNode(Info.opc, getCurDebugLoc(),
2991 VTs, &Ops[0], Ops.size(),
2992 Info.memVT, Info.ptrVal, Info.offset,
2993 Info.align, Info.vol,
2994 Info.readMem, Info.writeMem);
2997 Result = DAG.getNode(ISD::INTRINSIC_WO_CHAIN, getCurDebugLoc(),
2998 VTs, &Ops[0], Ops.size());
2999 else if (I.getType() != Type::VoidTy)
3000 Result = DAG.getNode(ISD::INTRINSIC_W_CHAIN, getCurDebugLoc(),
3001 VTs, &Ops[0], Ops.size());
3003 Result = DAG.getNode(ISD::INTRINSIC_VOID, getCurDebugLoc(),
3004 VTs, &Ops[0], Ops.size());
3007 SDValue Chain = Result.getValue(Result.getNode()->getNumValues()-1);
3009 PendingLoads.push_back(Chain);
3013 if (I.getType() != Type::VoidTy) {
3014 if (const VectorType *PTy = dyn_cast<VectorType>(I.getType())) {
3015 MVT VT = TLI.getValueType(PTy);
3016 Result = DAG.getNode(ISD::BIT_CONVERT, getCurDebugLoc(), VT, Result);
3018 setValue(&I, Result);
3022 /// ExtractTypeInfo - Returns the type info, possibly bitcast, encoded in V.
3023 static GlobalVariable *ExtractTypeInfo(Value *V) {
3024 V = V->stripPointerCasts();
3025 GlobalVariable *GV = dyn_cast<GlobalVariable>(V);
3026 assert ((GV || isa<ConstantPointerNull>(V)) &&
3027 "TypeInfo must be a global variable or NULL");
3033 /// AddCatchInfo - Extract the personality and type infos from an eh.selector
3034 /// call, and add them to the specified machine basic block.
3035 void AddCatchInfo(CallInst &I, MachineModuleInfo *MMI,
3036 MachineBasicBlock *MBB) {
3037 // Inform the MachineModuleInfo of the personality for this landing pad.
3038 ConstantExpr *CE = cast<ConstantExpr>(I.getOperand(2));
3039 assert(CE->getOpcode() == Instruction::BitCast &&
3040 isa<Function>(CE->getOperand(0)) &&
3041 "Personality should be a function");
3042 MMI->addPersonality(MBB, cast<Function>(CE->getOperand(0)));
3044 // Gather all the type infos for this landing pad and pass them along to
3045 // MachineModuleInfo.
3046 std::vector<GlobalVariable *> TyInfo;
3047 unsigned N = I.getNumOperands();
3049 for (unsigned i = N - 1; i > 2; --i) {
3050 if (ConstantInt *CI = dyn_cast<ConstantInt>(I.getOperand(i))) {
3051 unsigned FilterLength = CI->getZExtValue();
3052 unsigned FirstCatch = i + FilterLength + !FilterLength;
3053 assert (FirstCatch <= N && "Invalid filter length");
3055 if (FirstCatch < N) {
3056 TyInfo.reserve(N - FirstCatch);
3057 for (unsigned j = FirstCatch; j < N; ++j)
3058 TyInfo.push_back(ExtractTypeInfo(I.getOperand(j)));
3059 MMI->addCatchTypeInfo(MBB, TyInfo);
3063 if (!FilterLength) {
3065 MMI->addCleanup(MBB);
3068 TyInfo.reserve(FilterLength - 1);
3069 for (unsigned j = i + 1; j < FirstCatch; ++j)
3070 TyInfo.push_back(ExtractTypeInfo(I.getOperand(j)));
3071 MMI->addFilterTypeInfo(MBB, TyInfo);
3080 TyInfo.reserve(N - 3);
3081 for (unsigned j = 3; j < N; ++j)
3082 TyInfo.push_back(ExtractTypeInfo(I.getOperand(j)));
3083 MMI->addCatchTypeInfo(MBB, TyInfo);
3089 /// GetSignificand - Get the significand and build it into a floating-point
3090 /// number with exponent of 1:
3092 /// Op = (Op & 0x007fffff) | 0x3f800000;
3094 /// where Op is the hexidecimal representation of floating point value.
3096 GetSignificand(SelectionDAG &DAG, SDValue Op, DebugLoc dl) {
3097 SDValue t1 = DAG.getNode(ISD::AND, dl, MVT::i32, Op,
3098 DAG.getConstant(0x007fffff, MVT::i32));
3099 SDValue t2 = DAG.getNode(ISD::OR, dl, MVT::i32, t1,
3100 DAG.getConstant(0x3f800000, MVT::i32));
3101 return DAG.getNode(ISD::BIT_CONVERT, dl, MVT::f32, t2);
3104 /// GetExponent - Get the exponent:
3106 /// (float)(int)(((Op & 0x7f800000) >> 23) - 127);
3108 /// where Op is the hexidecimal representation of floating point value.
3110 GetExponent(SelectionDAG &DAG, SDValue Op, const TargetLowering &TLI,
3112 SDValue t0 = DAG.getNode(ISD::AND, dl, MVT::i32, Op,
3113 DAG.getConstant(0x7f800000, MVT::i32));
3114 SDValue t1 = DAG.getNode(ISD::SRL, dl, MVT::i32, t0,
3115 DAG.getConstant(23, TLI.getPointerTy()));
3116 SDValue t2 = DAG.getNode(ISD::SUB, dl, MVT::i32, t1,
3117 DAG.getConstant(127, MVT::i32));
3118 return DAG.getNode(ISD::SINT_TO_FP, dl, MVT::f32, t2);
3121 /// getF32Constant - Get 32-bit floating point constant.
3123 getF32Constant(SelectionDAG &DAG, unsigned Flt) {
3124 return DAG.getConstantFP(APFloat(APInt(32, Flt)), MVT::f32);
3127 /// Inlined utility function to implement binary input atomic intrinsics for
3128 /// visitIntrinsicCall: I is a call instruction
3129 /// Op is the associated NodeType for I
3131 SelectionDAGLowering::implVisitBinaryAtomic(CallInst& I, ISD::NodeType Op) {
3132 SDValue Root = getRoot();
3134 DAG.getAtomic(Op, getCurDebugLoc(),
3135 getValue(I.getOperand(2)).getValueType().getSimpleVT(),
3137 getValue(I.getOperand(1)),
3138 getValue(I.getOperand(2)),
3141 DAG.setRoot(L.getValue(1));
3145 // implVisitAluOverflow - Lower arithmetic overflow instrinsics.
3147 SelectionDAGLowering::implVisitAluOverflow(CallInst &I, ISD::NodeType Op) {
3148 SDValue Op1 = getValue(I.getOperand(1));
3149 SDValue Op2 = getValue(I.getOperand(2));
3151 SDVTList VTs = DAG.getVTList(Op1.getValueType(), MVT::i1);
3152 SDValue Result = DAG.getNode(Op, getCurDebugLoc(), VTs, Op1, Op2);
3154 setValue(&I, Result);
3158 /// visitExp - Lower an exp intrinsic. Handles the special sequences for
3159 /// limited-precision mode.
3161 SelectionDAGLowering::visitExp(CallInst &I) {
3163 DebugLoc dl = getCurDebugLoc();
3165 if (getValue(I.getOperand(1)).getValueType() == MVT::f32 &&
3166 LimitFloatPrecision > 0 && LimitFloatPrecision <= 18) {
3167 SDValue Op = getValue(I.getOperand(1));
3169 // Put the exponent in the right bit position for later addition to the
3172 // #define LOG2OFe 1.4426950f
3173 // IntegerPartOfX = ((int32_t)(X * LOG2OFe));
3174 SDValue t0 = DAG.getNode(ISD::FMUL, dl, MVT::f32, Op,
3175 getF32Constant(DAG, 0x3fb8aa3b));
3176 SDValue IntegerPartOfX = DAG.getNode(ISD::FP_TO_SINT, dl, MVT::i32, t0);
3178 // FractionalPartOfX = (X * LOG2OFe) - (float)IntegerPartOfX;
3179 SDValue t1 = DAG.getNode(ISD::SINT_TO_FP, dl, MVT::f32, IntegerPartOfX);
3180 SDValue X = DAG.getNode(ISD::FSUB, dl, MVT::f32, t0, t1);
3182 // IntegerPartOfX <<= 23;
3183 IntegerPartOfX = DAG.getNode(ISD::SHL, dl, MVT::i32, IntegerPartOfX,
3184 DAG.getConstant(23, TLI.getPointerTy()));
3186 if (LimitFloatPrecision <= 6) {
3187 // For floating-point precision of 6:
3189 // TwoToFractionalPartOfX =
3191 // (0.735607626f + 0.252464424f * x) * x;
3193 // error 0.0144103317, which is 6 bits
3194 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
3195 getF32Constant(DAG, 0x3e814304));
3196 SDValue t3 = DAG.getNode(ISD::FADD, dl, MVT::f32, t2,
3197 getF32Constant(DAG, 0x3f3c50c8));
3198 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X);
3199 SDValue t5 = DAG.getNode(ISD::FADD, dl, MVT::f32, t4,
3200 getF32Constant(DAG, 0x3f7f5e7e));
3201 SDValue TwoToFracPartOfX = DAG.getNode(ISD::BIT_CONVERT, dl,MVT::i32, t5);
3203 // Add the exponent into the result in integer domain.
3204 SDValue t6 = DAG.getNode(ISD::ADD, dl, MVT::i32,
3205 TwoToFracPartOfX, IntegerPartOfX);
3207 result = DAG.getNode(ISD::BIT_CONVERT, dl, MVT::f32, t6);
3208 } else if (LimitFloatPrecision > 6 && LimitFloatPrecision <= 12) {
3209 // For floating-point precision of 12:
3211 // TwoToFractionalPartOfX =
3214 // (0.224338339f + 0.792043434e-1f * x) * x) * x;
3216 // 0.000107046256 error, which is 13 to 14 bits
3217 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
3218 getF32Constant(DAG, 0x3da235e3));
3219 SDValue t3 = DAG.getNode(ISD::FADD, dl, MVT::f32, t2,
3220 getF32Constant(DAG, 0x3e65b8f3));
3221 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X);
3222 SDValue t5 = DAG.getNode(ISD::FADD, dl, MVT::f32, t4,
3223 getF32Constant(DAG, 0x3f324b07));
3224 SDValue t6 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t5, X);
3225 SDValue t7 = DAG.getNode(ISD::FADD, dl, MVT::f32, t6,
3226 getF32Constant(DAG, 0x3f7ff8fd));
3227 SDValue TwoToFracPartOfX = DAG.getNode(ISD::BIT_CONVERT, dl,MVT::i32, t7);
3229 // Add the exponent into the result in integer domain.
3230 SDValue t8 = DAG.getNode(ISD::ADD, dl, MVT::i32,
3231 TwoToFracPartOfX, IntegerPartOfX);
3233 result = DAG.getNode(ISD::BIT_CONVERT, dl, MVT::f32, t8);
3234 } else { // LimitFloatPrecision > 12 && LimitFloatPrecision <= 18
3235 // For floating-point precision of 18:
3237 // TwoToFractionalPartOfX =
3241 // (0.554906021e-1f +
3242 // (0.961591928e-2f +
3243 // (0.136028312e-2f + 0.157059148e-3f *x)*x)*x)*x)*x)*x;
3245 // error 2.47208000*10^(-7), which is better than 18 bits
3246 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
3247 getF32Constant(DAG, 0x3924b03e));
3248 SDValue t3 = DAG.getNode(ISD::FADD, dl, MVT::f32, t2,
3249 getF32Constant(DAG, 0x3ab24b87));
3250 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X);
3251 SDValue t5 = DAG.getNode(ISD::FADD, dl, MVT::f32, t4,
3252 getF32Constant(DAG, 0x3c1d8c17));
3253 SDValue t6 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t5, X);
3254 SDValue t7 = DAG.getNode(ISD::FADD, dl, MVT::f32, t6,
3255 getF32Constant(DAG, 0x3d634a1d));
3256 SDValue t8 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t7, X);
3257 SDValue t9 = DAG.getNode(ISD::FADD, dl, MVT::f32, t8,
3258 getF32Constant(DAG, 0x3e75fe14));
3259 SDValue t10 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t9, X);
3260 SDValue t11 = DAG.getNode(ISD::FADD, dl, MVT::f32, t10,
3261 getF32Constant(DAG, 0x3f317234));
3262 SDValue t12 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t11, X);
3263 SDValue t13 = DAG.getNode(ISD::FADD, dl, MVT::f32, t12,
3264 getF32Constant(DAG, 0x3f800000));
3265 SDValue TwoToFracPartOfX = DAG.getNode(ISD::BIT_CONVERT, dl,
3268 // Add the exponent into the result in integer domain.
3269 SDValue t14 = DAG.getNode(ISD::ADD, dl, MVT::i32,
3270 TwoToFracPartOfX, IntegerPartOfX);
3272 result = DAG.getNode(ISD::BIT_CONVERT, dl, MVT::f32, t14);
3275 // No special expansion.
3276 result = DAG.getNode(ISD::FEXP, dl,
3277 getValue(I.getOperand(1)).getValueType(),
3278 getValue(I.getOperand(1)));
3281 setValue(&I, result);
3284 /// visitLog - Lower a log intrinsic. Handles the special sequences for
3285 /// limited-precision mode.
3287 SelectionDAGLowering::visitLog(CallInst &I) {
3289 DebugLoc dl = getCurDebugLoc();
3291 if (getValue(I.getOperand(1)).getValueType() == MVT::f32 &&
3292 LimitFloatPrecision > 0 && LimitFloatPrecision <= 18) {
3293 SDValue Op = getValue(I.getOperand(1));
3294 SDValue Op1 = DAG.getNode(ISD::BIT_CONVERT, dl, MVT::i32, Op);
3296 // Scale the exponent by log(2) [0.69314718f].
3297 SDValue Exp = GetExponent(DAG, Op1, TLI, dl);
3298 SDValue LogOfExponent = DAG.getNode(ISD::FMUL, dl, MVT::f32, Exp,
3299 getF32Constant(DAG, 0x3f317218));
3301 // Get the significand and build it into a floating-point number with
3303 SDValue X = GetSignificand(DAG, Op1, dl);
3305 if (LimitFloatPrecision <= 6) {
3306 // For floating-point precision of 6:
3310 // (1.4034025f - 0.23903021f * x) * x;
3312 // error 0.0034276066, which is better than 8 bits
3313 SDValue t0 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
3314 getF32Constant(DAG, 0xbe74c456));
3315 SDValue t1 = DAG.getNode(ISD::FADD, dl, MVT::f32, t0,
3316 getF32Constant(DAG, 0x3fb3a2b1));
3317 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t1, X);
3318 SDValue LogOfMantissa = DAG.getNode(ISD::FSUB, dl, MVT::f32, t2,
3319 getF32Constant(DAG, 0x3f949a29));
3321 result = DAG.getNode(ISD::FADD, dl,
3322 MVT::f32, LogOfExponent, LogOfMantissa);
3323 } else if (LimitFloatPrecision > 6 && LimitFloatPrecision <= 12) {
3324 // For floating-point precision of 12:
3330 // (0.44717955f - 0.56570851e-1f * x) * x) * x) * x;
3332 // error 0.000061011436, which is 14 bits
3333 SDValue t0 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
3334 getF32Constant(DAG, 0xbd67b6d6));
3335 SDValue t1 = DAG.getNode(ISD::FADD, dl, MVT::f32, t0,
3336 getF32Constant(DAG, 0x3ee4f4b8));
3337 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t1, X);
3338 SDValue t3 = DAG.getNode(ISD::FSUB, dl, MVT::f32, t2,
3339 getF32Constant(DAG, 0x3fbc278b));
3340 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X);
3341 SDValue t5 = DAG.getNode(ISD::FADD, dl, MVT::f32, t4,
3342 getF32Constant(DAG, 0x40348e95));
3343 SDValue t6 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t5, X);
3344 SDValue LogOfMantissa = DAG.getNode(ISD::FSUB, dl, MVT::f32, t6,
3345 getF32Constant(DAG, 0x3fdef31a));
3347 result = DAG.getNode(ISD::FADD, dl,
3348 MVT::f32, LogOfExponent, LogOfMantissa);
3349 } else { // LimitFloatPrecision > 12 && LimitFloatPrecision <= 18
3350 // For floating-point precision of 18:
3358 // (0.19073739f - 0.17809712e-1f * x) * x) * x) * x) * x)*x;
3360 // error 0.0000023660568, which is better than 18 bits
3361 SDValue t0 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
3362 getF32Constant(DAG, 0xbc91e5ac));
3363 SDValue t1 = DAG.getNode(ISD::FADD, dl, MVT::f32, t0,
3364 getF32Constant(DAG, 0x3e4350aa));
3365 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t1, X);
3366 SDValue t3 = DAG.getNode(ISD::FSUB, dl, MVT::f32, t2,
3367 getF32Constant(DAG, 0x3f60d3e3));
3368 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X);
3369 SDValue t5 = DAG.getNode(ISD::FADD, dl, MVT::f32, t4,
3370 getF32Constant(DAG, 0x4011cdf0));
3371 SDValue t6 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t5, X);
3372 SDValue t7 = DAG.getNode(ISD::FSUB, dl, MVT::f32, t6,
3373 getF32Constant(DAG, 0x406cfd1c));
3374 SDValue t8 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t7, X);
3375 SDValue t9 = DAG.getNode(ISD::FADD, dl, MVT::f32, t8,
3376 getF32Constant(DAG, 0x408797cb));
3377 SDValue t10 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t9, X);
3378 SDValue LogOfMantissa = DAG.getNode(ISD::FSUB, dl, MVT::f32, t10,
3379 getF32Constant(DAG, 0x4006dcab));
3381 result = DAG.getNode(ISD::FADD, dl,
3382 MVT::f32, LogOfExponent, LogOfMantissa);
3385 // No special expansion.
3386 result = DAG.getNode(ISD::FLOG, dl,
3387 getValue(I.getOperand(1)).getValueType(),
3388 getValue(I.getOperand(1)));
3391 setValue(&I, result);
3394 /// visitLog2 - Lower a log2 intrinsic. Handles the special sequences for
3395 /// limited-precision mode.
3397 SelectionDAGLowering::visitLog2(CallInst &I) {
3399 DebugLoc dl = getCurDebugLoc();
3401 if (getValue(I.getOperand(1)).getValueType() == MVT::f32 &&
3402 LimitFloatPrecision > 0 && LimitFloatPrecision <= 18) {
3403 SDValue Op = getValue(I.getOperand(1));
3404 SDValue Op1 = DAG.getNode(ISD::BIT_CONVERT, dl, MVT::i32, Op);
3406 // Get the exponent.
3407 SDValue LogOfExponent = GetExponent(DAG, Op1, TLI, dl);
3409 // Get the significand and build it into a floating-point number with
3411 SDValue X = GetSignificand(DAG, Op1, dl);
3413 // Different possible minimax approximations of significand in
3414 // floating-point for various degrees of accuracy over [1,2].
3415 if (LimitFloatPrecision <= 6) {
3416 // For floating-point precision of 6:
3418 // Log2ofMantissa = -1.6749035f + (2.0246817f - .34484768f * x) * x;
3420 // error 0.0049451742, which is more than 7 bits
3421 SDValue t0 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
3422 getF32Constant(DAG, 0xbeb08fe0));
3423 SDValue t1 = DAG.getNode(ISD::FADD, dl, MVT::f32, t0,
3424 getF32Constant(DAG, 0x40019463));
3425 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t1, X);
3426 SDValue Log2ofMantissa = DAG.getNode(ISD::FSUB, dl, MVT::f32, t2,
3427 getF32Constant(DAG, 0x3fd6633d));
3429 result = DAG.getNode(ISD::FADD, dl,
3430 MVT::f32, LogOfExponent, Log2ofMantissa);
3431 } else if (LimitFloatPrecision > 6 && LimitFloatPrecision <= 12) {
3432 // For floating-point precision of 12:
3438 // (.645142248f - 0.816157886e-1f * x) * x) * x) * x;
3440 // error 0.0000876136000, which is better than 13 bits
3441 SDValue t0 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
3442 getF32Constant(DAG, 0xbda7262e));
3443 SDValue t1 = DAG.getNode(ISD::FADD, dl, MVT::f32, t0,
3444 getF32Constant(DAG, 0x3f25280b));
3445 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t1, X);
3446 SDValue t3 = DAG.getNode(ISD::FSUB, dl, MVT::f32, t2,
3447 getF32Constant(DAG, 0x4007b923));
3448 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X);
3449 SDValue t5 = DAG.getNode(ISD::FADD, dl, MVT::f32, t4,
3450 getF32Constant(DAG, 0x40823e2f));
3451 SDValue t6 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t5, X);
3452 SDValue Log2ofMantissa = DAG.getNode(ISD::FSUB, dl, MVT::f32, t6,
3453 getF32Constant(DAG, 0x4020d29c));
3455 result = DAG.getNode(ISD::FADD, dl,
3456 MVT::f32, LogOfExponent, Log2ofMantissa);
3457 } else { // LimitFloatPrecision > 12 && LimitFloatPrecision <= 18
3458 // For floating-point precision of 18:
3467 // 0.25691327e-1f * x) * x) * x) * x) * x) * x;
3469 // error 0.0000018516, which is better than 18 bits
3470 SDValue t0 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
3471 getF32Constant(DAG, 0xbcd2769e));
3472 SDValue t1 = DAG.getNode(ISD::FADD, dl, MVT::f32, t0,
3473 getF32Constant(DAG, 0x3e8ce0b9));
3474 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t1, X);
3475 SDValue t3 = DAG.getNode(ISD::FSUB, dl, MVT::f32, t2,
3476 getF32Constant(DAG, 0x3fa22ae7));
3477 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X);
3478 SDValue t5 = DAG.getNode(ISD::FADD, dl, MVT::f32, t4,
3479 getF32Constant(DAG, 0x40525723));
3480 SDValue t6 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t5, X);
3481 SDValue t7 = DAG.getNode(ISD::FSUB, dl, MVT::f32, t6,
3482 getF32Constant(DAG, 0x40aaf200));
3483 SDValue t8 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t7, X);
3484 SDValue t9 = DAG.getNode(ISD::FADD, dl, MVT::f32, t8,
3485 getF32Constant(DAG, 0x40c39dad));
3486 SDValue t10 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t9, X);
3487 SDValue Log2ofMantissa = DAG.getNode(ISD::FSUB, dl, MVT::f32, t10,
3488 getF32Constant(DAG, 0x4042902c));
3490 result = DAG.getNode(ISD::FADD, dl,
3491 MVT::f32, LogOfExponent, Log2ofMantissa);
3494 // No special expansion.
3495 result = DAG.getNode(ISD::FLOG2, dl,
3496 getValue(I.getOperand(1)).getValueType(),
3497 getValue(I.getOperand(1)));
3500 setValue(&I, result);
3503 /// visitLog10 - Lower a log10 intrinsic. Handles the special sequences for
3504 /// limited-precision mode.
3506 SelectionDAGLowering::visitLog10(CallInst &I) {
3508 DebugLoc dl = getCurDebugLoc();
3510 if (getValue(I.getOperand(1)).getValueType() == MVT::f32 &&
3511 LimitFloatPrecision > 0 && LimitFloatPrecision <= 18) {
3512 SDValue Op = getValue(I.getOperand(1));
3513 SDValue Op1 = DAG.getNode(ISD::BIT_CONVERT, dl, MVT::i32, Op);
3515 // Scale the exponent by log10(2) [0.30102999f].
3516 SDValue Exp = GetExponent(DAG, Op1, TLI, dl);
3517 SDValue LogOfExponent = DAG.getNode(ISD::FMUL, dl, MVT::f32, Exp,
3518 getF32Constant(DAG, 0x3e9a209a));
3520 // Get the significand and build it into a floating-point number with
3522 SDValue X = GetSignificand(DAG, Op1, dl);
3524 if (LimitFloatPrecision <= 6) {
3525 // For floating-point precision of 6:
3527 // Log10ofMantissa =
3529 // (0.60948995f - 0.10380950f * x) * x;
3531 // error 0.0014886165, which is 6 bits
3532 SDValue t0 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
3533 getF32Constant(DAG, 0xbdd49a13));
3534 SDValue t1 = DAG.getNode(ISD::FADD, dl, MVT::f32, t0,
3535 getF32Constant(DAG, 0x3f1c0789));
3536 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t1, X);
3537 SDValue Log10ofMantissa = DAG.getNode(ISD::FSUB, dl, MVT::f32, t2,
3538 getF32Constant(DAG, 0x3f011300));
3540 result = DAG.getNode(ISD::FADD, dl,
3541 MVT::f32, LogOfExponent, Log10ofMantissa);
3542 } else if (LimitFloatPrecision > 6 && LimitFloatPrecision <= 12) {
3543 // For floating-point precision of 12:
3545 // Log10ofMantissa =
3548 // (-0.31664806f + 0.47637168e-1f * x) * x) * x;
3550 // error 0.00019228036, which is better than 12 bits
3551 SDValue t0 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
3552 getF32Constant(DAG, 0x3d431f31));
3553 SDValue t1 = DAG.getNode(ISD::FSUB, dl, MVT::f32, t0,
3554 getF32Constant(DAG, 0x3ea21fb2));
3555 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t1, X);
3556 SDValue t3 = DAG.getNode(ISD::FADD, dl, MVT::f32, t2,
3557 getF32Constant(DAG, 0x3f6ae232));
3558 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X);
3559 SDValue Log10ofMantissa = DAG.getNode(ISD::FSUB, dl, MVT::f32, t4,
3560 getF32Constant(DAG, 0x3f25f7c3));
3562 result = DAG.getNode(ISD::FADD, dl,
3563 MVT::f32, LogOfExponent, Log10ofMantissa);
3564 } else { // LimitFloatPrecision > 12 && LimitFloatPrecision <= 18
3565 // For floating-point precision of 18:
3567 // Log10ofMantissa =
3572 // (-0.12539807f + 0.13508273e-1f * x) * x) * x) * x) * x;
3574 // error 0.0000037995730, which is better than 18 bits
3575 SDValue t0 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
3576 getF32Constant(DAG, 0x3c5d51ce));
3577 SDValue t1 = DAG.getNode(ISD::FSUB, dl, MVT::f32, t0,
3578 getF32Constant(DAG, 0x3e00685a));
3579 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t1, X);
3580 SDValue t3 = DAG.getNode(ISD::FADD, dl, MVT::f32, t2,
3581 getF32Constant(DAG, 0x3efb6798));
3582 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X);
3583 SDValue t5 = DAG.getNode(ISD::FSUB, dl, MVT::f32, t4,
3584 getF32Constant(DAG, 0x3f88d192));
3585 SDValue t6 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t5, X);
3586 SDValue t7 = DAG.getNode(ISD::FADD, dl, MVT::f32, t6,
3587 getF32Constant(DAG, 0x3fc4316c));
3588 SDValue t8 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t7, X);
3589 SDValue Log10ofMantissa = DAG.getNode(ISD::FSUB, dl, MVT::f32, t8,
3590 getF32Constant(DAG, 0x3f57ce70));
3592 result = DAG.getNode(ISD::FADD, dl,
3593 MVT::f32, LogOfExponent, Log10ofMantissa);
3596 // No special expansion.
3597 result = DAG.getNode(ISD::FLOG10, dl,
3598 getValue(I.getOperand(1)).getValueType(),
3599 getValue(I.getOperand(1)));
3602 setValue(&I, result);
3605 /// visitExp2 - Lower an exp2 intrinsic. Handles the special sequences for
3606 /// limited-precision mode.
3608 SelectionDAGLowering::visitExp2(CallInst &I) {
3610 DebugLoc dl = getCurDebugLoc();
3612 if (getValue(I.getOperand(1)).getValueType() == MVT::f32 &&
3613 LimitFloatPrecision > 0 && LimitFloatPrecision <= 18) {
3614 SDValue Op = getValue(I.getOperand(1));
3616 SDValue IntegerPartOfX = DAG.getNode(ISD::FP_TO_SINT, dl, MVT::i32, Op);
3618 // FractionalPartOfX = x - (float)IntegerPartOfX;
3619 SDValue t1 = DAG.getNode(ISD::SINT_TO_FP, dl, MVT::f32, IntegerPartOfX);
3620 SDValue X = DAG.getNode(ISD::FSUB, dl, MVT::f32, Op, t1);
3622 // IntegerPartOfX <<= 23;
3623 IntegerPartOfX = DAG.getNode(ISD::SHL, dl, MVT::i32, IntegerPartOfX,
3624 DAG.getConstant(23, TLI.getPointerTy()));
3626 if (LimitFloatPrecision <= 6) {
3627 // For floating-point precision of 6:
3629 // TwoToFractionalPartOfX =
3631 // (0.735607626f + 0.252464424f * x) * x;
3633 // error 0.0144103317, which is 6 bits
3634 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
3635 getF32Constant(DAG, 0x3e814304));
3636 SDValue t3 = DAG.getNode(ISD::FADD, dl, MVT::f32, t2,
3637 getF32Constant(DAG, 0x3f3c50c8));
3638 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X);
3639 SDValue t5 = DAG.getNode(ISD::FADD, dl, MVT::f32, t4,
3640 getF32Constant(DAG, 0x3f7f5e7e));
3641 SDValue t6 = DAG.getNode(ISD::BIT_CONVERT, dl, MVT::i32, t5);
3642 SDValue TwoToFractionalPartOfX =
3643 DAG.getNode(ISD::ADD, dl, MVT::i32, t6, IntegerPartOfX);
3645 result = DAG.getNode(ISD::BIT_CONVERT, dl,
3646 MVT::f32, TwoToFractionalPartOfX);
3647 } else if (LimitFloatPrecision > 6 && LimitFloatPrecision <= 12) {
3648 // For floating-point precision of 12:
3650 // TwoToFractionalPartOfX =
3653 // (0.224338339f + 0.792043434e-1f * x) * x) * x;
3655 // error 0.000107046256, which is 13 to 14 bits
3656 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
3657 getF32Constant(DAG, 0x3da235e3));
3658 SDValue t3 = DAG.getNode(ISD::FADD, dl, MVT::f32, t2,
3659 getF32Constant(DAG, 0x3e65b8f3));
3660 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X);
3661 SDValue t5 = DAG.getNode(ISD::FADD, dl, MVT::f32, t4,
3662 getF32Constant(DAG, 0x3f324b07));
3663 SDValue t6 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t5, X);
3664 SDValue t7 = DAG.getNode(ISD::FADD, dl, MVT::f32, t6,
3665 getF32Constant(DAG, 0x3f7ff8fd));
3666 SDValue t8 = DAG.getNode(ISD::BIT_CONVERT, dl, MVT::i32, t7);
3667 SDValue TwoToFractionalPartOfX =
3668 DAG.getNode(ISD::ADD, dl, MVT::i32, t8, IntegerPartOfX);
3670 result = DAG.getNode(ISD::BIT_CONVERT, dl,
3671 MVT::f32, TwoToFractionalPartOfX);
3672 } else { // LimitFloatPrecision > 12 && LimitFloatPrecision <= 18
3673 // For floating-point precision of 18:
3675 // TwoToFractionalPartOfX =
3679 // (0.554906021e-1f +
3680 // (0.961591928e-2f +
3681 // (0.136028312e-2f + 0.157059148e-3f *x)*x)*x)*x)*x)*x;
3682 // error 2.47208000*10^(-7), which is better than 18 bits
3683 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
3684 getF32Constant(DAG, 0x3924b03e));
3685 SDValue t3 = DAG.getNode(ISD::FADD, dl, MVT::f32, t2,
3686 getF32Constant(DAG, 0x3ab24b87));
3687 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X);
3688 SDValue t5 = DAG.getNode(ISD::FADD, dl, MVT::f32, t4,
3689 getF32Constant(DAG, 0x3c1d8c17));
3690 SDValue t6 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t5, X);
3691 SDValue t7 = DAG.getNode(ISD::FADD, dl, MVT::f32, t6,
3692 getF32Constant(DAG, 0x3d634a1d));
3693 SDValue t8 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t7, X);
3694 SDValue t9 = DAG.getNode(ISD::FADD, dl, MVT::f32, t8,
3695 getF32Constant(DAG, 0x3e75fe14));
3696 SDValue t10 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t9, X);
3697 SDValue t11 = DAG.getNode(ISD::FADD, dl, MVT::f32, t10,
3698 getF32Constant(DAG, 0x3f317234));
3699 SDValue t12 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t11, X);
3700 SDValue t13 = DAG.getNode(ISD::FADD, dl, MVT::f32, t12,
3701 getF32Constant(DAG, 0x3f800000));
3702 SDValue t14 = DAG.getNode(ISD::BIT_CONVERT, dl, MVT::i32, t13);
3703 SDValue TwoToFractionalPartOfX =
3704 DAG.getNode(ISD::ADD, dl, MVT::i32, t14, IntegerPartOfX);
3706 result = DAG.getNode(ISD::BIT_CONVERT, dl,
3707 MVT::f32, TwoToFractionalPartOfX);
3710 // No special expansion.
3711 result = DAG.getNode(ISD::FEXP2, dl,
3712 getValue(I.getOperand(1)).getValueType(),
3713 getValue(I.getOperand(1)));
3716 setValue(&I, result);
3719 /// visitPow - Lower a pow intrinsic. Handles the special sequences for
3720 /// limited-precision mode with x == 10.0f.
3722 SelectionDAGLowering::visitPow(CallInst &I) {
3724 Value *Val = I.getOperand(1);
3725 DebugLoc dl = getCurDebugLoc();
3726 bool IsExp10 = false;
3728 if (getValue(Val).getValueType() == MVT::f32 &&
3729 getValue(I.getOperand(2)).getValueType() == MVT::f32 &&
3730 LimitFloatPrecision > 0 && LimitFloatPrecision <= 18) {
3731 if (Constant *C = const_cast<Constant*>(dyn_cast<Constant>(Val))) {
3732 if (ConstantFP *CFP = dyn_cast<ConstantFP>(C)) {
3734 IsExp10 = CFP->getValueAPF().bitwiseIsEqual(Ten);
3739 if (IsExp10 && LimitFloatPrecision > 0 && LimitFloatPrecision <= 18) {
3740 SDValue Op = getValue(I.getOperand(2));
3742 // Put the exponent in the right bit position for later addition to the
3745 // #define LOG2OF10 3.3219281f
3746 // IntegerPartOfX = (int32_t)(x * LOG2OF10);
3747 SDValue t0 = DAG.getNode(ISD::FMUL, dl, MVT::f32, Op,
3748 getF32Constant(DAG, 0x40549a78));
3749 SDValue IntegerPartOfX = DAG.getNode(ISD::FP_TO_SINT, dl, MVT::i32, t0);
3751 // FractionalPartOfX = x - (float)IntegerPartOfX;
3752 SDValue t1 = DAG.getNode(ISD::SINT_TO_FP, dl, MVT::f32, IntegerPartOfX);
3753 SDValue X = DAG.getNode(ISD::FSUB, dl, MVT::f32, t0, t1);
3755 // IntegerPartOfX <<= 23;
3756 IntegerPartOfX = DAG.getNode(ISD::SHL, dl, MVT::i32, IntegerPartOfX,
3757 DAG.getConstant(23, TLI.getPointerTy()));
3759 if (LimitFloatPrecision <= 6) {
3760 // For floating-point precision of 6:
3762 // twoToFractionalPartOfX =
3764 // (0.735607626f + 0.252464424f * x) * x;
3766 // error 0.0144103317, which is 6 bits
3767 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
3768 getF32Constant(DAG, 0x3e814304));
3769 SDValue t3 = DAG.getNode(ISD::FADD, dl, MVT::f32, t2,
3770 getF32Constant(DAG, 0x3f3c50c8));
3771 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X);
3772 SDValue t5 = DAG.getNode(ISD::FADD, dl, MVT::f32, t4,
3773 getF32Constant(DAG, 0x3f7f5e7e));
3774 SDValue t6 = DAG.getNode(ISD::BIT_CONVERT, dl, MVT::i32, t5);
3775 SDValue TwoToFractionalPartOfX =
3776 DAG.getNode(ISD::ADD, dl, MVT::i32, t6, IntegerPartOfX);
3778 result = DAG.getNode(ISD::BIT_CONVERT, dl,
3779 MVT::f32, TwoToFractionalPartOfX);
3780 } else if (LimitFloatPrecision > 6 && LimitFloatPrecision <= 12) {
3781 // For floating-point precision of 12:
3783 // TwoToFractionalPartOfX =
3786 // (0.224338339f + 0.792043434e-1f * x) * x) * x;
3788 // error 0.000107046256, which is 13 to 14 bits
3789 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
3790 getF32Constant(DAG, 0x3da235e3));
3791 SDValue t3 = DAG.getNode(ISD::FADD, dl, MVT::f32, t2,
3792 getF32Constant(DAG, 0x3e65b8f3));
3793 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X);
3794 SDValue t5 = DAG.getNode(ISD::FADD, dl, MVT::f32, t4,
3795 getF32Constant(DAG, 0x3f324b07));
3796 SDValue t6 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t5, X);
3797 SDValue t7 = DAG.getNode(ISD::FADD, dl, MVT::f32, t6,
3798 getF32Constant(DAG, 0x3f7ff8fd));
3799 SDValue t8 = DAG.getNode(ISD::BIT_CONVERT, dl, MVT::i32, t7);
3800 SDValue TwoToFractionalPartOfX =
3801 DAG.getNode(ISD::ADD, dl, MVT::i32, t8, IntegerPartOfX);
3803 result = DAG.getNode(ISD::BIT_CONVERT, dl,
3804 MVT::f32, TwoToFractionalPartOfX);
3805 } else { // LimitFloatPrecision > 12 && LimitFloatPrecision <= 18
3806 // For floating-point precision of 18:
3808 // TwoToFractionalPartOfX =
3812 // (0.554906021e-1f +
3813 // (0.961591928e-2f +
3814 // (0.136028312e-2f + 0.157059148e-3f *x)*x)*x)*x)*x)*x;
3815 // error 2.47208000*10^(-7), which is better than 18 bits
3816 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X,
3817 getF32Constant(DAG, 0x3924b03e));
3818 SDValue t3 = DAG.getNode(ISD::FADD, dl, MVT::f32, t2,
3819 getF32Constant(DAG, 0x3ab24b87));
3820 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X);
3821 SDValue t5 = DAG.getNode(ISD::FADD, dl, MVT::f32, t4,
3822 getF32Constant(DAG, 0x3c1d8c17));
3823 SDValue t6 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t5, X);
3824 SDValue t7 = DAG.getNode(ISD::FADD, dl, MVT::f32, t6,
3825 getF32Constant(DAG, 0x3d634a1d));
3826 SDValue t8 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t7, X);
3827 SDValue t9 = DAG.getNode(ISD::FADD, dl, MVT::f32, t8,
3828 getF32Constant(DAG, 0x3e75fe14));
3829 SDValue t10 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t9, X);
3830 SDValue t11 = DAG.getNode(ISD::FADD, dl, MVT::f32, t10,
3831 getF32Constant(DAG, 0x3f317234));
3832 SDValue t12 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t11, X);
3833 SDValue t13 = DAG.getNode(ISD::FADD, dl, MVT::f32, t12,
3834 getF32Constant(DAG, 0x3f800000));
3835 SDValue t14 = DAG.getNode(ISD::BIT_CONVERT, dl, MVT::i32, t13);
3836 SDValue TwoToFractionalPartOfX =
3837 DAG.getNode(ISD::ADD, dl, MVT::i32, t14, IntegerPartOfX);
3839 result = DAG.getNode(ISD::BIT_CONVERT, dl,
3840 MVT::f32, TwoToFractionalPartOfX);
3843 // No special expansion.
3844 result = DAG.getNode(ISD::FPOW, dl,
3845 getValue(I.getOperand(1)).getValueType(),
3846 getValue(I.getOperand(1)),
3847 getValue(I.getOperand(2)));
3850 setValue(&I, result);
3853 /// visitIntrinsicCall - Lower the call to the specified intrinsic function. If
3854 /// we want to emit this as a call to a named external function, return the name
3855 /// otherwise lower it and return null.
3857 SelectionDAGLowering::visitIntrinsicCall(CallInst &I, unsigned Intrinsic) {
3858 DebugLoc dl = getCurDebugLoc();
3859 switch (Intrinsic) {
3861 // By default, turn this into a target intrinsic node.
3862 visitTargetIntrinsic(I, Intrinsic);
3864 case Intrinsic::vastart: visitVAStart(I); return 0;
3865 case Intrinsic::vaend: visitVAEnd(I); return 0;
3866 case Intrinsic::vacopy: visitVACopy(I); return 0;
3867 case Intrinsic::returnaddress:
3868 setValue(&I, DAG.getNode(ISD::RETURNADDR, dl, TLI.getPointerTy(),
3869 getValue(I.getOperand(1))));
3871 case Intrinsic::frameaddress:
3872 setValue(&I, DAG.getNode(ISD::FRAMEADDR, dl, TLI.getPointerTy(),
3873 getValue(I.getOperand(1))));
3875 case Intrinsic::setjmp:
3876 return "_setjmp"+!TLI.usesUnderscoreSetJmp();
3878 case Intrinsic::longjmp:
3879 return "_longjmp"+!TLI.usesUnderscoreLongJmp();
3881 case Intrinsic::memcpy: {
3882 SDValue Op1 = getValue(I.getOperand(1));
3883 SDValue Op2 = getValue(I.getOperand(2));
3884 SDValue Op3 = getValue(I.getOperand(3));
3885 unsigned Align = cast<ConstantInt>(I.getOperand(4))->getZExtValue();
3886 DAG.setRoot(DAG.getMemcpy(getRoot(), dl, Op1, Op2, Op3, Align, false,
3887 I.getOperand(1), 0, I.getOperand(2), 0));
3890 case Intrinsic::memset: {
3891 SDValue Op1 = getValue(I.getOperand(1));
3892 SDValue Op2 = getValue(I.getOperand(2));
3893 SDValue Op3 = getValue(I.getOperand(3));
3894 unsigned Align = cast<ConstantInt>(I.getOperand(4))->getZExtValue();
3895 DAG.setRoot(DAG.getMemset(getRoot(), dl, Op1, Op2, Op3, Align,
3896 I.getOperand(1), 0));
3899 case Intrinsic::memmove: {
3900 SDValue Op1 = getValue(I.getOperand(1));
3901 SDValue Op2 = getValue(I.getOperand(2));
3902 SDValue Op3 = getValue(I.getOperand(3));
3903 unsigned Align = cast<ConstantInt>(I.getOperand(4))->getZExtValue();
3905 // If the source and destination are known to not be aliases, we can
3906 // lower memmove as memcpy.
3907 uint64_t Size = -1ULL;
3908 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op3))
3909 Size = C->getZExtValue();
3910 if (AA->alias(I.getOperand(1), Size, I.getOperand(2), Size) ==
3911 AliasAnalysis::NoAlias) {
3912 DAG.setRoot(DAG.getMemcpy(getRoot(), dl, Op1, Op2, Op3, Align, false,
3913 I.getOperand(1), 0, I.getOperand(2), 0));
3917 DAG.setRoot(DAG.getMemmove(getRoot(), dl, Op1, Op2, Op3, Align,
3918 I.getOperand(1), 0, I.getOperand(2), 0));
3921 case Intrinsic::dbg_stoppoint: {
3922 DwarfWriter *DW = DAG.getDwarfWriter();
3923 DbgStopPointInst &SPI = cast<DbgStopPointInst>(I);
3924 if (DW && DW->ValidDebugInfo(SPI.getContext())) {
3925 MachineFunction &MF = DAG.getMachineFunction();
3927 DAG.setRoot(DAG.getDbgStopPoint(getRoot(),
3931 DICompileUnit CU(cast<GlobalVariable>(SPI.getContext()));
3932 std::string Dir, FN;
3933 unsigned SrcFile = DW->getOrCreateSourceID(CU.getDirectory(Dir),
3934 CU.getFilename(FN));
3935 unsigned idx = MF.getOrCreateDebugLocID(SrcFile,
3936 SPI.getLine(), SPI.getColumn());
3937 setCurDebugLoc(DebugLoc::get(idx));
3941 case Intrinsic::dbg_region_start: {
3942 DwarfWriter *DW = DAG.getDwarfWriter();
3943 DbgRegionStartInst &RSI = cast<DbgRegionStartInst>(I);
3944 if (DW && DW->ValidDebugInfo(RSI.getContext())) {
3946 DW->RecordRegionStart(cast<GlobalVariable>(RSI.getContext()));
3948 DAG.setRoot(DAG.getLabel(ISD::DBG_LABEL, getCurDebugLoc(),
3949 getRoot(), LabelID));
3954 case Intrinsic::dbg_region_end: {
3955 DwarfWriter *DW = DAG.getDwarfWriter();
3956 DbgRegionEndInst &REI = cast<DbgRegionEndInst>(I);
3957 if (DW && DW->ValidDebugInfo(REI.getContext())) {
3959 MachineFunction &MF = DAG.getMachineFunction();
3960 DISubprogram Subprogram(cast<GlobalVariable>(REI.getContext()));
3962 Subprogram.getLinkageName(SPName);
3964 && strcmp(SPName.c_str(), MF.getFunction()->getNameStart())) {
3965 // This is end of inlined function. Debugging information for
3966 // inlined function is not handled yet (only supported by FastISel).
3971 DW->RecordRegionEnd(cast<GlobalVariable>(REI.getContext()));
3973 DAG.setRoot(DAG.getLabel(ISD::DBG_LABEL, getCurDebugLoc(),
3974 getRoot(), LabelID));
3979 case Intrinsic::dbg_func_start: {
3980 DwarfWriter *DW = DAG.getDwarfWriter();
3982 DbgFuncStartInst &FSI = cast<DbgFuncStartInst>(I);
3983 Value *SP = FSI.getSubprogram();
3984 if (SP && DW->ValidDebugInfo(SP)) {
3985 // llvm.dbg.func.start implicitly defines a dbg_stoppoint which is
3986 // what (most?) gdb expects.
3987 MachineFunction &MF = DAG.getMachineFunction();
3988 DISubprogram Subprogram(cast<GlobalVariable>(SP));
3991 Subprogram.getLinkageName(SPName);
3993 && strcmp(SPName.c_str(), MF.getFunction()->getNameStart())) {
3994 // This is beginning of inlined function. Debugging information for
3995 // inlined function is not handled yet (only supported by FastISel).
3999 DICompileUnit CompileUnit = Subprogram.getCompileUnit();
4000 std::string Dir, FN;
4001 unsigned SrcFile = DW->getOrCreateSourceID(CompileUnit.getDirectory(Dir),
4002 CompileUnit.getFilename(FN));
4004 // Record the source line but does not create a label for the normal
4005 // function start. It will be emitted at asm emission time. However,
4006 // create a label if this is a beginning of inlined function.
4007 unsigned Line = Subprogram.getLineNumber();
4010 unsigned LabelID = DW->RecordSourceLine(Line, 0, SrcFile);
4011 if (DW->getRecordSourceLineCount() != 1)
4012 DAG.setRoot(DAG.getLabel(ISD::DBG_LABEL, getCurDebugLoc(),
4013 getRoot(), LabelID));
4016 setCurDebugLoc(DebugLoc::get(MF.getOrCreateDebugLocID(SrcFile, Line, 0)));
4021 case Intrinsic::dbg_declare: {
4023 DwarfWriter *DW = DAG.getDwarfWriter();
4024 DbgDeclareInst &DI = cast<DbgDeclareInst>(I);
4025 Value *Variable = DI.getVariable();
4026 if (DW && DW->ValidDebugInfo(Variable))
4027 DAG.setRoot(DAG.getNode(ISD::DECLARE, dl, MVT::Other, getRoot(),
4028 getValue(DI.getAddress()), getValue(Variable)));
4030 // FIXME: Do something sensible here when we support debug declare.
4034 case Intrinsic::eh_exception: {
4035 if (!CurMBB->isLandingPad()) {
4036 // FIXME: Mark exception register as live in. Hack for PR1508.
4037 unsigned Reg = TLI.getExceptionAddressRegister();
4038 if (Reg) CurMBB->addLiveIn(Reg);
4040 // Insert the EXCEPTIONADDR instruction.
4041 SDVTList VTs = DAG.getVTList(TLI.getPointerTy(), MVT::Other);
4043 Ops[0] = DAG.getRoot();
4044 SDValue Op = DAG.getNode(ISD::EXCEPTIONADDR, dl, VTs, Ops, 1);
4046 DAG.setRoot(Op.getValue(1));
4050 case Intrinsic::eh_selector_i32:
4051 case Intrinsic::eh_selector_i64: {
4052 MachineModuleInfo *MMI = DAG.getMachineModuleInfo();
4053 MVT VT = (Intrinsic == Intrinsic::eh_selector_i32 ?
4054 MVT::i32 : MVT::i64);
4057 if (CurMBB->isLandingPad())
4058 AddCatchInfo(I, MMI, CurMBB);
4061 FuncInfo.CatchInfoLost.insert(&I);
4063 // FIXME: Mark exception selector register as live in. Hack for PR1508.
4064 unsigned Reg = TLI.getExceptionSelectorRegister();
4065 if (Reg) CurMBB->addLiveIn(Reg);
4068 // Insert the EHSELECTION instruction.
4069 SDVTList VTs = DAG.getVTList(VT, MVT::Other);
4071 Ops[0] = getValue(I.getOperand(1));
4073 SDValue Op = DAG.getNode(ISD::EHSELECTION, dl, VTs, Ops, 2);
4075 DAG.setRoot(Op.getValue(1));
4077 setValue(&I, DAG.getConstant(0, VT));
4083 case Intrinsic::eh_typeid_for_i32:
4084 case Intrinsic::eh_typeid_for_i64: {
4085 MachineModuleInfo *MMI = DAG.getMachineModuleInfo();
4086 MVT VT = (Intrinsic == Intrinsic::eh_typeid_for_i32 ?
4087 MVT::i32 : MVT::i64);
4090 // Find the type id for the given typeinfo.
4091 GlobalVariable *GV = ExtractTypeInfo(I.getOperand(1));
4093 unsigned TypeID = MMI->getTypeIDFor(GV);
4094 setValue(&I, DAG.getConstant(TypeID, VT));
4096 // Return something different to eh_selector.
4097 setValue(&I, DAG.getConstant(1, VT));
4103 case Intrinsic::eh_return_i32:
4104 case Intrinsic::eh_return_i64:
4105 if (MachineModuleInfo *MMI = DAG.getMachineModuleInfo()) {
4106 MMI->setCallsEHReturn(true);
4107 DAG.setRoot(DAG.getNode(ISD::EH_RETURN, dl,
4110 getValue(I.getOperand(1)),
4111 getValue(I.getOperand(2))));
4113 setValue(&I, DAG.getConstant(0, TLI.getPointerTy()));
4117 case Intrinsic::eh_unwind_init:
4118 if (MachineModuleInfo *MMI = DAG.getMachineModuleInfo()) {
4119 MMI->setCallsUnwindInit(true);
4124 case Intrinsic::eh_dwarf_cfa: {
4125 MVT VT = getValue(I.getOperand(1)).getValueType();
4127 if (VT.bitsGT(TLI.getPointerTy()))
4128 CfaArg = DAG.getNode(ISD::TRUNCATE, dl,
4129 TLI.getPointerTy(), getValue(I.getOperand(1)));
4131 CfaArg = DAG.getNode(ISD::SIGN_EXTEND, dl,
4132 TLI.getPointerTy(), getValue(I.getOperand(1)));
4134 SDValue Offset = DAG.getNode(ISD::ADD, dl,
4136 DAG.getNode(ISD::FRAME_TO_ARGS_OFFSET, dl,
4137 TLI.getPointerTy()),
4139 setValue(&I, DAG.getNode(ISD::ADD, dl,
4141 DAG.getNode(ISD::FRAMEADDR, dl,
4144 TLI.getPointerTy())),
4149 case Intrinsic::convertff:
4150 case Intrinsic::convertfsi:
4151 case Intrinsic::convertfui:
4152 case Intrinsic::convertsif:
4153 case Intrinsic::convertuif:
4154 case Intrinsic::convertss:
4155 case Intrinsic::convertsu:
4156 case Intrinsic::convertus:
4157 case Intrinsic::convertuu: {
4158 ISD::CvtCode Code = ISD::CVT_INVALID;
4159 switch (Intrinsic) {
4160 case Intrinsic::convertff: Code = ISD::CVT_FF; break;
4161 case Intrinsic::convertfsi: Code = ISD::CVT_FS; break;
4162 case Intrinsic::convertfui: Code = ISD::CVT_FU; break;
4163 case Intrinsic::convertsif: Code = ISD::CVT_SF; break;
4164 case Intrinsic::convertuif: Code = ISD::CVT_UF; break;
4165 case Intrinsic::convertss: Code = ISD::CVT_SS; break;
4166 case Intrinsic::convertsu: Code = ISD::CVT_SU; break;
4167 case Intrinsic::convertus: Code = ISD::CVT_US; break;
4168 case Intrinsic::convertuu: Code = ISD::CVT_UU; break;
4170 MVT DestVT = TLI.getValueType(I.getType());
4171 Value* Op1 = I.getOperand(1);
4172 setValue(&I, DAG.getConvertRndSat(DestVT, getCurDebugLoc(), getValue(Op1),
4173 DAG.getValueType(DestVT),
4174 DAG.getValueType(getValue(Op1).getValueType()),
4175 getValue(I.getOperand(2)),
4176 getValue(I.getOperand(3)),
4181 case Intrinsic::sqrt:
4182 setValue(&I, DAG.getNode(ISD::FSQRT, dl,
4183 getValue(I.getOperand(1)).getValueType(),
4184 getValue(I.getOperand(1))));
4186 case Intrinsic::powi:
4187 setValue(&I, DAG.getNode(ISD::FPOWI, dl,
4188 getValue(I.getOperand(1)).getValueType(),
4189 getValue(I.getOperand(1)),
4190 getValue(I.getOperand(2))));
4192 case Intrinsic::sin:
4193 setValue(&I, DAG.getNode(ISD::FSIN, dl,
4194 getValue(I.getOperand(1)).getValueType(),
4195 getValue(I.getOperand(1))));
4197 case Intrinsic::cos:
4198 setValue(&I, DAG.getNode(ISD::FCOS, dl,
4199 getValue(I.getOperand(1)).getValueType(),
4200 getValue(I.getOperand(1))));
4202 case Intrinsic::log:
4205 case Intrinsic::log2:
4208 case Intrinsic::log10:
4211 case Intrinsic::exp:
4214 case Intrinsic::exp2:
4217 case Intrinsic::pow:
4220 case Intrinsic::pcmarker: {
4221 SDValue Tmp = getValue(I.getOperand(1));
4222 DAG.setRoot(DAG.getNode(ISD::PCMARKER, dl, MVT::Other, getRoot(), Tmp));
4225 case Intrinsic::readcyclecounter: {
4226 SDValue Op = getRoot();
4227 SDValue Tmp = DAG.getNode(ISD::READCYCLECOUNTER, dl,
4228 DAG.getVTList(MVT::i64, MVT::Other),
4231 DAG.setRoot(Tmp.getValue(1));
4234 case Intrinsic::part_select: {
4235 // Currently not implemented: just abort
4236 assert(0 && "part_select intrinsic not implemented");
4239 case Intrinsic::part_set: {
4240 // Currently not implemented: just abort
4241 assert(0 && "part_set intrinsic not implemented");
4244 case Intrinsic::bswap:
4245 setValue(&I, DAG.getNode(ISD::BSWAP, dl,
4246 getValue(I.getOperand(1)).getValueType(),
4247 getValue(I.getOperand(1))));
4249 case Intrinsic::cttz: {
4250 SDValue Arg = getValue(I.getOperand(1));
4251 MVT Ty = Arg.getValueType();
4252 SDValue result = DAG.getNode(ISD::CTTZ, dl, Ty, Arg);
4253 setValue(&I, result);
4256 case Intrinsic::ctlz: {
4257 SDValue Arg = getValue(I.getOperand(1));
4258 MVT Ty = Arg.getValueType();
4259 SDValue result = DAG.getNode(ISD::CTLZ, dl, Ty, Arg);
4260 setValue(&I, result);
4263 case Intrinsic::ctpop: {
4264 SDValue Arg = getValue(I.getOperand(1));
4265 MVT Ty = Arg.getValueType();
4266 SDValue result = DAG.getNode(ISD::CTPOP, dl, Ty, Arg);
4267 setValue(&I, result);
4270 case Intrinsic::stacksave: {
4271 SDValue Op = getRoot();
4272 SDValue Tmp = DAG.getNode(ISD::STACKSAVE, dl,
4273 DAG.getVTList(TLI.getPointerTy(), MVT::Other), &Op, 1);
4275 DAG.setRoot(Tmp.getValue(1));
4278 case Intrinsic::stackrestore: {
4279 SDValue Tmp = getValue(I.getOperand(1));
4280 DAG.setRoot(DAG.getNode(ISD::STACKRESTORE, dl, MVT::Other, getRoot(), Tmp));
4283 case Intrinsic::stackprotector: {
4284 // Emit code into the DAG to store the stack guard onto the stack.
4285 MachineFunction &MF = DAG.getMachineFunction();
4286 MachineFrameInfo *MFI = MF.getFrameInfo();
4287 MVT PtrTy = TLI.getPointerTy();
4289 SDValue Src = getValue(I.getOperand(1)); // The guard's value.
4290 AllocaInst *Slot = cast<AllocaInst>(I.getOperand(2));
4292 int FI = FuncInfo.StaticAllocaMap[Slot];
4293 MFI->setStackProtectorIndex(FI);
4295 SDValue FIN = DAG.getFrameIndex(FI, PtrTy);
4297 // Store the stack protector onto the stack.
4298 SDValue Result = DAG.getStore(getRoot(), getCurDebugLoc(), Src, FIN,
4299 PseudoSourceValue::getFixedStack(FI),
4301 setValue(&I, Result);
4302 DAG.setRoot(Result);
4305 case Intrinsic::var_annotation:
4306 // Discard annotate attributes
4309 case Intrinsic::init_trampoline: {
4310 const Function *F = cast<Function>(I.getOperand(2)->stripPointerCasts());
4314 Ops[1] = getValue(I.getOperand(1));
4315 Ops[2] = getValue(I.getOperand(2));
4316 Ops[3] = getValue(I.getOperand(3));
4317 Ops[4] = DAG.getSrcValue(I.getOperand(1));
4318 Ops[5] = DAG.getSrcValue(F);
4320 SDValue Tmp = DAG.getNode(ISD::TRAMPOLINE, dl,
4321 DAG.getVTList(TLI.getPointerTy(), MVT::Other),
4325 DAG.setRoot(Tmp.getValue(1));
4329 case Intrinsic::gcroot:
4331 Value *Alloca = I.getOperand(1);
4332 Constant *TypeMap = cast<Constant>(I.getOperand(2));
4334 FrameIndexSDNode *FI = cast<FrameIndexSDNode>(getValue(Alloca).getNode());
4335 GFI->addStackRoot(FI->getIndex(), TypeMap);
4339 case Intrinsic::gcread:
4340 case Intrinsic::gcwrite:
4341 assert(0 && "GC failed to lower gcread/gcwrite intrinsics!");
4344 case Intrinsic::flt_rounds: {
4345 setValue(&I, DAG.getNode(ISD::FLT_ROUNDS_, dl, MVT::i32));
4349 case Intrinsic::trap: {
4350 DAG.setRoot(DAG.getNode(ISD::TRAP, dl,MVT::Other, getRoot()));
4354 case Intrinsic::uadd_with_overflow:
4355 return implVisitAluOverflow(I, ISD::UADDO);
4356 case Intrinsic::sadd_with_overflow:
4357 return implVisitAluOverflow(I, ISD::SADDO);
4358 case Intrinsic::usub_with_overflow:
4359 return implVisitAluOverflow(I, ISD::USUBO);
4360 case Intrinsic::ssub_with_overflow:
4361 return implVisitAluOverflow(I, ISD::SSUBO);
4362 case Intrinsic::umul_with_overflow:
4363 return implVisitAluOverflow(I, ISD::UMULO);
4364 case Intrinsic::smul_with_overflow:
4365 return implVisitAluOverflow(I, ISD::SMULO);
4367 case Intrinsic::prefetch: {
4370 Ops[1] = getValue(I.getOperand(1));
4371 Ops[2] = getValue(I.getOperand(2));
4372 Ops[3] = getValue(I.getOperand(3));
4373 DAG.setRoot(DAG.getNode(ISD::PREFETCH, dl, MVT::Other, &Ops[0], 4));
4377 case Intrinsic::memory_barrier: {
4380 for (int x = 1; x < 6; ++x)
4381 Ops[x] = getValue(I.getOperand(x));
4383 DAG.setRoot(DAG.getNode(ISD::MEMBARRIER, dl, MVT::Other, &Ops[0], 6));
4386 case Intrinsic::atomic_cmp_swap: {
4387 SDValue Root = getRoot();
4389 DAG.getAtomic(ISD::ATOMIC_CMP_SWAP, getCurDebugLoc(),
4390 getValue(I.getOperand(2)).getValueType().getSimpleVT(),
4392 getValue(I.getOperand(1)),
4393 getValue(I.getOperand(2)),
4394 getValue(I.getOperand(3)),
4397 DAG.setRoot(L.getValue(1));
4400 case Intrinsic::atomic_load_add:
4401 return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_ADD);
4402 case Intrinsic::atomic_load_sub:
4403 return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_SUB);
4404 case Intrinsic::atomic_load_or:
4405 return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_OR);
4406 case Intrinsic::atomic_load_xor:
4407 return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_XOR);
4408 case Intrinsic::atomic_load_and:
4409 return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_AND);
4410 case Intrinsic::atomic_load_nand:
4411 return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_NAND);
4412 case Intrinsic::atomic_load_max:
4413 return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_MAX);
4414 case Intrinsic::atomic_load_min:
4415 return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_MIN);
4416 case Intrinsic::atomic_load_umin:
4417 return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_UMIN);
4418 case Intrinsic::atomic_load_umax:
4419 return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_UMAX);
4420 case Intrinsic::atomic_swap:
4421 return implVisitBinaryAtomic(I, ISD::ATOMIC_SWAP);
4426 void SelectionDAGLowering::LowerCallTo(CallSite CS, SDValue Callee,
4428 MachineBasicBlock *LandingPad) {
4429 const PointerType *PT = cast<PointerType>(CS.getCalledValue()->getType());
4430 const FunctionType *FTy = cast<FunctionType>(PT->getElementType());
4431 MachineModuleInfo *MMI = DAG.getMachineModuleInfo();
4432 unsigned BeginLabel = 0, EndLabel = 0;
4434 TargetLowering::ArgListTy Args;
4435 TargetLowering::ArgListEntry Entry;
4436 Args.reserve(CS.arg_size());
4437 for (CallSite::arg_iterator i = CS.arg_begin(), e = CS.arg_end();
4439 SDValue ArgNode = getValue(*i);
4440 Entry.Node = ArgNode; Entry.Ty = (*i)->getType();
4442 unsigned attrInd = i - CS.arg_begin() + 1;
4443 Entry.isSExt = CS.paramHasAttr(attrInd, Attribute::SExt);
4444 Entry.isZExt = CS.paramHasAttr(attrInd, Attribute::ZExt);
4445 Entry.isInReg = CS.paramHasAttr(attrInd, Attribute::InReg);
4446 Entry.isSRet = CS.paramHasAttr(attrInd, Attribute::StructRet);
4447 Entry.isNest = CS.paramHasAttr(attrInd, Attribute::Nest);
4448 Entry.isByVal = CS.paramHasAttr(attrInd, Attribute::ByVal);
4449 Entry.Alignment = CS.getParamAlignment(attrInd);
4450 Args.push_back(Entry);
4453 if (LandingPad && MMI) {
4454 // Insert a label before the invoke call to mark the try range. This can be
4455 // used to detect deletion of the invoke via the MachineModuleInfo.
4456 BeginLabel = MMI->NextLabelID();
4457 // Both PendingLoads and PendingExports must be flushed here;
4458 // this call might not return.
4460 DAG.setRoot(DAG.getLabel(ISD::EH_LABEL, getCurDebugLoc(),
4461 getControlRoot(), BeginLabel));
4464 std::pair<SDValue,SDValue> Result =
4465 TLI.LowerCallTo(getRoot(), CS.getType(),
4466 CS.paramHasAttr(0, Attribute::SExt),
4467 CS.paramHasAttr(0, Attribute::ZExt), FTy->isVarArg(),
4468 CS.paramHasAttr(0, Attribute::InReg),
4469 CS.getCallingConv(),
4470 IsTailCall && PerformTailCallOpt,
4471 Callee, Args, DAG, getCurDebugLoc());
4472 if (CS.getType() != Type::VoidTy)
4473 setValue(CS.getInstruction(), Result.first);
4474 DAG.setRoot(Result.second);
4476 if (LandingPad && MMI) {
4477 // Insert a label at the end of the invoke call to mark the try range. This
4478 // can be used to detect deletion of the invoke via the MachineModuleInfo.
4479 EndLabel = MMI->NextLabelID();
4480 DAG.setRoot(DAG.getLabel(ISD::EH_LABEL, getCurDebugLoc(),
4481 getRoot(), EndLabel));
4483 // Inform MachineModuleInfo of range.
4484 MMI->addInvoke(LandingPad, BeginLabel, EndLabel);
4489 void SelectionDAGLowering::visitCall(CallInst &I) {
4490 const char *RenameFn = 0;
4491 if (Function *F = I.getCalledFunction()) {
4492 if (F->isDeclaration()) {
4493 const TargetIntrinsicInfo *II = TLI.getTargetMachine().getIntrinsicInfo();
4495 if (unsigned IID = II->getIntrinsicID(F)) {
4496 RenameFn = visitIntrinsicCall(I, IID);
4501 if (unsigned IID = F->getIntrinsicID()) {
4502 RenameFn = visitIntrinsicCall(I, IID);
4508 // Check for well-known libc/libm calls. If the function is internal, it
4509 // can't be a library call.
4510 unsigned NameLen = F->getNameLen();
4511 if (!F->hasLocalLinkage() && NameLen) {
4512 const char *NameStr = F->getNameStart();
4513 if (NameStr[0] == 'c' &&
4514 ((NameLen == 8 && !strcmp(NameStr, "copysign")) ||
4515 (NameLen == 9 && !strcmp(NameStr, "copysignf")))) {
4516 if (I.getNumOperands() == 3 && // Basic sanity checks.
4517 I.getOperand(1)->getType()->isFloatingPoint() &&
4518 I.getType() == I.getOperand(1)->getType() &&
4519 I.getType() == I.getOperand(2)->getType()) {
4520 SDValue LHS = getValue(I.getOperand(1));
4521 SDValue RHS = getValue(I.getOperand(2));
4522 setValue(&I, DAG.getNode(ISD::FCOPYSIGN, getCurDebugLoc(),
4523 LHS.getValueType(), LHS, RHS));
4526 } else if (NameStr[0] == 'f' &&
4527 ((NameLen == 4 && !strcmp(NameStr, "fabs")) ||
4528 (NameLen == 5 && !strcmp(NameStr, "fabsf")) ||
4529 (NameLen == 5 && !strcmp(NameStr, "fabsl")))) {
4530 if (I.getNumOperands() == 2 && // Basic sanity checks.
4531 I.getOperand(1)->getType()->isFloatingPoint() &&
4532 I.getType() == I.getOperand(1)->getType()) {
4533 SDValue Tmp = getValue(I.getOperand(1));
4534 setValue(&I, DAG.getNode(ISD::FABS, getCurDebugLoc(),
4535 Tmp.getValueType(), Tmp));
4538 } else if (NameStr[0] == 's' &&
4539 ((NameLen == 3 && !strcmp(NameStr, "sin")) ||
4540 (NameLen == 4 && !strcmp(NameStr, "sinf")) ||
4541 (NameLen == 4 && !strcmp(NameStr, "sinl")))) {
4542 if (I.getNumOperands() == 2 && // Basic sanity checks.
4543 I.getOperand(1)->getType()->isFloatingPoint() &&
4544 I.getType() == I.getOperand(1)->getType()) {
4545 SDValue Tmp = getValue(I.getOperand(1));
4546 setValue(&I, DAG.getNode(ISD::FSIN, getCurDebugLoc(),
4547 Tmp.getValueType(), Tmp));
4550 } else if (NameStr[0] == 'c' &&
4551 ((NameLen == 3 && !strcmp(NameStr, "cos")) ||
4552 (NameLen == 4 && !strcmp(NameStr, "cosf")) ||
4553 (NameLen == 4 && !strcmp(NameStr, "cosl")))) {
4554 if (I.getNumOperands() == 2 && // Basic sanity checks.
4555 I.getOperand(1)->getType()->isFloatingPoint() &&
4556 I.getType() == I.getOperand(1)->getType()) {
4557 SDValue Tmp = getValue(I.getOperand(1));
4558 setValue(&I, DAG.getNode(ISD::FCOS, getCurDebugLoc(),
4559 Tmp.getValueType(), Tmp));
4564 } else if (isa<InlineAsm>(I.getOperand(0))) {
4571 Callee = getValue(I.getOperand(0));
4573 Callee = DAG.getExternalSymbol(RenameFn, TLI.getPointerTy());
4575 LowerCallTo(&I, Callee, I.isTailCall());
4579 /// getCopyFromRegs - Emit a series of CopyFromReg nodes that copies from
4580 /// this value and returns the result as a ValueVT value. This uses
4581 /// Chain/Flag as the input and updates them for the output Chain/Flag.
4582 /// If the Flag pointer is NULL, no flag is used.
4583 SDValue RegsForValue::getCopyFromRegs(SelectionDAG &DAG, DebugLoc dl,
4585 SDValue *Flag) const {
4586 // Assemble the legal parts into the final values.
4587 SmallVector<SDValue, 4> Values(ValueVTs.size());
4588 SmallVector<SDValue, 8> Parts;
4589 for (unsigned Value = 0, Part = 0, e = ValueVTs.size(); Value != e; ++Value) {
4590 // Copy the legal parts from the registers.
4591 MVT ValueVT = ValueVTs[Value];
4592 unsigned NumRegs = TLI->getNumRegisters(ValueVT);
4593 MVT RegisterVT = RegVTs[Value];
4595 Parts.resize(NumRegs);
4596 for (unsigned i = 0; i != NumRegs; ++i) {
4599 P = DAG.getCopyFromReg(Chain, dl, Regs[Part+i], RegisterVT);
4601 P = DAG.getCopyFromReg(Chain, dl, Regs[Part+i], RegisterVT, *Flag);
4602 *Flag = P.getValue(2);
4604 Chain = P.getValue(1);
4606 // If the source register was virtual and if we know something about it,
4607 // add an assert node.
4608 if (TargetRegisterInfo::isVirtualRegister(Regs[Part+i]) &&
4609 RegisterVT.isInteger() && !RegisterVT.isVector()) {
4610 unsigned SlotNo = Regs[Part+i]-TargetRegisterInfo::FirstVirtualRegister;
4611 FunctionLoweringInfo &FLI = DAG.getFunctionLoweringInfo();
4612 if (FLI.LiveOutRegInfo.size() > SlotNo) {
4613 FunctionLoweringInfo::LiveOutInfo &LOI = FLI.LiveOutRegInfo[SlotNo];
4615 unsigned RegSize = RegisterVT.getSizeInBits();
4616 unsigned NumSignBits = LOI.NumSignBits;
4617 unsigned NumZeroBits = LOI.KnownZero.countLeadingOnes();
4619 // FIXME: We capture more information than the dag can represent. For
4620 // now, just use the tightest assertzext/assertsext possible.
4622 MVT FromVT(MVT::Other);
4623 if (NumSignBits == RegSize)
4624 isSExt = true, FromVT = MVT::i1; // ASSERT SEXT 1
4625 else if (NumZeroBits >= RegSize-1)
4626 isSExt = false, FromVT = MVT::i1; // ASSERT ZEXT 1
4627 else if (NumSignBits > RegSize-8)
4628 isSExt = true, FromVT = MVT::i8; // ASSERT SEXT 8
4629 else if (NumZeroBits >= RegSize-8)
4630 isSExt = false, FromVT = MVT::i8; // ASSERT ZEXT 8
4631 else if (NumSignBits > RegSize-16)
4632 isSExt = true, FromVT = MVT::i16; // ASSERT SEXT 16
4633 else if (NumZeroBits >= RegSize-16)
4634 isSExt = false, FromVT = MVT::i16; // ASSERT ZEXT 16
4635 else if (NumSignBits > RegSize-32)
4636 isSExt = true, FromVT = MVT::i32; // ASSERT SEXT 32
4637 else if (NumZeroBits >= RegSize-32)
4638 isSExt = false, FromVT = MVT::i32; // ASSERT ZEXT 32
4640 if (FromVT != MVT::Other) {
4641 P = DAG.getNode(isSExt ? ISD::AssertSext : ISD::AssertZext, dl,
4642 RegisterVT, P, DAG.getValueType(FromVT));
4651 Values[Value] = getCopyFromParts(DAG, dl, Parts.begin(),
4652 NumRegs, RegisterVT, ValueVT);
4657 return DAG.getNode(ISD::MERGE_VALUES, dl,
4658 DAG.getVTList(&ValueVTs[0], ValueVTs.size()),
4659 &Values[0], ValueVTs.size());
4662 /// getCopyToRegs - Emit a series of CopyToReg nodes that copies the
4663 /// specified value into the registers specified by this object. This uses
4664 /// Chain/Flag as the input and updates them for the output Chain/Flag.
4665 /// If the Flag pointer is NULL, no flag is used.
4666 void RegsForValue::getCopyToRegs(SDValue Val, SelectionDAG &DAG, DebugLoc dl,
4667 SDValue &Chain, SDValue *Flag) const {
4668 // Get the list of the values's legal parts.
4669 unsigned NumRegs = Regs.size();
4670 SmallVector<SDValue, 8> Parts(NumRegs);
4671 for (unsigned Value = 0, Part = 0, e = ValueVTs.size(); Value != e; ++Value) {
4672 MVT ValueVT = ValueVTs[Value];
4673 unsigned NumParts = TLI->getNumRegisters(ValueVT);
4674 MVT RegisterVT = RegVTs[Value];
4676 getCopyToParts(DAG, dl, Val.getValue(Val.getResNo() + Value),
4677 &Parts[Part], NumParts, RegisterVT);
4681 // Copy the parts into the registers.
4682 SmallVector<SDValue, 8> Chains(NumRegs);
4683 for (unsigned i = 0; i != NumRegs; ++i) {
4686 Part = DAG.getCopyToReg(Chain, dl, Regs[i], Parts[i]);
4688 Part = DAG.getCopyToReg(Chain, dl, Regs[i], Parts[i], *Flag);
4689 *Flag = Part.getValue(1);
4691 Chains[i] = Part.getValue(0);
4694 if (NumRegs == 1 || Flag)
4695 // If NumRegs > 1 && Flag is used then the use of the last CopyToReg is
4696 // flagged to it. That is the CopyToReg nodes and the user are considered
4697 // a single scheduling unit. If we create a TokenFactor and return it as
4698 // chain, then the TokenFactor is both a predecessor (operand) of the
4699 // user as well as a successor (the TF operands are flagged to the user).
4700 // c1, f1 = CopyToReg
4701 // c2, f2 = CopyToReg
4702 // c3 = TokenFactor c1, c2
4705 Chain = Chains[NumRegs-1];
4707 Chain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, &Chains[0], NumRegs);
4710 /// AddInlineAsmOperands - Add this value to the specified inlineasm node
4711 /// operand list. This adds the code marker and includes the number of
4712 /// values added into it.
4713 void RegsForValue::AddInlineAsmOperands(unsigned Code,
4714 bool HasMatching,unsigned MatchingIdx,
4716 std::vector<SDValue> &Ops) const {
4717 MVT IntPtrTy = DAG.getTargetLoweringInfo().getPointerTy();
4718 assert(Regs.size() < (1 << 13) && "Too many inline asm outputs!");
4719 unsigned Flag = Code | (Regs.size() << 3);
4721 Flag |= 0x80000000 | (MatchingIdx << 16);
4722 Ops.push_back(DAG.getTargetConstant(Flag, IntPtrTy));
4723 for (unsigned Value = 0, Reg = 0, e = ValueVTs.size(); Value != e; ++Value) {
4724 unsigned NumRegs = TLI->getNumRegisters(ValueVTs[Value]);
4725 MVT RegisterVT = RegVTs[Value];
4726 for (unsigned i = 0; i != NumRegs; ++i) {
4727 assert(Reg < Regs.size() && "Mismatch in # registers expected");
4728 Ops.push_back(DAG.getRegister(Regs[Reg++], RegisterVT));
4733 /// isAllocatableRegister - If the specified register is safe to allocate,
4734 /// i.e. it isn't a stack pointer or some other special register, return the
4735 /// register class for the register. Otherwise, return null.
4736 static const TargetRegisterClass *
4737 isAllocatableRegister(unsigned Reg, MachineFunction &MF,
4738 const TargetLowering &TLI,
4739 const TargetRegisterInfo *TRI) {
4740 MVT FoundVT = MVT::Other;
4741 const TargetRegisterClass *FoundRC = 0;
4742 for (TargetRegisterInfo::regclass_iterator RCI = TRI->regclass_begin(),
4743 E = TRI->regclass_end(); RCI != E; ++RCI) {
4744 MVT ThisVT = MVT::Other;
4746 const TargetRegisterClass *RC = *RCI;
4747 // If none of the the value types for this register class are valid, we
4748 // can't use it. For example, 64-bit reg classes on 32-bit targets.
4749 for (TargetRegisterClass::vt_iterator I = RC->vt_begin(), E = RC->vt_end();
4751 if (TLI.isTypeLegal(*I)) {
4752 // If we have already found this register in a different register class,
4753 // choose the one with the largest VT specified. For example, on
4754 // PowerPC, we favor f64 register classes over f32.
4755 if (FoundVT == MVT::Other || FoundVT.bitsLT(*I)) {
4762 if (ThisVT == MVT::Other) continue;
4764 // NOTE: This isn't ideal. In particular, this might allocate the
4765 // frame pointer in functions that need it (due to them not being taken
4766 // out of allocation, because a variable sized allocation hasn't been seen
4767 // yet). This is a slight code pessimization, but should still work.
4768 for (TargetRegisterClass::iterator I = RC->allocation_order_begin(MF),
4769 E = RC->allocation_order_end(MF); I != E; ++I)
4771 // We found a matching register class. Keep looking at others in case
4772 // we find one with larger registers that this physreg is also in.
4783 /// AsmOperandInfo - This contains information for each constraint that we are
4785 class VISIBILITY_HIDDEN SDISelAsmOperandInfo :
4786 public TargetLowering::AsmOperandInfo {
4788 /// CallOperand - If this is the result output operand or a clobber
4789 /// this is null, otherwise it is the incoming operand to the CallInst.
4790 /// This gets modified as the asm is processed.
4791 SDValue CallOperand;
4793 /// AssignedRegs - If this is a register or register class operand, this
4794 /// contains the set of register corresponding to the operand.
4795 RegsForValue AssignedRegs;
4797 explicit SDISelAsmOperandInfo(const InlineAsm::ConstraintInfo &info)
4798 : TargetLowering::AsmOperandInfo(info), CallOperand(0,0) {
4801 /// MarkAllocatedRegs - Once AssignedRegs is set, mark the assigned registers
4802 /// busy in OutputRegs/InputRegs.
4803 void MarkAllocatedRegs(bool isOutReg, bool isInReg,
4804 std::set<unsigned> &OutputRegs,
4805 std::set<unsigned> &InputRegs,
4806 const TargetRegisterInfo &TRI) const {
4808 for (unsigned i = 0, e = AssignedRegs.Regs.size(); i != e; ++i)
4809 MarkRegAndAliases(AssignedRegs.Regs[i], OutputRegs, TRI);
4812 for (unsigned i = 0, e = AssignedRegs.Regs.size(); i != e; ++i)
4813 MarkRegAndAliases(AssignedRegs.Regs[i], InputRegs, TRI);
4817 /// getCallOperandValMVT - Return the MVT of the Value* that this operand
4818 /// corresponds to. If there is no Value* for this operand, it returns
4820 MVT getCallOperandValMVT(const TargetLowering &TLI,
4821 const TargetData *TD) const {
4822 if (CallOperandVal == 0) return MVT::Other;
4824 if (isa<BasicBlock>(CallOperandVal))
4825 return TLI.getPointerTy();
4827 const llvm::Type *OpTy = CallOperandVal->getType();
4829 // If this is an indirect operand, the operand is a pointer to the
4832 OpTy = cast<PointerType>(OpTy)->getElementType();
4834 // If OpTy is not a single value, it may be a struct/union that we
4835 // can tile with integers.
4836 if (!OpTy->isSingleValueType() && OpTy->isSized()) {
4837 unsigned BitSize = TD->getTypeSizeInBits(OpTy);
4846 OpTy = IntegerType::get(BitSize);
4851 return TLI.getValueType(OpTy, true);
4855 /// MarkRegAndAliases - Mark the specified register and all aliases in the
4857 static void MarkRegAndAliases(unsigned Reg, std::set<unsigned> &Regs,
4858 const TargetRegisterInfo &TRI) {
4859 assert(TargetRegisterInfo::isPhysicalRegister(Reg) && "Isn't a physreg");
4861 if (const unsigned *Aliases = TRI.getAliasSet(Reg))
4862 for (; *Aliases; ++Aliases)
4863 Regs.insert(*Aliases);
4866 } // end llvm namespace.
4869 /// GetRegistersForValue - Assign registers (virtual or physical) for the
4870 /// specified operand. We prefer to assign virtual registers, to allow the
4871 /// register allocator handle the assignment process. However, if the asm uses
4872 /// features that we can't model on machineinstrs, we have SDISel do the
4873 /// allocation. This produces generally horrible, but correct, code.
4875 /// OpInfo describes the operand.
4876 /// Input and OutputRegs are the set of already allocated physical registers.
4878 void SelectionDAGLowering::
4879 GetRegistersForValue(SDISelAsmOperandInfo &OpInfo,
4880 std::set<unsigned> &OutputRegs,
4881 std::set<unsigned> &InputRegs) {
4882 // Compute whether this value requires an input register, an output register,
4884 bool isOutReg = false;
4885 bool isInReg = false;
4886 switch (OpInfo.Type) {
4887 case InlineAsm::isOutput:
4890 // If there is an input constraint that matches this, we need to reserve
4891 // the input register so no other inputs allocate to it.
4892 isInReg = OpInfo.hasMatchingInput();
4894 case InlineAsm::isInput:
4898 case InlineAsm::isClobber:
4905 MachineFunction &MF = DAG.getMachineFunction();
4906 SmallVector<unsigned, 4> Regs;
4908 // If this is a constraint for a single physreg, or a constraint for a
4909 // register class, find it.
4910 std::pair<unsigned, const TargetRegisterClass*> PhysReg =
4911 TLI.getRegForInlineAsmConstraint(OpInfo.ConstraintCode,
4912 OpInfo.ConstraintVT);
4914 unsigned NumRegs = 1;
4915 if (OpInfo.ConstraintVT != MVT::Other) {
4916 // If this is a FP input in an integer register (or visa versa) insert a bit
4917 // cast of the input value. More generally, handle any case where the input
4918 // value disagrees with the register class we plan to stick this in.
4919 if (OpInfo.Type == InlineAsm::isInput &&
4920 PhysReg.second && !PhysReg.second->hasType(OpInfo.ConstraintVT)) {
4921 // Try to convert to the first MVT that the reg class contains. If the
4922 // types are identical size, use a bitcast to convert (e.g. two differing
4924 MVT RegVT = *PhysReg.second->vt_begin();
4925 if (RegVT.getSizeInBits() == OpInfo.ConstraintVT.getSizeInBits()) {
4926 OpInfo.CallOperand = DAG.getNode(ISD::BIT_CONVERT, getCurDebugLoc(),
4927 RegVT, OpInfo.CallOperand);
4928 OpInfo.ConstraintVT = RegVT;
4929 } else if (RegVT.isInteger() && OpInfo.ConstraintVT.isFloatingPoint()) {
4930 // If the input is a FP value and we want it in FP registers, do a
4931 // bitcast to the corresponding integer type. This turns an f64 value
4932 // into i64, which can be passed with two i32 values on a 32-bit
4934 RegVT = MVT::getIntegerVT(OpInfo.ConstraintVT.getSizeInBits());
4935 OpInfo.CallOperand = DAG.getNode(ISD::BIT_CONVERT, getCurDebugLoc(),
4936 RegVT, OpInfo.CallOperand);
4937 OpInfo.ConstraintVT = RegVT;
4941 NumRegs = TLI.getNumRegisters(OpInfo.ConstraintVT);
4945 MVT ValueVT = OpInfo.ConstraintVT;
4947 // If this is a constraint for a specific physical register, like {r17},
4949 if (unsigned AssignedReg = PhysReg.first) {
4950 const TargetRegisterClass *RC = PhysReg.second;
4951 if (OpInfo.ConstraintVT == MVT::Other)
4952 ValueVT = *RC->vt_begin();
4954 // Get the actual register value type. This is important, because the user
4955 // may have asked for (e.g.) the AX register in i32 type. We need to
4956 // remember that AX is actually i16 to get the right extension.
4957 RegVT = *RC->vt_begin();
4959 // This is a explicit reference to a physical register.
4960 Regs.push_back(AssignedReg);
4962 // If this is an expanded reference, add the rest of the regs to Regs.
4964 TargetRegisterClass::iterator I = RC->begin();
4965 for (; *I != AssignedReg; ++I)
4966 assert(I != RC->end() && "Didn't find reg!");
4968 // Already added the first reg.
4970 for (; NumRegs; --NumRegs, ++I) {
4971 assert(I != RC->end() && "Ran out of registers to allocate!");
4975 OpInfo.AssignedRegs = RegsForValue(TLI, Regs, RegVT, ValueVT);
4976 const TargetRegisterInfo *TRI = DAG.getTarget().getRegisterInfo();
4977 OpInfo.MarkAllocatedRegs(isOutReg, isInReg, OutputRegs, InputRegs, *TRI);
4981 // Otherwise, if this was a reference to an LLVM register class, create vregs
4982 // for this reference.
4983 if (const TargetRegisterClass *RC = PhysReg.second) {
4984 RegVT = *RC->vt_begin();
4985 if (OpInfo.ConstraintVT == MVT::Other)
4988 // Create the appropriate number of virtual registers.
4989 MachineRegisterInfo &RegInfo = MF.getRegInfo();
4990 for (; NumRegs; --NumRegs)
4991 Regs.push_back(RegInfo.createVirtualRegister(RC));
4993 OpInfo.AssignedRegs = RegsForValue(TLI, Regs, RegVT, ValueVT);
4997 // This is a reference to a register class that doesn't directly correspond
4998 // to an LLVM register class. Allocate NumRegs consecutive, available,
4999 // registers from the class.
5000 std::vector<unsigned> RegClassRegs
5001 = TLI.getRegClassForInlineAsmConstraint(OpInfo.ConstraintCode,
5002 OpInfo.ConstraintVT);
5004 const TargetRegisterInfo *TRI = DAG.getTarget().getRegisterInfo();
5005 unsigned NumAllocated = 0;
5006 for (unsigned i = 0, e = RegClassRegs.size(); i != e; ++i) {
5007 unsigned Reg = RegClassRegs[i];
5008 // See if this register is available.
5009 if ((isOutReg && OutputRegs.count(Reg)) || // Already used.
5010 (isInReg && InputRegs.count(Reg))) { // Already used.
5011 // Make sure we find consecutive registers.
5016 // Check to see if this register is allocatable (i.e. don't give out the
5018 const TargetRegisterClass *RC = isAllocatableRegister(Reg, MF, TLI, TRI);
5019 if (!RC) { // Couldn't allocate this register.
5020 // Reset NumAllocated to make sure we return consecutive registers.
5025 // Okay, this register is good, we can use it.
5028 // If we allocated enough consecutive registers, succeed.
5029 if (NumAllocated == NumRegs) {
5030 unsigned RegStart = (i-NumAllocated)+1;
5031 unsigned RegEnd = i+1;
5032 // Mark all of the allocated registers used.
5033 for (unsigned i = RegStart; i != RegEnd; ++i)
5034 Regs.push_back(RegClassRegs[i]);
5036 OpInfo.AssignedRegs = RegsForValue(TLI, Regs, *RC->vt_begin(),
5037 OpInfo.ConstraintVT);
5038 OpInfo.MarkAllocatedRegs(isOutReg, isInReg, OutputRegs, InputRegs, *TRI);
5043 // Otherwise, we couldn't allocate enough registers for this.
5046 /// hasInlineAsmMemConstraint - Return true if the inline asm instruction being
5047 /// processed uses a memory 'm' constraint.
5049 hasInlineAsmMemConstraint(std::vector<InlineAsm::ConstraintInfo> &CInfos,
5050 const TargetLowering &TLI) {
5051 for (unsigned i = 0, e = CInfos.size(); i != e; ++i) {
5052 InlineAsm::ConstraintInfo &CI = CInfos[i];
5053 for (unsigned j = 0, ee = CI.Codes.size(); j != ee; ++j) {
5054 TargetLowering::ConstraintType CType = TLI.getConstraintType(CI.Codes[j]);
5055 if (CType == TargetLowering::C_Memory)
5063 /// visitInlineAsm - Handle a call to an InlineAsm object.
5065 void SelectionDAGLowering::visitInlineAsm(CallSite CS) {
5066 InlineAsm *IA = cast<InlineAsm>(CS.getCalledValue());
5068 /// ConstraintOperands - Information about all of the constraints.
5069 std::vector<SDISelAsmOperandInfo> ConstraintOperands;
5071 SDValue Chain = getRoot();
5074 std::set<unsigned> OutputRegs, InputRegs;
5076 // Do a prepass over the constraints, canonicalizing them, and building up the
5077 // ConstraintOperands list.
5078 std::vector<InlineAsm::ConstraintInfo>
5079 ConstraintInfos = IA->ParseConstraints();
5081 bool hasMemory = hasInlineAsmMemConstraint(ConstraintInfos, TLI);
5083 unsigned ArgNo = 0; // ArgNo - The argument of the CallInst.
5084 unsigned ResNo = 0; // ResNo - The result number of the next output.
5085 for (unsigned i = 0, e = ConstraintInfos.size(); i != e; ++i) {
5086 ConstraintOperands.push_back(SDISelAsmOperandInfo(ConstraintInfos[i]));
5087 SDISelAsmOperandInfo &OpInfo = ConstraintOperands.back();
5089 MVT OpVT = MVT::Other;
5091 // Compute the value type for each operand.
5092 switch (OpInfo.Type) {
5093 case InlineAsm::isOutput:
5094 // Indirect outputs just consume an argument.
5095 if (OpInfo.isIndirect) {
5096 OpInfo.CallOperandVal = CS.getArgument(ArgNo++);
5100 // The return value of the call is this value. As such, there is no
5101 // corresponding argument.
5102 assert(CS.getType() != Type::VoidTy && "Bad inline asm!");
5103 if (const StructType *STy = dyn_cast<StructType>(CS.getType())) {
5104 OpVT = TLI.getValueType(STy->getElementType(ResNo));
5106 assert(ResNo == 0 && "Asm only has one result!");
5107 OpVT = TLI.getValueType(CS.getType());
5111 case InlineAsm::isInput:
5112 OpInfo.CallOperandVal = CS.getArgument(ArgNo++);
5114 case InlineAsm::isClobber:
5119 // If this is an input or an indirect output, process the call argument.
5120 // BasicBlocks are labels, currently appearing only in asm's.
5121 if (OpInfo.CallOperandVal) {
5122 if (BasicBlock *BB = dyn_cast<BasicBlock>(OpInfo.CallOperandVal)) {
5123 OpInfo.CallOperand = DAG.getBasicBlock(FuncInfo.MBBMap[BB]);
5125 OpInfo.CallOperand = getValue(OpInfo.CallOperandVal);
5128 OpVT = OpInfo.getCallOperandValMVT(TLI, TD);
5131 OpInfo.ConstraintVT = OpVT;
5134 // Second pass over the constraints: compute which constraint option to use
5135 // and assign registers to constraints that want a specific physreg.
5136 for (unsigned i = 0, e = ConstraintInfos.size(); i != e; ++i) {
5137 SDISelAsmOperandInfo &OpInfo = ConstraintOperands[i];
5139 // If this is an output operand with a matching input operand, look up the
5140 // matching input. If their types mismatch, e.g. one is an integer, the
5141 // other is floating point, or their sizes are different, flag it as an
5143 if (OpInfo.hasMatchingInput()) {
5144 SDISelAsmOperandInfo &Input = ConstraintOperands[OpInfo.MatchingInput];
5145 if (OpInfo.ConstraintVT != Input.ConstraintVT) {
5146 if ((OpInfo.ConstraintVT.isInteger() !=
5147 Input.ConstraintVT.isInteger()) ||
5148 (OpInfo.ConstraintVT.getSizeInBits() !=
5149 Input.ConstraintVT.getSizeInBits())) {
5150 cerr << "Unsupported asm: input constraint with a matching output "
5151 << "constraint of incompatible type!\n";
5154 Input.ConstraintVT = OpInfo.ConstraintVT;
5158 // Compute the constraint code and ConstraintType to use.
5159 TLI.ComputeConstraintToUse(OpInfo, OpInfo.CallOperand, hasMemory, &DAG);
5161 // If this is a memory input, and if the operand is not indirect, do what we
5162 // need to to provide an address for the memory input.
5163 if (OpInfo.ConstraintType == TargetLowering::C_Memory &&
5164 !OpInfo.isIndirect) {
5165 assert(OpInfo.Type == InlineAsm::isInput &&
5166 "Can only indirectify direct input operands!");
5168 // Memory operands really want the address of the value. If we don't have
5169 // an indirect input, put it in the constpool if we can, otherwise spill
5170 // it to a stack slot.
5172 // If the operand is a float, integer, or vector constant, spill to a
5173 // constant pool entry to get its address.
5174 Value *OpVal = OpInfo.CallOperandVal;
5175 if (isa<ConstantFP>(OpVal) || isa<ConstantInt>(OpVal) ||
5176 isa<ConstantVector>(OpVal)) {
5177 OpInfo.CallOperand = DAG.getConstantPool(cast<Constant>(OpVal),
5178 TLI.getPointerTy());
5180 // Otherwise, create a stack slot and emit a store to it before the
5182 const Type *Ty = OpVal->getType();
5183 uint64_t TySize = TLI.getTargetData()->getTypePaddedSize(Ty);
5184 unsigned Align = TLI.getTargetData()->getPrefTypeAlignment(Ty);
5185 MachineFunction &MF = DAG.getMachineFunction();
5186 int SSFI = MF.getFrameInfo()->CreateStackObject(TySize, Align);
5187 SDValue StackSlot = DAG.getFrameIndex(SSFI, TLI.getPointerTy());
5188 Chain = DAG.getStore(Chain, getCurDebugLoc(),
5189 OpInfo.CallOperand, StackSlot, NULL, 0);
5190 OpInfo.CallOperand = StackSlot;
5193 // There is no longer a Value* corresponding to this operand.
5194 OpInfo.CallOperandVal = 0;
5195 // It is now an indirect operand.
5196 OpInfo.isIndirect = true;
5199 // If this constraint is for a specific register, allocate it before
5201 if (OpInfo.ConstraintType == TargetLowering::C_Register)
5202 GetRegistersForValue(OpInfo, OutputRegs, InputRegs);
5204 ConstraintInfos.clear();
5207 // Second pass - Loop over all of the operands, assigning virtual or physregs
5208 // to register class operands.
5209 for (unsigned i = 0, e = ConstraintOperands.size(); i != e; ++i) {
5210 SDISelAsmOperandInfo &OpInfo = ConstraintOperands[i];
5212 // C_Register operands have already been allocated, Other/Memory don't need
5214 if (OpInfo.ConstraintType == TargetLowering::C_RegisterClass)
5215 GetRegistersForValue(OpInfo, OutputRegs, InputRegs);
5218 // AsmNodeOperands - The operands for the ISD::INLINEASM node.
5219 std::vector<SDValue> AsmNodeOperands;
5220 AsmNodeOperands.push_back(SDValue()); // reserve space for input chain
5221 AsmNodeOperands.push_back(
5222 DAG.getTargetExternalSymbol(IA->getAsmString().c_str(), MVT::Other));
5225 // Loop over all of the inputs, copying the operand values into the
5226 // appropriate registers and processing the output regs.
5227 RegsForValue RetValRegs;
5229 // IndirectStoresToEmit - The set of stores to emit after the inline asm node.
5230 std::vector<std::pair<RegsForValue, Value*> > IndirectStoresToEmit;
5232 for (unsigned i = 0, e = ConstraintOperands.size(); i != e; ++i) {
5233 SDISelAsmOperandInfo &OpInfo = ConstraintOperands[i];
5235 switch (OpInfo.Type) {
5236 case InlineAsm::isOutput: {
5237 if (OpInfo.ConstraintType != TargetLowering::C_RegisterClass &&
5238 OpInfo.ConstraintType != TargetLowering::C_Register) {
5239 // Memory output, or 'other' output (e.g. 'X' constraint).
5240 assert(OpInfo.isIndirect && "Memory output must be indirect operand");
5242 // Add information to the INLINEASM node to know about this output.
5243 unsigned ResOpType = 4/*MEM*/ | (1<<3);
5244 AsmNodeOperands.push_back(DAG.getTargetConstant(ResOpType,
5245 TLI.getPointerTy()));
5246 AsmNodeOperands.push_back(OpInfo.CallOperand);
5250 // Otherwise, this is a register or register class output.
5252 // Copy the output from the appropriate register. Find a register that
5254 if (OpInfo.AssignedRegs.Regs.empty()) {
5255 cerr << "Couldn't allocate output reg for constraint '"
5256 << OpInfo.ConstraintCode << "'!\n";
5260 // If this is an indirect operand, store through the pointer after the
5262 if (OpInfo.isIndirect) {
5263 IndirectStoresToEmit.push_back(std::make_pair(OpInfo.AssignedRegs,
5264 OpInfo.CallOperandVal));
5266 // This is the result value of the call.
5267 assert(CS.getType() != Type::VoidTy && "Bad inline asm!");
5268 // Concatenate this output onto the outputs list.
5269 RetValRegs.append(OpInfo.AssignedRegs);
5272 // Add information to the INLINEASM node to know that this register is
5274 OpInfo.AssignedRegs.AddInlineAsmOperands(OpInfo.isEarlyClobber ?
5275 6 /* EARLYCLOBBER REGDEF */ :
5279 DAG, AsmNodeOperands);
5282 case InlineAsm::isInput: {
5283 SDValue InOperandVal = OpInfo.CallOperand;
5285 if (OpInfo.isMatchingInputConstraint()) { // Matching constraint?
5286 // If this is required to match an output register we have already set,
5287 // just use its register.
5288 unsigned OperandNo = OpInfo.getMatchedOperand();
5290 // Scan until we find the definition we already emitted of this operand.
5291 // When we find it, create a RegsForValue operand.
5292 unsigned CurOp = 2; // The first operand.
5293 for (; OperandNo; --OperandNo) {
5294 // Advance to the next operand.
5296 cast<ConstantSDNode>(AsmNodeOperands[CurOp])->getZExtValue();
5297 assert(((OpFlag & 7) == 2 /*REGDEF*/ ||
5298 (OpFlag & 7) == 6 /*EARLYCLOBBER REGDEF*/ ||
5299 (OpFlag & 7) == 4 /*MEM*/) &&
5300 "Skipped past definitions?");
5301 CurOp += InlineAsm::getNumOperandRegisters(OpFlag)+1;
5305 cast<ConstantSDNode>(AsmNodeOperands[CurOp])->getZExtValue();
5306 if ((OpFlag & 7) == 2 /*REGDEF*/
5307 || (OpFlag & 7) == 6 /* EARLYCLOBBER REGDEF */) {
5308 // Add (OpFlag&0xffff)>>3 registers to MatchedRegs.
5309 RegsForValue MatchedRegs;
5310 MatchedRegs.TLI = &TLI;
5311 MatchedRegs.ValueVTs.push_back(InOperandVal.getValueType());
5312 MVT RegVT = AsmNodeOperands[CurOp+1].getValueType();
5313 MatchedRegs.RegVTs.push_back(RegVT);
5314 MachineRegisterInfo &RegInfo = DAG.getMachineFunction().getRegInfo();
5315 for (unsigned i = 0, e = InlineAsm::getNumOperandRegisters(OpFlag);
5318 push_back(RegInfo.createVirtualRegister(TLI.getRegClassFor(RegVT)));
5320 // Use the produced MatchedRegs object to
5321 MatchedRegs.getCopyToRegs(InOperandVal, DAG, getCurDebugLoc(),
5323 MatchedRegs.AddInlineAsmOperands(1 /*REGUSE*/,
5324 true, OpInfo.getMatchedOperand(),
5325 DAG, AsmNodeOperands);
5328 assert(((OpFlag & 7) == 4) && "Unknown matching constraint!");
5329 assert((InlineAsm::getNumOperandRegisters(OpFlag)) == 1 &&
5330 "Unexpected number of operands");
5331 // Add information to the INLINEASM node to know about this input.
5332 // See InlineAsm.h isUseOperandTiedToDef.
5333 OpFlag |= 0x80000000 | (OpInfo.getMatchedOperand() << 16);
5334 AsmNodeOperands.push_back(DAG.getTargetConstant(OpFlag,
5335 TLI.getPointerTy()));
5336 AsmNodeOperands.push_back(AsmNodeOperands[CurOp+1]);
5341 if (OpInfo.ConstraintType == TargetLowering::C_Other) {
5342 assert(!OpInfo.isIndirect &&
5343 "Don't know how to handle indirect other inputs yet!");
5345 std::vector<SDValue> Ops;
5346 TLI.LowerAsmOperandForConstraint(InOperandVal, OpInfo.ConstraintCode[0],
5347 hasMemory, Ops, DAG);
5349 cerr << "Invalid operand for inline asm constraint '"
5350 << OpInfo.ConstraintCode << "'!\n";
5354 // Add information to the INLINEASM node to know about this input.
5355 unsigned ResOpType = 3 /*IMM*/ | (Ops.size() << 3);
5356 AsmNodeOperands.push_back(DAG.getTargetConstant(ResOpType,
5357 TLI.getPointerTy()));
5358 AsmNodeOperands.insert(AsmNodeOperands.end(), Ops.begin(), Ops.end());
5360 } else if (OpInfo.ConstraintType == TargetLowering::C_Memory) {
5361 assert(OpInfo.isIndirect && "Operand must be indirect to be a mem!");
5362 assert(InOperandVal.getValueType() == TLI.getPointerTy() &&
5363 "Memory operands expect pointer values");
5365 // Add information to the INLINEASM node to know about this input.
5366 unsigned ResOpType = 4/*MEM*/ | (1<<3);
5367 AsmNodeOperands.push_back(DAG.getTargetConstant(ResOpType,
5368 TLI.getPointerTy()));
5369 AsmNodeOperands.push_back(InOperandVal);
5373 assert((OpInfo.ConstraintType == TargetLowering::C_RegisterClass ||
5374 OpInfo.ConstraintType == TargetLowering::C_Register) &&
5375 "Unknown constraint type!");
5376 assert(!OpInfo.isIndirect &&
5377 "Don't know how to handle indirect register inputs yet!");
5379 // Copy the input into the appropriate registers.
5380 if (OpInfo.AssignedRegs.Regs.empty()) {
5381 cerr << "Couldn't allocate output reg for constraint '"
5382 << OpInfo.ConstraintCode << "'!\n";
5386 OpInfo.AssignedRegs.getCopyToRegs(InOperandVal, DAG, getCurDebugLoc(),
5389 OpInfo.AssignedRegs.AddInlineAsmOperands(1/*REGUSE*/, false, 0,
5390 DAG, AsmNodeOperands);
5393 case InlineAsm::isClobber: {
5394 // Add the clobbered value to the operand list, so that the register
5395 // allocator is aware that the physreg got clobbered.
5396 if (!OpInfo.AssignedRegs.Regs.empty())
5397 OpInfo.AssignedRegs.AddInlineAsmOperands(6 /* EARLYCLOBBER REGDEF */,
5398 false, 0, DAG,AsmNodeOperands);
5404 // Finish up input operands.
5405 AsmNodeOperands[0] = Chain;
5406 if (Flag.getNode()) AsmNodeOperands.push_back(Flag);
5408 Chain = DAG.getNode(ISD::INLINEASM, getCurDebugLoc(),
5409 DAG.getVTList(MVT::Other, MVT::Flag),
5410 &AsmNodeOperands[0], AsmNodeOperands.size());
5411 Flag = Chain.getValue(1);
5413 // If this asm returns a register value, copy the result from that register
5414 // and set it as the value of the call.
5415 if (!RetValRegs.Regs.empty()) {
5416 SDValue Val = RetValRegs.getCopyFromRegs(DAG, getCurDebugLoc(),
5419 // FIXME: Why don't we do this for inline asms with MRVs?
5420 if (CS.getType()->isSingleValueType() && CS.getType()->isSized()) {
5421 MVT ResultType = TLI.getValueType(CS.getType());
5423 // If any of the results of the inline asm is a vector, it may have the
5424 // wrong width/num elts. This can happen for register classes that can
5425 // contain multiple different value types. The preg or vreg allocated may
5426 // not have the same VT as was expected. Convert it to the right type
5427 // with bit_convert.
5428 if (ResultType != Val.getValueType() && Val.getValueType().isVector()) {
5429 Val = DAG.getNode(ISD::BIT_CONVERT, getCurDebugLoc(),
5432 } else if (ResultType != Val.getValueType() &&
5433 ResultType.isInteger() && Val.getValueType().isInteger()) {
5434 // If a result value was tied to an input value, the computed result may
5435 // have a wider width than the expected result. Extract the relevant
5437 Val = DAG.getNode(ISD::TRUNCATE, getCurDebugLoc(), ResultType, Val);
5440 assert(ResultType == Val.getValueType() && "Asm result value mismatch!");
5443 setValue(CS.getInstruction(), Val);
5446 std::vector<std::pair<SDValue, Value*> > StoresToEmit;
5448 // Process indirect outputs, first output all of the flagged copies out of
5450 for (unsigned i = 0, e = IndirectStoresToEmit.size(); i != e; ++i) {
5451 RegsForValue &OutRegs = IndirectStoresToEmit[i].first;
5452 Value *Ptr = IndirectStoresToEmit[i].second;
5453 SDValue OutVal = OutRegs.getCopyFromRegs(DAG, getCurDebugLoc(),
5455 StoresToEmit.push_back(std::make_pair(OutVal, Ptr));
5458 // Emit the non-flagged stores from the physregs.
5459 SmallVector<SDValue, 8> OutChains;
5460 for (unsigned i = 0, e = StoresToEmit.size(); i != e; ++i)
5461 OutChains.push_back(DAG.getStore(Chain, getCurDebugLoc(),
5462 StoresToEmit[i].first,
5463 getValue(StoresToEmit[i].second),
5464 StoresToEmit[i].second, 0));
5465 if (!OutChains.empty())
5466 Chain = DAG.getNode(ISD::TokenFactor, getCurDebugLoc(), MVT::Other,
5467 &OutChains[0], OutChains.size());
5472 void SelectionDAGLowering::visitMalloc(MallocInst &I) {
5473 SDValue Src = getValue(I.getOperand(0));
5475 // Scale up by the type size in the original i32 type width. Various
5476 // mid-level optimizers may make assumptions about demanded bits etc from the
5477 // i32-ness of the optimizer: we do not want to promote to i64 and then
5478 // multiply on 64-bit targets.
5479 // FIXME: Malloc inst should go away: PR715.
5480 uint64_t ElementSize = TD->getTypePaddedSize(I.getType()->getElementType());
5481 if (ElementSize != 1)
5482 Src = DAG.getNode(ISD::MUL, getCurDebugLoc(), Src.getValueType(),
5483 Src, DAG.getConstant(ElementSize, Src.getValueType()));
5485 MVT IntPtr = TLI.getPointerTy();
5487 if (IntPtr.bitsLT(Src.getValueType()))
5488 Src = DAG.getNode(ISD::TRUNCATE, getCurDebugLoc(), IntPtr, Src);
5489 else if (IntPtr.bitsGT(Src.getValueType()))
5490 Src = DAG.getNode(ISD::ZERO_EXTEND, getCurDebugLoc(), IntPtr, Src);
5492 TargetLowering::ArgListTy Args;
5493 TargetLowering::ArgListEntry Entry;
5495 Entry.Ty = TLI.getTargetData()->getIntPtrType();
5496 Args.push_back(Entry);
5498 std::pair<SDValue,SDValue> Result =
5499 TLI.LowerCallTo(getRoot(), I.getType(), false, false, false, false,
5500 CallingConv::C, PerformTailCallOpt,
5501 DAG.getExternalSymbol("malloc", IntPtr),
5502 Args, DAG, getCurDebugLoc());
5503 setValue(&I, Result.first); // Pointers always fit in registers
5504 DAG.setRoot(Result.second);
5507 void SelectionDAGLowering::visitFree(FreeInst &I) {
5508 TargetLowering::ArgListTy Args;
5509 TargetLowering::ArgListEntry Entry;
5510 Entry.Node = getValue(I.getOperand(0));
5511 Entry.Ty = TLI.getTargetData()->getIntPtrType();
5512 Args.push_back(Entry);
5513 MVT IntPtr = TLI.getPointerTy();
5514 std::pair<SDValue,SDValue> Result =
5515 TLI.LowerCallTo(getRoot(), Type::VoidTy, false, false, false, false,
5516 CallingConv::C, PerformTailCallOpt,
5517 DAG.getExternalSymbol("free", IntPtr), Args, DAG,
5519 DAG.setRoot(Result.second);
5522 void SelectionDAGLowering::visitVAStart(CallInst &I) {
5523 DAG.setRoot(DAG.getNode(ISD::VASTART, getCurDebugLoc(),
5524 MVT::Other, getRoot(),
5525 getValue(I.getOperand(1)),
5526 DAG.getSrcValue(I.getOperand(1))));
5529 void SelectionDAGLowering::visitVAArg(VAArgInst &I) {
5530 SDValue V = DAG.getVAArg(TLI.getValueType(I.getType()), getCurDebugLoc(),
5531 getRoot(), getValue(I.getOperand(0)),
5532 DAG.getSrcValue(I.getOperand(0)));
5534 DAG.setRoot(V.getValue(1));
5537 void SelectionDAGLowering::visitVAEnd(CallInst &I) {
5538 DAG.setRoot(DAG.getNode(ISD::VAEND, getCurDebugLoc(),
5539 MVT::Other, getRoot(),
5540 getValue(I.getOperand(1)),
5541 DAG.getSrcValue(I.getOperand(1))));
5544 void SelectionDAGLowering::visitVACopy(CallInst &I) {
5545 DAG.setRoot(DAG.getNode(ISD::VACOPY, getCurDebugLoc(),
5546 MVT::Other, getRoot(),
5547 getValue(I.getOperand(1)),
5548 getValue(I.getOperand(2)),
5549 DAG.getSrcValue(I.getOperand(1)),
5550 DAG.getSrcValue(I.getOperand(2))));
5553 /// TargetLowering::LowerArguments - This is the default LowerArguments
5554 /// implementation, which just inserts a FORMAL_ARGUMENTS node. FIXME: When all
5555 /// targets are migrated to using FORMAL_ARGUMENTS, this hook should be
5556 /// integrated into SDISel.
5557 void TargetLowering::LowerArguments(Function &F, SelectionDAG &DAG,
5558 SmallVectorImpl<SDValue> &ArgValues,
5560 // Add CC# and isVararg as operands to the FORMAL_ARGUMENTS node.
5561 SmallVector<SDValue, 3+16> Ops;
5562 Ops.push_back(DAG.getRoot());
5563 Ops.push_back(DAG.getConstant(F.getCallingConv(), getPointerTy()));
5564 Ops.push_back(DAG.getConstant(F.isVarArg(), getPointerTy()));
5566 // Add one result value for each formal argument.
5567 SmallVector<MVT, 16> RetVals;
5569 for (Function::arg_iterator I = F.arg_begin(), E = F.arg_end();
5571 SmallVector<MVT, 4> ValueVTs;
5572 ComputeValueVTs(*this, I->getType(), ValueVTs);
5573 for (unsigned Value = 0, NumValues = ValueVTs.size();
5574 Value != NumValues; ++Value) {
5575 MVT VT = ValueVTs[Value];
5576 const Type *ArgTy = VT.getTypeForMVT();
5577 ISD::ArgFlagsTy Flags;
5578 unsigned OriginalAlignment =
5579 getTargetData()->getABITypeAlignment(ArgTy);
5581 if (F.paramHasAttr(j, Attribute::ZExt))
5583 if (F.paramHasAttr(j, Attribute::SExt))
5585 if (F.paramHasAttr(j, Attribute::InReg))
5587 if (F.paramHasAttr(j, Attribute::StructRet))
5589 if (F.paramHasAttr(j, Attribute::ByVal)) {
5591 const PointerType *Ty = cast<PointerType>(I->getType());
5592 const Type *ElementTy = Ty->getElementType();
5593 unsigned FrameAlign = getByValTypeAlignment(ElementTy);
5594 unsigned FrameSize = getTargetData()->getTypePaddedSize(ElementTy);
5595 // For ByVal, alignment should be passed from FE. BE will guess if
5596 // this info is not there but there are cases it cannot get right.
5597 if (F.getParamAlignment(j))
5598 FrameAlign = F.getParamAlignment(j);
5599 Flags.setByValAlign(FrameAlign);
5600 Flags.setByValSize(FrameSize);
5602 if (F.paramHasAttr(j, Attribute::Nest))
5604 Flags.setOrigAlign(OriginalAlignment);
5606 MVT RegisterVT = getRegisterType(VT);
5607 unsigned NumRegs = getNumRegisters(VT);
5608 for (unsigned i = 0; i != NumRegs; ++i) {
5609 RetVals.push_back(RegisterVT);
5610 ISD::ArgFlagsTy MyFlags = Flags;
5611 if (NumRegs > 1 && i == 0)
5613 // if it isn't first piece, alignment must be 1
5615 MyFlags.setOrigAlign(1);
5616 Ops.push_back(DAG.getArgFlags(MyFlags));
5621 RetVals.push_back(MVT::Other);
5624 SDNode *Result = DAG.getNode(ISD::FORMAL_ARGUMENTS, dl,
5625 DAG.getVTList(&RetVals[0], RetVals.size()),
5626 &Ops[0], Ops.size()).getNode();
5628 // Prelower FORMAL_ARGUMENTS. This isn't required for functionality, but
5629 // allows exposing the loads that may be part of the argument access to the
5630 // first DAGCombiner pass.
5631 SDValue TmpRes = LowerOperation(SDValue(Result, 0), DAG);
5633 // The number of results should match up, except that the lowered one may have
5634 // an extra flag result.
5635 assert((Result->getNumValues() == TmpRes.getNode()->getNumValues() ||
5636 (Result->getNumValues()+1 == TmpRes.getNode()->getNumValues() &&
5637 TmpRes.getValue(Result->getNumValues()).getValueType() == MVT::Flag))
5638 && "Lowering produced unexpected number of results!");
5640 // The FORMAL_ARGUMENTS node itself is likely no longer needed.
5641 if (Result != TmpRes.getNode() && Result->use_empty()) {
5642 HandleSDNode Dummy(DAG.getRoot());
5643 DAG.RemoveDeadNode(Result);
5646 Result = TmpRes.getNode();
5648 unsigned NumArgRegs = Result->getNumValues() - 1;
5649 DAG.setRoot(SDValue(Result, NumArgRegs));
5651 // Set up the return result vector.
5654 for (Function::arg_iterator I = F.arg_begin(), E = F.arg_end(); I != E;
5656 SmallVector<MVT, 4> ValueVTs;
5657 ComputeValueVTs(*this, I->getType(), ValueVTs);
5658 for (unsigned Value = 0, NumValues = ValueVTs.size();
5659 Value != NumValues; ++Value) {
5660 MVT VT = ValueVTs[Value];
5661 MVT PartVT = getRegisterType(VT);
5663 unsigned NumParts = getNumRegisters(VT);
5664 SmallVector<SDValue, 4> Parts(NumParts);
5665 for (unsigned j = 0; j != NumParts; ++j)
5666 Parts[j] = SDValue(Result, i++);
5668 ISD::NodeType AssertOp = ISD::DELETED_NODE;
5669 if (F.paramHasAttr(Idx, Attribute::SExt))
5670 AssertOp = ISD::AssertSext;
5671 else if (F.paramHasAttr(Idx, Attribute::ZExt))
5672 AssertOp = ISD::AssertZext;
5674 ArgValues.push_back(getCopyFromParts(DAG, dl, &Parts[0], NumParts,
5675 PartVT, VT, AssertOp));
5678 assert(i == NumArgRegs && "Argument register count mismatch!");
5682 /// TargetLowering::LowerCallTo - This is the default LowerCallTo
5683 /// implementation, which just inserts an ISD::CALL node, which is later custom
5684 /// lowered by the target to something concrete. FIXME: When all targets are
5685 /// migrated to using ISD::CALL, this hook should be integrated into SDISel.
5686 std::pair<SDValue, SDValue>
5687 TargetLowering::LowerCallTo(SDValue Chain, const Type *RetTy,
5688 bool RetSExt, bool RetZExt, bool isVarArg,
5690 unsigned CallingConv, bool isTailCall,
5692 ArgListTy &Args, SelectionDAG &DAG, DebugLoc dl) {
5693 assert((!isTailCall || PerformTailCallOpt) &&
5694 "isTailCall set when tail-call optimizations are disabled!");
5696 SmallVector<SDValue, 32> Ops;
5697 Ops.push_back(Chain); // Op#0 - Chain
5698 Ops.push_back(Callee);
5700 // Handle all of the outgoing arguments.
5701 for (unsigned i = 0, e = Args.size(); i != e; ++i) {
5702 SmallVector<MVT, 4> ValueVTs;
5703 ComputeValueVTs(*this, Args[i].Ty, ValueVTs);
5704 for (unsigned Value = 0, NumValues = ValueVTs.size();
5705 Value != NumValues; ++Value) {
5706 MVT VT = ValueVTs[Value];
5707 const Type *ArgTy = VT.getTypeForMVT();
5708 SDValue Op = SDValue(Args[i].Node.getNode(),
5709 Args[i].Node.getResNo() + Value);
5710 ISD::ArgFlagsTy Flags;
5711 unsigned OriginalAlignment =
5712 getTargetData()->getABITypeAlignment(ArgTy);
5718 if (Args[i].isInReg)
5722 if (Args[i].isByVal) {
5724 const PointerType *Ty = cast<PointerType>(Args[i].Ty);
5725 const Type *ElementTy = Ty->getElementType();
5726 unsigned FrameAlign = getByValTypeAlignment(ElementTy);
5727 unsigned FrameSize = getTargetData()->getTypePaddedSize(ElementTy);
5728 // For ByVal, alignment should come from FE. BE will guess if this
5729 // info is not there but there are cases it cannot get right.
5730 if (Args[i].Alignment)
5731 FrameAlign = Args[i].Alignment;
5732 Flags.setByValAlign(FrameAlign);
5733 Flags.setByValSize(FrameSize);
5737 Flags.setOrigAlign(OriginalAlignment);
5739 MVT PartVT = getRegisterType(VT);
5740 unsigned NumParts = getNumRegisters(VT);
5741 SmallVector<SDValue, 4> Parts(NumParts);
5742 ISD::NodeType ExtendKind = ISD::ANY_EXTEND;
5745 ExtendKind = ISD::SIGN_EXTEND;
5746 else if (Args[i].isZExt)
5747 ExtendKind = ISD::ZERO_EXTEND;
5749 getCopyToParts(DAG, dl, Op, &Parts[0], NumParts, PartVT, ExtendKind);
5751 for (unsigned i = 0; i != NumParts; ++i) {
5752 // if it isn't first piece, alignment must be 1
5753 ISD::ArgFlagsTy MyFlags = Flags;
5754 if (NumParts > 1 && i == 0)
5757 MyFlags.setOrigAlign(1);
5759 Ops.push_back(Parts[i]);
5760 Ops.push_back(DAG.getArgFlags(MyFlags));
5765 // Figure out the result value types. We start by making a list of
5766 // the potentially illegal return value types.
5767 SmallVector<MVT, 4> LoweredRetTys;
5768 SmallVector<MVT, 4> RetTys;
5769 ComputeValueVTs(*this, RetTy, RetTys);
5771 // Then we translate that to a list of legal types.
5772 for (unsigned I = 0, E = RetTys.size(); I != E; ++I) {
5774 MVT RegisterVT = getRegisterType(VT);
5775 unsigned NumRegs = getNumRegisters(VT);
5776 for (unsigned i = 0; i != NumRegs; ++i)
5777 LoweredRetTys.push_back(RegisterVT);
5780 LoweredRetTys.push_back(MVT::Other); // Always has a chain.
5782 // Create the CALL node.
5783 SDValue Res = DAG.getCall(CallingConv, dl,
5784 isVarArg, isTailCall, isInreg,
5785 DAG.getVTList(&LoweredRetTys[0],
5786 LoweredRetTys.size()),
5789 Chain = Res.getValue(LoweredRetTys.size() - 1);
5791 // Gather up the call result into a single value.
5792 if (RetTy != Type::VoidTy && !RetTys.empty()) {
5793 ISD::NodeType AssertOp = ISD::DELETED_NODE;
5796 AssertOp = ISD::AssertSext;
5798 AssertOp = ISD::AssertZext;
5800 SmallVector<SDValue, 4> ReturnValues;
5802 for (unsigned I = 0, E = RetTys.size(); I != E; ++I) {
5804 MVT RegisterVT = getRegisterType(VT);
5805 unsigned NumRegs = getNumRegisters(VT);
5806 unsigned RegNoEnd = NumRegs + RegNo;
5807 SmallVector<SDValue, 4> Results;
5808 for (; RegNo != RegNoEnd; ++RegNo)
5809 Results.push_back(Res.getValue(RegNo));
5810 SDValue ReturnValue =
5811 getCopyFromParts(DAG, dl, &Results[0], NumRegs, RegisterVT, VT,
5813 ReturnValues.push_back(ReturnValue);
5815 Res = DAG.getNode(ISD::MERGE_VALUES, dl,
5816 DAG.getVTList(&RetTys[0], RetTys.size()),
5817 &ReturnValues[0], ReturnValues.size());
5820 return std::make_pair(Res, Chain);
5823 void TargetLowering::LowerOperationWrapper(SDNode *N,
5824 SmallVectorImpl<SDValue> &Results,
5825 SelectionDAG &DAG) {
5826 SDValue Res = LowerOperation(SDValue(N, 0), DAG);
5828 Results.push_back(Res);
5831 SDValue TargetLowering::LowerOperation(SDValue Op, SelectionDAG &DAG) {
5832 assert(0 && "LowerOperation not implemented for this target!");
5838 void SelectionDAGLowering::CopyValueToVirtualRegister(Value *V, unsigned Reg) {
5839 SDValue Op = getValue(V);
5840 assert((Op.getOpcode() != ISD::CopyFromReg ||
5841 cast<RegisterSDNode>(Op.getOperand(1))->getReg() != Reg) &&
5842 "Copy from a reg to the same reg!");
5843 assert(!TargetRegisterInfo::isPhysicalRegister(Reg) && "Is a physreg");
5845 RegsForValue RFV(TLI, Reg, V->getType());
5846 SDValue Chain = DAG.getEntryNode();
5847 RFV.getCopyToRegs(Op, DAG, getCurDebugLoc(), Chain, 0);
5848 PendingExports.push_back(Chain);
5851 #include "llvm/CodeGen/SelectionDAGISel.h"
5853 void SelectionDAGISel::
5854 LowerArguments(BasicBlock *LLVMBB) {
5855 // If this is the entry block, emit arguments.
5856 Function &F = *LLVMBB->getParent();
5857 SDValue OldRoot = SDL->DAG.getRoot();
5858 SmallVector<SDValue, 16> Args;
5859 TLI.LowerArguments(F, SDL->DAG, Args, SDL->getCurDebugLoc());
5862 for (Function::arg_iterator AI = F.arg_begin(), E = F.arg_end();
5864 SmallVector<MVT, 4> ValueVTs;
5865 ComputeValueVTs(TLI, AI->getType(), ValueVTs);
5866 unsigned NumValues = ValueVTs.size();
5867 if (!AI->use_empty()) {
5868 SDL->setValue(AI, SDL->DAG.getMergeValues(&Args[a], NumValues,
5869 SDL->getCurDebugLoc()));
5870 // If this argument is live outside of the entry block, insert a copy from
5871 // whereever we got it to the vreg that other BB's will reference it as.
5872 DenseMap<const Value*, unsigned>::iterator VMI=FuncInfo->ValueMap.find(AI);
5873 if (VMI != FuncInfo->ValueMap.end()) {
5874 SDL->CopyValueToVirtualRegister(AI, VMI->second);
5880 // Finally, if the target has anything special to do, allow it to do so.
5881 // FIXME: this should insert code into the DAG!
5882 EmitFunctionEntryCode(F, SDL->DAG.getMachineFunction());
5885 /// Handle PHI nodes in successor blocks. Emit code into the SelectionDAG to
5886 /// ensure constants are generated when needed. Remember the virtual registers
5887 /// that need to be added to the Machine PHI nodes as input. We cannot just
5888 /// directly add them, because expansion might result in multiple MBB's for one
5889 /// BB. As such, the start of the BB might correspond to a different MBB than
5893 SelectionDAGISel::HandlePHINodesInSuccessorBlocks(BasicBlock *LLVMBB) {
5894 TerminatorInst *TI = LLVMBB->getTerminator();
5896 SmallPtrSet<MachineBasicBlock *, 4> SuccsHandled;
5898 // Check successor nodes' PHI nodes that expect a constant to be available
5900 for (unsigned succ = 0, e = TI->getNumSuccessors(); succ != e; ++succ) {
5901 BasicBlock *SuccBB = TI->getSuccessor(succ);
5902 if (!isa<PHINode>(SuccBB->begin())) continue;
5903 MachineBasicBlock *SuccMBB = FuncInfo->MBBMap[SuccBB];
5905 // If this terminator has multiple identical successors (common for
5906 // switches), only handle each succ once.
5907 if (!SuccsHandled.insert(SuccMBB)) continue;
5909 MachineBasicBlock::iterator MBBI = SuccMBB->begin();
5912 // At this point we know that there is a 1-1 correspondence between LLVM PHI
5913 // nodes and Machine PHI nodes, but the incoming operands have not been
5915 for (BasicBlock::iterator I = SuccBB->begin();
5916 (PN = dyn_cast<PHINode>(I)); ++I) {
5917 // Ignore dead phi's.
5918 if (PN->use_empty()) continue;
5921 Value *PHIOp = PN->getIncomingValueForBlock(LLVMBB);
5923 if (Constant *C = dyn_cast<Constant>(PHIOp)) {
5924 unsigned &RegOut = SDL->ConstantsOut[C];
5926 RegOut = FuncInfo->CreateRegForValue(C);
5927 SDL->CopyValueToVirtualRegister(C, RegOut);
5931 Reg = FuncInfo->ValueMap[PHIOp];
5933 assert(isa<AllocaInst>(PHIOp) &&
5934 FuncInfo->StaticAllocaMap.count(cast<AllocaInst>(PHIOp)) &&
5935 "Didn't codegen value into a register!??");
5936 Reg = FuncInfo->CreateRegForValue(PHIOp);
5937 SDL->CopyValueToVirtualRegister(PHIOp, Reg);
5941 // Remember that this register needs to added to the machine PHI node as
5942 // the input for this MBB.
5943 SmallVector<MVT, 4> ValueVTs;
5944 ComputeValueVTs(TLI, PN->getType(), ValueVTs);
5945 for (unsigned vti = 0, vte = ValueVTs.size(); vti != vte; ++vti) {
5946 MVT VT = ValueVTs[vti];
5947 unsigned NumRegisters = TLI.getNumRegisters(VT);
5948 for (unsigned i = 0, e = NumRegisters; i != e; ++i)
5949 SDL->PHINodesToUpdate.push_back(std::make_pair(MBBI++, Reg+i));
5950 Reg += NumRegisters;
5954 SDL->ConstantsOut.clear();
5957 /// This is the Fast-ISel version of HandlePHINodesInSuccessorBlocks. It only
5958 /// supports legal types, and it emits MachineInstrs directly instead of
5959 /// creating SelectionDAG nodes.
5962 SelectionDAGISel::HandlePHINodesInSuccessorBlocksFast(BasicBlock *LLVMBB,
5964 TerminatorInst *TI = LLVMBB->getTerminator();
5966 SmallPtrSet<MachineBasicBlock *, 4> SuccsHandled;
5967 unsigned OrigNumPHINodesToUpdate = SDL->PHINodesToUpdate.size();
5969 // Check successor nodes' PHI nodes that expect a constant to be available
5971 for (unsigned succ = 0, e = TI->getNumSuccessors(); succ != e; ++succ) {
5972 BasicBlock *SuccBB = TI->getSuccessor(succ);
5973 if (!isa<PHINode>(SuccBB->begin())) continue;
5974 MachineBasicBlock *SuccMBB = FuncInfo->MBBMap[SuccBB];
5976 // If this terminator has multiple identical successors (common for
5977 // switches), only handle each succ once.
5978 if (!SuccsHandled.insert(SuccMBB)) continue;
5980 MachineBasicBlock::iterator MBBI = SuccMBB->begin();
5983 // At this point we know that there is a 1-1 correspondence between LLVM PHI
5984 // nodes and Machine PHI nodes, but the incoming operands have not been
5986 for (BasicBlock::iterator I = SuccBB->begin();
5987 (PN = dyn_cast<PHINode>(I)); ++I) {
5988 // Ignore dead phi's.
5989 if (PN->use_empty()) continue;
5991 // Only handle legal types. Two interesting things to note here. First,
5992 // by bailing out early, we may leave behind some dead instructions,
5993 // since SelectionDAG's HandlePHINodesInSuccessorBlocks will insert its
5994 // own moves. Second, this check is necessary becuase FastISel doesn't
5995 // use CreateRegForValue to create registers, so it always creates
5996 // exactly one register for each non-void instruction.
5997 MVT VT = TLI.getValueType(PN->getType(), /*AllowUnknown=*/true);
5998 if (VT == MVT::Other || !TLI.isTypeLegal(VT)) {
6001 VT = TLI.getTypeToTransformTo(VT);
6003 SDL->PHINodesToUpdate.resize(OrigNumPHINodesToUpdate);
6008 Value *PHIOp = PN->getIncomingValueForBlock(LLVMBB);
6010 unsigned Reg = F->getRegForValue(PHIOp);
6012 SDL->PHINodesToUpdate.resize(OrigNumPHINodesToUpdate);
6015 SDL->PHINodesToUpdate.push_back(std::make_pair(MBBI++, Reg));