1 //===-- SelectionDAGBuild.h - Selection-DAG building ----------------------===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This implements routines for translating from LLVM IR into SelectionDAG IR.
12 //===----------------------------------------------------------------------===//
14 #ifndef SELECTIONDAGBUILD_H
15 #define SELECTIONDAGBUILD_H
17 #include "llvm/Constants.h"
18 #include "llvm/ADT/APInt.h"
19 #include "llvm/ADT/DenseMap.h"
21 #include "llvm/ADT/SmallSet.h"
23 #include "llvm/CodeGen/SelectionDAGNodes.h"
24 #include "llvm/CodeGen/ValueTypes.h"
25 #include "llvm/Support/CallSite.h"
26 #include "llvm/Support/ErrorHandling.h"
27 #include "llvm/Target/TargetMachine.h"
39 class ExtractElementInst;
40 class ExtractValueInst;
48 class GetElementPtrInst;
53 class InsertElementInst;
54 class InsertValueInst;
57 class MachineBasicBlock;
58 class MachineFunction;
60 class MachineModuleInfo;
61 class MachineRegisterInfo;
66 class SDISelAsmOperandInfo;
69 class ShuffleVectorInst;
77 class UnreachableInst;
82 //===--------------------------------------------------------------------===//
83 /// FunctionLoweringInfo - This contains information that is global to a
84 /// function that is used when lowering a region of the function.
86 class FunctionLoweringInfo {
91 MachineRegisterInfo *RegInfo;
93 explicit FunctionLoweringInfo(TargetLowering &TLI);
95 /// set - Initialize this FunctionLoweringInfo with the given Function
96 /// and its associated MachineFunction.
98 void set(Function &Fn, MachineFunction &MF, SelectionDAG &DAG,
101 /// MBBMap - A mapping from LLVM basic blocks to their machine code entry.
102 DenseMap<const BasicBlock*, MachineBasicBlock *> MBBMap;
104 /// ValueMap - Since we emit code for the function a basic block at a time,
105 /// we must remember which virtual registers hold the values for
106 /// cross-basic-block values.
107 DenseMap<const Value*, unsigned> ValueMap;
109 /// StaticAllocaMap - Keep track of frame indices for fixed sized allocas in
110 /// the entry block. This allows the allocas to be efficiently referenced
111 /// anywhere in the function.
112 DenseMap<const AllocaInst*, int> StaticAllocaMap;
115 SmallSet<Instruction*, 8> CatchInfoLost;
116 SmallSet<Instruction*, 8> CatchInfoFound;
119 unsigned MakeReg(MVT VT);
121 /// isExportedInst - Return true if the specified value is an instruction
122 /// exported from its block.
123 bool isExportedInst(const Value *V) {
124 return ValueMap.count(V);
127 unsigned CreateRegForValue(const Value *V);
129 unsigned InitializeRegForValue(const Value *V) {
130 unsigned &R = ValueMap[V];
131 assert(R == 0 && "Already initialized this value register!");
132 return R = CreateRegForValue(V);
136 unsigned NumSignBits;
137 APInt KnownOne, KnownZero;
138 LiveOutInfo() : NumSignBits(0), KnownOne(1, 0), KnownZero(1, 0) {}
141 /// LiveOutRegInfo - Information about live out vregs, indexed by their
142 /// register number offset by 'FirstVirtualRegister'.
143 std::vector<LiveOutInfo> LiveOutRegInfo;
145 /// clear - Clear out all the function-specific state. This returns this
146 /// FunctionLoweringInfo to an empty state, ready to be used for a
147 /// different function.
151 StaticAllocaMap.clear();
153 CatchInfoLost.clear();
154 CatchInfoFound.clear();
156 LiveOutRegInfo.clear();
160 //===----------------------------------------------------------------------===//
161 /// SelectionDAGLowering - This is the common target-independent lowering
162 /// implementation that is parameterized by a TargetLowering object.
163 /// Also, targets can overload any lowering method.
165 class SelectionDAGLowering {
166 MachineBasicBlock *CurMBB;
168 /// CurDebugLoc - current file + line number. Changes as we build the DAG.
169 DebugLoc CurDebugLoc;
171 DenseMap<const Value*, SDValue> NodeMap;
173 /// PendingLoads - Loads are not emitted to the program immediately. We bunch
174 /// them up and then emit token factor nodes when possible. This allows us to
175 /// get simple disambiguation between loads without worrying about alias
177 SmallVector<SDValue, 8> PendingLoads;
179 /// PendingExports - CopyToReg nodes that copy values to virtual registers
180 /// for export to other blocks need to be emitted before any terminator
181 /// instruction, but they have no other ordering requirements. We bunch them
182 /// up and the emit a single tokenfactor for them just before terminator
184 SmallVector<SDValue, 8> PendingExports;
186 /// Case - A struct to record the Value for a switch case, and the
187 /// case's target basic block.
191 MachineBasicBlock* BB;
193 Case() : Low(0), High(0), BB(0) { }
194 Case(Constant* low, Constant* high, MachineBasicBlock* bb) :
195 Low(low), High(high), BB(bb) { }
196 uint64_t size() const {
197 uint64_t rHigh = cast<ConstantInt>(High)->getSExtValue();
198 uint64_t rLow = cast<ConstantInt>(Low)->getSExtValue();
199 return (rHigh - rLow + 1ULL);
205 MachineBasicBlock* BB;
208 CaseBits(uint64_t mask, MachineBasicBlock* bb, unsigned bits):
209 Mask(mask), BB(bb), Bits(bits) { }
212 typedef std::vector<Case> CaseVector;
213 typedef std::vector<CaseBits> CaseBitsVector;
214 typedef CaseVector::iterator CaseItr;
215 typedef std::pair<CaseItr, CaseItr> CaseRange;
217 /// CaseRec - A struct with ctor used in lowering switches to a binary tree
218 /// of conditional branches.
220 CaseRec(MachineBasicBlock *bb, Constant *lt, Constant *ge, CaseRange r) :
221 CaseBB(bb), LT(lt), GE(ge), Range(r) {}
223 /// CaseBB - The MBB in which to emit the compare and branch
224 MachineBasicBlock *CaseBB;
225 /// LT, GE - If nonzero, we know the current case value must be less-than or
226 /// greater-than-or-equal-to these Constants.
229 /// Range - A pair of iterators representing the range of case values to be
230 /// processed at this point in the binary search tree.
234 typedef std::vector<CaseRec> CaseRecVector;
236 /// The comparison function for sorting the switch case values in the vector.
237 /// WARNING: Case ranges should be disjoint!
239 bool operator () (const Case& C1, const Case& C2) {
240 assert(isa<ConstantInt>(C1.Low) && isa<ConstantInt>(C2.High));
241 const ConstantInt* CI1 = cast<const ConstantInt>(C1.Low);
242 const ConstantInt* CI2 = cast<const ConstantInt>(C2.High);
243 return CI1->getValue().slt(CI2->getValue());
248 bool operator () (const CaseBits& C1, const CaseBits& C2) {
249 return C1.Bits > C2.Bits;
253 size_t Clusterify(CaseVector& Cases, const SwitchInst &SI);
255 /// CaseBlock - This structure is used to communicate between SDLowering and
256 /// SDISel for the code generation of additional basic blocks needed by multi-
257 /// case switch statements.
259 CaseBlock(ISD::CondCode cc, Value *cmplhs, Value *cmprhs, Value *cmpmiddle,
260 MachineBasicBlock *truebb, MachineBasicBlock *falsebb,
261 MachineBasicBlock *me)
262 : CC(cc), CmpLHS(cmplhs), CmpMHS(cmpmiddle), CmpRHS(cmprhs),
263 TrueBB(truebb), FalseBB(falsebb), ThisBB(me) {}
264 // CC - the condition code to use for the case block's setcc node
266 // CmpLHS/CmpRHS/CmpMHS - The LHS/MHS/RHS of the comparison to emit.
267 // Emit by default LHS op RHS. MHS is used for range comparisons:
268 // If MHS is not null: (LHS <= MHS) and (MHS <= RHS).
269 Value *CmpLHS, *CmpMHS, *CmpRHS;
270 // TrueBB/FalseBB - the block to branch to if the setcc is true/false.
271 MachineBasicBlock *TrueBB, *FalseBB;
272 // ThisBB - the block into which to emit the code for the setcc and branches
273 MachineBasicBlock *ThisBB;
276 JumpTable(unsigned R, unsigned J, MachineBasicBlock *M,
277 MachineBasicBlock *D): Reg(R), JTI(J), MBB(M), Default(D) {}
279 /// Reg - the virtual register containing the index of the jump table entry
282 /// JTI - the JumpTableIndex for this jump table in the function.
284 /// MBB - the MBB into which to emit the code for the indirect jump.
285 MachineBasicBlock *MBB;
286 /// Default - the MBB of the default bb, which is a successor of the range
287 /// check MBB. This is when updating PHI nodes in successors.
288 MachineBasicBlock *Default;
290 struct JumpTableHeader {
291 JumpTableHeader(APInt F, APInt L, Value* SV, MachineBasicBlock* H,
293 First(F), Last(L), SValue(SV), HeaderBB(H), Emitted(E) {}
297 MachineBasicBlock *HeaderBB;
300 typedef std::pair<JumpTableHeader, JumpTable> JumpTableBlock;
303 BitTestCase(uint64_t M, MachineBasicBlock* T, MachineBasicBlock* Tr):
304 Mask(M), ThisBB(T), TargetBB(Tr) { }
306 MachineBasicBlock* ThisBB;
307 MachineBasicBlock* TargetBB;
310 typedef SmallVector<BitTestCase, 3> BitTestInfo;
312 struct BitTestBlock {
313 BitTestBlock(APInt F, APInt R, Value* SV,
315 MachineBasicBlock* P, MachineBasicBlock* D,
316 const BitTestInfo& C):
317 First(F), Range(R), SValue(SV), Reg(Rg), Emitted(E),
318 Parent(P), Default(D), Cases(C) { }
324 MachineBasicBlock *Parent;
325 MachineBasicBlock *Default;
330 // TLI - This is information that describes the available target features we
331 // need for lowering. This indicates when operations are unavailable,
332 // implemented with a libcall, etc.
335 const TargetData *TD;
338 /// SwitchCases - Vector of CaseBlock structures used to communicate
339 /// SwitchInst code generation information.
340 std::vector<CaseBlock> SwitchCases;
341 /// JTCases - Vector of JumpTable structures used to communicate
342 /// SwitchInst code generation information.
343 std::vector<JumpTableBlock> JTCases;
344 /// BitTestCases - Vector of BitTestBlock structures used to communicate
345 /// SwitchInst code generation information.
346 std::vector<BitTestBlock> BitTestCases;
348 std::vector<std::pair<MachineInstr*, unsigned> > PHINodesToUpdate;
350 // Emit PHI-node-operand constants only once even if used by multiple
352 DenseMap<Constant*, unsigned> ConstantsOut;
354 /// FuncInfo - Information about the function as a whole.
356 FunctionLoweringInfo &FuncInfo;
358 /// OptLevel - What optimization level we're generating code for.
360 CodeGenOpt::Level OptLevel;
362 /// GFI - Garbage collection metadata for the function.
365 SelectionDAGLowering(SelectionDAG &dag, TargetLowering &tli,
366 FunctionLoweringInfo &funcinfo,
367 CodeGenOpt::Level ol)
368 : CurDebugLoc(DebugLoc::getUnknownLoc()),
369 TLI(tli), DAG(dag), FuncInfo(funcinfo), OptLevel(ol) {
372 void init(GCFunctionInfo *gfi, AliasAnalysis &aa);
374 /// clear - Clear out the curret SelectionDAG and the associated
375 /// state and prepare this SelectionDAGLowering object to be used
376 /// for a new block. This doesn't clear out information about
377 /// additional blocks that are needed to complete switch lowering
378 /// or PHI node updating; that information is cleared out as it is
382 /// getRoot - Return the current virtual root of the Selection DAG,
383 /// flushing any PendingLoad items. This must be done before emitting
384 /// a store or any other node that may need to be ordered after any
385 /// prior load instructions.
389 /// getControlRoot - Similar to getRoot, but instead of flushing all the
390 /// PendingLoad items, flush all the PendingExports items. It is necessary
391 /// to do this before emitting a terminator instruction.
393 SDValue getControlRoot();
395 DebugLoc getCurDebugLoc() const { return CurDebugLoc; }
396 void setCurDebugLoc(DebugLoc dl) { CurDebugLoc = dl; }
398 void CopyValueToVirtualRegister(Value *V, unsigned Reg);
400 void visit(Instruction &I);
402 void visit(unsigned Opcode, User &I);
404 void setCurrentBasicBlock(MachineBasicBlock *MBB) { CurMBB = MBB; }
406 SDValue getValue(const Value *V);
408 void setValue(const Value *V, SDValue NewN) {
409 SDValue &N = NodeMap[V];
410 assert(N.getNode() == 0 && "Already set a value for this node!");
414 void GetRegistersForValue(SDISelAsmOperandInfo &OpInfo,
415 std::set<unsigned> &OutputRegs,
416 std::set<unsigned> &InputRegs);
418 void FindMergedConditions(Value *Cond, MachineBasicBlock *TBB,
419 MachineBasicBlock *FBB, MachineBasicBlock *CurBB,
421 void EmitBranchForMergedCondition(Value *Cond, MachineBasicBlock *TBB,
422 MachineBasicBlock *FBB,
423 MachineBasicBlock *CurBB);
424 bool ShouldEmitAsBranches(const std::vector<CaseBlock> &Cases);
425 bool isExportableFromCurrentBlock(Value *V, const BasicBlock *FromBB);
426 void CopyToExportRegsIfNeeded(Value *V);
427 void ExportFromCurrentBlock(Value *V);
428 void LowerCallTo(CallSite CS, SDValue Callee, bool IsTailCall,
429 MachineBasicBlock *LandingPad = NULL);
432 // Terminator instructions.
433 void visitRet(ReturnInst &I);
434 void visitBr(BranchInst &I);
435 void visitSwitch(SwitchInst &I);
436 void visitUnreachable(UnreachableInst &I) { /* noop */ }
438 // Helpers for visitSwitch
439 bool handleSmallSwitchRange(CaseRec& CR,
440 CaseRecVector& WorkList,
442 MachineBasicBlock* Default);
443 bool handleJTSwitchCase(CaseRec& CR,
444 CaseRecVector& WorkList,
446 MachineBasicBlock* Default);
447 bool handleBTSplitSwitchCase(CaseRec& CR,
448 CaseRecVector& WorkList,
450 MachineBasicBlock* Default);
451 bool handleBitTestsSwitchCase(CaseRec& CR,
452 CaseRecVector& WorkList,
454 MachineBasicBlock* Default);
456 void visitSwitchCase(CaseBlock &CB);
457 void visitBitTestHeader(BitTestBlock &B);
458 void visitBitTestCase(MachineBasicBlock* NextMBB,
461 void visitJumpTable(JumpTable &JT);
462 void visitJumpTableHeader(JumpTable &JT, JumpTableHeader &JTH);
465 // These all get lowered before this pass.
466 void visitInvoke(InvokeInst &I);
467 void visitUnwind(UnwindInst &I);
469 void visitBinary(User &I, unsigned OpCode);
470 void visitShift(User &I, unsigned Opcode);
471 void visitAdd(User &I) { visitBinary(I, ISD::ADD); }
472 void visitFAdd(User &I) { visitBinary(I, ISD::FADD); }
473 void visitSub(User &I) { visitBinary(I, ISD::SUB); }
474 void visitFSub(User &I);
475 void visitMul(User &I) { visitBinary(I, ISD::MUL); }
476 void visitFMul(User &I) { visitBinary(I, ISD::FMUL); }
477 void visitURem(User &I) { visitBinary(I, ISD::UREM); }
478 void visitSRem(User &I) { visitBinary(I, ISD::SREM); }
479 void visitFRem(User &I) { visitBinary(I, ISD::FREM); }
480 void visitUDiv(User &I) { visitBinary(I, ISD::UDIV); }
481 void visitSDiv(User &I) { visitBinary(I, ISD::SDIV); }
482 void visitFDiv(User &I) { visitBinary(I, ISD::FDIV); }
483 void visitAnd (User &I) { visitBinary(I, ISD::AND); }
484 void visitOr (User &I) { visitBinary(I, ISD::OR); }
485 void visitXor (User &I) { visitBinary(I, ISD::XOR); }
486 void visitShl (User &I) { visitShift(I, ISD::SHL); }
487 void visitLShr(User &I) { visitShift(I, ISD::SRL); }
488 void visitAShr(User &I) { visitShift(I, ISD::SRA); }
489 void visitICmp(User &I);
490 void visitFCmp(User &I);
491 // Visit the conversion instructions
492 void visitTrunc(User &I);
493 void visitZExt(User &I);
494 void visitSExt(User &I);
495 void visitFPTrunc(User &I);
496 void visitFPExt(User &I);
497 void visitFPToUI(User &I);
498 void visitFPToSI(User &I);
499 void visitUIToFP(User &I);
500 void visitSIToFP(User &I);
501 void visitPtrToInt(User &I);
502 void visitIntToPtr(User &I);
503 void visitBitCast(User &I);
505 void visitExtractElement(User &I);
506 void visitInsertElement(User &I);
507 void visitShuffleVector(User &I);
509 void visitExtractValue(ExtractValueInst &I);
510 void visitInsertValue(InsertValueInst &I);
512 void visitGetElementPtr(User &I);
513 void visitSelect(User &I);
515 void visitMalloc(MallocInst &I);
516 void visitFree(FreeInst &I);
517 void visitAlloca(AllocaInst &I);
518 void visitLoad(LoadInst &I);
519 void visitStore(StoreInst &I);
520 void visitPHI(PHINode &I) { } // PHI nodes are handled specially.
521 void visitCall(CallInst &I);
522 void visitInlineAsm(CallSite CS);
523 const char *visitIntrinsicCall(CallInst &I, unsigned Intrinsic);
524 void visitTargetIntrinsic(CallInst &I, unsigned Intrinsic);
526 void visitPow(CallInst &I);
527 void visitExp2(CallInst &I);
528 void visitExp(CallInst &I);
529 void visitLog(CallInst &I);
530 void visitLog2(CallInst &I);
531 void visitLog10(CallInst &I);
533 void visitVAStart(CallInst &I);
534 void visitVAArg(VAArgInst &I);
535 void visitVAEnd(CallInst &I);
536 void visitVACopy(CallInst &I);
538 void visitUserOp1(Instruction &I) {
539 LLVM_UNREACHABLE("UserOp1 should not exist at instruction selection time!");
541 void visitUserOp2(Instruction &I) {
542 LLVM_UNREACHABLE("UserOp2 should not exist at instruction selection time!");
545 const char *implVisitBinaryAtomic(CallInst& I, ISD::NodeType Op);
546 const char *implVisitAluOverflow(CallInst &I, ISD::NodeType Op);
549 /// AddCatchInfo - Extract the personality and type infos from an eh.selector
550 /// call, and add them to the specified machine basic block.
551 void AddCatchInfo(CallInst &I, MachineModuleInfo *MMI,
552 MachineBasicBlock *MBB);
554 } // end namespace llvm