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/iterator_range.h"
23 #include "llvm/ADT/BitVector.h"
24 #include "llvm/ADT/FoldingSet.h"
25 #include "llvm/ADT/GraphTraits.h"
26 #include "llvm/ADT/STLExtras.h"
27 #include "llvm/ADT/SmallPtrSet.h"
28 #include "llvm/ADT/SmallVector.h"
29 #include "llvm/ADT/ilist_node.h"
30 #include "llvm/CodeGen/ISDOpcodes.h"
31 #include "llvm/CodeGen/MachineMemOperand.h"
32 #include "llvm/CodeGen/ValueTypes.h"
33 #include "llvm/IR/Constants.h"
34 #include "llvm/IR/DebugLoc.h"
35 #include "llvm/IR/Instructions.h"
36 #include "llvm/Support/DataTypes.h"
37 #include "llvm/Support/MathExtras.h"
44 class MachineBasicBlock;
45 class MachineConstantPoolValue;
49 template <typename T> struct DenseMapInfo;
50 template <typename T> struct simplify_type;
51 template <typename T> struct ilist_traits;
53 /// isBinOpWithFlags - Returns true if the opcode is a binary operation
55 static bool isBinOpWithFlags(unsigned Opcode) {
71 void checkForCycles(const SDNode *N, const SelectionDAG *DAG = nullptr,
74 /// SDVTList - This represents a list of ValueType's that has been intern'd by
75 /// a SelectionDAG. Instances of this simple value class are returned by
76 /// SelectionDAG::getVTList(...).
86 /// isBuildVectorAllOnes - Return true if the specified node is a
87 /// BUILD_VECTOR where all of the elements are ~0 or undef.
88 bool isBuildVectorAllOnes(const SDNode *N);
90 /// isBuildVectorAllZeros - Return true if the specified node is a
91 /// BUILD_VECTOR where all of the elements are 0 or undef.
92 bool isBuildVectorAllZeros(const SDNode *N);
94 /// \brief Return true if the specified node is a BUILD_VECTOR node of
95 /// all ConstantSDNode or undef.
96 bool isBuildVectorOfConstantSDNodes(const SDNode *N);
98 /// isScalarToVector - Return true if the specified node is a
99 /// ISD::SCALAR_TO_VECTOR node or a BUILD_VECTOR node where only the low
100 /// element is not an undef.
101 bool isScalarToVector(const SDNode *N);
103 /// allOperandsUndef - Return true if the node has at least one operand
104 /// and all operands of the specified node are ISD::UNDEF.
105 bool allOperandsUndef(const SDNode *N);
106 } // end llvm:ISD namespace
108 //===----------------------------------------------------------------------===//
109 /// SDValue - Unlike LLVM values, Selection DAG nodes may return multiple
110 /// values as the result of a computation. Many nodes return multiple values,
111 /// from loads (which define a token and a return value) to ADDC (which returns
112 /// a result and a carry value), to calls (which may return an arbitrary number
115 /// As such, each use of a SelectionDAG computation must indicate the node that
116 /// computes it as well as which return value to use from that node. This pair
117 /// of information is represented with the SDValue value type.
120 friend struct DenseMapInfo<SDValue>;
122 SDNode *Node; // The node defining the value we are using.
123 unsigned ResNo; // Which return value of the node we are using.
125 SDValue() : Node(nullptr), ResNo(0) {}
126 SDValue(SDNode *node, unsigned resno);
128 /// get the index which selects a specific result in the SDNode
129 unsigned getResNo() const { return ResNo; }
131 /// get the SDNode which holds the desired result
132 SDNode *getNode() const { return Node; }
135 void setNode(SDNode *N) { Node = N; }
137 inline SDNode *operator->() const { return Node; }
139 bool operator==(const SDValue &O) const {
140 return Node == O.Node && ResNo == O.ResNo;
142 bool operator!=(const SDValue &O) const {
143 return !operator==(O);
145 bool operator<(const SDValue &O) const {
146 return std::tie(Node, ResNo) < std::tie(O.Node, O.ResNo);
148 LLVM_EXPLICIT operator bool() const {
149 return Node != nullptr;
152 SDValue getValue(unsigned R) const {
153 return SDValue(Node, R);
156 // isOperandOf - Return true if this node is an operand of N.
157 bool isOperandOf(SDNode *N) const;
159 /// getValueType - Return the ValueType of the referenced return value.
161 inline EVT getValueType() const;
163 /// Return the simple ValueType of the referenced return value.
164 MVT getSimpleValueType() const {
165 return getValueType().getSimpleVT();
168 /// getValueSizeInBits - Returns the size of the value in bits.
170 unsigned getValueSizeInBits() const {
171 return getValueType().getSizeInBits();
174 unsigned getScalarValueSizeInBits() const {
175 return getValueType().getScalarType().getSizeInBits();
178 // Forwarding methods - These forward to the corresponding methods in SDNode.
179 inline unsigned getOpcode() const;
180 inline unsigned getNumOperands() const;
181 inline const SDValue &getOperand(unsigned i) const;
182 inline uint64_t getConstantOperandVal(unsigned i) const;
183 inline bool isTargetMemoryOpcode() const;
184 inline bool isTargetOpcode() const;
185 inline bool isMachineOpcode() const;
186 inline unsigned getMachineOpcode() const;
187 inline const DebugLoc getDebugLoc() const;
188 inline void dump() const;
189 inline void dumpr() const;
191 /// reachesChainWithoutSideEffects - Return true if this operand (which must
192 /// be a chain) reaches the specified operand without crossing any
193 /// side-effecting instructions. In practice, this looks through token
194 /// factors and non-volatile loads. In order to remain efficient, this only
195 /// looks a couple of nodes in, it does not do an exhaustive search.
196 bool reachesChainWithoutSideEffects(SDValue Dest,
197 unsigned Depth = 2) const;
199 /// use_empty - Return true if there are no nodes using value ResNo
202 inline bool use_empty() const;
204 /// hasOneUse - Return true if there is exactly one node using value
207 inline bool hasOneUse() const;
211 template<> struct DenseMapInfo<SDValue> {
212 static inline SDValue getEmptyKey() {
217 static inline SDValue getTombstoneKey() {
222 static unsigned getHashValue(const SDValue &Val) {
223 return ((unsigned)((uintptr_t)Val.getNode() >> 4) ^
224 (unsigned)((uintptr_t)Val.getNode() >> 9)) + Val.getResNo();
226 static bool isEqual(const SDValue &LHS, const SDValue &RHS) {
230 template <> struct isPodLike<SDValue> { static const bool value = true; };
233 /// simplify_type specializations - Allow casting operators to work directly on
234 /// SDValues as if they were SDNode*'s.
235 template<> struct simplify_type<SDValue> {
236 typedef SDNode* SimpleType;
237 static SimpleType getSimplifiedValue(SDValue &Val) {
238 return Val.getNode();
241 template<> struct simplify_type<const SDValue> {
242 typedef /*const*/ SDNode* SimpleType;
243 static SimpleType getSimplifiedValue(const SDValue &Val) {
244 return Val.getNode();
248 /// SDUse - Represents a use of a SDNode. This class holds an SDValue,
249 /// which records the SDNode being used and the result number, a
250 /// pointer to the SDNode using the value, and Next and Prev pointers,
251 /// which link together all the uses of an SDNode.
254 /// Val - The value being used.
256 /// User - The user of this value.
258 /// Prev, Next - Pointers to the uses list of the SDNode referred by
262 SDUse(const SDUse &U) LLVM_DELETED_FUNCTION;
263 void operator=(const SDUse &U) LLVM_DELETED_FUNCTION;
266 SDUse() : Val(), User(nullptr), Prev(nullptr), Next(nullptr) {}
268 /// Normally SDUse will just implicitly convert to an SDValue that it holds.
269 operator const SDValue&() const { return Val; }
271 /// If implicit conversion to SDValue doesn't work, the get() method returns
273 const SDValue &get() const { return Val; }
275 /// getUser - This returns the SDNode that contains this Use.
276 SDNode *getUser() { return User; }
278 /// getNext - Get the next SDUse in the use list.
279 SDUse *getNext() const { return Next; }
281 /// getNode - Convenience function for get().getNode().
282 SDNode *getNode() const { return Val.getNode(); }
283 /// getResNo - Convenience function for get().getResNo().
284 unsigned getResNo() const { return Val.getResNo(); }
285 /// getValueType - Convenience function for get().getValueType().
286 EVT getValueType() const { return Val.getValueType(); }
288 /// operator== - Convenience function for get().operator==
289 bool operator==(const SDValue &V) const {
293 /// operator!= - Convenience function for get().operator!=
294 bool operator!=(const SDValue &V) const {
298 /// operator< - Convenience function for get().operator<
299 bool operator<(const SDValue &V) const {
304 friend class SelectionDAG;
307 void setUser(SDNode *p) { User = p; }
309 /// set - Remove this use from its existing use list, assign it the
310 /// given value, and add it to the new value's node's use list.
311 inline void set(const SDValue &V);
312 /// setInitial - like set, but only supports initializing a newly-allocated
313 /// SDUse with a non-null value.
314 inline void setInitial(const SDValue &V);
315 /// setNode - like set, but only sets the Node portion of the value,
316 /// leaving the ResNo portion unmodified.
317 inline void setNode(SDNode *N);
319 void addToList(SDUse **List) {
321 if (Next) Next->Prev = &Next;
326 void removeFromList() {
328 if (Next) Next->Prev = Prev;
332 /// simplify_type specializations - Allow casting operators to work directly on
333 /// SDValues as if they were SDNode*'s.
334 template<> struct simplify_type<SDUse> {
335 typedef SDNode* SimpleType;
336 static SimpleType getSimplifiedValue(SDUse &Val) {
337 return Val.getNode();
342 /// SDNode - Represents one node in the SelectionDAG.
344 class SDNode : public FoldingSetNode, public ilist_node<SDNode> {
346 /// NodeType - The operation that this node performs.
350 /// OperandsNeedDelete - This is true if OperandList was new[]'d. If true,
351 /// then they will be delete[]'d when the node is destroyed.
352 uint16_t OperandsNeedDelete : 1;
354 /// HasDebugValue - This tracks whether this node has one or more dbg_value
355 /// nodes corresponding to it.
356 uint16_t HasDebugValue : 1;
359 /// SubclassData - This member is defined by this class, but is not used for
360 /// anything. Subclasses can use it to hold whatever state they find useful.
361 /// This field is initialized to zero by the ctor.
362 uint16_t SubclassData : 14;
365 /// NodeId - Unique id per SDNode in the DAG.
368 /// OperandList - The values that are used by this operation.
372 /// ValueList - The types of the values this node defines. SDNode's may
373 /// define multiple values simultaneously.
374 const EVT *ValueList;
376 /// UseList - List of uses for this SDNode.
379 /// NumOperands/NumValues - The number of entries in the Operand/Value list.
380 unsigned short NumOperands, NumValues;
382 /// debugLoc - source line information.
385 // The ordering of the SDNodes. It roughly corresponds to the ordering of the
386 // original LLVM instructions.
387 // This is used for turning off scheduling, because we'll forgo
388 // the normal scheduling algorithms and output the instructions according to
392 /// getValueTypeList - Return a pointer to the specified value type.
393 static const EVT *getValueTypeList(EVT VT);
395 friend class SelectionDAG;
396 friend struct ilist_traits<SDNode>;
399 //===--------------------------------------------------------------------===//
403 /// getOpcode - Return the SelectionDAG opcode value for this node. For
404 /// pre-isel nodes (those for which isMachineOpcode returns false), these
405 /// are the opcode values in the ISD and <target>ISD namespaces. For
406 /// post-isel opcodes, see getMachineOpcode.
407 unsigned getOpcode() const { return (unsigned short)NodeType; }
409 /// isTargetOpcode - Test if this node has a target-specific opcode (in the
410 /// \<target\>ISD namespace).
411 bool isTargetOpcode() const { return NodeType >= ISD::BUILTIN_OP_END; }
413 /// isTargetMemoryOpcode - Test if this node has a target-specific
414 /// memory-referencing opcode (in the \<target\>ISD namespace and
415 /// greater than FIRST_TARGET_MEMORY_OPCODE).
416 bool isTargetMemoryOpcode() const {
417 return NodeType >= ISD::FIRST_TARGET_MEMORY_OPCODE;
420 /// Test if this node is a memory intrinsic (with valid pointer information).
421 /// INTRINSIC_W_CHAIN and INTRINSIC_VOID nodes are sometimes created for
422 /// non-memory intrinsics (with chains) that are not really instances of
423 /// MemSDNode. For such nodes, we need some extra state to determine the
424 /// proper classof relationship.
425 bool isMemIntrinsic() const {
426 return (NodeType == ISD::INTRINSIC_W_CHAIN ||
427 NodeType == ISD::INTRINSIC_VOID) && ((SubclassData >> 13) & 1);
430 /// isMachineOpcode - Test if this node has a post-isel opcode, directly
431 /// corresponding to a MachineInstr opcode.
432 bool isMachineOpcode() const { return NodeType < 0; }
434 /// getMachineOpcode - This may only be called if isMachineOpcode returns
435 /// true. It returns the MachineInstr opcode value that the node's opcode
437 unsigned getMachineOpcode() const {
438 assert(isMachineOpcode() && "Not a MachineInstr opcode!");
442 /// getHasDebugValue - get this bit.
443 bool getHasDebugValue() const { return HasDebugValue; }
445 /// setHasDebugValue - set this bit.
446 void setHasDebugValue(bool b) { HasDebugValue = b; }
448 /// use_empty - Return true if there are no uses of this node.
450 bool use_empty() const { return UseList == nullptr; }
452 /// hasOneUse - Return true if there is exactly one use of this node.
454 bool hasOneUse() const {
455 return !use_empty() && std::next(use_begin()) == use_end();
458 /// use_size - Return the number of uses of this node. This method takes
459 /// time proportional to the number of uses.
461 size_t use_size() const { return std::distance(use_begin(), use_end()); }
463 /// getNodeId - Return the unique node id.
465 int getNodeId() const { return NodeId; }
467 /// setNodeId - Set unique node id.
468 void setNodeId(int Id) { NodeId = Id; }
470 /// getIROrder - Return the node ordering.
472 unsigned getIROrder() const { return IROrder; }
474 /// setIROrder - Set the node ordering.
476 void setIROrder(unsigned Order) { IROrder = Order; }
478 /// getDebugLoc - Return the source location info.
479 const DebugLoc getDebugLoc() const { return debugLoc; }
481 /// setDebugLoc - Set source location info. Try to avoid this, putting
482 /// it in the constructor is preferable.
483 void setDebugLoc(const DebugLoc dl) { debugLoc = dl; }
485 /// use_iterator - This class provides iterator support for SDUse
486 /// operands that use a specific SDNode.
488 : public std::iterator<std::forward_iterator_tag, SDUse, ptrdiff_t> {
490 explicit use_iterator(SDUse *op) : Op(op) {
494 typedef std::iterator<std::forward_iterator_tag,
495 SDUse, ptrdiff_t>::reference reference;
496 typedef std::iterator<std::forward_iterator_tag,
497 SDUse, ptrdiff_t>::pointer pointer;
499 use_iterator(const use_iterator &I) : Op(I.Op) {}
500 use_iterator() : Op(nullptr) {}
502 bool operator==(const use_iterator &x) const {
505 bool operator!=(const use_iterator &x) const {
506 return !operator==(x);
509 /// atEnd - return true if this iterator is at the end of uses list.
510 bool atEnd() const { return Op == nullptr; }
512 // Iterator traversal: forward iteration only.
513 use_iterator &operator++() { // Preincrement
514 assert(Op && "Cannot increment end iterator!");
519 use_iterator operator++(int) { // Postincrement
520 use_iterator tmp = *this; ++*this; return tmp;
523 /// Retrieve a pointer to the current user node.
524 SDNode *operator*() const {
525 assert(Op && "Cannot dereference end iterator!");
526 return Op->getUser();
529 SDNode *operator->() const { return operator*(); }
531 SDUse &getUse() const { return *Op; }
533 /// getOperandNo - Retrieve the operand # of this use in its user.
535 unsigned getOperandNo() const {
536 assert(Op && "Cannot dereference end iterator!");
537 return (unsigned)(Op - Op->getUser()->OperandList);
541 /// use_begin/use_end - Provide iteration support to walk over all uses
544 use_iterator use_begin() const {
545 return use_iterator(UseList);
548 static use_iterator use_end() { return use_iterator(nullptr); }
550 inline iterator_range<use_iterator> uses() {
551 return iterator_range<use_iterator>(use_begin(), use_end());
553 inline iterator_range<use_iterator> uses() const {
554 return iterator_range<use_iterator>(use_begin(), use_end());
557 /// hasNUsesOfValue - Return true if there are exactly NUSES uses of the
558 /// indicated value. This method ignores uses of other values defined by this
560 bool hasNUsesOfValue(unsigned NUses, unsigned Value) const;
562 /// hasAnyUseOfValue - Return true if there are any use of the indicated
563 /// value. This method ignores uses of other values defined by this operation.
564 bool hasAnyUseOfValue(unsigned Value) const;
566 /// isOnlyUserOf - Return true if this node is the only use of N.
568 bool isOnlyUserOf(SDNode *N) const;
570 /// isOperandOf - Return true if this node is an operand of N.
572 bool isOperandOf(SDNode *N) const;
574 /// isPredecessorOf - Return true if this node is a predecessor of N.
575 /// NOTE: Implemented on top of hasPredecessor and every bit as
576 /// expensive. Use carefully.
577 bool isPredecessorOf(const SDNode *N) const {
578 return N->hasPredecessor(this);
581 /// hasPredecessor - Return true if N is a predecessor of this node.
582 /// N is either an operand of this node, or can be reached by recursively
583 /// traversing up the operands.
584 /// NOTE: This is an expensive method. Use it carefully.
585 bool hasPredecessor(const SDNode *N) const;
587 /// hasPredecesorHelper - Return true if N is a predecessor of this node.
588 /// N is either an operand of this node, or can be reached by recursively
589 /// traversing up the operands.
590 /// In this helper the Visited and worklist sets are held externally to
591 /// cache predecessors over multiple invocations. If you want to test for
592 /// multiple predecessors this method is preferable to multiple calls to
593 /// hasPredecessor. Be sure to clear Visited and Worklist if the DAG
595 /// NOTE: This is still very expensive. Use carefully.
596 bool hasPredecessorHelper(const SDNode *N,
597 SmallPtrSetImpl<const SDNode *> &Visited,
598 SmallVectorImpl<const SDNode *> &Worklist) const;
600 /// getNumOperands - Return the number of values used by this operation.
602 unsigned getNumOperands() const { return NumOperands; }
604 /// getConstantOperandVal - Helper method returns the integer value of a
605 /// ConstantSDNode operand.
606 uint64_t getConstantOperandVal(unsigned Num) const;
608 const SDValue &getOperand(unsigned Num) const {
609 assert(Num < NumOperands && "Invalid child # of SDNode!");
610 return OperandList[Num];
613 typedef SDUse* op_iterator;
614 op_iterator op_begin() const { return OperandList; }
615 op_iterator op_end() const { return OperandList+NumOperands; }
616 ArrayRef<SDUse> ops() const { return makeArrayRef(op_begin(), op_end()); }
618 SDVTList getVTList() const {
619 SDVTList X = { ValueList, NumValues };
623 /// getGluedNode - If this node has a glue operand, return the node
624 /// to which the glue operand points. Otherwise return NULL.
625 SDNode *getGluedNode() const {
626 if (getNumOperands() != 0 &&
627 getOperand(getNumOperands()-1).getValueType() == MVT::Glue)
628 return getOperand(getNumOperands()-1).getNode();
632 // If this is a pseudo op, like copyfromreg, look to see if there is a
633 // real target node glued to it. If so, return the target node.
634 const SDNode *getGluedMachineNode() const {
635 const SDNode *FoundNode = this;
637 // Climb up glue edges until a machine-opcode node is found, or the
638 // end of the chain is reached.
639 while (!FoundNode->isMachineOpcode()) {
640 const SDNode *N = FoundNode->getGluedNode();
648 /// getGluedUser - If this node has a glue value with a user, return
649 /// the user (there is at most one). Otherwise return NULL.
650 SDNode *getGluedUser() const {
651 for (use_iterator UI = use_begin(), UE = use_end(); UI != UE; ++UI)
652 if (UI.getUse().get().getValueType() == MVT::Glue)
657 /// getNumValues - Return the number of values defined/returned by this
660 unsigned getNumValues() const { return NumValues; }
662 /// getValueType - Return the type of a specified result.
664 EVT getValueType(unsigned ResNo) const {
665 assert(ResNo < NumValues && "Illegal result number!");
666 return ValueList[ResNo];
669 /// Return the type of a specified result as a simple type.
671 MVT getSimpleValueType(unsigned ResNo) const {
672 return getValueType(ResNo).getSimpleVT();
675 /// getValueSizeInBits - Returns MVT::getSizeInBits(getValueType(ResNo)).
677 unsigned getValueSizeInBits(unsigned ResNo) const {
678 return getValueType(ResNo).getSizeInBits();
681 typedef const EVT* value_iterator;
682 value_iterator value_begin() const { return ValueList; }
683 value_iterator value_end() const { return ValueList+NumValues; }
685 /// getOperationName - Return the opcode of this operation for printing.
687 std::string getOperationName(const SelectionDAG *G = nullptr) const;
688 static const char* getIndexedModeName(ISD::MemIndexedMode AM);
689 void print_types(raw_ostream &OS, const SelectionDAG *G) const;
690 void print_details(raw_ostream &OS, const SelectionDAG *G) const;
691 void print(raw_ostream &OS, const SelectionDAG *G = nullptr) const;
692 void printr(raw_ostream &OS, const SelectionDAG *G = nullptr) const;
694 /// printrFull - Print a SelectionDAG node and all children down to
695 /// the leaves. The given SelectionDAG allows target-specific nodes
696 /// to be printed in human-readable form. Unlike printr, this will
697 /// print the whole DAG, including children that appear multiple
700 void printrFull(raw_ostream &O, const SelectionDAG *G = nullptr) const;
702 /// printrWithDepth - Print a SelectionDAG node and children up to
703 /// depth "depth." The given SelectionDAG allows target-specific
704 /// nodes to be printed in human-readable form. Unlike printr, this
705 /// will print children that appear multiple times wherever they are
708 void printrWithDepth(raw_ostream &O, const SelectionDAG *G = nullptr,
709 unsigned depth = 100) const;
712 /// dump - Dump this node, for debugging.
715 /// dumpr - Dump (recursively) this node and its use-def subgraph.
718 /// dump - Dump this node, for debugging.
719 /// The given SelectionDAG allows target-specific nodes to be printed
720 /// in human-readable form.
721 void dump(const SelectionDAG *G) const;
723 /// dumpr - Dump (recursively) this node and its use-def subgraph.
724 /// The given SelectionDAG allows target-specific nodes to be printed
725 /// in human-readable form.
726 void dumpr(const SelectionDAG *G) const;
728 /// dumprFull - printrFull to dbgs(). The given SelectionDAG allows
729 /// target-specific nodes to be printed in human-readable form.
730 /// Unlike dumpr, this will print the whole DAG, including children
731 /// that appear multiple times.
733 void dumprFull(const SelectionDAG *G = nullptr) const;
735 /// dumprWithDepth - printrWithDepth to dbgs(). The given
736 /// SelectionDAG allows target-specific nodes to be printed in
737 /// human-readable form. Unlike dumpr, this will print children
738 /// that appear multiple times wherever they are used.
740 void dumprWithDepth(const SelectionDAG *G = nullptr,
741 unsigned depth = 100) const;
743 /// Profile - Gather unique data for the node.
745 void Profile(FoldingSetNodeID &ID) const;
747 /// addUse - This method should only be used by the SDUse class.
749 void addUse(SDUse &U) { U.addToList(&UseList); }
752 static SDVTList getSDVTList(EVT VT) {
753 SDVTList Ret = { getValueTypeList(VT), 1 };
757 SDNode(unsigned Opc, unsigned Order, const DebugLoc dl, SDVTList VTs,
758 ArrayRef<SDValue> Ops)
759 : NodeType(Opc), OperandsNeedDelete(true), HasDebugValue(false),
760 SubclassData(0), NodeId(-1),
761 OperandList(Ops.size() ? new SDUse[Ops.size()] : nullptr),
762 ValueList(VTs.VTs), UseList(nullptr),
763 NumOperands(Ops.size()), NumValues(VTs.NumVTs),
764 debugLoc(dl), IROrder(Order) {
765 for (unsigned i = 0; i != Ops.size(); ++i) {
766 OperandList[i].setUser(this);
767 OperandList[i].setInitial(Ops[i]);
769 checkForCycles(this);
772 /// This constructor adds no operands itself; operands can be
773 /// set later with InitOperands.
774 SDNode(unsigned Opc, unsigned Order, const DebugLoc dl, SDVTList VTs)
775 : NodeType(Opc), OperandsNeedDelete(false), HasDebugValue(false),
776 SubclassData(0), NodeId(-1), OperandList(nullptr), ValueList(VTs.VTs),
777 UseList(nullptr), NumOperands(0), NumValues(VTs.NumVTs), debugLoc(dl),
780 /// InitOperands - Initialize the operands list of this with 1 operand.
781 void InitOperands(SDUse *Ops, const SDValue &Op0) {
782 Ops[0].setUser(this);
783 Ops[0].setInitial(Op0);
786 checkForCycles(this);
789 /// InitOperands - Initialize the operands list of this with 2 operands.
790 void InitOperands(SDUse *Ops, const SDValue &Op0, const SDValue &Op1) {
791 Ops[0].setUser(this);
792 Ops[0].setInitial(Op0);
793 Ops[1].setUser(this);
794 Ops[1].setInitial(Op1);
797 checkForCycles(this);
800 /// InitOperands - Initialize the operands list of this with 3 operands.
801 void InitOperands(SDUse *Ops, const SDValue &Op0, const SDValue &Op1,
802 const SDValue &Op2) {
803 Ops[0].setUser(this);
804 Ops[0].setInitial(Op0);
805 Ops[1].setUser(this);
806 Ops[1].setInitial(Op1);
807 Ops[2].setUser(this);
808 Ops[2].setInitial(Op2);
811 checkForCycles(this);
814 /// InitOperands - Initialize the operands list of this with 4 operands.
815 void InitOperands(SDUse *Ops, const SDValue &Op0, const SDValue &Op1,
816 const SDValue &Op2, const SDValue &Op3) {
817 Ops[0].setUser(this);
818 Ops[0].setInitial(Op0);
819 Ops[1].setUser(this);
820 Ops[1].setInitial(Op1);
821 Ops[2].setUser(this);
822 Ops[2].setInitial(Op2);
823 Ops[3].setUser(this);
824 Ops[3].setInitial(Op3);
827 checkForCycles(this);
830 /// InitOperands - Initialize the operands list of this with N operands.
831 void InitOperands(SDUse *Ops, const SDValue *Vals, unsigned N) {
832 for (unsigned i = 0; i != N; ++i) {
833 Ops[i].setUser(this);
834 Ops[i].setInitial(Vals[i]);
838 checkForCycles(this);
841 /// DropOperands - Release the operands and set this node to have
846 /// Wrapper class for IR location info (IR ordering and DebugLoc) to be passed
847 /// into SDNode creation functions.
848 /// When an SDNode is created from the DAGBuilder, the DebugLoc is extracted
849 /// from the original Instruction, and IROrder is the ordinal position of
851 /// When an SDNode is created after the DAG is being built, both DebugLoc and
852 /// the IROrder are propagated from the original SDNode.
853 /// So SDLoc class provides two constructors besides the default one, one to
854 /// be used by the DAGBuilder, the other to be used by others.
857 // Ptr could be used for either Instruction* or SDNode*. It is used for
858 // Instruction* if IROrder is not -1.
863 SDLoc() : Ptr(nullptr), IROrder(0) {}
864 SDLoc(const SDNode *N) : Ptr(N), IROrder(-1) {
865 assert(N && "null SDNode");
867 SDLoc(const SDValue V) : Ptr(V.getNode()), IROrder(-1) {
868 assert(Ptr && "null SDNode");
870 SDLoc(const Instruction *I, int Order) : Ptr(I), IROrder(Order) {
871 assert(Order >= 0 && "bad IROrder");
873 unsigned getIROrder() {
874 if (IROrder >= 0 || Ptr == nullptr) {
875 return (unsigned)IROrder;
877 const SDNode *N = (const SDNode*)(Ptr);
878 return N->getIROrder();
880 DebugLoc getDebugLoc() {
885 const Instruction *I = (const Instruction*)(Ptr);
886 return I->getDebugLoc();
888 const SDNode *N = (const SDNode*)(Ptr);
889 return N->getDebugLoc();
894 // Define inline functions from the SDValue class.
896 inline SDValue::SDValue(SDNode *node, unsigned resno)
897 : Node(node), ResNo(resno) {
898 assert((!Node || ResNo < Node->getNumValues()) &&
899 "Invalid result number for the given node!");
900 assert(ResNo < -2U && "Cannot use result numbers reserved for DenseMaps.");
903 inline unsigned SDValue::getOpcode() const {
904 return Node->getOpcode();
906 inline EVT SDValue::getValueType() const {
907 return Node->getValueType(ResNo);
909 inline unsigned SDValue::getNumOperands() const {
910 return Node->getNumOperands();
912 inline const SDValue &SDValue::getOperand(unsigned i) const {
913 return Node->getOperand(i);
915 inline uint64_t SDValue::getConstantOperandVal(unsigned i) const {
916 return Node->getConstantOperandVal(i);
918 inline bool SDValue::isTargetOpcode() const {
919 return Node->isTargetOpcode();
921 inline bool SDValue::isTargetMemoryOpcode() const {
922 return Node->isTargetMemoryOpcode();
924 inline bool SDValue::isMachineOpcode() const {
925 return Node->isMachineOpcode();
927 inline unsigned SDValue::getMachineOpcode() const {
928 return Node->getMachineOpcode();
930 inline bool SDValue::use_empty() const {
931 return !Node->hasAnyUseOfValue(ResNo);
933 inline bool SDValue::hasOneUse() const {
934 return Node->hasNUsesOfValue(1, ResNo);
936 inline const DebugLoc SDValue::getDebugLoc() const {
937 return Node->getDebugLoc();
939 inline void SDValue::dump() const {
942 inline void SDValue::dumpr() const {
943 return Node->dumpr();
945 // Define inline functions from the SDUse class.
947 inline void SDUse::set(const SDValue &V) {
948 if (Val.getNode()) removeFromList();
950 if (V.getNode()) V.getNode()->addUse(*this);
953 inline void SDUse::setInitial(const SDValue &V) {
955 V.getNode()->addUse(*this);
958 inline void SDUse::setNode(SDNode *N) {
959 if (Val.getNode()) removeFromList();
961 if (N) N->addUse(*this);
964 /// UnarySDNode - This class is used for single-operand SDNodes. This is solely
965 /// to allow co-allocation of node operands with the node itself.
966 class UnarySDNode : public SDNode {
969 UnarySDNode(unsigned Opc, unsigned Order, DebugLoc dl, SDVTList VTs,
971 : SDNode(Opc, Order, dl, VTs) {
972 InitOperands(&Op, X);
976 /// BinarySDNode - This class is used for two-operand SDNodes. This is solely
977 /// to allow co-allocation of node operands with the node itself.
978 class BinarySDNode : public SDNode {
981 BinarySDNode(unsigned Opc, unsigned Order, DebugLoc dl, SDVTList VTs,
982 SDValue X, SDValue Y)
983 : SDNode(Opc, Order, dl, VTs) {
984 InitOperands(Ops, X, Y);
988 /// BinaryWithFlagsSDNode - This class is an extension of BinarySDNode
989 /// used from those opcodes that have associated extra flags.
990 class BinaryWithFlagsSDNode : public BinarySDNode {
991 enum { NUW = (1 << 0), NSW = (1 << 1), EXACT = (1 << 2) };
994 BinaryWithFlagsSDNode(unsigned Opc, unsigned Order, DebugLoc dl, SDVTList VTs,
995 SDValue X, SDValue Y)
996 : BinarySDNode(Opc, Order, dl, VTs, X, Y) {}
997 /// getRawSubclassData - Return the SubclassData value, which contains an
998 /// encoding of the flags.
999 /// This function should be used to add subclass data to the NodeID value.
1000 unsigned getRawSubclassData() const { return SubclassData; }
1001 void setHasNoUnsignedWrap(bool b) {
1002 SubclassData = (SubclassData & ~NUW) | (b ? NUW : 0);
1004 void setHasNoSignedWrap(bool b) {
1005 SubclassData = (SubclassData & ~NSW) | (b ? NSW : 0);
1007 void setIsExact(bool b) {
1008 SubclassData = (SubclassData & ~EXACT) | (b ? EXACT : 0);
1010 bool hasNoUnsignedWrap() const { return SubclassData & NUW; }
1011 bool hasNoSignedWrap() const { return SubclassData & NSW; }
1012 bool isExact() const { return SubclassData & EXACT; }
1013 static bool classof(const SDNode *N) {
1014 return isBinOpWithFlags(N->getOpcode());
1018 /// TernarySDNode - This class is used for three-operand SDNodes. This is solely
1019 /// to allow co-allocation of node operands with the node itself.
1020 class TernarySDNode : public SDNode {
1023 TernarySDNode(unsigned Opc, unsigned Order, DebugLoc dl, SDVTList VTs,
1024 SDValue X, SDValue Y, SDValue Z)
1025 : SDNode(Opc, Order, dl, VTs) {
1026 InitOperands(Ops, X, Y, Z);
1031 /// HandleSDNode - This class is used to form a handle around another node that
1032 /// is persistent and is updated across invocations of replaceAllUsesWith on its
1033 /// operand. This node should be directly created by end-users and not added to
1034 /// the AllNodes list.
1035 class HandleSDNode : public SDNode {
1038 explicit HandleSDNode(SDValue X)
1039 : SDNode(ISD::HANDLENODE, 0, DebugLoc(), getSDVTList(MVT::Other)) {
1040 InitOperands(&Op, X);
1043 const SDValue &getValue() const { return Op; }
1046 class AddrSpaceCastSDNode : public UnarySDNode {
1048 unsigned SrcAddrSpace;
1049 unsigned DestAddrSpace;
1052 AddrSpaceCastSDNode(unsigned Order, DebugLoc dl, EVT VT, SDValue X,
1053 unsigned SrcAS, unsigned DestAS);
1055 unsigned getSrcAddressSpace() const { return SrcAddrSpace; }
1056 unsigned getDestAddressSpace() const { return DestAddrSpace; }
1058 static bool classof(const SDNode *N) {
1059 return N->getOpcode() == ISD::ADDRSPACECAST;
1063 /// Abstact virtual class for operations for memory operations
1064 class MemSDNode : public SDNode {
1066 // MemoryVT - VT of in-memory value.
1070 /// MMO - Memory reference information.
1071 MachineMemOperand *MMO;
1074 MemSDNode(unsigned Opc, unsigned Order, DebugLoc dl, SDVTList VTs,
1075 EVT MemoryVT, MachineMemOperand *MMO);
1077 MemSDNode(unsigned Opc, unsigned Order, DebugLoc dl, SDVTList VTs,
1078 ArrayRef<SDValue> Ops, EVT MemoryVT, MachineMemOperand *MMO);
1080 bool readMem() const { return MMO->isLoad(); }
1081 bool writeMem() const { return MMO->isStore(); }
1083 /// Returns alignment and volatility of the memory access
1084 unsigned getOriginalAlignment() const {
1085 return MMO->getBaseAlignment();
1087 unsigned getAlignment() const {
1088 return MMO->getAlignment();
1091 /// getRawSubclassData - Return the SubclassData value, which contains an
1092 /// encoding of the volatile flag, as well as bits used by subclasses. This
1093 /// function should only be used to compute a FoldingSetNodeID value.
1094 unsigned getRawSubclassData() const {
1095 return SubclassData;
1098 // We access subclass data here so that we can check consistency
1099 // with MachineMemOperand information.
1100 bool isVolatile() const { return (SubclassData >> 5) & 1; }
1101 bool isNonTemporal() const { return (SubclassData >> 6) & 1; }
1102 bool isInvariant() const { return (SubclassData >> 7) & 1; }
1104 AtomicOrdering getOrdering() const {
1105 return AtomicOrdering((SubclassData >> 8) & 15);
1107 SynchronizationScope getSynchScope() const {
1108 return SynchronizationScope((SubclassData >> 12) & 1);
1111 // Returns the offset from the location of the access.
1112 int64_t getSrcValueOffset() const { return MMO->getOffset(); }
1114 /// Returns the AA info that describes the dereference.
1115 AAMDNodes getAAInfo() const { return MMO->getAAInfo(); }
1117 /// Returns the Ranges that describes the dereference.
1118 const MDNode *getRanges() const { return MMO->getRanges(); }
1120 /// getMemoryVT - Return the type of the in-memory value.
1121 EVT getMemoryVT() const { return MemoryVT; }
1123 /// getMemOperand - Return a MachineMemOperand object describing the memory
1124 /// reference performed by operation.
1125 MachineMemOperand *getMemOperand() const { return MMO; }
1127 const MachinePointerInfo &getPointerInfo() const {
1128 return MMO->getPointerInfo();
1131 /// getAddressSpace - Return the address space for the associated pointer
1132 unsigned getAddressSpace() const {
1133 return getPointerInfo().getAddrSpace();
1136 /// refineAlignment - Update this MemSDNode's MachineMemOperand information
1137 /// to reflect the alignment of NewMMO, if it has a greater alignment.
1138 /// This must only be used when the new alignment applies to all users of
1139 /// this MachineMemOperand.
1140 void refineAlignment(const MachineMemOperand *NewMMO) {
1141 MMO->refineAlignment(NewMMO);
1144 const SDValue &getChain() const { return getOperand(0); }
1145 const SDValue &getBasePtr() const {
1146 return getOperand(getOpcode() == ISD::STORE ? 2 : 1);
1149 // Methods to support isa and dyn_cast
1150 static bool classof(const SDNode *N) {
1151 // For some targets, we lower some target intrinsics to a MemIntrinsicNode
1152 // with either an intrinsic or a target opcode.
1153 return N->getOpcode() == ISD::LOAD ||
1154 N->getOpcode() == ISD::STORE ||
1155 N->getOpcode() == ISD::PREFETCH ||
1156 N->getOpcode() == ISD::ATOMIC_CMP_SWAP ||
1157 N->getOpcode() == ISD::ATOMIC_CMP_SWAP_WITH_SUCCESS ||
1158 N->getOpcode() == ISD::ATOMIC_SWAP ||
1159 N->getOpcode() == ISD::ATOMIC_LOAD_ADD ||
1160 N->getOpcode() == ISD::ATOMIC_LOAD_SUB ||
1161 N->getOpcode() == ISD::ATOMIC_LOAD_AND ||
1162 N->getOpcode() == ISD::ATOMIC_LOAD_OR ||
1163 N->getOpcode() == ISD::ATOMIC_LOAD_XOR ||
1164 N->getOpcode() == ISD::ATOMIC_LOAD_NAND ||
1165 N->getOpcode() == ISD::ATOMIC_LOAD_MIN ||
1166 N->getOpcode() == ISD::ATOMIC_LOAD_MAX ||
1167 N->getOpcode() == ISD::ATOMIC_LOAD_UMIN ||
1168 N->getOpcode() == ISD::ATOMIC_LOAD_UMAX ||
1169 N->getOpcode() == ISD::ATOMIC_LOAD ||
1170 N->getOpcode() == ISD::ATOMIC_STORE ||
1171 N->isMemIntrinsic() ||
1172 N->isTargetMemoryOpcode();
1176 /// AtomicSDNode - A SDNode reprenting atomic operations.
1178 class AtomicSDNode : public MemSDNode {
1181 /// For cmpxchg instructions, the ordering requirements when a store does not
1183 AtomicOrdering FailureOrdering;
1185 void InitAtomic(AtomicOrdering SuccessOrdering,
1186 AtomicOrdering FailureOrdering,
1187 SynchronizationScope SynchScope) {
1188 // This must match encodeMemSDNodeFlags() in SelectionDAG.cpp.
1189 assert((SuccessOrdering & 15) == SuccessOrdering &&
1190 "Ordering may not require more than 4 bits!");
1191 assert((FailureOrdering & 15) == FailureOrdering &&
1192 "Ordering may not require more than 4 bits!");
1193 assert((SynchScope & 1) == SynchScope &&
1194 "SynchScope may not require more than 1 bit!");
1195 SubclassData |= SuccessOrdering << 8;
1196 SubclassData |= SynchScope << 12;
1197 this->FailureOrdering = FailureOrdering;
1198 assert(getSuccessOrdering() == SuccessOrdering &&
1199 "Ordering encoding error!");
1200 assert(getFailureOrdering() == FailureOrdering &&
1201 "Ordering encoding error!");
1202 assert(getSynchScope() == SynchScope && "Synch-scope encoding error!");
1206 // Opc: opcode for atomic
1207 // VTL: value type list
1208 // Chain: memory chain for operaand
1209 // Ptr: address to update as a SDValue
1210 // Cmp: compare value
1212 // SrcVal: address to update as a Value (used for MemOperand)
1213 // Align: alignment of memory
1214 AtomicSDNode(unsigned Opc, unsigned Order, DebugLoc dl, SDVTList VTL,
1215 EVT MemVT, SDValue Chain, SDValue Ptr, SDValue Cmp, SDValue Swp,
1216 MachineMemOperand *MMO, AtomicOrdering Ordering,
1217 SynchronizationScope SynchScope)
1218 : MemSDNode(Opc, Order, dl, VTL, MemVT, MMO) {
1219 InitAtomic(Ordering, Ordering, SynchScope);
1220 InitOperands(Ops, Chain, Ptr, Cmp, Swp);
1222 AtomicSDNode(unsigned Opc, unsigned Order, DebugLoc dl, SDVTList VTL,
1224 SDValue Chain, SDValue Ptr,
1225 SDValue Val, MachineMemOperand *MMO,
1226 AtomicOrdering Ordering, SynchronizationScope SynchScope)
1227 : MemSDNode(Opc, Order, dl, VTL, MemVT, MMO) {
1228 InitAtomic(Ordering, Ordering, SynchScope);
1229 InitOperands(Ops, Chain, Ptr, Val);
1231 AtomicSDNode(unsigned Opc, unsigned Order, DebugLoc dl, SDVTList VTL,
1233 SDValue Chain, SDValue Ptr,
1234 MachineMemOperand *MMO,
1235 AtomicOrdering Ordering, SynchronizationScope SynchScope)
1236 : MemSDNode(Opc, Order, dl, VTL, MemVT, MMO) {
1237 InitAtomic(Ordering, Ordering, SynchScope);
1238 InitOperands(Ops, Chain, Ptr);
1240 AtomicSDNode(unsigned Opc, unsigned Order, DebugLoc dl, SDVTList VTL, EVT MemVT,
1241 const SDValue* AllOps, SDUse *DynOps, unsigned NumOps,
1242 MachineMemOperand *MMO,
1243 AtomicOrdering SuccessOrdering, AtomicOrdering FailureOrdering,
1244 SynchronizationScope SynchScope)
1245 : MemSDNode(Opc, Order, dl, VTL, MemVT, MMO) {
1246 InitAtomic(SuccessOrdering, FailureOrdering, SynchScope);
1247 assert((DynOps || NumOps <= array_lengthof(Ops)) &&
1248 "Too many ops for internal storage!");
1249 InitOperands(DynOps ? DynOps : Ops, AllOps, NumOps);
1252 const SDValue &getBasePtr() const { return getOperand(1); }
1253 const SDValue &getVal() const { return getOperand(2); }
1255 AtomicOrdering getSuccessOrdering() const {
1256 return getOrdering();
1259 // Not quite enough room in SubclassData for everything, so failure gets its
1261 AtomicOrdering getFailureOrdering() const {
1262 return FailureOrdering;
1265 bool isCompareAndSwap() const {
1266 unsigned Op = getOpcode();
1267 return Op == ISD::ATOMIC_CMP_SWAP || Op == ISD::ATOMIC_CMP_SWAP_WITH_SUCCESS;
1270 // Methods to support isa and dyn_cast
1271 static bool classof(const SDNode *N) {
1272 return N->getOpcode() == ISD::ATOMIC_CMP_SWAP ||
1273 N->getOpcode() == ISD::ATOMIC_CMP_SWAP_WITH_SUCCESS ||
1274 N->getOpcode() == ISD::ATOMIC_SWAP ||
1275 N->getOpcode() == ISD::ATOMIC_LOAD_ADD ||
1276 N->getOpcode() == ISD::ATOMIC_LOAD_SUB ||
1277 N->getOpcode() == ISD::ATOMIC_LOAD_AND ||
1278 N->getOpcode() == ISD::ATOMIC_LOAD_OR ||
1279 N->getOpcode() == ISD::ATOMIC_LOAD_XOR ||
1280 N->getOpcode() == ISD::ATOMIC_LOAD_NAND ||
1281 N->getOpcode() == ISD::ATOMIC_LOAD_MIN ||
1282 N->getOpcode() == ISD::ATOMIC_LOAD_MAX ||
1283 N->getOpcode() == ISD::ATOMIC_LOAD_UMIN ||
1284 N->getOpcode() == ISD::ATOMIC_LOAD_UMAX ||
1285 N->getOpcode() == ISD::ATOMIC_LOAD ||
1286 N->getOpcode() == ISD::ATOMIC_STORE;
1290 /// MemIntrinsicSDNode - This SDNode is used for target intrinsics that touch
1291 /// memory and need an associated MachineMemOperand. Its opcode may be
1292 /// INTRINSIC_VOID, INTRINSIC_W_CHAIN, PREFETCH, or a target-specific opcode
1293 /// with a value not less than FIRST_TARGET_MEMORY_OPCODE.
1294 class MemIntrinsicSDNode : public MemSDNode {
1296 MemIntrinsicSDNode(unsigned Opc, unsigned Order, DebugLoc dl, SDVTList VTs,
1297 ArrayRef<SDValue> Ops, EVT MemoryVT,
1298 MachineMemOperand *MMO)
1299 : MemSDNode(Opc, Order, dl, VTs, Ops, MemoryVT, MMO) {
1300 SubclassData |= 1u << 13;
1303 // Methods to support isa and dyn_cast
1304 static bool classof(const SDNode *N) {
1305 // We lower some target intrinsics to their target opcode
1306 // early a node with a target opcode can be of this class
1307 return N->isMemIntrinsic() ||
1308 N->getOpcode() == ISD::PREFETCH ||
1309 N->isTargetMemoryOpcode();
1313 /// ShuffleVectorSDNode - This SDNode is used to implement the code generator
1314 /// support for the llvm IR shufflevector instruction. It combines elements
1315 /// from two input vectors into a new input vector, with the selection and
1316 /// ordering of elements determined by an array of integers, referred to as
1317 /// the shuffle mask. For input vectors of width N, mask indices of 0..N-1
1318 /// refer to elements from the LHS input, and indices from N to 2N-1 the RHS.
1319 /// An index of -1 is treated as undef, such that the code generator may put
1320 /// any value in the corresponding element of the result.
1321 class ShuffleVectorSDNode : public SDNode {
1324 // The memory for Mask is owned by the SelectionDAG's OperandAllocator, and
1325 // is freed when the SelectionDAG object is destroyed.
1328 friend class SelectionDAG;
1329 ShuffleVectorSDNode(EVT VT, unsigned Order, DebugLoc dl, SDValue N1,
1330 SDValue N2, const int *M)
1331 : SDNode(ISD::VECTOR_SHUFFLE, Order, dl, getSDVTList(VT)), Mask(M) {
1332 InitOperands(Ops, N1, N2);
1336 ArrayRef<int> getMask() const {
1337 EVT VT = getValueType(0);
1338 return makeArrayRef(Mask, VT.getVectorNumElements());
1340 int getMaskElt(unsigned Idx) const {
1341 assert(Idx < getValueType(0).getVectorNumElements() && "Idx out of range!");
1345 bool isSplat() const { return isSplatMask(Mask, getValueType(0)); }
1346 int getSplatIndex() const {
1347 assert(isSplat() && "Cannot get splat index for non-splat!");
1348 EVT VT = getValueType(0);
1349 for (unsigned i = 0, e = VT.getVectorNumElements(); i != e; ++i) {
1353 llvm_unreachable("Splat with all undef indices?");
1355 static bool isSplatMask(const int *Mask, EVT VT);
1357 static bool classof(const SDNode *N) {
1358 return N->getOpcode() == ISD::VECTOR_SHUFFLE;
1362 class ConstantSDNode : public SDNode {
1363 const ConstantInt *Value;
1364 friend class SelectionDAG;
1365 ConstantSDNode(bool isTarget, bool isOpaque, const ConstantInt *val, EVT VT)
1366 : SDNode(isTarget ? ISD::TargetConstant : ISD::Constant,
1367 0, DebugLoc(), getSDVTList(VT)), Value(val) {
1368 SubclassData |= (uint16_t)isOpaque;
1372 const ConstantInt *getConstantIntValue() const { return Value; }
1373 const APInt &getAPIntValue() const { return Value->getValue(); }
1374 uint64_t getZExtValue() const { return Value->getZExtValue(); }
1375 int64_t getSExtValue() const { return Value->getSExtValue(); }
1377 bool isOne() const { return Value->isOne(); }
1378 bool isNullValue() const { return Value->isNullValue(); }
1379 bool isAllOnesValue() const { return Value->isAllOnesValue(); }
1381 bool isOpaque() const { return SubclassData & 1; }
1383 static bool classof(const SDNode *N) {
1384 return N->getOpcode() == ISD::Constant ||
1385 N->getOpcode() == ISD::TargetConstant;
1389 class ConstantFPSDNode : public SDNode {
1390 const ConstantFP *Value;
1391 friend class SelectionDAG;
1392 ConstantFPSDNode(bool isTarget, const ConstantFP *val, EVT VT)
1393 : SDNode(isTarget ? ISD::TargetConstantFP : ISD::ConstantFP,
1394 0, DebugLoc(), getSDVTList(VT)), Value(val) {
1398 const APFloat& getValueAPF() const { return Value->getValueAPF(); }
1399 const ConstantFP *getConstantFPValue() const { return Value; }
1401 /// isZero - Return true if the value is positive or negative zero.
1402 bool isZero() const { return Value->isZero(); }
1404 /// isNaN - Return true if the value is a NaN.
1405 bool isNaN() const { return Value->isNaN(); }
1407 /// isExactlyValue - We don't rely on operator== working on double values, as
1408 /// it returns true for things that are clearly not equal, like -0.0 and 0.0.
1409 /// As such, this method can be used to do an exact bit-for-bit comparison of
1410 /// two floating point values.
1412 /// We leave the version with the double argument here because it's just so
1413 /// convenient to write "2.0" and the like. Without this function we'd
1414 /// have to duplicate its logic everywhere it's called.
1415 bool isExactlyValue(double V) const {
1418 Tmp.convert(Value->getValueAPF().getSemantics(),
1419 APFloat::rmNearestTiesToEven, &ignored);
1420 return isExactlyValue(Tmp);
1422 bool isExactlyValue(const APFloat& V) const;
1424 static bool isValueValidForType(EVT VT, const APFloat& Val);
1426 static bool classof(const SDNode *N) {
1427 return N->getOpcode() == ISD::ConstantFP ||
1428 N->getOpcode() == ISD::TargetConstantFP;
1432 class GlobalAddressSDNode : public SDNode {
1433 const GlobalValue *TheGlobal;
1435 unsigned char TargetFlags;
1436 friend class SelectionDAG;
1437 GlobalAddressSDNode(unsigned Opc, unsigned Order, DebugLoc DL,
1438 const GlobalValue *GA, EVT VT, int64_t o,
1439 unsigned char TargetFlags);
1442 const GlobalValue *getGlobal() const { return TheGlobal; }
1443 int64_t getOffset() const { return Offset; }
1444 unsigned char getTargetFlags() const { return TargetFlags; }
1445 // Return the address space this GlobalAddress belongs to.
1446 unsigned getAddressSpace() const;
1448 static bool classof(const SDNode *N) {
1449 return N->getOpcode() == ISD::GlobalAddress ||
1450 N->getOpcode() == ISD::TargetGlobalAddress ||
1451 N->getOpcode() == ISD::GlobalTLSAddress ||
1452 N->getOpcode() == ISD::TargetGlobalTLSAddress;
1456 class FrameIndexSDNode : public SDNode {
1458 friend class SelectionDAG;
1459 FrameIndexSDNode(int fi, EVT VT, bool isTarg)
1460 : SDNode(isTarg ? ISD::TargetFrameIndex : ISD::FrameIndex,
1461 0, DebugLoc(), getSDVTList(VT)), FI(fi) {
1465 int getIndex() const { return FI; }
1467 static bool classof(const SDNode *N) {
1468 return N->getOpcode() == ISD::FrameIndex ||
1469 N->getOpcode() == ISD::TargetFrameIndex;
1473 class JumpTableSDNode : public SDNode {
1475 unsigned char TargetFlags;
1476 friend class SelectionDAG;
1477 JumpTableSDNode(int jti, EVT VT, bool isTarg, unsigned char TF)
1478 : SDNode(isTarg ? ISD::TargetJumpTable : ISD::JumpTable,
1479 0, DebugLoc(), getSDVTList(VT)), JTI(jti), TargetFlags(TF) {
1483 int getIndex() const { return JTI; }
1484 unsigned char getTargetFlags() const { return TargetFlags; }
1486 static bool classof(const SDNode *N) {
1487 return N->getOpcode() == ISD::JumpTable ||
1488 N->getOpcode() == ISD::TargetJumpTable;
1492 class ConstantPoolSDNode : public SDNode {
1494 const Constant *ConstVal;
1495 MachineConstantPoolValue *MachineCPVal;
1497 int Offset; // It's a MachineConstantPoolValue if top bit is set.
1498 unsigned Alignment; // Minimum alignment requirement of CP (not log2 value).
1499 unsigned char TargetFlags;
1500 friend class SelectionDAG;
1501 ConstantPoolSDNode(bool isTarget, const Constant *c, EVT VT, int o,
1502 unsigned Align, unsigned char TF)
1503 : SDNode(isTarget ? ISD::TargetConstantPool : ISD::ConstantPool, 0,
1504 DebugLoc(), getSDVTList(VT)), Offset(o), Alignment(Align),
1506 assert(Offset >= 0 && "Offset is too large");
1509 ConstantPoolSDNode(bool isTarget, MachineConstantPoolValue *v,
1510 EVT VT, int o, unsigned Align, unsigned char TF)
1511 : SDNode(isTarget ? ISD::TargetConstantPool : ISD::ConstantPool, 0,
1512 DebugLoc(), getSDVTList(VT)), Offset(o), Alignment(Align),
1514 assert(Offset >= 0 && "Offset is too large");
1515 Val.MachineCPVal = v;
1516 Offset |= 1 << (sizeof(unsigned)*CHAR_BIT-1);
1520 bool isMachineConstantPoolEntry() const {
1524 const Constant *getConstVal() const {
1525 assert(!isMachineConstantPoolEntry() && "Wrong constantpool type");
1526 return Val.ConstVal;
1529 MachineConstantPoolValue *getMachineCPVal() const {
1530 assert(isMachineConstantPoolEntry() && "Wrong constantpool type");
1531 return Val.MachineCPVal;
1534 int getOffset() const {
1535 return Offset & ~(1 << (sizeof(unsigned)*CHAR_BIT-1));
1538 // Return the alignment of this constant pool object, which is either 0 (for
1539 // default alignment) or the desired value.
1540 unsigned getAlignment() const { return Alignment; }
1541 unsigned char getTargetFlags() const { return TargetFlags; }
1543 Type *getType() const;
1545 static bool classof(const SDNode *N) {
1546 return N->getOpcode() == ISD::ConstantPool ||
1547 N->getOpcode() == ISD::TargetConstantPool;
1551 /// Completely target-dependent object reference.
1552 class TargetIndexSDNode : public SDNode {
1553 unsigned char TargetFlags;
1556 friend class SelectionDAG;
1559 TargetIndexSDNode(int Idx, EVT VT, int64_t Ofs, unsigned char TF)
1560 : SDNode(ISD::TargetIndex, 0, DebugLoc(), getSDVTList(VT)),
1561 TargetFlags(TF), Index(Idx), Offset(Ofs) {}
1564 unsigned char getTargetFlags() const { return TargetFlags; }
1565 int getIndex() const { return Index; }
1566 int64_t getOffset() const { return Offset; }
1568 static bool classof(const SDNode *N) {
1569 return N->getOpcode() == ISD::TargetIndex;
1573 class BasicBlockSDNode : public SDNode {
1574 MachineBasicBlock *MBB;
1575 friend class SelectionDAG;
1576 /// Debug info is meaningful and potentially useful here, but we create
1577 /// blocks out of order when they're jumped to, which makes it a bit
1578 /// harder. Let's see if we need it first.
1579 explicit BasicBlockSDNode(MachineBasicBlock *mbb)
1580 : SDNode(ISD::BasicBlock, 0, DebugLoc(), getSDVTList(MVT::Other)), MBB(mbb)
1584 MachineBasicBlock *getBasicBlock() const { return MBB; }
1586 static bool classof(const SDNode *N) {
1587 return N->getOpcode() == ISD::BasicBlock;
1591 /// BuildVectorSDNode - A "pseudo-class" with methods for operating on
1593 class BuildVectorSDNode : public SDNode {
1594 // These are constructed as SDNodes and then cast to BuildVectorSDNodes.
1595 explicit BuildVectorSDNode() LLVM_DELETED_FUNCTION;
1597 /// isConstantSplat - Check if this is a constant splat, and if so, find the
1598 /// smallest element size that splats the vector. If MinSplatBits is
1599 /// nonzero, the element size must be at least that large. Note that the
1600 /// splat element may be the entire vector (i.e., a one element vector).
1601 /// Returns the splat element value in SplatValue. Any undefined bits in
1602 /// that value are zero, and the corresponding bits in the SplatUndef mask
1603 /// are set. The SplatBitSize value is set to the splat element size in
1604 /// bits. HasAnyUndefs is set to true if any bits in the vector are
1605 /// undefined. isBigEndian describes the endianness of the target.
1606 bool isConstantSplat(APInt &SplatValue, APInt &SplatUndef,
1607 unsigned &SplatBitSize, bool &HasAnyUndefs,
1608 unsigned MinSplatBits = 0,
1609 bool isBigEndian = false) const;
1611 /// \brief Returns the splatted value or a null value if this is not a splat.
1613 /// If passed a non-null UndefElements bitvector, it will resize it to match
1614 /// the vector width and set the bits where elements are undef.
1615 SDValue getSplatValue(BitVector *UndefElements = nullptr) const;
1617 /// \brief Returns the splatted constant or null if this is not a constant
1620 /// If passed a non-null UndefElements bitvector, it will resize it to match
1621 /// the vector width and set the bits where elements are undef.
1623 getConstantSplatNode(BitVector *UndefElements = nullptr) const;
1625 /// \brief Returns the splatted constant FP or null if this is not a constant
1628 /// If passed a non-null UndefElements bitvector, it will resize it to match
1629 /// the vector width and set the bits where elements are undef.
1631 getConstantFPSplatNode(BitVector *UndefElements = nullptr) const;
1633 bool isConstant() const;
1635 static inline bool classof(const SDNode *N) {
1636 return N->getOpcode() == ISD::BUILD_VECTOR;
1640 /// SrcValueSDNode - An SDNode that holds an arbitrary LLVM IR Value. This is
1641 /// used when the SelectionDAG needs to make a simple reference to something
1642 /// in the LLVM IR representation.
1644 class SrcValueSDNode : public SDNode {
1646 friend class SelectionDAG;
1647 /// Create a SrcValue for a general value.
1648 explicit SrcValueSDNode(const Value *v)
1649 : SDNode(ISD::SRCVALUE, 0, DebugLoc(), getSDVTList(MVT::Other)), V(v) {}
1652 /// getValue - return the contained Value.
1653 const Value *getValue() const { return V; }
1655 static bool classof(const SDNode *N) {
1656 return N->getOpcode() == ISD::SRCVALUE;
1660 class MDNodeSDNode : public SDNode {
1662 friend class SelectionDAG;
1663 explicit MDNodeSDNode(const MDNode *md)
1664 : SDNode(ISD::MDNODE_SDNODE, 0, DebugLoc(), getSDVTList(MVT::Other)), MD(md)
1668 const MDNode *getMD() const { return MD; }
1670 static bool classof(const SDNode *N) {
1671 return N->getOpcode() == ISD::MDNODE_SDNODE;
1675 class RegisterSDNode : public SDNode {
1677 friend class SelectionDAG;
1678 RegisterSDNode(unsigned reg, EVT VT)
1679 : SDNode(ISD::Register, 0, DebugLoc(), getSDVTList(VT)), Reg(reg) {
1683 unsigned getReg() const { return Reg; }
1685 static bool classof(const SDNode *N) {
1686 return N->getOpcode() == ISD::Register;
1690 class RegisterMaskSDNode : public SDNode {
1691 // The memory for RegMask is not owned by the node.
1692 const uint32_t *RegMask;
1693 friend class SelectionDAG;
1694 RegisterMaskSDNode(const uint32_t *mask)
1695 : SDNode(ISD::RegisterMask, 0, DebugLoc(), getSDVTList(MVT::Untyped)),
1699 const uint32_t *getRegMask() const { return RegMask; }
1701 static bool classof(const SDNode *N) {
1702 return N->getOpcode() == ISD::RegisterMask;
1706 class BlockAddressSDNode : public SDNode {
1707 const BlockAddress *BA;
1709 unsigned char TargetFlags;
1710 friend class SelectionDAG;
1711 BlockAddressSDNode(unsigned NodeTy, EVT VT, const BlockAddress *ba,
1712 int64_t o, unsigned char Flags)
1713 : SDNode(NodeTy, 0, DebugLoc(), getSDVTList(VT)),
1714 BA(ba), Offset(o), TargetFlags(Flags) {
1717 const BlockAddress *getBlockAddress() const { return BA; }
1718 int64_t getOffset() const { return Offset; }
1719 unsigned char getTargetFlags() const { return TargetFlags; }
1721 static bool classof(const SDNode *N) {
1722 return N->getOpcode() == ISD::BlockAddress ||
1723 N->getOpcode() == ISD::TargetBlockAddress;
1727 class EHLabelSDNode : public SDNode {
1730 friend class SelectionDAG;
1731 EHLabelSDNode(unsigned Order, DebugLoc dl, SDValue ch, MCSymbol *L)
1732 : SDNode(ISD::EH_LABEL, Order, dl, getSDVTList(MVT::Other)), Label(L) {
1733 InitOperands(&Chain, ch);
1736 MCSymbol *getLabel() const { return Label; }
1738 static bool classof(const SDNode *N) {
1739 return N->getOpcode() == ISD::EH_LABEL;
1743 class ExternalSymbolSDNode : public SDNode {
1745 unsigned char TargetFlags;
1747 friend class SelectionDAG;
1748 ExternalSymbolSDNode(bool isTarget, const char *Sym, unsigned char TF, EVT VT)
1749 : SDNode(isTarget ? ISD::TargetExternalSymbol : ISD::ExternalSymbol,
1750 0, DebugLoc(), getSDVTList(VT)), Symbol(Sym), TargetFlags(TF) {
1754 const char *getSymbol() const { return Symbol; }
1755 unsigned char getTargetFlags() const { return TargetFlags; }
1757 static bool classof(const SDNode *N) {
1758 return N->getOpcode() == ISD::ExternalSymbol ||
1759 N->getOpcode() == ISD::TargetExternalSymbol;
1763 class CondCodeSDNode : public SDNode {
1764 ISD::CondCode Condition;
1765 friend class SelectionDAG;
1766 explicit CondCodeSDNode(ISD::CondCode Cond)
1767 : SDNode(ISD::CONDCODE, 0, DebugLoc(), getSDVTList(MVT::Other)),
1772 ISD::CondCode get() const { return Condition; }
1774 static bool classof(const SDNode *N) {
1775 return N->getOpcode() == ISD::CONDCODE;
1779 /// CvtRndSatSDNode - NOTE: avoid using this node as this may disappear in the
1780 /// future and most targets don't support it.
1781 class CvtRndSatSDNode : public SDNode {
1782 ISD::CvtCode CvtCode;
1783 friend class SelectionDAG;
1784 explicit CvtRndSatSDNode(EVT VT, unsigned Order, DebugLoc dl,
1785 ArrayRef<SDValue> Ops, ISD::CvtCode Code)
1786 : SDNode(ISD::CONVERT_RNDSAT, Order, dl, getSDVTList(VT), Ops),
1788 assert(Ops.size() == 5 && "wrong number of operations");
1791 ISD::CvtCode getCvtCode() const { return CvtCode; }
1793 static bool classof(const SDNode *N) {
1794 return N->getOpcode() == ISD::CONVERT_RNDSAT;
1798 /// VTSDNode - This class is used to represent EVT's, which are used
1799 /// to parameterize some operations.
1800 class VTSDNode : public SDNode {
1802 friend class SelectionDAG;
1803 explicit VTSDNode(EVT VT)
1804 : SDNode(ISD::VALUETYPE, 0, DebugLoc(), getSDVTList(MVT::Other)),
1809 EVT getVT() const { return ValueType; }
1811 static bool classof(const SDNode *N) {
1812 return N->getOpcode() == ISD::VALUETYPE;
1816 /// LSBaseSDNode - Base class for LoadSDNode and StoreSDNode
1818 class LSBaseSDNode : public MemSDNode {
1819 //! Operand array for load and store
1821 \note Moving this array to the base class captures more
1822 common functionality shared between LoadSDNode and
1827 LSBaseSDNode(ISD::NodeType NodeTy, unsigned Order, DebugLoc dl,
1828 SDValue *Operands, unsigned numOperands,
1829 SDVTList VTs, ISD::MemIndexedMode AM, EVT MemVT,
1830 MachineMemOperand *MMO)
1831 : MemSDNode(NodeTy, Order, dl, VTs, MemVT, MMO) {
1832 SubclassData |= AM << 2;
1833 assert(getAddressingMode() == AM && "MemIndexedMode encoding error!");
1834 InitOperands(Ops, Operands, numOperands);
1835 assert((getOffset().getOpcode() == ISD::UNDEF || isIndexed()) &&
1836 "Only indexed loads and stores have a non-undef offset operand");
1839 const SDValue &getOffset() const {
1840 return getOperand(getOpcode() == ISD::LOAD ? 2 : 3);
1843 /// getAddressingMode - Return the addressing mode for this load or store:
1844 /// unindexed, pre-inc, pre-dec, post-inc, or post-dec.
1845 ISD::MemIndexedMode getAddressingMode() const {
1846 return ISD::MemIndexedMode((SubclassData >> 2) & 7);
1849 /// isIndexed - Return true if this is a pre/post inc/dec load/store.
1850 bool isIndexed() const { return getAddressingMode() != ISD::UNINDEXED; }
1852 /// isUnindexed - Return true if this is NOT a pre/post inc/dec load/store.
1853 bool isUnindexed() const { return getAddressingMode() == ISD::UNINDEXED; }
1855 static bool classof(const SDNode *N) {
1856 return N->getOpcode() == ISD::LOAD ||
1857 N->getOpcode() == ISD::STORE;
1861 /// LoadSDNode - This class is used to represent ISD::LOAD nodes.
1863 class LoadSDNode : public LSBaseSDNode {
1864 friend class SelectionDAG;
1865 LoadSDNode(SDValue *ChainPtrOff, unsigned Order, DebugLoc dl, SDVTList VTs,
1866 ISD::MemIndexedMode AM, ISD::LoadExtType ETy, EVT MemVT,
1867 MachineMemOperand *MMO)
1868 : LSBaseSDNode(ISD::LOAD, Order, dl, ChainPtrOff, 3, VTs, AM, MemVT, MMO) {
1869 SubclassData |= (unsigned short)ETy;
1870 assert(getExtensionType() == ETy && "LoadExtType encoding error!");
1871 assert(readMem() && "Load MachineMemOperand is not a load!");
1872 assert(!writeMem() && "Load MachineMemOperand is a store!");
1876 /// getExtensionType - Return whether this is a plain node,
1877 /// or one of the varieties of value-extending loads.
1878 ISD::LoadExtType getExtensionType() const {
1879 return ISD::LoadExtType(SubclassData & 3);
1882 const SDValue &getBasePtr() const { return getOperand(1); }
1883 const SDValue &getOffset() const { return getOperand(2); }
1885 static bool classof(const SDNode *N) {
1886 return N->getOpcode() == ISD::LOAD;
1890 /// StoreSDNode - This class is used to represent ISD::STORE nodes.
1892 class StoreSDNode : public LSBaseSDNode {
1893 friend class SelectionDAG;
1894 StoreSDNode(SDValue *ChainValuePtrOff, unsigned Order, DebugLoc dl,
1895 SDVTList VTs, ISD::MemIndexedMode AM, bool isTrunc, EVT MemVT,
1896 MachineMemOperand *MMO)
1897 : LSBaseSDNode(ISD::STORE, Order, dl, ChainValuePtrOff, 4,
1898 VTs, AM, MemVT, MMO) {
1899 SubclassData |= (unsigned short)isTrunc;
1900 assert(isTruncatingStore() == isTrunc && "isTrunc encoding error!");
1901 assert(!readMem() && "Store MachineMemOperand is a load!");
1902 assert(writeMem() && "Store MachineMemOperand is not a store!");
1906 /// isTruncatingStore - Return true if the op does a truncation before store.
1907 /// For integers this is the same as doing a TRUNCATE and storing the result.
1908 /// For floats, it is the same as doing an FP_ROUND and storing the result.
1909 bool isTruncatingStore() const { return SubclassData & 1; }
1911 const SDValue &getValue() const { return getOperand(1); }
1912 const SDValue &getBasePtr() const { return getOperand(2); }
1913 const SDValue &getOffset() const { return getOperand(3); }
1915 static bool classof(const SDNode *N) {
1916 return N->getOpcode() == ISD::STORE;
1920 /// MachineSDNode - An SDNode that represents everything that will be needed
1921 /// to construct a MachineInstr. These nodes are created during the
1922 /// instruction selection proper phase.
1924 class MachineSDNode : public SDNode {
1926 typedef MachineMemOperand **mmo_iterator;
1929 friend class SelectionDAG;
1930 MachineSDNode(unsigned Opc, unsigned Order, const DebugLoc DL, SDVTList VTs)
1931 : SDNode(Opc, Order, DL, VTs), MemRefs(nullptr), MemRefsEnd(nullptr) {}
1933 /// LocalOperands - Operands for this instruction, if they fit here. If
1934 /// they don't, this field is unused.
1935 SDUse LocalOperands[4];
1937 /// MemRefs - Memory reference descriptions for this instruction.
1938 mmo_iterator MemRefs;
1939 mmo_iterator MemRefsEnd;
1942 mmo_iterator memoperands_begin() const { return MemRefs; }
1943 mmo_iterator memoperands_end() const { return MemRefsEnd; }
1944 bool memoperands_empty() const { return MemRefsEnd == MemRefs; }
1946 /// setMemRefs - Assign this MachineSDNodes's memory reference descriptor
1947 /// list. This does not transfer ownership.
1948 void setMemRefs(mmo_iterator NewMemRefs, mmo_iterator NewMemRefsEnd) {
1949 for (mmo_iterator MMI = NewMemRefs, MME = NewMemRefsEnd; MMI != MME; ++MMI)
1950 assert(*MMI && "Null mem ref detected!");
1951 MemRefs = NewMemRefs;
1952 MemRefsEnd = NewMemRefsEnd;
1955 static bool classof(const SDNode *N) {
1956 return N->isMachineOpcode();
1960 class SDNodeIterator : public std::iterator<std::forward_iterator_tag,
1961 SDNode, ptrdiff_t> {
1965 SDNodeIterator(const SDNode *N, unsigned Op) : Node(N), Operand(Op) {}
1967 bool operator==(const SDNodeIterator& x) const {
1968 return Operand == x.Operand;
1970 bool operator!=(const SDNodeIterator& x) const { return !operator==(x); }
1972 const SDNodeIterator &operator=(const SDNodeIterator &I) {
1973 assert(I.Node == Node && "Cannot assign iterators to two different nodes!");
1974 Operand = I.Operand;
1978 pointer operator*() const {
1979 return Node->getOperand(Operand).getNode();
1981 pointer operator->() const { return operator*(); }
1983 SDNodeIterator& operator++() { // Preincrement
1987 SDNodeIterator operator++(int) { // Postincrement
1988 SDNodeIterator tmp = *this; ++*this; return tmp;
1990 size_t operator-(SDNodeIterator Other) const {
1991 assert(Node == Other.Node &&
1992 "Cannot compare iterators of two different nodes!");
1993 return Operand - Other.Operand;
1996 static SDNodeIterator begin(const SDNode *N) { return SDNodeIterator(N, 0); }
1997 static SDNodeIterator end (const SDNode *N) {
1998 return SDNodeIterator(N, N->getNumOperands());
2001 unsigned getOperand() const { return Operand; }
2002 const SDNode *getNode() const { return Node; }
2005 template <> struct GraphTraits<SDNode*> {
2006 typedef SDNode NodeType;
2007 typedef SDNodeIterator ChildIteratorType;
2008 static inline NodeType *getEntryNode(SDNode *N) { return N; }
2009 static inline ChildIteratorType child_begin(NodeType *N) {
2010 return SDNodeIterator::begin(N);
2012 static inline ChildIteratorType child_end(NodeType *N) {
2013 return SDNodeIterator::end(N);
2017 /// LargestSDNode - The largest SDNode class.
2019 typedef AtomicSDNode LargestSDNode;
2021 /// MostAlignedSDNode - The SDNode class with the greatest alignment
2024 typedef GlobalAddressSDNode MostAlignedSDNode;
2027 /// isNormalLoad - Returns true if the specified node is a non-extending
2028 /// and unindexed load.
2029 inline bool isNormalLoad(const SDNode *N) {
2030 const LoadSDNode *Ld = dyn_cast<LoadSDNode>(N);
2031 return Ld && Ld->getExtensionType() == ISD::NON_EXTLOAD &&
2032 Ld->getAddressingMode() == ISD::UNINDEXED;
2035 /// isNON_EXTLoad - Returns true if the specified node is a non-extending
2037 inline bool isNON_EXTLoad(const SDNode *N) {
2038 return isa<LoadSDNode>(N) &&
2039 cast<LoadSDNode>(N)->getExtensionType() == ISD::NON_EXTLOAD;
2042 /// isEXTLoad - Returns true if the specified node is a EXTLOAD.
2044 inline bool isEXTLoad(const SDNode *N) {
2045 return isa<LoadSDNode>(N) &&
2046 cast<LoadSDNode>(N)->getExtensionType() == ISD::EXTLOAD;
2049 /// isSEXTLoad - Returns true if the specified node is a SEXTLOAD.
2051 inline bool isSEXTLoad(const SDNode *N) {
2052 return isa<LoadSDNode>(N) &&
2053 cast<LoadSDNode>(N)->getExtensionType() == ISD::SEXTLOAD;
2056 /// isZEXTLoad - Returns true if the specified node is a ZEXTLOAD.
2058 inline bool isZEXTLoad(const SDNode *N) {
2059 return isa<LoadSDNode>(N) &&
2060 cast<LoadSDNode>(N)->getExtensionType() == ISD::ZEXTLOAD;
2063 /// isUNINDEXEDLoad - Returns true if the specified node is an unindexed load.
2065 inline bool isUNINDEXEDLoad(const SDNode *N) {
2066 return isa<LoadSDNode>(N) &&
2067 cast<LoadSDNode>(N)->getAddressingMode() == ISD::UNINDEXED;
2070 /// isNormalStore - Returns true if the specified node is a non-truncating
2071 /// and unindexed store.
2072 inline bool isNormalStore(const SDNode *N) {
2073 const StoreSDNode *St = dyn_cast<StoreSDNode>(N);
2074 return St && !St->isTruncatingStore() &&
2075 St->getAddressingMode() == ISD::UNINDEXED;
2078 /// isNON_TRUNCStore - Returns true if the specified node is a non-truncating
2080 inline bool isNON_TRUNCStore(const SDNode *N) {
2081 return isa<StoreSDNode>(N) && !cast<StoreSDNode>(N)->isTruncatingStore();
2084 /// isTRUNCStore - Returns true if the specified node is a truncating
2086 inline bool isTRUNCStore(const SDNode *N) {
2087 return isa<StoreSDNode>(N) && cast<StoreSDNode>(N)->isTruncatingStore();
2090 /// isUNINDEXEDStore - Returns true if the specified node is an
2091 /// unindexed store.
2092 inline bool isUNINDEXEDStore(const SDNode *N) {
2093 return isa<StoreSDNode>(N) &&
2094 cast<StoreSDNode>(N)->getAddressingMode() == ISD::UNINDEXED;
2098 } // end llvm namespace