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 && Indices == IndicesEnd)
106 // Given a struct type, recursively traverse the elements.
107 if (const StructType *STy = dyn_cast<StructType>(Ty)) {
108 for (StructType::element_iterator EB = STy->element_begin(),
110 EE = STy->element_end();
112 if (Indices && *Indices == unsigned(EI - EB))
113 return ComputeLinearIndex(TLI, *EI, Indices+1, IndicesEnd, CurIndex);
114 CurIndex = ComputeLinearIndex(TLI, *EI, 0, 0, CurIndex);
117 // Given an array type, recursively traverse the elements.
118 else if (const ArrayType *ATy = dyn_cast<ArrayType>(Ty)) {
119 const Type *EltTy = ATy->getElementType();
120 for (unsigned i = 0, e = ATy->getNumElements(); i != e; ++i) {
121 if (Indices && *Indices == i)
122 return ComputeLinearIndex(TLI, EltTy, Indices+1, IndicesEnd, CurIndex);
123 CurIndex = ComputeLinearIndex(TLI, EltTy, 0, 0, CurIndex);
126 // We haven't found the type we're looking for, so keep searching.
130 /// ComputeValueVTs - Given an LLVM IR type, compute a sequence of
131 /// MVTs that represent all the individual underlying
132 /// non-aggregate types that comprise it.
134 /// If Offsets is non-null, it points to a vector to be filled in
135 /// with the in-memory offsets of each of the individual values.
137 static void ComputeValueVTs(const TargetLowering &TLI, const Type *Ty,
138 SmallVectorImpl<MVT> &ValueVTs,
139 SmallVectorImpl<uint64_t> *Offsets = 0,
140 uint64_t StartingOffset = 0) {
141 // Given a struct type, recursively traverse the elements.
142 if (const StructType *STy = dyn_cast<StructType>(Ty)) {
143 const StructLayout *SL = TLI.getTargetData()->getStructLayout(STy);
144 for (StructType::element_iterator EB = STy->element_begin(),
146 EE = STy->element_end();
148 ComputeValueVTs(TLI, *EI, ValueVTs, Offsets,
149 StartingOffset + SL->getElementOffset(EI - EB));
152 // Given an array type, recursively traverse the elements.
153 if (const ArrayType *ATy = dyn_cast<ArrayType>(Ty)) {
154 const Type *EltTy = ATy->getElementType();
155 uint64_t EltSize = TLI.getTargetData()->getABITypeSize(EltTy);
156 for (unsigned i = 0, e = ATy->getNumElements(); i != e; ++i)
157 ComputeValueVTs(TLI, EltTy, ValueVTs, Offsets,
158 StartingOffset + i * EltSize);
161 // Base case: we can get an MVT for this LLVM IR type.
162 ValueVTs.push_back(TLI.getValueType(Ty));
164 Offsets->push_back(StartingOffset);
168 /// RegsForValue - This struct represents the registers (physical or virtual)
169 /// that a particular set of values is assigned, and the type information about
170 /// the value. The most common situation is to represent one value at a time,
171 /// but struct or array values are handled element-wise as multiple values.
172 /// The splitting of aggregates is performed recursively, so that we never
173 /// have aggregate-typed registers. The values at this point do not necessarily
174 /// have legal types, so each value may require one or more registers of some
177 struct VISIBILITY_HIDDEN RegsForValue {
178 /// TLI - The TargetLowering object.
180 const TargetLowering *TLI;
182 /// ValueVTs - The value types of the values, which may not be legal, and
183 /// may need be promoted or synthesized from one or more registers.
185 SmallVector<MVT, 4> ValueVTs;
187 /// RegVTs - The value types of the registers. This is the same size as
188 /// ValueVTs and it records, for each value, what the type of the assigned
189 /// register or registers are. (Individual values are never synthesized
190 /// from more than one type of register.)
192 /// With virtual registers, the contents of RegVTs is redundant with TLI's
193 /// getRegisterType member function, however when with physical registers
194 /// it is necessary to have a separate record of the types.
196 SmallVector<MVT, 4> RegVTs;
198 /// Regs - This list holds the registers assigned to the values.
199 /// Each legal or promoted value requires one register, and each
200 /// expanded value requires multiple registers.
202 SmallVector<unsigned, 4> Regs;
204 RegsForValue() : TLI(0) {}
206 RegsForValue(const TargetLowering &tli,
207 const SmallVector<unsigned, 4> ®s,
208 MVT regvt, MVT valuevt)
209 : TLI(&tli), ValueVTs(1, valuevt), RegVTs(1, regvt), Regs(regs) {}
210 RegsForValue(const TargetLowering &tli,
211 const SmallVector<unsigned, 4> ®s,
212 const SmallVector<MVT, 4> ®vts,
213 const SmallVector<MVT, 4> &valuevts)
214 : TLI(&tli), ValueVTs(valuevts), RegVTs(regvts), Regs(regs) {}
215 RegsForValue(const TargetLowering &tli,
216 unsigned Reg, const Type *Ty) : TLI(&tli) {
217 ComputeValueVTs(tli, Ty, ValueVTs);
219 for (unsigned Value = 0, e = ValueVTs.size(); Value != e; ++Value) {
220 MVT ValueVT = ValueVTs[Value];
221 unsigned NumRegs = TLI->getNumRegisters(ValueVT);
222 MVT RegisterVT = TLI->getRegisterType(ValueVT);
223 for (unsigned i = 0; i != NumRegs; ++i)
224 Regs.push_back(Reg + i);
225 RegVTs.push_back(RegisterVT);
230 /// append - Add the specified values to this one.
231 void append(const RegsForValue &RHS) {
233 ValueVTs.append(RHS.ValueVTs.begin(), RHS.ValueVTs.end());
234 RegVTs.append(RHS.RegVTs.begin(), RHS.RegVTs.end());
235 Regs.append(RHS.Regs.begin(), RHS.Regs.end());
239 /// getCopyFromRegs - Emit a series of CopyFromReg nodes that copies from
240 /// this value and returns the result as a ValueVTs value. This uses
241 /// Chain/Flag as the input and updates them for the output Chain/Flag.
242 /// If the Flag pointer is NULL, no flag is used.
243 SDOperand getCopyFromRegs(SelectionDAG &DAG,
244 SDOperand &Chain, SDOperand *Flag) const;
246 /// getCopyToRegs - Emit a series of CopyToReg nodes that copies the
247 /// specified value into the registers specified by this object. This uses
248 /// Chain/Flag as the input and updates them for the output Chain/Flag.
249 /// If the Flag pointer is NULL, no flag is used.
250 void getCopyToRegs(SDOperand Val, SelectionDAG &DAG,
251 SDOperand &Chain, SDOperand *Flag) const;
253 /// AddInlineAsmOperands - Add this value to the specified inlineasm node
254 /// operand list. This adds the code marker and includes the number of
255 /// values added into it.
256 void AddInlineAsmOperands(unsigned Code, SelectionDAG &DAG,
257 std::vector<SDOperand> &Ops) const;
262 //===--------------------------------------------------------------------===//
263 /// createDefaultScheduler - This creates an instruction scheduler appropriate
265 ScheduleDAG* createDefaultScheduler(SelectionDAGISel *IS,
267 MachineBasicBlock *BB) {
268 TargetLowering &TLI = IS->getTargetLowering();
270 if (TLI.getSchedulingPreference() == TargetLowering::SchedulingForLatency) {
271 return createTDListDAGScheduler(IS, DAG, BB);
273 assert(TLI.getSchedulingPreference() ==
274 TargetLowering::SchedulingForRegPressure && "Unknown sched type!");
275 return createBURRListDAGScheduler(IS, DAG, BB);
280 //===--------------------------------------------------------------------===//
281 /// FunctionLoweringInfo - This contains information that is global to a
282 /// function that is used when lowering a region of the function.
283 class FunctionLoweringInfo {
288 MachineRegisterInfo &RegInfo;
290 FunctionLoweringInfo(TargetLowering &TLI, Function &Fn,MachineFunction &MF);
292 /// MBBMap - A mapping from LLVM basic blocks to their machine code entry.
293 std::map<const BasicBlock*, MachineBasicBlock *> MBBMap;
295 /// ValueMap - Since we emit code for the function a basic block at a time,
296 /// we must remember which virtual registers hold the values for
297 /// cross-basic-block values.
298 DenseMap<const Value*, unsigned> ValueMap;
300 /// StaticAllocaMap - Keep track of frame indices for fixed sized allocas in
301 /// the entry block. This allows the allocas to be efficiently referenced
302 /// anywhere in the function.
303 std::map<const AllocaInst*, int> StaticAllocaMap;
306 SmallSet<Instruction*, 8> CatchInfoLost;
307 SmallSet<Instruction*, 8> CatchInfoFound;
310 unsigned MakeReg(MVT VT) {
311 return RegInfo.createVirtualRegister(TLI.getRegClassFor(VT));
314 /// isExportedInst - Return true if the specified value is an instruction
315 /// exported from its block.
316 bool isExportedInst(const Value *V) {
317 return ValueMap.count(V);
320 unsigned CreateRegForValue(const Value *V);
322 unsigned InitializeRegForValue(const Value *V) {
323 unsigned &R = ValueMap[V];
324 assert(R == 0 && "Already initialized this value register!");
325 return R = CreateRegForValue(V);
329 unsigned NumSignBits;
330 APInt KnownOne, KnownZero;
331 LiveOutInfo() : NumSignBits(0) {}
334 /// LiveOutRegInfo - Information about live out vregs, indexed by their
335 /// register number offset by 'FirstVirtualRegister'.
336 std::vector<LiveOutInfo> LiveOutRegInfo;
340 /// isSelector - Return true if this instruction is a call to the
341 /// eh.selector intrinsic.
342 static bool isSelector(Instruction *I) {
343 if (IntrinsicInst *II = dyn_cast<IntrinsicInst>(I))
344 return (II->getIntrinsicID() == Intrinsic::eh_selector_i32 ||
345 II->getIntrinsicID() == Intrinsic::eh_selector_i64);
349 /// isUsedOutsideOfDefiningBlock - Return true if this instruction is used by
350 /// PHI nodes or outside of the basic block that defines it, or used by a
351 /// switch or atomic instruction, which may expand to multiple basic blocks.
352 static bool isUsedOutsideOfDefiningBlock(Instruction *I) {
353 if (isa<PHINode>(I)) return true;
354 BasicBlock *BB = I->getParent();
355 for (Value::use_iterator UI = I->use_begin(), E = I->use_end(); UI != E; ++UI)
356 if (cast<Instruction>(*UI)->getParent() != BB || isa<PHINode>(*UI) ||
357 // FIXME: Remove switchinst special case.
358 isa<SwitchInst>(*UI))
363 /// isOnlyUsedInEntryBlock - If the specified argument is only used in the
364 /// entry block, return true. This includes arguments used by switches, since
365 /// the switch may expand into multiple basic blocks.
366 static bool isOnlyUsedInEntryBlock(Argument *A) {
367 BasicBlock *Entry = A->getParent()->begin();
368 for (Value::use_iterator UI = A->use_begin(), E = A->use_end(); UI != E; ++UI)
369 if (cast<Instruction>(*UI)->getParent() != Entry || isa<SwitchInst>(*UI))
370 return false; // Use not in entry block.
374 FunctionLoweringInfo::FunctionLoweringInfo(TargetLowering &tli,
375 Function &fn, MachineFunction &mf)
376 : TLI(tli), Fn(fn), MF(mf), RegInfo(MF.getRegInfo()) {
378 // Create a vreg for each argument register that is not dead and is used
379 // outside of the entry block for the function.
380 for (Function::arg_iterator AI = Fn.arg_begin(), E = Fn.arg_end();
382 if (!isOnlyUsedInEntryBlock(AI))
383 InitializeRegForValue(AI);
385 // Initialize the mapping of values to registers. This is only set up for
386 // instruction values that are used outside of the block that defines
388 Function::iterator BB = Fn.begin(), EB = Fn.end();
389 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I)
390 if (AllocaInst *AI = dyn_cast<AllocaInst>(I))
391 if (ConstantInt *CUI = dyn_cast<ConstantInt>(AI->getArraySize())) {
392 const Type *Ty = AI->getAllocatedType();
393 uint64_t TySize = TLI.getTargetData()->getABITypeSize(Ty);
395 std::max((unsigned)TLI.getTargetData()->getPrefTypeAlignment(Ty),
398 TySize *= CUI->getZExtValue(); // Get total allocated size.
399 if (TySize == 0) TySize = 1; // Don't create zero-sized stack objects.
400 StaticAllocaMap[AI] =
401 MF.getFrameInfo()->CreateStackObject(TySize, Align);
404 for (; BB != EB; ++BB)
405 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I)
406 if (!I->use_empty() && isUsedOutsideOfDefiningBlock(I))
407 if (!isa<AllocaInst>(I) ||
408 !StaticAllocaMap.count(cast<AllocaInst>(I)))
409 InitializeRegForValue(I);
411 // Create an initial MachineBasicBlock for each LLVM BasicBlock in F. This
412 // also creates the initial PHI MachineInstrs, though none of the input
413 // operands are populated.
414 for (BB = Fn.begin(), EB = Fn.end(); BB != EB; ++BB) {
415 MachineBasicBlock *MBB = new MachineBasicBlock(BB);
417 MF.getBasicBlockList().push_back(MBB);
419 // Create Machine PHI nodes for LLVM PHI nodes, lowering them as
422 for (BasicBlock::iterator I = BB->begin();(PN = dyn_cast<PHINode>(I)); ++I){
423 if (PN->use_empty()) continue;
425 MVT VT = TLI.getValueType(PN->getType());
426 unsigned NumRegisters = TLI.getNumRegisters(VT);
427 unsigned PHIReg = ValueMap[PN];
428 assert(PHIReg && "PHI node does not have an assigned virtual register!");
429 const TargetInstrInfo *TII = TLI.getTargetMachine().getInstrInfo();
430 for (unsigned i = 0; i != NumRegisters; ++i)
431 BuildMI(MBB, TII->get(TargetInstrInfo::PHI), PHIReg+i);
436 /// CreateRegForValue - Allocate the appropriate number of virtual registers of
437 /// the correctly promoted or expanded types. Assign these registers
438 /// consecutive vreg numbers and return the first assigned number.
440 /// In the case that the given value has struct or array type, this function
441 /// will assign registers for each member or element.
443 unsigned FunctionLoweringInfo::CreateRegForValue(const Value *V) {
444 SmallVector<MVT, 4> ValueVTs;
445 ComputeValueVTs(TLI, V->getType(), ValueVTs);
447 unsigned FirstReg = 0;
448 for (unsigned Value = 0, e = ValueVTs.size(); Value != e; ++Value) {
449 MVT ValueVT = ValueVTs[Value];
450 MVT RegisterVT = TLI.getRegisterType(ValueVT);
452 unsigned NumRegs = TLI.getNumRegisters(ValueVT);
453 for (unsigned i = 0; i != NumRegs; ++i) {
454 unsigned R = MakeReg(RegisterVT);
455 if (!FirstReg) FirstReg = R;
461 //===----------------------------------------------------------------------===//
462 /// SelectionDAGLowering - This is the common target-independent lowering
463 /// implementation that is parameterized by a TargetLowering object.
464 /// Also, targets can overload any lowering method.
467 class SelectionDAGLowering {
468 MachineBasicBlock *CurMBB;
470 DenseMap<const Value*, SDOperand> NodeMap;
472 /// PendingLoads - Loads are not emitted to the program immediately. We bunch
473 /// them up and then emit token factor nodes when possible. This allows us to
474 /// get simple disambiguation between loads without worrying about alias
476 std::vector<SDOperand> PendingLoads;
478 /// PendingExports - CopyToReg nodes that copy values to virtual registers
479 /// for export to other blocks need to be emitted before any terminator
480 /// instruction, but they have no other ordering requirements. We bunch them
481 /// up and the emit a single tokenfactor for them just before terminator
483 std::vector<SDOperand> PendingExports;
485 /// Case - A struct to record the Value for a switch case, and the
486 /// case's target basic block.
490 MachineBasicBlock* BB;
492 Case() : Low(0), High(0), BB(0) { }
493 Case(Constant* low, Constant* high, MachineBasicBlock* bb) :
494 Low(low), High(high), BB(bb) { }
495 uint64_t size() const {
496 uint64_t rHigh = cast<ConstantInt>(High)->getSExtValue();
497 uint64_t rLow = cast<ConstantInt>(Low)->getSExtValue();
498 return (rHigh - rLow + 1ULL);
504 MachineBasicBlock* BB;
507 CaseBits(uint64_t mask, MachineBasicBlock* bb, unsigned bits):
508 Mask(mask), BB(bb), Bits(bits) { }
511 typedef std::vector<Case> CaseVector;
512 typedef std::vector<CaseBits> CaseBitsVector;
513 typedef CaseVector::iterator CaseItr;
514 typedef std::pair<CaseItr, CaseItr> CaseRange;
516 /// CaseRec - A struct with ctor used in lowering switches to a binary tree
517 /// of conditional branches.
519 CaseRec(MachineBasicBlock *bb, Constant *lt, Constant *ge, CaseRange r) :
520 CaseBB(bb), LT(lt), GE(ge), Range(r) {}
522 /// CaseBB - The MBB in which to emit the compare and branch
523 MachineBasicBlock *CaseBB;
524 /// LT, GE - If nonzero, we know the current case value must be less-than or
525 /// greater-than-or-equal-to these Constants.
528 /// Range - A pair of iterators representing the range of case values to be
529 /// processed at this point in the binary search tree.
533 typedef std::vector<CaseRec> CaseRecVector;
535 /// The comparison function for sorting the switch case values in the vector.
536 /// WARNING: Case ranges should be disjoint!
538 bool operator () (const Case& C1, const Case& C2) {
539 assert(isa<ConstantInt>(C1.Low) && isa<ConstantInt>(C2.High));
540 const ConstantInt* CI1 = cast<const ConstantInt>(C1.Low);
541 const ConstantInt* CI2 = cast<const ConstantInt>(C2.High);
542 return CI1->getValue().slt(CI2->getValue());
547 bool operator () (const CaseBits& C1, const CaseBits& C2) {
548 return C1.Bits > C2.Bits;
552 unsigned Clusterify(CaseVector& Cases, const SwitchInst &SI);
555 // TLI - This is information that describes the available target features we
556 // need for lowering. This indicates when operations are unavailable,
557 // implemented with a libcall, etc.
560 const TargetData *TD;
563 /// SwitchCases - Vector of CaseBlock structures used to communicate
564 /// SwitchInst code generation information.
565 std::vector<SelectionDAGISel::CaseBlock> SwitchCases;
566 /// JTCases - Vector of JumpTable structures used to communicate
567 /// SwitchInst code generation information.
568 std::vector<SelectionDAGISel::JumpTableBlock> JTCases;
569 std::vector<SelectionDAGISel::BitTestBlock> BitTestCases;
571 /// FuncInfo - Information about the function as a whole.
573 FunctionLoweringInfo &FuncInfo;
575 /// GCI - Garbage collection metadata for the function.
576 CollectorMetadata *GCI;
578 SelectionDAGLowering(SelectionDAG &dag, TargetLowering &tli,
580 FunctionLoweringInfo &funcinfo,
581 CollectorMetadata *gci)
582 : TLI(tli), DAG(dag), TD(DAG.getTarget().getTargetData()), AA(aa),
583 FuncInfo(funcinfo), GCI(gci) {
586 /// getRoot - Return the current virtual root of the Selection DAG,
587 /// flushing any PendingLoad items. This must be done before emitting
588 /// a store or any other node that may need to be ordered after any
589 /// prior load instructions.
591 SDOperand getRoot() {
592 if (PendingLoads.empty())
593 return DAG.getRoot();
595 if (PendingLoads.size() == 1) {
596 SDOperand Root = PendingLoads[0];
598 PendingLoads.clear();
602 // Otherwise, we have to make a token factor node.
603 SDOperand Root = DAG.getNode(ISD::TokenFactor, MVT::Other,
604 &PendingLoads[0], PendingLoads.size());
605 PendingLoads.clear();
610 /// getControlRoot - Similar to getRoot, but instead of flushing all the
611 /// PendingLoad items, flush all the PendingExports items. It is necessary
612 /// to do this before emitting a terminator instruction.
614 SDOperand getControlRoot() {
615 SDOperand Root = DAG.getRoot();
617 if (PendingExports.empty())
620 // Turn all of the CopyToReg chains into one factored node.
621 if (Root.getOpcode() != ISD::EntryToken) {
622 unsigned i = 0, e = PendingExports.size();
623 for (; i != e; ++i) {
624 assert(PendingExports[i].Val->getNumOperands() > 1);
625 if (PendingExports[i].Val->getOperand(0) == Root)
626 break; // Don't add the root if we already indirectly depend on it.
630 PendingExports.push_back(Root);
633 Root = DAG.getNode(ISD::TokenFactor, MVT::Other,
635 PendingExports.size());
636 PendingExports.clear();
641 void CopyValueToVirtualRegister(Value *V, unsigned Reg);
643 void visit(Instruction &I) { visit(I.getOpcode(), I); }
645 void visit(unsigned Opcode, User &I) {
646 // Note: this doesn't use InstVisitor, because it has to work with
647 // ConstantExpr's in addition to instructions.
649 default: assert(0 && "Unknown instruction type encountered!");
651 // Build the switch statement using the Instruction.def file.
652 #define HANDLE_INST(NUM, OPCODE, CLASS) \
653 case Instruction::OPCODE:return visit##OPCODE((CLASS&)I);
654 #include "llvm/Instruction.def"
658 void setCurrentBasicBlock(MachineBasicBlock *MBB) { CurMBB = MBB; }
660 SDOperand getValue(const Value *V);
662 void setValue(const Value *V, SDOperand NewN) {
663 SDOperand &N = NodeMap[V];
664 assert(N.Val == 0 && "Already set a value for this node!");
668 void GetRegistersForValue(SDISelAsmOperandInfo &OpInfo, bool HasEarlyClobber,
669 std::set<unsigned> &OutputRegs,
670 std::set<unsigned> &InputRegs);
672 void FindMergedConditions(Value *Cond, MachineBasicBlock *TBB,
673 MachineBasicBlock *FBB, MachineBasicBlock *CurBB,
675 bool isExportableFromCurrentBlock(Value *V, const BasicBlock *FromBB);
676 void ExportFromCurrentBlock(Value *V);
677 void LowerCallTo(CallSite CS, SDOperand Callee, bool IsTailCall,
678 MachineBasicBlock *LandingPad = NULL);
680 // Terminator instructions.
681 void visitRet(ReturnInst &I);
682 void visitBr(BranchInst &I);
683 void visitSwitch(SwitchInst &I);
684 void visitUnreachable(UnreachableInst &I) { /* noop */ }
686 // Helpers for visitSwitch
687 bool handleSmallSwitchRange(CaseRec& CR,
688 CaseRecVector& WorkList,
690 MachineBasicBlock* Default);
691 bool handleJTSwitchCase(CaseRec& CR,
692 CaseRecVector& WorkList,
694 MachineBasicBlock* Default);
695 bool handleBTSplitSwitchCase(CaseRec& CR,
696 CaseRecVector& WorkList,
698 MachineBasicBlock* Default);
699 bool handleBitTestsSwitchCase(CaseRec& CR,
700 CaseRecVector& WorkList,
702 MachineBasicBlock* Default);
703 void visitSwitchCase(SelectionDAGISel::CaseBlock &CB);
704 void visitBitTestHeader(SelectionDAGISel::BitTestBlock &B);
705 void visitBitTestCase(MachineBasicBlock* NextMBB,
707 SelectionDAGISel::BitTestCase &B);
708 void visitJumpTable(SelectionDAGISel::JumpTable &JT);
709 void visitJumpTableHeader(SelectionDAGISel::JumpTable &JT,
710 SelectionDAGISel::JumpTableHeader &JTH);
712 // These all get lowered before this pass.
713 void visitInvoke(InvokeInst &I);
714 void visitUnwind(UnwindInst &I);
716 void visitBinary(User &I, unsigned OpCode);
717 void visitShift(User &I, unsigned Opcode);
718 void visitAdd(User &I) {
719 if (I.getType()->isFPOrFPVector())
720 visitBinary(I, ISD::FADD);
722 visitBinary(I, ISD::ADD);
724 void visitSub(User &I);
725 void visitMul(User &I) {
726 if (I.getType()->isFPOrFPVector())
727 visitBinary(I, ISD::FMUL);
729 visitBinary(I, ISD::MUL);
731 void visitURem(User &I) { visitBinary(I, ISD::UREM); }
732 void visitSRem(User &I) { visitBinary(I, ISD::SREM); }
733 void visitFRem(User &I) { visitBinary(I, ISD::FREM); }
734 void visitUDiv(User &I) { visitBinary(I, ISD::UDIV); }
735 void visitSDiv(User &I) { visitBinary(I, ISD::SDIV); }
736 void visitFDiv(User &I) { visitBinary(I, ISD::FDIV); }
737 void visitAnd (User &I) { visitBinary(I, ISD::AND); }
738 void visitOr (User &I) { visitBinary(I, ISD::OR); }
739 void visitXor (User &I) { visitBinary(I, ISD::XOR); }
740 void visitShl (User &I) { visitShift(I, ISD::SHL); }
741 void visitLShr(User &I) { visitShift(I, ISD::SRL); }
742 void visitAShr(User &I) { visitShift(I, ISD::SRA); }
743 void visitICmp(User &I);
744 void visitFCmp(User &I);
745 void visitVICmp(User &I);
746 void visitVFCmp(User &I);
747 // Visit the conversion instructions
748 void visitTrunc(User &I);
749 void visitZExt(User &I);
750 void visitSExt(User &I);
751 void visitFPTrunc(User &I);
752 void visitFPExt(User &I);
753 void visitFPToUI(User &I);
754 void visitFPToSI(User &I);
755 void visitUIToFP(User &I);
756 void visitSIToFP(User &I);
757 void visitPtrToInt(User &I);
758 void visitIntToPtr(User &I);
759 void visitBitCast(User &I);
761 void visitExtractElement(User &I);
762 void visitInsertElement(User &I);
763 void visitShuffleVector(User &I);
765 void visitExtractValue(ExtractValueInst &I);
766 void visitInsertValue(InsertValueInst &I);
768 void visitGetElementPtr(User &I);
769 void visitSelect(User &I);
771 void visitMalloc(MallocInst &I);
772 void visitFree(FreeInst &I);
773 void visitAlloca(AllocaInst &I);
774 void visitLoad(LoadInst &I);
775 void visitStore(StoreInst &I);
776 void visitPHI(PHINode &I) { } // PHI nodes are handled specially.
777 void visitCall(CallInst &I);
778 void visitInlineAsm(CallSite CS);
779 const char *visitIntrinsicCall(CallInst &I, unsigned Intrinsic);
780 void visitTargetIntrinsic(CallInst &I, unsigned Intrinsic);
782 void visitVAStart(CallInst &I);
783 void visitVAArg(VAArgInst &I);
784 void visitVAEnd(CallInst &I);
785 void visitVACopy(CallInst &I);
787 void visitGetResult(GetResultInst &I);
789 void visitUserOp1(Instruction &I) {
790 assert(0 && "UserOp1 should not exist at instruction selection time!");
793 void visitUserOp2(Instruction &I) {
794 assert(0 && "UserOp2 should not exist at instruction selection time!");
799 inline const char *implVisitBinaryAtomic(CallInst& I, ISD::NodeType Op);
802 } // end namespace llvm
805 /// getCopyFromParts - Create a value that contains the specified legal parts
806 /// combined into the value they represent. If the parts combine to a type
807 /// larger then ValueVT then AssertOp can be used to specify whether the extra
808 /// bits are known to be zero (ISD::AssertZext) or sign extended from ValueVT
809 /// (ISD::AssertSext).
810 static SDOperand getCopyFromParts(SelectionDAG &DAG,
811 const SDOperand *Parts,
815 ISD::NodeType AssertOp = ISD::DELETED_NODE) {
816 assert(NumParts > 0 && "No parts to assemble!");
817 TargetLowering &TLI = DAG.getTargetLoweringInfo();
818 SDOperand Val = Parts[0];
821 // Assemble the value from multiple parts.
822 if (!ValueVT.isVector()) {
823 unsigned PartBits = PartVT.getSizeInBits();
824 unsigned ValueBits = ValueVT.getSizeInBits();
826 // Assemble the power of 2 part.
827 unsigned RoundParts = NumParts & (NumParts - 1) ?
828 1 << Log2_32(NumParts) : NumParts;
829 unsigned RoundBits = PartBits * RoundParts;
830 MVT RoundVT = RoundBits == ValueBits ?
831 ValueVT : MVT::getIntegerVT(RoundBits);
834 if (RoundParts > 2) {
835 MVT HalfVT = MVT::getIntegerVT(RoundBits/2);
836 Lo = getCopyFromParts(DAG, Parts, RoundParts/2, PartVT, HalfVT);
837 Hi = getCopyFromParts(DAG, Parts+RoundParts/2, RoundParts/2,
843 if (TLI.isBigEndian())
845 Val = DAG.getNode(ISD::BUILD_PAIR, RoundVT, Lo, Hi);
847 if (RoundParts < NumParts) {
848 // Assemble the trailing non-power-of-2 part.
849 unsigned OddParts = NumParts - RoundParts;
850 MVT OddVT = MVT::getIntegerVT(OddParts * PartBits);
851 Hi = getCopyFromParts(DAG, Parts+RoundParts, OddParts, PartVT, OddVT);
853 // Combine the round and odd parts.
855 if (TLI.isBigEndian())
857 MVT TotalVT = MVT::getIntegerVT(NumParts * PartBits);
858 Hi = DAG.getNode(ISD::ANY_EXTEND, TotalVT, Hi);
859 Hi = DAG.getNode(ISD::SHL, TotalVT, Hi,
860 DAG.getConstant(Lo.getValueType().getSizeInBits(),
861 TLI.getShiftAmountTy()));
862 Lo = DAG.getNode(ISD::ZERO_EXTEND, TotalVT, Lo);
863 Val = DAG.getNode(ISD::OR, TotalVT, Lo, Hi);
866 // Handle a multi-element vector.
867 MVT IntermediateVT, RegisterVT;
868 unsigned NumIntermediates;
870 TLI.getVectorTypeBreakdown(ValueVT, IntermediateVT, NumIntermediates,
872 assert(NumRegs == NumParts && "Part count doesn't match vector breakdown!");
873 NumParts = NumRegs; // Silence a compiler warning.
874 assert(RegisterVT == PartVT && "Part type doesn't match vector breakdown!");
875 assert(RegisterVT == Parts[0].getValueType() &&
876 "Part type doesn't match part!");
878 // Assemble the parts into intermediate operands.
879 SmallVector<SDOperand, 8> Ops(NumIntermediates);
880 if (NumIntermediates == NumParts) {
881 // If the register was not expanded, truncate or copy the value,
883 for (unsigned i = 0; i != NumParts; ++i)
884 Ops[i] = getCopyFromParts(DAG, &Parts[i], 1,
885 PartVT, IntermediateVT);
886 } else if (NumParts > 0) {
887 // If the intermediate type was expanded, build the intermediate operands
889 assert(NumParts % NumIntermediates == 0 &&
890 "Must expand into a divisible number of parts!");
891 unsigned Factor = NumParts / NumIntermediates;
892 for (unsigned i = 0; i != NumIntermediates; ++i)
893 Ops[i] = getCopyFromParts(DAG, &Parts[i * Factor], Factor,
894 PartVT, IntermediateVT);
897 // Build a vector with BUILD_VECTOR or CONCAT_VECTORS from the intermediate
899 Val = DAG.getNode(IntermediateVT.isVector() ?
900 ISD::CONCAT_VECTORS : ISD::BUILD_VECTOR,
901 ValueVT, &Ops[0], NumIntermediates);
905 // There is now one part, held in Val. Correct it to match ValueVT.
906 PartVT = Val.getValueType();
908 if (PartVT == ValueVT)
911 if (PartVT.isVector()) {
912 assert(ValueVT.isVector() && "Unknown vector conversion!");
913 return DAG.getNode(ISD::BIT_CONVERT, ValueVT, Val);
916 if (ValueVT.isVector()) {
917 assert(ValueVT.getVectorElementType() == PartVT &&
918 ValueVT.getVectorNumElements() == 1 &&
919 "Only trivial scalar-to-vector conversions should get here!");
920 return DAG.getNode(ISD::BUILD_VECTOR, ValueVT, Val);
923 if (PartVT.isInteger() &&
924 ValueVT.isInteger()) {
925 if (ValueVT.bitsLT(PartVT)) {
926 // For a truncate, see if we have any information to
927 // indicate whether the truncated bits will always be
928 // zero or sign-extension.
929 if (AssertOp != ISD::DELETED_NODE)
930 Val = DAG.getNode(AssertOp, PartVT, Val,
931 DAG.getValueType(ValueVT));
932 return DAG.getNode(ISD::TRUNCATE, ValueVT, Val);
934 return DAG.getNode(ISD::ANY_EXTEND, ValueVT, Val);
938 if (PartVT.isFloatingPoint() && ValueVT.isFloatingPoint()) {
939 if (ValueVT.bitsLT(Val.getValueType()))
940 // FP_ROUND's are always exact here.
941 return DAG.getNode(ISD::FP_ROUND, ValueVT, Val,
942 DAG.getIntPtrConstant(1));
943 return DAG.getNode(ISD::FP_EXTEND, ValueVT, Val);
946 if (PartVT.getSizeInBits() == ValueVT.getSizeInBits())
947 return DAG.getNode(ISD::BIT_CONVERT, ValueVT, Val);
949 assert(0 && "Unknown mismatch!");
953 /// getCopyToParts - Create a series of nodes that contain the specified value
954 /// split into legal parts. If the parts contain more bits than Val, then, for
955 /// integers, ExtendKind can be used to specify how to generate the extra bits.
956 static void getCopyToParts(SelectionDAG &DAG,
961 ISD::NodeType ExtendKind = ISD::ANY_EXTEND) {
962 TargetLowering &TLI = DAG.getTargetLoweringInfo();
963 MVT PtrVT = TLI.getPointerTy();
964 MVT ValueVT = Val.getValueType();
965 unsigned PartBits = PartVT.getSizeInBits();
966 assert(TLI.isTypeLegal(PartVT) && "Copying to an illegal type!");
971 if (!ValueVT.isVector()) {
972 if (PartVT == ValueVT) {
973 assert(NumParts == 1 && "No-op copy with multiple parts!");
978 if (NumParts * PartBits > ValueVT.getSizeInBits()) {
979 // If the parts cover more bits than the value has, promote the value.
980 if (PartVT.isFloatingPoint() && ValueVT.isFloatingPoint()) {
981 assert(NumParts == 1 && "Do not know what to promote to!");
982 Val = DAG.getNode(ISD::FP_EXTEND, PartVT, Val);
983 } else if (PartVT.isInteger() && ValueVT.isInteger()) {
984 ValueVT = MVT::getIntegerVT(NumParts * PartBits);
985 Val = DAG.getNode(ExtendKind, ValueVT, Val);
987 assert(0 && "Unknown mismatch!");
989 } else if (PartBits == ValueVT.getSizeInBits()) {
990 // Different types of the same size.
991 assert(NumParts == 1 && PartVT != ValueVT);
992 Val = DAG.getNode(ISD::BIT_CONVERT, PartVT, Val);
993 } else if (NumParts * PartBits < ValueVT.getSizeInBits()) {
994 // If the parts cover less bits than value has, truncate the value.
995 if (PartVT.isInteger() && ValueVT.isInteger()) {
996 ValueVT = MVT::getIntegerVT(NumParts * PartBits);
997 Val = DAG.getNode(ISD::TRUNCATE, ValueVT, Val);
999 assert(0 && "Unknown mismatch!");
1003 // The value may have changed - recompute ValueVT.
1004 ValueVT = Val.getValueType();
1005 assert(NumParts * PartBits == ValueVT.getSizeInBits() &&
1006 "Failed to tile the value with PartVT!");
1008 if (NumParts == 1) {
1009 assert(PartVT == ValueVT && "Type conversion failed!");
1014 // Expand the value into multiple parts.
1015 if (NumParts & (NumParts - 1)) {
1016 // The number of parts is not a power of 2. Split off and copy the tail.
1017 assert(PartVT.isInteger() && ValueVT.isInteger() &&
1018 "Do not know what to expand to!");
1019 unsigned RoundParts = 1 << Log2_32(NumParts);
1020 unsigned RoundBits = RoundParts * PartBits;
1021 unsigned OddParts = NumParts - RoundParts;
1022 SDOperand OddVal = DAG.getNode(ISD::SRL, ValueVT, Val,
1023 DAG.getConstant(RoundBits,
1024 TLI.getShiftAmountTy()));
1025 getCopyToParts(DAG, OddVal, Parts + RoundParts, OddParts, PartVT);
1026 if (TLI.isBigEndian())
1027 // The odd parts were reversed by getCopyToParts - unreverse them.
1028 std::reverse(Parts + RoundParts, Parts + NumParts);
1029 NumParts = RoundParts;
1030 ValueVT = MVT::getIntegerVT(NumParts * PartBits);
1031 Val = DAG.getNode(ISD::TRUNCATE, ValueVT, Val);
1034 // The number of parts is a power of 2. Repeatedly bisect the value using
1036 Parts[0] = DAG.getNode(ISD::BIT_CONVERT,
1037 MVT::getIntegerVT(ValueVT.getSizeInBits()),
1039 for (unsigned StepSize = NumParts; StepSize > 1; StepSize /= 2) {
1040 for (unsigned i = 0; i < NumParts; i += StepSize) {
1041 unsigned ThisBits = StepSize * PartBits / 2;
1042 MVT ThisVT = MVT::getIntegerVT (ThisBits);
1043 SDOperand &Part0 = Parts[i];
1044 SDOperand &Part1 = Parts[i+StepSize/2];
1046 Part1 = DAG.getNode(ISD::EXTRACT_ELEMENT, ThisVT, Part0,
1047 DAG.getConstant(1, PtrVT));
1048 Part0 = DAG.getNode(ISD::EXTRACT_ELEMENT, ThisVT, Part0,
1049 DAG.getConstant(0, PtrVT));
1051 if (ThisBits == PartBits && ThisVT != PartVT) {
1052 Part0 = DAG.getNode(ISD::BIT_CONVERT, PartVT, Part0);
1053 Part1 = DAG.getNode(ISD::BIT_CONVERT, PartVT, Part1);
1058 if (TLI.isBigEndian())
1059 std::reverse(Parts, Parts + NumParts);
1065 if (NumParts == 1) {
1066 if (PartVT != ValueVT) {
1067 if (PartVT.isVector()) {
1068 Val = DAG.getNode(ISD::BIT_CONVERT, PartVT, Val);
1070 assert(ValueVT.getVectorElementType() == PartVT &&
1071 ValueVT.getVectorNumElements() == 1 &&
1072 "Only trivial vector-to-scalar conversions should get here!");
1073 Val = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, PartVT, Val,
1074 DAG.getConstant(0, PtrVT));
1082 // Handle a multi-element vector.
1083 MVT IntermediateVT, RegisterVT;
1084 unsigned NumIntermediates;
1086 DAG.getTargetLoweringInfo()
1087 .getVectorTypeBreakdown(ValueVT, IntermediateVT, NumIntermediates,
1089 unsigned NumElements = ValueVT.getVectorNumElements();
1091 assert(NumRegs == NumParts && "Part count doesn't match vector breakdown!");
1092 NumParts = NumRegs; // Silence a compiler warning.
1093 assert(RegisterVT == PartVT && "Part type doesn't match vector breakdown!");
1095 // Split the vector into intermediate operands.
1096 SmallVector<SDOperand, 8> Ops(NumIntermediates);
1097 for (unsigned i = 0; i != NumIntermediates; ++i)
1098 if (IntermediateVT.isVector())
1099 Ops[i] = DAG.getNode(ISD::EXTRACT_SUBVECTOR,
1100 IntermediateVT, Val,
1101 DAG.getConstant(i * (NumElements / NumIntermediates),
1104 Ops[i] = DAG.getNode(ISD::EXTRACT_VECTOR_ELT,
1105 IntermediateVT, Val,
1106 DAG.getConstant(i, PtrVT));
1108 // Split the intermediate operands into legal parts.
1109 if (NumParts == NumIntermediates) {
1110 // If the register was not expanded, promote or copy the value,
1112 for (unsigned i = 0; i != NumParts; ++i)
1113 getCopyToParts(DAG, Ops[i], &Parts[i], 1, PartVT);
1114 } else if (NumParts > 0) {
1115 // If the intermediate type was expanded, split each the value into
1117 assert(NumParts % NumIntermediates == 0 &&
1118 "Must expand into a divisible number of parts!");
1119 unsigned Factor = NumParts / NumIntermediates;
1120 for (unsigned i = 0; i != NumIntermediates; ++i)
1121 getCopyToParts(DAG, Ops[i], &Parts[i * Factor], Factor, PartVT);
1126 SDOperand SelectionDAGLowering::getValue(const Value *V) {
1127 SDOperand &N = NodeMap[V];
1128 if (N.Val) return N;
1130 if (Constant *C = const_cast<Constant*>(dyn_cast<Constant>(V))) {
1131 MVT VT = TLI.getValueType(V->getType(), true);
1133 if (ConstantInt *CI = dyn_cast<ConstantInt>(C))
1134 return N = DAG.getConstant(CI->getValue(), VT);
1136 if (GlobalValue *GV = dyn_cast<GlobalValue>(C))
1137 return N = DAG.getGlobalAddress(GV, VT);
1139 if (isa<ConstantPointerNull>(C))
1140 return N = DAG.getConstant(0, TLI.getPointerTy());
1142 if (ConstantFP *CFP = dyn_cast<ConstantFP>(C))
1143 return N = DAG.getConstantFP(CFP->getValueAPF(), VT);
1145 if (isa<UndefValue>(C) && !isa<VectorType>(V->getType()) &&
1146 !V->getType()->isAggregateType())
1147 return N = DAG.getNode(ISD::UNDEF, VT);
1149 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(C)) {
1150 visit(CE->getOpcode(), *CE);
1151 SDOperand N1 = NodeMap[V];
1152 assert(N1.Val && "visit didn't populate the ValueMap!");
1156 if (isa<ConstantStruct>(C) || isa<ConstantArray>(C)) {
1157 SmallVector<SDOperand, 4> Constants;
1158 SmallVector<MVT, 4> ValueVTs;
1159 for (User::const_op_iterator OI = C->op_begin(), OE = C->op_end();
1161 SDNode *Val = getValue(*OI).Val;
1162 for (unsigned i = 0, e = Val->getNumValues(); i != e; ++i) {
1163 Constants.push_back(SDOperand(Val, i));
1164 ValueVTs.push_back(Val->getValueType(i));
1167 return DAG.getNode(ISD::MERGE_VALUES,
1168 DAG.getVTList(&ValueVTs[0], ValueVTs.size()),
1169 &Constants[0], Constants.size());
1172 if (const ArrayType *ATy = dyn_cast<ArrayType>(C->getType())) {
1173 assert((isa<ConstantAggregateZero>(C) || isa<UndefValue>(C)) &&
1174 "Unknown array constant!");
1175 unsigned NumElts = ATy->getNumElements();
1177 return SDOperand(); // empty array
1178 MVT EltVT = TLI.getValueType(ATy->getElementType());
1179 SmallVector<SDOperand, 4> Constants(NumElts);
1180 SmallVector<MVT, 4> ValueVTs(NumElts, EltVT);
1181 for (unsigned i = 0, e = NumElts; i != e; ++i) {
1182 if (isa<UndefValue>(C))
1183 Constants[i] = DAG.getNode(ISD::UNDEF, EltVT);
1184 else if (EltVT.isFloatingPoint())
1185 Constants[i] = DAG.getConstantFP(0, EltVT);
1187 Constants[i] = DAG.getConstant(0, EltVT);
1189 return DAG.getNode(ISD::MERGE_VALUES,
1190 DAG.getVTList(&ValueVTs[0], ValueVTs.size()),
1191 &Constants[0], Constants.size());
1194 if (const StructType *STy = dyn_cast<StructType>(C->getType())) {
1195 assert((isa<ConstantAggregateZero>(C) || isa<UndefValue>(C)) &&
1196 "Unknown struct constant!");
1197 unsigned NumElts = STy->getNumElements();
1199 return SDOperand(); // empty struct
1200 SmallVector<SDOperand, 4> Constants(NumElts);
1201 SmallVector<MVT, 4> ValueVTs(NumElts);
1202 for (unsigned i = 0, e = NumElts; i != e; ++i) {
1203 MVT EltVT = TLI.getValueType(STy->getElementType(i));
1204 ValueVTs[i] = EltVT;
1205 if (isa<UndefValue>(C))
1206 Constants[i] = DAG.getNode(ISD::UNDEF, EltVT);
1207 else if (EltVT.isFloatingPoint())
1208 Constants[i] = DAG.getConstantFP(0, EltVT);
1210 Constants[i] = DAG.getConstant(0, EltVT);
1212 return DAG.getNode(ISD::MERGE_VALUES,
1213 DAG.getVTList(&ValueVTs[0], ValueVTs.size()),
1214 &Constants[0], Constants.size());
1217 const VectorType *VecTy = cast<VectorType>(V->getType());
1218 unsigned NumElements = VecTy->getNumElements();
1220 // Now that we know the number and type of the elements, get that number of
1221 // elements into the Ops array based on what kind of constant it is.
1222 SmallVector<SDOperand, 16> Ops;
1223 if (ConstantVector *CP = dyn_cast<ConstantVector>(C)) {
1224 for (unsigned i = 0; i != NumElements; ++i)
1225 Ops.push_back(getValue(CP->getOperand(i)));
1227 assert((isa<ConstantAggregateZero>(C) || isa<UndefValue>(C)) &&
1228 "Unknown vector constant!");
1229 MVT EltVT = TLI.getValueType(VecTy->getElementType());
1232 if (isa<UndefValue>(C))
1233 Op = DAG.getNode(ISD::UNDEF, EltVT);
1234 else if (EltVT.isFloatingPoint())
1235 Op = DAG.getConstantFP(0, EltVT);
1237 Op = DAG.getConstant(0, EltVT);
1238 Ops.assign(NumElements, Op);
1241 // Create a BUILD_VECTOR node.
1242 return NodeMap[V] = DAG.getNode(ISD::BUILD_VECTOR, VT, &Ops[0], Ops.size());
1245 // If this is a static alloca, generate it as the frameindex instead of
1247 if (const AllocaInst *AI = dyn_cast<AllocaInst>(V)) {
1248 std::map<const AllocaInst*, int>::iterator SI =
1249 FuncInfo.StaticAllocaMap.find(AI);
1250 if (SI != FuncInfo.StaticAllocaMap.end())
1251 return DAG.getFrameIndex(SI->second, TLI.getPointerTy());
1254 unsigned InReg = FuncInfo.ValueMap[V];
1255 assert(InReg && "Value not in map!");
1257 RegsForValue RFV(TLI, InReg, V->getType());
1258 SDOperand Chain = DAG.getEntryNode();
1259 return RFV.getCopyFromRegs(DAG, Chain, NULL);
1263 void SelectionDAGLowering::visitRet(ReturnInst &I) {
1264 if (I.getNumOperands() == 0) {
1265 DAG.setRoot(DAG.getNode(ISD::RET, MVT::Other, getControlRoot()));
1269 SmallVector<SDOperand, 8> NewValues;
1270 NewValues.push_back(getControlRoot());
1271 for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i) {
1272 SDOperand RetOp = getValue(I.getOperand(i));
1274 SmallVector<MVT, 4> ValueVTs;
1275 ComputeValueVTs(TLI, I.getOperand(i)->getType(), ValueVTs);
1276 for (unsigned j = 0, f = ValueVTs.size(); j != f; ++j) {
1277 MVT VT = ValueVTs[j];
1279 // FIXME: C calling convention requires the return type to be promoted to
1280 // at least 32-bit. But this is not necessary for non-C calling conventions.
1281 if (VT.isInteger()) {
1282 MVT MinVT = TLI.getRegisterType(MVT::i32);
1283 if (VT.bitsLT(MinVT))
1287 unsigned NumParts = TLI.getNumRegisters(VT);
1288 MVT PartVT = TLI.getRegisterType(VT);
1289 SmallVector<SDOperand, 4> Parts(NumParts);
1290 ISD::NodeType ExtendKind = ISD::ANY_EXTEND;
1292 const Function *F = I.getParent()->getParent();
1293 if (F->paramHasAttr(0, ParamAttr::SExt))
1294 ExtendKind = ISD::SIGN_EXTEND;
1295 else if (F->paramHasAttr(0, ParamAttr::ZExt))
1296 ExtendKind = ISD::ZERO_EXTEND;
1298 getCopyToParts(DAG, SDOperand(RetOp.Val, RetOp.ResNo + j),
1299 &Parts[0], NumParts, PartVT, ExtendKind);
1301 for (unsigned i = 0; i < NumParts; ++i) {
1302 NewValues.push_back(Parts[i]);
1303 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(Agg.ResNo + i)) :
2749 SDOperand(Agg.Val, Agg.ResNo + i);
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(),
3094 DAG.setRoot(L.getValue(1));
3098 /// visitIntrinsicCall - Lower the call to the specified intrinsic function. If
3099 /// we want to emit this as a call to a named external function, return the name
3100 /// otherwise lower it and return null.
3102 SelectionDAGLowering::visitIntrinsicCall(CallInst &I, unsigned Intrinsic) {
3103 switch (Intrinsic) {
3105 // By default, turn this into a target intrinsic node.
3106 visitTargetIntrinsic(I, Intrinsic);
3108 case Intrinsic::vastart: visitVAStart(I); return 0;
3109 case Intrinsic::vaend: visitVAEnd(I); return 0;
3110 case Intrinsic::vacopy: visitVACopy(I); return 0;
3111 case Intrinsic::returnaddress:
3112 setValue(&I, DAG.getNode(ISD::RETURNADDR, TLI.getPointerTy(),
3113 getValue(I.getOperand(1))));
3115 case Intrinsic::frameaddress:
3116 setValue(&I, DAG.getNode(ISD::FRAMEADDR, TLI.getPointerTy(),
3117 getValue(I.getOperand(1))));
3119 case Intrinsic::setjmp:
3120 return "_setjmp"+!TLI.usesUnderscoreSetJmp();
3122 case Intrinsic::longjmp:
3123 return "_longjmp"+!TLI.usesUnderscoreLongJmp();
3125 case Intrinsic::memcpy_i32:
3126 case Intrinsic::memcpy_i64: {
3127 SDOperand Op1 = getValue(I.getOperand(1));
3128 SDOperand Op2 = getValue(I.getOperand(2));
3129 SDOperand Op3 = getValue(I.getOperand(3));
3130 unsigned Align = cast<ConstantInt>(I.getOperand(4))->getZExtValue();
3131 DAG.setRoot(DAG.getMemcpy(getRoot(), Op1, Op2, Op3, Align, false,
3132 I.getOperand(1), 0, I.getOperand(2), 0));
3135 case Intrinsic::memset_i32:
3136 case Intrinsic::memset_i64: {
3137 SDOperand Op1 = getValue(I.getOperand(1));
3138 SDOperand Op2 = getValue(I.getOperand(2));
3139 SDOperand Op3 = getValue(I.getOperand(3));
3140 unsigned Align = cast<ConstantInt>(I.getOperand(4))->getZExtValue();
3141 DAG.setRoot(DAG.getMemset(getRoot(), Op1, Op2, Op3, Align,
3142 I.getOperand(1), 0));
3145 case Intrinsic::memmove_i32:
3146 case Intrinsic::memmove_i64: {
3147 SDOperand Op1 = getValue(I.getOperand(1));
3148 SDOperand Op2 = getValue(I.getOperand(2));
3149 SDOperand Op3 = getValue(I.getOperand(3));
3150 unsigned Align = cast<ConstantInt>(I.getOperand(4))->getZExtValue();
3152 // If the source and destination are known to not be aliases, we can
3153 // lower memmove as memcpy.
3154 uint64_t Size = -1ULL;
3155 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op3))
3156 Size = C->getValue();
3157 if (AA.alias(I.getOperand(1), Size, I.getOperand(2), Size) ==
3158 AliasAnalysis::NoAlias) {
3159 DAG.setRoot(DAG.getMemcpy(getRoot(), Op1, Op2, Op3, Align, false,
3160 I.getOperand(1), 0, I.getOperand(2), 0));
3164 DAG.setRoot(DAG.getMemmove(getRoot(), Op1, Op2, Op3, Align,
3165 I.getOperand(1), 0, I.getOperand(2), 0));
3168 case Intrinsic::dbg_stoppoint: {
3169 MachineModuleInfo *MMI = DAG.getMachineModuleInfo();
3170 DbgStopPointInst &SPI = cast<DbgStopPointInst>(I);
3171 if (MMI && SPI.getContext() && MMI->Verify(SPI.getContext())) {
3175 Ops[1] = getValue(SPI.getLineValue());
3176 Ops[2] = getValue(SPI.getColumnValue());
3178 DebugInfoDesc *DD = MMI->getDescFor(SPI.getContext());
3179 assert(DD && "Not a debug information descriptor");
3180 CompileUnitDesc *CompileUnit = cast<CompileUnitDesc>(DD);
3182 Ops[3] = DAG.getString(CompileUnit->getFileName());
3183 Ops[4] = DAG.getString(CompileUnit->getDirectory());
3185 DAG.setRoot(DAG.getNode(ISD::LOCATION, MVT::Other, Ops, 5));
3190 case Intrinsic::dbg_region_start: {
3191 MachineModuleInfo *MMI = DAG.getMachineModuleInfo();
3192 DbgRegionStartInst &RSI = cast<DbgRegionStartInst>(I);
3193 if (MMI && RSI.getContext() && MMI->Verify(RSI.getContext())) {
3194 unsigned LabelID = MMI->RecordRegionStart(RSI.getContext());
3195 DAG.setRoot(DAG.getNode(ISD::LABEL, MVT::Other, getRoot(),
3196 DAG.getConstant(LabelID, MVT::i32),
3197 DAG.getConstant(0, MVT::i32)));
3202 case Intrinsic::dbg_region_end: {
3203 MachineModuleInfo *MMI = DAG.getMachineModuleInfo();
3204 DbgRegionEndInst &REI = cast<DbgRegionEndInst>(I);
3205 if (MMI && REI.getContext() && MMI->Verify(REI.getContext())) {
3206 unsigned LabelID = MMI->RecordRegionEnd(REI.getContext());
3207 DAG.setRoot(DAG.getNode(ISD::LABEL, MVT::Other, getRoot(),
3208 DAG.getConstant(LabelID, MVT::i32),
3209 DAG.getConstant(0, MVT::i32)));
3214 case Intrinsic::dbg_func_start: {
3215 MachineModuleInfo *MMI = DAG.getMachineModuleInfo();
3217 DbgFuncStartInst &FSI = cast<DbgFuncStartInst>(I);
3218 Value *SP = FSI.getSubprogram();
3219 if (SP && MMI->Verify(SP)) {
3220 // llvm.dbg.func.start implicitly defines a dbg_stoppoint which is
3221 // what (most?) gdb expects.
3222 DebugInfoDesc *DD = MMI->getDescFor(SP);
3223 assert(DD && "Not a debug information descriptor");
3224 SubprogramDesc *Subprogram = cast<SubprogramDesc>(DD);
3225 const CompileUnitDesc *CompileUnit = Subprogram->getFile();
3226 unsigned SrcFile = MMI->RecordSource(CompileUnit->getDirectory(),
3227 CompileUnit->getFileName());
3228 // Record the source line but does create a label. It will be emitted
3229 // at asm emission time.
3230 MMI->RecordSourceLine(Subprogram->getLine(), 0, SrcFile);
3235 case Intrinsic::dbg_declare: {
3236 MachineModuleInfo *MMI = DAG.getMachineModuleInfo();
3237 DbgDeclareInst &DI = cast<DbgDeclareInst>(I);
3238 Value *Variable = DI.getVariable();
3239 if (MMI && Variable && MMI->Verify(Variable))
3240 DAG.setRoot(DAG.getNode(ISD::DECLARE, MVT::Other, getRoot(),
3241 getValue(DI.getAddress()), getValue(Variable)));
3245 case Intrinsic::eh_exception: {
3246 if (!CurMBB->isLandingPad()) {
3247 // FIXME: Mark exception register as live in. Hack for PR1508.
3248 unsigned Reg = TLI.getExceptionAddressRegister();
3249 if (Reg) CurMBB->addLiveIn(Reg);
3251 // Insert the EXCEPTIONADDR instruction.
3252 SDVTList VTs = DAG.getVTList(TLI.getPointerTy(), MVT::Other);
3254 Ops[0] = DAG.getRoot();
3255 SDOperand Op = DAG.getNode(ISD::EXCEPTIONADDR, VTs, Ops, 1);
3257 DAG.setRoot(Op.getValue(1));
3261 case Intrinsic::eh_selector_i32:
3262 case Intrinsic::eh_selector_i64: {
3263 MachineModuleInfo *MMI = DAG.getMachineModuleInfo();
3264 MVT VT = (Intrinsic == Intrinsic::eh_selector_i32 ?
3265 MVT::i32 : MVT::i64);
3268 if (CurMBB->isLandingPad())
3269 addCatchInfo(I, MMI, CurMBB);
3272 FuncInfo.CatchInfoLost.insert(&I);
3274 // FIXME: Mark exception selector register as live in. Hack for PR1508.
3275 unsigned Reg = TLI.getExceptionSelectorRegister();
3276 if (Reg) CurMBB->addLiveIn(Reg);
3279 // Insert the EHSELECTION instruction.
3280 SDVTList VTs = DAG.getVTList(VT, MVT::Other);
3282 Ops[0] = getValue(I.getOperand(1));
3284 SDOperand Op = DAG.getNode(ISD::EHSELECTION, VTs, Ops, 2);
3286 DAG.setRoot(Op.getValue(1));
3288 setValue(&I, DAG.getConstant(0, VT));
3294 case Intrinsic::eh_typeid_for_i32:
3295 case Intrinsic::eh_typeid_for_i64: {
3296 MachineModuleInfo *MMI = DAG.getMachineModuleInfo();
3297 MVT VT = (Intrinsic == Intrinsic::eh_typeid_for_i32 ?
3298 MVT::i32 : MVT::i64);
3301 // Find the type id for the given typeinfo.
3302 GlobalVariable *GV = ExtractTypeInfo(I.getOperand(1));
3304 unsigned TypeID = MMI->getTypeIDFor(GV);
3305 setValue(&I, DAG.getConstant(TypeID, VT));
3307 // Return something different to eh_selector.
3308 setValue(&I, DAG.getConstant(1, VT));
3314 case Intrinsic::eh_return: {
3315 MachineModuleInfo *MMI = DAG.getMachineModuleInfo();
3318 MMI->setCallsEHReturn(true);
3319 DAG.setRoot(DAG.getNode(ISD::EH_RETURN,
3322 getValue(I.getOperand(1)),
3323 getValue(I.getOperand(2))));
3325 setValue(&I, DAG.getConstant(0, TLI.getPointerTy()));
3331 case Intrinsic::eh_unwind_init: {
3332 if (MachineModuleInfo *MMI = DAG.getMachineModuleInfo()) {
3333 MMI->setCallsUnwindInit(true);
3339 case Intrinsic::eh_dwarf_cfa: {
3340 MVT VT = getValue(I.getOperand(1)).getValueType();
3342 if (VT.bitsGT(TLI.getPointerTy()))
3343 CfaArg = DAG.getNode(ISD::TRUNCATE,
3344 TLI.getPointerTy(), getValue(I.getOperand(1)));
3346 CfaArg = DAG.getNode(ISD::SIGN_EXTEND,
3347 TLI.getPointerTy(), getValue(I.getOperand(1)));
3349 SDOperand Offset = DAG.getNode(ISD::ADD,
3351 DAG.getNode(ISD::FRAME_TO_ARGS_OFFSET,
3352 TLI.getPointerTy()),
3354 setValue(&I, DAG.getNode(ISD::ADD,
3356 DAG.getNode(ISD::FRAMEADDR,
3359 TLI.getPointerTy())),
3364 case Intrinsic::sqrt:
3365 setValue(&I, DAG.getNode(ISD::FSQRT,
3366 getValue(I.getOperand(1)).getValueType(),
3367 getValue(I.getOperand(1))));
3369 case Intrinsic::powi:
3370 setValue(&I, DAG.getNode(ISD::FPOWI,
3371 getValue(I.getOperand(1)).getValueType(),
3372 getValue(I.getOperand(1)),
3373 getValue(I.getOperand(2))));
3375 case Intrinsic::sin:
3376 setValue(&I, DAG.getNode(ISD::FSIN,
3377 getValue(I.getOperand(1)).getValueType(),
3378 getValue(I.getOperand(1))));
3380 case Intrinsic::cos:
3381 setValue(&I, DAG.getNode(ISD::FCOS,
3382 getValue(I.getOperand(1)).getValueType(),
3383 getValue(I.getOperand(1))));
3385 case Intrinsic::pow:
3386 setValue(&I, DAG.getNode(ISD::FPOW,
3387 getValue(I.getOperand(1)).getValueType(),
3388 getValue(I.getOperand(1)),
3389 getValue(I.getOperand(2))));
3391 case Intrinsic::pcmarker: {
3392 SDOperand Tmp = getValue(I.getOperand(1));
3393 DAG.setRoot(DAG.getNode(ISD::PCMARKER, MVT::Other, getRoot(), Tmp));
3396 case Intrinsic::readcyclecounter: {
3397 SDOperand Op = getRoot();
3398 SDOperand Tmp = DAG.getNode(ISD::READCYCLECOUNTER,
3399 DAG.getNodeValueTypes(MVT::i64, MVT::Other), 2,
3402 DAG.setRoot(Tmp.getValue(1));
3405 case Intrinsic::part_select: {
3406 // Currently not implemented: just abort
3407 assert(0 && "part_select intrinsic not implemented");
3410 case Intrinsic::part_set: {
3411 // Currently not implemented: just abort
3412 assert(0 && "part_set intrinsic not implemented");
3415 case Intrinsic::bswap:
3416 setValue(&I, DAG.getNode(ISD::BSWAP,
3417 getValue(I.getOperand(1)).getValueType(),
3418 getValue(I.getOperand(1))));
3420 case Intrinsic::cttz: {
3421 SDOperand Arg = getValue(I.getOperand(1));
3422 MVT Ty = Arg.getValueType();
3423 SDOperand result = DAG.getNode(ISD::CTTZ, Ty, Arg);
3424 setValue(&I, result);
3427 case Intrinsic::ctlz: {
3428 SDOperand Arg = getValue(I.getOperand(1));
3429 MVT Ty = Arg.getValueType();
3430 SDOperand result = DAG.getNode(ISD::CTLZ, Ty, Arg);
3431 setValue(&I, result);
3434 case Intrinsic::ctpop: {
3435 SDOperand Arg = getValue(I.getOperand(1));
3436 MVT Ty = Arg.getValueType();
3437 SDOperand result = DAG.getNode(ISD::CTPOP, Ty, Arg);
3438 setValue(&I, result);
3441 case Intrinsic::stacksave: {
3442 SDOperand Op = getRoot();
3443 SDOperand Tmp = DAG.getNode(ISD::STACKSAVE,
3444 DAG.getNodeValueTypes(TLI.getPointerTy(), MVT::Other), 2, &Op, 1);
3446 DAG.setRoot(Tmp.getValue(1));
3449 case Intrinsic::stackrestore: {
3450 SDOperand Tmp = getValue(I.getOperand(1));
3451 DAG.setRoot(DAG.getNode(ISD::STACKRESTORE, MVT::Other, getRoot(), Tmp));
3454 case Intrinsic::var_annotation:
3455 // Discard annotate attributes
3458 case Intrinsic::init_trampoline: {
3459 const Function *F = cast<Function>(I.getOperand(2)->stripPointerCasts());
3463 Ops[1] = getValue(I.getOperand(1));
3464 Ops[2] = getValue(I.getOperand(2));
3465 Ops[3] = getValue(I.getOperand(3));
3466 Ops[4] = DAG.getSrcValue(I.getOperand(1));
3467 Ops[5] = DAG.getSrcValue(F);
3469 SDOperand Tmp = DAG.getNode(ISD::TRAMPOLINE,
3470 DAG.getNodeValueTypes(TLI.getPointerTy(),
3475 DAG.setRoot(Tmp.getValue(1));
3479 case Intrinsic::gcroot:
3481 Value *Alloca = I.getOperand(1);
3482 Constant *TypeMap = cast<Constant>(I.getOperand(2));
3484 FrameIndexSDNode *FI = cast<FrameIndexSDNode>(getValue(Alloca).Val);
3485 GCI->addStackRoot(FI->getIndex(), TypeMap);
3489 case Intrinsic::gcread:
3490 case Intrinsic::gcwrite:
3491 assert(0 && "Collector failed to lower gcread/gcwrite intrinsics!");
3494 case Intrinsic::flt_rounds: {
3495 setValue(&I, DAG.getNode(ISD::FLT_ROUNDS_, MVT::i32));
3499 case Intrinsic::trap: {
3500 DAG.setRoot(DAG.getNode(ISD::TRAP, MVT::Other, getRoot()));
3503 case Intrinsic::prefetch: {
3506 Ops[1] = getValue(I.getOperand(1));
3507 Ops[2] = getValue(I.getOperand(2));
3508 Ops[3] = getValue(I.getOperand(3));
3509 DAG.setRoot(DAG.getNode(ISD::PREFETCH, MVT::Other, &Ops[0], 4));
3513 case Intrinsic::memory_barrier: {
3516 for (int x = 1; x < 6; ++x)
3517 Ops[x] = getValue(I.getOperand(x));
3519 DAG.setRoot(DAG.getNode(ISD::MEMBARRIER, MVT::Other, &Ops[0], 6));
3522 case Intrinsic::atomic_cmp_swap: {
3523 SDOperand Root = getRoot();
3524 SDOperand O3 = getValue(I.getOperand(3));
3525 SDOperand L = DAG.getAtomic(ISD::ATOMIC_CMP_SWAP, Root,
3526 getValue(I.getOperand(1)),
3527 getValue(I.getOperand(2)),
3528 O3, O3.getValueType(),
3531 DAG.setRoot(L.getValue(1));
3534 case Intrinsic::atomic_load_add:
3535 return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_ADD);
3536 case Intrinsic::atomic_load_sub:
3537 return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_SUB);
3538 case Intrinsic::atomic_load_and:
3539 return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_AND);
3540 case Intrinsic::atomic_load_or:
3541 return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_OR);
3542 case Intrinsic::atomic_load_xor:
3543 return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_XOR);
3544 case Intrinsic::atomic_load_nand:
3545 return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_NAND);
3546 case Intrinsic::atomic_load_min:
3547 return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_MIN);
3548 case Intrinsic::atomic_load_max:
3549 return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_MAX);
3550 case Intrinsic::atomic_load_umin:
3551 return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_UMIN);
3552 case Intrinsic::atomic_load_umax:
3553 return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_UMAX);
3554 case Intrinsic::atomic_swap:
3555 return implVisitBinaryAtomic(I, ISD::ATOMIC_SWAP);
3560 void SelectionDAGLowering::LowerCallTo(CallSite CS, SDOperand Callee,
3562 MachineBasicBlock *LandingPad) {
3563 const PointerType *PT = cast<PointerType>(CS.getCalledValue()->getType());
3564 const FunctionType *FTy = cast<FunctionType>(PT->getElementType());
3565 MachineModuleInfo *MMI = DAG.getMachineModuleInfo();
3566 unsigned BeginLabel = 0, EndLabel = 0;
3568 TargetLowering::ArgListTy Args;
3569 TargetLowering::ArgListEntry Entry;
3570 Args.reserve(CS.arg_size());
3571 for (CallSite::arg_iterator i = CS.arg_begin(), e = CS.arg_end();
3573 SDOperand ArgNode = getValue(*i);
3574 Entry.Node = ArgNode; Entry.Ty = (*i)->getType();
3576 unsigned attrInd = i - CS.arg_begin() + 1;
3577 Entry.isSExt = CS.paramHasAttr(attrInd, ParamAttr::SExt);
3578 Entry.isZExt = CS.paramHasAttr(attrInd, ParamAttr::ZExt);
3579 Entry.isInReg = CS.paramHasAttr(attrInd, ParamAttr::InReg);
3580 Entry.isSRet = CS.paramHasAttr(attrInd, ParamAttr::StructRet);
3581 Entry.isNest = CS.paramHasAttr(attrInd, ParamAttr::Nest);
3582 Entry.isByVal = CS.paramHasAttr(attrInd, ParamAttr::ByVal);
3583 Entry.Alignment = CS.getParamAlignment(attrInd);
3584 Args.push_back(Entry);
3587 if (LandingPad && MMI) {
3588 // Insert a label before the invoke call to mark the try range. This can be
3589 // used to detect deletion of the invoke via the MachineModuleInfo.
3590 BeginLabel = MMI->NextLabelID();
3591 // Both PendingLoads and PendingExports must be flushed here;
3592 // this call might not return.
3594 DAG.setRoot(DAG.getNode(ISD::LABEL, MVT::Other, getControlRoot(),
3595 DAG.getConstant(BeginLabel, MVT::i32),
3596 DAG.getConstant(1, MVT::i32)));
3599 std::pair<SDOperand,SDOperand> Result =
3600 TLI.LowerCallTo(getRoot(), CS.getType(),
3601 CS.paramHasAttr(0, ParamAttr::SExt),
3602 CS.paramHasAttr(0, ParamAttr::ZExt),
3603 FTy->isVarArg(), CS.getCallingConv(), IsTailCall,
3605 if (CS.getType() != Type::VoidTy)
3606 setValue(CS.getInstruction(), Result.first);
3607 DAG.setRoot(Result.second);
3609 if (LandingPad && MMI) {
3610 // Insert a label at the end of the invoke call to mark the try range. This
3611 // can be used to detect deletion of the invoke via the MachineModuleInfo.
3612 EndLabel = MMI->NextLabelID();
3613 DAG.setRoot(DAG.getNode(ISD::LABEL, MVT::Other, getRoot(),
3614 DAG.getConstant(EndLabel, MVT::i32),
3615 DAG.getConstant(1, MVT::i32)));
3617 // Inform MachineModuleInfo of range.
3618 MMI->addInvoke(LandingPad, BeginLabel, EndLabel);
3623 void SelectionDAGLowering::visitCall(CallInst &I) {
3624 const char *RenameFn = 0;
3625 if (Function *F = I.getCalledFunction()) {
3626 if (F->isDeclaration()) {
3627 if (unsigned IID = F->getIntrinsicID()) {
3628 RenameFn = visitIntrinsicCall(I, IID);
3634 // Check for well-known libc/libm calls. If the function is internal, it
3635 // can't be a library call.
3636 unsigned NameLen = F->getNameLen();
3637 if (!F->hasInternalLinkage() && NameLen) {
3638 const char *NameStr = F->getNameStart();
3639 if (NameStr[0] == 'c' &&
3640 ((NameLen == 8 && !strcmp(NameStr, "copysign")) ||
3641 (NameLen == 9 && !strcmp(NameStr, "copysignf")))) {
3642 if (I.getNumOperands() == 3 && // Basic sanity checks.
3643 I.getOperand(1)->getType()->isFloatingPoint() &&
3644 I.getType() == I.getOperand(1)->getType() &&
3645 I.getType() == I.getOperand(2)->getType()) {
3646 SDOperand LHS = getValue(I.getOperand(1));
3647 SDOperand RHS = getValue(I.getOperand(2));
3648 setValue(&I, DAG.getNode(ISD::FCOPYSIGN, LHS.getValueType(),
3652 } else if (NameStr[0] == 'f' &&
3653 ((NameLen == 4 && !strcmp(NameStr, "fabs")) ||
3654 (NameLen == 5 && !strcmp(NameStr, "fabsf")) ||
3655 (NameLen == 5 && !strcmp(NameStr, "fabsl")))) {
3656 if (I.getNumOperands() == 2 && // Basic sanity checks.
3657 I.getOperand(1)->getType()->isFloatingPoint() &&
3658 I.getType() == I.getOperand(1)->getType()) {
3659 SDOperand Tmp = getValue(I.getOperand(1));
3660 setValue(&I, DAG.getNode(ISD::FABS, Tmp.getValueType(), Tmp));
3663 } else if (NameStr[0] == 's' &&
3664 ((NameLen == 3 && !strcmp(NameStr, "sin")) ||
3665 (NameLen == 4 && !strcmp(NameStr, "sinf")) ||
3666 (NameLen == 4 && !strcmp(NameStr, "sinl")))) {
3667 if (I.getNumOperands() == 2 && // Basic sanity checks.
3668 I.getOperand(1)->getType()->isFloatingPoint() &&
3669 I.getType() == I.getOperand(1)->getType()) {
3670 SDOperand Tmp = getValue(I.getOperand(1));
3671 setValue(&I, DAG.getNode(ISD::FSIN, Tmp.getValueType(), Tmp));
3674 } else if (NameStr[0] == 'c' &&
3675 ((NameLen == 3 && !strcmp(NameStr, "cos")) ||
3676 (NameLen == 4 && !strcmp(NameStr, "cosf")) ||
3677 (NameLen == 4 && !strcmp(NameStr, "cosl")))) {
3678 if (I.getNumOperands() == 2 && // Basic sanity checks.
3679 I.getOperand(1)->getType()->isFloatingPoint() &&
3680 I.getType() == I.getOperand(1)->getType()) {
3681 SDOperand Tmp = getValue(I.getOperand(1));
3682 setValue(&I, DAG.getNode(ISD::FCOS, Tmp.getValueType(), Tmp));
3687 } else if (isa<InlineAsm>(I.getOperand(0))) {
3694 Callee = getValue(I.getOperand(0));
3696 Callee = DAG.getExternalSymbol(RenameFn, TLI.getPointerTy());
3698 LowerCallTo(&I, Callee, I.isTailCall());
3702 void SelectionDAGLowering::visitGetResult(GetResultInst &I) {
3703 if (isa<UndefValue>(I.getOperand(0))) {
3704 SDOperand Undef = DAG.getNode(ISD::UNDEF, TLI.getValueType(I.getType()));
3705 setValue(&I, Undef);
3709 // To add support for individual return values with aggregate types,
3710 // we'd need a way to take a getresult index and determine which
3711 // values of the Call SDNode are associated with it.
3712 assert(TLI.getValueType(I.getType(), true) != MVT::Other &&
3713 "Individual return values must not be aggregates!");
3715 SDOperand Call = getValue(I.getOperand(0));
3716 setValue(&I, SDOperand(Call.Val, I.getIndex()));
3720 /// getCopyFromRegs - Emit a series of CopyFromReg nodes that copies from
3721 /// this value and returns the result as a ValueVT value. This uses
3722 /// Chain/Flag as the input and updates them for the output Chain/Flag.
3723 /// If the Flag pointer is NULL, no flag is used.
3724 SDOperand RegsForValue::getCopyFromRegs(SelectionDAG &DAG,
3726 SDOperand *Flag) const {
3727 // Assemble the legal parts into the final values.
3728 SmallVector<SDOperand, 4> Values(ValueVTs.size());
3729 SmallVector<SDOperand, 8> Parts;
3730 for (unsigned Value = 0, Part = 0, e = ValueVTs.size(); Value != e; ++Value) {
3731 // Copy the legal parts from the registers.
3732 MVT ValueVT = ValueVTs[Value];
3733 unsigned NumRegs = TLI->getNumRegisters(ValueVT);
3734 MVT RegisterVT = RegVTs[Value];
3736 Parts.resize(NumRegs);
3737 for (unsigned i = 0; i != NumRegs; ++i) {
3740 P = DAG.getCopyFromReg(Chain, Regs[Part+i], RegisterVT);
3742 P = DAG.getCopyFromReg(Chain, Regs[Part+i], RegisterVT, *Flag);
3743 *Flag = P.getValue(2);
3745 Chain = P.getValue(1);
3747 // If the source register was virtual and if we know something about it,
3748 // add an assert node.
3749 if (TargetRegisterInfo::isVirtualRegister(Regs[Part+i]) &&
3750 RegisterVT.isInteger() && !RegisterVT.isVector()) {
3751 unsigned SlotNo = Regs[Part+i]-TargetRegisterInfo::FirstVirtualRegister;
3752 FunctionLoweringInfo &FLI = DAG.getFunctionLoweringInfo();
3753 if (FLI.LiveOutRegInfo.size() > SlotNo) {
3754 FunctionLoweringInfo::LiveOutInfo &LOI = FLI.LiveOutRegInfo[SlotNo];
3756 unsigned RegSize = RegisterVT.getSizeInBits();
3757 unsigned NumSignBits = LOI.NumSignBits;
3758 unsigned NumZeroBits = LOI.KnownZero.countLeadingOnes();
3760 // FIXME: We capture more information than the dag can represent. For
3761 // now, just use the tightest assertzext/assertsext possible.
3763 MVT FromVT(MVT::Other);
3764 if (NumSignBits == RegSize)
3765 isSExt = true, FromVT = MVT::i1; // ASSERT SEXT 1
3766 else if (NumZeroBits >= RegSize-1)
3767 isSExt = false, FromVT = MVT::i1; // ASSERT ZEXT 1
3768 else if (NumSignBits > RegSize-8)
3769 isSExt = true, FromVT = MVT::i8; // ASSERT SEXT 8
3770 else if (NumZeroBits >= RegSize-9)
3771 isSExt = false, FromVT = MVT::i8; // ASSERT ZEXT 8
3772 else if (NumSignBits > RegSize-16)
3773 isSExt = true, FromVT = MVT::i16; // ASSERT SEXT 16
3774 else if (NumZeroBits >= RegSize-17)
3775 isSExt = false, FromVT = MVT::i16; // ASSERT ZEXT 16
3776 else if (NumSignBits > RegSize-32)
3777 isSExt = true, FromVT = MVT::i32; // ASSERT SEXT 32
3778 else if (NumZeroBits >= RegSize-33)
3779 isSExt = false, FromVT = MVT::i32; // ASSERT ZEXT 32
3781 if (FromVT != MVT::Other) {
3782 P = DAG.getNode(isSExt ? ISD::AssertSext : ISD::AssertZext,
3783 RegisterVT, P, DAG.getValueType(FromVT));
3792 Values[Value] = getCopyFromParts(DAG, &Parts[Part], NumRegs, RegisterVT,
3797 if (ValueVTs.size() == 1)
3800 return DAG.getNode(ISD::MERGE_VALUES,
3801 DAG.getVTList(&ValueVTs[0], ValueVTs.size()),
3802 &Values[0], ValueVTs.size());
3805 /// getCopyToRegs - Emit a series of CopyToReg nodes that copies the
3806 /// specified value into the registers specified by this object. This uses
3807 /// Chain/Flag as the input and updates them for the output Chain/Flag.
3808 /// If the Flag pointer is NULL, no flag is used.
3809 void RegsForValue::getCopyToRegs(SDOperand Val, SelectionDAG &DAG,
3810 SDOperand &Chain, SDOperand *Flag) const {
3811 // Get the list of the values's legal parts.
3812 unsigned NumRegs = Regs.size();
3813 SmallVector<SDOperand, 8> Parts(NumRegs);
3814 for (unsigned Value = 0, Part = 0, e = ValueVTs.size(); Value != e; ++Value) {
3815 MVT ValueVT = ValueVTs[Value];
3816 unsigned NumParts = TLI->getNumRegisters(ValueVT);
3817 MVT RegisterVT = RegVTs[Value];
3819 getCopyToParts(DAG, Val.getValue(Val.ResNo + Value),
3820 &Parts[Part], NumParts, RegisterVT);
3824 // Copy the parts into the registers.
3825 SmallVector<SDOperand, 8> Chains(NumRegs);
3826 for (unsigned i = 0; i != NumRegs; ++i) {
3829 Part = DAG.getCopyToReg(Chain, Regs[i], Parts[i]);
3831 Part = DAG.getCopyToReg(Chain, Regs[i], Parts[i], *Flag);
3832 *Flag = Part.getValue(1);
3834 Chains[i] = Part.getValue(0);
3837 if (NumRegs == 1 || Flag)
3838 // If NumRegs > 1 && Flag is used then the use of the last CopyToReg is
3839 // flagged to it. That is the CopyToReg nodes and the user are considered
3840 // a single scheduling unit. If we create a TokenFactor and return it as
3841 // chain, then the TokenFactor is both a predecessor (operand) of the
3842 // user as well as a successor (the TF operands are flagged to the user).
3843 // c1, f1 = CopyToReg
3844 // c2, f2 = CopyToReg
3845 // c3 = TokenFactor c1, c2
3848 Chain = Chains[NumRegs-1];
3850 Chain = DAG.getNode(ISD::TokenFactor, MVT::Other, &Chains[0], NumRegs);
3853 /// AddInlineAsmOperands - Add this value to the specified inlineasm node
3854 /// operand list. This adds the code marker and includes the number of
3855 /// values added into it.
3856 void RegsForValue::AddInlineAsmOperands(unsigned Code, SelectionDAG &DAG,
3857 std::vector<SDOperand> &Ops) const {
3858 MVT IntPtrTy = DAG.getTargetLoweringInfo().getPointerTy();
3859 Ops.push_back(DAG.getTargetConstant(Code | (Regs.size() << 3), IntPtrTy));
3860 for (unsigned Value = 0, Reg = 0, e = ValueVTs.size(); Value != e; ++Value) {
3861 unsigned NumRegs = TLI->getNumRegisters(ValueVTs[Value]);
3862 MVT RegisterVT = RegVTs[Value];
3863 for (unsigned i = 0; i != NumRegs; ++i)
3864 Ops.push_back(DAG.getRegister(Regs[Reg++], RegisterVT));
3868 /// isAllocatableRegister - If the specified register is safe to allocate,
3869 /// i.e. it isn't a stack pointer or some other special register, return the
3870 /// register class for the register. Otherwise, return null.
3871 static const TargetRegisterClass *
3872 isAllocatableRegister(unsigned Reg, MachineFunction &MF,
3873 const TargetLowering &TLI,
3874 const TargetRegisterInfo *TRI) {
3875 MVT FoundVT = MVT::Other;
3876 const TargetRegisterClass *FoundRC = 0;
3877 for (TargetRegisterInfo::regclass_iterator RCI = TRI->regclass_begin(),
3878 E = TRI->regclass_end(); RCI != E; ++RCI) {
3879 MVT ThisVT = MVT::Other;
3881 const TargetRegisterClass *RC = *RCI;
3882 // If none of the the value types for this register class are valid, we
3883 // can't use it. For example, 64-bit reg classes on 32-bit targets.
3884 for (TargetRegisterClass::vt_iterator I = RC->vt_begin(), E = RC->vt_end();
3886 if (TLI.isTypeLegal(*I)) {
3887 // If we have already found this register in a different register class,
3888 // choose the one with the largest VT specified. For example, on
3889 // PowerPC, we favor f64 register classes over f32.
3890 if (FoundVT == MVT::Other || FoundVT.bitsLT(*I)) {
3897 if (ThisVT == MVT::Other) continue;
3899 // NOTE: This isn't ideal. In particular, this might allocate the
3900 // frame pointer in functions that need it (due to them not being taken
3901 // out of allocation, because a variable sized allocation hasn't been seen
3902 // yet). This is a slight code pessimization, but should still work.
3903 for (TargetRegisterClass::iterator I = RC->allocation_order_begin(MF),
3904 E = RC->allocation_order_end(MF); I != E; ++I)
3906 // We found a matching register class. Keep looking at others in case
3907 // we find one with larger registers that this physreg is also in.
3918 /// AsmOperandInfo - This contains information for each constraint that we are
3920 struct SDISelAsmOperandInfo : public TargetLowering::AsmOperandInfo {
3921 /// CallOperand - If this is the result output operand or a clobber
3922 /// this is null, otherwise it is the incoming operand to the CallInst.
3923 /// This gets modified as the asm is processed.
3924 SDOperand CallOperand;
3926 /// AssignedRegs - If this is a register or register class operand, this
3927 /// contains the set of register corresponding to the operand.
3928 RegsForValue AssignedRegs;
3930 explicit SDISelAsmOperandInfo(const InlineAsm::ConstraintInfo &info)
3931 : TargetLowering::AsmOperandInfo(info), CallOperand(0,0) {
3934 /// MarkAllocatedRegs - Once AssignedRegs is set, mark the assigned registers
3935 /// busy in OutputRegs/InputRegs.
3936 void MarkAllocatedRegs(bool isOutReg, bool isInReg,
3937 std::set<unsigned> &OutputRegs,
3938 std::set<unsigned> &InputRegs,
3939 const TargetRegisterInfo &TRI) const {
3941 for (unsigned i = 0, e = AssignedRegs.Regs.size(); i != e; ++i)
3942 MarkRegAndAliases(AssignedRegs.Regs[i], OutputRegs, TRI);
3945 for (unsigned i = 0, e = AssignedRegs.Regs.size(); i != e; ++i)
3946 MarkRegAndAliases(AssignedRegs.Regs[i], InputRegs, TRI);
3951 /// MarkRegAndAliases - Mark the specified register and all aliases in the
3953 static void MarkRegAndAliases(unsigned Reg, std::set<unsigned> &Regs,
3954 const TargetRegisterInfo &TRI) {
3955 assert(TargetRegisterInfo::isPhysicalRegister(Reg) && "Isn't a physreg");
3957 if (const unsigned *Aliases = TRI.getAliasSet(Reg))
3958 for (; *Aliases; ++Aliases)
3959 Regs.insert(*Aliases);
3962 } // end anon namespace.
3965 /// GetRegistersForValue - Assign registers (virtual or physical) for the
3966 /// specified operand. We prefer to assign virtual registers, to allow the
3967 /// register allocator handle the assignment process. However, if the asm uses
3968 /// features that we can't model on machineinstrs, we have SDISel do the
3969 /// allocation. This produces generally horrible, but correct, code.
3971 /// OpInfo describes the operand.
3972 /// HasEarlyClobber is true if there are any early clobber constraints (=&r)
3973 /// or any explicitly clobbered registers.
3974 /// Input and OutputRegs are the set of already allocated physical registers.
3976 void SelectionDAGLowering::
3977 GetRegistersForValue(SDISelAsmOperandInfo &OpInfo, bool HasEarlyClobber,
3978 std::set<unsigned> &OutputRegs,
3979 std::set<unsigned> &InputRegs) {
3980 // Compute whether this value requires an input register, an output register,
3982 bool isOutReg = false;
3983 bool isInReg = false;
3984 switch (OpInfo.Type) {
3985 case InlineAsm::isOutput:
3988 // If this is an early-clobber output, or if there is an input
3989 // constraint that matches this, we need to reserve the input register
3990 // so no other inputs allocate to it.
3991 isInReg = OpInfo.isEarlyClobber || OpInfo.hasMatchingInput;
3993 case InlineAsm::isInput:
3997 case InlineAsm::isClobber:
4004 MachineFunction &MF = DAG.getMachineFunction();
4005 SmallVector<unsigned, 4> Regs;
4007 // If this is a constraint for a single physreg, or a constraint for a
4008 // register class, find it.
4009 std::pair<unsigned, const TargetRegisterClass*> PhysReg =
4010 TLI.getRegForInlineAsmConstraint(OpInfo.ConstraintCode,
4011 OpInfo.ConstraintVT);
4013 unsigned NumRegs = 1;
4014 if (OpInfo.ConstraintVT != MVT::Other)
4015 NumRegs = TLI.getNumRegisters(OpInfo.ConstraintVT);
4017 MVT ValueVT = OpInfo.ConstraintVT;
4020 // If this is a constraint for a specific physical register, like {r17},
4022 if (PhysReg.first) {
4023 if (OpInfo.ConstraintVT == MVT::Other)
4024 ValueVT = *PhysReg.second->vt_begin();
4026 // Get the actual register value type. This is important, because the user
4027 // may have asked for (e.g.) the AX register in i32 type. We need to
4028 // remember that AX is actually i16 to get the right extension.
4029 RegVT = *PhysReg.second->vt_begin();
4031 // This is a explicit reference to a physical register.
4032 Regs.push_back(PhysReg.first);
4034 // If this is an expanded reference, add the rest of the regs to Regs.
4036 TargetRegisterClass::iterator I = PhysReg.second->begin();
4037 for (; *I != PhysReg.first; ++I)
4038 assert(I != PhysReg.second->end() && "Didn't find reg!");
4040 // Already added the first reg.
4042 for (; NumRegs; --NumRegs, ++I) {
4043 assert(I != PhysReg.second->end() && "Ran out of registers to allocate!");
4047 OpInfo.AssignedRegs = RegsForValue(TLI, Regs, RegVT, ValueVT);
4048 const TargetRegisterInfo *TRI = DAG.getTarget().getRegisterInfo();
4049 OpInfo.MarkAllocatedRegs(isOutReg, isInReg, OutputRegs, InputRegs, *TRI);
4053 // Otherwise, if this was a reference to an LLVM register class, create vregs
4054 // for this reference.
4055 std::vector<unsigned> RegClassRegs;
4056 const TargetRegisterClass *RC = PhysReg.second;
4058 // If this is an early clobber or tied register, our regalloc doesn't know
4059 // how to maintain the constraint. If it isn't, go ahead and create vreg
4060 // and let the regalloc do the right thing.
4061 if (!OpInfo.hasMatchingInput && !OpInfo.isEarlyClobber &&
4062 // If there is some other early clobber and this is an input register,
4063 // then we are forced to pre-allocate the input reg so it doesn't
4064 // conflict with the earlyclobber.
4065 !(OpInfo.Type == InlineAsm::isInput && HasEarlyClobber)) {
4066 RegVT = *PhysReg.second->vt_begin();
4068 if (OpInfo.ConstraintVT == MVT::Other)
4071 // Create the appropriate number of virtual registers.
4072 MachineRegisterInfo &RegInfo = MF.getRegInfo();
4073 for (; NumRegs; --NumRegs)
4074 Regs.push_back(RegInfo.createVirtualRegister(PhysReg.second));
4076 OpInfo.AssignedRegs = RegsForValue(TLI, Regs, RegVT, ValueVT);
4080 // Otherwise, we can't allocate it. Let the code below figure out how to
4081 // maintain these constraints.
4082 RegClassRegs.assign(PhysReg.second->begin(), PhysReg.second->end());
4085 // This is a reference to a register class that doesn't directly correspond
4086 // to an LLVM register class. Allocate NumRegs consecutive, available,
4087 // registers from the class.
4088 RegClassRegs = TLI.getRegClassForInlineAsmConstraint(OpInfo.ConstraintCode,
4089 OpInfo.ConstraintVT);
4092 const TargetRegisterInfo *TRI = DAG.getTarget().getRegisterInfo();
4093 unsigned NumAllocated = 0;
4094 for (unsigned i = 0, e = RegClassRegs.size(); i != e; ++i) {
4095 unsigned Reg = RegClassRegs[i];
4096 // See if this register is available.
4097 if ((isOutReg && OutputRegs.count(Reg)) || // Already used.
4098 (isInReg && InputRegs.count(Reg))) { // Already used.
4099 // Make sure we find consecutive registers.
4104 // Check to see if this register is allocatable (i.e. don't give out the
4107 RC = isAllocatableRegister(Reg, MF, TLI, TRI);
4108 if (!RC) { // Couldn't allocate this register.
4109 // Reset NumAllocated to make sure we return consecutive registers.
4115 // Okay, this register is good, we can use it.
4118 // If we allocated enough consecutive registers, succeed.
4119 if (NumAllocated == NumRegs) {
4120 unsigned RegStart = (i-NumAllocated)+1;
4121 unsigned RegEnd = i+1;
4122 // Mark all of the allocated registers used.
4123 for (unsigned i = RegStart; i != RegEnd; ++i)
4124 Regs.push_back(RegClassRegs[i]);
4126 OpInfo.AssignedRegs = RegsForValue(TLI, Regs, *RC->vt_begin(),
4127 OpInfo.ConstraintVT);
4128 OpInfo.MarkAllocatedRegs(isOutReg, isInReg, OutputRegs, InputRegs, *TRI);
4133 // Otherwise, we couldn't allocate enough registers for this.
4137 /// visitInlineAsm - Handle a call to an InlineAsm object.
4139 void SelectionDAGLowering::visitInlineAsm(CallSite CS) {
4140 InlineAsm *IA = cast<InlineAsm>(CS.getCalledValue());
4142 /// ConstraintOperands - Information about all of the constraints.
4143 std::vector<SDISelAsmOperandInfo> ConstraintOperands;
4145 SDOperand Chain = getRoot();
4148 std::set<unsigned> OutputRegs, InputRegs;
4150 // Do a prepass over the constraints, canonicalizing them, and building up the
4151 // ConstraintOperands list.
4152 std::vector<InlineAsm::ConstraintInfo>
4153 ConstraintInfos = IA->ParseConstraints();
4155 // SawEarlyClobber - Keep track of whether we saw an earlyclobber output
4156 // constraint. If so, we can't let the register allocator allocate any input
4157 // registers, because it will not know to avoid the earlyclobbered output reg.
4158 bool SawEarlyClobber = false;
4160 unsigned ArgNo = 0; // ArgNo - The argument of the CallInst.
4161 unsigned ResNo = 0; // ResNo - The result number of the next output.
4162 for (unsigned i = 0, e = ConstraintInfos.size(); i != e; ++i) {
4163 ConstraintOperands.push_back(SDISelAsmOperandInfo(ConstraintInfos[i]));
4164 SDISelAsmOperandInfo &OpInfo = ConstraintOperands.back();
4166 MVT OpVT = MVT::Other;
4168 // Compute the value type for each operand.
4169 switch (OpInfo.Type) {
4170 case InlineAsm::isOutput:
4171 // Indirect outputs just consume an argument.
4172 if (OpInfo.isIndirect) {
4173 OpInfo.CallOperandVal = CS.getArgument(ArgNo++);
4176 // The return value of the call is this value. As such, there is no
4177 // corresponding argument.
4178 assert(CS.getType() != Type::VoidTy && "Bad inline asm!");
4179 if (const StructType *STy = dyn_cast<StructType>(CS.getType())) {
4180 OpVT = TLI.getValueType(STy->getElementType(ResNo));
4182 assert(ResNo == 0 && "Asm only has one result!");
4183 OpVT = TLI.getValueType(CS.getType());
4187 case InlineAsm::isInput:
4188 OpInfo.CallOperandVal = CS.getArgument(ArgNo++);
4190 case InlineAsm::isClobber:
4195 // If this is an input or an indirect output, process the call argument.
4196 // BasicBlocks are labels, currently appearing only in asm's.
4197 if (OpInfo.CallOperandVal) {
4198 if (BasicBlock *BB = dyn_cast<BasicBlock>(OpInfo.CallOperandVal))
4199 OpInfo.CallOperand = DAG.getBasicBlock(FuncInfo.MBBMap[BB]);
4201 OpInfo.CallOperand = getValue(OpInfo.CallOperandVal);
4202 const Type *OpTy = OpInfo.CallOperandVal->getType();
4203 // If this is an indirect operand, the operand is a pointer to the
4205 if (OpInfo.isIndirect)
4206 OpTy = cast<PointerType>(OpTy)->getElementType();
4208 // If OpTy is not a single value, it may be a struct/union that we
4209 // can tile with integers.
4210 if (!OpTy->isSingleValueType() && OpTy->isSized()) {
4211 unsigned BitSize = TD->getTypeSizeInBits(OpTy);
4219 OpTy = IntegerType::get(BitSize);
4224 OpVT = TLI.getValueType(OpTy, true);
4228 OpInfo.ConstraintVT = OpVT;
4230 // Compute the constraint code and ConstraintType to use.
4231 TLI.ComputeConstraintToUse(OpInfo, OpInfo.CallOperand, &DAG);
4233 // Keep track of whether we see an earlyclobber.
4234 SawEarlyClobber |= OpInfo.isEarlyClobber;
4236 // If we see a clobber of a register, it is an early clobber.
4237 if (!SawEarlyClobber &&
4238 OpInfo.Type == InlineAsm::isClobber &&
4239 OpInfo.ConstraintType == TargetLowering::C_Register) {
4240 // Note that we want to ignore things that we don't trick here, like
4241 // dirflag, fpsr, flags, etc.
4242 std::pair<unsigned, const TargetRegisterClass*> PhysReg =
4243 TLI.getRegForInlineAsmConstraint(OpInfo.ConstraintCode,
4244 OpInfo.ConstraintVT);
4245 if (PhysReg.first || PhysReg.second) {
4246 // This is a register we know of.
4247 SawEarlyClobber = true;
4251 // If this is a memory input, and if the operand is not indirect, do what we
4252 // need to to provide an address for the memory input.
4253 if (OpInfo.ConstraintType == TargetLowering::C_Memory &&
4254 !OpInfo.isIndirect) {
4255 assert(OpInfo.Type == InlineAsm::isInput &&
4256 "Can only indirectify direct input operands!");
4258 // Memory operands really want the address of the value. If we don't have
4259 // an indirect input, put it in the constpool if we can, otherwise spill
4260 // it to a stack slot.
4262 // If the operand is a float, integer, or vector constant, spill to a
4263 // constant pool entry to get its address.
4264 Value *OpVal = OpInfo.CallOperandVal;
4265 if (isa<ConstantFP>(OpVal) || isa<ConstantInt>(OpVal) ||
4266 isa<ConstantVector>(OpVal)) {
4267 OpInfo.CallOperand = DAG.getConstantPool(cast<Constant>(OpVal),
4268 TLI.getPointerTy());
4270 // Otherwise, create a stack slot and emit a store to it before the
4272 const Type *Ty = OpVal->getType();
4273 uint64_t TySize = TLI.getTargetData()->getABITypeSize(Ty);
4274 unsigned Align = TLI.getTargetData()->getPrefTypeAlignment(Ty);
4275 MachineFunction &MF = DAG.getMachineFunction();
4276 int SSFI = MF.getFrameInfo()->CreateStackObject(TySize, Align);
4277 SDOperand StackSlot = DAG.getFrameIndex(SSFI, TLI.getPointerTy());
4278 Chain = DAG.getStore(Chain, OpInfo.CallOperand, StackSlot, NULL, 0);
4279 OpInfo.CallOperand = StackSlot;
4282 // There is no longer a Value* corresponding to this operand.
4283 OpInfo.CallOperandVal = 0;
4284 // It is now an indirect operand.
4285 OpInfo.isIndirect = true;
4288 // If this constraint is for a specific register, allocate it before
4290 if (OpInfo.ConstraintType == TargetLowering::C_Register)
4291 GetRegistersForValue(OpInfo, SawEarlyClobber, OutputRegs, InputRegs);
4293 ConstraintInfos.clear();
4296 // Second pass - Loop over all of the operands, assigning virtual or physregs
4297 // to registerclass operands.
4298 for (unsigned i = 0, e = ConstraintOperands.size(); i != e; ++i) {
4299 SDISelAsmOperandInfo &OpInfo = ConstraintOperands[i];
4301 // C_Register operands have already been allocated, Other/Memory don't need
4303 if (OpInfo.ConstraintType == TargetLowering::C_RegisterClass)
4304 GetRegistersForValue(OpInfo, SawEarlyClobber, OutputRegs, InputRegs);
4307 // AsmNodeOperands - The operands for the ISD::INLINEASM node.
4308 std::vector<SDOperand> AsmNodeOperands;
4309 AsmNodeOperands.push_back(SDOperand()); // reserve space for input chain
4310 AsmNodeOperands.push_back(
4311 DAG.getTargetExternalSymbol(IA->getAsmString().c_str(), MVT::Other));
4314 // Loop over all of the inputs, copying the operand values into the
4315 // appropriate registers and processing the output regs.
4316 RegsForValue RetValRegs;
4318 // IndirectStoresToEmit - The set of stores to emit after the inline asm node.
4319 std::vector<std::pair<RegsForValue, Value*> > IndirectStoresToEmit;
4321 for (unsigned i = 0, e = ConstraintOperands.size(); i != e; ++i) {
4322 SDISelAsmOperandInfo &OpInfo = ConstraintOperands[i];
4324 switch (OpInfo.Type) {
4325 case InlineAsm::isOutput: {
4326 if (OpInfo.ConstraintType != TargetLowering::C_RegisterClass &&
4327 OpInfo.ConstraintType != TargetLowering::C_Register) {
4328 // Memory output, or 'other' output (e.g. 'X' constraint).
4329 assert(OpInfo.isIndirect && "Memory output must be indirect operand");
4331 // Add information to the INLINEASM node to know about this output.
4332 unsigned ResOpType = 4/*MEM*/ | (1 << 3);
4333 AsmNodeOperands.push_back(DAG.getTargetConstant(ResOpType,
4334 TLI.getPointerTy()));
4335 AsmNodeOperands.push_back(OpInfo.CallOperand);
4339 // Otherwise, this is a register or register class output.
4341 // Copy the output from the appropriate register. Find a register that
4343 if (OpInfo.AssignedRegs.Regs.empty()) {
4344 cerr << "Couldn't allocate output reg for constraint '"
4345 << OpInfo.ConstraintCode << "'!\n";
4349 // If this is an indirect operand, store through the pointer after the
4351 if (OpInfo.isIndirect) {
4352 IndirectStoresToEmit.push_back(std::make_pair(OpInfo.AssignedRegs,
4353 OpInfo.CallOperandVal));
4355 // This is the result value of the call.
4356 assert(CS.getType() != Type::VoidTy && "Bad inline asm!");
4357 // Concatenate this output onto the outputs list.
4358 RetValRegs.append(OpInfo.AssignedRegs);
4361 // Add information to the INLINEASM node to know that this register is
4363 OpInfo.AssignedRegs.AddInlineAsmOperands(2 /*REGDEF*/, DAG,
4367 case InlineAsm::isInput: {
4368 SDOperand InOperandVal = OpInfo.CallOperand;
4370 if (isdigit(OpInfo.ConstraintCode[0])) { // Matching constraint?
4371 // If this is required to match an output register we have already set,
4372 // just use its register.
4373 unsigned OperandNo = atoi(OpInfo.ConstraintCode.c_str());
4375 // Scan until we find the definition we already emitted of this operand.
4376 // When we find it, create a RegsForValue operand.
4377 unsigned CurOp = 2; // The first operand.
4378 for (; OperandNo; --OperandNo) {
4379 // Advance to the next operand.
4381 cast<ConstantSDNode>(AsmNodeOperands[CurOp])->getValue();
4382 assert(((NumOps & 7) == 2 /*REGDEF*/ ||
4383 (NumOps & 7) == 4 /*MEM*/) &&
4384 "Skipped past definitions?");
4385 CurOp += (NumOps>>3)+1;
4389 cast<ConstantSDNode>(AsmNodeOperands[CurOp])->getValue();
4390 if ((NumOps & 7) == 2 /*REGDEF*/) {
4391 // Add NumOps>>3 registers to MatchedRegs.
4392 RegsForValue MatchedRegs;
4393 MatchedRegs.TLI = &TLI;
4394 MatchedRegs.ValueVTs.push_back(InOperandVal.getValueType());
4395 MatchedRegs.RegVTs.push_back(AsmNodeOperands[CurOp+1].getValueType());
4396 for (unsigned i = 0, e = NumOps>>3; i != e; ++i) {
4398 cast<RegisterSDNode>(AsmNodeOperands[++CurOp])->getReg();
4399 MatchedRegs.Regs.push_back(Reg);
4402 // Use the produced MatchedRegs object to
4403 MatchedRegs.getCopyToRegs(InOperandVal, DAG, Chain, &Flag);
4404 MatchedRegs.AddInlineAsmOperands(1 /*REGUSE*/, DAG, AsmNodeOperands);
4407 assert((NumOps & 7) == 4/*MEM*/ && "Unknown matching constraint!");
4408 assert((NumOps >> 3) == 1 && "Unexpected number of operands");
4409 // Add information to the INLINEASM node to know about this input.
4410 unsigned ResOpType = 4/*MEM*/ | (1 << 3);
4411 AsmNodeOperands.push_back(DAG.getTargetConstant(ResOpType,
4412 TLI.getPointerTy()));
4413 AsmNodeOperands.push_back(AsmNodeOperands[CurOp+1]);
4418 if (OpInfo.ConstraintType == TargetLowering::C_Other) {
4419 assert(!OpInfo.isIndirect &&
4420 "Don't know how to handle indirect other inputs yet!");
4422 std::vector<SDOperand> Ops;
4423 TLI.LowerAsmOperandForConstraint(InOperandVal, OpInfo.ConstraintCode[0],
4426 cerr << "Invalid operand for inline asm constraint '"
4427 << OpInfo.ConstraintCode << "'!\n";
4431 // Add information to the INLINEASM node to know about this input.
4432 unsigned ResOpType = 3 /*IMM*/ | (Ops.size() << 3);
4433 AsmNodeOperands.push_back(DAG.getTargetConstant(ResOpType,
4434 TLI.getPointerTy()));
4435 AsmNodeOperands.insert(AsmNodeOperands.end(), Ops.begin(), Ops.end());
4437 } else if (OpInfo.ConstraintType == TargetLowering::C_Memory) {
4438 assert(OpInfo.isIndirect && "Operand must be indirect to be a mem!");
4439 assert(InOperandVal.getValueType() == TLI.getPointerTy() &&
4440 "Memory operands expect pointer values");
4442 // Add information to the INLINEASM node to know about this input.
4443 unsigned ResOpType = 4/*MEM*/ | (1 << 3);
4444 AsmNodeOperands.push_back(DAG.getTargetConstant(ResOpType,
4445 TLI.getPointerTy()));
4446 AsmNodeOperands.push_back(InOperandVal);
4450 assert((OpInfo.ConstraintType == TargetLowering::C_RegisterClass ||
4451 OpInfo.ConstraintType == TargetLowering::C_Register) &&
4452 "Unknown constraint type!");
4453 assert(!OpInfo.isIndirect &&
4454 "Don't know how to handle indirect register inputs yet!");
4456 // Copy the input into the appropriate registers.
4457 assert(!OpInfo.AssignedRegs.Regs.empty() &&
4458 "Couldn't allocate input reg!");
4460 OpInfo.AssignedRegs.getCopyToRegs(InOperandVal, DAG, Chain, &Flag);
4462 OpInfo.AssignedRegs.AddInlineAsmOperands(1/*REGUSE*/, DAG,
4466 case InlineAsm::isClobber: {
4467 // Add the clobbered value to the operand list, so that the register
4468 // allocator is aware that the physreg got clobbered.
4469 if (!OpInfo.AssignedRegs.Regs.empty())
4470 OpInfo.AssignedRegs.AddInlineAsmOperands(2/*REGDEF*/, DAG,
4477 // Finish up input operands.
4478 AsmNodeOperands[0] = Chain;
4479 if (Flag.Val) AsmNodeOperands.push_back(Flag);
4481 Chain = DAG.getNode(ISD::INLINEASM,
4482 DAG.getNodeValueTypes(MVT::Other, MVT::Flag), 2,
4483 &AsmNodeOperands[0], AsmNodeOperands.size());
4484 Flag = Chain.getValue(1);
4486 // If this asm returns a register value, copy the result from that register
4487 // and set it as the value of the call.
4488 if (!RetValRegs.Regs.empty()) {
4489 SDOperand Val = RetValRegs.getCopyFromRegs(DAG, Chain, &Flag);
4491 // If any of the results of the inline asm is a vector, it may have the
4492 // wrong width/num elts. This can happen for register classes that can
4493 // contain multiple different value types. The preg or vreg allocated may
4494 // not have the same VT as was expected. Convert it to the right type with
4496 if (const StructType *ResSTy = dyn_cast<StructType>(CS.getType())) {
4497 for (unsigned i = 0, e = ResSTy->getNumElements(); i != e; ++i) {
4498 if (Val.Val->getValueType(i).isVector())
4499 Val = DAG.getNode(ISD::BIT_CONVERT,
4500 TLI.getValueType(ResSTy->getElementType(i)), Val);
4503 if (Val.getValueType().isVector())
4504 Val = DAG.getNode(ISD::BIT_CONVERT, TLI.getValueType(CS.getType()),
4508 setValue(CS.getInstruction(), Val);
4511 std::vector<std::pair<SDOperand, Value*> > StoresToEmit;
4513 // Process indirect outputs, first output all of the flagged copies out of
4515 for (unsigned i = 0, e = IndirectStoresToEmit.size(); i != e; ++i) {
4516 RegsForValue &OutRegs = IndirectStoresToEmit[i].first;
4517 Value *Ptr = IndirectStoresToEmit[i].second;
4518 SDOperand OutVal = OutRegs.getCopyFromRegs(DAG, Chain, &Flag);
4519 StoresToEmit.push_back(std::make_pair(OutVal, Ptr));
4522 // Emit the non-flagged stores from the physregs.
4523 SmallVector<SDOperand, 8> OutChains;
4524 for (unsigned i = 0, e = StoresToEmit.size(); i != e; ++i)
4525 OutChains.push_back(DAG.getStore(Chain, StoresToEmit[i].first,
4526 getValue(StoresToEmit[i].second),
4527 StoresToEmit[i].second, 0));
4528 if (!OutChains.empty())
4529 Chain = DAG.getNode(ISD::TokenFactor, MVT::Other,
4530 &OutChains[0], OutChains.size());
4535 void SelectionDAGLowering::visitMalloc(MallocInst &I) {
4536 SDOperand Src = getValue(I.getOperand(0));
4538 MVT IntPtr = TLI.getPointerTy();
4540 if (IntPtr.bitsLT(Src.getValueType()))
4541 Src = DAG.getNode(ISD::TRUNCATE, IntPtr, Src);
4542 else if (IntPtr.bitsGT(Src.getValueType()))
4543 Src = DAG.getNode(ISD::ZERO_EXTEND, IntPtr, Src);
4545 // Scale the source by the type size.
4546 uint64_t ElementSize = TD->getABITypeSize(I.getType()->getElementType());
4547 Src = DAG.getNode(ISD::MUL, Src.getValueType(),
4548 Src, DAG.getIntPtrConstant(ElementSize));
4550 TargetLowering::ArgListTy Args;
4551 TargetLowering::ArgListEntry Entry;
4553 Entry.Ty = TLI.getTargetData()->getIntPtrType();
4554 Args.push_back(Entry);
4556 std::pair<SDOperand,SDOperand> Result =
4557 TLI.LowerCallTo(getRoot(), I.getType(), false, false, false, CallingConv::C,
4558 true, DAG.getExternalSymbol("malloc", IntPtr), Args, DAG);
4559 setValue(&I, Result.first); // Pointers always fit in registers
4560 DAG.setRoot(Result.second);
4563 void SelectionDAGLowering::visitFree(FreeInst &I) {
4564 TargetLowering::ArgListTy Args;
4565 TargetLowering::ArgListEntry Entry;
4566 Entry.Node = getValue(I.getOperand(0));
4567 Entry.Ty = TLI.getTargetData()->getIntPtrType();
4568 Args.push_back(Entry);
4569 MVT IntPtr = TLI.getPointerTy();
4570 std::pair<SDOperand,SDOperand> Result =
4571 TLI.LowerCallTo(getRoot(), Type::VoidTy, false, false, false,
4572 CallingConv::C, true,
4573 DAG.getExternalSymbol("free", IntPtr), Args, DAG);
4574 DAG.setRoot(Result.second);
4577 // EmitInstrWithCustomInserter - This method should be implemented by targets
4578 // that mark instructions with the 'usesCustomDAGSchedInserter' flag. These
4579 // instructions are special in various ways, which require special support to
4580 // insert. The specified MachineInstr is created but not inserted into any
4581 // basic blocks, and the scheduler passes ownership of it to this method.
4582 MachineBasicBlock *TargetLowering::EmitInstrWithCustomInserter(MachineInstr *MI,
4583 MachineBasicBlock *MBB) {
4584 cerr << "If a target marks an instruction with "
4585 << "'usesCustomDAGSchedInserter', it must implement "
4586 << "TargetLowering::EmitInstrWithCustomInserter!\n";
4591 void SelectionDAGLowering::visitVAStart(CallInst &I) {
4592 DAG.setRoot(DAG.getNode(ISD::VASTART, MVT::Other, getRoot(),
4593 getValue(I.getOperand(1)),
4594 DAG.getSrcValue(I.getOperand(1))));
4597 void SelectionDAGLowering::visitVAArg(VAArgInst &I) {
4598 SDOperand V = DAG.getVAArg(TLI.getValueType(I.getType()), getRoot(),
4599 getValue(I.getOperand(0)),
4600 DAG.getSrcValue(I.getOperand(0)));
4602 DAG.setRoot(V.getValue(1));
4605 void SelectionDAGLowering::visitVAEnd(CallInst &I) {
4606 DAG.setRoot(DAG.getNode(ISD::VAEND, MVT::Other, getRoot(),
4607 getValue(I.getOperand(1)),
4608 DAG.getSrcValue(I.getOperand(1))));
4611 void SelectionDAGLowering::visitVACopy(CallInst &I) {
4612 DAG.setRoot(DAG.getNode(ISD::VACOPY, MVT::Other, getRoot(),
4613 getValue(I.getOperand(1)),
4614 getValue(I.getOperand(2)),
4615 DAG.getSrcValue(I.getOperand(1)),
4616 DAG.getSrcValue(I.getOperand(2))));
4619 /// TargetLowering::LowerArguments - This is the default LowerArguments
4620 /// implementation, which just inserts a FORMAL_ARGUMENTS node. FIXME: When all
4621 /// targets are migrated to using FORMAL_ARGUMENTS, this hook should be
4622 /// integrated into SDISel.
4623 std::vector<SDOperand>
4624 TargetLowering::LowerArguments(Function &F, SelectionDAG &DAG) {
4625 // Add CC# and isVararg as operands to the FORMAL_ARGUMENTS node.
4626 std::vector<SDOperand> Ops;
4627 Ops.push_back(DAG.getRoot());
4628 Ops.push_back(DAG.getConstant(F.getCallingConv(), getPointerTy()));
4629 Ops.push_back(DAG.getConstant(F.isVarArg(), getPointerTy()));
4631 // Add one result value for each formal argument.
4632 std::vector<MVT> RetVals;
4634 for (Function::arg_iterator I = F.arg_begin(), E = F.arg_end();
4636 SmallVector<MVT, 4> ValueVTs;
4637 ComputeValueVTs(*this, I->getType(), ValueVTs);
4638 for (unsigned Value = 0, NumValues = ValueVTs.size();
4639 Value != NumValues; ++Value) {
4640 MVT VT = ValueVTs[Value];
4641 const Type *ArgTy = VT.getTypeForMVT();
4642 ISD::ArgFlagsTy Flags;
4643 unsigned OriginalAlignment =
4644 getTargetData()->getABITypeAlignment(ArgTy);
4646 if (F.paramHasAttr(j, ParamAttr::ZExt))
4648 if (F.paramHasAttr(j, ParamAttr::SExt))
4650 if (F.paramHasAttr(j, ParamAttr::InReg))
4652 if (F.paramHasAttr(j, ParamAttr::StructRet))
4654 if (F.paramHasAttr(j, ParamAttr::ByVal)) {
4656 const PointerType *Ty = cast<PointerType>(I->getType());
4657 const Type *ElementTy = Ty->getElementType();
4658 unsigned FrameAlign = getByValTypeAlignment(ElementTy);
4659 unsigned FrameSize = getTargetData()->getABITypeSize(ElementTy);
4660 // For ByVal, alignment should be passed from FE. BE will guess if
4661 // this info is not there but there are cases it cannot get right.
4662 if (F.getParamAlignment(j))
4663 FrameAlign = F.getParamAlignment(j);
4664 Flags.setByValAlign(FrameAlign);
4665 Flags.setByValSize(FrameSize);
4667 if (F.paramHasAttr(j, ParamAttr::Nest))
4669 Flags.setOrigAlign(OriginalAlignment);
4671 MVT RegisterVT = getRegisterType(VT);
4672 unsigned NumRegs = getNumRegisters(VT);
4673 for (unsigned i = 0; i != NumRegs; ++i) {
4674 RetVals.push_back(RegisterVT);
4675 ISD::ArgFlagsTy MyFlags = Flags;
4676 if (NumRegs > 1 && i == 0)
4678 // if it isn't first piece, alignment must be 1
4680 MyFlags.setOrigAlign(1);
4681 Ops.push_back(DAG.getArgFlags(MyFlags));
4686 RetVals.push_back(MVT::Other);
4689 SDNode *Result = DAG.getNode(ISD::FORMAL_ARGUMENTS,
4690 DAG.getVTList(&RetVals[0], RetVals.size()),
4691 &Ops[0], Ops.size()).Val;
4693 // Prelower FORMAL_ARGUMENTS. This isn't required for functionality, but
4694 // allows exposing the loads that may be part of the argument access to the
4695 // first DAGCombiner pass.
4696 SDOperand TmpRes = LowerOperation(SDOperand(Result, 0), DAG);
4698 // The number of results should match up, except that the lowered one may have
4699 // an extra flag result.
4700 assert((Result->getNumValues() == TmpRes.Val->getNumValues() ||
4701 (Result->getNumValues()+1 == TmpRes.Val->getNumValues() &&
4702 TmpRes.getValue(Result->getNumValues()).getValueType() == MVT::Flag))
4703 && "Lowering produced unexpected number of results!");
4704 Result = TmpRes.Val;
4706 unsigned NumArgRegs = Result->getNumValues() - 1;
4707 DAG.setRoot(SDOperand(Result, NumArgRegs));
4709 // Set up the return result vector.
4713 for (Function::arg_iterator I = F.arg_begin(), E = F.arg_end(); I != E;
4715 SmallVector<MVT, 4> ValueVTs;
4716 ComputeValueVTs(*this, I->getType(), ValueVTs);
4717 for (unsigned Value = 0, NumValues = ValueVTs.size();
4718 Value != NumValues; ++Value) {
4719 MVT VT = ValueVTs[Value];
4720 MVT PartVT = getRegisterType(VT);
4722 unsigned NumParts = getNumRegisters(VT);
4723 SmallVector<SDOperand, 4> Parts(NumParts);
4724 for (unsigned j = 0; j != NumParts; ++j)
4725 Parts[j] = SDOperand(Result, i++);
4727 ISD::NodeType AssertOp = ISD::DELETED_NODE;
4728 if (F.paramHasAttr(Idx, ParamAttr::SExt))
4729 AssertOp = ISD::AssertSext;
4730 else if (F.paramHasAttr(Idx, ParamAttr::ZExt))
4731 AssertOp = ISD::AssertZext;
4733 Ops.push_back(getCopyFromParts(DAG, &Parts[0], NumParts, PartVT, VT,
4737 assert(i == NumArgRegs && "Argument register count mismatch!");
4742 /// TargetLowering::LowerCallTo - This is the default LowerCallTo
4743 /// implementation, which just inserts an ISD::CALL node, which is later custom
4744 /// lowered by the target to something concrete. FIXME: When all targets are
4745 /// migrated to using ISD::CALL, this hook should be integrated into SDISel.
4746 std::pair<SDOperand, SDOperand>
4747 TargetLowering::LowerCallTo(SDOperand Chain, const Type *RetTy,
4748 bool RetSExt, bool RetZExt, bool isVarArg,
4749 unsigned CallingConv, bool isTailCall,
4751 ArgListTy &Args, SelectionDAG &DAG) {
4752 SmallVector<SDOperand, 32> Ops;
4753 Ops.push_back(Chain); // Op#0 - Chain
4754 Ops.push_back(DAG.getConstant(CallingConv, getPointerTy())); // Op#1 - CC
4755 Ops.push_back(DAG.getConstant(isVarArg, getPointerTy())); // Op#2 - VarArg
4756 Ops.push_back(DAG.getConstant(isTailCall, getPointerTy())); // Op#3 - Tail
4757 Ops.push_back(Callee);
4759 // Handle all of the outgoing arguments.
4760 for (unsigned i = 0, e = Args.size(); i != e; ++i) {
4761 SmallVector<MVT, 4> ValueVTs;
4762 ComputeValueVTs(*this, Args[i].Ty, ValueVTs);
4763 for (unsigned Value = 0, NumValues = ValueVTs.size();
4764 Value != NumValues; ++Value) {
4765 MVT VT = ValueVTs[Value];
4766 const Type *ArgTy = VT.getTypeForMVT();
4767 SDOperand Op = SDOperand(Args[i].Node.Val, Args[i].Node.ResNo + Value);
4768 ISD::ArgFlagsTy Flags;
4769 unsigned OriginalAlignment =
4770 getTargetData()->getABITypeAlignment(ArgTy);
4776 if (Args[i].isInReg)
4780 if (Args[i].isByVal) {
4782 const PointerType *Ty = cast<PointerType>(Args[i].Ty);
4783 const Type *ElementTy = Ty->getElementType();
4784 unsigned FrameAlign = getByValTypeAlignment(ElementTy);
4785 unsigned FrameSize = getTargetData()->getABITypeSize(ElementTy);
4786 // For ByVal, alignment should come from FE. BE will guess if this
4787 // info is not there but there are cases it cannot get right.
4788 if (Args[i].Alignment)
4789 FrameAlign = Args[i].Alignment;
4790 Flags.setByValAlign(FrameAlign);
4791 Flags.setByValSize(FrameSize);
4795 Flags.setOrigAlign(OriginalAlignment);
4797 MVT PartVT = getRegisterType(VT);
4798 unsigned NumParts = getNumRegisters(VT);
4799 SmallVector<SDOperand, 4> Parts(NumParts);
4800 ISD::NodeType ExtendKind = ISD::ANY_EXTEND;
4803 ExtendKind = ISD::SIGN_EXTEND;
4804 else if (Args[i].isZExt)
4805 ExtendKind = ISD::ZERO_EXTEND;
4807 getCopyToParts(DAG, Op, &Parts[0], NumParts, PartVT, ExtendKind);
4809 for (unsigned i = 0; i != NumParts; ++i) {
4810 // if it isn't first piece, alignment must be 1
4811 ISD::ArgFlagsTy MyFlags = Flags;
4812 if (NumParts > 1 && i == 0)
4815 MyFlags.setOrigAlign(1);
4817 Ops.push_back(Parts[i]);
4818 Ops.push_back(DAG.getArgFlags(MyFlags));
4823 // Figure out the result value types. We start by making a list of
4824 // the potentially illegal return value types.
4825 SmallVector<MVT, 4> LoweredRetTys;
4826 SmallVector<MVT, 4> RetTys;
4827 ComputeValueVTs(*this, RetTy, RetTys);
4829 // Then we translate that to a list of legal types.
4830 for (unsigned I = 0, E = RetTys.size(); I != E; ++I) {
4832 MVT RegisterVT = getRegisterType(VT);
4833 unsigned NumRegs = getNumRegisters(VT);
4834 for (unsigned i = 0; i != NumRegs; ++i)
4835 LoweredRetTys.push_back(RegisterVT);
4838 LoweredRetTys.push_back(MVT::Other); // Always has a chain.
4840 // Create the CALL node.
4841 SDOperand Res = DAG.getNode(ISD::CALL,
4842 DAG.getVTList(&LoweredRetTys[0],
4843 LoweredRetTys.size()),
4844 &Ops[0], Ops.size());
4845 Chain = Res.getValue(LoweredRetTys.size() - 1);
4847 // Gather up the call result into a single value.
4848 if (RetTy != Type::VoidTy) {
4849 ISD::NodeType AssertOp = ISD::DELETED_NODE;
4852 AssertOp = ISD::AssertSext;
4854 AssertOp = ISD::AssertZext;
4856 SmallVector<SDOperand, 4> ReturnValues;
4858 for (unsigned I = 0, E = RetTys.size(); I != E; ++I) {
4860 MVT RegisterVT = getRegisterType(VT);
4861 unsigned NumRegs = getNumRegisters(VT);
4862 unsigned RegNoEnd = NumRegs + RegNo;
4863 SmallVector<SDOperand, 4> Results;
4864 for (; RegNo != RegNoEnd; ++RegNo)
4865 Results.push_back(Res.getValue(RegNo));
4866 SDOperand ReturnValue =
4867 getCopyFromParts(DAG, &Results[0], NumRegs, RegisterVT, VT,
4869 ReturnValues.push_back(ReturnValue);
4871 Res = ReturnValues.size() == 1 ? ReturnValues.front() :
4872 DAG.getNode(ISD::MERGE_VALUES,
4873 DAG.getVTList(&RetTys[0], RetTys.size()),
4874 &ReturnValues[0], ReturnValues.size());
4877 return std::make_pair(Res, Chain);
4880 SDOperand TargetLowering::LowerOperation(SDOperand Op, SelectionDAG &DAG) {
4881 assert(0 && "LowerOperation not implemented for this target!");
4886 SDOperand TargetLowering::CustomPromoteOperation(SDOperand Op,
4887 SelectionDAG &DAG) {
4888 assert(0 && "CustomPromoteOperation not implemented for this target!");
4893 //===----------------------------------------------------------------------===//
4894 // SelectionDAGISel code
4895 //===----------------------------------------------------------------------===//
4897 unsigned SelectionDAGISel::MakeReg(MVT VT) {
4898 return RegInfo->createVirtualRegister(TLI.getRegClassFor(VT));
4901 void SelectionDAGISel::getAnalysisUsage(AnalysisUsage &AU) const {
4902 AU.addRequired<AliasAnalysis>();
4903 AU.addRequired<CollectorModuleMetadata>();
4904 AU.setPreservesAll();
4907 bool SelectionDAGISel::runOnFunction(Function &Fn) {
4908 // Get alias analysis for load/store combining.
4909 AA = &getAnalysis<AliasAnalysis>();
4911 MachineFunction &MF = MachineFunction::construct(&Fn, TLI.getTargetMachine());
4912 if (MF.getFunction()->hasCollector())
4913 GCI = &getAnalysis<CollectorModuleMetadata>().get(*MF.getFunction());
4916 RegInfo = &MF.getRegInfo();
4917 DOUT << "\n\n\n=== " << Fn.getName() << "\n";
4919 FunctionLoweringInfo FuncInfo(TLI, Fn, MF);
4921 for (Function::iterator I = Fn.begin(), E = Fn.end(); I != E; ++I)
4922 if (InvokeInst *Invoke = dyn_cast<InvokeInst>(I->getTerminator()))
4923 // Mark landing pad.
4924 FuncInfo.MBBMap[Invoke->getSuccessor(1)]->setIsLandingPad();
4926 for (Function::iterator I = Fn.begin(), E = Fn.end(); I != E; ++I)
4927 SelectBasicBlock(I, MF, FuncInfo);
4929 // Add function live-ins to entry block live-in set.
4930 BasicBlock *EntryBB = &Fn.getEntryBlock();
4931 BB = FuncInfo.MBBMap[EntryBB];
4932 if (!RegInfo->livein_empty())
4933 for (MachineRegisterInfo::livein_iterator I = RegInfo->livein_begin(),
4934 E = RegInfo->livein_end(); I != E; ++I)
4935 BB->addLiveIn(I->first);
4938 assert(FuncInfo.CatchInfoFound.size() == FuncInfo.CatchInfoLost.size() &&
4939 "Not all catch info was assigned to a landing pad!");
4945 void SelectionDAGLowering::CopyValueToVirtualRegister(Value *V, unsigned Reg) {
4946 SDOperand Op = getValue(V);
4947 assert((Op.getOpcode() != ISD::CopyFromReg ||
4948 cast<RegisterSDNode>(Op.getOperand(1))->getReg() != Reg) &&
4949 "Copy from a reg to the same reg!");
4950 assert(!TargetRegisterInfo::isPhysicalRegister(Reg) && "Is a physreg");
4952 RegsForValue RFV(TLI, Reg, V->getType());
4953 SDOperand Chain = DAG.getEntryNode();
4954 RFV.getCopyToRegs(Op, DAG, Chain, 0);
4955 PendingExports.push_back(Chain);
4958 void SelectionDAGISel::
4959 LowerArguments(BasicBlock *LLVMBB, SelectionDAGLowering &SDL) {
4960 // If this is the entry block, emit arguments.
4961 Function &F = *LLVMBB->getParent();
4962 FunctionLoweringInfo &FuncInfo = SDL.FuncInfo;
4963 SDOperand OldRoot = SDL.DAG.getRoot();
4964 std::vector<SDOperand> Args = TLI.LowerArguments(F, SDL.DAG);
4967 for (Function::arg_iterator AI = F.arg_begin(), E = F.arg_end();
4969 SmallVector<MVT, 4> ValueVTs;
4970 ComputeValueVTs(TLI, AI->getType(), ValueVTs);
4971 unsigned NumValues = ValueVTs.size();
4972 if (!AI->use_empty()) {
4973 SmallVector<MVT, 4> LegalValueVTs(NumValues);
4974 for (unsigned VI = 0; VI != NumValues; ++VI)
4975 LegalValueVTs[VI] = Args[a + VI].getValueType();
4976 SDL.setValue(AI, SDL.DAG.getNode(ISD::MERGE_VALUES,
4977 SDL.DAG.getVTList(&LegalValueVTs[0],
4979 &Args[a], NumValues));
4980 // If this argument is live outside of the entry block, insert a copy from
4981 // whereever we got it to the vreg that other BB's will reference it as.
4982 DenseMap<const Value*, unsigned>::iterator VMI=FuncInfo.ValueMap.find(AI);
4983 if (VMI != FuncInfo.ValueMap.end()) {
4984 SDL.CopyValueToVirtualRegister(AI, VMI->second);
4990 // Finally, if the target has anything special to do, allow it to do so.
4991 // FIXME: this should insert code into the DAG!
4992 EmitFunctionEntryCode(F, SDL.DAG.getMachineFunction());
4995 static void copyCatchInfo(BasicBlock *SrcBB, BasicBlock *DestBB,
4996 MachineModuleInfo *MMI, FunctionLoweringInfo &FLI) {
4997 for (BasicBlock::iterator I = SrcBB->begin(), E = --SrcBB->end(); I != E; ++I)
4998 if (isSelector(I)) {
4999 // Apply the catch info to DestBB.
5000 addCatchInfo(cast<CallInst>(*I), MMI, FLI.MBBMap[DestBB]);
5002 if (!FLI.MBBMap[SrcBB]->isLandingPad())
5003 FLI.CatchInfoFound.insert(I);
5008 /// IsFixedFrameObjectWithPosOffset - Check if object is a fixed frame object and
5009 /// whether object offset >= 0.
5011 IsFixedFrameObjectWithPosOffset(MachineFrameInfo * MFI, SDOperand Op) {
5012 if (!isa<FrameIndexSDNode>(Op)) return false;
5014 FrameIndexSDNode * FrameIdxNode = dyn_cast<FrameIndexSDNode>(Op);
5015 int FrameIdx = FrameIdxNode->getIndex();
5016 return MFI->isFixedObjectIndex(FrameIdx) &&
5017 MFI->getObjectOffset(FrameIdx) >= 0;
5020 /// IsPossiblyOverwrittenArgumentOfTailCall - Check if the operand could
5021 /// possibly be overwritten when lowering the outgoing arguments in a tail
5022 /// call. Currently the implementation of this call is very conservative and
5023 /// assumes all arguments sourcing from FORMAL_ARGUMENTS or a CopyFromReg with
5024 /// virtual registers would be overwritten by direct lowering.
5025 static bool IsPossiblyOverwrittenArgumentOfTailCall(SDOperand Op,
5026 MachineFrameInfo * MFI) {
5027 RegisterSDNode * OpReg = NULL;
5028 if (Op.getOpcode() == ISD::FORMAL_ARGUMENTS ||
5029 (Op.getOpcode()== ISD::CopyFromReg &&
5030 (OpReg = dyn_cast<RegisterSDNode>(Op.getOperand(1))) &&
5031 (OpReg->getReg() >= TargetRegisterInfo::FirstVirtualRegister)) ||
5032 (Op.getOpcode() == ISD::LOAD &&
5033 IsFixedFrameObjectWithPosOffset(MFI, Op.getOperand(1))) ||
5034 (Op.getOpcode() == ISD::MERGE_VALUES &&
5035 Op.getOperand(Op.ResNo).getOpcode() == ISD::LOAD &&
5036 IsFixedFrameObjectWithPosOffset(MFI, Op.getOperand(Op.ResNo).
5042 /// CheckDAGForTailCallsAndFixThem - This Function looks for CALL nodes in the
5043 /// DAG and fixes their tailcall attribute operand.
5044 static void CheckDAGForTailCallsAndFixThem(SelectionDAG &DAG,
5045 TargetLowering& TLI) {
5046 SDNode * Ret = NULL;
5047 SDOperand Terminator = DAG.getRoot();
5050 if (Terminator.getOpcode() == ISD::RET) {
5051 Ret = Terminator.Val;
5054 // Fix tail call attribute of CALL nodes.
5055 for (SelectionDAG::allnodes_iterator BE = DAG.allnodes_begin(),
5056 BI = prior(DAG.allnodes_end()); BI != BE; --BI) {
5057 if (BI->getOpcode() == ISD::CALL) {
5058 SDOperand OpRet(Ret, 0);
5059 SDOperand OpCall(static_cast<SDNode*>(BI), 0);
5060 bool isMarkedTailCall =
5061 cast<ConstantSDNode>(OpCall.getOperand(3))->getValue() != 0;
5062 // If CALL node has tail call attribute set to true and the call is not
5063 // eligible (no RET or the target rejects) the attribute is fixed to
5064 // false. The TargetLowering::IsEligibleForTailCallOptimization function
5065 // must correctly identify tail call optimizable calls.
5066 if (!isMarkedTailCall) continue;
5068 !TLI.IsEligibleForTailCallOptimization(OpCall, OpRet, DAG)) {
5069 // Not eligible. Mark CALL node as non tail call.
5070 SmallVector<SDOperand, 32> Ops;
5072 for(SDNode::op_iterator I =OpCall.Val->op_begin(),
5073 E = OpCall.Val->op_end(); I != E; I++, idx++) {
5077 Ops.push_back(DAG.getConstant(false, TLI.getPointerTy()));
5079 DAG.UpdateNodeOperands(OpCall, Ops.begin(), Ops.size());
5081 // Look for tail call clobbered arguments. Emit a series of
5082 // copyto/copyfrom virtual register nodes to protect them.
5083 SmallVector<SDOperand, 32> Ops;
5084 SDOperand Chain = OpCall.getOperand(0), InFlag;
5086 for(SDNode::op_iterator I = OpCall.Val->op_begin(),
5087 E = OpCall.Val->op_end(); I != E; I++, idx++) {
5089 if (idx > 4 && (idx % 2)) {
5090 bool isByVal = cast<ARG_FLAGSSDNode>(OpCall.getOperand(idx+1))->
5091 getArgFlags().isByVal();
5092 MachineFunction &MF = DAG.getMachineFunction();
5093 MachineFrameInfo *MFI = MF.getFrameInfo();
5095 IsPossiblyOverwrittenArgumentOfTailCall(Arg, MFI)) {
5096 MVT VT = Arg.getValueType();
5097 unsigned VReg = MF.getRegInfo().
5098 createVirtualRegister(TLI.getRegClassFor(VT));
5099 Chain = DAG.getCopyToReg(Chain, VReg, Arg, InFlag);
5100 InFlag = Chain.getValue(1);
5101 Arg = DAG.getCopyFromReg(Chain, VReg, VT, InFlag);
5102 Chain = Arg.getValue(1);
5103 InFlag = Arg.getValue(2);
5108 // Link in chain of CopyTo/CopyFromReg.
5110 DAG.UpdateNodeOperands(OpCall, Ops.begin(), Ops.size());
5116 void SelectionDAGISel::BuildSelectionDAG(SelectionDAG &DAG, BasicBlock *LLVMBB,
5117 std::vector<std::pair<MachineInstr*, unsigned> > &PHINodesToUpdate,
5118 FunctionLoweringInfo &FuncInfo) {
5119 SelectionDAGLowering SDL(DAG, TLI, *AA, FuncInfo, GCI);
5121 // Lower any arguments needed in this block if this is the entry block.
5122 if (LLVMBB == &LLVMBB->getParent()->getEntryBlock())
5123 LowerArguments(LLVMBB, SDL);
5125 BB = FuncInfo.MBBMap[LLVMBB];
5126 SDL.setCurrentBasicBlock(BB);
5128 MachineModuleInfo *MMI = DAG.getMachineModuleInfo();
5130 if (MMI && BB->isLandingPad()) {
5131 // Add a label to mark the beginning of the landing pad. Deletion of the
5132 // landing pad can thus be detected via the MachineModuleInfo.
5133 unsigned LabelID = MMI->addLandingPad(BB);
5134 DAG.setRoot(DAG.getNode(ISD::LABEL, MVT::Other, DAG.getEntryNode(),
5135 DAG.getConstant(LabelID, MVT::i32),
5136 DAG.getConstant(1, MVT::i32)));
5138 // Mark exception register as live in.
5139 unsigned Reg = TLI.getExceptionAddressRegister();
5140 if (Reg) BB->addLiveIn(Reg);
5142 // Mark exception selector register as live in.
5143 Reg = TLI.getExceptionSelectorRegister();
5144 if (Reg) BB->addLiveIn(Reg);
5146 // FIXME: Hack around an exception handling flaw (PR1508): the personality
5147 // function and list of typeids logically belong to the invoke (or, if you
5148 // like, the basic block containing the invoke), and need to be associated
5149 // with it in the dwarf exception handling tables. Currently however the
5150 // information is provided by an intrinsic (eh.selector) that can be moved
5151 // to unexpected places by the optimizers: if the unwind edge is critical,
5152 // then breaking it can result in the intrinsics being in the successor of
5153 // the landing pad, not the landing pad itself. This results in exceptions
5154 // not being caught because no typeids are associated with the invoke.
5155 // This may not be the only way things can go wrong, but it is the only way
5156 // we try to work around for the moment.
5157 BranchInst *Br = dyn_cast<BranchInst>(LLVMBB->getTerminator());
5159 if (Br && Br->isUnconditional()) { // Critical edge?
5160 BasicBlock::iterator I, E;
5161 for (I = LLVMBB->begin(), E = --LLVMBB->end(); I != E; ++I)
5166 // No catch info found - try to extract some from the successor.
5167 copyCatchInfo(Br->getSuccessor(0), LLVMBB, MMI, FuncInfo);
5171 // Lower all of the non-terminator instructions.
5172 for (BasicBlock::iterator I = LLVMBB->begin(), E = --LLVMBB->end();
5176 // Ensure that all instructions which are used outside of their defining
5177 // blocks are available as virtual registers. Invoke is handled elsewhere.
5178 for (BasicBlock::iterator I = LLVMBB->begin(), E = LLVMBB->end(); I != E;++I)
5179 if (!I->use_empty() && !isa<PHINode>(I) && !isa<InvokeInst>(I)) {
5180 DenseMap<const Value*, unsigned>::iterator VMI =FuncInfo.ValueMap.find(I);
5181 if (VMI != FuncInfo.ValueMap.end())
5182 SDL.CopyValueToVirtualRegister(I, VMI->second);
5185 // Handle PHI nodes in successor blocks. Emit code into the SelectionDAG to
5186 // ensure constants are generated when needed. Remember the virtual registers
5187 // that need to be added to the Machine PHI nodes as input. We cannot just
5188 // directly add them, because expansion might result in multiple MBB's for one
5189 // BB. As such, the start of the BB might correspond to a different MBB than
5192 TerminatorInst *TI = LLVMBB->getTerminator();
5194 // Emit constants only once even if used by multiple PHI nodes.
5195 std::map<Constant*, unsigned> ConstantsOut;
5197 // Vector bool would be better, but vector<bool> is really slow.
5198 std::vector<unsigned char> SuccsHandled;
5199 if (TI->getNumSuccessors())
5200 SuccsHandled.resize(BB->getParent()->getNumBlockIDs());
5202 // Check successor nodes' PHI nodes that expect a constant to be available
5204 for (unsigned succ = 0, e = TI->getNumSuccessors(); succ != e; ++succ) {
5205 BasicBlock *SuccBB = TI->getSuccessor(succ);
5206 if (!isa<PHINode>(SuccBB->begin())) continue;
5207 MachineBasicBlock *SuccMBB = FuncInfo.MBBMap[SuccBB];
5209 // If this terminator has multiple identical successors (common for
5210 // switches), only handle each succ once.
5211 unsigned SuccMBBNo = SuccMBB->getNumber();
5212 if (SuccsHandled[SuccMBBNo]) continue;
5213 SuccsHandled[SuccMBBNo] = true;
5215 MachineBasicBlock::iterator MBBI = SuccMBB->begin();
5218 // At this point we know that there is a 1-1 correspondence between LLVM PHI
5219 // nodes and Machine PHI nodes, but the incoming operands have not been
5221 for (BasicBlock::iterator I = SuccBB->begin();
5222 (PN = dyn_cast<PHINode>(I)); ++I) {
5223 // Ignore dead phi's.
5224 if (PN->use_empty()) continue;
5227 Value *PHIOp = PN->getIncomingValueForBlock(LLVMBB);
5229 if (Constant *C = dyn_cast<Constant>(PHIOp)) {
5230 unsigned &RegOut = ConstantsOut[C];
5232 RegOut = FuncInfo.CreateRegForValue(C);
5233 SDL.CopyValueToVirtualRegister(C, RegOut);
5237 Reg = FuncInfo.ValueMap[PHIOp];
5239 assert(isa<AllocaInst>(PHIOp) &&
5240 FuncInfo.StaticAllocaMap.count(cast<AllocaInst>(PHIOp)) &&
5241 "Didn't codegen value into a register!??");
5242 Reg = FuncInfo.CreateRegForValue(PHIOp);
5243 SDL.CopyValueToVirtualRegister(PHIOp, Reg);
5247 // Remember that this register needs to added to the machine PHI node as
5248 // the input for this MBB.
5249 MVT VT = TLI.getValueType(PN->getType());
5250 unsigned NumRegisters = TLI.getNumRegisters(VT);
5251 for (unsigned i = 0, e = NumRegisters; i != e; ++i)
5252 PHINodesToUpdate.push_back(std::make_pair(MBBI++, Reg+i));
5255 ConstantsOut.clear();
5257 // Lower the terminator after the copies are emitted.
5258 SDL.visit(*LLVMBB->getTerminator());
5260 // Copy over any CaseBlock records that may now exist due to SwitchInst
5261 // lowering, as well as any jump table information.
5262 SwitchCases.clear();
5263 SwitchCases = SDL.SwitchCases;
5265 JTCases = SDL.JTCases;
5266 BitTestCases.clear();
5267 BitTestCases = SDL.BitTestCases;
5269 // Make sure the root of the DAG is up-to-date.
5270 DAG.setRoot(SDL.getControlRoot());
5272 // Check whether calls in this block are real tail calls. Fix up CALL nodes
5273 // with correct tailcall attribute so that the target can rely on the tailcall
5274 // attribute indicating whether the call is really eligible for tail call
5276 CheckDAGForTailCallsAndFixThem(DAG, TLI);
5279 void SelectionDAGISel::ComputeLiveOutVRegInfo(SelectionDAG &DAG) {
5280 SmallPtrSet<SDNode*, 128> VisitedNodes;
5281 SmallVector<SDNode*, 128> Worklist;
5283 Worklist.push_back(DAG.getRoot().Val);
5289 while (!Worklist.empty()) {
5290 SDNode *N = Worklist.back();
5291 Worklist.pop_back();
5293 // If we've already seen this node, ignore it.
5294 if (!VisitedNodes.insert(N))
5297 // Otherwise, add all chain operands to the worklist.
5298 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
5299 if (N->getOperand(i).getValueType() == MVT::Other)
5300 Worklist.push_back(N->getOperand(i).Val);
5302 // If this is a CopyToReg with a vreg dest, process it.
5303 if (N->getOpcode() != ISD::CopyToReg)
5306 unsigned DestReg = cast<RegisterSDNode>(N->getOperand(1))->getReg();
5307 if (!TargetRegisterInfo::isVirtualRegister(DestReg))
5310 // Ignore non-scalar or non-integer values.
5311 SDOperand Src = N->getOperand(2);
5312 MVT SrcVT = Src.getValueType();
5313 if (!SrcVT.isInteger() || SrcVT.isVector())
5316 unsigned NumSignBits = DAG.ComputeNumSignBits(Src);
5317 Mask = APInt::getAllOnesValue(SrcVT.getSizeInBits());
5318 DAG.ComputeMaskedBits(Src, Mask, KnownZero, KnownOne);
5320 // Only install this information if it tells us something.
5321 if (NumSignBits != 1 || KnownZero != 0 || KnownOne != 0) {
5322 DestReg -= TargetRegisterInfo::FirstVirtualRegister;
5323 FunctionLoweringInfo &FLI = DAG.getFunctionLoweringInfo();
5324 if (DestReg >= FLI.LiveOutRegInfo.size())
5325 FLI.LiveOutRegInfo.resize(DestReg+1);
5326 FunctionLoweringInfo::LiveOutInfo &LOI = FLI.LiveOutRegInfo[DestReg];
5327 LOI.NumSignBits = NumSignBits;
5328 LOI.KnownOne = NumSignBits;
5329 LOI.KnownZero = NumSignBits;
5334 void SelectionDAGISel::CodeGenAndEmitDAG(SelectionDAG &DAG) {
5335 DOUT << "Lowered selection DAG:\n";
5338 // Run the DAG combiner in pre-legalize mode.
5339 DAG.Combine(false, *AA);
5341 DOUT << "Optimized lowered selection DAG:\n";
5344 // Second step, hack on the DAG until it only uses operations and types that
5345 // the target supports.
5346 #if 0 // Enable this some day.
5347 DAG.LegalizeTypes();
5348 // Someday even later, enable a dag combine pass here.
5352 DOUT << "Legalized selection DAG:\n";
5355 // Run the DAG combiner in post-legalize mode.
5356 DAG.Combine(true, *AA);
5358 DOUT << "Optimized legalized selection DAG:\n";
5361 if (ViewISelDAGs) DAG.viewGraph();
5363 if (EnableValueProp) // FIXME: Only do this if !fast.
5364 ComputeLiveOutVRegInfo(DAG);
5366 // Third, instruction select all of the operations to machine code, adding the
5367 // code to the MachineBasicBlock.
5368 InstructionSelectBasicBlock(DAG);
5370 DOUT << "Selected machine code:\n";
5374 void SelectionDAGISel::SelectBasicBlock(BasicBlock *LLVMBB, MachineFunction &MF,
5375 FunctionLoweringInfo &FuncInfo) {
5376 std::vector<std::pair<MachineInstr*, unsigned> > PHINodesToUpdate;
5378 SelectionDAG DAG(TLI, MF, FuncInfo,
5379 getAnalysisToUpdate<MachineModuleInfo>());
5382 // First step, lower LLVM code to some DAG. This DAG may use operations and
5383 // types that are not supported by the target.
5384 BuildSelectionDAG(DAG, LLVMBB, PHINodesToUpdate, FuncInfo);
5386 // Second step, emit the lowered DAG as machine code.
5387 CodeGenAndEmitDAG(DAG);
5390 DOUT << "Total amount of phi nodes to update: "
5391 << PHINodesToUpdate.size() << "\n";
5392 DEBUG(for (unsigned i = 0, e = PHINodesToUpdate.size(); i != e; ++i)
5393 DOUT << "Node " << i << " : (" << PHINodesToUpdate[i].first
5394 << ", " << PHINodesToUpdate[i].second << ")\n";);
5396 // Next, now that we know what the last MBB the LLVM BB expanded is, update
5397 // PHI nodes in successors.
5398 if (SwitchCases.empty() && JTCases.empty() && BitTestCases.empty()) {
5399 for (unsigned i = 0, e = PHINodesToUpdate.size(); i != e; ++i) {
5400 MachineInstr *PHI = PHINodesToUpdate[i].first;
5401 assert(PHI->getOpcode() == TargetInstrInfo::PHI &&
5402 "This is not a machine PHI node that we are updating!");
5403 PHI->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[i].second,
5405 PHI->addOperand(MachineOperand::CreateMBB(BB));
5410 for (unsigned i = 0, e = BitTestCases.size(); i != e; ++i) {
5411 // Lower header first, if it wasn't already lowered
5412 if (!BitTestCases[i].Emitted) {
5413 SelectionDAG HSDAG(TLI, MF, FuncInfo,
5414 getAnalysisToUpdate<MachineModuleInfo>());
5416 SelectionDAGLowering HSDL(HSDAG, TLI, *AA, FuncInfo, GCI);
5417 // Set the current basic block to the mbb we wish to insert the code into
5418 BB = BitTestCases[i].Parent;
5419 HSDL.setCurrentBasicBlock(BB);
5421 HSDL.visitBitTestHeader(BitTestCases[i]);
5422 HSDAG.setRoot(HSDL.getRoot());
5423 CodeGenAndEmitDAG(HSDAG);
5426 for (unsigned j = 0, ej = BitTestCases[i].Cases.size(); j != ej; ++j) {
5427 SelectionDAG BSDAG(TLI, MF, FuncInfo,
5428 getAnalysisToUpdate<MachineModuleInfo>());
5430 SelectionDAGLowering BSDL(BSDAG, TLI, *AA, FuncInfo, GCI);
5431 // Set the current basic block to the mbb we wish to insert the code into
5432 BB = BitTestCases[i].Cases[j].ThisBB;
5433 BSDL.setCurrentBasicBlock(BB);
5436 BSDL.visitBitTestCase(BitTestCases[i].Cases[j+1].ThisBB,
5437 BitTestCases[i].Reg,
5438 BitTestCases[i].Cases[j]);
5440 BSDL.visitBitTestCase(BitTestCases[i].Default,
5441 BitTestCases[i].Reg,
5442 BitTestCases[i].Cases[j]);
5445 BSDAG.setRoot(BSDL.getRoot());
5446 CodeGenAndEmitDAG(BSDAG);
5450 for (unsigned pi = 0, pe = PHINodesToUpdate.size(); pi != pe; ++pi) {
5451 MachineInstr *PHI = PHINodesToUpdate[pi].first;
5452 MachineBasicBlock *PHIBB = PHI->getParent();
5453 assert(PHI->getOpcode() == TargetInstrInfo::PHI &&
5454 "This is not a machine PHI node that we are updating!");
5455 // This is "default" BB. We have two jumps to it. From "header" BB and
5456 // from last "case" BB.
5457 if (PHIBB == BitTestCases[i].Default) {
5458 PHI->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[pi].second,
5460 PHI->addOperand(MachineOperand::CreateMBB(BitTestCases[i].Parent));
5461 PHI->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[pi].second,
5463 PHI->addOperand(MachineOperand::CreateMBB(BitTestCases[i].Cases.
5466 // One of "cases" BB.
5467 for (unsigned j = 0, ej = BitTestCases[i].Cases.size(); j != ej; ++j) {
5468 MachineBasicBlock* cBB = BitTestCases[i].Cases[j].ThisBB;
5469 if (cBB->succ_end() !=
5470 std::find(cBB->succ_begin(),cBB->succ_end(), PHIBB)) {
5471 PHI->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[pi].second,
5473 PHI->addOperand(MachineOperand::CreateMBB(cBB));
5479 // If the JumpTable record is filled in, then we need to emit a jump table.
5480 // Updating the PHI nodes is tricky in this case, since we need to determine
5481 // whether the PHI is a successor of the range check MBB or the jump table MBB
5482 for (unsigned i = 0, e = JTCases.size(); i != e; ++i) {
5483 // Lower header first, if it wasn't already lowered
5484 if (!JTCases[i].first.Emitted) {
5485 SelectionDAG HSDAG(TLI, MF, FuncInfo,
5486 getAnalysisToUpdate<MachineModuleInfo>());
5488 SelectionDAGLowering HSDL(HSDAG, TLI, *AA, FuncInfo, GCI);
5489 // Set the current basic block to the mbb we wish to insert the code into
5490 BB = JTCases[i].first.HeaderBB;
5491 HSDL.setCurrentBasicBlock(BB);
5493 HSDL.visitJumpTableHeader(JTCases[i].second, JTCases[i].first);
5494 HSDAG.setRoot(HSDL.getRoot());
5495 CodeGenAndEmitDAG(HSDAG);
5498 SelectionDAG JSDAG(TLI, MF, FuncInfo,
5499 getAnalysisToUpdate<MachineModuleInfo>());
5501 SelectionDAGLowering JSDL(JSDAG, TLI, *AA, FuncInfo, GCI);
5502 // Set the current basic block to the mbb we wish to insert the code into
5503 BB = JTCases[i].second.MBB;
5504 JSDL.setCurrentBasicBlock(BB);
5506 JSDL.visitJumpTable(JTCases[i].second);
5507 JSDAG.setRoot(JSDL.getRoot());
5508 CodeGenAndEmitDAG(JSDAG);
5511 for (unsigned pi = 0, pe = PHINodesToUpdate.size(); pi != pe; ++pi) {
5512 MachineInstr *PHI = PHINodesToUpdate[pi].first;
5513 MachineBasicBlock *PHIBB = PHI->getParent();
5514 assert(PHI->getOpcode() == TargetInstrInfo::PHI &&
5515 "This is not a machine PHI node that we are updating!");
5516 // "default" BB. We can go there only from header BB.
5517 if (PHIBB == JTCases[i].second.Default) {
5518 PHI->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[pi].second,
5520 PHI->addOperand(MachineOperand::CreateMBB(JTCases[i].first.HeaderBB));
5522 // JT BB. Just iterate over successors here
5523 if (BB->succ_end() != std::find(BB->succ_begin(),BB->succ_end(), PHIBB)) {
5524 PHI->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[pi].second,
5526 PHI->addOperand(MachineOperand::CreateMBB(BB));
5531 // If the switch block involved a branch to one of the actual successors, we
5532 // need to update PHI nodes in that block.
5533 for (unsigned i = 0, e = PHINodesToUpdate.size(); i != e; ++i) {
5534 MachineInstr *PHI = PHINodesToUpdate[i].first;
5535 assert(PHI->getOpcode() == TargetInstrInfo::PHI &&
5536 "This is not a machine PHI node that we are updating!");
5537 if (BB->isSuccessor(PHI->getParent())) {
5538 PHI->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[i].second,
5540 PHI->addOperand(MachineOperand::CreateMBB(BB));
5544 // If we generated any switch lowering information, build and codegen any
5545 // additional DAGs necessary.
5546 for (unsigned i = 0, e = SwitchCases.size(); i != e; ++i) {
5547 SelectionDAG SDAG(TLI, MF, FuncInfo,
5548 getAnalysisToUpdate<MachineModuleInfo>());
5550 SelectionDAGLowering SDL(SDAG, TLI, *AA, FuncInfo, GCI);
5552 // Set the current basic block to the mbb we wish to insert the code into
5553 BB = SwitchCases[i].ThisBB;
5554 SDL.setCurrentBasicBlock(BB);
5557 SDL.visitSwitchCase(SwitchCases[i]);
5558 SDAG.setRoot(SDL.getRoot());
5559 CodeGenAndEmitDAG(SDAG);
5561 // Handle any PHI nodes in successors of this chunk, as if we were coming
5562 // from the original BB before switch expansion. Note that PHI nodes can
5563 // occur multiple times in PHINodesToUpdate. We have to be very careful to
5564 // handle them the right number of times.
5565 while ((BB = SwitchCases[i].TrueBB)) { // Handle LHS and RHS.
5566 for (MachineBasicBlock::iterator Phi = BB->begin();
5567 Phi != BB->end() && Phi->getOpcode() == TargetInstrInfo::PHI; ++Phi){
5568 // This value for this PHI node is recorded in PHINodesToUpdate, get it.
5569 for (unsigned pn = 0; ; ++pn) {
5570 assert(pn != PHINodesToUpdate.size() && "Didn't find PHI entry!");
5571 if (PHINodesToUpdate[pn].first == Phi) {
5572 Phi->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[pn].
5574 Phi->addOperand(MachineOperand::CreateMBB(SwitchCases[i].ThisBB));
5580 // Don't process RHS if same block as LHS.
5581 if (BB == SwitchCases[i].FalseBB)
5582 SwitchCases[i].FalseBB = 0;
5584 // If we haven't handled the RHS, do so now. Otherwise, we're done.
5585 SwitchCases[i].TrueBB = SwitchCases[i].FalseBB;
5586 SwitchCases[i].FalseBB = 0;
5588 assert(SwitchCases[i].TrueBB == 0 && SwitchCases[i].FalseBB == 0);
5593 //===----------------------------------------------------------------------===//
5594 /// ScheduleAndEmitDAG - Pick a safe ordering and emit instructions for each
5595 /// target node in the graph.
5596 void SelectionDAGISel::ScheduleAndEmitDAG(SelectionDAG &DAG) {
5597 if (ViewSchedDAGs) DAG.viewGraph();
5599 RegisterScheduler::FunctionPassCtor Ctor = RegisterScheduler::getDefault();
5603 RegisterScheduler::setDefault(Ctor);
5606 ScheduleDAG *SL = Ctor(this, &DAG, BB);
5609 if (ViewSUnitDAGs) SL->viewGraph();
5615 HazardRecognizer *SelectionDAGISel::CreateTargetHazardRecognizer() {
5616 return new HazardRecognizer();
5619 //===----------------------------------------------------------------------===//
5620 // Helper functions used by the generated instruction selector.
5621 //===----------------------------------------------------------------------===//
5622 // Calls to these methods are generated by tblgen.
5624 /// CheckAndMask - The isel is trying to match something like (and X, 255). If
5625 /// the dag combiner simplified the 255, we still want to match. RHS is the
5626 /// actual value in the DAG on the RHS of an AND, and DesiredMaskS is the value
5627 /// specified in the .td file (e.g. 255).
5628 bool SelectionDAGISel::CheckAndMask(SDOperand LHS, ConstantSDNode *RHS,
5629 int64_t DesiredMaskS) const {
5630 const APInt &ActualMask = RHS->getAPIntValue();
5631 const APInt &DesiredMask = APInt(LHS.getValueSizeInBits(), DesiredMaskS);
5633 // If the actual mask exactly matches, success!
5634 if (ActualMask == DesiredMask)
5637 // If the actual AND mask is allowing unallowed bits, this doesn't match.
5638 if (ActualMask.intersects(~DesiredMask))
5641 // Otherwise, the DAG Combiner may have proven that the value coming in is
5642 // either already zero or is not demanded. Check for known zero input bits.
5643 APInt NeededMask = DesiredMask & ~ActualMask;
5644 if (CurDAG->MaskedValueIsZero(LHS, NeededMask))
5647 // TODO: check to see if missing bits are just not demanded.
5649 // Otherwise, this pattern doesn't match.
5653 /// CheckOrMask - The isel is trying to match something like (or X, 255). If
5654 /// the dag combiner simplified the 255, we still want to match. RHS is the
5655 /// actual value in the DAG on the RHS of an OR, and DesiredMaskS is the value
5656 /// specified in the .td file (e.g. 255).
5657 bool SelectionDAGISel::CheckOrMask(SDOperand LHS, ConstantSDNode *RHS,
5658 int64_t DesiredMaskS) const {
5659 const APInt &ActualMask = RHS->getAPIntValue();
5660 const APInt &DesiredMask = APInt(LHS.getValueSizeInBits(), DesiredMaskS);
5662 // If the actual mask exactly matches, success!
5663 if (ActualMask == DesiredMask)
5666 // If the actual AND mask is allowing unallowed bits, this doesn't match.
5667 if (ActualMask.intersects(~DesiredMask))
5670 // Otherwise, the DAG Combiner may have proven that the value coming in is
5671 // either already zero or is not demanded. Check for known zero input bits.
5672 APInt NeededMask = DesiredMask & ~ActualMask;
5674 APInt KnownZero, KnownOne;
5675 CurDAG->ComputeMaskedBits(LHS, NeededMask, KnownZero, KnownOne);
5677 // If all the missing bits in the or are already known to be set, match!
5678 if ((NeededMask & KnownOne) == NeededMask)
5681 // TODO: check to see if missing bits are just not demanded.
5683 // Otherwise, this pattern doesn't match.
5688 /// SelectInlineAsmMemoryOperands - Calls to this are automatically generated
5689 /// by tblgen. Others should not call it.
5690 void SelectionDAGISel::
5691 SelectInlineAsmMemoryOperands(std::vector<SDOperand> &Ops, SelectionDAG &DAG) {
5692 std::vector<SDOperand> InOps;
5693 std::swap(InOps, Ops);
5695 Ops.push_back(InOps[0]); // input chain.
5696 Ops.push_back(InOps[1]); // input asm string.
5698 unsigned i = 2, e = InOps.size();
5699 if (InOps[e-1].getValueType() == MVT::Flag)
5700 --e; // Don't process a flag operand if it is here.
5703 unsigned Flags = cast<ConstantSDNode>(InOps[i])->getValue();
5704 if ((Flags & 7) != 4 /*MEM*/) {
5705 // Just skip over this operand, copying the operands verbatim.
5706 Ops.insert(Ops.end(), InOps.begin()+i, InOps.begin()+i+(Flags >> 3) + 1);
5707 i += (Flags >> 3) + 1;
5709 assert((Flags >> 3) == 1 && "Memory operand with multiple values?");
5710 // Otherwise, this is a memory operand. Ask the target to select it.
5711 std::vector<SDOperand> SelOps;
5712 if (SelectInlineAsmMemoryOperand(InOps[i+1], 'm', SelOps, DAG)) {
5713 cerr << "Could not match memory address. Inline asm failure!\n";
5717 // Add this to the output node.
5718 MVT IntPtrTy = DAG.getTargetLoweringInfo().getPointerTy();
5719 Ops.push_back(DAG.getTargetConstant(4/*MEM*/ | (SelOps.size() << 3),
5721 Ops.insert(Ops.end(), SelOps.begin(), SelOps.end());
5726 // Add the flag input back if present.
5727 if (e != InOps.size())
5728 Ops.push_back(InOps.back());
5731 char SelectionDAGISel::ID = 0;