1 //===-- SelectionDAGISel.cpp - Implement the SelectionDAGISel class -------===//
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 the SelectionDAGISel class.
12 //===----------------------------------------------------------------------===//
14 #define DEBUG_TYPE "isel"
15 #include "llvm/ADT/BitVector.h"
16 #include "llvm/Analysis/AliasAnalysis.h"
17 #include "llvm/CodeGen/SelectionDAGISel.h"
18 #include "llvm/CodeGen/ScheduleDAG.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/ParameterAttributes.h"
29 #include "llvm/CodeGen/Collector.h"
30 #include "llvm/CodeGen/MachineFunction.h"
31 #include "llvm/CodeGen/MachineFrameInfo.h"
32 #include "llvm/CodeGen/MachineInstrBuilder.h"
33 #include "llvm/CodeGen/MachineJumpTableInfo.h"
34 #include "llvm/CodeGen/MachineModuleInfo.h"
35 #include "llvm/CodeGen/MachineRegisterInfo.h"
36 #include "llvm/CodeGen/SchedulerRegistry.h"
37 #include "llvm/CodeGen/SelectionDAG.h"
38 #include "llvm/Target/TargetRegisterInfo.h"
39 #include "llvm/Target/TargetData.h"
40 #include "llvm/Target/TargetFrameInfo.h"
41 #include "llvm/Target/TargetInstrInfo.h"
42 #include "llvm/Target/TargetLowering.h"
43 #include "llvm/Target/TargetMachine.h"
44 #include "llvm/Target/TargetOptions.h"
45 #include "llvm/Support/MathExtras.h"
46 #include "llvm/Support/Debug.h"
47 #include "llvm/Support/Compiler.h"
52 EnableValueProp("enable-value-prop", cl::Hidden, cl::init(false));
57 ViewISelDAGs("view-isel-dags", cl::Hidden,
58 cl::desc("Pop up a window to show isel dags as they are selected"));
60 ViewSchedDAGs("view-sched-dags", cl::Hidden,
61 cl::desc("Pop up a window to show sched dags as they are processed"));
63 ViewSUnitDAGs("view-sunit-dags", cl::Hidden,
64 cl::desc("Pop up a window to show SUnit dags after they are processed"));
66 static const bool ViewISelDAGs = 0, ViewSchedDAGs = 0, ViewSUnitDAGs = 0;
69 //===---------------------------------------------------------------------===//
71 /// RegisterScheduler class - Track the registration of instruction schedulers.
73 //===---------------------------------------------------------------------===//
74 MachinePassRegistry RegisterScheduler::Registry;
76 //===---------------------------------------------------------------------===//
78 /// ISHeuristic command line option for instruction schedulers.
80 //===---------------------------------------------------------------------===//
81 static cl::opt<RegisterScheduler::FunctionPassCtor, false,
82 RegisterPassParser<RegisterScheduler> >
83 ISHeuristic("pre-RA-sched",
84 cl::init(&createDefaultScheduler),
85 cl::desc("Instruction schedulers available (before register"
88 static RegisterScheduler
89 defaultListDAGScheduler("default", " Best scheduler for the target",
90 createDefaultScheduler);
92 namespace { struct SDISelAsmOperandInfo; }
94 /// ComputeLinearIndex - Given an LLVM IR aggregate type and a sequence
95 /// insertvalue or extractvalue indices that identify a member, return
96 /// the linearized index of the start of the member.
98 static unsigned ComputeLinearIndex(const TargetLowering &TLI, const Type *Ty,
99 const unsigned *Indices,
100 const unsigned *IndicesEnd,
101 unsigned CurIndex = 0) {
102 // Base case: We're done.
103 if (Indices == IndicesEnd)
106 // Otherwise we need to recurse. A non-negative value is used to
107 // indicate the final result value; a negative value carries the
108 // complemented position to continue the search.
109 CurIndex = ~CurIndex;
111 // Given a struct type, recursively traverse the elements.
112 if (const StructType *STy = dyn_cast<StructType>(Ty)) {
113 for (StructType::element_iterator EI = STy->element_begin(),
114 EE = STy->element_end();
116 CurIndex = ComputeLinearIndex(TLI, *EI, Indices+1, IndicesEnd,
118 if ((int)CurIndex >= 0)
122 // Given an array type, recursively traverse the elements.
123 else if (const ArrayType *ATy = dyn_cast<ArrayType>(Ty)) {
124 const Type *EltTy = ATy->getElementType();
125 for (unsigned i = 0, e = ATy->getNumElements(); i != e; ++i) {
126 CurIndex = ComputeLinearIndex(TLI, EltTy, Indices+1, IndicesEnd,
128 if ((int)CurIndex >= 0)
132 // We haven't found the type we're looking for, so keep searching.
136 /// ComputeValueVTs - Given an LLVM IR type, compute a sequence of
137 /// MVTs that represent all the individual underlying
138 /// non-aggregate types that comprise it.
140 /// If Offsets is non-null, it points to a vector to be filled in
141 /// with the in-memory offsets of each of the individual values.
143 static void ComputeValueVTs(const TargetLowering &TLI, const Type *Ty,
144 SmallVectorImpl<MVT> &ValueVTs,
145 SmallVectorImpl<uint64_t> *Offsets = 0,
146 uint64_t StartingOffset = 0) {
147 // Given a struct type, recursively traverse the elements.
148 if (const StructType *STy = dyn_cast<StructType>(Ty)) {
149 const StructLayout *SL = TLI.getTargetData()->getStructLayout(STy);
150 for (StructType::element_iterator EB = STy->element_begin(),
152 EE = STy->element_end();
154 ComputeValueVTs(TLI, *EI, ValueVTs, Offsets,
155 StartingOffset + SL->getElementOffset(EI - EB));
158 // Given an array type, recursively traverse the elements.
159 if (const ArrayType *ATy = dyn_cast<ArrayType>(Ty)) {
160 const Type *EltTy = ATy->getElementType();
161 uint64_t EltSize = TLI.getTargetData()->getABITypeSize(EltTy);
162 for (unsigned i = 0, e = ATy->getNumElements(); i != e; ++i)
163 ComputeValueVTs(TLI, EltTy, ValueVTs, Offsets,
164 StartingOffset + i * EltSize);
167 // Base case: we can get an MVT for this LLVM IR type.
168 ValueVTs.push_back(TLI.getValueType(Ty));
170 Offsets->push_back(StartingOffset);
174 /// RegsForValue - This struct represents the registers (physical or virtual)
175 /// that a particular set of values is assigned, and the type information about
176 /// the value. The most common situation is to represent one value at a time,
177 /// but struct or array values are handled element-wise as multiple values.
178 /// The splitting of aggregates is performed recursively, so that we never
179 /// have aggregate-typed registers. The values at this point do not necessarily
180 /// have legal types, so each value may require one or more registers of some
183 struct VISIBILITY_HIDDEN RegsForValue {
184 /// TLI - The TargetLowering object.
186 const TargetLowering *TLI;
188 /// ValueVTs - The value types of the values, which may not be legal, and
189 /// may need be promoted or synthesized from one or more registers.
191 SmallVector<MVT, 4> ValueVTs;
193 /// RegVTs - The value types of the registers. This is the same size as
194 /// ValueVTs and it records, for each value, what the type of the assigned
195 /// register or registers are. (Individual values are never synthesized
196 /// from more than one type of register.)
198 /// With virtual registers, the contents of RegVTs is redundant with TLI's
199 /// getRegisterType member function, however when with physical registers
200 /// it is necessary to have a separate record of the types.
202 SmallVector<MVT, 4> RegVTs;
204 /// Regs - This list holds the registers assigned to the values.
205 /// Each legal or promoted value requires one register, and each
206 /// expanded value requires multiple registers.
208 SmallVector<unsigned, 4> Regs;
210 RegsForValue() : TLI(0) {}
212 RegsForValue(const TargetLowering &tli,
213 const SmallVector<unsigned, 4> ®s,
214 MVT regvt, MVT valuevt)
215 : TLI(&tli), ValueVTs(1, valuevt), RegVTs(1, regvt), Regs(regs) {}
216 RegsForValue(const TargetLowering &tli,
217 const SmallVector<unsigned, 4> ®s,
218 const SmallVector<MVT, 4> ®vts,
219 const SmallVector<MVT, 4> &valuevts)
220 : TLI(&tli), ValueVTs(valuevts), RegVTs(regvts), Regs(regs) {}
221 RegsForValue(const TargetLowering &tli,
222 unsigned Reg, const Type *Ty) : TLI(&tli) {
223 ComputeValueVTs(tli, Ty, ValueVTs);
225 for (unsigned Value = 0, e = ValueVTs.size(); Value != e; ++Value) {
226 MVT ValueVT = ValueVTs[Value];
227 unsigned NumRegs = TLI->getNumRegisters(ValueVT);
228 MVT RegisterVT = TLI->getRegisterType(ValueVT);
229 for (unsigned i = 0; i != NumRegs; ++i)
230 Regs.push_back(Reg + i);
231 RegVTs.push_back(RegisterVT);
236 /// append - Add the specified values to this one.
237 void append(const RegsForValue &RHS) {
239 ValueVTs.append(RHS.ValueVTs.begin(), RHS.ValueVTs.end());
240 RegVTs.append(RHS.RegVTs.begin(), RHS.RegVTs.end());
241 Regs.append(RHS.Regs.begin(), RHS.Regs.end());
245 /// getCopyFromRegs - Emit a series of CopyFromReg nodes that copies from
246 /// this value and returns the result as a ValueVTs value. This uses
247 /// Chain/Flag as the input and updates them for the output Chain/Flag.
248 /// If the Flag pointer is NULL, no flag is used.
249 SDOperand getCopyFromRegs(SelectionDAG &DAG,
250 SDOperand &Chain, SDOperand *Flag) const;
252 /// getCopyToRegs - Emit a series of CopyToReg nodes that copies the
253 /// specified value into the registers specified by this object. This uses
254 /// Chain/Flag as the input and updates them for the output Chain/Flag.
255 /// If the Flag pointer is NULL, no flag is used.
256 void getCopyToRegs(SDOperand Val, SelectionDAG &DAG,
257 SDOperand &Chain, SDOperand *Flag) const;
259 /// AddInlineAsmOperands - Add this value to the specified inlineasm node
260 /// operand list. This adds the code marker and includes the number of
261 /// values added into it.
262 void AddInlineAsmOperands(unsigned Code, SelectionDAG &DAG,
263 std::vector<SDOperand> &Ops) const;
268 //===--------------------------------------------------------------------===//
269 /// createDefaultScheduler - This creates an instruction scheduler appropriate
271 ScheduleDAG* createDefaultScheduler(SelectionDAGISel *IS,
273 MachineBasicBlock *BB) {
274 TargetLowering &TLI = IS->getTargetLowering();
276 if (TLI.getSchedulingPreference() == TargetLowering::SchedulingForLatency) {
277 return createTDListDAGScheduler(IS, DAG, BB);
279 assert(TLI.getSchedulingPreference() ==
280 TargetLowering::SchedulingForRegPressure && "Unknown sched type!");
281 return createBURRListDAGScheduler(IS, DAG, BB);
286 //===--------------------------------------------------------------------===//
287 /// FunctionLoweringInfo - This contains information that is global to a
288 /// function that is used when lowering a region of the function.
289 class FunctionLoweringInfo {
294 MachineRegisterInfo &RegInfo;
296 FunctionLoweringInfo(TargetLowering &TLI, Function &Fn,MachineFunction &MF);
298 /// MBBMap - A mapping from LLVM basic blocks to their machine code entry.
299 std::map<const BasicBlock*, MachineBasicBlock *> MBBMap;
301 /// ValueMap - Since we emit code for the function a basic block at a time,
302 /// we must remember which virtual registers hold the values for
303 /// cross-basic-block values.
304 DenseMap<const Value*, unsigned> ValueMap;
306 /// StaticAllocaMap - Keep track of frame indices for fixed sized allocas in
307 /// the entry block. This allows the allocas to be efficiently referenced
308 /// anywhere in the function.
309 std::map<const AllocaInst*, int> StaticAllocaMap;
312 SmallSet<Instruction*, 8> CatchInfoLost;
313 SmallSet<Instruction*, 8> CatchInfoFound;
316 unsigned MakeReg(MVT VT) {
317 return RegInfo.createVirtualRegister(TLI.getRegClassFor(VT));
320 /// isExportedInst - Return true if the specified value is an instruction
321 /// exported from its block.
322 bool isExportedInst(const Value *V) {
323 return ValueMap.count(V);
326 unsigned CreateRegForValue(const Value *V);
328 unsigned InitializeRegForValue(const Value *V) {
329 unsigned &R = ValueMap[V];
330 assert(R == 0 && "Already initialized this value register!");
331 return R = CreateRegForValue(V);
335 unsigned NumSignBits;
336 APInt KnownOne, KnownZero;
337 LiveOutInfo() : NumSignBits(0) {}
340 /// LiveOutRegInfo - Information about live out vregs, indexed by their
341 /// register number offset by 'FirstVirtualRegister'.
342 std::vector<LiveOutInfo> LiveOutRegInfo;
346 /// isSelector - Return true if this instruction is a call to the
347 /// eh.selector intrinsic.
348 static bool isSelector(Instruction *I) {
349 if (IntrinsicInst *II = dyn_cast<IntrinsicInst>(I))
350 return (II->getIntrinsicID() == Intrinsic::eh_selector_i32 ||
351 II->getIntrinsicID() == Intrinsic::eh_selector_i64);
355 /// isUsedOutsideOfDefiningBlock - Return true if this instruction is used by
356 /// PHI nodes or outside of the basic block that defines it, or used by a
357 /// switch or atomic instruction, which may expand to multiple basic blocks.
358 static bool isUsedOutsideOfDefiningBlock(Instruction *I) {
359 if (isa<PHINode>(I)) return true;
360 BasicBlock *BB = I->getParent();
361 for (Value::use_iterator UI = I->use_begin(), E = I->use_end(); UI != E; ++UI)
362 if (cast<Instruction>(*UI)->getParent() != BB || isa<PHINode>(*UI) ||
363 // FIXME: Remove switchinst special case.
364 isa<SwitchInst>(*UI))
369 /// isOnlyUsedInEntryBlock - If the specified argument is only used in the
370 /// entry block, return true. This includes arguments used by switches, since
371 /// the switch may expand into multiple basic blocks.
372 static bool isOnlyUsedInEntryBlock(Argument *A) {
373 BasicBlock *Entry = A->getParent()->begin();
374 for (Value::use_iterator UI = A->use_begin(), E = A->use_end(); UI != E; ++UI)
375 if (cast<Instruction>(*UI)->getParent() != Entry || isa<SwitchInst>(*UI))
376 return false; // Use not in entry block.
380 FunctionLoweringInfo::FunctionLoweringInfo(TargetLowering &tli,
381 Function &fn, MachineFunction &mf)
382 : TLI(tli), Fn(fn), MF(mf), RegInfo(MF.getRegInfo()) {
384 // Create a vreg for each argument register that is not dead and is used
385 // outside of the entry block for the function.
386 for (Function::arg_iterator AI = Fn.arg_begin(), E = Fn.arg_end();
388 if (!isOnlyUsedInEntryBlock(AI))
389 InitializeRegForValue(AI);
391 // Initialize the mapping of values to registers. This is only set up for
392 // instruction values that are used outside of the block that defines
394 Function::iterator BB = Fn.begin(), EB = Fn.end();
395 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I)
396 if (AllocaInst *AI = dyn_cast<AllocaInst>(I))
397 if (ConstantInt *CUI = dyn_cast<ConstantInt>(AI->getArraySize())) {
398 const Type *Ty = AI->getAllocatedType();
399 uint64_t TySize = TLI.getTargetData()->getABITypeSize(Ty);
401 std::max((unsigned)TLI.getTargetData()->getPrefTypeAlignment(Ty),
404 TySize *= CUI->getZExtValue(); // Get total allocated size.
405 if (TySize == 0) TySize = 1; // Don't create zero-sized stack objects.
406 StaticAllocaMap[AI] =
407 MF.getFrameInfo()->CreateStackObject(TySize, Align);
410 for (; BB != EB; ++BB)
411 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I)
412 if (!I->use_empty() && isUsedOutsideOfDefiningBlock(I))
413 if (!isa<AllocaInst>(I) ||
414 !StaticAllocaMap.count(cast<AllocaInst>(I)))
415 InitializeRegForValue(I);
417 // Create an initial MachineBasicBlock for each LLVM BasicBlock in F. This
418 // also creates the initial PHI MachineInstrs, though none of the input
419 // operands are populated.
420 for (BB = Fn.begin(), EB = Fn.end(); BB != EB; ++BB) {
421 MachineBasicBlock *MBB = new MachineBasicBlock(BB);
423 MF.getBasicBlockList().push_back(MBB);
425 // Create Machine PHI nodes for LLVM PHI nodes, lowering them as
428 for (BasicBlock::iterator I = BB->begin();(PN = dyn_cast<PHINode>(I)); ++I){
429 if (PN->use_empty()) continue;
431 MVT VT = TLI.getValueType(PN->getType());
432 unsigned NumRegisters = TLI.getNumRegisters(VT);
433 unsigned PHIReg = ValueMap[PN];
434 assert(PHIReg && "PHI node does not have an assigned virtual register!");
435 const TargetInstrInfo *TII = TLI.getTargetMachine().getInstrInfo();
436 for (unsigned i = 0; i != NumRegisters; ++i)
437 BuildMI(MBB, TII->get(TargetInstrInfo::PHI), PHIReg+i);
442 /// CreateRegForValue - Allocate the appropriate number of virtual registers of
443 /// the correctly promoted or expanded types. Assign these registers
444 /// consecutive vreg numbers and return the first assigned number.
446 /// In the case that the given value has struct or array type, this function
447 /// will assign registers for each member or element.
449 unsigned FunctionLoweringInfo::CreateRegForValue(const Value *V) {
450 SmallVector<MVT, 4> ValueVTs;
451 ComputeValueVTs(TLI, V->getType(), ValueVTs);
453 unsigned FirstReg = 0;
454 for (unsigned Value = 0, e = ValueVTs.size(); Value != e; ++Value) {
455 MVT ValueVT = ValueVTs[Value];
456 MVT RegisterVT = TLI.getRegisterType(ValueVT);
458 unsigned NumRegs = TLI.getNumRegisters(ValueVT);
459 for (unsigned i = 0; i != NumRegs; ++i) {
460 unsigned R = MakeReg(RegisterVT);
461 if (!FirstReg) FirstReg = R;
467 //===----------------------------------------------------------------------===//
468 /// SelectionDAGLowering - This is the common target-independent lowering
469 /// implementation that is parameterized by a TargetLowering object.
470 /// Also, targets can overload any lowering method.
473 class SelectionDAGLowering {
474 MachineBasicBlock *CurMBB;
476 DenseMap<const Value*, SDOperand> NodeMap;
478 /// PendingLoads - Loads are not emitted to the program immediately. We bunch
479 /// them up and then emit token factor nodes when possible. This allows us to
480 /// get simple disambiguation between loads without worrying about alias
482 std::vector<SDOperand> PendingLoads;
484 /// PendingExports - CopyToReg nodes that copy values to virtual registers
485 /// for export to other blocks need to be emitted before any terminator
486 /// instruction, but they have no other ordering requirements. We bunch them
487 /// up and the emit a single tokenfactor for them just before terminator
489 std::vector<SDOperand> PendingExports;
491 /// Case - A struct to record the Value for a switch case, and the
492 /// case's target basic block.
496 MachineBasicBlock* BB;
498 Case() : Low(0), High(0), BB(0) { }
499 Case(Constant* low, Constant* high, MachineBasicBlock* bb) :
500 Low(low), High(high), BB(bb) { }
501 uint64_t size() const {
502 uint64_t rHigh = cast<ConstantInt>(High)->getSExtValue();
503 uint64_t rLow = cast<ConstantInt>(Low)->getSExtValue();
504 return (rHigh - rLow + 1ULL);
510 MachineBasicBlock* BB;
513 CaseBits(uint64_t mask, MachineBasicBlock* bb, unsigned bits):
514 Mask(mask), BB(bb), Bits(bits) { }
517 typedef std::vector<Case> CaseVector;
518 typedef std::vector<CaseBits> CaseBitsVector;
519 typedef CaseVector::iterator CaseItr;
520 typedef std::pair<CaseItr, CaseItr> CaseRange;
522 /// CaseRec - A struct with ctor used in lowering switches to a binary tree
523 /// of conditional branches.
525 CaseRec(MachineBasicBlock *bb, Constant *lt, Constant *ge, CaseRange r) :
526 CaseBB(bb), LT(lt), GE(ge), Range(r) {}
528 /// CaseBB - The MBB in which to emit the compare and branch
529 MachineBasicBlock *CaseBB;
530 /// LT, GE - If nonzero, we know the current case value must be less-than or
531 /// greater-than-or-equal-to these Constants.
534 /// Range - A pair of iterators representing the range of case values to be
535 /// processed at this point in the binary search tree.
539 typedef std::vector<CaseRec> CaseRecVector;
541 /// The comparison function for sorting the switch case values in the vector.
542 /// WARNING: Case ranges should be disjoint!
544 bool operator () (const Case& C1, const Case& C2) {
545 assert(isa<ConstantInt>(C1.Low) && isa<ConstantInt>(C2.High));
546 const ConstantInt* CI1 = cast<const ConstantInt>(C1.Low);
547 const ConstantInt* CI2 = cast<const ConstantInt>(C2.High);
548 return CI1->getValue().slt(CI2->getValue());
553 bool operator () (const CaseBits& C1, const CaseBits& C2) {
554 return C1.Bits > C2.Bits;
558 unsigned Clusterify(CaseVector& Cases, const SwitchInst &SI);
561 // TLI - This is information that describes the available target features we
562 // need for lowering. This indicates when operations are unavailable,
563 // implemented with a libcall, etc.
566 const TargetData *TD;
569 /// SwitchCases - Vector of CaseBlock structures used to communicate
570 /// SwitchInst code generation information.
571 std::vector<SelectionDAGISel::CaseBlock> SwitchCases;
572 /// JTCases - Vector of JumpTable structures used to communicate
573 /// SwitchInst code generation information.
574 std::vector<SelectionDAGISel::JumpTableBlock> JTCases;
575 std::vector<SelectionDAGISel::BitTestBlock> BitTestCases;
577 /// FuncInfo - Information about the function as a whole.
579 FunctionLoweringInfo &FuncInfo;
581 /// GCI - Garbage collection metadata for the function.
582 CollectorMetadata *GCI;
584 SelectionDAGLowering(SelectionDAG &dag, TargetLowering &tli,
586 FunctionLoweringInfo &funcinfo,
587 CollectorMetadata *gci)
588 : TLI(tli), DAG(dag), TD(DAG.getTarget().getTargetData()), AA(aa),
589 FuncInfo(funcinfo), GCI(gci) {
592 /// getRoot - Return the current virtual root of the Selection DAG,
593 /// flushing any PendingLoad items. This must be done before emitting
594 /// a store or any other node that may need to be ordered after any
595 /// prior load instructions.
597 SDOperand getRoot() {
598 if (PendingLoads.empty())
599 return DAG.getRoot();
601 if (PendingLoads.size() == 1) {
602 SDOperand Root = PendingLoads[0];
604 PendingLoads.clear();
608 // Otherwise, we have to make a token factor node.
609 SDOperand Root = DAG.getNode(ISD::TokenFactor, MVT::Other,
610 &PendingLoads[0], PendingLoads.size());
611 PendingLoads.clear();
616 /// getControlRoot - Similar to getRoot, but instead of flushing all the
617 /// PendingLoad items, flush all the PendingExports items. It is necessary
618 /// to do this before emitting a terminator instruction.
620 SDOperand getControlRoot() {
621 SDOperand Root = DAG.getRoot();
623 if (PendingExports.empty())
626 // Turn all of the CopyToReg chains into one factored node.
627 if (Root.getOpcode() != ISD::EntryToken) {
628 unsigned i = 0, e = PendingExports.size();
629 for (; i != e; ++i) {
630 assert(PendingExports[i].Val->getNumOperands() > 1);
631 if (PendingExports[i].Val->getOperand(0) == Root)
632 break; // Don't add the root if we already indirectly depend on it.
636 PendingExports.push_back(Root);
639 Root = DAG.getNode(ISD::TokenFactor, MVT::Other,
641 PendingExports.size());
642 PendingExports.clear();
647 void CopyValueToVirtualRegister(Value *V, unsigned Reg);
649 void visit(Instruction &I) { visit(I.getOpcode(), I); }
651 void visit(unsigned Opcode, User &I) {
652 // Note: this doesn't use InstVisitor, because it has to work with
653 // ConstantExpr's in addition to instructions.
655 default: assert(0 && "Unknown instruction type encountered!");
657 // Build the switch statement using the Instruction.def file.
658 #define HANDLE_INST(NUM, OPCODE, CLASS) \
659 case Instruction::OPCODE:return visit##OPCODE((CLASS&)I);
660 #include "llvm/Instruction.def"
664 void setCurrentBasicBlock(MachineBasicBlock *MBB) { CurMBB = MBB; }
666 SDOperand getValue(const Value *V);
668 void setValue(const Value *V, SDOperand NewN) {
669 SDOperand &N = NodeMap[V];
670 assert(N.Val == 0 && "Already set a value for this node!");
674 void GetRegistersForValue(SDISelAsmOperandInfo &OpInfo, bool HasEarlyClobber,
675 std::set<unsigned> &OutputRegs,
676 std::set<unsigned> &InputRegs);
678 void FindMergedConditions(Value *Cond, MachineBasicBlock *TBB,
679 MachineBasicBlock *FBB, MachineBasicBlock *CurBB,
681 bool isExportableFromCurrentBlock(Value *V, const BasicBlock *FromBB);
682 void ExportFromCurrentBlock(Value *V);
683 void LowerCallTo(CallSite CS, SDOperand Callee, bool IsTailCall,
684 MachineBasicBlock *LandingPad = NULL);
686 // Terminator instructions.
687 void visitRet(ReturnInst &I);
688 void visitBr(BranchInst &I);
689 void visitSwitch(SwitchInst &I);
690 void visitUnreachable(UnreachableInst &I) { /* noop */ }
692 // Helpers for visitSwitch
693 bool handleSmallSwitchRange(CaseRec& CR,
694 CaseRecVector& WorkList,
696 MachineBasicBlock* Default);
697 bool handleJTSwitchCase(CaseRec& CR,
698 CaseRecVector& WorkList,
700 MachineBasicBlock* Default);
701 bool handleBTSplitSwitchCase(CaseRec& CR,
702 CaseRecVector& WorkList,
704 MachineBasicBlock* Default);
705 bool handleBitTestsSwitchCase(CaseRec& CR,
706 CaseRecVector& WorkList,
708 MachineBasicBlock* Default);
709 void visitSwitchCase(SelectionDAGISel::CaseBlock &CB);
710 void visitBitTestHeader(SelectionDAGISel::BitTestBlock &B);
711 void visitBitTestCase(MachineBasicBlock* NextMBB,
713 SelectionDAGISel::BitTestCase &B);
714 void visitJumpTable(SelectionDAGISel::JumpTable &JT);
715 void visitJumpTableHeader(SelectionDAGISel::JumpTable &JT,
716 SelectionDAGISel::JumpTableHeader &JTH);
718 // These all get lowered before this pass.
719 void visitInvoke(InvokeInst &I);
720 void visitUnwind(UnwindInst &I);
722 void visitBinary(User &I, unsigned OpCode);
723 void visitShift(User &I, unsigned Opcode);
724 void visitAdd(User &I) {
725 if (I.getType()->isFPOrFPVector())
726 visitBinary(I, ISD::FADD);
728 visitBinary(I, ISD::ADD);
730 void visitSub(User &I);
731 void visitMul(User &I) {
732 if (I.getType()->isFPOrFPVector())
733 visitBinary(I, ISD::FMUL);
735 visitBinary(I, ISD::MUL);
737 void visitURem(User &I) { visitBinary(I, ISD::UREM); }
738 void visitSRem(User &I) { visitBinary(I, ISD::SREM); }
739 void visitFRem(User &I) { visitBinary(I, ISD::FREM); }
740 void visitUDiv(User &I) { visitBinary(I, ISD::UDIV); }
741 void visitSDiv(User &I) { visitBinary(I, ISD::SDIV); }
742 void visitFDiv(User &I) { visitBinary(I, ISD::FDIV); }
743 void visitAnd (User &I) { visitBinary(I, ISD::AND); }
744 void visitOr (User &I) { visitBinary(I, ISD::OR); }
745 void visitXor (User &I) { visitBinary(I, ISD::XOR); }
746 void visitShl (User &I) { visitShift(I, ISD::SHL); }
747 void visitLShr(User &I) { visitShift(I, ISD::SRL); }
748 void visitAShr(User &I) { visitShift(I, ISD::SRA); }
749 void visitICmp(User &I);
750 void visitFCmp(User &I);
751 void visitVICmp(User &I);
752 void visitVFCmp(User &I);
753 // Visit the conversion instructions
754 void visitTrunc(User &I);
755 void visitZExt(User &I);
756 void visitSExt(User &I);
757 void visitFPTrunc(User &I);
758 void visitFPExt(User &I);
759 void visitFPToUI(User &I);
760 void visitFPToSI(User &I);
761 void visitUIToFP(User &I);
762 void visitSIToFP(User &I);
763 void visitPtrToInt(User &I);
764 void visitIntToPtr(User &I);
765 void visitBitCast(User &I);
767 void visitExtractElement(User &I);
768 void visitInsertElement(User &I);
769 void visitShuffleVector(User &I);
771 void visitExtractValue(ExtractValueInst &I);
772 void visitInsertValue(InsertValueInst &I);
774 void visitGetElementPtr(User &I);
775 void visitSelect(User &I);
777 void visitMalloc(MallocInst &I);
778 void visitFree(FreeInst &I);
779 void visitAlloca(AllocaInst &I);
780 void visitLoad(LoadInst &I);
781 void visitStore(StoreInst &I);
782 void visitPHI(PHINode &I) { } // PHI nodes are handled specially.
783 void visitCall(CallInst &I);
784 void visitInlineAsm(CallSite CS);
785 const char *visitIntrinsicCall(CallInst &I, unsigned Intrinsic);
786 void visitTargetIntrinsic(CallInst &I, unsigned Intrinsic);
788 void visitVAStart(CallInst &I);
789 void visitVAArg(VAArgInst &I);
790 void visitVAEnd(CallInst &I);
791 void visitVACopy(CallInst &I);
793 void visitGetResult(GetResultInst &I);
795 void visitUserOp1(Instruction &I) {
796 assert(0 && "UserOp1 should not exist at instruction selection time!");
799 void visitUserOp2(Instruction &I) {
800 assert(0 && "UserOp2 should not exist at instruction selection time!");
805 inline const char *implVisitBinaryAtomic(CallInst& I, ISD::NodeType Op);
808 } // end namespace llvm
811 /// getCopyFromParts - Create a value that contains the specified legal parts
812 /// combined into the value they represent. If the parts combine to a type
813 /// larger then ValueVT then AssertOp can be used to specify whether the extra
814 /// bits are known to be zero (ISD::AssertZext) or sign extended from ValueVT
815 /// (ISD::AssertSext).
816 static SDOperand getCopyFromParts(SelectionDAG &DAG,
817 const SDOperand *Parts,
821 ISD::NodeType AssertOp = ISD::DELETED_NODE) {
822 assert(NumParts > 0 && "No parts to assemble!");
823 TargetLowering &TLI = DAG.getTargetLoweringInfo();
824 SDOperand Val = Parts[0];
827 // Assemble the value from multiple parts.
828 if (!ValueVT.isVector()) {
829 unsigned PartBits = PartVT.getSizeInBits();
830 unsigned ValueBits = ValueVT.getSizeInBits();
832 // Assemble the power of 2 part.
833 unsigned RoundParts = NumParts & (NumParts - 1) ?
834 1 << Log2_32(NumParts) : NumParts;
835 unsigned RoundBits = PartBits * RoundParts;
836 MVT RoundVT = RoundBits == ValueBits ?
837 ValueVT : MVT::getIntegerVT(RoundBits);
840 if (RoundParts > 2) {
841 MVT HalfVT = MVT::getIntegerVT(RoundBits/2);
842 Lo = getCopyFromParts(DAG, Parts, RoundParts/2, PartVT, HalfVT);
843 Hi = getCopyFromParts(DAG, Parts+RoundParts/2, RoundParts/2,
849 if (TLI.isBigEndian())
851 Val = DAG.getNode(ISD::BUILD_PAIR, RoundVT, Lo, Hi);
853 if (RoundParts < NumParts) {
854 // Assemble the trailing non-power-of-2 part.
855 unsigned OddParts = NumParts - RoundParts;
856 MVT OddVT = MVT::getIntegerVT(OddParts * PartBits);
857 Hi = getCopyFromParts(DAG, Parts+RoundParts, OddParts, PartVT, OddVT);
859 // Combine the round and odd parts.
861 if (TLI.isBigEndian())
863 MVT TotalVT = MVT::getIntegerVT(NumParts * PartBits);
864 Hi = DAG.getNode(ISD::ANY_EXTEND, TotalVT, Hi);
865 Hi = DAG.getNode(ISD::SHL, TotalVT, Hi,
866 DAG.getConstant(Lo.getValueType().getSizeInBits(),
867 TLI.getShiftAmountTy()));
868 Lo = DAG.getNode(ISD::ZERO_EXTEND, TotalVT, Lo);
869 Val = DAG.getNode(ISD::OR, TotalVT, Lo, Hi);
872 // Handle a multi-element vector.
873 MVT IntermediateVT, RegisterVT;
874 unsigned NumIntermediates;
876 TLI.getVectorTypeBreakdown(ValueVT, IntermediateVT, NumIntermediates,
878 assert(NumRegs == NumParts && "Part count doesn't match vector breakdown!");
879 NumParts = NumRegs; // Silence a compiler warning.
880 assert(RegisterVT == PartVT && "Part type doesn't match vector breakdown!");
881 assert(RegisterVT == Parts[0].getValueType() &&
882 "Part type doesn't match part!");
884 // Assemble the parts into intermediate operands.
885 SmallVector<SDOperand, 8> Ops(NumIntermediates);
886 if (NumIntermediates == NumParts) {
887 // If the register was not expanded, truncate or copy the value,
889 for (unsigned i = 0; i != NumParts; ++i)
890 Ops[i] = getCopyFromParts(DAG, &Parts[i], 1,
891 PartVT, IntermediateVT);
892 } else if (NumParts > 0) {
893 // If the intermediate type was expanded, build the intermediate operands
895 assert(NumParts % NumIntermediates == 0 &&
896 "Must expand into a divisible number of parts!");
897 unsigned Factor = NumParts / NumIntermediates;
898 for (unsigned i = 0; i != NumIntermediates; ++i)
899 Ops[i] = getCopyFromParts(DAG, &Parts[i * Factor], Factor,
900 PartVT, IntermediateVT);
903 // Build a vector with BUILD_VECTOR or CONCAT_VECTORS from the intermediate
905 Val = DAG.getNode(IntermediateVT.isVector() ?
906 ISD::CONCAT_VECTORS : ISD::BUILD_VECTOR,
907 ValueVT, &Ops[0], NumIntermediates);
911 // There is now one part, held in Val. Correct it to match ValueVT.
912 PartVT = Val.getValueType();
914 if (PartVT == ValueVT)
917 if (PartVT.isVector()) {
918 assert(ValueVT.isVector() && "Unknown vector conversion!");
919 return DAG.getNode(ISD::BIT_CONVERT, ValueVT, Val);
922 if (ValueVT.isVector()) {
923 assert(ValueVT.getVectorElementType() == PartVT &&
924 ValueVT.getVectorNumElements() == 1 &&
925 "Only trivial scalar-to-vector conversions should get here!");
926 return DAG.getNode(ISD::BUILD_VECTOR, ValueVT, Val);
929 if (PartVT.isInteger() &&
930 ValueVT.isInteger()) {
931 if (ValueVT.bitsLT(PartVT)) {
932 // For a truncate, see if we have any information to
933 // indicate whether the truncated bits will always be
934 // zero or sign-extension.
935 if (AssertOp != ISD::DELETED_NODE)
936 Val = DAG.getNode(AssertOp, PartVT, Val,
937 DAG.getValueType(ValueVT));
938 return DAG.getNode(ISD::TRUNCATE, ValueVT, Val);
940 return DAG.getNode(ISD::ANY_EXTEND, ValueVT, Val);
944 if (PartVT.isFloatingPoint() && ValueVT.isFloatingPoint()) {
945 if (ValueVT.bitsLT(Val.getValueType()))
946 // FP_ROUND's are always exact here.
947 return DAG.getNode(ISD::FP_ROUND, ValueVT, Val,
948 DAG.getIntPtrConstant(1));
949 return DAG.getNode(ISD::FP_EXTEND, ValueVT, Val);
952 if (PartVT.getSizeInBits() == ValueVT.getSizeInBits())
953 return DAG.getNode(ISD::BIT_CONVERT, ValueVT, Val);
955 assert(0 && "Unknown mismatch!");
959 /// getCopyToParts - Create a series of nodes that contain the specified value
960 /// split into legal parts. If the parts contain more bits than Val, then, for
961 /// integers, ExtendKind can be used to specify how to generate the extra bits.
962 static void getCopyToParts(SelectionDAG &DAG,
967 ISD::NodeType ExtendKind = ISD::ANY_EXTEND) {
968 TargetLowering &TLI = DAG.getTargetLoweringInfo();
969 MVT PtrVT = TLI.getPointerTy();
970 MVT ValueVT = Val.getValueType();
971 unsigned PartBits = PartVT.getSizeInBits();
972 assert(TLI.isTypeLegal(PartVT) && "Copying to an illegal type!");
977 if (!ValueVT.isVector()) {
978 if (PartVT == ValueVT) {
979 assert(NumParts == 1 && "No-op copy with multiple parts!");
984 if (NumParts * PartBits > ValueVT.getSizeInBits()) {
985 // If the parts cover more bits than the value has, promote the value.
986 if (PartVT.isFloatingPoint() && ValueVT.isFloatingPoint()) {
987 assert(NumParts == 1 && "Do not know what to promote to!");
988 Val = DAG.getNode(ISD::FP_EXTEND, PartVT, Val);
989 } else if (PartVT.isInteger() && ValueVT.isInteger()) {
990 ValueVT = MVT::getIntegerVT(NumParts * PartBits);
991 Val = DAG.getNode(ExtendKind, ValueVT, Val);
993 assert(0 && "Unknown mismatch!");
995 } else if (PartBits == ValueVT.getSizeInBits()) {
996 // Different types of the same size.
997 assert(NumParts == 1 && PartVT != ValueVT);
998 Val = DAG.getNode(ISD::BIT_CONVERT, PartVT, Val);
999 } else if (NumParts * PartBits < ValueVT.getSizeInBits()) {
1000 // If the parts cover less bits than value has, truncate the value.
1001 if (PartVT.isInteger() && ValueVT.isInteger()) {
1002 ValueVT = MVT::getIntegerVT(NumParts * PartBits);
1003 Val = DAG.getNode(ISD::TRUNCATE, ValueVT, Val);
1005 assert(0 && "Unknown mismatch!");
1009 // The value may have changed - recompute ValueVT.
1010 ValueVT = Val.getValueType();
1011 assert(NumParts * PartBits == ValueVT.getSizeInBits() &&
1012 "Failed to tile the value with PartVT!");
1014 if (NumParts == 1) {
1015 assert(PartVT == ValueVT && "Type conversion failed!");
1020 // Expand the value into multiple parts.
1021 if (NumParts & (NumParts - 1)) {
1022 // The number of parts is not a power of 2. Split off and copy the tail.
1023 assert(PartVT.isInteger() && ValueVT.isInteger() &&
1024 "Do not know what to expand to!");
1025 unsigned RoundParts = 1 << Log2_32(NumParts);
1026 unsigned RoundBits = RoundParts * PartBits;
1027 unsigned OddParts = NumParts - RoundParts;
1028 SDOperand OddVal = DAG.getNode(ISD::SRL, ValueVT, Val,
1029 DAG.getConstant(RoundBits,
1030 TLI.getShiftAmountTy()));
1031 getCopyToParts(DAG, OddVal, Parts + RoundParts, OddParts, PartVT);
1032 if (TLI.isBigEndian())
1033 // The odd parts were reversed by getCopyToParts - unreverse them.
1034 std::reverse(Parts + RoundParts, Parts + NumParts);
1035 NumParts = RoundParts;
1036 ValueVT = MVT::getIntegerVT(NumParts * PartBits);
1037 Val = DAG.getNode(ISD::TRUNCATE, ValueVT, Val);
1040 // The number of parts is a power of 2. Repeatedly bisect the value using
1042 Parts[0] = DAG.getNode(ISD::BIT_CONVERT,
1043 MVT::getIntegerVT(ValueVT.getSizeInBits()),
1045 for (unsigned StepSize = NumParts; StepSize > 1; StepSize /= 2) {
1046 for (unsigned i = 0; i < NumParts; i += StepSize) {
1047 unsigned ThisBits = StepSize * PartBits / 2;
1048 MVT ThisVT = MVT::getIntegerVT (ThisBits);
1049 SDOperand &Part0 = Parts[i];
1050 SDOperand &Part1 = Parts[i+StepSize/2];
1052 Part1 = DAG.getNode(ISD::EXTRACT_ELEMENT, ThisVT, Part0,
1053 DAG.getConstant(1, PtrVT));
1054 Part0 = DAG.getNode(ISD::EXTRACT_ELEMENT, ThisVT, Part0,
1055 DAG.getConstant(0, PtrVT));
1057 if (ThisBits == PartBits && ThisVT != PartVT) {
1058 Part0 = DAG.getNode(ISD::BIT_CONVERT, PartVT, Part0);
1059 Part1 = DAG.getNode(ISD::BIT_CONVERT, PartVT, Part1);
1064 if (TLI.isBigEndian())
1065 std::reverse(Parts, Parts + NumParts);
1071 if (NumParts == 1) {
1072 if (PartVT != ValueVT) {
1073 if (PartVT.isVector()) {
1074 Val = DAG.getNode(ISD::BIT_CONVERT, PartVT, Val);
1076 assert(ValueVT.getVectorElementType() == PartVT &&
1077 ValueVT.getVectorNumElements() == 1 &&
1078 "Only trivial vector-to-scalar conversions should get here!");
1079 Val = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, PartVT, Val,
1080 DAG.getConstant(0, PtrVT));
1088 // Handle a multi-element vector.
1089 MVT IntermediateVT, RegisterVT;
1090 unsigned NumIntermediates;
1092 DAG.getTargetLoweringInfo()
1093 .getVectorTypeBreakdown(ValueVT, IntermediateVT, NumIntermediates,
1095 unsigned NumElements = ValueVT.getVectorNumElements();
1097 assert(NumRegs == NumParts && "Part count doesn't match vector breakdown!");
1098 NumParts = NumRegs; // Silence a compiler warning.
1099 assert(RegisterVT == PartVT && "Part type doesn't match vector breakdown!");
1101 // Split the vector into intermediate operands.
1102 SmallVector<SDOperand, 8> Ops(NumIntermediates);
1103 for (unsigned i = 0; i != NumIntermediates; ++i)
1104 if (IntermediateVT.isVector())
1105 Ops[i] = DAG.getNode(ISD::EXTRACT_SUBVECTOR,
1106 IntermediateVT, Val,
1107 DAG.getConstant(i * (NumElements / NumIntermediates),
1110 Ops[i] = DAG.getNode(ISD::EXTRACT_VECTOR_ELT,
1111 IntermediateVT, Val,
1112 DAG.getConstant(i, PtrVT));
1114 // Split the intermediate operands into legal parts.
1115 if (NumParts == NumIntermediates) {
1116 // If the register was not expanded, promote or copy the value,
1118 for (unsigned i = 0; i != NumParts; ++i)
1119 getCopyToParts(DAG, Ops[i], &Parts[i], 1, PartVT);
1120 } else if (NumParts > 0) {
1121 // If the intermediate type was expanded, split each the value into
1123 assert(NumParts % NumIntermediates == 0 &&
1124 "Must expand into a divisible number of parts!");
1125 unsigned Factor = NumParts / NumIntermediates;
1126 for (unsigned i = 0; i != NumIntermediates; ++i)
1127 getCopyToParts(DAG, Ops[i], &Parts[i * Factor], Factor, PartVT);
1132 SDOperand SelectionDAGLowering::getValue(const Value *V) {
1133 SDOperand &N = NodeMap[V];
1134 if (N.Val) return N;
1136 if (Constant *C = const_cast<Constant*>(dyn_cast<Constant>(V))) {
1137 MVT VT = TLI.getValueType(V->getType(), true);
1139 if (ConstantInt *CI = dyn_cast<ConstantInt>(C))
1140 return N = DAG.getConstant(CI->getValue(), VT);
1142 if (GlobalValue *GV = dyn_cast<GlobalValue>(C))
1143 return N = DAG.getGlobalAddress(GV, VT);
1145 if (isa<ConstantPointerNull>(C))
1146 return N = DAG.getConstant(0, TLI.getPointerTy());
1148 if (ConstantFP *CFP = dyn_cast<ConstantFP>(C))
1149 return N = DAG.getConstantFP(CFP->getValueAPF(), VT);
1151 if (isa<UndefValue>(C) && !isa<VectorType>(V->getType()) &&
1152 !V->getType()->isAggregateType())
1153 return N = DAG.getNode(ISD::UNDEF, VT);
1155 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(C)) {
1156 visit(CE->getOpcode(), *CE);
1157 SDOperand N1 = NodeMap[V];
1158 assert(N1.Val && "visit didn't populate the ValueMap!");
1162 if (isa<ConstantStruct>(C) || isa<ConstantArray>(C)) {
1163 SmallVector<SDOperand, 4> Constants;
1164 SmallVector<MVT, 4> ValueVTs;
1165 for (User::const_op_iterator OI = C->op_begin(), OE = C->op_end();
1167 SDNode *Val = getValue(*OI).Val;
1168 for (unsigned i = 0, e = Val->getNumValues(); i != e; ++i) {
1169 Constants.push_back(SDOperand(Val, i));
1170 ValueVTs.push_back(Val->getValueType(i));
1173 return DAG.getNode(ISD::MERGE_VALUES,
1174 DAG.getVTList(&ValueVTs[0], ValueVTs.size()),
1175 &Constants[0], Constants.size());
1178 if (const ArrayType *ATy = dyn_cast<ArrayType>(C->getType())) {
1179 assert((isa<ConstantAggregateZero>(C) || isa<UndefValue>(C)) &&
1180 "Unknown array constant!");
1181 unsigned NumElts = ATy->getNumElements();
1183 return SDOperand(); // empty array
1184 MVT EltVT = TLI.getValueType(ATy->getElementType());
1185 SmallVector<SDOperand, 4> Constants(NumElts);
1186 SmallVector<MVT, 4> ValueVTs(NumElts, EltVT);
1187 for (unsigned i = 0, e = NumElts; i != e; ++i) {
1188 if (isa<UndefValue>(C))
1189 Constants[i] = DAG.getNode(ISD::UNDEF, EltVT);
1190 else if (EltVT.isFloatingPoint())
1191 Constants[i] = DAG.getConstantFP(0, EltVT);
1193 Constants[i] = DAG.getConstant(0, EltVT);
1195 return DAG.getNode(ISD::MERGE_VALUES,
1196 DAG.getVTList(&ValueVTs[0], ValueVTs.size()),
1197 &Constants[0], Constants.size());
1200 if (const StructType *STy = dyn_cast<StructType>(C->getType())) {
1201 assert((isa<ConstantAggregateZero>(C) || isa<UndefValue>(C)) &&
1202 "Unknown struct constant!");
1203 unsigned NumElts = STy->getNumElements();
1205 return SDOperand(); // empty struct
1206 SmallVector<SDOperand, 4> Constants(NumElts);
1207 SmallVector<MVT, 4> ValueVTs(NumElts);
1208 for (unsigned i = 0, e = NumElts; i != e; ++i) {
1209 MVT EltVT = TLI.getValueType(STy->getElementType(i));
1210 ValueVTs[i] = EltVT;
1211 if (isa<UndefValue>(C))
1212 Constants[i] = DAG.getNode(ISD::UNDEF, EltVT);
1213 else if (EltVT.isFloatingPoint())
1214 Constants[i] = DAG.getConstantFP(0, EltVT);
1216 Constants[i] = DAG.getConstant(0, EltVT);
1218 return DAG.getNode(ISD::MERGE_VALUES,
1219 DAG.getVTList(&ValueVTs[0], ValueVTs.size()),
1220 &Constants[0], Constants.size());
1223 const VectorType *VecTy = cast<VectorType>(V->getType());
1224 unsigned NumElements = VecTy->getNumElements();
1226 // Now that we know the number and type of the elements, get that number of
1227 // elements into the Ops array based on what kind of constant it is.
1228 SmallVector<SDOperand, 16> Ops;
1229 if (ConstantVector *CP = dyn_cast<ConstantVector>(C)) {
1230 for (unsigned i = 0; i != NumElements; ++i)
1231 Ops.push_back(getValue(CP->getOperand(i)));
1233 assert((isa<ConstantAggregateZero>(C) || isa<UndefValue>(C)) &&
1234 "Unknown vector constant!");
1235 MVT EltVT = TLI.getValueType(VecTy->getElementType());
1238 if (isa<UndefValue>(C))
1239 Op = DAG.getNode(ISD::UNDEF, EltVT);
1240 else if (EltVT.isFloatingPoint())
1241 Op = DAG.getConstantFP(0, EltVT);
1243 Op = DAG.getConstant(0, EltVT);
1244 Ops.assign(NumElements, Op);
1247 // Create a BUILD_VECTOR node.
1248 return NodeMap[V] = DAG.getNode(ISD::BUILD_VECTOR, VT, &Ops[0], Ops.size());
1251 // If this is a static alloca, generate it as the frameindex instead of
1253 if (const AllocaInst *AI = dyn_cast<AllocaInst>(V)) {
1254 std::map<const AllocaInst*, int>::iterator SI =
1255 FuncInfo.StaticAllocaMap.find(AI);
1256 if (SI != FuncInfo.StaticAllocaMap.end())
1257 return DAG.getFrameIndex(SI->second, TLI.getPointerTy());
1260 unsigned InReg = FuncInfo.ValueMap[V];
1261 assert(InReg && "Value not in map!");
1263 RegsForValue RFV(TLI, InReg, V->getType());
1264 SDOperand Chain = DAG.getEntryNode();
1265 return RFV.getCopyFromRegs(DAG, Chain, NULL);
1269 void SelectionDAGLowering::visitRet(ReturnInst &I) {
1270 if (I.getNumOperands() == 0) {
1271 DAG.setRoot(DAG.getNode(ISD::RET, MVT::Other, getControlRoot()));
1275 SmallVector<SDOperand, 8> NewValues;
1276 NewValues.push_back(getControlRoot());
1277 for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i) {
1278 SDOperand RetOp = getValue(I.getOperand(i));
1279 MVT VT = RetOp.getValueType();
1281 // FIXME: C calling convention requires the return type to be promoted to
1282 // at least 32-bit. But this is not necessary for non-C calling conventions.
1283 if (VT.isInteger()) {
1284 MVT MinVT = TLI.getRegisterType(MVT::i32);
1285 if (VT.bitsLT(MinVT))
1289 unsigned NumParts = TLI.getNumRegisters(VT);
1290 MVT PartVT = TLI.getRegisterType(VT);
1291 SmallVector<SDOperand, 4> Parts(NumParts);
1292 ISD::NodeType ExtendKind = ISD::ANY_EXTEND;
1294 const Function *F = I.getParent()->getParent();
1295 if (F->paramHasAttr(0, ParamAttr::SExt))
1296 ExtendKind = ISD::SIGN_EXTEND;
1297 else if (F->paramHasAttr(0, ParamAttr::ZExt))
1298 ExtendKind = ISD::ZERO_EXTEND;
1300 getCopyToParts(DAG, RetOp, &Parts[0], NumParts, PartVT, ExtendKind);
1302 for (unsigned i = 0; i < NumParts; ++i) {
1303 NewValues.push_back(Parts[i]);
1304 NewValues.push_back(DAG.getArgFlags(ISD::ArgFlagsTy()));
1307 DAG.setRoot(DAG.getNode(ISD::RET, MVT::Other,
1308 &NewValues[0], NewValues.size()));
1311 /// ExportFromCurrentBlock - If this condition isn't known to be exported from
1312 /// the current basic block, add it to ValueMap now so that we'll get a
1314 void SelectionDAGLowering::ExportFromCurrentBlock(Value *V) {
1315 // No need to export constants.
1316 if (!isa<Instruction>(V) && !isa<Argument>(V)) return;
1318 // Already exported?
1319 if (FuncInfo.isExportedInst(V)) return;
1321 unsigned Reg = FuncInfo.InitializeRegForValue(V);
1322 CopyValueToVirtualRegister(V, Reg);
1325 bool SelectionDAGLowering::isExportableFromCurrentBlock(Value *V,
1326 const BasicBlock *FromBB) {
1327 // The operands of the setcc have to be in this block. We don't know
1328 // how to export them from some other block.
1329 if (Instruction *VI = dyn_cast<Instruction>(V)) {
1330 // Can export from current BB.
1331 if (VI->getParent() == FromBB)
1334 // Is already exported, noop.
1335 return FuncInfo.isExportedInst(V);
1338 // If this is an argument, we can export it if the BB is the entry block or
1339 // if it is already exported.
1340 if (isa<Argument>(V)) {
1341 if (FromBB == &FromBB->getParent()->getEntryBlock())
1344 // Otherwise, can only export this if it is already exported.
1345 return FuncInfo.isExportedInst(V);
1348 // Otherwise, constants can always be exported.
1352 static bool InBlock(const Value *V, const BasicBlock *BB) {
1353 if (const Instruction *I = dyn_cast<Instruction>(V))
1354 return I->getParent() == BB;
1358 /// FindMergedConditions - If Cond is an expression like
1359 void SelectionDAGLowering::FindMergedConditions(Value *Cond,
1360 MachineBasicBlock *TBB,
1361 MachineBasicBlock *FBB,
1362 MachineBasicBlock *CurBB,
1364 // If this node is not part of the or/and tree, emit it as a branch.
1365 Instruction *BOp = dyn_cast<Instruction>(Cond);
1367 if (!BOp || !(isa<BinaryOperator>(BOp) || isa<CmpInst>(BOp)) ||
1368 (unsigned)BOp->getOpcode() != Opc || !BOp->hasOneUse() ||
1369 BOp->getParent() != CurBB->getBasicBlock() ||
1370 !InBlock(BOp->getOperand(0), CurBB->getBasicBlock()) ||
1371 !InBlock(BOp->getOperand(1), CurBB->getBasicBlock())) {
1372 const BasicBlock *BB = CurBB->getBasicBlock();
1374 // If the leaf of the tree is a comparison, merge the condition into
1376 if ((isa<ICmpInst>(Cond) || isa<FCmpInst>(Cond)) &&
1377 // The operands of the cmp have to be in this block. We don't know
1378 // how to export them from some other block. If this is the first block
1379 // of the sequence, no exporting is needed.
1381 (isExportableFromCurrentBlock(BOp->getOperand(0), BB) &&
1382 isExportableFromCurrentBlock(BOp->getOperand(1), BB)))) {
1383 BOp = cast<Instruction>(Cond);
1384 ISD::CondCode Condition;
1385 if (ICmpInst *IC = dyn_cast<ICmpInst>(Cond)) {
1386 switch (IC->getPredicate()) {
1387 default: assert(0 && "Unknown icmp predicate opcode!");
1388 case ICmpInst::ICMP_EQ: Condition = ISD::SETEQ; break;
1389 case ICmpInst::ICMP_NE: Condition = ISD::SETNE; break;
1390 case ICmpInst::ICMP_SLE: Condition = ISD::SETLE; break;
1391 case ICmpInst::ICMP_ULE: Condition = ISD::SETULE; break;
1392 case ICmpInst::ICMP_SGE: Condition = ISD::SETGE; break;
1393 case ICmpInst::ICMP_UGE: Condition = ISD::SETUGE; break;
1394 case ICmpInst::ICMP_SLT: Condition = ISD::SETLT; break;
1395 case ICmpInst::ICMP_ULT: Condition = ISD::SETULT; break;
1396 case ICmpInst::ICMP_SGT: Condition = ISD::SETGT; break;
1397 case ICmpInst::ICMP_UGT: Condition = ISD::SETUGT; break;
1399 } else if (FCmpInst *FC = dyn_cast<FCmpInst>(Cond)) {
1400 ISD::CondCode FPC, FOC;
1401 switch (FC->getPredicate()) {
1402 default: assert(0 && "Unknown fcmp predicate opcode!");
1403 case FCmpInst::FCMP_FALSE: FOC = FPC = ISD::SETFALSE; break;
1404 case FCmpInst::FCMP_OEQ: FOC = ISD::SETEQ; FPC = ISD::SETOEQ; break;
1405 case FCmpInst::FCMP_OGT: FOC = ISD::SETGT; FPC = ISD::SETOGT; break;
1406 case FCmpInst::FCMP_OGE: FOC = ISD::SETGE; FPC = ISD::SETOGE; break;
1407 case FCmpInst::FCMP_OLT: FOC = ISD::SETLT; FPC = ISD::SETOLT; break;
1408 case FCmpInst::FCMP_OLE: FOC = ISD::SETLE; FPC = ISD::SETOLE; break;
1409 case FCmpInst::FCMP_ONE: FOC = ISD::SETNE; FPC = ISD::SETONE; break;
1410 case FCmpInst::FCMP_ORD: FOC = FPC = ISD::SETO; break;
1411 case FCmpInst::FCMP_UNO: FOC = FPC = ISD::SETUO; break;
1412 case FCmpInst::FCMP_UEQ: FOC = ISD::SETEQ; FPC = ISD::SETUEQ; break;
1413 case FCmpInst::FCMP_UGT: FOC = ISD::SETGT; FPC = ISD::SETUGT; break;
1414 case FCmpInst::FCMP_UGE: FOC = ISD::SETGE; FPC = ISD::SETUGE; break;
1415 case FCmpInst::FCMP_ULT: FOC = ISD::SETLT; FPC = ISD::SETULT; break;
1416 case FCmpInst::FCMP_ULE: FOC = ISD::SETLE; FPC = ISD::SETULE; break;
1417 case FCmpInst::FCMP_UNE: FOC = ISD::SETNE; FPC = ISD::SETUNE; break;
1418 case FCmpInst::FCMP_TRUE: FOC = FPC = ISD::SETTRUE; break;
1420 if (FiniteOnlyFPMath())
1425 Condition = ISD::SETEQ; // silence warning.
1426 assert(0 && "Unknown compare instruction");
1429 SelectionDAGISel::CaseBlock CB(Condition, BOp->getOperand(0),
1430 BOp->getOperand(1), NULL, TBB, FBB, CurBB);
1431 SwitchCases.push_back(CB);
1435 // Create a CaseBlock record representing this branch.
1436 SelectionDAGISel::CaseBlock CB(ISD::SETEQ, Cond, ConstantInt::getTrue(),
1437 NULL, TBB, FBB, CurBB);
1438 SwitchCases.push_back(CB);
1443 // Create TmpBB after CurBB.
1444 MachineFunction::iterator BBI = CurBB;
1445 MachineBasicBlock *TmpBB = new MachineBasicBlock(CurBB->getBasicBlock());
1446 CurBB->getParent()->getBasicBlockList().insert(++BBI, TmpBB);
1448 if (Opc == Instruction::Or) {
1449 // Codegen X | Y as:
1457 // Emit the LHS condition.
1458 FindMergedConditions(BOp->getOperand(0), TBB, TmpBB, CurBB, Opc);
1460 // Emit the RHS condition into TmpBB.
1461 FindMergedConditions(BOp->getOperand(1), TBB, FBB, TmpBB, Opc);
1463 assert(Opc == Instruction::And && "Unknown merge op!");
1464 // Codegen X & Y as:
1471 // This requires creation of TmpBB after CurBB.
1473 // Emit the LHS condition.
1474 FindMergedConditions(BOp->getOperand(0), TmpBB, FBB, CurBB, Opc);
1476 // Emit the RHS condition into TmpBB.
1477 FindMergedConditions(BOp->getOperand(1), TBB, FBB, TmpBB, Opc);
1481 /// If the set of cases should be emitted as a series of branches, return true.
1482 /// If we should emit this as a bunch of and/or'd together conditions, return
1485 ShouldEmitAsBranches(const std::vector<SelectionDAGISel::CaseBlock> &Cases) {
1486 if (Cases.size() != 2) return true;
1488 // If this is two comparisons of the same values or'd or and'd together, they
1489 // will get folded into a single comparison, so don't emit two blocks.
1490 if ((Cases[0].CmpLHS == Cases[1].CmpLHS &&
1491 Cases[0].CmpRHS == Cases[1].CmpRHS) ||
1492 (Cases[0].CmpRHS == Cases[1].CmpLHS &&
1493 Cases[0].CmpLHS == Cases[1].CmpRHS)) {
1500 void SelectionDAGLowering::visitBr(BranchInst &I) {
1501 // Update machine-CFG edges.
1502 MachineBasicBlock *Succ0MBB = FuncInfo.MBBMap[I.getSuccessor(0)];
1504 // Figure out which block is immediately after the current one.
1505 MachineBasicBlock *NextBlock = 0;
1506 MachineFunction::iterator BBI = CurMBB;
1507 if (++BBI != CurMBB->getParent()->end())
1510 if (I.isUnconditional()) {
1511 // Update machine-CFG edges.
1512 CurMBB->addSuccessor(Succ0MBB);
1514 // If this is not a fall-through branch, emit the branch.
1515 if (Succ0MBB != NextBlock)
1516 DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, getControlRoot(),
1517 DAG.getBasicBlock(Succ0MBB)));
1521 // If this condition is one of the special cases we handle, do special stuff
1523 Value *CondVal = I.getCondition();
1524 MachineBasicBlock *Succ1MBB = FuncInfo.MBBMap[I.getSuccessor(1)];
1526 // If this is a series of conditions that are or'd or and'd together, emit
1527 // this as a sequence of branches instead of setcc's with and/or operations.
1528 // For example, instead of something like:
1541 if (BinaryOperator *BOp = dyn_cast<BinaryOperator>(CondVal)) {
1542 if (BOp->hasOneUse() &&
1543 (BOp->getOpcode() == Instruction::And ||
1544 BOp->getOpcode() == Instruction::Or)) {
1545 FindMergedConditions(BOp, Succ0MBB, Succ1MBB, CurMBB, BOp->getOpcode());
1546 // If the compares in later blocks need to use values not currently
1547 // exported from this block, export them now. This block should always
1548 // be the first entry.
1549 assert(SwitchCases[0].ThisBB == CurMBB && "Unexpected lowering!");
1551 // Allow some cases to be rejected.
1552 if (ShouldEmitAsBranches(SwitchCases)) {
1553 for (unsigned i = 1, e = SwitchCases.size(); i != e; ++i) {
1554 ExportFromCurrentBlock(SwitchCases[i].CmpLHS);
1555 ExportFromCurrentBlock(SwitchCases[i].CmpRHS);
1558 // Emit the branch for this block.
1559 visitSwitchCase(SwitchCases[0]);
1560 SwitchCases.erase(SwitchCases.begin());
1564 // Okay, we decided not to do this, remove any inserted MBB's and clear
1566 for (unsigned i = 1, e = SwitchCases.size(); i != e; ++i)
1567 CurMBB->getParent()->getBasicBlockList().erase(SwitchCases[i].ThisBB);
1569 SwitchCases.clear();
1573 // Create a CaseBlock record representing this branch.
1574 SelectionDAGISel::CaseBlock CB(ISD::SETEQ, CondVal, ConstantInt::getTrue(),
1575 NULL, Succ0MBB, Succ1MBB, CurMBB);
1576 // Use visitSwitchCase to actually insert the fast branch sequence for this
1578 visitSwitchCase(CB);
1581 /// visitSwitchCase - Emits the necessary code to represent a single node in
1582 /// the binary search tree resulting from lowering a switch instruction.
1583 void SelectionDAGLowering::visitSwitchCase(SelectionDAGISel::CaseBlock &CB) {
1585 SDOperand CondLHS = getValue(CB.CmpLHS);
1587 // Build the setcc now.
1588 if (CB.CmpMHS == NULL) {
1589 // Fold "(X == true)" to X and "(X == false)" to !X to
1590 // handle common cases produced by branch lowering.
1591 if (CB.CmpRHS == ConstantInt::getTrue() && CB.CC == ISD::SETEQ)
1593 else if (CB.CmpRHS == ConstantInt::getFalse() && CB.CC == ISD::SETEQ) {
1594 SDOperand True = DAG.getConstant(1, CondLHS.getValueType());
1595 Cond = DAG.getNode(ISD::XOR, CondLHS.getValueType(), CondLHS, True);
1597 Cond = DAG.getSetCC(MVT::i1, CondLHS, getValue(CB.CmpRHS), CB.CC);
1599 assert(CB.CC == ISD::SETLE && "Can handle only LE ranges now");
1601 uint64_t Low = cast<ConstantInt>(CB.CmpLHS)->getSExtValue();
1602 uint64_t High = cast<ConstantInt>(CB.CmpRHS)->getSExtValue();
1604 SDOperand CmpOp = getValue(CB.CmpMHS);
1605 MVT VT = CmpOp.getValueType();
1607 if (cast<ConstantInt>(CB.CmpLHS)->isMinValue(true)) {
1608 Cond = DAG.getSetCC(MVT::i1, CmpOp, DAG.getConstant(High, VT), ISD::SETLE);
1610 SDOperand SUB = DAG.getNode(ISD::SUB, VT, CmpOp, DAG.getConstant(Low, VT));
1611 Cond = DAG.getSetCC(MVT::i1, SUB,
1612 DAG.getConstant(High-Low, VT), ISD::SETULE);
1616 // Update successor info
1617 CurMBB->addSuccessor(CB.TrueBB);
1618 CurMBB->addSuccessor(CB.FalseBB);
1620 // Set NextBlock to be the MBB immediately after the current one, if any.
1621 // This is used to avoid emitting unnecessary branches to the next block.
1622 MachineBasicBlock *NextBlock = 0;
1623 MachineFunction::iterator BBI = CurMBB;
1624 if (++BBI != CurMBB->getParent()->end())
1627 // If the lhs block is the next block, invert the condition so that we can
1628 // fall through to the lhs instead of the rhs block.
1629 if (CB.TrueBB == NextBlock) {
1630 std::swap(CB.TrueBB, CB.FalseBB);
1631 SDOperand True = DAG.getConstant(1, Cond.getValueType());
1632 Cond = DAG.getNode(ISD::XOR, Cond.getValueType(), Cond, True);
1634 SDOperand BrCond = DAG.getNode(ISD::BRCOND, MVT::Other, getControlRoot(), Cond,
1635 DAG.getBasicBlock(CB.TrueBB));
1636 if (CB.FalseBB == NextBlock)
1637 DAG.setRoot(BrCond);
1639 DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, BrCond,
1640 DAG.getBasicBlock(CB.FalseBB)));
1643 /// visitJumpTable - Emit JumpTable node in the current MBB
1644 void SelectionDAGLowering::visitJumpTable(SelectionDAGISel::JumpTable &JT) {
1645 // Emit the code for the jump table
1646 assert(JT.Reg != -1U && "Should lower JT Header first!");
1647 MVT PTy = TLI.getPointerTy();
1648 SDOperand Index = DAG.getCopyFromReg(getControlRoot(), JT.Reg, PTy);
1649 SDOperand Table = DAG.getJumpTable(JT.JTI, PTy);
1650 DAG.setRoot(DAG.getNode(ISD::BR_JT, MVT::Other, Index.getValue(1),
1655 /// visitJumpTableHeader - This function emits necessary code to produce index
1656 /// in the JumpTable from switch case.
1657 void SelectionDAGLowering::visitJumpTableHeader(SelectionDAGISel::JumpTable &JT,
1658 SelectionDAGISel::JumpTableHeader &JTH) {
1659 // Subtract the lowest switch case value from the value being switched on
1660 // and conditional branch to default mbb if the result is greater than the
1661 // difference between smallest and largest cases.
1662 SDOperand SwitchOp = getValue(JTH.SValue);
1663 MVT VT = SwitchOp.getValueType();
1664 SDOperand SUB = DAG.getNode(ISD::SUB, VT, SwitchOp,
1665 DAG.getConstant(JTH.First, VT));
1667 // The SDNode we just created, which holds the value being switched on
1668 // minus the the smallest case value, needs to be copied to a virtual
1669 // register so it can be used as an index into the jump table in a
1670 // subsequent basic block. This value may be smaller or larger than the
1671 // target's pointer type, and therefore require extension or truncating.
1672 if (VT.bitsGT(TLI.getPointerTy()))
1673 SwitchOp = DAG.getNode(ISD::TRUNCATE, TLI.getPointerTy(), SUB);
1675 SwitchOp = DAG.getNode(ISD::ZERO_EXTEND, TLI.getPointerTy(), SUB);
1677 unsigned JumpTableReg = FuncInfo.MakeReg(TLI.getPointerTy());
1678 SDOperand CopyTo = DAG.getCopyToReg(getControlRoot(), JumpTableReg, SwitchOp);
1679 JT.Reg = JumpTableReg;
1681 // Emit the range check for the jump table, and branch to the default
1682 // block for the switch statement if the value being switched on exceeds
1683 // the largest case in the switch.
1684 SDOperand CMP = DAG.getSetCC(TLI.getSetCCResultType(SUB), SUB,
1685 DAG.getConstant(JTH.Last-JTH.First,VT),
1688 // Set NextBlock to be the MBB immediately after the current one, if any.
1689 // This is used to avoid emitting unnecessary branches to the next block.
1690 MachineBasicBlock *NextBlock = 0;
1691 MachineFunction::iterator BBI = CurMBB;
1692 if (++BBI != CurMBB->getParent()->end())
1695 SDOperand BrCond = DAG.getNode(ISD::BRCOND, MVT::Other, CopyTo, CMP,
1696 DAG.getBasicBlock(JT.Default));
1698 if (JT.MBB == NextBlock)
1699 DAG.setRoot(BrCond);
1701 DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, BrCond,
1702 DAG.getBasicBlock(JT.MBB)));
1707 /// visitBitTestHeader - This function emits necessary code to produce value
1708 /// suitable for "bit tests"
1709 void SelectionDAGLowering::visitBitTestHeader(SelectionDAGISel::BitTestBlock &B) {
1710 // Subtract the minimum value
1711 SDOperand SwitchOp = getValue(B.SValue);
1712 MVT VT = SwitchOp.getValueType();
1713 SDOperand SUB = DAG.getNode(ISD::SUB, VT, SwitchOp,
1714 DAG.getConstant(B.First, VT));
1717 SDOperand RangeCmp = DAG.getSetCC(TLI.getSetCCResultType(SUB), SUB,
1718 DAG.getConstant(B.Range, VT),
1722 if (VT.bitsGT(TLI.getShiftAmountTy()))
1723 ShiftOp = DAG.getNode(ISD::TRUNCATE, TLI.getShiftAmountTy(), SUB);
1725 ShiftOp = DAG.getNode(ISD::ZERO_EXTEND, TLI.getShiftAmountTy(), SUB);
1727 // Make desired shift
1728 SDOperand SwitchVal = DAG.getNode(ISD::SHL, TLI.getPointerTy(),
1729 DAG.getConstant(1, TLI.getPointerTy()),
1732 unsigned SwitchReg = FuncInfo.MakeReg(TLI.getPointerTy());
1733 SDOperand CopyTo = DAG.getCopyToReg(getControlRoot(), SwitchReg, SwitchVal);
1736 // Set NextBlock to be the MBB immediately after the current one, if any.
1737 // This is used to avoid emitting unnecessary branches to the next block.
1738 MachineBasicBlock *NextBlock = 0;
1739 MachineFunction::iterator BBI = CurMBB;
1740 if (++BBI != CurMBB->getParent()->end())
1743 MachineBasicBlock* MBB = B.Cases[0].ThisBB;
1745 CurMBB->addSuccessor(B.Default);
1746 CurMBB->addSuccessor(MBB);
1748 SDOperand BrRange = DAG.getNode(ISD::BRCOND, MVT::Other, CopyTo, RangeCmp,
1749 DAG.getBasicBlock(B.Default));
1751 if (MBB == NextBlock)
1752 DAG.setRoot(BrRange);
1754 DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, CopyTo,
1755 DAG.getBasicBlock(MBB)));
1760 /// visitBitTestCase - this function produces one "bit test"
1761 void SelectionDAGLowering::visitBitTestCase(MachineBasicBlock* NextMBB,
1763 SelectionDAGISel::BitTestCase &B) {
1764 // Emit bit tests and jumps
1765 SDOperand SwitchVal = DAG.getCopyFromReg(getControlRoot(), Reg,
1766 TLI.getPointerTy());
1768 SDOperand AndOp = DAG.getNode(ISD::AND, TLI.getPointerTy(), SwitchVal,
1769 DAG.getConstant(B.Mask, TLI.getPointerTy()));
1770 SDOperand AndCmp = DAG.getSetCC(TLI.getSetCCResultType(AndOp), AndOp,
1771 DAG.getConstant(0, TLI.getPointerTy()),
1774 CurMBB->addSuccessor(B.TargetBB);
1775 CurMBB->addSuccessor(NextMBB);
1777 SDOperand BrAnd = DAG.getNode(ISD::BRCOND, MVT::Other, getControlRoot(),
1778 AndCmp, DAG.getBasicBlock(B.TargetBB));
1780 // Set NextBlock to be the MBB immediately after the current one, if any.
1781 // This is used to avoid emitting unnecessary branches to the next block.
1782 MachineBasicBlock *NextBlock = 0;
1783 MachineFunction::iterator BBI = CurMBB;
1784 if (++BBI != CurMBB->getParent()->end())
1787 if (NextMBB == NextBlock)
1790 DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, BrAnd,
1791 DAG.getBasicBlock(NextMBB)));
1796 void SelectionDAGLowering::visitInvoke(InvokeInst &I) {
1797 // Retrieve successors.
1798 MachineBasicBlock *Return = FuncInfo.MBBMap[I.getSuccessor(0)];
1799 MachineBasicBlock *LandingPad = FuncInfo.MBBMap[I.getSuccessor(1)];
1801 if (isa<InlineAsm>(I.getCalledValue()))
1804 LowerCallTo(&I, getValue(I.getOperand(0)), false, LandingPad);
1806 // If the value of the invoke is used outside of its defining block, make it
1807 // available as a virtual register.
1808 if (!I.use_empty()) {
1809 DenseMap<const Value*, unsigned>::iterator VMI = FuncInfo.ValueMap.find(&I);
1810 if (VMI != FuncInfo.ValueMap.end())
1811 CopyValueToVirtualRegister(&I, VMI->second);
1814 // Update successor info
1815 CurMBB->addSuccessor(Return);
1816 CurMBB->addSuccessor(LandingPad);
1818 // Drop into normal successor.
1819 DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, getControlRoot(),
1820 DAG.getBasicBlock(Return)));
1823 void SelectionDAGLowering::visitUnwind(UnwindInst &I) {
1826 /// handleSmallSwitchCaseRange - Emit a series of specific tests (suitable for
1827 /// small case ranges).
1828 bool SelectionDAGLowering::handleSmallSwitchRange(CaseRec& CR,
1829 CaseRecVector& WorkList,
1831 MachineBasicBlock* Default) {
1832 Case& BackCase = *(CR.Range.second-1);
1834 // Size is the number of Cases represented by this range.
1835 unsigned Size = CR.Range.second - CR.Range.first;
1839 // Get the MachineFunction which holds the current MBB. This is used when
1840 // inserting any additional MBBs necessary to represent the switch.
1841 MachineFunction *CurMF = CurMBB->getParent();
1843 // Figure out which block is immediately after the current one.
1844 MachineBasicBlock *NextBlock = 0;
1845 MachineFunction::iterator BBI = CR.CaseBB;
1847 if (++BBI != CurMBB->getParent()->end())
1850 // TODO: If any two of the cases has the same destination, and if one value
1851 // is the same as the other, but has one bit unset that the other has set,
1852 // use bit manipulation to do two compares at once. For example:
1853 // "if (X == 6 || X == 4)" -> "if ((X|2) == 6)"
1855 // Rearrange the case blocks so that the last one falls through if possible.
1856 if (NextBlock && Default != NextBlock && BackCase.BB != NextBlock) {
1857 // The last case block won't fall through into 'NextBlock' if we emit the
1858 // branches in this order. See if rearranging a case value would help.
1859 for (CaseItr I = CR.Range.first, E = CR.Range.second-1; I != E; ++I) {
1860 if (I->BB == NextBlock) {
1861 std::swap(*I, BackCase);
1867 // Create a CaseBlock record representing a conditional branch to
1868 // the Case's target mbb if the value being switched on SV is equal
1870 MachineBasicBlock *CurBlock = CR.CaseBB;
1871 for (CaseItr I = CR.Range.first, E = CR.Range.second; I != E; ++I) {
1872 MachineBasicBlock *FallThrough;
1874 FallThrough = new MachineBasicBlock(CurBlock->getBasicBlock());
1875 CurMF->getBasicBlockList().insert(BBI, FallThrough);
1877 // If the last case doesn't match, go to the default block.
1878 FallThrough = Default;
1881 Value *RHS, *LHS, *MHS;
1883 if (I->High == I->Low) {
1884 // This is just small small case range :) containing exactly 1 case
1886 LHS = SV; RHS = I->High; MHS = NULL;
1889 LHS = I->Low; MHS = SV; RHS = I->High;
1891 SelectionDAGISel::CaseBlock CB(CC, LHS, RHS, MHS,
1892 I->BB, FallThrough, CurBlock);
1894 // If emitting the first comparison, just call visitSwitchCase to emit the
1895 // code into the current block. Otherwise, push the CaseBlock onto the
1896 // vector to be later processed by SDISel, and insert the node's MBB
1897 // before the next MBB.
1898 if (CurBlock == CurMBB)
1899 visitSwitchCase(CB);
1901 SwitchCases.push_back(CB);
1903 CurBlock = FallThrough;
1909 static inline bool areJTsAllowed(const TargetLowering &TLI) {
1910 return (TLI.isOperationLegal(ISD::BR_JT, MVT::Other) ||
1911 TLI.isOperationLegal(ISD::BRIND, MVT::Other));
1914 /// handleJTSwitchCase - Emit jumptable for current switch case range
1915 bool SelectionDAGLowering::handleJTSwitchCase(CaseRec& CR,
1916 CaseRecVector& WorkList,
1918 MachineBasicBlock* Default) {
1919 Case& FrontCase = *CR.Range.first;
1920 Case& BackCase = *(CR.Range.second-1);
1922 int64_t First = cast<ConstantInt>(FrontCase.Low)->getSExtValue();
1923 int64_t Last = cast<ConstantInt>(BackCase.High)->getSExtValue();
1926 for (CaseItr I = CR.Range.first, E = CR.Range.second;
1930 if (!areJTsAllowed(TLI) || TSize <= 3)
1933 double Density = (double)TSize / (double)((Last - First) + 1ULL);
1937 DOUT << "Lowering jump table\n"
1938 << "First entry: " << First << ". Last entry: " << Last << "\n"
1939 << "Size: " << TSize << ". Density: " << Density << "\n\n";
1941 // Get the MachineFunction which holds the current MBB. This is used when
1942 // inserting any additional MBBs necessary to represent the switch.
1943 MachineFunction *CurMF = CurMBB->getParent();
1945 // Figure out which block is immediately after the current one.
1946 MachineBasicBlock *NextBlock = 0;
1947 MachineFunction::iterator BBI = CR.CaseBB;
1949 if (++BBI != CurMBB->getParent()->end())
1952 const BasicBlock *LLVMBB = CR.CaseBB->getBasicBlock();
1954 // Create a new basic block to hold the code for loading the address
1955 // of the jump table, and jumping to it. Update successor information;
1956 // we will either branch to the default case for the switch, or the jump
1958 MachineBasicBlock *JumpTableBB = new MachineBasicBlock(LLVMBB);
1959 CurMF->getBasicBlockList().insert(BBI, JumpTableBB);
1960 CR.CaseBB->addSuccessor(Default);
1961 CR.CaseBB->addSuccessor(JumpTableBB);
1963 // Build a vector of destination BBs, corresponding to each target
1964 // of the jump table. If the value of the jump table slot corresponds to
1965 // a case statement, push the case's BB onto the vector, otherwise, push
1967 std::vector<MachineBasicBlock*> DestBBs;
1968 int64_t TEI = First;
1969 for (CaseItr I = CR.Range.first, E = CR.Range.second; I != E; ++TEI) {
1970 int64_t Low = cast<ConstantInt>(I->Low)->getSExtValue();
1971 int64_t High = cast<ConstantInt>(I->High)->getSExtValue();
1973 if ((Low <= TEI) && (TEI <= High)) {
1974 DestBBs.push_back(I->BB);
1978 DestBBs.push_back(Default);
1982 // Update successor info. Add one edge to each unique successor.
1983 BitVector SuccsHandled(CR.CaseBB->getParent()->getNumBlockIDs());
1984 for (std::vector<MachineBasicBlock*>::iterator I = DestBBs.begin(),
1985 E = DestBBs.end(); I != E; ++I) {
1986 if (!SuccsHandled[(*I)->getNumber()]) {
1987 SuccsHandled[(*I)->getNumber()] = true;
1988 JumpTableBB->addSuccessor(*I);
1992 // Create a jump table index for this jump table, or return an existing
1994 unsigned JTI = CurMF->getJumpTableInfo()->getJumpTableIndex(DestBBs);
1996 // Set the jump table information so that we can codegen it as a second
1997 // MachineBasicBlock
1998 SelectionDAGISel::JumpTable JT(-1U, JTI, JumpTableBB, Default);
1999 SelectionDAGISel::JumpTableHeader JTH(First, Last, SV, CR.CaseBB,
2000 (CR.CaseBB == CurMBB));
2001 if (CR.CaseBB == CurMBB)
2002 visitJumpTableHeader(JT, JTH);
2004 JTCases.push_back(SelectionDAGISel::JumpTableBlock(JTH, JT));
2009 /// handleBTSplitSwitchCase - emit comparison and split binary search tree into
2011 bool SelectionDAGLowering::handleBTSplitSwitchCase(CaseRec& CR,
2012 CaseRecVector& WorkList,
2014 MachineBasicBlock* Default) {
2015 // Get the MachineFunction which holds the current MBB. This is used when
2016 // inserting any additional MBBs necessary to represent the switch.
2017 MachineFunction *CurMF = CurMBB->getParent();
2019 // Figure out which block is immediately after the current one.
2020 MachineBasicBlock *NextBlock = 0;
2021 MachineFunction::iterator BBI = CR.CaseBB;
2023 if (++BBI != CurMBB->getParent()->end())
2026 Case& FrontCase = *CR.Range.first;
2027 Case& BackCase = *(CR.Range.second-1);
2028 const BasicBlock *LLVMBB = CR.CaseBB->getBasicBlock();
2030 // Size is the number of Cases represented by this range.
2031 unsigned Size = CR.Range.second - CR.Range.first;
2033 int64_t First = cast<ConstantInt>(FrontCase.Low)->getSExtValue();
2034 int64_t Last = cast<ConstantInt>(BackCase.High)->getSExtValue();
2036 CaseItr Pivot = CR.Range.first + Size/2;
2038 // Select optimal pivot, maximizing sum density of LHS and RHS. This will
2039 // (heuristically) allow us to emit JumpTable's later.
2041 for (CaseItr I = CR.Range.first, E = CR.Range.second;
2045 uint64_t LSize = FrontCase.size();
2046 uint64_t RSize = TSize-LSize;
2047 DOUT << "Selecting best pivot: \n"
2048 << "First: " << First << ", Last: " << Last <<"\n"
2049 << "LSize: " << LSize << ", RSize: " << RSize << "\n";
2050 for (CaseItr I = CR.Range.first, J=I+1, E = CR.Range.second;
2052 int64_t LEnd = cast<ConstantInt>(I->High)->getSExtValue();
2053 int64_t RBegin = cast<ConstantInt>(J->Low)->getSExtValue();
2054 assert((RBegin-LEnd>=1) && "Invalid case distance");
2055 double LDensity = (double)LSize / (double)((LEnd - First) + 1ULL);
2056 double RDensity = (double)RSize / (double)((Last - RBegin) + 1ULL);
2057 double Metric = Log2_64(RBegin-LEnd)*(LDensity+RDensity);
2058 // Should always split in some non-trivial place
2060 << "LEnd: " << LEnd << ", RBegin: " << RBegin << "\n"
2061 << "LDensity: " << LDensity << ", RDensity: " << RDensity << "\n"
2062 << "Metric: " << Metric << "\n";
2063 if (FMetric < Metric) {
2066 DOUT << "Current metric set to: " << FMetric << "\n";
2072 if (areJTsAllowed(TLI)) {
2073 // If our case is dense we *really* should handle it earlier!
2074 assert((FMetric > 0) && "Should handle dense range earlier!");
2076 Pivot = CR.Range.first + Size/2;
2079 CaseRange LHSR(CR.Range.first, Pivot);
2080 CaseRange RHSR(Pivot, CR.Range.second);
2081 Constant *C = Pivot->Low;
2082 MachineBasicBlock *FalseBB = 0, *TrueBB = 0;
2084 // We know that we branch to the LHS if the Value being switched on is
2085 // less than the Pivot value, C. We use this to optimize our binary
2086 // tree a bit, by recognizing that if SV is greater than or equal to the
2087 // LHS's Case Value, and that Case Value is exactly one less than the
2088 // Pivot's Value, then we can branch directly to the LHS's Target,
2089 // rather than creating a leaf node for it.
2090 if ((LHSR.second - LHSR.first) == 1 &&
2091 LHSR.first->High == CR.GE &&
2092 cast<ConstantInt>(C)->getSExtValue() ==
2093 (cast<ConstantInt>(CR.GE)->getSExtValue() + 1LL)) {
2094 TrueBB = LHSR.first->BB;
2096 TrueBB = new MachineBasicBlock(LLVMBB);
2097 CurMF->getBasicBlockList().insert(BBI, TrueBB);
2098 WorkList.push_back(CaseRec(TrueBB, C, CR.GE, LHSR));
2101 // Similar to the optimization above, if the Value being switched on is
2102 // known to be less than the Constant CR.LT, and the current Case Value
2103 // is CR.LT - 1, then we can branch directly to the target block for
2104 // the current Case Value, rather than emitting a RHS leaf node for it.
2105 if ((RHSR.second - RHSR.first) == 1 && CR.LT &&
2106 cast<ConstantInt>(RHSR.first->Low)->getSExtValue() ==
2107 (cast<ConstantInt>(CR.LT)->getSExtValue() - 1LL)) {
2108 FalseBB = RHSR.first->BB;
2110 FalseBB = new MachineBasicBlock(LLVMBB);
2111 CurMF->getBasicBlockList().insert(BBI, FalseBB);
2112 WorkList.push_back(CaseRec(FalseBB,CR.LT,C,RHSR));
2115 // Create a CaseBlock record representing a conditional branch to
2116 // the LHS node if the value being switched on SV is less than C.
2117 // Otherwise, branch to LHS.
2118 SelectionDAGISel::CaseBlock CB(ISD::SETLT, SV, C, NULL,
2119 TrueBB, FalseBB, CR.CaseBB);
2121 if (CR.CaseBB == CurMBB)
2122 visitSwitchCase(CB);
2124 SwitchCases.push_back(CB);
2129 /// handleBitTestsSwitchCase - if current case range has few destination and
2130 /// range span less, than machine word bitwidth, encode case range into series
2131 /// of masks and emit bit tests with these masks.
2132 bool SelectionDAGLowering::handleBitTestsSwitchCase(CaseRec& CR,
2133 CaseRecVector& WorkList,
2135 MachineBasicBlock* Default){
2136 unsigned IntPtrBits = TLI.getPointerTy().getSizeInBits();
2138 Case& FrontCase = *CR.Range.first;
2139 Case& BackCase = *(CR.Range.second-1);
2141 // Get the MachineFunction which holds the current MBB. This is used when
2142 // inserting any additional MBBs necessary to represent the switch.
2143 MachineFunction *CurMF = CurMBB->getParent();
2145 unsigned numCmps = 0;
2146 for (CaseItr I = CR.Range.first, E = CR.Range.second;
2148 // Single case counts one, case range - two.
2149 if (I->Low == I->High)
2155 // Count unique destinations
2156 SmallSet<MachineBasicBlock*, 4> Dests;
2157 for (CaseItr I = CR.Range.first, E = CR.Range.second; I!=E; ++I) {
2158 Dests.insert(I->BB);
2159 if (Dests.size() > 3)
2160 // Don't bother the code below, if there are too much unique destinations
2163 DOUT << "Total number of unique destinations: " << Dests.size() << "\n"
2164 << "Total number of comparisons: " << numCmps << "\n";
2166 // Compute span of values.
2167 Constant* minValue = FrontCase.Low;
2168 Constant* maxValue = BackCase.High;
2169 uint64_t range = cast<ConstantInt>(maxValue)->getSExtValue() -
2170 cast<ConstantInt>(minValue)->getSExtValue();
2171 DOUT << "Compare range: " << range << "\n"
2172 << "Low bound: " << cast<ConstantInt>(minValue)->getSExtValue() << "\n"
2173 << "High bound: " << cast<ConstantInt>(maxValue)->getSExtValue() << "\n";
2175 if (range>=IntPtrBits ||
2176 (!(Dests.size() == 1 && numCmps >= 3) &&
2177 !(Dests.size() == 2 && numCmps >= 5) &&
2178 !(Dests.size() >= 3 && numCmps >= 6)))
2181 DOUT << "Emitting bit tests\n";
2182 int64_t lowBound = 0;
2184 // Optimize the case where all the case values fit in a
2185 // word without having to subtract minValue. In this case,
2186 // we can optimize away the subtraction.
2187 if (cast<ConstantInt>(minValue)->getSExtValue() >= 0 &&
2188 cast<ConstantInt>(maxValue)->getSExtValue() < IntPtrBits) {
2189 range = cast<ConstantInt>(maxValue)->getSExtValue();
2191 lowBound = cast<ConstantInt>(minValue)->getSExtValue();
2194 CaseBitsVector CasesBits;
2195 unsigned i, count = 0;
2197 for (CaseItr I = CR.Range.first, E = CR.Range.second; I!=E; ++I) {
2198 MachineBasicBlock* Dest = I->BB;
2199 for (i = 0; i < count; ++i)
2200 if (Dest == CasesBits[i].BB)
2204 assert((count < 3) && "Too much destinations to test!");
2205 CasesBits.push_back(CaseBits(0, Dest, 0));
2209 uint64_t lo = cast<ConstantInt>(I->Low)->getSExtValue() - lowBound;
2210 uint64_t hi = cast<ConstantInt>(I->High)->getSExtValue() - lowBound;
2212 for (uint64_t j = lo; j <= hi; j++) {
2213 CasesBits[i].Mask |= 1ULL << j;
2214 CasesBits[i].Bits++;
2218 std::sort(CasesBits.begin(), CasesBits.end(), CaseBitsCmp());
2220 SelectionDAGISel::BitTestInfo BTC;
2222 // Figure out which block is immediately after the current one.
2223 MachineFunction::iterator BBI = CR.CaseBB;
2226 const BasicBlock *LLVMBB = CR.CaseBB->getBasicBlock();
2229 for (unsigned i = 0, e = CasesBits.size(); i!=e; ++i) {
2230 DOUT << "Mask: " << CasesBits[i].Mask << ", Bits: " << CasesBits[i].Bits
2231 << ", BB: " << CasesBits[i].BB << "\n";
2233 MachineBasicBlock *CaseBB = new MachineBasicBlock(LLVMBB);
2234 CurMF->getBasicBlockList().insert(BBI, CaseBB);
2235 BTC.push_back(SelectionDAGISel::BitTestCase(CasesBits[i].Mask,
2240 SelectionDAGISel::BitTestBlock BTB(lowBound, range, SV,
2241 -1U, (CR.CaseBB == CurMBB),
2242 CR.CaseBB, Default, BTC);
2244 if (CR.CaseBB == CurMBB)
2245 visitBitTestHeader(BTB);
2247 BitTestCases.push_back(BTB);
2253 /// Clusterify - Transform simple list of Cases into list of CaseRange's
2254 unsigned SelectionDAGLowering::Clusterify(CaseVector& Cases,
2255 const SwitchInst& SI) {
2256 unsigned numCmps = 0;
2258 // Start with "simple" cases
2259 for (unsigned i = 1; i < SI.getNumSuccessors(); ++i) {
2260 MachineBasicBlock *SMBB = FuncInfo.MBBMap[SI.getSuccessor(i)];
2261 Cases.push_back(Case(SI.getSuccessorValue(i),
2262 SI.getSuccessorValue(i),
2265 std::sort(Cases.begin(), Cases.end(), CaseCmp());
2267 // Merge case into clusters
2268 if (Cases.size()>=2)
2269 // Must recompute end() each iteration because it may be
2270 // invalidated by erase if we hold on to it
2271 for (CaseItr I=Cases.begin(), J=++(Cases.begin()); J!=Cases.end(); ) {
2272 int64_t nextValue = cast<ConstantInt>(J->Low)->getSExtValue();
2273 int64_t currentValue = cast<ConstantInt>(I->High)->getSExtValue();
2274 MachineBasicBlock* nextBB = J->BB;
2275 MachineBasicBlock* currentBB = I->BB;
2277 // If the two neighboring cases go to the same destination, merge them
2278 // into a single case.
2279 if ((nextValue-currentValue==1) && (currentBB == nextBB)) {
2287 for (CaseItr I=Cases.begin(), E=Cases.end(); I!=E; ++I, ++numCmps) {
2288 if (I->Low != I->High)
2289 // A range counts double, since it requires two compares.
2296 void SelectionDAGLowering::visitSwitch(SwitchInst &SI) {
2297 // Figure out which block is immediately after the current one.
2298 MachineBasicBlock *NextBlock = 0;
2299 MachineFunction::iterator BBI = CurMBB;
2301 MachineBasicBlock *Default = FuncInfo.MBBMap[SI.getDefaultDest()];
2303 // If there is only the default destination, branch to it if it is not the
2304 // next basic block. Otherwise, just fall through.
2305 if (SI.getNumOperands() == 2) {
2306 // Update machine-CFG edges.
2308 // If this is not a fall-through branch, emit the branch.
2309 CurMBB->addSuccessor(Default);
2310 if (Default != NextBlock)
2311 DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, getControlRoot(),
2312 DAG.getBasicBlock(Default)));
2317 // If there are any non-default case statements, create a vector of Cases
2318 // representing each one, and sort the vector so that we can efficiently
2319 // create a binary search tree from them.
2321 unsigned numCmps = Clusterify(Cases, SI);
2322 DOUT << "Clusterify finished. Total clusters: " << Cases.size()
2323 << ". Total compares: " << numCmps << "\n";
2325 // Get the Value to be switched on and default basic blocks, which will be
2326 // inserted into CaseBlock records, representing basic blocks in the binary
2328 Value *SV = SI.getOperand(0);
2330 // Push the initial CaseRec onto the worklist
2331 CaseRecVector WorkList;
2332 WorkList.push_back(CaseRec(CurMBB,0,0,CaseRange(Cases.begin(),Cases.end())));
2334 while (!WorkList.empty()) {
2335 // Grab a record representing a case range to process off the worklist
2336 CaseRec CR = WorkList.back();
2337 WorkList.pop_back();
2339 if (handleBitTestsSwitchCase(CR, WorkList, SV, Default))
2342 // If the range has few cases (two or less) emit a series of specific
2344 if (handleSmallSwitchRange(CR, WorkList, SV, Default))
2347 // If the switch has more than 5 blocks, and at least 40% dense, and the
2348 // target supports indirect branches, then emit a jump table rather than
2349 // lowering the switch to a binary tree of conditional branches.
2350 if (handleJTSwitchCase(CR, WorkList, SV, Default))
2353 // Emit binary tree. We need to pick a pivot, and push left and right ranges
2354 // onto the worklist. Leafs are handled via handleSmallSwitchRange() call.
2355 handleBTSplitSwitchCase(CR, WorkList, SV, Default);
2360 void SelectionDAGLowering::visitSub(User &I) {
2361 // -0.0 - X --> fneg
2362 const Type *Ty = I.getType();
2363 if (isa<VectorType>(Ty)) {
2364 if (ConstantVector *CV = dyn_cast<ConstantVector>(I.getOperand(0))) {
2365 const VectorType *DestTy = cast<VectorType>(I.getType());
2366 const Type *ElTy = DestTy->getElementType();
2367 if (ElTy->isFloatingPoint()) {
2368 unsigned VL = DestTy->getNumElements();
2369 std::vector<Constant*> NZ(VL, ConstantFP::getNegativeZero(ElTy));
2370 Constant *CNZ = ConstantVector::get(&NZ[0], NZ.size());
2372 SDOperand Op2 = getValue(I.getOperand(1));
2373 setValue(&I, DAG.getNode(ISD::FNEG, Op2.getValueType(), Op2));
2379 if (Ty->isFloatingPoint()) {
2380 if (ConstantFP *CFP = dyn_cast<ConstantFP>(I.getOperand(0)))
2381 if (CFP->isExactlyValue(ConstantFP::getNegativeZero(Ty)->getValueAPF())) {
2382 SDOperand Op2 = getValue(I.getOperand(1));
2383 setValue(&I, DAG.getNode(ISD::FNEG, Op2.getValueType(), Op2));
2388 visitBinary(I, Ty->isFPOrFPVector() ? ISD::FSUB : ISD::SUB);
2391 void SelectionDAGLowering::visitBinary(User &I, unsigned OpCode) {
2392 SDOperand Op1 = getValue(I.getOperand(0));
2393 SDOperand Op2 = getValue(I.getOperand(1));
2395 setValue(&I, DAG.getNode(OpCode, Op1.getValueType(), Op1, Op2));
2398 void SelectionDAGLowering::visitShift(User &I, unsigned Opcode) {
2399 SDOperand Op1 = getValue(I.getOperand(0));
2400 SDOperand Op2 = getValue(I.getOperand(1));
2402 if (TLI.getShiftAmountTy().bitsLT(Op2.getValueType()))
2403 Op2 = DAG.getNode(ISD::TRUNCATE, TLI.getShiftAmountTy(), Op2);
2404 else if (TLI.getShiftAmountTy().bitsGT(Op2.getValueType()))
2405 Op2 = DAG.getNode(ISD::ANY_EXTEND, TLI.getShiftAmountTy(), Op2);
2407 setValue(&I, DAG.getNode(Opcode, Op1.getValueType(), Op1, Op2));
2410 void SelectionDAGLowering::visitICmp(User &I) {
2411 ICmpInst::Predicate predicate = ICmpInst::BAD_ICMP_PREDICATE;
2412 if (ICmpInst *IC = dyn_cast<ICmpInst>(&I))
2413 predicate = IC->getPredicate();
2414 else if (ConstantExpr *IC = dyn_cast<ConstantExpr>(&I))
2415 predicate = ICmpInst::Predicate(IC->getPredicate());
2416 SDOperand Op1 = getValue(I.getOperand(0));
2417 SDOperand Op2 = getValue(I.getOperand(1));
2418 ISD::CondCode Opcode;
2419 switch (predicate) {
2420 case ICmpInst::ICMP_EQ : Opcode = ISD::SETEQ; break;
2421 case ICmpInst::ICMP_NE : Opcode = ISD::SETNE; break;
2422 case ICmpInst::ICMP_UGT : Opcode = ISD::SETUGT; break;
2423 case ICmpInst::ICMP_UGE : Opcode = ISD::SETUGE; break;
2424 case ICmpInst::ICMP_ULT : Opcode = ISD::SETULT; break;
2425 case ICmpInst::ICMP_ULE : Opcode = ISD::SETULE; break;
2426 case ICmpInst::ICMP_SGT : Opcode = ISD::SETGT; break;
2427 case ICmpInst::ICMP_SGE : Opcode = ISD::SETGE; break;
2428 case ICmpInst::ICMP_SLT : Opcode = ISD::SETLT; break;
2429 case ICmpInst::ICMP_SLE : Opcode = ISD::SETLE; break;
2431 assert(!"Invalid ICmp predicate value");
2432 Opcode = ISD::SETEQ;
2435 setValue(&I, DAG.getSetCC(MVT::i1, Op1, Op2, Opcode));
2438 void SelectionDAGLowering::visitFCmp(User &I) {
2439 FCmpInst::Predicate predicate = FCmpInst::BAD_FCMP_PREDICATE;
2440 if (FCmpInst *FC = dyn_cast<FCmpInst>(&I))
2441 predicate = FC->getPredicate();
2442 else if (ConstantExpr *FC = dyn_cast<ConstantExpr>(&I))
2443 predicate = FCmpInst::Predicate(FC->getPredicate());
2444 SDOperand Op1 = getValue(I.getOperand(0));
2445 SDOperand Op2 = getValue(I.getOperand(1));
2446 ISD::CondCode Condition, FOC, FPC;
2447 switch (predicate) {
2448 case FCmpInst::FCMP_FALSE: FOC = FPC = ISD::SETFALSE; break;
2449 case FCmpInst::FCMP_OEQ: FOC = ISD::SETEQ; FPC = ISD::SETOEQ; break;
2450 case FCmpInst::FCMP_OGT: FOC = ISD::SETGT; FPC = ISD::SETOGT; break;
2451 case FCmpInst::FCMP_OGE: FOC = ISD::SETGE; FPC = ISD::SETOGE; break;
2452 case FCmpInst::FCMP_OLT: FOC = ISD::SETLT; FPC = ISD::SETOLT; break;
2453 case FCmpInst::FCMP_OLE: FOC = ISD::SETLE; FPC = ISD::SETOLE; break;
2454 case FCmpInst::FCMP_ONE: FOC = ISD::SETNE; FPC = ISD::SETONE; break;
2455 case FCmpInst::FCMP_ORD: FOC = FPC = ISD::SETO; break;
2456 case FCmpInst::FCMP_UNO: FOC = FPC = ISD::SETUO; break;
2457 case FCmpInst::FCMP_UEQ: FOC = ISD::SETEQ; FPC = ISD::SETUEQ; break;
2458 case FCmpInst::FCMP_UGT: FOC = ISD::SETGT; FPC = ISD::SETUGT; break;
2459 case FCmpInst::FCMP_UGE: FOC = ISD::SETGE; FPC = ISD::SETUGE; break;
2460 case FCmpInst::FCMP_ULT: FOC = ISD::SETLT; FPC = ISD::SETULT; break;
2461 case FCmpInst::FCMP_ULE: FOC = ISD::SETLE; FPC = ISD::SETULE; break;
2462 case FCmpInst::FCMP_UNE: FOC = ISD::SETNE; FPC = ISD::SETUNE; break;
2463 case FCmpInst::FCMP_TRUE: FOC = FPC = ISD::SETTRUE; break;
2465 assert(!"Invalid FCmp predicate value");
2466 FOC = FPC = ISD::SETFALSE;
2469 if (FiniteOnlyFPMath())
2473 setValue(&I, DAG.getSetCC(MVT::i1, Op1, Op2, Condition));
2476 void SelectionDAGLowering::visitVICmp(User &I) {
2477 ICmpInst::Predicate predicate = ICmpInst::BAD_ICMP_PREDICATE;
2478 if (VICmpInst *IC = dyn_cast<VICmpInst>(&I))
2479 predicate = IC->getPredicate();
2480 else if (ConstantExpr *IC = dyn_cast<ConstantExpr>(&I))
2481 predicate = ICmpInst::Predicate(IC->getPredicate());
2482 SDOperand Op1 = getValue(I.getOperand(0));
2483 SDOperand Op2 = getValue(I.getOperand(1));
2484 ISD::CondCode Opcode;
2485 switch (predicate) {
2486 case ICmpInst::ICMP_EQ : Opcode = ISD::SETEQ; break;
2487 case ICmpInst::ICMP_NE : Opcode = ISD::SETNE; break;
2488 case ICmpInst::ICMP_UGT : Opcode = ISD::SETUGT; break;
2489 case ICmpInst::ICMP_UGE : Opcode = ISD::SETUGE; break;
2490 case ICmpInst::ICMP_ULT : Opcode = ISD::SETULT; break;
2491 case ICmpInst::ICMP_ULE : Opcode = ISD::SETULE; break;
2492 case ICmpInst::ICMP_SGT : Opcode = ISD::SETGT; break;
2493 case ICmpInst::ICMP_SGE : Opcode = ISD::SETGE; break;
2494 case ICmpInst::ICMP_SLT : Opcode = ISD::SETLT; break;
2495 case ICmpInst::ICMP_SLE : Opcode = ISD::SETLE; break;
2497 assert(!"Invalid ICmp predicate value");
2498 Opcode = ISD::SETEQ;
2501 setValue(&I, DAG.getVSetCC(Op1.getValueType(), Op1, Op2, Opcode));
2504 void SelectionDAGLowering::visitVFCmp(User &I) {
2505 FCmpInst::Predicate predicate = FCmpInst::BAD_FCMP_PREDICATE;
2506 if (VFCmpInst *FC = dyn_cast<VFCmpInst>(&I))
2507 predicate = FC->getPredicate();
2508 else if (ConstantExpr *FC = dyn_cast<ConstantExpr>(&I))
2509 predicate = FCmpInst::Predicate(FC->getPredicate());
2510 SDOperand Op1 = getValue(I.getOperand(0));
2511 SDOperand Op2 = getValue(I.getOperand(1));
2512 ISD::CondCode Condition, FOC, FPC;
2513 switch (predicate) {
2514 case FCmpInst::FCMP_FALSE: FOC = FPC = ISD::SETFALSE; break;
2515 case FCmpInst::FCMP_OEQ: FOC = ISD::SETEQ; FPC = ISD::SETOEQ; break;
2516 case FCmpInst::FCMP_OGT: FOC = ISD::SETGT; FPC = ISD::SETOGT; break;
2517 case FCmpInst::FCMP_OGE: FOC = ISD::SETGE; FPC = ISD::SETOGE; break;
2518 case FCmpInst::FCMP_OLT: FOC = ISD::SETLT; FPC = ISD::SETOLT; break;
2519 case FCmpInst::FCMP_OLE: FOC = ISD::SETLE; FPC = ISD::SETOLE; break;
2520 case FCmpInst::FCMP_ONE: FOC = ISD::SETNE; FPC = ISD::SETONE; break;
2521 case FCmpInst::FCMP_ORD: FOC = FPC = ISD::SETO; break;
2522 case FCmpInst::FCMP_UNO: FOC = FPC = ISD::SETUO; break;
2523 case FCmpInst::FCMP_UEQ: FOC = ISD::SETEQ; FPC = ISD::SETUEQ; break;
2524 case FCmpInst::FCMP_UGT: FOC = ISD::SETGT; FPC = ISD::SETUGT; break;
2525 case FCmpInst::FCMP_UGE: FOC = ISD::SETGE; FPC = ISD::SETUGE; break;
2526 case FCmpInst::FCMP_ULT: FOC = ISD::SETLT; FPC = ISD::SETULT; break;
2527 case FCmpInst::FCMP_ULE: FOC = ISD::SETLE; FPC = ISD::SETULE; break;
2528 case FCmpInst::FCMP_UNE: FOC = ISD::SETNE; FPC = ISD::SETUNE; break;
2529 case FCmpInst::FCMP_TRUE: FOC = FPC = ISD::SETTRUE; break;
2531 assert(!"Invalid VFCmp predicate value");
2532 FOC = FPC = ISD::SETFALSE;
2535 if (FiniteOnlyFPMath())
2540 MVT DestVT = TLI.getValueType(I.getType());
2542 setValue(&I, DAG.getVSetCC(DestVT, Op1, Op2, Condition));
2545 void SelectionDAGLowering::visitSelect(User &I) {
2546 SDOperand Cond = getValue(I.getOperand(0));
2547 SDOperand TrueVal = getValue(I.getOperand(1));
2548 SDOperand FalseVal = getValue(I.getOperand(2));
2549 setValue(&I, DAG.getNode(ISD::SELECT, TrueVal.getValueType(), Cond,
2550 TrueVal, FalseVal));
2554 void SelectionDAGLowering::visitTrunc(User &I) {
2555 // TruncInst cannot be a no-op cast because sizeof(src) > sizeof(dest).
2556 SDOperand N = getValue(I.getOperand(0));
2557 MVT DestVT = TLI.getValueType(I.getType());
2558 setValue(&I, DAG.getNode(ISD::TRUNCATE, DestVT, N));
2561 void SelectionDAGLowering::visitZExt(User &I) {
2562 // ZExt cannot be a no-op cast because sizeof(src) < sizeof(dest).
2563 // ZExt also can't be a cast to bool for same reason. So, nothing much to do
2564 SDOperand N = getValue(I.getOperand(0));
2565 MVT DestVT = TLI.getValueType(I.getType());
2566 setValue(&I, DAG.getNode(ISD::ZERO_EXTEND, DestVT, N));
2569 void SelectionDAGLowering::visitSExt(User &I) {
2570 // SExt cannot be a no-op cast because sizeof(src) < sizeof(dest).
2571 // SExt also can't be a cast to bool for same reason. So, nothing much to do
2572 SDOperand N = getValue(I.getOperand(0));
2573 MVT DestVT = TLI.getValueType(I.getType());
2574 setValue(&I, DAG.getNode(ISD::SIGN_EXTEND, DestVT, N));
2577 void SelectionDAGLowering::visitFPTrunc(User &I) {
2578 // FPTrunc is never a no-op cast, no need to check
2579 SDOperand N = getValue(I.getOperand(0));
2580 MVT DestVT = TLI.getValueType(I.getType());
2581 setValue(&I, DAG.getNode(ISD::FP_ROUND, DestVT, N, DAG.getIntPtrConstant(0)));
2584 void SelectionDAGLowering::visitFPExt(User &I){
2585 // FPTrunc is never a no-op cast, no need to check
2586 SDOperand N = getValue(I.getOperand(0));
2587 MVT DestVT = TLI.getValueType(I.getType());
2588 setValue(&I, DAG.getNode(ISD::FP_EXTEND, DestVT, N));
2591 void SelectionDAGLowering::visitFPToUI(User &I) {
2592 // FPToUI is never a no-op cast, no need to check
2593 SDOperand N = getValue(I.getOperand(0));
2594 MVT DestVT = TLI.getValueType(I.getType());
2595 setValue(&I, DAG.getNode(ISD::FP_TO_UINT, DestVT, N));
2598 void SelectionDAGLowering::visitFPToSI(User &I) {
2599 // FPToSI is never a no-op cast, no need to check
2600 SDOperand N = getValue(I.getOperand(0));
2601 MVT DestVT = TLI.getValueType(I.getType());
2602 setValue(&I, DAG.getNode(ISD::FP_TO_SINT, DestVT, N));
2605 void SelectionDAGLowering::visitUIToFP(User &I) {
2606 // UIToFP is never a no-op cast, no need to check
2607 SDOperand N = getValue(I.getOperand(0));
2608 MVT DestVT = TLI.getValueType(I.getType());
2609 setValue(&I, DAG.getNode(ISD::UINT_TO_FP, DestVT, N));
2612 void SelectionDAGLowering::visitSIToFP(User &I){
2613 // UIToFP is never a no-op cast, no need to check
2614 SDOperand N = getValue(I.getOperand(0));
2615 MVT DestVT = TLI.getValueType(I.getType());
2616 setValue(&I, DAG.getNode(ISD::SINT_TO_FP, DestVT, N));
2619 void SelectionDAGLowering::visitPtrToInt(User &I) {
2620 // What to do depends on the size of the integer and the size of the pointer.
2621 // We can either truncate, zero extend, or no-op, accordingly.
2622 SDOperand N = getValue(I.getOperand(0));
2623 MVT SrcVT = N.getValueType();
2624 MVT DestVT = TLI.getValueType(I.getType());
2626 if (DestVT.bitsLT(SrcVT))
2627 Result = DAG.getNode(ISD::TRUNCATE, DestVT, N);
2629 // Note: ZERO_EXTEND can handle cases where the sizes are equal too
2630 Result = DAG.getNode(ISD::ZERO_EXTEND, DestVT, N);
2631 setValue(&I, Result);
2634 void SelectionDAGLowering::visitIntToPtr(User &I) {
2635 // What to do depends on the size of the integer and the size of the pointer.
2636 // We can either truncate, zero extend, or no-op, accordingly.
2637 SDOperand N = getValue(I.getOperand(0));
2638 MVT SrcVT = N.getValueType();
2639 MVT DestVT = TLI.getValueType(I.getType());
2640 if (DestVT.bitsLT(SrcVT))
2641 setValue(&I, DAG.getNode(ISD::TRUNCATE, DestVT, N));
2643 // Note: ZERO_EXTEND can handle cases where the sizes are equal too
2644 setValue(&I, DAG.getNode(ISD::ZERO_EXTEND, DestVT, N));
2647 void SelectionDAGLowering::visitBitCast(User &I) {
2648 SDOperand N = getValue(I.getOperand(0));
2649 MVT DestVT = TLI.getValueType(I.getType());
2651 // BitCast assures us that source and destination are the same size so this
2652 // is either a BIT_CONVERT or a no-op.
2653 if (DestVT != N.getValueType())
2654 setValue(&I, DAG.getNode(ISD::BIT_CONVERT, DestVT, N)); // convert types
2656 setValue(&I, N); // noop cast.
2659 void SelectionDAGLowering::visitInsertElement(User &I) {
2660 SDOperand InVec = getValue(I.getOperand(0));
2661 SDOperand InVal = getValue(I.getOperand(1));
2662 SDOperand InIdx = DAG.getNode(ISD::ZERO_EXTEND, TLI.getPointerTy(),
2663 getValue(I.getOperand(2)));
2665 setValue(&I, DAG.getNode(ISD::INSERT_VECTOR_ELT,
2666 TLI.getValueType(I.getType()),
2667 InVec, InVal, InIdx));
2670 void SelectionDAGLowering::visitExtractElement(User &I) {
2671 SDOperand InVec = getValue(I.getOperand(0));
2672 SDOperand InIdx = DAG.getNode(ISD::ZERO_EXTEND, TLI.getPointerTy(),
2673 getValue(I.getOperand(1)));
2674 setValue(&I, DAG.getNode(ISD::EXTRACT_VECTOR_ELT,
2675 TLI.getValueType(I.getType()), InVec, InIdx));
2678 void SelectionDAGLowering::visitShuffleVector(User &I) {
2679 SDOperand V1 = getValue(I.getOperand(0));
2680 SDOperand V2 = getValue(I.getOperand(1));
2681 SDOperand Mask = getValue(I.getOperand(2));
2683 setValue(&I, DAG.getNode(ISD::VECTOR_SHUFFLE,
2684 TLI.getValueType(I.getType()),
2688 void SelectionDAGLowering::visitInsertValue(InsertValueInst &I) {
2689 const Value *Op0 = I.getOperand(0);
2690 const Value *Op1 = I.getOperand(1);
2691 const Type *AggTy = I.getType();
2692 const Type *ValTy = Op1->getType();
2693 bool IntoUndef = isa<UndefValue>(Op0);
2694 bool FromUndef = isa<UndefValue>(Op1);
2696 unsigned LinearIndex = ComputeLinearIndex(TLI, AggTy,
2697 I.idx_begin(), I.idx_end());
2699 SmallVector<MVT, 4> AggValueVTs;
2700 ComputeValueVTs(TLI, AggTy, AggValueVTs);
2701 SmallVector<MVT, 4> ValValueVTs;
2702 ComputeValueVTs(TLI, ValTy, ValValueVTs);
2704 unsigned NumAggValues = AggValueVTs.size();
2705 unsigned NumValValues = ValValueVTs.size();
2706 SmallVector<SDOperand, 4> Values(NumAggValues);
2708 SDOperand Agg = getValue(Op0);
2709 SDOperand Val = getValue(Op1);
2711 // Copy the beginning value(s) from the original aggregate.
2712 for (; i != LinearIndex; ++i)
2713 Values[i] = IntoUndef ? DAG.getNode(ISD::UNDEF, AggValueVTs[i]) :
2714 SDOperand(Agg.Val, Agg.ResNo + i);
2715 // Copy values from the inserted value(s).
2716 for (; i != LinearIndex + NumValValues; ++i)
2717 Values[i] = FromUndef ? DAG.getNode(ISD::UNDEF, AggValueVTs[i]) :
2718 SDOperand(Val.Val, Val.ResNo + i - LinearIndex);
2719 // Copy remaining value(s) from the original aggregate.
2720 for (; i != NumAggValues; ++i)
2721 Values[i] = IntoUndef ? DAG.getNode(ISD::UNDEF, AggValueVTs[i]) :
2722 SDOperand(Agg.Val, Agg.ResNo + i);
2724 setValue(&I, DAG.getNode(ISD::MERGE_VALUES,
2725 DAG.getVTList(&AggValueVTs[0], NumAggValues),
2726 &Values[0], NumAggValues));
2729 void SelectionDAGLowering::visitExtractValue(ExtractValueInst &I) {
2730 const Value *Op0 = I.getOperand(0);
2731 const Type *AggTy = Op0->getType();
2732 const Type *ValTy = I.getType();
2733 bool OutOfUndef = isa<UndefValue>(Op0);
2735 unsigned LinearIndex = ComputeLinearIndex(TLI, AggTy,
2736 I.idx_begin(), I.idx_end());
2738 SmallVector<MVT, 4> ValValueVTs;
2739 ComputeValueVTs(TLI, ValTy, ValValueVTs);
2741 unsigned NumValValues = ValValueVTs.size();
2742 SmallVector<SDOperand, 4> Values(NumValValues);
2744 SDOperand Agg = getValue(Op0);
2745 // Copy out the selected value(s).
2746 for (unsigned i = LinearIndex; i != LinearIndex + NumValValues; ++i)
2747 Values[i - LinearIndex] =
2748 OutOfUndef ? DAG.getNode(ISD::UNDEF, Agg.Val->getValueType(i)) :
2749 SDOperand(Agg.Val, Agg.ResNo + i - LinearIndex);
2751 setValue(&I, DAG.getNode(ISD::MERGE_VALUES,
2752 DAG.getVTList(&ValValueVTs[0], NumValValues),
2753 &Values[0], NumValValues));
2757 void SelectionDAGLowering::visitGetElementPtr(User &I) {
2758 SDOperand N = getValue(I.getOperand(0));
2759 const Type *Ty = I.getOperand(0)->getType();
2761 for (GetElementPtrInst::op_iterator OI = I.op_begin()+1, E = I.op_end();
2764 if (const StructType *StTy = dyn_cast<StructType>(Ty)) {
2765 unsigned Field = cast<ConstantInt>(Idx)->getZExtValue();
2768 uint64_t Offset = TD->getStructLayout(StTy)->getElementOffset(Field);
2769 N = DAG.getNode(ISD::ADD, N.getValueType(), N,
2770 DAG.getIntPtrConstant(Offset));
2772 Ty = StTy->getElementType(Field);
2774 Ty = cast<SequentialType>(Ty)->getElementType();
2776 // If this is a constant subscript, handle it quickly.
2777 if (ConstantInt *CI = dyn_cast<ConstantInt>(Idx)) {
2778 if (CI->getZExtValue() == 0) continue;
2780 TD->getABITypeSize(Ty)*cast<ConstantInt>(CI)->getSExtValue();
2781 N = DAG.getNode(ISD::ADD, N.getValueType(), N,
2782 DAG.getIntPtrConstant(Offs));
2786 // N = N + Idx * ElementSize;
2787 uint64_t ElementSize = TD->getABITypeSize(Ty);
2788 SDOperand IdxN = getValue(Idx);
2790 // If the index is smaller or larger than intptr_t, truncate or extend
2792 if (IdxN.getValueType().bitsLT(N.getValueType())) {
2793 IdxN = DAG.getNode(ISD::SIGN_EXTEND, N.getValueType(), IdxN);
2794 } else if (IdxN.getValueType().bitsGT(N.getValueType()))
2795 IdxN = DAG.getNode(ISD::TRUNCATE, N.getValueType(), IdxN);
2797 // If this is a multiply by a power of two, turn it into a shl
2798 // immediately. This is a very common case.
2799 if (isPowerOf2_64(ElementSize)) {
2800 unsigned Amt = Log2_64(ElementSize);
2801 IdxN = DAG.getNode(ISD::SHL, N.getValueType(), IdxN,
2802 DAG.getConstant(Amt, TLI.getShiftAmountTy()));
2803 N = DAG.getNode(ISD::ADD, N.getValueType(), N, IdxN);
2807 SDOperand Scale = DAG.getIntPtrConstant(ElementSize);
2808 IdxN = DAG.getNode(ISD::MUL, N.getValueType(), IdxN, Scale);
2809 N = DAG.getNode(ISD::ADD, N.getValueType(), N, IdxN);
2815 void SelectionDAGLowering::visitAlloca(AllocaInst &I) {
2816 // If this is a fixed sized alloca in the entry block of the function,
2817 // allocate it statically on the stack.
2818 if (FuncInfo.StaticAllocaMap.count(&I))
2819 return; // getValue will auto-populate this.
2821 const Type *Ty = I.getAllocatedType();
2822 uint64_t TySize = TLI.getTargetData()->getABITypeSize(Ty);
2824 std::max((unsigned)TLI.getTargetData()->getPrefTypeAlignment(Ty),
2827 SDOperand AllocSize = getValue(I.getArraySize());
2828 MVT IntPtr = TLI.getPointerTy();
2829 if (IntPtr.bitsLT(AllocSize.getValueType()))
2830 AllocSize = DAG.getNode(ISD::TRUNCATE, IntPtr, AllocSize);
2831 else if (IntPtr.bitsGT(AllocSize.getValueType()))
2832 AllocSize = DAG.getNode(ISD::ZERO_EXTEND, IntPtr, AllocSize);
2834 AllocSize = DAG.getNode(ISD::MUL, IntPtr, AllocSize,
2835 DAG.getIntPtrConstant(TySize));
2837 // Handle alignment. If the requested alignment is less than or equal to
2838 // the stack alignment, ignore it. If the size is greater than or equal to
2839 // the stack alignment, we note this in the DYNAMIC_STACKALLOC node.
2840 unsigned StackAlign =
2841 TLI.getTargetMachine().getFrameInfo()->getStackAlignment();
2842 if (Align <= StackAlign)
2845 // Round the size of the allocation up to the stack alignment size
2846 // by add SA-1 to the size.
2847 AllocSize = DAG.getNode(ISD::ADD, AllocSize.getValueType(), AllocSize,
2848 DAG.getIntPtrConstant(StackAlign-1));
2849 // Mask out the low bits for alignment purposes.
2850 AllocSize = DAG.getNode(ISD::AND, AllocSize.getValueType(), AllocSize,
2851 DAG.getIntPtrConstant(~(uint64_t)(StackAlign-1)));
2853 SDOperand Ops[] = { getRoot(), AllocSize, DAG.getIntPtrConstant(Align) };
2854 const MVT *VTs = DAG.getNodeValueTypes(AllocSize.getValueType(),
2856 SDOperand DSA = DAG.getNode(ISD::DYNAMIC_STACKALLOC, VTs, 2, Ops, 3);
2858 DAG.setRoot(DSA.getValue(1));
2860 // Inform the Frame Information that we have just allocated a variable-sized
2862 CurMBB->getParent()->getFrameInfo()->CreateVariableSizedObject();
2865 void SelectionDAGLowering::visitLoad(LoadInst &I) {
2866 const Value *SV = I.getOperand(0);
2867 SDOperand Ptr = getValue(SV);
2869 const Type *Ty = I.getType();
2870 bool isVolatile = I.isVolatile();
2871 unsigned Alignment = I.getAlignment();
2873 SmallVector<MVT, 4> ValueVTs;
2874 SmallVector<uint64_t, 4> Offsets;
2875 ComputeValueVTs(TLI, Ty, ValueVTs, &Offsets);
2876 unsigned NumValues = ValueVTs.size();
2884 // Do not serialize non-volatile loads against each other.
2885 Root = DAG.getRoot();
2888 SmallVector<SDOperand, 4> Values(NumValues);
2889 SmallVector<SDOperand, 4> Chains(NumValues);
2890 MVT PtrVT = Ptr.getValueType();
2891 for (unsigned i = 0; i != NumValues; ++i) {
2892 SDOperand L = DAG.getLoad(ValueVTs[i], Root,
2893 DAG.getNode(ISD::ADD, PtrVT, Ptr,
2894 DAG.getConstant(Offsets[i], PtrVT)),
2896 isVolatile, Alignment);
2898 Chains[i] = L.getValue(1);
2901 SDOperand Chain = DAG.getNode(ISD::TokenFactor, MVT::Other,
2902 &Chains[0], NumValues);
2906 PendingLoads.push_back(Chain);
2908 setValue(&I, DAG.getNode(ISD::MERGE_VALUES,
2909 DAG.getVTList(&ValueVTs[0], NumValues),
2910 &Values[0], NumValues));
2914 void SelectionDAGLowering::visitStore(StoreInst &I) {
2915 Value *SrcV = I.getOperand(0);
2916 SDOperand Src = getValue(SrcV);
2917 Value *PtrV = I.getOperand(1);
2918 SDOperand Ptr = getValue(PtrV);
2920 SmallVector<MVT, 4> ValueVTs;
2921 SmallVector<uint64_t, 4> Offsets;
2922 ComputeValueVTs(TLI, SrcV->getType(), ValueVTs, &Offsets);
2923 unsigned NumValues = ValueVTs.size();
2927 SDOperand Root = getRoot();
2928 SmallVector<SDOperand, 4> Chains(NumValues);
2929 MVT PtrVT = Ptr.getValueType();
2930 bool isVolatile = I.isVolatile();
2931 unsigned Alignment = I.getAlignment();
2932 for (unsigned i = 0; i != NumValues; ++i)
2933 Chains[i] = DAG.getStore(Root, SDOperand(Src.Val, Src.ResNo + i),
2934 DAG.getNode(ISD::ADD, PtrVT, Ptr,
2935 DAG.getConstant(Offsets[i], PtrVT)),
2937 isVolatile, Alignment);
2939 DAG.setRoot(DAG.getNode(ISD::TokenFactor, MVT::Other, &Chains[0], NumValues));
2942 /// visitTargetIntrinsic - Lower a call of a target intrinsic to an INTRINSIC
2944 void SelectionDAGLowering::visitTargetIntrinsic(CallInst &I,
2945 unsigned Intrinsic) {
2946 bool HasChain = !I.doesNotAccessMemory();
2947 bool OnlyLoad = HasChain && I.onlyReadsMemory();
2949 // Build the operand list.
2950 SmallVector<SDOperand, 8> Ops;
2951 if (HasChain) { // If this intrinsic has side-effects, chainify it.
2953 // We don't need to serialize loads against other loads.
2954 Ops.push_back(DAG.getRoot());
2956 Ops.push_back(getRoot());
2960 // Add the intrinsic ID as an integer operand.
2961 Ops.push_back(DAG.getConstant(Intrinsic, TLI.getPointerTy()));
2963 // Add all operands of the call to the operand list.
2964 for (unsigned i = 1, e = I.getNumOperands(); i != e; ++i) {
2965 SDOperand Op = getValue(I.getOperand(i));
2966 assert(TLI.isTypeLegal(Op.getValueType()) &&
2967 "Intrinsic uses a non-legal type?");
2971 std::vector<MVT> VTs;
2972 if (I.getType() != Type::VoidTy) {
2973 MVT VT = TLI.getValueType(I.getType());
2974 if (VT.isVector()) {
2975 const VectorType *DestTy = cast<VectorType>(I.getType());
2976 MVT EltVT = TLI.getValueType(DestTy->getElementType());
2978 VT = MVT::getVectorVT(EltVT, DestTy->getNumElements());
2979 assert(VT != MVT::Other && "Intrinsic uses a non-legal type?");
2982 assert(TLI.isTypeLegal(VT) && "Intrinsic uses a non-legal type?");
2986 VTs.push_back(MVT::Other);
2988 const MVT *VTList = DAG.getNodeValueTypes(VTs);
2993 Result = DAG.getNode(ISD::INTRINSIC_WO_CHAIN, VTList, VTs.size(),
2994 &Ops[0], Ops.size());
2995 else if (I.getType() != Type::VoidTy)
2996 Result = DAG.getNode(ISD::INTRINSIC_W_CHAIN, VTList, VTs.size(),
2997 &Ops[0], Ops.size());
2999 Result = DAG.getNode(ISD::INTRINSIC_VOID, VTList, VTs.size(),
3000 &Ops[0], Ops.size());
3003 SDOperand Chain = Result.getValue(Result.Val->getNumValues()-1);
3005 PendingLoads.push_back(Chain);
3009 if (I.getType() != Type::VoidTy) {
3010 if (const VectorType *PTy = dyn_cast<VectorType>(I.getType())) {
3011 MVT VT = TLI.getValueType(PTy);
3012 Result = DAG.getNode(ISD::BIT_CONVERT, VT, Result);
3014 setValue(&I, Result);
3018 /// ExtractTypeInfo - Returns the type info, possibly bitcast, encoded in V.
3019 static GlobalVariable *ExtractTypeInfo (Value *V) {
3020 V = V->stripPointerCasts();
3021 GlobalVariable *GV = dyn_cast<GlobalVariable>(V);
3022 assert ((GV || isa<ConstantPointerNull>(V)) &&
3023 "TypeInfo must be a global variable or NULL");
3027 /// addCatchInfo - Extract the personality and type infos from an eh.selector
3028 /// call, and add them to the specified machine basic block.
3029 static void addCatchInfo(CallInst &I, MachineModuleInfo *MMI,
3030 MachineBasicBlock *MBB) {
3031 // Inform the MachineModuleInfo of the personality for this landing pad.
3032 ConstantExpr *CE = cast<ConstantExpr>(I.getOperand(2));
3033 assert(CE->getOpcode() == Instruction::BitCast &&
3034 isa<Function>(CE->getOperand(0)) &&
3035 "Personality should be a function");
3036 MMI->addPersonality(MBB, cast<Function>(CE->getOperand(0)));
3038 // Gather all the type infos for this landing pad and pass them along to
3039 // MachineModuleInfo.
3040 std::vector<GlobalVariable *> TyInfo;
3041 unsigned N = I.getNumOperands();
3043 for (unsigned i = N - 1; i > 2; --i) {
3044 if (ConstantInt *CI = dyn_cast<ConstantInt>(I.getOperand(i))) {
3045 unsigned FilterLength = CI->getZExtValue();
3046 unsigned FirstCatch = i + FilterLength + !FilterLength;
3047 assert (FirstCatch <= N && "Invalid filter length");
3049 if (FirstCatch < N) {
3050 TyInfo.reserve(N - FirstCatch);
3051 for (unsigned j = FirstCatch; j < N; ++j)
3052 TyInfo.push_back(ExtractTypeInfo(I.getOperand(j)));
3053 MMI->addCatchTypeInfo(MBB, TyInfo);
3057 if (!FilterLength) {
3059 MMI->addCleanup(MBB);
3062 TyInfo.reserve(FilterLength - 1);
3063 for (unsigned j = i + 1; j < FirstCatch; ++j)
3064 TyInfo.push_back(ExtractTypeInfo(I.getOperand(j)));
3065 MMI->addFilterTypeInfo(MBB, TyInfo);
3074 TyInfo.reserve(N - 3);
3075 for (unsigned j = 3; j < N; ++j)
3076 TyInfo.push_back(ExtractTypeInfo(I.getOperand(j)));
3077 MMI->addCatchTypeInfo(MBB, TyInfo);
3082 /// Inlined utility function to implement binary input atomic intrinsics for
3083 // visitIntrinsicCall: I is a call instruction
3084 // Op is the associated NodeType for I
3086 SelectionDAGLowering::implVisitBinaryAtomic(CallInst& I, ISD::NodeType Op) {
3087 SDOperand Root = getRoot();
3088 SDOperand O2 = getValue(I.getOperand(2));
3089 SDOperand L = DAG.getAtomic(Op, Root,
3090 getValue(I.getOperand(1)),
3091 O2, O2.getValueType());
3093 DAG.setRoot(L.getValue(1));
3097 /// visitIntrinsicCall - Lower the call to the specified intrinsic function. If
3098 /// we want to emit this as a call to a named external function, return the name
3099 /// otherwise lower it and return null.
3101 SelectionDAGLowering::visitIntrinsicCall(CallInst &I, unsigned Intrinsic) {
3102 switch (Intrinsic) {
3104 // By default, turn this into a target intrinsic node.
3105 visitTargetIntrinsic(I, Intrinsic);
3107 case Intrinsic::vastart: visitVAStart(I); return 0;
3108 case Intrinsic::vaend: visitVAEnd(I); return 0;
3109 case Intrinsic::vacopy: visitVACopy(I); return 0;
3110 case Intrinsic::returnaddress:
3111 setValue(&I, DAG.getNode(ISD::RETURNADDR, TLI.getPointerTy(),
3112 getValue(I.getOperand(1))));
3114 case Intrinsic::frameaddress:
3115 setValue(&I, DAG.getNode(ISD::FRAMEADDR, TLI.getPointerTy(),
3116 getValue(I.getOperand(1))));
3118 case Intrinsic::setjmp:
3119 return "_setjmp"+!TLI.usesUnderscoreSetJmp();
3121 case Intrinsic::longjmp:
3122 return "_longjmp"+!TLI.usesUnderscoreLongJmp();
3124 case Intrinsic::memcpy_i32:
3125 case Intrinsic::memcpy_i64: {
3126 SDOperand Op1 = getValue(I.getOperand(1));
3127 SDOperand Op2 = getValue(I.getOperand(2));
3128 SDOperand Op3 = getValue(I.getOperand(3));
3129 unsigned Align = cast<ConstantInt>(I.getOperand(4))->getZExtValue();
3130 DAG.setRoot(DAG.getMemcpy(getRoot(), Op1, Op2, Op3, Align, false,
3131 I.getOperand(1), 0, I.getOperand(2), 0));
3134 case Intrinsic::memset_i32:
3135 case Intrinsic::memset_i64: {
3136 SDOperand Op1 = getValue(I.getOperand(1));
3137 SDOperand Op2 = getValue(I.getOperand(2));
3138 SDOperand Op3 = getValue(I.getOperand(3));
3139 unsigned Align = cast<ConstantInt>(I.getOperand(4))->getZExtValue();
3140 DAG.setRoot(DAG.getMemset(getRoot(), Op1, Op2, Op3, Align,
3141 I.getOperand(1), 0));
3144 case Intrinsic::memmove_i32:
3145 case Intrinsic::memmove_i64: {
3146 SDOperand Op1 = getValue(I.getOperand(1));
3147 SDOperand Op2 = getValue(I.getOperand(2));
3148 SDOperand Op3 = getValue(I.getOperand(3));
3149 unsigned Align = cast<ConstantInt>(I.getOperand(4))->getZExtValue();
3151 // If the source and destination are known to not be aliases, we can
3152 // lower memmove as memcpy.
3153 uint64_t Size = -1ULL;
3154 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op3))
3155 Size = C->getValue();
3156 if (AA.alias(I.getOperand(1), Size, I.getOperand(2), Size) ==
3157 AliasAnalysis::NoAlias) {
3158 DAG.setRoot(DAG.getMemcpy(getRoot(), Op1, Op2, Op3, Align, false,
3159 I.getOperand(1), 0, I.getOperand(2), 0));
3163 DAG.setRoot(DAG.getMemmove(getRoot(), Op1, Op2, Op3, Align,
3164 I.getOperand(1), 0, I.getOperand(2), 0));
3167 case Intrinsic::dbg_stoppoint: {
3168 MachineModuleInfo *MMI = DAG.getMachineModuleInfo();
3169 DbgStopPointInst &SPI = cast<DbgStopPointInst>(I);
3170 if (MMI && SPI.getContext() && MMI->Verify(SPI.getContext())) {
3174 Ops[1] = getValue(SPI.getLineValue());
3175 Ops[2] = getValue(SPI.getColumnValue());
3177 DebugInfoDesc *DD = MMI->getDescFor(SPI.getContext());
3178 assert(DD && "Not a debug information descriptor");
3179 CompileUnitDesc *CompileUnit = cast<CompileUnitDesc>(DD);
3181 Ops[3] = DAG.getString(CompileUnit->getFileName());
3182 Ops[4] = DAG.getString(CompileUnit->getDirectory());
3184 DAG.setRoot(DAG.getNode(ISD::LOCATION, MVT::Other, Ops, 5));
3189 case Intrinsic::dbg_region_start: {
3190 MachineModuleInfo *MMI = DAG.getMachineModuleInfo();
3191 DbgRegionStartInst &RSI = cast<DbgRegionStartInst>(I);
3192 if (MMI && RSI.getContext() && MMI->Verify(RSI.getContext())) {
3193 unsigned LabelID = MMI->RecordRegionStart(RSI.getContext());
3194 DAG.setRoot(DAG.getNode(ISD::LABEL, MVT::Other, getRoot(),
3195 DAG.getConstant(LabelID, MVT::i32),
3196 DAG.getConstant(0, MVT::i32)));
3201 case Intrinsic::dbg_region_end: {
3202 MachineModuleInfo *MMI = DAG.getMachineModuleInfo();
3203 DbgRegionEndInst &REI = cast<DbgRegionEndInst>(I);
3204 if (MMI && REI.getContext() && MMI->Verify(REI.getContext())) {
3205 unsigned LabelID = MMI->RecordRegionEnd(REI.getContext());
3206 DAG.setRoot(DAG.getNode(ISD::LABEL, MVT::Other, getRoot(),
3207 DAG.getConstant(LabelID, MVT::i32),
3208 DAG.getConstant(0, MVT::i32)));
3213 case Intrinsic::dbg_func_start: {
3214 MachineModuleInfo *MMI = DAG.getMachineModuleInfo();
3216 DbgFuncStartInst &FSI = cast<DbgFuncStartInst>(I);
3217 Value *SP = FSI.getSubprogram();
3218 if (SP && MMI->Verify(SP)) {
3219 // llvm.dbg.func.start implicitly defines a dbg_stoppoint which is
3220 // what (most?) gdb expects.
3221 DebugInfoDesc *DD = MMI->getDescFor(SP);
3222 assert(DD && "Not a debug information descriptor");
3223 SubprogramDesc *Subprogram = cast<SubprogramDesc>(DD);
3224 const CompileUnitDesc *CompileUnit = Subprogram->getFile();
3225 unsigned SrcFile = MMI->RecordSource(CompileUnit->getDirectory(),
3226 CompileUnit->getFileName());
3227 // Record the source line but does create a label. It will be emitted
3228 // at asm emission time.
3229 MMI->RecordSourceLine(Subprogram->getLine(), 0, SrcFile);
3234 case Intrinsic::dbg_declare: {
3235 MachineModuleInfo *MMI = DAG.getMachineModuleInfo();
3236 DbgDeclareInst &DI = cast<DbgDeclareInst>(I);
3237 Value *Variable = DI.getVariable();
3238 if (MMI && Variable && MMI->Verify(Variable))
3239 DAG.setRoot(DAG.getNode(ISD::DECLARE, MVT::Other, getRoot(),
3240 getValue(DI.getAddress()), getValue(Variable)));
3244 case Intrinsic::eh_exception: {
3245 if (!CurMBB->isLandingPad()) {
3246 // FIXME: Mark exception register as live in. Hack for PR1508.
3247 unsigned Reg = TLI.getExceptionAddressRegister();
3248 if (Reg) CurMBB->addLiveIn(Reg);
3250 // Insert the EXCEPTIONADDR instruction.
3251 SDVTList VTs = DAG.getVTList(TLI.getPointerTy(), MVT::Other);
3253 Ops[0] = DAG.getRoot();
3254 SDOperand Op = DAG.getNode(ISD::EXCEPTIONADDR, VTs, Ops, 1);
3256 DAG.setRoot(Op.getValue(1));
3260 case Intrinsic::eh_selector_i32:
3261 case Intrinsic::eh_selector_i64: {
3262 MachineModuleInfo *MMI = DAG.getMachineModuleInfo();
3263 MVT VT = (Intrinsic == Intrinsic::eh_selector_i32 ?
3264 MVT::i32 : MVT::i64);
3267 if (CurMBB->isLandingPad())
3268 addCatchInfo(I, MMI, CurMBB);
3271 FuncInfo.CatchInfoLost.insert(&I);
3273 // FIXME: Mark exception selector register as live in. Hack for PR1508.
3274 unsigned Reg = TLI.getExceptionSelectorRegister();
3275 if (Reg) CurMBB->addLiveIn(Reg);
3278 // Insert the EHSELECTION instruction.
3279 SDVTList VTs = DAG.getVTList(VT, MVT::Other);
3281 Ops[0] = getValue(I.getOperand(1));
3283 SDOperand Op = DAG.getNode(ISD::EHSELECTION, VTs, Ops, 2);
3285 DAG.setRoot(Op.getValue(1));
3287 setValue(&I, DAG.getConstant(0, VT));
3293 case Intrinsic::eh_typeid_for_i32:
3294 case Intrinsic::eh_typeid_for_i64: {
3295 MachineModuleInfo *MMI = DAG.getMachineModuleInfo();
3296 MVT VT = (Intrinsic == Intrinsic::eh_typeid_for_i32 ?
3297 MVT::i32 : MVT::i64);
3300 // Find the type id for the given typeinfo.
3301 GlobalVariable *GV = ExtractTypeInfo(I.getOperand(1));
3303 unsigned TypeID = MMI->getTypeIDFor(GV);
3304 setValue(&I, DAG.getConstant(TypeID, VT));
3306 // Return something different to eh_selector.
3307 setValue(&I, DAG.getConstant(1, VT));
3313 case Intrinsic::eh_return: {
3314 MachineModuleInfo *MMI = DAG.getMachineModuleInfo();
3317 MMI->setCallsEHReturn(true);
3318 DAG.setRoot(DAG.getNode(ISD::EH_RETURN,
3321 getValue(I.getOperand(1)),
3322 getValue(I.getOperand(2))));
3324 setValue(&I, DAG.getConstant(0, TLI.getPointerTy()));
3330 case Intrinsic::eh_unwind_init: {
3331 if (MachineModuleInfo *MMI = DAG.getMachineModuleInfo()) {
3332 MMI->setCallsUnwindInit(true);
3338 case Intrinsic::eh_dwarf_cfa: {
3339 MVT VT = getValue(I.getOperand(1)).getValueType();
3341 if (VT.bitsGT(TLI.getPointerTy()))
3342 CfaArg = DAG.getNode(ISD::TRUNCATE,
3343 TLI.getPointerTy(), getValue(I.getOperand(1)));
3345 CfaArg = DAG.getNode(ISD::SIGN_EXTEND,
3346 TLI.getPointerTy(), getValue(I.getOperand(1)));
3348 SDOperand Offset = DAG.getNode(ISD::ADD,
3350 DAG.getNode(ISD::FRAME_TO_ARGS_OFFSET,
3351 TLI.getPointerTy()),
3353 setValue(&I, DAG.getNode(ISD::ADD,
3355 DAG.getNode(ISD::FRAMEADDR,
3358 TLI.getPointerTy())),
3363 case Intrinsic::sqrt:
3364 setValue(&I, DAG.getNode(ISD::FSQRT,
3365 getValue(I.getOperand(1)).getValueType(),
3366 getValue(I.getOperand(1))));
3368 case Intrinsic::powi:
3369 setValue(&I, DAG.getNode(ISD::FPOWI,
3370 getValue(I.getOperand(1)).getValueType(),
3371 getValue(I.getOperand(1)),
3372 getValue(I.getOperand(2))));
3374 case Intrinsic::sin:
3375 setValue(&I, DAG.getNode(ISD::FSIN,
3376 getValue(I.getOperand(1)).getValueType(),
3377 getValue(I.getOperand(1))));
3379 case Intrinsic::cos:
3380 setValue(&I, DAG.getNode(ISD::FCOS,
3381 getValue(I.getOperand(1)).getValueType(),
3382 getValue(I.getOperand(1))));
3384 case Intrinsic::pow:
3385 setValue(&I, DAG.getNode(ISD::FPOW,
3386 getValue(I.getOperand(1)).getValueType(),
3387 getValue(I.getOperand(1)),
3388 getValue(I.getOperand(2))));
3390 case Intrinsic::pcmarker: {
3391 SDOperand Tmp = getValue(I.getOperand(1));
3392 DAG.setRoot(DAG.getNode(ISD::PCMARKER, MVT::Other, getRoot(), Tmp));
3395 case Intrinsic::readcyclecounter: {
3396 SDOperand Op = getRoot();
3397 SDOperand Tmp = DAG.getNode(ISD::READCYCLECOUNTER,
3398 DAG.getNodeValueTypes(MVT::i64, MVT::Other), 2,
3401 DAG.setRoot(Tmp.getValue(1));
3404 case Intrinsic::part_select: {
3405 // Currently not implemented: just abort
3406 assert(0 && "part_select intrinsic not implemented");
3409 case Intrinsic::part_set: {
3410 // Currently not implemented: just abort
3411 assert(0 && "part_set intrinsic not implemented");
3414 case Intrinsic::bswap:
3415 setValue(&I, DAG.getNode(ISD::BSWAP,
3416 getValue(I.getOperand(1)).getValueType(),
3417 getValue(I.getOperand(1))));
3419 case Intrinsic::cttz: {
3420 SDOperand Arg = getValue(I.getOperand(1));
3421 MVT Ty = Arg.getValueType();
3422 SDOperand result = DAG.getNode(ISD::CTTZ, Ty, Arg);
3423 setValue(&I, result);
3426 case Intrinsic::ctlz: {
3427 SDOperand Arg = getValue(I.getOperand(1));
3428 MVT Ty = Arg.getValueType();
3429 SDOperand result = DAG.getNode(ISD::CTLZ, Ty, Arg);
3430 setValue(&I, result);
3433 case Intrinsic::ctpop: {
3434 SDOperand Arg = getValue(I.getOperand(1));
3435 MVT Ty = Arg.getValueType();
3436 SDOperand result = DAG.getNode(ISD::CTPOP, Ty, Arg);
3437 setValue(&I, result);
3440 case Intrinsic::stacksave: {
3441 SDOperand Op = getRoot();
3442 SDOperand Tmp = DAG.getNode(ISD::STACKSAVE,
3443 DAG.getNodeValueTypes(TLI.getPointerTy(), MVT::Other), 2, &Op, 1);
3445 DAG.setRoot(Tmp.getValue(1));
3448 case Intrinsic::stackrestore: {
3449 SDOperand Tmp = getValue(I.getOperand(1));
3450 DAG.setRoot(DAG.getNode(ISD::STACKRESTORE, MVT::Other, getRoot(), Tmp));
3453 case Intrinsic::var_annotation:
3454 // Discard annotate attributes
3457 case Intrinsic::init_trampoline: {
3458 const Function *F = cast<Function>(I.getOperand(2)->stripPointerCasts());
3462 Ops[1] = getValue(I.getOperand(1));
3463 Ops[2] = getValue(I.getOperand(2));
3464 Ops[3] = getValue(I.getOperand(3));
3465 Ops[4] = DAG.getSrcValue(I.getOperand(1));
3466 Ops[5] = DAG.getSrcValue(F);
3468 SDOperand Tmp = DAG.getNode(ISD::TRAMPOLINE,
3469 DAG.getNodeValueTypes(TLI.getPointerTy(),
3474 DAG.setRoot(Tmp.getValue(1));
3478 case Intrinsic::gcroot:
3480 Value *Alloca = I.getOperand(1);
3481 Constant *TypeMap = cast<Constant>(I.getOperand(2));
3483 FrameIndexSDNode *FI = cast<FrameIndexSDNode>(getValue(Alloca).Val);
3484 GCI->addStackRoot(FI->getIndex(), TypeMap);
3488 case Intrinsic::gcread:
3489 case Intrinsic::gcwrite:
3490 assert(0 && "Collector failed to lower gcread/gcwrite intrinsics!");
3493 case Intrinsic::flt_rounds: {
3494 setValue(&I, DAG.getNode(ISD::FLT_ROUNDS_, MVT::i32));
3498 case Intrinsic::trap: {
3499 DAG.setRoot(DAG.getNode(ISD::TRAP, MVT::Other, getRoot()));
3502 case Intrinsic::prefetch: {
3505 Ops[1] = getValue(I.getOperand(1));
3506 Ops[2] = getValue(I.getOperand(2));
3507 Ops[3] = getValue(I.getOperand(3));
3508 DAG.setRoot(DAG.getNode(ISD::PREFETCH, MVT::Other, &Ops[0], 4));
3512 case Intrinsic::memory_barrier: {
3515 for (int x = 1; x < 6; ++x)
3516 Ops[x] = getValue(I.getOperand(x));
3518 DAG.setRoot(DAG.getNode(ISD::MEMBARRIER, MVT::Other, &Ops[0], 6));
3521 case Intrinsic::atomic_lcs: {
3522 SDOperand Root = getRoot();
3523 SDOperand O3 = getValue(I.getOperand(3));
3524 SDOperand L = DAG.getAtomic(ISD::ATOMIC_LCS, Root,
3525 getValue(I.getOperand(1)),
3526 getValue(I.getOperand(2)),
3527 O3, O3.getValueType());
3529 DAG.setRoot(L.getValue(1));
3532 case Intrinsic::atomic_las:
3533 return implVisitBinaryAtomic(I, ISD::ATOMIC_LAS);
3534 case Intrinsic::atomic_lss:
3535 return implVisitBinaryAtomic(I, ISD::ATOMIC_LSS);
3536 case Intrinsic::atomic_load_and:
3537 return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_AND);
3538 case Intrinsic::atomic_load_or:
3539 return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_OR);
3540 case Intrinsic::atomic_load_xor:
3541 return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_XOR);
3542 case Intrinsic::atomic_load_nand:
3543 return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_NAND);
3544 case Intrinsic::atomic_load_min:
3545 return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_MIN);
3546 case Intrinsic::atomic_load_max:
3547 return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_MAX);
3548 case Intrinsic::atomic_load_umin:
3549 return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_UMIN);
3550 case Intrinsic::atomic_load_umax:
3551 return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_UMAX);
3552 case Intrinsic::atomic_swap:
3553 return implVisitBinaryAtomic(I, ISD::ATOMIC_SWAP);
3558 void SelectionDAGLowering::LowerCallTo(CallSite CS, SDOperand Callee,
3560 MachineBasicBlock *LandingPad) {
3561 const PointerType *PT = cast<PointerType>(CS.getCalledValue()->getType());
3562 const FunctionType *FTy = cast<FunctionType>(PT->getElementType());
3563 MachineModuleInfo *MMI = DAG.getMachineModuleInfo();
3564 unsigned BeginLabel = 0, EndLabel = 0;
3566 TargetLowering::ArgListTy Args;
3567 TargetLowering::ArgListEntry Entry;
3568 Args.reserve(CS.arg_size());
3569 for (CallSite::arg_iterator i = CS.arg_begin(), e = CS.arg_end();
3571 SDOperand ArgNode = getValue(*i);
3572 Entry.Node = ArgNode; Entry.Ty = (*i)->getType();
3574 unsigned attrInd = i - CS.arg_begin() + 1;
3575 Entry.isSExt = CS.paramHasAttr(attrInd, ParamAttr::SExt);
3576 Entry.isZExt = CS.paramHasAttr(attrInd, ParamAttr::ZExt);
3577 Entry.isInReg = CS.paramHasAttr(attrInd, ParamAttr::InReg);
3578 Entry.isSRet = CS.paramHasAttr(attrInd, ParamAttr::StructRet);
3579 Entry.isNest = CS.paramHasAttr(attrInd, ParamAttr::Nest);
3580 Entry.isByVal = CS.paramHasAttr(attrInd, ParamAttr::ByVal);
3581 Entry.Alignment = CS.getParamAlignment(attrInd);
3582 Args.push_back(Entry);
3585 if (LandingPad && MMI) {
3586 // Insert a label before the invoke call to mark the try range. This can be
3587 // used to detect deletion of the invoke via the MachineModuleInfo.
3588 BeginLabel = MMI->NextLabelID();
3589 // Both PendingLoads and PendingExports must be flushed here;
3590 // this call might not return.
3592 DAG.setRoot(DAG.getNode(ISD::LABEL, MVT::Other, getControlRoot(),
3593 DAG.getConstant(BeginLabel, MVT::i32),
3594 DAG.getConstant(1, MVT::i32)));
3597 std::pair<SDOperand,SDOperand> Result =
3598 TLI.LowerCallTo(getRoot(), CS.getType(),
3599 CS.paramHasAttr(0, ParamAttr::SExt),
3600 CS.paramHasAttr(0, ParamAttr::ZExt),
3601 FTy->isVarArg(), CS.getCallingConv(), IsTailCall,
3603 if (CS.getType() != Type::VoidTy)
3604 setValue(CS.getInstruction(), Result.first);
3605 DAG.setRoot(Result.second);
3607 if (LandingPad && MMI) {
3608 // Insert a label at the end of the invoke call to mark the try range. This
3609 // can be used to detect deletion of the invoke via the MachineModuleInfo.
3610 EndLabel = MMI->NextLabelID();
3611 DAG.setRoot(DAG.getNode(ISD::LABEL, MVT::Other, getRoot(),
3612 DAG.getConstant(EndLabel, MVT::i32),
3613 DAG.getConstant(1, MVT::i32)));
3615 // Inform MachineModuleInfo of range.
3616 MMI->addInvoke(LandingPad, BeginLabel, EndLabel);
3621 void SelectionDAGLowering::visitCall(CallInst &I) {
3622 const char *RenameFn = 0;
3623 if (Function *F = I.getCalledFunction()) {
3624 if (F->isDeclaration()) {
3625 if (unsigned IID = F->getIntrinsicID()) {
3626 RenameFn = visitIntrinsicCall(I, IID);
3632 // Check for well-known libc/libm calls. If the function is internal, it
3633 // can't be a library call.
3634 unsigned NameLen = F->getNameLen();
3635 if (!F->hasInternalLinkage() && NameLen) {
3636 const char *NameStr = F->getNameStart();
3637 if (NameStr[0] == 'c' &&
3638 ((NameLen == 8 && !strcmp(NameStr, "copysign")) ||
3639 (NameLen == 9 && !strcmp(NameStr, "copysignf")))) {
3640 if (I.getNumOperands() == 3 && // Basic sanity checks.
3641 I.getOperand(1)->getType()->isFloatingPoint() &&
3642 I.getType() == I.getOperand(1)->getType() &&
3643 I.getType() == I.getOperand(2)->getType()) {
3644 SDOperand LHS = getValue(I.getOperand(1));
3645 SDOperand RHS = getValue(I.getOperand(2));
3646 setValue(&I, DAG.getNode(ISD::FCOPYSIGN, LHS.getValueType(),
3650 } else if (NameStr[0] == 'f' &&
3651 ((NameLen == 4 && !strcmp(NameStr, "fabs")) ||
3652 (NameLen == 5 && !strcmp(NameStr, "fabsf")) ||
3653 (NameLen == 5 && !strcmp(NameStr, "fabsl")))) {
3654 if (I.getNumOperands() == 2 && // Basic sanity checks.
3655 I.getOperand(1)->getType()->isFloatingPoint() &&
3656 I.getType() == I.getOperand(1)->getType()) {
3657 SDOperand Tmp = getValue(I.getOperand(1));
3658 setValue(&I, DAG.getNode(ISD::FABS, Tmp.getValueType(), Tmp));
3661 } else if (NameStr[0] == 's' &&
3662 ((NameLen == 3 && !strcmp(NameStr, "sin")) ||
3663 (NameLen == 4 && !strcmp(NameStr, "sinf")) ||
3664 (NameLen == 4 && !strcmp(NameStr, "sinl")))) {
3665 if (I.getNumOperands() == 2 && // Basic sanity checks.
3666 I.getOperand(1)->getType()->isFloatingPoint() &&
3667 I.getType() == I.getOperand(1)->getType()) {
3668 SDOperand Tmp = getValue(I.getOperand(1));
3669 setValue(&I, DAG.getNode(ISD::FSIN, Tmp.getValueType(), Tmp));
3672 } else if (NameStr[0] == 'c' &&
3673 ((NameLen == 3 && !strcmp(NameStr, "cos")) ||
3674 (NameLen == 4 && !strcmp(NameStr, "cosf")) ||
3675 (NameLen == 4 && !strcmp(NameStr, "cosl")))) {
3676 if (I.getNumOperands() == 2 && // Basic sanity checks.
3677 I.getOperand(1)->getType()->isFloatingPoint() &&
3678 I.getType() == I.getOperand(1)->getType()) {
3679 SDOperand Tmp = getValue(I.getOperand(1));
3680 setValue(&I, DAG.getNode(ISD::FCOS, Tmp.getValueType(), Tmp));
3685 } else if (isa<InlineAsm>(I.getOperand(0))) {
3692 Callee = getValue(I.getOperand(0));
3694 Callee = DAG.getExternalSymbol(RenameFn, TLI.getPointerTy());
3696 LowerCallTo(&I, Callee, I.isTailCall());
3700 void SelectionDAGLowering::visitGetResult(GetResultInst &I) {
3701 if (isa<UndefValue>(I.getOperand(0))) {
3702 SDOperand Undef = DAG.getNode(ISD::UNDEF, TLI.getValueType(I.getType()));
3703 setValue(&I, Undef);
3707 // To add support for individual return values with aggregate types,
3708 // we'd need a way to take a getresult index and determine which
3709 // values of the Call SDNode are associated with it.
3710 assert(TLI.getValueType(I.getType(), true) != MVT::Other &&
3711 "Individual return values must not be aggregates!");
3713 SDOperand Call = getValue(I.getOperand(0));
3714 setValue(&I, SDOperand(Call.Val, I.getIndex()));
3718 /// getCopyFromRegs - Emit a series of CopyFromReg nodes that copies from
3719 /// this value and returns the result as a ValueVT value. This uses
3720 /// Chain/Flag as the input and updates them for the output Chain/Flag.
3721 /// If the Flag pointer is NULL, no flag is used.
3722 SDOperand RegsForValue::getCopyFromRegs(SelectionDAG &DAG,
3724 SDOperand *Flag) const {
3725 // Assemble the legal parts into the final values.
3726 SmallVector<SDOperand, 4> Values(ValueVTs.size());
3727 SmallVector<SDOperand, 8> Parts;
3728 for (unsigned Value = 0, Part = 0, e = ValueVTs.size(); Value != e; ++Value) {
3729 // Copy the legal parts from the registers.
3730 MVT ValueVT = ValueVTs[Value];
3731 unsigned NumRegs = TLI->getNumRegisters(ValueVT);
3732 MVT RegisterVT = RegVTs[Value];
3734 Parts.resize(NumRegs);
3735 for (unsigned i = 0; i != NumRegs; ++i) {
3738 P = DAG.getCopyFromReg(Chain, Regs[Part+i], RegisterVT);
3740 P = DAG.getCopyFromReg(Chain, Regs[Part+i], RegisterVT, *Flag);
3741 *Flag = P.getValue(2);
3743 Chain = P.getValue(1);
3745 // If the source register was virtual and if we know something about it,
3746 // add an assert node.
3747 if (TargetRegisterInfo::isVirtualRegister(Regs[Part+i]) &&
3748 RegisterVT.isInteger() && !RegisterVT.isVector()) {
3749 unsigned SlotNo = Regs[Part+i]-TargetRegisterInfo::FirstVirtualRegister;
3750 FunctionLoweringInfo &FLI = DAG.getFunctionLoweringInfo();
3751 if (FLI.LiveOutRegInfo.size() > SlotNo) {
3752 FunctionLoweringInfo::LiveOutInfo &LOI = FLI.LiveOutRegInfo[SlotNo];
3754 unsigned RegSize = RegisterVT.getSizeInBits();
3755 unsigned NumSignBits = LOI.NumSignBits;
3756 unsigned NumZeroBits = LOI.KnownZero.countLeadingOnes();
3758 // FIXME: We capture more information than the dag can represent. For
3759 // now, just use the tightest assertzext/assertsext possible.
3761 MVT FromVT(MVT::Other);
3762 if (NumSignBits == RegSize)
3763 isSExt = true, FromVT = MVT::i1; // ASSERT SEXT 1
3764 else if (NumZeroBits >= RegSize-1)
3765 isSExt = false, FromVT = MVT::i1; // ASSERT ZEXT 1
3766 else if (NumSignBits > RegSize-8)
3767 isSExt = true, FromVT = MVT::i8; // ASSERT SEXT 8
3768 else if (NumZeroBits >= RegSize-9)
3769 isSExt = false, FromVT = MVT::i8; // ASSERT ZEXT 8
3770 else if (NumSignBits > RegSize-16)
3771 isSExt = true, FromVT = MVT::i16; // ASSERT SEXT 16
3772 else if (NumZeroBits >= RegSize-17)
3773 isSExt = false, FromVT = MVT::i16; // ASSERT ZEXT 16
3774 else if (NumSignBits > RegSize-32)
3775 isSExt = true, FromVT = MVT::i32; // ASSERT SEXT 32
3776 else if (NumZeroBits >= RegSize-33)
3777 isSExt = false, FromVT = MVT::i32; // ASSERT ZEXT 32
3779 if (FromVT != MVT::Other) {
3780 P = DAG.getNode(isSExt ? ISD::AssertSext : ISD::AssertZext,
3781 RegisterVT, P, DAG.getValueType(FromVT));
3790 Values[Value] = getCopyFromParts(DAG, &Parts[Part], NumRegs, RegisterVT,
3795 if (ValueVTs.size() == 1)
3798 return DAG.getNode(ISD::MERGE_VALUES,
3799 DAG.getVTList(&ValueVTs[0], ValueVTs.size()),
3800 &Values[0], ValueVTs.size());
3803 /// getCopyToRegs - Emit a series of CopyToReg nodes that copies the
3804 /// specified value into the registers specified by this object. This uses
3805 /// Chain/Flag as the input and updates them for the output Chain/Flag.
3806 /// If the Flag pointer is NULL, no flag is used.
3807 void RegsForValue::getCopyToRegs(SDOperand Val, SelectionDAG &DAG,
3808 SDOperand &Chain, SDOperand *Flag) const {
3809 // Get the list of the values's legal parts.
3810 unsigned NumRegs = Regs.size();
3811 SmallVector<SDOperand, 8> Parts(NumRegs);
3812 for (unsigned Value = 0, Part = 0, e = ValueVTs.size(); Value != e; ++Value) {
3813 MVT ValueVT = ValueVTs[Value];
3814 unsigned NumParts = TLI->getNumRegisters(ValueVT);
3815 MVT RegisterVT = RegVTs[Value];
3817 getCopyToParts(DAG, Val.getValue(Val.ResNo + Value),
3818 &Parts[Part], NumParts, RegisterVT);
3822 // Copy the parts into the registers.
3823 SmallVector<SDOperand, 8> Chains(NumRegs);
3824 for (unsigned i = 0; i != NumRegs; ++i) {
3827 Part = DAG.getCopyToReg(Chain, Regs[i], Parts[i]);
3829 Part = DAG.getCopyToReg(Chain, Regs[i], Parts[i], *Flag);
3830 *Flag = Part.getValue(1);
3832 Chains[i] = Part.getValue(0);
3835 if (NumRegs == 1 || Flag)
3836 // If NumRegs > 1 && Flag is used then the use of the last CopyToReg is
3837 // flagged to it. That is the CopyToReg nodes and the user are considered
3838 // a single scheduling unit. If we create a TokenFactor and return it as
3839 // chain, then the TokenFactor is both a predecessor (operand) of the
3840 // user as well as a successor (the TF operands are flagged to the user).
3841 // c1, f1 = CopyToReg
3842 // c2, f2 = CopyToReg
3843 // c3 = TokenFactor c1, c2
3846 Chain = Chains[NumRegs-1];
3848 Chain = DAG.getNode(ISD::TokenFactor, MVT::Other, &Chains[0], NumRegs);
3851 /// AddInlineAsmOperands - Add this value to the specified inlineasm node
3852 /// operand list. This adds the code marker and includes the number of
3853 /// values added into it.
3854 void RegsForValue::AddInlineAsmOperands(unsigned Code, SelectionDAG &DAG,
3855 std::vector<SDOperand> &Ops) const {
3856 MVT IntPtrTy = DAG.getTargetLoweringInfo().getPointerTy();
3857 Ops.push_back(DAG.getTargetConstant(Code | (Regs.size() << 3), IntPtrTy));
3858 for (unsigned Value = 0, Reg = 0, e = ValueVTs.size(); Value != e; ++Value) {
3859 unsigned NumRegs = TLI->getNumRegisters(ValueVTs[Value]);
3860 MVT RegisterVT = RegVTs[Value];
3861 for (unsigned i = 0; i != NumRegs; ++i)
3862 Ops.push_back(DAG.getRegister(Regs[Reg++], RegisterVT));
3866 /// isAllocatableRegister - If the specified register is safe to allocate,
3867 /// i.e. it isn't a stack pointer or some other special register, return the
3868 /// register class for the register. Otherwise, return null.
3869 static const TargetRegisterClass *
3870 isAllocatableRegister(unsigned Reg, MachineFunction &MF,
3871 const TargetLowering &TLI,
3872 const TargetRegisterInfo *TRI) {
3873 MVT FoundVT = MVT::Other;
3874 const TargetRegisterClass *FoundRC = 0;
3875 for (TargetRegisterInfo::regclass_iterator RCI = TRI->regclass_begin(),
3876 E = TRI->regclass_end(); RCI != E; ++RCI) {
3877 MVT ThisVT = MVT::Other;
3879 const TargetRegisterClass *RC = *RCI;
3880 // If none of the the value types for this register class are valid, we
3881 // can't use it. For example, 64-bit reg classes on 32-bit targets.
3882 for (TargetRegisterClass::vt_iterator I = RC->vt_begin(), E = RC->vt_end();
3884 if (TLI.isTypeLegal(*I)) {
3885 // If we have already found this register in a different register class,
3886 // choose the one with the largest VT specified. For example, on
3887 // PowerPC, we favor f64 register classes over f32.
3888 if (FoundVT == MVT::Other || FoundVT.bitsLT(*I)) {
3895 if (ThisVT == MVT::Other) continue;
3897 // NOTE: This isn't ideal. In particular, this might allocate the
3898 // frame pointer in functions that need it (due to them not being taken
3899 // out of allocation, because a variable sized allocation hasn't been seen
3900 // yet). This is a slight code pessimization, but should still work.
3901 for (TargetRegisterClass::iterator I = RC->allocation_order_begin(MF),
3902 E = RC->allocation_order_end(MF); I != E; ++I)
3904 // We found a matching register class. Keep looking at others in case
3905 // we find one with larger registers that this physreg is also in.
3916 /// AsmOperandInfo - This contains information for each constraint that we are
3918 struct SDISelAsmOperandInfo : public TargetLowering::AsmOperandInfo {
3919 /// CallOperand - If this is the result output operand or a clobber
3920 /// this is null, otherwise it is the incoming operand to the CallInst.
3921 /// This gets modified as the asm is processed.
3922 SDOperand CallOperand;
3924 /// AssignedRegs - If this is a register or register class operand, this
3925 /// contains the set of register corresponding to the operand.
3926 RegsForValue AssignedRegs;
3928 explicit SDISelAsmOperandInfo(const InlineAsm::ConstraintInfo &info)
3929 : TargetLowering::AsmOperandInfo(info), CallOperand(0,0) {
3932 /// MarkAllocatedRegs - Once AssignedRegs is set, mark the assigned registers
3933 /// busy in OutputRegs/InputRegs.
3934 void MarkAllocatedRegs(bool isOutReg, bool isInReg,
3935 std::set<unsigned> &OutputRegs,
3936 std::set<unsigned> &InputRegs,
3937 const TargetRegisterInfo &TRI) const {
3939 for (unsigned i = 0, e = AssignedRegs.Regs.size(); i != e; ++i)
3940 MarkRegAndAliases(AssignedRegs.Regs[i], OutputRegs, TRI);
3943 for (unsigned i = 0, e = AssignedRegs.Regs.size(); i != e; ++i)
3944 MarkRegAndAliases(AssignedRegs.Regs[i], InputRegs, TRI);
3949 /// MarkRegAndAliases - Mark the specified register and all aliases in the
3951 static void MarkRegAndAliases(unsigned Reg, std::set<unsigned> &Regs,
3952 const TargetRegisterInfo &TRI) {
3953 assert(TargetRegisterInfo::isPhysicalRegister(Reg) && "Isn't a physreg");
3955 if (const unsigned *Aliases = TRI.getAliasSet(Reg))
3956 for (; *Aliases; ++Aliases)
3957 Regs.insert(*Aliases);
3960 } // end anon namespace.
3963 /// GetRegistersForValue - Assign registers (virtual or physical) for the
3964 /// specified operand. We prefer to assign virtual registers, to allow the
3965 /// register allocator handle the assignment process. However, if the asm uses
3966 /// features that we can't model on machineinstrs, we have SDISel do the
3967 /// allocation. This produces generally horrible, but correct, code.
3969 /// OpInfo describes the operand.
3970 /// HasEarlyClobber is true if there are any early clobber constraints (=&r)
3971 /// or any explicitly clobbered registers.
3972 /// Input and OutputRegs are the set of already allocated physical registers.
3974 void SelectionDAGLowering::
3975 GetRegistersForValue(SDISelAsmOperandInfo &OpInfo, bool HasEarlyClobber,
3976 std::set<unsigned> &OutputRegs,
3977 std::set<unsigned> &InputRegs) {
3978 // Compute whether this value requires an input register, an output register,
3980 bool isOutReg = false;
3981 bool isInReg = false;
3982 switch (OpInfo.Type) {
3983 case InlineAsm::isOutput:
3986 // If this is an early-clobber output, or if there is an input
3987 // constraint that matches this, we need to reserve the input register
3988 // so no other inputs allocate to it.
3989 isInReg = OpInfo.isEarlyClobber || OpInfo.hasMatchingInput;
3991 case InlineAsm::isInput:
3995 case InlineAsm::isClobber:
4002 MachineFunction &MF = DAG.getMachineFunction();
4003 SmallVector<unsigned, 4> Regs;
4005 // If this is a constraint for a single physreg, or a constraint for a
4006 // register class, find it.
4007 std::pair<unsigned, const TargetRegisterClass*> PhysReg =
4008 TLI.getRegForInlineAsmConstraint(OpInfo.ConstraintCode,
4009 OpInfo.ConstraintVT);
4011 unsigned NumRegs = 1;
4012 if (OpInfo.ConstraintVT != MVT::Other)
4013 NumRegs = TLI.getNumRegisters(OpInfo.ConstraintVT);
4015 MVT ValueVT = OpInfo.ConstraintVT;
4018 // If this is a constraint for a specific physical register, like {r17},
4020 if (PhysReg.first) {
4021 if (OpInfo.ConstraintVT == MVT::Other)
4022 ValueVT = *PhysReg.second->vt_begin();
4024 // Get the actual register value type. This is important, because the user
4025 // may have asked for (e.g.) the AX register in i32 type. We need to
4026 // remember that AX is actually i16 to get the right extension.
4027 RegVT = *PhysReg.second->vt_begin();
4029 // This is a explicit reference to a physical register.
4030 Regs.push_back(PhysReg.first);
4032 // If this is an expanded reference, add the rest of the regs to Regs.
4034 TargetRegisterClass::iterator I = PhysReg.second->begin();
4035 for (; *I != PhysReg.first; ++I)
4036 assert(I != PhysReg.second->end() && "Didn't find reg!");
4038 // Already added the first reg.
4040 for (; NumRegs; --NumRegs, ++I) {
4041 assert(I != PhysReg.second->end() && "Ran out of registers to allocate!");
4045 OpInfo.AssignedRegs = RegsForValue(TLI, Regs, RegVT, ValueVT);
4046 const TargetRegisterInfo *TRI = DAG.getTarget().getRegisterInfo();
4047 OpInfo.MarkAllocatedRegs(isOutReg, isInReg, OutputRegs, InputRegs, *TRI);
4051 // Otherwise, if this was a reference to an LLVM register class, create vregs
4052 // for this reference.
4053 std::vector<unsigned> RegClassRegs;
4054 const TargetRegisterClass *RC = PhysReg.second;
4056 // If this is an early clobber or tied register, our regalloc doesn't know
4057 // how to maintain the constraint. If it isn't, go ahead and create vreg
4058 // and let the regalloc do the right thing.
4059 if (!OpInfo.hasMatchingInput && !OpInfo.isEarlyClobber &&
4060 // If there is some other early clobber and this is an input register,
4061 // then we are forced to pre-allocate the input reg so it doesn't
4062 // conflict with the earlyclobber.
4063 !(OpInfo.Type == InlineAsm::isInput && HasEarlyClobber)) {
4064 RegVT = *PhysReg.second->vt_begin();
4066 if (OpInfo.ConstraintVT == MVT::Other)
4069 // Create the appropriate number of virtual registers.
4070 MachineRegisterInfo &RegInfo = MF.getRegInfo();
4071 for (; NumRegs; --NumRegs)
4072 Regs.push_back(RegInfo.createVirtualRegister(PhysReg.second));
4074 OpInfo.AssignedRegs = RegsForValue(TLI, Regs, RegVT, ValueVT);
4078 // Otherwise, we can't allocate it. Let the code below figure out how to
4079 // maintain these constraints.
4080 RegClassRegs.assign(PhysReg.second->begin(), PhysReg.second->end());
4083 // This is a reference to a register class that doesn't directly correspond
4084 // to an LLVM register class. Allocate NumRegs consecutive, available,
4085 // registers from the class.
4086 RegClassRegs = TLI.getRegClassForInlineAsmConstraint(OpInfo.ConstraintCode,
4087 OpInfo.ConstraintVT);
4090 const TargetRegisterInfo *TRI = DAG.getTarget().getRegisterInfo();
4091 unsigned NumAllocated = 0;
4092 for (unsigned i = 0, e = RegClassRegs.size(); i != e; ++i) {
4093 unsigned Reg = RegClassRegs[i];
4094 // See if this register is available.
4095 if ((isOutReg && OutputRegs.count(Reg)) || // Already used.
4096 (isInReg && InputRegs.count(Reg))) { // Already used.
4097 // Make sure we find consecutive registers.
4102 // Check to see if this register is allocatable (i.e. don't give out the
4105 RC = isAllocatableRegister(Reg, MF, TLI, TRI);
4106 if (!RC) { // Couldn't allocate this register.
4107 // Reset NumAllocated to make sure we return consecutive registers.
4113 // Okay, this register is good, we can use it.
4116 // If we allocated enough consecutive registers, succeed.
4117 if (NumAllocated == NumRegs) {
4118 unsigned RegStart = (i-NumAllocated)+1;
4119 unsigned RegEnd = i+1;
4120 // Mark all of the allocated registers used.
4121 for (unsigned i = RegStart; i != RegEnd; ++i)
4122 Regs.push_back(RegClassRegs[i]);
4124 OpInfo.AssignedRegs = RegsForValue(TLI, Regs, *RC->vt_begin(),
4125 OpInfo.ConstraintVT);
4126 OpInfo.MarkAllocatedRegs(isOutReg, isInReg, OutputRegs, InputRegs, *TRI);
4131 // Otherwise, we couldn't allocate enough registers for this.
4135 /// visitInlineAsm - Handle a call to an InlineAsm object.
4137 void SelectionDAGLowering::visitInlineAsm(CallSite CS) {
4138 InlineAsm *IA = cast<InlineAsm>(CS.getCalledValue());
4140 /// ConstraintOperands - Information about all of the constraints.
4141 std::vector<SDISelAsmOperandInfo> ConstraintOperands;
4143 SDOperand Chain = getRoot();
4146 std::set<unsigned> OutputRegs, InputRegs;
4148 // Do a prepass over the constraints, canonicalizing them, and building up the
4149 // ConstraintOperands list.
4150 std::vector<InlineAsm::ConstraintInfo>
4151 ConstraintInfos = IA->ParseConstraints();
4153 // SawEarlyClobber - Keep track of whether we saw an earlyclobber output
4154 // constraint. If so, we can't let the register allocator allocate any input
4155 // registers, because it will not know to avoid the earlyclobbered output reg.
4156 bool SawEarlyClobber = false;
4158 unsigned ArgNo = 0; // ArgNo - The argument of the CallInst.
4159 unsigned ResNo = 0; // ResNo - The result number of the next output.
4160 for (unsigned i = 0, e = ConstraintInfos.size(); i != e; ++i) {
4161 ConstraintOperands.push_back(SDISelAsmOperandInfo(ConstraintInfos[i]));
4162 SDISelAsmOperandInfo &OpInfo = ConstraintOperands.back();
4164 MVT OpVT = MVT::Other;
4166 // Compute the value type for each operand.
4167 switch (OpInfo.Type) {
4168 case InlineAsm::isOutput:
4169 // Indirect outputs just consume an argument.
4170 if (OpInfo.isIndirect) {
4171 OpInfo.CallOperandVal = CS.getArgument(ArgNo++);
4174 // The return value of the call is this value. As such, there is no
4175 // corresponding argument.
4176 assert(CS.getType() != Type::VoidTy && "Bad inline asm!");
4177 if (const StructType *STy = dyn_cast<StructType>(CS.getType())) {
4178 OpVT = TLI.getValueType(STy->getElementType(ResNo));
4180 assert(ResNo == 0 && "Asm only has one result!");
4181 OpVT = TLI.getValueType(CS.getType());
4185 case InlineAsm::isInput:
4186 OpInfo.CallOperandVal = CS.getArgument(ArgNo++);
4188 case InlineAsm::isClobber:
4193 // If this is an input or an indirect output, process the call argument.
4194 // BasicBlocks are labels, currently appearing only in asm's.
4195 if (OpInfo.CallOperandVal) {
4196 if (BasicBlock *BB = dyn_cast<BasicBlock>(OpInfo.CallOperandVal))
4197 OpInfo.CallOperand = DAG.getBasicBlock(FuncInfo.MBBMap[BB]);
4199 OpInfo.CallOperand = getValue(OpInfo.CallOperandVal);
4200 const Type *OpTy = OpInfo.CallOperandVal->getType();
4201 // If this is an indirect operand, the operand is a pointer to the
4203 if (OpInfo.isIndirect)
4204 OpTy = cast<PointerType>(OpTy)->getElementType();
4206 // If OpTy is not a single value, it may be a struct/union that we
4207 // can tile with integers.
4208 if (!OpTy->isSingleValueType() && OpTy->isSized()) {
4209 unsigned BitSize = TD->getTypeSizeInBits(OpTy);
4217 OpTy = IntegerType::get(BitSize);
4222 OpVT = TLI.getValueType(OpTy, true);
4226 OpInfo.ConstraintVT = OpVT;
4228 // Compute the constraint code and ConstraintType to use.
4229 TLI.ComputeConstraintToUse(OpInfo, OpInfo.CallOperand, &DAG);
4231 // Keep track of whether we see an earlyclobber.
4232 SawEarlyClobber |= OpInfo.isEarlyClobber;
4234 // If we see a clobber of a register, it is an early clobber.
4235 if (!SawEarlyClobber &&
4236 OpInfo.Type == InlineAsm::isClobber &&
4237 OpInfo.ConstraintType == TargetLowering::C_Register) {
4238 // Note that we want to ignore things that we don't trick here, like
4239 // dirflag, fpsr, flags, etc.
4240 std::pair<unsigned, const TargetRegisterClass*> PhysReg =
4241 TLI.getRegForInlineAsmConstraint(OpInfo.ConstraintCode,
4242 OpInfo.ConstraintVT);
4243 if (PhysReg.first || PhysReg.second) {
4244 // This is a register we know of.
4245 SawEarlyClobber = true;
4249 // If this is a memory input, and if the operand is not indirect, do what we
4250 // need to to provide an address for the memory input.
4251 if (OpInfo.ConstraintType == TargetLowering::C_Memory &&
4252 !OpInfo.isIndirect) {
4253 assert(OpInfo.Type == InlineAsm::isInput &&
4254 "Can only indirectify direct input operands!");
4256 // Memory operands really want the address of the value. If we don't have
4257 // an indirect input, put it in the constpool if we can, otherwise spill
4258 // it to a stack slot.
4260 // If the operand is a float, integer, or vector constant, spill to a
4261 // constant pool entry to get its address.
4262 Value *OpVal = OpInfo.CallOperandVal;
4263 if (isa<ConstantFP>(OpVal) || isa<ConstantInt>(OpVal) ||
4264 isa<ConstantVector>(OpVal)) {
4265 OpInfo.CallOperand = DAG.getConstantPool(cast<Constant>(OpVal),
4266 TLI.getPointerTy());
4268 // Otherwise, create a stack slot and emit a store to it before the
4270 const Type *Ty = OpVal->getType();
4271 uint64_t TySize = TLI.getTargetData()->getABITypeSize(Ty);
4272 unsigned Align = TLI.getTargetData()->getPrefTypeAlignment(Ty);
4273 MachineFunction &MF = DAG.getMachineFunction();
4274 int SSFI = MF.getFrameInfo()->CreateStackObject(TySize, Align);
4275 SDOperand StackSlot = DAG.getFrameIndex(SSFI, TLI.getPointerTy());
4276 Chain = DAG.getStore(Chain, OpInfo.CallOperand, StackSlot, NULL, 0);
4277 OpInfo.CallOperand = StackSlot;
4280 // There is no longer a Value* corresponding to this operand.
4281 OpInfo.CallOperandVal = 0;
4282 // It is now an indirect operand.
4283 OpInfo.isIndirect = true;
4286 // If this constraint is for a specific register, allocate it before
4288 if (OpInfo.ConstraintType == TargetLowering::C_Register)
4289 GetRegistersForValue(OpInfo, SawEarlyClobber, OutputRegs, InputRegs);
4291 ConstraintInfos.clear();
4294 // Second pass - Loop over all of the operands, assigning virtual or physregs
4295 // to registerclass operands.
4296 for (unsigned i = 0, e = ConstraintOperands.size(); i != e; ++i) {
4297 SDISelAsmOperandInfo &OpInfo = ConstraintOperands[i];
4299 // C_Register operands have already been allocated, Other/Memory don't need
4301 if (OpInfo.ConstraintType == TargetLowering::C_RegisterClass)
4302 GetRegistersForValue(OpInfo, SawEarlyClobber, OutputRegs, InputRegs);
4305 // AsmNodeOperands - The operands for the ISD::INLINEASM node.
4306 std::vector<SDOperand> AsmNodeOperands;
4307 AsmNodeOperands.push_back(SDOperand()); // reserve space for input chain
4308 AsmNodeOperands.push_back(
4309 DAG.getTargetExternalSymbol(IA->getAsmString().c_str(), MVT::Other));
4312 // Loop over all of the inputs, copying the operand values into the
4313 // appropriate registers and processing the output regs.
4314 RegsForValue RetValRegs;
4316 // IndirectStoresToEmit - The set of stores to emit after the inline asm node.
4317 std::vector<std::pair<RegsForValue, Value*> > IndirectStoresToEmit;
4319 for (unsigned i = 0, e = ConstraintOperands.size(); i != e; ++i) {
4320 SDISelAsmOperandInfo &OpInfo = ConstraintOperands[i];
4322 switch (OpInfo.Type) {
4323 case InlineAsm::isOutput: {
4324 if (OpInfo.ConstraintType != TargetLowering::C_RegisterClass &&
4325 OpInfo.ConstraintType != TargetLowering::C_Register) {
4326 // Memory output, or 'other' output (e.g. 'X' constraint).
4327 assert(OpInfo.isIndirect && "Memory output must be indirect operand");
4329 // Add information to the INLINEASM node to know about this output.
4330 unsigned ResOpType = 4/*MEM*/ | (1 << 3);
4331 AsmNodeOperands.push_back(DAG.getTargetConstant(ResOpType,
4332 TLI.getPointerTy()));
4333 AsmNodeOperands.push_back(OpInfo.CallOperand);
4337 // Otherwise, this is a register or register class output.
4339 // Copy the output from the appropriate register. Find a register that
4341 if (OpInfo.AssignedRegs.Regs.empty()) {
4342 cerr << "Couldn't allocate output reg for constraint '"
4343 << OpInfo.ConstraintCode << "'!\n";
4347 // If this is an indirect operand, store through the pointer after the
4349 if (OpInfo.isIndirect) {
4350 IndirectStoresToEmit.push_back(std::make_pair(OpInfo.AssignedRegs,
4351 OpInfo.CallOperandVal));
4353 // This is the result value of the call.
4354 assert(CS.getType() != Type::VoidTy && "Bad inline asm!");
4355 // Concatenate this output onto the outputs list.
4356 RetValRegs.append(OpInfo.AssignedRegs);
4359 // Add information to the INLINEASM node to know that this register is
4361 OpInfo.AssignedRegs.AddInlineAsmOperands(2 /*REGDEF*/, DAG,
4365 case InlineAsm::isInput: {
4366 SDOperand InOperandVal = OpInfo.CallOperand;
4368 if (isdigit(OpInfo.ConstraintCode[0])) { // Matching constraint?
4369 // If this is required to match an output register we have already set,
4370 // just use its register.
4371 unsigned OperandNo = atoi(OpInfo.ConstraintCode.c_str());
4373 // Scan until we find the definition we already emitted of this operand.
4374 // When we find it, create a RegsForValue operand.
4375 unsigned CurOp = 2; // The first operand.
4376 for (; OperandNo; --OperandNo) {
4377 // Advance to the next operand.
4379 cast<ConstantSDNode>(AsmNodeOperands[CurOp])->getValue();
4380 assert(((NumOps & 7) == 2 /*REGDEF*/ ||
4381 (NumOps & 7) == 4 /*MEM*/) &&
4382 "Skipped past definitions?");
4383 CurOp += (NumOps>>3)+1;
4387 cast<ConstantSDNode>(AsmNodeOperands[CurOp])->getValue();
4388 if ((NumOps & 7) == 2 /*REGDEF*/) {
4389 // Add NumOps>>3 registers to MatchedRegs.
4390 RegsForValue MatchedRegs;
4391 MatchedRegs.TLI = &TLI;
4392 MatchedRegs.ValueVTs.push_back(InOperandVal.getValueType());
4393 MatchedRegs.RegVTs.push_back(AsmNodeOperands[CurOp+1].getValueType());
4394 for (unsigned i = 0, e = NumOps>>3; i != e; ++i) {
4396 cast<RegisterSDNode>(AsmNodeOperands[++CurOp])->getReg();
4397 MatchedRegs.Regs.push_back(Reg);
4400 // Use the produced MatchedRegs object to
4401 MatchedRegs.getCopyToRegs(InOperandVal, DAG, Chain, &Flag);
4402 MatchedRegs.AddInlineAsmOperands(1 /*REGUSE*/, DAG, AsmNodeOperands);
4405 assert((NumOps & 7) == 4/*MEM*/ && "Unknown matching constraint!");
4406 assert((NumOps >> 3) == 1 && "Unexpected number of operands");
4407 // Add information to the INLINEASM node to know about this input.
4408 unsigned ResOpType = 4/*MEM*/ | (1 << 3);
4409 AsmNodeOperands.push_back(DAG.getTargetConstant(ResOpType,
4410 TLI.getPointerTy()));
4411 AsmNodeOperands.push_back(AsmNodeOperands[CurOp+1]);
4416 if (OpInfo.ConstraintType == TargetLowering::C_Other) {
4417 assert(!OpInfo.isIndirect &&
4418 "Don't know how to handle indirect other inputs yet!");
4420 std::vector<SDOperand> Ops;
4421 TLI.LowerAsmOperandForConstraint(InOperandVal, OpInfo.ConstraintCode[0],
4424 cerr << "Invalid operand for inline asm constraint '"
4425 << OpInfo.ConstraintCode << "'!\n";
4429 // Add information to the INLINEASM node to know about this input.
4430 unsigned ResOpType = 3 /*IMM*/ | (Ops.size() << 3);
4431 AsmNodeOperands.push_back(DAG.getTargetConstant(ResOpType,
4432 TLI.getPointerTy()));
4433 AsmNodeOperands.insert(AsmNodeOperands.end(), Ops.begin(), Ops.end());
4435 } else if (OpInfo.ConstraintType == TargetLowering::C_Memory) {
4436 assert(OpInfo.isIndirect && "Operand must be indirect to be a mem!");
4437 assert(InOperandVal.getValueType() == TLI.getPointerTy() &&
4438 "Memory operands expect pointer values");
4440 // Add information to the INLINEASM node to know about this input.
4441 unsigned ResOpType = 4/*MEM*/ | (1 << 3);
4442 AsmNodeOperands.push_back(DAG.getTargetConstant(ResOpType,
4443 TLI.getPointerTy()));
4444 AsmNodeOperands.push_back(InOperandVal);
4448 assert((OpInfo.ConstraintType == TargetLowering::C_RegisterClass ||
4449 OpInfo.ConstraintType == TargetLowering::C_Register) &&
4450 "Unknown constraint type!");
4451 assert(!OpInfo.isIndirect &&
4452 "Don't know how to handle indirect register inputs yet!");
4454 // Copy the input into the appropriate registers.
4455 assert(!OpInfo.AssignedRegs.Regs.empty() &&
4456 "Couldn't allocate input reg!");
4458 OpInfo.AssignedRegs.getCopyToRegs(InOperandVal, DAG, Chain, &Flag);
4460 OpInfo.AssignedRegs.AddInlineAsmOperands(1/*REGUSE*/, DAG,
4464 case InlineAsm::isClobber: {
4465 // Add the clobbered value to the operand list, so that the register
4466 // allocator is aware that the physreg got clobbered.
4467 if (!OpInfo.AssignedRegs.Regs.empty())
4468 OpInfo.AssignedRegs.AddInlineAsmOperands(2/*REGDEF*/, DAG,
4475 // Finish up input operands.
4476 AsmNodeOperands[0] = Chain;
4477 if (Flag.Val) AsmNodeOperands.push_back(Flag);
4479 Chain = DAG.getNode(ISD::INLINEASM,
4480 DAG.getNodeValueTypes(MVT::Other, MVT::Flag), 2,
4481 &AsmNodeOperands[0], AsmNodeOperands.size());
4482 Flag = Chain.getValue(1);
4484 // If this asm returns a register value, copy the result from that register
4485 // and set it as the value of the call.
4486 if (!RetValRegs.Regs.empty()) {
4487 SDOperand Val = RetValRegs.getCopyFromRegs(DAG, Chain, &Flag);
4489 // If any of the results of the inline asm is a vector, it may have the
4490 // wrong width/num elts. This can happen for register classes that can
4491 // contain multiple different value types. The preg or vreg allocated may
4492 // not have the same VT as was expected. Convert it to the right type with
4494 if (const StructType *ResSTy = dyn_cast<StructType>(CS.getType())) {
4495 for (unsigned i = 0, e = ResSTy->getNumElements(); i != e; ++i) {
4496 if (Val.Val->getValueType(i).isVector())
4497 Val = DAG.getNode(ISD::BIT_CONVERT,
4498 TLI.getValueType(ResSTy->getElementType(i)), Val);
4501 if (Val.getValueType().isVector())
4502 Val = DAG.getNode(ISD::BIT_CONVERT, TLI.getValueType(CS.getType()),
4506 setValue(CS.getInstruction(), Val);
4509 std::vector<std::pair<SDOperand, Value*> > StoresToEmit;
4511 // Process indirect outputs, first output all of the flagged copies out of
4513 for (unsigned i = 0, e = IndirectStoresToEmit.size(); i != e; ++i) {
4514 RegsForValue &OutRegs = IndirectStoresToEmit[i].first;
4515 Value *Ptr = IndirectStoresToEmit[i].second;
4516 SDOperand OutVal = OutRegs.getCopyFromRegs(DAG, Chain, &Flag);
4517 StoresToEmit.push_back(std::make_pair(OutVal, Ptr));
4520 // Emit the non-flagged stores from the physregs.
4521 SmallVector<SDOperand, 8> OutChains;
4522 for (unsigned i = 0, e = StoresToEmit.size(); i != e; ++i)
4523 OutChains.push_back(DAG.getStore(Chain, StoresToEmit[i].first,
4524 getValue(StoresToEmit[i].second),
4525 StoresToEmit[i].second, 0));
4526 if (!OutChains.empty())
4527 Chain = DAG.getNode(ISD::TokenFactor, MVT::Other,
4528 &OutChains[0], OutChains.size());
4533 void SelectionDAGLowering::visitMalloc(MallocInst &I) {
4534 SDOperand Src = getValue(I.getOperand(0));
4536 MVT IntPtr = TLI.getPointerTy();
4538 if (IntPtr.bitsLT(Src.getValueType()))
4539 Src = DAG.getNode(ISD::TRUNCATE, IntPtr, Src);
4540 else if (IntPtr.bitsGT(Src.getValueType()))
4541 Src = DAG.getNode(ISD::ZERO_EXTEND, IntPtr, Src);
4543 // Scale the source by the type size.
4544 uint64_t ElementSize = TD->getABITypeSize(I.getType()->getElementType());
4545 Src = DAG.getNode(ISD::MUL, Src.getValueType(),
4546 Src, DAG.getIntPtrConstant(ElementSize));
4548 TargetLowering::ArgListTy Args;
4549 TargetLowering::ArgListEntry Entry;
4551 Entry.Ty = TLI.getTargetData()->getIntPtrType();
4552 Args.push_back(Entry);
4554 std::pair<SDOperand,SDOperand> Result =
4555 TLI.LowerCallTo(getRoot(), I.getType(), false, false, false, CallingConv::C,
4556 true, DAG.getExternalSymbol("malloc", IntPtr), Args, DAG);
4557 setValue(&I, Result.first); // Pointers always fit in registers
4558 DAG.setRoot(Result.second);
4561 void SelectionDAGLowering::visitFree(FreeInst &I) {
4562 TargetLowering::ArgListTy Args;
4563 TargetLowering::ArgListEntry Entry;
4564 Entry.Node = getValue(I.getOperand(0));
4565 Entry.Ty = TLI.getTargetData()->getIntPtrType();
4566 Args.push_back(Entry);
4567 MVT IntPtr = TLI.getPointerTy();
4568 std::pair<SDOperand,SDOperand> Result =
4569 TLI.LowerCallTo(getRoot(), Type::VoidTy, false, false, false,
4570 CallingConv::C, true,
4571 DAG.getExternalSymbol("free", IntPtr), Args, DAG);
4572 DAG.setRoot(Result.second);
4575 // EmitInstrWithCustomInserter - This method should be implemented by targets
4576 // that mark instructions with the 'usesCustomDAGSchedInserter' flag. These
4577 // instructions are special in various ways, which require special support to
4578 // insert. The specified MachineInstr is created but not inserted into any
4579 // basic blocks, and the scheduler passes ownership of it to this method.
4580 MachineBasicBlock *TargetLowering::EmitInstrWithCustomInserter(MachineInstr *MI,
4581 MachineBasicBlock *MBB) {
4582 cerr << "If a target marks an instruction with "
4583 << "'usesCustomDAGSchedInserter', it must implement "
4584 << "TargetLowering::EmitInstrWithCustomInserter!\n";
4589 void SelectionDAGLowering::visitVAStart(CallInst &I) {
4590 DAG.setRoot(DAG.getNode(ISD::VASTART, MVT::Other, getRoot(),
4591 getValue(I.getOperand(1)),
4592 DAG.getSrcValue(I.getOperand(1))));
4595 void SelectionDAGLowering::visitVAArg(VAArgInst &I) {
4596 SDOperand V = DAG.getVAArg(TLI.getValueType(I.getType()), getRoot(),
4597 getValue(I.getOperand(0)),
4598 DAG.getSrcValue(I.getOperand(0)));
4600 DAG.setRoot(V.getValue(1));
4603 void SelectionDAGLowering::visitVAEnd(CallInst &I) {
4604 DAG.setRoot(DAG.getNode(ISD::VAEND, MVT::Other, getRoot(),
4605 getValue(I.getOperand(1)),
4606 DAG.getSrcValue(I.getOperand(1))));
4609 void SelectionDAGLowering::visitVACopy(CallInst &I) {
4610 DAG.setRoot(DAG.getNode(ISD::VACOPY, MVT::Other, getRoot(),
4611 getValue(I.getOperand(1)),
4612 getValue(I.getOperand(2)),
4613 DAG.getSrcValue(I.getOperand(1)),
4614 DAG.getSrcValue(I.getOperand(2))));
4617 /// TargetLowering::LowerArguments - This is the default LowerArguments
4618 /// implementation, which just inserts a FORMAL_ARGUMENTS node. FIXME: When all
4619 /// targets are migrated to using FORMAL_ARGUMENTS, this hook should be
4620 /// integrated into SDISel.
4621 std::vector<SDOperand>
4622 TargetLowering::LowerArguments(Function &F, SelectionDAG &DAG) {
4623 // Add CC# and isVararg as operands to the FORMAL_ARGUMENTS node.
4624 std::vector<SDOperand> Ops;
4625 Ops.push_back(DAG.getRoot());
4626 Ops.push_back(DAG.getConstant(F.getCallingConv(), getPointerTy()));
4627 Ops.push_back(DAG.getConstant(F.isVarArg(), getPointerTy()));
4629 // Add one result value for each formal argument.
4630 std::vector<MVT> RetVals;
4632 for (Function::arg_iterator I = F.arg_begin(), E = F.arg_end();
4634 SmallVector<MVT, 4> ValueVTs;
4635 ComputeValueVTs(*this, I->getType(), ValueVTs);
4636 for (unsigned Value = 0, NumValues = ValueVTs.size();
4637 Value != NumValues; ++Value) {
4638 MVT VT = ValueVTs[Value];
4639 const Type *ArgTy = VT.getTypeForMVT();
4640 ISD::ArgFlagsTy Flags;
4641 unsigned OriginalAlignment =
4642 getTargetData()->getABITypeAlignment(ArgTy);
4644 if (F.paramHasAttr(j, ParamAttr::ZExt))
4646 if (F.paramHasAttr(j, ParamAttr::SExt))
4648 if (F.paramHasAttr(j, ParamAttr::InReg))
4650 if (F.paramHasAttr(j, ParamAttr::StructRet))
4652 if (F.paramHasAttr(j, ParamAttr::ByVal)) {
4654 const PointerType *Ty = cast<PointerType>(I->getType());
4655 const Type *ElementTy = Ty->getElementType();
4656 unsigned FrameAlign = getByValTypeAlignment(ElementTy);
4657 unsigned FrameSize = getTargetData()->getABITypeSize(ElementTy);
4658 // For ByVal, alignment should be passed from FE. BE will guess if
4659 // this info is not there but there are cases it cannot get right.
4660 if (F.getParamAlignment(j))
4661 FrameAlign = F.getParamAlignment(j);
4662 Flags.setByValAlign(FrameAlign);
4663 Flags.setByValSize(FrameSize);
4665 if (F.paramHasAttr(j, ParamAttr::Nest))
4667 Flags.setOrigAlign(OriginalAlignment);
4669 MVT RegisterVT = getRegisterType(VT);
4670 unsigned NumRegs = getNumRegisters(VT);
4671 for (unsigned i = 0; i != NumRegs; ++i) {
4672 RetVals.push_back(RegisterVT);
4673 ISD::ArgFlagsTy MyFlags = Flags;
4674 if (NumRegs > 1 && i == 0)
4676 // if it isn't first piece, alignment must be 1
4678 MyFlags.setOrigAlign(1);
4679 Ops.push_back(DAG.getArgFlags(MyFlags));
4684 RetVals.push_back(MVT::Other);
4687 SDNode *Result = DAG.getNode(ISD::FORMAL_ARGUMENTS,
4688 DAG.getVTList(&RetVals[0], RetVals.size()),
4689 &Ops[0], Ops.size()).Val;
4691 // Prelower FORMAL_ARGUMENTS. This isn't required for functionality, but
4692 // allows exposing the loads that may be part of the argument access to the
4693 // first DAGCombiner pass.
4694 SDOperand TmpRes = LowerOperation(SDOperand(Result, 0), DAG);
4696 // The number of results should match up, except that the lowered one may have
4697 // an extra flag result.
4698 assert((Result->getNumValues() == TmpRes.Val->getNumValues() ||
4699 (Result->getNumValues()+1 == TmpRes.Val->getNumValues() &&
4700 TmpRes.getValue(Result->getNumValues()).getValueType() == MVT::Flag))
4701 && "Lowering produced unexpected number of results!");
4702 Result = TmpRes.Val;
4704 unsigned NumArgRegs = Result->getNumValues() - 1;
4705 DAG.setRoot(SDOperand(Result, NumArgRegs));
4707 // Set up the return result vector.
4711 for (Function::arg_iterator I = F.arg_begin(), E = F.arg_end(); I != E;
4713 SmallVector<MVT, 4> ValueVTs;
4714 ComputeValueVTs(*this, I->getType(), ValueVTs);
4715 for (unsigned Value = 0, NumValues = ValueVTs.size();
4716 Value != NumValues; ++Value) {
4717 MVT VT = ValueVTs[Value];
4718 MVT PartVT = getRegisterType(VT);
4720 unsigned NumParts = getNumRegisters(VT);
4721 SmallVector<SDOperand, 4> Parts(NumParts);
4722 for (unsigned j = 0; j != NumParts; ++j)
4723 Parts[j] = SDOperand(Result, i++);
4725 ISD::NodeType AssertOp = ISD::DELETED_NODE;
4726 if (F.paramHasAttr(Idx, ParamAttr::SExt))
4727 AssertOp = ISD::AssertSext;
4728 else if (F.paramHasAttr(Idx, ParamAttr::ZExt))
4729 AssertOp = ISD::AssertZext;
4731 Ops.push_back(getCopyFromParts(DAG, &Parts[0], NumParts, PartVT, VT,
4735 assert(i == NumArgRegs && "Argument register count mismatch!");
4740 /// TargetLowering::LowerCallTo - This is the default LowerCallTo
4741 /// implementation, which just inserts an ISD::CALL node, which is later custom
4742 /// lowered by the target to something concrete. FIXME: When all targets are
4743 /// migrated to using ISD::CALL, this hook should be integrated into SDISel.
4744 std::pair<SDOperand, SDOperand>
4745 TargetLowering::LowerCallTo(SDOperand Chain, const Type *RetTy,
4746 bool RetSExt, bool RetZExt, bool isVarArg,
4747 unsigned CallingConv, bool isTailCall,
4749 ArgListTy &Args, SelectionDAG &DAG) {
4750 SmallVector<SDOperand, 32> Ops;
4751 Ops.push_back(Chain); // Op#0 - Chain
4752 Ops.push_back(DAG.getConstant(CallingConv, getPointerTy())); // Op#1 - CC
4753 Ops.push_back(DAG.getConstant(isVarArg, getPointerTy())); // Op#2 - VarArg
4754 Ops.push_back(DAG.getConstant(isTailCall, getPointerTy())); // Op#3 - Tail
4755 Ops.push_back(Callee);
4757 // Handle all of the outgoing arguments.
4758 for (unsigned i = 0, e = Args.size(); i != e; ++i) {
4759 SmallVector<MVT, 4> ValueVTs;
4760 ComputeValueVTs(*this, Args[i].Ty, ValueVTs);
4761 for (unsigned Value = 0, NumValues = ValueVTs.size();
4762 Value != NumValues; ++Value) {
4763 MVT VT = ValueVTs[Value];
4764 const Type *ArgTy = VT.getTypeForMVT();
4765 SDOperand Op = SDOperand(Args[i].Node.Val, Args[i].Node.ResNo + Value);
4766 ISD::ArgFlagsTy Flags;
4767 unsigned OriginalAlignment =
4768 getTargetData()->getABITypeAlignment(ArgTy);
4774 if (Args[i].isInReg)
4778 if (Args[i].isByVal) {
4780 const PointerType *Ty = cast<PointerType>(Args[i].Ty);
4781 const Type *ElementTy = Ty->getElementType();
4782 unsigned FrameAlign = getByValTypeAlignment(ElementTy);
4783 unsigned FrameSize = getTargetData()->getABITypeSize(ElementTy);
4784 // For ByVal, alignment should come from FE. BE will guess if this
4785 // info is not there but there are cases it cannot get right.
4786 if (Args[i].Alignment)
4787 FrameAlign = Args[i].Alignment;
4788 Flags.setByValAlign(FrameAlign);
4789 Flags.setByValSize(FrameSize);
4793 Flags.setOrigAlign(OriginalAlignment);
4795 MVT PartVT = getRegisterType(VT);
4796 unsigned NumParts = getNumRegisters(VT);
4797 SmallVector<SDOperand, 4> Parts(NumParts);
4798 ISD::NodeType ExtendKind = ISD::ANY_EXTEND;
4801 ExtendKind = ISD::SIGN_EXTEND;
4802 else if (Args[i].isZExt)
4803 ExtendKind = ISD::ZERO_EXTEND;
4805 getCopyToParts(DAG, Op, &Parts[0], NumParts, PartVT, ExtendKind);
4807 for (unsigned i = 0; i != NumParts; ++i) {
4808 // if it isn't first piece, alignment must be 1
4809 ISD::ArgFlagsTy MyFlags = Flags;
4810 if (NumParts > 1 && i == 0)
4813 MyFlags.setOrigAlign(1);
4815 Ops.push_back(Parts[i]);
4816 Ops.push_back(DAG.getArgFlags(MyFlags));
4821 // Figure out the result value types. We start by making a list of
4822 // the potentially illegal return value types.
4823 SmallVector<MVT, 4> LoweredRetTys;
4824 SmallVector<MVT, 4> RetTys;
4825 ComputeValueVTs(*this, RetTy, RetTys);
4827 // Then we translate that to a list of legal types.
4828 for (unsigned I = 0, E = RetTys.size(); I != E; ++I) {
4830 MVT RegisterVT = getRegisterType(VT);
4831 unsigned NumRegs = getNumRegisters(VT);
4832 for (unsigned i = 0; i != NumRegs; ++i)
4833 LoweredRetTys.push_back(RegisterVT);
4836 LoweredRetTys.push_back(MVT::Other); // Always has a chain.
4838 // Create the CALL node.
4839 SDOperand Res = DAG.getNode(ISD::CALL,
4840 DAG.getVTList(&LoweredRetTys[0],
4841 LoweredRetTys.size()),
4842 &Ops[0], Ops.size());
4843 Chain = Res.getValue(LoweredRetTys.size() - 1);
4845 // Gather up the call result into a single value.
4846 if (RetTy != Type::VoidTy) {
4847 ISD::NodeType AssertOp = ISD::DELETED_NODE;
4850 AssertOp = ISD::AssertSext;
4852 AssertOp = ISD::AssertZext;
4854 SmallVector<SDOperand, 4> ReturnValues;
4856 for (unsigned I = 0, E = RetTys.size(); I != E; ++I) {
4858 MVT RegisterVT = getRegisterType(VT);
4859 unsigned NumRegs = getNumRegisters(VT);
4860 unsigned RegNoEnd = NumRegs + RegNo;
4861 SmallVector<SDOperand, 4> Results;
4862 for (; RegNo != RegNoEnd; ++RegNo)
4863 Results.push_back(Res.getValue(RegNo));
4864 SDOperand ReturnValue =
4865 getCopyFromParts(DAG, &Results[0], NumRegs, RegisterVT, VT,
4867 ReturnValues.push_back(ReturnValue);
4869 Res = ReturnValues.size() == 1 ? ReturnValues.front() :
4870 DAG.getNode(ISD::MERGE_VALUES,
4871 DAG.getVTList(&RetTys[0], RetTys.size()),
4872 &ReturnValues[0], ReturnValues.size());
4875 return std::make_pair(Res, Chain);
4878 SDOperand TargetLowering::LowerOperation(SDOperand Op, SelectionDAG &DAG) {
4879 assert(0 && "LowerOperation not implemented for this target!");
4884 SDOperand TargetLowering::CustomPromoteOperation(SDOperand Op,
4885 SelectionDAG &DAG) {
4886 assert(0 && "CustomPromoteOperation not implemented for this target!");
4891 //===----------------------------------------------------------------------===//
4892 // SelectionDAGISel code
4893 //===----------------------------------------------------------------------===//
4895 unsigned SelectionDAGISel::MakeReg(MVT VT) {
4896 return RegInfo->createVirtualRegister(TLI.getRegClassFor(VT));
4899 void SelectionDAGISel::getAnalysisUsage(AnalysisUsage &AU) const {
4900 AU.addRequired<AliasAnalysis>();
4901 AU.addRequired<CollectorModuleMetadata>();
4902 AU.setPreservesAll();
4905 bool SelectionDAGISel::runOnFunction(Function &Fn) {
4906 // Get alias analysis for load/store combining.
4907 AA = &getAnalysis<AliasAnalysis>();
4909 MachineFunction &MF = MachineFunction::construct(&Fn, TLI.getTargetMachine());
4910 if (MF.getFunction()->hasCollector())
4911 GCI = &getAnalysis<CollectorModuleMetadata>().get(*MF.getFunction());
4914 RegInfo = &MF.getRegInfo();
4915 DOUT << "\n\n\n=== " << Fn.getName() << "\n";
4917 FunctionLoweringInfo FuncInfo(TLI, Fn, MF);
4919 for (Function::iterator I = Fn.begin(), E = Fn.end(); I != E; ++I)
4920 if (InvokeInst *Invoke = dyn_cast<InvokeInst>(I->getTerminator()))
4921 // Mark landing pad.
4922 FuncInfo.MBBMap[Invoke->getSuccessor(1)]->setIsLandingPad();
4924 for (Function::iterator I = Fn.begin(), E = Fn.end(); I != E; ++I)
4925 SelectBasicBlock(I, MF, FuncInfo);
4927 // Add function live-ins to entry block live-in set.
4928 BasicBlock *EntryBB = &Fn.getEntryBlock();
4929 BB = FuncInfo.MBBMap[EntryBB];
4930 if (!RegInfo->livein_empty())
4931 for (MachineRegisterInfo::livein_iterator I = RegInfo->livein_begin(),
4932 E = RegInfo->livein_end(); I != E; ++I)
4933 BB->addLiveIn(I->first);
4936 assert(FuncInfo.CatchInfoFound.size() == FuncInfo.CatchInfoLost.size() &&
4937 "Not all catch info was assigned to a landing pad!");
4943 void SelectionDAGLowering::CopyValueToVirtualRegister(Value *V, unsigned Reg) {
4944 SDOperand Op = getValue(V);
4945 assert((Op.getOpcode() != ISD::CopyFromReg ||
4946 cast<RegisterSDNode>(Op.getOperand(1))->getReg() != Reg) &&
4947 "Copy from a reg to the same reg!");
4948 assert(!TargetRegisterInfo::isPhysicalRegister(Reg) && "Is a physreg");
4950 RegsForValue RFV(TLI, Reg, V->getType());
4951 SDOperand Chain = DAG.getEntryNode();
4952 RFV.getCopyToRegs(Op, DAG, Chain, 0);
4953 PendingExports.push_back(Chain);
4956 void SelectionDAGISel::
4957 LowerArguments(BasicBlock *LLVMBB, SelectionDAGLowering &SDL) {
4958 // If this is the entry block, emit arguments.
4959 Function &F = *LLVMBB->getParent();
4960 FunctionLoweringInfo &FuncInfo = SDL.FuncInfo;
4961 SDOperand OldRoot = SDL.DAG.getRoot();
4962 std::vector<SDOperand> Args = TLI.LowerArguments(F, SDL.DAG);
4965 for (Function::arg_iterator AI = F.arg_begin(), E = F.arg_end();
4967 SmallVector<MVT, 4> ValueVTs;
4968 ComputeValueVTs(TLI, AI->getType(), ValueVTs);
4969 unsigned NumValues = ValueVTs.size();
4970 if (!AI->use_empty()) {
4971 SmallVector<MVT, 4> LegalValueVTs(NumValues);
4972 for (unsigned VI = 0; VI != NumValues; ++VI)
4973 LegalValueVTs[VI] = Args[a + VI].getValueType();
4974 SDL.setValue(AI, SDL.DAG.getNode(ISD::MERGE_VALUES,
4975 SDL.DAG.getVTList(&LegalValueVTs[0],
4977 &Args[a], NumValues));
4978 // If this argument is live outside of the entry block, insert a copy from
4979 // whereever we got it to the vreg that other BB's will reference it as.
4980 DenseMap<const Value*, unsigned>::iterator VMI=FuncInfo.ValueMap.find(AI);
4981 if (VMI != FuncInfo.ValueMap.end()) {
4982 SDL.CopyValueToVirtualRegister(AI, VMI->second);
4988 // Finally, if the target has anything special to do, allow it to do so.
4989 // FIXME: this should insert code into the DAG!
4990 EmitFunctionEntryCode(F, SDL.DAG.getMachineFunction());
4993 static void copyCatchInfo(BasicBlock *SrcBB, BasicBlock *DestBB,
4994 MachineModuleInfo *MMI, FunctionLoweringInfo &FLI) {
4995 for (BasicBlock::iterator I = SrcBB->begin(), E = --SrcBB->end(); I != E; ++I)
4996 if (isSelector(I)) {
4997 // Apply the catch info to DestBB.
4998 addCatchInfo(cast<CallInst>(*I), MMI, FLI.MBBMap[DestBB]);
5000 if (!FLI.MBBMap[SrcBB]->isLandingPad())
5001 FLI.CatchInfoFound.insert(I);
5006 /// IsFixedFrameObjectWithPosOffset - Check if object is a fixed frame object and
5007 /// whether object offset >= 0.
5009 IsFixedFrameObjectWithPosOffset(MachineFrameInfo * MFI, SDOperand Op) {
5010 if (!isa<FrameIndexSDNode>(Op)) return false;
5012 FrameIndexSDNode * FrameIdxNode = dyn_cast<FrameIndexSDNode>(Op);
5013 int FrameIdx = FrameIdxNode->getIndex();
5014 return MFI->isFixedObjectIndex(FrameIdx) &&
5015 MFI->getObjectOffset(FrameIdx) >= 0;
5018 /// IsPossiblyOverwrittenArgumentOfTailCall - Check if the operand could
5019 /// possibly be overwritten when lowering the outgoing arguments in a tail
5020 /// call. Currently the implementation of this call is very conservative and
5021 /// assumes all arguments sourcing from FORMAL_ARGUMENTS or a CopyFromReg with
5022 /// virtual registers would be overwritten by direct lowering.
5023 static bool IsPossiblyOverwrittenArgumentOfTailCall(SDOperand Op,
5024 MachineFrameInfo * MFI) {
5025 RegisterSDNode * OpReg = NULL;
5026 if (Op.getOpcode() == ISD::FORMAL_ARGUMENTS ||
5027 (Op.getOpcode()== ISD::CopyFromReg &&
5028 (OpReg = dyn_cast<RegisterSDNode>(Op.getOperand(1))) &&
5029 (OpReg->getReg() >= TargetRegisterInfo::FirstVirtualRegister)) ||
5030 (Op.getOpcode() == ISD::LOAD &&
5031 IsFixedFrameObjectWithPosOffset(MFI, Op.getOperand(1))) ||
5032 (Op.getOpcode() == ISD::MERGE_VALUES &&
5033 Op.getOperand(Op.ResNo).getOpcode() == ISD::LOAD &&
5034 IsFixedFrameObjectWithPosOffset(MFI, Op.getOperand(Op.ResNo).
5040 /// CheckDAGForTailCallsAndFixThem - This Function looks for CALL nodes in the
5041 /// DAG and fixes their tailcall attribute operand.
5042 static void CheckDAGForTailCallsAndFixThem(SelectionDAG &DAG,
5043 TargetLowering& TLI) {
5044 SDNode * Ret = NULL;
5045 SDOperand Terminator = DAG.getRoot();
5048 if (Terminator.getOpcode() == ISD::RET) {
5049 Ret = Terminator.Val;
5052 // Fix tail call attribute of CALL nodes.
5053 for (SelectionDAG::allnodes_iterator BE = DAG.allnodes_begin(),
5054 BI = prior(DAG.allnodes_end()); BI != BE; --BI) {
5055 if (BI->getOpcode() == ISD::CALL) {
5056 SDOperand OpRet(Ret, 0);
5057 SDOperand OpCall(static_cast<SDNode*>(BI), 0);
5058 bool isMarkedTailCall =
5059 cast<ConstantSDNode>(OpCall.getOperand(3))->getValue() != 0;
5060 // If CALL node has tail call attribute set to true and the call is not
5061 // eligible (no RET or the target rejects) the attribute is fixed to
5062 // false. The TargetLowering::IsEligibleForTailCallOptimization function
5063 // must correctly identify tail call optimizable calls.
5064 if (!isMarkedTailCall) continue;
5066 !TLI.IsEligibleForTailCallOptimization(OpCall, OpRet, DAG)) {
5067 // Not eligible. Mark CALL node as non tail call.
5068 SmallVector<SDOperand, 32> Ops;
5070 for(SDNode::op_iterator I =OpCall.Val->op_begin(),
5071 E = OpCall.Val->op_end(); I != E; I++, idx++) {
5075 Ops.push_back(DAG.getConstant(false, TLI.getPointerTy()));
5077 DAG.UpdateNodeOperands(OpCall, Ops.begin(), Ops.size());
5079 // Look for tail call clobbered arguments. Emit a series of
5080 // copyto/copyfrom virtual register nodes to protect them.
5081 SmallVector<SDOperand, 32> Ops;
5082 SDOperand Chain = OpCall.getOperand(0), InFlag;
5084 for(SDNode::op_iterator I = OpCall.Val->op_begin(),
5085 E = OpCall.Val->op_end(); I != E; I++, idx++) {
5087 if (idx > 4 && (idx % 2)) {
5088 bool isByVal = cast<ARG_FLAGSSDNode>(OpCall.getOperand(idx+1))->
5089 getArgFlags().isByVal();
5090 MachineFunction &MF = DAG.getMachineFunction();
5091 MachineFrameInfo *MFI = MF.getFrameInfo();
5093 IsPossiblyOverwrittenArgumentOfTailCall(Arg, MFI)) {
5094 MVT VT = Arg.getValueType();
5095 unsigned VReg = MF.getRegInfo().
5096 createVirtualRegister(TLI.getRegClassFor(VT));
5097 Chain = DAG.getCopyToReg(Chain, VReg, Arg, InFlag);
5098 InFlag = Chain.getValue(1);
5099 Arg = DAG.getCopyFromReg(Chain, VReg, VT, InFlag);
5100 Chain = Arg.getValue(1);
5101 InFlag = Arg.getValue(2);
5106 // Link in chain of CopyTo/CopyFromReg.
5108 DAG.UpdateNodeOperands(OpCall, Ops.begin(), Ops.size());
5114 void SelectionDAGISel::BuildSelectionDAG(SelectionDAG &DAG, BasicBlock *LLVMBB,
5115 std::vector<std::pair<MachineInstr*, unsigned> > &PHINodesToUpdate,
5116 FunctionLoweringInfo &FuncInfo) {
5117 SelectionDAGLowering SDL(DAG, TLI, *AA, FuncInfo, GCI);
5119 // Lower any arguments needed in this block if this is the entry block.
5120 if (LLVMBB == &LLVMBB->getParent()->getEntryBlock())
5121 LowerArguments(LLVMBB, SDL);
5123 BB = FuncInfo.MBBMap[LLVMBB];
5124 SDL.setCurrentBasicBlock(BB);
5126 MachineModuleInfo *MMI = DAG.getMachineModuleInfo();
5128 if (MMI && BB->isLandingPad()) {
5129 // Add a label to mark the beginning of the landing pad. Deletion of the
5130 // landing pad can thus be detected via the MachineModuleInfo.
5131 unsigned LabelID = MMI->addLandingPad(BB);
5132 DAG.setRoot(DAG.getNode(ISD::LABEL, MVT::Other, DAG.getEntryNode(),
5133 DAG.getConstant(LabelID, MVT::i32),
5134 DAG.getConstant(1, MVT::i32)));
5136 // Mark exception register as live in.
5137 unsigned Reg = TLI.getExceptionAddressRegister();
5138 if (Reg) BB->addLiveIn(Reg);
5140 // Mark exception selector register as live in.
5141 Reg = TLI.getExceptionSelectorRegister();
5142 if (Reg) BB->addLiveIn(Reg);
5144 // FIXME: Hack around an exception handling flaw (PR1508): the personality
5145 // function and list of typeids logically belong to the invoke (or, if you
5146 // like, the basic block containing the invoke), and need to be associated
5147 // with it in the dwarf exception handling tables. Currently however the
5148 // information is provided by an intrinsic (eh.selector) that can be moved
5149 // to unexpected places by the optimizers: if the unwind edge is critical,
5150 // then breaking it can result in the intrinsics being in the successor of
5151 // the landing pad, not the landing pad itself. This results in exceptions
5152 // not being caught because no typeids are associated with the invoke.
5153 // This may not be the only way things can go wrong, but it is the only way
5154 // we try to work around for the moment.
5155 BranchInst *Br = dyn_cast<BranchInst>(LLVMBB->getTerminator());
5157 if (Br && Br->isUnconditional()) { // Critical edge?
5158 BasicBlock::iterator I, E;
5159 for (I = LLVMBB->begin(), E = --LLVMBB->end(); I != E; ++I)
5164 // No catch info found - try to extract some from the successor.
5165 copyCatchInfo(Br->getSuccessor(0), LLVMBB, MMI, FuncInfo);
5169 // Lower all of the non-terminator instructions.
5170 for (BasicBlock::iterator I = LLVMBB->begin(), E = --LLVMBB->end();
5174 // Ensure that all instructions which are used outside of their defining
5175 // blocks are available as virtual registers. Invoke is handled elsewhere.
5176 for (BasicBlock::iterator I = LLVMBB->begin(), E = LLVMBB->end(); I != E;++I)
5177 if (!I->use_empty() && !isa<PHINode>(I) && !isa<InvokeInst>(I)) {
5178 DenseMap<const Value*, unsigned>::iterator VMI =FuncInfo.ValueMap.find(I);
5179 if (VMI != FuncInfo.ValueMap.end())
5180 SDL.CopyValueToVirtualRegister(I, VMI->second);
5183 // Handle PHI nodes in successor blocks. Emit code into the SelectionDAG to
5184 // ensure constants are generated when needed. Remember the virtual registers
5185 // that need to be added to the Machine PHI nodes as input. We cannot just
5186 // directly add them, because expansion might result in multiple MBB's for one
5187 // BB. As such, the start of the BB might correspond to a different MBB than
5190 TerminatorInst *TI = LLVMBB->getTerminator();
5192 // Emit constants only once even if used by multiple PHI nodes.
5193 std::map<Constant*, unsigned> ConstantsOut;
5195 // Vector bool would be better, but vector<bool> is really slow.
5196 std::vector<unsigned char> SuccsHandled;
5197 if (TI->getNumSuccessors())
5198 SuccsHandled.resize(BB->getParent()->getNumBlockIDs());
5200 // Check successor nodes' PHI nodes that expect a constant to be available
5202 for (unsigned succ = 0, e = TI->getNumSuccessors(); succ != e; ++succ) {
5203 BasicBlock *SuccBB = TI->getSuccessor(succ);
5204 if (!isa<PHINode>(SuccBB->begin())) continue;
5205 MachineBasicBlock *SuccMBB = FuncInfo.MBBMap[SuccBB];
5207 // If this terminator has multiple identical successors (common for
5208 // switches), only handle each succ once.
5209 unsigned SuccMBBNo = SuccMBB->getNumber();
5210 if (SuccsHandled[SuccMBBNo]) continue;
5211 SuccsHandled[SuccMBBNo] = true;
5213 MachineBasicBlock::iterator MBBI = SuccMBB->begin();
5216 // At this point we know that there is a 1-1 correspondence between LLVM PHI
5217 // nodes and Machine PHI nodes, but the incoming operands have not been
5219 for (BasicBlock::iterator I = SuccBB->begin();
5220 (PN = dyn_cast<PHINode>(I)); ++I) {
5221 // Ignore dead phi's.
5222 if (PN->use_empty()) continue;
5225 Value *PHIOp = PN->getIncomingValueForBlock(LLVMBB);
5227 if (Constant *C = dyn_cast<Constant>(PHIOp)) {
5228 unsigned &RegOut = ConstantsOut[C];
5230 RegOut = FuncInfo.CreateRegForValue(C);
5231 SDL.CopyValueToVirtualRegister(C, RegOut);
5235 Reg = FuncInfo.ValueMap[PHIOp];
5237 assert(isa<AllocaInst>(PHIOp) &&
5238 FuncInfo.StaticAllocaMap.count(cast<AllocaInst>(PHIOp)) &&
5239 "Didn't codegen value into a register!??");
5240 Reg = FuncInfo.CreateRegForValue(PHIOp);
5241 SDL.CopyValueToVirtualRegister(PHIOp, Reg);
5245 // Remember that this register needs to added to the machine PHI node as
5246 // the input for this MBB.
5247 MVT VT = TLI.getValueType(PN->getType());
5248 unsigned NumRegisters = TLI.getNumRegisters(VT);
5249 for (unsigned i = 0, e = NumRegisters; i != e; ++i)
5250 PHINodesToUpdate.push_back(std::make_pair(MBBI++, Reg+i));
5253 ConstantsOut.clear();
5255 // Lower the terminator after the copies are emitted.
5256 SDL.visit(*LLVMBB->getTerminator());
5258 // Copy over any CaseBlock records that may now exist due to SwitchInst
5259 // lowering, as well as any jump table information.
5260 SwitchCases.clear();
5261 SwitchCases = SDL.SwitchCases;
5263 JTCases = SDL.JTCases;
5264 BitTestCases.clear();
5265 BitTestCases = SDL.BitTestCases;
5267 // Make sure the root of the DAG is up-to-date.
5268 DAG.setRoot(SDL.getControlRoot());
5270 // Check whether calls in this block are real tail calls. Fix up CALL nodes
5271 // with correct tailcall attribute so that the target can rely on the tailcall
5272 // attribute indicating whether the call is really eligible for tail call
5274 CheckDAGForTailCallsAndFixThem(DAG, TLI);
5277 void SelectionDAGISel::ComputeLiveOutVRegInfo(SelectionDAG &DAG) {
5278 SmallPtrSet<SDNode*, 128> VisitedNodes;
5279 SmallVector<SDNode*, 128> Worklist;
5281 Worklist.push_back(DAG.getRoot().Val);
5287 while (!Worklist.empty()) {
5288 SDNode *N = Worklist.back();
5289 Worklist.pop_back();
5291 // If we've already seen this node, ignore it.
5292 if (!VisitedNodes.insert(N))
5295 // Otherwise, add all chain operands to the worklist.
5296 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
5297 if (N->getOperand(i).getValueType() == MVT::Other)
5298 Worklist.push_back(N->getOperand(i).Val);
5300 // If this is a CopyToReg with a vreg dest, process it.
5301 if (N->getOpcode() != ISD::CopyToReg)
5304 unsigned DestReg = cast<RegisterSDNode>(N->getOperand(1))->getReg();
5305 if (!TargetRegisterInfo::isVirtualRegister(DestReg))
5308 // Ignore non-scalar or non-integer values.
5309 SDOperand Src = N->getOperand(2);
5310 MVT SrcVT = Src.getValueType();
5311 if (!SrcVT.isInteger() || SrcVT.isVector())
5314 unsigned NumSignBits = DAG.ComputeNumSignBits(Src);
5315 Mask = APInt::getAllOnesValue(SrcVT.getSizeInBits());
5316 DAG.ComputeMaskedBits(Src, Mask, KnownZero, KnownOne);
5318 // Only install this information if it tells us something.
5319 if (NumSignBits != 1 || KnownZero != 0 || KnownOne != 0) {
5320 DestReg -= TargetRegisterInfo::FirstVirtualRegister;
5321 FunctionLoweringInfo &FLI = DAG.getFunctionLoweringInfo();
5322 if (DestReg >= FLI.LiveOutRegInfo.size())
5323 FLI.LiveOutRegInfo.resize(DestReg+1);
5324 FunctionLoweringInfo::LiveOutInfo &LOI = FLI.LiveOutRegInfo[DestReg];
5325 LOI.NumSignBits = NumSignBits;
5326 LOI.KnownOne = NumSignBits;
5327 LOI.KnownZero = NumSignBits;
5332 void SelectionDAGISel::CodeGenAndEmitDAG(SelectionDAG &DAG) {
5333 DOUT << "Lowered selection DAG:\n";
5336 // Run the DAG combiner in pre-legalize mode.
5337 DAG.Combine(false, *AA);
5339 DOUT << "Optimized lowered selection DAG:\n";
5342 // Second step, hack on the DAG until it only uses operations and types that
5343 // the target supports.
5344 #if 0 // Enable this some day.
5345 DAG.LegalizeTypes();
5346 // Someday even later, enable a dag combine pass here.
5350 DOUT << "Legalized selection DAG:\n";
5353 // Run the DAG combiner in post-legalize mode.
5354 DAG.Combine(true, *AA);
5356 DOUT << "Optimized legalized selection DAG:\n";
5359 if (ViewISelDAGs) DAG.viewGraph();
5361 if (EnableValueProp) // FIXME: Only do this if !fast.
5362 ComputeLiveOutVRegInfo(DAG);
5364 // Third, instruction select all of the operations to machine code, adding the
5365 // code to the MachineBasicBlock.
5366 InstructionSelectBasicBlock(DAG);
5368 DOUT << "Selected machine code:\n";
5372 void SelectionDAGISel::SelectBasicBlock(BasicBlock *LLVMBB, MachineFunction &MF,
5373 FunctionLoweringInfo &FuncInfo) {
5374 std::vector<std::pair<MachineInstr*, unsigned> > PHINodesToUpdate;
5376 SelectionDAG DAG(TLI, MF, FuncInfo,
5377 getAnalysisToUpdate<MachineModuleInfo>());
5380 // First step, lower LLVM code to some DAG. This DAG may use operations and
5381 // types that are not supported by the target.
5382 BuildSelectionDAG(DAG, LLVMBB, PHINodesToUpdate, FuncInfo);
5384 // Second step, emit the lowered DAG as machine code.
5385 CodeGenAndEmitDAG(DAG);
5388 DOUT << "Total amount of phi nodes to update: "
5389 << PHINodesToUpdate.size() << "\n";
5390 DEBUG(for (unsigned i = 0, e = PHINodesToUpdate.size(); i != e; ++i)
5391 DOUT << "Node " << i << " : (" << PHINodesToUpdate[i].first
5392 << ", " << PHINodesToUpdate[i].second << ")\n";);
5394 // Next, now that we know what the last MBB the LLVM BB expanded is, update
5395 // PHI nodes in successors.
5396 if (SwitchCases.empty() && JTCases.empty() && BitTestCases.empty()) {
5397 for (unsigned i = 0, e = PHINodesToUpdate.size(); i != e; ++i) {
5398 MachineInstr *PHI = PHINodesToUpdate[i].first;
5399 assert(PHI->getOpcode() == TargetInstrInfo::PHI &&
5400 "This is not a machine PHI node that we are updating!");
5401 PHI->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[i].second,
5403 PHI->addOperand(MachineOperand::CreateMBB(BB));
5408 for (unsigned i = 0, e = BitTestCases.size(); i != e; ++i) {
5409 // Lower header first, if it wasn't already lowered
5410 if (!BitTestCases[i].Emitted) {
5411 SelectionDAG HSDAG(TLI, MF, FuncInfo,
5412 getAnalysisToUpdate<MachineModuleInfo>());
5414 SelectionDAGLowering HSDL(HSDAG, TLI, *AA, FuncInfo, GCI);
5415 // Set the current basic block to the mbb we wish to insert the code into
5416 BB = BitTestCases[i].Parent;
5417 HSDL.setCurrentBasicBlock(BB);
5419 HSDL.visitBitTestHeader(BitTestCases[i]);
5420 HSDAG.setRoot(HSDL.getRoot());
5421 CodeGenAndEmitDAG(HSDAG);
5424 for (unsigned j = 0, ej = BitTestCases[i].Cases.size(); j != ej; ++j) {
5425 SelectionDAG BSDAG(TLI, MF, FuncInfo,
5426 getAnalysisToUpdate<MachineModuleInfo>());
5428 SelectionDAGLowering BSDL(BSDAG, TLI, *AA, FuncInfo, GCI);
5429 // Set the current basic block to the mbb we wish to insert the code into
5430 BB = BitTestCases[i].Cases[j].ThisBB;
5431 BSDL.setCurrentBasicBlock(BB);
5434 BSDL.visitBitTestCase(BitTestCases[i].Cases[j+1].ThisBB,
5435 BitTestCases[i].Reg,
5436 BitTestCases[i].Cases[j]);
5438 BSDL.visitBitTestCase(BitTestCases[i].Default,
5439 BitTestCases[i].Reg,
5440 BitTestCases[i].Cases[j]);
5443 BSDAG.setRoot(BSDL.getRoot());
5444 CodeGenAndEmitDAG(BSDAG);
5448 for (unsigned pi = 0, pe = PHINodesToUpdate.size(); pi != pe; ++pi) {
5449 MachineInstr *PHI = PHINodesToUpdate[pi].first;
5450 MachineBasicBlock *PHIBB = PHI->getParent();
5451 assert(PHI->getOpcode() == TargetInstrInfo::PHI &&
5452 "This is not a machine PHI node that we are updating!");
5453 // This is "default" BB. We have two jumps to it. From "header" BB and
5454 // from last "case" BB.
5455 if (PHIBB == BitTestCases[i].Default) {
5456 PHI->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[pi].second,
5458 PHI->addOperand(MachineOperand::CreateMBB(BitTestCases[i].Parent));
5459 PHI->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[pi].second,
5461 PHI->addOperand(MachineOperand::CreateMBB(BitTestCases[i].Cases.
5464 // One of "cases" BB.
5465 for (unsigned j = 0, ej = BitTestCases[i].Cases.size(); j != ej; ++j) {
5466 MachineBasicBlock* cBB = BitTestCases[i].Cases[j].ThisBB;
5467 if (cBB->succ_end() !=
5468 std::find(cBB->succ_begin(),cBB->succ_end(), PHIBB)) {
5469 PHI->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[pi].second,
5471 PHI->addOperand(MachineOperand::CreateMBB(cBB));
5477 // If the JumpTable record is filled in, then we need to emit a jump table.
5478 // Updating the PHI nodes is tricky in this case, since we need to determine
5479 // whether the PHI is a successor of the range check MBB or the jump table MBB
5480 for (unsigned i = 0, e = JTCases.size(); i != e; ++i) {
5481 // Lower header first, if it wasn't already lowered
5482 if (!JTCases[i].first.Emitted) {
5483 SelectionDAG HSDAG(TLI, MF, FuncInfo,
5484 getAnalysisToUpdate<MachineModuleInfo>());
5486 SelectionDAGLowering HSDL(HSDAG, TLI, *AA, FuncInfo, GCI);
5487 // Set the current basic block to the mbb we wish to insert the code into
5488 BB = JTCases[i].first.HeaderBB;
5489 HSDL.setCurrentBasicBlock(BB);
5491 HSDL.visitJumpTableHeader(JTCases[i].second, JTCases[i].first);
5492 HSDAG.setRoot(HSDL.getRoot());
5493 CodeGenAndEmitDAG(HSDAG);
5496 SelectionDAG JSDAG(TLI, MF, FuncInfo,
5497 getAnalysisToUpdate<MachineModuleInfo>());
5499 SelectionDAGLowering JSDL(JSDAG, TLI, *AA, FuncInfo, GCI);
5500 // Set the current basic block to the mbb we wish to insert the code into
5501 BB = JTCases[i].second.MBB;
5502 JSDL.setCurrentBasicBlock(BB);
5504 JSDL.visitJumpTable(JTCases[i].second);
5505 JSDAG.setRoot(JSDL.getRoot());
5506 CodeGenAndEmitDAG(JSDAG);
5509 for (unsigned pi = 0, pe = PHINodesToUpdate.size(); pi != pe; ++pi) {
5510 MachineInstr *PHI = PHINodesToUpdate[pi].first;
5511 MachineBasicBlock *PHIBB = PHI->getParent();
5512 assert(PHI->getOpcode() == TargetInstrInfo::PHI &&
5513 "This is not a machine PHI node that we are updating!");
5514 // "default" BB. We can go there only from header BB.
5515 if (PHIBB == JTCases[i].second.Default) {
5516 PHI->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[pi].second,
5518 PHI->addOperand(MachineOperand::CreateMBB(JTCases[i].first.HeaderBB));
5520 // JT BB. Just iterate over successors here
5521 if (BB->succ_end() != std::find(BB->succ_begin(),BB->succ_end(), PHIBB)) {
5522 PHI->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[pi].second,
5524 PHI->addOperand(MachineOperand::CreateMBB(BB));
5529 // If the switch block involved a branch to one of the actual successors, we
5530 // need to update PHI nodes in that block.
5531 for (unsigned i = 0, e = PHINodesToUpdate.size(); i != e; ++i) {
5532 MachineInstr *PHI = PHINodesToUpdate[i].first;
5533 assert(PHI->getOpcode() == TargetInstrInfo::PHI &&
5534 "This is not a machine PHI node that we are updating!");
5535 if (BB->isSuccessor(PHI->getParent())) {
5536 PHI->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[i].second,
5538 PHI->addOperand(MachineOperand::CreateMBB(BB));
5542 // If we generated any switch lowering information, build and codegen any
5543 // additional DAGs necessary.
5544 for (unsigned i = 0, e = SwitchCases.size(); i != e; ++i) {
5545 SelectionDAG SDAG(TLI, MF, FuncInfo,
5546 getAnalysisToUpdate<MachineModuleInfo>());
5548 SelectionDAGLowering SDL(SDAG, TLI, *AA, FuncInfo, GCI);
5550 // Set the current basic block to the mbb we wish to insert the code into
5551 BB = SwitchCases[i].ThisBB;
5552 SDL.setCurrentBasicBlock(BB);
5555 SDL.visitSwitchCase(SwitchCases[i]);
5556 SDAG.setRoot(SDL.getRoot());
5557 CodeGenAndEmitDAG(SDAG);
5559 // Handle any PHI nodes in successors of this chunk, as if we were coming
5560 // from the original BB before switch expansion. Note that PHI nodes can
5561 // occur multiple times in PHINodesToUpdate. We have to be very careful to
5562 // handle them the right number of times.
5563 while ((BB = SwitchCases[i].TrueBB)) { // Handle LHS and RHS.
5564 for (MachineBasicBlock::iterator Phi = BB->begin();
5565 Phi != BB->end() && Phi->getOpcode() == TargetInstrInfo::PHI; ++Phi){
5566 // This value for this PHI node is recorded in PHINodesToUpdate, get it.
5567 for (unsigned pn = 0; ; ++pn) {
5568 assert(pn != PHINodesToUpdate.size() && "Didn't find PHI entry!");
5569 if (PHINodesToUpdate[pn].first == Phi) {
5570 Phi->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[pn].
5572 Phi->addOperand(MachineOperand::CreateMBB(SwitchCases[i].ThisBB));
5578 // Don't process RHS if same block as LHS.
5579 if (BB == SwitchCases[i].FalseBB)
5580 SwitchCases[i].FalseBB = 0;
5582 // If we haven't handled the RHS, do so now. Otherwise, we're done.
5583 SwitchCases[i].TrueBB = SwitchCases[i].FalseBB;
5584 SwitchCases[i].FalseBB = 0;
5586 assert(SwitchCases[i].TrueBB == 0 && SwitchCases[i].FalseBB == 0);
5591 //===----------------------------------------------------------------------===//
5592 /// ScheduleAndEmitDAG - Pick a safe ordering and emit instructions for each
5593 /// target node in the graph.
5594 void SelectionDAGISel::ScheduleAndEmitDAG(SelectionDAG &DAG) {
5595 if (ViewSchedDAGs) DAG.viewGraph();
5597 RegisterScheduler::FunctionPassCtor Ctor = RegisterScheduler::getDefault();
5601 RegisterScheduler::setDefault(Ctor);
5604 ScheduleDAG *SL = Ctor(this, &DAG, BB);
5607 if (ViewSUnitDAGs) SL->viewGraph();
5613 HazardRecognizer *SelectionDAGISel::CreateTargetHazardRecognizer() {
5614 return new HazardRecognizer();
5617 //===----------------------------------------------------------------------===//
5618 // Helper functions used by the generated instruction selector.
5619 //===----------------------------------------------------------------------===//
5620 // Calls to these methods are generated by tblgen.
5622 /// CheckAndMask - The isel is trying to match something like (and X, 255). If
5623 /// the dag combiner simplified the 255, we still want to match. RHS is the
5624 /// actual value in the DAG on the RHS of an AND, and DesiredMaskS is the value
5625 /// specified in the .td file (e.g. 255).
5626 bool SelectionDAGISel::CheckAndMask(SDOperand LHS, ConstantSDNode *RHS,
5627 int64_t DesiredMaskS) const {
5628 const APInt &ActualMask = RHS->getAPIntValue();
5629 const APInt &DesiredMask = APInt(LHS.getValueSizeInBits(), DesiredMaskS);
5631 // If the actual mask exactly matches, success!
5632 if (ActualMask == DesiredMask)
5635 // If the actual AND mask is allowing unallowed bits, this doesn't match.
5636 if (ActualMask.intersects(~DesiredMask))
5639 // Otherwise, the DAG Combiner may have proven that the value coming in is
5640 // either already zero or is not demanded. Check for known zero input bits.
5641 APInt NeededMask = DesiredMask & ~ActualMask;
5642 if (CurDAG->MaskedValueIsZero(LHS, NeededMask))
5645 // TODO: check to see if missing bits are just not demanded.
5647 // Otherwise, this pattern doesn't match.
5651 /// CheckOrMask - The isel is trying to match something like (or X, 255). If
5652 /// the dag combiner simplified the 255, we still want to match. RHS is the
5653 /// actual value in the DAG on the RHS of an OR, and DesiredMaskS is the value
5654 /// specified in the .td file (e.g. 255).
5655 bool SelectionDAGISel::CheckOrMask(SDOperand LHS, ConstantSDNode *RHS,
5656 int64_t DesiredMaskS) const {
5657 const APInt &ActualMask = RHS->getAPIntValue();
5658 const APInt &DesiredMask = APInt(LHS.getValueSizeInBits(), DesiredMaskS);
5660 // If the actual mask exactly matches, success!
5661 if (ActualMask == DesiredMask)
5664 // If the actual AND mask is allowing unallowed bits, this doesn't match.
5665 if (ActualMask.intersects(~DesiredMask))
5668 // Otherwise, the DAG Combiner may have proven that the value coming in is
5669 // either already zero or is not demanded. Check for known zero input bits.
5670 APInt NeededMask = DesiredMask & ~ActualMask;
5672 APInt KnownZero, KnownOne;
5673 CurDAG->ComputeMaskedBits(LHS, NeededMask, KnownZero, KnownOne);
5675 // If all the missing bits in the or are already known to be set, match!
5676 if ((NeededMask & KnownOne) == NeededMask)
5679 // TODO: check to see if missing bits are just not demanded.
5681 // Otherwise, this pattern doesn't match.
5686 /// SelectInlineAsmMemoryOperands - Calls to this are automatically generated
5687 /// by tblgen. Others should not call it.
5688 void SelectionDAGISel::
5689 SelectInlineAsmMemoryOperands(std::vector<SDOperand> &Ops, SelectionDAG &DAG) {
5690 std::vector<SDOperand> InOps;
5691 std::swap(InOps, Ops);
5693 Ops.push_back(InOps[0]); // input chain.
5694 Ops.push_back(InOps[1]); // input asm string.
5696 unsigned i = 2, e = InOps.size();
5697 if (InOps[e-1].getValueType() == MVT::Flag)
5698 --e; // Don't process a flag operand if it is here.
5701 unsigned Flags = cast<ConstantSDNode>(InOps[i])->getValue();
5702 if ((Flags & 7) != 4 /*MEM*/) {
5703 // Just skip over this operand, copying the operands verbatim.
5704 Ops.insert(Ops.end(), InOps.begin()+i, InOps.begin()+i+(Flags >> 3) + 1);
5705 i += (Flags >> 3) + 1;
5707 assert((Flags >> 3) == 1 && "Memory operand with multiple values?");
5708 // Otherwise, this is a memory operand. Ask the target to select it.
5709 std::vector<SDOperand> SelOps;
5710 if (SelectInlineAsmMemoryOperand(InOps[i+1], 'm', SelOps, DAG)) {
5711 cerr << "Could not match memory address. Inline asm failure!\n";
5715 // Add this to the output node.
5716 MVT IntPtrTy = DAG.getTargetLoweringInfo().getPointerTy();
5717 Ops.push_back(DAG.getTargetConstant(4/*MEM*/ | (SelOps.size() << 3),
5719 Ops.insert(Ops.end(), SelOps.begin(), SelOps.end());
5724 // Add the flag input back if present.
5725 if (e != InOps.size())
5726 Ops.push_back(InOps.back());
5729 char SelectionDAGISel::ID = 0;