1 //===-- llvm/CodeGen/SelectionDAGNodes.h - SelectionDAG Nodes ---*- 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 SDNode class and derived classes, which are used to
11 // represent the nodes and operations present in a SelectionDAG. These nodes
12 // and operations are machine code level operations, with some similarities to
13 // the GCC RTL representation.
15 // Clients should include the SelectionDAG.h file instead of this file directly.
17 //===----------------------------------------------------------------------===//
19 #ifndef LLVM_CODEGEN_SELECTIONDAGNODES_H
20 #define LLVM_CODEGEN_SELECTIONDAGNODES_H
22 #include "llvm/ADT/FoldingSet.h"
23 #include "llvm/ADT/GraphTraits.h"
24 #include "llvm/ADT/STLExtras.h"
25 #include "llvm/ADT/SmallPtrSet.h"
26 #include "llvm/ADT/SmallVector.h"
27 #include "llvm/ADT/ilist_node.h"
28 #include "llvm/CodeGen/ISDOpcodes.h"
29 #include "llvm/CodeGen/MachineMemOperand.h"
30 #include "llvm/CodeGen/ValueTypes.h"
31 #include "llvm/IR/Constants.h"
32 #include "llvm/IR/Instructions.h"
33 #include "llvm/Support/DataTypes.h"
34 #include "llvm/Support/DebugLoc.h"
35 #include "llvm/Support/MathExtras.h"
42 class MachineBasicBlock;
43 class MachineConstantPoolValue;
47 template <typename T> struct DenseMapInfo;
48 template <typename T> struct simplify_type;
49 template <typename T> struct ilist_traits;
51 void checkForCycles(const SDNode *N);
53 /// SDVTList - This represents a list of ValueType's that has been intern'd by
54 /// a SelectionDAG. Instances of this simple value class are returned by
55 /// SelectionDAG::getVTList(...).
65 /// isBuildVectorAllOnes - Return true if the specified node is a
66 /// BUILD_VECTOR where all of the elements are ~0 or undef.
67 bool isBuildVectorAllOnes(const SDNode *N);
69 /// isBuildVectorAllZeros - Return true if the specified node is a
70 /// BUILD_VECTOR where all of the elements are 0 or undef.
71 bool isBuildVectorAllZeros(const SDNode *N);
73 /// isScalarToVector - Return true if the specified node is a
74 /// ISD::SCALAR_TO_VECTOR node or a BUILD_VECTOR node where only the low
75 /// element is not an undef.
76 bool isScalarToVector(const SDNode *N);
78 /// allOperandsUndef - Return true if the node has at least one operand
79 /// and all operands of the specified node are ISD::UNDEF.
80 bool allOperandsUndef(const SDNode *N);
81 } // end llvm:ISD namespace
83 //===----------------------------------------------------------------------===//
84 /// SDValue - Unlike LLVM values, Selection DAG nodes may return multiple
85 /// values as the result of a computation. Many nodes return multiple values,
86 /// from loads (which define a token and a return value) to ADDC (which returns
87 /// a result and a carry value), to calls (which may return an arbitrary number
90 /// As such, each use of a SelectionDAG computation must indicate the node that
91 /// computes it as well as which return value to use from that node. This pair
92 /// of information is represented with the SDValue value type.
95 SDNode *Node; // The node defining the value we are using.
96 unsigned ResNo; // Which return value of the node we are using.
98 SDValue() : Node(0), ResNo(0) {}
99 SDValue(SDNode *node, unsigned resno) : Node(node), ResNo(resno) {}
101 /// get the index which selects a specific result in the SDNode
102 unsigned getResNo() const { return ResNo; }
104 /// get the SDNode which holds the desired result
105 SDNode *getNode() const { return Node; }
108 void setNode(SDNode *N) { Node = N; }
110 inline SDNode *operator->() const { return Node; }
112 bool operator==(const SDValue &O) const {
113 return Node == O.Node && ResNo == O.ResNo;
115 bool operator!=(const SDValue &O) const {
116 return !operator==(O);
118 bool operator<(const SDValue &O) const {
119 return Node < O.Node || (Node == O.Node && ResNo < O.ResNo);
122 SDValue getValue(unsigned R) const {
123 return SDValue(Node, R);
126 // isOperandOf - Return true if this node is an operand of N.
127 bool isOperandOf(SDNode *N) const;
129 /// getValueType - Return the ValueType of the referenced return value.
131 inline EVT getValueType() const;
133 /// Return the simple ValueType of the referenced return value.
134 MVT getSimpleValueType() const {
135 return getValueType().getSimpleVT();
138 /// getValueSizeInBits - Returns the size of the value in bits.
140 unsigned getValueSizeInBits() const {
141 return getValueType().getSizeInBits();
144 // Forwarding methods - These forward to the corresponding methods in SDNode.
145 inline unsigned getOpcode() const;
146 inline unsigned getNumOperands() const;
147 inline const SDValue &getOperand(unsigned i) const;
148 inline uint64_t getConstantOperandVal(unsigned i) const;
149 inline bool isTargetMemoryOpcode() const;
150 inline bool isTargetOpcode() const;
151 inline bool isMachineOpcode() const;
152 inline unsigned getMachineOpcode() const;
153 inline const DebugLoc getDebugLoc() const;
154 inline void dump() const;
155 inline void dumpr() const;
157 /// reachesChainWithoutSideEffects - Return true if this operand (which must
158 /// be a chain) reaches the specified operand without crossing any
159 /// side-effecting instructions. In practice, this looks through token
160 /// factors and non-volatile loads. In order to remain efficient, this only
161 /// looks a couple of nodes in, it does not do an exhaustive search.
162 bool reachesChainWithoutSideEffects(SDValue Dest,
163 unsigned Depth = 2) const;
165 /// use_empty - Return true if there are no nodes using value ResNo
168 inline bool use_empty() const;
170 /// hasOneUse - Return true if there is exactly one node using value
173 inline bool hasOneUse() const;
177 template<> struct DenseMapInfo<SDValue> {
178 static inline SDValue getEmptyKey() {
179 return SDValue((SDNode*)-1, -1U);
181 static inline SDValue getTombstoneKey() {
182 return SDValue((SDNode*)-1, 0);
184 static unsigned getHashValue(const SDValue &Val) {
185 return ((unsigned)((uintptr_t)Val.getNode() >> 4) ^
186 (unsigned)((uintptr_t)Val.getNode() >> 9)) + Val.getResNo();
188 static bool isEqual(const SDValue &LHS, const SDValue &RHS) {
192 template <> struct isPodLike<SDValue> { static const bool value = true; };
195 /// simplify_type specializations - Allow casting operators to work directly on
196 /// SDValues as if they were SDNode*'s.
197 template<> struct simplify_type<SDValue> {
198 typedef SDNode* SimpleType;
199 static SimpleType getSimplifiedValue(SDValue &Val) {
200 return Val.getNode();
203 template<> struct simplify_type<const SDValue> {
204 typedef /*const*/ SDNode* SimpleType;
205 static SimpleType getSimplifiedValue(const SDValue &Val) {
206 return Val.getNode();
210 /// SDUse - Represents a use of a SDNode. This class holds an SDValue,
211 /// which records the SDNode being used and the result number, a
212 /// pointer to the SDNode using the value, and Next and Prev pointers,
213 /// which link together all the uses of an SDNode.
216 /// Val - The value being used.
218 /// User - The user of this value.
220 /// Prev, Next - Pointers to the uses list of the SDNode referred by
224 SDUse(const SDUse &U) LLVM_DELETED_FUNCTION;
225 void operator=(const SDUse &U) LLVM_DELETED_FUNCTION;
228 SDUse() : Val(), User(NULL), Prev(NULL), Next(NULL) {}
230 /// Normally SDUse will just implicitly convert to an SDValue that it holds.
231 operator const SDValue&() const { return Val; }
233 /// If implicit conversion to SDValue doesn't work, the get() method returns
235 const SDValue &get() const { return Val; }
237 /// getUser - This returns the SDNode that contains this Use.
238 SDNode *getUser() { return User; }
240 /// getNext - Get the next SDUse in the use list.
241 SDUse *getNext() const { return Next; }
243 /// getNode - Convenience function for get().getNode().
244 SDNode *getNode() const { return Val.getNode(); }
245 /// getResNo - Convenience function for get().getResNo().
246 unsigned getResNo() const { return Val.getResNo(); }
247 /// getValueType - Convenience function for get().getValueType().
248 EVT getValueType() const { return Val.getValueType(); }
250 /// operator== - Convenience function for get().operator==
251 bool operator==(const SDValue &V) const {
255 /// operator!= - Convenience function for get().operator!=
256 bool operator!=(const SDValue &V) const {
260 /// operator< - Convenience function for get().operator<
261 bool operator<(const SDValue &V) const {
266 friend class SelectionDAG;
269 void setUser(SDNode *p) { User = p; }
271 /// set - Remove this use from its existing use list, assign it the
272 /// given value, and add it to the new value's node's use list.
273 inline void set(const SDValue &V);
274 /// setInitial - like set, but only supports initializing a newly-allocated
275 /// SDUse with a non-null value.
276 inline void setInitial(const SDValue &V);
277 /// setNode - like set, but only sets the Node portion of the value,
278 /// leaving the ResNo portion unmodified.
279 inline void setNode(SDNode *N);
281 void addToList(SDUse **List) {
283 if (Next) Next->Prev = &Next;
288 void removeFromList() {
290 if (Next) Next->Prev = Prev;
294 /// simplify_type specializations - Allow casting operators to work directly on
295 /// SDValues as if they were SDNode*'s.
296 template<> struct simplify_type<SDUse> {
297 typedef SDNode* SimpleType;
298 static SimpleType getSimplifiedValue(SDUse &Val) {
299 return Val.getNode();
304 /// SDNode - Represents one node in the SelectionDAG.
306 class SDNode : public FoldingSetNode, public ilist_node<SDNode> {
308 /// NodeType - The operation that this node performs.
312 /// OperandsNeedDelete - This is true if OperandList was new[]'d. If true,
313 /// then they will be delete[]'d when the node is destroyed.
314 uint16_t OperandsNeedDelete : 1;
316 /// HasDebugValue - This tracks whether this node has one or more dbg_value
317 /// nodes corresponding to it.
318 uint16_t HasDebugValue : 1;
321 /// SubclassData - This member is defined by this class, but is not used for
322 /// anything. Subclasses can use it to hold whatever state they find useful.
323 /// This field is initialized to zero by the ctor.
324 uint16_t SubclassData : 14;
327 /// NodeId - Unique id per SDNode in the DAG.
330 /// OperandList - The values that are used by this operation.
334 /// ValueList - The types of the values this node defines. SDNode's may
335 /// define multiple values simultaneously.
336 const EVT *ValueList;
338 /// UseList - List of uses for this SDNode.
341 /// NumOperands/NumValues - The number of entries in the Operand/Value list.
342 unsigned short NumOperands, NumValues;
344 /// debugLoc - source line information.
347 // The ordering of the SDNodes. It roughly corresponds to the ordering of the
348 // original LLVM instructions.
349 // This is used for turning off scheduling, because we'll forgo
350 // the normal scheduling algorithms and output the instructions according to
354 /// getValueTypeList - Return a pointer to the specified value type.
355 static const EVT *getValueTypeList(EVT VT);
357 friend class SelectionDAG;
358 friend struct ilist_traits<SDNode>;
361 //===--------------------------------------------------------------------===//
365 /// getOpcode - Return the SelectionDAG opcode value for this node. For
366 /// pre-isel nodes (those for which isMachineOpcode returns false), these
367 /// are the opcode values in the ISD and <target>ISD namespaces. For
368 /// post-isel opcodes, see getMachineOpcode.
369 unsigned getOpcode() const { return (unsigned short)NodeType; }
371 /// isTargetOpcode - Test if this node has a target-specific opcode (in the
372 /// \<target\>ISD namespace).
373 bool isTargetOpcode() const { return NodeType >= ISD::BUILTIN_OP_END; }
375 /// isTargetMemoryOpcode - Test if this node has a target-specific
376 /// memory-referencing opcode (in the \<target\>ISD namespace and
377 /// greater than FIRST_TARGET_MEMORY_OPCODE).
378 bool isTargetMemoryOpcode() const {
379 return NodeType >= ISD::FIRST_TARGET_MEMORY_OPCODE;
382 /// isMachineOpcode - Test if this node has a post-isel opcode, directly
383 /// corresponding to a MachineInstr opcode.
384 bool isMachineOpcode() const { return NodeType < 0; }
386 /// getMachineOpcode - This may only be called if isMachineOpcode returns
387 /// true. It returns the MachineInstr opcode value that the node's opcode
389 unsigned getMachineOpcode() const {
390 assert(isMachineOpcode() && "Not a MachineInstr opcode!");
394 /// getHasDebugValue - get this bit.
395 bool getHasDebugValue() const { return HasDebugValue; }
397 /// setHasDebugValue - set this bit.
398 void setHasDebugValue(bool b) { HasDebugValue = b; }
400 /// use_empty - Return true if there are no uses of this node.
402 bool use_empty() const { return UseList == NULL; }
404 /// hasOneUse - Return true if there is exactly one use of this node.
406 bool hasOneUse() const {
407 return !use_empty() && llvm::next(use_begin()) == use_end();
410 /// use_size - Return the number of uses of this node. This method takes
411 /// time proportional to the number of uses.
413 size_t use_size() const { return std::distance(use_begin(), use_end()); }
415 /// getNodeId - Return the unique node id.
417 int getNodeId() const { return NodeId; }
419 /// setNodeId - Set unique node id.
420 void setNodeId(int Id) { NodeId = Id; }
422 /// getIROrder - Return the node ordering.
424 unsigned getIROrder() const { return IROrder; }
426 /// setIROrder - Set the node ordering.
428 void setIROrder(unsigned Order) { IROrder = Order; }
430 /// getDebugLoc - Return the source location info.
431 const DebugLoc getDebugLoc() const { return debugLoc; }
433 /// setDebugLoc - Set source location info. Try to avoid this, putting
434 /// it in the constructor is preferable.
435 void setDebugLoc(const DebugLoc dl) { debugLoc = dl; }
437 /// use_iterator - This class provides iterator support for SDUse
438 /// operands that use a specific SDNode.
440 : public std::iterator<std::forward_iterator_tag, SDUse, ptrdiff_t> {
442 explicit use_iterator(SDUse *op) : Op(op) {
446 typedef std::iterator<std::forward_iterator_tag,
447 SDUse, ptrdiff_t>::reference reference;
448 typedef std::iterator<std::forward_iterator_tag,
449 SDUse, ptrdiff_t>::pointer pointer;
451 use_iterator(const use_iterator &I) : Op(I.Op) {}
452 use_iterator() : Op(0) {}
454 bool operator==(const use_iterator &x) const {
457 bool operator!=(const use_iterator &x) const {
458 return !operator==(x);
461 /// atEnd - return true if this iterator is at the end of uses list.
462 bool atEnd() const { return Op == 0; }
464 // Iterator traversal: forward iteration only.
465 use_iterator &operator++() { // Preincrement
466 assert(Op && "Cannot increment end iterator!");
471 use_iterator operator++(int) { // Postincrement
472 use_iterator tmp = *this; ++*this; return tmp;
475 /// Retrieve a pointer to the current user node.
476 SDNode *operator*() const {
477 assert(Op && "Cannot dereference end iterator!");
478 return Op->getUser();
481 SDNode *operator->() const { return operator*(); }
483 SDUse &getUse() const { return *Op; }
485 /// getOperandNo - Retrieve the operand # of this use in its user.
487 unsigned getOperandNo() const {
488 assert(Op && "Cannot dereference end iterator!");
489 return (unsigned)(Op - Op->getUser()->OperandList);
493 /// use_begin/use_end - Provide iteration support to walk over all uses
496 use_iterator use_begin() const {
497 return use_iterator(UseList);
500 static use_iterator use_end() { return use_iterator(0); }
503 /// hasNUsesOfValue - Return true if there are exactly NUSES uses of the
504 /// indicated value. This method ignores uses of other values defined by this
506 bool hasNUsesOfValue(unsigned NUses, unsigned Value) const;
508 /// hasAnyUseOfValue - Return true if there are any use of the indicated
509 /// value. This method ignores uses of other values defined by this operation.
510 bool hasAnyUseOfValue(unsigned Value) const;
512 /// isOnlyUserOf - Return true if this node is the only use of N.
514 bool isOnlyUserOf(SDNode *N) const;
516 /// isOperandOf - Return true if this node is an operand of N.
518 bool isOperandOf(SDNode *N) const;
520 /// isPredecessorOf - Return true if this node is a predecessor of N.
521 /// NOTE: Implemented on top of hasPredecessor and every bit as
522 /// expensive. Use carefully.
523 bool isPredecessorOf(const SDNode *N) const {
524 return N->hasPredecessor(this);
527 /// hasPredecessor - Return true if N is a predecessor of this node.
528 /// N is either an operand of this node, or can be reached by recursively
529 /// traversing up the operands.
530 /// NOTE: This is an expensive method. Use it carefully.
531 bool hasPredecessor(const SDNode *N) const;
533 /// hasPredecesorHelper - Return true if N is a predecessor of this node.
534 /// N is either an operand of this node, or can be reached by recursively
535 /// traversing up the operands.
536 /// In this helper the Visited and worklist sets are held externally to
537 /// cache predecessors over multiple invocations. If you want to test for
538 /// multiple predecessors this method is preferable to multiple calls to
539 /// hasPredecessor. Be sure to clear Visited and Worklist if the DAG
541 /// NOTE: This is still very expensive. Use carefully.
542 bool hasPredecessorHelper(const SDNode *N,
543 SmallPtrSet<const SDNode *, 32> &Visited,
544 SmallVectorImpl<const SDNode *> &Worklist) const;
546 /// getNumOperands - Return the number of values used by this operation.
548 unsigned getNumOperands() const { return NumOperands; }
550 /// getConstantOperandVal - Helper method returns the integer value of a
551 /// ConstantSDNode operand.
552 uint64_t getConstantOperandVal(unsigned Num) const;
554 const SDValue &getOperand(unsigned Num) const {
555 assert(Num < NumOperands && "Invalid child # of SDNode!");
556 return OperandList[Num];
559 typedef SDUse* op_iterator;
560 op_iterator op_begin() const { return OperandList; }
561 op_iterator op_end() const { return OperandList+NumOperands; }
563 SDVTList getVTList() const {
564 SDVTList X = { ValueList, NumValues };
568 /// getGluedNode - If this node has a glue operand, return the node
569 /// to which the glue operand points. Otherwise return NULL.
570 SDNode *getGluedNode() const {
571 if (getNumOperands() != 0 &&
572 getOperand(getNumOperands()-1).getValueType() == MVT::Glue)
573 return getOperand(getNumOperands()-1).getNode();
577 // If this is a pseudo op, like copyfromreg, look to see if there is a
578 // real target node glued to it. If so, return the target node.
579 const SDNode *getGluedMachineNode() const {
580 const SDNode *FoundNode = this;
582 // Climb up glue edges until a machine-opcode node is found, or the
583 // end of the chain is reached.
584 while (!FoundNode->isMachineOpcode()) {
585 const SDNode *N = FoundNode->getGluedNode();
593 /// getGluedUser - If this node has a glue value with a user, return
594 /// the user (there is at most one). Otherwise return NULL.
595 SDNode *getGluedUser() const {
596 for (use_iterator UI = use_begin(), UE = use_end(); UI != UE; ++UI)
597 if (UI.getUse().get().getValueType() == MVT::Glue)
602 /// getNumValues - Return the number of values defined/returned by this
605 unsigned getNumValues() const { return NumValues; }
607 /// getValueType - Return the type of a specified result.
609 EVT getValueType(unsigned ResNo) const {
610 assert(ResNo < NumValues && "Illegal result number!");
611 return ValueList[ResNo];
614 /// Return the type of a specified result as a simple type.
616 MVT getSimpleValueType(unsigned ResNo) const {
617 return getValueType(ResNo).getSimpleVT();
620 /// getValueSizeInBits - Returns MVT::getSizeInBits(getValueType(ResNo)).
622 unsigned getValueSizeInBits(unsigned ResNo) const {
623 return getValueType(ResNo).getSizeInBits();
626 typedef const EVT* value_iterator;
627 value_iterator value_begin() const { return ValueList; }
628 value_iterator value_end() const { return ValueList+NumValues; }
630 /// getOperationName - Return the opcode of this operation for printing.
632 std::string getOperationName(const SelectionDAG *G = 0) const;
633 static const char* getIndexedModeName(ISD::MemIndexedMode AM);
634 void print_types(raw_ostream &OS, const SelectionDAG *G) const;
635 void print_details(raw_ostream &OS, const SelectionDAG *G) const;
636 void print(raw_ostream &OS, const SelectionDAG *G = 0) const;
637 void printr(raw_ostream &OS, const SelectionDAG *G = 0) const;
639 /// printrFull - Print a SelectionDAG node and all children down to
640 /// the leaves. The given SelectionDAG allows target-specific nodes
641 /// to be printed in human-readable form. Unlike printr, this will
642 /// print the whole DAG, including children that appear multiple
645 void printrFull(raw_ostream &O, const SelectionDAG *G = 0) const;
647 /// printrWithDepth - Print a SelectionDAG node and children up to
648 /// depth "depth." The given SelectionDAG allows target-specific
649 /// nodes to be printed in human-readable form. Unlike printr, this
650 /// will print children that appear multiple times wherever they are
653 void printrWithDepth(raw_ostream &O, const SelectionDAG *G = 0,
654 unsigned depth = 100) const;
657 /// dump - Dump this node, for debugging.
660 /// dumpr - Dump (recursively) this node and its use-def subgraph.
663 /// dump - Dump this node, for debugging.
664 /// The given SelectionDAG allows target-specific nodes to be printed
665 /// in human-readable form.
666 void dump(const SelectionDAG *G) const;
668 /// dumpr - Dump (recursively) this node and its use-def subgraph.
669 /// The given SelectionDAG allows target-specific nodes to be printed
670 /// in human-readable form.
671 void dumpr(const SelectionDAG *G) const;
673 /// dumprFull - printrFull to dbgs(). The given SelectionDAG allows
674 /// target-specific nodes to be printed in human-readable form.
675 /// Unlike dumpr, this will print the whole DAG, including children
676 /// that appear multiple times.
678 void dumprFull(const SelectionDAG *G = 0) const;
680 /// dumprWithDepth - printrWithDepth to dbgs(). The given
681 /// SelectionDAG allows target-specific nodes to be printed in
682 /// human-readable form. Unlike dumpr, this will print children
683 /// that appear multiple times wherever they are used.
685 void dumprWithDepth(const SelectionDAG *G = 0, unsigned depth = 100) const;
687 /// Profile - Gather unique data for the node.
689 void Profile(FoldingSetNodeID &ID) const;
691 /// addUse - This method should only be used by the SDUse class.
693 void addUse(SDUse &U) { U.addToList(&UseList); }
696 static SDVTList getSDVTList(EVT VT) {
697 SDVTList Ret = { getValueTypeList(VT), 1 };
701 SDNode(unsigned Opc, unsigned Order, const DebugLoc dl, SDVTList VTs,
702 const SDValue *Ops, unsigned NumOps)
703 : NodeType(Opc), OperandsNeedDelete(true), HasDebugValue(false),
704 SubclassData(0), NodeId(-1),
705 OperandList(NumOps ? new SDUse[NumOps] : 0),
706 ValueList(VTs.VTs), UseList(NULL),
707 NumOperands(NumOps), NumValues(VTs.NumVTs),
708 debugLoc(dl), IROrder(Order) {
709 for (unsigned i = 0; i != NumOps; ++i) {
710 OperandList[i].setUser(this);
711 OperandList[i].setInitial(Ops[i]);
713 checkForCycles(this);
716 /// This constructor adds no operands itself; operands can be
717 /// set later with InitOperands.
718 SDNode(unsigned Opc, unsigned Order, const DebugLoc dl, SDVTList VTs)
719 : NodeType(Opc), OperandsNeedDelete(false), HasDebugValue(false),
720 SubclassData(0), NodeId(-1), OperandList(0),
721 ValueList(VTs.VTs), UseList(NULL), NumOperands(0), NumValues(VTs.NumVTs),
722 debugLoc(dl), IROrder(Order) {}
724 /// InitOperands - Initialize the operands list of this with 1 operand.
725 void InitOperands(SDUse *Ops, const SDValue &Op0) {
726 Ops[0].setUser(this);
727 Ops[0].setInitial(Op0);
730 checkForCycles(this);
733 /// InitOperands - Initialize the operands list of this with 2 operands.
734 void InitOperands(SDUse *Ops, const SDValue &Op0, const SDValue &Op1) {
735 Ops[0].setUser(this);
736 Ops[0].setInitial(Op0);
737 Ops[1].setUser(this);
738 Ops[1].setInitial(Op1);
741 checkForCycles(this);
744 /// InitOperands - Initialize the operands list of this with 3 operands.
745 void InitOperands(SDUse *Ops, const SDValue &Op0, const SDValue &Op1,
746 const SDValue &Op2) {
747 Ops[0].setUser(this);
748 Ops[0].setInitial(Op0);
749 Ops[1].setUser(this);
750 Ops[1].setInitial(Op1);
751 Ops[2].setUser(this);
752 Ops[2].setInitial(Op2);
755 checkForCycles(this);
758 /// InitOperands - Initialize the operands list of this with 4 operands.
759 void InitOperands(SDUse *Ops, const SDValue &Op0, const SDValue &Op1,
760 const SDValue &Op2, const SDValue &Op3) {
761 Ops[0].setUser(this);
762 Ops[0].setInitial(Op0);
763 Ops[1].setUser(this);
764 Ops[1].setInitial(Op1);
765 Ops[2].setUser(this);
766 Ops[2].setInitial(Op2);
767 Ops[3].setUser(this);
768 Ops[3].setInitial(Op3);
771 checkForCycles(this);
774 /// InitOperands - Initialize the operands list of this with N operands.
775 void InitOperands(SDUse *Ops, const SDValue *Vals, unsigned N) {
776 for (unsigned i = 0; i != N; ++i) {
777 Ops[i].setUser(this);
778 Ops[i].setInitial(Vals[i]);
782 checkForCycles(this);
785 /// DropOperands - Release the operands and set this node to have
790 /// Wrapper class for IR location info (IR ordering and DebugLoc) to be passed
791 /// into SDNode creation functions.
792 /// When an SDNode is created from the DAGBuilder, the DebugLoc is extracted
793 /// from the original Instruction, and IROrder is the ordinal position of
795 /// When an SDNode is created after the DAG is being built, both DebugLoc and
796 /// the IROrder are propagated from the original SDNode.
797 /// So SDLoc class provides two constructors besides the default one, one to
798 /// be used by the DAGBuilder, the other to be used by others.
801 // Ptr could be used for either Instruction* or SDNode*. It is used for
802 // Instruction* if IROrder is not -1.
807 SDLoc() : Ptr(NULL), IROrder(0) {}
808 SDLoc(const SDNode *N) : Ptr(N), IROrder(-1) {
809 assert(N && "null SDNode");
811 SDLoc(const SDValue V) : Ptr(V.getNode()), IROrder(-1) {
812 assert(Ptr && "null SDNode");
814 SDLoc(const Instruction *I, int Order) : Ptr(I), IROrder(Order) {
815 assert(Order >= 0 && "bad IROrder");
817 unsigned getIROrder() {
818 if (IROrder >= 0 || Ptr == NULL) {
819 return (unsigned)IROrder;
821 const SDNode *N = (const SDNode*)(Ptr);
822 return N->getIROrder();
824 DebugLoc getDebugLoc() {
829 const Instruction *I = (const Instruction*)(Ptr);
830 return I->getDebugLoc();
832 const SDNode *N = (const SDNode*)(Ptr);
833 return N->getDebugLoc();
838 // Define inline functions from the SDValue class.
840 inline unsigned SDValue::getOpcode() const {
841 return Node->getOpcode();
843 inline EVT SDValue::getValueType() const {
844 return Node->getValueType(ResNo);
846 inline unsigned SDValue::getNumOperands() const {
847 return Node->getNumOperands();
849 inline const SDValue &SDValue::getOperand(unsigned i) const {
850 return Node->getOperand(i);
852 inline uint64_t SDValue::getConstantOperandVal(unsigned i) const {
853 return Node->getConstantOperandVal(i);
855 inline bool SDValue::isTargetOpcode() const {
856 return Node->isTargetOpcode();
858 inline bool SDValue::isTargetMemoryOpcode() const {
859 return Node->isTargetMemoryOpcode();
861 inline bool SDValue::isMachineOpcode() const {
862 return Node->isMachineOpcode();
864 inline unsigned SDValue::getMachineOpcode() const {
865 return Node->getMachineOpcode();
867 inline bool SDValue::use_empty() const {
868 return !Node->hasAnyUseOfValue(ResNo);
870 inline bool SDValue::hasOneUse() const {
871 return Node->hasNUsesOfValue(1, ResNo);
873 inline const DebugLoc SDValue::getDebugLoc() const {
874 return Node->getDebugLoc();
876 inline void SDValue::dump() const {
879 inline void SDValue::dumpr() const {
880 return Node->dumpr();
882 // Define inline functions from the SDUse class.
884 inline void SDUse::set(const SDValue &V) {
885 if (Val.getNode()) removeFromList();
887 if (V.getNode()) V.getNode()->addUse(*this);
890 inline void SDUse::setInitial(const SDValue &V) {
892 V.getNode()->addUse(*this);
895 inline void SDUse::setNode(SDNode *N) {
896 if (Val.getNode()) removeFromList();
898 if (N) N->addUse(*this);
901 /// UnarySDNode - This class is used for single-operand SDNodes. This is solely
902 /// to allow co-allocation of node operands with the node itself.
903 class UnarySDNode : public SDNode {
906 UnarySDNode(unsigned Opc, unsigned Order, DebugLoc dl, SDVTList VTs,
908 : SDNode(Opc, Order, dl, VTs) {
909 InitOperands(&Op, X);
913 /// BinarySDNode - This class is used for two-operand SDNodes. This is solely
914 /// to allow co-allocation of node operands with the node itself.
915 class BinarySDNode : public SDNode {
918 BinarySDNode(unsigned Opc, unsigned Order, DebugLoc dl, SDVTList VTs,
919 SDValue X, SDValue Y)
920 : SDNode(Opc, Order, dl, VTs) {
921 InitOperands(Ops, X, Y);
925 /// TernarySDNode - This class is used for three-operand SDNodes. This is solely
926 /// to allow co-allocation of node operands with the node itself.
927 class TernarySDNode : public SDNode {
930 TernarySDNode(unsigned Opc, unsigned Order, DebugLoc dl, SDVTList VTs,
931 SDValue X, SDValue Y, SDValue Z)
932 : SDNode(Opc, Order, dl, VTs) {
933 InitOperands(Ops, X, Y, Z);
938 /// HandleSDNode - This class is used to form a handle around another node that
939 /// is persistent and is updated across invocations of replaceAllUsesWith on its
940 /// operand. This node should be directly created by end-users and not added to
941 /// the AllNodes list.
942 class HandleSDNode : public SDNode {
945 // FIXME: Remove the "noinline" attribute once <rdar://problem/5852746> is
947 #if __GNUC__==4 && __GNUC_MINOR__==2 && defined(__APPLE__) && !defined(__llvm__)
948 explicit __attribute__((__noinline__)) HandleSDNode(SDValue X)
950 explicit HandleSDNode(SDValue X)
952 : SDNode(ISD::HANDLENODE, 0, DebugLoc(), getSDVTList(MVT::Other)) {
953 InitOperands(&Op, X);
956 const SDValue &getValue() const { return Op; }
959 /// Abstact virtual class for operations for memory operations
960 class MemSDNode : public SDNode {
962 // MemoryVT - VT of in-memory value.
966 /// MMO - Memory reference information.
967 MachineMemOperand *MMO;
970 MemSDNode(unsigned Opc, unsigned Order, DebugLoc dl, SDVTList VTs,
971 EVT MemoryVT, MachineMemOperand *MMO);
973 MemSDNode(unsigned Opc, unsigned Order, DebugLoc dl, SDVTList VTs,
975 unsigned NumOps, EVT MemoryVT, MachineMemOperand *MMO);
977 bool readMem() const { return MMO->isLoad(); }
978 bool writeMem() const { return MMO->isStore(); }
980 /// Returns alignment and volatility of the memory access
981 unsigned getOriginalAlignment() const {
982 return MMO->getBaseAlignment();
984 unsigned getAlignment() const {
985 return MMO->getAlignment();
988 /// getRawSubclassData - Return the SubclassData value, which contains an
989 /// encoding of the volatile flag, as well as bits used by subclasses. This
990 /// function should only be used to compute a FoldingSetNodeID value.
991 unsigned getRawSubclassData() const {
995 // We access subclass data here so that we can check consistency
996 // with MachineMemOperand information.
997 bool isVolatile() const { return (SubclassData >> 5) & 1; }
998 bool isNonTemporal() const { return (SubclassData >> 6) & 1; }
999 bool isInvariant() const { return (SubclassData >> 7) & 1; }
1001 AtomicOrdering getOrdering() const {
1002 return AtomicOrdering((SubclassData >> 8) & 15);
1004 SynchronizationScope getSynchScope() const {
1005 return SynchronizationScope((SubclassData >> 12) & 1);
1008 /// Returns the SrcValue and offset that describes the location of the access
1009 const Value *getSrcValue() const { return MMO->getValue(); }
1010 int64_t getSrcValueOffset() const { return MMO->getOffset(); }
1012 /// Returns the TBAAInfo that describes the dereference.
1013 const MDNode *getTBAAInfo() const { return MMO->getTBAAInfo(); }
1015 /// Returns the Ranges that describes the dereference.
1016 const MDNode *getRanges() const { return MMO->getRanges(); }
1018 /// getMemoryVT - Return the type of the in-memory value.
1019 EVT getMemoryVT() const { return MemoryVT; }
1021 /// getMemOperand - Return a MachineMemOperand object describing the memory
1022 /// reference performed by operation.
1023 MachineMemOperand *getMemOperand() const { return MMO; }
1025 const MachinePointerInfo &getPointerInfo() const {
1026 return MMO->getPointerInfo();
1029 /// getAddressSpace - Return the address space for the associated pointer
1030 unsigned getAddressSpace() const {
1031 return getPointerInfo().getAddrSpace();
1034 /// refineAlignment - Update this MemSDNode's MachineMemOperand information
1035 /// to reflect the alignment of NewMMO, if it has a greater alignment.
1036 /// This must only be used when the new alignment applies to all users of
1037 /// this MachineMemOperand.
1038 void refineAlignment(const MachineMemOperand *NewMMO) {
1039 MMO->refineAlignment(NewMMO);
1042 const SDValue &getChain() const { return getOperand(0); }
1043 const SDValue &getBasePtr() const {
1044 return getOperand(getOpcode() == ISD::STORE ? 2 : 1);
1047 // Methods to support isa and dyn_cast
1048 static bool classof(const SDNode *N) {
1049 // For some targets, we lower some target intrinsics to a MemIntrinsicNode
1050 // with either an intrinsic or a target opcode.
1051 return N->getOpcode() == ISD::LOAD ||
1052 N->getOpcode() == ISD::STORE ||
1053 N->getOpcode() == ISD::PREFETCH ||
1054 N->getOpcode() == ISD::ATOMIC_CMP_SWAP ||
1055 N->getOpcode() == ISD::ATOMIC_SWAP ||
1056 N->getOpcode() == ISD::ATOMIC_LOAD_ADD ||
1057 N->getOpcode() == ISD::ATOMIC_LOAD_SUB ||
1058 N->getOpcode() == ISD::ATOMIC_LOAD_AND ||
1059 N->getOpcode() == ISD::ATOMIC_LOAD_OR ||
1060 N->getOpcode() == ISD::ATOMIC_LOAD_XOR ||
1061 N->getOpcode() == ISD::ATOMIC_LOAD_NAND ||
1062 N->getOpcode() == ISD::ATOMIC_LOAD_MIN ||
1063 N->getOpcode() == ISD::ATOMIC_LOAD_MAX ||
1064 N->getOpcode() == ISD::ATOMIC_LOAD_UMIN ||
1065 N->getOpcode() == ISD::ATOMIC_LOAD_UMAX ||
1066 N->getOpcode() == ISD::ATOMIC_LOAD ||
1067 N->getOpcode() == ISD::ATOMIC_STORE ||
1068 N->isTargetMemoryOpcode();
1072 /// AtomicSDNode - A SDNode reprenting atomic operations.
1074 class AtomicSDNode : public MemSDNode {
1078 void InitAtomic(AtomicOrdering Ordering, SynchronizationScope SynchScope) {
1079 // This must match encodeMemSDNodeFlags() in SelectionDAG.cpp.
1080 assert((Ordering & 15) == Ordering &&
1081 "Ordering may not require more than 4 bits!");
1082 assert((SynchScope & 1) == SynchScope &&
1083 "SynchScope may not require more than 1 bit!");
1084 SubclassData |= Ordering << 8;
1085 SubclassData |= SynchScope << 12;
1086 assert(getOrdering() == Ordering && "Ordering encoding error!");
1087 assert(getSynchScope() == SynchScope && "Synch-scope encoding error!");
1091 // Opc: opcode for atomic
1092 // VTL: value type list
1093 // Chain: memory chain for operaand
1094 // Ptr: address to update as a SDValue
1095 // Cmp: compare value
1097 // SrcVal: address to update as a Value (used for MemOperand)
1098 // Align: alignment of memory
1099 AtomicSDNode(unsigned Opc, unsigned Order, DebugLoc dl, SDVTList VTL,
1101 SDValue Chain, SDValue Ptr,
1102 SDValue Cmp, SDValue Swp, MachineMemOperand *MMO,
1103 AtomicOrdering Ordering, SynchronizationScope SynchScope)
1104 : MemSDNode(Opc, Order, dl, VTL, MemVT, MMO), DynOps(NULL) {
1105 InitAtomic(Ordering, SynchScope);
1106 InitOperands(Ops, Chain, Ptr, Cmp, Swp);
1108 AtomicSDNode(unsigned Opc, unsigned Order, DebugLoc dl, SDVTList VTL,
1110 SDValue Chain, SDValue Ptr,
1111 SDValue Val, MachineMemOperand *MMO,
1112 AtomicOrdering Ordering, SynchronizationScope SynchScope)
1113 : MemSDNode(Opc, Order, dl, VTL, MemVT, MMO), DynOps(NULL) {
1114 InitAtomic(Ordering, SynchScope);
1115 InitOperands(Ops, Chain, Ptr, Val);
1117 AtomicSDNode(unsigned Opc, unsigned Order, DebugLoc dl, SDVTList VTL,
1119 SDValue Chain, SDValue Ptr,
1120 MachineMemOperand *MMO,
1121 AtomicOrdering Ordering, SynchronizationScope SynchScope)
1122 : MemSDNode(Opc, Order, dl, VTL, MemVT, MMO), DynOps(NULL) {
1123 InitAtomic(Ordering, SynchScope);
1124 InitOperands(Ops, Chain, Ptr);
1126 AtomicSDNode(unsigned Opc, unsigned Order, DebugLoc dl, SDVTList VTL, EVT MemVT,
1127 SDValue* AllOps, unsigned NumOps,
1128 MachineMemOperand *MMO,
1129 AtomicOrdering Ordering, SynchronizationScope SynchScope)
1130 : MemSDNode(Opc, Order, dl, VTL, MemVT, MMO) {
1131 DynOps = new SDUse[NumOps];
1132 InitAtomic(Ordering, SynchScope);
1133 InitOperands(DynOps, AllOps, NumOps);
1139 const SDValue &getBasePtr() const { return getOperand(1); }
1140 const SDValue &getVal() const { return getOperand(2); }
1142 bool isCompareAndSwap() const {
1143 unsigned Op = getOpcode();
1144 return Op == ISD::ATOMIC_CMP_SWAP;
1147 // Methods to support isa and dyn_cast
1148 static bool classof(const SDNode *N) {
1149 return N->getOpcode() == ISD::ATOMIC_CMP_SWAP ||
1150 N->getOpcode() == ISD::ATOMIC_SWAP ||
1151 N->getOpcode() == ISD::ATOMIC_LOAD_ADD ||
1152 N->getOpcode() == ISD::ATOMIC_LOAD_SUB ||
1153 N->getOpcode() == ISD::ATOMIC_LOAD_AND ||
1154 N->getOpcode() == ISD::ATOMIC_LOAD_OR ||
1155 N->getOpcode() == ISD::ATOMIC_LOAD_XOR ||
1156 N->getOpcode() == ISD::ATOMIC_LOAD_NAND ||
1157 N->getOpcode() == ISD::ATOMIC_LOAD_MIN ||
1158 N->getOpcode() == ISD::ATOMIC_LOAD_MAX ||
1159 N->getOpcode() == ISD::ATOMIC_LOAD_UMIN ||
1160 N->getOpcode() == ISD::ATOMIC_LOAD_UMAX ||
1161 N->getOpcode() == ISD::ATOMIC_LOAD ||
1162 N->getOpcode() == ISD::ATOMIC_STORE;
1166 /// MemIntrinsicSDNode - This SDNode is used for target intrinsics that touch
1167 /// memory and need an associated MachineMemOperand. Its opcode may be
1168 /// INTRINSIC_VOID, INTRINSIC_W_CHAIN, PREFETCH, or a target-specific opcode
1169 /// with a value not less than FIRST_TARGET_MEMORY_OPCODE.
1170 class MemIntrinsicSDNode : public MemSDNode {
1172 MemIntrinsicSDNode(unsigned Opc, unsigned Order, DebugLoc dl, SDVTList VTs,
1173 const SDValue *Ops, unsigned NumOps,
1174 EVT MemoryVT, MachineMemOperand *MMO)
1175 : MemSDNode(Opc, Order, dl, VTs, Ops, NumOps, MemoryVT, MMO) {
1178 // Methods to support isa and dyn_cast
1179 static bool classof(const SDNode *N) {
1180 // We lower some target intrinsics to their target opcode
1181 // early a node with a target opcode can be of this class
1182 return N->getOpcode() == ISD::INTRINSIC_W_CHAIN ||
1183 N->getOpcode() == ISD::INTRINSIC_VOID ||
1184 N->getOpcode() == ISD::PREFETCH ||
1185 N->isTargetMemoryOpcode();
1189 /// ShuffleVectorSDNode - This SDNode is used to implement the code generator
1190 /// support for the llvm IR shufflevector instruction. It combines elements
1191 /// from two input vectors into a new input vector, with the selection and
1192 /// ordering of elements determined by an array of integers, referred to as
1193 /// the shuffle mask. For input vectors of width N, mask indices of 0..N-1
1194 /// refer to elements from the LHS input, and indices from N to 2N-1 the RHS.
1195 /// An index of -1 is treated as undef, such that the code generator may put
1196 /// any value in the corresponding element of the result.
1197 class ShuffleVectorSDNode : public SDNode {
1200 // The memory for Mask is owned by the SelectionDAG's OperandAllocator, and
1201 // is freed when the SelectionDAG object is destroyed.
1204 friend class SelectionDAG;
1205 ShuffleVectorSDNode(EVT VT, unsigned Order, DebugLoc dl, SDValue N1,
1206 SDValue N2, const int *M)
1207 : SDNode(ISD::VECTOR_SHUFFLE, Order, dl, getSDVTList(VT)), Mask(M) {
1208 InitOperands(Ops, N1, N2);
1212 ArrayRef<int> getMask() const {
1213 EVT VT = getValueType(0);
1214 return makeArrayRef(Mask, VT.getVectorNumElements());
1216 int getMaskElt(unsigned Idx) const {
1217 assert(Idx < getValueType(0).getVectorNumElements() && "Idx out of range!");
1221 bool isSplat() const { return isSplatMask(Mask, getValueType(0)); }
1222 int getSplatIndex() const {
1223 assert(isSplat() && "Cannot get splat index for non-splat!");
1224 EVT VT = getValueType(0);
1225 for (unsigned i = 0, e = VT.getVectorNumElements(); i != e; ++i) {
1229 llvm_unreachable("Splat with all undef indices?");
1231 static bool isSplatMask(const int *Mask, EVT VT);
1233 static bool classof(const SDNode *N) {
1234 return N->getOpcode() == ISD::VECTOR_SHUFFLE;
1238 class ConstantSDNode : public SDNode {
1239 const ConstantInt *Value;
1240 friend class SelectionDAG;
1241 ConstantSDNode(bool isTarget, const ConstantInt *val, EVT VT)
1242 : SDNode(isTarget ? ISD::TargetConstant : ISD::Constant,
1243 0, DebugLoc(), getSDVTList(VT)), Value(val) {
1247 const ConstantInt *getConstantIntValue() const { return Value; }
1248 const APInt &getAPIntValue() const { return Value->getValue(); }
1249 uint64_t getZExtValue() const { return Value->getZExtValue(); }
1250 int64_t getSExtValue() const { return Value->getSExtValue(); }
1252 bool isOne() const { return Value->isOne(); }
1253 bool isNullValue() const { return Value->isNullValue(); }
1254 bool isAllOnesValue() const { return Value->isAllOnesValue(); }
1256 static bool classof(const SDNode *N) {
1257 return N->getOpcode() == ISD::Constant ||
1258 N->getOpcode() == ISD::TargetConstant;
1262 class ConstantFPSDNode : public SDNode {
1263 const ConstantFP *Value;
1264 friend class SelectionDAG;
1265 ConstantFPSDNode(bool isTarget, const ConstantFP *val, EVT VT)
1266 : SDNode(isTarget ? ISD::TargetConstantFP : ISD::ConstantFP,
1267 0, DebugLoc(), getSDVTList(VT)), Value(val) {
1271 const APFloat& getValueAPF() const { return Value->getValueAPF(); }
1272 const ConstantFP *getConstantFPValue() const { return Value; }
1274 /// isZero - Return true if the value is positive or negative zero.
1275 bool isZero() const { return Value->isZero(); }
1277 /// isNaN - Return true if the value is a NaN.
1278 bool isNaN() const { return Value->isNaN(); }
1280 /// isExactlyValue - We don't rely on operator== working on double values, as
1281 /// it returns true for things that are clearly not equal, like -0.0 and 0.0.
1282 /// As such, this method can be used to do an exact bit-for-bit comparison of
1283 /// two floating point values.
1285 /// We leave the version with the double argument here because it's just so
1286 /// convenient to write "2.0" and the like. Without this function we'd
1287 /// have to duplicate its logic everywhere it's called.
1288 bool isExactlyValue(double V) const {
1291 Tmp.convert(Value->getValueAPF().getSemantics(),
1292 APFloat::rmNearestTiesToEven, &ignored);
1293 return isExactlyValue(Tmp);
1295 bool isExactlyValue(const APFloat& V) const;
1297 static bool isValueValidForType(EVT VT, const APFloat& Val);
1299 static bool classof(const SDNode *N) {
1300 return N->getOpcode() == ISD::ConstantFP ||
1301 N->getOpcode() == ISD::TargetConstantFP;
1305 class GlobalAddressSDNode : public SDNode {
1306 const GlobalValue *TheGlobal;
1308 unsigned char TargetFlags;
1309 friend class SelectionDAG;
1310 GlobalAddressSDNode(unsigned Opc, unsigned Order, DebugLoc DL,
1311 const GlobalValue *GA, EVT VT, int64_t o,
1312 unsigned char TargetFlags);
1315 const GlobalValue *getGlobal() const { return TheGlobal; }
1316 int64_t getOffset() const { return Offset; }
1317 unsigned char getTargetFlags() const { return TargetFlags; }
1318 // Return the address space this GlobalAddress belongs to.
1319 unsigned getAddressSpace() const;
1321 static bool classof(const SDNode *N) {
1322 return N->getOpcode() == ISD::GlobalAddress ||
1323 N->getOpcode() == ISD::TargetGlobalAddress ||
1324 N->getOpcode() == ISD::GlobalTLSAddress ||
1325 N->getOpcode() == ISD::TargetGlobalTLSAddress;
1329 class FrameIndexSDNode : public SDNode {
1331 friend class SelectionDAG;
1332 FrameIndexSDNode(int fi, EVT VT, bool isTarg)
1333 : SDNode(isTarg ? ISD::TargetFrameIndex : ISD::FrameIndex,
1334 0, DebugLoc(), getSDVTList(VT)), FI(fi) {
1338 int getIndex() const { return FI; }
1340 static bool classof(const SDNode *N) {
1341 return N->getOpcode() == ISD::FrameIndex ||
1342 N->getOpcode() == ISD::TargetFrameIndex;
1346 class JumpTableSDNode : public SDNode {
1348 unsigned char TargetFlags;
1349 friend class SelectionDAG;
1350 JumpTableSDNode(int jti, EVT VT, bool isTarg, unsigned char TF)
1351 : SDNode(isTarg ? ISD::TargetJumpTable : ISD::JumpTable,
1352 0, DebugLoc(), getSDVTList(VT)), JTI(jti), TargetFlags(TF) {
1356 int getIndex() const { return JTI; }
1357 unsigned char getTargetFlags() const { return TargetFlags; }
1359 static bool classof(const SDNode *N) {
1360 return N->getOpcode() == ISD::JumpTable ||
1361 N->getOpcode() == ISD::TargetJumpTable;
1365 class ConstantPoolSDNode : public SDNode {
1367 const Constant *ConstVal;
1368 MachineConstantPoolValue *MachineCPVal;
1370 int Offset; // It's a MachineConstantPoolValue if top bit is set.
1371 unsigned Alignment; // Minimum alignment requirement of CP (not log2 value).
1372 unsigned char TargetFlags;
1373 friend class SelectionDAG;
1374 ConstantPoolSDNode(bool isTarget, const Constant *c, EVT VT, int o,
1375 unsigned Align, unsigned char TF)
1376 : SDNode(isTarget ? ISD::TargetConstantPool : ISD::ConstantPool, 0,
1377 DebugLoc(), getSDVTList(VT)), Offset(o), Alignment(Align),
1379 assert(Offset >= 0 && "Offset is too large");
1382 ConstantPoolSDNode(bool isTarget, MachineConstantPoolValue *v,
1383 EVT VT, int o, unsigned Align, unsigned char TF)
1384 : SDNode(isTarget ? ISD::TargetConstantPool : ISD::ConstantPool, 0,
1385 DebugLoc(), getSDVTList(VT)), Offset(o), Alignment(Align),
1387 assert(Offset >= 0 && "Offset is too large");
1388 Val.MachineCPVal = v;
1389 Offset |= 1 << (sizeof(unsigned)*CHAR_BIT-1);
1393 bool isMachineConstantPoolEntry() const {
1397 const Constant *getConstVal() const {
1398 assert(!isMachineConstantPoolEntry() && "Wrong constantpool type");
1399 return Val.ConstVal;
1402 MachineConstantPoolValue *getMachineCPVal() const {
1403 assert(isMachineConstantPoolEntry() && "Wrong constantpool type");
1404 return Val.MachineCPVal;
1407 int getOffset() const {
1408 return Offset & ~(1 << (sizeof(unsigned)*CHAR_BIT-1));
1411 // Return the alignment of this constant pool object, which is either 0 (for
1412 // default alignment) or the desired value.
1413 unsigned getAlignment() const { return Alignment; }
1414 unsigned char getTargetFlags() const { return TargetFlags; }
1416 Type *getType() const;
1418 static bool classof(const SDNode *N) {
1419 return N->getOpcode() == ISD::ConstantPool ||
1420 N->getOpcode() == ISD::TargetConstantPool;
1424 /// Completely target-dependent object reference.
1425 class TargetIndexSDNode : public SDNode {
1426 unsigned char TargetFlags;
1429 friend class SelectionDAG;
1432 TargetIndexSDNode(int Idx, EVT VT, int64_t Ofs, unsigned char TF)
1433 : SDNode(ISD::TargetIndex, 0, DebugLoc(), getSDVTList(VT)),
1434 TargetFlags(TF), Index(Idx), Offset(Ofs) {}
1437 unsigned char getTargetFlags() const { return TargetFlags; }
1438 int getIndex() const { return Index; }
1439 int64_t getOffset() const { return Offset; }
1441 static bool classof(const SDNode *N) {
1442 return N->getOpcode() == ISD::TargetIndex;
1446 class BasicBlockSDNode : public SDNode {
1447 MachineBasicBlock *MBB;
1448 friend class SelectionDAG;
1449 /// Debug info is meaningful and potentially useful here, but we create
1450 /// blocks out of order when they're jumped to, which makes it a bit
1451 /// harder. Let's see if we need it first.
1452 explicit BasicBlockSDNode(MachineBasicBlock *mbb)
1453 : SDNode(ISD::BasicBlock, 0, DebugLoc(), getSDVTList(MVT::Other)), MBB(mbb)
1457 MachineBasicBlock *getBasicBlock() const { return MBB; }
1459 static bool classof(const SDNode *N) {
1460 return N->getOpcode() == ISD::BasicBlock;
1464 /// BuildVectorSDNode - A "pseudo-class" with methods for operating on
1466 class BuildVectorSDNode : public SDNode {
1467 // These are constructed as SDNodes and then cast to BuildVectorSDNodes.
1468 explicit BuildVectorSDNode() LLVM_DELETED_FUNCTION;
1470 /// isConstantSplat - Check if this is a constant splat, and if so, find the
1471 /// smallest element size that splats the vector. If MinSplatBits is
1472 /// nonzero, the element size must be at least that large. Note that the
1473 /// splat element may be the entire vector (i.e., a one element vector).
1474 /// Returns the splat element value in SplatValue. Any undefined bits in
1475 /// that value are zero, and the corresponding bits in the SplatUndef mask
1476 /// are set. The SplatBitSize value is set to the splat element size in
1477 /// bits. HasAnyUndefs is set to true if any bits in the vector are
1478 /// undefined. isBigEndian describes the endianness of the target.
1479 bool isConstantSplat(APInt &SplatValue, APInt &SplatUndef,
1480 unsigned &SplatBitSize, bool &HasAnyUndefs,
1481 unsigned MinSplatBits = 0, bool isBigEndian = false);
1483 static inline bool classof(const SDNode *N) {
1484 return N->getOpcode() == ISD::BUILD_VECTOR;
1488 /// SrcValueSDNode - An SDNode that holds an arbitrary LLVM IR Value. This is
1489 /// used when the SelectionDAG needs to make a simple reference to something
1490 /// in the LLVM IR representation.
1492 class SrcValueSDNode : public SDNode {
1494 friend class SelectionDAG;
1495 /// Create a SrcValue for a general value.
1496 explicit SrcValueSDNode(const Value *v)
1497 : SDNode(ISD::SRCVALUE, 0, DebugLoc(), getSDVTList(MVT::Other)), V(v) {}
1500 /// getValue - return the contained Value.
1501 const Value *getValue() const { return V; }
1503 static bool classof(const SDNode *N) {
1504 return N->getOpcode() == ISD::SRCVALUE;
1508 class MDNodeSDNode : public SDNode {
1510 friend class SelectionDAG;
1511 explicit MDNodeSDNode(const MDNode *md)
1512 : SDNode(ISD::MDNODE_SDNODE, 0, DebugLoc(), getSDVTList(MVT::Other)), MD(md)
1516 const MDNode *getMD() const { return MD; }
1518 static bool classof(const SDNode *N) {
1519 return N->getOpcode() == ISD::MDNODE_SDNODE;
1523 class RegisterSDNode : public SDNode {
1525 friend class SelectionDAG;
1526 RegisterSDNode(unsigned reg, EVT VT)
1527 : SDNode(ISD::Register, 0, DebugLoc(), getSDVTList(VT)), Reg(reg) {
1531 unsigned getReg() const { return Reg; }
1533 static bool classof(const SDNode *N) {
1534 return N->getOpcode() == ISD::Register;
1538 class RegisterMaskSDNode : public SDNode {
1539 // The memory for RegMask is not owned by the node.
1540 const uint32_t *RegMask;
1541 friend class SelectionDAG;
1542 RegisterMaskSDNode(const uint32_t *mask)
1543 : SDNode(ISD::RegisterMask, 0, DebugLoc(), getSDVTList(MVT::Untyped)),
1547 const uint32_t *getRegMask() const { return RegMask; }
1549 static bool classof(const SDNode *N) {
1550 return N->getOpcode() == ISD::RegisterMask;
1554 class BlockAddressSDNode : public SDNode {
1555 const BlockAddress *BA;
1557 unsigned char TargetFlags;
1558 friend class SelectionDAG;
1559 BlockAddressSDNode(unsigned NodeTy, EVT VT, const BlockAddress *ba,
1560 int64_t o, unsigned char Flags)
1561 : SDNode(NodeTy, 0, DebugLoc(), getSDVTList(VT)),
1562 BA(ba), Offset(o), TargetFlags(Flags) {
1565 const BlockAddress *getBlockAddress() const { return BA; }
1566 int64_t getOffset() const { return Offset; }
1567 unsigned char getTargetFlags() const { return TargetFlags; }
1569 static bool classof(const SDNode *N) {
1570 return N->getOpcode() == ISD::BlockAddress ||
1571 N->getOpcode() == ISD::TargetBlockAddress;
1575 class EHLabelSDNode : public SDNode {
1578 friend class SelectionDAG;
1579 EHLabelSDNode(unsigned Order, DebugLoc dl, SDValue ch, MCSymbol *L)
1580 : SDNode(ISD::EH_LABEL, Order, dl, getSDVTList(MVT::Other)), Label(L) {
1581 InitOperands(&Chain, ch);
1584 MCSymbol *getLabel() const { return Label; }
1586 static bool classof(const SDNode *N) {
1587 return N->getOpcode() == ISD::EH_LABEL;
1591 class ExternalSymbolSDNode : public SDNode {
1593 unsigned char TargetFlags;
1595 friend class SelectionDAG;
1596 ExternalSymbolSDNode(bool isTarget, const char *Sym, unsigned char TF, EVT VT)
1597 : SDNode(isTarget ? ISD::TargetExternalSymbol : ISD::ExternalSymbol,
1598 0, DebugLoc(), getSDVTList(VT)), Symbol(Sym), TargetFlags(TF) {
1602 const char *getSymbol() const { return Symbol; }
1603 unsigned char getTargetFlags() const { return TargetFlags; }
1605 static bool classof(const SDNode *N) {
1606 return N->getOpcode() == ISD::ExternalSymbol ||
1607 N->getOpcode() == ISD::TargetExternalSymbol;
1611 class CondCodeSDNode : public SDNode {
1612 ISD::CondCode Condition;
1613 friend class SelectionDAG;
1614 explicit CondCodeSDNode(ISD::CondCode Cond)
1615 : SDNode(ISD::CONDCODE, 0, DebugLoc(), getSDVTList(MVT::Other)),
1620 ISD::CondCode get() const { return Condition; }
1622 static bool classof(const SDNode *N) {
1623 return N->getOpcode() == ISD::CONDCODE;
1627 /// CvtRndSatSDNode - NOTE: avoid using this node as this may disappear in the
1628 /// future and most targets don't support it.
1629 class CvtRndSatSDNode : public SDNode {
1630 ISD::CvtCode CvtCode;
1631 friend class SelectionDAG;
1632 explicit CvtRndSatSDNode(EVT VT, unsigned Order, DebugLoc dl,
1633 const SDValue *Ops, unsigned NumOps,
1635 : SDNode(ISD::CONVERT_RNDSAT, Order, dl, getSDVTList(VT), Ops, NumOps),
1637 assert(NumOps == 5 && "wrong number of operations");
1640 ISD::CvtCode getCvtCode() const { return CvtCode; }
1642 static bool classof(const SDNode *N) {
1643 return N->getOpcode() == ISD::CONVERT_RNDSAT;
1647 /// VTSDNode - This class is used to represent EVT's, which are used
1648 /// to parameterize some operations.
1649 class VTSDNode : public SDNode {
1651 friend class SelectionDAG;
1652 explicit VTSDNode(EVT VT)
1653 : SDNode(ISD::VALUETYPE, 0, DebugLoc(), getSDVTList(MVT::Other)),
1658 EVT getVT() const { return ValueType; }
1660 static bool classof(const SDNode *N) {
1661 return N->getOpcode() == ISD::VALUETYPE;
1665 /// LSBaseSDNode - Base class for LoadSDNode and StoreSDNode
1667 class LSBaseSDNode : public MemSDNode {
1668 //! Operand array for load and store
1670 \note Moving this array to the base class captures more
1671 common functionality shared between LoadSDNode and
1676 LSBaseSDNode(ISD::NodeType NodeTy, unsigned Order, DebugLoc dl,
1677 SDValue *Operands, unsigned numOperands,
1678 SDVTList VTs, ISD::MemIndexedMode AM, EVT MemVT,
1679 MachineMemOperand *MMO)
1680 : MemSDNode(NodeTy, Order, dl, VTs, MemVT, MMO) {
1681 SubclassData |= AM << 2;
1682 assert(getAddressingMode() == AM && "MemIndexedMode encoding error!");
1683 InitOperands(Ops, Operands, numOperands);
1684 assert((getOffset().getOpcode() == ISD::UNDEF || isIndexed()) &&
1685 "Only indexed loads and stores have a non-undef offset operand");
1688 const SDValue &getOffset() const {
1689 return getOperand(getOpcode() == ISD::LOAD ? 2 : 3);
1692 /// getAddressingMode - Return the addressing mode for this load or store:
1693 /// unindexed, pre-inc, pre-dec, post-inc, or post-dec.
1694 ISD::MemIndexedMode getAddressingMode() const {
1695 return ISD::MemIndexedMode((SubclassData >> 2) & 7);
1698 /// isIndexed - Return true if this is a pre/post inc/dec load/store.
1699 bool isIndexed() const { return getAddressingMode() != ISD::UNINDEXED; }
1701 /// isUnindexed - Return true if this is NOT a pre/post inc/dec load/store.
1702 bool isUnindexed() const { return getAddressingMode() == ISD::UNINDEXED; }
1704 static bool classof(const SDNode *N) {
1705 return N->getOpcode() == ISD::LOAD ||
1706 N->getOpcode() == ISD::STORE;
1710 /// LoadSDNode - This class is used to represent ISD::LOAD nodes.
1712 class LoadSDNode : public LSBaseSDNode {
1713 friend class SelectionDAG;
1714 LoadSDNode(SDValue *ChainPtrOff, unsigned Order, DebugLoc dl, SDVTList VTs,
1715 ISD::MemIndexedMode AM, ISD::LoadExtType ETy, EVT MemVT,
1716 MachineMemOperand *MMO)
1717 : LSBaseSDNode(ISD::LOAD, Order, dl, ChainPtrOff, 3, VTs, AM, MemVT, MMO) {
1718 SubclassData |= (unsigned short)ETy;
1719 assert(getExtensionType() == ETy && "LoadExtType encoding error!");
1720 assert(readMem() && "Load MachineMemOperand is not a load!");
1721 assert(!writeMem() && "Load MachineMemOperand is a store!");
1725 /// getExtensionType - Return whether this is a plain node,
1726 /// or one of the varieties of value-extending loads.
1727 ISD::LoadExtType getExtensionType() const {
1728 return ISD::LoadExtType(SubclassData & 3);
1731 const SDValue &getBasePtr() const { return getOperand(1); }
1732 const SDValue &getOffset() const { return getOperand(2); }
1734 static bool classof(const SDNode *N) {
1735 return N->getOpcode() == ISD::LOAD;
1739 /// StoreSDNode - This class is used to represent ISD::STORE nodes.
1741 class StoreSDNode : public LSBaseSDNode {
1742 friend class SelectionDAG;
1743 StoreSDNode(SDValue *ChainValuePtrOff, unsigned Order, DebugLoc dl,
1744 SDVTList VTs, ISD::MemIndexedMode AM, bool isTrunc, EVT MemVT,
1745 MachineMemOperand *MMO)
1746 : LSBaseSDNode(ISD::STORE, Order, dl, ChainValuePtrOff, 4,
1747 VTs, AM, MemVT, MMO) {
1748 SubclassData |= (unsigned short)isTrunc;
1749 assert(isTruncatingStore() == isTrunc && "isTrunc encoding error!");
1750 assert(!readMem() && "Store MachineMemOperand is a load!");
1751 assert(writeMem() && "Store MachineMemOperand is not a store!");
1755 /// isTruncatingStore - Return true if the op does a truncation before store.
1756 /// For integers this is the same as doing a TRUNCATE and storing the result.
1757 /// For floats, it is the same as doing an FP_ROUND and storing the result.
1758 bool isTruncatingStore() const { return SubclassData & 1; }
1760 const SDValue &getValue() const { return getOperand(1); }
1761 const SDValue &getBasePtr() const { return getOperand(2); }
1762 const SDValue &getOffset() const { return getOperand(3); }
1764 static bool classof(const SDNode *N) {
1765 return N->getOpcode() == ISD::STORE;
1769 /// MachineSDNode - An SDNode that represents everything that will be needed
1770 /// to construct a MachineInstr. These nodes are created during the
1771 /// instruction selection proper phase.
1773 class MachineSDNode : public SDNode {
1775 typedef MachineMemOperand **mmo_iterator;
1778 friend class SelectionDAG;
1779 MachineSDNode(unsigned Opc, unsigned Order, const DebugLoc DL, SDVTList VTs)
1780 : SDNode(Opc, Order, DL, VTs), MemRefs(0), MemRefsEnd(0) {}
1782 /// LocalOperands - Operands for this instruction, if they fit here. If
1783 /// they don't, this field is unused.
1784 SDUse LocalOperands[4];
1786 /// MemRefs - Memory reference descriptions for this instruction.
1787 mmo_iterator MemRefs;
1788 mmo_iterator MemRefsEnd;
1791 mmo_iterator memoperands_begin() const { return MemRefs; }
1792 mmo_iterator memoperands_end() const { return MemRefsEnd; }
1793 bool memoperands_empty() const { return MemRefsEnd == MemRefs; }
1795 /// setMemRefs - Assign this MachineSDNodes's memory reference descriptor
1796 /// list. This does not transfer ownership.
1797 void setMemRefs(mmo_iterator NewMemRefs, mmo_iterator NewMemRefsEnd) {
1798 for (mmo_iterator MMI = NewMemRefs, MME = NewMemRefsEnd; MMI != MME; ++MMI)
1799 assert(*MMI && "Null mem ref detected!");
1800 MemRefs = NewMemRefs;
1801 MemRefsEnd = NewMemRefsEnd;
1804 static bool classof(const SDNode *N) {
1805 return N->isMachineOpcode();
1809 class SDNodeIterator : public std::iterator<std::forward_iterator_tag,
1810 SDNode, ptrdiff_t> {
1814 SDNodeIterator(const SDNode *N, unsigned Op) : Node(N), Operand(Op) {}
1816 bool operator==(const SDNodeIterator& x) const {
1817 return Operand == x.Operand;
1819 bool operator!=(const SDNodeIterator& x) const { return !operator==(x); }
1821 const SDNodeIterator &operator=(const SDNodeIterator &I) {
1822 assert(I.Node == Node && "Cannot assign iterators to two different nodes!");
1823 Operand = I.Operand;
1827 pointer operator*() const {
1828 return Node->getOperand(Operand).getNode();
1830 pointer operator->() const { return operator*(); }
1832 SDNodeIterator& operator++() { // Preincrement
1836 SDNodeIterator operator++(int) { // Postincrement
1837 SDNodeIterator tmp = *this; ++*this; return tmp;
1839 size_t operator-(SDNodeIterator Other) const {
1840 assert(Node == Other.Node &&
1841 "Cannot compare iterators of two different nodes!");
1842 return Operand - Other.Operand;
1845 static SDNodeIterator begin(const SDNode *N) { return SDNodeIterator(N, 0); }
1846 static SDNodeIterator end (const SDNode *N) {
1847 return SDNodeIterator(N, N->getNumOperands());
1850 unsigned getOperand() const { return Operand; }
1851 const SDNode *getNode() const { return Node; }
1854 template <> struct GraphTraits<SDNode*> {
1855 typedef SDNode NodeType;
1856 typedef SDNodeIterator ChildIteratorType;
1857 static inline NodeType *getEntryNode(SDNode *N) { return N; }
1858 static inline ChildIteratorType child_begin(NodeType *N) {
1859 return SDNodeIterator::begin(N);
1861 static inline ChildIteratorType child_end(NodeType *N) {
1862 return SDNodeIterator::end(N);
1866 /// LargestSDNode - The largest SDNode class.
1868 typedef AtomicSDNode LargestSDNode;
1870 /// MostAlignedSDNode - The SDNode class with the greatest alignment
1873 typedef GlobalAddressSDNode MostAlignedSDNode;
1876 /// isNormalLoad - Returns true if the specified node is a non-extending
1877 /// and unindexed load.
1878 inline bool isNormalLoad(const SDNode *N) {
1879 const LoadSDNode *Ld = dyn_cast<LoadSDNode>(N);
1880 return Ld && Ld->getExtensionType() == ISD::NON_EXTLOAD &&
1881 Ld->getAddressingMode() == ISD::UNINDEXED;
1884 /// isNON_EXTLoad - Returns true if the specified node is a non-extending
1886 inline bool isNON_EXTLoad(const SDNode *N) {
1887 return isa<LoadSDNode>(N) &&
1888 cast<LoadSDNode>(N)->getExtensionType() == ISD::NON_EXTLOAD;
1891 /// isEXTLoad - Returns true if the specified node is a EXTLOAD.
1893 inline bool isEXTLoad(const SDNode *N) {
1894 return isa<LoadSDNode>(N) &&
1895 cast<LoadSDNode>(N)->getExtensionType() == ISD::EXTLOAD;
1898 /// isSEXTLoad - Returns true if the specified node is a SEXTLOAD.
1900 inline bool isSEXTLoad(const SDNode *N) {
1901 return isa<LoadSDNode>(N) &&
1902 cast<LoadSDNode>(N)->getExtensionType() == ISD::SEXTLOAD;
1905 /// isZEXTLoad - Returns true if the specified node is a ZEXTLOAD.
1907 inline bool isZEXTLoad(const SDNode *N) {
1908 return isa<LoadSDNode>(N) &&
1909 cast<LoadSDNode>(N)->getExtensionType() == ISD::ZEXTLOAD;
1912 /// isUNINDEXEDLoad - Returns true if the specified node is an unindexed load.
1914 inline bool isUNINDEXEDLoad(const SDNode *N) {
1915 return isa<LoadSDNode>(N) &&
1916 cast<LoadSDNode>(N)->getAddressingMode() == ISD::UNINDEXED;
1919 /// isNormalStore - Returns true if the specified node is a non-truncating
1920 /// and unindexed store.
1921 inline bool isNormalStore(const SDNode *N) {
1922 const StoreSDNode *St = dyn_cast<StoreSDNode>(N);
1923 return St && !St->isTruncatingStore() &&
1924 St->getAddressingMode() == ISD::UNINDEXED;
1927 /// isNON_TRUNCStore - Returns true if the specified node is a non-truncating
1929 inline bool isNON_TRUNCStore(const SDNode *N) {
1930 return isa<StoreSDNode>(N) && !cast<StoreSDNode>(N)->isTruncatingStore();
1933 /// isTRUNCStore - Returns true if the specified node is a truncating
1935 inline bool isTRUNCStore(const SDNode *N) {
1936 return isa<StoreSDNode>(N) && cast<StoreSDNode>(N)->isTruncatingStore();
1939 /// isUNINDEXEDStore - Returns true if the specified node is an
1940 /// unindexed store.
1941 inline bool isUNINDEXEDStore(const SDNode *N) {
1942 return isa<StoreSDNode>(N) &&
1943 cast<StoreSDNode>(N)->getAddressingMode() == ISD::UNINDEXED;
1947 } // end llvm namespace