1 //===-- llvm/CodeGen/SelectionDAG.h - InstSelection DAG ---------*- C++ -*-===//
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 file declares the SelectionDAG class, and transitively defines the
11 // SDNode class and subclasses.
13 //===----------------------------------------------------------------------===//
15 #ifndef LLVM_CODEGEN_SELECTIONDAG_H
16 #define LLVM_CODEGEN_SELECTIONDAG_H
18 #include "llvm/ADT/ilist.h"
19 #include "llvm/ADT/DenseSet.h"
20 #include "llvm/ADT/FoldingSet.h"
21 #include "llvm/ADT/StringMap.h"
22 #include "llvm/CodeGen/SelectionDAGNodes.h"
34 class MachineModuleInfo;
36 class MachineFunction;
37 class MachineConstantPoolValue;
38 class FunctionLoweringInfo;
40 template<> struct ilist_traits<SDNode> : public ilist_default_traits<SDNode> {
42 mutable SDNode Sentinel;
44 ilist_traits() : Sentinel(ISD::DELETED_NODE, SDVTList()) {}
46 SDNode *createSentinel() const {
49 static void destroySentinel(SDNode *) {}
51 static void deleteNode(SDNode *) {
52 assert(0 && "ilist_traits<SDNode> shouldn't see a deleteNode call!");
55 static void createNode(const SDNode &);
59 Unrestricted, // Combine may create illegal operations and illegal types.
60 NoIllegalTypes, // Combine may create illegal operations but no illegal types.
61 NoIllegalOperations // Combine may only create legal operations and types.
64 /// SelectionDAG class - This is used to represent a portion of an LLVM function
65 /// in a low-level Data Dependence DAG representation suitable for instruction
66 /// selection. This DAG is constructed as the first step of instruction
67 /// selection in order to allow implementation of machine specific optimizations
68 /// and code simplifications.
70 /// The representation used by the SelectionDAG is a target-independent
71 /// representation, which has some similarities to the GCC RTL representation,
72 /// but is significantly more simple, powerful, and is a graph form instead of a
78 FunctionLoweringInfo &FLI;
79 MachineModuleInfo *MMI;
82 /// EntryNode - The starting token.
85 /// Root - The root of the entire DAG.
88 /// AllNodes - A linked list of nodes in the current DAG.
89 ilist<SDNode> AllNodes;
91 /// NodeAllocatorType - The AllocatorType for allocating SDNodes. We use
92 /// pool allocation with recycling.
93 typedef RecyclingAllocator<BumpPtrAllocator, SDNode, sizeof(LargestSDNode),
94 AlignOf<MostAlignedSDNode>::Alignment>
97 /// NodeAllocator - Pool allocation for nodes.
98 NodeAllocatorType NodeAllocator;
100 /// CSEMap - This structure is used to memoize nodes, automatically performing
101 /// CSE with existing nodes with a duplicate is requested.
102 FoldingSet<SDNode> CSEMap;
104 /// OperandAllocator - Pool allocation for machine-opcode SDNode operands.
105 BumpPtrAllocator OperandAllocator;
107 /// Allocator - Pool allocation for misc. objects that are created once per
109 BumpPtrAllocator Allocator;
111 /// VerifyNode - Sanity check the given node. Aborts if it is invalid.
112 void VerifyNode(SDNode *N);
114 /// setGraphColorHelper - Implementation of setSubgraphColor.
115 /// Return whether we had to truncate the search.
117 bool setSubgraphColorHelper(SDNode *N, const char *Color, DenseSet<SDNode *> &visited,
118 int level, bool &printed);
121 SelectionDAG(TargetLowering &tli, FunctionLoweringInfo &fli);
124 /// init - Prepare this SelectionDAG to process code in the given
127 void init(MachineFunction &mf, MachineModuleInfo *mmi, DwarfWriter *dw);
129 /// clear - Clear state and free memory necessary to make this
130 /// SelectionDAG ready to process a new block.
134 MachineFunction &getMachineFunction() const { return *MF; }
135 const TargetMachine &getTarget() const;
136 TargetLowering &getTargetLoweringInfo() const { return TLI; }
137 FunctionLoweringInfo &getFunctionLoweringInfo() const { return FLI; }
138 MachineModuleInfo *getMachineModuleInfo() const { return MMI; }
139 DwarfWriter *getDwarfWriter() const { return DW; }
141 /// viewGraph - Pop up a GraphViz/gv window with the DAG rendered using 'dot'.
143 void viewGraph(const std::string &Title);
147 std::map<const SDNode *, std::string> NodeGraphAttrs;
150 /// clearGraphAttrs - Clear all previously defined node graph attributes.
151 /// Intended to be used from a debugging tool (eg. gdb).
152 void clearGraphAttrs();
154 /// setGraphAttrs - Set graph attributes for a node. (eg. "color=red".)
156 void setGraphAttrs(const SDNode *N, const char *Attrs);
158 /// getGraphAttrs - Get graph attributes for a node. (eg. "color=red".)
159 /// Used from getNodeAttributes.
160 const std::string getGraphAttrs(const SDNode *N) const;
162 /// setGraphColor - Convenience for setting node color attribute.
164 void setGraphColor(const SDNode *N, const char *Color);
166 /// setGraphColor - Convenience for setting subgraph color attribute.
168 void setSubgraphColor(SDNode *N, const char *Color);
170 typedef ilist<SDNode>::const_iterator allnodes_const_iterator;
171 allnodes_const_iterator allnodes_begin() const { return AllNodes.begin(); }
172 allnodes_const_iterator allnodes_end() const { return AllNodes.end(); }
173 typedef ilist<SDNode>::iterator allnodes_iterator;
174 allnodes_iterator allnodes_begin() { return AllNodes.begin(); }
175 allnodes_iterator allnodes_end() { return AllNodes.end(); }
176 ilist<SDNode>::size_type allnodes_size() const {
177 return AllNodes.size();
180 /// getRoot - Return the root tag of the SelectionDAG.
182 const SDValue &getRoot() const { return Root; }
184 /// getEntryNode - Return the token chain corresponding to the entry of the
186 SDValue getEntryNode() const {
187 return SDValue(const_cast<SDNode *>(&EntryNode), 0);
190 /// setRoot - Set the current root tag of the SelectionDAG.
192 const SDValue &setRoot(SDValue N) {
193 assert((!N.getNode() || N.getValueType() == MVT::Other) &&
194 "DAG root value is not a chain!");
198 /// Combine - This iterates over the nodes in the SelectionDAG, folding
199 /// certain types of nodes together, or eliminating superfluous nodes. The
200 /// Level argument controls whether Combine is allowed to produce nodes and
201 /// types that are illegal on the target.
202 void Combine(CombineLevel Level, AliasAnalysis &AA, bool Fast);
204 /// LegalizeTypes - This transforms the SelectionDAG into a SelectionDAG that
205 /// only uses types natively supported by the target. Returns "true" if it
206 /// made any changes.
208 /// Note that this is an involved process that may invalidate pointers into
210 bool LegalizeTypes();
212 /// Legalize - This transforms the SelectionDAG into a SelectionDAG that is
213 /// compatible with the target instruction selector, as indicated by the
214 /// TargetLowering object.
216 /// Note that this is an involved process that may invalidate pointers into
218 void Legalize(bool TypesNeedLegalizing);
220 /// RemoveDeadNodes - This method deletes all unreachable nodes in the
222 void RemoveDeadNodes();
224 /// DeleteNode - Remove the specified node from the system. This node must
225 /// have no referrers.
226 void DeleteNode(SDNode *N);
228 /// getVTList - Return an SDVTList that represents the list of values
230 SDVTList getVTList(MVT VT);
231 SDVTList getVTList(MVT VT1, MVT VT2);
232 SDVTList getVTList(MVT VT1, MVT VT2, MVT VT3);
233 SDVTList getVTList(MVT VT1, MVT VT2, MVT VT3, MVT VT4);
234 SDVTList getVTList(const MVT *VTs, unsigned NumVTs);
236 /// getNodeValueTypes - These are obsolete, use getVTList instead.
237 const MVT *getNodeValueTypes(MVT VT) {
238 return getVTList(VT).VTs;
240 const MVT *getNodeValueTypes(MVT VT1, MVT VT2) {
241 return getVTList(VT1, VT2).VTs;
243 const MVT *getNodeValueTypes(MVT VT1, MVT VT2, MVT VT3) {
244 return getVTList(VT1, VT2, VT3).VTs;
246 const MVT *getNodeValueTypes(MVT VT1, MVT VT2, MVT VT3, MVT VT4) {
247 return getVTList(VT1, VT2, VT3, VT4).VTs;
249 const MVT *getNodeValueTypes(const std::vector<MVT> &vtList) {
250 return getVTList(&vtList[0], (unsigned)vtList.size()).VTs;
254 //===--------------------------------------------------------------------===//
255 // Node creation methods.
257 SDValue getConstant(uint64_t Val, MVT VT, bool isTarget = false);
258 SDValue getConstant(const APInt &Val, MVT VT, bool isTarget = false);
259 SDValue getConstant(const ConstantInt &Val, MVT VT, bool isTarget = false);
260 SDValue getIntPtrConstant(uint64_t Val, bool isTarget = false);
261 SDValue getTargetConstant(uint64_t Val, MVT VT) {
262 return getConstant(Val, VT, true);
264 SDValue getTargetConstant(const APInt &Val, MVT VT) {
265 return getConstant(Val, VT, true);
267 SDValue getTargetConstant(const ConstantInt &Val, MVT VT) {
268 return getConstant(Val, VT, true);
270 SDValue getConstantFP(double Val, MVT VT, bool isTarget = false);
271 SDValue getConstantFP(const APFloat& Val, MVT VT, bool isTarget = false);
272 SDValue getConstantFP(const ConstantFP &CF, MVT VT, bool isTarget = false);
273 SDValue getTargetConstantFP(double Val, MVT VT) {
274 return getConstantFP(Val, VT, true);
276 SDValue getTargetConstantFP(const APFloat& Val, MVT VT) {
277 return getConstantFP(Val, VT, true);
279 SDValue getTargetConstantFP(const ConstantFP &Val, MVT VT) {
280 return getConstantFP(Val, VT, true);
282 SDValue getGlobalAddress(const GlobalValue *GV, MVT VT,
283 int64_t offset = 0, bool isTargetGA = false);
284 SDValue getTargetGlobalAddress(const GlobalValue *GV, MVT VT,
285 int64_t offset = 0) {
286 return getGlobalAddress(GV, VT, offset, true);
288 SDValue getFrameIndex(int FI, MVT VT, bool isTarget = false);
289 SDValue getTargetFrameIndex(int FI, MVT VT) {
290 return getFrameIndex(FI, VT, true);
292 SDValue getJumpTable(int JTI, MVT VT, bool isTarget = false);
293 SDValue getTargetJumpTable(int JTI, MVT VT) {
294 return getJumpTable(JTI, VT, true);
296 SDValue getConstantPool(Constant *C, MVT VT,
297 unsigned Align = 0, int Offs = 0, bool isT=false);
298 SDValue getTargetConstantPool(Constant *C, MVT VT,
299 unsigned Align = 0, int Offset = 0) {
300 return getConstantPool(C, VT, Align, Offset, true);
302 SDValue getConstantPool(MachineConstantPoolValue *C, MVT VT,
303 unsigned Align = 0, int Offs = 0, bool isT=false);
304 SDValue getTargetConstantPool(MachineConstantPoolValue *C,
305 MVT VT, unsigned Align = 0,
307 return getConstantPool(C, VT, Align, Offset, true);
309 // When generating a branch to a BB, we don't in general know enough
310 // to provide debug info for the BB at that time, so keep this one around.
311 SDValue getBasicBlock(MachineBasicBlock *MBB);
312 SDValue getBasicBlock(MachineBasicBlock *MBB, DebugLoc dl);
313 SDValue getExternalSymbol(const char *Sym, MVT VT);
314 SDValue getExternalSymbol(const char *Sym, DebugLoc dl, MVT VT);
315 SDValue getTargetExternalSymbol(const char *Sym, MVT VT);
316 SDValue getTargetExternalSymbol(const char *Sym, DebugLoc dl, MVT VT);
317 SDValue getArgFlags(ISD::ArgFlagsTy Flags);
318 SDValue getValueType(MVT);
319 SDValue getRegister(unsigned Reg, MVT VT);
320 SDValue getDbgStopPoint(SDValue Root, unsigned Line, unsigned Col,
322 SDValue getLabel(unsigned Opcode, DebugLoc dl, SDValue Root,
325 SDValue getCopyToReg(SDValue Chain, DebugLoc dl, unsigned Reg, SDValue N) {
326 return getNode(ISD::CopyToReg, dl, MVT::Other, Chain,
327 getRegister(Reg, N.getValueType()), N);
330 // This version of the getCopyToReg method takes an extra operand, which
331 // indicates that there is potentially an incoming flag value (if Flag is not
332 // null) and that there should be a flag result.
333 SDValue getCopyToReg(SDValue Chain, DebugLoc dl, unsigned Reg, SDValue N,
335 const MVT *VTs = getNodeValueTypes(MVT::Other, MVT::Flag);
336 SDValue Ops[] = { Chain, getRegister(Reg, N.getValueType()), N, Flag };
337 return getNode(ISD::CopyToReg, dl, VTs, 2, Ops, Flag.getNode() ? 4 : 3);
340 // Similar to last getCopyToReg() except parameter Reg is a SDValue
341 SDValue getCopyToReg(SDValue Chain, DebugLoc dl, SDValue Reg, SDValue N,
343 const MVT *VTs = getNodeValueTypes(MVT::Other, MVT::Flag);
344 SDValue Ops[] = { Chain, Reg, N, Flag };
345 return getNode(ISD::CopyToReg, dl, VTs, 2, Ops, Flag.getNode() ? 4 : 3);
348 SDValue getCopyFromReg(SDValue Chain, DebugLoc dl, unsigned Reg, MVT VT) {
349 const MVT *VTs = getNodeValueTypes(VT, MVT::Other);
350 SDValue Ops[] = { Chain, getRegister(Reg, VT) };
351 return getNode(ISD::CopyFromReg, dl, VTs, 2, Ops, 2);
354 // This version of the getCopyFromReg method takes an extra operand, which
355 // indicates that there is potentially an incoming flag value (if Flag is not
356 // null) and that there should be a flag result.
357 SDValue getCopyFromReg(SDValue Chain, DebugLoc dl, unsigned Reg, MVT VT,
359 const MVT *VTs = getNodeValueTypes(VT, MVT::Other, MVT::Flag);
360 SDValue Ops[] = { Chain, getRegister(Reg, VT), Flag };
361 return getNode(ISD::CopyFromReg, dl, VTs, 3, Ops, Flag.getNode() ? 3 : 2);
364 SDValue getCondCode(ISD::CondCode Cond);
366 /// Returns the ConvertRndSat Note: Avoid using this node because it may
367 /// disappear in the future and most targets don't support it.
368 SDValue getConvertRndSat(MVT VT, DebugLoc dl, SDValue Val, SDValue DTy,
370 SDValue Rnd, SDValue Sat, ISD::CvtCode Code);
372 /// getZeroExtendInReg - Return the expression required to zero extend the Op
373 /// value assuming it was the smaller SrcTy value.
374 SDValue getZeroExtendInReg(SDValue Op, DebugLoc DL, MVT SrcTy);
376 /// getNOT - Create a bitwise NOT operation as (XOR Val, -1).
377 SDValue getNOT(DebugLoc DL, SDValue Val, MVT VT);
379 /// getCALLSEQ_START - Return a new CALLSEQ_START node, which always must have
380 /// a flag result (to ensure it's not CSE'd).
381 SDValue getCALLSEQ_START(SDValue Chain, SDValue Op) {
382 const MVT *VTs = getNodeValueTypes(MVT::Other, MVT::Flag);
383 SDValue Ops[] = { Chain, Op };
384 return getNode(ISD::CALLSEQ_START, VTs, 2, Ops, 2);
387 /// getCALLSEQ_END - Return a new CALLSEQ_END node, which always must have a
388 /// flag result (to ensure it's not CSE'd).
389 SDValue getCALLSEQ_END(SDValue Chain, SDValue Op1, SDValue Op2,
391 SDVTList NodeTys = getVTList(MVT::Other, MVT::Flag);
392 SmallVector<SDValue, 4> Ops;
393 Ops.push_back(Chain);
396 Ops.push_back(InFlag);
397 return getNode(ISD::CALLSEQ_END, NodeTys, &Ops[0],
398 (unsigned)Ops.size() - (InFlag.getNode() == 0 ? 1 : 0));
401 /// getNode - Gets or creates the specified node.
403 SDValue getNode(unsigned Opcode, MVT VT);
404 SDValue getNode(unsigned Opcode, DebugLoc DL, MVT VT);
405 SDValue getNode(unsigned Opcode, MVT VT, SDValue N);
406 SDValue getNode(unsigned Opcode, DebugLoc DL, MVT VT, SDValue N);
407 SDValue getNode(unsigned Opcode, MVT VT, SDValue N1, SDValue N2);
408 SDValue getNode(unsigned Opcode, DebugLoc DL, MVT VT, SDValue N1, SDValue N2);
409 SDValue getNode(unsigned Opcode, MVT VT,
410 SDValue N1, SDValue N2, SDValue N3);
411 SDValue getNode(unsigned Opcode, DebugLoc DL, MVT VT,
412 SDValue N1, SDValue N2, SDValue N3);
413 SDValue getNode(unsigned Opcode, MVT VT,
414 SDValue N1, SDValue N2, SDValue N3, SDValue N4);
415 SDValue getNode(unsigned Opcode, DebugLoc DL, MVT VT,
416 SDValue N1, SDValue N2, SDValue N3, SDValue N4);
417 SDValue getNode(unsigned Opcode, MVT VT,
418 SDValue N1, SDValue N2, SDValue N3, SDValue N4,
420 SDValue getNode(unsigned Opcode, DebugLoc DL, MVT VT,
421 SDValue N1, SDValue N2, SDValue N3, SDValue N4,
423 SDValue getNode(unsigned Opcode, MVT VT,
424 const SDUse *Ops, unsigned NumOps);
425 SDValue getNode(unsigned Opcode, DebugLoc DL, MVT VT,
426 const SDUse *Ops, unsigned NumOps);
427 SDValue getNode(unsigned Opcode, DebugLoc DL, MVT VT,
428 const SDValue *Ops, unsigned NumOps);
429 SDValue getNode(unsigned Opcode, DebugLoc DL,
430 const std::vector<MVT> &ResultTys,
431 const SDValue *Ops, unsigned NumOps);
432 SDValue getNode(unsigned Opcode, const MVT *VTs, unsigned NumVTs,
433 const SDValue *Ops, unsigned NumOps);
434 SDValue getNode(unsigned Opcode, DebugLoc DL, const MVT *VTs, unsigned NumVTs,
435 const SDValue *Ops, unsigned NumOps);
436 SDValue getNode(unsigned Opcode, SDVTList VTs,
437 const SDValue *Ops, unsigned NumOps);
438 SDValue getNode(unsigned Opcode, DebugLoc DL, SDVTList VTs,
439 const SDValue *Ops, unsigned NumOps);
441 SDValue getNode(unsigned Opcode, DebugLoc DL, SDVTList VTs);
442 SDValue getNode(unsigned Opcode, DebugLoc DL, SDVTList VTs, SDValue N);
443 SDValue getNode(unsigned Opcode, DebugLoc DL, SDVTList VTs,
444 SDValue N1, SDValue N2);
445 SDValue getNode(unsigned Opcode, DebugLoc DL, SDVTList VTs,
446 SDValue N1, SDValue N2, SDValue N3);
447 SDValue getNode(unsigned Opcode, DebugLoc DL, SDVTList VTs,
448 SDValue N1, SDValue N2, SDValue N3, SDValue N4);
449 SDValue getNode(unsigned Opcode, DebugLoc DL, SDVTList VTs,
450 SDValue N1, SDValue N2, SDValue N3, SDValue N4,
453 SDValue getMemcpy(SDValue Chain, DebugLoc dl, SDValue Dst, SDValue Src,
454 SDValue Size, unsigned Align, bool AlwaysInline,
455 const Value *DstSV, uint64_t DstSVOff,
456 const Value *SrcSV, uint64_t SrcSVOff);
458 SDValue getMemmove(SDValue Chain, DebugLoc dl, SDValue Dst, SDValue Src,
459 SDValue Size, unsigned Align,
460 const Value *DstSV, uint64_t DstOSVff,
461 const Value *SrcSV, uint64_t SrcSVOff);
463 SDValue getMemset(SDValue Chain, DebugLoc dl, SDValue Dst, SDValue Src,
464 SDValue Size, unsigned Align,
465 const Value *DstSV, uint64_t DstSVOff);
467 /// getSetCC - Helper function to make it easier to build SetCC's if you just
468 /// have an ISD::CondCode instead of an SDValue.
470 SDValue getSetCC(DebugLoc DL, MVT VT, SDValue LHS, SDValue RHS,
471 ISD::CondCode Cond) {
472 return getNode(ISD::SETCC, DL, VT, LHS, RHS, getCondCode(Cond));
475 /// getVSetCC - Helper function to make it easier to build VSetCC's nodes
476 /// if you just have an ISD::CondCode instead of an SDValue.
478 SDValue getVSetCC(DebugLoc DL, MVT VT, SDValue LHS, SDValue RHS,
479 ISD::CondCode Cond) {
480 return getNode(ISD::VSETCC, DL, VT, LHS, RHS, getCondCode(Cond));
483 /// getSelectCC - Helper function to make it easier to build SelectCC's if you
484 /// just have an ISD::CondCode instead of an SDValue.
486 SDValue getSelectCC(DebugLoc DL, SDValue LHS, SDValue RHS,
487 SDValue True, SDValue False, ISD::CondCode Cond) {
488 return getNode(ISD::SELECT_CC, DL, True.getValueType(),
489 LHS, RHS, True, False, getCondCode(Cond));
492 /// getVAArg - VAArg produces a result and token chain, and takes a pointer
493 /// and a source value as input.
494 SDValue getVAArg(MVT VT, DebugLoc dl, SDValue Chain, SDValue Ptr,
497 /// getAtomic - Gets a node for an atomic op, produces result and chain and
499 SDValue getAtomic(unsigned Opcode, DebugLoc dl, MVT MemVT, SDValue Chain,
500 SDValue Ptr, SDValue Cmp, SDValue Swp, const Value* PtrVal,
501 unsigned Alignment=0);
503 /// getAtomic - Gets a node for an atomic op, produces result and chain and
504 /// takes 2 operands.
505 SDValue getAtomic(unsigned Opcode, DebugLoc dl, MVT MemVT, SDValue Chain,
506 SDValue Ptr, SDValue Val, const Value* PtrVal,
507 unsigned Alignment = 0);
509 /// getMemIntrinsicNode - Creates a MemIntrinsicNode that may produce a
510 /// result and takes a list of operands.
511 SDValue getMemIntrinsicNode(unsigned Opcode, DebugLoc dl,
512 const MVT *VTs, unsigned NumVTs,
513 const SDValue *Ops, unsigned NumOps,
514 MVT MemVT, const Value *srcValue, int SVOff,
515 unsigned Align = 0, bool Vol = false,
516 bool ReadMem = true, bool WriteMem = true);
518 SDValue getMemIntrinsicNode(unsigned Opcode, DebugLoc dl, SDVTList VTList,
519 const SDValue *Ops, unsigned NumOps,
520 MVT MemVT, const Value *srcValue, int SVOff,
521 unsigned Align = 0, bool Vol = false,
522 bool ReadMem = true, bool WriteMem = true);
524 /// getMergeValues - Create a MERGE_VALUES node from the given operands.
525 SDValue getMergeValues(const SDValue *Ops, unsigned NumOps, DebugLoc dl);
527 /// getCall - Create a CALL node from the given information.
529 SDValue getCall(unsigned CallingConv, DebugLoc dl, bool IsVarArgs,
530 bool IsTailCall, bool isInreg, SDVTList VTs,
531 const SDValue *Operands, unsigned NumOperands);
533 /// getLoad - Loads are not normal binary operators: their result type is not
534 /// determined by their operands, and they produce a value AND a token chain.
536 SDValue getLoad(MVT VT, DebugLoc dl, SDValue Chain, SDValue Ptr,
537 const Value *SV, int SVOffset, bool isVolatile=false,
538 unsigned Alignment=0);
539 SDValue getExtLoad(ISD::LoadExtType ExtType, DebugLoc dl, MVT VT,
540 SDValue Chain, SDValue Ptr, const Value *SV,
541 int SVOffset, MVT EVT, bool isVolatile=false,
542 unsigned Alignment=0);
543 SDValue getIndexedLoad(SDValue OrigLoad, DebugLoc dl, SDValue Base,
544 SDValue Offset, ISD::MemIndexedMode AM);
545 SDValue getLoad(ISD::MemIndexedMode AM, DebugLoc dl, ISD::LoadExtType ExtType,
546 MVT VT, SDValue Chain,
547 SDValue Ptr, SDValue Offset,
548 const Value *SV, int SVOffset, MVT EVT,
549 bool isVolatile=false, unsigned Alignment=0);
551 /// getStore - Helper function to build ISD::STORE nodes.
553 SDValue getStore(SDValue Chain, DebugLoc dl, SDValue Val, SDValue Ptr,
554 const Value *SV, int SVOffset, bool isVolatile=false,
555 unsigned Alignment=0);
556 SDValue getTruncStore(SDValue Chain, DebugLoc dl, SDValue Val, SDValue Ptr,
557 const Value *SV, int SVOffset, MVT TVT,
558 bool isVolatile=false, unsigned Alignment=0);
559 SDValue getIndexedStore(SDValue OrigStoe, DebugLoc dl, SDValue Base,
560 SDValue Offset, ISD::MemIndexedMode AM);
562 /// getSrcValue - Construct a node to track a Value* through the backend.
563 SDValue getSrcValue(const Value *v);
565 /// getMemOperand - Construct a node to track a memory reference
566 /// through the backend.
567 SDValue getMemOperand(const MachineMemOperand &MO);
569 /// getShiftAmountOperand - Return the specified value casted to
570 /// the target's desired shift amount type.
571 SDValue getShiftAmountOperand(SDValue Op);
573 /// UpdateNodeOperands - *Mutate* the specified node in-place to have the
574 /// specified operands. If the resultant node already exists in the DAG,
575 /// this does not modify the specified node, instead it returns the node that
576 /// already exists. If the resultant node does not exist in the DAG, the
577 /// input node is returned. As a degenerate case, if you specify the same
578 /// input operands as the node already has, the input node is returned.
579 SDValue UpdateNodeOperands(SDValue N, SDValue Op);
580 SDValue UpdateNodeOperands(SDValue N, SDValue Op1, SDValue Op2);
581 SDValue UpdateNodeOperands(SDValue N, SDValue Op1, SDValue Op2,
583 SDValue UpdateNodeOperands(SDValue N, SDValue Op1, SDValue Op2,
584 SDValue Op3, SDValue Op4);
585 SDValue UpdateNodeOperands(SDValue N, SDValue Op1, SDValue Op2,
586 SDValue Op3, SDValue Op4, SDValue Op5);
587 SDValue UpdateNodeOperands(SDValue N,
588 const SDValue *Ops, unsigned NumOps);
590 /// SelectNodeTo - These are used for target selectors to *mutate* the
591 /// specified node to have the specified return type, Target opcode, and
592 /// operands. Note that target opcodes are stored as
593 /// ~TargetOpcode in the node opcode field. The resultant node is returned.
594 SDNode *SelectNodeTo(SDNode *N, unsigned TargetOpc, MVT VT);
595 SDNode *SelectNodeTo(SDNode *N, unsigned TargetOpc, MVT VT, SDValue Op1);
596 SDNode *SelectNodeTo(SDNode *N, unsigned TargetOpc, MVT VT,
597 SDValue Op1, SDValue Op2);
598 SDNode *SelectNodeTo(SDNode *N, unsigned TargetOpc, MVT VT,
599 SDValue Op1, SDValue Op2, SDValue Op3);
600 SDNode *SelectNodeTo(SDNode *N, unsigned TargetOpc, MVT VT,
601 const SDValue *Ops, unsigned NumOps);
602 SDNode *SelectNodeTo(SDNode *N, unsigned TargetOpc, MVT VT1, MVT VT2);
603 SDNode *SelectNodeTo(SDNode *N, unsigned TargetOpc, MVT VT1,
604 MVT VT2, const SDValue *Ops, unsigned NumOps);
605 SDNode *SelectNodeTo(SDNode *N, unsigned TargetOpc, MVT VT1,
606 MVT VT2, MVT VT3, const SDValue *Ops, unsigned NumOps);
607 SDNode *SelectNodeTo(SDNode *N, unsigned MachineOpc, MVT VT1,
608 MVT VT2, MVT VT3, MVT VT4, const SDValue *Ops,
610 SDNode *SelectNodeTo(SDNode *N, unsigned TargetOpc, MVT VT1,
611 MVT VT2, SDValue Op1);
612 SDNode *SelectNodeTo(SDNode *N, unsigned TargetOpc, MVT VT1,
613 MVT VT2, SDValue Op1, SDValue Op2);
614 SDNode *SelectNodeTo(SDNode *N, unsigned TargetOpc, MVT VT1,
615 MVT VT2, SDValue Op1, SDValue Op2, SDValue Op3);
616 SDNode *SelectNodeTo(SDNode *N, unsigned TargetOpc, MVT VT1,
617 MVT VT2, MVT VT3, SDValue Op1, SDValue Op2, SDValue Op3);
618 SDNode *SelectNodeTo(SDNode *N, unsigned TargetOpc, SDVTList VTs,
619 const SDValue *Ops, unsigned NumOps);
621 /// MorphNodeTo - These *mutate* the specified node to have the specified
622 /// return type, opcode, and operands.
623 SDNode *MorphNodeTo(SDNode *N, unsigned Opc, MVT VT);
624 SDNode *MorphNodeTo(SDNode *N, unsigned Opc, MVT VT, SDValue Op1);
625 SDNode *MorphNodeTo(SDNode *N, unsigned Opc, MVT VT,
626 SDValue Op1, SDValue Op2);
627 SDNode *MorphNodeTo(SDNode *N, unsigned Opc, MVT VT,
628 SDValue Op1, SDValue Op2, SDValue Op3);
629 SDNode *MorphNodeTo(SDNode *N, unsigned Opc, MVT VT,
630 const SDValue *Ops, unsigned NumOps);
631 SDNode *MorphNodeTo(SDNode *N, unsigned Opc, MVT VT1, MVT VT2);
632 SDNode *MorphNodeTo(SDNode *N, unsigned Opc, MVT VT1,
633 MVT VT2, const SDValue *Ops, unsigned NumOps);
634 SDNode *MorphNodeTo(SDNode *N, unsigned Opc, MVT VT1,
635 MVT VT2, MVT VT3, const SDValue *Ops, unsigned NumOps);
636 SDNode *MorphNodeTo(SDNode *N, unsigned Opc, MVT VT1,
637 MVT VT2, SDValue Op1);
638 SDNode *MorphNodeTo(SDNode *N, unsigned Opc, MVT VT1,
639 MVT VT2, SDValue Op1, SDValue Op2);
640 SDNode *MorphNodeTo(SDNode *N, unsigned Opc, MVT VT1,
641 MVT VT2, SDValue Op1, SDValue Op2, SDValue Op3);
642 SDNode *MorphNodeTo(SDNode *N, unsigned Opc, SDVTList VTs,
643 const SDValue *Ops, unsigned NumOps);
645 /// getTargetNode - These are used for target selectors to create a new node
646 /// with specified return type(s), target opcode, and operands.
648 /// Note that getTargetNode returns the resultant node. If there is already a
649 /// node of the specified opcode and operands, it returns that node instead of
651 SDNode *getTargetNode(unsigned Opcode, MVT VT);
652 SDNode *getTargetNode(unsigned Opcode, DebugLoc dl, MVT VT);
654 SDNode *getTargetNode(unsigned Opcode, MVT VT, SDValue Op1);
655 SDNode *getTargetNode(unsigned Opcode, DebugLoc dl, MVT VT, SDValue Op1);
657 SDNode *getTargetNode(unsigned Opcode, MVT VT, SDValue Op1, SDValue Op2);
658 SDNode *getTargetNode(unsigned Opcode, DebugLoc dl, MVT VT, SDValue Op1,
661 SDNode *getTargetNode(unsigned Opcode, MVT VT,
662 SDValue Op1, SDValue Op2, SDValue Op3);
663 SDNode *getTargetNode(unsigned Opcode, DebugLoc dl, MVT VT,
664 SDValue Op1, SDValue Op2, SDValue Op3);
666 SDNode *getTargetNode(unsigned Opcode, DebugLoc dl, MVT VT,
667 const SDValue *Ops, unsigned NumOps);
669 SDNode *getTargetNode(unsigned Opcode, MVT VT1, MVT VT2);
670 SDNode *getTargetNode(unsigned Opcode, DebugLoc dl, MVT VT1, MVT VT2);
672 SDNode *getTargetNode(unsigned Opcode, MVT VT1, MVT VT2, SDValue Op1);
673 SDNode *getTargetNode(unsigned Opcode, DebugLoc dl, MVT VT1, MVT VT2,
676 SDNode *getTargetNode(unsigned Opcode, MVT VT1,
677 MVT VT2, SDValue Op1, SDValue Op2);
678 SDNode *getTargetNode(unsigned Opcode, DebugLoc dl, MVT VT1,
679 MVT VT2, SDValue Op1, SDValue Op2);
681 SDNode *getTargetNode(unsigned Opcode, MVT VT1,
682 MVT VT2, SDValue Op1, SDValue Op2, SDValue Op3);
683 SDNode *getTargetNode(unsigned Opcode, DebugLoc dl, MVT VT1,
684 MVT VT2, SDValue Op1, SDValue Op2, SDValue Op3);
686 SDNode *getTargetNode(unsigned Opcode, MVT VT1, MVT VT2,
687 const SDValue *Ops, unsigned NumOps);
688 SDNode *getTargetNode(unsigned Opcode, DebugLoc dl, MVT VT1, MVT VT2,
689 const SDValue *Ops, unsigned NumOps);
691 SDNode *getTargetNode(unsigned Opcode, MVT VT1, MVT VT2, MVT VT3,
692 SDValue Op1, SDValue Op2);
693 SDNode *getTargetNode(unsigned Opcode, DebugLoc dl, MVT VT1, MVT VT2, MVT VT3,
694 SDValue Op1, SDValue Op2);
696 SDNode *getTargetNode(unsigned Opcode, MVT VT1, MVT VT2, MVT VT3,
697 SDValue Op1, SDValue Op2, SDValue Op3);
698 SDNode *getTargetNode(unsigned Opcode, DebugLoc dl, MVT VT1, MVT VT2, MVT VT3,
699 SDValue Op1, SDValue Op2, SDValue Op3);
701 SDNode *getTargetNode(unsigned Opcode, MVT VT1, MVT VT2, MVT VT3,
702 const SDValue *Ops, unsigned NumOps);
703 SDNode *getTargetNode(unsigned Opcode, DebugLoc dl, MVT VT1, MVT VT2, MVT VT3,
704 const SDValue *Ops, unsigned NumOps);
706 SDNode *getTargetNode(unsigned Opcode, MVT VT1, MVT VT2, MVT VT3, MVT VT4,
707 const SDValue *Ops, unsigned NumOps);
708 SDNode *getTargetNode(unsigned Opcode, DebugLoc dl, MVT VT1, MVT VT2, MVT VT3,
709 MVT VT4, const SDValue *Ops, unsigned NumOps);
711 SDNode *getTargetNode(unsigned Opcode, const std::vector<MVT> &ResultTys,
712 const SDValue *Ops, unsigned NumOps);
713 SDNode *getTargetNode(unsigned Opcode, DebugLoc dl,
714 const std::vector<MVT> &ResultTys, const SDValue *Ops,
717 /// getNodeIfExists - Get the specified node if it's already available, or
718 /// else return NULL.
719 SDNode *getNodeIfExists(unsigned Opcode, SDVTList VTs,
720 const SDValue *Ops, unsigned NumOps);
722 /// DAGUpdateListener - Clients of various APIs that cause global effects on
723 /// the DAG can optionally implement this interface. This allows the clients
724 /// to handle the various sorts of updates that happen.
725 class DAGUpdateListener {
727 virtual ~DAGUpdateListener();
729 /// NodeDeleted - The node N that was deleted and, if E is not null, an
730 /// equivalent node E that replaced it.
731 virtual void NodeDeleted(SDNode *N, SDNode *E) = 0;
733 /// NodeUpdated - The node N that was updated.
734 virtual void NodeUpdated(SDNode *N) = 0;
737 /// RemoveDeadNode - Remove the specified node from the system. If any of its
738 /// operands then becomes dead, remove them as well. Inform UpdateListener
739 /// for each node deleted.
740 void RemoveDeadNode(SDNode *N, DAGUpdateListener *UpdateListener = 0);
742 /// RemoveDeadNodes - This method deletes the unreachable nodes in the
743 /// given list, and any nodes that become unreachable as a result.
744 void RemoveDeadNodes(SmallVectorImpl<SDNode *> &DeadNodes,
745 DAGUpdateListener *UpdateListener = 0);
747 /// ReplaceAllUsesWith - Modify anything using 'From' to use 'To' instead.
748 /// This can cause recursive merging of nodes in the DAG. Use the first
749 /// version if 'From' is known to have a single result, use the second
750 /// if you have two nodes with identical results, use the third otherwise.
752 /// These methods all take an optional UpdateListener, which (if not null) is
753 /// informed about nodes that are deleted and modified due to recursive
754 /// changes in the dag.
756 /// These functions only replace all existing uses. It's possible that as
757 /// these replacements are being performed, CSE may cause the From node
758 /// to be given new uses. These new uses of From are left in place, and
759 /// not automatically transfered to To.
761 void ReplaceAllUsesWith(SDValue From, SDValue Op,
762 DAGUpdateListener *UpdateListener = 0);
763 void ReplaceAllUsesWith(SDNode *From, SDNode *To,
764 DAGUpdateListener *UpdateListener = 0);
765 void ReplaceAllUsesWith(SDNode *From, const SDValue *To,
766 DAGUpdateListener *UpdateListener = 0);
768 /// ReplaceAllUsesOfValueWith - Replace any uses of From with To, leaving
769 /// uses of other values produced by From.Val alone.
770 void ReplaceAllUsesOfValueWith(SDValue From, SDValue To,
771 DAGUpdateListener *UpdateListener = 0);
773 /// ReplaceAllUsesOfValuesWith - Like ReplaceAllUsesOfValueWith, but
774 /// for multiple values at once. This correctly handles the case where
775 /// there is an overlap between the From values and the To values.
776 void ReplaceAllUsesOfValuesWith(const SDValue *From, const SDValue *To,
778 DAGUpdateListener *UpdateListener = 0);
780 /// AssignTopologicalOrder - Topological-sort the AllNodes list and a
781 /// assign a unique node id for each node in the DAG based on their
782 /// topological order. Returns the number of nodes.
783 unsigned AssignTopologicalOrder();
785 /// RepositionNode - Move node N in the AllNodes list to be immediately
786 /// before the given iterator Position. This may be used to update the
787 /// topological ordering when the list of nodes is modified.
788 void RepositionNode(allnodes_iterator Position, SDNode *N) {
789 AllNodes.insert(Position, AllNodes.remove(N));
792 /// isCommutativeBinOp - Returns true if the opcode is a commutative binary
794 static bool isCommutativeBinOp(unsigned Opcode) {
795 // FIXME: This should get its info from the td file, so that we can include
810 case ISD::ADDE: return true;
811 default: return false;
817 /// CreateStackTemporary - Create a stack temporary, suitable for holding the
818 /// specified value type. If minAlign is specified, the slot size will have
819 /// at least that alignment.
820 SDValue CreateStackTemporary(MVT VT, unsigned minAlign = 1);
822 /// CreateStackTemporary - Create a stack temporary suitable for holding
823 /// either of the specified value types.
824 SDValue CreateStackTemporary(MVT VT1, MVT VT2);
826 /// FoldConstantArithmetic -
827 SDValue FoldConstantArithmetic(unsigned Opcode,
829 ConstantSDNode *Cst1,
830 ConstantSDNode *Cst2);
832 /// FoldSetCC - Constant fold a setcc to true or false.
833 SDValue FoldSetCC(MVT VT, SDValue N1,
834 SDValue N2, ISD::CondCode Cond, DebugLoc dl);
836 /// SignBitIsZero - Return true if the sign bit of Op is known to be zero. We
837 /// use this predicate to simplify operations downstream.
838 bool SignBitIsZero(SDValue Op, unsigned Depth = 0) const;
840 /// MaskedValueIsZero - Return true if 'Op & Mask' is known to be zero. We
841 /// use this predicate to simplify operations downstream. Op and Mask are
842 /// known to be the same type.
843 bool MaskedValueIsZero(SDValue Op, const APInt &Mask, unsigned Depth = 0)
846 /// ComputeMaskedBits - Determine which of the bits specified in Mask are
847 /// known to be either zero or one and return them in the KnownZero/KnownOne
848 /// bitsets. This code only analyzes bits in Mask, in order to short-circuit
849 /// processing. Targets can implement the computeMaskedBitsForTargetNode
850 /// method in the TargetLowering class to allow target nodes to be understood.
851 void ComputeMaskedBits(SDValue Op, const APInt &Mask, APInt &KnownZero,
852 APInt &KnownOne, unsigned Depth = 0) const;
854 /// ComputeNumSignBits - Return the number of times the sign bit of the
855 /// register is replicated into the other bits. We know that at least 1 bit
856 /// is always equal to the sign bit (itself), but other cases can give us
857 /// information. For example, immediately after an "SRA X, 2", we know that
858 /// the top 3 bits are all equal to each other, so we return 3. Targets can
859 /// implement the ComputeNumSignBitsForTarget method in the TargetLowering
860 /// class to allow target nodes to be understood.
861 unsigned ComputeNumSignBits(SDValue Op, unsigned Depth = 0) const;
863 /// isVerifiedDebugInfoDesc - Returns true if the specified SDValue has
864 /// been verified as a debug information descriptor.
865 bool isVerifiedDebugInfoDesc(SDValue Op) const;
867 /// getShuffleScalarElt - Returns the scalar element that will make up the ith
868 /// element of the result of the vector shuffle.
869 SDValue getShuffleScalarElt(const SDNode *N, unsigned Idx);
872 bool RemoveNodeFromCSEMaps(SDNode *N);
873 void AddModifiedNodeToCSEMaps(SDNode *N, DAGUpdateListener *UpdateListener);
874 SDNode *FindModifiedNodeSlot(SDNode *N, SDValue Op, void *&InsertPos);
875 SDNode *FindModifiedNodeSlot(SDNode *N, SDValue Op1, SDValue Op2,
877 SDNode *FindModifiedNodeSlot(SDNode *N, const SDValue *Ops, unsigned NumOps,
880 void DeleteNodeNotInCSEMaps(SDNode *N);
881 void DeallocateNode(SDNode *N);
883 unsigned getMVTAlignment(MVT MemoryVT) const;
885 void allnodes_clear();
887 /// VTList - List of non-single value types.
888 std::vector<SDVTList> VTList;
890 /// CondCodeNodes - Maps to auto-CSE operations.
891 std::vector<CondCodeSDNode*> CondCodeNodes;
893 std::vector<SDNode*> ValueTypeNodes;
894 std::map<MVT, SDNode*, MVT::compareRawBits> ExtendedValueTypeNodes;
895 StringMap<SDNode*> ExternalSymbols;
896 StringMap<SDNode*> TargetExternalSymbols;
899 template <> struct GraphTraits<SelectionDAG*> : public GraphTraits<SDNode*> {
900 typedef SelectionDAG::allnodes_iterator nodes_iterator;
901 static nodes_iterator nodes_begin(SelectionDAG *G) {
902 return G->allnodes_begin();
904 static nodes_iterator nodes_end(SelectionDAG *G) {
905 return G->allnodes_end();
909 } // end namespace llvm