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 assert(NumOperands == Ops.size() &&
766 "NumOperands wasn't wide enough for its operands!");
767 assert(NumValues == VTs.NumVTs &&
768 "NumValues wasn't wide enough for its operands!");
769 for (unsigned i = 0; i != Ops.size(); ++i) {
770 OperandList[i].setUser(this);
771 OperandList[i].setInitial(Ops[i]);
773 checkForCycles(this);
776 /// This constructor adds no operands itself; operands can be
777 /// set later with InitOperands.
778 SDNode(unsigned Opc, unsigned Order, const DebugLoc dl, SDVTList VTs)
779 : NodeType(Opc), OperandsNeedDelete(false), HasDebugValue(false),
780 SubclassData(0), NodeId(-1), OperandList(nullptr), ValueList(VTs.VTs),
781 UseList(nullptr), NumOperands(0), NumValues(VTs.NumVTs), debugLoc(dl),
783 assert(NumValues == VTs.NumVTs &&
784 "NumValues wasn't wide enough for its operands!");
787 /// InitOperands - Initialize the operands list of this with 1 operand.
788 void InitOperands(SDUse *Ops, const SDValue &Op0) {
789 Ops[0].setUser(this);
790 Ops[0].setInitial(Op0);
793 checkForCycles(this);
796 /// InitOperands - Initialize the operands list of this with 2 operands.
797 void InitOperands(SDUse *Ops, const SDValue &Op0, const SDValue &Op1) {
798 Ops[0].setUser(this);
799 Ops[0].setInitial(Op0);
800 Ops[1].setUser(this);
801 Ops[1].setInitial(Op1);
804 checkForCycles(this);
807 /// InitOperands - Initialize the operands list of this with 3 operands.
808 void InitOperands(SDUse *Ops, const SDValue &Op0, const SDValue &Op1,
809 const SDValue &Op2) {
810 Ops[0].setUser(this);
811 Ops[0].setInitial(Op0);
812 Ops[1].setUser(this);
813 Ops[1].setInitial(Op1);
814 Ops[2].setUser(this);
815 Ops[2].setInitial(Op2);
818 checkForCycles(this);
821 /// InitOperands - Initialize the operands list of this with 4 operands.
822 void InitOperands(SDUse *Ops, const SDValue &Op0, const SDValue &Op1,
823 const SDValue &Op2, const SDValue &Op3) {
824 Ops[0].setUser(this);
825 Ops[0].setInitial(Op0);
826 Ops[1].setUser(this);
827 Ops[1].setInitial(Op1);
828 Ops[2].setUser(this);
829 Ops[2].setInitial(Op2);
830 Ops[3].setUser(this);
831 Ops[3].setInitial(Op3);
834 checkForCycles(this);
837 /// InitOperands - Initialize the operands list of this with N operands.
838 void InitOperands(SDUse *Ops, const SDValue *Vals, unsigned N) {
839 for (unsigned i = 0; i != N; ++i) {
840 Ops[i].setUser(this);
841 Ops[i].setInitial(Vals[i]);
844 assert(NumOperands == N &&
845 "NumOperands wasn't wide enough for its operands!");
847 checkForCycles(this);
850 /// DropOperands - Release the operands and set this node to have
855 /// Wrapper class for IR location info (IR ordering and DebugLoc) to be passed
856 /// into SDNode creation functions.
857 /// When an SDNode is created from the DAGBuilder, the DebugLoc is extracted
858 /// from the original Instruction, and IROrder is the ordinal position of
860 /// When an SDNode is created after the DAG is being built, both DebugLoc and
861 /// the IROrder are propagated from the original SDNode.
862 /// So SDLoc class provides two constructors besides the default one, one to
863 /// be used by the DAGBuilder, the other to be used by others.
866 // Ptr could be used for either Instruction* or SDNode*. It is used for
867 // Instruction* if IROrder is not -1.
872 SDLoc() : Ptr(nullptr), IROrder(0) {}
873 SDLoc(const SDNode *N) : Ptr(N), IROrder(-1) {
874 assert(N && "null SDNode");
876 SDLoc(const SDValue V) : Ptr(V.getNode()), IROrder(-1) {
877 assert(Ptr && "null SDNode");
879 SDLoc(const Instruction *I, int Order) : Ptr(I), IROrder(Order) {
880 assert(Order >= 0 && "bad IROrder");
882 unsigned getIROrder() {
883 if (IROrder >= 0 || Ptr == nullptr) {
884 return (unsigned)IROrder;
886 const SDNode *N = (const SDNode*)(Ptr);
887 return N->getIROrder();
889 DebugLoc getDebugLoc() {
894 const Instruction *I = (const Instruction*)(Ptr);
895 return I->getDebugLoc();
897 const SDNode *N = (const SDNode*)(Ptr);
898 return N->getDebugLoc();
903 // Define inline functions from the SDValue class.
905 inline SDValue::SDValue(SDNode *node, unsigned resno)
906 : Node(node), ResNo(resno) {
907 assert((!Node || ResNo < Node->getNumValues()) &&
908 "Invalid result number for the given node!");
909 assert(ResNo < -2U && "Cannot use result numbers reserved for DenseMaps.");
912 inline unsigned SDValue::getOpcode() const {
913 return Node->getOpcode();
915 inline EVT SDValue::getValueType() const {
916 return Node->getValueType(ResNo);
918 inline unsigned SDValue::getNumOperands() const {
919 return Node->getNumOperands();
921 inline const SDValue &SDValue::getOperand(unsigned i) const {
922 return Node->getOperand(i);
924 inline uint64_t SDValue::getConstantOperandVal(unsigned i) const {
925 return Node->getConstantOperandVal(i);
927 inline bool SDValue::isTargetOpcode() const {
928 return Node->isTargetOpcode();
930 inline bool SDValue::isTargetMemoryOpcode() const {
931 return Node->isTargetMemoryOpcode();
933 inline bool SDValue::isMachineOpcode() const {
934 return Node->isMachineOpcode();
936 inline unsigned SDValue::getMachineOpcode() const {
937 return Node->getMachineOpcode();
939 inline bool SDValue::use_empty() const {
940 return !Node->hasAnyUseOfValue(ResNo);
942 inline bool SDValue::hasOneUse() const {
943 return Node->hasNUsesOfValue(1, ResNo);
945 inline const DebugLoc SDValue::getDebugLoc() const {
946 return Node->getDebugLoc();
948 inline void SDValue::dump() const {
951 inline void SDValue::dumpr() const {
952 return Node->dumpr();
954 // Define inline functions from the SDUse class.
956 inline void SDUse::set(const SDValue &V) {
957 if (Val.getNode()) removeFromList();
959 if (V.getNode()) V.getNode()->addUse(*this);
962 inline void SDUse::setInitial(const SDValue &V) {
964 V.getNode()->addUse(*this);
967 inline void SDUse::setNode(SDNode *N) {
968 if (Val.getNode()) removeFromList();
970 if (N) N->addUse(*this);
973 /// UnarySDNode - This class is used for single-operand SDNodes. This is solely
974 /// to allow co-allocation of node operands with the node itself.
975 class UnarySDNode : public SDNode {
978 UnarySDNode(unsigned Opc, unsigned Order, DebugLoc dl, SDVTList VTs,
980 : SDNode(Opc, Order, dl, VTs) {
981 InitOperands(&Op, X);
985 /// BinarySDNode - This class is used for two-operand SDNodes. This is solely
986 /// to allow co-allocation of node operands with the node itself.
987 class BinarySDNode : public SDNode {
990 BinarySDNode(unsigned Opc, unsigned Order, DebugLoc dl, SDVTList VTs,
991 SDValue X, SDValue Y)
992 : SDNode(Opc, Order, dl, VTs) {
993 InitOperands(Ops, X, Y);
997 /// BinaryWithFlagsSDNode - This class is an extension of BinarySDNode
998 /// used from those opcodes that have associated extra flags.
999 class BinaryWithFlagsSDNode : public BinarySDNode {
1000 enum { NUW = (1 << 0), NSW = (1 << 1), EXACT = (1 << 2) };
1003 BinaryWithFlagsSDNode(unsigned Opc, unsigned Order, DebugLoc dl, SDVTList VTs,
1004 SDValue X, SDValue Y)
1005 : BinarySDNode(Opc, Order, dl, VTs, X, Y) {}
1006 /// getRawSubclassData - Return the SubclassData value, which contains an
1007 /// encoding of the flags.
1008 /// This function should be used to add subclass data to the NodeID value.
1009 unsigned getRawSubclassData() const { return SubclassData; }
1010 void setHasNoUnsignedWrap(bool b) {
1011 SubclassData = (SubclassData & ~NUW) | (b ? NUW : 0);
1013 void setHasNoSignedWrap(bool b) {
1014 SubclassData = (SubclassData & ~NSW) | (b ? NSW : 0);
1016 void setIsExact(bool b) {
1017 SubclassData = (SubclassData & ~EXACT) | (b ? EXACT : 0);
1019 bool hasNoUnsignedWrap() const { return SubclassData & NUW; }
1020 bool hasNoSignedWrap() const { return SubclassData & NSW; }
1021 bool isExact() const { return SubclassData & EXACT; }
1022 static bool classof(const SDNode *N) {
1023 return isBinOpWithFlags(N->getOpcode());
1027 /// TernarySDNode - This class is used for three-operand SDNodes. This is solely
1028 /// to allow co-allocation of node operands with the node itself.
1029 class TernarySDNode : public SDNode {
1032 TernarySDNode(unsigned Opc, unsigned Order, DebugLoc dl, SDVTList VTs,
1033 SDValue X, SDValue Y, SDValue Z)
1034 : SDNode(Opc, Order, dl, VTs) {
1035 InitOperands(Ops, X, Y, Z);
1040 /// HandleSDNode - This class is used to form a handle around another node that
1041 /// is persistent and is updated across invocations of replaceAllUsesWith on its
1042 /// operand. This node should be directly created by end-users and not added to
1043 /// the AllNodes list.
1044 class HandleSDNode : public SDNode {
1047 explicit HandleSDNode(SDValue X)
1048 : SDNode(ISD::HANDLENODE, 0, DebugLoc(), getSDVTList(MVT::Other)) {
1049 InitOperands(&Op, X);
1052 const SDValue &getValue() const { return Op; }
1055 class AddrSpaceCastSDNode : public UnarySDNode {
1057 unsigned SrcAddrSpace;
1058 unsigned DestAddrSpace;
1061 AddrSpaceCastSDNode(unsigned Order, DebugLoc dl, EVT VT, SDValue X,
1062 unsigned SrcAS, unsigned DestAS);
1064 unsigned getSrcAddressSpace() const { return SrcAddrSpace; }
1065 unsigned getDestAddressSpace() const { return DestAddrSpace; }
1067 static bool classof(const SDNode *N) {
1068 return N->getOpcode() == ISD::ADDRSPACECAST;
1072 /// Abstact virtual class for operations for memory operations
1073 class MemSDNode : public SDNode {
1075 // MemoryVT - VT of in-memory value.
1079 /// MMO - Memory reference information.
1080 MachineMemOperand *MMO;
1083 MemSDNode(unsigned Opc, unsigned Order, DebugLoc dl, SDVTList VTs,
1084 EVT MemoryVT, MachineMemOperand *MMO);
1086 MemSDNode(unsigned Opc, unsigned Order, DebugLoc dl, SDVTList VTs,
1087 ArrayRef<SDValue> Ops, EVT MemoryVT, MachineMemOperand *MMO);
1089 bool readMem() const { return MMO->isLoad(); }
1090 bool writeMem() const { return MMO->isStore(); }
1092 /// Returns alignment and volatility of the memory access
1093 unsigned getOriginalAlignment() const {
1094 return MMO->getBaseAlignment();
1096 unsigned getAlignment() const {
1097 return MMO->getAlignment();
1100 /// getRawSubclassData - Return the SubclassData value, which contains an
1101 /// encoding of the volatile flag, as well as bits used by subclasses. This
1102 /// function should only be used to compute a FoldingSetNodeID value.
1103 unsigned getRawSubclassData() const {
1104 return SubclassData;
1107 // We access subclass data here so that we can check consistency
1108 // with MachineMemOperand information.
1109 bool isVolatile() const { return (SubclassData >> 5) & 1; }
1110 bool isNonTemporal() const { return (SubclassData >> 6) & 1; }
1111 bool isInvariant() const { return (SubclassData >> 7) & 1; }
1113 AtomicOrdering getOrdering() const {
1114 return AtomicOrdering((SubclassData >> 8) & 15);
1116 SynchronizationScope getSynchScope() const {
1117 return SynchronizationScope((SubclassData >> 12) & 1);
1120 // Returns the offset from the location of the access.
1121 int64_t getSrcValueOffset() const { return MMO->getOffset(); }
1123 /// Returns the AA info that describes the dereference.
1124 AAMDNodes getAAInfo() const { return MMO->getAAInfo(); }
1126 /// Returns the Ranges that describes the dereference.
1127 const MDNode *getRanges() const { return MMO->getRanges(); }
1129 /// getMemoryVT - Return the type of the in-memory value.
1130 EVT getMemoryVT() const { return MemoryVT; }
1132 /// getMemOperand - Return a MachineMemOperand object describing the memory
1133 /// reference performed by operation.
1134 MachineMemOperand *getMemOperand() const { return MMO; }
1136 const MachinePointerInfo &getPointerInfo() const {
1137 return MMO->getPointerInfo();
1140 /// getAddressSpace - Return the address space for the associated pointer
1141 unsigned getAddressSpace() const {
1142 return getPointerInfo().getAddrSpace();
1145 /// refineAlignment - Update this MemSDNode's MachineMemOperand information
1146 /// to reflect the alignment of NewMMO, if it has a greater alignment.
1147 /// This must only be used when the new alignment applies to all users of
1148 /// this MachineMemOperand.
1149 void refineAlignment(const MachineMemOperand *NewMMO) {
1150 MMO->refineAlignment(NewMMO);
1153 const SDValue &getChain() const { return getOperand(0); }
1154 const SDValue &getBasePtr() const {
1155 return getOperand(getOpcode() == ISD::STORE ? 2 : 1);
1158 // Methods to support isa and dyn_cast
1159 static bool classof(const SDNode *N) {
1160 // For some targets, we lower some target intrinsics to a MemIntrinsicNode
1161 // with either an intrinsic or a target opcode.
1162 return N->getOpcode() == ISD::LOAD ||
1163 N->getOpcode() == ISD::STORE ||
1164 N->getOpcode() == ISD::PREFETCH ||
1165 N->getOpcode() == ISD::ATOMIC_CMP_SWAP ||
1166 N->getOpcode() == ISD::ATOMIC_CMP_SWAP_WITH_SUCCESS ||
1167 N->getOpcode() == ISD::ATOMIC_SWAP ||
1168 N->getOpcode() == ISD::ATOMIC_LOAD_ADD ||
1169 N->getOpcode() == ISD::ATOMIC_LOAD_SUB ||
1170 N->getOpcode() == ISD::ATOMIC_LOAD_AND ||
1171 N->getOpcode() == ISD::ATOMIC_LOAD_OR ||
1172 N->getOpcode() == ISD::ATOMIC_LOAD_XOR ||
1173 N->getOpcode() == ISD::ATOMIC_LOAD_NAND ||
1174 N->getOpcode() == ISD::ATOMIC_LOAD_MIN ||
1175 N->getOpcode() == ISD::ATOMIC_LOAD_MAX ||
1176 N->getOpcode() == ISD::ATOMIC_LOAD_UMIN ||
1177 N->getOpcode() == ISD::ATOMIC_LOAD_UMAX ||
1178 N->getOpcode() == ISD::ATOMIC_LOAD ||
1179 N->getOpcode() == ISD::ATOMIC_STORE ||
1180 N->getOpcode() == ISD::MLOAD ||
1181 N->getOpcode() == ISD::MSTORE ||
1182 N->isMemIntrinsic() ||
1183 N->isTargetMemoryOpcode();
1187 /// AtomicSDNode - A SDNode reprenting atomic operations.
1189 class AtomicSDNode : public MemSDNode {
1192 /// For cmpxchg instructions, the ordering requirements when a store does not
1194 AtomicOrdering FailureOrdering;
1196 void InitAtomic(AtomicOrdering SuccessOrdering,
1197 AtomicOrdering FailureOrdering,
1198 SynchronizationScope SynchScope) {
1199 // This must match encodeMemSDNodeFlags() in SelectionDAG.cpp.
1200 assert((SuccessOrdering & 15) == SuccessOrdering &&
1201 "Ordering may not require more than 4 bits!");
1202 assert((FailureOrdering & 15) == FailureOrdering &&
1203 "Ordering may not require more than 4 bits!");
1204 assert((SynchScope & 1) == SynchScope &&
1205 "SynchScope may not require more than 1 bit!");
1206 SubclassData |= SuccessOrdering << 8;
1207 SubclassData |= SynchScope << 12;
1208 this->FailureOrdering = FailureOrdering;
1209 assert(getSuccessOrdering() == SuccessOrdering &&
1210 "Ordering encoding error!");
1211 assert(getFailureOrdering() == FailureOrdering &&
1212 "Ordering encoding error!");
1213 assert(getSynchScope() == SynchScope && "Synch-scope encoding error!");
1217 // Opc: opcode for atomic
1218 // VTL: value type list
1219 // Chain: memory chain for operaand
1220 // Ptr: address to update as a SDValue
1221 // Cmp: compare value
1223 // SrcVal: address to update as a Value (used for MemOperand)
1224 // Align: alignment of memory
1225 AtomicSDNode(unsigned Opc, unsigned Order, DebugLoc dl, SDVTList VTL,
1226 EVT MemVT, SDValue Chain, SDValue Ptr, SDValue Cmp, SDValue Swp,
1227 MachineMemOperand *MMO, AtomicOrdering Ordering,
1228 SynchronizationScope SynchScope)
1229 : MemSDNode(Opc, Order, dl, VTL, MemVT, MMO) {
1230 InitAtomic(Ordering, Ordering, SynchScope);
1231 InitOperands(Ops, Chain, Ptr, Cmp, Swp);
1233 AtomicSDNode(unsigned Opc, unsigned Order, DebugLoc dl, SDVTList VTL,
1235 SDValue Chain, SDValue Ptr,
1236 SDValue Val, MachineMemOperand *MMO,
1237 AtomicOrdering Ordering, SynchronizationScope SynchScope)
1238 : MemSDNode(Opc, Order, dl, VTL, MemVT, MMO) {
1239 InitAtomic(Ordering, Ordering, SynchScope);
1240 InitOperands(Ops, Chain, Ptr, Val);
1242 AtomicSDNode(unsigned Opc, unsigned Order, DebugLoc dl, SDVTList VTL,
1244 SDValue Chain, SDValue Ptr,
1245 MachineMemOperand *MMO,
1246 AtomicOrdering Ordering, SynchronizationScope SynchScope)
1247 : MemSDNode(Opc, Order, dl, VTL, MemVT, MMO) {
1248 InitAtomic(Ordering, Ordering, SynchScope);
1249 InitOperands(Ops, Chain, Ptr);
1251 AtomicSDNode(unsigned Opc, unsigned Order, DebugLoc dl, SDVTList VTL, EVT MemVT,
1252 const SDValue* AllOps, SDUse *DynOps, unsigned NumOps,
1253 MachineMemOperand *MMO,
1254 AtomicOrdering SuccessOrdering, AtomicOrdering FailureOrdering,
1255 SynchronizationScope SynchScope)
1256 : MemSDNode(Opc, Order, dl, VTL, MemVT, MMO) {
1257 InitAtomic(SuccessOrdering, FailureOrdering, SynchScope);
1258 assert((DynOps || NumOps <= array_lengthof(Ops)) &&
1259 "Too many ops for internal storage!");
1260 InitOperands(DynOps ? DynOps : Ops, AllOps, NumOps);
1263 const SDValue &getBasePtr() const { return getOperand(1); }
1264 const SDValue &getVal() const { return getOperand(2); }
1266 AtomicOrdering getSuccessOrdering() const {
1267 return getOrdering();
1270 // Not quite enough room in SubclassData for everything, so failure gets its
1272 AtomicOrdering getFailureOrdering() const {
1273 return FailureOrdering;
1276 bool isCompareAndSwap() const {
1277 unsigned Op = getOpcode();
1278 return Op == ISD::ATOMIC_CMP_SWAP || Op == ISD::ATOMIC_CMP_SWAP_WITH_SUCCESS;
1281 // Methods to support isa and dyn_cast
1282 static bool classof(const SDNode *N) {
1283 return N->getOpcode() == ISD::ATOMIC_CMP_SWAP ||
1284 N->getOpcode() == ISD::ATOMIC_CMP_SWAP_WITH_SUCCESS ||
1285 N->getOpcode() == ISD::ATOMIC_SWAP ||
1286 N->getOpcode() == ISD::ATOMIC_LOAD_ADD ||
1287 N->getOpcode() == ISD::ATOMIC_LOAD_SUB ||
1288 N->getOpcode() == ISD::ATOMIC_LOAD_AND ||
1289 N->getOpcode() == ISD::ATOMIC_LOAD_OR ||
1290 N->getOpcode() == ISD::ATOMIC_LOAD_XOR ||
1291 N->getOpcode() == ISD::ATOMIC_LOAD_NAND ||
1292 N->getOpcode() == ISD::ATOMIC_LOAD_MIN ||
1293 N->getOpcode() == ISD::ATOMIC_LOAD_MAX ||
1294 N->getOpcode() == ISD::ATOMIC_LOAD_UMIN ||
1295 N->getOpcode() == ISD::ATOMIC_LOAD_UMAX ||
1296 N->getOpcode() == ISD::ATOMIC_LOAD ||
1297 N->getOpcode() == ISD::ATOMIC_STORE;
1301 /// MemIntrinsicSDNode - This SDNode is used for target intrinsics that touch
1302 /// memory and need an associated MachineMemOperand. Its opcode may be
1303 /// INTRINSIC_VOID, INTRINSIC_W_CHAIN, PREFETCH, or a target-specific opcode
1304 /// with a value not less than FIRST_TARGET_MEMORY_OPCODE.
1305 class MemIntrinsicSDNode : public MemSDNode {
1307 MemIntrinsicSDNode(unsigned Opc, unsigned Order, DebugLoc dl, SDVTList VTs,
1308 ArrayRef<SDValue> Ops, EVT MemoryVT,
1309 MachineMemOperand *MMO)
1310 : MemSDNode(Opc, Order, dl, VTs, Ops, MemoryVT, MMO) {
1311 SubclassData |= 1u << 13;
1314 // Methods to support isa and dyn_cast
1315 static bool classof(const SDNode *N) {
1316 // We lower some target intrinsics to their target opcode
1317 // early a node with a target opcode can be of this class
1318 return N->isMemIntrinsic() ||
1319 N->getOpcode() == ISD::PREFETCH ||
1320 N->isTargetMemoryOpcode();
1324 /// ShuffleVectorSDNode - This SDNode is used to implement the code generator
1325 /// support for the llvm IR shufflevector instruction. It combines elements
1326 /// from two input vectors into a new input vector, with the selection and
1327 /// ordering of elements determined by an array of integers, referred to as
1328 /// the shuffle mask. For input vectors of width N, mask indices of 0..N-1
1329 /// refer to elements from the LHS input, and indices from N to 2N-1 the RHS.
1330 /// An index of -1 is treated as undef, such that the code generator may put
1331 /// any value in the corresponding element of the result.
1332 class ShuffleVectorSDNode : public SDNode {
1335 // The memory for Mask is owned by the SelectionDAG's OperandAllocator, and
1336 // is freed when the SelectionDAG object is destroyed.
1339 friend class SelectionDAG;
1340 ShuffleVectorSDNode(EVT VT, unsigned Order, DebugLoc dl, SDValue N1,
1341 SDValue N2, const int *M)
1342 : SDNode(ISD::VECTOR_SHUFFLE, Order, dl, getSDVTList(VT)), Mask(M) {
1343 InitOperands(Ops, N1, N2);
1347 ArrayRef<int> getMask() const {
1348 EVT VT = getValueType(0);
1349 return makeArrayRef(Mask, VT.getVectorNumElements());
1351 int getMaskElt(unsigned Idx) const {
1352 assert(Idx < getValueType(0).getVectorNumElements() && "Idx out of range!");
1356 bool isSplat() const { return isSplatMask(Mask, getValueType(0)); }
1357 int getSplatIndex() const {
1358 assert(isSplat() && "Cannot get splat index for non-splat!");
1359 EVT VT = getValueType(0);
1360 for (unsigned i = 0, e = VT.getVectorNumElements(); i != e; ++i) {
1364 llvm_unreachable("Splat with all undef indices?");
1366 static bool isSplatMask(const int *Mask, EVT VT);
1368 static bool classof(const SDNode *N) {
1369 return N->getOpcode() == ISD::VECTOR_SHUFFLE;
1373 class ConstantSDNode : public SDNode {
1374 const ConstantInt *Value;
1375 friend class SelectionDAG;
1376 ConstantSDNode(bool isTarget, bool isOpaque, const ConstantInt *val, EVT VT)
1377 : SDNode(isTarget ? ISD::TargetConstant : ISD::Constant,
1378 0, DebugLoc(), getSDVTList(VT)), Value(val) {
1379 SubclassData |= (uint16_t)isOpaque;
1383 const ConstantInt *getConstantIntValue() const { return Value; }
1384 const APInt &getAPIntValue() const { return Value->getValue(); }
1385 uint64_t getZExtValue() const { return Value->getZExtValue(); }
1386 int64_t getSExtValue() const { return Value->getSExtValue(); }
1388 bool isOne() const { return Value->isOne(); }
1389 bool isNullValue() const { return Value->isNullValue(); }
1390 bool isAllOnesValue() const { return Value->isAllOnesValue(); }
1392 bool isOpaque() const { return SubclassData & 1; }
1394 static bool classof(const SDNode *N) {
1395 return N->getOpcode() == ISD::Constant ||
1396 N->getOpcode() == ISD::TargetConstant;
1400 class ConstantFPSDNode : public SDNode {
1401 const ConstantFP *Value;
1402 friend class SelectionDAG;
1403 ConstantFPSDNode(bool isTarget, const ConstantFP *val, EVT VT)
1404 : SDNode(isTarget ? ISD::TargetConstantFP : ISD::ConstantFP,
1405 0, DebugLoc(), getSDVTList(VT)), Value(val) {
1409 const APFloat& getValueAPF() const { return Value->getValueAPF(); }
1410 const ConstantFP *getConstantFPValue() const { return Value; }
1412 /// isZero - Return true if the value is positive or negative zero.
1413 bool isZero() const { return Value->isZero(); }
1415 /// isNaN - Return true if the value is a NaN.
1416 bool isNaN() const { return Value->isNaN(); }
1418 /// isExactlyValue - We don't rely on operator== working on double values, as
1419 /// it returns true for things that are clearly not equal, like -0.0 and 0.0.
1420 /// As such, this method can be used to do an exact bit-for-bit comparison of
1421 /// two floating point values.
1423 /// We leave the version with the double argument here because it's just so
1424 /// convenient to write "2.0" and the like. Without this function we'd
1425 /// have to duplicate its logic everywhere it's called.
1426 bool isExactlyValue(double V) const {
1429 Tmp.convert(Value->getValueAPF().getSemantics(),
1430 APFloat::rmNearestTiesToEven, &ignored);
1431 return isExactlyValue(Tmp);
1433 bool isExactlyValue(const APFloat& V) const;
1435 static bool isValueValidForType(EVT VT, const APFloat& Val);
1437 static bool classof(const SDNode *N) {
1438 return N->getOpcode() == ISD::ConstantFP ||
1439 N->getOpcode() == ISD::TargetConstantFP;
1443 class GlobalAddressSDNode : public SDNode {
1444 const GlobalValue *TheGlobal;
1446 unsigned char TargetFlags;
1447 friend class SelectionDAG;
1448 GlobalAddressSDNode(unsigned Opc, unsigned Order, DebugLoc DL,
1449 const GlobalValue *GA, EVT VT, int64_t o,
1450 unsigned char TargetFlags);
1453 const GlobalValue *getGlobal() const { return TheGlobal; }
1454 int64_t getOffset() const { return Offset; }
1455 unsigned char getTargetFlags() const { return TargetFlags; }
1456 // Return the address space this GlobalAddress belongs to.
1457 unsigned getAddressSpace() const;
1459 static bool classof(const SDNode *N) {
1460 return N->getOpcode() == ISD::GlobalAddress ||
1461 N->getOpcode() == ISD::TargetGlobalAddress ||
1462 N->getOpcode() == ISD::GlobalTLSAddress ||
1463 N->getOpcode() == ISD::TargetGlobalTLSAddress;
1467 class FrameIndexSDNode : public SDNode {
1469 friend class SelectionDAG;
1470 FrameIndexSDNode(int fi, EVT VT, bool isTarg)
1471 : SDNode(isTarg ? ISD::TargetFrameIndex : ISD::FrameIndex,
1472 0, DebugLoc(), getSDVTList(VT)), FI(fi) {
1476 int getIndex() const { return FI; }
1478 static bool classof(const SDNode *N) {
1479 return N->getOpcode() == ISD::FrameIndex ||
1480 N->getOpcode() == ISD::TargetFrameIndex;
1484 class JumpTableSDNode : public SDNode {
1486 unsigned char TargetFlags;
1487 friend class SelectionDAG;
1488 JumpTableSDNode(int jti, EVT VT, bool isTarg, unsigned char TF)
1489 : SDNode(isTarg ? ISD::TargetJumpTable : ISD::JumpTable,
1490 0, DebugLoc(), getSDVTList(VT)), JTI(jti), TargetFlags(TF) {
1494 int getIndex() const { return JTI; }
1495 unsigned char getTargetFlags() const { return TargetFlags; }
1497 static bool classof(const SDNode *N) {
1498 return N->getOpcode() == ISD::JumpTable ||
1499 N->getOpcode() == ISD::TargetJumpTable;
1503 class ConstantPoolSDNode : public SDNode {
1505 const Constant *ConstVal;
1506 MachineConstantPoolValue *MachineCPVal;
1508 int Offset; // It's a MachineConstantPoolValue if top bit is set.
1509 unsigned Alignment; // Minimum alignment requirement of CP (not log2 value).
1510 unsigned char TargetFlags;
1511 friend class SelectionDAG;
1512 ConstantPoolSDNode(bool isTarget, const Constant *c, EVT VT, int o,
1513 unsigned Align, unsigned char TF)
1514 : SDNode(isTarget ? ISD::TargetConstantPool : ISD::ConstantPool, 0,
1515 DebugLoc(), getSDVTList(VT)), Offset(o), Alignment(Align),
1517 assert(Offset >= 0 && "Offset is too large");
1520 ConstantPoolSDNode(bool isTarget, MachineConstantPoolValue *v,
1521 EVT VT, int o, unsigned Align, unsigned char TF)
1522 : SDNode(isTarget ? ISD::TargetConstantPool : ISD::ConstantPool, 0,
1523 DebugLoc(), getSDVTList(VT)), Offset(o), Alignment(Align),
1525 assert(Offset >= 0 && "Offset is too large");
1526 Val.MachineCPVal = v;
1527 Offset |= 1 << (sizeof(unsigned)*CHAR_BIT-1);
1531 bool isMachineConstantPoolEntry() const {
1535 const Constant *getConstVal() const {
1536 assert(!isMachineConstantPoolEntry() && "Wrong constantpool type");
1537 return Val.ConstVal;
1540 MachineConstantPoolValue *getMachineCPVal() const {
1541 assert(isMachineConstantPoolEntry() && "Wrong constantpool type");
1542 return Val.MachineCPVal;
1545 int getOffset() const {
1546 return Offset & ~(1 << (sizeof(unsigned)*CHAR_BIT-1));
1549 // Return the alignment of this constant pool object, which is either 0 (for
1550 // default alignment) or the desired value.
1551 unsigned getAlignment() const { return Alignment; }
1552 unsigned char getTargetFlags() const { return TargetFlags; }
1554 Type *getType() const;
1556 static bool classof(const SDNode *N) {
1557 return N->getOpcode() == ISD::ConstantPool ||
1558 N->getOpcode() == ISD::TargetConstantPool;
1562 /// Completely target-dependent object reference.
1563 class TargetIndexSDNode : public SDNode {
1564 unsigned char TargetFlags;
1567 friend class SelectionDAG;
1570 TargetIndexSDNode(int Idx, EVT VT, int64_t Ofs, unsigned char TF)
1571 : SDNode(ISD::TargetIndex, 0, DebugLoc(), getSDVTList(VT)),
1572 TargetFlags(TF), Index(Idx), Offset(Ofs) {}
1575 unsigned char getTargetFlags() const { return TargetFlags; }
1576 int getIndex() const { return Index; }
1577 int64_t getOffset() const { return Offset; }
1579 static bool classof(const SDNode *N) {
1580 return N->getOpcode() == ISD::TargetIndex;
1584 class BasicBlockSDNode : public SDNode {
1585 MachineBasicBlock *MBB;
1586 friend class SelectionDAG;
1587 /// Debug info is meaningful and potentially useful here, but we create
1588 /// blocks out of order when they're jumped to, which makes it a bit
1589 /// harder. Let's see if we need it first.
1590 explicit BasicBlockSDNode(MachineBasicBlock *mbb)
1591 : SDNode(ISD::BasicBlock, 0, DebugLoc(), getSDVTList(MVT::Other)), MBB(mbb)
1595 MachineBasicBlock *getBasicBlock() const { return MBB; }
1597 static bool classof(const SDNode *N) {
1598 return N->getOpcode() == ISD::BasicBlock;
1602 /// BuildVectorSDNode - A "pseudo-class" with methods for operating on
1604 class BuildVectorSDNode : public SDNode {
1605 // These are constructed as SDNodes and then cast to BuildVectorSDNodes.
1606 explicit BuildVectorSDNode() LLVM_DELETED_FUNCTION;
1608 /// isConstantSplat - Check if this is a constant splat, and if so, find the
1609 /// smallest element size that splats the vector. If MinSplatBits is
1610 /// nonzero, the element size must be at least that large. Note that the
1611 /// splat element may be the entire vector (i.e., a one element vector).
1612 /// Returns the splat element value in SplatValue. Any undefined bits in
1613 /// that value are zero, and the corresponding bits in the SplatUndef mask
1614 /// are set. The SplatBitSize value is set to the splat element size in
1615 /// bits. HasAnyUndefs is set to true if any bits in the vector are
1616 /// undefined. isBigEndian describes the endianness of the target.
1617 bool isConstantSplat(APInt &SplatValue, APInt &SplatUndef,
1618 unsigned &SplatBitSize, bool &HasAnyUndefs,
1619 unsigned MinSplatBits = 0,
1620 bool isBigEndian = false) const;
1622 /// \brief Returns the splatted value or a null value if this is not a splat.
1624 /// If passed a non-null UndefElements bitvector, it will resize it to match
1625 /// the vector width and set the bits where elements are undef.
1626 SDValue getSplatValue(BitVector *UndefElements = nullptr) const;
1628 /// \brief Returns the splatted constant or null if this is not a constant
1631 /// If passed a non-null UndefElements bitvector, it will resize it to match
1632 /// the vector width and set the bits where elements are undef.
1634 getConstantSplatNode(BitVector *UndefElements = nullptr) const;
1636 /// \brief Returns the splatted constant FP or null if this is not a constant
1639 /// If passed a non-null UndefElements bitvector, it will resize it to match
1640 /// the vector width and set the bits where elements are undef.
1642 getConstantFPSplatNode(BitVector *UndefElements = nullptr) const;
1644 bool isConstant() const;
1646 static inline bool classof(const SDNode *N) {
1647 return N->getOpcode() == ISD::BUILD_VECTOR;
1651 /// SrcValueSDNode - An SDNode that holds an arbitrary LLVM IR Value. This is
1652 /// used when the SelectionDAG needs to make a simple reference to something
1653 /// in the LLVM IR representation.
1655 class SrcValueSDNode : public SDNode {
1657 friend class SelectionDAG;
1658 /// Create a SrcValue for a general value.
1659 explicit SrcValueSDNode(const Value *v)
1660 : SDNode(ISD::SRCVALUE, 0, DebugLoc(), getSDVTList(MVT::Other)), V(v) {}
1663 /// getValue - return the contained Value.
1664 const Value *getValue() const { return V; }
1666 static bool classof(const SDNode *N) {
1667 return N->getOpcode() == ISD::SRCVALUE;
1671 class MDNodeSDNode : public SDNode {
1673 friend class SelectionDAG;
1674 explicit MDNodeSDNode(const MDNode *md)
1675 : SDNode(ISD::MDNODE_SDNODE, 0, DebugLoc(), getSDVTList(MVT::Other)), MD(md)
1679 const MDNode *getMD() const { return MD; }
1681 static bool classof(const SDNode *N) {
1682 return N->getOpcode() == ISD::MDNODE_SDNODE;
1686 class RegisterSDNode : public SDNode {
1688 friend class SelectionDAG;
1689 RegisterSDNode(unsigned reg, EVT VT)
1690 : SDNode(ISD::Register, 0, DebugLoc(), getSDVTList(VT)), Reg(reg) {
1694 unsigned getReg() const { return Reg; }
1696 static bool classof(const SDNode *N) {
1697 return N->getOpcode() == ISD::Register;
1701 class RegisterMaskSDNode : public SDNode {
1702 // The memory for RegMask is not owned by the node.
1703 const uint32_t *RegMask;
1704 friend class SelectionDAG;
1705 RegisterMaskSDNode(const uint32_t *mask)
1706 : SDNode(ISD::RegisterMask, 0, DebugLoc(), getSDVTList(MVT::Untyped)),
1710 const uint32_t *getRegMask() const { return RegMask; }
1712 static bool classof(const SDNode *N) {
1713 return N->getOpcode() == ISD::RegisterMask;
1717 class BlockAddressSDNode : public SDNode {
1718 const BlockAddress *BA;
1720 unsigned char TargetFlags;
1721 friend class SelectionDAG;
1722 BlockAddressSDNode(unsigned NodeTy, EVT VT, const BlockAddress *ba,
1723 int64_t o, unsigned char Flags)
1724 : SDNode(NodeTy, 0, DebugLoc(), getSDVTList(VT)),
1725 BA(ba), Offset(o), TargetFlags(Flags) {
1728 const BlockAddress *getBlockAddress() const { return BA; }
1729 int64_t getOffset() const { return Offset; }
1730 unsigned char getTargetFlags() const { return TargetFlags; }
1732 static bool classof(const SDNode *N) {
1733 return N->getOpcode() == ISD::BlockAddress ||
1734 N->getOpcode() == ISD::TargetBlockAddress;
1738 class EHLabelSDNode : public SDNode {
1741 friend class SelectionDAG;
1742 EHLabelSDNode(unsigned Order, DebugLoc dl, SDValue ch, MCSymbol *L)
1743 : SDNode(ISD::EH_LABEL, Order, dl, getSDVTList(MVT::Other)), Label(L) {
1744 InitOperands(&Chain, ch);
1747 MCSymbol *getLabel() const { return Label; }
1749 static bool classof(const SDNode *N) {
1750 return N->getOpcode() == ISD::EH_LABEL;
1754 class ExternalSymbolSDNode : public SDNode {
1756 unsigned char TargetFlags;
1758 friend class SelectionDAG;
1759 ExternalSymbolSDNode(bool isTarget, const char *Sym, unsigned char TF, EVT VT)
1760 : SDNode(isTarget ? ISD::TargetExternalSymbol : ISD::ExternalSymbol,
1761 0, DebugLoc(), getSDVTList(VT)), Symbol(Sym), TargetFlags(TF) {
1765 const char *getSymbol() const { return Symbol; }
1766 unsigned char getTargetFlags() const { return TargetFlags; }
1768 static bool classof(const SDNode *N) {
1769 return N->getOpcode() == ISD::ExternalSymbol ||
1770 N->getOpcode() == ISD::TargetExternalSymbol;
1774 class CondCodeSDNode : public SDNode {
1775 ISD::CondCode Condition;
1776 friend class SelectionDAG;
1777 explicit CondCodeSDNode(ISD::CondCode Cond)
1778 : SDNode(ISD::CONDCODE, 0, DebugLoc(), getSDVTList(MVT::Other)),
1783 ISD::CondCode get() const { return Condition; }
1785 static bool classof(const SDNode *N) {
1786 return N->getOpcode() == ISD::CONDCODE;
1790 /// CvtRndSatSDNode - NOTE: avoid using this node as this may disappear in the
1791 /// future and most targets don't support it.
1792 class CvtRndSatSDNode : public SDNode {
1793 ISD::CvtCode CvtCode;
1794 friend class SelectionDAG;
1795 explicit CvtRndSatSDNode(EVT VT, unsigned Order, DebugLoc dl,
1796 ArrayRef<SDValue> Ops, ISD::CvtCode Code)
1797 : SDNode(ISD::CONVERT_RNDSAT, Order, dl, getSDVTList(VT), Ops),
1799 assert(Ops.size() == 5 && "wrong number of operations");
1802 ISD::CvtCode getCvtCode() const { return CvtCode; }
1804 static bool classof(const SDNode *N) {
1805 return N->getOpcode() == ISD::CONVERT_RNDSAT;
1809 /// VTSDNode - This class is used to represent EVT's, which are used
1810 /// to parameterize some operations.
1811 class VTSDNode : public SDNode {
1813 friend class SelectionDAG;
1814 explicit VTSDNode(EVT VT)
1815 : SDNode(ISD::VALUETYPE, 0, DebugLoc(), getSDVTList(MVT::Other)),
1820 EVT getVT() const { return ValueType; }
1822 static bool classof(const SDNode *N) {
1823 return N->getOpcode() == ISD::VALUETYPE;
1827 /// LSBaseSDNode - Base class for LoadSDNode and StoreSDNode
1829 class LSBaseSDNode : public MemSDNode {
1830 //! Operand array for load and store
1832 \note Moving this array to the base class captures more
1833 common functionality shared between LoadSDNode and
1838 LSBaseSDNode(ISD::NodeType NodeTy, unsigned Order, DebugLoc dl,
1839 SDValue *Operands, unsigned numOperands,
1840 SDVTList VTs, ISD::MemIndexedMode AM, EVT MemVT,
1841 MachineMemOperand *MMO)
1842 : MemSDNode(NodeTy, Order, dl, VTs, MemVT, MMO) {
1843 SubclassData |= AM << 2;
1844 assert(getAddressingMode() == AM && "MemIndexedMode encoding error!");
1845 InitOperands(Ops, Operands, numOperands);
1846 assert((getOffset().getOpcode() == ISD::UNDEF || isIndexed()) &&
1847 "Only indexed loads and stores have a non-undef offset operand");
1850 const SDValue &getOffset() const {
1851 return getOperand(getOpcode() == ISD::LOAD ? 2 : 3);
1854 /// getAddressingMode - Return the addressing mode for this load or store:
1855 /// unindexed, pre-inc, pre-dec, post-inc, or post-dec.
1856 ISD::MemIndexedMode getAddressingMode() const {
1857 return ISD::MemIndexedMode((SubclassData >> 2) & 7);
1860 /// isIndexed - Return true if this is a pre/post inc/dec load/store.
1861 bool isIndexed() const { return getAddressingMode() != ISD::UNINDEXED; }
1863 /// isUnindexed - Return true if this is NOT a pre/post inc/dec load/store.
1864 bool isUnindexed() const { return getAddressingMode() == ISD::UNINDEXED; }
1866 static bool classof(const SDNode *N) {
1867 return N->getOpcode() == ISD::LOAD ||
1868 N->getOpcode() == ISD::STORE;
1872 /// LoadSDNode - This class is used to represent ISD::LOAD nodes.
1874 class LoadSDNode : public LSBaseSDNode {
1875 friend class SelectionDAG;
1876 LoadSDNode(SDValue *ChainPtrOff, unsigned Order, DebugLoc dl, SDVTList VTs,
1877 ISD::MemIndexedMode AM, ISD::LoadExtType ETy, EVT MemVT,
1878 MachineMemOperand *MMO)
1879 : LSBaseSDNode(ISD::LOAD, Order, dl, ChainPtrOff, 3, VTs, AM, MemVT, MMO) {
1880 SubclassData |= (unsigned short)ETy;
1881 assert(getExtensionType() == ETy && "LoadExtType encoding error!");
1882 assert(readMem() && "Load MachineMemOperand is not a load!");
1883 assert(!writeMem() && "Load MachineMemOperand is a store!");
1887 /// getExtensionType - Return whether this is a plain node,
1888 /// or one of the varieties of value-extending loads.
1889 ISD::LoadExtType getExtensionType() const {
1890 return ISD::LoadExtType(SubclassData & 3);
1893 const SDValue &getBasePtr() const { return getOperand(1); }
1894 const SDValue &getOffset() const { return getOperand(2); }
1896 static bool classof(const SDNode *N) {
1897 return N->getOpcode() == ISD::LOAD;
1901 /// StoreSDNode - This class is used to represent ISD::STORE nodes.
1903 class StoreSDNode : public LSBaseSDNode {
1904 friend class SelectionDAG;
1905 StoreSDNode(SDValue *ChainValuePtrOff, unsigned Order, DebugLoc dl,
1906 SDVTList VTs, ISD::MemIndexedMode AM, bool isTrunc, EVT MemVT,
1907 MachineMemOperand *MMO)
1908 : LSBaseSDNode(ISD::STORE, Order, dl, ChainValuePtrOff, 4,
1909 VTs, AM, MemVT, MMO) {
1910 SubclassData |= (unsigned short)isTrunc;
1911 assert(isTruncatingStore() == isTrunc && "isTrunc encoding error!");
1912 assert(!readMem() && "Store MachineMemOperand is a load!");
1913 assert(writeMem() && "Store MachineMemOperand is not a store!");
1917 /// isTruncatingStore - Return true if the op does a truncation before store.
1918 /// For integers this is the same as doing a TRUNCATE and storing the result.
1919 /// For floats, it is the same as doing an FP_ROUND and storing the result.
1920 bool isTruncatingStore() const { return SubclassData & 1; }
1922 const SDValue &getValue() const { return getOperand(1); }
1923 const SDValue &getBasePtr() const { return getOperand(2); }
1924 const SDValue &getOffset() const { return getOperand(3); }
1926 static bool classof(const SDNode *N) {
1927 return N->getOpcode() == ISD::STORE;
1931 /// MaskedLoadStoreSDNode - This is a base class is used to represent MLOAD and
1934 class MaskedLoadStoreSDNode : public MemSDNode {
1938 friend class SelectionDAG;
1939 MaskedLoadStoreSDNode(ISD::NodeType NodeTy, unsigned Order, DebugLoc dl,
1940 SDValue *Operands, unsigned numOperands,
1941 SDVTList VTs, EVT MemVT, MachineMemOperand *MMO)
1942 : MemSDNode(NodeTy, Order, dl, VTs, MemVT, MMO) {
1943 InitOperands(Ops, Operands, numOperands);
1946 // In the both nodes address is Op1, mask is Op2:
1947 // MaskedLoadSDNode (Chain, ptr, mask, src0), src0 is a passthru value
1948 // MaskedStoreSDNode (Chain, ptr, mask, data)
1949 // Mask is a vector of i1 elements
1950 const SDValue &getBasePtr() const { return getOperand(1); }
1951 const SDValue &getMask() const { return getOperand(2); }
1953 static bool classof(const SDNode *N) {
1954 return N->getOpcode() == ISD::MLOAD ||
1955 N->getOpcode() == ISD::MSTORE;
1959 /// MaskedLoadSDNode - This class is used to represent an MLOAD node
1961 class MaskedLoadSDNode : public MaskedLoadStoreSDNode {
1963 friend class SelectionDAG;
1964 MaskedLoadSDNode(unsigned Order, DebugLoc dl,
1965 SDValue *Operands, unsigned numOperands,
1966 SDVTList VTs, EVT MemVT, MachineMemOperand *MMO)
1967 : MaskedLoadStoreSDNode(ISD::MLOAD, Order, dl, Operands, numOperands,
1971 const SDValue &getSrc0() const { return getOperand(3); }
1972 static bool classof(const SDNode *N) {
1973 return N->getOpcode() == ISD::MLOAD;
1977 /// MaskedStoreSDNode - This class is used to represent an MSTORE node
1979 class MaskedStoreSDNode : public MaskedLoadStoreSDNode {
1982 friend class SelectionDAG;
1983 MaskedStoreSDNode(unsigned Order, DebugLoc dl,
1984 SDValue *Operands, unsigned numOperands,
1985 SDVTList VTs, EVT MemVT, MachineMemOperand *MMO)
1986 : MaskedLoadStoreSDNode(ISD::MSTORE, Order, dl, Operands, numOperands,
1990 const SDValue &getData() const { return getOperand(3); }
1992 static bool classof(const SDNode *N) {
1993 return N->getOpcode() == ISD::MSTORE;
1997 /// MachineSDNode - An SDNode that represents everything that will be needed
1998 /// to construct a MachineInstr. These nodes are created during the
1999 /// instruction selection proper phase.
2001 class MachineSDNode : public SDNode {
2003 typedef MachineMemOperand **mmo_iterator;
2006 friend class SelectionDAG;
2007 MachineSDNode(unsigned Opc, unsigned Order, const DebugLoc DL, SDVTList VTs)
2008 : SDNode(Opc, Order, DL, VTs), MemRefs(nullptr), MemRefsEnd(nullptr) {}
2010 /// LocalOperands - Operands for this instruction, if they fit here. If
2011 /// they don't, this field is unused.
2012 SDUse LocalOperands[4];
2014 /// MemRefs - Memory reference descriptions for this instruction.
2015 mmo_iterator MemRefs;
2016 mmo_iterator MemRefsEnd;
2019 mmo_iterator memoperands_begin() const { return MemRefs; }
2020 mmo_iterator memoperands_end() const { return MemRefsEnd; }
2021 bool memoperands_empty() const { return MemRefsEnd == MemRefs; }
2023 /// setMemRefs - Assign this MachineSDNodes's memory reference descriptor
2024 /// list. This does not transfer ownership.
2025 void setMemRefs(mmo_iterator NewMemRefs, mmo_iterator NewMemRefsEnd) {
2026 for (mmo_iterator MMI = NewMemRefs, MME = NewMemRefsEnd; MMI != MME; ++MMI)
2027 assert(*MMI && "Null mem ref detected!");
2028 MemRefs = NewMemRefs;
2029 MemRefsEnd = NewMemRefsEnd;
2032 static bool classof(const SDNode *N) {
2033 return N->isMachineOpcode();
2037 class SDNodeIterator : public std::iterator<std::forward_iterator_tag,
2038 SDNode, ptrdiff_t> {
2042 SDNodeIterator(const SDNode *N, unsigned Op) : Node(N), Operand(Op) {}
2044 bool operator==(const SDNodeIterator& x) const {
2045 return Operand == x.Operand;
2047 bool operator!=(const SDNodeIterator& x) const { return !operator==(x); }
2049 const SDNodeIterator &operator=(const SDNodeIterator &I) {
2050 assert(I.Node == Node && "Cannot assign iterators to two different nodes!");
2051 Operand = I.Operand;
2055 pointer operator*() const {
2056 return Node->getOperand(Operand).getNode();
2058 pointer operator->() const { return operator*(); }
2060 SDNodeIterator& operator++() { // Preincrement
2064 SDNodeIterator operator++(int) { // Postincrement
2065 SDNodeIterator tmp = *this; ++*this; return tmp;
2067 size_t operator-(SDNodeIterator Other) const {
2068 assert(Node == Other.Node &&
2069 "Cannot compare iterators of two different nodes!");
2070 return Operand - Other.Operand;
2073 static SDNodeIterator begin(const SDNode *N) { return SDNodeIterator(N, 0); }
2074 static SDNodeIterator end (const SDNode *N) {
2075 return SDNodeIterator(N, N->getNumOperands());
2078 unsigned getOperand() const { return Operand; }
2079 const SDNode *getNode() const { return Node; }
2082 template <> struct GraphTraits<SDNode*> {
2083 typedef SDNode NodeType;
2084 typedef SDNodeIterator ChildIteratorType;
2085 static inline NodeType *getEntryNode(SDNode *N) { return N; }
2086 static inline ChildIteratorType child_begin(NodeType *N) {
2087 return SDNodeIterator::begin(N);
2089 static inline ChildIteratorType child_end(NodeType *N) {
2090 return SDNodeIterator::end(N);
2094 /// LargestSDNode - The largest SDNode class.
2096 typedef AtomicSDNode LargestSDNode;
2098 /// MostAlignedSDNode - The SDNode class with the greatest alignment
2101 typedef GlobalAddressSDNode MostAlignedSDNode;
2104 /// isNormalLoad - Returns true if the specified node is a non-extending
2105 /// and unindexed load.
2106 inline bool isNormalLoad(const SDNode *N) {
2107 const LoadSDNode *Ld = dyn_cast<LoadSDNode>(N);
2108 return Ld && Ld->getExtensionType() == ISD::NON_EXTLOAD &&
2109 Ld->getAddressingMode() == ISD::UNINDEXED;
2112 /// isNON_EXTLoad - Returns true if the specified node is a non-extending
2114 inline bool isNON_EXTLoad(const SDNode *N) {
2115 return isa<LoadSDNode>(N) &&
2116 cast<LoadSDNode>(N)->getExtensionType() == ISD::NON_EXTLOAD;
2119 /// isEXTLoad - Returns true if the specified node is a EXTLOAD.
2121 inline bool isEXTLoad(const SDNode *N) {
2122 return isa<LoadSDNode>(N) &&
2123 cast<LoadSDNode>(N)->getExtensionType() == ISD::EXTLOAD;
2126 /// isSEXTLoad - Returns true if the specified node is a SEXTLOAD.
2128 inline bool isSEXTLoad(const SDNode *N) {
2129 return isa<LoadSDNode>(N) &&
2130 cast<LoadSDNode>(N)->getExtensionType() == ISD::SEXTLOAD;
2133 /// isZEXTLoad - Returns true if the specified node is a ZEXTLOAD.
2135 inline bool isZEXTLoad(const SDNode *N) {
2136 return isa<LoadSDNode>(N) &&
2137 cast<LoadSDNode>(N)->getExtensionType() == ISD::ZEXTLOAD;
2140 /// isUNINDEXEDLoad - Returns true if the specified node is an unindexed load.
2142 inline bool isUNINDEXEDLoad(const SDNode *N) {
2143 return isa<LoadSDNode>(N) &&
2144 cast<LoadSDNode>(N)->getAddressingMode() == ISD::UNINDEXED;
2147 /// isNormalStore - Returns true if the specified node is a non-truncating
2148 /// and unindexed store.
2149 inline bool isNormalStore(const SDNode *N) {
2150 const StoreSDNode *St = dyn_cast<StoreSDNode>(N);
2151 return St && !St->isTruncatingStore() &&
2152 St->getAddressingMode() == ISD::UNINDEXED;
2155 /// isNON_TRUNCStore - Returns true if the specified node is a non-truncating
2157 inline bool isNON_TRUNCStore(const SDNode *N) {
2158 return isa<StoreSDNode>(N) && !cast<StoreSDNode>(N)->isTruncatingStore();
2161 /// isTRUNCStore - Returns true if the specified node is a truncating
2163 inline bool isTRUNCStore(const SDNode *N) {
2164 return isa<StoreSDNode>(N) && cast<StoreSDNode>(N)->isTruncatingStore();
2167 /// isUNINDEXEDStore - Returns true if the specified node is an
2168 /// unindexed store.
2169 inline bool isUNINDEXEDStore(const SDNode *N) {
2170 return isa<StoreSDNode>(N) &&
2171 cast<StoreSDNode>(N)->getAddressingMode() == ISD::UNINDEXED;
2175 } // end llvm namespace