1 //===-- SelectionDAGISel.cpp - Implement the SelectionDAGISel class -------===//
3 // The LLVM Compiler Infrastructure
5 // This file was developed by the LLVM research group and is distributed under
6 // the University of Illinois Open Source License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This implements the SelectionDAGISel class.
12 //===----------------------------------------------------------------------===//
14 #define DEBUG_TYPE "isel"
15 #include "llvm/CodeGen/SelectionDAGISel.h"
16 #include "llvm/CodeGen/ScheduleDAG.h"
17 #include "llvm/CallingConv.h"
18 #include "llvm/Constants.h"
19 #include "llvm/DerivedTypes.h"
20 #include "llvm/Function.h"
21 #include "llvm/GlobalVariable.h"
22 #include "llvm/InlineAsm.h"
23 #include "llvm/Instructions.h"
24 #include "llvm/Intrinsics.h"
25 #include "llvm/IntrinsicInst.h"
26 #include "llvm/CodeGen/IntrinsicLowering.h"
27 #include "llvm/CodeGen/MachineDebugInfo.h"
28 #include "llvm/CodeGen/MachineFunction.h"
29 #include "llvm/CodeGen/MachineFrameInfo.h"
30 #include "llvm/CodeGen/MachineJumpTableInfo.h"
31 #include "llvm/CodeGen/MachineInstrBuilder.h"
32 #include "llvm/CodeGen/SelectionDAG.h"
33 #include "llvm/CodeGen/SSARegMap.h"
34 #include "llvm/Target/MRegisterInfo.h"
35 #include "llvm/Target/TargetData.h"
36 #include "llvm/Target/TargetFrameInfo.h"
37 #include "llvm/Target/TargetInstrInfo.h"
38 #include "llvm/Target/TargetLowering.h"
39 #include "llvm/Target/TargetMachine.h"
40 #include "llvm/Target/TargetOptions.h"
41 #include "llvm/Transforms/Utils/BasicBlockUtils.h"
42 #include "llvm/Support/CommandLine.h"
43 #include "llvm/Support/MathExtras.h"
44 #include "llvm/Support/Debug.h"
53 ViewISelDAGs("view-isel-dags", cl::Hidden,
54 cl::desc("Pop up a window to show isel dags as they are selected"));
56 ViewSchedDAGs("view-sched-dags", cl::Hidden,
57 cl::desc("Pop up a window to show sched dags as they are processed"));
59 static const bool ViewISelDAGs = 0, ViewSchedDAGs = 0;
62 // Scheduling heuristics
63 enum SchedHeuristics {
64 defaultScheduling, // Let the target specify its preference.
65 noScheduling, // No scheduling, emit breadth first sequence.
66 simpleScheduling, // Two pass, min. critical path, max. utilization.
67 simpleNoItinScheduling, // Same as above exact using generic latency.
68 listSchedulingBURR, // Bottom-up reg reduction list scheduling.
69 listSchedulingTDRR, // Top-down reg reduction list scheduling.
70 listSchedulingTD // Top-down list scheduler.
74 cl::opt<SchedHeuristics>
77 cl::desc("Choose scheduling style"),
78 cl::init(defaultScheduling),
80 clEnumValN(defaultScheduling, "default",
81 "Target preferred scheduling style"),
82 clEnumValN(noScheduling, "none",
83 "No scheduling: breadth first sequencing"),
84 clEnumValN(simpleScheduling, "simple",
85 "Simple two pass scheduling: minimize critical path "
86 "and maximize processor utilization"),
87 clEnumValN(simpleNoItinScheduling, "simple-noitin",
88 "Simple two pass scheduling: Same as simple "
89 "except using generic latency"),
90 clEnumValN(listSchedulingBURR, "list-burr",
91 "Bottom-up register reduction list scheduling"),
92 clEnumValN(listSchedulingTDRR, "list-tdrr",
93 "Top-down register reduction list scheduling"),
94 clEnumValN(listSchedulingTD, "list-td",
95 "Top-down list scheduler"),
100 /// RegsForValue - This struct represents the physical registers that a
101 /// particular value is assigned and the type information about the value.
102 /// This is needed because values can be promoted into larger registers and
103 /// expanded into multiple smaller registers than the value.
104 struct RegsForValue {
105 /// Regs - This list hold the register (for legal and promoted values)
106 /// or register set (for expanded values) that the value should be assigned
108 std::vector<unsigned> Regs;
110 /// RegVT - The value type of each register.
112 MVT::ValueType RegVT;
114 /// ValueVT - The value type of the LLVM value, which may be promoted from
115 /// RegVT or made from merging the two expanded parts.
116 MVT::ValueType ValueVT;
118 RegsForValue() : RegVT(MVT::Other), ValueVT(MVT::Other) {}
120 RegsForValue(unsigned Reg, MVT::ValueType regvt, MVT::ValueType valuevt)
121 : RegVT(regvt), ValueVT(valuevt) {
124 RegsForValue(const std::vector<unsigned> ®s,
125 MVT::ValueType regvt, MVT::ValueType valuevt)
126 : Regs(regs), RegVT(regvt), ValueVT(valuevt) {
129 /// getCopyFromRegs - Emit a series of CopyFromReg nodes that copies from
130 /// this value and returns the result as a ValueVT value. This uses
131 /// Chain/Flag as the input and updates them for the output Chain/Flag.
132 SDOperand getCopyFromRegs(SelectionDAG &DAG,
133 SDOperand &Chain, SDOperand &Flag) const;
135 /// getCopyToRegs - Emit a series of CopyToReg nodes that copies the
136 /// specified value into the registers specified by this object. This uses
137 /// Chain/Flag as the input and updates them for the output Chain/Flag.
138 void getCopyToRegs(SDOperand Val, SelectionDAG &DAG,
139 SDOperand &Chain, SDOperand &Flag) const;
141 /// AddInlineAsmOperands - Add this value to the specified inlineasm node
142 /// operand list. This adds the code marker and includes the number of
143 /// values added into it.
144 void AddInlineAsmOperands(unsigned Code, SelectionDAG &DAG,
145 std::vector<SDOperand> &Ops) const;
150 //===--------------------------------------------------------------------===//
151 /// FunctionLoweringInfo - This contains information that is global to a
152 /// function that is used when lowering a region of the function.
153 class FunctionLoweringInfo {
160 FunctionLoweringInfo(TargetLowering &TLI, Function &Fn,MachineFunction &MF);
162 /// MBBMap - A mapping from LLVM basic blocks to their machine code entry.
163 std::map<const BasicBlock*, MachineBasicBlock *> MBBMap;
165 /// ValueMap - Since we emit code for the function a basic block at a time,
166 /// we must remember which virtual registers hold the values for
167 /// cross-basic-block values.
168 std::map<const Value*, unsigned> ValueMap;
170 /// StaticAllocaMap - Keep track of frame indices for fixed sized allocas in
171 /// the entry block. This allows the allocas to be efficiently referenced
172 /// anywhere in the function.
173 std::map<const AllocaInst*, int> StaticAllocaMap;
175 unsigned MakeReg(MVT::ValueType VT) {
176 return RegMap->createVirtualRegister(TLI.getRegClassFor(VT));
179 unsigned CreateRegForValue(const Value *V);
181 unsigned InitializeRegForValue(const Value *V) {
182 unsigned &R = ValueMap[V];
183 assert(R == 0 && "Already initialized this value register!");
184 return R = CreateRegForValue(V);
189 /// isUsedOutsideOfDefiningBlock - Return true if this instruction is used by
190 /// PHI nodes or outside of the basic block that defines it, or used by a
191 /// switch instruction, which may expand to multiple basic blocks.
192 static bool isUsedOutsideOfDefiningBlock(Instruction *I) {
193 if (isa<PHINode>(I)) return true;
194 BasicBlock *BB = I->getParent();
195 for (Value::use_iterator UI = I->use_begin(), E = I->use_end(); UI != E; ++UI)
196 if (cast<Instruction>(*UI)->getParent() != BB || isa<PHINode>(*UI) ||
197 isa<SwitchInst>(*UI))
202 /// isOnlyUsedInEntryBlock - If the specified argument is only used in the
203 /// entry block, return true. This includes arguments used by switches, since
204 /// the switch may expand into multiple basic blocks.
205 static bool isOnlyUsedInEntryBlock(Argument *A) {
206 BasicBlock *Entry = A->getParent()->begin();
207 for (Value::use_iterator UI = A->use_begin(), E = A->use_end(); UI != E; ++UI)
208 if (cast<Instruction>(*UI)->getParent() != Entry || isa<SwitchInst>(*UI))
209 return false; // Use not in entry block.
213 FunctionLoweringInfo::FunctionLoweringInfo(TargetLowering &tli,
214 Function &fn, MachineFunction &mf)
215 : TLI(tli), Fn(fn), MF(mf), RegMap(MF.getSSARegMap()) {
217 // Create a vreg for each argument register that is not dead and is used
218 // outside of the entry block for the function.
219 for (Function::arg_iterator AI = Fn.arg_begin(), E = Fn.arg_end();
221 if (!isOnlyUsedInEntryBlock(AI))
222 InitializeRegForValue(AI);
224 // Initialize the mapping of values to registers. This is only set up for
225 // instruction values that are used outside of the block that defines
227 Function::iterator BB = Fn.begin(), EB = Fn.end();
228 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I)
229 if (AllocaInst *AI = dyn_cast<AllocaInst>(I))
230 if (ConstantUInt *CUI = dyn_cast<ConstantUInt>(AI->getArraySize())) {
231 const Type *Ty = AI->getAllocatedType();
232 uint64_t TySize = TLI.getTargetData()->getTypeSize(Ty);
234 std::max((unsigned)TLI.getTargetData()->getTypeAlignment(Ty),
237 // If the alignment of the value is smaller than the size of the value,
238 // and if the size of the value is particularly small (<= 8 bytes),
239 // round up to the size of the value for potentially better performance.
241 // FIXME: This could be made better with a preferred alignment hook in
242 // TargetData. It serves primarily to 8-byte align doubles for X86.
243 if (Align < TySize && TySize <= 8) Align = TySize;
244 TySize *= CUI->getValue(); // Get total allocated size.
245 if (TySize == 0) TySize = 1; // Don't create zero-sized stack objects.
246 StaticAllocaMap[AI] =
247 MF.getFrameInfo()->CreateStackObject((unsigned)TySize, Align);
250 for (; BB != EB; ++BB)
251 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I)
252 if (!I->use_empty() && isUsedOutsideOfDefiningBlock(I))
253 if (!isa<AllocaInst>(I) ||
254 !StaticAllocaMap.count(cast<AllocaInst>(I)))
255 InitializeRegForValue(I);
257 // Create an initial MachineBasicBlock for each LLVM BasicBlock in F. This
258 // also creates the initial PHI MachineInstrs, though none of the input
259 // operands are populated.
260 for (BB = Fn.begin(), EB = Fn.end(); BB != EB; ++BB) {
261 MachineBasicBlock *MBB = new MachineBasicBlock(BB);
263 MF.getBasicBlockList().push_back(MBB);
265 // Create Machine PHI nodes for LLVM PHI nodes, lowering them as
268 for (BasicBlock::iterator I = BB->begin();
269 (PN = dyn_cast<PHINode>(I)); ++I)
270 if (!PN->use_empty()) {
271 MVT::ValueType VT = TLI.getValueType(PN->getType());
272 unsigned NumElements;
273 if (VT != MVT::Vector)
274 NumElements = TLI.getNumElements(VT);
276 MVT::ValueType VT1,VT2;
278 TLI.getPackedTypeBreakdown(cast<PackedType>(PN->getType()),
281 unsigned PHIReg = ValueMap[PN];
282 assert(PHIReg &&"PHI node does not have an assigned virtual register!");
283 for (unsigned i = 0; i != NumElements; ++i)
284 BuildMI(MBB, TargetInstrInfo::PHI, PN->getNumOperands(), PHIReg+i);
289 /// CreateRegForValue - Allocate the appropriate number of virtual registers of
290 /// the correctly promoted or expanded types. Assign these registers
291 /// consecutive vreg numbers and return the first assigned number.
292 unsigned FunctionLoweringInfo::CreateRegForValue(const Value *V) {
293 MVT::ValueType VT = TLI.getValueType(V->getType());
295 // The number of multiples of registers that we need, to, e.g., split up
296 // a <2 x int64> -> 4 x i32 registers.
297 unsigned NumVectorRegs = 1;
299 // If this is a packed type, figure out what type it will decompose into
300 // and how many of the elements it will use.
301 if (VT == MVT::Vector) {
302 const PackedType *PTy = cast<PackedType>(V->getType());
303 unsigned NumElts = PTy->getNumElements();
304 MVT::ValueType EltTy = TLI.getValueType(PTy->getElementType());
306 // Divide the input until we get to a supported size. This will always
307 // end with a scalar if the target doesn't support vectors.
308 while (NumElts > 1 && !TLI.isTypeLegal(getVectorType(EltTy, NumElts))) {
315 VT = getVectorType(EltTy, NumElts);
318 // The common case is that we will only create one register for this
319 // value. If we have that case, create and return the virtual register.
320 unsigned NV = TLI.getNumElements(VT);
322 // If we are promoting this value, pick the next largest supported type.
323 MVT::ValueType PromotedType = TLI.getTypeToTransformTo(VT);
324 unsigned Reg = MakeReg(PromotedType);
325 // If this is a vector of supported or promoted types (e.g. 4 x i16),
326 // create all of the registers.
327 for (unsigned i = 1; i != NumVectorRegs; ++i)
328 MakeReg(PromotedType);
332 // If this value is represented with multiple target registers, make sure
333 // to create enough consecutive registers of the right (smaller) type.
334 unsigned NT = VT-1; // Find the type to use.
335 while (TLI.getNumElements((MVT::ValueType)NT) != 1)
338 unsigned R = MakeReg((MVT::ValueType)NT);
339 for (unsigned i = 1; i != NV*NumVectorRegs; ++i)
340 MakeReg((MVT::ValueType)NT);
344 //===----------------------------------------------------------------------===//
345 /// SelectionDAGLowering - This is the common target-independent lowering
346 /// implementation that is parameterized by a TargetLowering object.
347 /// Also, targets can overload any lowering method.
350 class SelectionDAGLowering {
351 MachineBasicBlock *CurMBB;
353 std::map<const Value*, SDOperand> NodeMap;
355 /// PendingLoads - Loads are not emitted to the program immediately. We bunch
356 /// them up and then emit token factor nodes when possible. This allows us to
357 /// get simple disambiguation between loads without worrying about alias
359 std::vector<SDOperand> PendingLoads;
361 /// Case - A pair of values to record the Value for a switch case, and the
362 /// case's target basic block.
363 typedef std::pair<Constant*, MachineBasicBlock*> Case;
364 typedef std::vector<Case>::iterator CaseItr;
365 typedef std::pair<CaseItr, CaseItr> CaseRange;
367 /// CaseRec - A struct with ctor used in lowering switches to a binary tree
368 /// of conditional branches.
370 CaseRec(MachineBasicBlock *bb, Constant *lt, Constant *ge, CaseRange r) :
371 CaseBB(bb), LT(lt), GE(ge), Range(r) {}
373 /// CaseBB - The MBB in which to emit the compare and branch
374 MachineBasicBlock *CaseBB;
375 /// LT, GE - If nonzero, we know the current case value must be less-than or
376 /// greater-than-or-equal-to these Constants.
379 /// Range - A pair of iterators representing the range of case values to be
380 /// processed at this point in the binary search tree.
384 /// The comparison function for sorting Case values.
386 bool operator () (const Case& C1, const Case& C2) {
387 if (const ConstantUInt* U1 = dyn_cast<const ConstantUInt>(C1.first))
388 return U1->getValue() < cast<const ConstantUInt>(C2.first)->getValue();
390 const ConstantSInt* S1 = dyn_cast<const ConstantSInt>(C1.first);
391 return S1->getValue() < cast<const ConstantSInt>(C2.first)->getValue();
396 // TLI - This is information that describes the available target features we
397 // need for lowering. This indicates when operations are unavailable,
398 // implemented with a libcall, etc.
401 const TargetData *TD;
403 /// SwitchCases - Vector of CaseBlock structures used to communicate
404 /// SwitchInst code generation information.
405 std::vector<SelectionDAGISel::CaseBlock> SwitchCases;
406 SelectionDAGISel::JumpTable JT;
408 /// FuncInfo - Information about the function as a whole.
410 FunctionLoweringInfo &FuncInfo;
412 SelectionDAGLowering(SelectionDAG &dag, TargetLowering &tli,
413 FunctionLoweringInfo &funcinfo)
414 : TLI(tli), DAG(dag), TD(DAG.getTarget().getTargetData()),
415 JT(0,0,0,0), FuncInfo(funcinfo) {
418 /// getRoot - Return the current virtual root of the Selection DAG.
420 SDOperand getRoot() {
421 if (PendingLoads.empty())
422 return DAG.getRoot();
424 if (PendingLoads.size() == 1) {
425 SDOperand Root = PendingLoads[0];
427 PendingLoads.clear();
431 // Otherwise, we have to make a token factor node.
432 SDOperand Root = DAG.getNode(ISD::TokenFactor, MVT::Other, PendingLoads);
433 PendingLoads.clear();
438 void visit(Instruction &I) { visit(I.getOpcode(), I); }
440 void visit(unsigned Opcode, User &I) {
442 default: assert(0 && "Unknown instruction type encountered!");
444 // Build the switch statement using the Instruction.def file.
445 #define HANDLE_INST(NUM, OPCODE, CLASS) \
446 case Instruction::OPCODE:return visit##OPCODE((CLASS&)I);
447 #include "llvm/Instruction.def"
451 void setCurrentBasicBlock(MachineBasicBlock *MBB) { CurMBB = MBB; }
453 SDOperand getLoadFrom(const Type *Ty, SDOperand Ptr,
454 SDOperand SrcValue, SDOperand Root,
457 SDOperand getIntPtrConstant(uint64_t Val) {
458 return DAG.getConstant(Val, TLI.getPointerTy());
461 SDOperand getValue(const Value *V);
463 const SDOperand &setValue(const Value *V, SDOperand NewN) {
464 SDOperand &N = NodeMap[V];
465 assert(N.Val == 0 && "Already set a value for this node!");
469 RegsForValue GetRegistersForValue(const std::string &ConstrCode,
471 bool OutReg, bool InReg,
472 std::set<unsigned> &OutputRegs,
473 std::set<unsigned> &InputRegs);
475 // Terminator instructions.
476 void visitRet(ReturnInst &I);
477 void visitBr(BranchInst &I);
478 void visitSwitch(SwitchInst &I);
479 void visitUnreachable(UnreachableInst &I) { /* noop */ }
481 // Helper for visitSwitch
482 void visitSwitchCase(SelectionDAGISel::CaseBlock &CB);
483 void visitJumpTable(SelectionDAGISel::JumpTable &JT);
485 // These all get lowered before this pass.
486 void visitInvoke(InvokeInst &I) { assert(0 && "TODO"); }
487 void visitUnwind(UnwindInst &I) { assert(0 && "TODO"); }
489 void visitBinary(User &I, unsigned IntOp, unsigned FPOp, unsigned VecOp);
490 void visitShift(User &I, unsigned Opcode);
491 void visitAdd(User &I) {
492 visitBinary(I, ISD::ADD, ISD::FADD, ISD::VADD);
494 void visitSub(User &I);
495 void visitMul(User &I) {
496 visitBinary(I, ISD::MUL, ISD::FMUL, ISD::VMUL);
498 void visitDiv(User &I) {
499 const Type *Ty = I.getType();
501 Ty->isSigned() ? ISD::SDIV : ISD::UDIV, ISD::FDIV,
502 Ty->isSigned() ? ISD::VSDIV : ISD::VUDIV);
504 void visitRem(User &I) {
505 const Type *Ty = I.getType();
506 visitBinary(I, Ty->isSigned() ? ISD::SREM : ISD::UREM, ISD::FREM, 0);
508 void visitAnd(User &I) { visitBinary(I, ISD::AND, 0, ISD::VAND); }
509 void visitOr (User &I) { visitBinary(I, ISD::OR, 0, ISD::VOR); }
510 void visitXor(User &I) { visitBinary(I, ISD::XOR, 0, ISD::VXOR); }
511 void visitShl(User &I) { visitShift(I, ISD::SHL); }
512 void visitShr(User &I) {
513 visitShift(I, I.getType()->isUnsigned() ? ISD::SRL : ISD::SRA);
516 void visitSetCC(User &I, ISD::CondCode SignedOpc, ISD::CondCode UnsignedOpc,
517 ISD::CondCode FPOpc);
518 void visitSetEQ(User &I) { visitSetCC(I, ISD::SETEQ, ISD::SETEQ,
520 void visitSetNE(User &I) { visitSetCC(I, ISD::SETNE, ISD::SETNE,
522 void visitSetLE(User &I) { visitSetCC(I, ISD::SETLE, ISD::SETULE,
524 void visitSetGE(User &I) { visitSetCC(I, ISD::SETGE, ISD::SETUGE,
526 void visitSetLT(User &I) { visitSetCC(I, ISD::SETLT, ISD::SETULT,
528 void visitSetGT(User &I) { visitSetCC(I, ISD::SETGT, ISD::SETUGT,
531 void visitExtractElement(User &I);
532 void visitInsertElement(User &I);
533 void visitShuffleVector(User &I);
535 void visitGetElementPtr(User &I);
536 void visitCast(User &I);
537 void visitSelect(User &I);
539 void visitMalloc(MallocInst &I);
540 void visitFree(FreeInst &I);
541 void visitAlloca(AllocaInst &I);
542 void visitLoad(LoadInst &I);
543 void visitStore(StoreInst &I);
544 void visitPHI(PHINode &I) { } // PHI nodes are handled specially.
545 void visitCall(CallInst &I);
546 void visitInlineAsm(CallInst &I);
547 const char *visitIntrinsicCall(CallInst &I, unsigned Intrinsic);
548 void visitTargetIntrinsic(CallInst &I, unsigned Intrinsic);
550 void visitVAStart(CallInst &I);
551 void visitVAArg(VAArgInst &I);
552 void visitVAEnd(CallInst &I);
553 void visitVACopy(CallInst &I);
554 void visitFrameReturnAddress(CallInst &I, bool isFrameAddress);
556 void visitMemIntrinsic(CallInst &I, unsigned Op);
558 void visitUserOp1(Instruction &I) {
559 assert(0 && "UserOp1 should not exist at instruction selection time!");
562 void visitUserOp2(Instruction &I) {
563 assert(0 && "UserOp2 should not exist at instruction selection time!");
567 } // end namespace llvm
569 SDOperand SelectionDAGLowering::getValue(const Value *V) {
570 SDOperand &N = NodeMap[V];
573 const Type *VTy = V->getType();
574 MVT::ValueType VT = TLI.getValueType(VTy);
575 if (Constant *C = const_cast<Constant*>(dyn_cast<Constant>(V))) {
576 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(C)) {
577 visit(CE->getOpcode(), *CE);
578 assert(N.Val && "visit didn't populate the ValueMap!");
580 } else if (GlobalValue *GV = dyn_cast<GlobalValue>(C)) {
581 return N = DAG.getGlobalAddress(GV, VT);
582 } else if (isa<ConstantPointerNull>(C)) {
583 return N = DAG.getConstant(0, TLI.getPointerTy());
584 } else if (isa<UndefValue>(C)) {
585 if (!isa<PackedType>(VTy))
586 return N = DAG.getNode(ISD::UNDEF, VT);
588 // Create a VBUILD_VECTOR of undef nodes.
589 const PackedType *PTy = cast<PackedType>(VTy);
590 unsigned NumElements = PTy->getNumElements();
591 MVT::ValueType PVT = TLI.getValueType(PTy->getElementType());
593 std::vector<SDOperand> Ops;
594 Ops.assign(NumElements, DAG.getNode(ISD::UNDEF, PVT));
596 // Create a VConstant node with generic Vector type.
597 Ops.push_back(DAG.getConstant(NumElements, MVT::i32));
598 Ops.push_back(DAG.getValueType(PVT));
599 return N = DAG.getNode(ISD::VBUILD_VECTOR, MVT::Vector, Ops);
600 } else if (ConstantFP *CFP = dyn_cast<ConstantFP>(C)) {
601 return N = DAG.getConstantFP(CFP->getValue(), VT);
602 } else if (const PackedType *PTy = dyn_cast<PackedType>(VTy)) {
603 unsigned NumElements = PTy->getNumElements();
604 MVT::ValueType PVT = TLI.getValueType(PTy->getElementType());
606 // Now that we know the number and type of the elements, push a
607 // Constant or ConstantFP node onto the ops list for each element of
608 // the packed constant.
609 std::vector<SDOperand> Ops;
610 if (ConstantPacked *CP = dyn_cast<ConstantPacked>(C)) {
611 for (unsigned i = 0; i != NumElements; ++i)
612 Ops.push_back(getValue(CP->getOperand(i)));
614 assert(isa<ConstantAggregateZero>(C) && "Unknown packed constant!");
616 if (MVT::isFloatingPoint(PVT))
617 Op = DAG.getConstantFP(0, PVT);
619 Op = DAG.getConstant(0, PVT);
620 Ops.assign(NumElements, Op);
623 // Create a VBUILD_VECTOR node with generic Vector type.
624 Ops.push_back(DAG.getConstant(NumElements, MVT::i32));
625 Ops.push_back(DAG.getValueType(PVT));
626 return N = DAG.getNode(ISD::VBUILD_VECTOR, MVT::Vector, Ops);
628 // Canonicalize all constant ints to be unsigned.
629 return N = DAG.getConstant(cast<ConstantIntegral>(C)->getRawValue(),VT);
633 if (const AllocaInst *AI = dyn_cast<AllocaInst>(V)) {
634 std::map<const AllocaInst*, int>::iterator SI =
635 FuncInfo.StaticAllocaMap.find(AI);
636 if (SI != FuncInfo.StaticAllocaMap.end())
637 return DAG.getFrameIndex(SI->second, TLI.getPointerTy());
640 std::map<const Value*, unsigned>::const_iterator VMI =
641 FuncInfo.ValueMap.find(V);
642 assert(VMI != FuncInfo.ValueMap.end() && "Value not in map!");
644 unsigned InReg = VMI->second;
646 // If this type is not legal, make it so now.
647 if (VT != MVT::Vector) {
648 MVT::ValueType DestVT = TLI.getTypeToTransformTo(VT);
650 N = DAG.getCopyFromReg(DAG.getEntryNode(), InReg, DestVT);
652 // Source must be expanded. This input value is actually coming from the
653 // register pair VMI->second and VMI->second+1.
654 N = DAG.getNode(ISD::BUILD_PAIR, VT, N,
655 DAG.getCopyFromReg(DAG.getEntryNode(), InReg+1, DestVT));
656 } else if (DestVT > VT) { // Promotion case
657 if (MVT::isFloatingPoint(VT))
658 N = DAG.getNode(ISD::FP_ROUND, VT, N);
660 N = DAG.getNode(ISD::TRUNCATE, VT, N);
663 // Otherwise, if this is a vector, make it available as a generic vector
665 MVT::ValueType PTyElementVT, PTyLegalElementVT;
666 const PackedType *PTy = cast<PackedType>(VTy);
667 unsigned NE = TLI.getPackedTypeBreakdown(PTy, PTyElementVT,
670 // Build a VBUILD_VECTOR with the input registers.
671 std::vector<SDOperand> Ops;
672 if (PTyElementVT == PTyLegalElementVT) {
673 // If the value types are legal, just VBUILD the CopyFromReg nodes.
674 for (unsigned i = 0; i != NE; ++i)
675 Ops.push_back(DAG.getCopyFromReg(DAG.getEntryNode(), InReg++,
677 } else if (PTyElementVT < PTyLegalElementVT) {
678 // If the register was promoted, use TRUNCATE of FP_ROUND as appropriate.
679 for (unsigned i = 0; i != NE; ++i) {
680 SDOperand Op = DAG.getCopyFromReg(DAG.getEntryNode(), InReg++,
682 if (MVT::isFloatingPoint(PTyElementVT))
683 Op = DAG.getNode(ISD::FP_ROUND, PTyElementVT, Op);
685 Op = DAG.getNode(ISD::TRUNCATE, PTyElementVT, Op);
689 // If the register was expanded, use BUILD_PAIR.
690 assert((NE & 1) == 0 && "Must expand into a multiple of 2 elements!");
691 for (unsigned i = 0; i != NE/2; ++i) {
692 SDOperand Op0 = DAG.getCopyFromReg(DAG.getEntryNode(), InReg++,
694 SDOperand Op1 = DAG.getCopyFromReg(DAG.getEntryNode(), InReg++,
696 Ops.push_back(DAG.getNode(ISD::BUILD_PAIR, VT, Op0, Op1));
700 Ops.push_back(DAG.getConstant(NE, MVT::i32));
701 Ops.push_back(DAG.getValueType(PTyLegalElementVT));
702 N = DAG.getNode(ISD::VBUILD_VECTOR, MVT::Vector, Ops);
704 // Finally, use a VBIT_CONVERT to make this available as the appropriate
706 N = DAG.getNode(ISD::VBIT_CONVERT, MVT::Vector, N,
707 DAG.getConstant(PTy->getNumElements(),
709 DAG.getValueType(TLI.getValueType(PTy->getElementType())));
716 void SelectionDAGLowering::visitRet(ReturnInst &I) {
717 if (I.getNumOperands() == 0) {
718 DAG.setRoot(DAG.getNode(ISD::RET, MVT::Other, getRoot()));
721 std::vector<SDOperand> NewValues;
722 NewValues.push_back(getRoot());
723 for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i) {
724 SDOperand RetOp = getValue(I.getOperand(i));
726 // If this is an integer return value, we need to promote it ourselves to
727 // the full width of a register, since LegalizeOp will use ANY_EXTEND rather
729 if (MVT::isInteger(RetOp.getValueType()) &&
730 RetOp.getValueType() < MVT::i64) {
731 MVT::ValueType TmpVT;
732 if (TLI.getTypeAction(MVT::i32) == TargetLowering::Promote)
733 TmpVT = TLI.getTypeToTransformTo(MVT::i32);
737 if (I.getOperand(i)->getType()->isSigned())
738 RetOp = DAG.getNode(ISD::SIGN_EXTEND, TmpVT, RetOp);
740 RetOp = DAG.getNode(ISD::ZERO_EXTEND, TmpVT, RetOp);
742 NewValues.push_back(RetOp);
744 DAG.setRoot(DAG.getNode(ISD::RET, MVT::Other, NewValues));
747 void SelectionDAGLowering::visitBr(BranchInst &I) {
748 // Update machine-CFG edges.
749 MachineBasicBlock *Succ0MBB = FuncInfo.MBBMap[I.getSuccessor(0)];
750 CurMBB->addSuccessor(Succ0MBB);
752 // Figure out which block is immediately after the current one.
753 MachineBasicBlock *NextBlock = 0;
754 MachineFunction::iterator BBI = CurMBB;
755 if (++BBI != CurMBB->getParent()->end())
758 if (I.isUnconditional()) {
759 // If this is not a fall-through branch, emit the branch.
760 if (Succ0MBB != NextBlock)
761 DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, getRoot(),
762 DAG.getBasicBlock(Succ0MBB)));
764 MachineBasicBlock *Succ1MBB = FuncInfo.MBBMap[I.getSuccessor(1)];
765 CurMBB->addSuccessor(Succ1MBB);
767 SDOperand Cond = getValue(I.getCondition());
768 if (Succ1MBB == NextBlock) {
769 // If the condition is false, fall through. This means we should branch
770 // if the condition is true to Succ #0.
771 DAG.setRoot(DAG.getNode(ISD::BRCOND, MVT::Other, getRoot(),
772 Cond, DAG.getBasicBlock(Succ0MBB)));
773 } else if (Succ0MBB == NextBlock) {
774 // If the condition is true, fall through. This means we should branch if
775 // the condition is false to Succ #1. Invert the condition first.
776 SDOperand True = DAG.getConstant(1, Cond.getValueType());
777 Cond = DAG.getNode(ISD::XOR, Cond.getValueType(), Cond, True);
778 DAG.setRoot(DAG.getNode(ISD::BRCOND, MVT::Other, getRoot(),
779 Cond, DAG.getBasicBlock(Succ1MBB)));
781 std::vector<SDOperand> Ops;
782 Ops.push_back(getRoot());
783 // If the false case is the current basic block, then this is a self
784 // loop. We do not want to emit "Loop: ... brcond Out; br Loop", as it
785 // adds an extra instruction in the loop. Instead, invert the
786 // condition and emit "Loop: ... br!cond Loop; br Out.
787 if (CurMBB == Succ1MBB) {
788 std::swap(Succ0MBB, Succ1MBB);
789 SDOperand True = DAG.getConstant(1, Cond.getValueType());
790 Cond = DAG.getNode(ISD::XOR, Cond.getValueType(), Cond, True);
792 SDOperand True = DAG.getNode(ISD::BRCOND, MVT::Other, getRoot(), Cond,
793 DAG.getBasicBlock(Succ0MBB));
794 DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, True,
795 DAG.getBasicBlock(Succ1MBB)));
800 /// visitSwitchCase - Emits the necessary code to represent a single node in
801 /// the binary search tree resulting from lowering a switch instruction.
802 void SelectionDAGLowering::visitSwitchCase(SelectionDAGISel::CaseBlock &CB) {
803 SDOperand SwitchOp = getValue(CB.SwitchV);
804 SDOperand CaseOp = getValue(CB.CaseC);
805 SDOperand Cond = DAG.getSetCC(MVT::i1, SwitchOp, CaseOp, CB.CC);
807 // Set NextBlock to be the MBB immediately after the current one, if any.
808 // This is used to avoid emitting unnecessary branches to the next block.
809 MachineBasicBlock *NextBlock = 0;
810 MachineFunction::iterator BBI = CurMBB;
811 if (++BBI != CurMBB->getParent()->end())
814 // If the lhs block is the next block, invert the condition so that we can
815 // fall through to the lhs instead of the rhs block.
816 if (CB.LHSBB == NextBlock) {
817 std::swap(CB.LHSBB, CB.RHSBB);
818 SDOperand True = DAG.getConstant(1, Cond.getValueType());
819 Cond = DAG.getNode(ISD::XOR, Cond.getValueType(), Cond, True);
821 SDOperand BrCond = DAG.getNode(ISD::BRCOND, MVT::Other, getRoot(), Cond,
822 DAG.getBasicBlock(CB.LHSBB));
823 if (CB.RHSBB == NextBlock)
826 DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, BrCond,
827 DAG.getBasicBlock(CB.RHSBB)));
828 // Update successor info
829 CurMBB->addSuccessor(CB.LHSBB);
830 CurMBB->addSuccessor(CB.RHSBB);
833 /// visitSwitchCase - Emits the necessary code to represent a single node in
834 /// the binary search tree resulting from lowering a switch instruction.
835 void SelectionDAGLowering::visitJumpTable(SelectionDAGISel::JumpTable &JT) {
836 // FIXME: Need to emit different code for PIC vs. Non-PIC, specifically,
837 // we need to add the address of the jump table to the value loaded, since
838 // the entries in the jump table will be differences rather than absolute
841 // Emit the code for the jump table
842 MVT::ValueType PTy = TLI.getPointerTy();
843 unsigned PTyBytes = MVT::getSizeInBits(PTy)/8;
844 SDOperand Copy = DAG.getCopyFromReg(getRoot(), JT.Reg, PTy);
845 SDOperand IDX = DAG.getNode(ISD::MUL, PTy, Copy,
846 DAG.getConstant(PTyBytes, PTy));
847 SDOperand ADD = DAG.getNode(ISD::ADD, PTy, IDX, DAG.getJumpTable(JT.JTI,PTy));
848 SDOperand LD = DAG.getLoad(PTy, Copy.getValue(1), ADD, DAG.getSrcValue(0));
849 DAG.setRoot(DAG.getNode(ISD::BRIND, MVT::Other, LD.getValue(1), LD));
852 void SelectionDAGLowering::visitSwitch(SwitchInst &I) {
853 // Figure out which block is immediately after the current one.
854 MachineBasicBlock *NextBlock = 0;
855 MachineFunction::iterator BBI = CurMBB;
856 if (++BBI != CurMBB->getParent()->end())
859 // If there is only the default destination, branch to it if it is not the
860 // next basic block. Otherwise, just fall through.
861 if (I.getNumOperands() == 2) {
862 // Update machine-CFG edges.
863 MachineBasicBlock *DefaultMBB = FuncInfo.MBBMap[I.getDefaultDest()];
864 // If this is not a fall-through branch, emit the branch.
865 if (DefaultMBB != NextBlock)
866 DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, getRoot(),
867 DAG.getBasicBlock(DefaultMBB)));
871 // If there are any non-default case statements, create a vector of Cases
872 // representing each one, and sort the vector so that we can efficiently
873 // create a binary search tree from them.
874 std::vector<Case> Cases;
875 for (unsigned i = 1; i < I.getNumSuccessors(); ++i) {
876 MachineBasicBlock *SMBB = FuncInfo.MBBMap[I.getSuccessor(i)];
877 Cases.push_back(Case(I.getSuccessorValue(i), SMBB));
879 std::sort(Cases.begin(), Cases.end(), CaseCmp());
881 // Get the Value to be switched on and default basic blocks, which will be
882 // inserted into CaseBlock records, representing basic blocks in the binary
884 Value *SV = I.getOperand(0);
885 MachineBasicBlock *Default = FuncInfo.MBBMap[I.getDefaultDest()];
887 // Get the MachineFunction which holds the current MBB. This is used during
888 // emission of jump tables, and when inserting any additional MBBs necessary
889 // to represent the switch.
890 MachineFunction *CurMF = CurMBB->getParent();
891 const BasicBlock *LLVMBB = CurMBB->getBasicBlock();
892 Reloc::Model Relocs = TLI.getTargetMachine().getRelocationModel();
894 // If the switch has more than 5 blocks, and at least 31.25% dense, and the
895 // target supports indirect branches, then emit a jump table rather than
896 // lowering the switch to a binary tree of conditional branches.
897 // FIXME: Make this work with PIC code
898 if (TLI.isOperationLegal(ISD::BRIND, TLI.getPointerTy()) &&
899 (Relocs == Reloc::Static || Relocs == Reloc::DynamicNoPIC) &&
901 uint64_t First = cast<ConstantIntegral>(Cases.front().first)->getRawValue();
902 uint64_t Last = cast<ConstantIntegral>(Cases.back().first)->getRawValue();
903 double Density = (double)Cases.size() / (double)((Last - First) + 1ULL);
905 if (Density >= 0.3125) {
906 // Create a new basic block to hold the code for loading the address
907 // of the jump table, and jumping to it. Update successor information;
908 // we will either branch to the default case for the switch, or the jump
910 MachineBasicBlock *JumpTableBB = new MachineBasicBlock(LLVMBB);
911 CurMF->getBasicBlockList().insert(BBI, JumpTableBB);
912 CurMBB->addSuccessor(Default);
913 CurMBB->addSuccessor(JumpTableBB);
915 // Subtract the lowest switch case value from the value being switched on
916 // and conditional branch to default mbb if the result is greater than the
917 // difference between smallest and largest cases.
918 SDOperand SwitchOp = getValue(SV);
919 MVT::ValueType VT = SwitchOp.getValueType();
920 SDOperand SUB = DAG.getNode(ISD::SUB, VT, SwitchOp,
921 DAG.getConstant(First, VT));
923 // The SDNode we just created, which holds the value being switched on
924 // minus the the smallest case value, needs to be copied to a virtual
925 // register so it can be used as an index into the jump table in a
926 // subsequent basic block. This value may be smaller or larger than the
927 // target's pointer type, and therefore require extension or truncating.
928 if (VT > TLI.getPointerTy())
929 SwitchOp = DAG.getNode(ISD::TRUNCATE, TLI.getPointerTy(), SUB);
931 SwitchOp = DAG.getNode(ISD::ZERO_EXTEND, TLI.getPointerTy(), SUB);
932 unsigned JumpTableReg = FuncInfo.MakeReg(TLI.getPointerTy());
933 SDOperand CopyTo = DAG.getCopyToReg(getRoot(), JumpTableReg, SwitchOp);
935 // Emit the range check for the jump table, and branch to the default
936 // block for the switch statement if the value being switched on exceeds
937 // the largest case in the switch.
938 SDOperand CMP = DAG.getSetCC(TLI.getSetCCResultTy(), SUB,
939 DAG.getConstant(Last-First,VT), ISD::SETUGT);
940 DAG.setRoot(DAG.getNode(ISD::BRCOND, MVT::Other, CopyTo, CMP,
941 DAG.getBasicBlock(Default)));
943 // Build a vector of destination BBs, corresponding to each target
944 // of the jump table. If the value of the jump table slot corresponds to
945 // a case statement, push the case's BB onto the vector, otherwise, push
947 std::set<MachineBasicBlock*> UniqueBBs;
948 std::vector<MachineBasicBlock*> DestBBs;
949 uint64_t TEI = First;
950 for (CaseItr ii = Cases.begin(), ee = Cases.end(); ii != ee; ++TEI) {
951 if (cast<ConstantIntegral>(ii->first)->getRawValue() == TEI) {
952 DestBBs.push_back(ii->second);
953 UniqueBBs.insert(ii->second);
956 DestBBs.push_back(Default);
957 UniqueBBs.insert(Default);
961 // Update successor info
962 for (std::set<MachineBasicBlock*>::iterator ii = UniqueBBs.begin(),
963 ee = UniqueBBs.end(); ii != ee; ++ii)
964 JumpTableBB->addSuccessor(*ii);
966 // Create a jump table index for this jump table, or return an existing
968 unsigned JTI = CurMF->getJumpTableInfo()->getJumpTableIndex(DestBBs);
970 // Set the jump table information so that we can codegen it as a second
972 JT.Reg = JumpTableReg;
974 JT.MBB = JumpTableBB;
975 JT.Default = Default;
980 // Push the initial CaseRec onto the worklist
981 std::vector<CaseRec> CaseVec;
982 CaseVec.push_back(CaseRec(CurMBB,0,0,CaseRange(Cases.begin(),Cases.end())));
984 while (!CaseVec.empty()) {
985 // Grab a record representing a case range to process off the worklist
986 CaseRec CR = CaseVec.back();
989 // Size is the number of Cases represented by this range. If Size is 1,
990 // then we are processing a leaf of the binary search tree. Otherwise,
991 // we need to pick a pivot, and push left and right ranges onto the
993 unsigned Size = CR.Range.second - CR.Range.first;
996 // Create a CaseBlock record representing a conditional branch to
997 // the Case's target mbb if the value being switched on SV is equal
998 // to C. Otherwise, branch to default.
999 Constant *C = CR.Range.first->first;
1000 MachineBasicBlock *Target = CR.Range.first->second;
1001 SelectionDAGISel::CaseBlock CB(ISD::SETEQ, SV, C, Target, Default,
1003 // If the MBB representing the leaf node is the current MBB, then just
1004 // call visitSwitchCase to emit the code into the current block.
1005 // Otherwise, push the CaseBlock onto the vector to be later processed
1006 // by SDISel, and insert the node's MBB before the next MBB.
1007 if (CR.CaseBB == CurMBB)
1008 visitSwitchCase(CB);
1010 SwitchCases.push_back(CB);
1011 CurMF->getBasicBlockList().insert(BBI, CR.CaseBB);
1014 // split case range at pivot
1015 CaseItr Pivot = CR.Range.first + (Size / 2);
1016 CaseRange LHSR(CR.Range.first, Pivot);
1017 CaseRange RHSR(Pivot, CR.Range.second);
1018 Constant *C = Pivot->first;
1019 MachineBasicBlock *RHSBB = 0, *LHSBB = 0;
1020 // We know that we branch to the LHS if the Value being switched on is
1021 // less than the Pivot value, C. We use this to optimize our binary
1022 // tree a bit, by recognizing that if SV is greater than or equal to the
1023 // LHS's Case Value, and that Case Value is exactly one less than the
1024 // Pivot's Value, then we can branch directly to the LHS's Target,
1025 // rather than creating a leaf node for it.
1026 if ((LHSR.second - LHSR.first) == 1 &&
1027 LHSR.first->first == CR.GE &&
1028 cast<ConstantIntegral>(C)->getRawValue() ==
1029 (cast<ConstantIntegral>(CR.GE)->getRawValue() + 1ULL)) {
1030 LHSBB = LHSR.first->second;
1032 LHSBB = new MachineBasicBlock(LLVMBB);
1033 CaseVec.push_back(CaseRec(LHSBB,C,CR.GE,LHSR));
1035 // Similar to the optimization above, if the Value being switched on is
1036 // known to be less than the Constant CR.LT, and the current Case Value
1037 // is CR.LT - 1, then we can branch directly to the target block for
1038 // the current Case Value, rather than emitting a RHS leaf node for it.
1039 if ((RHSR.second - RHSR.first) == 1 && CR.LT &&
1040 cast<ConstantIntegral>(RHSR.first->first)->getRawValue() ==
1041 (cast<ConstantIntegral>(CR.LT)->getRawValue() - 1ULL)) {
1042 RHSBB = RHSR.first->second;
1044 RHSBB = new MachineBasicBlock(LLVMBB);
1045 CaseVec.push_back(CaseRec(RHSBB,CR.LT,C,RHSR));
1047 // Create a CaseBlock record representing a conditional branch to
1048 // the LHS node if the value being switched on SV is less than C.
1049 // Otherwise, branch to LHS.
1050 ISD::CondCode CC = C->getType()->isSigned() ? ISD::SETLT : ISD::SETULT;
1051 SelectionDAGISel::CaseBlock CB(CC, SV, C, LHSBB, RHSBB, CR.CaseBB);
1052 if (CR.CaseBB == CurMBB)
1053 visitSwitchCase(CB);
1055 SwitchCases.push_back(CB);
1056 CurMF->getBasicBlockList().insert(BBI, CR.CaseBB);
1062 void SelectionDAGLowering::visitSub(User &I) {
1063 // -0.0 - X --> fneg
1064 if (I.getType()->isFloatingPoint()) {
1065 if (ConstantFP *CFP = dyn_cast<ConstantFP>(I.getOperand(0)))
1066 if (CFP->isExactlyValue(-0.0)) {
1067 SDOperand Op2 = getValue(I.getOperand(1));
1068 setValue(&I, DAG.getNode(ISD::FNEG, Op2.getValueType(), Op2));
1072 visitBinary(I, ISD::SUB, ISD::FSUB, ISD::VSUB);
1075 void SelectionDAGLowering::visitBinary(User &I, unsigned IntOp, unsigned FPOp,
1077 const Type *Ty = I.getType();
1078 SDOperand Op1 = getValue(I.getOperand(0));
1079 SDOperand Op2 = getValue(I.getOperand(1));
1081 if (Ty->isIntegral()) {
1082 setValue(&I, DAG.getNode(IntOp, Op1.getValueType(), Op1, Op2));
1083 } else if (Ty->isFloatingPoint()) {
1084 setValue(&I, DAG.getNode(FPOp, Op1.getValueType(), Op1, Op2));
1086 const PackedType *PTy = cast<PackedType>(Ty);
1087 SDOperand Num = DAG.getConstant(PTy->getNumElements(), MVT::i32);
1088 SDOperand Typ = DAG.getValueType(TLI.getValueType(PTy->getElementType()));
1089 setValue(&I, DAG.getNode(VecOp, MVT::Vector, Op1, Op2, Num, Typ));
1093 void SelectionDAGLowering::visitShift(User &I, unsigned Opcode) {
1094 SDOperand Op1 = getValue(I.getOperand(0));
1095 SDOperand Op2 = getValue(I.getOperand(1));
1097 Op2 = DAG.getNode(ISD::ANY_EXTEND, TLI.getShiftAmountTy(), Op2);
1099 setValue(&I, DAG.getNode(Opcode, Op1.getValueType(), Op1, Op2));
1102 void SelectionDAGLowering::visitSetCC(User &I,ISD::CondCode SignedOpcode,
1103 ISD::CondCode UnsignedOpcode,
1104 ISD::CondCode FPOpcode) {
1105 SDOperand Op1 = getValue(I.getOperand(0));
1106 SDOperand Op2 = getValue(I.getOperand(1));
1107 ISD::CondCode Opcode = SignedOpcode;
1108 if ((!UnsafeFPMath && !FiniteOnlyFPMath) &&
1109 I.getOperand(0)->getType()->isFloatingPoint())
1111 else if (I.getOperand(0)->getType()->isUnsigned())
1112 Opcode = UnsignedOpcode;
1113 setValue(&I, DAG.getSetCC(MVT::i1, Op1, Op2, Opcode));
1116 void SelectionDAGLowering::visitSelect(User &I) {
1117 SDOperand Cond = getValue(I.getOperand(0));
1118 SDOperand TrueVal = getValue(I.getOperand(1));
1119 SDOperand FalseVal = getValue(I.getOperand(2));
1120 if (!isa<PackedType>(I.getType())) {
1121 setValue(&I, DAG.getNode(ISD::SELECT, TrueVal.getValueType(), Cond,
1122 TrueVal, FalseVal));
1124 setValue(&I, DAG.getNode(ISD::VSELECT, MVT::Vector, Cond, TrueVal, FalseVal,
1125 *(TrueVal.Val->op_end()-2),
1126 *(TrueVal.Val->op_end()-1)));
1130 void SelectionDAGLowering::visitCast(User &I) {
1131 SDOperand N = getValue(I.getOperand(0));
1132 MVT::ValueType SrcVT = N.getValueType();
1133 MVT::ValueType DestVT = TLI.getValueType(I.getType());
1135 if (DestVT == MVT::Vector) {
1136 // This is a cast to a vector from something else. This is always a bit
1137 // convert. Get information about the input vector.
1138 const PackedType *DestTy = cast<PackedType>(I.getType());
1139 MVT::ValueType EltVT = TLI.getValueType(DestTy->getElementType());
1140 setValue(&I, DAG.getNode(ISD::VBIT_CONVERT, DestVT, N,
1141 DAG.getConstant(DestTy->getNumElements(),MVT::i32),
1142 DAG.getValueType(EltVT)));
1143 } else if (SrcVT == DestVT) {
1144 setValue(&I, N); // noop cast.
1145 } else if (DestVT == MVT::i1) {
1146 // Cast to bool is a comparison against zero, not truncation to zero.
1147 SDOperand Zero = isInteger(SrcVT) ? DAG.getConstant(0, N.getValueType()) :
1148 DAG.getConstantFP(0.0, N.getValueType());
1149 setValue(&I, DAG.getSetCC(MVT::i1, N, Zero, ISD::SETNE));
1150 } else if (isInteger(SrcVT)) {
1151 if (isInteger(DestVT)) { // Int -> Int cast
1152 if (DestVT < SrcVT) // Truncating cast?
1153 setValue(&I, DAG.getNode(ISD::TRUNCATE, DestVT, N));
1154 else if (I.getOperand(0)->getType()->isSigned())
1155 setValue(&I, DAG.getNode(ISD::SIGN_EXTEND, DestVT, N));
1157 setValue(&I, DAG.getNode(ISD::ZERO_EXTEND, DestVT, N));
1158 } else if (isFloatingPoint(DestVT)) { // Int -> FP cast
1159 if (I.getOperand(0)->getType()->isSigned())
1160 setValue(&I, DAG.getNode(ISD::SINT_TO_FP, DestVT, N));
1162 setValue(&I, DAG.getNode(ISD::UINT_TO_FP, DestVT, N));
1164 assert(0 && "Unknown cast!");
1166 } else if (isFloatingPoint(SrcVT)) {
1167 if (isFloatingPoint(DestVT)) { // FP -> FP cast
1168 if (DestVT < SrcVT) // Rounding cast?
1169 setValue(&I, DAG.getNode(ISD::FP_ROUND, DestVT, N));
1171 setValue(&I, DAG.getNode(ISD::FP_EXTEND, DestVT, N));
1172 } else if (isInteger(DestVT)) { // FP -> Int cast.
1173 if (I.getType()->isSigned())
1174 setValue(&I, DAG.getNode(ISD::FP_TO_SINT, DestVT, N));
1176 setValue(&I, DAG.getNode(ISD::FP_TO_UINT, DestVT, N));
1178 assert(0 && "Unknown cast!");
1181 assert(SrcVT == MVT::Vector && "Unknown cast!");
1182 assert(DestVT != MVT::Vector && "Casts to vector already handled!");
1183 // This is a cast from a vector to something else. This is always a bit
1184 // convert. Get information about the input vector.
1185 setValue(&I, DAG.getNode(ISD::VBIT_CONVERT, DestVT, N));
1189 void SelectionDAGLowering::visitInsertElement(User &I) {
1190 SDOperand InVec = getValue(I.getOperand(0));
1191 SDOperand InVal = getValue(I.getOperand(1));
1192 SDOperand InIdx = DAG.getNode(ISD::ZERO_EXTEND, TLI.getPointerTy(),
1193 getValue(I.getOperand(2)));
1195 SDOperand Num = *(InVec.Val->op_end()-2);
1196 SDOperand Typ = *(InVec.Val->op_end()-1);
1197 setValue(&I, DAG.getNode(ISD::VINSERT_VECTOR_ELT, MVT::Vector,
1198 InVec, InVal, InIdx, Num, Typ));
1201 void SelectionDAGLowering::visitExtractElement(User &I) {
1202 SDOperand InVec = getValue(I.getOperand(0));
1203 SDOperand InIdx = DAG.getNode(ISD::ZERO_EXTEND, TLI.getPointerTy(),
1204 getValue(I.getOperand(1)));
1205 SDOperand Typ = *(InVec.Val->op_end()-1);
1206 setValue(&I, DAG.getNode(ISD::VEXTRACT_VECTOR_ELT,
1207 TLI.getValueType(I.getType()), InVec, InIdx));
1210 void SelectionDAGLowering::visitShuffleVector(User &I) {
1211 SDOperand V1 = getValue(I.getOperand(0));
1212 SDOperand V2 = getValue(I.getOperand(1));
1213 SDOperand Mask = getValue(I.getOperand(2));
1215 SDOperand Num = *(V1.Val->op_end()-2);
1216 SDOperand Typ = *(V2.Val->op_end()-1);
1217 setValue(&I, DAG.getNode(ISD::VVECTOR_SHUFFLE, MVT::Vector,
1218 V1, V2, Mask, Num, Typ));
1222 void SelectionDAGLowering::visitGetElementPtr(User &I) {
1223 SDOperand N = getValue(I.getOperand(0));
1224 const Type *Ty = I.getOperand(0)->getType();
1226 for (GetElementPtrInst::op_iterator OI = I.op_begin()+1, E = I.op_end();
1229 if (const StructType *StTy = dyn_cast<StructType>(Ty)) {
1230 unsigned Field = cast<ConstantUInt>(Idx)->getValue();
1233 uint64_t Offset = TD->getStructLayout(StTy)->MemberOffsets[Field];
1234 N = DAG.getNode(ISD::ADD, N.getValueType(), N,
1235 getIntPtrConstant(Offset));
1237 Ty = StTy->getElementType(Field);
1239 Ty = cast<SequentialType>(Ty)->getElementType();
1241 // If this is a constant subscript, handle it quickly.
1242 if (ConstantInt *CI = dyn_cast<ConstantInt>(Idx)) {
1243 if (CI->getRawValue() == 0) continue;
1246 if (ConstantSInt *CSI = dyn_cast<ConstantSInt>(CI))
1247 Offs = (int64_t)TD->getTypeSize(Ty)*CSI->getValue();
1249 Offs = TD->getTypeSize(Ty)*cast<ConstantUInt>(CI)->getValue();
1250 N = DAG.getNode(ISD::ADD, N.getValueType(), N, getIntPtrConstant(Offs));
1254 // N = N + Idx * ElementSize;
1255 uint64_t ElementSize = TD->getTypeSize(Ty);
1256 SDOperand IdxN = getValue(Idx);
1258 // If the index is smaller or larger than intptr_t, truncate or extend
1260 if (IdxN.getValueType() < N.getValueType()) {
1261 if (Idx->getType()->isSigned())
1262 IdxN = DAG.getNode(ISD::SIGN_EXTEND, N.getValueType(), IdxN);
1264 IdxN = DAG.getNode(ISD::ZERO_EXTEND, N.getValueType(), IdxN);
1265 } else if (IdxN.getValueType() > N.getValueType())
1266 IdxN = DAG.getNode(ISD::TRUNCATE, N.getValueType(), IdxN);
1268 // If this is a multiply by a power of two, turn it into a shl
1269 // immediately. This is a very common case.
1270 if (isPowerOf2_64(ElementSize)) {
1271 unsigned Amt = Log2_64(ElementSize);
1272 IdxN = DAG.getNode(ISD::SHL, N.getValueType(), IdxN,
1273 DAG.getConstant(Amt, TLI.getShiftAmountTy()));
1274 N = DAG.getNode(ISD::ADD, N.getValueType(), N, IdxN);
1278 SDOperand Scale = getIntPtrConstant(ElementSize);
1279 IdxN = DAG.getNode(ISD::MUL, N.getValueType(), IdxN, Scale);
1280 N = DAG.getNode(ISD::ADD, N.getValueType(), N, IdxN);
1286 void SelectionDAGLowering::visitAlloca(AllocaInst &I) {
1287 // If this is a fixed sized alloca in the entry block of the function,
1288 // allocate it statically on the stack.
1289 if (FuncInfo.StaticAllocaMap.count(&I))
1290 return; // getValue will auto-populate this.
1292 const Type *Ty = I.getAllocatedType();
1293 uint64_t TySize = TLI.getTargetData()->getTypeSize(Ty);
1294 unsigned Align = std::max((unsigned)TLI.getTargetData()->getTypeAlignment(Ty),
1297 SDOperand AllocSize = getValue(I.getArraySize());
1298 MVT::ValueType IntPtr = TLI.getPointerTy();
1299 if (IntPtr < AllocSize.getValueType())
1300 AllocSize = DAG.getNode(ISD::TRUNCATE, IntPtr, AllocSize);
1301 else if (IntPtr > AllocSize.getValueType())
1302 AllocSize = DAG.getNode(ISD::ZERO_EXTEND, IntPtr, AllocSize);
1304 AllocSize = DAG.getNode(ISD::MUL, IntPtr, AllocSize,
1305 getIntPtrConstant(TySize));
1307 // Handle alignment. If the requested alignment is less than or equal to the
1308 // stack alignment, ignore it and round the size of the allocation up to the
1309 // stack alignment size. If the size is greater than the stack alignment, we
1310 // note this in the DYNAMIC_STACKALLOC node.
1311 unsigned StackAlign =
1312 TLI.getTargetMachine().getFrameInfo()->getStackAlignment();
1313 if (Align <= StackAlign) {
1315 // Add SA-1 to the size.
1316 AllocSize = DAG.getNode(ISD::ADD, AllocSize.getValueType(), AllocSize,
1317 getIntPtrConstant(StackAlign-1));
1318 // Mask out the low bits for alignment purposes.
1319 AllocSize = DAG.getNode(ISD::AND, AllocSize.getValueType(), AllocSize,
1320 getIntPtrConstant(~(uint64_t)(StackAlign-1)));
1323 std::vector<MVT::ValueType> VTs;
1324 VTs.push_back(AllocSize.getValueType());
1325 VTs.push_back(MVT::Other);
1326 std::vector<SDOperand> Ops;
1327 Ops.push_back(getRoot());
1328 Ops.push_back(AllocSize);
1329 Ops.push_back(getIntPtrConstant(Align));
1330 SDOperand DSA = DAG.getNode(ISD::DYNAMIC_STACKALLOC, VTs, Ops);
1331 DAG.setRoot(setValue(&I, DSA).getValue(1));
1333 // Inform the Frame Information that we have just allocated a variable-sized
1335 CurMBB->getParent()->getFrameInfo()->CreateVariableSizedObject();
1338 void SelectionDAGLowering::visitLoad(LoadInst &I) {
1339 SDOperand Ptr = getValue(I.getOperand(0));
1345 // Do not serialize non-volatile loads against each other.
1346 Root = DAG.getRoot();
1349 setValue(&I, getLoadFrom(I.getType(), Ptr, DAG.getSrcValue(I.getOperand(0)),
1350 Root, I.isVolatile()));
1353 SDOperand SelectionDAGLowering::getLoadFrom(const Type *Ty, SDOperand Ptr,
1354 SDOperand SrcValue, SDOperand Root,
1357 if (const PackedType *PTy = dyn_cast<PackedType>(Ty)) {
1358 MVT::ValueType PVT = TLI.getValueType(PTy->getElementType());
1359 L = DAG.getVecLoad(PTy->getNumElements(), PVT, Root, Ptr, SrcValue);
1361 L = DAG.getLoad(TLI.getValueType(Ty), Root, Ptr, SrcValue);
1365 DAG.setRoot(L.getValue(1));
1367 PendingLoads.push_back(L.getValue(1));
1373 void SelectionDAGLowering::visitStore(StoreInst &I) {
1374 Value *SrcV = I.getOperand(0);
1375 SDOperand Src = getValue(SrcV);
1376 SDOperand Ptr = getValue(I.getOperand(1));
1377 DAG.setRoot(DAG.getNode(ISD::STORE, MVT::Other, getRoot(), Src, Ptr,
1378 DAG.getSrcValue(I.getOperand(1))));
1381 /// IntrinsicCannotAccessMemory - Return true if the specified intrinsic cannot
1382 /// access memory and has no other side effects at all.
1383 static bool IntrinsicCannotAccessMemory(unsigned IntrinsicID) {
1384 #define GET_NO_MEMORY_INTRINSICS
1385 #include "llvm/Intrinsics.gen"
1386 #undef GET_NO_MEMORY_INTRINSICS
1390 // IntrinsicOnlyReadsMemory - Return true if the specified intrinsic doesn't
1391 // have any side-effects or if it only reads memory.
1392 static bool IntrinsicOnlyReadsMemory(unsigned IntrinsicID) {
1393 #define GET_SIDE_EFFECT_INFO
1394 #include "llvm/Intrinsics.gen"
1395 #undef GET_SIDE_EFFECT_INFO
1399 /// visitTargetIntrinsic - Lower a call of a target intrinsic to an INTRINSIC
1401 void SelectionDAGLowering::visitTargetIntrinsic(CallInst &I,
1402 unsigned Intrinsic) {
1403 bool HasChain = !IntrinsicCannotAccessMemory(Intrinsic);
1404 bool OnlyLoad = HasChain && IntrinsicOnlyReadsMemory(Intrinsic);
1406 // Build the operand list.
1407 std::vector<SDOperand> Ops;
1408 if (HasChain) { // If this intrinsic has side-effects, chainify it.
1410 // We don't need to serialize loads against other loads.
1411 Ops.push_back(DAG.getRoot());
1413 Ops.push_back(getRoot());
1417 // Add the intrinsic ID as an integer operand.
1418 Ops.push_back(DAG.getConstant(Intrinsic, TLI.getPointerTy()));
1420 // Add all operands of the call to the operand list.
1421 for (unsigned i = 1, e = I.getNumOperands(); i != e; ++i) {
1422 SDOperand Op = getValue(I.getOperand(i));
1424 // If this is a vector type, force it to the right packed type.
1425 if (Op.getValueType() == MVT::Vector) {
1426 const PackedType *OpTy = cast<PackedType>(I.getOperand(i)->getType());
1427 MVT::ValueType EltVT = TLI.getValueType(OpTy->getElementType());
1429 MVT::ValueType VVT = MVT::getVectorType(EltVT, OpTy->getNumElements());
1430 assert(VVT != MVT::Other && "Intrinsic uses a non-legal type?");
1431 Op = DAG.getNode(ISD::VBIT_CONVERT, VVT, Op);
1434 assert(TLI.isTypeLegal(Op.getValueType()) &&
1435 "Intrinsic uses a non-legal type?");
1439 std::vector<MVT::ValueType> VTs;
1440 if (I.getType() != Type::VoidTy) {
1441 MVT::ValueType VT = TLI.getValueType(I.getType());
1442 if (VT == MVT::Vector) {
1443 const PackedType *DestTy = cast<PackedType>(I.getType());
1444 MVT::ValueType EltVT = TLI.getValueType(DestTy->getElementType());
1446 VT = MVT::getVectorType(EltVT, DestTy->getNumElements());
1447 assert(VT != MVT::Other && "Intrinsic uses a non-legal type?");
1450 assert(TLI.isTypeLegal(VT) && "Intrinsic uses a non-legal type?");
1454 VTs.push_back(MVT::Other);
1459 Result = DAG.getNode(ISD::INTRINSIC_WO_CHAIN, VTs, Ops);
1460 else if (I.getType() != Type::VoidTy)
1461 Result = DAG.getNode(ISD::INTRINSIC_W_CHAIN, VTs, Ops);
1463 Result = DAG.getNode(ISD::INTRINSIC_VOID, VTs, Ops);
1466 SDOperand Chain = Result.getValue(Result.Val->getNumValues()-1);
1468 PendingLoads.push_back(Chain);
1472 if (I.getType() != Type::VoidTy) {
1473 if (const PackedType *PTy = dyn_cast<PackedType>(I.getType())) {
1474 MVT::ValueType EVT = TLI.getValueType(PTy->getElementType());
1475 Result = DAG.getNode(ISD::VBIT_CONVERT, MVT::Vector, Result,
1476 DAG.getConstant(PTy->getNumElements(), MVT::i32),
1477 DAG.getValueType(EVT));
1479 setValue(&I, Result);
1483 /// visitIntrinsicCall - Lower the call to the specified intrinsic function. If
1484 /// we want to emit this as a call to a named external function, return the name
1485 /// otherwise lower it and return null.
1487 SelectionDAGLowering::visitIntrinsicCall(CallInst &I, unsigned Intrinsic) {
1488 switch (Intrinsic) {
1490 // By default, turn this into a target intrinsic node.
1491 visitTargetIntrinsic(I, Intrinsic);
1493 case Intrinsic::vastart: visitVAStart(I); return 0;
1494 case Intrinsic::vaend: visitVAEnd(I); return 0;
1495 case Intrinsic::vacopy: visitVACopy(I); return 0;
1496 case Intrinsic::returnaddress: visitFrameReturnAddress(I, false); return 0;
1497 case Intrinsic::frameaddress: visitFrameReturnAddress(I, true); return 0;
1498 case Intrinsic::setjmp:
1499 return "_setjmp"+!TLI.usesUnderscoreSetJmpLongJmp();
1501 case Intrinsic::longjmp:
1502 return "_longjmp"+!TLI.usesUnderscoreSetJmpLongJmp();
1504 case Intrinsic::memcpy_i32:
1505 case Intrinsic::memcpy_i64:
1506 visitMemIntrinsic(I, ISD::MEMCPY);
1508 case Intrinsic::memset_i32:
1509 case Intrinsic::memset_i64:
1510 visitMemIntrinsic(I, ISD::MEMSET);
1512 case Intrinsic::memmove_i32:
1513 case Intrinsic::memmove_i64:
1514 visitMemIntrinsic(I, ISD::MEMMOVE);
1517 case Intrinsic::dbg_stoppoint: {
1518 MachineDebugInfo *DebugInfo = DAG.getMachineDebugInfo();
1519 DbgStopPointInst &SPI = cast<DbgStopPointInst>(I);
1520 if (DebugInfo && SPI.getContext() && DebugInfo->Verify(SPI.getContext())) {
1521 std::vector<SDOperand> Ops;
1523 Ops.push_back(getRoot());
1524 Ops.push_back(getValue(SPI.getLineValue()));
1525 Ops.push_back(getValue(SPI.getColumnValue()));
1527 DebugInfoDesc *DD = DebugInfo->getDescFor(SPI.getContext());
1528 assert(DD && "Not a debug information descriptor");
1529 CompileUnitDesc *CompileUnit = cast<CompileUnitDesc>(DD);
1531 Ops.push_back(DAG.getString(CompileUnit->getFileName()));
1532 Ops.push_back(DAG.getString(CompileUnit->getDirectory()));
1534 DAG.setRoot(DAG.getNode(ISD::LOCATION, MVT::Other, Ops));
1539 case Intrinsic::dbg_region_start: {
1540 MachineDebugInfo *DebugInfo = DAG.getMachineDebugInfo();
1541 DbgRegionStartInst &RSI = cast<DbgRegionStartInst>(I);
1542 if (DebugInfo && RSI.getContext() && DebugInfo->Verify(RSI.getContext())) {
1543 std::vector<SDOperand> Ops;
1545 unsigned LabelID = DebugInfo->RecordRegionStart(RSI.getContext());
1547 Ops.push_back(getRoot());
1548 Ops.push_back(DAG.getConstant(LabelID, MVT::i32));
1550 DAG.setRoot(DAG.getNode(ISD::DEBUG_LABEL, MVT::Other, Ops));
1555 case Intrinsic::dbg_region_end: {
1556 MachineDebugInfo *DebugInfo = DAG.getMachineDebugInfo();
1557 DbgRegionEndInst &REI = cast<DbgRegionEndInst>(I);
1558 if (DebugInfo && REI.getContext() && DebugInfo->Verify(REI.getContext())) {
1559 std::vector<SDOperand> Ops;
1561 unsigned LabelID = DebugInfo->RecordRegionEnd(REI.getContext());
1563 Ops.push_back(getRoot());
1564 Ops.push_back(DAG.getConstant(LabelID, MVT::i32));
1566 DAG.setRoot(DAG.getNode(ISD::DEBUG_LABEL, MVT::Other, Ops));
1571 case Intrinsic::dbg_func_start: {
1572 MachineDebugInfo *DebugInfo = DAG.getMachineDebugInfo();
1573 DbgFuncStartInst &FSI = cast<DbgFuncStartInst>(I);
1574 if (DebugInfo && FSI.getSubprogram() &&
1575 DebugInfo->Verify(FSI.getSubprogram())) {
1576 std::vector<SDOperand> Ops;
1578 unsigned LabelID = DebugInfo->RecordRegionStart(FSI.getSubprogram());
1580 Ops.push_back(getRoot());
1581 Ops.push_back(DAG.getConstant(LabelID, MVT::i32));
1583 DAG.setRoot(DAG.getNode(ISD::DEBUG_LABEL, MVT::Other, Ops));
1588 case Intrinsic::dbg_declare: {
1589 MachineDebugInfo *DebugInfo = DAG.getMachineDebugInfo();
1590 DbgDeclareInst &DI = cast<DbgDeclareInst>(I);
1591 if (DebugInfo && DI.getVariable() && DebugInfo->Verify(DI.getVariable())) {
1592 std::vector<SDOperand> Ops;
1594 SDOperand AddressOp = getValue(DI.getAddress());
1595 if (FrameIndexSDNode *FI = dyn_cast<FrameIndexSDNode>(AddressOp)) {
1596 DebugInfo->RecordVariable(DI.getVariable(), FI->getIndex());
1603 case Intrinsic::isunordered_f32:
1604 case Intrinsic::isunordered_f64:
1605 setValue(&I, DAG.getSetCC(MVT::i1,getValue(I.getOperand(1)),
1606 getValue(I.getOperand(2)), ISD::SETUO));
1609 case Intrinsic::sqrt_f32:
1610 case Intrinsic::sqrt_f64:
1611 setValue(&I, DAG.getNode(ISD::FSQRT,
1612 getValue(I.getOperand(1)).getValueType(),
1613 getValue(I.getOperand(1))));
1615 case Intrinsic::pcmarker: {
1616 SDOperand Tmp = getValue(I.getOperand(1));
1617 DAG.setRoot(DAG.getNode(ISD::PCMARKER, MVT::Other, getRoot(), Tmp));
1620 case Intrinsic::readcyclecounter: {
1621 std::vector<MVT::ValueType> VTs;
1622 VTs.push_back(MVT::i64);
1623 VTs.push_back(MVT::Other);
1624 std::vector<SDOperand> Ops;
1625 Ops.push_back(getRoot());
1626 SDOperand Tmp = DAG.getNode(ISD::READCYCLECOUNTER, VTs, Ops);
1628 DAG.setRoot(Tmp.getValue(1));
1631 case Intrinsic::bswap_i16:
1632 case Intrinsic::bswap_i32:
1633 case Intrinsic::bswap_i64:
1634 setValue(&I, DAG.getNode(ISD::BSWAP,
1635 getValue(I.getOperand(1)).getValueType(),
1636 getValue(I.getOperand(1))));
1638 case Intrinsic::cttz_i8:
1639 case Intrinsic::cttz_i16:
1640 case Intrinsic::cttz_i32:
1641 case Intrinsic::cttz_i64:
1642 setValue(&I, DAG.getNode(ISD::CTTZ,
1643 getValue(I.getOperand(1)).getValueType(),
1644 getValue(I.getOperand(1))));
1646 case Intrinsic::ctlz_i8:
1647 case Intrinsic::ctlz_i16:
1648 case Intrinsic::ctlz_i32:
1649 case Intrinsic::ctlz_i64:
1650 setValue(&I, DAG.getNode(ISD::CTLZ,
1651 getValue(I.getOperand(1)).getValueType(),
1652 getValue(I.getOperand(1))));
1654 case Intrinsic::ctpop_i8:
1655 case Intrinsic::ctpop_i16:
1656 case Intrinsic::ctpop_i32:
1657 case Intrinsic::ctpop_i64:
1658 setValue(&I, DAG.getNode(ISD::CTPOP,
1659 getValue(I.getOperand(1)).getValueType(),
1660 getValue(I.getOperand(1))));
1662 case Intrinsic::stacksave: {
1663 std::vector<MVT::ValueType> VTs;
1664 VTs.push_back(TLI.getPointerTy());
1665 VTs.push_back(MVT::Other);
1666 std::vector<SDOperand> Ops;
1667 Ops.push_back(getRoot());
1668 SDOperand Tmp = DAG.getNode(ISD::STACKSAVE, VTs, Ops);
1670 DAG.setRoot(Tmp.getValue(1));
1673 case Intrinsic::stackrestore: {
1674 SDOperand Tmp = getValue(I.getOperand(1));
1675 DAG.setRoot(DAG.getNode(ISD::STACKRESTORE, MVT::Other, getRoot(), Tmp));
1678 case Intrinsic::prefetch:
1679 // FIXME: Currently discarding prefetches.
1685 void SelectionDAGLowering::visitCall(CallInst &I) {
1686 const char *RenameFn = 0;
1687 if (Function *F = I.getCalledFunction()) {
1688 if (F->isExternal())
1689 if (unsigned IID = F->getIntrinsicID()) {
1690 RenameFn = visitIntrinsicCall(I, IID);
1693 } else { // Not an LLVM intrinsic.
1694 const std::string &Name = F->getName();
1695 if (Name[0] == 'c' && (Name == "copysign" || Name == "copysignf")) {
1696 if (I.getNumOperands() == 3 && // Basic sanity checks.
1697 I.getOperand(1)->getType()->isFloatingPoint() &&
1698 I.getType() == I.getOperand(1)->getType() &&
1699 I.getType() == I.getOperand(2)->getType()) {
1700 SDOperand LHS = getValue(I.getOperand(1));
1701 SDOperand RHS = getValue(I.getOperand(2));
1702 setValue(&I, DAG.getNode(ISD::FCOPYSIGN, LHS.getValueType(),
1706 } else if (Name[0] == 'f' && (Name == "fabs" || Name == "fabsf")) {
1707 if (I.getNumOperands() == 2 && // Basic sanity checks.
1708 I.getOperand(1)->getType()->isFloatingPoint() &&
1709 I.getType() == I.getOperand(1)->getType()) {
1710 SDOperand Tmp = getValue(I.getOperand(1));
1711 setValue(&I, DAG.getNode(ISD::FABS, Tmp.getValueType(), Tmp));
1714 } else if (Name[0] == 's' && (Name == "sin" || Name == "sinf")) {
1715 if (I.getNumOperands() == 2 && // Basic sanity checks.
1716 I.getOperand(1)->getType()->isFloatingPoint() &&
1717 I.getType() == I.getOperand(1)->getType()) {
1718 SDOperand Tmp = getValue(I.getOperand(1));
1719 setValue(&I, DAG.getNode(ISD::FSIN, Tmp.getValueType(), Tmp));
1722 } else if (Name[0] == 'c' && (Name == "cos" || Name == "cosf")) {
1723 if (I.getNumOperands() == 2 && // Basic sanity checks.
1724 I.getOperand(1)->getType()->isFloatingPoint() &&
1725 I.getType() == I.getOperand(1)->getType()) {
1726 SDOperand Tmp = getValue(I.getOperand(1));
1727 setValue(&I, DAG.getNode(ISD::FCOS, Tmp.getValueType(), Tmp));
1732 } else if (isa<InlineAsm>(I.getOperand(0))) {
1739 Callee = getValue(I.getOperand(0));
1741 Callee = DAG.getExternalSymbol(RenameFn, TLI.getPointerTy());
1742 std::vector<std::pair<SDOperand, const Type*> > Args;
1743 Args.reserve(I.getNumOperands());
1744 for (unsigned i = 1, e = I.getNumOperands(); i != e; ++i) {
1745 Value *Arg = I.getOperand(i);
1746 SDOperand ArgNode = getValue(Arg);
1747 Args.push_back(std::make_pair(ArgNode, Arg->getType()));
1750 const PointerType *PT = cast<PointerType>(I.getCalledValue()->getType());
1751 const FunctionType *FTy = cast<FunctionType>(PT->getElementType());
1753 std::pair<SDOperand,SDOperand> Result =
1754 TLI.LowerCallTo(getRoot(), I.getType(), FTy->isVarArg(), I.getCallingConv(),
1755 I.isTailCall(), Callee, Args, DAG);
1756 if (I.getType() != Type::VoidTy)
1757 setValue(&I, Result.first);
1758 DAG.setRoot(Result.second);
1761 SDOperand RegsForValue::getCopyFromRegs(SelectionDAG &DAG,
1762 SDOperand &Chain, SDOperand &Flag)const{
1763 SDOperand Val = DAG.getCopyFromReg(Chain, Regs[0], RegVT, Flag);
1764 Chain = Val.getValue(1);
1765 Flag = Val.getValue(2);
1767 // If the result was expanded, copy from the top part.
1768 if (Regs.size() > 1) {
1769 assert(Regs.size() == 2 &&
1770 "Cannot expand to more than 2 elts yet!");
1771 SDOperand Hi = DAG.getCopyFromReg(Chain, Regs[1], RegVT, Flag);
1772 Chain = Val.getValue(1);
1773 Flag = Val.getValue(2);
1774 if (DAG.getTargetLoweringInfo().isLittleEndian())
1775 return DAG.getNode(ISD::BUILD_PAIR, ValueVT, Val, Hi);
1777 return DAG.getNode(ISD::BUILD_PAIR, ValueVT, Hi, Val);
1780 // Otherwise, if the return value was promoted, truncate it to the
1781 // appropriate type.
1782 if (RegVT == ValueVT)
1785 if (MVT::isInteger(RegVT))
1786 return DAG.getNode(ISD::TRUNCATE, ValueVT, Val);
1788 return DAG.getNode(ISD::FP_ROUND, ValueVT, Val);
1791 /// getCopyToRegs - Emit a series of CopyToReg nodes that copies the
1792 /// specified value into the registers specified by this object. This uses
1793 /// Chain/Flag as the input and updates them for the output Chain/Flag.
1794 void RegsForValue::getCopyToRegs(SDOperand Val, SelectionDAG &DAG,
1795 SDOperand &Chain, SDOperand &Flag) const {
1796 if (Regs.size() == 1) {
1797 // If there is a single register and the types differ, this must be
1799 if (RegVT != ValueVT) {
1800 if (MVT::isInteger(RegVT))
1801 Val = DAG.getNode(ISD::ANY_EXTEND, RegVT, Val);
1803 Val = DAG.getNode(ISD::FP_EXTEND, RegVT, Val);
1805 Chain = DAG.getCopyToReg(Chain, Regs[0], Val, Flag);
1806 Flag = Chain.getValue(1);
1808 std::vector<unsigned> R(Regs);
1809 if (!DAG.getTargetLoweringInfo().isLittleEndian())
1810 std::reverse(R.begin(), R.end());
1812 for (unsigned i = 0, e = R.size(); i != e; ++i) {
1813 SDOperand Part = DAG.getNode(ISD::EXTRACT_ELEMENT, RegVT, Val,
1814 DAG.getConstant(i, MVT::i32));
1815 Chain = DAG.getCopyToReg(Chain, R[i], Part, Flag);
1816 Flag = Chain.getValue(1);
1821 /// AddInlineAsmOperands - Add this value to the specified inlineasm node
1822 /// operand list. This adds the code marker and includes the number of
1823 /// values added into it.
1824 void RegsForValue::AddInlineAsmOperands(unsigned Code, SelectionDAG &DAG,
1825 std::vector<SDOperand> &Ops) const {
1826 Ops.push_back(DAG.getConstant(Code | (Regs.size() << 3), MVT::i32));
1827 for (unsigned i = 0, e = Regs.size(); i != e; ++i)
1828 Ops.push_back(DAG.getRegister(Regs[i], RegVT));
1831 /// isAllocatableRegister - If the specified register is safe to allocate,
1832 /// i.e. it isn't a stack pointer or some other special register, return the
1833 /// register class for the register. Otherwise, return null.
1834 static const TargetRegisterClass *
1835 isAllocatableRegister(unsigned Reg, MachineFunction &MF,
1836 const TargetLowering &TLI, const MRegisterInfo *MRI) {
1837 MVT::ValueType FoundVT = MVT::Other;
1838 const TargetRegisterClass *FoundRC = 0;
1839 for (MRegisterInfo::regclass_iterator RCI = MRI->regclass_begin(),
1840 E = MRI->regclass_end(); RCI != E; ++RCI) {
1841 MVT::ValueType ThisVT = MVT::Other;
1843 const TargetRegisterClass *RC = *RCI;
1844 // If none of the the value types for this register class are valid, we
1845 // can't use it. For example, 64-bit reg classes on 32-bit targets.
1846 for (TargetRegisterClass::vt_iterator I = RC->vt_begin(), E = RC->vt_end();
1848 if (TLI.isTypeLegal(*I)) {
1849 // If we have already found this register in a different register class,
1850 // choose the one with the largest VT specified. For example, on
1851 // PowerPC, we favor f64 register classes over f32.
1852 if (FoundVT == MVT::Other ||
1853 MVT::getSizeInBits(FoundVT) < MVT::getSizeInBits(*I)) {
1860 if (ThisVT == MVT::Other) continue;
1862 // NOTE: This isn't ideal. In particular, this might allocate the
1863 // frame pointer in functions that need it (due to them not being taken
1864 // out of allocation, because a variable sized allocation hasn't been seen
1865 // yet). This is a slight code pessimization, but should still work.
1866 for (TargetRegisterClass::iterator I = RC->allocation_order_begin(MF),
1867 E = RC->allocation_order_end(MF); I != E; ++I)
1869 // We found a matching register class. Keep looking at others in case
1870 // we find one with larger registers that this physreg is also in.
1879 RegsForValue SelectionDAGLowering::
1880 GetRegistersForValue(const std::string &ConstrCode,
1881 MVT::ValueType VT, bool isOutReg, bool isInReg,
1882 std::set<unsigned> &OutputRegs,
1883 std::set<unsigned> &InputRegs) {
1884 std::pair<unsigned, const TargetRegisterClass*> PhysReg =
1885 TLI.getRegForInlineAsmConstraint(ConstrCode, VT);
1886 std::vector<unsigned> Regs;
1888 unsigned NumRegs = VT != MVT::Other ? TLI.getNumElements(VT) : 1;
1889 MVT::ValueType RegVT;
1890 MVT::ValueType ValueVT = VT;
1892 if (PhysReg.first) {
1893 if (VT == MVT::Other)
1894 ValueVT = *PhysReg.second->vt_begin();
1897 // This is a explicit reference to a physical register.
1898 Regs.push_back(PhysReg.first);
1900 // If this is an expanded reference, add the rest of the regs to Regs.
1902 RegVT = *PhysReg.second->vt_begin();
1903 TargetRegisterClass::iterator I = PhysReg.second->begin();
1904 TargetRegisterClass::iterator E = PhysReg.second->end();
1905 for (; *I != PhysReg.first; ++I)
1906 assert(I != E && "Didn't find reg!");
1908 // Already added the first reg.
1910 for (; NumRegs; --NumRegs, ++I) {
1911 assert(I != E && "Ran out of registers to allocate!");
1915 return RegsForValue(Regs, RegVT, ValueVT);
1918 // This is a reference to a register class. Allocate NumRegs consecutive,
1919 // available, registers from the class.
1920 std::vector<unsigned> RegClassRegs =
1921 TLI.getRegClassForInlineAsmConstraint(ConstrCode, VT);
1923 const MRegisterInfo *MRI = DAG.getTarget().getRegisterInfo();
1924 MachineFunction &MF = *CurMBB->getParent();
1925 unsigned NumAllocated = 0;
1926 for (unsigned i = 0, e = RegClassRegs.size(); i != e; ++i) {
1927 unsigned Reg = RegClassRegs[i];
1928 // See if this register is available.
1929 if ((isOutReg && OutputRegs.count(Reg)) || // Already used.
1930 (isInReg && InputRegs.count(Reg))) { // Already used.
1931 // Make sure we find consecutive registers.
1936 // Check to see if this register is allocatable (i.e. don't give out the
1938 const TargetRegisterClass *RC = isAllocatableRegister(Reg, MF, TLI, MRI);
1940 // Make sure we find consecutive registers.
1945 // Okay, this register is good, we can use it.
1948 // If we allocated enough consecutive
1949 if (NumAllocated == NumRegs) {
1950 unsigned RegStart = (i-NumAllocated)+1;
1951 unsigned RegEnd = i+1;
1952 // Mark all of the allocated registers used.
1953 for (unsigned i = RegStart; i != RegEnd; ++i) {
1954 unsigned Reg = RegClassRegs[i];
1955 Regs.push_back(Reg);
1956 if (isOutReg) OutputRegs.insert(Reg); // Mark reg used.
1957 if (isInReg) InputRegs.insert(Reg); // Mark reg used.
1960 return RegsForValue(Regs, *RC->vt_begin(), VT);
1964 // Otherwise, we couldn't allocate enough registers for this.
1965 return RegsForValue();
1969 /// visitInlineAsm - Handle a call to an InlineAsm object.
1971 void SelectionDAGLowering::visitInlineAsm(CallInst &I) {
1972 InlineAsm *IA = cast<InlineAsm>(I.getOperand(0));
1974 SDOperand AsmStr = DAG.getTargetExternalSymbol(IA->getAsmString().c_str(),
1977 // Note, we treat inline asms both with and without side-effects as the same.
1978 // If an inline asm doesn't have side effects and doesn't access memory, we
1979 // could not choose to not chain it.
1980 bool hasSideEffects = IA->hasSideEffects();
1982 std::vector<InlineAsm::ConstraintInfo> Constraints = IA->ParseConstraints();
1983 std::vector<MVT::ValueType> ConstraintVTs;
1985 /// AsmNodeOperands - A list of pairs. The first element is a register, the
1986 /// second is a bitfield where bit #0 is set if it is a use and bit #1 is set
1987 /// if it is a def of that register.
1988 std::vector<SDOperand> AsmNodeOperands;
1989 AsmNodeOperands.push_back(SDOperand()); // reserve space for input chain
1990 AsmNodeOperands.push_back(AsmStr);
1992 SDOperand Chain = getRoot();
1995 // We fully assign registers here at isel time. This is not optimal, but
1996 // should work. For register classes that correspond to LLVM classes, we
1997 // could let the LLVM RA do its thing, but we currently don't. Do a prepass
1998 // over the constraints, collecting fixed registers that we know we can't use.
1999 std::set<unsigned> OutputRegs, InputRegs;
2001 for (unsigned i = 0, e = Constraints.size(); i != e; ++i) {
2002 assert(Constraints[i].Codes.size() == 1 && "Only handles one code so far!");
2003 std::string &ConstraintCode = Constraints[i].Codes[0];
2005 MVT::ValueType OpVT;
2007 // Compute the value type for each operand and add it to ConstraintVTs.
2008 switch (Constraints[i].Type) {
2009 case InlineAsm::isOutput:
2010 if (!Constraints[i].isIndirectOutput) {
2011 assert(I.getType() != Type::VoidTy && "Bad inline asm!");
2012 OpVT = TLI.getValueType(I.getType());
2014 const Type *OpTy = I.getOperand(OpNum)->getType();
2015 OpVT = TLI.getValueType(cast<PointerType>(OpTy)->getElementType());
2016 OpNum++; // Consumes a call operand.
2019 case InlineAsm::isInput:
2020 OpVT = TLI.getValueType(I.getOperand(OpNum)->getType());
2021 OpNum++; // Consumes a call operand.
2023 case InlineAsm::isClobber:
2028 ConstraintVTs.push_back(OpVT);
2030 if (TLI.getRegForInlineAsmConstraint(ConstraintCode, OpVT).first == 0)
2031 continue; // Not assigned a fixed reg.
2033 // Build a list of regs that this operand uses. This always has a single
2034 // element for promoted/expanded operands.
2035 RegsForValue Regs = GetRegistersForValue(ConstraintCode, OpVT,
2037 OutputRegs, InputRegs);
2039 switch (Constraints[i].Type) {
2040 case InlineAsm::isOutput:
2041 // We can't assign any other output to this register.
2042 OutputRegs.insert(Regs.Regs.begin(), Regs.Regs.end());
2043 // If this is an early-clobber output, it cannot be assigned to the same
2044 // value as the input reg.
2045 if (Constraints[i].isEarlyClobber || Constraints[i].hasMatchingInput)
2046 InputRegs.insert(Regs.Regs.begin(), Regs.Regs.end());
2048 case InlineAsm::isInput:
2049 // We can't assign any other input to this register.
2050 InputRegs.insert(Regs.Regs.begin(), Regs.Regs.end());
2052 case InlineAsm::isClobber:
2053 // Clobbered regs cannot be used as inputs or outputs.
2054 InputRegs.insert(Regs.Regs.begin(), Regs.Regs.end());
2055 OutputRegs.insert(Regs.Regs.begin(), Regs.Regs.end());
2060 // Loop over all of the inputs, copying the operand values into the
2061 // appropriate registers and processing the output regs.
2062 RegsForValue RetValRegs;
2063 std::vector<std::pair<RegsForValue, Value*> > IndirectStoresToEmit;
2066 for (unsigned i = 0, e = Constraints.size(); i != e; ++i) {
2067 assert(Constraints[i].Codes.size() == 1 && "Only handles one code so far!");
2068 std::string &ConstraintCode = Constraints[i].Codes[0];
2070 switch (Constraints[i].Type) {
2071 case InlineAsm::isOutput: {
2072 TargetLowering::ConstraintType CTy = TargetLowering::C_RegisterClass;
2073 if (ConstraintCode.size() == 1) // not a physreg name.
2074 CTy = TLI.getConstraintType(ConstraintCode[0]);
2076 if (CTy == TargetLowering::C_Memory) {
2078 SDOperand InOperandVal = getValue(I.getOperand(OpNum));
2080 // Check that the operand (the address to store to) isn't a float.
2081 if (!MVT::isInteger(InOperandVal.getValueType()))
2082 assert(0 && "MATCH FAIL!");
2084 if (!Constraints[i].isIndirectOutput)
2085 assert(0 && "MATCH FAIL!");
2087 OpNum++; // Consumes a call operand.
2089 // Extend/truncate to the right pointer type if needed.
2090 MVT::ValueType PtrType = TLI.getPointerTy();
2091 if (InOperandVal.getValueType() < PtrType)
2092 InOperandVal = DAG.getNode(ISD::ZERO_EXTEND, PtrType, InOperandVal);
2093 else if (InOperandVal.getValueType() > PtrType)
2094 InOperandVal = DAG.getNode(ISD::TRUNCATE, PtrType, InOperandVal);
2096 // Add information to the INLINEASM node to know about this output.
2097 unsigned ResOpType = 4/*MEM*/ | (1 << 3);
2098 AsmNodeOperands.push_back(DAG.getConstant(ResOpType, MVT::i32));
2099 AsmNodeOperands.push_back(InOperandVal);
2103 // Otherwise, this is a register output.
2104 assert(CTy == TargetLowering::C_RegisterClass && "Unknown op type!");
2106 // If this is an early-clobber output, or if there is an input
2107 // constraint that matches this, we need to reserve the input register
2108 // so no other inputs allocate to it.
2109 bool UsesInputRegister = false;
2110 if (Constraints[i].isEarlyClobber || Constraints[i].hasMatchingInput)
2111 UsesInputRegister = true;
2113 // Copy the output from the appropriate register. Find a register that
2116 GetRegistersForValue(ConstraintCode, ConstraintVTs[i],
2117 true, UsesInputRegister,
2118 OutputRegs, InputRegs);
2119 assert(!Regs.Regs.empty() && "Couldn't allocate output reg!");
2121 if (!Constraints[i].isIndirectOutput) {
2122 assert(RetValRegs.Regs.empty() &&
2123 "Cannot have multiple output constraints yet!");
2124 assert(I.getType() != Type::VoidTy && "Bad inline asm!");
2127 IndirectStoresToEmit.push_back(std::make_pair(Regs,
2128 I.getOperand(OpNum)));
2129 OpNum++; // Consumes a call operand.
2132 // Add information to the INLINEASM node to know that this register is
2134 Regs.AddInlineAsmOperands(2 /*REGDEF*/, DAG, AsmNodeOperands);
2137 case InlineAsm::isInput: {
2138 SDOperand InOperandVal = getValue(I.getOperand(OpNum));
2139 OpNum++; // Consumes a call operand.
2141 if (isdigit(ConstraintCode[0])) { // Matching constraint?
2142 // If this is required to match an output register we have already set,
2143 // just use its register.
2144 unsigned OperandNo = atoi(ConstraintCode.c_str());
2146 // Scan until we find the definition we already emitted of this operand.
2147 // When we find it, create a RegsForValue operand.
2148 unsigned CurOp = 2; // The first operand.
2149 for (; OperandNo; --OperandNo) {
2150 // Advance to the next operand.
2152 cast<ConstantSDNode>(AsmNodeOperands[CurOp])->getValue();
2153 assert((NumOps & 7) == 2 /*REGDEF*/ &&
2154 "Skipped past definitions?");
2155 CurOp += (NumOps>>3)+1;
2159 cast<ConstantSDNode>(AsmNodeOperands[CurOp])->getValue();
2160 assert((NumOps & 7) == 2 /*REGDEF*/ &&
2161 "Skipped past definitions?");
2163 // Add NumOps>>3 registers to MatchedRegs.
2164 RegsForValue MatchedRegs;
2165 MatchedRegs.ValueVT = InOperandVal.getValueType();
2166 MatchedRegs.RegVT = AsmNodeOperands[CurOp+1].getValueType();
2167 for (unsigned i = 0, e = NumOps>>3; i != e; ++i) {
2168 unsigned Reg=cast<RegisterSDNode>(AsmNodeOperands[++CurOp])->getReg();
2169 MatchedRegs.Regs.push_back(Reg);
2172 // Use the produced MatchedRegs object to
2173 MatchedRegs.getCopyToRegs(InOperandVal, DAG, Chain, Flag);
2174 MatchedRegs.AddInlineAsmOperands(1 /*REGUSE*/, DAG, AsmNodeOperands);
2178 TargetLowering::ConstraintType CTy = TargetLowering::C_RegisterClass;
2179 if (ConstraintCode.size() == 1) // not a physreg name.
2180 CTy = TLI.getConstraintType(ConstraintCode[0]);
2182 if (CTy == TargetLowering::C_Other) {
2183 if (!TLI.isOperandValidForConstraint(InOperandVal, ConstraintCode[0]))
2184 assert(0 && "MATCH FAIL!");
2186 // Add information to the INLINEASM node to know about this input.
2187 unsigned ResOpType = 3 /*IMM*/ | (1 << 3);
2188 AsmNodeOperands.push_back(DAG.getConstant(ResOpType, MVT::i32));
2189 AsmNodeOperands.push_back(InOperandVal);
2191 } else if (CTy == TargetLowering::C_Memory) {
2194 // Check that the operand isn't a float.
2195 if (!MVT::isInteger(InOperandVal.getValueType()))
2196 assert(0 && "MATCH FAIL!");
2198 // Extend/truncate to the right pointer type if needed.
2199 MVT::ValueType PtrType = TLI.getPointerTy();
2200 if (InOperandVal.getValueType() < PtrType)
2201 InOperandVal = DAG.getNode(ISD::ZERO_EXTEND, PtrType, InOperandVal);
2202 else if (InOperandVal.getValueType() > PtrType)
2203 InOperandVal = DAG.getNode(ISD::TRUNCATE, PtrType, InOperandVal);
2205 // Add information to the INLINEASM node to know about this input.
2206 unsigned ResOpType = 4/*MEM*/ | (1 << 3);
2207 AsmNodeOperands.push_back(DAG.getConstant(ResOpType, MVT::i32));
2208 AsmNodeOperands.push_back(InOperandVal);
2212 assert(CTy == TargetLowering::C_RegisterClass && "Unknown op type!");
2214 // Copy the input into the appropriate registers.
2215 RegsForValue InRegs =
2216 GetRegistersForValue(ConstraintCode, ConstraintVTs[i],
2217 false, true, OutputRegs, InputRegs);
2218 // FIXME: should be match fail.
2219 assert(!InRegs.Regs.empty() && "Couldn't allocate input reg!");
2221 InRegs.getCopyToRegs(InOperandVal, DAG, Chain, Flag);
2223 InRegs.AddInlineAsmOperands(1/*REGUSE*/, DAG, AsmNodeOperands);
2226 case InlineAsm::isClobber: {
2227 RegsForValue ClobberedRegs =
2228 GetRegistersForValue(ConstraintCode, MVT::Other, false, false,
2229 OutputRegs, InputRegs);
2230 // Add the clobbered value to the operand list, so that the register
2231 // allocator is aware that the physreg got clobbered.
2232 if (!ClobberedRegs.Regs.empty())
2233 ClobberedRegs.AddInlineAsmOperands(2/*REGDEF*/, DAG, AsmNodeOperands);
2239 // Finish up input operands.
2240 AsmNodeOperands[0] = Chain;
2241 if (Flag.Val) AsmNodeOperands.push_back(Flag);
2243 std::vector<MVT::ValueType> VTs;
2244 VTs.push_back(MVT::Other);
2245 VTs.push_back(MVT::Flag);
2246 Chain = DAG.getNode(ISD::INLINEASM, VTs, AsmNodeOperands);
2247 Flag = Chain.getValue(1);
2249 // If this asm returns a register value, copy the result from that register
2250 // and set it as the value of the call.
2251 if (!RetValRegs.Regs.empty())
2252 setValue(&I, RetValRegs.getCopyFromRegs(DAG, Chain, Flag));
2254 std::vector<std::pair<SDOperand, Value*> > StoresToEmit;
2256 // Process indirect outputs, first output all of the flagged copies out of
2258 for (unsigned i = 0, e = IndirectStoresToEmit.size(); i != e; ++i) {
2259 RegsForValue &OutRegs = IndirectStoresToEmit[i].first;
2260 Value *Ptr = IndirectStoresToEmit[i].second;
2261 SDOperand OutVal = OutRegs.getCopyFromRegs(DAG, Chain, Flag);
2262 StoresToEmit.push_back(std::make_pair(OutVal, Ptr));
2265 // Emit the non-flagged stores from the physregs.
2266 std::vector<SDOperand> OutChains;
2267 for (unsigned i = 0, e = StoresToEmit.size(); i != e; ++i)
2268 OutChains.push_back(DAG.getNode(ISD::STORE, MVT::Other, Chain,
2269 StoresToEmit[i].first,
2270 getValue(StoresToEmit[i].second),
2271 DAG.getSrcValue(StoresToEmit[i].second)));
2272 if (!OutChains.empty())
2273 Chain = DAG.getNode(ISD::TokenFactor, MVT::Other, OutChains);
2278 void SelectionDAGLowering::visitMalloc(MallocInst &I) {
2279 SDOperand Src = getValue(I.getOperand(0));
2281 MVT::ValueType IntPtr = TLI.getPointerTy();
2283 if (IntPtr < Src.getValueType())
2284 Src = DAG.getNode(ISD::TRUNCATE, IntPtr, Src);
2285 else if (IntPtr > Src.getValueType())
2286 Src = DAG.getNode(ISD::ZERO_EXTEND, IntPtr, Src);
2288 // Scale the source by the type size.
2289 uint64_t ElementSize = TD->getTypeSize(I.getType()->getElementType());
2290 Src = DAG.getNode(ISD::MUL, Src.getValueType(),
2291 Src, getIntPtrConstant(ElementSize));
2293 std::vector<std::pair<SDOperand, const Type*> > Args;
2294 Args.push_back(std::make_pair(Src, TLI.getTargetData()->getIntPtrType()));
2296 std::pair<SDOperand,SDOperand> Result =
2297 TLI.LowerCallTo(getRoot(), I.getType(), false, CallingConv::C, true,
2298 DAG.getExternalSymbol("malloc", IntPtr),
2300 setValue(&I, Result.first); // Pointers always fit in registers
2301 DAG.setRoot(Result.second);
2304 void SelectionDAGLowering::visitFree(FreeInst &I) {
2305 std::vector<std::pair<SDOperand, const Type*> > Args;
2306 Args.push_back(std::make_pair(getValue(I.getOperand(0)),
2307 TLI.getTargetData()->getIntPtrType()));
2308 MVT::ValueType IntPtr = TLI.getPointerTy();
2309 std::pair<SDOperand,SDOperand> Result =
2310 TLI.LowerCallTo(getRoot(), Type::VoidTy, false, CallingConv::C, true,
2311 DAG.getExternalSymbol("free", IntPtr), Args, DAG);
2312 DAG.setRoot(Result.second);
2315 // InsertAtEndOfBasicBlock - This method should be implemented by targets that
2316 // mark instructions with the 'usesCustomDAGSchedInserter' flag. These
2317 // instructions are special in various ways, which require special support to
2318 // insert. The specified MachineInstr is created but not inserted into any
2319 // basic blocks, and the scheduler passes ownership of it to this method.
2320 MachineBasicBlock *TargetLowering::InsertAtEndOfBasicBlock(MachineInstr *MI,
2321 MachineBasicBlock *MBB) {
2322 std::cerr << "If a target marks an instruction with "
2323 "'usesCustomDAGSchedInserter', it must implement "
2324 "TargetLowering::InsertAtEndOfBasicBlock!\n";
2329 void SelectionDAGLowering::visitVAStart(CallInst &I) {
2330 DAG.setRoot(DAG.getNode(ISD::VASTART, MVT::Other, getRoot(),
2331 getValue(I.getOperand(1)),
2332 DAG.getSrcValue(I.getOperand(1))));
2335 void SelectionDAGLowering::visitVAArg(VAArgInst &I) {
2336 SDOperand V = DAG.getVAArg(TLI.getValueType(I.getType()), getRoot(),
2337 getValue(I.getOperand(0)),
2338 DAG.getSrcValue(I.getOperand(0)));
2340 DAG.setRoot(V.getValue(1));
2343 void SelectionDAGLowering::visitVAEnd(CallInst &I) {
2344 DAG.setRoot(DAG.getNode(ISD::VAEND, MVT::Other, getRoot(),
2345 getValue(I.getOperand(1)),
2346 DAG.getSrcValue(I.getOperand(1))));
2349 void SelectionDAGLowering::visitVACopy(CallInst &I) {
2350 DAG.setRoot(DAG.getNode(ISD::VACOPY, MVT::Other, getRoot(),
2351 getValue(I.getOperand(1)),
2352 getValue(I.getOperand(2)),
2353 DAG.getSrcValue(I.getOperand(1)),
2354 DAG.getSrcValue(I.getOperand(2))));
2357 /// TargetLowering::LowerArguments - This is the default LowerArguments
2358 /// implementation, which just inserts a FORMAL_ARGUMENTS node. FIXME: When all
2359 /// targets are migrated to using FORMAL_ARGUMENTS, this hook should be
2360 /// integrated into SDISel.
2361 std::vector<SDOperand>
2362 TargetLowering::LowerArguments(Function &F, SelectionDAG &DAG) {
2363 // Add CC# and isVararg as operands to the FORMAL_ARGUMENTS node.
2364 std::vector<SDOperand> Ops;
2365 Ops.push_back(DAG.getRoot());
2366 Ops.push_back(DAG.getConstant(F.getCallingConv(), getPointerTy()));
2367 Ops.push_back(DAG.getConstant(F.isVarArg(), getPointerTy()));
2369 // Add one result value for each formal argument.
2370 std::vector<MVT::ValueType> RetVals;
2371 for (Function::arg_iterator I = F.arg_begin(), E = F.arg_end(); I != E; ++I) {
2372 MVT::ValueType VT = getValueType(I->getType());
2374 switch (getTypeAction(VT)) {
2375 default: assert(0 && "Unknown type action!");
2377 RetVals.push_back(VT);
2380 RetVals.push_back(getTypeToTransformTo(VT));
2383 if (VT != MVT::Vector) {
2384 // If this is a large integer, it needs to be broken up into small
2385 // integers. Figure out what the destination type is and how many small
2386 // integers it turns into.
2387 MVT::ValueType NVT = getTypeToTransformTo(VT);
2388 unsigned NumVals = MVT::getSizeInBits(VT)/MVT::getSizeInBits(NVT);
2389 for (unsigned i = 0; i != NumVals; ++i)
2390 RetVals.push_back(NVT);
2392 // Otherwise, this is a vector type. We only support legal vectors
2394 unsigned NumElems = cast<PackedType>(I->getType())->getNumElements();
2395 const Type *EltTy = cast<PackedType>(I->getType())->getElementType();
2397 // Figure out if there is a Packed type corresponding to this Vector
2398 // type. If so, convert to the packed type.
2399 MVT::ValueType TVT = MVT::getVectorType(getValueType(EltTy), NumElems);
2400 if (TVT != MVT::Other && isTypeLegal(TVT)) {
2401 RetVals.push_back(TVT);
2403 assert(0 && "Don't support illegal by-val vector arguments yet!");
2410 RetVals.push_back(MVT::Other);
2413 SDNode *Result = DAG.getNode(ISD::FORMAL_ARGUMENTS, RetVals, Ops).Val;
2415 DAG.setRoot(SDOperand(Result, Result->getNumValues()-1));
2417 // Set up the return result vector.
2420 for (Function::arg_iterator I = F.arg_begin(), E = F.arg_end(); I != E; ++I) {
2421 MVT::ValueType VT = getValueType(I->getType());
2423 switch (getTypeAction(VT)) {
2424 default: assert(0 && "Unknown type action!");
2426 Ops.push_back(SDOperand(Result, i++));
2429 SDOperand Op(Result, i++);
2430 if (MVT::isInteger(VT)) {
2431 unsigned AssertOp = I->getType()->isSigned() ? ISD::AssertSext
2433 Op = DAG.getNode(AssertOp, Op.getValueType(), Op, DAG.getValueType(VT));
2434 Op = DAG.getNode(ISD::TRUNCATE, VT, Op);
2436 assert(MVT::isFloatingPoint(VT) && "Not int or FP?");
2437 Op = DAG.getNode(ISD::FP_ROUND, VT, Op);
2443 if (VT != MVT::Vector) {
2444 // If this is a large integer, it needs to be reassembled from small
2445 // integers. Figure out what the source elt type is and how many small
2447 MVT::ValueType NVT = getTypeToTransformTo(VT);
2448 unsigned NumVals = MVT::getSizeInBits(VT)/MVT::getSizeInBits(NVT);
2450 SDOperand Lo = SDOperand(Result, i++);
2451 SDOperand Hi = SDOperand(Result, i++);
2453 if (!isLittleEndian())
2456 Ops.push_back(DAG.getNode(ISD::BUILD_PAIR, VT, Lo, Hi));
2458 // Value scalarized into many values. Unimp for now.
2459 assert(0 && "Cannot expand i64 -> i16 yet!");
2462 // Otherwise, this is a vector type. We only support legal vectors
2464 const PackedType *PTy = cast<PackedType>(I->getType());
2465 unsigned NumElems = PTy->getNumElements();
2466 const Type *EltTy = PTy->getElementType();
2468 // Figure out if there is a Packed type corresponding to this Vector
2469 // type. If so, convert to the packed type.
2470 MVT::ValueType TVT = MVT::getVectorType(getValueType(EltTy), NumElems);
2471 if (TVT != MVT::Other && isTypeLegal(TVT)) {
2472 SDOperand N = SDOperand(Result, i++);
2473 // Handle copies from generic vectors to registers.
2474 N = DAG.getNode(ISD::VBIT_CONVERT, MVT::Vector, N,
2475 DAG.getConstant(NumElems, MVT::i32),
2476 DAG.getValueType(getValueType(EltTy)));
2479 assert(0 && "Don't support illegal by-val vector arguments yet!");
2490 /// TargetLowering::LowerCallTo - This is the default LowerCallTo
2491 /// implementation, which just inserts an ISD::CALL node, which is later custom
2492 /// lowered by the target to something concrete. FIXME: When all targets are
2493 /// migrated to using ISD::CALL, this hook should be integrated into SDISel.
2494 std::pair<SDOperand, SDOperand>
2495 TargetLowering::LowerCallTo(SDOperand Chain, const Type *RetTy, bool isVarArg,
2496 unsigned CallingConv, bool isTailCall,
2498 ArgListTy &Args, SelectionDAG &DAG) {
2499 std::vector<SDOperand> Ops;
2500 Ops.push_back(Chain); // Op#0 - Chain
2501 Ops.push_back(DAG.getConstant(CallingConv, getPointerTy())); // Op#1 - CC
2502 Ops.push_back(DAG.getConstant(isVarArg, getPointerTy())); // Op#2 - VarArg
2503 Ops.push_back(DAG.getConstant(isTailCall, getPointerTy())); // Op#3 - Tail
2504 Ops.push_back(Callee);
2506 // Handle all of the outgoing arguments.
2507 for (unsigned i = 0, e = Args.size(); i != e; ++i) {
2508 MVT::ValueType VT = getValueType(Args[i].second);
2509 SDOperand Op = Args[i].first;
2510 switch (getTypeAction(VT)) {
2511 default: assert(0 && "Unknown type action!");
2516 if (MVT::isInteger(VT)) {
2517 unsigned ExtOp = Args[i].second->isSigned() ?
2518 ISD::SIGN_EXTEND : ISD::ZERO_EXTEND;
2519 Op = DAG.getNode(ExtOp, getTypeToTransformTo(VT), Op);
2521 assert(MVT::isFloatingPoint(VT) && "Not int or FP?");
2522 Op = DAG.getNode(ISD::FP_EXTEND, getTypeToTransformTo(VT), Op);
2527 if (VT != MVT::Vector) {
2528 // If this is a large integer, it needs to be broken down into small
2529 // integers. Figure out what the source elt type is and how many small
2531 MVT::ValueType NVT = getTypeToTransformTo(VT);
2532 unsigned NumVals = MVT::getSizeInBits(VT)/MVT::getSizeInBits(NVT);
2534 SDOperand Lo = DAG.getNode(ISD::EXTRACT_ELEMENT, NVT, Op,
2535 DAG.getConstant(0, getPointerTy()));
2536 SDOperand Hi = DAG.getNode(ISD::EXTRACT_ELEMENT, NVT, Op,
2537 DAG.getConstant(1, getPointerTy()));
2538 if (!isLittleEndian())
2544 // Value scalarized into many values. Unimp for now.
2545 assert(0 && "Cannot expand i64 -> i16 yet!");
2548 // Otherwise, this is a vector type. We only support legal vectors
2550 const PackedType *PTy = cast<PackedType>(Args[i].second);
2551 unsigned NumElems = PTy->getNumElements();
2552 const Type *EltTy = PTy->getElementType();
2554 // Figure out if there is a Packed type corresponding to this Vector
2555 // type. If so, convert to the packed type.
2556 MVT::ValueType TVT = MVT::getVectorType(getValueType(EltTy), NumElems);
2557 if (TVT != MVT::Other && isTypeLegal(TVT)) {
2558 // Insert a VBIT_CONVERT of the MVT::Vector type to the packed type.
2559 Op = DAG.getNode(ISD::VBIT_CONVERT, TVT, Op);
2562 assert(0 && "Don't support illegal by-val vector call args yet!");
2570 // Figure out the result value types.
2571 std::vector<MVT::ValueType> RetTys;
2573 if (RetTy != Type::VoidTy) {
2574 MVT::ValueType VT = getValueType(RetTy);
2575 switch (getTypeAction(VT)) {
2576 default: assert(0 && "Unknown type action!");
2578 RetTys.push_back(VT);
2581 RetTys.push_back(getTypeToTransformTo(VT));
2584 if (VT != MVT::Vector) {
2585 // If this is a large integer, it needs to be reassembled from small
2586 // integers. Figure out what the source elt type is and how many small
2588 MVT::ValueType NVT = getTypeToTransformTo(VT);
2589 unsigned NumVals = MVT::getSizeInBits(VT)/MVT::getSizeInBits(NVT);
2590 for (unsigned i = 0; i != NumVals; ++i)
2591 RetTys.push_back(NVT);
2593 // Otherwise, this is a vector type. We only support legal vectors
2595 const PackedType *PTy = cast<PackedType>(RetTy);
2596 unsigned NumElems = PTy->getNumElements();
2597 const Type *EltTy = PTy->getElementType();
2599 // Figure out if there is a Packed type corresponding to this Vector
2600 // type. If so, convert to the packed type.
2601 MVT::ValueType TVT = MVT::getVectorType(getValueType(EltTy), NumElems);
2602 if (TVT != MVT::Other && isTypeLegal(TVT)) {
2603 RetTys.push_back(TVT);
2605 assert(0 && "Don't support illegal by-val vector call results yet!");
2612 RetTys.push_back(MVT::Other); // Always has a chain.
2614 // Finally, create the CALL node.
2615 SDOperand Res = DAG.getNode(ISD::CALL, RetTys, Ops);
2617 // This returns a pair of operands. The first element is the
2618 // return value for the function (if RetTy is not VoidTy). The second
2619 // element is the outgoing token chain.
2621 if (RetTys.size() != 1) {
2622 MVT::ValueType VT = getValueType(RetTy);
2623 if (RetTys.size() == 2) {
2626 // If this value was promoted, truncate it down.
2627 if (ResVal.getValueType() != VT) {
2628 if (VT == MVT::Vector) {
2629 // Insert a VBITCONVERT to convert from the packed result type to the
2630 // MVT::Vector type.
2631 unsigned NumElems = cast<PackedType>(RetTy)->getNumElements();
2632 const Type *EltTy = cast<PackedType>(RetTy)->getElementType();
2634 // Figure out if there is a Packed type corresponding to this Vector
2635 // type. If so, convert to the packed type.
2636 MVT::ValueType TVT = MVT::getVectorType(getValueType(EltTy), NumElems);
2637 if (TVT != MVT::Other && isTypeLegal(TVT)) {
2638 // Insert a VBIT_CONVERT of the FORMAL_ARGUMENTS to a
2639 // "N x PTyElementVT" MVT::Vector type.
2640 ResVal = DAG.getNode(ISD::VBIT_CONVERT, MVT::Vector, ResVal,
2641 DAG.getConstant(NumElems, MVT::i32),
2642 DAG.getValueType(getValueType(EltTy)));
2646 } else if (MVT::isInteger(VT)) {
2647 unsigned AssertOp = RetTy->isSigned() ?
2648 ISD::AssertSext : ISD::AssertZext;
2649 ResVal = DAG.getNode(AssertOp, ResVal.getValueType(), ResVal,
2650 DAG.getValueType(VT));
2651 ResVal = DAG.getNode(ISD::TRUNCATE, VT, ResVal);
2653 assert(MVT::isFloatingPoint(VT));
2654 ResVal = DAG.getNode(ISD::FP_ROUND, VT, ResVal);
2657 } else if (RetTys.size() == 3) {
2658 ResVal = DAG.getNode(ISD::BUILD_PAIR, VT,
2659 Res.getValue(0), Res.getValue(1));
2662 assert(0 && "Case not handled yet!");
2666 return std::make_pair(ResVal, Res.getValue(Res.Val->getNumValues()-1));
2671 // It is always conservatively correct for llvm.returnaddress and
2672 // llvm.frameaddress to return 0.
2674 // FIXME: Change this to insert a FRAMEADDR/RETURNADDR node, and have that be
2675 // expanded to 0 if the target wants.
2676 std::pair<SDOperand, SDOperand>
2677 TargetLowering::LowerFrameReturnAddress(bool isFrameAddr, SDOperand Chain,
2678 unsigned Depth, SelectionDAG &DAG) {
2679 return std::make_pair(DAG.getConstant(0, getPointerTy()), Chain);
2682 SDOperand TargetLowering::LowerOperation(SDOperand Op, SelectionDAG &DAG) {
2683 assert(0 && "LowerOperation not implemented for this target!");
2688 SDOperand TargetLowering::CustomPromoteOperation(SDOperand Op,
2689 SelectionDAG &DAG) {
2690 assert(0 && "CustomPromoteOperation not implemented for this target!");
2695 void SelectionDAGLowering::visitFrameReturnAddress(CallInst &I, bool isFrame) {
2696 unsigned Depth = (unsigned)cast<ConstantUInt>(I.getOperand(1))->getValue();
2697 std::pair<SDOperand,SDOperand> Result =
2698 TLI.LowerFrameReturnAddress(isFrame, getRoot(), Depth, DAG);
2699 setValue(&I, Result.first);
2700 DAG.setRoot(Result.second);
2703 /// getMemsetValue - Vectorized representation of the memset value
2705 static SDOperand getMemsetValue(SDOperand Value, MVT::ValueType VT,
2706 SelectionDAG &DAG) {
2707 MVT::ValueType CurVT = VT;
2708 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Value)) {
2709 uint64_t Val = C->getValue() & 255;
2711 while (CurVT != MVT::i8) {
2712 Val = (Val << Shift) | Val;
2714 CurVT = (MVT::ValueType)((unsigned)CurVT - 1);
2716 return DAG.getConstant(Val, VT);
2718 Value = DAG.getNode(ISD::ZERO_EXTEND, VT, Value);
2720 while (CurVT != MVT::i8) {
2722 DAG.getNode(ISD::OR, VT,
2723 DAG.getNode(ISD::SHL, VT, Value,
2724 DAG.getConstant(Shift, MVT::i8)), Value);
2726 CurVT = (MVT::ValueType)((unsigned)CurVT - 1);
2733 /// getMemsetStringVal - Similar to getMemsetValue. Except this is only
2734 /// used when a memcpy is turned into a memset when the source is a constant
2736 static SDOperand getMemsetStringVal(MVT::ValueType VT,
2737 SelectionDAG &DAG, TargetLowering &TLI,
2738 std::string &Str, unsigned Offset) {
2739 MVT::ValueType CurVT = VT;
2741 unsigned MSB = getSizeInBits(VT) / 8;
2742 if (TLI.isLittleEndian())
2743 Offset = Offset + MSB - 1;
2744 for (unsigned i = 0; i != MSB; ++i) {
2745 Val = (Val << 8) | Str[Offset];
2746 Offset += TLI.isLittleEndian() ? -1 : 1;
2748 return DAG.getConstant(Val, VT);
2751 /// getMemBasePlusOffset - Returns base and offset node for the
2752 static SDOperand getMemBasePlusOffset(SDOperand Base, unsigned Offset,
2753 SelectionDAG &DAG, TargetLowering &TLI) {
2754 MVT::ValueType VT = Base.getValueType();
2755 return DAG.getNode(ISD::ADD, VT, Base, DAG.getConstant(Offset, VT));
2758 /// MeetsMaxMemopRequirement - Determines if the number of memory ops required
2759 /// to replace the memset / memcpy is below the threshold. It also returns the
2760 /// types of the sequence of memory ops to perform memset / memcpy.
2761 static bool MeetsMaxMemopRequirement(std::vector<MVT::ValueType> &MemOps,
2762 unsigned Limit, uint64_t Size,
2763 unsigned Align, TargetLowering &TLI) {
2766 if (TLI.allowsUnalignedMemoryAccesses()) {
2769 switch (Align & 7) {
2785 MVT::ValueType LVT = MVT::i64;
2786 while (!TLI.isTypeLegal(LVT))
2787 LVT = (MVT::ValueType)((unsigned)LVT - 1);
2788 assert(MVT::isInteger(LVT));
2793 unsigned NumMemOps = 0;
2795 unsigned VTSize = getSizeInBits(VT) / 8;
2796 while (VTSize > Size) {
2797 VT = (MVT::ValueType)((unsigned)VT - 1);
2800 assert(MVT::isInteger(VT));
2802 if (++NumMemOps > Limit)
2804 MemOps.push_back(VT);
2811 void SelectionDAGLowering::visitMemIntrinsic(CallInst &I, unsigned Op) {
2812 SDOperand Op1 = getValue(I.getOperand(1));
2813 SDOperand Op2 = getValue(I.getOperand(2));
2814 SDOperand Op3 = getValue(I.getOperand(3));
2815 SDOperand Op4 = getValue(I.getOperand(4));
2816 unsigned Align = (unsigned)cast<ConstantSDNode>(Op4)->getValue();
2817 if (Align == 0) Align = 1;
2819 if (ConstantSDNode *Size = dyn_cast<ConstantSDNode>(Op3)) {
2820 std::vector<MVT::ValueType> MemOps;
2822 // Expand memset / memcpy to a series of load / store ops
2823 // if the size operand falls below a certain threshold.
2824 std::vector<SDOperand> OutChains;
2826 default: break; // Do nothing for now.
2828 if (MeetsMaxMemopRequirement(MemOps, TLI.getMaxStoresPerMemset(),
2829 Size->getValue(), Align, TLI)) {
2830 unsigned NumMemOps = MemOps.size();
2831 unsigned Offset = 0;
2832 for (unsigned i = 0; i < NumMemOps; i++) {
2833 MVT::ValueType VT = MemOps[i];
2834 unsigned VTSize = getSizeInBits(VT) / 8;
2835 SDOperand Value = getMemsetValue(Op2, VT, DAG);
2836 SDOperand Store = DAG.getNode(ISD::STORE, MVT::Other, getRoot(),
2838 getMemBasePlusOffset(Op1, Offset, DAG, TLI),
2839 DAG.getSrcValue(I.getOperand(1), Offset));
2840 OutChains.push_back(Store);
2847 if (MeetsMaxMemopRequirement(MemOps, TLI.getMaxStoresPerMemcpy(),
2848 Size->getValue(), Align, TLI)) {
2849 unsigned NumMemOps = MemOps.size();
2850 unsigned SrcOff = 0, DstOff = 0, SrcDelta = 0;
2851 GlobalAddressSDNode *G = NULL;
2853 bool CopyFromStr = false;
2855 if (Op2.getOpcode() == ISD::GlobalAddress)
2856 G = cast<GlobalAddressSDNode>(Op2);
2857 else if (Op2.getOpcode() == ISD::ADD &&
2858 Op2.getOperand(0).getOpcode() == ISD::GlobalAddress &&
2859 Op2.getOperand(1).getOpcode() == ISD::Constant) {
2860 G = cast<GlobalAddressSDNode>(Op2.getOperand(0));
2861 SrcDelta = cast<ConstantSDNode>(Op2.getOperand(1))->getValue();
2864 GlobalVariable *GV = dyn_cast<GlobalVariable>(G->getGlobal());
2866 Str = GV->getStringValue(false);
2874 for (unsigned i = 0; i < NumMemOps; i++) {
2875 MVT::ValueType VT = MemOps[i];
2876 unsigned VTSize = getSizeInBits(VT) / 8;
2877 SDOperand Value, Chain, Store;
2880 Value = getMemsetStringVal(VT, DAG, TLI, Str, SrcOff);
2883 DAG.getNode(ISD::STORE, MVT::Other, Chain, Value,
2884 getMemBasePlusOffset(Op1, DstOff, DAG, TLI),
2885 DAG.getSrcValue(I.getOperand(1), DstOff));
2887 Value = DAG.getLoad(VT, getRoot(),
2888 getMemBasePlusOffset(Op2, SrcOff, DAG, TLI),
2889 DAG.getSrcValue(I.getOperand(2), SrcOff));
2890 Chain = Value.getValue(1);
2892 DAG.getNode(ISD::STORE, MVT::Other, Chain, Value,
2893 getMemBasePlusOffset(Op1, DstOff, DAG, TLI),
2894 DAG.getSrcValue(I.getOperand(1), DstOff));
2896 OutChains.push_back(Store);
2905 if (!OutChains.empty()) {
2906 DAG.setRoot(DAG.getNode(ISD::TokenFactor, MVT::Other, OutChains));
2911 std::vector<SDOperand> Ops;
2912 Ops.push_back(getRoot());
2917 DAG.setRoot(DAG.getNode(Op, MVT::Other, Ops));
2920 //===----------------------------------------------------------------------===//
2921 // SelectionDAGISel code
2922 //===----------------------------------------------------------------------===//
2924 unsigned SelectionDAGISel::MakeReg(MVT::ValueType VT) {
2925 return RegMap->createVirtualRegister(TLI.getRegClassFor(VT));
2928 void SelectionDAGISel::getAnalysisUsage(AnalysisUsage &AU) const {
2929 // FIXME: we only modify the CFG to split critical edges. This
2930 // updates dom and loop info.
2934 /// OptimizeNoopCopyExpression - We have determined that the specified cast
2935 /// instruction is a noop copy (e.g. it's casting from one pointer type to
2936 /// another, int->uint, or int->sbyte on PPC.
2938 /// Return true if any changes are made.
2939 static bool OptimizeNoopCopyExpression(CastInst *CI) {
2940 BasicBlock *DefBB = CI->getParent();
2942 /// InsertedCasts - Only insert a cast in each block once.
2943 std::map<BasicBlock*, CastInst*> InsertedCasts;
2945 bool MadeChange = false;
2946 for (Value::use_iterator UI = CI->use_begin(), E = CI->use_end();
2948 Use &TheUse = UI.getUse();
2949 Instruction *User = cast<Instruction>(*UI);
2951 // Figure out which BB this cast is used in. For PHI's this is the
2952 // appropriate predecessor block.
2953 BasicBlock *UserBB = User->getParent();
2954 if (PHINode *PN = dyn_cast<PHINode>(User)) {
2955 unsigned OpVal = UI.getOperandNo()/2;
2956 UserBB = PN->getIncomingBlock(OpVal);
2959 // Preincrement use iterator so we don't invalidate it.
2962 // If this user is in the same block as the cast, don't change the cast.
2963 if (UserBB == DefBB) continue;
2965 // If we have already inserted a cast into this block, use it.
2966 CastInst *&InsertedCast = InsertedCasts[UserBB];
2968 if (!InsertedCast) {
2969 BasicBlock::iterator InsertPt = UserBB->begin();
2970 while (isa<PHINode>(InsertPt)) ++InsertPt;
2973 new CastInst(CI->getOperand(0), CI->getType(), "", InsertPt);
2977 // Replace a use of the cast with a use of the new casat.
2978 TheUse = InsertedCast;
2981 // If we removed all uses, nuke the cast.
2982 if (CI->use_empty())
2983 CI->eraseFromParent();
2988 /// InsertGEPComputeCode - Insert code into BB to compute Ptr+PtrOffset,
2989 /// casting to the type of GEPI.
2990 static Instruction *InsertGEPComputeCode(Instruction *&V, BasicBlock *BB,
2991 Instruction *GEPI, Value *Ptr,
2993 if (V) return V; // Already computed.
2995 BasicBlock::iterator InsertPt;
2996 if (BB == GEPI->getParent()) {
2997 // If insert into the GEP's block, insert right after the GEP.
3001 // Otherwise, insert at the top of BB, after any PHI nodes
3002 InsertPt = BB->begin();
3003 while (isa<PHINode>(InsertPt)) ++InsertPt;
3006 // If Ptr is itself a cast, but in some other BB, emit a copy of the cast into
3007 // BB so that there is only one value live across basic blocks (the cast
3009 if (CastInst *CI = dyn_cast<CastInst>(Ptr))
3010 if (CI->getParent() != BB && isa<PointerType>(CI->getOperand(0)->getType()))
3011 Ptr = new CastInst(CI->getOperand(0), CI->getType(), "", InsertPt);
3013 // Add the offset, cast it to the right type.
3014 Ptr = BinaryOperator::createAdd(Ptr, PtrOffset, "", InsertPt);
3015 return V = new CastInst(Ptr, GEPI->getType(), "", InsertPt);
3018 /// ReplaceUsesOfGEPInst - Replace all uses of RepPtr with inserted code to
3019 /// compute its value. The RepPtr value can be computed with Ptr+PtrOffset. One
3020 /// trivial way of doing this would be to evaluate Ptr+PtrOffset in RepPtr's
3021 /// block, then ReplaceAllUsesWith'ing everything. However, we would prefer to
3022 /// sink PtrOffset into user blocks where doing so will likely allow us to fold
3023 /// the constant add into a load or store instruction. Additionally, if a user
3024 /// is a pointer-pointer cast, we look through it to find its users.
3025 static void ReplaceUsesOfGEPInst(Instruction *RepPtr, Value *Ptr,
3026 Constant *PtrOffset, BasicBlock *DefBB,
3027 GetElementPtrInst *GEPI,
3028 std::map<BasicBlock*,Instruction*> &InsertedExprs) {
3029 while (!RepPtr->use_empty()) {
3030 Instruction *User = cast<Instruction>(RepPtr->use_back());
3032 // If the user is a Pointer-Pointer cast, recurse.
3033 if (isa<CastInst>(User) && isa<PointerType>(User->getType())) {
3034 ReplaceUsesOfGEPInst(User, Ptr, PtrOffset, DefBB, GEPI, InsertedExprs);
3036 // Drop the use of RepPtr. The cast is dead. Don't delete it now, else we
3037 // could invalidate an iterator.
3038 User->setOperand(0, UndefValue::get(RepPtr->getType()));
3042 // If this is a load of the pointer, or a store through the pointer, emit
3043 // the increment into the load/store block.
3044 Instruction *NewVal;
3045 if (isa<LoadInst>(User) ||
3046 (isa<StoreInst>(User) && User->getOperand(0) != RepPtr)) {
3047 NewVal = InsertGEPComputeCode(InsertedExprs[User->getParent()],
3048 User->getParent(), GEPI,
3051 // If this use is not foldable into the addressing mode, use a version
3052 // emitted in the GEP block.
3053 NewVal = InsertGEPComputeCode(InsertedExprs[DefBB], DefBB, GEPI,
3057 if (GEPI->getType() != RepPtr->getType()) {
3058 BasicBlock::iterator IP = NewVal;
3060 NewVal = new CastInst(NewVal, RepPtr->getType(), "", IP);
3062 User->replaceUsesOfWith(RepPtr, NewVal);
3067 /// OptimizeGEPExpression - Since we are doing basic-block-at-a-time instruction
3068 /// selection, we want to be a bit careful about some things. In particular, if
3069 /// we have a GEP instruction that is used in a different block than it is
3070 /// defined, the addressing expression of the GEP cannot be folded into loads or
3071 /// stores that use it. In this case, decompose the GEP and move constant
3072 /// indices into blocks that use it.
3073 static bool OptimizeGEPExpression(GetElementPtrInst *GEPI,
3074 const TargetData *TD) {
3075 // If this GEP is only used inside the block it is defined in, there is no
3076 // need to rewrite it.
3077 bool isUsedOutsideDefBB = false;
3078 BasicBlock *DefBB = GEPI->getParent();
3079 for (Value::use_iterator UI = GEPI->use_begin(), E = GEPI->use_end();
3081 if (cast<Instruction>(*UI)->getParent() != DefBB) {
3082 isUsedOutsideDefBB = true;
3086 if (!isUsedOutsideDefBB) return false;
3088 // If this GEP has no non-zero constant indices, there is nothing we can do,
3090 bool hasConstantIndex = false;
3091 bool hasVariableIndex = false;
3092 for (GetElementPtrInst::op_iterator OI = GEPI->op_begin()+1,
3093 E = GEPI->op_end(); OI != E; ++OI) {
3094 if (ConstantInt *CI = dyn_cast<ConstantInt>(*OI)) {
3095 if (CI->getRawValue()) {
3096 hasConstantIndex = true;
3100 hasVariableIndex = true;
3104 // If this is a "GEP X, 0, 0, 0", turn this into a cast.
3105 if (!hasConstantIndex && !hasVariableIndex) {
3106 Value *NC = new CastInst(GEPI->getOperand(0), GEPI->getType(),
3107 GEPI->getName(), GEPI);
3108 GEPI->replaceAllUsesWith(NC);
3109 GEPI->eraseFromParent();
3113 // If this is a GEP &Alloca, 0, 0, forward subst the frame index into uses.
3114 if (!hasConstantIndex && !isa<AllocaInst>(GEPI->getOperand(0)))
3117 // Otherwise, decompose the GEP instruction into multiplies and adds. Sum the
3118 // constant offset (which we now know is non-zero) and deal with it later.
3119 uint64_t ConstantOffset = 0;
3120 const Type *UIntPtrTy = TD->getIntPtrType();
3121 Value *Ptr = new CastInst(GEPI->getOperand(0), UIntPtrTy, "", GEPI);
3122 const Type *Ty = GEPI->getOperand(0)->getType();
3124 for (GetElementPtrInst::op_iterator OI = GEPI->op_begin()+1,
3125 E = GEPI->op_end(); OI != E; ++OI) {
3127 if (const StructType *StTy = dyn_cast<StructType>(Ty)) {
3128 unsigned Field = cast<ConstantUInt>(Idx)->getValue();
3130 ConstantOffset += TD->getStructLayout(StTy)->MemberOffsets[Field];
3131 Ty = StTy->getElementType(Field);
3133 Ty = cast<SequentialType>(Ty)->getElementType();
3135 // Handle constant subscripts.
3136 if (ConstantInt *CI = dyn_cast<ConstantInt>(Idx)) {
3137 if (CI->getRawValue() == 0) continue;
3139 if (ConstantSInt *CSI = dyn_cast<ConstantSInt>(CI))
3140 ConstantOffset += (int64_t)TD->getTypeSize(Ty)*CSI->getValue();
3142 ConstantOffset+=TD->getTypeSize(Ty)*cast<ConstantUInt>(CI)->getValue();
3146 // Ptr = Ptr + Idx * ElementSize;
3148 // Cast Idx to UIntPtrTy if needed.
3149 Idx = new CastInst(Idx, UIntPtrTy, "", GEPI);
3151 uint64_t ElementSize = TD->getTypeSize(Ty);
3152 // Mask off bits that should not be set.
3153 ElementSize &= ~0ULL >> (64-UIntPtrTy->getPrimitiveSizeInBits());
3154 Constant *SizeCst = ConstantUInt::get(UIntPtrTy, ElementSize);
3156 // Multiply by the element size and add to the base.
3157 Idx = BinaryOperator::createMul(Idx, SizeCst, "", GEPI);
3158 Ptr = BinaryOperator::createAdd(Ptr, Idx, "", GEPI);
3162 // Make sure that the offset fits in uintptr_t.
3163 ConstantOffset &= ~0ULL >> (64-UIntPtrTy->getPrimitiveSizeInBits());
3164 Constant *PtrOffset = ConstantUInt::get(UIntPtrTy, ConstantOffset);
3166 // Okay, we have now emitted all of the variable index parts to the BB that
3167 // the GEP is defined in. Loop over all of the using instructions, inserting
3168 // an "add Ptr, ConstantOffset" into each block that uses it and update the
3169 // instruction to use the newly computed value, making GEPI dead. When the
3170 // user is a load or store instruction address, we emit the add into the user
3171 // block, otherwise we use a canonical version right next to the gep (these
3172 // won't be foldable as addresses, so we might as well share the computation).
3174 std::map<BasicBlock*,Instruction*> InsertedExprs;
3175 ReplaceUsesOfGEPInst(GEPI, Ptr, PtrOffset, DefBB, GEPI, InsertedExprs);
3177 // Finally, the GEP is dead, remove it.
3178 GEPI->eraseFromParent();
3183 bool SelectionDAGISel::runOnFunction(Function &Fn) {
3184 MachineFunction &MF = MachineFunction::construct(&Fn, TLI.getTargetMachine());
3185 RegMap = MF.getSSARegMap();
3186 DEBUG(std::cerr << "\n\n\n=== " << Fn.getName() << "\n");
3188 // First, split all critical edges for PHI nodes with incoming values that are
3189 // constants, this way the load of the constant into a vreg will not be placed
3190 // into MBBs that are used some other way.
3192 // In this pass we also look for GEP and cast instructions that are used
3193 // across basic blocks and rewrite them to improve basic-block-at-a-time
3197 bool MadeChange = true;
3198 while (MadeChange) {
3200 for (Function::iterator BB = Fn.begin(), E = Fn.end(); BB != E; ++BB) {
3202 BasicBlock::iterator BBI;
3203 for (BBI = BB->begin(); (PN = dyn_cast<PHINode>(BBI)); ++BBI)
3204 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
3205 if (isa<Constant>(PN->getIncomingValue(i)))
3206 SplitCriticalEdge(PN->getIncomingBlock(i), BB);
3208 for (BasicBlock::iterator E = BB->end(); BBI != E; ) {
3209 Instruction *I = BBI++;
3210 if (GetElementPtrInst *GEPI = dyn_cast<GetElementPtrInst>(I)) {
3211 MadeChange |= OptimizeGEPExpression(GEPI, TLI.getTargetData());
3212 } else if (CastInst *CI = dyn_cast<CastInst>(I)) {
3213 // If this is a noop copy, sink it into user blocks to reduce the number
3214 // of virtual registers that must be created and coallesced.
3215 MVT::ValueType SrcVT = TLI.getValueType(CI->getOperand(0)->getType());
3216 MVT::ValueType DstVT = TLI.getValueType(CI->getType());
3218 // This is an fp<->int conversion?
3219 if (MVT::isInteger(SrcVT) != MVT::isInteger(DstVT))
3222 // If this is an extension, it will be a zero or sign extension, which
3224 if (SrcVT < DstVT) continue;
3226 // If these values will be promoted, find out what they will be promoted
3227 // to. This helps us consider truncates on PPC as noop copies when they
3229 if (TLI.getTypeAction(SrcVT) == TargetLowering::Promote)
3230 SrcVT = TLI.getTypeToTransformTo(SrcVT);
3231 if (TLI.getTypeAction(DstVT) == TargetLowering::Promote)
3232 DstVT = TLI.getTypeToTransformTo(DstVT);
3234 // If, after promotion, these are the same types, this is a noop copy.
3236 MadeChange |= OptimizeNoopCopyExpression(CI);
3242 FunctionLoweringInfo FuncInfo(TLI, Fn, MF);
3244 for (Function::iterator I = Fn.begin(), E = Fn.end(); I != E; ++I)
3245 SelectBasicBlock(I, MF, FuncInfo);
3251 SDOperand SelectionDAGISel::
3252 CopyValueToVirtualRegister(SelectionDAGLowering &SDL, Value *V, unsigned Reg) {
3253 SDOperand Op = SDL.getValue(V);
3254 assert((Op.getOpcode() != ISD::CopyFromReg ||
3255 cast<RegisterSDNode>(Op.getOperand(1))->getReg() != Reg) &&
3256 "Copy from a reg to the same reg!");
3258 // If this type is not legal, we must make sure to not create an invalid
3260 MVT::ValueType SrcVT = Op.getValueType();
3261 MVT::ValueType DestVT = TLI.getTypeToTransformTo(SrcVT);
3262 SelectionDAG &DAG = SDL.DAG;
3263 if (SrcVT == DestVT) {
3264 return DAG.getCopyToReg(SDL.getRoot(), Reg, Op);
3265 } else if (SrcVT == MVT::Vector) {
3266 // Handle copies from generic vectors to registers.
3267 MVT::ValueType PTyElementVT, PTyLegalElementVT;
3268 unsigned NE = TLI.getPackedTypeBreakdown(cast<PackedType>(V->getType()),
3269 PTyElementVT, PTyLegalElementVT);
3271 // Insert a VBIT_CONVERT of the input vector to a "N x PTyElementVT"
3272 // MVT::Vector type.
3273 Op = DAG.getNode(ISD::VBIT_CONVERT, MVT::Vector, Op,
3274 DAG.getConstant(NE, MVT::i32),
3275 DAG.getValueType(PTyElementVT));
3277 // Loop over all of the elements of the resultant vector,
3278 // VEXTRACT_VECTOR_ELT'ing them, converting them to PTyLegalElementVT, then
3279 // copying them into output registers.
3280 std::vector<SDOperand> OutChains;
3281 SDOperand Root = SDL.getRoot();
3282 for (unsigned i = 0; i != NE; ++i) {
3283 SDOperand Elt = DAG.getNode(ISD::VEXTRACT_VECTOR_ELT, PTyElementVT,
3284 Op, DAG.getConstant(i, MVT::i32));
3285 if (PTyElementVT == PTyLegalElementVT) {
3286 // Elements are legal.
3287 OutChains.push_back(DAG.getCopyToReg(Root, Reg++, Elt));
3288 } else if (PTyLegalElementVT > PTyElementVT) {
3289 // Elements are promoted.
3290 if (MVT::isFloatingPoint(PTyLegalElementVT))
3291 Elt = DAG.getNode(ISD::FP_EXTEND, PTyLegalElementVT, Elt);
3293 Elt = DAG.getNode(ISD::ANY_EXTEND, PTyLegalElementVT, Elt);
3294 OutChains.push_back(DAG.getCopyToReg(Root, Reg++, Elt));
3296 // Elements are expanded.
3297 // The src value is expanded into multiple registers.
3298 SDOperand Lo = DAG.getNode(ISD::EXTRACT_ELEMENT, PTyLegalElementVT,
3299 Elt, DAG.getConstant(0, MVT::i32));
3300 SDOperand Hi = DAG.getNode(ISD::EXTRACT_ELEMENT, PTyLegalElementVT,
3301 Elt, DAG.getConstant(1, MVT::i32));
3302 OutChains.push_back(DAG.getCopyToReg(Root, Reg++, Lo));
3303 OutChains.push_back(DAG.getCopyToReg(Root, Reg++, Hi));
3306 return DAG.getNode(ISD::TokenFactor, MVT::Other, OutChains);
3307 } else if (SrcVT < DestVT) {
3308 // The src value is promoted to the register.
3309 if (MVT::isFloatingPoint(SrcVT))
3310 Op = DAG.getNode(ISD::FP_EXTEND, DestVT, Op);
3312 Op = DAG.getNode(ISD::ANY_EXTEND, DestVT, Op);
3313 return DAG.getCopyToReg(SDL.getRoot(), Reg, Op);
3315 // The src value is expanded into multiple registers.
3316 SDOperand Lo = DAG.getNode(ISD::EXTRACT_ELEMENT, DestVT,
3317 Op, DAG.getConstant(0, MVT::i32));
3318 SDOperand Hi = DAG.getNode(ISD::EXTRACT_ELEMENT, DestVT,
3319 Op, DAG.getConstant(1, MVT::i32));
3320 Op = DAG.getCopyToReg(SDL.getRoot(), Reg, Lo);
3321 return DAG.getCopyToReg(Op, Reg+1, Hi);
3325 void SelectionDAGISel::
3326 LowerArguments(BasicBlock *BB, SelectionDAGLowering &SDL,
3327 std::vector<SDOperand> &UnorderedChains) {
3328 // If this is the entry block, emit arguments.
3329 Function &F = *BB->getParent();
3330 FunctionLoweringInfo &FuncInfo = SDL.FuncInfo;
3331 SDOperand OldRoot = SDL.DAG.getRoot();
3332 std::vector<SDOperand> Args = TLI.LowerArguments(F, SDL.DAG);
3335 for (Function::arg_iterator AI = F.arg_begin(), E = F.arg_end();
3337 if (!AI->use_empty()) {
3338 SDL.setValue(AI, Args[a]);
3340 // If this argument is live outside of the entry block, insert a copy from
3341 // whereever we got it to the vreg that other BB's will reference it as.
3342 if (FuncInfo.ValueMap.count(AI)) {
3344 CopyValueToVirtualRegister(SDL, AI, FuncInfo.ValueMap[AI]);
3345 UnorderedChains.push_back(Copy);
3349 // Finally, if the target has anything special to do, allow it to do so.
3350 // FIXME: this should insert code into the DAG!
3351 EmitFunctionEntryCode(F, SDL.DAG.getMachineFunction());
3354 void SelectionDAGISel::BuildSelectionDAG(SelectionDAG &DAG, BasicBlock *LLVMBB,
3355 std::vector<std::pair<MachineInstr*, unsigned> > &PHINodesToUpdate,
3356 FunctionLoweringInfo &FuncInfo) {
3357 SelectionDAGLowering SDL(DAG, TLI, FuncInfo);
3359 std::vector<SDOperand> UnorderedChains;
3361 // Lower any arguments needed in this block if this is the entry block.
3362 if (LLVMBB == &LLVMBB->getParent()->front())
3363 LowerArguments(LLVMBB, SDL, UnorderedChains);
3365 BB = FuncInfo.MBBMap[LLVMBB];
3366 SDL.setCurrentBasicBlock(BB);
3368 // Lower all of the non-terminator instructions.
3369 for (BasicBlock::iterator I = LLVMBB->begin(), E = --LLVMBB->end();
3373 // Ensure that all instructions which are used outside of their defining
3374 // blocks are available as virtual registers.
3375 for (BasicBlock::iterator I = LLVMBB->begin(), E = LLVMBB->end(); I != E;++I)
3376 if (!I->use_empty() && !isa<PHINode>(I)) {
3377 std::map<const Value*, unsigned>::iterator VMI =FuncInfo.ValueMap.find(I);
3378 if (VMI != FuncInfo.ValueMap.end())
3379 UnorderedChains.push_back(
3380 CopyValueToVirtualRegister(SDL, I, VMI->second));
3383 // Handle PHI nodes in successor blocks. Emit code into the SelectionDAG to
3384 // ensure constants are generated when needed. Remember the virtual registers
3385 // that need to be added to the Machine PHI nodes as input. We cannot just
3386 // directly add them, because expansion might result in multiple MBB's for one
3387 // BB. As such, the start of the BB might correspond to a different MBB than
3391 // Emit constants only once even if used by multiple PHI nodes.
3392 std::map<Constant*, unsigned> ConstantsOut;
3394 // Check successor nodes PHI nodes that expect a constant to be available from
3396 TerminatorInst *TI = LLVMBB->getTerminator();
3397 for (unsigned succ = 0, e = TI->getNumSuccessors(); succ != e; ++succ) {
3398 BasicBlock *SuccBB = TI->getSuccessor(succ);
3399 MachineBasicBlock::iterator MBBI = FuncInfo.MBBMap[SuccBB]->begin();
3402 // At this point we know that there is a 1-1 correspondence between LLVM PHI
3403 // nodes and Machine PHI nodes, but the incoming operands have not been
3405 for (BasicBlock::iterator I = SuccBB->begin();
3406 (PN = dyn_cast<PHINode>(I)); ++I)
3407 if (!PN->use_empty()) {
3409 Value *PHIOp = PN->getIncomingValueForBlock(LLVMBB);
3410 if (Constant *C = dyn_cast<Constant>(PHIOp)) {
3411 unsigned &RegOut = ConstantsOut[C];
3413 RegOut = FuncInfo.CreateRegForValue(C);
3414 UnorderedChains.push_back(
3415 CopyValueToVirtualRegister(SDL, C, RegOut));
3419 Reg = FuncInfo.ValueMap[PHIOp];
3421 assert(isa<AllocaInst>(PHIOp) &&
3422 FuncInfo.StaticAllocaMap.count(cast<AllocaInst>(PHIOp)) &&
3423 "Didn't codegen value into a register!??");
3424 Reg = FuncInfo.CreateRegForValue(PHIOp);
3425 UnorderedChains.push_back(
3426 CopyValueToVirtualRegister(SDL, PHIOp, Reg));
3430 // Remember that this register needs to added to the machine PHI node as
3431 // the input for this MBB.
3432 MVT::ValueType VT = TLI.getValueType(PN->getType());
3433 unsigned NumElements;
3434 if (VT != MVT::Vector)
3435 NumElements = TLI.getNumElements(VT);
3437 MVT::ValueType VT1,VT2;
3439 TLI.getPackedTypeBreakdown(cast<PackedType>(PN->getType()),
3442 for (unsigned i = 0, e = NumElements; i != e; ++i)
3443 PHINodesToUpdate.push_back(std::make_pair(MBBI++, Reg+i));
3446 ConstantsOut.clear();
3448 // Turn all of the unordered chains into one factored node.
3449 if (!UnorderedChains.empty()) {
3450 SDOperand Root = SDL.getRoot();
3451 if (Root.getOpcode() != ISD::EntryToken) {
3452 unsigned i = 0, e = UnorderedChains.size();
3453 for (; i != e; ++i) {
3454 assert(UnorderedChains[i].Val->getNumOperands() > 1);
3455 if (UnorderedChains[i].Val->getOperand(0) == Root)
3456 break; // Don't add the root if we already indirectly depend on it.
3460 UnorderedChains.push_back(Root);
3462 DAG.setRoot(DAG.getNode(ISD::TokenFactor, MVT::Other, UnorderedChains));
3465 // Lower the terminator after the copies are emitted.
3466 SDL.visit(*LLVMBB->getTerminator());
3468 // Copy over any CaseBlock records that may now exist due to SwitchInst
3469 // lowering, as well as any jump table information.
3470 SwitchCases.clear();
3471 SwitchCases = SDL.SwitchCases;
3474 // Make sure the root of the DAG is up-to-date.
3475 DAG.setRoot(SDL.getRoot());
3478 void SelectionDAGISel::CodeGenAndEmitDAG(SelectionDAG &DAG) {
3479 // Run the DAG combiner in pre-legalize mode.
3482 DEBUG(std::cerr << "Lowered selection DAG:\n");
3485 // Second step, hack on the DAG until it only uses operations and types that
3486 // the target supports.
3489 DEBUG(std::cerr << "Legalized selection DAG:\n");
3492 // Run the DAG combiner in post-legalize mode.
3495 if (ViewISelDAGs) DAG.viewGraph();
3497 // Third, instruction select all of the operations to machine code, adding the
3498 // code to the MachineBasicBlock.
3499 InstructionSelectBasicBlock(DAG);
3501 DEBUG(std::cerr << "Selected machine code:\n");
3505 void SelectionDAGISel::SelectBasicBlock(BasicBlock *LLVMBB, MachineFunction &MF,
3506 FunctionLoweringInfo &FuncInfo) {
3507 std::vector<std::pair<MachineInstr*, unsigned> > PHINodesToUpdate;
3509 SelectionDAG DAG(TLI, MF, getAnalysisToUpdate<MachineDebugInfo>());
3512 // First step, lower LLVM code to some DAG. This DAG may use operations and
3513 // types that are not supported by the target.
3514 BuildSelectionDAG(DAG, LLVMBB, PHINodesToUpdate, FuncInfo);
3516 // Second step, emit the lowered DAG as machine code.
3517 CodeGenAndEmitDAG(DAG);
3520 // Next, now that we know what the last MBB the LLVM BB expanded is, update
3521 // PHI nodes in successors.
3522 if (SwitchCases.empty() && JT.Reg == 0) {
3523 for (unsigned i = 0, e = PHINodesToUpdate.size(); i != e; ++i) {
3524 MachineInstr *PHI = PHINodesToUpdate[i].first;
3525 assert(PHI->getOpcode() == TargetInstrInfo::PHI &&
3526 "This is not a machine PHI node that we are updating!");
3527 PHI->addRegOperand(PHINodesToUpdate[i].second);
3528 PHI->addMachineBasicBlockOperand(BB);
3533 // If the JumpTable record is filled in, then we need to emit a jump table.
3534 // Updating the PHI nodes is tricky in this case, since we need to determine
3535 // whether the PHI is a successor of the range check MBB or the jump table MBB
3537 assert(SwitchCases.empty() && "Cannot have jump table and lowered switch");
3538 SelectionDAG SDAG(TLI, MF, getAnalysisToUpdate<MachineDebugInfo>());
3540 SelectionDAGLowering SDL(SDAG, TLI, FuncInfo);
3541 MachineBasicBlock *RangeBB = BB;
3542 // Set the current basic block to the mbb we wish to insert the code into
3544 SDL.setCurrentBasicBlock(BB);
3546 SDL.visitJumpTable(JT);
3547 SDAG.setRoot(SDL.getRoot());
3548 CodeGenAndEmitDAG(SDAG);
3550 for (unsigned pi = 0, pe = PHINodesToUpdate.size(); pi != pe; ++pi) {
3551 MachineInstr *PHI = PHINodesToUpdate[pi].first;
3552 MachineBasicBlock *PHIBB = PHI->getParent();
3553 assert(PHI->getOpcode() == TargetInstrInfo::PHI &&
3554 "This is not a machine PHI node that we are updating!");
3555 if (PHIBB == JT.Default) {
3556 PHI->addRegOperand(PHINodesToUpdate[pi].second);
3557 PHI->addMachineBasicBlockOperand(RangeBB);
3559 if (BB->succ_end() != std::find(BB->succ_begin(),BB->succ_end(), PHIBB)) {
3560 PHI->addRegOperand(PHINodesToUpdate[pi].second);
3561 PHI->addMachineBasicBlockOperand(BB);
3567 // If we generated any switch lowering information, build and codegen any
3568 // additional DAGs necessary.
3569 for(unsigned i = 0, e = SwitchCases.size(); i != e; ++i) {
3570 SelectionDAG SDAG(TLI, MF, getAnalysisToUpdate<MachineDebugInfo>());
3572 SelectionDAGLowering SDL(SDAG, TLI, FuncInfo);
3573 // Set the current basic block to the mbb we wish to insert the code into
3574 BB = SwitchCases[i].ThisBB;
3575 SDL.setCurrentBasicBlock(BB);
3577 SDL.visitSwitchCase(SwitchCases[i]);
3578 SDAG.setRoot(SDL.getRoot());
3579 CodeGenAndEmitDAG(SDAG);
3580 // Iterate over the phi nodes, if there is a phi node in a successor of this
3581 // block (for instance, the default block), then add a pair of operands to
3582 // the phi node for this block, as if we were coming from the original
3583 // BB before switch expansion.
3584 for (unsigned pi = 0, pe = PHINodesToUpdate.size(); pi != pe; ++pi) {
3585 MachineInstr *PHI = PHINodesToUpdate[pi].first;
3586 MachineBasicBlock *PHIBB = PHI->getParent();
3587 assert(PHI->getOpcode() == TargetInstrInfo::PHI &&
3588 "This is not a machine PHI node that we are updating!");
3589 if (PHIBB == SwitchCases[i].LHSBB || PHIBB == SwitchCases[i].RHSBB) {
3590 PHI->addRegOperand(PHINodesToUpdate[pi].second);
3591 PHI->addMachineBasicBlockOperand(BB);
3597 //===----------------------------------------------------------------------===//
3598 /// ScheduleAndEmitDAG - Pick a safe ordering and emit instructions for each
3599 /// target node in the graph.
3600 void SelectionDAGISel::ScheduleAndEmitDAG(SelectionDAG &DAG) {
3601 if (ViewSchedDAGs) DAG.viewGraph();
3602 ScheduleDAG *SL = NULL;
3604 switch (ISHeuristic) {
3605 default: assert(0 && "Unrecognized scheduling heuristic");
3606 case defaultScheduling:
3607 if (TLI.getSchedulingPreference() == TargetLowering::SchedulingForLatency)
3608 SL = createTDListDAGScheduler(DAG, BB, CreateTargetHazardRecognizer());
3610 assert(TLI.getSchedulingPreference() ==
3611 TargetLowering::SchedulingForRegPressure && "Unknown sched type!");
3612 SL = createBURRListDAGScheduler(DAG, BB);
3616 SL = createBFS_DAGScheduler(DAG, BB);
3618 case simpleScheduling:
3619 SL = createSimpleDAGScheduler(false, DAG, BB);
3621 case simpleNoItinScheduling:
3622 SL = createSimpleDAGScheduler(true, DAG, BB);
3624 case listSchedulingBURR:
3625 SL = createBURRListDAGScheduler(DAG, BB);
3627 case listSchedulingTDRR:
3628 SL = createTDRRListDAGScheduler(DAG, BB);
3630 case listSchedulingTD:
3631 SL = createTDListDAGScheduler(DAG, BB, CreateTargetHazardRecognizer());
3638 HazardRecognizer *SelectionDAGISel::CreateTargetHazardRecognizer() {
3639 return new HazardRecognizer();
3642 /// SelectInlineAsmMemoryOperands - Calls to this are automatically generated
3643 /// by tblgen. Others should not call it.
3644 void SelectionDAGISel::
3645 SelectInlineAsmMemoryOperands(std::vector<SDOperand> &Ops, SelectionDAG &DAG) {
3646 std::vector<SDOperand> InOps;
3647 std::swap(InOps, Ops);
3649 Ops.push_back(InOps[0]); // input chain.
3650 Ops.push_back(InOps[1]); // input asm string.
3652 unsigned i = 2, e = InOps.size();
3653 if (InOps[e-1].getValueType() == MVT::Flag)
3654 --e; // Don't process a flag operand if it is here.
3657 unsigned Flags = cast<ConstantSDNode>(InOps[i])->getValue();
3658 if ((Flags & 7) != 4 /*MEM*/) {
3659 // Just skip over this operand, copying the operands verbatim.
3660 Ops.insert(Ops.end(), InOps.begin()+i, InOps.begin()+i+(Flags >> 3) + 1);
3661 i += (Flags >> 3) + 1;
3663 assert((Flags >> 3) == 1 && "Memory operand with multiple values?");
3664 // Otherwise, this is a memory operand. Ask the target to select it.
3665 std::vector<SDOperand> SelOps;
3666 if (SelectInlineAsmMemoryOperand(InOps[i+1], 'm', SelOps, DAG)) {
3667 std::cerr << "Could not match memory address. Inline asm failure!\n";
3671 // Add this to the output node.
3672 Ops.push_back(DAG.getConstant(4/*MEM*/ | (SelOps.size() << 3), MVT::i32));
3673 Ops.insert(Ops.end(), SelOps.begin(), SelOps.end());
3678 // Add the flag input back if present.
3679 if (e != InOps.size())
3680 Ops.push_back(InOps.back());