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 SDValue getBasicBlock(MachineBasicBlock *MBB);
310 SDValue getExternalSymbol(const char *Sym, MVT VT);
311 SDValue getTargetExternalSymbol(const char *Sym, MVT VT);
312 SDValue getArgFlags(ISD::ArgFlagsTy Flags);
313 SDValue getValueType(MVT);
314 SDValue getRegister(unsigned Reg, MVT VT);
315 SDValue getDbgStopPoint(SDValue Root, unsigned Line, unsigned Col,
317 SDValue getLabel(unsigned Opcode, SDValue Root, unsigned LabelID);
319 SDValue getCopyToReg(SDValue Chain, unsigned Reg, SDValue N) {
320 return getNode(ISD::CopyToReg, MVT::Other, Chain,
321 getRegister(Reg, N.getValueType()), N);
324 // This version of the getCopyToReg method takes an extra operand, which
325 // indicates that there is potentially an incoming flag value (if Flag is not
326 // null) and that there should be a flag result.
327 SDValue getCopyToReg(SDValue Chain, unsigned Reg, SDValue N,
329 const MVT *VTs = getNodeValueTypes(MVT::Other, MVT::Flag);
330 SDValue Ops[] = { Chain, getRegister(Reg, N.getValueType()), N, Flag };
331 return getNode(ISD::CopyToReg, VTs, 2, Ops, Flag.getNode() ? 4 : 3);
334 // Similar to last getCopyToReg() except parameter Reg is a SDValue
335 SDValue getCopyToReg(SDValue Chain, SDValue Reg, SDValue N,
337 const MVT *VTs = getNodeValueTypes(MVT::Other, MVT::Flag);
338 SDValue Ops[] = { Chain, Reg, N, Flag };
339 return getNode(ISD::CopyToReg, VTs, 2, Ops, Flag.getNode() ? 4 : 3);
342 SDValue getCopyFromReg(SDValue Chain, unsigned Reg, MVT VT) {
343 const MVT *VTs = getNodeValueTypes(VT, MVT::Other);
344 SDValue Ops[] = { Chain, getRegister(Reg, VT) };
345 return getNode(ISD::CopyFromReg, VTs, 2, Ops, 2);
348 // This version of the getCopyFromReg method takes an extra operand, which
349 // indicates that there is potentially an incoming flag value (if Flag is not
350 // null) and that there should be a flag result.
351 SDValue getCopyFromReg(SDValue Chain, unsigned Reg, MVT VT,
353 const MVT *VTs = getNodeValueTypes(VT, MVT::Other, MVT::Flag);
354 SDValue Ops[] = { Chain, getRegister(Reg, VT), Flag };
355 return getNode(ISD::CopyFromReg, VTs, 3, Ops, Flag.getNode() ? 3 : 2);
358 SDValue getCondCode(ISD::CondCode Cond);
360 /// Returns the ConvertRndSat Note: Avoid using this node because it may
361 /// disappear in the future and most targets don't support it.
362 SDValue getConvertRndSat(MVT VT, SDValue Val, SDValue DTy, SDValue STy,
363 SDValue Rnd, SDValue Sat, ISD::CvtCode Code);
365 /// getZeroExtendInReg - Return the expression required to zero extend the Op
366 /// value assuming it was the smaller SrcTy value.
367 SDValue getZeroExtendInReg(SDValue Op, MVT SrcTy);
369 /// getCALLSEQ_START - Return a new CALLSEQ_START node, which always must have
370 /// a flag result (to ensure it's not CSE'd).
371 SDValue getCALLSEQ_START(SDValue Chain, SDValue Op) {
372 const MVT *VTs = getNodeValueTypes(MVT::Other, MVT::Flag);
373 SDValue Ops[] = { Chain, Op };
374 return getNode(ISD::CALLSEQ_START, VTs, 2, Ops, 2);
377 /// getCALLSEQ_END - Return a new CALLSEQ_END node, which always must have a
378 /// flag result (to ensure it's not CSE'd).
379 SDValue getCALLSEQ_END(SDValue Chain, SDValue Op1, SDValue Op2,
381 SDVTList NodeTys = getVTList(MVT::Other, MVT::Flag);
382 SmallVector<SDValue, 4> Ops;
383 Ops.push_back(Chain);
386 Ops.push_back(InFlag);
387 return getNode(ISD::CALLSEQ_END, NodeTys, &Ops[0],
388 (unsigned)Ops.size() - (InFlag.getNode() == 0 ? 1 : 0));
391 /// getNode - Gets or creates the specified node.
393 SDValue getNode(unsigned Opcode, MVT VT);
394 SDValue getNode(unsigned Opcode, MVT VT, SDValue N);
395 SDValue getNode(unsigned Opcode, MVT VT, SDValue N1, SDValue N2);
396 SDValue getNode(unsigned Opcode, MVT VT,
397 SDValue N1, SDValue N2, SDValue N3);
398 SDValue getNode(unsigned Opcode, MVT VT,
399 SDValue N1, SDValue N2, SDValue N3, SDValue N4);
400 SDValue getNode(unsigned Opcode, MVT VT,
401 SDValue N1, SDValue N2, SDValue N3, SDValue N4,
403 SDValue getNode(unsigned Opcode, MVT VT,
404 const SDValue *Ops, unsigned NumOps);
405 SDValue getNode(unsigned Opcode, MVT VT,
406 const SDUse *Ops, unsigned NumOps);
407 SDValue getNode(unsigned Opcode, const std::vector<MVT> &ResultTys,
408 const SDValue *Ops, unsigned NumOps);
409 SDValue getNode(unsigned Opcode, const MVT *VTs, unsigned NumVTs,
410 const SDValue *Ops, unsigned NumOps);
411 SDValue getNode(unsigned Opcode, SDVTList VTs);
412 SDValue getNode(unsigned Opcode, SDVTList VTs, SDValue N);
413 SDValue getNode(unsigned Opcode, SDVTList VTs, SDValue N1, SDValue N2);
414 SDValue getNode(unsigned Opcode, SDVTList VTs,
415 SDValue N1, SDValue N2, SDValue N3);
416 SDValue getNode(unsigned Opcode, SDVTList VTs,
417 SDValue N1, SDValue N2, SDValue N3, SDValue N4);
418 SDValue getNode(unsigned Opcode, SDVTList VTs,
419 SDValue N1, SDValue N2, SDValue N3, SDValue N4,
421 SDValue getNode(unsigned Opcode, SDVTList VTs,
422 const SDValue *Ops, unsigned NumOps);
424 SDValue getMemcpy(SDValue Chain, SDValue Dst, SDValue Src,
425 SDValue Size, unsigned Align, bool AlwaysInline,
426 const Value *DstSV, uint64_t DstSVOff,
427 const Value *SrcSV, uint64_t SrcSVOff);
429 SDValue getMemmove(SDValue Chain, SDValue Dst, SDValue Src,
430 SDValue Size, unsigned Align,
431 const Value *DstSV, uint64_t DstOSVff,
432 const Value *SrcSV, uint64_t SrcSVOff);
434 SDValue getMemset(SDValue Chain, SDValue Dst, SDValue Src,
435 SDValue Size, unsigned Align,
436 const Value *DstSV, uint64_t DstSVOff);
438 /// getSetCC - Helper function to make it easier to build SetCC's if you just
439 /// have an ISD::CondCode instead of an SDValue.
441 SDValue getSetCC(MVT VT, SDValue LHS, SDValue RHS,
442 ISD::CondCode Cond) {
443 return getNode(ISD::SETCC, VT, LHS, RHS, getCondCode(Cond));
446 /// getVSetCC - Helper function to make it easier to build VSetCC's nodes
447 /// if you just have an ISD::CondCode instead of an SDValue.
449 SDValue getVSetCC(MVT VT, SDValue LHS, SDValue RHS,
450 ISD::CondCode Cond) {
451 return getNode(ISD::VSETCC, VT, LHS, RHS, getCondCode(Cond));
454 /// getSelectCC - Helper function to make it easier to build SelectCC's if you
455 /// just have an ISD::CondCode instead of an SDValue.
457 SDValue getSelectCC(SDValue LHS, SDValue RHS,
458 SDValue True, SDValue False, ISD::CondCode Cond) {
459 return getNode(ISD::SELECT_CC, True.getValueType(), LHS, RHS, True, False,
463 /// getVAArg - VAArg produces a result and token chain, and takes a pointer
464 /// and a source value as input.
465 SDValue getVAArg(MVT VT, SDValue Chain, SDValue Ptr,
468 /// getAtomic - Gets a node for an atomic op, produces result and chain and
470 SDValue getAtomic(unsigned Opcode, MVT MemVT, SDValue Chain, SDValue Ptr,
471 SDValue Cmp, SDValue Swp, const Value* PtrVal,
472 unsigned Alignment=0);
474 /// getAtomic - Gets a node for an atomic op, produces result and chain and
475 /// takes 2 operands.
476 SDValue getAtomic(unsigned Opcode, MVT MemVT, SDValue Chain, SDValue Ptr,
477 SDValue Val, const Value* PtrVal,
478 unsigned Alignment = 0);
480 /// getMemIntrinsicNode - Creates a MemIntrinsicNode that may produce a
481 /// result and takes a list of operands.
482 SDValue getMemIntrinsicNode(unsigned Opcode,
483 const MVT *VTs, unsigned NumVTs,
484 const SDValue *Ops, unsigned NumOps,
485 MVT MemVT, const Value *srcValue, int SVOff,
486 unsigned Align = 0, bool Vol = false,
487 bool ReadMem = true, bool WriteMem = true);
489 SDValue getMemIntrinsicNode(unsigned Opcode, SDVTList VTList,
490 const SDValue *Ops, unsigned NumOps,
491 MVT MemVT, const Value *srcValue, int SVOff,
492 unsigned Align = 0, bool Vol = false,
493 bool ReadMem = true, bool WriteMem = true);
495 /// getMergeValues - Create a MERGE_VALUES node from the given operands.
496 SDValue getMergeValues(const SDValue *Ops, unsigned NumOps);
498 /// getCall - Create a CALL node from the given information.
500 SDValue getCall(unsigned CallingConv, bool IsVarArgs, bool IsTailCall,
501 bool isInreg, SDVTList VTs, const SDValue *Operands,
502 unsigned NumOperands);
504 /// getLoad - Loads are not normal binary operators: their result type is not
505 /// determined by their operands, and they produce a value AND a token chain.
507 SDValue getLoad(MVT VT, SDValue Chain, SDValue Ptr,
508 const Value *SV, int SVOffset, bool isVolatile=false,
509 unsigned Alignment=0);
510 SDValue getExtLoad(ISD::LoadExtType ExtType, MVT VT,
511 SDValue Chain, SDValue Ptr, const Value *SV,
512 int SVOffset, MVT EVT, bool isVolatile=false,
513 unsigned Alignment=0);
514 SDValue getIndexedLoad(SDValue OrigLoad, SDValue Base,
515 SDValue Offset, ISD::MemIndexedMode AM);
516 SDValue getLoad(ISD::MemIndexedMode AM, ISD::LoadExtType ExtType,
517 MVT VT, SDValue Chain,
518 SDValue Ptr, SDValue Offset,
519 const Value *SV, int SVOffset, MVT EVT,
520 bool isVolatile=false, unsigned Alignment=0);
522 /// getStore - Helper function to build ISD::STORE nodes.
524 SDValue getStore(SDValue Chain, SDValue Val, SDValue Ptr,
525 const Value *SV, int SVOffset, bool isVolatile=false,
526 unsigned Alignment=0);
527 SDValue getTruncStore(SDValue Chain, SDValue Val, SDValue Ptr,
528 const Value *SV, int SVOffset, MVT TVT,
529 bool isVolatile=false, unsigned Alignment=0);
530 SDValue getIndexedStore(SDValue OrigStoe, SDValue Base,
531 SDValue Offset, ISD::MemIndexedMode AM);
533 // getSrcValue - Construct a node to track a Value* through the backend.
534 SDValue getSrcValue(const Value *v);
536 // getMemOperand - Construct a node to track a memory reference
537 // through the backend.
538 SDValue getMemOperand(const MachineMemOperand &MO);
540 /// UpdateNodeOperands - *Mutate* the specified node in-place to have the
541 /// specified operands. If the resultant node already exists in the DAG,
542 /// this does not modify the specified node, instead it returns the node that
543 /// already exists. If the resultant node does not exist in the DAG, the
544 /// input node is returned. As a degenerate case, if you specify the same
545 /// input operands as the node already has, the input node is returned.
546 SDValue UpdateNodeOperands(SDValue N, SDValue Op);
547 SDValue UpdateNodeOperands(SDValue N, SDValue Op1, SDValue Op2);
548 SDValue UpdateNodeOperands(SDValue N, SDValue Op1, SDValue Op2,
550 SDValue UpdateNodeOperands(SDValue N, SDValue Op1, SDValue Op2,
551 SDValue Op3, SDValue Op4);
552 SDValue UpdateNodeOperands(SDValue N, SDValue Op1, SDValue Op2,
553 SDValue Op3, SDValue Op4, SDValue Op5);
554 SDValue UpdateNodeOperands(SDValue N,
555 const SDValue *Ops, unsigned NumOps);
557 /// SelectNodeTo - These are used for target selectors to *mutate* the
558 /// specified node to have the specified return type, Target opcode, and
559 /// operands. Note that target opcodes are stored as
560 /// ~TargetOpcode in the node opcode field. The resultant node is returned.
561 SDNode *SelectNodeTo(SDNode *N, unsigned TargetOpc, MVT VT);
562 SDNode *SelectNodeTo(SDNode *N, unsigned TargetOpc, MVT VT, SDValue Op1);
563 SDNode *SelectNodeTo(SDNode *N, unsigned TargetOpc, MVT VT,
564 SDValue Op1, SDValue Op2);
565 SDNode *SelectNodeTo(SDNode *N, unsigned TargetOpc, MVT VT,
566 SDValue Op1, SDValue Op2, SDValue Op3);
567 SDNode *SelectNodeTo(SDNode *N, unsigned TargetOpc, MVT VT,
568 const SDValue *Ops, unsigned NumOps);
569 SDNode *SelectNodeTo(SDNode *N, unsigned TargetOpc, MVT VT1, MVT VT2);
570 SDNode *SelectNodeTo(SDNode *N, unsigned TargetOpc, MVT VT1,
571 MVT VT2, const SDValue *Ops, unsigned NumOps);
572 SDNode *SelectNodeTo(SDNode *N, unsigned TargetOpc, MVT VT1,
573 MVT VT2, MVT VT3, const SDValue *Ops, unsigned NumOps);
574 SDNode *SelectNodeTo(SDNode *N, unsigned MachineOpc, MVT VT1,
575 MVT VT2, MVT VT3, MVT VT4, const SDValue *Ops,
577 SDNode *SelectNodeTo(SDNode *N, unsigned TargetOpc, MVT VT1,
578 MVT VT2, SDValue Op1);
579 SDNode *SelectNodeTo(SDNode *N, unsigned TargetOpc, MVT VT1,
580 MVT VT2, SDValue Op1, SDValue Op2);
581 SDNode *SelectNodeTo(SDNode *N, unsigned TargetOpc, MVT VT1,
582 MVT VT2, SDValue Op1, SDValue Op2, SDValue Op3);
583 SDNode *SelectNodeTo(SDNode *N, unsigned TargetOpc, MVT VT1,
584 MVT VT2, MVT VT3, SDValue Op1, SDValue Op2, SDValue Op3);
585 SDNode *SelectNodeTo(SDNode *N, unsigned TargetOpc, SDVTList VTs,
586 const SDValue *Ops, unsigned NumOps);
588 /// MorphNodeTo - These *mutate* the specified node to have the specified
589 /// return type, opcode, and operands.
590 SDNode *MorphNodeTo(SDNode *N, unsigned Opc, MVT VT);
591 SDNode *MorphNodeTo(SDNode *N, unsigned Opc, MVT VT, SDValue Op1);
592 SDNode *MorphNodeTo(SDNode *N, unsigned Opc, MVT VT,
593 SDValue Op1, SDValue Op2);
594 SDNode *MorphNodeTo(SDNode *N, unsigned Opc, MVT VT,
595 SDValue Op1, SDValue Op2, SDValue Op3);
596 SDNode *MorphNodeTo(SDNode *N, unsigned Opc, MVT VT,
597 const SDValue *Ops, unsigned NumOps);
598 SDNode *MorphNodeTo(SDNode *N, unsigned Opc, MVT VT1, MVT VT2);
599 SDNode *MorphNodeTo(SDNode *N, unsigned Opc, MVT VT1,
600 MVT VT2, const SDValue *Ops, unsigned NumOps);
601 SDNode *MorphNodeTo(SDNode *N, unsigned Opc, MVT VT1,
602 MVT VT2, MVT VT3, const SDValue *Ops, unsigned NumOps);
603 SDNode *MorphNodeTo(SDNode *N, unsigned Opc, MVT VT1,
604 MVT VT2, SDValue Op1);
605 SDNode *MorphNodeTo(SDNode *N, unsigned Opc, MVT VT1,
606 MVT VT2, SDValue Op1, SDValue Op2);
607 SDNode *MorphNodeTo(SDNode *N, unsigned Opc, MVT VT1,
608 MVT VT2, SDValue Op1, SDValue Op2, SDValue Op3);
609 SDNode *MorphNodeTo(SDNode *N, unsigned Opc, SDVTList VTs,
610 const SDValue *Ops, unsigned NumOps);
612 /// getTargetNode - These are used for target selectors to create a new node
613 /// with specified return type(s), target opcode, and operands.
615 /// Note that getTargetNode returns the resultant node. If there is already a
616 /// node of the specified opcode and operands, it returns that node instead of
618 SDNode *getTargetNode(unsigned Opcode, MVT VT);
619 SDNode *getTargetNode(unsigned Opcode, MVT VT, SDValue Op1);
620 SDNode *getTargetNode(unsigned Opcode, MVT VT, SDValue Op1, SDValue Op2);
621 SDNode *getTargetNode(unsigned Opcode, MVT VT,
622 SDValue Op1, SDValue Op2, SDValue Op3);
623 SDNode *getTargetNode(unsigned Opcode, MVT VT,
624 const SDValue *Ops, unsigned NumOps);
625 SDNode *getTargetNode(unsigned Opcode, MVT VT1, MVT VT2);
626 SDNode *getTargetNode(unsigned Opcode, MVT VT1, MVT VT2, SDValue Op1);
627 SDNode *getTargetNode(unsigned Opcode, MVT VT1,
628 MVT VT2, SDValue Op1, SDValue Op2);
629 SDNode *getTargetNode(unsigned Opcode, MVT VT1,
630 MVT VT2, SDValue Op1, SDValue Op2, SDValue Op3);
631 SDNode *getTargetNode(unsigned Opcode, MVT VT1, MVT VT2,
632 const SDValue *Ops, unsigned NumOps);
633 SDNode *getTargetNode(unsigned Opcode, MVT VT1, MVT VT2, MVT VT3,
634 SDValue Op1, SDValue Op2);
635 SDNode *getTargetNode(unsigned Opcode, MVT VT1, MVT VT2, MVT VT3,
636 SDValue Op1, SDValue Op2, SDValue Op3);
637 SDNode *getTargetNode(unsigned Opcode, MVT VT1, MVT VT2, MVT VT3,
638 const SDValue *Ops, unsigned NumOps);
639 SDNode *getTargetNode(unsigned Opcode, MVT VT1, MVT VT2, MVT VT3, MVT VT4,
640 const SDValue *Ops, unsigned NumOps);
641 SDNode *getTargetNode(unsigned Opcode, const std::vector<MVT> &ResultTys,
642 const SDValue *Ops, unsigned NumOps);
644 /// getNodeIfExists - Get the specified node if it's already available, or
645 /// else return NULL.
646 SDNode *getNodeIfExists(unsigned Opcode, SDVTList VTs,
647 const SDValue *Ops, unsigned NumOps);
649 /// DAGUpdateListener - Clients of various APIs that cause global effects on
650 /// the DAG can optionally implement this interface. This allows the clients
651 /// to handle the various sorts of updates that happen.
652 class DAGUpdateListener {
654 virtual ~DAGUpdateListener();
656 /// NodeDeleted - The node N that was deleted and, if E is not null, an
657 /// equivalent node E that replaced it.
658 virtual void NodeDeleted(SDNode *N, SDNode *E) = 0;
660 /// NodeUpdated - The node N that was updated.
661 virtual void NodeUpdated(SDNode *N) = 0;
664 /// RemoveDeadNode - Remove the specified node from the system. If any of its
665 /// operands then becomes dead, remove them as well. Inform UpdateListener
666 /// for each node deleted.
667 void RemoveDeadNode(SDNode *N, DAGUpdateListener *UpdateListener = 0);
669 /// RemoveDeadNodes - This method deletes the unreachable nodes in the
670 /// given list, and any nodes that become unreachable as a result.
671 void RemoveDeadNodes(SmallVectorImpl<SDNode *> &DeadNodes,
672 DAGUpdateListener *UpdateListener = 0);
674 /// ReplaceAllUsesWith - Modify anything using 'From' to use 'To' instead.
675 /// This can cause recursive merging of nodes in the DAG. Use the first
676 /// version if 'From' is known to have a single result, use the second
677 /// if you have two nodes with identical results, use the third otherwise.
679 /// These methods all take an optional UpdateListener, which (if not null) is
680 /// informed about nodes that are deleted and modified due to recursive
681 /// changes in the dag.
683 void ReplaceAllUsesWith(SDValue From, SDValue Op,
684 DAGUpdateListener *UpdateListener = 0);
685 void ReplaceAllUsesWith(SDNode *From, SDNode *To,
686 DAGUpdateListener *UpdateListener = 0);
687 void ReplaceAllUsesWith(SDNode *From, const SDValue *To,
688 DAGUpdateListener *UpdateListener = 0);
690 /// ReplaceAllUsesOfValueWith - Replace any uses of From with To, leaving
691 /// uses of other values produced by From.Val alone.
692 void ReplaceAllUsesOfValueWith(SDValue From, SDValue To,
693 DAGUpdateListener *UpdateListener = 0);
695 /// ReplaceAllUsesOfValuesWith - Like ReplaceAllUsesOfValueWith, but
696 /// for multiple values at once. This correctly handles the case where
697 /// there is an overlap between the From values and the To values.
698 void ReplaceAllUsesOfValuesWith(const SDValue *From, const SDValue *To,
700 DAGUpdateListener *UpdateListener = 0);
702 /// AssignTopologicalOrder - Topological-sort the AllNodes list and a
703 /// assign a unique node id for each node in the DAG based on their
704 /// topological order. Returns the number of nodes.
705 unsigned AssignTopologicalOrder();
707 /// RepositionNode - Move node N in the AllNodes list to be immediately
708 /// before the given iterator Position. This may be used to update the
709 /// topological ordering when the list of nodes is modified.
710 void RepositionNode(allnodes_iterator Position, SDNode *N) {
711 AllNodes.insert(Position, AllNodes.remove(N));
714 /// isCommutativeBinOp - Returns true if the opcode is a commutative binary
716 static bool isCommutativeBinOp(unsigned Opcode) {
717 // FIXME: This should get its info from the td file, so that we can include
732 case ISD::ADDE: return true;
733 default: return false;
739 /// CreateStackTemporary - Create a stack temporary, suitable for holding the
740 /// specified value type. If minAlign is specified, the slot size will have
741 /// at least that alignment.
742 SDValue CreateStackTemporary(MVT VT, unsigned minAlign = 1);
744 /// CreateStackTemporary - Create a stack temporary suitable for holding
745 /// either of the specified value types.
746 SDValue CreateStackTemporary(MVT VT1, MVT VT2);
748 /// FoldConstantArithmetic -
749 SDValue FoldConstantArithmetic(unsigned Opcode,
751 ConstantSDNode *Cst1,
752 ConstantSDNode *Cst2);
754 /// FoldSetCC - Constant fold a setcc to true or false.
755 SDValue FoldSetCC(MVT VT, SDValue N1,
756 SDValue N2, ISD::CondCode Cond);
758 /// SignBitIsZero - Return true if the sign bit of Op is known to be zero. We
759 /// use this predicate to simplify operations downstream.
760 bool SignBitIsZero(SDValue Op, unsigned Depth = 0) const;
762 /// MaskedValueIsZero - Return true if 'Op & Mask' is known to be zero. We
763 /// use this predicate to simplify operations downstream. Op and Mask are
764 /// known to be the same type.
765 bool MaskedValueIsZero(SDValue Op, const APInt &Mask, unsigned Depth = 0)
768 /// ComputeMaskedBits - Determine which of the bits specified in Mask are
769 /// known to be either zero or one and return them in the KnownZero/KnownOne
770 /// bitsets. This code only analyzes bits in Mask, in order to short-circuit
771 /// processing. Targets can implement the computeMaskedBitsForTargetNode
772 /// method in the TargetLowering class to allow target nodes to be understood.
773 void ComputeMaskedBits(SDValue Op, const APInt &Mask, APInt &KnownZero,
774 APInt &KnownOne, unsigned Depth = 0) const;
776 /// ComputeNumSignBits - Return the number of times the sign bit of the
777 /// register is replicated into the other bits. We know that at least 1 bit
778 /// is always equal to the sign bit (itself), but other cases can give us
779 /// information. For example, immediately after an "SRA X, 2", we know that
780 /// the top 3 bits are all equal to each other, so we return 3. Targets can
781 /// implement the ComputeNumSignBitsForTarget method in the TargetLowering
782 /// class to allow target nodes to be understood.
783 unsigned ComputeNumSignBits(SDValue Op, unsigned Depth = 0) const;
785 /// isVerifiedDebugInfoDesc - Returns true if the specified SDValue has
786 /// been verified as a debug information descriptor.
787 bool isVerifiedDebugInfoDesc(SDValue Op) const;
789 /// getShuffleScalarElt - Returns the scalar element that will make up the ith
790 /// element of the result of the vector shuffle.
791 SDValue getShuffleScalarElt(const SDNode *N, unsigned Idx);
794 bool RemoveNodeFromCSEMaps(SDNode *N);
795 SDNode *AddNonLeafNodeToCSEMaps(SDNode *N);
796 SDNode *FindModifiedNodeSlot(SDNode *N, SDValue Op, void *&InsertPos);
797 SDNode *FindModifiedNodeSlot(SDNode *N, SDValue Op1, SDValue Op2,
799 SDNode *FindModifiedNodeSlot(SDNode *N, const SDValue *Ops, unsigned NumOps,
802 void DeleteNodeNotInCSEMaps(SDNode *N);
804 unsigned getMVTAlignment(MVT MemoryVT) const;
806 void allnodes_clear();
808 // List of non-single value types.
809 std::vector<SDVTList> VTList;
811 // Maps to auto-CSE operations.
812 std::vector<CondCodeSDNode*> CondCodeNodes;
814 std::vector<SDNode*> ValueTypeNodes;
815 std::map<MVT, SDNode*, MVT::compareRawBits> ExtendedValueTypeNodes;
816 StringMap<SDNode*> ExternalSymbols;
817 StringMap<SDNode*> TargetExternalSymbols;
820 template <> struct GraphTraits<SelectionDAG*> : public GraphTraits<SDNode*> {
821 typedef SelectionDAG::allnodes_iterator nodes_iterator;
822 static nodes_iterator nodes_begin(SelectionDAG *G) {
823 return G->allnodes_begin();
825 static nodes_iterator nodes_end(SelectionDAG *G) {
826 return G->allnodes_end();
830 } // end namespace llvm