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/FoldingSet.h"
20 #include "llvm/ADT/StringMap.h"
21 #include "llvm/CodeGen/SelectionDAGNodes.h"
33 class MachineModuleInfo;
34 class MachineFunction;
35 class MachineConstantPoolValue;
36 class FunctionLoweringInfo;
38 template<> struct ilist_traits<SDNode> : public ilist_default_traits<SDNode> {
40 mutable SDNode Sentinel;
42 ilist_traits() : Sentinel(ISD::DELETED_NODE, SDVTList()) {}
44 SDNode *createSentinel() const {
47 static void destroySentinel(SDNode *) {}
49 static void deleteNode(SDNode *) {
50 assert(0 && "ilist_traits<SDNode> shouldn't see a deleteNode call!");
53 static void createNode(const SDNode &);
56 /// SelectionDAG class - This is used to represent a portion of an LLVM function
57 /// in a low-level Data Dependence DAG representation suitable for instruction
58 /// selection. This DAG is constructed as the first step of instruction
59 /// selection in order to allow implementation of machine specific optimizations
60 /// and code simplifications.
62 /// The representation used by the SelectionDAG is a target-independent
63 /// representation, which has some similarities to the GCC RTL representation,
64 /// but is significantly more simple, powerful, and is a graph form instead of a
70 FunctionLoweringInfo &FLI;
71 MachineModuleInfo *MMI;
73 /// EntryNode - The starting token.
76 /// Root - The root of the entire DAG.
79 /// AllNodes - A linked list of nodes in the current DAG.
80 ilist<SDNode> AllNodes;
82 /// NodeAllocatorType - The AllocatorType for allocating SDNodes. We use
83 /// pool allocation with recycling.
84 typedef RecyclingAllocator<BumpPtrAllocator, SDNode, sizeof(LargestSDNode),
85 AlignOf<MostAlignedSDNode>::Alignment>
88 /// NodeAllocator - Pool allocation for nodes.
89 NodeAllocatorType NodeAllocator;
91 /// CSEMap - This structure is used to memoize nodes, automatically performing
92 /// CSE with existing nodes with a duplicate is requested.
93 FoldingSet<SDNode> CSEMap;
95 /// OperandAllocator - Pool allocation for machine-opcode SDNode operands.
96 BumpPtrAllocator OperandAllocator;
98 /// Allocator - Pool allocation for misc. objects that are created once per
100 BumpPtrAllocator Allocator;
102 /// VerifyNode - Sanity check the given node. Aborts if it is invalid.
103 void VerifyNode(SDNode *N);
106 SelectionDAG(TargetLowering &tli, FunctionLoweringInfo &fli);
109 /// init - Prepare this SelectionDAG to process code in the given
112 void init(MachineFunction &mf, MachineModuleInfo *mmi);
114 /// clear - Clear state and free memory necessary to make this
115 /// SelectionDAG ready to process a new block.
119 MachineFunction &getMachineFunction() const { return *MF; }
120 const TargetMachine &getTarget() const;
121 TargetLowering &getTargetLoweringInfo() const { return TLI; }
122 FunctionLoweringInfo &getFunctionLoweringInfo() const { return FLI; }
123 MachineModuleInfo *getMachineModuleInfo() const { return MMI; }
125 /// viewGraph - Pop up a GraphViz/gv window with the DAG rendered using 'dot'.
127 void viewGraph(const std::string &Title);
131 std::map<const SDNode *, std::string> NodeGraphAttrs;
134 /// clearGraphAttrs - Clear all previously defined node graph attributes.
135 /// Intended to be used from a debugging tool (eg. gdb).
136 void clearGraphAttrs();
138 /// setGraphAttrs - Set graph attributes for a node. (eg. "color=red".)
140 void setGraphAttrs(const SDNode *N, const char *Attrs);
142 /// getGraphAttrs - Get graph attributes for a node. (eg. "color=red".)
143 /// Used from getNodeAttributes.
144 const std::string getGraphAttrs(const SDNode *N) const;
146 /// setGraphColor - Convenience for setting node color attribute.
148 void setGraphColor(const SDNode *N, const char *Color);
150 typedef ilist<SDNode>::const_iterator allnodes_const_iterator;
151 allnodes_const_iterator allnodes_begin() const { return AllNodes.begin(); }
152 allnodes_const_iterator allnodes_end() const { return AllNodes.end(); }
153 typedef ilist<SDNode>::iterator allnodes_iterator;
154 allnodes_iterator allnodes_begin() { return AllNodes.begin(); }
155 allnodes_iterator allnodes_end() { return AllNodes.end(); }
156 ilist<SDNode>::size_type allnodes_size() const {
157 return AllNodes.size();
160 /// getRoot - Return the root tag of the SelectionDAG.
162 const SDValue &getRoot() const { return Root; }
164 /// getEntryNode - Return the token chain corresponding to the entry of the
166 SDValue getEntryNode() const {
167 return SDValue(const_cast<SDNode *>(&EntryNode), 0);
170 /// setRoot - Set the current root tag of the SelectionDAG.
172 const SDValue &setRoot(SDValue N) {
173 assert((!N.getNode() || N.getValueType() == MVT::Other) &&
174 "DAG root value is not a chain!");
178 /// Combine - This iterates over the nodes in the SelectionDAG, folding
179 /// certain types of nodes together, or eliminating superfluous nodes. When
180 /// the AfterLegalize argument is set to 'true', Combine takes care not to
181 /// generate any nodes that will be illegal on the target.
182 void Combine(bool AfterLegalize, AliasAnalysis &AA, bool Fast);
184 /// LegalizeTypes - This transforms the SelectionDAG into a SelectionDAG that
185 /// only uses types natively supported by the target.
187 /// Note that this is an involved process that may invalidate pointers into
189 void LegalizeTypes();
191 /// Legalize - This transforms the SelectionDAG into a SelectionDAG that is
192 /// compatible with the target instruction selector, as indicated by the
193 /// TargetLowering object.
195 /// Note that this is an involved process that may invalidate pointers into
199 /// RemoveDeadNodes - This method deletes all unreachable nodes in the
201 void RemoveDeadNodes();
203 /// DeleteNode - Remove the specified node from the system. This node must
204 /// have no referrers.
205 void DeleteNode(SDNode *N);
207 /// getVTList - Return an SDVTList that represents the list of values
209 SDVTList getVTList(MVT VT);
210 SDVTList getVTList(MVT VT1, MVT VT2);
211 SDVTList getVTList(MVT VT1, MVT VT2, MVT VT3);
212 SDVTList getVTList(const MVT *VTs, unsigned NumVTs);
214 /// getNodeValueTypes - These are obsolete, use getVTList instead.
215 const MVT *getNodeValueTypes(MVT VT) {
216 return getVTList(VT).VTs;
218 const MVT *getNodeValueTypes(MVT VT1, MVT VT2) {
219 return getVTList(VT1, VT2).VTs;
221 const MVT *getNodeValueTypes(MVT VT1, MVT VT2, MVT VT3) {
222 return getVTList(VT1, VT2, VT3).VTs;
224 const MVT *getNodeValueTypes(const std::vector<MVT> &vtList) {
225 return getVTList(&vtList[0], (unsigned)vtList.size()).VTs;
229 //===--------------------------------------------------------------------===//
230 // Node creation methods.
232 SDValue getConstant(uint64_t Val, MVT VT, bool isTarget = false);
233 SDValue getConstant(const APInt &Val, MVT VT, bool isTarget = false);
234 SDValue getConstant(const ConstantInt &Val, MVT VT, bool isTarget = false);
235 SDValue getIntPtrConstant(uint64_t Val, bool isTarget = false);
236 SDValue getTargetConstant(uint64_t Val, MVT VT) {
237 return getConstant(Val, VT, true);
239 SDValue getTargetConstant(const APInt &Val, MVT VT) {
240 return getConstant(Val, VT, true);
242 SDValue getTargetConstant(const ConstantInt &Val, MVT VT) {
243 return getConstant(Val, VT, true);
245 SDValue getConstantFP(double Val, MVT VT, bool isTarget = false);
246 SDValue getConstantFP(const APFloat& Val, MVT VT, bool isTarget = false);
247 SDValue getConstantFP(const ConstantFP &CF, MVT VT, bool isTarget = false);
248 SDValue getTargetConstantFP(double Val, MVT VT) {
249 return getConstantFP(Val, VT, true);
251 SDValue getTargetConstantFP(const APFloat& Val, MVT VT) {
252 return getConstantFP(Val, VT, true);
254 SDValue getTargetConstantFP(const ConstantFP &Val, MVT VT) {
255 return getConstantFP(Val, VT, true);
257 SDValue getGlobalAddress(const GlobalValue *GV, MVT VT,
258 int offset = 0, bool isTargetGA = false);
259 SDValue getTargetGlobalAddress(const GlobalValue *GV, MVT VT,
261 return getGlobalAddress(GV, VT, offset, true);
263 SDValue getFrameIndex(int FI, MVT VT, bool isTarget = false);
264 SDValue getTargetFrameIndex(int FI, MVT VT) {
265 return getFrameIndex(FI, VT, true);
267 SDValue getJumpTable(int JTI, MVT VT, bool isTarget = false);
268 SDValue getTargetJumpTable(int JTI, MVT VT) {
269 return getJumpTable(JTI, VT, true);
271 SDValue getConstantPool(Constant *C, MVT VT,
272 unsigned Align = 0, int Offs = 0, bool isT=false);
273 SDValue getTargetConstantPool(Constant *C, MVT VT,
274 unsigned Align = 0, int Offset = 0) {
275 return getConstantPool(C, VT, Align, Offset, true);
277 SDValue getConstantPool(MachineConstantPoolValue *C, MVT VT,
278 unsigned Align = 0, int Offs = 0, bool isT=false);
279 SDValue getTargetConstantPool(MachineConstantPoolValue *C,
280 MVT VT, unsigned Align = 0,
282 return getConstantPool(C, VT, Align, Offset, true);
284 SDValue getBasicBlock(MachineBasicBlock *MBB);
285 SDValue getExternalSymbol(const char *Sym, MVT VT);
286 SDValue getTargetExternalSymbol(const char *Sym, MVT VT);
287 SDValue getArgFlags(ISD::ArgFlagsTy Flags);
288 SDValue getValueType(MVT);
289 SDValue getRegister(unsigned Reg, MVT VT);
290 SDValue getDbgStopPoint(SDValue Root, unsigned Line, unsigned Col,
291 const CompileUnitDesc *CU);
292 SDValue getLabel(unsigned Opcode, SDValue Root, unsigned LabelID);
294 SDValue getCopyToReg(SDValue Chain, unsigned Reg, SDValue N) {
295 return getNode(ISD::CopyToReg, MVT::Other, Chain,
296 getRegister(Reg, N.getValueType()), N);
299 // This version of the getCopyToReg method takes an extra operand, which
300 // indicates that there is potentially an incoming flag value (if Flag is not
301 // null) and that there should be a flag result.
302 SDValue getCopyToReg(SDValue Chain, unsigned Reg, SDValue N,
304 const MVT *VTs = getNodeValueTypes(MVT::Other, MVT::Flag);
305 SDValue Ops[] = { Chain, getRegister(Reg, N.getValueType()), N, Flag };
306 return getNode(ISD::CopyToReg, VTs, 2, Ops, Flag.getNode() ? 4 : 3);
309 // Similar to last getCopyToReg() except parameter Reg is a SDValue
310 SDValue getCopyToReg(SDValue Chain, SDValue Reg, SDValue N,
312 const MVT *VTs = getNodeValueTypes(MVT::Other, MVT::Flag);
313 SDValue Ops[] = { Chain, Reg, N, Flag };
314 return getNode(ISD::CopyToReg, VTs, 2, Ops, Flag.getNode() ? 4 : 3);
317 SDValue getCopyFromReg(SDValue Chain, unsigned Reg, MVT VT) {
318 const MVT *VTs = getNodeValueTypes(VT, MVT::Other);
319 SDValue Ops[] = { Chain, getRegister(Reg, VT) };
320 return getNode(ISD::CopyFromReg, VTs, 2, Ops, 2);
323 // This version of the getCopyFromReg method takes an extra operand, which
324 // indicates that there is potentially an incoming flag value (if Flag is not
325 // null) and that there should be a flag result.
326 SDValue getCopyFromReg(SDValue Chain, unsigned Reg, MVT VT,
328 const MVT *VTs = getNodeValueTypes(VT, MVT::Other, MVT::Flag);
329 SDValue Ops[] = { Chain, getRegister(Reg, VT), Flag };
330 return getNode(ISD::CopyFromReg, VTs, 3, Ops, Flag.getNode() ? 3 : 2);
333 SDValue getCondCode(ISD::CondCode Cond);
335 /// getZeroExtendInReg - Return the expression required to zero extend the Op
336 /// value assuming it was the smaller SrcTy value.
337 SDValue getZeroExtendInReg(SDValue Op, MVT SrcTy);
339 /// getCALLSEQ_START - Return a new CALLSEQ_START node, which always must have
340 /// a flag result (to ensure it's not CSE'd).
341 SDValue getCALLSEQ_START(SDValue Chain, SDValue Op) {
342 const MVT *VTs = getNodeValueTypes(MVT::Other, MVT::Flag);
343 SDValue Ops[] = { Chain, Op };
344 return getNode(ISD::CALLSEQ_START, VTs, 2, Ops, 2);
347 /// getCALLSEQ_END - Return a new CALLSEQ_END node, which always must have a
348 /// flag result (to ensure it's not CSE'd).
349 SDValue getCALLSEQ_END(SDValue Chain, SDValue Op1, SDValue Op2,
351 SDVTList NodeTys = getVTList(MVT::Other, MVT::Flag);
352 SmallVector<SDValue, 4> Ops;
353 Ops.push_back(Chain);
356 Ops.push_back(InFlag);
357 return getNode(ISD::CALLSEQ_END, NodeTys, &Ops[0],
358 (unsigned)Ops.size() - (InFlag.getNode() == 0 ? 1 : 0));
361 /// getNode - Gets or creates the specified node.
363 SDValue getNode(unsigned Opcode, MVT VT);
364 SDValue getNode(unsigned Opcode, MVT VT, SDValue N);
365 SDValue getNode(unsigned Opcode, MVT VT, SDValue N1, SDValue N2);
366 SDValue getNode(unsigned Opcode, MVT VT,
367 SDValue N1, SDValue N2, SDValue N3);
368 SDValue getNode(unsigned Opcode, MVT VT,
369 SDValue N1, SDValue N2, SDValue N3, SDValue N4);
370 SDValue getNode(unsigned Opcode, MVT VT,
371 SDValue N1, SDValue N2, SDValue N3, SDValue N4,
373 SDValue getNode(unsigned Opcode, MVT VT,
374 const SDValue *Ops, unsigned NumOps);
375 SDValue getNode(unsigned Opcode, MVT VT,
376 const SDUse *Ops, unsigned NumOps);
377 SDValue getNode(unsigned Opcode, const std::vector<MVT> &ResultTys,
378 const SDValue *Ops, unsigned NumOps);
379 SDValue getNode(unsigned Opcode, const MVT *VTs, unsigned NumVTs,
380 const SDValue *Ops, unsigned NumOps);
381 SDValue getNode(unsigned Opcode, SDVTList VTs);
382 SDValue getNode(unsigned Opcode, SDVTList VTs, SDValue N);
383 SDValue getNode(unsigned Opcode, SDVTList VTs, SDValue N1, SDValue N2);
384 SDValue getNode(unsigned Opcode, SDVTList VTs,
385 SDValue N1, SDValue N2, SDValue N3);
386 SDValue getNode(unsigned Opcode, SDVTList VTs,
387 SDValue N1, SDValue N2, SDValue N3, SDValue N4);
388 SDValue getNode(unsigned Opcode, SDVTList VTs,
389 SDValue N1, SDValue N2, SDValue N3, SDValue N4,
391 SDValue getNode(unsigned Opcode, SDVTList VTs,
392 const SDValue *Ops, unsigned NumOps);
394 SDValue getMemcpy(SDValue Chain, SDValue Dst, SDValue Src,
395 SDValue Size, unsigned Align,
397 const Value *DstSV, uint64_t DstSVOff,
398 const Value *SrcSV, uint64_t SrcSVOff);
400 SDValue getMemmove(SDValue Chain, SDValue Dst, SDValue Src,
401 SDValue Size, unsigned Align,
402 const Value *DstSV, uint64_t DstOSVff,
403 const Value *SrcSV, uint64_t SrcSVOff);
405 SDValue getMemset(SDValue Chain, SDValue Dst, SDValue Src,
406 SDValue Size, unsigned Align,
407 const Value *DstSV, uint64_t DstSVOff);
409 /// getSetCC - Helper function to make it easier to build SetCC's if you just
410 /// have an ISD::CondCode instead of an SDValue.
412 SDValue getSetCC(MVT VT, SDValue LHS, SDValue RHS,
413 ISD::CondCode Cond) {
414 return getNode(ISD::SETCC, VT, LHS, RHS, getCondCode(Cond));
417 /// getVSetCC - Helper function to make it easier to build VSetCC's nodes
418 /// if you just have an ISD::CondCode instead of an SDValue.
420 SDValue getVSetCC(MVT VT, SDValue LHS, SDValue RHS,
421 ISD::CondCode Cond) {
422 return getNode(ISD::VSETCC, VT, LHS, RHS, getCondCode(Cond));
425 /// getSelectCC - Helper function to make it easier to build SelectCC's if you
426 /// just have an ISD::CondCode instead of an SDValue.
428 SDValue getSelectCC(SDValue LHS, SDValue RHS,
429 SDValue True, SDValue False, ISD::CondCode Cond) {
430 return getNode(ISD::SELECT_CC, True.getValueType(), LHS, RHS, True, False,
434 /// getVAArg - VAArg produces a result and token chain, and takes a pointer
435 /// and a source value as input.
436 SDValue getVAArg(MVT VT, SDValue Chain, SDValue Ptr,
439 /// getAtomic - Gets a node for an atomic op, produces result and chain, takes
441 SDValue getAtomic(unsigned Opcode, SDValue Chain, SDValue Ptr,
442 SDValue Cmp, SDValue Swp, const Value* PtrVal,
443 unsigned Alignment=0);
445 /// getAtomic - Gets a node for an atomic op, produces result and chain, takes
447 SDValue getAtomic(unsigned Opcode, SDValue Chain, SDValue Ptr,
448 SDValue Val, const Value* PtrVal,
449 unsigned Alignment = 0);
451 /// getMergeValues - Create a MERGE_VALUES node from the given operands.
452 /// Allowed to return something different (and simpler) if Simplify is true.
453 SDValue getMergeValues(const SDValue *Ops, unsigned NumOps,
454 bool Simplify = true);
456 /// getMergeValues - Create a MERGE_VALUES node from the given types and ops.
457 /// Allowed to return something different (and simpler) if Simplify is true.
458 /// May be faster than the above version if VTs is known and NumOps is large.
459 SDValue getMergeValues(SDVTList VTs, const SDValue *Ops, unsigned NumOps,
460 bool Simplify = true) {
461 if (Simplify && NumOps == 1)
463 return getNode(ISD::MERGE_VALUES, VTs, Ops, NumOps);
466 /// getCall - Create a CALL node from the given information.
468 SDValue getCall(unsigned CallingConv, bool IsVarArgs, bool IsTailCall,
469 bool isInreg, SDVTList VTs, const SDValue *Operands,
470 unsigned NumOperands);
472 /// getLoad - Loads are not normal binary operators: their result type is not
473 /// determined by their operands, and they produce a value AND a token chain.
475 SDValue getLoad(MVT VT, SDValue Chain, SDValue Ptr,
476 const Value *SV, int SVOffset, bool isVolatile=false,
477 unsigned Alignment=0);
478 SDValue getExtLoad(ISD::LoadExtType ExtType, MVT VT,
479 SDValue Chain, SDValue Ptr, const Value *SV,
480 int SVOffset, MVT EVT, bool isVolatile=false,
481 unsigned Alignment=0);
482 SDValue getIndexedLoad(SDValue OrigLoad, SDValue Base,
483 SDValue Offset, ISD::MemIndexedMode AM);
484 SDValue getLoad(ISD::MemIndexedMode AM, ISD::LoadExtType ExtType,
485 MVT VT, SDValue Chain,
486 SDValue Ptr, SDValue Offset,
487 const Value *SV, int SVOffset, MVT EVT,
488 bool isVolatile=false, unsigned Alignment=0);
490 /// getStore - Helper function to build ISD::STORE nodes.
492 SDValue getStore(SDValue Chain, SDValue Val, SDValue Ptr,
493 const Value *SV, int SVOffset, bool isVolatile=false,
494 unsigned Alignment=0);
495 SDValue getTruncStore(SDValue Chain, SDValue Val, SDValue Ptr,
496 const Value *SV, int SVOffset, MVT TVT,
497 bool isVolatile=false, unsigned Alignment=0);
498 SDValue getIndexedStore(SDValue OrigStoe, SDValue Base,
499 SDValue Offset, ISD::MemIndexedMode AM);
501 // getSrcValue - Construct a node to track a Value* through the backend.
502 SDValue getSrcValue(const Value *v);
504 // getMemOperand - Construct a node to track a memory reference
505 // through the backend.
506 SDValue getMemOperand(const MachineMemOperand &MO);
508 /// UpdateNodeOperands - *Mutate* the specified node in-place to have the
509 /// specified operands. If the resultant node already exists in the DAG,
510 /// this does not modify the specified node, instead it returns the node that
511 /// already exists. If the resultant node does not exist in the DAG, the
512 /// input node is returned. As a degenerate case, if you specify the same
513 /// input operands as the node already has, the input node is returned.
514 SDValue UpdateNodeOperands(SDValue N, SDValue Op);
515 SDValue UpdateNodeOperands(SDValue N, SDValue Op1, SDValue Op2);
516 SDValue UpdateNodeOperands(SDValue N, SDValue Op1, SDValue Op2,
518 SDValue UpdateNodeOperands(SDValue N, SDValue Op1, SDValue Op2,
519 SDValue Op3, SDValue Op4);
520 SDValue UpdateNodeOperands(SDValue N, SDValue Op1, SDValue Op2,
521 SDValue Op3, SDValue Op4, SDValue Op5);
522 SDValue UpdateNodeOperands(SDValue N,
523 const SDValue *Ops, unsigned NumOps);
525 /// SelectNodeTo - These are used for target selectors to *mutate* the
526 /// specified node to have the specified return type, Target opcode, and
527 /// operands. Note that target opcodes are stored as
528 /// ~TargetOpcode in the node opcode field. The resultant node is returned.
529 SDNode *SelectNodeTo(SDNode *N, unsigned TargetOpc, MVT VT);
530 SDNode *SelectNodeTo(SDNode *N, unsigned TargetOpc, MVT VT, SDValue Op1);
531 SDNode *SelectNodeTo(SDNode *N, unsigned TargetOpc, MVT VT,
532 SDValue Op1, SDValue Op2);
533 SDNode *SelectNodeTo(SDNode *N, unsigned TargetOpc, MVT VT,
534 SDValue Op1, SDValue Op2, SDValue Op3);
535 SDNode *SelectNodeTo(SDNode *N, unsigned TargetOpc, MVT VT,
536 const SDValue *Ops, unsigned NumOps);
537 SDNode *SelectNodeTo(SDNode *N, unsigned TargetOpc, MVT VT1, MVT VT2);
538 SDNode *SelectNodeTo(SDNode *N, unsigned TargetOpc, MVT VT1,
539 MVT VT2, const SDValue *Ops, unsigned NumOps);
540 SDNode *SelectNodeTo(SDNode *N, unsigned TargetOpc, MVT VT1,
541 MVT VT2, MVT VT3, const SDValue *Ops, unsigned NumOps);
542 SDNode *SelectNodeTo(SDNode *N, unsigned TargetOpc, MVT VT1,
543 MVT VT2, SDValue Op1);
544 SDNode *SelectNodeTo(SDNode *N, unsigned TargetOpc, MVT VT1,
545 MVT VT2, SDValue Op1, SDValue Op2);
546 SDNode *SelectNodeTo(SDNode *N, unsigned TargetOpc, MVT VT1,
547 MVT VT2, SDValue Op1, SDValue Op2, SDValue Op3);
548 SDNode *SelectNodeTo(SDNode *N, unsigned TargetOpc, SDVTList VTs,
549 const SDValue *Ops, unsigned NumOps);
551 /// MorphNodeTo - These *mutate* the specified node to have the specified
552 /// return type, opcode, and operands.
553 SDNode *MorphNodeTo(SDNode *N, unsigned Opc, MVT VT);
554 SDNode *MorphNodeTo(SDNode *N, unsigned Opc, MVT VT, SDValue Op1);
555 SDNode *MorphNodeTo(SDNode *N, unsigned Opc, MVT VT,
556 SDValue Op1, SDValue Op2);
557 SDNode *MorphNodeTo(SDNode *N, unsigned Opc, MVT VT,
558 SDValue Op1, SDValue Op2, SDValue Op3);
559 SDNode *MorphNodeTo(SDNode *N, unsigned Opc, MVT VT,
560 const SDValue *Ops, unsigned NumOps);
561 SDNode *MorphNodeTo(SDNode *N, unsigned Opc, MVT VT1, MVT VT2);
562 SDNode *MorphNodeTo(SDNode *N, unsigned Opc, MVT VT1,
563 MVT VT2, const SDValue *Ops, unsigned NumOps);
564 SDNode *MorphNodeTo(SDNode *N, unsigned Opc, MVT VT1,
565 MVT VT2, MVT VT3, const SDValue *Ops, unsigned NumOps);
566 SDNode *MorphNodeTo(SDNode *N, unsigned Opc, MVT VT1,
567 MVT VT2, SDValue Op1);
568 SDNode *MorphNodeTo(SDNode *N, unsigned Opc, MVT VT1,
569 MVT VT2, SDValue Op1, SDValue Op2);
570 SDNode *MorphNodeTo(SDNode *N, unsigned Opc, MVT VT1,
571 MVT VT2, SDValue Op1, SDValue Op2, SDValue Op3);
572 SDNode *MorphNodeTo(SDNode *N, unsigned Opc, SDVTList VTs,
573 const SDValue *Ops, unsigned NumOps);
575 /// getTargetNode - These are used for target selectors to create a new node
576 /// with specified return type(s), target opcode, and operands.
578 /// Note that getTargetNode returns the resultant node. If there is already a
579 /// node of the specified opcode and operands, it returns that node instead of
581 SDNode *getTargetNode(unsigned Opcode, MVT VT);
582 SDNode *getTargetNode(unsigned Opcode, MVT VT, SDValue Op1);
583 SDNode *getTargetNode(unsigned Opcode, MVT VT, SDValue Op1, SDValue Op2);
584 SDNode *getTargetNode(unsigned Opcode, MVT VT,
585 SDValue Op1, SDValue Op2, SDValue Op3);
586 SDNode *getTargetNode(unsigned Opcode, MVT VT,
587 const SDValue *Ops, unsigned NumOps);
588 SDNode *getTargetNode(unsigned Opcode, MVT VT1, MVT VT2);
589 SDNode *getTargetNode(unsigned Opcode, MVT VT1, MVT VT2, SDValue Op1);
590 SDNode *getTargetNode(unsigned Opcode, MVT VT1,
591 MVT VT2, SDValue Op1, SDValue Op2);
592 SDNode *getTargetNode(unsigned Opcode, MVT VT1,
593 MVT VT2, SDValue Op1, SDValue Op2, SDValue Op3);
594 SDNode *getTargetNode(unsigned Opcode, MVT VT1, MVT VT2,
595 const SDValue *Ops, unsigned NumOps);
596 SDNode *getTargetNode(unsigned Opcode, MVT VT1, MVT VT2, MVT VT3,
597 SDValue Op1, SDValue Op2);
598 SDNode *getTargetNode(unsigned Opcode, MVT VT1, MVT VT2, MVT VT3,
599 SDValue Op1, SDValue Op2, SDValue Op3);
600 SDNode *getTargetNode(unsigned Opcode, MVT VT1, MVT VT2, MVT VT3,
601 const SDValue *Ops, unsigned NumOps);
602 SDNode *getTargetNode(unsigned Opcode, MVT VT1, MVT VT2, MVT VT3, MVT VT4,
603 const SDValue *Ops, unsigned NumOps);
604 SDNode *getTargetNode(unsigned Opcode, const std::vector<MVT> &ResultTys,
605 const SDValue *Ops, unsigned NumOps);
607 /// getNodeIfExists - Get the specified node if it's already available, or
608 /// else return NULL.
609 SDNode *getNodeIfExists(unsigned Opcode, SDVTList VTs,
610 const SDValue *Ops, unsigned NumOps);
612 /// DAGUpdateListener - Clients of various APIs that cause global effects on
613 /// the DAG can optionally implement this interface. This allows the clients
614 /// to handle the various sorts of updates that happen.
615 class DAGUpdateListener {
617 virtual ~DAGUpdateListener();
619 /// NodeDeleted - The node N that was deleted and, if E is not null, an
620 /// equivalent node E that replaced it.
621 virtual void NodeDeleted(SDNode *N, SDNode *E) = 0;
623 /// NodeUpdated - The node N that was updated.
624 virtual void NodeUpdated(SDNode *N) = 0;
627 /// RemoveDeadNode - Remove the specified node from the system. If any of its
628 /// operands then becomes dead, remove them as well. Inform UpdateListener
629 /// for each node deleted.
630 void RemoveDeadNode(SDNode *N, DAGUpdateListener *UpdateListener = 0);
632 /// RemoveDeadNodes - This method deletes the unreachable nodes in the
633 /// given list, and any nodes that become unreachable as a result.
634 void RemoveDeadNodes(SmallVectorImpl<SDNode *> &DeadNodes,
635 DAGUpdateListener *UpdateListener = 0);
637 /// ReplaceAllUsesWith - Modify anything using 'From' to use 'To' instead.
638 /// This can cause recursive merging of nodes in the DAG. Use the first
639 /// version if 'From' is known to have a single result, use the second
640 /// if you have two nodes with identical results, use the third otherwise.
642 /// These methods all take an optional UpdateListener, which (if not null) is
643 /// informed about nodes that are deleted and modified due to recursive
644 /// changes in the dag.
646 void ReplaceAllUsesWith(SDValue From, SDValue Op,
647 DAGUpdateListener *UpdateListener = 0);
648 void ReplaceAllUsesWith(SDNode *From, SDNode *To,
649 DAGUpdateListener *UpdateListener = 0);
650 void ReplaceAllUsesWith(SDNode *From, const SDValue *To,
651 DAGUpdateListener *UpdateListener = 0);
653 /// ReplaceAllUsesOfValueWith - Replace any uses of From with To, leaving
654 /// uses of other values produced by From.Val alone.
655 void ReplaceAllUsesOfValueWith(SDValue From, SDValue To,
656 DAGUpdateListener *UpdateListener = 0);
658 /// ReplaceAllUsesOfValuesWith - Like ReplaceAllUsesOfValueWith, but
659 /// for multiple values at once. This correctly handles the case where
660 /// there is an overlap between the From values and the To values.
661 void ReplaceAllUsesOfValuesWith(const SDValue *From, const SDValue *To,
663 DAGUpdateListener *UpdateListener = 0);
665 /// AssignTopologicalOrder - Topological-sort the AllNodes list and a
666 /// assign a unique node id for each node in the DAG based on their
667 /// topological order. Returns the number of nodes.
668 unsigned AssignTopologicalOrder();
670 /// isCommutativeBinOp - Returns true if the opcode is a commutative binary
672 static bool isCommutativeBinOp(unsigned Opcode) {
673 // FIXME: This should get its info from the td file, so that we can include
688 case ISD::ADDE: return true;
689 default: return false;
695 /// CreateStackTemporary - Create a stack temporary, suitable for holding the
696 /// specified value type. If minAlign is specified, the slot size will have
697 /// at least that alignment.
698 SDValue CreateStackTemporary(MVT VT, unsigned minAlign = 1);
700 /// FoldConstantArithmetic -
701 SDValue FoldConstantArithmetic(unsigned Opcode,
703 ConstantSDNode *Cst1,
704 ConstantSDNode *Cst2);
706 /// FoldSetCC - Constant fold a setcc to true or false.
707 SDValue FoldSetCC(MVT VT, SDValue N1,
708 SDValue N2, ISD::CondCode Cond);
710 /// SignBitIsZero - Return true if the sign bit of Op is known to be zero. We
711 /// use this predicate to simplify operations downstream.
712 bool SignBitIsZero(SDValue Op, unsigned Depth = 0) const;
714 /// MaskedValueIsZero - Return true if 'Op & Mask' is known to be zero. We
715 /// use this predicate to simplify operations downstream. Op and Mask are
716 /// known to be the same type.
717 bool MaskedValueIsZero(SDValue Op, const APInt &Mask, unsigned Depth = 0)
720 /// ComputeMaskedBits - Determine which of the bits specified in Mask are
721 /// known to be either zero or one and return them in the KnownZero/KnownOne
722 /// bitsets. This code only analyzes bits in Mask, in order to short-circuit
723 /// processing. Targets can implement the computeMaskedBitsForTargetNode
724 /// method in the TargetLowering class to allow target nodes to be understood.
725 void ComputeMaskedBits(SDValue Op, const APInt &Mask, APInt &KnownZero,
726 APInt &KnownOne, unsigned Depth = 0) const;
728 /// ComputeNumSignBits - Return the number of times the sign bit of the
729 /// register is replicated into the other bits. We know that at least 1 bit
730 /// is always equal to the sign bit (itself), but other cases can give us
731 /// information. For example, immediately after an "SRA X, 2", we know that
732 /// the top 3 bits are all equal to each other, so we return 3. Targets can
733 /// implement the ComputeNumSignBitsForTarget method in the TargetLowering
734 /// class to allow target nodes to be understood.
735 unsigned ComputeNumSignBits(SDValue Op, unsigned Depth = 0) const;
737 /// isVerifiedDebugInfoDesc - Returns true if the specified SDValue has
738 /// been verified as a debug information descriptor.
739 bool isVerifiedDebugInfoDesc(SDValue Op) const;
741 /// getShuffleScalarElt - Returns the scalar element that will make up the ith
742 /// element of the result of the vector shuffle.
743 SDValue getShuffleScalarElt(const SDNode *N, unsigned Idx);
746 bool RemoveNodeFromCSEMaps(SDNode *N);
747 SDNode *AddNonLeafNodeToCSEMaps(SDNode *N);
748 SDNode *FindModifiedNodeSlot(SDNode *N, SDValue Op, void *&InsertPos);
749 SDNode *FindModifiedNodeSlot(SDNode *N, SDValue Op1, SDValue Op2,
751 SDNode *FindModifiedNodeSlot(SDNode *N, const SDValue *Ops, unsigned NumOps,
754 void DeleteNodeNotInCSEMaps(SDNode *N);
756 unsigned getMVTAlignment(MVT MemoryVT) const;
758 void allnodes_clear();
760 // List of non-single value types.
761 std::vector<SDVTList> VTList;
763 // Maps to auto-CSE operations.
764 std::vector<CondCodeSDNode*> CondCodeNodes;
766 std::vector<SDNode*> ValueTypeNodes;
767 std::map<MVT, SDNode*, MVT::compareRawBits> ExtendedValueTypeNodes;
768 StringMap<SDNode*> ExternalSymbols;
769 StringMap<SDNode*> TargetExternalSymbols;
772 template <> struct GraphTraits<SelectionDAG*> : public GraphTraits<SDNode*> {
773 typedef SelectionDAG::allnodes_iterator nodes_iterator;
774 static nodes_iterator nodes_begin(SelectionDAG *G) {
775 return G->allnodes_begin();
777 static nodes_iterator nodes_end(SelectionDAG *G) {
778 return G->allnodes_end();
782 } // end namespace llvm