LLVM  10.0.0svn
SelectionDAGNodes.h
Go to the documentation of this file.
1 //===- llvm/CodeGen/SelectionDAGNodes.h - SelectionDAG Nodes ----*- C++ -*-===//
2 //
3 // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4 // See https://llvm.org/LICENSE.txt for license information.
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6 //
7 //===----------------------------------------------------------------------===//
8 //
9 // This file declares the SDNode class and derived classes, which are used to
10 // represent the nodes and operations present in a SelectionDAG. These nodes
11 // and operations are machine code level operations, with some similarities to
12 // the GCC RTL representation.
13 //
14 // Clients should include the SelectionDAG.h file instead of this file directly.
15 //
16 //===----------------------------------------------------------------------===//
17 
18 #ifndef LLVM_CODEGEN_SELECTIONDAGNODES_H
19 #define LLVM_CODEGEN_SELECTIONDAGNODES_H
20 
21 #include "llvm/ADT/APFloat.h"
22 #include "llvm/ADT/ArrayRef.h"
23 #include "llvm/ADT/BitVector.h"
24 #include "llvm/ADT/FoldingSet.h"
25 #include "llvm/ADT/GraphTraits.h"
26 #include "llvm/ADT/SmallPtrSet.h"
27 #include "llvm/ADT/SmallVector.h"
28 #include "llvm/ADT/ilist_node.h"
29 #include "llvm/ADT/iterator.h"
34 #include "llvm/IR/Constants.h"
35 #include "llvm/IR/DebugLoc.h"
36 #include "llvm/IR/Instruction.h"
37 #include "llvm/IR/Instructions.h"
38 #include "llvm/IR/Metadata.h"
39 #include "llvm/IR/Operator.h"
40 #include "llvm/Support/AlignOf.h"
42 #include "llvm/Support/Casting.h"
45 #include <algorithm>
46 #include <cassert>
47 #include <climits>
48 #include <cstddef>
49 #include <cstdint>
50 #include <cstring>
51 #include <iterator>
52 #include <string>
53 #include <tuple>
54 
55 namespace llvm {
56 
57 class APInt;
58 class Constant;
59 template <typename T> struct DenseMapInfo;
60 class GlobalValue;
61 class MachineBasicBlock;
62 class MachineConstantPoolValue;
63 class MCSymbol;
64 class raw_ostream;
65 class SDNode;
66 class SelectionDAG;
67 class Type;
68 class Value;
69 
70 void checkForCycles(const SDNode *N, const SelectionDAG *DAG = nullptr,
71  bool force = false);
72 
73 /// This represents a list of ValueType's that has been intern'd by
74 /// a SelectionDAG. Instances of this simple value class are returned by
75 /// SelectionDAG::getVTList(...).
76 ///
77 struct SDVTList {
78  const EVT *VTs;
79  unsigned int NumVTs;
80 };
81 
82 namespace ISD {
83 
84  /// Node predicates
85 
86  /// If N is a BUILD_VECTOR node whose elements are all the same constant or
87  /// undefined, return true and return the constant value in \p SplatValue.
88  bool isConstantSplatVector(const SDNode *N, APInt &SplatValue);
89 
90  /// Return true if the specified node is a BUILD_VECTOR where all of the
91  /// elements are ~0 or undef.
92  bool isBuildVectorAllOnes(const SDNode *N);
93 
94  /// Return true if the specified node is a BUILD_VECTOR where all of the
95  /// elements are 0 or undef.
96  bool isBuildVectorAllZeros(const SDNode *N);
97 
98  /// Return true if the specified node is a BUILD_VECTOR node of all
99  /// ConstantSDNode or undef.
100  bool isBuildVectorOfConstantSDNodes(const SDNode *N);
101 
102  /// Return true if the specified node is a BUILD_VECTOR node of all
103  /// ConstantFPSDNode or undef.
105 
106  /// Return true if the node has at least one operand and all operands of the
107  /// specified node are ISD::UNDEF.
108  bool allOperandsUndef(const SDNode *N);
109 
110 } // end namespace ISD
111 
112 //===----------------------------------------------------------------------===//
113 /// Unlike LLVM values, Selection DAG nodes may return multiple
114 /// values as the result of a computation. Many nodes return multiple values,
115 /// from loads (which define a token and a return value) to ADDC (which returns
116 /// a result and a carry value), to calls (which may return an arbitrary number
117 /// of values).
118 ///
119 /// As such, each use of a SelectionDAG computation must indicate the node that
120 /// computes it as well as which return value to use from that node. This pair
121 /// of information is represented with the SDValue value type.
122 ///
123 class SDValue {
124  friend struct DenseMapInfo<SDValue>;
125 
126  SDNode *Node = nullptr; // The node defining the value we are using.
127  unsigned ResNo = 0; // Which return value of the node we are using.
128 
129 public:
130  SDValue() = default;
131  SDValue(SDNode *node, unsigned resno);
132 
133  /// get the index which selects a specific result in the SDNode
134  unsigned getResNo() const { return ResNo; }
135 
136  /// get the SDNode which holds the desired result
137  SDNode *getNode() const { return Node; }
138 
139  /// set the SDNode
140  void setNode(SDNode *N) { Node = N; }
141 
142  inline SDNode *operator->() const { return Node; }
143 
144  bool operator==(const SDValue &O) const {
145  return Node == O.Node && ResNo == O.ResNo;
146  }
147  bool operator!=(const SDValue &O) const {
148  return !operator==(O);
149  }
150  bool operator<(const SDValue &O) const {
151  return std::tie(Node, ResNo) < std::tie(O.Node, O.ResNo);
152  }
153  explicit operator bool() const {
154  return Node != nullptr;
155  }
156 
157  SDValue getValue(unsigned R) const {
158  return SDValue(Node, R);
159  }
160 
161  /// Return true if this node is an operand of N.
162  bool isOperandOf(const SDNode *N) const;
163 
164  /// Return the ValueType of the referenced return value.
165  inline EVT getValueType() const;
166 
167  /// Return the simple ValueType of the referenced return value.
169  return getValueType().getSimpleVT();
170  }
171 
172  /// Returns the size of the value in bits.
173  unsigned getValueSizeInBits() const {
174  return getValueType().getSizeInBits();
175  }
176 
177  unsigned getScalarValueSizeInBits() const {
178  return getValueType().getScalarType().getSizeInBits();
179  }
180 
181  // Forwarding methods - These forward to the corresponding methods in SDNode.
182  inline unsigned getOpcode() const;
183  inline unsigned getNumOperands() const;
184  inline const SDValue &getOperand(unsigned i) const;
185  inline uint64_t getConstantOperandVal(unsigned i) const;
186  inline const APInt &getConstantOperandAPInt(unsigned i) const;
187  inline bool isTargetMemoryOpcode() const;
188  inline bool isTargetOpcode() const;
189  inline bool isMachineOpcode() const;
190  inline bool isUndef() const;
191  inline unsigned getMachineOpcode() const;
192  inline const DebugLoc &getDebugLoc() const;
193  inline void dump() const;
194  inline void dump(const SelectionDAG *G) const;
195  inline void dumpr() const;
196  inline void dumpr(const SelectionDAG *G) const;
197 
198  /// Return true if this operand (which must be a chain) reaches the
199  /// specified operand without crossing any side-effecting instructions.
200  /// In practice, this looks through token factors and non-volatile loads.
201  /// In order to remain efficient, this only
202  /// looks a couple of nodes in, it does not do an exhaustive search.
203  bool reachesChainWithoutSideEffects(SDValue Dest,
204  unsigned Depth = 2) const;
205 
206  /// Return true if there are no nodes using value ResNo of Node.
207  inline bool use_empty() const;
208 
209  /// Return true if there is exactly one node using value ResNo of Node.
210  inline bool hasOneUse() const;
211 };
212 
213 template<> struct DenseMapInfo<SDValue> {
214  static inline SDValue getEmptyKey() {
215  SDValue V;
216  V.ResNo = -1U;
217  return V;
218  }
219 
220  static inline SDValue getTombstoneKey() {
221  SDValue V;
222  V.ResNo = -2U;
223  return V;
224  }
225 
226  static unsigned getHashValue(const SDValue &Val) {
227  return ((unsigned)((uintptr_t)Val.getNode() >> 4) ^
228  (unsigned)((uintptr_t)Val.getNode() >> 9)) + Val.getResNo();
229  }
230 
231  static bool isEqual(const SDValue &LHS, const SDValue &RHS) {
232  return LHS == RHS;
233  }
234 };
235 
236 /// Allow casting operators to work directly on
237 /// SDValues as if they were SDNode*'s.
238 template<> struct simplify_type<SDValue> {
239  using SimpleType = SDNode *;
240 
242  return Val.getNode();
243  }
244 };
245 template<> struct simplify_type<const SDValue> {
246  using SimpleType = /*const*/ SDNode *;
247 
248  static SimpleType getSimplifiedValue(const SDValue &Val) {
249  return Val.getNode();
250  }
251 };
252 
253 /// Represents a use of a SDNode. This class holds an SDValue,
254 /// which records the SDNode being used and the result number, a
255 /// pointer to the SDNode using the value, and Next and Prev pointers,
256 /// which link together all the uses of an SDNode.
257 ///
258 class SDUse {
259  /// Val - The value being used.
260  SDValue Val;
261  /// User - The user of this value.
262  SDNode *User = nullptr;
263  /// Prev, Next - Pointers to the uses list of the SDNode referred by
264  /// this operand.
265  SDUse **Prev = nullptr;
266  SDUse *Next = nullptr;
267 
268 public:
269  SDUse() = default;
270  SDUse(const SDUse &U) = delete;
271  SDUse &operator=(const SDUse &) = delete;
272 
273  /// Normally SDUse will just implicitly convert to an SDValue that it holds.
274  operator const SDValue&() const { return Val; }
275 
276  /// If implicit conversion to SDValue doesn't work, the get() method returns
277  /// the SDValue.
278  const SDValue &get() const { return Val; }
279 
280  /// This returns the SDNode that contains this Use.
281  SDNode *getUser() { return User; }
282 
283  /// Get the next SDUse in the use list.
284  SDUse *getNext() const { return Next; }
285 
286  /// Convenience function for get().getNode().
287  SDNode *getNode() const { return Val.getNode(); }
288  /// Convenience function for get().getResNo().
289  unsigned getResNo() const { return Val.getResNo(); }
290  /// Convenience function for get().getValueType().
291  EVT getValueType() const { return Val.getValueType(); }
292 
293  /// Convenience function for get().operator==
294  bool operator==(const SDValue &V) const {
295  return Val == V;
296  }
297 
298  /// Convenience function for get().operator!=
299  bool operator!=(const SDValue &V) const {
300  return Val != V;
301  }
302 
303  /// Convenience function for get().operator<
304  bool operator<(const SDValue &V) const {
305  return Val < V;
306  }
307 
308 private:
309  friend class SelectionDAG;
310  friend class SDNode;
311  // TODO: unfriend HandleSDNode once we fix its operand handling.
312  friend class HandleSDNode;
313 
314  void setUser(SDNode *p) { User = p; }
315 
316  /// Remove this use from its existing use list, assign it the
317  /// given value, and add it to the new value's node's use list.
318  inline void set(const SDValue &V);
319  /// Like set, but only supports initializing a newly-allocated
320  /// SDUse with a non-null value.
321  inline void setInitial(const SDValue &V);
322  /// Like set, but only sets the Node portion of the value,
323  /// leaving the ResNo portion unmodified.
324  inline void setNode(SDNode *N);
325 
326  void addToList(SDUse **List) {
327  Next = *List;
328  if (Next) Next->Prev = &Next;
329  Prev = List;
330  *List = this;
331  }
332 
333  void removeFromList() {
334  *Prev = Next;
335  if (Next) Next->Prev = Prev;
336  }
337 };
338 
339 /// simplify_type specializations - Allow casting operators to work directly on
340 /// SDValues as if they were SDNode*'s.
341 template<> struct simplify_type<SDUse> {
342  using SimpleType = SDNode *;
343 
345  return Val.getNode();
346  }
347 };
348 
349 /// These are IR-level optimization flags that may be propagated to SDNodes.
350 /// TODO: This data structure should be shared by the IR optimizer and the
351 /// the backend.
352 struct SDNodeFlags {
353 private:
354  // This bit is used to determine if the flags are in a defined state.
355  // Flag bits can only be masked out during intersection if the masking flags
356  // are defined.
357  bool AnyDefined : 1;
358 
359  bool NoUnsignedWrap : 1;
360  bool NoSignedWrap : 1;
361  bool Exact : 1;
362  bool NoNaNs : 1;
363  bool NoInfs : 1;
364  bool NoSignedZeros : 1;
365  bool AllowReciprocal : 1;
366  bool VectorReduction : 1;
367  bool AllowContract : 1;
368  bool ApproximateFuncs : 1;
369  bool AllowReassociation : 1;
370 
371  // We assume instructions do not raise floating-point exceptions by default,
372  // and only those marked explicitly may do so. We could choose to represent
373  // this via a positive "FPExcept" flags like on the MI level, but having a
374  // negative "NoFPExcept" flag here (that defaults to true) makes the flag
375  // intersection logic more straightforward.
376  bool NoFPExcept : 1;
377 
378 public:
379  /// Default constructor turns off all optimization flags.
381  : AnyDefined(false), NoUnsignedWrap(false), NoSignedWrap(false),
382  Exact(false), NoNaNs(false), NoInfs(false),
383  NoSignedZeros(false), AllowReciprocal(false), VectorReduction(false),
384  AllowContract(false), ApproximateFuncs(false),
385  AllowReassociation(false), NoFPExcept(true) {}
386 
387  /// Propagate the fast-math-flags from an IR FPMathOperator.
388  void copyFMF(const FPMathOperator &FPMO) {
389  setNoNaNs(FPMO.hasNoNaNs());
390  setNoInfs(FPMO.hasNoInfs());
391  setNoSignedZeros(FPMO.hasNoSignedZeros());
392  setAllowReciprocal(FPMO.hasAllowReciprocal());
393  setAllowContract(FPMO.hasAllowContract());
394  setApproximateFuncs(FPMO.hasApproxFunc());
395  setAllowReassociation(FPMO.hasAllowReassoc());
396  }
397 
398  /// Sets the state of the flags to the defined state.
399  void setDefined() { AnyDefined = true; }
400  /// Returns true if the flags are in a defined state.
401  bool isDefined() const { return AnyDefined; }
402 
403  // These are mutators for each flag.
404  void setNoUnsignedWrap(bool b) {
405  setDefined();
406  NoUnsignedWrap = b;
407  }
408  void setNoSignedWrap(bool b) {
409  setDefined();
410  NoSignedWrap = b;
411  }
412  void setExact(bool b) {
413  setDefined();
414  Exact = b;
415  }
416  void setNoNaNs(bool b) {
417  setDefined();
418  NoNaNs = b;
419  }
420  void setNoInfs(bool b) {
421  setDefined();
422  NoInfs = b;
423  }
424  void setNoSignedZeros(bool b) {
425  setDefined();
426  NoSignedZeros = b;
427  }
428  void setAllowReciprocal(bool b) {
429  setDefined();
430  AllowReciprocal = b;
431  }
432  void setVectorReduction(bool b) {
433  setDefined();
434  VectorReduction = b;
435  }
436  void setAllowContract(bool b) {
437  setDefined();
438  AllowContract = b;
439  }
440  void setApproximateFuncs(bool b) {
441  setDefined();
442  ApproximateFuncs = b;
443  }
444  void setAllowReassociation(bool b) {
445  setDefined();
446  AllowReassociation = b;
447  }
448  void setFPExcept(bool b) {
449  setDefined();
450  NoFPExcept = !b;
451  }
452 
453  // These are accessors for each flag.
454  bool hasNoUnsignedWrap() const { return NoUnsignedWrap; }
455  bool hasNoSignedWrap() const { return NoSignedWrap; }
456  bool hasExact() const { return Exact; }
457  bool hasNoNaNs() const { return NoNaNs; }
458  bool hasNoInfs() const { return NoInfs; }
459  bool hasNoSignedZeros() const { return NoSignedZeros; }
460  bool hasAllowReciprocal() const { return AllowReciprocal; }
461  bool hasVectorReduction() const { return VectorReduction; }
462  bool hasAllowContract() const { return AllowContract; }
463  bool hasApproximateFuncs() const { return ApproximateFuncs; }
464  bool hasAllowReassociation() const { return AllowReassociation; }
465  bool hasFPExcept() const { return !NoFPExcept; }
466 
467  bool isFast() const {
468  return NoSignedZeros && AllowReciprocal && NoNaNs && NoInfs && NoFPExcept &&
469  AllowContract && ApproximateFuncs && AllowReassociation;
470  }
471 
472  /// Clear any flags in this flag set that aren't also set in Flags.
473  /// If the given Flags are undefined then don't do anything.
474  void intersectWith(const SDNodeFlags Flags) {
475  if (!Flags.isDefined())
476  return;
477  NoUnsignedWrap &= Flags.NoUnsignedWrap;
478  NoSignedWrap &= Flags.NoSignedWrap;
479  Exact &= Flags.Exact;
480  NoNaNs &= Flags.NoNaNs;
481  NoInfs &= Flags.NoInfs;
482  NoSignedZeros &= Flags.NoSignedZeros;
483  AllowReciprocal &= Flags.AllowReciprocal;
484  VectorReduction &= Flags.VectorReduction;
485  AllowContract &= Flags.AllowContract;
486  ApproximateFuncs &= Flags.ApproximateFuncs;
487  AllowReassociation &= Flags.AllowReassociation;
488  NoFPExcept &= Flags.NoFPExcept;
489  }
490 };
491 
492 /// Represents one node in the SelectionDAG.
493 ///
494 class SDNode : public FoldingSetNode, public ilist_node<SDNode> {
495 private:
496  /// The operation that this node performs.
497  int16_t NodeType;
498 
499 protected:
500  // We define a set of mini-helper classes to help us interpret the bits in our
501  // SubclassData. These are designed to fit within a uint16_t so they pack
502  // with NodeType.
503 
504 #if defined(_AIX) && (!defined(__GNUC__) || defined(__ibmxl__))
505 // Except for GCC; by default, AIX compilers store bit-fields in 4-byte words
506 // and give the `pack` pragma push semantics.
507 #define BEGIN_TWO_BYTE_PACK() _Pragma("pack(2)")
508 #define END_TWO_BYTE_PACK() _Pragma("pack(pop)")
509 #else
510 #define BEGIN_TWO_BYTE_PACK()
511 #define END_TWO_BYTE_PACK()
512 #endif
513 
516  friend class SDNode;
517  friend class MemIntrinsicSDNode;
518  friend class MemSDNode;
519  friend class SelectionDAG;
520 
521  uint16_t HasDebugValue : 1;
522  uint16_t IsMemIntrinsic : 1;
523  uint16_t IsDivergent : 1;
524  };
525  enum { NumSDNodeBits = 3 };
526 
528  friend class ConstantSDNode;
529 
530  uint16_t : NumSDNodeBits;
531 
532  uint16_t IsOpaque : 1;
533  };
534 
536  friend class MemSDNode;
537  friend class MemIntrinsicSDNode;
538  friend class AtomicSDNode;
539 
540  uint16_t : NumSDNodeBits;
541 
542  uint16_t IsVolatile : 1;
543  uint16_t IsNonTemporal : 1;
544  uint16_t IsDereferenceable : 1;
545  uint16_t IsInvariant : 1;
546  };
547  enum { NumMemSDNodeBits = NumSDNodeBits + 4 };
548 
550  friend class LSBaseSDNode;
552 
553  uint16_t : NumMemSDNodeBits;
554 
555  // This storage is shared between disparate class hierarchies to hold an
556  // enumeration specific to the class hierarchy in use.
557  // LSBaseSDNode => enum ISD::MemIndexedMode
558  // MaskedGatherScatterSDNode => enum ISD::MemIndexType
559  uint16_t AddressingMode : 3;
560  };
561  enum { NumLSBaseSDNodeBits = NumMemSDNodeBits + 3 };
562 
564  friend class LoadSDNode;
565  friend class MaskedLoadSDNode;
566 
567  uint16_t : NumLSBaseSDNodeBits;
568 
569  uint16_t ExtTy : 2; // enum ISD::LoadExtType
570  uint16_t IsExpanding : 1;
571  };
572 
574  friend class StoreSDNode;
575  friend class MaskedStoreSDNode;
576 
577  uint16_t : NumLSBaseSDNodeBits;
578 
579  uint16_t IsTruncating : 1;
580  uint16_t IsCompressing : 1;
581  };
582 
583  union {
584  char RawSDNodeBits[sizeof(uint16_t)];
591  };
593 #undef BEGIN_TWO_BYTE_PACK
594 #undef END_TWO_BYTE_PACK
595 
596  // RawSDNodeBits must cover the entirety of the union. This means that all of
597  // the union's members must have size <= RawSDNodeBits. We write the RHS as
598  // "2" instead of sizeof(RawSDNodeBits) because MSVC can't handle the latter.
599  static_assert(sizeof(SDNodeBitfields) <= 2, "field too wide");
600  static_assert(sizeof(ConstantSDNodeBitfields) <= 2, "field too wide");
601  static_assert(sizeof(MemSDNodeBitfields) <= 2, "field too wide");
602  static_assert(sizeof(LSBaseSDNodeBitfields) <= 2, "field too wide");
603  static_assert(sizeof(LoadSDNodeBitfields) <= 2, "field too wide");
604  static_assert(sizeof(StoreSDNodeBitfields) <= 2, "field too wide");
605 
606 private:
607  friend class SelectionDAG;
608  // TODO: unfriend HandleSDNode once we fix its operand handling.
609  friend class HandleSDNode;
610 
611  /// Unique id per SDNode in the DAG.
612  int NodeId = -1;
613 
614  /// The values that are used by this operation.
615  SDUse *OperandList = nullptr;
616 
617  /// The types of the values this node defines. SDNode's may
618  /// define multiple values simultaneously.
619  const EVT *ValueList;
620 
621  /// List of uses for this SDNode.
622  SDUse *UseList = nullptr;
623 
624  /// The number of entries in the Operand/Value list.
625  unsigned short NumOperands = 0;
626  unsigned short NumValues;
627 
628  // The ordering of the SDNodes. It roughly corresponds to the ordering of the
629  // original LLVM instructions.
630  // This is used for turning off scheduling, because we'll forgo
631  // the normal scheduling algorithms and output the instructions according to
632  // this ordering.
633  unsigned IROrder;
634 
635  /// Source line information.
636  DebugLoc debugLoc;
637 
638  /// Return a pointer to the specified value type.
639  static const EVT *getValueTypeList(EVT VT);
640 
641  SDNodeFlags Flags;
642 
643 public:
644  /// Unique and persistent id per SDNode in the DAG.
645  /// Used for debug printing.
646  uint16_t PersistentId;
647 
648  //===--------------------------------------------------------------------===//
649  // Accessors
650  //
651 
652  /// Return the SelectionDAG opcode value for this node. For
653  /// pre-isel nodes (those for which isMachineOpcode returns false), these
654  /// are the opcode values in the ISD and <target>ISD namespaces. For
655  /// post-isel opcodes, see getMachineOpcode.
656  unsigned getOpcode() const { return (unsigned short)NodeType; }
657 
658  /// Test if this node has a target-specific opcode (in the
659  /// <target>ISD namespace).
660  bool isTargetOpcode() const { return NodeType >= ISD::BUILTIN_OP_END; }
661 
662  /// Test if this node has a target-specific
663  /// memory-referencing opcode (in the <target>ISD namespace and
664  /// greater than FIRST_TARGET_MEMORY_OPCODE).
665  bool isTargetMemoryOpcode() const {
666  return NodeType >= ISD::FIRST_TARGET_MEMORY_OPCODE;
667  }
668 
669  /// Return true if the type of the node type undefined.
670  bool isUndef() const { return NodeType == ISD::UNDEF; }
671 
672  /// Test if this node is a memory intrinsic (with valid pointer information).
673  /// INTRINSIC_W_CHAIN and INTRINSIC_VOID nodes are sometimes created for
674  /// non-memory intrinsics (with chains) that are not really instances of
675  /// MemSDNode. For such nodes, we need some extra state to determine the
676  /// proper classof relationship.
677  bool isMemIntrinsic() const {
678  return (NodeType == ISD::INTRINSIC_W_CHAIN ||
679  NodeType == ISD::INTRINSIC_VOID) &&
680  SDNodeBits.IsMemIntrinsic;
681  }
682 
683  /// Test if this node is a strict floating point pseudo-op.
685  switch (NodeType) {
686  default:
687  return false;
688  case ISD::STRICT_FADD:
689  case ISD::STRICT_FSUB:
690  case ISD::STRICT_FMUL:
691  case ISD::STRICT_FDIV:
692  case ISD::STRICT_FREM:
693  case ISD::STRICT_FMA:
694  case ISD::STRICT_FSQRT:
695  case ISD::STRICT_FPOW:
696  case ISD::STRICT_FPOWI:
697  case ISD::STRICT_FSIN:
698  case ISD::STRICT_FCOS:
699  case ISD::STRICT_FEXP:
700  case ISD::STRICT_FEXP2:
701  case ISD::STRICT_FLOG:
702  case ISD::STRICT_FLOG10:
703  case ISD::STRICT_FLOG2:
704  case ISD::STRICT_FRINT:
706  case ISD::STRICT_FMAXNUM:
707  case ISD::STRICT_FMINNUM:
708  case ISD::STRICT_FCEIL:
709  case ISD::STRICT_FFLOOR:
710  case ISD::STRICT_FROUND:
711  case ISD::STRICT_FTRUNC:
716  return true;
717  }
718  }
719 
720  /// Test if this node has a post-isel opcode, directly
721  /// corresponding to a MachineInstr opcode.
722  bool isMachineOpcode() const { return NodeType < 0; }
723 
724  /// This may only be called if isMachineOpcode returns
725  /// true. It returns the MachineInstr opcode value that the node's opcode
726  /// corresponds to.
727  unsigned getMachineOpcode() const {
728  assert(isMachineOpcode() && "Not a MachineInstr opcode!");
729  return ~NodeType;
730  }
731 
732  bool getHasDebugValue() const { return SDNodeBits.HasDebugValue; }
733  void setHasDebugValue(bool b) { SDNodeBits.HasDebugValue = b; }
734 
735  bool isDivergent() const { return SDNodeBits.IsDivergent; }
736 
737  /// Return true if there are no uses of this node.
738  bool use_empty() const { return UseList == nullptr; }
739 
740  /// Return true if there is exactly one use of this node.
741  bool hasOneUse() const {
742  return !use_empty() && std::next(use_begin()) == use_end();
743  }
744 
745  /// Return the number of uses of this node. This method takes
746  /// time proportional to the number of uses.
747  size_t use_size() const { return std::distance(use_begin(), use_end()); }
748 
749  /// Return the unique node id.
750  int getNodeId() const { return NodeId; }
751 
752  /// Set unique node id.
753  void setNodeId(int Id) { NodeId = Id; }
754 
755  /// Return the node ordering.
756  unsigned getIROrder() const { return IROrder; }
757 
758  /// Set the node ordering.
759  void setIROrder(unsigned Order) { IROrder = Order; }
760 
761  /// Return the source location info.
762  const DebugLoc &getDebugLoc() const { return debugLoc; }
763 
764  /// Set source location info. Try to avoid this, putting
765  /// it in the constructor is preferable.
766  void setDebugLoc(DebugLoc dl) { debugLoc = std::move(dl); }
767 
768  /// This class provides iterator support for SDUse
769  /// operands that use a specific SDNode.
771  : public std::iterator<std::forward_iterator_tag, SDUse, ptrdiff_t> {
772  friend class SDNode;
773 
774  SDUse *Op = nullptr;
775 
776  explicit use_iterator(SDUse *op) : Op(op) {}
777 
778  public:
779  using reference = std::iterator<std::forward_iterator_tag,
781  using pointer = std::iterator<std::forward_iterator_tag,
783 
784  use_iterator() = default;
785  use_iterator(const use_iterator &I) : Op(I.Op) {}
786 
787  bool operator==(const use_iterator &x) const {
788  return Op == x.Op;
789  }
790  bool operator!=(const use_iterator &x) const {
791  return !operator==(x);
792  }
793 
794  /// Return true if this iterator is at the end of uses list.
795  bool atEnd() const { return Op == nullptr; }
796 
797  // Iterator traversal: forward iteration only.
798  use_iterator &operator++() { // Preincrement
799  assert(Op && "Cannot increment end iterator!");
800  Op = Op->getNext();
801  return *this;
802  }
803 
804  use_iterator operator++(int) { // Postincrement
805  use_iterator tmp = *this; ++*this; return tmp;
806  }
807 
808  /// Retrieve a pointer to the current user node.
809  SDNode *operator*() const {
810  assert(Op && "Cannot dereference end iterator!");
811  return Op->getUser();
812  }
813 
814  SDNode *operator->() const { return operator*(); }
815 
816  SDUse &getUse() const { return *Op; }
817 
818  /// Retrieve the operand # of this use in its user.
819  unsigned getOperandNo() const {
820  assert(Op && "Cannot dereference end iterator!");
821  return (unsigned)(Op - Op->getUser()->OperandList);
822  }
823  };
824 
825  /// Provide iteration support to walk over all uses of an SDNode.
827  return use_iterator(UseList);
828  }
829 
830  static use_iterator use_end() { return use_iterator(nullptr); }
831 
833  return make_range(use_begin(), use_end());
834  }
836  return make_range(use_begin(), use_end());
837  }
838 
839  /// Return true if there are exactly NUSES uses of the indicated value.
840  /// This method ignores uses of other values defined by this operation.
841  bool hasNUsesOfValue(unsigned NUses, unsigned Value) const;
842 
843  /// Return true if there are any use of the indicated value.
844  /// This method ignores uses of other values defined by this operation.
845  bool hasAnyUseOfValue(unsigned Value) const;
846 
847  /// Return true if this node is the only use of N.
848  bool isOnlyUserOf(const SDNode *N) const;
849 
850  /// Return true if this node is an operand of N.
851  bool isOperandOf(const SDNode *N) const;
852 
853  /// Return true if this node is a predecessor of N.
854  /// NOTE: Implemented on top of hasPredecessor and every bit as
855  /// expensive. Use carefully.
856  bool isPredecessorOf(const SDNode *N) const {
857  return N->hasPredecessor(this);
858  }
859 
860  /// Return true if N is a predecessor of this node.
861  /// N is either an operand of this node, or can be reached by recursively
862  /// traversing up the operands.
863  /// NOTE: This is an expensive method. Use it carefully.
864  bool hasPredecessor(const SDNode *N) const;
865 
866  /// Returns true if N is a predecessor of any node in Worklist. This
867  /// helper keeps Visited and Worklist sets externally to allow unions
868  /// searches to be performed in parallel, caching of results across
869  /// queries and incremental addition to Worklist. Stops early if N is
870  /// found but will resume. Remember to clear Visited and Worklists
871  /// if DAG changes. MaxSteps gives a maximum number of nodes to visit before
872  /// giving up. The TopologicalPrune flag signals that positive NodeIds are
873  /// topologically ordered (Operands have strictly smaller node id) and search
874  /// can be pruned leveraging this.
875  static bool hasPredecessorHelper(const SDNode *N,
878  unsigned int MaxSteps = 0,
879  bool TopologicalPrune = false) {
880  SmallVector<const SDNode *, 8> DeferredNodes;
881  if (Visited.count(N))
882  return true;
883 
884  // Node Id's are assigned in three places: As a topological
885  // ordering (> 0), during legalization (results in values set to
886  // 0), new nodes (set to -1). If N has a topolgical id then we
887  // know that all nodes with ids smaller than it cannot be
888  // successors and we need not check them. Filter out all node
889  // that can't be matches. We add them to the worklist before exit
890  // in case of multiple calls. Note that during selection the topological id
891  // may be violated if a node's predecessor is selected before it. We mark
892  // this at selection negating the id of unselected successors and
893  // restricting topological pruning to positive ids.
894 
895  int NId = N->getNodeId();
896  // If we Invalidated the Id, reconstruct original NId.
897  if (NId < -1)
898  NId = -(NId + 1);
899 
900  bool Found = false;
901  while (!Worklist.empty()) {
902  const SDNode *M = Worklist.pop_back_val();
903  int MId = M->getNodeId();
904  if (TopologicalPrune && M->getOpcode() != ISD::TokenFactor && (NId > 0) &&
905  (MId > 0) && (MId < NId)) {
906  DeferredNodes.push_back(M);
907  continue;
908  }
909  for (const SDValue &OpV : M->op_values()) {
910  SDNode *Op = OpV.getNode();
911  if (Visited.insert(Op).second)
912  Worklist.push_back(Op);
913  if (Op == N)
914  Found = true;
915  }
916  if (Found)
917  break;
918  if (MaxSteps != 0 && Visited.size() >= MaxSteps)
919  break;
920  }
921  // Push deferred nodes back on worklist.
922  Worklist.append(DeferredNodes.begin(), DeferredNodes.end());
923  // If we bailed early, conservatively return found.
924  if (MaxSteps != 0 && Visited.size() >= MaxSteps)
925  return true;
926  return Found;
927  }
928 
929  /// Return true if all the users of N are contained in Nodes.
930  /// NOTE: Requires at least one match, but doesn't require them all.
931  static bool areOnlyUsersOf(ArrayRef<const SDNode *> Nodes, const SDNode *N);
932 
933  /// Return the number of values used by this operation.
934  unsigned getNumOperands() const { return NumOperands; }
935 
936  /// Return the maximum number of operands that a SDNode can hold.
937  static constexpr size_t getMaxNumOperands() {
939  }
940 
941  /// Helper method returns the integer value of a ConstantSDNode operand.
942  inline uint64_t getConstantOperandVal(unsigned Num) const;
943 
944  /// Helper method returns the APInt of a ConstantSDNode operand.
945  inline const APInt &getConstantOperandAPInt(unsigned Num) const;
946 
947  const SDValue &getOperand(unsigned Num) const {
948  assert(Num < NumOperands && "Invalid child # of SDNode!");
949  return OperandList[Num];
950  }
951 
952  using op_iterator = SDUse *;
953 
954  op_iterator op_begin() const { return OperandList; }
955  op_iterator op_end() const { return OperandList+NumOperands; }
956  ArrayRef<SDUse> ops() const { return makeArrayRef(op_begin(), op_end()); }
957 
958  /// Iterator for directly iterating over the operand SDValue's.
960  : iterator_adaptor_base<value_op_iterator, op_iterator,
961  std::random_access_iterator_tag, SDValue,
962  ptrdiff_t, value_op_iterator *,
963  value_op_iterator *> {
964  explicit value_op_iterator(SDUse *U = nullptr)
965  : iterator_adaptor_base(U) {}
966 
967  const SDValue &operator*() const { return I->get(); }
968  };
969 
971  return make_range(value_op_iterator(op_begin()),
972  value_op_iterator(op_end()));
973  }
974 
975  SDVTList getVTList() const {
976  SDVTList X = { ValueList, NumValues };
977  return X;
978  }
979 
980  /// If this node has a glue operand, return the node
981  /// to which the glue operand points. Otherwise return NULL.
982  SDNode *getGluedNode() const {
983  if (getNumOperands() != 0 &&
984  getOperand(getNumOperands()-1).getValueType() == MVT::Glue)
985  return getOperand(getNumOperands()-1).getNode();
986  return nullptr;
987  }
988 
989  /// If this node has a glue value with a user, return
990  /// the user (there is at most one). Otherwise return NULL.
991  SDNode *getGluedUser() const {
992  for (use_iterator UI = use_begin(), UE = use_end(); UI != UE; ++UI)
993  if (UI.getUse().get().getValueType() == MVT::Glue)
994  return *UI;
995  return nullptr;
996  }
997 
998  const SDNodeFlags getFlags() const { return Flags; }
999  void setFlags(SDNodeFlags NewFlags) { Flags = NewFlags; }
1000  bool isFast() { return Flags.isFast(); }
1001 
1002  /// Clear any flags in this node that aren't also set in Flags.
1003  /// If Flags is not in a defined state then this has no effect.
1004  void intersectFlagsWith(const SDNodeFlags Flags);
1005 
1006  /// Return the number of values defined/returned by this operator.
1007  unsigned getNumValues() const { return NumValues; }
1008 
1009  /// Return the type of a specified result.
1010  EVT getValueType(unsigned ResNo) const {
1011  assert(ResNo < NumValues && "Illegal result number!");
1012  return ValueList[ResNo];
1013  }
1014 
1015  /// Return the type of a specified result as a simple type.
1016  MVT getSimpleValueType(unsigned ResNo) const {
1017  return getValueType(ResNo).getSimpleVT();
1018  }
1019 
1020  /// Returns MVT::getSizeInBits(getValueType(ResNo)).
1021  unsigned getValueSizeInBits(unsigned ResNo) const {
1022  return getValueType(ResNo).getSizeInBits();
1023  }
1024 
1025  using value_iterator = const EVT *;
1026 
1027  value_iterator value_begin() const { return ValueList; }
1028  value_iterator value_end() const { return ValueList+NumValues; }
1029 
1030  /// Return the opcode of this operation for printing.
1031  std::string getOperationName(const SelectionDAG *G = nullptr) const;
1032  static const char* getIndexedModeName(ISD::MemIndexedMode AM);
1033  void print_types(raw_ostream &OS, const SelectionDAG *G) const;
1034  void print_details(raw_ostream &OS, const SelectionDAG *G) const;
1035  void print(raw_ostream &OS, const SelectionDAG *G = nullptr) const;
1036  void printr(raw_ostream &OS, const SelectionDAG *G = nullptr) const;
1037 
1038  /// Print a SelectionDAG node and all children down to
1039  /// the leaves. The given SelectionDAG allows target-specific nodes
1040  /// to be printed in human-readable form. Unlike printr, this will
1041  /// print the whole DAG, including children that appear multiple
1042  /// times.
1043  ///
1044  void printrFull(raw_ostream &O, const SelectionDAG *G = nullptr) const;
1045 
1046  /// Print a SelectionDAG node and children up to
1047  /// depth "depth." The given SelectionDAG allows target-specific
1048  /// nodes to be printed in human-readable form. Unlike printr, this
1049  /// will print children that appear multiple times wherever they are
1050  /// used.
1051  ///
1052  void printrWithDepth(raw_ostream &O, const SelectionDAG *G = nullptr,
1053  unsigned depth = 100) const;
1054 
1055  /// Dump this node, for debugging.
1056  void dump() const;
1057 
1058  /// Dump (recursively) this node and its use-def subgraph.
1059  void dumpr() const;
1060 
1061  /// Dump this node, for debugging.
1062  /// The given SelectionDAG allows target-specific nodes to be printed
1063  /// in human-readable form.
1064  void dump(const SelectionDAG *G) const;
1065 
1066  /// Dump (recursively) this node and its use-def subgraph.
1067  /// The given SelectionDAG allows target-specific nodes to be printed
1068  /// in human-readable form.
1069  void dumpr(const SelectionDAG *G) const;
1070 
1071  /// printrFull to dbgs(). The given SelectionDAG allows
1072  /// target-specific nodes to be printed in human-readable form.
1073  /// Unlike dumpr, this will print the whole DAG, including children
1074  /// that appear multiple times.
1075  void dumprFull(const SelectionDAG *G = nullptr) const;
1076 
1077  /// printrWithDepth to dbgs(). The given
1078  /// SelectionDAG allows target-specific nodes to be printed in
1079  /// human-readable form. Unlike dumpr, this will print children
1080  /// that appear multiple times wherever they are used.
1081  ///
1082  void dumprWithDepth(const SelectionDAG *G = nullptr,
1083  unsigned depth = 100) const;
1084 
1085  /// Gather unique data for the node.
1086  void Profile(FoldingSetNodeID &ID) const;
1087 
1088  /// This method should only be used by the SDUse class.
1089  void addUse(SDUse &U) { U.addToList(&UseList); }
1090 
1091 protected:
1092  static SDVTList getSDVTList(EVT VT) {
1093  SDVTList Ret = { getValueTypeList(VT), 1 };
1094  return Ret;
1095  }
1096 
1097  /// Create an SDNode.
1098  ///
1099  /// SDNodes are created without any operands, and never own the operand
1100  /// storage. To add operands, see SelectionDAG::createOperands.
1101  SDNode(unsigned Opc, unsigned Order, DebugLoc dl, SDVTList VTs)
1102  : NodeType(Opc), ValueList(VTs.VTs), NumValues(VTs.NumVTs),
1103  IROrder(Order), debugLoc(std::move(dl)) {
1104  memset(&RawSDNodeBits, 0, sizeof(RawSDNodeBits));
1105  assert(debugLoc.hasTrivialDestructor() && "Expected trivial destructor");
1106  assert(NumValues == VTs.NumVTs &&
1107  "NumValues wasn't wide enough for its operands!");
1108  }
1109 
1110  /// Release the operands and set this node to have zero operands.
1111  void DropOperands();
1112 };
1113 
1114 /// Wrapper class for IR location info (IR ordering and DebugLoc) to be passed
1115 /// into SDNode creation functions.
1116 /// When an SDNode is created from the DAGBuilder, the DebugLoc is extracted
1117 /// from the original Instruction, and IROrder is the ordinal position of
1118 /// the instruction.
1119 /// When an SDNode is created after the DAG is being built, both DebugLoc and
1120 /// the IROrder are propagated from the original SDNode.
1121 /// So SDLoc class provides two constructors besides the default one, one to
1122 /// be used by the DAGBuilder, the other to be used by others.
1123 class SDLoc {
1124 private:
1125  DebugLoc DL;
1126  int IROrder = 0;
1127 
1128 public:
1129  SDLoc() = default;
1130  SDLoc(const SDNode *N) : DL(N->getDebugLoc()), IROrder(N->getIROrder()) {}
1131  SDLoc(const SDValue V) : SDLoc(V.getNode()) {}
1132  SDLoc(const Instruction *I, int Order) : IROrder(Order) {
1133  assert(Order >= 0 && "bad IROrder");
1134  if (I)
1135  DL = I->getDebugLoc();
1136  }
1137 
1138  unsigned getIROrder() const { return IROrder; }
1139  const DebugLoc &getDebugLoc() const { return DL; }
1140 };
1141 
1142 // Define inline functions from the SDValue class.
1143 
1144 inline SDValue::SDValue(SDNode *node, unsigned resno)
1145  : Node(node), ResNo(resno) {
1146  // Explicitly check for !ResNo to avoid use-after-free, because there are
1147  // callers that use SDValue(N, 0) with a deleted N to indicate successful
1148  // combines.
1149  assert((!Node || !ResNo || ResNo < Node->getNumValues()) &&
1150  "Invalid result number for the given node!");
1151  assert(ResNo < -2U && "Cannot use result numbers reserved for DenseMaps.");
1152 }
1153 
1154 inline unsigned SDValue::getOpcode() const {
1155  return Node->getOpcode();
1156 }
1157 
1158 inline EVT SDValue::getValueType() const {
1159  return Node->getValueType(ResNo);
1160 }
1161 
1162 inline unsigned SDValue::getNumOperands() const {
1163  return Node->getNumOperands();
1164 }
1165 
1166 inline const SDValue &SDValue::getOperand(unsigned i) const {
1167  return Node->getOperand(i);
1168 }
1169 
1170 inline uint64_t SDValue::getConstantOperandVal(unsigned i) const {
1171  return Node->getConstantOperandVal(i);
1172 }
1173 
1174 inline const APInt &SDValue::getConstantOperandAPInt(unsigned i) const {
1175  return Node->getConstantOperandAPInt(i);
1176 }
1177 
1178 inline bool SDValue::isTargetOpcode() const {
1179  return Node->isTargetOpcode();
1180 }
1181 
1182 inline bool SDValue::isTargetMemoryOpcode() const {
1183  return Node->isTargetMemoryOpcode();
1184 }
1185 
1186 inline bool SDValue::isMachineOpcode() const {
1187  return Node->isMachineOpcode();
1188 }
1189 
1190 inline unsigned SDValue::getMachineOpcode() const {
1191  return Node->getMachineOpcode();
1192 }
1193 
1194 inline bool SDValue::isUndef() const {
1195  return Node->isUndef();
1196 }
1197 
1198 inline bool SDValue::use_empty() const {
1199  return !Node->hasAnyUseOfValue(ResNo);
1200 }
1201 
1202 inline bool SDValue::hasOneUse() const {
1203  return Node->hasNUsesOfValue(1, ResNo);
1204 }
1205 
1206 inline const DebugLoc &SDValue::getDebugLoc() const {
1207  return Node->getDebugLoc();
1208 }
1209 
1210 inline void SDValue::dump() const {
1211  return Node->dump();
1212 }
1213 
1214 inline void SDValue::dump(const SelectionDAG *G) const {
1215  return Node->dump(G);
1216 }
1217 
1218 inline void SDValue::dumpr() const {
1219  return Node->dumpr();
1220 }
1221 
1222 inline void SDValue::dumpr(const SelectionDAG *G) const {
1223  return Node->dumpr(G);
1224 }
1225 
1226 // Define inline functions from the SDUse class.
1227 
1228 inline void SDUse::set(const SDValue &V) {
1229  if (Val.getNode()) removeFromList();
1230  Val = V;
1231  if (V.getNode()) V.getNode()->addUse(*this);
1232 }
1233 
1234 inline void SDUse::setInitial(const SDValue &V) {
1235  Val = V;
1236  V.getNode()->addUse(*this);
1237 }
1238 
1239 inline void SDUse::setNode(SDNode *N) {
1240  if (Val.getNode()) removeFromList();
1241  Val.setNode(N);
1242  if (N) N->addUse(*this);
1243 }
1244 
1245 /// This class is used to form a handle around another node that
1246 /// is persistent and is updated across invocations of replaceAllUsesWith on its
1247 /// operand. This node should be directly created by end-users and not added to
1248 /// the AllNodes list.
1249 class HandleSDNode : public SDNode {
1250  SDUse Op;
1251 
1252 public:
1254  : SDNode(ISD::HANDLENODE, 0, DebugLoc(), getSDVTList(MVT::Other)) {
1255  // HandleSDNodes are never inserted into the DAG, so they won't be
1256  // auto-numbered. Use ID 65535 as a sentinel.
1257  PersistentId = 0xffff;
1258 
1259  // Manually set up the operand list. This node type is special in that it's
1260  // always stack allocated and SelectionDAG does not manage its operands.
1261  // TODO: This should either (a) not be in the SDNode hierarchy, or (b) not
1262  // be so special.
1263  Op.setUser(this);
1264  Op.setInitial(X);
1265  NumOperands = 1;
1266  OperandList = &Op;
1267  }
1268  ~HandleSDNode();
1269 
1270  const SDValue &getValue() const { return Op; }
1271 };
1272 
1273 class AddrSpaceCastSDNode : public SDNode {
1274 private:
1275  unsigned SrcAddrSpace;
1276  unsigned DestAddrSpace;
1277 
1278 public:
1279  AddrSpaceCastSDNode(unsigned Order, const DebugLoc &dl, EVT VT,
1280  unsigned SrcAS, unsigned DestAS);
1281 
1282  unsigned getSrcAddressSpace() const { return SrcAddrSpace; }
1283  unsigned getDestAddressSpace() const { return DestAddrSpace; }
1284 
1285  static bool classof(const SDNode *N) {
1286  return N->getOpcode() == ISD::ADDRSPACECAST;
1287  }
1288 };
1289 
1290 /// This is an abstract virtual class for memory operations.
1291 class MemSDNode : public SDNode {
1292 private:
1293  // VT of in-memory value.
1294  EVT MemoryVT;
1295 
1296 protected:
1297  /// Memory reference information.
1299 
1300 public:
1301  MemSDNode(unsigned Opc, unsigned Order, const DebugLoc &dl, SDVTList VTs,
1302  EVT memvt, MachineMemOperand *MMO);
1303 
1304  bool readMem() const { return MMO->isLoad(); }
1305  bool writeMem() const { return MMO->isStore(); }
1306 
1307  /// Returns alignment and volatility of the memory access
1308  unsigned getOriginalAlignment() const {
1309  return MMO->getBaseAlignment();
1310  }
1311  unsigned getAlignment() const {
1312  return MMO->getAlignment();
1313  }
1314 
1315  /// Return the SubclassData value, without HasDebugValue. This contains an
1316  /// encoding of the volatile flag, as well as bits used by subclasses. This
1317  /// function should only be used to compute a FoldingSetNodeID value.
1318  /// The HasDebugValue bit is masked out because CSE map needs to match
1319  /// nodes with debug info with nodes without debug info. Same is about
1320  /// isDivergent bit.
1321  unsigned getRawSubclassData() const {
1322  uint16_t Data;
1323  union {
1324  char RawSDNodeBits[sizeof(uint16_t)];
1325  SDNodeBitfields SDNodeBits;
1326  };
1327  memcpy(&RawSDNodeBits, &this->RawSDNodeBits, sizeof(this->RawSDNodeBits));
1328  SDNodeBits.HasDebugValue = 0;
1329  SDNodeBits.IsDivergent = false;
1330  memcpy(&Data, &RawSDNodeBits, sizeof(RawSDNodeBits));
1331  return Data;
1332  }
1333 
1334  bool isVolatile() const { return MemSDNodeBits.IsVolatile; }
1335  bool isNonTemporal() const { return MemSDNodeBits.IsNonTemporal; }
1336  bool isDereferenceable() const { return MemSDNodeBits.IsDereferenceable; }
1337  bool isInvariant() const { return MemSDNodeBits.IsInvariant; }
1338 
1339  // Returns the offset from the location of the access.
1340  int64_t getSrcValueOffset() const { return MMO->getOffset(); }
1341 
1342  /// Returns the AA info that describes the dereference.
1343  AAMDNodes getAAInfo() const { return MMO->getAAInfo(); }
1344 
1345  /// Returns the Ranges that describes the dereference.
1346  const MDNode *getRanges() const { return MMO->getRanges(); }
1347 
1348  /// Returns the synchronization scope ID for this memory operation.
1349  SyncScope::ID getSyncScopeID() const { return MMO->getSyncScopeID(); }
1350 
1351  /// Return the atomic ordering requirements for this memory operation. For
1352  /// cmpxchg atomic operations, return the atomic ordering requirements when
1353  /// store occurs.
1354  AtomicOrdering getOrdering() const { return MMO->getOrdering(); }
1355 
1356  /// Return true if the memory operation ordering is Unordered or higher.
1357  bool isAtomic() const { return MMO->isAtomic(); }
1358 
1359  /// Returns true if the memory operation doesn't imply any ordering
1360  /// constraints on surrounding memory operations beyond the normal memory
1361  /// aliasing rules.
1362  bool isUnordered() const { return MMO->isUnordered(); }
1363 
1364  /// Returns true if the memory operation is neither atomic or volatile.
1365  bool isSimple() const { return !isAtomic() && !isVolatile(); }
1366 
1367  /// Return the type of the in-memory value.
1368  EVT getMemoryVT() const { return MemoryVT; }
1369 
1370  /// Return a MachineMemOperand object describing the memory
1371  /// reference performed by operation.
1372  MachineMemOperand *getMemOperand() const { return MMO; }
1373 
1375  return MMO->getPointerInfo();
1376  }
1377 
1378  /// Return the address space for the associated pointer
1379  unsigned getAddressSpace() const {
1380  return getPointerInfo().getAddrSpace();
1381  }
1382 
1383  /// Update this MemSDNode's MachineMemOperand information
1384  /// to reflect the alignment of NewMMO, if it has a greater alignment.
1385  /// This must only be used when the new alignment applies to all users of
1386  /// this MachineMemOperand.
1387  void refineAlignment(const MachineMemOperand *NewMMO) {
1388  MMO->refineAlignment(NewMMO);
1389  }
1390 
1391  const SDValue &getChain() const { return getOperand(0); }
1392  const SDValue &getBasePtr() const {
1393  return getOperand(getOpcode() == ISD::STORE ? 2 : 1);
1394  }
1395 
1396  // Methods to support isa and dyn_cast
1397  static bool classof(const SDNode *N) {
1398  // For some targets, we lower some target intrinsics to a MemIntrinsicNode
1399  // with either an intrinsic or a target opcode.
1400  return N->getOpcode() == ISD::LOAD ||
1401  N->getOpcode() == ISD::STORE ||
1402  N->getOpcode() == ISD::PREFETCH ||
1403  N->getOpcode() == ISD::ATOMIC_CMP_SWAP ||
1405  N->getOpcode() == ISD::ATOMIC_SWAP ||
1406  N->getOpcode() == ISD::ATOMIC_LOAD_ADD ||
1407  N->getOpcode() == ISD::ATOMIC_LOAD_SUB ||
1408  N->getOpcode() == ISD::ATOMIC_LOAD_AND ||
1409  N->getOpcode() == ISD::ATOMIC_LOAD_CLR ||
1410  N->getOpcode() == ISD::ATOMIC_LOAD_OR ||
1411  N->getOpcode() == ISD::ATOMIC_LOAD_XOR ||
1412  N->getOpcode() == ISD::ATOMIC_LOAD_NAND ||
1413  N->getOpcode() == ISD::ATOMIC_LOAD_MIN ||
1414  N->getOpcode() == ISD::ATOMIC_LOAD_MAX ||
1415  N->getOpcode() == ISD::ATOMIC_LOAD_UMIN ||
1416  N->getOpcode() == ISD::ATOMIC_LOAD_UMAX ||
1417  N->getOpcode() == ISD::ATOMIC_LOAD_FADD ||
1418  N->getOpcode() == ISD::ATOMIC_LOAD_FSUB ||
1419  N->getOpcode() == ISD::ATOMIC_LOAD ||
1420  N->getOpcode() == ISD::ATOMIC_STORE ||
1421  N->getOpcode() == ISD::MLOAD ||
1422  N->getOpcode() == ISD::MSTORE ||
1423  N->getOpcode() == ISD::MGATHER ||
1424  N->getOpcode() == ISD::MSCATTER ||
1425  N->isMemIntrinsic() ||
1426  N->isTargetMemoryOpcode();
1427  }
1428 };
1429 
1430 /// This is an SDNode representing atomic operations.
1431 class AtomicSDNode : public MemSDNode {
1432 public:
1433  AtomicSDNode(unsigned Opc, unsigned Order, const DebugLoc &dl, SDVTList VTL,
1434  EVT MemVT, MachineMemOperand *MMO)
1435  : MemSDNode(Opc, Order, dl, VTL, MemVT, MMO) {
1436  assert(((Opc != ISD::ATOMIC_LOAD && Opc != ISD::ATOMIC_STORE) ||
1437  MMO->isAtomic()) && "then why are we using an AtomicSDNode?");
1438  }
1439 
1440  const SDValue &getBasePtr() const { return getOperand(1); }
1441  const SDValue &getVal() const { return getOperand(2); }
1442 
1443  /// Returns true if this SDNode represents cmpxchg atomic operation, false
1444  /// otherwise.
1445  bool isCompareAndSwap() const {
1446  unsigned Op = getOpcode();
1447  return Op == ISD::ATOMIC_CMP_SWAP ||
1449  }
1450 
1451  /// For cmpxchg atomic operations, return the atomic ordering requirements
1452  /// when store does not occur.
1454  assert(isCompareAndSwap() && "Must be cmpxchg operation");
1455  return MMO->getFailureOrdering();
1456  }
1457 
1458  // Methods to support isa and dyn_cast
1459  static bool classof(const SDNode *N) {
1460  return N->getOpcode() == ISD::ATOMIC_CMP_SWAP ||
1462  N->getOpcode() == ISD::ATOMIC_SWAP ||
1463  N->getOpcode() == ISD::ATOMIC_LOAD_ADD ||
1464  N->getOpcode() == ISD::ATOMIC_LOAD_SUB ||
1465  N->getOpcode() == ISD::ATOMIC_LOAD_AND ||
1466  N->getOpcode() == ISD::ATOMIC_LOAD_CLR ||
1467  N->getOpcode() == ISD::ATOMIC_LOAD_OR ||
1468  N->getOpcode() == ISD::ATOMIC_LOAD_XOR ||
1469  N->getOpcode() == ISD::ATOMIC_LOAD_NAND ||
1470  N->getOpcode() == ISD::ATOMIC_LOAD_MIN ||
1471  N->getOpcode() == ISD::ATOMIC_LOAD_MAX ||
1472  N->getOpcode() == ISD::ATOMIC_LOAD_UMIN ||
1473  N->getOpcode() == ISD::ATOMIC_LOAD_UMAX ||
1474  N->getOpcode() == ISD::ATOMIC_LOAD_FADD ||
1475  N->getOpcode() == ISD::ATOMIC_LOAD_FSUB ||
1476  N->getOpcode() == ISD::ATOMIC_LOAD ||
1477  N->getOpcode() == ISD::ATOMIC_STORE;
1478  }
1479 };
1480 
1481 /// This SDNode is used for target intrinsics that touch
1482 /// memory and need an associated MachineMemOperand. Its opcode may be
1483 /// INTRINSIC_VOID, INTRINSIC_W_CHAIN, PREFETCH, or a target-specific opcode
1484 /// with a value not less than FIRST_TARGET_MEMORY_OPCODE.
1486 public:
1487  MemIntrinsicSDNode(unsigned Opc, unsigned Order, const DebugLoc &dl,
1488  SDVTList VTs, EVT MemoryVT, MachineMemOperand *MMO)
1489  : MemSDNode(Opc, Order, dl, VTs, MemoryVT, MMO) {
1490  SDNodeBits.IsMemIntrinsic = true;
1491  }
1492 
1493  // Methods to support isa and dyn_cast
1494  static bool classof(const SDNode *N) {
1495  // We lower some target intrinsics to their target opcode
1496  // early a node with a target opcode can be of this class
1497  return N->isMemIntrinsic() ||
1498  N->getOpcode() == ISD::PREFETCH ||
1499  N->isTargetMemoryOpcode();
1500  }
1501 };
1502 
1503 /// This SDNode is used to implement the code generator
1504 /// support for the llvm IR shufflevector instruction. It combines elements
1505 /// from two input vectors into a new input vector, with the selection and
1506 /// ordering of elements determined by an array of integers, referred to as
1507 /// the shuffle mask. For input vectors of width N, mask indices of 0..N-1
1508 /// refer to elements from the LHS input, and indices from N to 2N-1 the RHS.
1509 /// An index of -1 is treated as undef, such that the code generator may put
1510 /// any value in the corresponding element of the result.
1511 class ShuffleVectorSDNode : public SDNode {
1512  // The memory for Mask is owned by the SelectionDAG's OperandAllocator, and
1513  // is freed when the SelectionDAG object is destroyed.
1514  const int *Mask;
1515 
1516 protected:
1517  friend class SelectionDAG;
1518 
1519  ShuffleVectorSDNode(EVT VT, unsigned Order, const DebugLoc &dl, const int *M)
1520  : SDNode(ISD::VECTOR_SHUFFLE, Order, dl, getSDVTList(VT)), Mask(M) {}
1521 
1522 public:
1524  EVT VT = getValueType(0);
1525  return makeArrayRef(Mask, VT.getVectorNumElements());
1526  }
1527 
1528  int getMaskElt(unsigned Idx) const {
1529  assert(Idx < getValueType(0).getVectorNumElements() && "Idx out of range!");
1530  return Mask[Idx];
1531  }
1532 
1533  bool isSplat() const { return isSplatMask(Mask, getValueType(0)); }
1534 
1535  int getSplatIndex() const {
1536  assert(isSplat() && "Cannot get splat index for non-splat!");
1537  EVT VT = getValueType(0);
1538  for (unsigned i = 0, e = VT.getVectorNumElements(); i != e; ++i)
1539  if (Mask[i] >= 0)
1540  return Mask[i];
1541 
1542  // We can choose any index value here and be correct because all elements
1543  // are undefined. Return 0 for better potential for callers to simplify.
1544  return 0;
1545  }
1546 
1547  static bool isSplatMask(const int *Mask, EVT VT);
1548 
1549  /// Change values in a shuffle permute mask assuming
1550  /// the two vector operands have swapped position.
1551  static void commuteMask(MutableArrayRef<int> Mask) {
1552  unsigned NumElems = Mask.size();
1553  for (unsigned i = 0; i != NumElems; ++i) {
1554  int idx = Mask[i];
1555  if (idx < 0)
1556  continue;
1557  else if (idx < (int)NumElems)
1558  Mask[i] = idx + NumElems;
1559  else
1560  Mask[i] = idx - NumElems;
1561  }
1562  }
1563 
1564  static bool classof(const SDNode *N) {
1565  return N->getOpcode() == ISD::VECTOR_SHUFFLE;
1566  }
1567 };
1568 
1569 class ConstantSDNode : public SDNode {
1570  friend class SelectionDAG;
1571 
1572  const ConstantInt *Value;
1573 
1574  ConstantSDNode(bool isTarget, bool isOpaque, const ConstantInt *val, EVT VT)
1575  : SDNode(isTarget ? ISD::TargetConstant : ISD::Constant, 0, DebugLoc(),
1576  getSDVTList(VT)),
1577  Value(val) {
1578  ConstantSDNodeBits.IsOpaque = isOpaque;
1579  }
1580 
1581 public:
1582  const ConstantInt *getConstantIntValue() const { return Value; }
1583  const APInt &getAPIntValue() const { return Value->getValue(); }
1584  uint64_t getZExtValue() const { return Value->getZExtValue(); }
1585  int64_t getSExtValue() const { return Value->getSExtValue(); }
1586  uint64_t getLimitedValue(uint64_t Limit = UINT64_MAX) {
1587  return Value->getLimitedValue(Limit);
1588  }
1589 
1590  bool isOne() const { return Value->isOne(); }
1591  bool isNullValue() const { return Value->isZero(); }
1592  bool isAllOnesValue() const { return Value->isMinusOne(); }
1593 
1594  bool isOpaque() const { return ConstantSDNodeBits.IsOpaque; }
1595 
1596  static bool classof(const SDNode *N) {
1597  return N->getOpcode() == ISD::Constant ||
1599  }
1600 };
1601 
1602 uint64_t SDNode::getConstantOperandVal(unsigned Num) const {
1603  return cast<ConstantSDNode>(getOperand(Num))->getZExtValue();
1604 }
1605 
1606 const APInt &SDNode::getConstantOperandAPInt(unsigned Num) const {
1607  return cast<ConstantSDNode>(getOperand(Num))->getAPIntValue();
1608 }
1609 
1610 class ConstantFPSDNode : public SDNode {
1611  friend class SelectionDAG;
1612 
1613  const ConstantFP *Value;
1614 
1615  ConstantFPSDNode(bool isTarget, const ConstantFP *val, EVT VT)
1616  : SDNode(isTarget ? ISD::TargetConstantFP : ISD::ConstantFP, 0,
1617  DebugLoc(), getSDVTList(VT)),
1618  Value(val) {}
1619 
1620 public:
1621  const APFloat& getValueAPF() const { return Value->getValueAPF(); }
1622  const ConstantFP *getConstantFPValue() const { return Value; }
1623 
1624  /// Return true if the value is positive or negative zero.
1625  bool isZero() const { return Value->isZero(); }
1626 
1627  /// Return true if the value is a NaN.
1628  bool isNaN() const { return Value->isNaN(); }
1629 
1630  /// Return true if the value is an infinity
1631  bool isInfinity() const { return Value->isInfinity(); }
1632 
1633  /// Return true if the value is negative.
1634  bool isNegative() const { return Value->isNegative(); }
1635 
1636  /// We don't rely on operator== working on double values, as
1637  /// it returns true for things that are clearly not equal, like -0.0 and 0.0.
1638  /// As such, this method can be used to do an exact bit-for-bit comparison of
1639  /// two floating point values.
1640 
1641  /// We leave the version with the double argument here because it's just so
1642  /// convenient to write "2.0" and the like. Without this function we'd
1643  /// have to duplicate its logic everywhere it's called.
1644  bool isExactlyValue(double V) const {
1645  return Value->getValueAPF().isExactlyValue(V);
1646  }
1647  bool isExactlyValue(const APFloat& V) const;
1648 
1649  static bool isValueValidForType(EVT VT, const APFloat& Val);
1650 
1651  static bool classof(const SDNode *N) {
1652  return N->getOpcode() == ISD::ConstantFP ||
1654  }
1655 };
1656 
1657 /// Returns true if \p V is a constant integer zero.
1658 bool isNullConstant(SDValue V);
1659 
1660 /// Returns true if \p V is an FP constant with a value of positive zero.
1661 bool isNullFPConstant(SDValue V);
1662 
1663 /// Returns true if \p V is an integer constant with all bits set.
1664 bool isAllOnesConstant(SDValue V);
1665 
1666 /// Returns true if \p V is a constant integer one.
1667 bool isOneConstant(SDValue V);
1668 
1669 /// Return the non-bitcasted source operand of \p V if it exists.
1670 /// If \p V is not a bitcasted value, it is returned as-is.
1672 
1673 /// Return the non-bitcasted and one-use source operand of \p V if it exists.
1674 /// If \p V is not a bitcasted one-use value, it is returned as-is.
1676 
1677 /// Return the non-extracted vector source operand of \p V if it exists.
1678 /// If \p V is not an extracted subvector, it is returned as-is.
1680 
1681 /// Returns true if \p V is a bitwise not operation. Assumes that an all ones
1682 /// constant is canonicalized to be operand 1.
1683 bool isBitwiseNot(SDValue V, bool AllowUndefs = false);
1684 
1685 /// Returns the SDNode if it is a constant splat BuildVector or constant int.
1686 ConstantSDNode *isConstOrConstSplat(SDValue N, bool AllowUndefs = false,
1687  bool AllowTruncation = false);
1688 
1689 /// Returns the SDNode if it is a demanded constant splat BuildVector or
1690 /// constant int.
1691 ConstantSDNode *isConstOrConstSplat(SDValue N, const APInt &DemandedElts,
1692  bool AllowUndefs = false,
1693  bool AllowTruncation = false);
1694 
1695 /// Returns the SDNode if it is a constant splat BuildVector or constant float.
1696 ConstantFPSDNode *isConstOrConstSplatFP(SDValue N, bool AllowUndefs = false);
1697 
1698 /// Returns the SDNode if it is a demanded constant splat BuildVector or
1699 /// constant float.
1700 ConstantFPSDNode *isConstOrConstSplatFP(SDValue N, const APInt &DemandedElts,
1701  bool AllowUndefs = false);
1702 
1703 /// Return true if the value is a constant 0 integer or a splatted vector of
1704 /// a constant 0 integer (with no undefs by default).
1705 /// Build vector implicit truncation is not an issue for null values.
1706 bool isNullOrNullSplat(SDValue V, bool AllowUndefs = false);
1707 
1708 /// Return true if the value is a constant 1 integer or a splatted vector of a
1709 /// constant 1 integer (with no undefs).
1710 /// Does not permit build vector implicit truncation.
1711 bool isOneOrOneSplat(SDValue V);
1712 
1713 /// Return true if the value is a constant -1 integer or a splatted vector of a
1714 /// constant -1 integer (with no undefs).
1715 /// Does not permit build vector implicit truncation.
1717 
1718 class GlobalAddressSDNode : public SDNode {
1719  friend class SelectionDAG;
1720 
1721  const GlobalValue *TheGlobal;
1722  int64_t Offset;
1723  unsigned TargetFlags;
1724 
1725  GlobalAddressSDNode(unsigned Opc, unsigned Order, const DebugLoc &DL,
1726  const GlobalValue *GA, EVT VT, int64_t o,
1727  unsigned TF);
1728 
1729 public:
1730  const GlobalValue *getGlobal() const { return TheGlobal; }
1731  int64_t getOffset() const { return Offset; }
1732  unsigned getTargetFlags() const { return TargetFlags; }
1733  // Return the address space this GlobalAddress belongs to.
1734  unsigned getAddressSpace() const;
1735 
1736  static bool classof(const SDNode *N) {
1737  return N->getOpcode() == ISD::GlobalAddress ||
1739  N->getOpcode() == ISD::GlobalTLSAddress ||
1741  }
1742 };
1743 
1744 class FrameIndexSDNode : public SDNode {
1745  friend class SelectionDAG;
1746 
1747  int FI;
1748 
1749  FrameIndexSDNode(int fi, EVT VT, bool isTarg)
1750  : SDNode(isTarg ? ISD::TargetFrameIndex : ISD::FrameIndex,
1751  0, DebugLoc(), getSDVTList(VT)), FI(fi) {
1752  }
1753 
1754 public:
1755  int getIndex() const { return FI; }
1756 
1757  static bool classof(const SDNode *N) {
1758  return N->getOpcode() == ISD::FrameIndex ||
1760  }
1761 };
1762 
1763 /// This SDNode is used for LIFETIME_START/LIFETIME_END values, which indicate
1764 /// the offet and size that are started/ended in the underlying FrameIndex.
1765 class LifetimeSDNode : public SDNode {
1766  friend class SelectionDAG;
1767  int64_t Size;
1768  int64_t Offset; // -1 if offset is unknown.
1769 
1770  LifetimeSDNode(unsigned Opcode, unsigned Order, const DebugLoc &dl,
1771  SDVTList VTs, int64_t Size, int64_t Offset)
1772  : SDNode(Opcode, Order, dl, VTs), Size(Size), Offset(Offset) {}
1773 public:
1774  int64_t getFrameIndex() const {
1775  return cast<FrameIndexSDNode>(getOperand(1))->getIndex();
1776  }
1777 
1778  bool hasOffset() const { return Offset >= 0; }
1779  int64_t getOffset() const {
1780  assert(hasOffset() && "offset is unknown");
1781  return Offset;
1782  }
1783  int64_t getSize() const {
1784  assert(hasOffset() && "offset is unknown");
1785  return Size;
1786  }
1787 
1788  // Methods to support isa and dyn_cast
1789  static bool classof(const SDNode *N) {
1790  return N->getOpcode() == ISD::LIFETIME_START ||
1791  N->getOpcode() == ISD::LIFETIME_END;
1792  }
1793 };
1794 
1795 class JumpTableSDNode : public SDNode {
1796  friend class SelectionDAG;
1797 
1798  int JTI;
1799  unsigned TargetFlags;
1800 
1801  JumpTableSDNode(int jti, EVT VT, bool isTarg, unsigned TF)
1802  : SDNode(isTarg ? ISD::TargetJumpTable : ISD::JumpTable,
1803  0, DebugLoc(), getSDVTList(VT)), JTI(jti), TargetFlags(TF) {
1804  }
1805 
1806 public:
1807  int getIndex() const { return JTI; }
1808  unsigned getTargetFlags() const { return TargetFlags; }
1809 
1810  static bool classof(const SDNode *N) {
1811  return N->getOpcode() == ISD::JumpTable ||
1813  }
1814 };
1815 
1816 class ConstantPoolSDNode : public SDNode {
1817  friend class SelectionDAG;
1818 
1819  union {
1822  } Val;
1823  int Offset; // It's a MachineConstantPoolValue if top bit is set.
1824  unsigned Alignment; // Minimum alignment requirement of CP (not log2 value).
1825  unsigned TargetFlags;
1826 
1827  ConstantPoolSDNode(bool isTarget, const Constant *c, EVT VT, int o,
1828  unsigned Align, unsigned TF)
1829  : SDNode(isTarget ? ISD::TargetConstantPool : ISD::ConstantPool, 0,
1830  DebugLoc(), getSDVTList(VT)), Offset(o), Alignment(Align),
1831  TargetFlags(TF) {
1832  assert(Offset >= 0 && "Offset is too large");
1833  Val.ConstVal = c;
1834  }
1835 
1836  ConstantPoolSDNode(bool isTarget, MachineConstantPoolValue *v,
1837  EVT VT, int o, unsigned Align, unsigned TF)
1839  DebugLoc(), getSDVTList(VT)), Offset(o), Alignment(Align),
1840  TargetFlags(TF) {
1841  assert(Offset >= 0 && "Offset is too large");
1842  Val.MachineCPVal = v;
1843  Offset |= 1 << (sizeof(unsigned)*CHAR_BIT-1);
1844  }
1845 
1846 public:
1848  return Offset < 0;
1849  }
1850 
1851  const Constant *getConstVal() const {
1852  assert(!isMachineConstantPoolEntry() && "Wrong constantpool type");
1853  return Val.ConstVal;
1854  }
1855 
1857  assert(isMachineConstantPoolEntry() && "Wrong constantpool type");
1858  return Val.MachineCPVal;
1859  }
1860 
1861  int getOffset() const {
1862  return Offset & ~(1 << (sizeof(unsigned)*CHAR_BIT-1));
1863  }
1864 
1865  // Return the alignment of this constant pool object, which is either 0 (for
1866  // default alignment) or the desired value.
1867  unsigned getAlignment() const { return Alignment; }
1868  unsigned getTargetFlags() const { return TargetFlags; }
1869 
1870  Type *getType() const;
1871 
1872  static bool classof(const SDNode *N) {
1873  return N->getOpcode() == ISD::ConstantPool ||
1875  }
1876 };
1877 
1878 /// Completely target-dependent object reference.
1879 class TargetIndexSDNode : public SDNode {
1880  friend class SelectionDAG;
1881 
1882  unsigned TargetFlags;
1883  int Index;
1884  int64_t Offset;
1885 
1886 public:
1887  TargetIndexSDNode(int Idx, EVT VT, int64_t Ofs, unsigned TF)
1888  : SDNode(ISD::TargetIndex, 0, DebugLoc(), getSDVTList(VT)),
1889  TargetFlags(TF), Index(Idx), Offset(Ofs) {}
1890 
1891  unsigned getTargetFlags() const { return TargetFlags; }
1892  int getIndex() const { return Index; }
1893  int64_t getOffset() const { return Offset; }
1894 
1895  static bool classof(const SDNode *N) {
1896  return N->getOpcode() == ISD::TargetIndex;
1897  }
1898 };
1899 
1900 class BasicBlockSDNode : public SDNode {
1901  friend class SelectionDAG;
1902 
1903  MachineBasicBlock *MBB;
1904 
1905  /// Debug info is meaningful and potentially useful here, but we create
1906  /// blocks out of order when they're jumped to, which makes it a bit
1907  /// harder. Let's see if we need it first.
1908  explicit BasicBlockSDNode(MachineBasicBlock *mbb)
1909  : SDNode(ISD::BasicBlock, 0, DebugLoc(), getSDVTList(MVT::Other)), MBB(mbb)
1910  {}
1911 
1912 public:
1913  MachineBasicBlock *getBasicBlock() const { return MBB; }
1914 
1915  static bool classof(const SDNode *N) {
1916  return N->getOpcode() == ISD::BasicBlock;
1917  }
1918 };
1919 
1920 /// A "pseudo-class" with methods for operating on BUILD_VECTORs.
1921 class BuildVectorSDNode : public SDNode {
1922 public:
1923  // These are constructed as SDNodes and then cast to BuildVectorSDNodes.
1924  explicit BuildVectorSDNode() = delete;
1925 
1926  /// Check if this is a constant splat, and if so, find the
1927  /// smallest element size that splats the vector. If MinSplatBits is
1928  /// nonzero, the element size must be at least that large. Note that the
1929  /// splat element may be the entire vector (i.e., a one element vector).
1930  /// Returns the splat element value in SplatValue. Any undefined bits in
1931  /// that value are zero, and the corresponding bits in the SplatUndef mask
1932  /// are set. The SplatBitSize value is set to the splat element size in
1933  /// bits. HasAnyUndefs is set to true if any bits in the vector are
1934  /// undefined. isBigEndian describes the endianness of the target.
1935  bool isConstantSplat(APInt &SplatValue, APInt &SplatUndef,
1936  unsigned &SplatBitSize, bool &HasAnyUndefs,
1937  unsigned MinSplatBits = 0,
1938  bool isBigEndian = false) const;
1939 
1940  /// Returns the demanded splatted value or a null value if this is not a
1941  /// splat.
1942  ///
1943  /// The DemandedElts mask indicates the elements that must be in the splat.
1944  /// If passed a non-null UndefElements bitvector, it will resize it to match
1945  /// the vector width and set the bits where elements are undef.
1946  SDValue getSplatValue(const APInt &DemandedElts,
1947  BitVector *UndefElements = nullptr) const;
1948 
1949  /// Returns the splatted value or a null value if this is not a splat.
1950  ///
1951  /// If passed a non-null UndefElements bitvector, it will resize it to match
1952  /// the vector width and set the bits where elements are undef.
1953  SDValue getSplatValue(BitVector *UndefElements = nullptr) const;
1954 
1955  /// Returns the demanded splatted constant or null if this is not a constant
1956  /// splat.
1957  ///
1958  /// The DemandedElts mask indicates the elements that must be in the splat.
1959  /// If passed a non-null UndefElements bitvector, it will resize it to match
1960  /// the vector width and set the bits where elements are undef.
1961  ConstantSDNode *
1962  getConstantSplatNode(const APInt &DemandedElts,
1963  BitVector *UndefElements = nullptr) const;
1964 
1965  /// Returns the splatted constant or null if this is not a constant
1966  /// splat.
1967  ///
1968  /// If passed a non-null UndefElements bitvector, it will resize it to match
1969  /// the vector width and set the bits where elements are undef.
1970  ConstantSDNode *
1971  getConstantSplatNode(BitVector *UndefElements = nullptr) const;
1972 
1973  /// Returns the demanded splatted constant FP or null if this is not a
1974  /// constant FP splat.
1975  ///
1976  /// The DemandedElts mask indicates the elements that must be in the splat.
1977  /// If passed a non-null UndefElements bitvector, it will resize it to match
1978  /// the vector width and set the bits where elements are undef.
1980  getConstantFPSplatNode(const APInt &DemandedElts,
1981  BitVector *UndefElements = nullptr) const;
1982 
1983  /// Returns the splatted constant FP or null if this is not a constant
1984  /// FP splat.
1985  ///
1986  /// If passed a non-null UndefElements bitvector, it will resize it to match
1987  /// the vector width and set the bits where elements are undef.
1989  getConstantFPSplatNode(BitVector *UndefElements = nullptr) const;
1990 
1991  /// If this is a constant FP splat and the splatted constant FP is an
1992  /// exact power or 2, return the log base 2 integer value. Otherwise,
1993  /// return -1.
1994  ///
1995  /// The BitWidth specifies the necessary bit precision.
1996  int32_t getConstantFPSplatPow2ToLog2Int(BitVector *UndefElements,
1997  uint32_t BitWidth) const;
1998 
1999  bool isConstant() const;
2000 
2001  static bool classof(const SDNode *N) {
2002  return N->getOpcode() == ISD::BUILD_VECTOR;
2003  }
2004 };
2005 
2006 /// An SDNode that holds an arbitrary LLVM IR Value. This is
2007 /// used when the SelectionDAG needs to make a simple reference to something
2008 /// in the LLVM IR representation.
2009 ///
2010 class SrcValueSDNode : public SDNode {
2011  friend class SelectionDAG;
2012 
2013  const Value *V;
2014 
2015  /// Create a SrcValue for a general value.
2016  explicit SrcValueSDNode(const Value *v)
2017  : SDNode(ISD::SRCVALUE, 0, DebugLoc(), getSDVTList(MVT::Other)), V(v) {}
2018 
2019 public:
2020  /// Return the contained Value.
2021  const Value *getValue() const { return V; }
2022 
2023  static bool classof(const SDNode *N) {
2024  return N->getOpcode() == ISD::SRCVALUE;
2025  }
2026 };
2027 
2028 class MDNodeSDNode : public SDNode {
2029  friend class SelectionDAG;
2030 
2031  const MDNode *MD;
2032 
2033  explicit MDNodeSDNode(const MDNode *md)
2034  : SDNode(ISD::MDNODE_SDNODE, 0, DebugLoc(), getSDVTList(MVT::Other)), MD(md)
2035  {}
2036 
2037 public:
2038  const MDNode *getMD() const { return MD; }
2039 
2040  static bool classof(const SDNode *N) {
2041  return N->getOpcode() == ISD::MDNODE_SDNODE;
2042  }
2043 };
2044 
2045 class RegisterSDNode : public SDNode {
2046  friend class SelectionDAG;
2047 
2048  unsigned Reg;
2049 
2050  RegisterSDNode(unsigned reg, EVT VT)
2051  : SDNode(ISD::Register, 0, DebugLoc(), getSDVTList(VT)), Reg(reg) {}
2052 
2053 public:
2054  unsigned getReg() const { return Reg; }
2055 
2056  static bool classof(const SDNode *N) {
2057  return N->getOpcode() == ISD::Register;
2058  }
2059 };
2060 
2061 class RegisterMaskSDNode : public SDNode {
2062  friend class SelectionDAG;
2063 
2064  // The memory for RegMask is not owned by the node.
2065  const uint32_t *RegMask;
2066 
2067  RegisterMaskSDNode(const uint32_t *mask)
2068  : SDNode(ISD::RegisterMask, 0, DebugLoc(), getSDVTList(MVT::Untyped)),
2069  RegMask(mask) {}
2070 
2071 public:
2072  const uint32_t *getRegMask() const { return RegMask; }
2073 
2074  static bool classof(const SDNode *N) {
2075  return N->getOpcode() == ISD::RegisterMask;
2076  }
2077 };
2078 
2079 class BlockAddressSDNode : public SDNode {
2080  friend class SelectionDAG;
2081 
2082  const BlockAddress *BA;
2083  int64_t Offset;
2084  unsigned TargetFlags;
2085 
2086  BlockAddressSDNode(unsigned NodeTy, EVT VT, const BlockAddress *ba,
2087  int64_t o, unsigned Flags)
2088  : SDNode(NodeTy, 0, DebugLoc(), getSDVTList(VT)),
2089  BA(ba), Offset(o), TargetFlags(Flags) {}
2090 
2091 public:
2092  const BlockAddress *getBlockAddress() const { return BA; }
2093  int64_t getOffset() const { return Offset; }
2094  unsigned getTargetFlags() const { return TargetFlags; }
2095 
2096  static bool classof(const SDNode *N) {
2097  return N->getOpcode() == ISD::BlockAddress ||
2099  }
2100 };
2101 
2102 class LabelSDNode : public SDNode {
2103  friend class SelectionDAG;
2104 
2105  MCSymbol *Label;
2106 
2107  LabelSDNode(unsigned Opcode, unsigned Order, const DebugLoc &dl, MCSymbol *L)
2108  : SDNode(Opcode, Order, dl, getSDVTList(MVT::Other)), Label(L) {
2109  assert(LabelSDNode::classof(this) && "not a label opcode");
2110  }
2111 
2112 public:
2113  MCSymbol *getLabel() const { return Label; }
2114 
2115  static bool classof(const SDNode *N) {
2116  return N->getOpcode() == ISD::EH_LABEL ||
2118  }
2119 };
2120 
2122  friend class SelectionDAG;
2123 
2124  const char *Symbol;
2125  unsigned TargetFlags;
2126 
2127  ExternalSymbolSDNode(bool isTarget, const char *Sym, unsigned TF, EVT VT)
2128  : SDNode(isTarget ? ISD::TargetExternalSymbol : ISD::ExternalSymbol, 0,
2129  DebugLoc(), getSDVTList(VT)),
2130  Symbol(Sym), TargetFlags(TF) {}
2131 
2132 public:
2133  const char *getSymbol() const { return Symbol; }
2134  unsigned getTargetFlags() const { return TargetFlags; }
2135 
2136  static bool classof(const SDNode *N) {
2137  return N->getOpcode() == ISD::ExternalSymbol ||
2139  }
2140 };
2141 
2142 class MCSymbolSDNode : public SDNode {
2143  friend class SelectionDAG;
2144 
2145  MCSymbol *Symbol;
2146 
2147  MCSymbolSDNode(MCSymbol *Symbol, EVT VT)
2148  : SDNode(ISD::MCSymbol, 0, DebugLoc(), getSDVTList(VT)), Symbol(Symbol) {}
2149 
2150 public:
2151  MCSymbol *getMCSymbol() const { return Symbol; }
2152 
2153  static bool classof(const SDNode *N) {
2154  return N->getOpcode() == ISD::MCSymbol;
2155  }
2156 };
2157 
2158 class CondCodeSDNode : public SDNode {
2159  friend class SelectionDAG;
2160 
2161  ISD::CondCode Condition;
2162 
2163  explicit CondCodeSDNode(ISD::CondCode Cond)
2164  : SDNode(ISD::CONDCODE, 0, DebugLoc(), getSDVTList(MVT::Other)),
2165  Condition(Cond) {}
2166 
2167 public:
2168  ISD::CondCode get() const { return Condition; }
2169 
2170  static bool classof(const SDNode *N) {
2171  return N->getOpcode() == ISD::CONDCODE;
2172  }
2173 };
2174 
2175 /// This class is used to represent EVT's, which are used
2176 /// to parameterize some operations.
2177 class VTSDNode : public SDNode {
2178  friend class SelectionDAG;
2179 
2180  EVT ValueType;
2181 
2182  explicit VTSDNode(EVT VT)
2183  : SDNode(ISD::VALUETYPE, 0, DebugLoc(), getSDVTList(MVT::Other)),
2184  ValueType(VT) {}
2185 
2186 public:
2187  EVT getVT() const { return ValueType; }
2188 
2189  static bool classof(const SDNode *N) {
2190  return N->getOpcode() == ISD::VALUETYPE;
2191  }
2192 };
2193 
2194 /// Base class for LoadSDNode and StoreSDNode
2195 class LSBaseSDNode : public MemSDNode {
2196 public:
2197  LSBaseSDNode(ISD::NodeType NodeTy, unsigned Order, const DebugLoc &dl,
2198  SDVTList VTs, ISD::MemIndexedMode AM, EVT MemVT,
2199  MachineMemOperand *MMO)
2200  : MemSDNode(NodeTy, Order, dl, VTs, MemVT, MMO) {
2201  LSBaseSDNodeBits.AddressingMode = AM;
2202  assert(getAddressingMode() == AM && "Value truncated");
2203  }
2204 
2205  const SDValue &getOffset() const {
2206  return getOperand(getOpcode() == ISD::LOAD ? 2 : 3);
2207  }
2208 
2209  /// Return the addressing mode for this load or store:
2210  /// unindexed, pre-inc, pre-dec, post-inc, or post-dec.
2212  return static_cast<ISD::MemIndexedMode>(LSBaseSDNodeBits.AddressingMode);
2213  }
2214 
2215  /// Return true if this is a pre/post inc/dec load/store.
2216  bool isIndexed() const { return getAddressingMode() != ISD::UNINDEXED; }
2217 
2218  /// Return true if this is NOT a pre/post inc/dec load/store.
2219  bool isUnindexed() const { return getAddressingMode() == ISD::UNINDEXED; }
2220 
2221  static bool classof(const SDNode *N) {
2222  return N->getOpcode() == ISD::LOAD ||
2223  N->getOpcode() == ISD::STORE;
2224  }
2225 };
2226 
2227 /// This class is used to represent ISD::LOAD nodes.
2228 class LoadSDNode : public LSBaseSDNode {
2229  friend class SelectionDAG;
2230 
2231  LoadSDNode(unsigned Order, const DebugLoc &dl, SDVTList VTs,
2232  ISD::MemIndexedMode AM, ISD::LoadExtType ETy, EVT MemVT,
2233  MachineMemOperand *MMO)
2234  : LSBaseSDNode(ISD::LOAD, Order, dl, VTs, AM, MemVT, MMO) {
2235  LoadSDNodeBits.ExtTy = ETy;
2236  assert(readMem() && "Load MachineMemOperand is not a load!");
2237  assert(!writeMem() && "Load MachineMemOperand is a store!");
2238  }
2239 
2240 public:
2241  /// Return whether this is a plain node,
2242  /// or one of the varieties of value-extending loads.
2244  return static_cast<ISD::LoadExtType>(LoadSDNodeBits.ExtTy);
2245  }
2246 
2247  const SDValue &getBasePtr() const { return getOperand(1); }
2248  const SDValue &getOffset() const { return getOperand(2); }
2249 
2250  static bool classof(const SDNode *N) {
2251  return N->getOpcode() == ISD::LOAD;
2252  }
2253 };
2254 
2255 /// This class is used to represent ISD::STORE nodes.
2256 class StoreSDNode : public LSBaseSDNode {
2257  friend class SelectionDAG;
2258 
2259  StoreSDNode(unsigned Order, const DebugLoc &dl, SDVTList VTs,
2260  ISD::MemIndexedMode AM, bool isTrunc, EVT MemVT,
2261  MachineMemOperand *MMO)
2262  : LSBaseSDNode(ISD::STORE, Order, dl, VTs, AM, MemVT, MMO) {
2263  StoreSDNodeBits.IsTruncating = isTrunc;
2264  assert(!readMem() && "Store MachineMemOperand is a load!");
2265  assert(writeMem() && "Store MachineMemOperand is not a store!");
2266  }
2267 
2268 public:
2269  /// Return true if the op does a truncation before store.
2270  /// For integers this is the same as doing a TRUNCATE and storing the result.
2271  /// For floats, it is the same as doing an FP_ROUND and storing the result.
2272  bool isTruncatingStore() const { return StoreSDNodeBits.IsTruncating; }
2273  void setTruncatingStore(bool Truncating) {
2274  StoreSDNodeBits.IsTruncating = Truncating;
2275  }
2276 
2277  const SDValue &getValue() const { return getOperand(1); }
2278  const SDValue &getBasePtr() const { return getOperand(2); }
2279  const SDValue &getOffset() const { return getOperand(3); }
2280 
2281  static bool classof(const SDNode *N) {
2282  return N->getOpcode() == ISD::STORE;
2283  }
2284 };
2285 
2286 /// This base class is used to represent MLOAD and MSTORE nodes
2288 public:
2289  friend class SelectionDAG;
2290 
2291  MaskedLoadStoreSDNode(ISD::NodeType NodeTy, unsigned Order,
2292  const DebugLoc &dl, SDVTList VTs, EVT MemVT,
2293  MachineMemOperand *MMO)
2294  : MemSDNode(NodeTy, Order, dl, VTs, MemVT, MMO) {}
2295 
2296  // MaskedLoadSDNode (Chain, ptr, mask, passthru)
2297  // MaskedStoreSDNode (Chain, data, ptr, mask)
2298  // Mask is a vector of i1 elements
2299  const SDValue &getBasePtr() const {
2300  return getOperand(getOpcode() == ISD::MLOAD ? 1 : 2);
2301  }
2302  const SDValue &getMask() const {
2303  return getOperand(getOpcode() == ISD::MLOAD ? 2 : 3);
2304  }
2305 
2306  static bool classof(const SDNode *N) {
2307  return N->getOpcode() == ISD::MLOAD ||
2308  N->getOpcode() == ISD::MSTORE;
2309  }
2310 };
2311 
2312 /// This class is used to represent an MLOAD node
2314 public:
2315  friend class SelectionDAG;
2316 
2317  MaskedLoadSDNode(unsigned Order, const DebugLoc &dl, SDVTList VTs,
2318  ISD::LoadExtType ETy, bool IsExpanding, EVT MemVT,
2319  MachineMemOperand *MMO)
2320  : MaskedLoadStoreSDNode(ISD::MLOAD, Order, dl, VTs, MemVT, MMO) {
2321  LoadSDNodeBits.ExtTy = ETy;
2322  LoadSDNodeBits.IsExpanding = IsExpanding;
2323  }
2324 
2326  return static_cast<ISD::LoadExtType>(LoadSDNodeBits.ExtTy);
2327  }
2328 
2329  const SDValue &getBasePtr() const { return getOperand(1); }
2330  const SDValue &getMask() const { return getOperand(2); }
2331  const SDValue &getPassThru() const { return getOperand(3); }
2332 
2333  static bool classof(const SDNode *N) {
2334  return N->getOpcode() == ISD::MLOAD;
2335  }
2336 
2337  bool isExpandingLoad() const { return LoadSDNodeBits.IsExpanding; }
2338 };
2339 
2340 /// This class is used to represent an MSTORE node
2342 public:
2343  friend class SelectionDAG;
2344 
2345  MaskedStoreSDNode(unsigned Order, const DebugLoc &dl, SDVTList VTs,
2346  bool isTrunc, bool isCompressing, EVT MemVT,
2347  MachineMemOperand *MMO)
2348  : MaskedLoadStoreSDNode(ISD::MSTORE, Order, dl, VTs, MemVT, MMO) {
2349  StoreSDNodeBits.IsTruncating = isTrunc;
2350  StoreSDNodeBits.IsCompressing = isCompressing;
2351  }
2352 
2353  /// Return true if the op does a truncation before store.
2354  /// For integers this is the same as doing a TRUNCATE and storing the result.
2355  /// For floats, it is the same as doing an FP_ROUND and storing the result.
2356  bool isTruncatingStore() const { return StoreSDNodeBits.IsTruncating; }
2357 
2358  /// Returns true if the op does a compression to the vector before storing.
2359  /// The node contiguously stores the active elements (integers or floats)
2360  /// in src (those with their respective bit set in writemask k) to unaligned
2361  /// memory at base_addr.
2362  bool isCompressingStore() const { return StoreSDNodeBits.IsCompressing; }
2363 
2364  const SDValue &getValue() const { return getOperand(1); }
2365  const SDValue &getBasePtr() const { return getOperand(2); }
2366  const SDValue &getMask() const { return getOperand(3); }
2367 
2368  static bool classof(const SDNode *N) {
2369  return N->getOpcode() == ISD::MSTORE;
2370  }
2371 };
2372 
2373 /// This is a base class used to represent
2374 /// MGATHER and MSCATTER nodes
2375 ///
2377 public:
2378  friend class SelectionDAG;
2379 
2381  const DebugLoc &dl, SDVTList VTs, EVT MemVT,
2382  MachineMemOperand *MMO, ISD::MemIndexType IndexType)
2383  : MemSDNode(NodeTy, Order, dl, VTs, MemVT, MMO) {
2384  LSBaseSDNodeBits.AddressingMode = IndexType;
2385  assert(getIndexType() == IndexType && "Value truncated");
2386  }
2387 
2388  /// How is Index applied to BasePtr when computing addresses.
2390  return static_cast<ISD::MemIndexType>(LSBaseSDNodeBits.AddressingMode);
2391  }
2392  bool isIndexScaled() const {
2393  return (getIndexType() == ISD::SIGNED_SCALED) ||
2394  (getIndexType() == ISD::UNSIGNED_SCALED);
2395  }
2396  bool isIndexSigned() const {
2397  return (getIndexType() == ISD::SIGNED_SCALED) ||
2398  (getIndexType() == ISD::SIGNED_UNSCALED);
2399  }
2400 
2401  // In the both nodes address is Op1, mask is Op2:
2402  // MaskedGatherSDNode (Chain, passthru, mask, base, index, scale)
2403  // MaskedScatterSDNode (Chain, value, mask, base, index, scale)
2404  // Mask is a vector of i1 elements
2405  const SDValue &getBasePtr() const { return getOperand(3); }
2406  const SDValue &getIndex() const { return getOperand(4); }
2407  const SDValue &getMask() const { return getOperand(2); }
2408  const SDValue &getScale() const { return getOperand(5); }
2409 
2410  static bool classof(const SDNode *N) {
2411  return N->getOpcode() == ISD::MGATHER ||
2412  N->getOpcode() == ISD::MSCATTER;
2413  }
2414 };
2415 
2416 /// This class is used to represent an MGATHER node
2417 ///
2419 public:
2420  friend class SelectionDAG;
2421 
2422  MaskedGatherSDNode(unsigned Order, const DebugLoc &dl, SDVTList VTs,
2423  EVT MemVT, MachineMemOperand *MMO,
2424  ISD::MemIndexType IndexType)
2425  : MaskedGatherScatterSDNode(ISD::MGATHER, Order, dl, VTs, MemVT, MMO,
2426  IndexType) {}
2427 
2428  const SDValue &getPassThru() const { return getOperand(1); }
2429 
2430  static bool classof(const SDNode *N) {
2431  return N->getOpcode() == ISD::MGATHER;
2432  }
2433 };
2434 
2435 /// This class is used to represent an MSCATTER node
2436 ///
2438 public:
2439  friend class SelectionDAG;
2440 
2441  MaskedScatterSDNode(unsigned Order, const DebugLoc &dl, SDVTList VTs,
2442  EVT MemVT, MachineMemOperand *MMO,
2443  ISD::MemIndexType IndexType)
2444  : MaskedGatherScatterSDNode(ISD::MSCATTER, Order, dl, VTs, MemVT, MMO,
2445  IndexType) {}
2446 
2447  const SDValue &getValue() const { return getOperand(1); }
2448 
2449  static bool classof(const SDNode *N) {
2450  return N->getOpcode() == ISD::MSCATTER;
2451  }
2452 };
2453 
2454 /// An SDNode that represents everything that will be needed
2455 /// to construct a MachineInstr. These nodes are created during the
2456 /// instruction selection proper phase.
2457 ///
2458 /// Note that the only supported way to set the `memoperands` is by calling the
2459 /// `SelectionDAG::setNodeMemRefs` function as the memory management happens
2460 /// inside the DAG rather than in the node.
2461 class MachineSDNode : public SDNode {
2462 private:
2463  friend class SelectionDAG;
2464 
2465  MachineSDNode(unsigned Opc, unsigned Order, const DebugLoc &DL, SDVTList VTs)
2466  : SDNode(Opc, Order, DL, VTs) {}
2467 
2468  // We use a pointer union between a single `MachineMemOperand` pointer and
2469  // a pointer to an array of `MachineMemOperand` pointers. This is null when
2470  // the number of these is zero, the single pointer variant used when the
2471  // number is one, and the array is used for larger numbers.
2472  //
2473  // The array is allocated via the `SelectionDAG`'s allocator and so will
2474  // always live until the DAG is cleaned up and doesn't require ownership here.
2475  //
2476  // We can't use something simpler like `TinyPtrVector` here because `SDNode`
2477  // subclasses aren't managed in a conforming C++ manner. See the comments on
2478  // `SelectionDAG::MorphNodeTo` which details what all goes on, but the
2479  // constraint here is that these don't manage memory with their constructor or
2480  // destructor and can be initialized to a good state even if they start off
2481  // uninitialized.
2483 
2484  // Note that this could be folded into the above `MemRefs` member if doing so
2485  // is advantageous at some point. We don't need to store this in most cases.
2486  // However, at the moment this doesn't appear to make the allocation any
2487  // smaller and makes the code somewhat simpler to read.
2488  int NumMemRefs = 0;
2489 
2490 public:
2492 
2494  // Special case the common cases.
2495  if (NumMemRefs == 0)
2496  return {};
2497  if (NumMemRefs == 1)
2498  return makeArrayRef(MemRefs.getAddrOfPtr1(), 1);
2499 
2500  // Otherwise we have an actual array.
2501  return makeArrayRef(MemRefs.get<MachineMemOperand **>(), NumMemRefs);
2502  }
2503  mmo_iterator memoperands_begin() const { return memoperands().begin(); }
2504  mmo_iterator memoperands_end() const { return memoperands().end(); }
2505  bool memoperands_empty() const { return memoperands().empty(); }
2506 
2507  /// Clear out the memory reference descriptor list.
2508  void clearMemRefs() {
2509  MemRefs = nullptr;
2510  NumMemRefs = 0;
2511  }
2512 
2513  static bool classof(const SDNode *N) {
2514  return N->isMachineOpcode();
2515  }
2516 };
2517 
2518 class SDNodeIterator : public std::iterator<std::forward_iterator_tag,
2519  SDNode, ptrdiff_t> {
2520  const SDNode *Node;
2521  unsigned Operand;
2522 
2523  SDNodeIterator(const SDNode *N, unsigned Op) : Node(N), Operand(Op) {}
2524 
2525 public:
2526  bool operator==(const SDNodeIterator& x) const {
2527  return Operand == x.Operand;
2528  }
2529  bool operator!=(const SDNodeIterator& x) const { return !operator==(x); }
2530 
2531  pointer operator*() const {
2532  return Node->getOperand(Operand).getNode();
2533  }
2534  pointer operator->() const { return operator*(); }
2535 
2536  SDNodeIterator& operator++() { // Preincrement
2537  ++Operand;
2538  return *this;
2539  }
2540  SDNodeIterator operator++(int) { // Postincrement
2541  SDNodeIterator tmp = *this; ++*this; return tmp;
2542  }
2543  size_t operator-(SDNodeIterator Other) const {
2544  assert(Node == Other.Node &&
2545  "Cannot compare iterators of two different nodes!");
2546  return Operand - Other.Operand;
2547  }
2548 
2549  static SDNodeIterator begin(const SDNode *N) { return SDNodeIterator(N, 0); }
2550  static SDNodeIterator end (const SDNode *N) {
2551  return SDNodeIterator(N, N->getNumOperands());
2552  }
2553 
2554  unsigned getOperand() const { return Operand; }
2555  const SDNode *getNode() const { return Node; }
2556 };
2557 
2558 template <> struct GraphTraits<SDNode*> {
2559  using NodeRef = SDNode *;
2561 
2562  static NodeRef getEntryNode(SDNode *N) { return N; }
2563 
2565  return SDNodeIterator::begin(N);
2566  }
2567 
2569  return SDNodeIterator::end(N);
2570  }
2571 };
2572 
2573 /// A representation of the largest SDNode, for use in sizeof().
2574 ///
2575 /// This needs to be a union because the largest node differs on 32 bit systems
2576 /// with 4 and 8 byte pointer alignment, respectively.
2580 
2581 /// The SDNode class with the greatest alignment requirement.
2583 
2584 namespace ISD {
2585 
2586  /// Returns true if the specified node is a non-extending and unindexed load.
2587  inline bool isNormalLoad(const SDNode *N) {
2588  const LoadSDNode *Ld = dyn_cast<LoadSDNode>(N);
2589  return Ld && Ld->getExtensionType() == ISD::NON_EXTLOAD &&
2591  }
2592 
2593  /// Returns true if the specified node is a non-extending load.
2594  inline bool isNON_EXTLoad(const SDNode *N) {
2595  return isa<LoadSDNode>(N) &&
2596  cast<LoadSDNode>(N)->getExtensionType() == ISD::NON_EXTLOAD;
2597  }
2598 
2599  /// Returns true if the specified node is a EXTLOAD.
2600  inline bool isEXTLoad(const SDNode *N) {
2601  return isa<LoadSDNode>(N) &&
2602  cast<LoadSDNode>(N)->getExtensionType() == ISD::EXTLOAD;
2603  }
2604 
2605  /// Returns true if the specified node is a SEXTLOAD.
2606  inline bool isSEXTLoad(const SDNode *N) {
2607  return isa<LoadSDNode>(N) &&
2608  cast<LoadSDNode>(N)->getExtensionType() == ISD::SEXTLOAD;
2609  }
2610 
2611  /// Returns true if the specified node is a ZEXTLOAD.
2612  inline bool isZEXTLoad(const SDNode *N) {
2613  return isa<LoadSDNode>(N) &&
2614  cast<LoadSDNode>(N)->getExtensionType() == ISD::ZEXTLOAD;
2615  }
2616 
2617  /// Returns true if the specified node is an unindexed load.
2618  inline bool isUNINDEXEDLoad(const SDNode *N) {
2619  return isa<LoadSDNode>(N) &&
2620  cast<LoadSDNode>(N)->getAddressingMode() == ISD::UNINDEXED;
2621  }
2622 
2623  /// Returns true if the specified node is a non-truncating
2624  /// and unindexed store.
2625  inline bool isNormalStore(const SDNode *N) {
2626  const StoreSDNode *St = dyn_cast<StoreSDNode>(N);
2627  return St && !St->isTruncatingStore() &&
2629  }
2630 
2631  /// Returns true if the specified node is a non-truncating store.
2632  inline bool isNON_TRUNCStore(const SDNode *N) {
2633  return isa<StoreSDNode>(N) && !cast<StoreSDNode>(N)->isTruncatingStore();
2634  }
2635 
2636  /// Returns true if the specified node is a truncating store.
2637  inline bool isTRUNCStore(const SDNode *N) {
2638  return isa<StoreSDNode>(N) && cast<StoreSDNode>(N)->isTruncatingStore();
2639  }
2640 
2641  /// Returns true if the specified node is an unindexed store.
2642  inline bool isUNINDEXEDStore(const SDNode *N) {
2643  return isa<StoreSDNode>(N) &&
2644  cast<StoreSDNode>(N)->getAddressingMode() == ISD::UNINDEXED;
2645  }
2646 
2647  /// Attempt to match a unary predicate against a scalar/splat constant or
2648  /// every element of a constant BUILD_VECTOR.
2649  /// If AllowUndef is true, then UNDEF elements will pass nullptr to Match.
2652  bool AllowUndefs = false);
2653 
2654  /// Attempt to match a binary predicate against a pair of scalar/splat
2655  /// constants or every element of a pair of constant BUILD_VECTORs.
2656  /// If AllowUndef is true, then UNDEF elements will pass nullptr to Match.
2657  /// If AllowTypeMismatch is true then RetType + ArgTypes don't need to match.
2658  bool matchBinaryPredicate(
2659  SDValue LHS, SDValue RHS,
2661  bool AllowUndefs = false, bool AllowTypeMismatch = false);
2662 } // end namespace ISD
2663 
2664 } // end namespace llvm
2665 
2666 #endif // LLVM_CODEGEN_SELECTIONDAGNODES_H
ANNOTATION_LABEL - Represents a mid basic block label used by annotations.
Definition: ISDOpcodes.h:709
bool isMachineConstantPoolEntry() const
Iterator for directly iterating over the operand SDValue&#39;s.
void setAllowReciprocal(bool b)
void setAllowReassociation(bool b)
bool isInvariant() const
bool isUnordered() const
Returns true if this memory operation doesn&#39;t have any ordering constraints other than normal aliasin...
BUILTIN_OP_END - This must be the last enum value in this list.
Definition: ISDOpcodes.h:913
EVT getValueType() const
Return the ValueType of the referenced return value.
static void commuteMask(MutableArrayRef< int > Mask)
Change values in a shuffle permute mask assuming the two vector operands have swapped position...
static GCMetadataPrinterRegistry::Add< ErlangGCPrinter > X("erlang", "erlang-compatible garbage collector")
const SDValue & getOffset() const
void setFlags(SDNodeFlags NewFlags)
static bool isConstant(const MachineInstr &MI)
bool isUndef() const
bool hasNoSignedZeros() const
First const * getAddrOfPtr1() const
If the union is set to the first pointer type get an address pointing to it.
Definition: PointerUnion.h:209
Constrained versions of libm-equivalent floating point intrinsics.
Definition: ISDOpcodes.h:300
This SDNode is used for target intrinsics that touch memory and need an associated MachineMemOperand...
bool hasNoNaNs() const
Test if this operation&#39;s arguments and results are assumed not-NaN.
Definition: Operator.h:332
const GlobalValue * getGlobal() const
PointerUnion< const Value *, const PseudoSourceValue * > ValueType
GCNRegPressure max(const GCNRegPressure &P1, const GCNRegPressure &P2)
unsigned getOpcode() const
Return the SelectionDAG opcode value for this node.
MCSymbol * getLabel() const
bool hasNoInfs() const
Test if this operation&#39;s arguments and results are assumed not-infinite.
Definition: Operator.h:337
bool isBuildVectorOfConstantSDNodes(const SDNode *N)
Return true if the specified node is a BUILD_VECTOR node of all ConstantSDNode or undef...
bool isConstantSplat(SDValue Op, APInt &SplatVal)
If Op is a constant whose elements are all the same constant or undefined, return true and return the...
static bool classof(const SDNode *N)
bool isIndexed() const
Return true if this is a pre/post inc/dec load/store.
Atomic ordering constants.
MDNODE_SDNODE - This is a node that holdes an MDNode*, which is used to reference metadata in the IR...
Definition: ISDOpcodes.h:767
int64_t getOffset() const
This class represents lattice values for constants.
Definition: AllocatorList.h:23
bool isNON_TRUNCStore(const SDNode *N)
Returns true if the specified node is a non-truncating store.
value_iterator value_end() const
Various leaf nodes.
Definition: ISDOpcodes.h:59
bool isCompareAndSwap() const
Returns true if this SDNode represents cmpxchg atomic operation, false otherwise. ...
void intersectWith(const SDNodeFlags Flags)
Clear any flags in this flag set that aren&#39;t also set in Flags.
VECTOR_SHUFFLE(VEC1, VEC2) - Returns a vector, of the same type as VEC1/VEC2.
Definition: ISDOpcodes.h:398
EVT getScalarType() const
If this is a vector type, return the element type, otherwise return this.
Definition: ValueTypes.h:259
MCSymbol - Instances of this class represent a symbol name in the MC file, and MCSymbols are created ...
Definition: MCSymbol.h:41
const SDValue & getVal() const
#define BEGIN_TWO_BYTE_PACK()
constexpr char IsVolatile[]
Key for Kernel::Arg::Metadata::mIsVolatile.
const Value * getSplatValue(const Value *V)
Get splat value if the input is a splat vector or return nullptr.
unsigned getIROrder() const
Return the node ordering.
const SDValue & getBasePtr() const
bool isNegative() const
Return true if the value is negative.
bool isTargetMemoryOpcode() const
Test if this node has a target-specific memory-referencing opcode (in the <target>ISD namespace and g...
const SDNode * getNode() const
EVT getValueType(unsigned ResNo) const
Return the type of a specified result.
bool operator<(const SDValue &O) const
MachineBasicBlock * getBasicBlock() const
This provides a very simple, boring adaptor for a begin and end iterator into a range type...
StoreSDNodeBitfields StoreSDNodeBits
bool isMemIntrinsic() const
Test if this node is a memory intrinsic (with valid pointer information).
const SDValue & getValue() const
SDVTList getVTList() const
unsigned Reg
DEMANGLE_DUMP_METHOD void dump() const
This file contains the declarations for metadata subclasses.
bool isCompressingStore() const
Returns true if the op does a compression to the vector before storing.
MCSymbol * getMCSymbol() const
bool isTargetOpcode() const
bool atEnd() const
Return true if this iterator is at the end of uses list.
MVT getSimpleVT() const
Return the SimpleValueType held in the specified simple EVT.
Definition: ValueTypes.h:252
const SDValue & getBasePtr() const
Optional< std::vector< StOtherPiece > > Other
Definition: ELFYAML.cpp:952
uint32_t NodeId
Definition: RDFGraph.h:260
AAMDNodes getAAInfo() const
Returns the AA info that describes the dereference.
Completely target-dependent object reference.
const SDValue & getBasePtr() const
void copyFMF(const FPMathOperator &FPMO)
Propagate the fast-math-flags from an IR FPMathOperator.
const SDValue & getChain() const
static bool classof(const SDNode *N)
unsigned getResNo() const
Convenience function for get().getResNo().
ISD::MemIndexedMode getAddressingMode() const
Return the addressing mode for this load or store: unindexed, pre-inc, pre-dec, post-inc, or post-dec.
TargetGlobalAddress - Like GlobalAddress, but the DAG does no folding or anything else with this node...
Definition: ISDOpcodes.h:130
unsigned getAlignment() const
bool operator==(const use_iterator &x) const
unsigned getValueSizeInBits(unsigned ResNo) const
Returns MVT::getSizeInBits(getValueType(ResNo)).
Val, Success, OUTCHAIN = ATOMIC_CMP_SWAP_WITH_SUCCESS(INCHAIN, ptr, cmp, swap) N.b.
Definition: ISDOpcodes.h:833
bool isAllOnesOrAllOnesSplat(SDValue V)
Return true if the value is a constant -1 integer or a splatted vector of a constant -1 integer (with...
Constrained versions of the binary floating point operators.
Definition: ISDOpcodes.h:293
SDLoc(const SDNode *N)
A debug info location.
Definition: DebugLoc.h:33
Metadata node.
Definition: Metadata.h:863
MVT getSimpleValueType(unsigned ResNo) const
Return the type of a specified result as a simple type.
block Block Frequency true
bool hasAllowContract() const
Test if this operation can be floating-point contracted (FMA).
Definition: Operator.h:352
void setApproximateFuncs(bool b)
const SDNodeFlags getFlags() const
void setNodeId(int Id)
Set unique node id.
bool isTargetOpcode() const
Test if this node has a target-specific opcode (in the <target>ISD namespace).
SDNode * getNode() const
get the SDNode which holds the desired result
static bool classof(const SDNode *N)
#define op(i)
MachineMemOperand * getMemOperand() const
Return a MachineMemOperand object describing the memory reference performed by operation.
void setNoSignedZeros(bool b)
uint64_t getBaseAlignment() const
Return the minimum known alignment in bytes of the base address, without the offset.
static ChildIteratorType child_end(NodeRef N)
static SimpleType getSimplifiedValue(SDUse &Val)
uint16_t PersistentId
Unique and persistent id per SDNode in the DAG.
T get() const
Returns the value of the specified pointer type.
Definition: PointerUnion.h:194
unsigned int NumVTs
const DebugLoc & getDebugLoc() const
Return the source location info.
SDUse * getNext() const
Get the next SDUse in the use list.
unsigned getValueSizeInBits() const
Returns the size of the value in bits.
bool hasOneUse() const
Return true if there is exactly one node using value ResNo of Node.
NodeType
ISD::NodeType enum - This enum defines the target-independent operators for a SelectionDAG.
Definition: ISDOpcodes.h:38
const ConstantFP * getConstantFPValue() const
const DebugLoc & getDebugLoc() const
This SDNode is used to implement the code generator support for the llvm IR shufflevector instruction...
static bool classof(const SDNode *N)
bool hasApproximateFuncs() const
RESULT,OUTCHAIN = INTRINSIC_W_CHAIN(INCHAIN, INTRINSICID, arg1, ...) This node represents a target in...
Definition: ISDOpcodes.h:158
bool isTruncatingStore() const
Return true if the op does a truncation before store.
static bool hasPredecessorHelper(const SDNode *N, SmallPtrSetImpl< const SDNode *> &Visited, SmallVectorImpl< const SDNode *> &Worklist, unsigned int MaxSteps=0, bool TopologicalPrune=false)
Returns true if N is a predecessor of any node in Worklist.
unsigned getAddressSpace() const
Return the address space for the associated pointer.
A templated base class for SmallPtrSet which provides the typesafe interface that is common across al...
Definition: SmallPtrSet.h:343
static bool classof(const SDNode *N)
bool isAtomic() const
Returns true if this operation has an atomic ordering requirement of unordered or higher...
static SDVTList getSDVTList(EVT VT)
unsigned getTargetFlags() const
void setNoSignedWrap(bool b)
The address of a basic block.
Definition: Constants.h:839
AAMDNodes getAAInfo() const
Return the AA tags for the memory reference.
static bool classof(const SDNode *N)
bool isSEXTLoad(const SDNode *N)
Returns true if the specified node is a SEXTLOAD.
bool hasOneUse() const
Return true if there is exactly one use of this node.
A description of a memory reference used in the backend.
Definition: BitVector.h:937
std::iterator< std::forward_iterator_tag, SDUse, ptrdiff_t >::reference reference
static bool classof(const SDNode *N)
void setVectorReduction(bool b)
ConstantSDNode * isConstOrConstSplat(SDValue N, bool AllowUndefs=false, bool AllowTruncation=false)
Returns the SDNode if it is a constant splat BuildVector or constant int.
ArrayRef< T > makeArrayRef(const T &OneElt)
Construct an ArrayRef from a single element.
Definition: ArrayRef.h:450
bool matchUnaryPredicate(SDValue Op, std::function< bool(ConstantSDNode *)> Match, bool AllowUndefs=false)
Attempt to match a unary predicate against a scalar/splat constant or every element of a constant BUI...
bool isNormalStore(const SDNode *N)
Returns true if the specified node is a non-truncating and unindexed store.
const MDNode * getRanges() const
Return the range tag for the memory reference.
Base class for LoadSDNode and StoreSDNode.
bool isBuildVectorAllZeros(const SDNode *N)
Return true if the specified node is a BUILD_VECTOR where all of the elements are 0 or undef...
static Optional< unsigned > getOpcode(ArrayRef< VPValue *> Values)
Returns the opcode of Values or ~0 if they do not all agree.
Definition: VPlanSLP.cpp:196
MaskedScatterSDNode(unsigned Order, const DebugLoc &dl, SDVTList VTs, EVT MemVT, MachineMemOperand *MMO, ISD::MemIndexType IndexType)
This class consists of common code factored out of the SmallVector class to reduce code duplication b...
Definition: APFloat.h:41
const SDValue & getPassThru() const
const MDNode * getMD() const
ArrayRef< MachineMemOperand * > memoperands() const
op_iterator op_end() const
unsigned getScalarValueSizeInBits() const
uint64_t getConstantOperandVal(unsigned i) const
ISD::LoadExtType getExtensionType() const
Return whether this is a plain node, or one of the varieties of value-extending loads.
bool isZEXTLoad(const SDNode *N)
Returns true if the specified node is a ZEXTLOAD.
Val, OUTCHAIN = ATOMIC_SWAP(INCHAIN, ptr, amt) Val, OUTCHAIN = ATOMIC_LOAD_[OpName](INCHAIN, ptr, amt) For double-word atomic operations: ValLo, ValHi, OUTCHAIN = ATOMIC_SWAP(INCHAIN, ptr, amtLo, amtHi) ValLo, ValHi, OUTCHAIN = ATOMIC_LOAD_[OpName](INCHAIN, ptr, amtLo, amtHi) These correspond to the atomicrmw instruction.
Definition: ISDOpcodes.h:841
const SDValue & getValue() const
bool hasAllowReciprocal() const
Test if this operation can use reciprocal multiply instead of division.
Definition: Operator.h:347
bool isTRUNCStore(const SDNode *N)
Returns true if the specified node is a truncating store.
This class is used to represent EVT&#39;s, which are used to parameterize some operations.
const BlockAddress * getBlockAddress() const
This is an SDNode representing atomic operations.
ShuffleVectorSDNode(EVT VT, unsigned Order, const DebugLoc &dl, const int *M)
AtomicOrdering getOrdering() const
Return the atomic ordering requirements for this memory operation.
static unsigned getHashValue(const SDValue &Val)
APInt operator*(APInt a, uint64_t RHS)
Definition: APInt.h:2097
This represents a list of ValueType&#39;s that has been intern&#39;d by a SelectionDAG.
bool isConstantSplatVector(const SDNode *N, APInt &SplatValue)
Node predicates.
This class is used to represent an MSTORE node.
AtomicOrdering
Atomic ordering for LLVM&#39;s memory model.
LoadSDNodeBitfields LoadSDNodeBits
bool isOne() const
This is just a convenience method to make client code smaller for a common case.
Definition: Constants.h:200
int64_t getSExtValue() const
bool operator==(const SDValue &V) const
Convenience function for get().operator==.
unsigned getSizeInBits() const
Return the size of the specified value type in bits.
Definition: ValueTypes.h:291
#define UINT64_MAX
Definition: DataTypes.h:83
static bool classof(const SDNode *N)
SDValue()=default
AtomicOrdering getOrdering() const
Return the atomic ordering requirements for this memory operation.
static bool classof(const SDNode *N)
void checkForCycles(const SelectionDAG *DAG, bool force=false)
bool writeMem() const
bool isOneOrOneSplat(SDValue V)
Return true if the value is a constant 1 integer or a splatted vector of a constant 1 integer (with n...
void clearMemRefs()
Clear out the memory reference descriptor list.
static SDNodeIterator begin(const SDNode *N)
bool isUNINDEXEDStore(const SDNode *N)
Returns true if the specified node is an unindexed store.
static bool classof(const SDNode *N)
static bool classof(const SDNode *N)
#define END_TWO_BYTE_PACK()
const SDValue & getScale() const
bool isNegative() const
Return true if the sign bit is set.
Definition: Constants.h:308
SDValue peekThroughBitcasts(SDValue V)
Return the non-bitcasted source operand of V if it exists.
static SimpleType getSimplifiedValue(const SDValue &Val)
ArrayRef - Represent a constant reference to an array (0 or more elements consecutively in memory)...
Definition: APInt.h:32
MemIndexType
MemIndexType enum - This enum defines how to interpret MGATHER/SCATTER&#39;s index parameter when calcula...
Definition: ISDOpcodes.h:968
unsigned getTargetFlags() const
static bool classof(const SDNode *N)
const APInt & getValue() const
Return the constant as an APInt value reference.
Definition: Constants.h:137
static bool classof(const SDNode *N)
bool isMinusOne() const
This function will return true iff every bit in this constant is set to true.
Definition: Constants.h:208
CondCode
ISD::CondCode enum - These are ordered carefully to make the bitfields below work out...
Definition: ISDOpcodes.h:1012
op_iterator op_begin() const
X = STRICT_FP_EXTEND(Y) - Extend a smaller FP type into a larger FP type.
Definition: ISDOpcodes.h:330
TargetConstant* - Like Constant*, but the DAG does not do any folding, simplification, or lowering of the constant.
Definition: ISDOpcodes.h:124
MachineConstantPoolValue * MachineCPVal
ArrayRef< SDUse > ops() const
void setIROrder(unsigned Order)
Set the node ordering.
const SDValue & getMask() const
int64_t getSrcValueOffset() const
bool getHasDebugValue() const
mmo_iterator memoperands_end() const
unsigned getSrcAddressSpace() const
SDNodeBitfields SDNodeBits
const char * getSymbol() const
static bool classof(const SDNode *N)
bool use_empty() const
Return true if there are no nodes using value ResNo of Node.
UNDEF - An undefined node.
Definition: ISDOpcodes.h:177
This class is used to represent ISD::STORE nodes.
MaskedStoreSDNode(unsigned Order, const DebugLoc &dl, SDVTList VTs, bool isTrunc, bool isCompressing, EVT MemVT, MachineMemOperand *MMO)
bool hasAllowReciprocal() const
BUILD_VECTOR(ELT0, ELT1, ELT2, ELT3,...) - Return a vector with the specified, possibly variable...
Definition: ISDOpcodes.h:358
bool isOneConstant(SDValue V)
Returns true if V is a constant integer one.
This corresponds to the llvm.lifetime.
Definition: ISDOpcodes.h:877
MVT getSimpleValueType() const
Return the simple ValueType of the referenced return value.
SDNode * operator->() const
bool isZero() const
Return true if the value is positive or negative zero.
bool hasAllowContract() const
FoldingSetNodeID - This class is used to gather all the unique data bits of a node.
Definition: FoldingSet.h:305
unsigned getNumValues() const
Return the number of values defined/returned by this operator.
const SDValue & getBasePtr() const
static bool classof(const SDNode *N)
bool isSimple() const
Returns true if the memory operation is neither atomic or volatile.
bool isNormalLoad(const SDNode *N)
Returns true if the specified node is a non-extending and unindexed load.
OUTCHAIN = INTRINSIC_VOID(INCHAIN, INTRINSICID, arg1, arg2, ...) This node represents a target intrin...
Definition: ISDOpcodes.h:165
const SDValue & operator*() const
bool isNaN() const
Return true if the value is a NaN.
uint64_t getZExtValue() const
Return the constant as a 64-bit unsigned integer value after it has been zero extended as appropriate...
Definition: Constants.h:148
void dump(const SparseBitVector< ElementSize > &LHS, raw_ostream &out)
MutableArrayRef - Represent a mutable reference to an array (0 or more elements consecutively in memo...
Definition: ArrayRef.h:290
use_iterator use_begin() const
Provide iteration support to walk over all uses of an SDNode.
Machine Value Type.
static bool classof(const SDNode *N)
LLVM Basic Block Representation.
Definition: BasicBlock.h:57
MaskedGatherSDNode(unsigned Order, const DebugLoc &dl, SDVTList VTs, EVT MemVT, MachineMemOperand *MMO, ISD::MemIndexType IndexType)
The instances of the Type class are immutable: once they are created, they are never changed...
Definition: Type.h:45
bool isMachineOpcode() const
CRTP base class for adapting an iterator to a different type.
Definition: iterator.h:205
unsigned getVectorNumElements() const
Given a vector type, return the number of elements it contains.
Definition: ValueTypes.h:272
static Optional< bool > isBigEndian(const SmallVector< int64_t, 4 > &ByteOffsets, int64_t FirstOffset)
size_t size() const
size - Get the array size.
Definition: ArrayRef.h:148
This is an important base class in LLVM.
Definition: Constant.h:41
iterator_range< value_op_iterator > op_values() const
SDNode * getGluedUser() const
If this node has a glue value with a user, return the user (there is at most one).
static bool classof(const SDNode *N)
const SDValue & getOperand(unsigned Num) const
bool operator==(const SDValue &O) const
bool operator!=(const SDValue &V) const
Convenience function for get().operator!=.
LoadExtType
LoadExtType enum - This enum defines the three variants of LOADEXT (load with extension).
Definition: ISDOpcodes.h:987
This SDNode is used for LIFETIME_START/LIFETIME_END values, which indicate the offet and size that ar...
This file contains the declarations for the subclasses of Constant, which represent the different fla...
static bool isOperandOf(const SUnit *SU, SDNode *N)
ConstantFP - Floating Point Values [float, double].
Definition: Constants.h:263
std::pair< iterator, bool > insert(PtrType Ptr)
Inserts Ptr if and only if there is no element in the container equal to Ptr.
Definition: SmallPtrSet.h:370
This is a base class used to represent MGATHER and MSCATTER nodes.
const SDValue & getOffset() const
unsigned getDestAddressSpace() const
bool isTargetMemoryOpcode() const
bool isExactlyValue(double V) const
We don&#39;t rely on operator== working on double values, as it returns true for things that are clearly ...
Definition: APFloat.h:1145
This file declares a class to represent arbitrary precision floating point values and provide a varie...
This class provides iterator support for SDUse operands that use a specific SDNode.
bool isExactlyValue(double V) const
We don&#39;t rely on operator== working on double values, as it returns true for things that are clearly ...
static bool classof(const SDNode *N)
unsigned getMachineOpcode() const
bool hasNoNaNs() const
void setNoInfs(bool b)
SDNode(unsigned Opc, unsigned Order, DebugLoc dl, SDVTList VTs)
Create an SDNode.
const APInt & getAPIntValue() const
TargetIndex - Like a constant pool entry, but with completely target-dependent semantics.
Definition: ISDOpcodes.h:143
static bool classof(const SDNode *N)
SDNodeIterator & operator++()
SDNodeIterator operator++(int)
static void print(raw_ostream &Out, object::Archive::Kind Kind, T Val)
bool isDefined() const
Returns true if the flags are in a defined state.
SDNode * getGluedNode() const
If this node has a glue operand, return the node to which the glue operand points.
static bool classof(const SDNode *N)
size_type count(ConstPtrType Ptr) const
count - Return 1 if the specified pointer is in the set, 0 otherwise.
Definition: SmallPtrSet.h:381
unsigned getOriginalAlignment() const
Returns alignment and volatility of the memory access.
void setAllowContract(bool b)
const SDValue & getValue() const
static bool classof(const SDNode *N)
unsigned getTargetFlags() const
Val, OUTCHAIN = ATOMIC_CMP_SWAP(INCHAIN, ptr, cmp, swap) For double-word atomic operations: ValLo...
Definition: ISDOpcodes.h:827
void addUse(SDUse &U)
This method should only be used by the SDUse class.
static bool classof(const SDNode *N)
const SDValue & getIndex() const
Extended Value Type.
Definition: ValueTypes.h:33
static bool classof(const SDNode *N)
const SDValue & getBasePtr() const
Abstract base class for all machine specific constantpool value subclasses.
static bool isAtomic(Instruction *I)
static bool classof(const SDNode *N)
static wasm::ValType getType(const TargetRegisterClass *RC)
static bool classof(const SDNode *N)
bool isVolatile() const
This class contains a discriminated union of information about pointers in memory operands...
bool hasApproxFunc() const
Test if this operation allows approximations of math library functions or intrinsics.
Definition: Operator.h:358
bool isMachineOpcode() const
Test if this node has a post-isel opcode, directly corresponding to a MachineInstr opcode...
unsigned getNumOperands() const
Return the number of values used by this operation.
HANDLENODE node - Used as a handle for various purposes.
Definition: ISDOpcodes.h:781
uint64_t getAlignment() const
Return the minimum known alignment in bytes of the actual memory reference.
This struct is a compact representation of a valid (non-zero power of two) alignment.
Definition: Alignment.h:40
const SDValue & getMask() const
EH_LABEL - Represents a label in mid basic block used to track locations needed for debug and excepti...
Definition: ISDOpcodes.h:703
bool isUnindexed() const
Return true if this is NOT a pre/post inc/dec load/store.
void refineAlignment(const MachineMemOperand *MMO)
Update this MachineMemOperand to reflect the alignment of MMO, if it has a greater alignment...
bool isEXTLoad(const SDNode *N)
Returns true if the specified node is a EXTLOAD.
ConstantFPSDNode * isConstOrConstSplatFP(SDValue N, bool AllowUndefs=false)
Returns the SDNode if it is a constant splat BuildVector or constant float.
MachineMemOperand * MMO
Memory reference information.
static bool classof(const SDNode *N)
bool isUNINDEXEDLoad(const SDNode *N)
Returns true if the specified node is an unindexed load.
const APFloat & getValueAPF() const
Definition: Constants.h:302
bool hasAllowReassoc() const
Test if this operation may be simplified with reassociative transforms.
Definition: Operator.h:327
const APInt & getConstantOperandAPInt(unsigned i) const
bool use_empty() const
Return true if there are no uses of this node.
size_type size() const
Definition: SmallPtrSet.h:92
SDNode * getNode() const
Convenience function for get().getNode().
iterator_range< T > make_range(T x, T y)
Convenience function for iterating over sub-ranges.
static bool isUndef(ArrayRef< int > Mask)
TokenFactor - This node takes multiple tokens as input and produces a single token result...
Definition: ISDOpcodes.h:49
bool isBuildVectorAllOnes(const SDNode *N)
Return true if the specified node is a BUILD_VECTOR where all of the elements are ~0 or undef...
ConstantSDNodeBitfields ConstantSDNodeBits
static bool classof(const SDNode *N)
bool memoperands_empty() const
bool hasNoSignedZeros() const
Test if this operation can ignore the sign of zero.
Definition: Operator.h:342
void setNoUnsignedWrap(bool b)
uint64_t getLimitedValue(uint64_t Limit=~0ULL) const
getLimitedValue - If the value is smaller than the specified limit, return it, otherwise return the l...
Definition: Constants.h:250
This is the shared class of boolean and integer constants.
Definition: Constants.h:83
void setNode(SDNode *N)
set the SDNode
bool isNullOrNullSplat(SDValue V, bool AllowUndefs=false)
Return true if the value is a constant 0 integer or a splatted vector of a constant 0 integer (with n...
use_iterator(const use_iterator &I)
This is used to represent a portion of an LLVM function in a low-level Data Dependence DAG representa...
Definition: SelectionDAG.h:221
const SDValue & getMask() const
void setDefined()
Sets the state of the flags to the defined state.
bool isAtomic() const
Return true if the memory operation ordering is Unordered or higher.
ADDRSPACECAST - This operator converts between pointers of different address spaces.
Definition: ISDOpcodes.h:599
value_iterator value_begin() const
static bool classof(const SDNode *N)
This is a &#39;vector&#39; (really, a variable-sized array), optimized for the case when the array is small...
Definition: SmallVector.h:837
Utility class for floating point operations which can have information about relaxed accuracy require...
Definition: Operator.h:245
const DebugLoc & getDebugLoc() const
void dump() const
bool allOperandsUndef(const SDNode *N)
Return true if the node has at least one operand and all operands of the specified node are ISD::UNDE...
const DataFlowGraph & G
Definition: RDFGraph.cpp:202
An SDNode that represents everything that will be needed to construct a MachineInstr.
const SDValue & getOffset() const
const SDValue & getPassThru() const
A collection of metadata nodes that might be associated with a memory access used by the alias-analys...
Definition: Metadata.h:643
LLVM_NODISCARD T pop_back_val()
Definition: SmallVector.h:374
This is an abstract virtual class for memory operations.
const Constant * getConstVal() const
Wrapper class for IR location info (IR ordering and DebugLoc) to be passed into SDNode creation funct...
bool isDivergent() const
bool hasFPExcept() const
static const int FIRST_TARGET_MEMORY_OPCODE
FIRST_TARGET_MEMORY_OPCODE - Target-specific pre-isel operations which do not reference a specific me...
Definition: ISDOpcodes.h:920
unsigned getTargetFlags() const
void setNoNaNs(bool b)
Represents one node in the SelectionDAG.
bool isBitwiseNot(SDValue V, bool AllowUndefs=false)
Returns true if V is a bitwise not operation.
bool readMem() const
bool operator==(const SDNodeIterator &x) const
static bool classof(const SDNode *N)
bool isDereferenceable() const
size_t use_size() const
Return the number of uses of this node.
A range adaptor for a pair of iterators.
EVT getMemoryVT() const
Return the type of the in-memory value.
Class for arbitrary precision integers.
Definition: APInt.h:69
bool isBuildVectorOfConstantFPSDNodes(const SDNode *N)
Return true if the specified node is a BUILD_VECTOR node of all ConstantFPSDNode or undef...
iterator_range< use_iterator > uses()
A "pseudo-class" with methods for operating on BUILD_VECTORs.
SDValue peekThroughOneUseBitcasts(SDValue V)
Return the non-bitcasted and one-use source operand of V if it exists.
static use_iterator use_end()
bool isNullFPConstant(SDValue V)
Returns true if V is an FP constant with a value of positive zero.
pointer operator->() const
A suitably aligned and sized character array member which can hold elements of any type...
Definition: AlignOf.h:48
unsigned getOperandNo() const
Retrieve the operand # of this use in its user.
iterator_range< use_iterator > uses() const
const SDValue & getBasePtr() const
const uint32_t * getRegMask() const
int getMaskElt(unsigned Idx) const
size_t operator-(SDNodeIterator Other) const
void append(in_iter in_start, in_iter in_end)
Add the specified range to the end of the SmallVector.
Definition: SmallVector.h:387
LSBaseSDNodeBitfields LSBaseSDNodeBits
bool hasVectorReduction() const
static bool classof(const SDNode *N)
static bool classof(const SDNode *N)
int getNodeId() const
Return the unique node id.
static bool classof(const SDNode *N)
bool hasNoSignedWrap() const
pointer operator*() const
bool matchBinaryPredicate(SDValue LHS, SDValue RHS, std::function< bool(ConstantSDNode *, ConstantSDNode *)> Match, bool AllowUndefs=false, bool AllowTypeMismatch=false)
Attempt to match a binary predicate against a pair of scalar/splat constants or every element of a pa...
void setTruncatingStore(bool Truncating)
mmo_iterator memoperands_begin() const
SyncScope::ID getSyncScopeID() const
Returns the synchronization scope ID for this memory operation.
These are IR-level optimization flags that may be propagated to SDNodes.
Represents a use of a SDNode.
void dumpr() const
SDNode * operator*() const
Retrieve a pointer to the current user node.
const MachinePointerInfo & getPointerInfo() const
static bool classof(const SDNode *N)
const DebugLoc & getDebugLoc() const
Return the debug location for this node as a DebugLoc.
Definition: Instruction.h:331
ISD::MemIndexType getIndexType() const
How is Index applied to BasePtr when computing addresses.
const SDValue & getValue() const
bool operator!=(const use_iterator &x) const
Node - This class is used to maintain the singly linked bucket list in a folding set.
Definition: FoldingSet.h:135
bool operator!=(const SDValue &O) const
static DebugLoc getDebugLoc(MachineBasicBlock::instr_iterator FirstMI, MachineBasicBlock::instr_iterator LastMI)
Return the first found DebugLoc that has a DILocation, given a range of instructions.
This base class is used to represent MLOAD and MSTORE nodes.
LLVM_NODISCARD bool empty() const
Definition: SmallVector.h:55
bool isZero() const
Return true if the value is positive or negative zero.
Definition: Constants.h:305
static bool hasOneUse(unsigned Reg, MachineInstr *Def, MachineRegisterInfo &MRI, MachineDominatorTree &MDT, LiveIntervals &LIS)
static bool classof(const SDNode *N)
LOAD and STORE have token chains as their first operand, then the same operands as an LLVM load/store...
Definition: ISDOpcodes.h:642
bool isNaN() const
Return true if the value is a NaN.
Definition: Constants.h:314
static NodeRef getEntryNode(SDNode *N)
const NodeList & List
Definition: RDFGraph.cpp:201
static SimpleType getSimplifiedValue(SDValue &Val)
#define I(x, y, z)
Definition: MD5.cpp:58
#define N
const ConstantInt * getConstantIntValue() const
const Value * getValue() const
Return the contained Value.
bool isZero() const
This is just a convenience method to make client code smaller for a common code.
Definition: Constants.h:192
bool isInfinity() const
Return true if the value is infinity.
Definition: Constants.h:311
An SDNode that holds an arbitrary LLVM IR Value.
EVT getValueType() const
Convenience function for get().getValueType().
LLVM_NODISCARD std::enable_if<!is_simple_type< Y >::value, typename cast_retty< X, const Y >::ret_type >::type dyn_cast(const Y &Val)
Definition: Casting.h:332
uint32_t Size
Definition: Profile.cpp:46
X = STRICT_FP_ROUND(Y, TRUNC) - Rounding &#39;Y&#39; from a larger floating point type down to the precision ...
Definition: ISDOpcodes.h:325
const SDValue & getBasePtr() const
bool operator<(const SDValue &V) const
Convenience function for get().operator<.
bool isNON_EXTLoad(const SDNode *N)
Returns true if the specified node is a non-extending load.
SDValue peekThroughExtractSubvectors(SDValue V)
Return the non-extracted vector source operand of V if it exists.
unsigned getOpcode() const
SDValue getValue(unsigned R) const
bool isInfinity() const
Return true if the value is an infinity.
This class is used to represent an MSCATTER node.
static ChildIteratorType child_begin(NodeRef N)
SDLoc(const SDValue V)
const MachinePointerInfo & getPointerInfo() const
MachineConstantPoolValue * getMachineCPVal() const
bool isUnordered() const
Returns true if the memory operation doesn&#39;t imply any ordering constraints on surrounding memory ope...
assert(ImpDefSCC.getReg()==AMDGPU::SCC &&ImpDefSCC.isDef())
This class is used to form a handle around another node that is persistent and is updated across invo...
unsigned getReg() const
std::iterator< std::forward_iterator_tag, SDUse, ptrdiff_t >::pointer pointer
bool isAllOnesConstant(SDValue V)
Returns true if V is an integer constant with all bits set.
This class is used to represent an MLOAD node.
bool isPredecessorOf(const SDNode *N) const
Return true if this node is a predecessor of N.
unsigned getRawSubclassData() const
Return the SubclassData value, without HasDebugValue.
aarch64 promote const
ArrayRef< int > getMask() const
int64_t getOffset() const
For normal values, this is a byte offset added to the base address.
unsigned getOperand() const
LLVM Value Representation.
Definition: Value.h:73
uint64_t getConstantOperandVal(unsigned Num) const
Helper method returns the integer value of a ConstantSDNode operand.
unsigned getResNo() const
get the index which selects a specific result in the SDNode
static bool isEqual(const SDValue &LHS, const SDValue &RHS)
static SDNodeIterator end(const SDNode *N)
const MDNode * getRanges() const
Returns the Ranges that describes the dereference.
unsigned getMachineOpcode() const
This may only be called if isMachineOpcode returns true.
SyncScope::ID getSyncScopeID() const
Returns the synchronization scope ID for this memory operation.
AtomicOrdering getFailureOrdering() const
For cmpxchg atomic operations, return the atomic ordering requirements when store does not occur...
MemSDNodeBitfields MemSDNodeBits
bool isTruncatingStore() const
Return true if the op does a truncation before store.
bool isNullConstant(SDValue V)
Returns true if V is a constant integer zero.
void setDebugLoc(DebugLoc dl)
Set source location info.
This class is used to represent an MGATHER node.
bool hasNoUnsignedWrap() const
std::underlying_type< E >::type Mask()
Get a bitmask with 1s in all places up to the high-order bit of E&#39;s largest value.
Definition: BitmaskEnum.h:80
PREFETCH - This corresponds to a prefetch intrinsic.
Definition: ISDOpcodes.h:807
void setHasDebugValue(bool b)
bool isNonTemporal() const
LSBaseSDNode(ISD::NodeType NodeTy, unsigned Order, const DebugLoc &dl, SDVTList VTs, ISD::MemIndexedMode AM, EVT MemVT, MachineMemOperand *MMO)
bool isUndef() const
Return true if the type of the node type undefined.
This class implements an extremely fast bulk output stream that can only output to a stream...
Definition: raw_ostream.h:45
SDNodeFlags()
Default constructor turns off all optimization flags.
uint64_t getLimitedValue(uint64_t Limit=UINT64_MAX)
bool hasAllowReassociation() const
print Print MemDeps of function
SDLoc(const Instruction *I, int Order)
const APFloat & getValueAPF() const
static bool classof(const SDNode *N)
bool hasNoInfs() const
ISD::LoadExtType getExtensionType() const
static bool isSplat(ArrayRef< Value *> VL)
bool operator!=(const SDNodeIterator &x) const
static constexpr size_t getMaxNumOperands()
Return the maximum number of operands that a SDNode can hold.
bool operator==(uint64_t V1, const APInt &V2)
Definition: APInt.h:1973
unsigned getNumOperands() const
bool isStrictFPOpcode()
Test if this node is a strict floating point pseudo-op.
static bool isVolatile(Instruction *Inst)
const SDValue & getOperand(unsigned i) const
int64_t getSExtValue() const
Return the constant as a 64-bit integer value after it has been sign extended as appropriate for the ...
Definition: Constants.h:156
OUTCHAIN = ATOMIC_STORE(INCHAIN, ptr, val) This corresponds to "store atomic" instruction.
Definition: ISDOpcodes.h:820
SDNode * getUser()
This returns the SDNode that contains this Use.
MaskedLoadSDNode(unsigned Order, const DebugLoc &dl, SDVTList VTs, ISD::LoadExtType ETy, bool IsExpanding, EVT MemVT, MachineMemOperand *MMO)
uint64_t getZExtValue() const
bool hasPredecessor(const SDNode *N) const
Return true if N is a predecessor of this node.
const APInt & getConstantOperandAPInt(unsigned Num) const
Helper method returns the APInt of a ConstantSDNode operand.
AtomicSDNode(unsigned Opc, unsigned Order, const DebugLoc &dl, SDVTList VTL, EVT MemVT, MachineMemOperand *MMO)
Unlike LLVM values, Selection DAG nodes may return multiple values as the result of a computation...
int64_t getFrameIndex() const
MemIntrinsicSDNode(unsigned Opc, unsigned Order, const DebugLoc &dl, SDVTList VTs, EVT MemoryVT, MachineMemOperand *MMO)
TargetIndexSDNode(int Idx, EVT VT, int64_t Ofs, unsigned TF)
Val, OUTCHAIN = ATOMIC_LOAD(INCHAIN, ptr) This corresponds to "load atomic" instruction.
Definition: ISDOpcodes.h:816
const SDValue & getBasePtr() const
STRICT_FP_TO_[US]INT - Convert a floating point value to a signed or unsigned integer.
Definition: ISDOpcodes.h:309
const SDValue & getMask() const
Wrapper class representing virtual and physical registers.
Definition: Register.h:19
unsigned getIROrder() const
MaskedGatherScatterSDNode(ISD::NodeType NodeTy, unsigned Order, const DebugLoc &dl, SDVTList VTs, EVT MemVT, MachineMemOperand *MMO, ISD::MemIndexType IndexType)
A discriminated union of two or more pointer types, with the discriminator in the low bit of the poin...
Definition: PointerUnion.h:156
void setFPExcept(bool b)
void refineAlignment(const MachineMemOperand *NewMMO)
Update this MemSDNode&#39;s MachineMemOperand information to reflect the alignment of NewMMO...
bool hasTrivialDestructor() const
Check whether this has a trivial destructor.
Definition: DebugLoc.h:69
MaskedLoadStoreSDNode(ISD::NodeType NodeTy, unsigned Order, const DebugLoc &dl, SDVTList VTs, EVT MemVT, MachineMemOperand *MMO)
MemIndexedMode
MemIndexedMode enum - This enum defines the load / store indexed addressing modes.
Definition: ISDOpcodes.h:950
SRCVALUE - This is a node type that holds a Value* that is used to make reference to a value in the L...
Definition: ISDOpcodes.h:763
This class is used to represent ISD::LOAD nodes.