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/ADT/BitVector.h"
16 #include "llvm/Analysis/AliasAnalysis.h"
17 #include "llvm/CodeGen/SelectionDAGISel.h"
18 #include "llvm/CodeGen/ScheduleDAG.h"
19 #include "llvm/Constants.h"
20 #include "llvm/CallingConv.h"
21 #include "llvm/DerivedTypes.h"
22 #include "llvm/Function.h"
23 #include "llvm/GlobalVariable.h"
24 #include "llvm/InlineAsm.h"
25 #include "llvm/Instructions.h"
26 #include "llvm/Intrinsics.h"
27 #include "llvm/IntrinsicInst.h"
28 #include "llvm/ParameterAttributes.h"
29 #include "llvm/CodeGen/MachineModuleInfo.h"
30 #include "llvm/CodeGen/MachineFunction.h"
31 #include "llvm/CodeGen/MachineFrameInfo.h"
32 #include "llvm/CodeGen/MachineJumpTableInfo.h"
33 #include "llvm/CodeGen/MachineInstrBuilder.h"
34 #include "llvm/CodeGen/SchedulerRegistry.h"
35 #include "llvm/CodeGen/SelectionDAG.h"
36 #include "llvm/CodeGen/SSARegMap.h"
37 #include "llvm/Target/MRegisterInfo.h"
38 #include "llvm/Target/TargetData.h"
39 #include "llvm/Target/TargetFrameInfo.h"
40 #include "llvm/Target/TargetInstrInfo.h"
41 #include "llvm/Target/TargetLowering.h"
42 #include "llvm/Target/TargetMachine.h"
43 #include "llvm/Target/TargetOptions.h"
44 #include "llvm/Support/MathExtras.h"
45 #include "llvm/Support/Debug.h"
46 #include "llvm/Support/Compiler.h"
52 ViewISelDAGs("view-isel-dags", cl::Hidden,
53 cl::desc("Pop up a window to show isel dags as they are selected"));
55 ViewSchedDAGs("view-sched-dags", cl::Hidden,
56 cl::desc("Pop up a window to show sched dags as they are processed"));
58 static const bool ViewISelDAGs = 0, ViewSchedDAGs = 0;
61 //===---------------------------------------------------------------------===//
63 /// RegisterScheduler class - Track the registration of instruction schedulers.
65 //===---------------------------------------------------------------------===//
66 MachinePassRegistry RegisterScheduler::Registry;
68 //===---------------------------------------------------------------------===//
70 /// ISHeuristic command line option for instruction schedulers.
72 //===---------------------------------------------------------------------===//
74 cl::opt<RegisterScheduler::FunctionPassCtor, false,
75 RegisterPassParser<RegisterScheduler> >
77 cl::init(&createDefaultScheduler),
78 cl::desc("Instruction schedulers available:"));
80 static RegisterScheduler
81 defaultListDAGScheduler("default", " Best scheduler for the target",
82 createDefaultScheduler);
85 namespace { struct AsmOperandInfo; }
88 /// RegsForValue - This struct represents the physical registers that a
89 /// particular value is assigned and the type information about the value.
90 /// This is needed because values can be promoted into larger registers and
91 /// expanded into multiple smaller registers than the value.
92 struct VISIBILITY_HIDDEN RegsForValue {
93 /// Regs - This list holds the register (for legal and promoted values)
94 /// or register set (for expanded values) that the value should be assigned
96 std::vector<unsigned> Regs;
98 /// RegVT - The value type of each register.
100 MVT::ValueType RegVT;
102 /// ValueVT - The value type of the LLVM value, which may be promoted from
103 /// RegVT or made from merging the two expanded parts.
104 MVT::ValueType ValueVT;
106 RegsForValue() : RegVT(MVT::Other), ValueVT(MVT::Other) {}
108 RegsForValue(unsigned Reg, MVT::ValueType regvt, MVT::ValueType valuevt)
109 : RegVT(regvt), ValueVT(valuevt) {
112 RegsForValue(const std::vector<unsigned> ®s,
113 MVT::ValueType regvt, MVT::ValueType valuevt)
114 : Regs(regs), RegVT(regvt), ValueVT(valuevt) {
117 /// getCopyFromRegs - Emit a series of CopyFromReg nodes that copies from
118 /// this value and returns the result as a ValueVT value. This uses
119 /// Chain/Flag as the input and updates them for the output Chain/Flag.
120 /// If the Flag pointer is NULL, no flag is used.
121 SDOperand getCopyFromRegs(SelectionDAG &DAG,
122 SDOperand &Chain, SDOperand *Flag) const;
124 /// getCopyToRegs - Emit a series of CopyToReg nodes that copies the
125 /// specified value into the registers specified by this object. This uses
126 /// Chain/Flag as the input and updates them for the output Chain/Flag.
127 /// If the Flag pointer is NULL, no flag is used.
128 void getCopyToRegs(SDOperand Val, SelectionDAG &DAG,
129 SDOperand &Chain, SDOperand *Flag) const;
131 /// AddInlineAsmOperands - Add this value to the specified inlineasm node
132 /// operand list. This adds the code marker and includes the number of
133 /// values added into it.
134 void AddInlineAsmOperands(unsigned Code, SelectionDAG &DAG,
135 std::vector<SDOperand> &Ops) const;
140 //===--------------------------------------------------------------------===//
141 /// createDefaultScheduler - This creates an instruction scheduler appropriate
143 ScheduleDAG* createDefaultScheduler(SelectionDAGISel *IS,
145 MachineBasicBlock *BB) {
146 TargetLowering &TLI = IS->getTargetLowering();
148 if (TLI.getSchedulingPreference() == TargetLowering::SchedulingForLatency) {
149 return createTDListDAGScheduler(IS, DAG, BB);
151 assert(TLI.getSchedulingPreference() ==
152 TargetLowering::SchedulingForRegPressure && "Unknown sched type!");
153 return createBURRListDAGScheduler(IS, DAG, BB);
158 //===--------------------------------------------------------------------===//
159 /// FunctionLoweringInfo - This contains information that is global to a
160 /// function that is used when lowering a region of the function.
161 class FunctionLoweringInfo {
168 FunctionLoweringInfo(TargetLowering &TLI, Function &Fn,MachineFunction &MF);
170 /// MBBMap - A mapping from LLVM basic blocks to their machine code entry.
171 std::map<const BasicBlock*, MachineBasicBlock *> MBBMap;
173 /// ValueMap - Since we emit code for the function a basic block at a time,
174 /// we must remember which virtual registers hold the values for
175 /// cross-basic-block values.
176 DenseMap<const Value*, unsigned> ValueMap;
178 /// StaticAllocaMap - Keep track of frame indices for fixed sized allocas in
179 /// the entry block. This allows the allocas to be efficiently referenced
180 /// anywhere in the function.
181 std::map<const AllocaInst*, int> StaticAllocaMap;
184 SmallSet<Instruction*, 8> CatchInfoLost;
185 SmallSet<Instruction*, 8> CatchInfoFound;
188 unsigned MakeReg(MVT::ValueType VT) {
189 return RegMap->createVirtualRegister(TLI.getRegClassFor(VT));
192 /// isExportedInst - Return true if the specified value is an instruction
193 /// exported from its block.
194 bool isExportedInst(const Value *V) {
195 return ValueMap.count(V);
198 unsigned CreateRegForValue(const Value *V);
200 unsigned InitializeRegForValue(const Value *V) {
201 unsigned &R = ValueMap[V];
202 assert(R == 0 && "Already initialized this value register!");
203 return R = CreateRegForValue(V);
208 /// isFilterOrSelector - Return true if this instruction is a call to the
209 /// eh.filter or the eh.selector intrinsic.
210 static bool isFilterOrSelector(Instruction *I) {
211 if (IntrinsicInst *II = dyn_cast<IntrinsicInst>(I))
212 return II->getIntrinsicID() == Intrinsic::eh_selector
213 || II->getIntrinsicID() == Intrinsic::eh_filter;
217 /// isUsedOutsideOfDefiningBlock - Return true if this instruction is used by
218 /// PHI nodes or outside of the basic block that defines it, or used by a
219 /// switch instruction, which may expand to multiple basic blocks.
220 static bool isUsedOutsideOfDefiningBlock(Instruction *I) {
221 if (isa<PHINode>(I)) return true;
222 BasicBlock *BB = I->getParent();
223 for (Value::use_iterator UI = I->use_begin(), E = I->use_end(); UI != E; ++UI)
224 if (cast<Instruction>(*UI)->getParent() != BB || isa<PHINode>(*UI) ||
225 // FIXME: Remove switchinst special case.
226 isa<SwitchInst>(*UI))
231 /// isOnlyUsedInEntryBlock - If the specified argument is only used in the
232 /// entry block, return true. This includes arguments used by switches, since
233 /// the switch may expand into multiple basic blocks.
234 static bool isOnlyUsedInEntryBlock(Argument *A) {
235 BasicBlock *Entry = A->getParent()->begin();
236 for (Value::use_iterator UI = A->use_begin(), E = A->use_end(); UI != E; ++UI)
237 if (cast<Instruction>(*UI)->getParent() != Entry || isa<SwitchInst>(*UI))
238 return false; // Use not in entry block.
242 FunctionLoweringInfo::FunctionLoweringInfo(TargetLowering &tli,
243 Function &fn, MachineFunction &mf)
244 : TLI(tli), Fn(fn), MF(mf), RegMap(MF.getSSARegMap()) {
246 // Create a vreg for each argument register that is not dead and is used
247 // outside of the entry block for the function.
248 for (Function::arg_iterator AI = Fn.arg_begin(), E = Fn.arg_end();
250 if (!isOnlyUsedInEntryBlock(AI))
251 InitializeRegForValue(AI);
253 // Initialize the mapping of values to registers. This is only set up for
254 // instruction values that are used outside of the block that defines
256 Function::iterator BB = Fn.begin(), EB = Fn.end();
257 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I)
258 if (AllocaInst *AI = dyn_cast<AllocaInst>(I))
259 if (ConstantInt *CUI = dyn_cast<ConstantInt>(AI->getArraySize())) {
260 const Type *Ty = AI->getAllocatedType();
261 uint64_t TySize = TLI.getTargetData()->getTypeSize(Ty);
263 std::max((unsigned)TLI.getTargetData()->getPrefTypeAlignment(Ty),
266 TySize *= CUI->getZExtValue(); // Get total allocated size.
267 if (TySize == 0) TySize = 1; // Don't create zero-sized stack objects.
268 StaticAllocaMap[AI] =
269 MF.getFrameInfo()->CreateStackObject(TySize, Align);
272 for (; BB != EB; ++BB)
273 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I)
274 if (!I->use_empty() && isUsedOutsideOfDefiningBlock(I))
275 if (!isa<AllocaInst>(I) ||
276 !StaticAllocaMap.count(cast<AllocaInst>(I)))
277 InitializeRegForValue(I);
279 // Create an initial MachineBasicBlock for each LLVM BasicBlock in F. This
280 // also creates the initial PHI MachineInstrs, though none of the input
281 // operands are populated.
282 for (BB = Fn.begin(), EB = Fn.end(); BB != EB; ++BB) {
283 MachineBasicBlock *MBB = new MachineBasicBlock(BB);
285 MF.getBasicBlockList().push_back(MBB);
287 // Create Machine PHI nodes for LLVM PHI nodes, lowering them as
290 for (BasicBlock::iterator I = BB->begin();(PN = dyn_cast<PHINode>(I)); ++I){
291 if (PN->use_empty()) continue;
293 MVT::ValueType VT = TLI.getValueType(PN->getType());
294 unsigned NumRegisters = TLI.getNumRegisters(VT);
295 unsigned PHIReg = ValueMap[PN];
296 assert(PHIReg && "PHI node does not have an assigned virtual register!");
297 const TargetInstrInfo *TII = TLI.getTargetMachine().getInstrInfo();
298 for (unsigned i = 0; i != NumRegisters; ++i)
299 BuildMI(MBB, TII->get(TargetInstrInfo::PHI), PHIReg+i);
304 /// CreateRegForValue - Allocate the appropriate number of virtual registers of
305 /// the correctly promoted or expanded types. Assign these registers
306 /// consecutive vreg numbers and return the first assigned number.
307 unsigned FunctionLoweringInfo::CreateRegForValue(const Value *V) {
308 MVT::ValueType VT = TLI.getValueType(V->getType());
310 unsigned NumRegisters = TLI.getNumRegisters(VT);
311 MVT::ValueType RegisterVT = TLI.getRegisterType(VT);
313 unsigned R = MakeReg(RegisterVT);
314 for (unsigned i = 1; i != NumRegisters; ++i)
320 //===----------------------------------------------------------------------===//
321 /// SelectionDAGLowering - This is the common target-independent lowering
322 /// implementation that is parameterized by a TargetLowering object.
323 /// Also, targets can overload any lowering method.
326 class SelectionDAGLowering {
327 MachineBasicBlock *CurMBB;
329 DenseMap<const Value*, SDOperand> NodeMap;
331 /// PendingLoads - Loads are not emitted to the program immediately. We bunch
332 /// them up and then emit token factor nodes when possible. This allows us to
333 /// get simple disambiguation between loads without worrying about alias
335 std::vector<SDOperand> PendingLoads;
337 /// Case - A struct to record the Value for a switch case, and the
338 /// case's target basic block.
342 MachineBasicBlock* BB;
344 Case() : Low(0), High(0), BB(0) { }
345 Case(Constant* low, Constant* high, MachineBasicBlock* bb) :
346 Low(low), High(high), BB(bb) { }
347 uint64_t size() const {
348 uint64_t rHigh = cast<ConstantInt>(High)->getSExtValue();
349 uint64_t rLow = cast<ConstantInt>(Low)->getSExtValue();
350 return (rHigh - rLow + 1ULL);
356 MachineBasicBlock* BB;
359 CaseBits(uint64_t mask, MachineBasicBlock* bb, unsigned bits):
360 Mask(mask), BB(bb), Bits(bits) { }
363 typedef std::vector<Case> CaseVector;
364 typedef std::vector<CaseBits> CaseBitsVector;
365 typedef CaseVector::iterator CaseItr;
366 typedef std::pair<CaseItr, CaseItr> CaseRange;
368 /// CaseRec - A struct with ctor used in lowering switches to a binary tree
369 /// of conditional branches.
371 CaseRec(MachineBasicBlock *bb, Constant *lt, Constant *ge, CaseRange r) :
372 CaseBB(bb), LT(lt), GE(ge), Range(r) {}
374 /// CaseBB - The MBB in which to emit the compare and branch
375 MachineBasicBlock *CaseBB;
376 /// LT, GE - If nonzero, we know the current case value must be less-than or
377 /// greater-than-or-equal-to these Constants.
380 /// Range - A pair of iterators representing the range of case values to be
381 /// processed at this point in the binary search tree.
385 typedef std::vector<CaseRec> CaseRecVector;
387 /// The comparison function for sorting the switch case values in the vector.
388 /// WARNING: Case ranges should be disjoint!
390 bool operator () (const Case& C1, const Case& C2) {
391 assert(isa<ConstantInt>(C1.Low) && isa<ConstantInt>(C2.High));
392 const ConstantInt* CI1 = cast<const ConstantInt>(C1.Low);
393 const ConstantInt* CI2 = cast<const ConstantInt>(C2.High);
394 return CI1->getValue().slt(CI2->getValue());
399 bool operator () (const CaseBits& C1, const CaseBits& C2) {
400 return C1.Bits > C2.Bits;
404 unsigned Clusterify(CaseVector& Cases, const SwitchInst &SI);
407 // TLI - This is information that describes the available target features we
408 // need for lowering. This indicates when operations are unavailable,
409 // implemented with a libcall, etc.
412 const TargetData *TD;
414 /// SwitchCases - Vector of CaseBlock structures used to communicate
415 /// SwitchInst code generation information.
416 std::vector<SelectionDAGISel::CaseBlock> SwitchCases;
417 /// JTCases - Vector of JumpTable structures used to communicate
418 /// SwitchInst code generation information.
419 std::vector<SelectionDAGISel::JumpTableBlock> JTCases;
420 std::vector<SelectionDAGISel::BitTestBlock> BitTestCases;
422 /// FuncInfo - Information about the function as a whole.
424 FunctionLoweringInfo &FuncInfo;
426 SelectionDAGLowering(SelectionDAG &dag, TargetLowering &tli,
427 FunctionLoweringInfo &funcinfo)
428 : TLI(tli), DAG(dag), TD(DAG.getTarget().getTargetData()),
432 /// getRoot - Return the current virtual root of the Selection DAG.
434 SDOperand getRoot() {
435 if (PendingLoads.empty())
436 return DAG.getRoot();
438 if (PendingLoads.size() == 1) {
439 SDOperand Root = PendingLoads[0];
441 PendingLoads.clear();
445 // Otherwise, we have to make a token factor node.
446 SDOperand Root = DAG.getNode(ISD::TokenFactor, MVT::Other,
447 &PendingLoads[0], PendingLoads.size());
448 PendingLoads.clear();
453 SDOperand CopyValueToVirtualRegister(Value *V, unsigned Reg);
455 void visit(Instruction &I) { visit(I.getOpcode(), I); }
457 void visit(unsigned Opcode, User &I) {
458 // Note: this doesn't use InstVisitor, because it has to work with
459 // ConstantExpr's in addition to instructions.
461 default: assert(0 && "Unknown instruction type encountered!");
463 // Build the switch statement using the Instruction.def file.
464 #define HANDLE_INST(NUM, OPCODE, CLASS) \
465 case Instruction::OPCODE:return visit##OPCODE((CLASS&)I);
466 #include "llvm/Instruction.def"
470 void setCurrentBasicBlock(MachineBasicBlock *MBB) { CurMBB = MBB; }
472 SDOperand getLoadFrom(const Type *Ty, SDOperand Ptr,
473 const Value *SV, SDOperand Root,
474 bool isVolatile, unsigned Alignment);
476 SDOperand getIntPtrConstant(uint64_t Val) {
477 return DAG.getConstant(Val, TLI.getPointerTy());
480 SDOperand getValue(const Value *V);
482 void setValue(const Value *V, SDOperand NewN) {
483 SDOperand &N = NodeMap[V];
484 assert(N.Val == 0 && "Already set a value for this node!");
488 void GetRegistersForValue(AsmOperandInfo &OpInfo, bool HasEarlyClobber,
489 std::set<unsigned> &OutputRegs,
490 std::set<unsigned> &InputRegs);
492 void FindMergedConditions(Value *Cond, MachineBasicBlock *TBB,
493 MachineBasicBlock *FBB, MachineBasicBlock *CurBB,
495 bool isExportableFromCurrentBlock(Value *V, const BasicBlock *FromBB);
496 void ExportFromCurrentBlock(Value *V);
497 void LowerCallTo(Instruction &I,
498 const Type *CalledValueTy, unsigned CallingConv,
499 bool IsTailCall, SDOperand Callee, unsigned OpIdx,
500 MachineBasicBlock *LandingPad = NULL);
502 // Terminator instructions.
503 void visitRet(ReturnInst &I);
504 void visitBr(BranchInst &I);
505 void visitSwitch(SwitchInst &I);
506 void visitUnreachable(UnreachableInst &I) { /* noop */ }
508 // Helpers for visitSwitch
509 bool handleSmallSwitchRange(CaseRec& CR,
510 CaseRecVector& WorkList,
512 MachineBasicBlock* Default);
513 bool handleJTSwitchCase(CaseRec& CR,
514 CaseRecVector& WorkList,
516 MachineBasicBlock* Default);
517 bool handleBTSplitSwitchCase(CaseRec& CR,
518 CaseRecVector& WorkList,
520 MachineBasicBlock* Default);
521 bool handleBitTestsSwitchCase(CaseRec& CR,
522 CaseRecVector& WorkList,
524 MachineBasicBlock* Default);
525 void visitSwitchCase(SelectionDAGISel::CaseBlock &CB);
526 void visitBitTestHeader(SelectionDAGISel::BitTestBlock &B);
527 void visitBitTestCase(MachineBasicBlock* NextMBB,
529 SelectionDAGISel::BitTestCase &B);
530 void visitJumpTable(SelectionDAGISel::JumpTable &JT);
531 void visitJumpTableHeader(SelectionDAGISel::JumpTable &JT,
532 SelectionDAGISel::JumpTableHeader &JTH);
534 // These all get lowered before this pass.
535 void visitInvoke(InvokeInst &I);
536 void visitUnwind(UnwindInst &I);
538 void visitBinary(User &I, unsigned OpCode);
539 void visitShift(User &I, unsigned Opcode);
540 void visitAdd(User &I) {
541 if (I.getType()->isFPOrFPVector())
542 visitBinary(I, ISD::FADD);
544 visitBinary(I, ISD::ADD);
546 void visitSub(User &I);
547 void visitMul(User &I) {
548 if (I.getType()->isFPOrFPVector())
549 visitBinary(I, ISD::FMUL);
551 visitBinary(I, ISD::MUL);
553 void visitURem(User &I) { visitBinary(I, ISD::UREM); }
554 void visitSRem(User &I) { visitBinary(I, ISD::SREM); }
555 void visitFRem(User &I) { visitBinary(I, ISD::FREM); }
556 void visitUDiv(User &I) { visitBinary(I, ISD::UDIV); }
557 void visitSDiv(User &I) { visitBinary(I, ISD::SDIV); }
558 void visitFDiv(User &I) { visitBinary(I, ISD::FDIV); }
559 void visitAnd (User &I) { visitBinary(I, ISD::AND); }
560 void visitOr (User &I) { visitBinary(I, ISD::OR); }
561 void visitXor (User &I) { visitBinary(I, ISD::XOR); }
562 void visitShl (User &I) { visitShift(I, ISD::SHL); }
563 void visitLShr(User &I) { visitShift(I, ISD::SRL); }
564 void visitAShr(User &I) { visitShift(I, ISD::SRA); }
565 void visitICmp(User &I);
566 void visitFCmp(User &I);
567 // Visit the conversion instructions
568 void visitTrunc(User &I);
569 void visitZExt(User &I);
570 void visitSExt(User &I);
571 void visitFPTrunc(User &I);
572 void visitFPExt(User &I);
573 void visitFPToUI(User &I);
574 void visitFPToSI(User &I);
575 void visitUIToFP(User &I);
576 void visitSIToFP(User &I);
577 void visitPtrToInt(User &I);
578 void visitIntToPtr(User &I);
579 void visitBitCast(User &I);
581 void visitExtractElement(User &I);
582 void visitInsertElement(User &I);
583 void visitShuffleVector(User &I);
585 void visitGetElementPtr(User &I);
586 void visitSelect(User &I);
588 void visitMalloc(MallocInst &I);
589 void visitFree(FreeInst &I);
590 void visitAlloca(AllocaInst &I);
591 void visitLoad(LoadInst &I);
592 void visitStore(StoreInst &I);
593 void visitPHI(PHINode &I) { } // PHI nodes are handled specially.
594 void visitCall(CallInst &I);
595 void visitInlineAsm(CallInst &I);
596 const char *visitIntrinsicCall(CallInst &I, unsigned Intrinsic);
597 void visitTargetIntrinsic(CallInst &I, unsigned Intrinsic);
599 void visitVAStart(CallInst &I);
600 void visitVAArg(VAArgInst &I);
601 void visitVAEnd(CallInst &I);
602 void visitVACopy(CallInst &I);
604 void visitMemIntrinsic(CallInst &I, unsigned Op);
606 void visitUserOp1(Instruction &I) {
607 assert(0 && "UserOp1 should not exist at instruction selection time!");
610 void visitUserOp2(Instruction &I) {
611 assert(0 && "UserOp2 should not exist at instruction selection time!");
615 } // end namespace llvm
617 SDOperand SelectionDAGLowering::getValue(const Value *V) {
618 SDOperand &N = NodeMap[V];
621 const Type *VTy = V->getType();
622 MVT::ValueType VT = TLI.getValueType(VTy);
623 if (Constant *C = const_cast<Constant*>(dyn_cast<Constant>(V))) {
624 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(C)) {
625 visit(CE->getOpcode(), *CE);
626 SDOperand N1 = NodeMap[V];
627 assert(N1.Val && "visit didn't populate the ValueMap!");
629 } else if (GlobalValue *GV = dyn_cast<GlobalValue>(C)) {
630 return N = DAG.getGlobalAddress(GV, VT);
631 } else if (isa<ConstantPointerNull>(C)) {
632 return N = DAG.getConstant(0, TLI.getPointerTy());
633 } else if (isa<UndefValue>(C)) {
634 if (!isa<VectorType>(VTy))
635 return N = DAG.getNode(ISD::UNDEF, VT);
637 // Create a BUILD_VECTOR of undef nodes.
638 const VectorType *PTy = cast<VectorType>(VTy);
639 unsigned NumElements = PTy->getNumElements();
640 MVT::ValueType PVT = TLI.getValueType(PTy->getElementType());
642 SmallVector<SDOperand, 8> Ops;
643 Ops.assign(NumElements, DAG.getNode(ISD::UNDEF, PVT));
645 // Create a VConstant node with generic Vector type.
646 MVT::ValueType VT = MVT::getVectorType(PVT, NumElements);
647 return N = DAG.getNode(ISD::BUILD_VECTOR, VT,
648 &Ops[0], Ops.size());
649 } else if (ConstantFP *CFP = dyn_cast<ConstantFP>(C)) {
650 return N = DAG.getConstantFP(CFP->getValue(), VT);
651 } else if (const VectorType *PTy = dyn_cast<VectorType>(VTy)) {
652 unsigned NumElements = PTy->getNumElements();
653 MVT::ValueType PVT = TLI.getValueType(PTy->getElementType());
655 // Now that we know the number and type of the elements, push a
656 // Constant or ConstantFP node onto the ops list for each element of
657 // the packed constant.
658 SmallVector<SDOperand, 8> Ops;
659 if (ConstantVector *CP = dyn_cast<ConstantVector>(C)) {
660 for (unsigned i = 0; i != NumElements; ++i)
661 Ops.push_back(getValue(CP->getOperand(i)));
663 assert(isa<ConstantAggregateZero>(C) && "Unknown packed constant!");
665 if (MVT::isFloatingPoint(PVT))
666 Op = DAG.getConstantFP(0, PVT);
668 Op = DAG.getConstant(0, PVT);
669 Ops.assign(NumElements, Op);
672 // Create a BUILD_VECTOR node.
673 MVT::ValueType VT = MVT::getVectorType(PVT, NumElements);
674 return NodeMap[V] = DAG.getNode(ISD::BUILD_VECTOR, VT, &Ops[0],
677 // Canonicalize all constant ints to be unsigned.
678 return N = DAG.getConstant(cast<ConstantInt>(C)->getZExtValue(),VT);
682 if (const AllocaInst *AI = dyn_cast<AllocaInst>(V)) {
683 std::map<const AllocaInst*, int>::iterator SI =
684 FuncInfo.StaticAllocaMap.find(AI);
685 if (SI != FuncInfo.StaticAllocaMap.end())
686 return DAG.getFrameIndex(SI->second, TLI.getPointerTy());
689 unsigned InReg = FuncInfo.ValueMap[V];
690 assert(InReg && "Value not in map!");
692 MVT::ValueType RegisterVT = TLI.getRegisterType(VT);
693 unsigned NumRegs = TLI.getNumRegisters(VT);
695 std::vector<unsigned> Regs(NumRegs);
696 for (unsigned i = 0; i != NumRegs; ++i)
699 RegsForValue RFV(Regs, RegisterVT, VT);
700 SDOperand Chain = DAG.getEntryNode();
702 return RFV.getCopyFromRegs(DAG, Chain, NULL);
706 void SelectionDAGLowering::visitRet(ReturnInst &I) {
707 if (I.getNumOperands() == 0) {
708 DAG.setRoot(DAG.getNode(ISD::RET, MVT::Other, getRoot()));
711 SmallVector<SDOperand, 8> NewValues;
712 NewValues.push_back(getRoot());
713 for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i) {
714 SDOperand RetOp = getValue(I.getOperand(i));
716 // If this is an integer return value, we need to promote it ourselves to
717 // the full width of a register, since LegalizeOp will use ANY_EXTEND rather
719 // FIXME: C calling convention requires the return type to be promoted to
720 // at least 32-bit. But this is not necessary for non-C calling conventions.
721 if (MVT::isInteger(RetOp.getValueType()) &&
722 RetOp.getValueType() < MVT::i64) {
723 MVT::ValueType TmpVT;
724 if (TLI.getTypeAction(MVT::i32) == TargetLowering::Promote)
725 TmpVT = TLI.getTypeToTransformTo(MVT::i32);
728 const FunctionType *FTy = I.getParent()->getParent()->getFunctionType();
729 const ParamAttrsList *Attrs = FTy->getParamAttrs();
730 ISD::NodeType ExtendKind = ISD::ANY_EXTEND;
731 if (Attrs && Attrs->paramHasAttr(0, ParamAttr::SExt))
732 ExtendKind = ISD::SIGN_EXTEND;
733 if (Attrs && Attrs->paramHasAttr(0, ParamAttr::ZExt))
734 ExtendKind = ISD::ZERO_EXTEND;
735 RetOp = DAG.getNode(ExtendKind, TmpVT, RetOp);
737 NewValues.push_back(RetOp);
738 NewValues.push_back(DAG.getConstant(false, MVT::i32));
740 DAG.setRoot(DAG.getNode(ISD::RET, MVT::Other,
741 &NewValues[0], NewValues.size()));
744 /// ExportFromCurrentBlock - If this condition isn't known to be exported from
745 /// the current basic block, add it to ValueMap now so that we'll get a
747 void SelectionDAGLowering::ExportFromCurrentBlock(Value *V) {
748 // No need to export constants.
749 if (!isa<Instruction>(V) && !isa<Argument>(V)) return;
752 if (FuncInfo.isExportedInst(V)) return;
754 unsigned Reg = FuncInfo.InitializeRegForValue(V);
755 PendingLoads.push_back(CopyValueToVirtualRegister(V, Reg));
758 bool SelectionDAGLowering::isExportableFromCurrentBlock(Value *V,
759 const BasicBlock *FromBB) {
760 // The operands of the setcc have to be in this block. We don't know
761 // how to export them from some other block.
762 if (Instruction *VI = dyn_cast<Instruction>(V)) {
763 // Can export from current BB.
764 if (VI->getParent() == FromBB)
767 // Is already exported, noop.
768 return FuncInfo.isExportedInst(V);
771 // If this is an argument, we can export it if the BB is the entry block or
772 // if it is already exported.
773 if (isa<Argument>(V)) {
774 if (FromBB == &FromBB->getParent()->getEntryBlock())
777 // Otherwise, can only export this if it is already exported.
778 return FuncInfo.isExportedInst(V);
781 // Otherwise, constants can always be exported.
785 static bool InBlock(const Value *V, const BasicBlock *BB) {
786 if (const Instruction *I = dyn_cast<Instruction>(V))
787 return I->getParent() == BB;
791 /// FindMergedConditions - If Cond is an expression like
792 void SelectionDAGLowering::FindMergedConditions(Value *Cond,
793 MachineBasicBlock *TBB,
794 MachineBasicBlock *FBB,
795 MachineBasicBlock *CurBB,
797 // If this node is not part of the or/and tree, emit it as a branch.
798 Instruction *BOp = dyn_cast<Instruction>(Cond);
800 if (!BOp || !(isa<BinaryOperator>(BOp) || isa<CmpInst>(BOp)) ||
801 (unsigned)BOp->getOpcode() != Opc || !BOp->hasOneUse() ||
802 BOp->getParent() != CurBB->getBasicBlock() ||
803 !InBlock(BOp->getOperand(0), CurBB->getBasicBlock()) ||
804 !InBlock(BOp->getOperand(1), CurBB->getBasicBlock())) {
805 const BasicBlock *BB = CurBB->getBasicBlock();
807 // If the leaf of the tree is a comparison, merge the condition into
809 if ((isa<ICmpInst>(Cond) || isa<FCmpInst>(Cond)) &&
810 // The operands of the cmp have to be in this block. We don't know
811 // how to export them from some other block. If this is the first block
812 // of the sequence, no exporting is needed.
814 (isExportableFromCurrentBlock(BOp->getOperand(0), BB) &&
815 isExportableFromCurrentBlock(BOp->getOperand(1), BB)))) {
816 BOp = cast<Instruction>(Cond);
817 ISD::CondCode Condition;
818 if (ICmpInst *IC = dyn_cast<ICmpInst>(Cond)) {
819 switch (IC->getPredicate()) {
820 default: assert(0 && "Unknown icmp predicate opcode!");
821 case ICmpInst::ICMP_EQ: Condition = ISD::SETEQ; break;
822 case ICmpInst::ICMP_NE: Condition = ISD::SETNE; break;
823 case ICmpInst::ICMP_SLE: Condition = ISD::SETLE; break;
824 case ICmpInst::ICMP_ULE: Condition = ISD::SETULE; break;
825 case ICmpInst::ICMP_SGE: Condition = ISD::SETGE; break;
826 case ICmpInst::ICMP_UGE: Condition = ISD::SETUGE; break;
827 case ICmpInst::ICMP_SLT: Condition = ISD::SETLT; break;
828 case ICmpInst::ICMP_ULT: Condition = ISD::SETULT; break;
829 case ICmpInst::ICMP_SGT: Condition = ISD::SETGT; break;
830 case ICmpInst::ICMP_UGT: Condition = ISD::SETUGT; break;
832 } else if (FCmpInst *FC = dyn_cast<FCmpInst>(Cond)) {
833 ISD::CondCode FPC, FOC;
834 switch (FC->getPredicate()) {
835 default: assert(0 && "Unknown fcmp predicate opcode!");
836 case FCmpInst::FCMP_FALSE: FOC = FPC = ISD::SETFALSE; break;
837 case FCmpInst::FCMP_OEQ: FOC = ISD::SETEQ; FPC = ISD::SETOEQ; break;
838 case FCmpInst::FCMP_OGT: FOC = ISD::SETGT; FPC = ISD::SETOGT; break;
839 case FCmpInst::FCMP_OGE: FOC = ISD::SETGE; FPC = ISD::SETOGE; break;
840 case FCmpInst::FCMP_OLT: FOC = ISD::SETLT; FPC = ISD::SETOLT; break;
841 case FCmpInst::FCMP_OLE: FOC = ISD::SETLE; FPC = ISD::SETOLE; break;
842 case FCmpInst::FCMP_ONE: FOC = ISD::SETNE; FPC = ISD::SETONE; break;
843 case FCmpInst::FCMP_ORD: FOC = ISD::SETEQ; FPC = ISD::SETO; break;
844 case FCmpInst::FCMP_UNO: FOC = ISD::SETNE; FPC = ISD::SETUO; break;
845 case FCmpInst::FCMP_UEQ: FOC = ISD::SETEQ; FPC = ISD::SETUEQ; break;
846 case FCmpInst::FCMP_UGT: FOC = ISD::SETGT; FPC = ISD::SETUGT; break;
847 case FCmpInst::FCMP_UGE: FOC = ISD::SETGE; FPC = ISD::SETUGE; break;
848 case FCmpInst::FCMP_ULT: FOC = ISD::SETLT; FPC = ISD::SETULT; break;
849 case FCmpInst::FCMP_ULE: FOC = ISD::SETLE; FPC = ISD::SETULE; break;
850 case FCmpInst::FCMP_UNE: FOC = ISD::SETNE; FPC = ISD::SETUNE; break;
851 case FCmpInst::FCMP_TRUE: FOC = FPC = ISD::SETTRUE; break;
853 if (FiniteOnlyFPMath())
858 Condition = ISD::SETEQ; // silence warning.
859 assert(0 && "Unknown compare instruction");
862 SelectionDAGISel::CaseBlock CB(Condition, BOp->getOperand(0),
863 BOp->getOperand(1), NULL, TBB, FBB, CurBB);
864 SwitchCases.push_back(CB);
868 // Create a CaseBlock record representing this branch.
869 SelectionDAGISel::CaseBlock CB(ISD::SETEQ, Cond, ConstantInt::getTrue(),
870 NULL, TBB, FBB, CurBB);
871 SwitchCases.push_back(CB);
876 // Create TmpBB after CurBB.
877 MachineFunction::iterator BBI = CurBB;
878 MachineBasicBlock *TmpBB = new MachineBasicBlock(CurBB->getBasicBlock());
879 CurBB->getParent()->getBasicBlockList().insert(++BBI, TmpBB);
881 if (Opc == Instruction::Or) {
890 // Emit the LHS condition.
891 FindMergedConditions(BOp->getOperand(0), TBB, TmpBB, CurBB, Opc);
893 // Emit the RHS condition into TmpBB.
894 FindMergedConditions(BOp->getOperand(1), TBB, FBB, TmpBB, Opc);
896 assert(Opc == Instruction::And && "Unknown merge op!");
904 // This requires creation of TmpBB after CurBB.
906 // Emit the LHS condition.
907 FindMergedConditions(BOp->getOperand(0), TmpBB, FBB, CurBB, Opc);
909 // Emit the RHS condition into TmpBB.
910 FindMergedConditions(BOp->getOperand(1), TBB, FBB, TmpBB, Opc);
914 /// If the set of cases should be emitted as a series of branches, return true.
915 /// If we should emit this as a bunch of and/or'd together conditions, return
918 ShouldEmitAsBranches(const std::vector<SelectionDAGISel::CaseBlock> &Cases) {
919 if (Cases.size() != 2) return true;
921 // If this is two comparisons of the same values or'd or and'd together, they
922 // will get folded into a single comparison, so don't emit two blocks.
923 if ((Cases[0].CmpLHS == Cases[1].CmpLHS &&
924 Cases[0].CmpRHS == Cases[1].CmpRHS) ||
925 (Cases[0].CmpRHS == Cases[1].CmpLHS &&
926 Cases[0].CmpLHS == Cases[1].CmpRHS)) {
933 void SelectionDAGLowering::visitBr(BranchInst &I) {
934 // Update machine-CFG edges.
935 MachineBasicBlock *Succ0MBB = FuncInfo.MBBMap[I.getSuccessor(0)];
937 // Figure out which block is immediately after the current one.
938 MachineBasicBlock *NextBlock = 0;
939 MachineFunction::iterator BBI = CurMBB;
940 if (++BBI != CurMBB->getParent()->end())
943 if (I.isUnconditional()) {
944 // If this is not a fall-through branch, emit the branch.
945 if (Succ0MBB != NextBlock)
946 DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, getRoot(),
947 DAG.getBasicBlock(Succ0MBB)));
949 // Update machine-CFG edges.
950 CurMBB->addSuccessor(Succ0MBB);
955 // If this condition is one of the special cases we handle, do special stuff
957 Value *CondVal = I.getCondition();
958 MachineBasicBlock *Succ1MBB = FuncInfo.MBBMap[I.getSuccessor(1)];
960 // If this is a series of conditions that are or'd or and'd together, emit
961 // this as a sequence of branches instead of setcc's with and/or operations.
962 // For example, instead of something like:
975 if (BinaryOperator *BOp = dyn_cast<BinaryOperator>(CondVal)) {
976 if (BOp->hasOneUse() &&
977 (BOp->getOpcode() == Instruction::And ||
978 BOp->getOpcode() == Instruction::Or)) {
979 FindMergedConditions(BOp, Succ0MBB, Succ1MBB, CurMBB, BOp->getOpcode());
980 // If the compares in later blocks need to use values not currently
981 // exported from this block, export them now. This block should always
982 // be the first entry.
983 assert(SwitchCases[0].ThisBB == CurMBB && "Unexpected lowering!");
985 // Allow some cases to be rejected.
986 if (ShouldEmitAsBranches(SwitchCases)) {
987 for (unsigned i = 1, e = SwitchCases.size(); i != e; ++i) {
988 ExportFromCurrentBlock(SwitchCases[i].CmpLHS);
989 ExportFromCurrentBlock(SwitchCases[i].CmpRHS);
992 // Emit the branch for this block.
993 visitSwitchCase(SwitchCases[0]);
994 SwitchCases.erase(SwitchCases.begin());
998 // Okay, we decided not to do this, remove any inserted MBB's and clear
1000 for (unsigned i = 1, e = SwitchCases.size(); i != e; ++i)
1001 CurMBB->getParent()->getBasicBlockList().erase(SwitchCases[i].ThisBB);
1003 SwitchCases.clear();
1007 // Create a CaseBlock record representing this branch.
1008 SelectionDAGISel::CaseBlock CB(ISD::SETEQ, CondVal, ConstantInt::getTrue(),
1009 NULL, Succ0MBB, Succ1MBB, CurMBB);
1010 // Use visitSwitchCase to actually insert the fast branch sequence for this
1012 visitSwitchCase(CB);
1015 /// visitSwitchCase - Emits the necessary code to represent a single node in
1016 /// the binary search tree resulting from lowering a switch instruction.
1017 void SelectionDAGLowering::visitSwitchCase(SelectionDAGISel::CaseBlock &CB) {
1019 SDOperand CondLHS = getValue(CB.CmpLHS);
1021 // Build the setcc now.
1022 if (CB.CmpMHS == NULL) {
1023 // Fold "(X == true)" to X and "(X == false)" to !X to
1024 // handle common cases produced by branch lowering.
1025 if (CB.CmpRHS == ConstantInt::getTrue() && CB.CC == ISD::SETEQ)
1027 else if (CB.CmpRHS == ConstantInt::getFalse() && CB.CC == ISD::SETEQ) {
1028 SDOperand True = DAG.getConstant(1, CondLHS.getValueType());
1029 Cond = DAG.getNode(ISD::XOR, CondLHS.getValueType(), CondLHS, True);
1031 Cond = DAG.getSetCC(MVT::i1, CondLHS, getValue(CB.CmpRHS), CB.CC);
1033 assert(CB.CC == ISD::SETLE && "Can handle only LE ranges now");
1035 uint64_t Low = cast<ConstantInt>(CB.CmpLHS)->getSExtValue();
1036 uint64_t High = cast<ConstantInt>(CB.CmpRHS)->getSExtValue();
1038 SDOperand CmpOp = getValue(CB.CmpMHS);
1039 MVT::ValueType VT = CmpOp.getValueType();
1041 if (cast<ConstantInt>(CB.CmpLHS)->isMinValue(true)) {
1042 Cond = DAG.getSetCC(MVT::i1, CmpOp, DAG.getConstant(High, VT), ISD::SETLE);
1044 SDOperand SUB = DAG.getNode(ISD::SUB, VT, CmpOp, DAG.getConstant(Low, VT));
1045 Cond = DAG.getSetCC(MVT::i1, SUB,
1046 DAG.getConstant(High-Low, VT), ISD::SETULE);
1051 // Set NextBlock to be the MBB immediately after the current one, if any.
1052 // This is used to avoid emitting unnecessary branches to the next block.
1053 MachineBasicBlock *NextBlock = 0;
1054 MachineFunction::iterator BBI = CurMBB;
1055 if (++BBI != CurMBB->getParent()->end())
1058 // If the lhs block is the next block, invert the condition so that we can
1059 // fall through to the lhs instead of the rhs block.
1060 if (CB.TrueBB == NextBlock) {
1061 std::swap(CB.TrueBB, CB.FalseBB);
1062 SDOperand True = DAG.getConstant(1, Cond.getValueType());
1063 Cond = DAG.getNode(ISD::XOR, Cond.getValueType(), Cond, True);
1065 SDOperand BrCond = DAG.getNode(ISD::BRCOND, MVT::Other, getRoot(), Cond,
1066 DAG.getBasicBlock(CB.TrueBB));
1067 if (CB.FalseBB == NextBlock)
1068 DAG.setRoot(BrCond);
1070 DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, BrCond,
1071 DAG.getBasicBlock(CB.FalseBB)));
1072 // Update successor info
1073 CurMBB->addSuccessor(CB.TrueBB);
1074 CurMBB->addSuccessor(CB.FalseBB);
1077 /// visitJumpTable - Emit JumpTable node in the current MBB
1078 void SelectionDAGLowering::visitJumpTable(SelectionDAGISel::JumpTable &JT) {
1079 // Emit the code for the jump table
1080 assert(JT.Reg != -1U && "Should lower JT Header first!");
1081 MVT::ValueType PTy = TLI.getPointerTy();
1082 SDOperand Index = DAG.getCopyFromReg(getRoot(), JT.Reg, PTy);
1083 SDOperand Table = DAG.getJumpTable(JT.JTI, PTy);
1084 DAG.setRoot(DAG.getNode(ISD::BR_JT, MVT::Other, Index.getValue(1),
1089 /// visitJumpTableHeader - This function emits necessary code to produce index
1090 /// in the JumpTable from switch case.
1091 void SelectionDAGLowering::visitJumpTableHeader(SelectionDAGISel::JumpTable &JT,
1092 SelectionDAGISel::JumpTableHeader &JTH) {
1093 // Subtract the lowest switch case value from the value being switched on
1094 // and conditional branch to default mbb if the result is greater than the
1095 // difference between smallest and largest cases.
1096 SDOperand SwitchOp = getValue(JTH.SValue);
1097 MVT::ValueType VT = SwitchOp.getValueType();
1098 SDOperand SUB = DAG.getNode(ISD::SUB, VT, SwitchOp,
1099 DAG.getConstant(JTH.First, VT));
1101 // The SDNode we just created, which holds the value being switched on
1102 // minus the the smallest case value, needs to be copied to a virtual
1103 // register so it can be used as an index into the jump table in a
1104 // subsequent basic block. This value may be smaller or larger than the
1105 // target's pointer type, and therefore require extension or truncating.
1106 if (MVT::getSizeInBits(VT) > MVT::getSizeInBits(TLI.getPointerTy()))
1107 SwitchOp = DAG.getNode(ISD::TRUNCATE, TLI.getPointerTy(), SUB);
1109 SwitchOp = DAG.getNode(ISD::ZERO_EXTEND, TLI.getPointerTy(), SUB);
1111 unsigned JumpTableReg = FuncInfo.MakeReg(TLI.getPointerTy());
1112 SDOperand CopyTo = DAG.getCopyToReg(getRoot(), JumpTableReg, SwitchOp);
1113 JT.Reg = JumpTableReg;
1115 // Emit the range check for the jump table, and branch to the default
1116 // block for the switch statement if the value being switched on exceeds
1117 // the largest case in the switch.
1118 SDOperand CMP = DAG.getSetCC(TLI.getSetCCResultTy(), SUB,
1119 DAG.getConstant(JTH.Last-JTH.First,VT),
1122 // Set NextBlock to be the MBB immediately after the current one, if any.
1123 // This is used to avoid emitting unnecessary branches to the next block.
1124 MachineBasicBlock *NextBlock = 0;
1125 MachineFunction::iterator BBI = CurMBB;
1126 if (++BBI != CurMBB->getParent()->end())
1129 SDOperand BrCond = DAG.getNode(ISD::BRCOND, MVT::Other, CopyTo, CMP,
1130 DAG.getBasicBlock(JT.Default));
1132 if (JT.MBB == NextBlock)
1133 DAG.setRoot(BrCond);
1135 DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, BrCond,
1136 DAG.getBasicBlock(JT.MBB)));
1141 /// visitBitTestHeader - This function emits necessary code to produce value
1142 /// suitable for "bit tests"
1143 void SelectionDAGLowering::visitBitTestHeader(SelectionDAGISel::BitTestBlock &B) {
1144 // Subtract the minimum value
1145 SDOperand SwitchOp = getValue(B.SValue);
1146 MVT::ValueType VT = SwitchOp.getValueType();
1147 SDOperand SUB = DAG.getNode(ISD::SUB, VT, SwitchOp,
1148 DAG.getConstant(B.First, VT));
1151 SDOperand RangeCmp = DAG.getSetCC(TLI.getSetCCResultTy(), SUB,
1152 DAG.getConstant(B.Range, VT),
1156 if (MVT::getSizeInBits(VT) > MVT::getSizeInBits(TLI.getShiftAmountTy()))
1157 ShiftOp = DAG.getNode(ISD::TRUNCATE, TLI.getShiftAmountTy(), SUB);
1159 ShiftOp = DAG.getNode(ISD::ZERO_EXTEND, TLI.getShiftAmountTy(), SUB);
1161 // Make desired shift
1162 SDOperand SwitchVal = DAG.getNode(ISD::SHL, TLI.getPointerTy(),
1163 DAG.getConstant(1, TLI.getPointerTy()),
1166 unsigned SwitchReg = FuncInfo.MakeReg(TLI.getPointerTy());
1167 SDOperand CopyTo = DAG.getCopyToReg(getRoot(), SwitchReg, SwitchVal);
1170 SDOperand BrRange = DAG.getNode(ISD::BRCOND, MVT::Other, CopyTo, RangeCmp,
1171 DAG.getBasicBlock(B.Default));
1173 // Set NextBlock to be the MBB immediately after the current one, if any.
1174 // This is used to avoid emitting unnecessary branches to the next block.
1175 MachineBasicBlock *NextBlock = 0;
1176 MachineFunction::iterator BBI = CurMBB;
1177 if (++BBI != CurMBB->getParent()->end())
1180 MachineBasicBlock* MBB = B.Cases[0].ThisBB;
1181 if (MBB == NextBlock)
1182 DAG.setRoot(BrRange);
1184 DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, CopyTo,
1185 DAG.getBasicBlock(MBB)));
1187 CurMBB->addSuccessor(B.Default);
1188 CurMBB->addSuccessor(MBB);
1193 /// visitBitTestCase - this function produces one "bit test"
1194 void SelectionDAGLowering::visitBitTestCase(MachineBasicBlock* NextMBB,
1196 SelectionDAGISel::BitTestCase &B) {
1197 // Emit bit tests and jumps
1198 SDOperand SwitchVal = DAG.getCopyFromReg(getRoot(), Reg, TLI.getPointerTy());
1200 SDOperand AndOp = DAG.getNode(ISD::AND, TLI.getPointerTy(),
1202 DAG.getConstant(B.Mask,
1203 TLI.getPointerTy()));
1204 SDOperand AndCmp = DAG.getSetCC(TLI.getSetCCResultTy(), AndOp,
1205 DAG.getConstant(0, TLI.getPointerTy()),
1207 SDOperand BrAnd = DAG.getNode(ISD::BRCOND, MVT::Other, getRoot(),
1208 AndCmp, DAG.getBasicBlock(B.TargetBB));
1210 // Set NextBlock to be the MBB immediately after the current one, if any.
1211 // This is used to avoid emitting unnecessary branches to the next block.
1212 MachineBasicBlock *NextBlock = 0;
1213 MachineFunction::iterator BBI = CurMBB;
1214 if (++BBI != CurMBB->getParent()->end())
1217 if (NextMBB == NextBlock)
1220 DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, BrAnd,
1221 DAG.getBasicBlock(NextMBB)));
1223 CurMBB->addSuccessor(B.TargetBB);
1224 CurMBB->addSuccessor(NextMBB);
1229 void SelectionDAGLowering::visitInvoke(InvokeInst &I) {
1230 // Retrieve successors.
1231 MachineBasicBlock *Return = FuncInfo.MBBMap[I.getSuccessor(0)];
1232 MachineBasicBlock *LandingPad = FuncInfo.MBBMap[I.getSuccessor(1)];
1234 LowerCallTo(I, I.getCalledValue()->getType(),
1237 getValue(I.getOperand(0)),
1240 // If the value of the invoke is used outside of its defining block, make it
1241 // available as a virtual register.
1242 if (!I.use_empty()) {
1243 DenseMap<const Value*, unsigned>::iterator VMI = FuncInfo.ValueMap.find(&I);
1244 if (VMI != FuncInfo.ValueMap.end())
1245 DAG.setRoot(CopyValueToVirtualRegister(&I, VMI->second));
1248 // Drop into normal successor.
1249 DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, getRoot(),
1250 DAG.getBasicBlock(Return)));
1252 // Update successor info
1253 CurMBB->addSuccessor(Return);
1254 CurMBB->addSuccessor(LandingPad);
1257 void SelectionDAGLowering::visitUnwind(UnwindInst &I) {
1260 /// handleSmallSwitchCaseRange - Emit a series of specific tests (suitable for
1261 /// small case ranges).
1262 bool SelectionDAGLowering::handleSmallSwitchRange(CaseRec& CR,
1263 CaseRecVector& WorkList,
1265 MachineBasicBlock* Default) {
1266 Case& BackCase = *(CR.Range.second-1);
1268 // Size is the number of Cases represented by this range.
1269 unsigned Size = CR.Range.second - CR.Range.first;
1273 // Get the MachineFunction which holds the current MBB. This is used when
1274 // inserting any additional MBBs necessary to represent the switch.
1275 MachineFunction *CurMF = CurMBB->getParent();
1277 // Figure out which block is immediately after the current one.
1278 MachineBasicBlock *NextBlock = 0;
1279 MachineFunction::iterator BBI = CR.CaseBB;
1281 if (++BBI != CurMBB->getParent()->end())
1284 // TODO: If any two of the cases has the same destination, and if one value
1285 // is the same as the other, but has one bit unset that the other has set,
1286 // use bit manipulation to do two compares at once. For example:
1287 // "if (X == 6 || X == 4)" -> "if ((X|2) == 6)"
1289 // Rearrange the case blocks so that the last one falls through if possible.
1290 if (NextBlock && Default != NextBlock && BackCase.BB != NextBlock) {
1291 // The last case block won't fall through into 'NextBlock' if we emit the
1292 // branches in this order. See if rearranging a case value would help.
1293 for (CaseItr I = CR.Range.first, E = CR.Range.second-1; I != E; ++I) {
1294 if (I->BB == NextBlock) {
1295 std::swap(*I, BackCase);
1301 // Create a CaseBlock record representing a conditional branch to
1302 // the Case's target mbb if the value being switched on SV is equal
1304 MachineBasicBlock *CurBlock = CR.CaseBB;
1305 for (CaseItr I = CR.Range.first, E = CR.Range.second; I != E; ++I) {
1306 MachineBasicBlock *FallThrough;
1308 FallThrough = new MachineBasicBlock(CurBlock->getBasicBlock());
1309 CurMF->getBasicBlockList().insert(BBI, FallThrough);
1311 // If the last case doesn't match, go to the default block.
1312 FallThrough = Default;
1315 Value *RHS, *LHS, *MHS;
1317 if (I->High == I->Low) {
1318 // This is just small small case range :) containing exactly 1 case
1320 LHS = SV; RHS = I->High; MHS = NULL;
1323 LHS = I->Low; MHS = SV; RHS = I->High;
1325 SelectionDAGISel::CaseBlock CB(CC, LHS, RHS, MHS,
1326 I->BB, FallThrough, CurBlock);
1328 // If emitting the first comparison, just call visitSwitchCase to emit the
1329 // code into the current block. Otherwise, push the CaseBlock onto the
1330 // vector to be later processed by SDISel, and insert the node's MBB
1331 // before the next MBB.
1332 if (CurBlock == CurMBB)
1333 visitSwitchCase(CB);
1335 SwitchCases.push_back(CB);
1337 CurBlock = FallThrough;
1343 static inline bool areJTsAllowed(const TargetLowering &TLI) {
1344 return (TLI.isOperationLegal(ISD::BR_JT, MVT::Other) ||
1345 TLI.isOperationLegal(ISD::BRIND, MVT::Other));
1348 /// handleJTSwitchCase - Emit jumptable for current switch case range
1349 bool SelectionDAGLowering::handleJTSwitchCase(CaseRec& CR,
1350 CaseRecVector& WorkList,
1352 MachineBasicBlock* Default) {
1353 Case& FrontCase = *CR.Range.first;
1354 Case& BackCase = *(CR.Range.second-1);
1356 int64_t First = cast<ConstantInt>(FrontCase.Low)->getSExtValue();
1357 int64_t Last = cast<ConstantInt>(BackCase.High)->getSExtValue();
1360 for (CaseItr I = CR.Range.first, E = CR.Range.second;
1364 if (!areJTsAllowed(TLI) || TSize <= 3)
1367 double Density = (double)TSize / (double)((Last - First) + 1ULL);
1371 DOUT << "Lowering jump table\n"
1372 << "First entry: " << First << ". Last entry: " << Last << "\n"
1373 << "Size: " << TSize << ". Density: " << Density << "\n\n";
1375 // Get the MachineFunction which holds the current MBB. This is used when
1376 // inserting any additional MBBs necessary to represent the switch.
1377 MachineFunction *CurMF = CurMBB->getParent();
1379 // Figure out which block is immediately after the current one.
1380 MachineBasicBlock *NextBlock = 0;
1381 MachineFunction::iterator BBI = CR.CaseBB;
1383 if (++BBI != CurMBB->getParent()->end())
1386 const BasicBlock *LLVMBB = CR.CaseBB->getBasicBlock();
1388 // Create a new basic block to hold the code for loading the address
1389 // of the jump table, and jumping to it. Update successor information;
1390 // we will either branch to the default case for the switch, or the jump
1392 MachineBasicBlock *JumpTableBB = new MachineBasicBlock(LLVMBB);
1393 CurMF->getBasicBlockList().insert(BBI, JumpTableBB);
1394 CR.CaseBB->addSuccessor(Default);
1395 CR.CaseBB->addSuccessor(JumpTableBB);
1397 // Build a vector of destination BBs, corresponding to each target
1398 // of the jump table. If the value of the jump table slot corresponds to
1399 // a case statement, push the case's BB onto the vector, otherwise, push
1401 std::vector<MachineBasicBlock*> DestBBs;
1402 int64_t TEI = First;
1403 for (CaseItr I = CR.Range.first, E = CR.Range.second; I != E; ++TEI) {
1404 int64_t Low = cast<ConstantInt>(I->Low)->getSExtValue();
1405 int64_t High = cast<ConstantInt>(I->High)->getSExtValue();
1407 if ((Low <= TEI) && (TEI <= High)) {
1408 DestBBs.push_back(I->BB);
1412 DestBBs.push_back(Default);
1416 // Update successor info. Add one edge to each unique successor.
1417 BitVector SuccsHandled(CR.CaseBB->getParent()->getNumBlockIDs());
1418 for (std::vector<MachineBasicBlock*>::iterator I = DestBBs.begin(),
1419 E = DestBBs.end(); I != E; ++I) {
1420 if (!SuccsHandled[(*I)->getNumber()]) {
1421 SuccsHandled[(*I)->getNumber()] = true;
1422 JumpTableBB->addSuccessor(*I);
1426 // Create a jump table index for this jump table, or return an existing
1428 unsigned JTI = CurMF->getJumpTableInfo()->getJumpTableIndex(DestBBs);
1430 // Set the jump table information so that we can codegen it as a second
1431 // MachineBasicBlock
1432 SelectionDAGISel::JumpTable JT(-1U, JTI, JumpTableBB, Default);
1433 SelectionDAGISel::JumpTableHeader JTH(First, Last, SV, CR.CaseBB,
1434 (CR.CaseBB == CurMBB));
1435 if (CR.CaseBB == CurMBB)
1436 visitJumpTableHeader(JT, JTH);
1438 JTCases.push_back(SelectionDAGISel::JumpTableBlock(JTH, JT));
1443 /// handleBTSplitSwitchCase - emit comparison and split binary search tree into
1445 bool SelectionDAGLowering::handleBTSplitSwitchCase(CaseRec& CR,
1446 CaseRecVector& WorkList,
1448 MachineBasicBlock* Default) {
1449 // Get the MachineFunction which holds the current MBB. This is used when
1450 // inserting any additional MBBs necessary to represent the switch.
1451 MachineFunction *CurMF = CurMBB->getParent();
1453 // Figure out which block is immediately after the current one.
1454 MachineBasicBlock *NextBlock = 0;
1455 MachineFunction::iterator BBI = CR.CaseBB;
1457 if (++BBI != CurMBB->getParent()->end())
1460 Case& FrontCase = *CR.Range.first;
1461 Case& BackCase = *(CR.Range.second-1);
1462 const BasicBlock *LLVMBB = CR.CaseBB->getBasicBlock();
1464 // Size is the number of Cases represented by this range.
1465 unsigned Size = CR.Range.second - CR.Range.first;
1467 int64_t First = cast<ConstantInt>(FrontCase.Low)->getSExtValue();
1468 int64_t Last = cast<ConstantInt>(BackCase.High)->getSExtValue();
1470 CaseItr Pivot = CR.Range.first + Size/2;
1472 // Select optimal pivot, maximizing sum density of LHS and RHS. This will
1473 // (heuristically) allow us to emit JumpTable's later.
1475 for (CaseItr I = CR.Range.first, E = CR.Range.second;
1479 uint64_t LSize = FrontCase.size();
1480 uint64_t RSize = TSize-LSize;
1481 DOUT << "Selecting best pivot: \n"
1482 << "First: " << First << ", Last: " << Last <<"\n"
1483 << "LSize: " << LSize << ", RSize: " << RSize << "\n";
1484 for (CaseItr I = CR.Range.first, J=I+1, E = CR.Range.second;
1486 int64_t LEnd = cast<ConstantInt>(I->High)->getSExtValue();
1487 int64_t RBegin = cast<ConstantInt>(J->Low)->getSExtValue();
1488 assert((RBegin-LEnd>=1) && "Invalid case distance");
1489 double LDensity = (double)LSize / (double)((LEnd - First) + 1ULL);
1490 double RDensity = (double)RSize / (double)((Last - RBegin) + 1ULL);
1491 double Metric = Log2_64(RBegin-LEnd)*(LDensity+RDensity);
1492 // Should always split in some non-trivial place
1494 << "LEnd: " << LEnd << ", RBegin: " << RBegin << "\n"
1495 << "LDensity: " << LDensity << ", RDensity: " << RDensity << "\n"
1496 << "Metric: " << Metric << "\n";
1497 if (FMetric < Metric) {
1500 DOUT << "Current metric set to: " << FMetric << "\n";
1506 if (areJTsAllowed(TLI)) {
1507 // If our case is dense we *really* should handle it earlier!
1508 assert((FMetric > 0) && "Should handle dense range earlier!");
1510 Pivot = CR.Range.first + Size/2;
1513 CaseRange LHSR(CR.Range.first, Pivot);
1514 CaseRange RHSR(Pivot, CR.Range.second);
1515 Constant *C = Pivot->Low;
1516 MachineBasicBlock *FalseBB = 0, *TrueBB = 0;
1518 // We know that we branch to the LHS if the Value being switched on is
1519 // less than the Pivot value, C. We use this to optimize our binary
1520 // tree a bit, by recognizing that if SV is greater than or equal to the
1521 // LHS's Case Value, and that Case Value is exactly one less than the
1522 // Pivot's Value, then we can branch directly to the LHS's Target,
1523 // rather than creating a leaf node for it.
1524 if ((LHSR.second - LHSR.first) == 1 &&
1525 LHSR.first->High == CR.GE &&
1526 cast<ConstantInt>(C)->getSExtValue() ==
1527 (cast<ConstantInt>(CR.GE)->getSExtValue() + 1LL)) {
1528 TrueBB = LHSR.first->BB;
1530 TrueBB = new MachineBasicBlock(LLVMBB);
1531 CurMF->getBasicBlockList().insert(BBI, TrueBB);
1532 WorkList.push_back(CaseRec(TrueBB, C, CR.GE, LHSR));
1535 // Similar to the optimization above, if the Value being switched on is
1536 // known to be less than the Constant CR.LT, and the current Case Value
1537 // is CR.LT - 1, then we can branch directly to the target block for
1538 // the current Case Value, rather than emitting a RHS leaf node for it.
1539 if ((RHSR.second - RHSR.first) == 1 && CR.LT &&
1540 cast<ConstantInt>(RHSR.first->Low)->getSExtValue() ==
1541 (cast<ConstantInt>(CR.LT)->getSExtValue() - 1LL)) {
1542 FalseBB = RHSR.first->BB;
1544 FalseBB = new MachineBasicBlock(LLVMBB);
1545 CurMF->getBasicBlockList().insert(BBI, FalseBB);
1546 WorkList.push_back(CaseRec(FalseBB,CR.LT,C,RHSR));
1549 // Create a CaseBlock record representing a conditional branch to
1550 // the LHS node if the value being switched on SV is less than C.
1551 // Otherwise, branch to LHS.
1552 SelectionDAGISel::CaseBlock CB(ISD::SETLT, SV, C, NULL,
1553 TrueBB, FalseBB, CR.CaseBB);
1555 if (CR.CaseBB == CurMBB)
1556 visitSwitchCase(CB);
1558 SwitchCases.push_back(CB);
1563 /// handleBitTestsSwitchCase - if current case range has few destination and
1564 /// range span less, than machine word bitwidth, encode case range into series
1565 /// of masks and emit bit tests with these masks.
1566 bool SelectionDAGLowering::handleBitTestsSwitchCase(CaseRec& CR,
1567 CaseRecVector& WorkList,
1569 MachineBasicBlock* Default){
1570 unsigned IntPtrBits = MVT::getSizeInBits(TLI.getPointerTy());
1572 Case& FrontCase = *CR.Range.first;
1573 Case& BackCase = *(CR.Range.second-1);
1575 // Get the MachineFunction which holds the current MBB. This is used when
1576 // inserting any additional MBBs necessary to represent the switch.
1577 MachineFunction *CurMF = CurMBB->getParent();
1579 unsigned numCmps = 0;
1580 for (CaseItr I = CR.Range.first, E = CR.Range.second;
1582 // Single case counts one, case range - two.
1583 if (I->Low == I->High)
1589 // Count unique destinations
1590 SmallSet<MachineBasicBlock*, 4> Dests;
1591 for (CaseItr I = CR.Range.first, E = CR.Range.second; I!=E; ++I) {
1592 Dests.insert(I->BB);
1593 if (Dests.size() > 3)
1594 // Don't bother the code below, if there are too much unique destinations
1597 DOUT << "Total number of unique destinations: " << Dests.size() << "\n"
1598 << "Total number of comparisons: " << numCmps << "\n";
1600 // Compute span of values.
1601 Constant* minValue = FrontCase.Low;
1602 Constant* maxValue = BackCase.High;
1603 uint64_t range = cast<ConstantInt>(maxValue)->getSExtValue() -
1604 cast<ConstantInt>(minValue)->getSExtValue();
1605 DOUT << "Compare range: " << range << "\n"
1606 << "Low bound: " << cast<ConstantInt>(minValue)->getSExtValue() << "\n"
1607 << "High bound: " << cast<ConstantInt>(maxValue)->getSExtValue() << "\n";
1609 if (range>=IntPtrBits ||
1610 (!(Dests.size() == 1 && numCmps >= 3) &&
1611 !(Dests.size() == 2 && numCmps >= 5) &&
1612 !(Dests.size() >= 3 && numCmps >= 6)))
1615 DOUT << "Emitting bit tests\n";
1616 int64_t lowBound = 0;
1618 // Optimize the case where all the case values fit in a
1619 // word without having to subtract minValue. In this case,
1620 // we can optimize away the subtraction.
1621 if (cast<ConstantInt>(minValue)->getSExtValue() >= 0 &&
1622 cast<ConstantInt>(maxValue)->getSExtValue() < IntPtrBits) {
1623 range = cast<ConstantInt>(maxValue)->getSExtValue();
1625 lowBound = cast<ConstantInt>(minValue)->getSExtValue();
1628 CaseBitsVector CasesBits;
1629 unsigned i, count = 0;
1631 for (CaseItr I = CR.Range.first, E = CR.Range.second; I!=E; ++I) {
1632 MachineBasicBlock* Dest = I->BB;
1633 for (i = 0; i < count; ++i)
1634 if (Dest == CasesBits[i].BB)
1638 assert((count < 3) && "Too much destinations to test!");
1639 CasesBits.push_back(CaseBits(0, Dest, 0));
1643 uint64_t lo = cast<ConstantInt>(I->Low)->getSExtValue() - lowBound;
1644 uint64_t hi = cast<ConstantInt>(I->High)->getSExtValue() - lowBound;
1646 for (uint64_t j = lo; j <= hi; j++) {
1647 CasesBits[i].Mask |= 1ULL << j;
1648 CasesBits[i].Bits++;
1652 std::sort(CasesBits.begin(), CasesBits.end(), CaseBitsCmp());
1654 SelectionDAGISel::BitTestInfo BTC;
1656 // Figure out which block is immediately after the current one.
1657 MachineFunction::iterator BBI = CR.CaseBB;
1660 const BasicBlock *LLVMBB = CR.CaseBB->getBasicBlock();
1663 for (unsigned i = 0, e = CasesBits.size(); i!=e; ++i) {
1664 DOUT << "Mask: " << CasesBits[i].Mask << ", Bits: " << CasesBits[i].Bits
1665 << ", BB: " << CasesBits[i].BB << "\n";
1667 MachineBasicBlock *CaseBB = new MachineBasicBlock(LLVMBB);
1668 CurMF->getBasicBlockList().insert(BBI, CaseBB);
1669 BTC.push_back(SelectionDAGISel::BitTestCase(CasesBits[i].Mask,
1674 SelectionDAGISel::BitTestBlock BTB(lowBound, range, SV,
1675 -1U, (CR.CaseBB == CurMBB),
1676 CR.CaseBB, Default, BTC);
1678 if (CR.CaseBB == CurMBB)
1679 visitBitTestHeader(BTB);
1681 BitTestCases.push_back(BTB);
1687 // Clusterify - Transform simple list of Cases into list of CaseRange's
1688 unsigned SelectionDAGLowering::Clusterify(CaseVector& Cases,
1689 const SwitchInst& SI) {
1690 unsigned numCmps = 0;
1692 // Start with "simple" cases
1693 for (unsigned i = 1; i < SI.getNumSuccessors(); ++i) {
1694 MachineBasicBlock *SMBB = FuncInfo.MBBMap[SI.getSuccessor(i)];
1695 Cases.push_back(Case(SI.getSuccessorValue(i),
1696 SI.getSuccessorValue(i),
1699 sort(Cases.begin(), Cases.end(), CaseCmp());
1701 // Merge case into clusters
1702 if (Cases.size()>=2)
1703 // Must recompute end() each iteration because it may be
1704 // invalidated by erase if we hold on to it
1705 for (CaseItr I=Cases.begin(), J=++(Cases.begin()); J!=Cases.end(); ) {
1706 int64_t nextValue = cast<ConstantInt>(J->Low)->getSExtValue();
1707 int64_t currentValue = cast<ConstantInt>(I->High)->getSExtValue();
1708 MachineBasicBlock* nextBB = J->BB;
1709 MachineBasicBlock* currentBB = I->BB;
1711 // If the two neighboring cases go to the same destination, merge them
1712 // into a single case.
1713 if ((nextValue-currentValue==1) && (currentBB == nextBB)) {
1721 for (CaseItr I=Cases.begin(), E=Cases.end(); I!=E; ++I, ++numCmps) {
1722 if (I->Low != I->High)
1723 // A range counts double, since it requires two compares.
1730 void SelectionDAGLowering::visitSwitch(SwitchInst &SI) {
1731 // Figure out which block is immediately after the current one.
1732 MachineBasicBlock *NextBlock = 0;
1733 MachineFunction::iterator BBI = CurMBB;
1735 MachineBasicBlock *Default = FuncInfo.MBBMap[SI.getDefaultDest()];
1737 // If there is only the default destination, branch to it if it is not the
1738 // next basic block. Otherwise, just fall through.
1739 if (SI.getNumOperands() == 2) {
1740 // Update machine-CFG edges.
1742 // If this is not a fall-through branch, emit the branch.
1743 if (Default != NextBlock)
1744 DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, getRoot(),
1745 DAG.getBasicBlock(Default)));
1747 CurMBB->addSuccessor(Default);
1751 // If there are any non-default case statements, create a vector of Cases
1752 // representing each one, and sort the vector so that we can efficiently
1753 // create a binary search tree from them.
1755 unsigned numCmps = Clusterify(Cases, SI);
1756 DOUT << "Clusterify finished. Total clusters: " << Cases.size()
1757 << ". Total compares: " << numCmps << "\n";
1759 // Get the Value to be switched on and default basic blocks, which will be
1760 // inserted into CaseBlock records, representing basic blocks in the binary
1762 Value *SV = SI.getOperand(0);
1764 // Push the initial CaseRec onto the worklist
1765 CaseRecVector WorkList;
1766 WorkList.push_back(CaseRec(CurMBB,0,0,CaseRange(Cases.begin(),Cases.end())));
1768 while (!WorkList.empty()) {
1769 // Grab a record representing a case range to process off the worklist
1770 CaseRec CR = WorkList.back();
1771 WorkList.pop_back();
1773 if (handleBitTestsSwitchCase(CR, WorkList, SV, Default))
1776 // If the range has few cases (two or less) emit a series of specific
1778 if (handleSmallSwitchRange(CR, WorkList, SV, Default))
1781 // If the switch has more than 5 blocks, and at least 40% dense, and the
1782 // target supports indirect branches, then emit a jump table rather than
1783 // lowering the switch to a binary tree of conditional branches.
1784 if (handleJTSwitchCase(CR, WorkList, SV, Default))
1787 // Emit binary tree. We need to pick a pivot, and push left and right ranges
1788 // onto the worklist. Leafs are handled via handleSmallSwitchRange() call.
1789 handleBTSplitSwitchCase(CR, WorkList, SV, Default);
1794 void SelectionDAGLowering::visitSub(User &I) {
1795 // -0.0 - X --> fneg
1796 const Type *Ty = I.getType();
1797 if (isa<VectorType>(Ty)) {
1798 if (ConstantVector *CV = dyn_cast<ConstantVector>(I.getOperand(0))) {
1799 const VectorType *DestTy = cast<VectorType>(I.getType());
1800 const Type *ElTy = DestTy->getElementType();
1801 unsigned VL = DestTy->getNumElements();
1802 std::vector<Constant*> NZ(VL, ConstantFP::get(ElTy, -0.0));
1803 Constant *CNZ = ConstantVector::get(&NZ[0], NZ.size());
1805 SDOperand Op2 = getValue(I.getOperand(1));
1806 setValue(&I, DAG.getNode(ISD::FNEG, Op2.getValueType(), Op2));
1811 if (Ty->isFloatingPoint()) {
1812 if (ConstantFP *CFP = dyn_cast<ConstantFP>(I.getOperand(0)))
1813 if (CFP->isExactlyValue(-0.0)) {
1814 SDOperand Op2 = getValue(I.getOperand(1));
1815 setValue(&I, DAG.getNode(ISD::FNEG, Op2.getValueType(), Op2));
1820 visitBinary(I, Ty->isFPOrFPVector() ? ISD::FSUB : ISD::SUB);
1823 void SelectionDAGLowering::visitBinary(User &I, unsigned OpCode) {
1824 SDOperand Op1 = getValue(I.getOperand(0));
1825 SDOperand Op2 = getValue(I.getOperand(1));
1827 setValue(&I, DAG.getNode(OpCode, Op1.getValueType(), Op1, Op2));
1830 void SelectionDAGLowering::visitShift(User &I, unsigned Opcode) {
1831 SDOperand Op1 = getValue(I.getOperand(0));
1832 SDOperand Op2 = getValue(I.getOperand(1));
1834 if (MVT::getSizeInBits(TLI.getShiftAmountTy()) <
1835 MVT::getSizeInBits(Op2.getValueType()))
1836 Op2 = DAG.getNode(ISD::TRUNCATE, TLI.getShiftAmountTy(), Op2);
1837 else if (TLI.getShiftAmountTy() > Op2.getValueType())
1838 Op2 = DAG.getNode(ISD::ANY_EXTEND, TLI.getShiftAmountTy(), Op2);
1840 setValue(&I, DAG.getNode(Opcode, Op1.getValueType(), Op1, Op2));
1843 void SelectionDAGLowering::visitICmp(User &I) {
1844 ICmpInst::Predicate predicate = ICmpInst::BAD_ICMP_PREDICATE;
1845 if (ICmpInst *IC = dyn_cast<ICmpInst>(&I))
1846 predicate = IC->getPredicate();
1847 else if (ConstantExpr *IC = dyn_cast<ConstantExpr>(&I))
1848 predicate = ICmpInst::Predicate(IC->getPredicate());
1849 SDOperand Op1 = getValue(I.getOperand(0));
1850 SDOperand Op2 = getValue(I.getOperand(1));
1851 ISD::CondCode Opcode;
1852 switch (predicate) {
1853 case ICmpInst::ICMP_EQ : Opcode = ISD::SETEQ; break;
1854 case ICmpInst::ICMP_NE : Opcode = ISD::SETNE; break;
1855 case ICmpInst::ICMP_UGT : Opcode = ISD::SETUGT; break;
1856 case ICmpInst::ICMP_UGE : Opcode = ISD::SETUGE; break;
1857 case ICmpInst::ICMP_ULT : Opcode = ISD::SETULT; break;
1858 case ICmpInst::ICMP_ULE : Opcode = ISD::SETULE; break;
1859 case ICmpInst::ICMP_SGT : Opcode = ISD::SETGT; break;
1860 case ICmpInst::ICMP_SGE : Opcode = ISD::SETGE; break;
1861 case ICmpInst::ICMP_SLT : Opcode = ISD::SETLT; break;
1862 case ICmpInst::ICMP_SLE : Opcode = ISD::SETLE; break;
1864 assert(!"Invalid ICmp predicate value");
1865 Opcode = ISD::SETEQ;
1868 setValue(&I, DAG.getSetCC(MVT::i1, Op1, Op2, Opcode));
1871 void SelectionDAGLowering::visitFCmp(User &I) {
1872 FCmpInst::Predicate predicate = FCmpInst::BAD_FCMP_PREDICATE;
1873 if (FCmpInst *FC = dyn_cast<FCmpInst>(&I))
1874 predicate = FC->getPredicate();
1875 else if (ConstantExpr *FC = dyn_cast<ConstantExpr>(&I))
1876 predicate = FCmpInst::Predicate(FC->getPredicate());
1877 SDOperand Op1 = getValue(I.getOperand(0));
1878 SDOperand Op2 = getValue(I.getOperand(1));
1879 ISD::CondCode Condition, FOC, FPC;
1880 switch (predicate) {
1881 case FCmpInst::FCMP_FALSE: FOC = FPC = ISD::SETFALSE; break;
1882 case FCmpInst::FCMP_OEQ: FOC = ISD::SETEQ; FPC = ISD::SETOEQ; break;
1883 case FCmpInst::FCMP_OGT: FOC = ISD::SETGT; FPC = ISD::SETOGT; break;
1884 case FCmpInst::FCMP_OGE: FOC = ISD::SETGE; FPC = ISD::SETOGE; break;
1885 case FCmpInst::FCMP_OLT: FOC = ISD::SETLT; FPC = ISD::SETOLT; break;
1886 case FCmpInst::FCMP_OLE: FOC = ISD::SETLE; FPC = ISD::SETOLE; break;
1887 case FCmpInst::FCMP_ONE: FOC = ISD::SETNE; FPC = ISD::SETONE; break;
1888 case FCmpInst::FCMP_ORD: FOC = ISD::SETEQ; FPC = ISD::SETO; break;
1889 case FCmpInst::FCMP_UNO: FOC = ISD::SETNE; FPC = ISD::SETUO; break;
1890 case FCmpInst::FCMP_UEQ: FOC = ISD::SETEQ; FPC = ISD::SETUEQ; break;
1891 case FCmpInst::FCMP_UGT: FOC = ISD::SETGT; FPC = ISD::SETUGT; break;
1892 case FCmpInst::FCMP_UGE: FOC = ISD::SETGE; FPC = ISD::SETUGE; break;
1893 case FCmpInst::FCMP_ULT: FOC = ISD::SETLT; FPC = ISD::SETULT; break;
1894 case FCmpInst::FCMP_ULE: FOC = ISD::SETLE; FPC = ISD::SETULE; break;
1895 case FCmpInst::FCMP_UNE: FOC = ISD::SETNE; FPC = ISD::SETUNE; break;
1896 case FCmpInst::FCMP_TRUE: FOC = FPC = ISD::SETTRUE; break;
1898 assert(!"Invalid FCmp predicate value");
1899 FOC = FPC = ISD::SETFALSE;
1902 if (FiniteOnlyFPMath())
1906 setValue(&I, DAG.getSetCC(MVT::i1, Op1, Op2, Condition));
1909 void SelectionDAGLowering::visitSelect(User &I) {
1910 SDOperand Cond = getValue(I.getOperand(0));
1911 SDOperand TrueVal = getValue(I.getOperand(1));
1912 SDOperand FalseVal = getValue(I.getOperand(2));
1913 setValue(&I, DAG.getNode(ISD::SELECT, TrueVal.getValueType(), Cond,
1914 TrueVal, FalseVal));
1918 void SelectionDAGLowering::visitTrunc(User &I) {
1919 // TruncInst cannot be a no-op cast because sizeof(src) > sizeof(dest).
1920 SDOperand N = getValue(I.getOperand(0));
1921 MVT::ValueType DestVT = TLI.getValueType(I.getType());
1922 setValue(&I, DAG.getNode(ISD::TRUNCATE, DestVT, N));
1925 void SelectionDAGLowering::visitZExt(User &I) {
1926 // ZExt cannot be a no-op cast because sizeof(src) < sizeof(dest).
1927 // ZExt also can't be a cast to bool for same reason. So, nothing much to do
1928 SDOperand N = getValue(I.getOperand(0));
1929 MVT::ValueType DestVT = TLI.getValueType(I.getType());
1930 setValue(&I, DAG.getNode(ISD::ZERO_EXTEND, DestVT, N));
1933 void SelectionDAGLowering::visitSExt(User &I) {
1934 // SExt cannot be a no-op cast because sizeof(src) < sizeof(dest).
1935 // SExt also can't be a cast to bool for same reason. So, nothing much to do
1936 SDOperand N = getValue(I.getOperand(0));
1937 MVT::ValueType DestVT = TLI.getValueType(I.getType());
1938 setValue(&I, DAG.getNode(ISD::SIGN_EXTEND, DestVT, N));
1941 void SelectionDAGLowering::visitFPTrunc(User &I) {
1942 // FPTrunc is never a no-op cast, no need to check
1943 SDOperand N = getValue(I.getOperand(0));
1944 MVT::ValueType DestVT = TLI.getValueType(I.getType());
1945 setValue(&I, DAG.getNode(ISD::FP_ROUND, DestVT, N));
1948 void SelectionDAGLowering::visitFPExt(User &I){
1949 // FPTrunc is never a no-op cast, no need to check
1950 SDOperand N = getValue(I.getOperand(0));
1951 MVT::ValueType DestVT = TLI.getValueType(I.getType());
1952 setValue(&I, DAG.getNode(ISD::FP_EXTEND, DestVT, N));
1955 void SelectionDAGLowering::visitFPToUI(User &I) {
1956 // FPToUI is never a no-op cast, no need to check
1957 SDOperand N = getValue(I.getOperand(0));
1958 MVT::ValueType DestVT = TLI.getValueType(I.getType());
1959 setValue(&I, DAG.getNode(ISD::FP_TO_UINT, DestVT, N));
1962 void SelectionDAGLowering::visitFPToSI(User &I) {
1963 // FPToSI is never a no-op cast, no need to check
1964 SDOperand N = getValue(I.getOperand(0));
1965 MVT::ValueType DestVT = TLI.getValueType(I.getType());
1966 setValue(&I, DAG.getNode(ISD::FP_TO_SINT, DestVT, N));
1969 void SelectionDAGLowering::visitUIToFP(User &I) {
1970 // UIToFP is never a no-op cast, no need to check
1971 SDOperand N = getValue(I.getOperand(0));
1972 MVT::ValueType DestVT = TLI.getValueType(I.getType());
1973 setValue(&I, DAG.getNode(ISD::UINT_TO_FP, DestVT, N));
1976 void SelectionDAGLowering::visitSIToFP(User &I){
1977 // UIToFP is never a no-op cast, no need to check
1978 SDOperand N = getValue(I.getOperand(0));
1979 MVT::ValueType DestVT = TLI.getValueType(I.getType());
1980 setValue(&I, DAG.getNode(ISD::SINT_TO_FP, DestVT, N));
1983 void SelectionDAGLowering::visitPtrToInt(User &I) {
1984 // What to do depends on the size of the integer and the size of the pointer.
1985 // We can either truncate, zero extend, or no-op, accordingly.
1986 SDOperand N = getValue(I.getOperand(0));
1987 MVT::ValueType SrcVT = N.getValueType();
1988 MVT::ValueType DestVT = TLI.getValueType(I.getType());
1990 if (MVT::getSizeInBits(DestVT) < MVT::getSizeInBits(SrcVT))
1991 Result = DAG.getNode(ISD::TRUNCATE, DestVT, N);
1993 // Note: ZERO_EXTEND can handle cases where the sizes are equal too
1994 Result = DAG.getNode(ISD::ZERO_EXTEND, DestVT, N);
1995 setValue(&I, Result);
1998 void SelectionDAGLowering::visitIntToPtr(User &I) {
1999 // What to do depends on the size of the integer and the size of the pointer.
2000 // We can either truncate, zero extend, or no-op, accordingly.
2001 SDOperand N = getValue(I.getOperand(0));
2002 MVT::ValueType SrcVT = N.getValueType();
2003 MVT::ValueType DestVT = TLI.getValueType(I.getType());
2004 if (MVT::getSizeInBits(DestVT) < MVT::getSizeInBits(SrcVT))
2005 setValue(&I, DAG.getNode(ISD::TRUNCATE, DestVT, N));
2007 // Note: ZERO_EXTEND can handle cases where the sizes are equal too
2008 setValue(&I, DAG.getNode(ISD::ZERO_EXTEND, DestVT, N));
2011 void SelectionDAGLowering::visitBitCast(User &I) {
2012 SDOperand N = getValue(I.getOperand(0));
2013 MVT::ValueType DestVT = TLI.getValueType(I.getType());
2015 // BitCast assures us that source and destination are the same size so this
2016 // is either a BIT_CONVERT or a no-op.
2017 if (DestVT != N.getValueType())
2018 setValue(&I, DAG.getNode(ISD::BIT_CONVERT, DestVT, N)); // convert types
2020 setValue(&I, N); // noop cast.
2023 void SelectionDAGLowering::visitInsertElement(User &I) {
2024 SDOperand InVec = getValue(I.getOperand(0));
2025 SDOperand InVal = getValue(I.getOperand(1));
2026 SDOperand InIdx = DAG.getNode(ISD::ZERO_EXTEND, TLI.getPointerTy(),
2027 getValue(I.getOperand(2)));
2029 setValue(&I, DAG.getNode(ISD::INSERT_VECTOR_ELT,
2030 TLI.getValueType(I.getType()),
2031 InVec, InVal, InIdx));
2034 void SelectionDAGLowering::visitExtractElement(User &I) {
2035 SDOperand InVec = getValue(I.getOperand(0));
2036 SDOperand InIdx = DAG.getNode(ISD::ZERO_EXTEND, TLI.getPointerTy(),
2037 getValue(I.getOperand(1)));
2038 setValue(&I, DAG.getNode(ISD::EXTRACT_VECTOR_ELT,
2039 TLI.getValueType(I.getType()), InVec, InIdx));
2042 void SelectionDAGLowering::visitShuffleVector(User &I) {
2043 SDOperand V1 = getValue(I.getOperand(0));
2044 SDOperand V2 = getValue(I.getOperand(1));
2045 SDOperand Mask = getValue(I.getOperand(2));
2047 setValue(&I, DAG.getNode(ISD::VECTOR_SHUFFLE,
2048 TLI.getValueType(I.getType()),
2053 void SelectionDAGLowering::visitGetElementPtr(User &I) {
2054 SDOperand N = getValue(I.getOperand(0));
2055 const Type *Ty = I.getOperand(0)->getType();
2057 for (GetElementPtrInst::op_iterator OI = I.op_begin()+1, E = I.op_end();
2060 if (const StructType *StTy = dyn_cast<StructType>(Ty)) {
2061 unsigned Field = cast<ConstantInt>(Idx)->getZExtValue();
2064 uint64_t Offset = TD->getStructLayout(StTy)->getElementOffset(Field);
2065 N = DAG.getNode(ISD::ADD, N.getValueType(), N,
2066 getIntPtrConstant(Offset));
2068 Ty = StTy->getElementType(Field);
2070 Ty = cast<SequentialType>(Ty)->getElementType();
2072 // If this is a constant subscript, handle it quickly.
2073 if (ConstantInt *CI = dyn_cast<ConstantInt>(Idx)) {
2074 if (CI->getZExtValue() == 0) continue;
2076 TD->getTypeSize(Ty)*cast<ConstantInt>(CI)->getSExtValue();
2077 N = DAG.getNode(ISD::ADD, N.getValueType(), N, getIntPtrConstant(Offs));
2081 // N = N + Idx * ElementSize;
2082 uint64_t ElementSize = TD->getTypeSize(Ty);
2083 SDOperand IdxN = getValue(Idx);
2085 // If the index is smaller or larger than intptr_t, truncate or extend
2087 if (IdxN.getValueType() < N.getValueType()) {
2088 IdxN = DAG.getNode(ISD::SIGN_EXTEND, N.getValueType(), IdxN);
2089 } else if (IdxN.getValueType() > N.getValueType())
2090 IdxN = DAG.getNode(ISD::TRUNCATE, N.getValueType(), IdxN);
2092 // If this is a multiply by a power of two, turn it into a shl
2093 // immediately. This is a very common case.
2094 if (isPowerOf2_64(ElementSize)) {
2095 unsigned Amt = Log2_64(ElementSize);
2096 IdxN = DAG.getNode(ISD::SHL, N.getValueType(), IdxN,
2097 DAG.getConstant(Amt, TLI.getShiftAmountTy()));
2098 N = DAG.getNode(ISD::ADD, N.getValueType(), N, IdxN);
2102 SDOperand Scale = getIntPtrConstant(ElementSize);
2103 IdxN = DAG.getNode(ISD::MUL, N.getValueType(), IdxN, Scale);
2104 N = DAG.getNode(ISD::ADD, N.getValueType(), N, IdxN);
2110 void SelectionDAGLowering::visitAlloca(AllocaInst &I) {
2111 // If this is a fixed sized alloca in the entry block of the function,
2112 // allocate it statically on the stack.
2113 if (FuncInfo.StaticAllocaMap.count(&I))
2114 return; // getValue will auto-populate this.
2116 const Type *Ty = I.getAllocatedType();
2117 uint64_t TySize = TLI.getTargetData()->getTypeSize(Ty);
2119 std::max((unsigned)TLI.getTargetData()->getPrefTypeAlignment(Ty),
2122 SDOperand AllocSize = getValue(I.getArraySize());
2123 MVT::ValueType IntPtr = TLI.getPointerTy();
2124 if (IntPtr < AllocSize.getValueType())
2125 AllocSize = DAG.getNode(ISD::TRUNCATE, IntPtr, AllocSize);
2126 else if (IntPtr > AllocSize.getValueType())
2127 AllocSize = DAG.getNode(ISD::ZERO_EXTEND, IntPtr, AllocSize);
2129 AllocSize = DAG.getNode(ISD::MUL, IntPtr, AllocSize,
2130 getIntPtrConstant(TySize));
2132 // Handle alignment. If the requested alignment is less than or equal to the
2133 // stack alignment, ignore it and round the size of the allocation up to the
2134 // stack alignment size. If the size is greater than the stack alignment, we
2135 // note this in the DYNAMIC_STACKALLOC node.
2136 unsigned StackAlign =
2137 TLI.getTargetMachine().getFrameInfo()->getStackAlignment();
2138 if (Align <= StackAlign) {
2140 // Add SA-1 to the size.
2141 AllocSize = DAG.getNode(ISD::ADD, AllocSize.getValueType(), AllocSize,
2142 getIntPtrConstant(StackAlign-1));
2143 // Mask out the low bits for alignment purposes.
2144 AllocSize = DAG.getNode(ISD::AND, AllocSize.getValueType(), AllocSize,
2145 getIntPtrConstant(~(uint64_t)(StackAlign-1)));
2148 SDOperand Ops[] = { getRoot(), AllocSize, getIntPtrConstant(Align) };
2149 const MVT::ValueType *VTs = DAG.getNodeValueTypes(AllocSize.getValueType(),
2151 SDOperand DSA = DAG.getNode(ISD::DYNAMIC_STACKALLOC, VTs, 2, Ops, 3);
2153 DAG.setRoot(DSA.getValue(1));
2155 // Inform the Frame Information that we have just allocated a variable-sized
2157 CurMBB->getParent()->getFrameInfo()->CreateVariableSizedObject();
2160 void SelectionDAGLowering::visitLoad(LoadInst &I) {
2161 SDOperand Ptr = getValue(I.getOperand(0));
2167 // Do not serialize non-volatile loads against each other.
2168 Root = DAG.getRoot();
2171 setValue(&I, getLoadFrom(I.getType(), Ptr, I.getOperand(0),
2172 Root, I.isVolatile(), I.getAlignment()));
2175 SDOperand SelectionDAGLowering::getLoadFrom(const Type *Ty, SDOperand Ptr,
2176 const Value *SV, SDOperand Root,
2178 unsigned Alignment) {
2180 DAG.getLoad(TLI.getValueType(Ty), Root, Ptr, SV, 0,
2181 isVolatile, Alignment);
2184 DAG.setRoot(L.getValue(1));
2186 PendingLoads.push_back(L.getValue(1));
2192 void SelectionDAGLowering::visitStore(StoreInst &I) {
2193 Value *SrcV = I.getOperand(0);
2194 SDOperand Src = getValue(SrcV);
2195 SDOperand Ptr = getValue(I.getOperand(1));
2196 DAG.setRoot(DAG.getStore(getRoot(), Src, Ptr, I.getOperand(1), 0,
2197 I.isVolatile(), I.getAlignment()));
2200 /// IntrinsicCannotAccessMemory - Return true if the specified intrinsic cannot
2201 /// access memory and has no other side effects at all.
2202 static bool IntrinsicCannotAccessMemory(unsigned IntrinsicID) {
2203 #define GET_NO_MEMORY_INTRINSICS
2204 #include "llvm/Intrinsics.gen"
2205 #undef GET_NO_MEMORY_INTRINSICS
2209 // IntrinsicOnlyReadsMemory - Return true if the specified intrinsic doesn't
2210 // have any side-effects or if it only reads memory.
2211 static bool IntrinsicOnlyReadsMemory(unsigned IntrinsicID) {
2212 #define GET_SIDE_EFFECT_INFO
2213 #include "llvm/Intrinsics.gen"
2214 #undef GET_SIDE_EFFECT_INFO
2218 /// visitTargetIntrinsic - Lower a call of a target intrinsic to an INTRINSIC
2220 void SelectionDAGLowering::visitTargetIntrinsic(CallInst &I,
2221 unsigned Intrinsic) {
2222 bool HasChain = !IntrinsicCannotAccessMemory(Intrinsic);
2223 bool OnlyLoad = HasChain && IntrinsicOnlyReadsMemory(Intrinsic);
2225 // Build the operand list.
2226 SmallVector<SDOperand, 8> Ops;
2227 if (HasChain) { // If this intrinsic has side-effects, chainify it.
2229 // We don't need to serialize loads against other loads.
2230 Ops.push_back(DAG.getRoot());
2232 Ops.push_back(getRoot());
2236 // Add the intrinsic ID as an integer operand.
2237 Ops.push_back(DAG.getConstant(Intrinsic, TLI.getPointerTy()));
2239 // Add all operands of the call to the operand list.
2240 for (unsigned i = 1, e = I.getNumOperands(); i != e; ++i) {
2241 SDOperand Op = getValue(I.getOperand(i));
2242 assert(TLI.isTypeLegal(Op.getValueType()) &&
2243 "Intrinsic uses a non-legal type?");
2247 std::vector<MVT::ValueType> VTs;
2248 if (I.getType() != Type::VoidTy) {
2249 MVT::ValueType VT = TLI.getValueType(I.getType());
2250 if (MVT::isVector(VT)) {
2251 const VectorType *DestTy = cast<VectorType>(I.getType());
2252 MVT::ValueType EltVT = TLI.getValueType(DestTy->getElementType());
2254 VT = MVT::getVectorType(EltVT, DestTy->getNumElements());
2255 assert(VT != MVT::Other && "Intrinsic uses a non-legal type?");
2258 assert(TLI.isTypeLegal(VT) && "Intrinsic uses a non-legal type?");
2262 VTs.push_back(MVT::Other);
2264 const MVT::ValueType *VTList = DAG.getNodeValueTypes(VTs);
2269 Result = DAG.getNode(ISD::INTRINSIC_WO_CHAIN, VTList, VTs.size(),
2270 &Ops[0], Ops.size());
2271 else if (I.getType() != Type::VoidTy)
2272 Result = DAG.getNode(ISD::INTRINSIC_W_CHAIN, VTList, VTs.size(),
2273 &Ops[0], Ops.size());
2275 Result = DAG.getNode(ISD::INTRINSIC_VOID, VTList, VTs.size(),
2276 &Ops[0], Ops.size());
2279 SDOperand Chain = Result.getValue(Result.Val->getNumValues()-1);
2281 PendingLoads.push_back(Chain);
2285 if (I.getType() != Type::VoidTy) {
2286 if (const VectorType *PTy = dyn_cast<VectorType>(I.getType())) {
2287 MVT::ValueType VT = TLI.getValueType(PTy);
2288 Result = DAG.getNode(ISD::BIT_CONVERT, VT, Result);
2290 setValue(&I, Result);
2294 /// ExtractGlobalVariable - If C is a global variable, or a bitcast of one
2295 /// (possibly constant folded), return it. Otherwise return NULL.
2296 static GlobalVariable *ExtractGlobalVariable (Constant *C) {
2297 if (GlobalVariable *GV = dyn_cast<GlobalVariable>(C))
2299 else if (ConstantExpr *CE = dyn_cast<ConstantExpr>(C)) {
2300 if (CE->getOpcode() == Instruction::BitCast)
2301 return dyn_cast<GlobalVariable>(CE->getOperand(0));
2302 else if (CE->getOpcode() == Instruction::GetElementPtr) {
2303 for (unsigned i = 1, e = CE->getNumOperands(); i != e; ++i)
2304 if (!CE->getOperand(i)->isNullValue())
2306 return dyn_cast<GlobalVariable>(CE->getOperand(0));
2312 /// addCatchInfo - Extract the personality and type infos from an eh.selector
2313 /// or eh.filter call, and add them to the specified machine basic block.
2314 static void addCatchInfo(CallInst &I, MachineModuleInfo *MMI,
2315 MachineBasicBlock *MBB) {
2316 // Inform the MachineModuleInfo of the personality for this landing pad.
2317 ConstantExpr *CE = cast<ConstantExpr>(I.getOperand(2));
2318 assert(CE->getOpcode() == Instruction::BitCast &&
2319 isa<Function>(CE->getOperand(0)) &&
2320 "Personality should be a function");
2321 MMI->addPersonality(MBB, cast<Function>(CE->getOperand(0)));
2323 // Gather all the type infos for this landing pad and pass them along to
2324 // MachineModuleInfo.
2325 std::vector<GlobalVariable *> TyInfo;
2326 for (unsigned i = 3, N = I.getNumOperands(); i < N; ++i) {
2327 Constant *C = cast<Constant>(I.getOperand(i));
2328 GlobalVariable *GV = ExtractGlobalVariable(C);
2329 assert (GV || isa<ConstantPointerNull>(C) &&
2330 "TypeInfo must be a global variable or NULL");
2331 TyInfo.push_back(GV);
2333 if (I.getCalledFunction()->getIntrinsicID() == Intrinsic::eh_filter)
2334 MMI->addFilterTypeInfo(MBB, TyInfo);
2336 MMI->addCatchTypeInfo(MBB, TyInfo);
2339 /// propagateEHRegister - The specified EH register is required in a successor
2340 /// of the EH landing pad. Propagate it (by adding it to livein) to all the
2341 /// blocks in the paths between the landing pad and the specified block.
2342 static void propagateEHRegister(MachineBasicBlock *MBB, unsigned EHReg,
2343 SmallPtrSet<MachineBasicBlock*, 8> Visited) {
2344 if (MBB->isLandingPad() || !Visited.insert(MBB))
2347 MBB->addLiveIn(EHReg);
2348 for (MachineBasicBlock::pred_iterator PI = MBB->pred_begin(),
2349 E = MBB->pred_end(); PI != E; ++PI)
2350 propagateEHRegister(*PI, EHReg, Visited);
2353 static void propagateEHRegister(MachineBasicBlock *MBB, unsigned EHReg) {
2354 SmallPtrSet<MachineBasicBlock*, 8> Visited;
2355 propagateEHRegister(MBB, EHReg, Visited);
2358 /// visitIntrinsicCall - Lower the call to the specified intrinsic function. If
2359 /// we want to emit this as a call to a named external function, return the name
2360 /// otherwise lower it and return null.
2362 SelectionDAGLowering::visitIntrinsicCall(CallInst &I, unsigned Intrinsic) {
2363 switch (Intrinsic) {
2365 // By default, turn this into a target intrinsic node.
2366 visitTargetIntrinsic(I, Intrinsic);
2368 case Intrinsic::vastart: visitVAStart(I); return 0;
2369 case Intrinsic::vaend: visitVAEnd(I); return 0;
2370 case Intrinsic::vacopy: visitVACopy(I); return 0;
2371 case Intrinsic::returnaddress:
2372 setValue(&I, DAG.getNode(ISD::RETURNADDR, TLI.getPointerTy(),
2373 getValue(I.getOperand(1))));
2375 case Intrinsic::frameaddress:
2376 setValue(&I, DAG.getNode(ISD::FRAMEADDR, TLI.getPointerTy(),
2377 getValue(I.getOperand(1))));
2379 case Intrinsic::setjmp:
2380 return "_setjmp"+!TLI.usesUnderscoreSetJmp();
2382 case Intrinsic::longjmp:
2383 return "_longjmp"+!TLI.usesUnderscoreLongJmp();
2385 case Intrinsic::memcpy_i32:
2386 case Intrinsic::memcpy_i64:
2387 visitMemIntrinsic(I, ISD::MEMCPY);
2389 case Intrinsic::memset_i32:
2390 case Intrinsic::memset_i64:
2391 visitMemIntrinsic(I, ISD::MEMSET);
2393 case Intrinsic::memmove_i32:
2394 case Intrinsic::memmove_i64:
2395 visitMemIntrinsic(I, ISD::MEMMOVE);
2398 case Intrinsic::dbg_stoppoint: {
2399 MachineModuleInfo *MMI = DAG.getMachineModuleInfo();
2400 DbgStopPointInst &SPI = cast<DbgStopPointInst>(I);
2401 if (MMI && SPI.getContext() && MMI->Verify(SPI.getContext())) {
2405 Ops[1] = getValue(SPI.getLineValue());
2406 Ops[2] = getValue(SPI.getColumnValue());
2408 DebugInfoDesc *DD = MMI->getDescFor(SPI.getContext());
2409 assert(DD && "Not a debug information descriptor");
2410 CompileUnitDesc *CompileUnit = cast<CompileUnitDesc>(DD);
2412 Ops[3] = DAG.getString(CompileUnit->getFileName());
2413 Ops[4] = DAG.getString(CompileUnit->getDirectory());
2415 DAG.setRoot(DAG.getNode(ISD::LOCATION, MVT::Other, Ops, 5));
2420 case Intrinsic::dbg_region_start: {
2421 MachineModuleInfo *MMI = DAG.getMachineModuleInfo();
2422 DbgRegionStartInst &RSI = cast<DbgRegionStartInst>(I);
2423 if (MMI && RSI.getContext() && MMI->Verify(RSI.getContext())) {
2424 unsigned LabelID = MMI->RecordRegionStart(RSI.getContext());
2425 DAG.setRoot(DAG.getNode(ISD::LABEL, MVT::Other, getRoot(),
2426 DAG.getConstant(LabelID, MVT::i32)));
2431 case Intrinsic::dbg_region_end: {
2432 MachineModuleInfo *MMI = DAG.getMachineModuleInfo();
2433 DbgRegionEndInst &REI = cast<DbgRegionEndInst>(I);
2434 if (MMI && REI.getContext() && MMI->Verify(REI.getContext())) {
2435 unsigned LabelID = MMI->RecordRegionEnd(REI.getContext());
2436 DAG.setRoot(DAG.getNode(ISD::LABEL, MVT::Other,
2437 getRoot(), DAG.getConstant(LabelID, MVT::i32)));
2442 case Intrinsic::dbg_func_start: {
2443 MachineModuleInfo *MMI = DAG.getMachineModuleInfo();
2444 DbgFuncStartInst &FSI = cast<DbgFuncStartInst>(I);
2445 if (MMI && FSI.getSubprogram() &&
2446 MMI->Verify(FSI.getSubprogram())) {
2447 unsigned LabelID = MMI->RecordRegionStart(FSI.getSubprogram());
2448 DAG.setRoot(DAG.getNode(ISD::LABEL, MVT::Other,
2449 getRoot(), DAG.getConstant(LabelID, MVT::i32)));
2454 case Intrinsic::dbg_declare: {
2455 MachineModuleInfo *MMI = DAG.getMachineModuleInfo();
2456 DbgDeclareInst &DI = cast<DbgDeclareInst>(I);
2457 if (MMI && DI.getVariable() && MMI->Verify(DI.getVariable())) {
2458 SDOperand AddressOp = getValue(DI.getAddress());
2459 if (FrameIndexSDNode *FI = dyn_cast<FrameIndexSDNode>(AddressOp))
2460 MMI->RecordVariable(DI.getVariable(), FI->getIndex());
2466 case Intrinsic::eh_exception: {
2467 if (ExceptionHandling) {
2468 if (!CurMBB->isLandingPad() && TLI.getExceptionAddressRegister())
2469 propagateEHRegister(CurMBB, TLI.getExceptionAddressRegister());
2471 // Insert the EXCEPTIONADDR instruction.
2472 SDVTList VTs = DAG.getVTList(TLI.getPointerTy(), MVT::Other);
2474 Ops[0] = DAG.getRoot();
2475 SDOperand Op = DAG.getNode(ISD::EXCEPTIONADDR, VTs, Ops, 1);
2477 DAG.setRoot(Op.getValue(1));
2479 setValue(&I, DAG.getConstant(0, TLI.getPointerTy()));
2484 case Intrinsic::eh_selector:
2485 case Intrinsic::eh_filter:{
2486 MachineModuleInfo *MMI = DAG.getMachineModuleInfo();
2488 if (ExceptionHandling && MMI) {
2489 if (CurMBB->isLandingPad())
2490 addCatchInfo(I, MMI, CurMBB);
2493 FuncInfo.CatchInfoLost.insert(&I);
2495 if (TLI.getExceptionSelectorRegister())
2496 propagateEHRegister(CurMBB, TLI.getExceptionSelectorRegister());
2499 // Insert the EHSELECTION instruction.
2500 SDVTList VTs = DAG.getVTList(TLI.getPointerTy(), MVT::Other);
2502 Ops[0] = getValue(I.getOperand(1));
2504 SDOperand Op = DAG.getNode(ISD::EHSELECTION, VTs, Ops, 2);
2506 DAG.setRoot(Op.getValue(1));
2508 setValue(&I, DAG.getConstant(0, TLI.getPointerTy()));
2514 case Intrinsic::eh_typeid_for: {
2515 MachineModuleInfo *MMI = DAG.getMachineModuleInfo();
2518 // Find the type id for the given typeinfo.
2519 Constant *C = cast<Constant>(I.getOperand(1));
2520 GlobalVariable *GV = ExtractGlobalVariable(C);
2521 assert (GV || isa<ConstantPointerNull>(C) &&
2522 "TypeInfo must be a global variable or NULL");
2524 unsigned TypeID = MMI->getTypeIDFor(GV);
2525 setValue(&I, DAG.getConstant(TypeID, MVT::i32));
2527 setValue(&I, DAG.getConstant(0, MVT::i32));
2533 case Intrinsic::sqrt_f32:
2534 case Intrinsic::sqrt_f64:
2535 setValue(&I, DAG.getNode(ISD::FSQRT,
2536 getValue(I.getOperand(1)).getValueType(),
2537 getValue(I.getOperand(1))));
2539 case Intrinsic::powi_f32:
2540 case Intrinsic::powi_f64:
2541 setValue(&I, DAG.getNode(ISD::FPOWI,
2542 getValue(I.getOperand(1)).getValueType(),
2543 getValue(I.getOperand(1)),
2544 getValue(I.getOperand(2))));
2546 case Intrinsic::pcmarker: {
2547 SDOperand Tmp = getValue(I.getOperand(1));
2548 DAG.setRoot(DAG.getNode(ISD::PCMARKER, MVT::Other, getRoot(), Tmp));
2551 case Intrinsic::readcyclecounter: {
2552 SDOperand Op = getRoot();
2553 SDOperand Tmp = DAG.getNode(ISD::READCYCLECOUNTER,
2554 DAG.getNodeValueTypes(MVT::i64, MVT::Other), 2,
2557 DAG.setRoot(Tmp.getValue(1));
2560 case Intrinsic::part_select: {
2561 // Currently not implemented: just abort
2562 assert(0 && "part_select intrinsic not implemented");
2565 case Intrinsic::part_set: {
2566 // Currently not implemented: just abort
2567 assert(0 && "part_set intrinsic not implemented");
2570 case Intrinsic::bswap:
2571 setValue(&I, DAG.getNode(ISD::BSWAP,
2572 getValue(I.getOperand(1)).getValueType(),
2573 getValue(I.getOperand(1))));
2575 case Intrinsic::cttz: {
2576 SDOperand Arg = getValue(I.getOperand(1));
2577 MVT::ValueType Ty = Arg.getValueType();
2578 SDOperand result = DAG.getNode(ISD::CTTZ, Ty, Arg);
2580 result = DAG.getNode(ISD::ZERO_EXTEND, MVT::i32, result);
2581 else if (Ty > MVT::i32)
2582 result = DAG.getNode(ISD::TRUNCATE, MVT::i32, result);
2583 setValue(&I, result);
2586 case Intrinsic::ctlz: {
2587 SDOperand Arg = getValue(I.getOperand(1));
2588 MVT::ValueType Ty = Arg.getValueType();
2589 SDOperand result = DAG.getNode(ISD::CTLZ, Ty, Arg);
2591 result = DAG.getNode(ISD::ZERO_EXTEND, MVT::i32, result);
2592 else if (Ty > MVT::i32)
2593 result = DAG.getNode(ISD::TRUNCATE, MVT::i32, result);
2594 setValue(&I, result);
2597 case Intrinsic::ctpop: {
2598 SDOperand Arg = getValue(I.getOperand(1));
2599 MVT::ValueType Ty = Arg.getValueType();
2600 SDOperand result = DAG.getNode(ISD::CTPOP, Ty, Arg);
2602 result = DAG.getNode(ISD::ZERO_EXTEND, MVT::i32, result);
2603 else if (Ty > MVT::i32)
2604 result = DAG.getNode(ISD::TRUNCATE, MVT::i32, result);
2605 setValue(&I, result);
2608 case Intrinsic::stacksave: {
2609 SDOperand Op = getRoot();
2610 SDOperand Tmp = DAG.getNode(ISD::STACKSAVE,
2611 DAG.getNodeValueTypes(TLI.getPointerTy(), MVT::Other), 2, &Op, 1);
2613 DAG.setRoot(Tmp.getValue(1));
2616 case Intrinsic::stackrestore: {
2617 SDOperand Tmp = getValue(I.getOperand(1));
2618 DAG.setRoot(DAG.getNode(ISD::STACKRESTORE, MVT::Other, getRoot(), Tmp));
2621 case Intrinsic::prefetch:
2622 // FIXME: Currently discarding prefetches.
2625 case Intrinsic::var_annotation:
2626 // Discard annotate attributes
2632 void SelectionDAGLowering::LowerCallTo(Instruction &I,
2633 const Type *CalledValueTy,
2634 unsigned CallingConv,
2636 SDOperand Callee, unsigned OpIdx,
2637 MachineBasicBlock *LandingPad) {
2638 const PointerType *PT = cast<PointerType>(CalledValueTy);
2639 const FunctionType *FTy = cast<FunctionType>(PT->getElementType());
2640 const ParamAttrsList *Attrs = FTy->getParamAttrs();
2641 MachineModuleInfo *MMI = DAG.getMachineModuleInfo();
2642 unsigned BeginLabel = 0, EndLabel = 0;
2644 TargetLowering::ArgListTy Args;
2645 TargetLowering::ArgListEntry Entry;
2646 Args.reserve(I.getNumOperands());
2647 for (unsigned i = OpIdx, e = I.getNumOperands(); i != e; ++i) {
2648 Value *Arg = I.getOperand(i);
2649 SDOperand ArgNode = getValue(Arg);
2650 Entry.Node = ArgNode; Entry.Ty = Arg->getType();
2652 unsigned attrInd = i - OpIdx + 1;
2653 Entry.isSExt = Attrs && Attrs->paramHasAttr(attrInd, ParamAttr::SExt);
2654 Entry.isZExt = Attrs && Attrs->paramHasAttr(attrInd, ParamAttr::ZExt);
2655 Entry.isInReg = Attrs && Attrs->paramHasAttr(attrInd, ParamAttr::InReg);
2656 Entry.isSRet = Attrs && Attrs->paramHasAttr(attrInd, ParamAttr::StructRet);
2657 Args.push_back(Entry);
2660 if (ExceptionHandling && MMI) {
2661 // Insert a label before the invoke call to mark the try range. This can be
2662 // used to detect deletion of the invoke via the MachineModuleInfo.
2663 BeginLabel = MMI->NextLabelID();
2664 DAG.setRoot(DAG.getNode(ISD::LABEL, MVT::Other, getRoot(),
2665 DAG.getConstant(BeginLabel, MVT::i32)));
2668 std::pair<SDOperand,SDOperand> Result =
2669 TLI.LowerCallTo(getRoot(), I.getType(),
2670 Attrs && Attrs->paramHasAttr(0, ParamAttr::SExt),
2671 FTy->isVarArg(), CallingConv, IsTailCall,
2673 if (I.getType() != Type::VoidTy)
2674 setValue(&I, Result.first);
2675 DAG.setRoot(Result.second);
2677 if (ExceptionHandling && MMI) {
2678 // Insert a label at the end of the invoke call to mark the try range. This
2679 // can be used to detect deletion of the invoke via the MachineModuleInfo.
2680 EndLabel = MMI->NextLabelID();
2681 DAG.setRoot(DAG.getNode(ISD::LABEL, MVT::Other, getRoot(),
2682 DAG.getConstant(EndLabel, MVT::i32)));
2684 // Inform MachineModuleInfo of range.
2685 MMI->addInvoke(LandingPad, BeginLabel, EndLabel);
2690 void SelectionDAGLowering::visitCall(CallInst &I) {
2691 const char *RenameFn = 0;
2692 if (Function *F = I.getCalledFunction()) {
2693 if (F->isDeclaration())
2694 if (unsigned IID = F->getIntrinsicID()) {
2695 RenameFn = visitIntrinsicCall(I, IID);
2698 } else { // Not an LLVM intrinsic.
2699 const std::string &Name = F->getName();
2700 if (Name[0] == 'c' && (Name == "copysign" || Name == "copysignf")) {
2701 if (I.getNumOperands() == 3 && // Basic sanity checks.
2702 I.getOperand(1)->getType()->isFloatingPoint() &&
2703 I.getType() == I.getOperand(1)->getType() &&
2704 I.getType() == I.getOperand(2)->getType()) {
2705 SDOperand LHS = getValue(I.getOperand(1));
2706 SDOperand RHS = getValue(I.getOperand(2));
2707 setValue(&I, DAG.getNode(ISD::FCOPYSIGN, LHS.getValueType(),
2711 } else if (Name[0] == 'f' && (Name == "fabs" || Name == "fabsf")) {
2712 if (I.getNumOperands() == 2 && // Basic sanity checks.
2713 I.getOperand(1)->getType()->isFloatingPoint() &&
2714 I.getType() == I.getOperand(1)->getType()) {
2715 SDOperand Tmp = getValue(I.getOperand(1));
2716 setValue(&I, DAG.getNode(ISD::FABS, Tmp.getValueType(), Tmp));
2719 } else if (Name[0] == 's' && (Name == "sin" || Name == "sinf")) {
2720 if (I.getNumOperands() == 2 && // Basic sanity checks.
2721 I.getOperand(1)->getType()->isFloatingPoint() &&
2722 I.getType() == I.getOperand(1)->getType()) {
2723 SDOperand Tmp = getValue(I.getOperand(1));
2724 setValue(&I, DAG.getNode(ISD::FSIN, Tmp.getValueType(), Tmp));
2727 } else if (Name[0] == 'c' && (Name == "cos" || Name == "cosf")) {
2728 if (I.getNumOperands() == 2 && // Basic sanity checks.
2729 I.getOperand(1)->getType()->isFloatingPoint() &&
2730 I.getType() == I.getOperand(1)->getType()) {
2731 SDOperand Tmp = getValue(I.getOperand(1));
2732 setValue(&I, DAG.getNode(ISD::FCOS, Tmp.getValueType(), Tmp));
2737 } else if (isa<InlineAsm>(I.getOperand(0))) {
2744 Callee = getValue(I.getOperand(0));
2746 Callee = DAG.getExternalSymbol(RenameFn, TLI.getPointerTy());
2748 LowerCallTo(I, I.getCalledValue()->getType(),
2756 /// getCopyFromParts - Create a value that contains the
2757 /// specified legal parts combined into the value they represent.
2758 static SDOperand getCopyFromParts(SelectionDAG &DAG,
2759 const SDOperand *Parts,
2761 MVT::ValueType PartVT,
2762 MVT::ValueType ValueVT,
2763 ISD::NodeType AssertOp = ISD::DELETED_NODE) {
2764 if (!MVT::isVector(ValueVT) || NumParts == 1) {
2765 SDOperand Val = Parts[0];
2767 // If the value was expanded, copy from the top part.
2769 assert(NumParts == 2 &&
2770 "Cannot expand to more than 2 elts yet!");
2771 SDOperand Hi = Parts[1];
2772 return DAG.getNode(ISD::BUILD_PAIR, ValueVT, Val, Hi);
2775 // Otherwise, if the value was promoted or extended, truncate it to the
2776 // appropriate type.
2777 if (PartVT == ValueVT)
2780 if (MVT::isVector(PartVT)) {
2781 assert(MVT::isVector(ValueVT) && "Unknown vector conversion!");
2782 return DAG.getNode(ISD::BIT_CONVERT, PartVT, Val);
2785 if (MVT::isInteger(PartVT) &&
2786 MVT::isInteger(ValueVT)) {
2787 if (ValueVT < PartVT) {
2788 // For a truncate, see if we have any information to
2789 // indicate whether the truncated bits will always be
2790 // zero or sign-extension.
2791 if (AssertOp != ISD::DELETED_NODE)
2792 Val = DAG.getNode(AssertOp, PartVT, Val,
2793 DAG.getValueType(ValueVT));
2794 return DAG.getNode(ISD::TRUNCATE, ValueVT, Val);
2796 return DAG.getNode(ISD::ANY_EXTEND, ValueVT, Val);
2800 if (MVT::isFloatingPoint(PartVT) &&
2801 MVT::isFloatingPoint(ValueVT))
2802 return DAG.getNode(ISD::FP_ROUND, ValueVT, Val);
2804 if (MVT::getSizeInBits(PartVT) ==
2805 MVT::getSizeInBits(ValueVT))
2806 return DAG.getNode(ISD::BIT_CONVERT, ValueVT, Val);
2808 assert(0 && "Unknown mismatch!");
2811 // Handle a multi-element vector.
2812 MVT::ValueType IntermediateVT, RegisterVT;
2813 unsigned NumIntermediates;
2815 DAG.getTargetLoweringInfo()
2816 .getVectorTypeBreakdown(ValueVT, IntermediateVT, NumIntermediates,
2819 assert(NumRegs == NumParts && "Part count doesn't match vector breakdown!");
2820 assert(RegisterVT == PartVT && "Part type doesn't match vector breakdown!");
2821 assert(RegisterVT == Parts[0].getValueType() &&
2822 "Part type doesn't match part!");
2824 // Assemble the parts into intermediate operands.
2825 SmallVector<SDOperand, 8> Ops(NumIntermediates);
2826 if (NumIntermediates == NumParts) {
2827 // If the register was not expanded, truncate or copy the value,
2829 for (unsigned i = 0; i != NumParts; ++i)
2830 Ops[i] = getCopyFromParts(DAG, &Parts[i], 1, PartVT, IntermediateVT);
2831 } else if (NumParts > 0) {
2832 // If the intermediate type was expanded, build the intermediate operands
2834 assert(NumIntermediates % NumParts == 0 &&
2835 "Must expand into a divisible number of parts!");
2836 unsigned Factor = NumIntermediates / NumParts;
2837 for (unsigned i = 0; i != NumIntermediates; ++i)
2838 Ops[i] = getCopyFromParts(DAG, &Parts[i * Factor], Factor,
2839 PartVT, IntermediateVT);
2842 // Build a vector with BUILD_VECTOR or CONCAT_VECTORS from the intermediate
2844 return DAG.getNode(MVT::isVector(IntermediateVT) ?
2845 ISD::CONCAT_VECTORS :
2847 ValueVT, &Ops[0], NumParts);
2850 /// getCopyToParts - Create a series of nodes that contain the
2851 /// specified value split into legal parts.
2852 static void getCopyToParts(SelectionDAG &DAG,
2856 MVT::ValueType PartVT) {
2857 MVT::ValueType ValueVT = Val.getValueType();
2859 if (!MVT::isVector(ValueVT) || NumParts == 1) {
2860 // If the value was expanded, copy from the parts.
2862 for (unsigned i = 0; i < NumParts; ++i)
2863 Parts[i] = DAG.getNode(ISD::EXTRACT_ELEMENT, PartVT, Val,
2864 DAG.getConstant(i, MVT::i32));
2868 // If there is a single part and the types differ, this must be
2870 if (PartVT != ValueVT) {
2871 if (MVT::isVector(PartVT)) {
2872 assert(MVT::isVector(ValueVT) &&
2873 "Not a vector-vector cast?");
2874 Val = DAG.getNode(ISD::BIT_CONVERT, PartVT, Val);
2875 } else if (MVT::isInteger(PartVT) && MVT::isInteger(ValueVT)) {
2876 if (PartVT < ValueVT)
2877 Val = DAG.getNode(ISD::TRUNCATE, PartVT, Val);
2879 Val = DAG.getNode(ISD::ANY_EXTEND, PartVT, Val);
2880 } else if (MVT::isFloatingPoint(PartVT) &&
2881 MVT::isFloatingPoint(ValueVT)) {
2882 Val = DAG.getNode(ISD::FP_EXTEND, PartVT, Val);
2883 } else if (MVT::getSizeInBits(PartVT) ==
2884 MVT::getSizeInBits(ValueVT)) {
2885 Val = DAG.getNode(ISD::BIT_CONVERT, PartVT, Val);
2887 assert(0 && "Unknown mismatch!");
2894 // Handle a multi-element vector.
2895 MVT::ValueType IntermediateVT, RegisterVT;
2896 unsigned NumIntermediates;
2898 DAG.getTargetLoweringInfo()
2899 .getVectorTypeBreakdown(ValueVT, IntermediateVT, NumIntermediates,
2901 unsigned NumElements = MVT::getVectorNumElements(ValueVT);
2903 assert(NumRegs == NumParts && "Part count doesn't match vector breakdown!");
2904 assert(RegisterVT == PartVT && "Part type doesn't match vector breakdown!");
2906 // Split the vector into intermediate operands.
2907 SmallVector<SDOperand, 8> Ops(NumIntermediates);
2908 for (unsigned i = 0; i != NumIntermediates; ++i)
2909 if (MVT::isVector(IntermediateVT))
2910 Ops[i] = DAG.getNode(ISD::EXTRACT_SUBVECTOR,
2911 IntermediateVT, Val,
2912 DAG.getConstant(i * (NumElements / NumIntermediates),
2915 Ops[i] = DAG.getNode(ISD::EXTRACT_VECTOR_ELT,
2916 IntermediateVT, Val,
2917 DAG.getConstant(i, MVT::i32));
2919 // Split the intermediate operands into legal parts.
2920 if (NumParts == NumIntermediates) {
2921 // If the register was not expanded, promote or copy the value,
2923 for (unsigned i = 0; i != NumParts; ++i)
2924 getCopyToParts(DAG, Ops[i], &Parts[i], 1, PartVT);
2925 } else if (NumParts > 0) {
2926 // If the intermediate type was expanded, split each the value into
2928 assert(NumParts % NumIntermediates == 0 &&
2929 "Must expand into a divisible number of parts!");
2930 unsigned Factor = NumParts / NumIntermediates;
2931 for (unsigned i = 0; i != NumIntermediates; ++i)
2932 getCopyToParts(DAG, Ops[i], &Parts[i * Factor], Factor, PartVT);
2937 /// getCopyFromRegs - Emit a series of CopyFromReg nodes that copies from
2938 /// this value and returns the result as a ValueVT value. This uses
2939 /// Chain/Flag as the input and updates them for the output Chain/Flag.
2940 /// If the Flag pointer is NULL, no flag is used.
2941 SDOperand RegsForValue::getCopyFromRegs(SelectionDAG &DAG,
2942 SDOperand &Chain, SDOperand *Flag)const{
2943 // Get the list of registers, in the appropriate order.
2944 std::vector<unsigned> R(Regs);
2945 if (!DAG.getTargetLoweringInfo().isLittleEndian())
2946 std::reverse(R.begin(), R.end());
2948 // Copy the legal parts from the registers.
2949 unsigned NumParts = Regs.size();
2950 SmallVector<SDOperand, 8> Parts(NumParts);
2951 for (unsigned i = 0; i < NumParts; ++i) {
2952 SDOperand Part = Flag ?
2953 DAG.getCopyFromReg(Chain, Regs[i], RegVT, *Flag) :
2954 DAG.getCopyFromReg(Chain, Regs[i], RegVT);
2955 Chain = Part.getValue(1);
2957 *Flag = Part.getValue(2);
2961 // Assemble the legal parts into the final value.
2962 return getCopyFromParts(DAG, &Parts[0], NumParts, RegVT, ValueVT);
2965 /// getCopyToRegs - Emit a series of CopyToReg nodes that copies the
2966 /// specified value into the registers specified by this object. This uses
2967 /// Chain/Flag as the input and updates them for the output Chain/Flag.
2968 /// If the Flag pointer is NULL, no flag is used.
2969 void RegsForValue::getCopyToRegs(SDOperand Val, SelectionDAG &DAG,
2970 SDOperand &Chain, SDOperand *Flag) const {
2971 // Get the list of registers, in the appropriate order.
2972 std::vector<unsigned> R(Regs);
2973 if (!DAG.getTargetLoweringInfo().isLittleEndian())
2974 std::reverse(R.begin(), R.end());
2976 // Get the list of the values's legal parts.
2977 unsigned NumParts = Regs.size();
2978 SmallVector<SDOperand, 8> Parts(NumParts);
2979 getCopyToParts(DAG, Val, &Parts[0], NumParts, RegVT);
2981 // Copy the parts into the registers.
2982 for (unsigned i = 0; i < NumParts; ++i) {
2983 SDOperand Part = Flag ?
2984 DAG.getCopyToReg(Chain, R[i], Parts[i], *Flag) :
2985 DAG.getCopyToReg(Chain, R[i], Parts[i]);
2986 Chain = Part.getValue(0);
2988 *Flag = Part.getValue(1);
2992 /// AddInlineAsmOperands - Add this value to the specified inlineasm node
2993 /// operand list. This adds the code marker and includes the number of
2994 /// values added into it.
2995 void RegsForValue::AddInlineAsmOperands(unsigned Code, SelectionDAG &DAG,
2996 std::vector<SDOperand> &Ops) const {
2997 MVT::ValueType IntPtrTy = DAG.getTargetLoweringInfo().getPointerTy();
2998 Ops.push_back(DAG.getTargetConstant(Code | (Regs.size() << 3), IntPtrTy));
2999 for (unsigned i = 0, e = Regs.size(); i != e; ++i)
3000 Ops.push_back(DAG.getRegister(Regs[i], RegVT));
3003 /// isAllocatableRegister - If the specified register is safe to allocate,
3004 /// i.e. it isn't a stack pointer or some other special register, return the
3005 /// register class for the register. Otherwise, return null.
3006 static const TargetRegisterClass *
3007 isAllocatableRegister(unsigned Reg, MachineFunction &MF,
3008 const TargetLowering &TLI, const MRegisterInfo *MRI) {
3009 MVT::ValueType FoundVT = MVT::Other;
3010 const TargetRegisterClass *FoundRC = 0;
3011 for (MRegisterInfo::regclass_iterator RCI = MRI->regclass_begin(),
3012 E = MRI->regclass_end(); RCI != E; ++RCI) {
3013 MVT::ValueType ThisVT = MVT::Other;
3015 const TargetRegisterClass *RC = *RCI;
3016 // If none of the the value types for this register class are valid, we
3017 // can't use it. For example, 64-bit reg classes on 32-bit targets.
3018 for (TargetRegisterClass::vt_iterator I = RC->vt_begin(), E = RC->vt_end();
3020 if (TLI.isTypeLegal(*I)) {
3021 // If we have already found this register in a different register class,
3022 // choose the one with the largest VT specified. For example, on
3023 // PowerPC, we favor f64 register classes over f32.
3024 if (FoundVT == MVT::Other ||
3025 MVT::getSizeInBits(FoundVT) < MVT::getSizeInBits(*I)) {
3032 if (ThisVT == MVT::Other) continue;
3034 // NOTE: This isn't ideal. In particular, this might allocate the
3035 // frame pointer in functions that need it (due to them not being taken
3036 // out of allocation, because a variable sized allocation hasn't been seen
3037 // yet). This is a slight code pessimization, but should still work.
3038 for (TargetRegisterClass::iterator I = RC->allocation_order_begin(MF),
3039 E = RC->allocation_order_end(MF); I != E; ++I)
3041 // We found a matching register class. Keep looking at others in case
3042 // we find one with larger registers that this physreg is also in.
3053 /// AsmOperandInfo - This contains information for each constraint that we are
3055 struct AsmOperandInfo : public InlineAsm::ConstraintInfo {
3056 /// ConstraintCode - This contains the actual string for the code, like "m".
3057 std::string ConstraintCode;
3059 /// ConstraintType - Information about the constraint code, e.g. Register,
3060 /// RegisterClass, Memory, Other, Unknown.
3061 TargetLowering::ConstraintType ConstraintType;
3063 /// CallOperand/CallOperandval - If this is the result output operand or a
3064 /// clobber, this is null, otherwise it is the incoming operand to the
3065 /// CallInst. This gets modified as the asm is processed.
3066 SDOperand CallOperand;
3067 Value *CallOperandVal;
3069 /// ConstraintVT - The ValueType for the operand value.
3070 MVT::ValueType ConstraintVT;
3072 /// AssignedRegs - If this is a register or register class operand, this
3073 /// contains the set of register corresponding to the operand.
3074 RegsForValue AssignedRegs;
3076 AsmOperandInfo(const InlineAsm::ConstraintInfo &info)
3077 : InlineAsm::ConstraintInfo(info),
3078 ConstraintType(TargetLowering::C_Unknown),
3079 CallOperand(0,0), CallOperandVal(0), ConstraintVT(MVT::Other) {
3082 void ComputeConstraintToUse(const TargetLowering &TLI);
3084 /// MarkAllocatedRegs - Once AssignedRegs is set, mark the assigned registers
3085 /// busy in OutputRegs/InputRegs.
3086 void MarkAllocatedRegs(bool isOutReg, bool isInReg,
3087 std::set<unsigned> &OutputRegs,
3088 std::set<unsigned> &InputRegs) const {
3090 OutputRegs.insert(AssignedRegs.Regs.begin(), AssignedRegs.Regs.end());
3092 InputRegs.insert(AssignedRegs.Regs.begin(), AssignedRegs.Regs.end());
3095 } // end anon namespace.
3097 /// getConstraintGenerality - Return an integer indicating how general CT is.
3098 static unsigned getConstraintGenerality(TargetLowering::ConstraintType CT) {
3100 default: assert(0 && "Unknown constraint type!");
3101 case TargetLowering::C_Other:
3102 case TargetLowering::C_Unknown:
3104 case TargetLowering::C_Register:
3106 case TargetLowering::C_RegisterClass:
3108 case TargetLowering::C_Memory:
3113 void AsmOperandInfo::ComputeConstraintToUse(const TargetLowering &TLI) {
3114 assert(!Codes.empty() && "Must have at least one constraint");
3116 std::string *Current = &Codes[0];
3117 TargetLowering::ConstraintType CurType = TLI.getConstraintType(*Current);
3118 if (Codes.size() == 1) { // Single-letter constraints ('r') are very common.
3119 ConstraintCode = *Current;
3120 ConstraintType = CurType;
3124 unsigned CurGenerality = getConstraintGenerality(CurType);
3126 // If we have multiple constraints, try to pick the most general one ahead
3127 // of time. This isn't a wonderful solution, but handles common cases.
3128 for (unsigned j = 1, e = Codes.size(); j != e; ++j) {
3129 TargetLowering::ConstraintType ThisType = TLI.getConstraintType(Codes[j]);
3130 unsigned ThisGenerality = getConstraintGenerality(ThisType);
3131 if (ThisGenerality > CurGenerality) {
3132 // This constraint letter is more general than the previous one,
3135 Current = &Codes[j];
3136 CurGenerality = ThisGenerality;
3140 ConstraintCode = *Current;
3141 ConstraintType = CurType;
3145 void SelectionDAGLowering::
3146 GetRegistersForValue(AsmOperandInfo &OpInfo, bool HasEarlyClobber,
3147 std::set<unsigned> &OutputRegs,
3148 std::set<unsigned> &InputRegs) {
3149 // Compute whether this value requires an input register, an output register,
3151 bool isOutReg = false;
3152 bool isInReg = false;
3153 switch (OpInfo.Type) {
3154 case InlineAsm::isOutput:
3157 // If this is an early-clobber output, or if there is an input
3158 // constraint that matches this, we need to reserve the input register
3159 // so no other inputs allocate to it.
3160 isInReg = OpInfo.isEarlyClobber || OpInfo.hasMatchingInput;
3162 case InlineAsm::isInput:
3166 case InlineAsm::isClobber:
3173 MachineFunction &MF = DAG.getMachineFunction();
3174 std::vector<unsigned> Regs;
3176 // If this is a constraint for a single physreg, or a constraint for a
3177 // register class, find it.
3178 std::pair<unsigned, const TargetRegisterClass*> PhysReg =
3179 TLI.getRegForInlineAsmConstraint(OpInfo.ConstraintCode,
3180 OpInfo.ConstraintVT);
3182 unsigned NumRegs = 1;
3183 if (OpInfo.ConstraintVT != MVT::Other)
3184 NumRegs = TLI.getNumRegisters(OpInfo.ConstraintVT);
3185 MVT::ValueType RegVT;
3186 MVT::ValueType ValueVT = OpInfo.ConstraintVT;
3189 // If this is a constraint for a specific physical register, like {r17},
3191 if (PhysReg.first) {
3192 if (OpInfo.ConstraintVT == MVT::Other)
3193 ValueVT = *PhysReg.second->vt_begin();
3195 // Get the actual register value type. This is important, because the user
3196 // may have asked for (e.g.) the AX register in i32 type. We need to
3197 // remember that AX is actually i16 to get the right extension.
3198 RegVT = *PhysReg.second->vt_begin();
3200 // This is a explicit reference to a physical register.
3201 Regs.push_back(PhysReg.first);
3203 // If this is an expanded reference, add the rest of the regs to Regs.
3205 TargetRegisterClass::iterator I = PhysReg.second->begin();
3206 TargetRegisterClass::iterator E = PhysReg.second->end();
3207 for (; *I != PhysReg.first; ++I)
3208 assert(I != E && "Didn't find reg!");
3210 // Already added the first reg.
3212 for (; NumRegs; --NumRegs, ++I) {
3213 assert(I != E && "Ran out of registers to allocate!");
3217 OpInfo.AssignedRegs = RegsForValue(Regs, RegVT, ValueVT);
3218 OpInfo.MarkAllocatedRegs(isOutReg, isInReg, OutputRegs, InputRegs);
3222 // Otherwise, if this was a reference to an LLVM register class, create vregs
3223 // for this reference.
3224 std::vector<unsigned> RegClassRegs;
3225 const TargetRegisterClass *RC = PhysReg.second;
3227 // If this is an early clobber or tied register, our regalloc doesn't know
3228 // how to maintain the constraint. If it isn't, go ahead and create vreg
3229 // and let the regalloc do the right thing.
3230 if (!OpInfo.hasMatchingInput && !OpInfo.isEarlyClobber &&
3231 // If there is some other early clobber and this is an input register,
3232 // then we are forced to pre-allocate the input reg so it doesn't
3233 // conflict with the earlyclobber.
3234 !(OpInfo.Type == InlineAsm::isInput && HasEarlyClobber)) {
3235 RegVT = *PhysReg.second->vt_begin();
3237 if (OpInfo.ConstraintVT == MVT::Other)
3240 // Create the appropriate number of virtual registers.
3241 SSARegMap *RegMap = MF.getSSARegMap();
3242 for (; NumRegs; --NumRegs)
3243 Regs.push_back(RegMap->createVirtualRegister(PhysReg.second));
3245 OpInfo.AssignedRegs = RegsForValue(Regs, RegVT, ValueVT);
3246 OpInfo.MarkAllocatedRegs(isOutReg, isInReg, OutputRegs, InputRegs);
3250 // Otherwise, we can't allocate it. Let the code below figure out how to
3251 // maintain these constraints.
3252 RegClassRegs.assign(PhysReg.second->begin(), PhysReg.second->end());
3255 // This is a reference to a register class that doesn't directly correspond
3256 // to an LLVM register class. Allocate NumRegs consecutive, available,
3257 // registers from the class.
3258 RegClassRegs = TLI.getRegClassForInlineAsmConstraint(OpInfo.ConstraintCode,
3259 OpInfo.ConstraintVT);
3262 const MRegisterInfo *MRI = DAG.getTarget().getRegisterInfo();
3263 unsigned NumAllocated = 0;
3264 for (unsigned i = 0, e = RegClassRegs.size(); i != e; ++i) {
3265 unsigned Reg = RegClassRegs[i];
3266 // See if this register is available.
3267 if ((isOutReg && OutputRegs.count(Reg)) || // Already used.
3268 (isInReg && InputRegs.count(Reg))) { // Already used.
3269 // Make sure we find consecutive registers.
3274 // Check to see if this register is allocatable (i.e. don't give out the
3277 RC = isAllocatableRegister(Reg, MF, TLI, MRI);
3278 if (!RC) { // Couldn't allocate this register.
3279 // Reset NumAllocated to make sure we return consecutive registers.
3285 // Okay, this register is good, we can use it.
3288 // If we allocated enough consecutive registers, succeed.
3289 if (NumAllocated == NumRegs) {
3290 unsigned RegStart = (i-NumAllocated)+1;
3291 unsigned RegEnd = i+1;
3292 // Mark all of the allocated registers used.
3293 for (unsigned i = RegStart; i != RegEnd; ++i)
3294 Regs.push_back(RegClassRegs[i]);
3296 OpInfo.AssignedRegs = RegsForValue(Regs, *RC->vt_begin(),
3297 OpInfo.ConstraintVT);
3298 OpInfo.MarkAllocatedRegs(isOutReg, isInReg, OutputRegs, InputRegs);
3303 // Otherwise, we couldn't allocate enough registers for this.
3308 /// visitInlineAsm - Handle a call to an InlineAsm object.
3310 void SelectionDAGLowering::visitInlineAsm(CallInst &I) {
3311 InlineAsm *IA = cast<InlineAsm>(I.getOperand(0));
3313 /// ConstraintOperands - Information about all of the constraints.
3314 std::vector<AsmOperandInfo> ConstraintOperands;
3316 SDOperand Chain = getRoot();
3319 std::set<unsigned> OutputRegs, InputRegs;
3321 // Do a prepass over the constraints, canonicalizing them, and building up the
3322 // ConstraintOperands list.
3323 std::vector<InlineAsm::ConstraintInfo>
3324 ConstraintInfos = IA->ParseConstraints();
3326 // SawEarlyClobber - Keep track of whether we saw an earlyclobber output
3327 // constraint. If so, we can't let the register allocator allocate any input
3328 // registers, because it will not know to avoid the earlyclobbered output reg.
3329 bool SawEarlyClobber = false;
3331 unsigned OpNo = 1; // OpNo - The operand of the CallInst.
3332 for (unsigned i = 0, e = ConstraintInfos.size(); i != e; ++i) {
3333 ConstraintOperands.push_back(AsmOperandInfo(ConstraintInfos[i]));
3334 AsmOperandInfo &OpInfo = ConstraintOperands.back();
3336 MVT::ValueType OpVT = MVT::Other;
3338 // Compute the value type for each operand.
3339 switch (OpInfo.Type) {
3340 case InlineAsm::isOutput:
3341 if (!OpInfo.isIndirect) {
3342 // The return value of the call is this value. As such, there is no
3343 // corresponding argument.
3344 assert(I.getType() != Type::VoidTy && "Bad inline asm!");
3345 OpVT = TLI.getValueType(I.getType());
3347 OpInfo.CallOperandVal = I.getOperand(OpNo++);
3350 case InlineAsm::isInput:
3351 OpInfo.CallOperandVal = I.getOperand(OpNo++);
3353 case InlineAsm::isClobber:
3358 // If this is an input or an indirect output, process the call argument.
3359 if (OpInfo.CallOperandVal) {
3360 OpInfo.CallOperand = getValue(OpInfo.CallOperandVal);
3361 const Type *OpTy = OpInfo.CallOperandVal->getType();
3362 // If this is an indirect operand, the operand is a pointer to the
3364 if (OpInfo.isIndirect)
3365 OpTy = cast<PointerType>(OpTy)->getElementType();
3367 // If OpTy is not a first-class value, it may be a struct/union that we
3368 // can tile with integers.
3369 if (!OpTy->isFirstClassType() && OpTy->isSized()) {
3370 unsigned BitSize = TD->getTypeSizeInBits(OpTy);
3378 OpTy = IntegerType::get(BitSize);
3383 OpVT = TLI.getValueType(OpTy, true);
3386 OpInfo.ConstraintVT = OpVT;
3388 // Compute the constraint code and ConstraintType to use.
3389 OpInfo.ComputeConstraintToUse(TLI);
3391 // Keep track of whether we see an earlyclobber.
3392 SawEarlyClobber |= OpInfo.isEarlyClobber;
3394 // If this is a memory input, and if the operand is not indirect, do what we
3395 // need to to provide an address for the memory input.
3396 if (OpInfo.ConstraintType == TargetLowering::C_Memory &&
3397 !OpInfo.isIndirect) {
3398 assert(OpInfo.Type == InlineAsm::isInput &&
3399 "Can only indirectify direct input operands!");
3401 // Memory operands really want the address of the value. If we don't have
3402 // an indirect input, put it in the constpool if we can, otherwise spill
3403 // it to a stack slot.
3405 // If the operand is a float, integer, or vector constant, spill to a
3406 // constant pool entry to get its address.
3407 Value *OpVal = OpInfo.CallOperandVal;
3408 if (isa<ConstantFP>(OpVal) || isa<ConstantInt>(OpVal) ||
3409 isa<ConstantVector>(OpVal)) {
3410 OpInfo.CallOperand = DAG.getConstantPool(cast<Constant>(OpVal),
3411 TLI.getPointerTy());
3413 // Otherwise, create a stack slot and emit a store to it before the
3415 const Type *Ty = OpVal->getType();
3416 uint64_t TySize = TLI.getTargetData()->getTypeSize(Ty);
3417 unsigned Align = TLI.getTargetData()->getPrefTypeAlignment(Ty);
3418 MachineFunction &MF = DAG.getMachineFunction();
3419 int SSFI = MF.getFrameInfo()->CreateStackObject(TySize, Align);
3420 SDOperand StackSlot = DAG.getFrameIndex(SSFI, TLI.getPointerTy());
3421 Chain = DAG.getStore(Chain, OpInfo.CallOperand, StackSlot, NULL, 0);
3422 OpInfo.CallOperand = StackSlot;
3425 // There is no longer a Value* corresponding to this operand.
3426 OpInfo.CallOperandVal = 0;
3427 // It is now an indirect operand.
3428 OpInfo.isIndirect = true;
3431 // If this constraint is for a specific register, allocate it before
3433 if (OpInfo.ConstraintType == TargetLowering::C_Register)
3434 GetRegistersForValue(OpInfo, SawEarlyClobber, OutputRegs, InputRegs);
3436 ConstraintInfos.clear();
3439 // Second pass - Loop over all of the operands, assigning virtual or physregs
3440 // to registerclass operands.
3441 for (unsigned i = 0, e = ConstraintOperands.size(); i != e; ++i) {
3442 AsmOperandInfo &OpInfo = ConstraintOperands[i];
3444 // C_Register operands have already been allocated, Other/Memory don't need
3446 if (OpInfo.ConstraintType == TargetLowering::C_RegisterClass)
3447 GetRegistersForValue(OpInfo, SawEarlyClobber, OutputRegs, InputRegs);
3450 // AsmNodeOperands - The operands for the ISD::INLINEASM node.
3451 std::vector<SDOperand> AsmNodeOperands;
3452 AsmNodeOperands.push_back(SDOperand()); // reserve space for input chain
3453 AsmNodeOperands.push_back(
3454 DAG.getTargetExternalSymbol(IA->getAsmString().c_str(), MVT::Other));
3457 // Loop over all of the inputs, copying the operand values into the
3458 // appropriate registers and processing the output regs.
3459 RegsForValue RetValRegs;
3461 // IndirectStoresToEmit - The set of stores to emit after the inline asm node.
3462 std::vector<std::pair<RegsForValue, Value*> > IndirectStoresToEmit;
3464 for (unsigned i = 0, e = ConstraintOperands.size(); i != e; ++i) {
3465 AsmOperandInfo &OpInfo = ConstraintOperands[i];
3467 switch (OpInfo.Type) {
3468 case InlineAsm::isOutput: {
3469 if (OpInfo.ConstraintType != TargetLowering::C_RegisterClass &&
3470 OpInfo.ConstraintType != TargetLowering::C_Register) {
3471 // Memory output, or 'other' output (e.g. 'X' constraint).
3472 assert(OpInfo.isIndirect && "Memory output must be indirect operand");
3474 // Add information to the INLINEASM node to know about this output.
3475 unsigned ResOpType = 4/*MEM*/ | (1 << 3);
3476 AsmNodeOperands.push_back(DAG.getTargetConstant(ResOpType,
3477 TLI.getPointerTy()));
3478 AsmNodeOperands.push_back(OpInfo.CallOperand);
3482 // Otherwise, this is a register or register class output.
3484 // Copy the output from the appropriate register. Find a register that
3486 if (OpInfo.AssignedRegs.Regs.empty()) {
3487 cerr << "Couldn't allocate output reg for contraint '"
3488 << OpInfo.ConstraintCode << "'!\n";
3492 if (!OpInfo.isIndirect) {
3493 // This is the result value of the call.
3494 assert(RetValRegs.Regs.empty() &&
3495 "Cannot have multiple output constraints yet!");
3496 assert(I.getType() != Type::VoidTy && "Bad inline asm!");
3497 RetValRegs = OpInfo.AssignedRegs;
3499 IndirectStoresToEmit.push_back(std::make_pair(OpInfo.AssignedRegs,
3500 OpInfo.CallOperandVal));
3503 // Add information to the INLINEASM node to know that this register is
3505 OpInfo.AssignedRegs.AddInlineAsmOperands(2 /*REGDEF*/, DAG,
3509 case InlineAsm::isInput: {
3510 SDOperand InOperandVal = OpInfo.CallOperand;
3512 if (isdigit(OpInfo.ConstraintCode[0])) { // Matching constraint?
3513 // If this is required to match an output register we have already set,
3514 // just use its register.
3515 unsigned OperandNo = atoi(OpInfo.ConstraintCode.c_str());
3517 // Scan until we find the definition we already emitted of this operand.
3518 // When we find it, create a RegsForValue operand.
3519 unsigned CurOp = 2; // The first operand.
3520 for (; OperandNo; --OperandNo) {
3521 // Advance to the next operand.
3523 cast<ConstantSDNode>(AsmNodeOperands[CurOp])->getValue();
3524 assert(((NumOps & 7) == 2 /*REGDEF*/ ||
3525 (NumOps & 7) == 4 /*MEM*/) &&
3526 "Skipped past definitions?");
3527 CurOp += (NumOps>>3)+1;
3531 cast<ConstantSDNode>(AsmNodeOperands[CurOp])->getValue();
3532 if ((NumOps & 7) == 2 /*REGDEF*/) {
3533 // Add NumOps>>3 registers to MatchedRegs.
3534 RegsForValue MatchedRegs;
3535 MatchedRegs.ValueVT = InOperandVal.getValueType();
3536 MatchedRegs.RegVT = AsmNodeOperands[CurOp+1].getValueType();
3537 for (unsigned i = 0, e = NumOps>>3; i != e; ++i) {
3539 cast<RegisterSDNode>(AsmNodeOperands[++CurOp])->getReg();
3540 MatchedRegs.Regs.push_back(Reg);
3543 // Use the produced MatchedRegs object to
3544 MatchedRegs.getCopyToRegs(InOperandVal, DAG, Chain, &Flag);
3545 MatchedRegs.AddInlineAsmOperands(1 /*REGUSE*/, DAG, AsmNodeOperands);
3548 assert((NumOps & 7) == 4/*MEM*/ && "Unknown matching constraint!");
3549 assert(0 && "matching constraints for memory operands unimp");
3553 if (OpInfo.ConstraintType == TargetLowering::C_Other) {
3554 assert(!OpInfo.isIndirect &&
3555 "Don't know how to handle indirect other inputs yet!");
3557 InOperandVal = TLI.isOperandValidForConstraint(InOperandVal,
3558 OpInfo.ConstraintCode[0],
3560 if (!InOperandVal.Val) {
3561 cerr << "Invalid operand for inline asm constraint '"
3562 << OpInfo.ConstraintCode << "'!\n";
3566 // Add information to the INLINEASM node to know about this input.
3567 unsigned ResOpType = 3 /*IMM*/ | (1 << 3);
3568 AsmNodeOperands.push_back(DAG.getTargetConstant(ResOpType,
3569 TLI.getPointerTy()));
3570 AsmNodeOperands.push_back(InOperandVal);
3572 } else if (OpInfo.ConstraintType == TargetLowering::C_Memory) {
3573 assert(OpInfo.isIndirect && "Operand must be indirect to be a mem!");
3574 assert(InOperandVal.getValueType() == TLI.getPointerTy() &&
3575 "Memory operands expect pointer values");
3577 // Add information to the INLINEASM node to know about this input.
3578 unsigned ResOpType = 4/*MEM*/ | (1 << 3);
3579 AsmNodeOperands.push_back(DAG.getTargetConstant(ResOpType,
3580 TLI.getPointerTy()));
3581 AsmNodeOperands.push_back(InOperandVal);
3585 assert((OpInfo.ConstraintType == TargetLowering::C_RegisterClass ||
3586 OpInfo.ConstraintType == TargetLowering::C_Register) &&
3587 "Unknown constraint type!");
3588 assert(!OpInfo.isIndirect &&
3589 "Don't know how to handle indirect register inputs yet!");
3591 // Copy the input into the appropriate registers.
3592 assert(!OpInfo.AssignedRegs.Regs.empty() &&
3593 "Couldn't allocate input reg!");
3595 OpInfo.AssignedRegs.getCopyToRegs(InOperandVal, DAG, Chain, &Flag);
3597 OpInfo.AssignedRegs.AddInlineAsmOperands(1/*REGUSE*/, DAG,
3601 case InlineAsm::isClobber: {
3602 // Add the clobbered value to the operand list, so that the register
3603 // allocator is aware that the physreg got clobbered.
3604 if (!OpInfo.AssignedRegs.Regs.empty())
3605 OpInfo.AssignedRegs.AddInlineAsmOperands(2/*REGDEF*/, DAG,
3612 // Finish up input operands.
3613 AsmNodeOperands[0] = Chain;
3614 if (Flag.Val) AsmNodeOperands.push_back(Flag);
3616 Chain = DAG.getNode(ISD::INLINEASM,
3617 DAG.getNodeValueTypes(MVT::Other, MVT::Flag), 2,
3618 &AsmNodeOperands[0], AsmNodeOperands.size());
3619 Flag = Chain.getValue(1);
3621 // If this asm returns a register value, copy the result from that register
3622 // and set it as the value of the call.
3623 if (!RetValRegs.Regs.empty()) {
3624 SDOperand Val = RetValRegs.getCopyFromRegs(DAG, Chain, &Flag);
3626 // If the result of the inline asm is a vector, it may have the wrong
3627 // width/num elts. Make sure to convert it to the right type with
3629 if (MVT::isVector(Val.getValueType())) {
3630 const VectorType *VTy = cast<VectorType>(I.getType());
3631 MVT::ValueType DesiredVT = TLI.getValueType(VTy);
3633 Val = DAG.getNode(ISD::BIT_CONVERT, DesiredVT, Val);
3639 std::vector<std::pair<SDOperand, Value*> > StoresToEmit;
3641 // Process indirect outputs, first output all of the flagged copies out of
3643 for (unsigned i = 0, e = IndirectStoresToEmit.size(); i != e; ++i) {
3644 RegsForValue &OutRegs = IndirectStoresToEmit[i].first;
3645 Value *Ptr = IndirectStoresToEmit[i].second;
3646 SDOperand OutVal = OutRegs.getCopyFromRegs(DAG, Chain, &Flag);
3647 StoresToEmit.push_back(std::make_pair(OutVal, Ptr));
3650 // Emit the non-flagged stores from the physregs.
3651 SmallVector<SDOperand, 8> OutChains;
3652 for (unsigned i = 0, e = StoresToEmit.size(); i != e; ++i)
3653 OutChains.push_back(DAG.getStore(Chain, StoresToEmit[i].first,
3654 getValue(StoresToEmit[i].second),
3655 StoresToEmit[i].second, 0));
3656 if (!OutChains.empty())
3657 Chain = DAG.getNode(ISD::TokenFactor, MVT::Other,
3658 &OutChains[0], OutChains.size());
3663 void SelectionDAGLowering::visitMalloc(MallocInst &I) {
3664 SDOperand Src = getValue(I.getOperand(0));
3666 MVT::ValueType IntPtr = TLI.getPointerTy();
3668 if (IntPtr < Src.getValueType())
3669 Src = DAG.getNode(ISD::TRUNCATE, IntPtr, Src);
3670 else if (IntPtr > Src.getValueType())
3671 Src = DAG.getNode(ISD::ZERO_EXTEND, IntPtr, Src);
3673 // Scale the source by the type size.
3674 uint64_t ElementSize = TD->getTypeSize(I.getType()->getElementType());
3675 Src = DAG.getNode(ISD::MUL, Src.getValueType(),
3676 Src, getIntPtrConstant(ElementSize));
3678 TargetLowering::ArgListTy Args;
3679 TargetLowering::ArgListEntry Entry;
3681 Entry.Ty = TLI.getTargetData()->getIntPtrType();
3682 Args.push_back(Entry);
3684 std::pair<SDOperand,SDOperand> Result =
3685 TLI.LowerCallTo(getRoot(), I.getType(), false, false, CallingConv::C, true,
3686 DAG.getExternalSymbol("malloc", IntPtr),
3688 setValue(&I, Result.first); // Pointers always fit in registers
3689 DAG.setRoot(Result.second);
3692 void SelectionDAGLowering::visitFree(FreeInst &I) {
3693 TargetLowering::ArgListTy Args;
3694 TargetLowering::ArgListEntry Entry;
3695 Entry.Node = getValue(I.getOperand(0));
3696 Entry.Ty = TLI.getTargetData()->getIntPtrType();
3697 Args.push_back(Entry);
3698 MVT::ValueType IntPtr = TLI.getPointerTy();
3699 std::pair<SDOperand,SDOperand> Result =
3700 TLI.LowerCallTo(getRoot(), Type::VoidTy, false, false, CallingConv::C, true,
3701 DAG.getExternalSymbol("free", IntPtr), Args, DAG);
3702 DAG.setRoot(Result.second);
3705 // InsertAtEndOfBasicBlock - This method should be implemented by targets that
3706 // mark instructions with the 'usesCustomDAGSchedInserter' flag. These
3707 // instructions are special in various ways, which require special support to
3708 // insert. The specified MachineInstr is created but not inserted into any
3709 // basic blocks, and the scheduler passes ownership of it to this method.
3710 MachineBasicBlock *TargetLowering::InsertAtEndOfBasicBlock(MachineInstr *MI,
3711 MachineBasicBlock *MBB) {
3712 cerr << "If a target marks an instruction with "
3713 << "'usesCustomDAGSchedInserter', it must implement "
3714 << "TargetLowering::InsertAtEndOfBasicBlock!\n";
3719 void SelectionDAGLowering::visitVAStart(CallInst &I) {
3720 DAG.setRoot(DAG.getNode(ISD::VASTART, MVT::Other, getRoot(),
3721 getValue(I.getOperand(1)),
3722 DAG.getSrcValue(I.getOperand(1))));
3725 void SelectionDAGLowering::visitVAArg(VAArgInst &I) {
3726 SDOperand V = DAG.getVAArg(TLI.getValueType(I.getType()), getRoot(),
3727 getValue(I.getOperand(0)),
3728 DAG.getSrcValue(I.getOperand(0)));
3730 DAG.setRoot(V.getValue(1));
3733 void SelectionDAGLowering::visitVAEnd(CallInst &I) {
3734 DAG.setRoot(DAG.getNode(ISD::VAEND, MVT::Other, getRoot(),
3735 getValue(I.getOperand(1)),
3736 DAG.getSrcValue(I.getOperand(1))));
3739 void SelectionDAGLowering::visitVACopy(CallInst &I) {
3740 DAG.setRoot(DAG.getNode(ISD::VACOPY, MVT::Other, getRoot(),
3741 getValue(I.getOperand(1)),
3742 getValue(I.getOperand(2)),
3743 DAG.getSrcValue(I.getOperand(1)),
3744 DAG.getSrcValue(I.getOperand(2))));
3747 /// ExpandScalarFormalArgs - Recursively expand the formal_argument node, either
3748 /// bit_convert it or join a pair of them with a BUILD_PAIR when appropriate.
3749 static SDOperand ExpandScalarFormalArgs(MVT::ValueType VT, SDNode *Arg,
3750 unsigned &i, SelectionDAG &DAG,
3751 TargetLowering &TLI) {
3752 if (TLI.getTypeAction(VT) != TargetLowering::Expand)
3753 return SDOperand(Arg, i++);
3755 MVT::ValueType EVT = TLI.getTypeToTransformTo(VT);
3756 unsigned NumVals = MVT::getSizeInBits(VT) / MVT::getSizeInBits(EVT);
3758 return DAG.getNode(ISD::BIT_CONVERT, VT,
3759 ExpandScalarFormalArgs(EVT, Arg, i, DAG, TLI));
3760 } else if (NumVals == 2) {
3761 SDOperand Lo = ExpandScalarFormalArgs(EVT, Arg, i, DAG, TLI);
3762 SDOperand Hi = ExpandScalarFormalArgs(EVT, Arg, i, DAG, TLI);
3763 if (!TLI.isLittleEndian())
3765 return DAG.getNode(ISD::BUILD_PAIR, VT, Lo, Hi);
3767 // Value scalarized into many values. Unimp for now.
3768 assert(0 && "Cannot expand i64 -> i16 yet!");
3773 /// TargetLowering::LowerArguments - This is the default LowerArguments
3774 /// implementation, which just inserts a FORMAL_ARGUMENTS node. FIXME: When all
3775 /// targets are migrated to using FORMAL_ARGUMENTS, this hook should be
3776 /// integrated into SDISel.
3777 std::vector<SDOperand>
3778 TargetLowering::LowerArguments(Function &F, SelectionDAG &DAG) {
3779 const FunctionType *FTy = F.getFunctionType();
3780 const ParamAttrsList *Attrs = FTy->getParamAttrs();
3781 // Add CC# and isVararg as operands to the FORMAL_ARGUMENTS node.
3782 std::vector<SDOperand> Ops;
3783 Ops.push_back(DAG.getRoot());
3784 Ops.push_back(DAG.getConstant(F.getCallingConv(), getPointerTy()));
3785 Ops.push_back(DAG.getConstant(F.isVarArg(), getPointerTy()));
3787 // Add one result value for each formal argument.
3788 std::vector<MVT::ValueType> RetVals;
3790 for (Function::arg_iterator I = F.arg_begin(), E = F.arg_end();
3792 MVT::ValueType VT = getValueType(I->getType());
3793 unsigned Flags = ISD::ParamFlags::NoFlagSet;
3794 unsigned OriginalAlignment =
3795 getTargetData()->getABITypeAlignment(I->getType());
3797 // FIXME: Distinguish between a formal with no [sz]ext attribute from one
3798 // that is zero extended!
3799 if (Attrs && Attrs->paramHasAttr(j, ParamAttr::ZExt))
3800 Flags &= ~(ISD::ParamFlags::SExt);
3801 if (Attrs && Attrs->paramHasAttr(j, ParamAttr::SExt))
3802 Flags |= ISD::ParamFlags::SExt;
3803 if (Attrs && Attrs->paramHasAttr(j, ParamAttr::InReg))
3804 Flags |= ISD::ParamFlags::InReg;
3805 if (Attrs && Attrs->paramHasAttr(j, ParamAttr::StructRet))
3806 Flags |= ISD::ParamFlags::StructReturn;
3807 Flags |= (OriginalAlignment << ISD::ParamFlags::OrigAlignmentOffs);
3809 switch (getTypeAction(VT)) {
3810 default: assert(0 && "Unknown type action!");
3812 RetVals.push_back(VT);
3813 Ops.push_back(DAG.getConstant(Flags, MVT::i32));
3816 RetVals.push_back(getTypeToTransformTo(VT));
3817 Ops.push_back(DAG.getConstant(Flags, MVT::i32));
3820 // If this is an illegal type, it needs to be broken up to fit into
3822 MVT::ValueType RegisterVT = getRegisterType(VT);
3823 unsigned NumRegs = getNumRegisters(VT);
3824 for (unsigned i = 0; i != NumRegs; ++i) {
3825 RetVals.push_back(RegisterVT);
3826 // if it isn't first piece, alignment must be 1
3828 Flags = (Flags & (~ISD::ParamFlags::OrigAlignment)) |
3829 (1 << ISD::ParamFlags::OrigAlignmentOffs);
3830 Ops.push_back(DAG.getConstant(Flags, MVT::i32));
3837 RetVals.push_back(MVT::Other);
3840 SDNode *Result = DAG.getNode(ISD::FORMAL_ARGUMENTS,
3841 DAG.getNodeValueTypes(RetVals), RetVals.size(),
3842 &Ops[0], Ops.size()).Val;
3844 DAG.setRoot(SDOperand(Result, Result->getNumValues()-1));
3846 // Set up the return result vector.
3850 for (Function::arg_iterator I = F.arg_begin(), E = F.arg_end(); I != E;
3852 MVT::ValueType VT = getValueType(I->getType());
3854 switch (getTypeAction(VT)) {
3855 default: assert(0 && "Unknown type action!");
3857 Ops.push_back(SDOperand(Result, i++));
3860 SDOperand Op(Result, i++);
3861 if (MVT::isInteger(VT)) {
3862 if (Attrs && Attrs->paramHasAttr(Idx, ParamAttr::SExt))
3863 Op = DAG.getNode(ISD::AssertSext, Op.getValueType(), Op,
3864 DAG.getValueType(VT));
3865 else if (Attrs && Attrs->paramHasAttr(Idx, ParamAttr::ZExt))
3866 Op = DAG.getNode(ISD::AssertZext, Op.getValueType(), Op,
3867 DAG.getValueType(VT));
3868 Op = DAG.getNode(ISD::TRUNCATE, VT, Op);
3870 assert(MVT::isFloatingPoint(VT) && "Not int or FP?");
3871 Op = DAG.getNode(ISD::FP_ROUND, VT, Op);
3877 if (!MVT::isVector(VT)) {
3878 // If this is a large integer or a floating point node that needs to be
3879 // expanded, it needs to be reassembled from small integers. Figure out
3880 // what the source elt type is and how many small integers it is.
3881 Ops.push_back(ExpandScalarFormalArgs(VT, Result, i, DAG, *this));
3883 // Otherwise, this is a vector type. We only support legal vectors
3885 const VectorType *PTy = cast<VectorType>(I->getType());
3886 unsigned NumElems = PTy->getNumElements();
3887 const Type *EltTy = PTy->getElementType();
3889 // Figure out if there is a Packed type corresponding to this Vector
3890 // type. If so, convert to the vector type.
3891 MVT::ValueType TVT =
3892 MVT::getVectorType(getValueType(EltTy), NumElems);
3893 if (TVT != MVT::Other && isTypeLegal(TVT)) {
3894 SDOperand N = SDOperand(Result, i++);
3895 // Handle copies from vectors to registers.
3896 N = DAG.getNode(ISD::BIT_CONVERT, TVT, N);
3899 assert(0 && "Don't support illegal by-val vector arguments yet!");
3910 /// ExpandScalarCallArgs - Recursively expand call argument node by
3911 /// bit_converting it or extract a pair of elements from the larger node.
3912 static void ExpandScalarCallArgs(MVT::ValueType VT, SDOperand Arg,
3914 SmallVector<SDOperand, 32> &Ops,
3916 TargetLowering &TLI,
3917 bool isFirst = true) {
3919 if (TLI.getTypeAction(VT) != TargetLowering::Expand) {
3920 // if it isn't first piece, alignment must be 1
3922 Flags = (Flags & (~ISD::ParamFlags::OrigAlignment)) |
3923 (1 << ISD::ParamFlags::OrigAlignmentOffs);
3925 Ops.push_back(DAG.getConstant(Flags, MVT::i32));
3929 MVT::ValueType EVT = TLI.getTypeToTransformTo(VT);
3930 unsigned NumVals = MVT::getSizeInBits(VT) / MVT::getSizeInBits(EVT);
3932 Arg = DAG.getNode(ISD::BIT_CONVERT, EVT, Arg);
3933 ExpandScalarCallArgs(EVT, Arg, Flags, Ops, DAG, TLI, isFirst);
3934 } else if (NumVals == 2) {
3935 SDOperand Lo = DAG.getNode(ISD::EXTRACT_ELEMENT, EVT, Arg,
3936 DAG.getConstant(0, TLI.getPointerTy()));
3937 SDOperand Hi = DAG.getNode(ISD::EXTRACT_ELEMENT, EVT, Arg,
3938 DAG.getConstant(1, TLI.getPointerTy()));
3939 if (!TLI.isLittleEndian())
3941 ExpandScalarCallArgs(EVT, Lo, Flags, Ops, DAG, TLI, isFirst);
3942 ExpandScalarCallArgs(EVT, Hi, Flags, Ops, DAG, TLI, false);
3944 // Value scalarized into many values. Unimp for now.
3945 assert(0 && "Cannot expand i64 -> i16 yet!");
3949 /// TargetLowering::LowerCallTo - This is the default LowerCallTo
3950 /// implementation, which just inserts an ISD::CALL node, which is later custom
3951 /// lowered by the target to something concrete. FIXME: When all targets are
3952 /// migrated to using ISD::CALL, this hook should be integrated into SDISel.
3953 std::pair<SDOperand, SDOperand>
3954 TargetLowering::LowerCallTo(SDOperand Chain, const Type *RetTy,
3955 bool RetTyIsSigned, bool isVarArg,
3956 unsigned CallingConv, bool isTailCall,
3958 ArgListTy &Args, SelectionDAG &DAG) {
3959 SmallVector<SDOperand, 32> Ops;
3960 Ops.push_back(Chain); // Op#0 - Chain
3961 Ops.push_back(DAG.getConstant(CallingConv, getPointerTy())); // Op#1 - CC
3962 Ops.push_back(DAG.getConstant(isVarArg, getPointerTy())); // Op#2 - VarArg
3963 Ops.push_back(DAG.getConstant(isTailCall, getPointerTy())); // Op#3 - Tail
3964 Ops.push_back(Callee);
3966 // Handle all of the outgoing arguments.
3967 for (unsigned i = 0, e = Args.size(); i != e; ++i) {
3968 MVT::ValueType VT = getValueType(Args[i].Ty);
3969 SDOperand Op = Args[i].Node;
3970 unsigned Flags = ISD::ParamFlags::NoFlagSet;
3971 unsigned OriginalAlignment =
3972 getTargetData()->getABITypeAlignment(Args[i].Ty);
3975 Flags |= ISD::ParamFlags::SExt;
3977 Flags |= ISD::ParamFlags::ZExt;
3978 if (Args[i].isInReg)
3979 Flags |= ISD::ParamFlags::InReg;
3981 Flags |= ISD::ParamFlags::StructReturn;
3982 Flags |= OriginalAlignment << ISD::ParamFlags::OrigAlignmentOffs;
3984 switch (getTypeAction(VT)) {
3985 default: assert(0 && "Unknown type action!");
3988 Ops.push_back(DAG.getConstant(Flags, MVT::i32));
3991 if (MVT::isInteger(VT)) {
3994 ExtOp = ISD::SIGN_EXTEND;
3995 else if (Args[i].isZExt)
3996 ExtOp = ISD::ZERO_EXTEND;
3998 ExtOp = ISD::ANY_EXTEND;
3999 Op = DAG.getNode(ExtOp, getTypeToTransformTo(VT), Op);
4001 assert(MVT::isFloatingPoint(VT) && "Not int or FP?");
4002 // A true promotion would change the size of the argument.
4003 // Instead, pretend this is an int. If FP objects are not
4004 // passed the same as ints, the original type should be Legal
4005 // and we should not get here.
4006 Op = DAG.getNode(ISD::BIT_CONVERT,
4007 VT==MVT::f32 ? MVT::i32 :
4008 (VT==MVT::f64 ? MVT::i64 :
4013 Ops.push_back(DAG.getConstant(Flags, MVT::i32));
4016 if (!MVT::isVector(VT)) {
4017 // If this is a large integer, it needs to be broken down into small
4018 // integers. Figure out what the source elt type is and how many small
4020 ExpandScalarCallArgs(VT, Op, Flags, Ops, DAG, *this);
4022 // Otherwise, this is a vector type. We only support legal vectors
4024 const VectorType *PTy = cast<VectorType>(Args[i].Ty);
4025 unsigned NumElems = PTy->getNumElements();
4026 const Type *EltTy = PTy->getElementType();
4028 // Figure out if there is a Packed type corresponding to this Vector
4029 // type. If so, convert to the vector type.
4030 MVT::ValueType TVT =
4031 MVT::getVectorType(getValueType(EltTy), NumElems);
4032 if (TVT != MVT::Other && isTypeLegal(TVT)) {
4033 // Insert a BIT_CONVERT of the original type to the vector type.
4034 Op = DAG.getNode(ISD::BIT_CONVERT, TVT, Op);
4036 Ops.push_back(DAG.getConstant(Flags, MVT::i32));
4038 assert(0 && "Don't support illegal by-val vector call args yet!");
4046 // Figure out the result value types.
4047 MVT::ValueType VT = getValueType(RetTy);
4048 MVT::ValueType RegisterVT = getRegisterType(VT);
4049 unsigned NumRegs = getNumRegisters(VT);
4050 SmallVector<MVT::ValueType, 4> RetTys(NumRegs);
4051 for (unsigned i = 0; i != NumRegs; ++i)
4052 RetTys[i] = RegisterVT;
4054 RetTys.push_back(MVT::Other); // Always has a chain.
4056 // Create the CALL node.
4057 SDOperand Res = DAG.getNode(ISD::CALL,
4058 DAG.getVTList(&RetTys[0], NumRegs + 1),
4059 &Ops[0], Ops.size());
4060 SDOperand Chain = Res.getValue(NumRegs);
4062 // Gather up the call result into a single value.
4063 if (RetTy != Type::VoidTy) {
4064 ISD::NodeType AssertOp = ISD::AssertSext;
4066 AssertOp = ISD::AssertZext;
4067 SmallVector<SDOperand, 4> Results(NumRegs);
4068 for (unsigned i = 0; i != NumRegs; ++i)
4069 Results[i] = Res.getValue(i);
4070 Res = getCopyFromParts(DAG, &Results[0], NumRegs, RegisterVT, VT, AssertOp);
4073 return std::make_pair(Res, Chain);
4076 SDOperand TargetLowering::LowerOperation(SDOperand Op, SelectionDAG &DAG) {
4077 assert(0 && "LowerOperation not implemented for this target!");
4082 SDOperand TargetLowering::CustomPromoteOperation(SDOperand Op,
4083 SelectionDAG &DAG) {
4084 assert(0 && "CustomPromoteOperation not implemented for this target!");
4089 /// getMemsetValue - Vectorized representation of the memset value
4091 static SDOperand getMemsetValue(SDOperand Value, MVT::ValueType VT,
4092 SelectionDAG &DAG) {
4093 MVT::ValueType CurVT = VT;
4094 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Value)) {
4095 uint64_t Val = C->getValue() & 255;
4097 while (CurVT != MVT::i8) {
4098 Val = (Val << Shift) | Val;
4100 CurVT = (MVT::ValueType)((unsigned)CurVT - 1);
4102 return DAG.getConstant(Val, VT);
4104 Value = DAG.getNode(ISD::ZERO_EXTEND, VT, Value);
4106 while (CurVT != MVT::i8) {
4108 DAG.getNode(ISD::OR, VT,
4109 DAG.getNode(ISD::SHL, VT, Value,
4110 DAG.getConstant(Shift, MVT::i8)), Value);
4112 CurVT = (MVT::ValueType)((unsigned)CurVT - 1);
4119 /// getMemsetStringVal - Similar to getMemsetValue. Except this is only
4120 /// used when a memcpy is turned into a memset when the source is a constant
4122 static SDOperand getMemsetStringVal(MVT::ValueType VT,
4123 SelectionDAG &DAG, TargetLowering &TLI,
4124 std::string &Str, unsigned Offset) {
4126 unsigned MSB = MVT::getSizeInBits(VT) / 8;
4127 if (TLI.isLittleEndian())
4128 Offset = Offset + MSB - 1;
4129 for (unsigned i = 0; i != MSB; ++i) {
4130 Val = (Val << 8) | (unsigned char)Str[Offset];
4131 Offset += TLI.isLittleEndian() ? -1 : 1;
4133 return DAG.getConstant(Val, VT);
4136 /// getMemBasePlusOffset - Returns base and offset node for the
4137 static SDOperand getMemBasePlusOffset(SDOperand Base, unsigned Offset,
4138 SelectionDAG &DAG, TargetLowering &TLI) {
4139 MVT::ValueType VT = Base.getValueType();
4140 return DAG.getNode(ISD::ADD, VT, Base, DAG.getConstant(Offset, VT));
4143 /// MeetsMaxMemopRequirement - Determines if the number of memory ops required
4144 /// to replace the memset / memcpy is below the threshold. It also returns the
4145 /// types of the sequence of memory ops to perform memset / memcpy.
4146 static bool MeetsMaxMemopRequirement(std::vector<MVT::ValueType> &MemOps,
4147 unsigned Limit, uint64_t Size,
4148 unsigned Align, TargetLowering &TLI) {
4151 if (TLI.allowsUnalignedMemoryAccesses()) {
4154 switch (Align & 7) {
4170 MVT::ValueType LVT = MVT::i64;
4171 while (!TLI.isTypeLegal(LVT))
4172 LVT = (MVT::ValueType)((unsigned)LVT - 1);
4173 assert(MVT::isInteger(LVT));
4178 unsigned NumMemOps = 0;
4180 unsigned VTSize = MVT::getSizeInBits(VT) / 8;
4181 while (VTSize > Size) {
4182 VT = (MVT::ValueType)((unsigned)VT - 1);
4185 assert(MVT::isInteger(VT));
4187 if (++NumMemOps > Limit)
4189 MemOps.push_back(VT);
4196 void SelectionDAGLowering::visitMemIntrinsic(CallInst &I, unsigned Op) {
4197 SDOperand Op1 = getValue(I.getOperand(1));
4198 SDOperand Op2 = getValue(I.getOperand(2));
4199 SDOperand Op3 = getValue(I.getOperand(3));
4200 SDOperand Op4 = getValue(I.getOperand(4));
4201 unsigned Align = (unsigned)cast<ConstantSDNode>(Op4)->getValue();
4202 if (Align == 0) Align = 1;
4204 if (ConstantSDNode *Size = dyn_cast<ConstantSDNode>(Op3)) {
4205 std::vector<MVT::ValueType> MemOps;
4207 // Expand memset / memcpy to a series of load / store ops
4208 // if the size operand falls below a certain threshold.
4209 SmallVector<SDOperand, 8> OutChains;
4211 default: break; // Do nothing for now.
4213 if (MeetsMaxMemopRequirement(MemOps, TLI.getMaxStoresPerMemset(),
4214 Size->getValue(), Align, TLI)) {
4215 unsigned NumMemOps = MemOps.size();
4216 unsigned Offset = 0;
4217 for (unsigned i = 0; i < NumMemOps; i++) {
4218 MVT::ValueType VT = MemOps[i];
4219 unsigned VTSize = MVT::getSizeInBits(VT) / 8;
4220 SDOperand Value = getMemsetValue(Op2, VT, DAG);
4221 SDOperand Store = DAG.getStore(getRoot(), Value,
4222 getMemBasePlusOffset(Op1, Offset, DAG, TLI),
4223 I.getOperand(1), Offset);
4224 OutChains.push_back(Store);
4231 if (MeetsMaxMemopRequirement(MemOps, TLI.getMaxStoresPerMemcpy(),
4232 Size->getValue(), Align, TLI)) {
4233 unsigned NumMemOps = MemOps.size();
4234 unsigned SrcOff = 0, DstOff = 0, SrcDelta = 0;
4235 GlobalAddressSDNode *G = NULL;
4237 bool CopyFromStr = false;
4239 if (Op2.getOpcode() == ISD::GlobalAddress)
4240 G = cast<GlobalAddressSDNode>(Op2);
4241 else if (Op2.getOpcode() == ISD::ADD &&
4242 Op2.getOperand(0).getOpcode() == ISD::GlobalAddress &&
4243 Op2.getOperand(1).getOpcode() == ISD::Constant) {
4244 G = cast<GlobalAddressSDNode>(Op2.getOperand(0));
4245 SrcDelta = cast<ConstantSDNode>(Op2.getOperand(1))->getValue();
4248 GlobalVariable *GV = dyn_cast<GlobalVariable>(G->getGlobal());
4249 if (GV && GV->isConstant()) {
4250 Str = GV->getStringValue(false);
4258 for (unsigned i = 0; i < NumMemOps; i++) {
4259 MVT::ValueType VT = MemOps[i];
4260 unsigned VTSize = MVT::getSizeInBits(VT) / 8;
4261 SDOperand Value, Chain, Store;
4264 Value = getMemsetStringVal(VT, DAG, TLI, Str, SrcOff);
4267 DAG.getStore(Chain, Value,
4268 getMemBasePlusOffset(Op1, DstOff, DAG, TLI),
4269 I.getOperand(1), DstOff);
4271 Value = DAG.getLoad(VT, getRoot(),
4272 getMemBasePlusOffset(Op2, SrcOff, DAG, TLI),
4273 I.getOperand(2), SrcOff);
4274 Chain = Value.getValue(1);
4276 DAG.getStore(Chain, Value,
4277 getMemBasePlusOffset(Op1, DstOff, DAG, TLI),
4278 I.getOperand(1), DstOff);
4280 OutChains.push_back(Store);
4289 if (!OutChains.empty()) {
4290 DAG.setRoot(DAG.getNode(ISD::TokenFactor, MVT::Other,
4291 &OutChains[0], OutChains.size()));
4296 DAG.setRoot(DAG.getNode(Op, MVT::Other, getRoot(), Op1, Op2, Op3, Op4));
4299 //===----------------------------------------------------------------------===//
4300 // SelectionDAGISel code
4301 //===----------------------------------------------------------------------===//
4303 unsigned SelectionDAGISel::MakeReg(MVT::ValueType VT) {
4304 return RegMap->createVirtualRegister(TLI.getRegClassFor(VT));
4307 void SelectionDAGISel::getAnalysisUsage(AnalysisUsage &AU) const {
4308 AU.addRequired<AliasAnalysis>();
4309 AU.setPreservesAll();
4314 bool SelectionDAGISel::runOnFunction(Function &Fn) {
4315 MachineFunction &MF = MachineFunction::construct(&Fn, TLI.getTargetMachine());
4316 RegMap = MF.getSSARegMap();
4317 DOUT << "\n\n\n=== " << Fn.getName() << "\n";
4319 FunctionLoweringInfo FuncInfo(TLI, Fn, MF);
4321 if (ExceptionHandling)
4322 for (Function::iterator I = Fn.begin(), E = Fn.end(); I != E; ++I)
4323 if (InvokeInst *Invoke = dyn_cast<InvokeInst>(I->getTerminator()))
4324 // Mark landing pad.
4325 FuncInfo.MBBMap[Invoke->getSuccessor(1)]->setIsLandingPad();
4327 for (Function::iterator I = Fn.begin(), E = Fn.end(); I != E; ++I)
4328 SelectBasicBlock(I, MF, FuncInfo);
4330 // Add function live-ins to entry block live-in set.
4331 BasicBlock *EntryBB = &Fn.getEntryBlock();
4332 BB = FuncInfo.MBBMap[EntryBB];
4333 if (!MF.livein_empty())
4334 for (MachineFunction::livein_iterator I = MF.livein_begin(),
4335 E = MF.livein_end(); I != E; ++I)
4336 BB->addLiveIn(I->first);
4339 assert(FuncInfo.CatchInfoFound.size() == FuncInfo.CatchInfoLost.size() &&
4340 "Not all catch info was assigned to a landing pad!");
4346 SDOperand SelectionDAGLowering::CopyValueToVirtualRegister(Value *V,
4348 SDOperand Op = getValue(V);
4349 assert((Op.getOpcode() != ISD::CopyFromReg ||
4350 cast<RegisterSDNode>(Op.getOperand(1))->getReg() != Reg) &&
4351 "Copy from a reg to the same reg!");
4353 MVT::ValueType SrcVT = Op.getValueType();
4354 MVT::ValueType RegisterVT = TLI.getRegisterType(SrcVT);
4355 unsigned NumRegs = TLI.getNumRegisters(SrcVT);
4356 SmallVector<SDOperand, 8> Regs(NumRegs);
4357 SmallVector<SDOperand, 8> Chains(NumRegs);
4359 // Copy the value by legal parts into sequential virtual registers.
4360 getCopyToParts(DAG, Op, &Regs[0], NumRegs, RegisterVT);
4361 for (unsigned i = 0; i < NumRegs; ++i)
4362 Chains[i] = DAG.getCopyToReg(getRoot(), Reg + i, Regs[i]);
4363 return DAG.getNode(ISD::TokenFactor, MVT::Other, &Chains[0], NumRegs);
4366 void SelectionDAGISel::
4367 LowerArguments(BasicBlock *LLVMBB, SelectionDAGLowering &SDL,
4368 std::vector<SDOperand> &UnorderedChains) {
4369 // If this is the entry block, emit arguments.
4370 Function &F = *LLVMBB->getParent();
4371 FunctionLoweringInfo &FuncInfo = SDL.FuncInfo;
4372 SDOperand OldRoot = SDL.DAG.getRoot();
4373 std::vector<SDOperand> Args = TLI.LowerArguments(F, SDL.DAG);
4376 for (Function::arg_iterator AI = F.arg_begin(), E = F.arg_end();
4378 if (!AI->use_empty()) {
4379 SDL.setValue(AI, Args[a]);
4381 // If this argument is live outside of the entry block, insert a copy from
4382 // whereever we got it to the vreg that other BB's will reference it as.
4383 DenseMap<const Value*, unsigned>::iterator VMI=FuncInfo.ValueMap.find(AI);
4384 if (VMI != FuncInfo.ValueMap.end()) {
4385 SDOperand Copy = SDL.CopyValueToVirtualRegister(AI, VMI->second);
4386 UnorderedChains.push_back(Copy);
4390 // Finally, if the target has anything special to do, allow it to do so.
4391 // FIXME: this should insert code into the DAG!
4392 EmitFunctionEntryCode(F, SDL.DAG.getMachineFunction());
4395 static void copyCatchInfo(BasicBlock *SrcBB, BasicBlock *DestBB,
4396 MachineModuleInfo *MMI, FunctionLoweringInfo &FLI) {
4397 assert(!FLI.MBBMap[SrcBB]->isLandingPad() &&
4398 "Copying catch info out of a landing pad!");
4399 for (BasicBlock::iterator I = SrcBB->begin(), E = --SrcBB->end(); I != E; ++I)
4400 if (isFilterOrSelector(I)) {
4401 // Apply the catch info to DestBB.
4402 addCatchInfo(cast<CallInst>(*I), MMI, FLI.MBBMap[DestBB]);
4404 FLI.CatchInfoFound.insert(I);
4409 void SelectionDAGISel::BuildSelectionDAG(SelectionDAG &DAG, BasicBlock *LLVMBB,
4410 std::vector<std::pair<MachineInstr*, unsigned> > &PHINodesToUpdate,
4411 FunctionLoweringInfo &FuncInfo) {
4412 SelectionDAGLowering SDL(DAG, TLI, FuncInfo);
4414 std::vector<SDOperand> UnorderedChains;
4416 // Lower any arguments needed in this block if this is the entry block.
4417 if (LLVMBB == &LLVMBB->getParent()->getEntryBlock())
4418 LowerArguments(LLVMBB, SDL, UnorderedChains);
4420 BB = FuncInfo.MBBMap[LLVMBB];
4421 SDL.setCurrentBasicBlock(BB);
4423 MachineModuleInfo *MMI = DAG.getMachineModuleInfo();
4425 if (ExceptionHandling && MMI && BB->isLandingPad()) {
4426 // Add a label to mark the beginning of the landing pad. Deletion of the
4427 // landing pad can thus be detected via the MachineModuleInfo.
4428 unsigned LabelID = MMI->addLandingPad(BB);
4429 DAG.setRoot(DAG.getNode(ISD::LABEL, MVT::Other, DAG.getEntryNode(),
4430 DAG.getConstant(LabelID, MVT::i32)));
4432 // Mark exception register as live in.
4433 unsigned Reg = TLI.getExceptionAddressRegister();
4434 if (Reg) BB->addLiveIn(Reg);
4436 // Mark exception selector register as live in.
4437 Reg = TLI.getExceptionSelectorRegister();
4438 if (Reg) BB->addLiveIn(Reg);
4440 // FIXME: Hack around an exception handling flaw (PR1508): the personality
4441 // function and list of typeids logically belong to the invoke (or, if you
4442 // like, the basic block containing the invoke), and need to be associated
4443 // with it in the dwarf exception handling tables. Currently however the
4444 // information is provided by intrinsics (eh.filter and eh.selector) that
4445 // can be moved to unexpected places by the optimizers: if the unwind edge
4446 // is critical, then breaking it can result in the intrinsics being in the
4447 // successor of the landing pad, not the landing pad itself. This results
4448 // in exceptions not being caught because no typeids are associated with
4449 // the invoke. This may not be the only way things can go wrong, but it
4450 // is the only way we try to work around for the moment.
4451 BranchInst *Br = dyn_cast<BranchInst>(LLVMBB->getTerminator());
4453 if (Br && Br->isUnconditional()) { // Critical edge?
4454 BasicBlock::iterator I, E;
4455 for (I = LLVMBB->begin(), E = --LLVMBB->end(); I != E; ++I)
4456 if (isFilterOrSelector(I))
4460 // No catch info found - try to extract some from the successor.
4461 copyCatchInfo(Br->getSuccessor(0), LLVMBB, MMI, FuncInfo);
4465 // Lower all of the non-terminator instructions.
4466 for (BasicBlock::iterator I = LLVMBB->begin(), E = --LLVMBB->end();
4470 // Ensure that all instructions which are used outside of their defining
4471 // blocks are available as virtual registers. Invoke is handled elsewhere.
4472 for (BasicBlock::iterator I = LLVMBB->begin(), E = LLVMBB->end(); I != E;++I)
4473 if (!I->use_empty() && !isa<PHINode>(I) && !isa<InvokeInst>(I)) {
4474 DenseMap<const Value*, unsigned>::iterator VMI =FuncInfo.ValueMap.find(I);
4475 if (VMI != FuncInfo.ValueMap.end())
4476 UnorderedChains.push_back(
4477 SDL.CopyValueToVirtualRegister(I, VMI->second));
4480 // Handle PHI nodes in successor blocks. Emit code into the SelectionDAG to
4481 // ensure constants are generated when needed. Remember the virtual registers
4482 // that need to be added to the Machine PHI nodes as input. We cannot just
4483 // directly add them, because expansion might result in multiple MBB's for one
4484 // BB. As such, the start of the BB might correspond to a different MBB than
4487 TerminatorInst *TI = LLVMBB->getTerminator();
4489 // Emit constants only once even if used by multiple PHI nodes.
4490 std::map<Constant*, unsigned> ConstantsOut;
4492 // Vector bool would be better, but vector<bool> is really slow.
4493 std::vector<unsigned char> SuccsHandled;
4494 if (TI->getNumSuccessors())
4495 SuccsHandled.resize(BB->getParent()->getNumBlockIDs());
4497 // Check successor nodes PHI nodes that expect a constant to be available from
4499 for (unsigned succ = 0, e = TI->getNumSuccessors(); succ != e; ++succ) {
4500 BasicBlock *SuccBB = TI->getSuccessor(succ);
4501 if (!isa<PHINode>(SuccBB->begin())) continue;
4502 MachineBasicBlock *SuccMBB = FuncInfo.MBBMap[SuccBB];
4504 // If this terminator has multiple identical successors (common for
4505 // switches), only handle each succ once.
4506 unsigned SuccMBBNo = SuccMBB->getNumber();
4507 if (SuccsHandled[SuccMBBNo]) continue;
4508 SuccsHandled[SuccMBBNo] = true;
4510 MachineBasicBlock::iterator MBBI = SuccMBB->begin();
4513 // At this point we know that there is a 1-1 correspondence between LLVM PHI
4514 // nodes and Machine PHI nodes, but the incoming operands have not been
4516 for (BasicBlock::iterator I = SuccBB->begin();
4517 (PN = dyn_cast<PHINode>(I)); ++I) {
4518 // Ignore dead phi's.
4519 if (PN->use_empty()) continue;
4522 Value *PHIOp = PN->getIncomingValueForBlock(LLVMBB);
4524 if (Constant *C = dyn_cast<Constant>(PHIOp)) {
4525 unsigned &RegOut = ConstantsOut[C];
4527 RegOut = FuncInfo.CreateRegForValue(C);
4528 UnorderedChains.push_back(
4529 SDL.CopyValueToVirtualRegister(C, RegOut));
4533 Reg = FuncInfo.ValueMap[PHIOp];
4535 assert(isa<AllocaInst>(PHIOp) &&
4536 FuncInfo.StaticAllocaMap.count(cast<AllocaInst>(PHIOp)) &&
4537 "Didn't codegen value into a register!??");
4538 Reg = FuncInfo.CreateRegForValue(PHIOp);
4539 UnorderedChains.push_back(
4540 SDL.CopyValueToVirtualRegister(PHIOp, Reg));
4544 // Remember that this register needs to added to the machine PHI node as
4545 // the input for this MBB.
4546 MVT::ValueType VT = TLI.getValueType(PN->getType());
4547 unsigned NumRegisters = TLI.getNumRegisters(VT);
4548 for (unsigned i = 0, e = NumRegisters; i != e; ++i)
4549 PHINodesToUpdate.push_back(std::make_pair(MBBI++, Reg+i));
4552 ConstantsOut.clear();
4554 // Turn all of the unordered chains into one factored node.
4555 if (!UnorderedChains.empty()) {
4556 SDOperand Root = SDL.getRoot();
4557 if (Root.getOpcode() != ISD::EntryToken) {
4558 unsigned i = 0, e = UnorderedChains.size();
4559 for (; i != e; ++i) {
4560 assert(UnorderedChains[i].Val->getNumOperands() > 1);
4561 if (UnorderedChains[i].Val->getOperand(0) == Root)
4562 break; // Don't add the root if we already indirectly depend on it.
4566 UnorderedChains.push_back(Root);
4568 DAG.setRoot(DAG.getNode(ISD::TokenFactor, MVT::Other,
4569 &UnorderedChains[0], UnorderedChains.size()));
4572 // Lower the terminator after the copies are emitted.
4573 SDL.visit(*LLVMBB->getTerminator());
4575 // Copy over any CaseBlock records that may now exist due to SwitchInst
4576 // lowering, as well as any jump table information.
4577 SwitchCases.clear();
4578 SwitchCases = SDL.SwitchCases;
4580 JTCases = SDL.JTCases;
4581 BitTestCases.clear();
4582 BitTestCases = SDL.BitTestCases;
4584 // Make sure the root of the DAG is up-to-date.
4585 DAG.setRoot(SDL.getRoot());
4588 void SelectionDAGISel::CodeGenAndEmitDAG(SelectionDAG &DAG) {
4589 // Get alias analysis for load/store combining.
4590 AliasAnalysis &AA = getAnalysis<AliasAnalysis>();
4592 // Run the DAG combiner in pre-legalize mode.
4593 DAG.Combine(false, AA);
4595 DOUT << "Lowered selection DAG:\n";
4598 // Second step, hack on the DAG until it only uses operations and types that
4599 // the target supports.
4602 DOUT << "Legalized selection DAG:\n";
4605 // Run the DAG combiner in post-legalize mode.
4606 DAG.Combine(true, AA);
4608 if (ViewISelDAGs) DAG.viewGraph();
4610 // Third, instruction select all of the operations to machine code, adding the
4611 // code to the MachineBasicBlock.
4612 InstructionSelectBasicBlock(DAG);
4614 DOUT << "Selected machine code:\n";
4618 void SelectionDAGISel::SelectBasicBlock(BasicBlock *LLVMBB, MachineFunction &MF,
4619 FunctionLoweringInfo &FuncInfo) {
4620 std::vector<std::pair<MachineInstr*, unsigned> > PHINodesToUpdate;
4622 SelectionDAG DAG(TLI, MF, getAnalysisToUpdate<MachineModuleInfo>());
4625 // First step, lower LLVM code to some DAG. This DAG may use operations and
4626 // types that are not supported by the target.
4627 BuildSelectionDAG(DAG, LLVMBB, PHINodesToUpdate, FuncInfo);
4629 // Second step, emit the lowered DAG as machine code.
4630 CodeGenAndEmitDAG(DAG);
4633 DOUT << "Total amount of phi nodes to update: "
4634 << PHINodesToUpdate.size() << "\n";
4635 DEBUG(for (unsigned i = 0, e = PHINodesToUpdate.size(); i != e; ++i)
4636 DOUT << "Node " << i << " : (" << PHINodesToUpdate[i].first
4637 << ", " << PHINodesToUpdate[i].second << ")\n";);
4639 // Next, now that we know what the last MBB the LLVM BB expanded is, update
4640 // PHI nodes in successors.
4641 if (SwitchCases.empty() && JTCases.empty() && BitTestCases.empty()) {
4642 for (unsigned i = 0, e = PHINodesToUpdate.size(); i != e; ++i) {
4643 MachineInstr *PHI = PHINodesToUpdate[i].first;
4644 assert(PHI->getOpcode() == TargetInstrInfo::PHI &&
4645 "This is not a machine PHI node that we are updating!");
4646 PHI->addRegOperand(PHINodesToUpdate[i].second, false);
4647 PHI->addMachineBasicBlockOperand(BB);
4652 for (unsigned i = 0, e = BitTestCases.size(); i != e; ++i) {
4653 // Lower header first, if it wasn't already lowered
4654 if (!BitTestCases[i].Emitted) {
4655 SelectionDAG HSDAG(TLI, MF, getAnalysisToUpdate<MachineModuleInfo>());
4657 SelectionDAGLowering HSDL(HSDAG, TLI, FuncInfo);
4658 // Set the current basic block to the mbb we wish to insert the code into
4659 BB = BitTestCases[i].Parent;
4660 HSDL.setCurrentBasicBlock(BB);
4662 HSDL.visitBitTestHeader(BitTestCases[i]);
4663 HSDAG.setRoot(HSDL.getRoot());
4664 CodeGenAndEmitDAG(HSDAG);
4667 for (unsigned j = 0, ej = BitTestCases[i].Cases.size(); j != ej; ++j) {
4668 SelectionDAG BSDAG(TLI, MF, getAnalysisToUpdate<MachineModuleInfo>());
4670 SelectionDAGLowering BSDL(BSDAG, TLI, FuncInfo);
4671 // Set the current basic block to the mbb we wish to insert the code into
4672 BB = BitTestCases[i].Cases[j].ThisBB;
4673 BSDL.setCurrentBasicBlock(BB);
4676 BSDL.visitBitTestCase(BitTestCases[i].Cases[j+1].ThisBB,
4677 BitTestCases[i].Reg,
4678 BitTestCases[i].Cases[j]);
4680 BSDL.visitBitTestCase(BitTestCases[i].Default,
4681 BitTestCases[i].Reg,
4682 BitTestCases[i].Cases[j]);
4685 BSDAG.setRoot(BSDL.getRoot());
4686 CodeGenAndEmitDAG(BSDAG);
4690 for (unsigned pi = 0, pe = PHINodesToUpdate.size(); pi != pe; ++pi) {
4691 MachineInstr *PHI = PHINodesToUpdate[pi].first;
4692 MachineBasicBlock *PHIBB = PHI->getParent();
4693 assert(PHI->getOpcode() == TargetInstrInfo::PHI &&
4694 "This is not a machine PHI node that we are updating!");
4695 // This is "default" BB. We have two jumps to it. From "header" BB and
4696 // from last "case" BB.
4697 if (PHIBB == BitTestCases[i].Default) {
4698 PHI->addRegOperand(PHINodesToUpdate[pi].second, false);
4699 PHI->addMachineBasicBlockOperand(BitTestCases[i].Parent);
4700 PHI->addRegOperand(PHINodesToUpdate[pi].second, false);
4701 PHI->addMachineBasicBlockOperand(BitTestCases[i].Cases.back().ThisBB);
4703 // One of "cases" BB.
4704 for (unsigned j = 0, ej = BitTestCases[i].Cases.size(); j != ej; ++j) {
4705 MachineBasicBlock* cBB = BitTestCases[i].Cases[j].ThisBB;
4706 if (cBB->succ_end() !=
4707 std::find(cBB->succ_begin(),cBB->succ_end(), PHIBB)) {
4708 PHI->addRegOperand(PHINodesToUpdate[pi].second, false);
4709 PHI->addMachineBasicBlockOperand(cBB);
4715 // If the JumpTable record is filled in, then we need to emit a jump table.
4716 // Updating the PHI nodes is tricky in this case, since we need to determine
4717 // whether the PHI is a successor of the range check MBB or the jump table MBB
4718 for (unsigned i = 0, e = JTCases.size(); i != e; ++i) {
4719 // Lower header first, if it wasn't already lowered
4720 if (!JTCases[i].first.Emitted) {
4721 SelectionDAG HSDAG(TLI, MF, getAnalysisToUpdate<MachineModuleInfo>());
4723 SelectionDAGLowering HSDL(HSDAG, TLI, FuncInfo);
4724 // Set the current basic block to the mbb we wish to insert the code into
4725 BB = JTCases[i].first.HeaderBB;
4726 HSDL.setCurrentBasicBlock(BB);
4728 HSDL.visitJumpTableHeader(JTCases[i].second, JTCases[i].first);
4729 HSDAG.setRoot(HSDL.getRoot());
4730 CodeGenAndEmitDAG(HSDAG);
4733 SelectionDAG JSDAG(TLI, MF, getAnalysisToUpdate<MachineModuleInfo>());
4735 SelectionDAGLowering JSDL(JSDAG, TLI, FuncInfo);
4736 // Set the current basic block to the mbb we wish to insert the code into
4737 BB = JTCases[i].second.MBB;
4738 JSDL.setCurrentBasicBlock(BB);
4740 JSDL.visitJumpTable(JTCases[i].second);
4741 JSDAG.setRoot(JSDL.getRoot());
4742 CodeGenAndEmitDAG(JSDAG);
4745 for (unsigned pi = 0, pe = PHINodesToUpdate.size(); pi != pe; ++pi) {
4746 MachineInstr *PHI = PHINodesToUpdate[pi].first;
4747 MachineBasicBlock *PHIBB = PHI->getParent();
4748 assert(PHI->getOpcode() == TargetInstrInfo::PHI &&
4749 "This is not a machine PHI node that we are updating!");
4750 // "default" BB. We can go there only from header BB.
4751 if (PHIBB == JTCases[i].second.Default) {
4752 PHI->addRegOperand(PHINodesToUpdate[pi].second, false);
4753 PHI->addMachineBasicBlockOperand(JTCases[i].first.HeaderBB);
4755 // JT BB. Just iterate over successors here
4756 if (BB->succ_end() != std::find(BB->succ_begin(),BB->succ_end(), PHIBB)) {
4757 PHI->addRegOperand(PHINodesToUpdate[pi].second, false);
4758 PHI->addMachineBasicBlockOperand(BB);
4763 // If the switch block involved a branch to one of the actual successors, we
4764 // need to update PHI nodes in that block.
4765 for (unsigned i = 0, e = PHINodesToUpdate.size(); i != e; ++i) {
4766 MachineInstr *PHI = PHINodesToUpdate[i].first;
4767 assert(PHI->getOpcode() == TargetInstrInfo::PHI &&
4768 "This is not a machine PHI node that we are updating!");
4769 if (BB->isSuccessor(PHI->getParent())) {
4770 PHI->addRegOperand(PHINodesToUpdate[i].second, false);
4771 PHI->addMachineBasicBlockOperand(BB);
4775 // If we generated any switch lowering information, build and codegen any
4776 // additional DAGs necessary.
4777 for (unsigned i = 0, e = SwitchCases.size(); i != e; ++i) {
4778 SelectionDAG SDAG(TLI, MF, getAnalysisToUpdate<MachineModuleInfo>());
4780 SelectionDAGLowering SDL(SDAG, TLI, FuncInfo);
4782 // Set the current basic block to the mbb we wish to insert the code into
4783 BB = SwitchCases[i].ThisBB;
4784 SDL.setCurrentBasicBlock(BB);
4787 SDL.visitSwitchCase(SwitchCases[i]);
4788 SDAG.setRoot(SDL.getRoot());
4789 CodeGenAndEmitDAG(SDAG);
4791 // Handle any PHI nodes in successors of this chunk, as if we were coming
4792 // from the original BB before switch expansion. Note that PHI nodes can
4793 // occur multiple times in PHINodesToUpdate. We have to be very careful to
4794 // handle them the right number of times.
4795 while ((BB = SwitchCases[i].TrueBB)) { // Handle LHS and RHS.
4796 for (MachineBasicBlock::iterator Phi = BB->begin();
4797 Phi != BB->end() && Phi->getOpcode() == TargetInstrInfo::PHI; ++Phi){
4798 // This value for this PHI node is recorded in PHINodesToUpdate, get it.
4799 for (unsigned pn = 0; ; ++pn) {
4800 assert(pn != PHINodesToUpdate.size() && "Didn't find PHI entry!");
4801 if (PHINodesToUpdate[pn].first == Phi) {
4802 Phi->addRegOperand(PHINodesToUpdate[pn].second, false);
4803 Phi->addMachineBasicBlockOperand(SwitchCases[i].ThisBB);
4809 // Don't process RHS if same block as LHS.
4810 if (BB == SwitchCases[i].FalseBB)
4811 SwitchCases[i].FalseBB = 0;
4813 // If we haven't handled the RHS, do so now. Otherwise, we're done.
4814 SwitchCases[i].TrueBB = SwitchCases[i].FalseBB;
4815 SwitchCases[i].FalseBB = 0;
4817 assert(SwitchCases[i].TrueBB == 0 && SwitchCases[i].FalseBB == 0);
4822 //===----------------------------------------------------------------------===//
4823 /// ScheduleAndEmitDAG - Pick a safe ordering and emit instructions for each
4824 /// target node in the graph.
4825 void SelectionDAGISel::ScheduleAndEmitDAG(SelectionDAG &DAG) {
4826 if (ViewSchedDAGs) DAG.viewGraph();
4828 RegisterScheduler::FunctionPassCtor Ctor = RegisterScheduler::getDefault();
4832 RegisterScheduler::setDefault(Ctor);
4835 ScheduleDAG *SL = Ctor(this, &DAG, BB);
4841 HazardRecognizer *SelectionDAGISel::CreateTargetHazardRecognizer() {
4842 return new HazardRecognizer();
4845 //===----------------------------------------------------------------------===//
4846 // Helper functions used by the generated instruction selector.
4847 //===----------------------------------------------------------------------===//
4848 // Calls to these methods are generated by tblgen.
4850 /// CheckAndMask - The isel is trying to match something like (and X, 255). If
4851 /// the dag combiner simplified the 255, we still want to match. RHS is the
4852 /// actual value in the DAG on the RHS of an AND, and DesiredMaskS is the value
4853 /// specified in the .td file (e.g. 255).
4854 bool SelectionDAGISel::CheckAndMask(SDOperand LHS, ConstantSDNode *RHS,
4855 int64_t DesiredMaskS) {
4856 uint64_t ActualMask = RHS->getValue();
4857 uint64_t DesiredMask =DesiredMaskS & MVT::getIntVTBitMask(LHS.getValueType());
4859 // If the actual mask exactly matches, success!
4860 if (ActualMask == DesiredMask)
4863 // If the actual AND mask is allowing unallowed bits, this doesn't match.
4864 if (ActualMask & ~DesiredMask)
4867 // Otherwise, the DAG Combiner may have proven that the value coming in is
4868 // either already zero or is not demanded. Check for known zero input bits.
4869 uint64_t NeededMask = DesiredMask & ~ActualMask;
4870 if (CurDAG->MaskedValueIsZero(LHS, NeededMask))
4873 // TODO: check to see if missing bits are just not demanded.
4875 // Otherwise, this pattern doesn't match.
4879 /// CheckOrMask - The isel is trying to match something like (or X, 255). If
4880 /// the dag combiner simplified the 255, we still want to match. RHS is the
4881 /// actual value in the DAG on the RHS of an OR, and DesiredMaskS is the value
4882 /// specified in the .td file (e.g. 255).
4883 bool SelectionDAGISel::CheckOrMask(SDOperand LHS, ConstantSDNode *RHS,
4884 int64_t DesiredMaskS) {
4885 uint64_t ActualMask = RHS->getValue();
4886 uint64_t DesiredMask =DesiredMaskS & MVT::getIntVTBitMask(LHS.getValueType());
4888 // If the actual mask exactly matches, success!
4889 if (ActualMask == DesiredMask)
4892 // If the actual AND mask is allowing unallowed bits, this doesn't match.
4893 if (ActualMask & ~DesiredMask)
4896 // Otherwise, the DAG Combiner may have proven that the value coming in is
4897 // either already zero or is not demanded. Check for known zero input bits.
4898 uint64_t NeededMask = DesiredMask & ~ActualMask;
4900 uint64_t KnownZero, KnownOne;
4901 CurDAG->ComputeMaskedBits(LHS, NeededMask, KnownZero, KnownOne);
4903 // If all the missing bits in the or are already known to be set, match!
4904 if ((NeededMask & KnownOne) == NeededMask)
4907 // TODO: check to see if missing bits are just not demanded.
4909 // Otherwise, this pattern doesn't match.
4914 /// SelectInlineAsmMemoryOperands - Calls to this are automatically generated
4915 /// by tblgen. Others should not call it.
4916 void SelectionDAGISel::
4917 SelectInlineAsmMemoryOperands(std::vector<SDOperand> &Ops, SelectionDAG &DAG) {
4918 std::vector<SDOperand> InOps;
4919 std::swap(InOps, Ops);
4921 Ops.push_back(InOps[0]); // input chain.
4922 Ops.push_back(InOps[1]); // input asm string.
4924 unsigned i = 2, e = InOps.size();
4925 if (InOps[e-1].getValueType() == MVT::Flag)
4926 --e; // Don't process a flag operand if it is here.
4929 unsigned Flags = cast<ConstantSDNode>(InOps[i])->getValue();
4930 if ((Flags & 7) != 4 /*MEM*/) {
4931 // Just skip over this operand, copying the operands verbatim.
4932 Ops.insert(Ops.end(), InOps.begin()+i, InOps.begin()+i+(Flags >> 3) + 1);
4933 i += (Flags >> 3) + 1;
4935 assert((Flags >> 3) == 1 && "Memory operand with multiple values?");
4936 // Otherwise, this is a memory operand. Ask the target to select it.
4937 std::vector<SDOperand> SelOps;
4938 if (SelectInlineAsmMemoryOperand(InOps[i+1], 'm', SelOps, DAG)) {
4939 cerr << "Could not match memory address. Inline asm failure!\n";
4943 // Add this to the output node.
4944 MVT::ValueType IntPtrTy = DAG.getTargetLoweringInfo().getPointerTy();
4945 Ops.push_back(DAG.getTargetConstant(4/*MEM*/ | (SelOps.size() << 3),
4947 Ops.insert(Ops.end(), SelOps.begin(), SelOps.end());
4952 // Add the flag input back if present.
4953 if (e != InOps.size())
4954 Ops.push_back(InOps.back());
4957 char SelectionDAGISel::ID = 0;