Coverage Report

Created: 2018-09-23 16:00

/Users/buildslave/jenkins/workspace/clang-stage2-coverage-R/llvm/include/llvm/CodeGen/SelectionDAG.h
Line
Count
Source (jump to first uncovered line)
1
//===- llvm/CodeGen/SelectionDAG.h - InstSelection DAG ----------*- C++ -*-===//
2
//
3
//                     The LLVM Compiler Infrastructure
4
//
5
// This file is distributed under the University of Illinois Open Source
6
// License. See LICENSE.TXT for details.
7
//
8
//===----------------------------------------------------------------------===//
9
//
10
// This file declares the SelectionDAG class, and transitively defines the
11
// SDNode class and subclasses.
12
//
13
//===----------------------------------------------------------------------===//
14
15
#ifndef LLVM_CODEGEN_SELECTIONDAG_H
16
#define LLVM_CODEGEN_SELECTIONDAG_H
17
18
#include "llvm/ADT/APFloat.h"
19
#include "llvm/ADT/APInt.h"
20
#include "llvm/ADT/ArrayRef.h"
21
#include "llvm/ADT/DenseMap.h"
22
#include "llvm/ADT/DenseSet.h"
23
#include "llvm/ADT/FoldingSet.h"
24
#include "llvm/ADT/SetVector.h"
25
#include "llvm/ADT/SmallVector.h"
26
#include "llvm/ADT/StringMap.h"
27
#include "llvm/ADT/ilist.h"
28
#include "llvm/ADT/iterator.h"
29
#include "llvm/ADT/iterator_range.h"
30
#include "llvm/Analysis/AliasAnalysis.h"
31
#include "llvm/Analysis/LegacyDivergenceAnalysis.h"
32
#include "llvm/CodeGen/DAGCombine.h"
33
#include "llvm/CodeGen/FunctionLoweringInfo.h"
34
#include "llvm/CodeGen/ISDOpcodes.h"
35
#include "llvm/CodeGen/MachineFunction.h"
36
#include "llvm/CodeGen/MachineMemOperand.h"
37
#include "llvm/CodeGen/SelectionDAGNodes.h"
38
#include "llvm/CodeGen/ValueTypes.h"
39
#include "llvm/IR/DebugLoc.h"
40
#include "llvm/IR/Instructions.h"
41
#include "llvm/IR/Metadata.h"
42
#include "llvm/Support/Allocator.h"
43
#include "llvm/Support/ArrayRecycler.h"
44
#include "llvm/Support/AtomicOrdering.h"
45
#include "llvm/Support/Casting.h"
46
#include "llvm/Support/CodeGen.h"
47
#include "llvm/Support/ErrorHandling.h"
48
#include "llvm/Support/MachineValueType.h"
49
#include "llvm/Support/RecyclingAllocator.h"
50
#include <algorithm>
51
#include <cassert>
52
#include <cstdint>
53
#include <functional>
54
#include <map>
55
#include <string>
56
#include <tuple>
57
#include <utility>
58
#include <vector>
59
60
namespace llvm {
61
62
class BlockAddress;
63
class Constant;
64
class ConstantFP;
65
class ConstantInt;
66
class DataLayout;
67
struct fltSemantics;
68
class GlobalValue;
69
struct KnownBits;
70
class LLVMContext;
71
class MachineBasicBlock;
72
class MachineConstantPoolValue;
73
class MCSymbol;
74
class OptimizationRemarkEmitter;
75
class SDDbgValue;
76
class SDDbgLabel;
77
class SelectionDAG;
78
class SelectionDAGTargetInfo;
79
class TargetLibraryInfo;
80
class TargetLowering;
81
class TargetMachine;
82
class TargetSubtargetInfo;
83
class Value;
84
85
class SDVTListNode : public FoldingSetNode {
86
  friend struct FoldingSetTrait<SDVTListNode>;
87
88
  /// A reference to an Interned FoldingSetNodeID for this node.
89
  /// The Allocator in SelectionDAG holds the data.
90
  /// SDVTList contains all types which are frequently accessed in SelectionDAG.
91
  /// The size of this list is not expected to be big so it won't introduce
92
  /// a memory penalty.
93
  FoldingSetNodeIDRef FastID;
94
  const EVT *VTs;
95
  unsigned int NumVTs;
96
  /// The hash value for SDVTList is fixed, so cache it to avoid
97
  /// hash calculation.
98
  unsigned HashValue;
99
100
public:
101
  SDVTListNode(const FoldingSetNodeIDRef ID, const EVT *VT, unsigned int Num) :
102
263k
      FastID(ID), VTs(VT), NumVTs(Num) {
103
263k
    HashValue = ID.ComputeHash();
104
263k
  }
105
106
21.3M
  SDVTList getSDVTList() {
107
21.3M
    SDVTList result = {VTs, NumVTs};
108
21.3M
    return result;
109
21.3M
  }
110
};
111
112
/// Specialize FoldingSetTrait for SDVTListNode
113
/// to avoid computing temp FoldingSetNodeID and hash value.
114
template<> struct FoldingSetTrait<SDVTListNode> : DefaultFoldingSetTrait<SDVTListNode> {
115
0
  static void Profile(const SDVTListNode &X, FoldingSetNodeID& ID) {
116
0
    ID = X.FastID;
117
0
  }
118
119
  static bool Equals(const SDVTListNode &X, const FoldingSetNodeID &ID,
120
23.0M
                     unsigned IDHash, FoldingSetNodeID &TempID) {
121
23.0M
    if (X.HashValue != IDHash)
122
2.02M
      return false;
123
21.0M
    return ID == X.FastID;
124
21.0M
  }
125
126
1.02k
  static unsigned ComputeHash(const SDVTListNode &X, FoldingSetNodeID &TempID) {
127
1.02k
    return X.HashValue;
128
1.02k
  }
129
};
130
131
template <> struct ilist_alloc_traits<SDNode> {
132
0
  static void deleteNode(SDNode *) {
133
0
    llvm_unreachable("ilist_traits<SDNode> shouldn't see a deleteNode call!");
134
0
  }
135
};
136
137
/// Keeps track of dbg_value information through SDISel.  We do
138
/// not build SDNodes for these so as not to perturb the generated code;
139
/// instead the info is kept off to the side in this structure. Each SDNode may
140
/// have one or more associated dbg_value entries. This information is kept in
141
/// DbgValMap.
142
/// Byval parameters are handled separately because they don't use alloca's,
143
/// which busts the normal mechanism.  There is good reason for handling all
144
/// parameters separately:  they may not have code generated for them, they
145
/// should always go at the beginning of the function regardless of other code
146
/// motion, and debug info for them is potentially useful even if the parameter
147
/// is unused.  Right now only byval parameters are handled separately.
148
class SDDbgInfo {
149
  BumpPtrAllocator Alloc;
150
  SmallVector<SDDbgValue*, 32> DbgValues;
151
  SmallVector<SDDbgValue*, 32> ByvalParmDbgValues;
152
  SmallVector<SDDbgLabel*, 4> DbgLabels;
153
  using DbgValMapType = DenseMap<const SDNode *, SmallVector<SDDbgValue *, 2>>;
154
  DbgValMapType DbgValMap;
155
156
public:
157
34.7k
  SDDbgInfo() = default;
158
  SDDbgInfo(const SDDbgInfo &) = delete;
159
  SDDbgInfo &operator=(const SDDbgInfo &) = delete;
160
161
722
  void add(SDDbgValue *V, const SDNode *Node, bool isParameter) {
162
722
    if (isParameter) {
163
6
      ByvalParmDbgValues.push_back(V);
164
716
    } else     DbgValues.push_back(V);
165
722
    if (Node)
166
548
      DbgValMap[Node].push_back(V);
167
722
  }
168
169
1
  void add(SDDbgLabel *L) {
170
1
    DbgLabels.push_back(L);
171
1
  }
172
173
  /// Invalidate all DbgValues attached to the node and remove
174
  /// it from the Node-to-DbgValues map.
175
  void erase(const SDNode *Node);
176
177
1.78M
  void clear() {
178
1.78M
    DbgValMap.clear();
179
1.78M
    DbgValues.clear();
180
1.78M
    ByvalParmDbgValues.clear();
181
1.78M
    DbgLabels.clear();
182
1.78M
    Alloc.Reset();
183
1.78M
  }
184
185
723
  BumpPtrAllocator &getAlloc() { return Alloc; }
186
187
1.78M
  bool empty() const {
188
1.78M
    return DbgValues.empty() && 
ByvalParmDbgValues.empty()1.78M
&&
DbgLabels.empty()1.78M
;
189
1.78M
  }
190
191
549
  ArrayRef<SDDbgValue*> getSDDbgValues(const SDNode *Node) const {
192
549
    auto I = DbgValMap.find(Node);
193
549
    if (I != DbgValMap.end())
194
549
      return I->second;
195
0
    return ArrayRef<SDDbgValue*>();
196
0
  }
197
198
  using DbgIterator = SmallVectorImpl<SDDbgValue*>::iterator;
199
  using DbgLabelIterator = SmallVectorImpl<SDDbgLabel*>::iterator;
200
201
572
  DbgIterator DbgBegin() { return DbgValues.begin(); }
202
572
  DbgIterator DbgEnd()   { return DbgValues.end(); }
203
202
  DbgIterator ByvalParmDbgBegin() { return ByvalParmDbgValues.begin(); }
204
202
  DbgIterator ByvalParmDbgEnd()   { return ByvalParmDbgValues.end(); }
205
286
  DbgLabelIterator DbgLabelBegin() { return DbgLabels.begin(); }
206
286
  DbgLabelIterator DbgLabelEnd()   { return DbgLabels.end(); }
207
};
208
209
void checkForCycles(const SelectionDAG *DAG, bool force = false);
210
211
/// This is used to represent a portion of an LLVM function in a low-level
212
/// Data Dependence DAG representation suitable for instruction selection.
213
/// This DAG is constructed as the first step of instruction selection in order
214
/// to allow implementation of machine specific optimizations
215
/// and code simplifications.
216
///
217
/// The representation used by the SelectionDAG is a target-independent
218
/// representation, which has some similarities to the GCC RTL representation,
219
/// but is significantly more simple, powerful, and is a graph form instead of a
220
/// linear form.
221
///
222
class SelectionDAG {
223
  const TargetMachine &TM;
224
  const SelectionDAGTargetInfo *TSI = nullptr;
225
  const TargetLowering *TLI = nullptr;
226
  const TargetLibraryInfo *LibInfo = nullptr;
227
  MachineFunction *MF;
228
  Pass *SDAGISelPass = nullptr;
229
  LLVMContext *Context;
230
  CodeGenOpt::Level OptLevel;
231
232
  LegacyDivergenceAnalysis * DA = nullptr;
233
  FunctionLoweringInfo * FLI = nullptr;
234
235
  /// The function-level optimization remark emitter.  Used to emit remarks
236
  /// whenever manipulating the DAG.
237
  OptimizationRemarkEmitter *ORE;
238
239
  /// The starting token.
240
  SDNode EntryNode;
241
242
  /// The root of the entire DAG.
243
  SDValue Root;
244
245
  /// A linked list of nodes in the current DAG.
246
  ilist<SDNode> AllNodes;
247
248
  /// The AllocatorType for allocating SDNodes. We use
249
  /// pool allocation with recycling.
250
  using NodeAllocatorType = RecyclingAllocator<BumpPtrAllocator, SDNode,
251
                                               sizeof(LargestSDNode),
252
                                               alignof(MostAlignedSDNode)>;
253
254
  /// Pool allocation for nodes.
255
  NodeAllocatorType NodeAllocator;
256
257
  /// This structure is used to memoize nodes, automatically performing
258
  /// CSE with existing nodes when a duplicate is requested.
259
  FoldingSet<SDNode> CSEMap;
260
261
  /// Pool allocation for machine-opcode SDNode operands.
262
  BumpPtrAllocator OperandAllocator;
263
  ArrayRecycler<SDUse> OperandRecycler;
264
265
  /// Pool allocation for misc. objects that are created once per SelectionDAG.
266
  BumpPtrAllocator Allocator;
267
268
  /// Tracks dbg_value and dbg_label information through SDISel.
269
  SDDbgInfo *DbgInfo;
270
271
  uint16_t NextPersistentId = 0;
272
273
public:
274
  /// Clients of various APIs that cause global effects on
275
  /// the DAG can optionally implement this interface.  This allows the clients
276
  /// to handle the various sorts of updates that happen.
277
  ///
278
  /// A DAGUpdateListener automatically registers itself with DAG when it is
279
  /// constructed, and removes itself when destroyed in RAII fashion.
280
  struct DAGUpdateListener {
281
    DAGUpdateListener *const Next;
282
    SelectionDAG &DAG;
283
284
    explicit DAGUpdateListener(SelectionDAG &D)
285
132M
      : Next(D.UpdateListeners), DAG(D) {
286
132M
      DAG.UpdateListeners = this;
287
132M
    }
288
289
132M
    virtual ~DAGUpdateListener() {
290
132M
      assert(DAG.UpdateListeners == this &&
291
132M
             "DAGUpdateListeners must be destroyed in LIFO order");
292
132M
      DAG.UpdateListeners = Next;
293
132M
    }
294
295
    /// The node N that was deleted and, if E is not null, an
296
    /// equivalent node E that replaced it.
297
    virtual void NodeDeleted(SDNode *N, SDNode *E);
298
299
    /// The node N that was updated.
300
    virtual void NodeUpdated(SDNode *N);
301
  };
302
303
  struct DAGNodeDeletedListener : public DAGUpdateListener {
304
    std::function<void(SDNode *, SDNode *)> Callback;
305
306
    DAGNodeDeletedListener(SelectionDAG &DAG,
307
                           std::function<void(SDNode *, SDNode *)> Callback)
308
12.6M
        : DAGUpdateListener(DAG), Callback(std::move(Callback)) {}
309
310
6.28M
    void NodeDeleted(SDNode *N, SDNode *E) override { Callback(N, E); }
311
  };
312
313
  /// When true, additional steps are taken to
314
  /// ensure that getConstant() and similar functions return DAG nodes that
315
  /// have legal types. This is important after type legalization since
316
  /// any illegally typed nodes generated after this point will not experience
317
  /// type legalization.
318
  bool NewNodesMustHaveLegalTypes = false;
319
320
private:
321
  /// DAGUpdateListener is a friend so it can manipulate the listener stack.
322
  friend struct DAGUpdateListener;
323
324
  /// Linked list of registered DAGUpdateListener instances.
325
  /// This stack is maintained by DAGUpdateListener RAII.
326
  DAGUpdateListener *UpdateListeners = nullptr;
327
328
  /// Implementation of setSubgraphColor.
329
  /// Return whether we had to truncate the search.
330
  bool setSubgraphColorHelper(SDNode *N, const char *Color,
331
                              DenseSet<SDNode *> &visited,
332
                              int level, bool &printed);
333
334
  template <typename SDNodeT, typename... ArgTypes>
335
65.9M
  SDNodeT *newSDNode(ArgTypes &&... Args) {
336
65.9M
    return new (NodeAllocator.template Allocate<SDNodeT>())
337
65.9M
        SDNodeT(std::forward<ArgTypes>(Args)...);
338
65.9M
  }
llvm::TruncSStoreSDNode* llvm::SelectionDAG::newSDNode<llvm::TruncSStoreSDNode, unsigned int, llvm::DebugLoc const&, llvm::SDVTList&, llvm::EVT&, llvm::MachineMemOperand*&>(unsigned int&&, llvm::DebugLoc const&&&, llvm::SDVTList&&&, llvm::EVT&&&, llvm::MachineMemOperand*&&&)
Line
Count
Source
335
37
  SDNodeT *newSDNode(ArgTypes &&... Args) {
336
37
    return new (NodeAllocator.template Allocate<SDNodeT>())
337
37
        SDNodeT(std::forward<ArgTypes>(Args)...);
338
37
  }
llvm::TruncUSStoreSDNode* llvm::SelectionDAG::newSDNode<llvm::TruncUSStoreSDNode, unsigned int, llvm::DebugLoc const&, llvm::SDVTList&, llvm::EVT&, llvm::MachineMemOperand*&>(unsigned int&&, llvm::DebugLoc const&&&, llvm::SDVTList&&&, llvm::EVT&&&, llvm::MachineMemOperand*&&&)
Line
Count
Source
335
64
  SDNodeT *newSDNode(ArgTypes &&... Args) {
336
64
    return new (NodeAllocator.template Allocate<SDNodeT>())
337
64
        SDNodeT(std::forward<ArgTypes>(Args)...);
338
64
  }
llvm::MaskedTruncSStoreSDNode* llvm::SelectionDAG::newSDNode<llvm::MaskedTruncSStoreSDNode, unsigned int, llvm::DebugLoc const&, llvm::SDVTList&, llvm::EVT&, llvm::MachineMemOperand*&>(unsigned int&&, llvm::DebugLoc const&&&, llvm::SDVTList&&&, llvm::EVT&&&, llvm::MachineMemOperand*&&&)
Line
Count
Source
335
31
  SDNodeT *newSDNode(ArgTypes &&... Args) {
336
31
    return new (NodeAllocator.template Allocate<SDNodeT>())
337
31
        SDNodeT(std::forward<ArgTypes>(Args)...);
338
31
  }
llvm::MaskedTruncUSStoreSDNode* llvm::SelectionDAG::newSDNode<llvm::MaskedTruncUSStoreSDNode, unsigned int, llvm::DebugLoc const&, llvm::SDVTList&, llvm::EVT&, llvm::MachineMemOperand*&>(unsigned int&&, llvm::DebugLoc const&&&, llvm::SDVTList&&&, llvm::EVT&&&, llvm::MachineMemOperand*&&&)
Line
Count
Source
335
31
  SDNodeT *newSDNode(ArgTypes &&... Args) {
336
31
    return new (NodeAllocator.template Allocate<SDNodeT>())
337
31
        SDNodeT(std::forward<ArgTypes>(Args)...);
338
31
  }
llvm::X86MaskedScatterSDNode* llvm::SelectionDAG::newSDNode<llvm::X86MaskedScatterSDNode, unsigned int, llvm::DebugLoc const&, llvm::SDVTList&, llvm::EVT&, llvm::MachineMemOperand*&>(unsigned int&&, llvm::DebugLoc const&&&, llvm::SDVTList&&&, llvm::EVT&&&, llvm::MachineMemOperand*&&&)
Line
Count
Source
335
124
  SDNodeT *newSDNode(ArgTypes &&... Args) {
336
124
    return new (NodeAllocator.template Allocate<SDNodeT>())
337
124
        SDNodeT(std::forward<ArgTypes>(Args)...);
338
124
  }
llvm::X86MaskedGatherSDNode* llvm::SelectionDAG::newSDNode<llvm::X86MaskedGatherSDNode, unsigned int, llvm::DebugLoc const&, llvm::SDVTList&, llvm::EVT&, llvm::MachineMemOperand*&>(unsigned int&&, llvm::DebugLoc const&&&, llvm::SDVTList&&&, llvm::EVT&&&, llvm::MachineMemOperand*&&&)
Line
Count
Source
335
355
  SDNodeT *newSDNode(ArgTypes &&... Args) {
336
355
    return new (NodeAllocator.template Allocate<SDNodeT>())
337
355
        SDNodeT(std::forward<ArgTypes>(Args)...);
338
355
  }
llvm::ConstantSDNode* llvm::SelectionDAG::newSDNode<llvm::ConstantSDNode, bool&, bool&, llvm::ConstantInt const*&, llvm::EVT&>(bool&&&, bool&&&, llvm::ConstantInt const*&&&, llvm::EVT&&&)
Line
Count
Source
335
13.1M
  SDNodeT *newSDNode(ArgTypes &&... Args) {
336
13.1M
    return new (NodeAllocator.template Allocate<SDNodeT>())
337
13.1M
        SDNodeT(std::forward<ArgTypes>(Args)...);
338
13.1M
  }
llvm::ConstantFPSDNode* llvm::SelectionDAG::newSDNode<llvm::ConstantFPSDNode, bool&, llvm::ConstantFP const*, llvm::EVT&>(bool&&&, llvm::ConstantFP const*&&, llvm::EVT&&&)
Line
Count
Source
335
114k
  SDNodeT *newSDNode(ArgTypes &&... Args) {
336
114k
    return new (NodeAllocator.template Allocate<SDNodeT>())
337
114k
        SDNodeT(std::forward<ArgTypes>(Args)...);
338
114k
  }
llvm::GlobalAddressSDNode* llvm::SelectionDAG::newSDNode<llvm::GlobalAddressSDNode, unsigned int&, unsigned int, llvm::DebugLoc const&, llvm::GlobalValue const*&, llvm::EVT&, long long&, unsigned char&>(unsigned int&&&, unsigned int&&, llvm::DebugLoc const&&&, llvm::GlobalValue const*&&&, llvm::EVT&&&, long long&&&, unsigned char&&&)
Line
Count
Source
335
2.80M
  SDNodeT *newSDNode(ArgTypes &&... Args) {
336
2.80M
    return new (NodeAllocator.template Allocate<SDNodeT>())
337
2.80M
        SDNodeT(std::forward<ArgTypes>(Args)...);
338
2.80M
  }
llvm::FrameIndexSDNode* llvm::SelectionDAG::newSDNode<llvm::FrameIndexSDNode, int&, llvm::EVT&, bool&>(int&&&, llvm::EVT&&&, bool&&&)
Line
Count
Source
335
878k
  SDNodeT *newSDNode(ArgTypes &&... Args) {
336
878k
    return new (NodeAllocator.template Allocate<SDNodeT>())
337
878k
        SDNodeT(std::forward<ArgTypes>(Args)...);
338
878k
  }
llvm::JumpTableSDNode* llvm::SelectionDAG::newSDNode<llvm::JumpTableSDNode, int&, llvm::EVT&, bool&, unsigned char&>(int&&&, llvm::EVT&&&, bool&&&, unsigned char&&&)
Line
Count
Source
335
7.31k
  SDNodeT *newSDNode(ArgTypes &&... Args) {
336
7.31k
    return new (NodeAllocator.template Allocate<SDNodeT>())
337
7.31k
        SDNodeT(std::forward<ArgTypes>(Args)...);
338
7.31k
  }
llvm::ConstantPoolSDNode* llvm::SelectionDAG::newSDNode<llvm::ConstantPoolSDNode, bool&, llvm::Constant const*&, llvm::EVT&, int&, unsigned int&, unsigned char&>(bool&&&, llvm::Constant const*&&&, llvm::EVT&&&, int&&&, unsigned int&&&, unsigned char&&&)
Line
Count
Source
335
243k
  SDNodeT *newSDNode(ArgTypes &&... Args) {
336
243k
    return new (NodeAllocator.template Allocate<SDNodeT>())
337
243k
        SDNodeT(std::forward<ArgTypes>(Args)...);
338
243k
  }
llvm::ConstantPoolSDNode* llvm::SelectionDAG::newSDNode<llvm::ConstantPoolSDNode, bool&, llvm::MachineConstantPoolValue*&, llvm::EVT&, int&, unsigned int&, unsigned char&>(bool&&&, llvm::MachineConstantPoolValue*&&&, llvm::EVT&&&, int&&&, unsigned int&&&, unsigned char&&&)
Line
Count
Source
335
273
  SDNodeT *newSDNode(ArgTypes &&... Args) {
336
273
    return new (NodeAllocator.template Allocate<SDNodeT>())
337
273
        SDNodeT(std::forward<ArgTypes>(Args)...);
338
273
  }
Unexecuted instantiation: llvm::TargetIndexSDNode* llvm::SelectionDAG::newSDNode<llvm::TargetIndexSDNode, int&, llvm::EVT&, long long&, unsigned char&>(int&&&, llvm::EVT&&&, long long&&&, unsigned char&&&)
llvm::BasicBlockSDNode* llvm::SelectionDAG::newSDNode<llvm::BasicBlockSDNode, llvm::MachineBasicBlock*&>(llvm::MachineBasicBlock*&&&)
Line
Count
Source
335
1.93M
  SDNodeT *newSDNode(ArgTypes &&... Args) {
336
1.93M
    return new (NodeAllocator.template Allocate<SDNodeT>())
337
1.93M
        SDNodeT(std::forward<ArgTypes>(Args)...);
338
1.93M
  }
llvm::VTSDNode* llvm::SelectionDAG::newSDNode<llvm::VTSDNode, llvm::EVT&>(llvm::EVT&&&)
Line
Count
Source
335
324k
  SDNodeT *newSDNode(ArgTypes &&... Args) {
336
324k
    return new (NodeAllocator.template Allocate<SDNodeT>())
337
324k
        SDNodeT(std::forward<ArgTypes>(Args)...);
338
324k
  }
llvm::ExternalSymbolSDNode* llvm::SelectionDAG::newSDNode<llvm::ExternalSymbolSDNode, bool, char const*&, int, llvm::EVT&>(bool&&, char const*&&&, int&&, llvm::EVT&&&)
Line
Count
Source
335
17.3k
  SDNodeT *newSDNode(ArgTypes &&... Args) {
336
17.3k
    return new (NodeAllocator.template Allocate<SDNodeT>())
337
17.3k
        SDNodeT(std::forward<ArgTypes>(Args)...);
338
17.3k
  }
llvm::MCSymbolSDNode* llvm::SelectionDAG::newSDNode<llvm::MCSymbolSDNode, llvm::MCSymbol*&, llvm::EVT&>(llvm::MCSymbol*&&&, llvm::EVT&&&)
Line
Count
Source
335
53
  SDNodeT *newSDNode(ArgTypes &&... Args) {
336
53
    return new (NodeAllocator.template Allocate<SDNodeT>())
337
53
        SDNodeT(std::forward<ArgTypes>(Args)...);
338
53
  }
llvm::ExternalSymbolSDNode* llvm::SelectionDAG::newSDNode<llvm::ExternalSymbolSDNode, bool, char const*&, unsigned char&, llvm::EVT&>(bool&&, char const*&&&, unsigned char&&&, llvm::EVT&&&)
Line
Count
Source
335
32.7k
  SDNodeT *newSDNode(ArgTypes &&... Args) {
336
32.7k
    return new (NodeAllocator.template Allocate<SDNodeT>())
337
32.7k
        SDNodeT(std::forward<ArgTypes>(Args)...);
338
32.7k
  }
llvm::CondCodeSDNode* llvm::SelectionDAG::newSDNode<llvm::CondCodeSDNode, llvm::ISD::CondCode&>(llvm::ISD::CondCode&&&)
Line
Count
Source
335
1.44M
  SDNodeT *newSDNode(ArgTypes &&... Args) {
336
1.44M
    return new (NodeAllocator.template Allocate<SDNodeT>())
337
1.44M
        SDNodeT(std::forward<ArgTypes>(Args)...);
338
1.44M
  }
llvm::ShuffleVectorSDNode* llvm::SelectionDAG::newSDNode<llvm::ShuffleVectorSDNode, llvm::EVT&, unsigned int, llvm::DebugLoc const&, int*&>(llvm::EVT&&&, unsigned int&&, llvm::DebugLoc const&&&, int*&&&)
Line
Count
Source
335
116k
  SDNodeT *newSDNode(ArgTypes &&... Args) {
336
116k
    return new (NodeAllocator.template Allocate<SDNodeT>())
337
116k
        SDNodeT(std::forward<ArgTypes>(Args)...);
338
116k
  }
llvm::RegisterSDNode* llvm::SelectionDAG::newSDNode<llvm::RegisterSDNode, unsigned int&, llvm::EVT&>(unsigned int&&&, llvm::EVT&&&)
Line
Count
Source
335
7.90M
  SDNodeT *newSDNode(ArgTypes &&... Args) {
336
7.90M
    return new (NodeAllocator.template Allocate<SDNodeT>())
337
7.90M
        SDNodeT(std::forward<ArgTypes>(Args)...);
338
7.90M
  }
llvm::RegisterMaskSDNode* llvm::SelectionDAG::newSDNode<llvm::RegisterMaskSDNode, unsigned int const*&>(unsigned int const*&&&)
Line
Count
Source
335
557k
  SDNodeT *newSDNode(ArgTypes &&... Args) {
336
557k
    return new (NodeAllocator.template Allocate<SDNodeT>())
337
557k
        SDNodeT(std::forward<ArgTypes>(Args)...);
338
557k
  }
llvm::LabelSDNode* llvm::SelectionDAG::newSDNode<llvm::LabelSDNode, unsigned int, llvm::DebugLoc const&, llvm::MCSymbol*&>(unsigned int&&, llvm::DebugLoc const&&&, llvm::MCSymbol*&&&)
Line
Count
Source
335
48.9k
  SDNodeT *newSDNode(ArgTypes &&... Args) {
336
48.9k
    return new (NodeAllocator.template Allocate<SDNodeT>())
337
48.9k
        SDNodeT(std::forward<ArgTypes>(Args)...);
338
48.9k
  }
llvm::BlockAddressSDNode* llvm::SelectionDAG::newSDNode<llvm::BlockAddressSDNode, unsigned int&, llvm::EVT&, llvm::BlockAddress const*&, long long&, unsigned char&>(unsigned int&&&, llvm::EVT&&&, llvm::BlockAddress const*&&&, long long&&&, unsigned char&&&)
Line
Count
Source
335
283
  SDNodeT *newSDNode(ArgTypes &&... Args) {
336
283
    return new (NodeAllocator.template Allocate<SDNodeT>())
337
283
        SDNodeT(std::forward<ArgTypes>(Args)...);
338
283
  }
llvm::SrcValueSDNode* llvm::SelectionDAG::newSDNode<llvm::SrcValueSDNode, llvm::Value const*&>(llvm::Value const*&&&)
Line
Count
Source
335
1.70k
  SDNodeT *newSDNode(ArgTypes &&... Args) {
336
1.70k
    return new (NodeAllocator.template Allocate<SDNodeT>())
337
1.70k
        SDNodeT(std::forward<ArgTypes>(Args)...);
338
1.70k
  }
llvm::MDNodeSDNode* llvm::SelectionDAG::newSDNode<llvm::MDNodeSDNode, llvm::MDNode const*&>(llvm::MDNode const*&&&)
Line
Count
Source
335
23.6k
  SDNodeT *newSDNode(ArgTypes &&... Args) {
336
23.6k
    return new (NodeAllocator.template Allocate<SDNodeT>())
337
23.6k
        SDNodeT(std::forward<ArgTypes>(Args)...);
338
23.6k
  }
llvm::AddrSpaceCastSDNode* llvm::SelectionDAG::newSDNode<llvm::AddrSpaceCastSDNode, unsigned int, llvm::DebugLoc const&, llvm::EVT&, unsigned int&, unsigned int&>(unsigned int&&, llvm::DebugLoc const&&&, llvm::EVT&&&, unsigned int&&&, unsigned int&&&)
Line
Count
Source
335
213
  SDNodeT *newSDNode(ArgTypes &&... Args) {
336
213
    return new (NodeAllocator.template Allocate<SDNodeT>())
337
213
        SDNodeT(std::forward<ArgTypes>(Args)...);
338
213
  }
llvm::SDNode* llvm::SelectionDAG::newSDNode<llvm::SDNode, unsigned int&, unsigned int, llvm::DebugLoc const&, llvm::SDVTList>(unsigned int&&&, unsigned int&&, llvm::DebugLoc const&&&, llvm::SDVTList&&)
Line
Count
Source
335
1.00M
  SDNodeT *newSDNode(ArgTypes &&... Args) {
336
1.00M
    return new (NodeAllocator.template Allocate<SDNodeT>())
337
1.00M
        SDNodeT(std::forward<ArgTypes>(Args)...);
338
1.00M
  }
llvm::SDNode* llvm::SelectionDAG::newSDNode<llvm::SDNode, unsigned int&, unsigned int, llvm::DebugLoc const&, llvm::SDVTList&>(unsigned int&&&, unsigned int&&, llvm::DebugLoc const&&&, llvm::SDVTList&&&)
Line
Count
Source
335
30.3M
  SDNodeT *newSDNode(ArgTypes &&... Args) {
336
30.3M
    return new (NodeAllocator.template Allocate<SDNodeT>())
337
30.3M
        SDNodeT(std::forward<ArgTypes>(Args)...);
338
30.3M
  }
llvm::AtomicSDNode* llvm::SelectionDAG::newSDNode<llvm::AtomicSDNode, unsigned int&, unsigned int, llvm::DebugLoc const&, llvm::SDVTList&, llvm::EVT&, llvm::MachineMemOperand*&>(unsigned int&&&, unsigned int&&, llvm::DebugLoc const&&&, llvm::SDVTList&&&, llvm::EVT&&&, llvm::MachineMemOperand*&&&)
Line
Count
Source
335
21.5k
  SDNodeT *newSDNode(ArgTypes &&... Args) {
336
21.5k
    return new (NodeAllocator.template Allocate<SDNodeT>())
337
21.5k
        SDNodeT(std::forward<ArgTypes>(Args)...);
338
21.5k
  }
llvm::MemIntrinsicSDNode* llvm::SelectionDAG::newSDNode<llvm::MemIntrinsicSDNode, unsigned int&, unsigned int, llvm::DebugLoc const&, llvm::SDVTList&, llvm::EVT&, llvm::MachineMemOperand*&>(unsigned int&&&, unsigned int&&, llvm::DebugLoc const&&&, llvm::SDVTList&&&, llvm::EVT&&&, llvm::MachineMemOperand*&&&)
Line
Count
Source
335
81.3k
  SDNodeT *newSDNode(ArgTypes &&... Args) {
336
81.3k
    return new (NodeAllocator.template Allocate<SDNodeT>())
337
81.3k
        SDNodeT(std::forward<ArgTypes>(Args)...);
338
81.3k
  }
llvm::LoadSDNode* llvm::SelectionDAG::newSDNode<llvm::LoadSDNode, unsigned int, llvm::DebugLoc const&, llvm::SDVTList&, llvm::ISD::MemIndexedMode&, llvm::ISD::LoadExtType&, llvm::EVT&, llvm::MachineMemOperand*&>(unsigned int&&, llvm::DebugLoc const&&&, llvm::SDVTList&&&, llvm::ISD::MemIndexedMode&&&, llvm::ISD::LoadExtType&&&, llvm::EVT&&&, llvm::MachineMemOperand*&&&)
Line
Count
Source
335
1.95M
  SDNodeT *newSDNode(ArgTypes &&... Args) {
336
1.95M
    return new (NodeAllocator.template Allocate<SDNodeT>())
337
1.95M
        SDNodeT(std::forward<ArgTypes>(Args)...);
338
1.95M
  }
llvm::StoreSDNode* llvm::SelectionDAG::newSDNode<llvm::StoreSDNode, unsigned int, llvm::DebugLoc const&, llvm::SDVTList&, llvm::ISD::MemIndexedMode, bool, llvm::EVT&, llvm::MachineMemOperand*&>(unsigned int&&, llvm::DebugLoc const&&&, llvm::SDVTList&&&, llvm::ISD::MemIndexedMode&&, bool&&, llvm::EVT&&&, llvm::MachineMemOperand*&&&)
Line
Count
Source
335
2.23M
  SDNodeT *newSDNode(ArgTypes &&... Args) {
336
2.23M
    return new (NodeAllocator.template Allocate<SDNodeT>())
337
2.23M
        SDNodeT(std::forward<ArgTypes>(Args)...);
338
2.23M
  }
llvm::StoreSDNode* llvm::SelectionDAG::newSDNode<llvm::StoreSDNode, unsigned int, llvm::DebugLoc const&, llvm::SDVTList&, llvm::ISD::MemIndexedMode&, bool, llvm::EVT, llvm::MachineMemOperand*>(unsigned int&&, llvm::DebugLoc const&&&, llvm::SDVTList&&&, llvm::ISD::MemIndexedMode&&&, bool&&, llvm::EVT&&, llvm::MachineMemOperand*&&)
Line
Count
Source
335
11.3k
  SDNodeT *newSDNode(ArgTypes &&... Args) {
336
11.3k
    return new (NodeAllocator.template Allocate<SDNodeT>())
337
11.3k
        SDNodeT(std::forward<ArgTypes>(Args)...);
338
11.3k
  }
llvm::MaskedLoadSDNode* llvm::SelectionDAG::newSDNode<llvm::MaskedLoadSDNode, unsigned int, llvm::DebugLoc const&, llvm::SDVTList&, llvm::ISD::LoadExtType&, bool&, llvm::EVT&, llvm::MachineMemOperand*&>(unsigned int&&, llvm::DebugLoc const&&&, llvm::SDVTList&&&, llvm::ISD::LoadExtType&&&, bool&&&, llvm::EVT&&&, llvm::MachineMemOperand*&&&)
Line
Count
Source
335
612
  SDNodeT *newSDNode(ArgTypes &&... Args) {
336
612
    return new (NodeAllocator.template Allocate<SDNodeT>())
337
612
        SDNodeT(std::forward<ArgTypes>(Args)...);
338
612
  }
llvm::MaskedStoreSDNode* llvm::SelectionDAG::newSDNode<llvm::MaskedStoreSDNode, unsigned int, llvm::DebugLoc const&, llvm::SDVTList&, bool&, bool&, llvm::EVT&, llvm::MachineMemOperand*&>(unsigned int&&, llvm::DebugLoc const&&&, llvm::SDVTList&&&, bool&&&, bool&&&, llvm::EVT&&&, llvm::MachineMemOperand*&&&)
Line
Count
Source
335
407
  SDNodeT *newSDNode(ArgTypes &&... Args) {
336
407
    return new (NodeAllocator.template Allocate<SDNodeT>())
337
407
        SDNodeT(std::forward<ArgTypes>(Args)...);
338
407
  }
llvm::MaskedGatherSDNode* llvm::SelectionDAG::newSDNode<llvm::MaskedGatherSDNode, unsigned int, llvm::DebugLoc const&, llvm::SDVTList&, llvm::EVT&, llvm::MachineMemOperand*&>(unsigned int&&, llvm::DebugLoc const&&&, llvm::SDVTList&&&, llvm::EVT&&&, llvm::MachineMemOperand*&&&)
Line
Count
Source
335
463
  SDNodeT *newSDNode(ArgTypes &&... Args) {
336
463
    return new (NodeAllocator.template Allocate<SDNodeT>())
337
463
        SDNodeT(std::forward<ArgTypes>(Args)...);
338
463
  }
llvm::MaskedScatterSDNode* llvm::SelectionDAG::newSDNode<llvm::MaskedScatterSDNode, unsigned int, llvm::DebugLoc const&, llvm::SDVTList&, llvm::EVT&, llvm::MachineMemOperand*&>(unsigned int&&, llvm::DebugLoc const&&&, llvm::SDVTList&&&, llvm::EVT&&&, llvm::MachineMemOperand*&&&)
Line
Count
Source
335
168
  SDNodeT *newSDNode(ArgTypes &&... Args) {
336
168
    return new (NodeAllocator.template Allocate<SDNodeT>())
337
168
        SDNodeT(std::forward<ArgTypes>(Args)...);
338
168
  }
llvm::MachineSDNode* llvm::SelectionDAG::newSDNode<llvm::MachineSDNode, unsigned int, unsigned int, llvm::DebugLoc const&, llvm::SDVTList&>(unsigned int&&, unsigned int&&, llvm::DebugLoc const&&&, llvm::SDVTList&&&)
Line
Count
Source
335
754k
  SDNodeT *newSDNode(ArgTypes &&... Args) {
336
754k
    return new (NodeAllocator.template Allocate<SDNodeT>())
337
754k
        SDNodeT(std::forward<ArgTypes>(Args)...);
338
754k
  }
339
340
  /// Build a synthetic SDNodeT with the given args and extract its subclass
341
  /// data as an integer (e.g. for use in a folding set).
342
  ///
343
  /// The args to this function are the same as the args to SDNodeT's
344
  /// constructor, except the second arg (assumed to be a const DebugLoc&) is
345
  /// omitted.
346
  template <typename SDNodeT, typename... ArgTypes>
347
  static uint16_t getSyntheticNodeSubclassData(unsigned IROrder,
348
4.26M
                                               ArgTypes &&... Args) {
349
4.26M
    // The compiler can reduce this expression to a constant iff we pass an
350
4.26M
    // empty DebugLoc.  Thankfully, the debug location doesn't have any bearing
351
4.26M
    // on the subclass data.
352
4.26M
    return SDNodeT(IROrder, DebugLoc(), std::forward<ArgTypes>(Args)...)
353
4.26M
        .getRawSubclassData();
354
4.26M
  }
unsigned short llvm::SelectionDAG::getSyntheticNodeSubclassData<llvm::TruncSStoreSDNode, llvm::SDVTList&, llvm::EVT&, llvm::MachineMemOperand*&>(unsigned int, llvm::SDVTList&&&, llvm::EVT&&&, llvm::MachineMemOperand*&&&)
Line
Count
Source
348
37
                                               ArgTypes &&... Args) {
349
37
    // The compiler can reduce this expression to a constant iff we pass an
350
37
    // empty DebugLoc.  Thankfully, the debug location doesn't have any bearing
351
37
    // on the subclass data.
352
37
    return SDNodeT(IROrder, DebugLoc(), std::forward<ArgTypes>(Args)...)
353
37
        .getRawSubclassData();
354
37
  }
unsigned short llvm::SelectionDAG::getSyntheticNodeSubclassData<llvm::TruncUSStoreSDNode, llvm::SDVTList&, llvm::EVT&, llvm::MachineMemOperand*&>(unsigned int, llvm::SDVTList&&&, llvm::EVT&&&, llvm::MachineMemOperand*&&&)
Line
Count
Source
348
64
                                               ArgTypes &&... Args) {
349
64
    // The compiler can reduce this expression to a constant iff we pass an
350
64
    // empty DebugLoc.  Thankfully, the debug location doesn't have any bearing
351
64
    // on the subclass data.
352
64
    return SDNodeT(IROrder, DebugLoc(), std::forward<ArgTypes>(Args)...)
353
64
        .getRawSubclassData();
354
64
  }
unsigned short llvm::SelectionDAG::getSyntheticNodeSubclassData<llvm::MaskedTruncSStoreSDNode, llvm::SDVTList&, llvm::EVT&, llvm::MachineMemOperand*&>(unsigned int, llvm::SDVTList&&&, llvm::EVT&&&, llvm::MachineMemOperand*&&&)
Line
Count
Source
348
31
                                               ArgTypes &&... Args) {
349
31
    // The compiler can reduce this expression to a constant iff we pass an
350
31
    // empty DebugLoc.  Thankfully, the debug location doesn't have any bearing
351
31
    // on the subclass data.
352
31
    return SDNodeT(IROrder, DebugLoc(), std::forward<ArgTypes>(Args)...)
353
31
        .getRawSubclassData();
354
31
  }
unsigned short llvm::SelectionDAG::getSyntheticNodeSubclassData<llvm::MaskedTruncUSStoreSDNode, llvm::SDVTList&, llvm::EVT&, llvm::MachineMemOperand*&>(unsigned int, llvm::SDVTList&&&, llvm::EVT&&&, llvm::MachineMemOperand*&&&)
Line
Count
Source
348
31
                                               ArgTypes &&... Args) {
349
31
    // The compiler can reduce this expression to a constant iff we pass an
350
31
    // empty DebugLoc.  Thankfully, the debug location doesn't have any bearing
351
31
    // on the subclass data.
352
31
    return SDNodeT(IROrder, DebugLoc(), std::forward<ArgTypes>(Args)...)
353
31
        .getRawSubclassData();
354
31
  }
unsigned short llvm::SelectionDAG::getSyntheticNodeSubclassData<llvm::X86MaskedScatterSDNode, llvm::SDVTList&, llvm::EVT&, llvm::MachineMemOperand*&>(unsigned int, llvm::SDVTList&&&, llvm::EVT&&&, llvm::MachineMemOperand*&&&)
Line
Count
Source
348
124
                                               ArgTypes &&... Args) {
349
124
    // The compiler can reduce this expression to a constant iff we pass an
350
124
    // empty DebugLoc.  Thankfully, the debug location doesn't have any bearing
351
124
    // on the subclass data.
352
124
    return SDNodeT(IROrder, DebugLoc(), std::forward<ArgTypes>(Args)...)
353
124
        .getRawSubclassData();
354
124
  }
unsigned short llvm::SelectionDAG::getSyntheticNodeSubclassData<llvm::X86MaskedGatherSDNode, llvm::SDVTList&, llvm::EVT&, llvm::MachineMemOperand*&>(unsigned int, llvm::SDVTList&&&, llvm::EVT&&&, llvm::MachineMemOperand*&&&)
Line
Count
Source
348
355
                                               ArgTypes &&... Args) {
349
355
    // The compiler can reduce this expression to a constant iff we pass an
350
355
    // empty DebugLoc.  Thankfully, the debug location doesn't have any bearing
351
355
    // on the subclass data.
352
355
    return SDNodeT(IROrder, DebugLoc(), std::forward<ArgTypes>(Args)...)
353
355
        .getRawSubclassData();
354
355
  }
unsigned short llvm::SelectionDAG::getSyntheticNodeSubclassData<llvm::LoadSDNode, llvm::SDVTList&, llvm::ISD::MemIndexedMode&, llvm::ISD::LoadExtType&, llvm::EVT&, llvm::MachineMemOperand*&>(unsigned int, llvm::SDVTList&&&, llvm::ISD::MemIndexedMode&&&, llvm::ISD::LoadExtType&&&, llvm::EVT&&&, llvm::MachineMemOperand*&&&)
Line
Count
Source
348
2.00M
                                               ArgTypes &&... Args) {
349
2.00M
    // The compiler can reduce this expression to a constant iff we pass an
350
2.00M
    // empty DebugLoc.  Thankfully, the debug location doesn't have any bearing
351
2.00M
    // on the subclass data.
352
2.00M
    return SDNodeT(IROrder, DebugLoc(), std::forward<ArgTypes>(Args)...)
353
2.00M
        .getRawSubclassData();
354
2.00M
  }
unsigned short llvm::SelectionDAG::getSyntheticNodeSubclassData<llvm::StoreSDNode, llvm::SDVTList&, llvm::ISD::MemIndexedMode, bool, llvm::EVT&, llvm::MachineMemOperand*&>(unsigned int, llvm::SDVTList&&&, llvm::ISD::MemIndexedMode&&, bool&&, llvm::EVT&&&, llvm::MachineMemOperand*&&&)
Line
Count
Source
348
2.26M
                                               ArgTypes &&... Args) {
349
2.26M
    // The compiler can reduce this expression to a constant iff we pass an
350
2.26M
    // empty DebugLoc.  Thankfully, the debug location doesn't have any bearing
351
2.26M
    // on the subclass data.
352
2.26M
    return SDNodeT(IROrder, DebugLoc(), std::forward<ArgTypes>(Args)...)
353
2.26M
        .getRawSubclassData();
354
2.26M
  }
unsigned short llvm::SelectionDAG::getSyntheticNodeSubclassData<llvm::MaskedLoadSDNode, llvm::SDVTList&, llvm::ISD::LoadExtType&, bool&, llvm::EVT&, llvm::MachineMemOperand*&>(unsigned int, llvm::SDVTList&&&, llvm::ISD::LoadExtType&&&, bool&&&, llvm::EVT&&&, llvm::MachineMemOperand*&&&)
Line
Count
Source
348
612
                                               ArgTypes &&... Args) {
349
612
    // The compiler can reduce this expression to a constant iff we pass an
350
612
    // empty DebugLoc.  Thankfully, the debug location doesn't have any bearing
351
612
    // on the subclass data.
352
612
    return SDNodeT(IROrder, DebugLoc(), std::forward<ArgTypes>(Args)...)
353
612
        .getRawSubclassData();
354
612
  }
unsigned short llvm::SelectionDAG::getSyntheticNodeSubclassData<llvm::MaskedStoreSDNode, llvm::SDVTList&, bool&, bool&, llvm::EVT&, llvm::MachineMemOperand*&>(unsigned int, llvm::SDVTList&&&, bool&&&, bool&&&, llvm::EVT&&&, llvm::MachineMemOperand*&&&)
Line
Count
Source
348
407
                                               ArgTypes &&... Args) {
349
407
    // The compiler can reduce this expression to a constant iff we pass an
350
407
    // empty DebugLoc.  Thankfully, the debug location doesn't have any bearing
351
407
    // on the subclass data.
352
407
    return SDNodeT(IROrder, DebugLoc(), std::forward<ArgTypes>(Args)...)
353
407
        .getRawSubclassData();
354
407
  }
unsigned short llvm::SelectionDAG::getSyntheticNodeSubclassData<llvm::MaskedGatherSDNode, llvm::SDVTList&, llvm::EVT&, llvm::MachineMemOperand*&>(unsigned int, llvm::SDVTList&&&, llvm::EVT&&&, llvm::MachineMemOperand*&&&)
Line
Count
Source
348
473
                                               ArgTypes &&... Args) {
349
473
    // The compiler can reduce this expression to a constant iff we pass an
350
473
    // empty DebugLoc.  Thankfully, the debug location doesn't have any bearing
351
473
    // on the subclass data.
352
473
    return SDNodeT(IROrder, DebugLoc(), std::forward<ArgTypes>(Args)...)
353
473
        .getRawSubclassData();
354
473
  }
unsigned short llvm::SelectionDAG::getSyntheticNodeSubclassData<llvm::MaskedScatterSDNode, llvm::SDVTList&, llvm::EVT&, llvm::MachineMemOperand*&>(unsigned int, llvm::SDVTList&&&, llvm::EVT&&&, llvm::MachineMemOperand*&&&)
Line
Count
Source
348
168
                                               ArgTypes &&... Args) {
349
168
    // The compiler can reduce this expression to a constant iff we pass an
350
168
    // empty DebugLoc.  Thankfully, the debug location doesn't have any bearing
351
168
    // on the subclass data.
352
168
    return SDNodeT(IROrder, DebugLoc(), std::forward<ArgTypes>(Args)...)
353
168
        .getRawSubclassData();
354
168
  }
355
356
  template <typename SDNodeTy>
357
  static uint16_t getSyntheticNodeSubclassData(unsigned Opc, unsigned Order,
358
                                                SDVTList VTs, EVT MemoryVT,
359
79.5k
                                                MachineMemOperand *MMO) {
360
79.5k
    return SDNodeTy(Opc, Order, DebugLoc(), VTs, MemoryVT, MMO)
361
79.5k
         .getRawSubclassData();
362
79.5k
  }
363
364
  void createOperands(SDNode *Node, ArrayRef<SDValue> Vals);
365
366
77.0M
  void removeOperands(SDNode *Node) {
367
77.0M
    if (!Node->OperandList)
368
30.4M
      return;
369
46.6M
    OperandRecycler.deallocate(
370
46.6M
        ArrayRecycler<SDUse>::Capacity::get(Node->NumOperands),
371
46.6M
        Node->OperandList);
372
46.6M
    Node->NumOperands = 0;
373
46.6M
    Node->OperandList = nullptr;
374
46.6M
  }
375
  void CreateTopologicalOrder(std::vector<SDNode*>& Order);
376
public:
377
  explicit SelectionDAG(const TargetMachine &TM, CodeGenOpt::Level);
378
  SelectionDAG(const SelectionDAG &) = delete;
379
  SelectionDAG &operator=(const SelectionDAG &) = delete;
380
  ~SelectionDAG();
381
382
  /// Prepare this SelectionDAG to process code in the given MachineFunction.
383
  void init(MachineFunction &NewMF, OptimizationRemarkEmitter &NewORE,
384
            Pass *PassPtr, const TargetLibraryInfo *LibraryInfo,
385
            LegacyDivergenceAnalysis * Divergence);
386
387
272k
  void setFunctionLoweringInfo(FunctionLoweringInfo * FuncInfo) {
388
272k
    FLI = FuncInfo;
389
272k
  }
390
391
  /// Clear state and free memory necessary to make this
392
  /// SelectionDAG ready to process a new block.
393
  void clear();
394
395
27.8M
  MachineFunction &getMachineFunction() const { return *MF; }
396
19.9k
  const Pass *getPass() const { return SDAGISelPass; }
397
398
98.8M
  const DataLayout &getDataLayout() const { return MF->getDataLayout(); }
399
44.1M
  const TargetMachine &getTarget() const { return TM; }
400
4.37M
  const TargetSubtargetInfo &getSubtarget() const { return MF->getSubtarget(); }
401
159M
  const TargetLowering &getTargetLoweringInfo() const { return *TLI; }
402
68
  const TargetLibraryInfo &getLibInfo() const { return *LibInfo; }
403
8.32k
  const SelectionDAGTargetInfo &getSelectionDAGInfo() const { return *TSI; }
404
119M
  LLVMContext *getContext() const {return Context; }
405
0
  OptimizationRemarkEmitter &getORE() const { return *ORE; }
406
407
  /// Pop up a GraphViz/gv window with the DAG rendered using 'dot'.
408
  void viewGraph(const std::string &Title);
409
  void viewGraph();
410
411
#ifndef NDEBUG
412
  std::map<const SDNode *, std::string> NodeGraphAttrs;
413
#endif
414
415
  /// Clear all previously defined node graph attributes.
416
  /// Intended to be used from a debugging tool (eg. gdb).
417
  void clearGraphAttrs();
418
419
  /// Set graph attributes for a node. (eg. "color=red".)
420
  void setGraphAttrs(const SDNode *N, const char *Attrs);
421
422
  /// Get graph attributes for a node. (eg. "color=red".)
423
  /// Used from getNodeAttributes.
424
  const std::string getGraphAttrs(const SDNode *N) const;
425
426
  /// Convenience for setting node color attribute.
427
  void setGraphColor(const SDNode *N, const char *Color);
428
429
  /// Convenience for setting subgraph color attribute.
430
  void setSubgraphColor(SDNode *N, const char *Color);
431
432
  using allnodes_const_iterator = ilist<SDNode>::const_iterator;
433
434
0
  allnodes_const_iterator allnodes_begin() const { return AllNodes.begin(); }
435
0
  allnodes_const_iterator allnodes_end() const { return AllNodes.end(); }
436
437
  using allnodes_iterator = ilist<SDNode>::iterator;
438
439
190M
  allnodes_iterator allnodes_begin() { return AllNodes.begin(); }
440
33.6M
  allnodes_iterator allnodes_end() { return AllNodes.end(); }
441
442
26.2k
  ilist<SDNode>::size_type allnodes_size() const {
443
26.2k
    return AllNodes.size();
444
26.2k
  }
445
446
21.3M
  iterator_range<allnodes_iterator> allnodes() {
447
21.3M
    return make_range(allnodes_begin(), allnodes_end());
448
21.3M
  }
449
0
  iterator_range<allnodes_const_iterator> allnodes() const {
450
0
    return make_range(allnodes_begin(), allnodes_end());
451
0
  }
452
453
  /// Return the root tag of the SelectionDAG.
454
79.4M
  const SDValue &getRoot() const { return Root; }
455
456
  /// Return the token chain corresponding to the entry of the function.
457
10.7M
  SDValue getEntryNode() const {
458
10.7M
    return SDValue(const_cast<SDNode *>(&EntryNode), 0);
459
10.7M
  }
460
461
  /// Set the current root tag of the SelectionDAG.
462
  ///
463
24.4M
  const SDValue &setRoot(SDValue N) {
464
24.4M
    assert((!N.getNode() || N.getValueType() == MVT::Other) &&
465
24.4M
           "DAG root value is not a chain!");
466
24.4M
    if (N.getNode())
467
22.5M
      checkForCycles(N.getNode(), this);
468
24.4M
    Root = N;
469
24.4M
    if (N.getNode())
470
22.5M
      checkForCycles(this);
471
24.4M
    return Root;
472
24.4M
  }
473
474
  void VerifyDAGDiverence();
475
476
  /// This iterates over the nodes in the SelectionDAG, folding
477
  /// certain types of nodes together, or eliminating superfluous nodes.  The
478
  /// Level argument controls whether Combine is allowed to produce nodes and
479
  /// types that are illegal on the target.
480
  void Combine(CombineLevel Level, AliasAnalysis *AA,
481
               CodeGenOpt::Level OptLevel);
482
483
  /// This transforms the SelectionDAG into a SelectionDAG that
484
  /// only uses types natively supported by the target.
485
  /// Returns "true" if it made any changes.
486
  ///
487
  /// Note that this is an involved process that may invalidate pointers into
488
  /// the graph.
489
  bool LegalizeTypes();
490
491
  /// This transforms the SelectionDAG into a SelectionDAG that is
492
  /// compatible with the target instruction selector, as indicated by the
493
  /// TargetLowering object.
494
  ///
495
  /// Note that this is an involved process that may invalidate pointers into
496
  /// the graph.
497
  void Legalize();
498
499
  /// Transforms a SelectionDAG node and any operands to it into a node
500
  /// that is compatible with the target instruction selector, as indicated by
501
  /// the TargetLowering object.
502
  ///
503
  /// \returns true if \c N is a valid, legal node after calling this.
504
  ///
505
  /// This essentially runs a single recursive walk of the \c Legalize process
506
  /// over the given node (and its operands). This can be used to incrementally
507
  /// legalize the DAG. All of the nodes which are directly replaced,
508
  /// potentially including N, are added to the output parameter \c
509
  /// UpdatedNodes so that the delta to the DAG can be understood by the
510
  /// caller.
511
  ///
512
  /// When this returns false, N has been legalized in a way that make the
513
  /// pointer passed in no longer valid. It may have even been deleted from the
514
  /// DAG, and so it shouldn't be used further. When this returns true, the
515
  /// N passed in is a legal node, and can be immediately processed as such.
516
  /// This may still have done some work on the DAG, and will still populate
517
  /// UpdatedNodes with any new nodes replacing those originally in the DAG.
518
  bool LegalizeOp(SDNode *N, SmallSetVector<SDNode *, 16> &UpdatedNodes);
519
520
  /// This transforms the SelectionDAG into a SelectionDAG
521
  /// that only uses vector math operations supported by the target.  This is
522
  /// necessary as a separate step from Legalize because unrolling a vector
523
  /// operation can introduce illegal types, which requires running
524
  /// LegalizeTypes again.
525
  ///
526
  /// This returns true if it made any changes; in that case, LegalizeTypes
527
  /// is called again before Legalize.
528
  ///
529
  /// Note that this is an involved process that may invalidate pointers into
530
  /// the graph.
531
  bool LegalizeVectors();
532
533
  /// This method deletes all unreachable nodes in the SelectionDAG.
534
  void RemoveDeadNodes();
535
536
  /// Remove the specified node from the system.  This node must
537
  /// have no referrers.
538
  void DeleteNode(SDNode *N);
539
540
  /// Return an SDVTList that represents the list of values specified.
541
  SDVTList getVTList(EVT VT);
542
  SDVTList getVTList(EVT VT1, EVT VT2);
543
  SDVTList getVTList(EVT VT1, EVT VT2, EVT VT3);
544
  SDVTList getVTList(EVT VT1, EVT VT2, EVT VT3, EVT VT4);
545
  SDVTList getVTList(ArrayRef<EVT> VTs);
546
547
  //===--------------------------------------------------------------------===//
548
  // Node creation methods.
549
550
  /// Create a ConstantSDNode wrapping a constant value.
551
  /// If VT is a vector type, the constant is splatted into a BUILD_VECTOR.
552
  ///
553
  /// If only legal types can be produced, this does the necessary
554
  /// transformations (e.g., if the vector element type is illegal).
555
  /// @{
556
  SDValue getConstant(uint64_t Val, const SDLoc &DL, EVT VT,
557
                      bool isTarget = false, bool isOpaque = false);
558
  SDValue getConstant(const APInt &Val, const SDLoc &DL, EVT VT,
559
                      bool isTarget = false, bool isOpaque = false);
560
561
  SDValue getAllOnesConstant(const SDLoc &DL, EVT VT, bool IsTarget = false,
562
18.0k
                             bool IsOpaque = false) {
563
18.0k
    return getConstant(APInt::getAllOnesValue(VT.getScalarSizeInBits()), DL,
564
18.0k
                       VT, IsTarget, IsOpaque);
565
18.0k
  }
566
567
  SDValue getConstant(const ConstantInt &Val, const SDLoc &DL, EVT VT,
568
                      bool isTarget = false, bool isOpaque = false);
569
  SDValue getIntPtrConstant(uint64_t Val, const SDLoc &DL,
570
                            bool isTarget = false);
571
  SDValue getTargetConstant(uint64_t Val, const SDLoc &DL, EVT VT,
572
8.86M
                            bool isOpaque = false) {
573
8.86M
    return getConstant(Val, DL, VT, true, isOpaque);
574
8.86M
  }
575
  SDValue getTargetConstant(const APInt &Val, const SDLoc &DL, EVT VT,
576
142k
                            bool isOpaque = false) {
577
142k
    return getConstant(Val, DL, VT, true, isOpaque);
578
142k
  }
579
  SDValue getTargetConstant(const ConstantInt &Val, const SDLoc &DL, EVT VT,
580
1.52M
                            bool isOpaque = false) {
581
1.52M
    return getConstant(Val, DL, VT, true, isOpaque);
582
1.52M
  }
583
584
  /// Create a true or false constant of type \p VT using the target's
585
  /// BooleanContent for type \p OpVT.
586
  SDValue getBoolConstant(bool V, const SDLoc &DL, EVT VT, EVT OpVT);
587
  /// @}
588
589
  /// Create a ConstantFPSDNode wrapping a constant value.
590
  /// If VT is a vector type, the constant is splatted into a BUILD_VECTOR.
591
  ///
592
  /// If only legal types can be produced, this does the necessary
593
  /// transformations (e.g., if the vector element type is illegal).
594
  /// The forms that take a double should only be used for simple constants
595
  /// that can be exactly represented in VT.  No checks are made.
596
  /// @{
597
  SDValue getConstantFP(double Val, const SDLoc &DL, EVT VT,
598
                        bool isTarget = false);
599
  SDValue getConstantFP(const APFloat &Val, const SDLoc &DL, EVT VT,
600
                        bool isTarget = false);
601
  SDValue getConstantFP(const ConstantFP &V, const SDLoc &DL, EVT VT,
602
                        bool isTarget = false);
603
0
  SDValue getTargetConstantFP(double Val, const SDLoc &DL, EVT VT) {
604
0
    return getConstantFP(Val, DL, VT, true);
605
0
  }
606
10
  SDValue getTargetConstantFP(const APFloat &Val, const SDLoc &DL, EVT VT) {
607
10
    return getConstantFP(Val, DL, VT, true);
608
10
  }
609
15.8k
  SDValue getTargetConstantFP(const ConstantFP &Val, const SDLoc &DL, EVT VT) {
610
15.8k
    return getConstantFP(Val, DL, VT, true);
611
15.8k
  }
612
  /// @}
613
614
  SDValue getGlobalAddress(const GlobalValue *GV, const SDLoc &DL, EVT VT,
615
                           int64_t offset = 0, bool isTargetGA = false,
616
                           unsigned char TargetFlags = 0);
617
  SDValue getTargetGlobalAddress(const GlobalValue *GV, const SDLoc &DL, EVT VT,
618
                                 int64_t offset = 0,
619
1.67M
                                 unsigned char TargetFlags = 0) {
620
1.67M
    return getGlobalAddress(GV, DL, VT, offset, true, TargetFlags);
621
1.67M
  }
622
  SDValue getFrameIndex(int FI, EVT VT, bool isTarget = false);
623
678k
  SDValue getTargetFrameIndex(int FI, EVT VT) {
624
678k
    return getFrameIndex(FI, VT, true);
625
678k
  }
626
  SDValue getJumpTable(int JTI, EVT VT, bool isTarget = false,
627
                       unsigned char TargetFlags = 0);
628
4.89k
  SDValue getTargetJumpTable(int JTI, EVT VT, unsigned char TargetFlags = 0) {
629
4.89k
    return getJumpTable(JTI, VT, true, TargetFlags);
630
4.89k
  }
631
  SDValue getConstantPool(const Constant *C, EVT VT,
632
                          unsigned Align = 0, int Offs = 0, bool isT=false,
633
                          unsigned char TargetFlags = 0);
634
  SDValue getTargetConstantPool(const Constant *C, EVT VT,
635
                                unsigned Align = 0, int Offset = 0,
636
163k
                                unsigned char TargetFlags = 0) {
637
163k
    return getConstantPool(C, VT, Align, Offset, true, TargetFlags);
638
163k
  }
639
  SDValue getConstantPool(MachineConstantPoolValue *C, EVT VT,
640
                          unsigned Align = 0, int Offs = 0, bool isT=false,
641
                          unsigned char TargetFlags = 0);
642
  SDValue getTargetConstantPool(MachineConstantPoolValue *C,
643
                                  EVT VT, unsigned Align = 0,
644
256
                                  int Offset = 0, unsigned char TargetFlags=0) {
645
256
    return getConstantPool(C, VT, Align, Offset, true, TargetFlags);
646
256
  }
647
  SDValue getTargetIndex(int Index, EVT VT, int64_t Offset = 0,
648
                         unsigned char TargetFlags = 0);
649
  // When generating a branch to a BB, we don't in general know enough
650
  // to provide debug info for the BB at that time, so keep this one around.
651
  SDValue getBasicBlock(MachineBasicBlock *MBB);
652
  SDValue getBasicBlock(MachineBasicBlock *MBB, SDLoc dl);
653
  SDValue getExternalSymbol(const char *Sym, EVT VT);
654
  SDValue getExternalSymbol(const char *Sym, const SDLoc &dl, EVT VT);
655
  SDValue getTargetExternalSymbol(const char *Sym, EVT VT,
656
                                  unsigned char TargetFlags = 0);
657
  SDValue getMCSymbol(MCSymbol *Sym, EVT VT);
658
659
  SDValue getValueType(EVT);
660
  SDValue getRegister(unsigned Reg, EVT VT);
661
  SDValue getRegisterMask(const uint32_t *RegMask);
662
  SDValue getEHLabel(const SDLoc &dl, SDValue Root, MCSymbol *Label);
663
  SDValue getLabelNode(unsigned Opcode, const SDLoc &dl, SDValue Root,
664
                       MCSymbol *Label);
665
  SDValue getBlockAddress(const BlockAddress *BA, EVT VT,
666
                          int64_t Offset = 0, bool isTarget = false,
667
                          unsigned char TargetFlags = 0);
668
  SDValue getTargetBlockAddress(const BlockAddress *BA, EVT VT,
669
                                int64_t Offset = 0,
670
154
                                unsigned char TargetFlags = 0) {
671
154
    return getBlockAddress(BA, VT, Offset, true, TargetFlags);
672
154
  }
673
674
  SDValue getCopyToReg(SDValue Chain, const SDLoc &dl, unsigned Reg,
675
1.38M
                       SDValue N) {
676
1.38M
    return getNode(ISD::CopyToReg, dl, MVT::Other, Chain,
677
1.38M
                   getRegister(Reg, N.getValueType()), N);
678
1.38M
  }
679
680
  // This version of the getCopyToReg method takes an extra operand, which
681
  // indicates that there is potentially an incoming glue value (if Glue is not
682
  // null) and that there should be a glue result.
683
  SDValue getCopyToReg(SDValue Chain, const SDLoc &dl, unsigned Reg, SDValue N,
684
2.43M
                       SDValue Glue) {
685
2.43M
    SDVTList VTs = getVTList(MVT::Other, MVT::Glue);
686
2.43M
    SDValue Ops[] = { Chain, getRegister(Reg, N.getValueType()), N, Glue };
687
2.43M
    return getNode(ISD::CopyToReg, dl, VTs,
688
2.43M
                   makeArrayRef(Ops, Glue.getNode() ? 
41.03M
:
31.39M
));
689
2.43M
  }
690
691
  // Similar to last getCopyToReg() except parameter Reg is a SDValue
692
  SDValue getCopyToReg(SDValue Chain, const SDLoc &dl, SDValue Reg, SDValue N,
693
2.37k
                       SDValue Glue) {
694
2.37k
    SDVTList VTs = getVTList(MVT::Other, MVT::Glue);
695
2.37k
    SDValue Ops[] = { Chain, Reg, N, Glue };
696
2.37k
    return getNode(ISD::CopyToReg, dl, VTs,
697
2.37k
                   makeArrayRef(Ops, Glue.getNode() ? 
4152
:
32.21k
));
698
2.37k
  }
699
700
4.49M
  SDValue getCopyFromReg(SDValue Chain, const SDLoc &dl, unsigned Reg, EVT VT) {
701
4.49M
    SDVTList VTs = getVTList(VT, MVT::Other);
702
4.49M
    SDValue Ops[] = { Chain, getRegister(Reg, VT) };
703
4.49M
    return getNode(ISD::CopyFromReg, dl, VTs, Ops);
704
4.49M
  }
705
706
  // This version of the getCopyFromReg method takes an extra operand, which
707
  // indicates that there is potentially an incoming glue value (if Glue is not
708
  // null) and that there should be a glue result.
709
  SDValue getCopyFromReg(SDValue Chain, const SDLoc &dl, unsigned Reg, EVT VT,
710
433k
                         SDValue Glue) {
711
433k
    SDVTList VTs = getVTList(VT, MVT::Other, MVT::Glue);
712
433k
    SDValue Ops[] = { Chain, getRegister(Reg, VT), Glue };
713
433k
    return getNode(ISD::CopyFromReg, dl, VTs,
714
433k
                   makeArrayRef(Ops, Glue.getNode() ? 3 : 
20
));
715
433k
  }
716
717
  SDValue getCondCode(ISD::CondCode Cond);
718
719
  /// Return an ISD::VECTOR_SHUFFLE node. The number of elements in VT,
720
  /// which must be a vector type, must match the number of mask elements
721
  /// NumElts. An integer mask element equal to -1 is treated as undefined.
722
  SDValue getVectorShuffle(EVT VT, const SDLoc &dl, SDValue N1, SDValue N2,
723
                           ArrayRef<int> Mask);
724
725
  /// Return an ISD::BUILD_VECTOR node. The number of elements in VT,
726
  /// which must be a vector type, must match the number of operands in Ops.
727
  /// The operands must have the same type as (or, for integers, a type wider
728
  /// than) VT's element type.
729
343k
  SDValue getBuildVector(EVT VT, const SDLoc &DL, ArrayRef<SDValue> Ops) {
730
343k
    // VerifySDNode (via InsertNode) checks BUILD_VECTOR later.
731
343k
    return getNode(ISD::BUILD_VECTOR, DL, VT, Ops);
732
343k
  }
733
734
  /// Return an ISD::BUILD_VECTOR node. The number of elements in VT,
735
  /// which must be a vector type, must match the number of operands in Ops.
736
  /// The operands must have the same type as (or, for integers, a type wider
737
  /// than) VT's element type.
738
11.6k
  SDValue getBuildVector(EVT VT, const SDLoc &DL, ArrayRef<SDUse> Ops) {
739
11.6k
    // VerifySDNode (via InsertNode) checks BUILD_VECTOR later.
740
11.6k
    return getNode(ISD::BUILD_VECTOR, DL, VT, Ops);
741
11.6k
  }
742
743
  /// Return a splat ISD::BUILD_VECTOR node, consisting of Op splatted to all
744
  /// elements. VT must be a vector type. Op's type must be the same as (or,
745
  /// for integers, a type wider than) VT's element type.
746
90.2k
  SDValue getSplatBuildVector(EVT VT, const SDLoc &DL, SDValue Op) {
747
90.2k
    // VerifySDNode (via InsertNode) checks BUILD_VECTOR later.
748
90.2k
    if (Op.getOpcode() == ISD::UNDEF) {
749
0
      assert((VT.getVectorElementType() == Op.getValueType() ||
750
0
              (VT.isInteger() &&
751
0
               VT.getVectorElementType().bitsLE(Op.getValueType()))) &&
752
0
             "A splatted value must have a width equal or (for integers) "
753
0
             "greater than the vector element type!");
754
0
      return getNode(ISD::UNDEF, SDLoc(), VT);
755
0
    }
756
90.2k
757
90.2k
    SmallVector<SDValue, 16> Ops(VT.getVectorNumElements(), Op);
758
90.2k
    return getNode(ISD::BUILD_VECTOR, DL, VT, Ops);
759
90.2k
  }
760
761
  /// Returns an ISD::VECTOR_SHUFFLE node semantically equivalent to
762
  /// the shuffle node in input but with swapped operands.
763
  ///
764
  /// Example: shuffle A, B, <0,5,2,7> -> shuffle B, A, <4,1,6,3>
765
  SDValue getCommutedVectorShuffle(const ShuffleVectorSDNode &SV);
766
767
  /// Convert Op, which must be of float type, to the
768
  /// float type VT, by either extending or rounding (by truncation).
769
  SDValue getFPExtendOrRound(SDValue Op, const SDLoc &DL, EVT VT);
770
771
  /// Convert Op, which must be of integer type, to the
772
  /// integer type VT, by either any-extending or truncating it.
773
  SDValue getAnyExtOrTrunc(SDValue Op, const SDLoc &DL, EVT VT);
774
775
  /// Convert Op, which must be of integer type, to the
776
  /// integer type VT, by either sign-extending or truncating it.
777
  SDValue getSExtOrTrunc(SDValue Op, const SDLoc &DL, EVT VT);
778
779
  /// Convert Op, which must be of integer type, to the
780
  /// integer type VT, by either zero-extending or truncating it.
781
  SDValue getZExtOrTrunc(SDValue Op, const SDLoc &DL, EVT VT);
782
783
  /// Return the expression required to zero extend the Op
784
  /// value assuming it was the smaller SrcTy value.
785
  SDValue getZeroExtendInReg(SDValue Op, const SDLoc &DL, EVT VT);
786
787
  /// Return an operation which will any-extend the low lanes of the operand
788
  /// into the specified vector type. For example,
789
  /// this can convert a v16i8 into a v4i32 by any-extending the low four
790
  /// lanes of the operand from i8 to i32.
791
  SDValue getAnyExtendVectorInReg(SDValue Op, const SDLoc &DL, EVT VT);
792
793
  /// Return an operation which will sign extend the low lanes of the operand
794
  /// into the specified vector type. For example,
795
  /// this can convert a v16i8 into a v4i32 by sign extending the low four
796
  /// lanes of the operand from i8 to i32.
797
  SDValue getSignExtendVectorInReg(SDValue Op, const SDLoc &DL, EVT VT);
798
799
  /// Return an operation which will zero extend the low lanes of the operand
800
  /// into the specified vector type. For example,
801
  /// this can convert a v16i8 into a v4i32 by zero extending the low four
802
  /// lanes of the operand from i8 to i32.
803
  SDValue getZeroExtendVectorInReg(SDValue Op, const SDLoc &DL, EVT VT);
804
805
  /// Convert Op, which must be of integer type, to the integer type VT,
806
  /// by using an extension appropriate for the target's
807
  /// BooleanContent for type OpVT or truncating it.
808
  SDValue getBoolExtOrTrunc(SDValue Op, const SDLoc &SL, EVT VT, EVT OpVT);
809
810
  /// Create a bitwise NOT operation as (XOR Val, -1).
811
  SDValue getNOT(const SDLoc &DL, SDValue Val, EVT VT);
812
813
  /// Create a logical NOT operation as (XOR Val, BooleanOne).
814
  SDValue getLogicalNOT(const SDLoc &DL, SDValue Val, EVT VT);
815
816
  /// Create an add instruction with appropriate flags when used for
817
  /// addressing some offset of an object. i.e. if a load is split into multiple
818
  /// components, create an add nuw from the base pointer to the offset.
819
99.2k
  SDValue getObjectPtrOffset(const SDLoc &SL, SDValue Op, int64_t Offset) {
820
99.2k
    EVT VT = Op.getValueType();
821
99.2k
    return getObjectPtrOffset(SL, Op, getConstant(Offset, SL, VT));
822
99.2k
  }
823
824
99.3k
  SDValue getObjectPtrOffset(const SDLoc &SL, SDValue Op, SDValue Offset) {
825
99.3k
    EVT VT = Op.getValueType();
826
99.3k
827
99.3k
    // The object itself can't wrap around the address space, so it shouldn't be
828
99.3k
    // possible for the adds of the offsets to the split parts to overflow.
829
99.3k
    SDNodeFlags Flags;
830
99.3k
    Flags.setNoUnsignedWrap(true);
831
99.3k
    return getNode(ISD::ADD, SL, VT, Op, Offset, Flags);
832
99.3k
  }
833
834
  /// Return a new CALLSEQ_START node, that starts new call frame, in which
835
  /// InSize bytes are set up inside CALLSEQ_START..CALLSEQ_END sequence and
836
  /// OutSize specifies part of the frame set up prior to the sequence.
837
  SDValue getCALLSEQ_START(SDValue Chain, uint64_t InSize, uint64_t OutSize,
838
702k
                           const SDLoc &DL) {
839
702k
    SDVTList VTs = getVTList(MVT::Other, MVT::Glue);
840
702k
    SDValue Ops[] = { Chain,
841
702k
                      getIntPtrConstant(InSize, DL, true),
842
702k
                      getIntPtrConstant(OutSize, DL, true) };
843
702k
    return getNode(ISD::CALLSEQ_START, DL, VTs, Ops);
844
702k
  }
845
846
  /// Return a new CALLSEQ_END node, which always must have a
847
  /// glue result (to ensure it's not CSE'd).
848
  /// CALLSEQ_END does not have a useful SDLoc.
849
  SDValue getCALLSEQ_END(SDValue Chain, SDValue Op1, SDValue Op2,
850
702k
                         SDValue InGlue, const SDLoc &DL) {
851
702k
    SDVTList NodeTys = getVTList(MVT::Other, MVT::Glue);
852
702k
    SmallVector<SDValue, 4> Ops;
853
702k
    Ops.push_back(Chain);
854
702k
    Ops.push_back(Op1);
855
702k
    Ops.push_back(Op2);
856
702k
    if (InGlue.getNode())
857
702k
      Ops.push_back(InGlue);
858
702k
    return getNode(ISD::CALLSEQ_END, DL, NodeTys, Ops);
859
702k
  }
860
861
  /// Return true if the result of this operation is always undefined.
862
  bool isUndef(unsigned Opcode, ArrayRef<SDValue> Ops);
863
864
  /// Return an UNDEF node. UNDEF does not have a useful SDLoc.
865
4.71M
  SDValue getUNDEF(EVT VT) {
866
4.71M
    return getNode(ISD::UNDEF, SDLoc(), VT);
867
4.71M
  }
868
869
  /// Return a GLOBAL_OFFSET_TABLE node. This does not have a useful SDLoc.
870
28
  SDValue getGLOBAL_OFFSET_TABLE(EVT VT) {
871
28
    return getNode(ISD::GLOBAL_OFFSET_TABLE, SDLoc(), VT);
872
28
  }
873
874
  /// Gets or creates the specified node.
875
  ///
876
  SDValue getNode(unsigned Opcode, const SDLoc &DL, EVT VT,
877
                  ArrayRef<SDUse> Ops);
878
  SDValue getNode(unsigned Opcode, const SDLoc &DL, EVT VT,
879
                  ArrayRef<SDValue> Ops, const SDNodeFlags Flags = SDNodeFlags());
880
  SDValue getNode(unsigned Opcode, const SDLoc &DL, ArrayRef<EVT> ResultTys,
881
                  ArrayRef<SDValue> Ops);
882
  SDValue getNode(unsigned Opcode, const SDLoc &DL, SDVTList VTList,
883
                  ArrayRef<SDValue> Ops);
884
885
  // Specialize based on number of operands.
886
  SDValue getNode(unsigned Opcode, const SDLoc &DL, EVT VT);
887
  SDValue getNode(unsigned Opcode, const SDLoc &DL, EVT VT, SDValue Operand,
888
                  const SDNodeFlags Flags = SDNodeFlags());
889
  SDValue getNode(unsigned Opcode, const SDLoc &DL, EVT VT, SDValue N1,
890
                  SDValue N2, const SDNodeFlags Flags = SDNodeFlags());
891
  SDValue getNode(unsigned Opcode, const SDLoc &DL, EVT VT, SDValue N1,
892
                  SDValue N2, SDValue N3,
893
                  const SDNodeFlags Flags = SDNodeFlags());
894
  SDValue getNode(unsigned Opcode, const SDLoc &DL, EVT VT, SDValue N1,
895
                  SDValue N2, SDValue N3, SDValue N4);
896
  SDValue getNode(unsigned Opcode, const SDLoc &DL, EVT VT, SDValue N1,
897
                  SDValue N2, SDValue N3, SDValue N4, SDValue N5);
898
899
  // Specialize again based on number of operands for nodes with a VTList
900
  // rather than a single VT.
901
  SDValue getNode(unsigned Opcode, const SDLoc &DL, SDVTList VTList);
902
  SDValue getNode(unsigned Opcode, const SDLoc &DL, SDVTList VTList, SDValue N);
903
  SDValue getNode(unsigned Opcode, const SDLoc &DL, SDVTList VTList, SDValue N1,
904
                  SDValue N2);
905
  SDValue getNode(unsigned Opcode, const SDLoc &DL, SDVTList VTList, SDValue N1,
906
                  SDValue N2, SDValue N3);
907
  SDValue getNode(unsigned Opcode, const SDLoc &DL, SDVTList VTList, SDValue N1,
908
                  SDValue N2, SDValue N3, SDValue N4);
909
  SDValue getNode(unsigned Opcode, const SDLoc &DL, SDVTList VTList, SDValue N1,
910
                  SDValue N2, SDValue N3, SDValue N4, SDValue N5);
911
912
  /// Compute a TokenFactor to force all the incoming stack arguments to be
913
  /// loaded from the stack. This is used in tail call lowering to protect
914
  /// stack arguments from being clobbered.
915
  SDValue getStackArgumentTokenFactor(SDValue Chain);
916
917
  SDValue getMemcpy(SDValue Chain, const SDLoc &dl, SDValue Dst, SDValue Src,
918
                    SDValue Size, unsigned Align, bool isVol, bool AlwaysInline,
919
                    bool isTailCall, MachinePointerInfo DstPtrInfo,
920
                    MachinePointerInfo SrcPtrInfo);
921
922
  SDValue getMemmove(SDValue Chain, const SDLoc &dl, SDValue Dst, SDValue Src,
923
                     SDValue Size, unsigned Align, bool isVol, bool isTailCall,
924
                     MachinePointerInfo DstPtrInfo,
925
                     MachinePointerInfo SrcPtrInfo);
926
927
  SDValue getMemset(SDValue Chain, const SDLoc &dl, SDValue Dst, SDValue Src,
928
                    SDValue Size, unsigned Align, bool isVol, bool isTailCall,
929
                    MachinePointerInfo DstPtrInfo);
930
931
  SDValue getAtomicMemcpy(SDValue Chain, const SDLoc &dl, SDValue Dst,
932
                          unsigned DstAlign, SDValue Src, unsigned SrcAlign,
933
                          SDValue Size, Type *SizeTy, unsigned ElemSz,
934
                          bool isTailCall, MachinePointerInfo DstPtrInfo,
935
                          MachinePointerInfo SrcPtrInfo);
936
937
  SDValue getAtomicMemmove(SDValue Chain, const SDLoc &dl, SDValue Dst,
938
                           unsigned DstAlign, SDValue Src, unsigned SrcAlign,
939
                           SDValue Size, Type *SizeTy, unsigned ElemSz,
940
                           bool isTailCall, MachinePointerInfo DstPtrInfo,
941
                           MachinePointerInfo SrcPtrInfo);
942
943
  SDValue getAtomicMemset(SDValue Chain, const SDLoc &dl, SDValue Dst,
944
                          unsigned DstAlign, SDValue Value, SDValue Size,
945
                          Type *SizeTy, unsigned ElemSz, bool isTailCall,
946
                          MachinePointerInfo DstPtrInfo);
947
948
  /// Helper function to make it easier to build SetCC's if you just
949
  /// have an ISD::CondCode instead of an SDValue.
950
  ///
951
  SDValue getSetCC(const SDLoc &DL, EVT VT, SDValue LHS, SDValue RHS,
952
1.61M
                   ISD::CondCode Cond) {
953
1.61M
    assert(LHS.getValueType().isVector() == RHS.getValueType().isVector() &&
954
1.61M
      "Cannot compare scalars to vectors");
955
1.61M
    assert(LHS.getValueType().isVector() == VT.isVector() &&
956
1.61M
      "Cannot compare scalars to vectors");
957
1.61M
    assert(Cond != ISD::SETCC_INVALID &&
958
1.61M
        "Cannot create a setCC of an invalid node.");
959
1.61M
    return getNode(ISD::SETCC, DL, VT, LHS, RHS, getCondCode(Cond));
960
1.61M
  }
961
962
  /// Helper function to make it easier to build Select's if you just
963
  /// have operands and don't want to check for vector.
964
  SDValue getSelect(const SDLoc &DL, EVT VT, SDValue Cond, SDValue LHS,
965
28.2k
                    SDValue RHS) {
966
28.2k
    assert(LHS.getValueType() == RHS.getValueType() &&
967
28.2k
           "Cannot use select on differing types");
968
28.2k
    assert(VT.isVector() == LHS.getValueType().isVector() &&
969
28.2k
           "Cannot mix vectors and scalars");
970
28.2k
    return getNode(Cond.getValueType().isVector() ? 
ISD::VSELECT4.35k
:
ISD::SELECT23.9k
, DL, VT,
971
28.2k
                   Cond, LHS, RHS);
972
28.2k
  }
973
974
  /// Helper function to make it easier to build SelectCC's if you
975
  /// just have an ISD::CondCode instead of an SDValue.
976
  ///
977
  SDValue getSelectCC(const SDLoc &DL, SDValue LHS, SDValue RHS, SDValue True,
978
4.46k
                      SDValue False, ISD::CondCode Cond) {
979
4.46k
    return getNode(ISD::SELECT_CC, DL, True.getValueType(),
980
4.46k
                   LHS, RHS, True, False, getCondCode(Cond));
981
4.46k
  }
982
983
  /// VAArg produces a result and token chain, and takes a pointer
984
  /// and a source value as input.
985
  SDValue getVAArg(EVT VT, const SDLoc &dl, SDValue Chain, SDValue Ptr,
986
                   SDValue SV, unsigned Align);
987
988
  /// Gets a node for an atomic cmpxchg op. There are two
989
  /// valid Opcodes. ISD::ATOMIC_CMO_SWAP produces the value loaded and a
990
  /// chain result. ISD::ATOMIC_CMP_SWAP_WITH_SUCCESS produces the value loaded,
991
  /// a success flag (initially i1), and a chain.
992
  SDValue getAtomicCmpSwap(unsigned Opcode, const SDLoc &dl, EVT MemVT,
993
                           SDVTList VTs, SDValue Chain, SDValue Ptr,
994
                           SDValue Cmp, SDValue Swp, MachinePointerInfo PtrInfo,
995
                           unsigned Alignment, AtomicOrdering SuccessOrdering,
996
                           AtomicOrdering FailureOrdering,
997
                           SyncScope::ID SSID);
998
  SDValue getAtomicCmpSwap(unsigned Opcode, const SDLoc &dl, EVT MemVT,
999
                           SDVTList VTs, SDValue Chain, SDValue Ptr,
1000
                           SDValue Cmp, SDValue Swp, MachineMemOperand *MMO);
1001
1002
  /// Gets a node for an atomic op, produces result (if relevant)
1003
  /// and chain and takes 2 operands.
1004
  SDValue getAtomic(unsigned Opcode, const SDLoc &dl, EVT MemVT, SDValue Chain,
1005
                    SDValue Ptr, SDValue Val, const Value *PtrVal,
1006
                    unsigned Alignment, AtomicOrdering Ordering,
1007
                    SyncScope::ID SSID);
1008
  SDValue getAtomic(unsigned Opcode, const SDLoc &dl, EVT MemVT, SDValue Chain,
1009
                    SDValue Ptr, SDValue Val, MachineMemOperand *MMO);
1010
1011
  /// Gets a node for an atomic op, produces result and chain and
1012
  /// takes 1 operand.
1013
  SDValue getAtomic(unsigned Opcode, const SDLoc &dl, EVT MemVT, EVT VT,
1014
                    SDValue Chain, SDValue Ptr, MachineMemOperand *MMO);
1015
1016
  /// Gets a node for an atomic op, produces result and chain and takes N
1017
  /// operands.
1018
  SDValue getAtomic(unsigned Opcode, const SDLoc &dl, EVT MemVT,
1019
                    SDVTList VTList, ArrayRef<SDValue> Ops,
1020
                    MachineMemOperand *MMO);
1021
1022
  /// Creates a MemIntrinsicNode that may produce a
1023
  /// result and takes a list of operands. Opcode may be INTRINSIC_VOID,
1024
  /// INTRINSIC_W_CHAIN, or a target-specific opcode with a value not
1025
  /// less than FIRST_TARGET_MEMORY_OPCODE.
1026
  SDValue getMemIntrinsicNode(
1027
    unsigned Opcode, const SDLoc &dl, SDVTList VTList,
1028
    ArrayRef<SDValue> Ops, EVT MemVT,
1029
    MachinePointerInfo PtrInfo,
1030
    unsigned Align = 0,
1031
    MachineMemOperand::Flags Flags
1032
    = MachineMemOperand::MOLoad | MachineMemOperand::MOStore,
1033
    unsigned Size = 0);
1034
1035
  SDValue getMemIntrinsicNode(unsigned Opcode, const SDLoc &dl, SDVTList VTList,
1036
                              ArrayRef<SDValue> Ops, EVT MemVT,
1037
                              MachineMemOperand *MMO);
1038
1039
  /// Create a MERGE_VALUES node from the given operands.
1040
  SDValue getMergeValues(ArrayRef<SDValue> Ops, const SDLoc &dl);
1041
1042
  /// Loads are not normal binary operators: their result type is not
1043
  /// determined by their operands, and they produce a value AND a token chain.
1044
  ///
1045
  /// This function will set the MOLoad flag on MMOFlags, but you can set it if
1046
  /// you want.  The MOStore flag must not be set.
1047
  SDValue getLoad(EVT VT, const SDLoc &dl, SDValue Chain, SDValue Ptr,
1048
                  MachinePointerInfo PtrInfo, unsigned Alignment = 0,
1049
                  MachineMemOperand::Flags MMOFlags = MachineMemOperand::MONone,
1050
                  const AAMDNodes &AAInfo = AAMDNodes(),
1051
                  const MDNode *Ranges = nullptr);
1052
  SDValue getLoad(EVT VT, const SDLoc &dl, SDValue Chain, SDValue Ptr,
1053
                  MachineMemOperand *MMO);
1054
  SDValue
1055
  getExtLoad(ISD::LoadExtType ExtType, const SDLoc &dl, EVT VT, SDValue Chain,
1056
             SDValue Ptr, MachinePointerInfo PtrInfo, EVT MemVT,
1057
             unsigned Alignment = 0,
1058
             MachineMemOperand::Flags MMOFlags = MachineMemOperand::MONone,
1059
             const AAMDNodes &AAInfo = AAMDNodes());
1060
  SDValue getExtLoad(ISD::LoadExtType ExtType, const SDLoc &dl, EVT VT,
1061
                     SDValue Chain, SDValue Ptr, EVT MemVT,
1062
                     MachineMemOperand *MMO);
1063
  SDValue getIndexedLoad(SDValue OrigLoad, const SDLoc &dl, SDValue Base,
1064
                         SDValue Offset, ISD::MemIndexedMode AM);
1065
  SDValue getLoad(ISD::MemIndexedMode AM, ISD::LoadExtType ExtType, EVT VT,
1066
                  const SDLoc &dl, SDValue Chain, SDValue Ptr, SDValue Offset,
1067
                  MachinePointerInfo PtrInfo, EVT MemVT, unsigned Alignment = 0,
1068
                  MachineMemOperand::Flags MMOFlags = MachineMemOperand::MONone,
1069
                  const AAMDNodes &AAInfo = AAMDNodes(),
1070
                  const MDNode *Ranges = nullptr);
1071
  SDValue getLoad(ISD::MemIndexedMode AM, ISD::LoadExtType ExtType, EVT VT,
1072
                  const SDLoc &dl, SDValue Chain, SDValue Ptr, SDValue Offset,
1073
                  EVT MemVT, MachineMemOperand *MMO);
1074
1075
  /// Helper function to build ISD::STORE nodes.
1076
  ///
1077
  /// This function will set the MOStore flag on MMOFlags, but you can set it if
1078
  /// you want.  The MOLoad and MOInvariant flags must not be set.
1079
  SDValue
1080
  getStore(SDValue Chain, const SDLoc &dl, SDValue Val, SDValue Ptr,
1081
           MachinePointerInfo PtrInfo, unsigned Alignment = 0,
1082
           MachineMemOperand::Flags MMOFlags = MachineMemOperand::MONone,
1083
           const AAMDNodes &AAInfo = AAMDNodes());
1084
  SDValue getStore(SDValue Chain, const SDLoc &dl, SDValue Val, SDValue Ptr,
1085
                   MachineMemOperand *MMO);
1086
  SDValue
1087
  getTruncStore(SDValue Chain, const SDLoc &dl, SDValue Val, SDValue Ptr,
1088
                MachinePointerInfo PtrInfo, EVT SVT, unsigned Alignment = 0,
1089
                MachineMemOperand::Flags MMOFlags = MachineMemOperand::MONone,
1090
                const AAMDNodes &AAInfo = AAMDNodes());
1091
  SDValue getTruncStore(SDValue Chain, const SDLoc &dl, SDValue Val,
1092
                        SDValue Ptr, EVT SVT, MachineMemOperand *MMO);
1093
  SDValue getIndexedStore(SDValue OrigStore, const SDLoc &dl, SDValue Base,
1094
                          SDValue Offset, ISD::MemIndexedMode AM);
1095
1096
  /// Returns sum of the base pointer and offset.
1097
  SDValue getMemBasePlusOffset(SDValue Base, unsigned Offset, const SDLoc &DL);
1098
1099
  SDValue getMaskedLoad(EVT VT, const SDLoc &dl, SDValue Chain, SDValue Ptr,
1100
                        SDValue Mask, SDValue Src0, EVT MemVT,
1101
                        MachineMemOperand *MMO, ISD::LoadExtType,
1102
                        bool IsExpanding = false);
1103
  SDValue getMaskedStore(SDValue Chain, const SDLoc &dl, SDValue Val,
1104
                         SDValue Ptr, SDValue Mask, EVT MemVT,
1105
                         MachineMemOperand *MMO, bool IsTruncating = false,
1106
                         bool IsCompressing = false);
1107
  SDValue getMaskedGather(SDVTList VTs, EVT VT, const SDLoc &dl,
1108
                          ArrayRef<SDValue> Ops, MachineMemOperand *MMO);
1109
  SDValue getMaskedScatter(SDVTList VTs, EVT VT, const SDLoc &dl,
1110
                           ArrayRef<SDValue> Ops, MachineMemOperand *MMO);
1111
1112
  /// Return (create a new or find existing) a target-specific node.
1113
  /// TargetMemSDNode should be derived class from MemSDNode.
1114
  template <class TargetMemSDNode>
1115
  SDValue getTargetMemSDNode(SDVTList VTs, ArrayRef<SDValue> Ops,
1116
                             const SDLoc &dl, EVT MemVT,
1117
                             MachineMemOperand *MMO);
1118
1119
  /// Construct a node to track a Value* through the backend.
1120
  SDValue getSrcValue(const Value *v);
1121
1122
  /// Return an MDNodeSDNode which holds an MDNode.
1123
  SDValue getMDNode(const MDNode *MD);
1124
1125
  /// Return a bitcast using the SDLoc of the value operand, and casting to the
1126
  /// provided type. Use getNode to set a custom SDLoc.
1127
  SDValue getBitcast(EVT VT, SDValue V);
1128
1129
  /// Return an AddrSpaceCastSDNode.
1130
  SDValue getAddrSpaceCast(const SDLoc &dl, EVT VT, SDValue Ptr, unsigned SrcAS,
1131
                           unsigned DestAS);
1132
1133
  /// Return the specified value casted to
1134
  /// the target's desired shift amount type.
1135
  SDValue getShiftAmountOperand(EVT LHSTy, SDValue Op);
1136
1137
  /// Expand the specified \c ISD::VAARG node as the Legalize pass would.
1138
  SDValue expandVAArg(SDNode *Node);
1139
1140
  /// Expand the specified \c ISD::VACOPY node as the Legalize pass would.
1141
  SDValue expandVACopy(SDNode *Node);
1142
1143
  /// *Mutate* the specified node in-place to have the
1144
  /// specified operands.  If the resultant node already exists in the DAG,
1145
  /// this does not modify the specified node, instead it returns the node that
1146
  /// already exists.  If the resultant node does not exist in the DAG, the
1147
  /// input node is returned.  As a degenerate case, if you specify the same
1148
  /// input operands as the node already has, the input node is returned.
1149
  SDNode *UpdateNodeOperands(SDNode *N, SDValue Op);
1150
  SDNode *UpdateNodeOperands(SDNode *N, SDValue Op1, SDValue Op2);
1151
  SDNode *UpdateNodeOperands(SDNode *N, SDValue Op1, SDValue Op2,
1152
                               SDValue Op3);
1153
  SDNode *UpdateNodeOperands(SDNode *N, SDValue Op1, SDValue Op2,
1154
                               SDValue Op3, SDValue Op4);
1155
  SDNode *UpdateNodeOperands(SDNode *N, SDValue Op1, SDValue Op2,
1156
                               SDValue Op3, SDValue Op4, SDValue Op5);
1157
  SDNode *UpdateNodeOperands(SDNode *N, ArrayRef<SDValue> Ops);
1158
1159
  /// *Mutate* the specified machine node's memory references to the provided
1160
  /// list.
1161
  void setNodeMemRefs(MachineSDNode *N,
1162
                      ArrayRef<MachineMemOperand *> NewMemRefs);
1163
1164
  // Propagates the change in divergence to users
1165
  void updateDivergence(SDNode * N);
1166
1167
  /// These are used for target selectors to *mutate* the
1168
  /// specified node to have the specified return type, Target opcode, and
1169
  /// operands.  Note that target opcodes are stored as
1170
  /// ~TargetOpcode in the node opcode field.  The resultant node is returned.
1171
  SDNode *SelectNodeTo(SDNode *N, unsigned MachineOpc, EVT VT);
1172
  SDNode *SelectNodeTo(SDNode *N, unsigned MachineOpc, EVT VT, SDValue Op1);
1173
  SDNode *SelectNodeTo(SDNode *N, unsigned MachineOpc, EVT VT,
1174
                       SDValue Op1, SDValue Op2);
1175
  SDNode *SelectNodeTo(SDNode *N, unsigned MachineOpc, EVT VT,
1176
                       SDValue Op1, SDValue Op2, SDValue Op3);
1177
  SDNode *SelectNodeTo(SDNode *N, unsigned MachineOpc, EVT VT,
1178
                       ArrayRef<SDValue> Ops);
1179
  SDNode *SelectNodeTo(SDNode *N, unsigned MachineOpc, EVT VT1, EVT VT2);
1180
  SDNode *SelectNodeTo(SDNode *N, unsigned MachineOpc, EVT VT1,
1181
                       EVT VT2, ArrayRef<SDValue> Ops);
1182
  SDNode *SelectNodeTo(SDNode *N, unsigned MachineOpc, EVT VT1,
1183
                       EVT VT2, EVT VT3, ArrayRef<SDValue> Ops);
1184
  SDNode *SelectNodeTo(SDNode *N, unsigned TargetOpc, EVT VT1,
1185
                       EVT VT2, SDValue Op1);
1186
  SDNode *SelectNodeTo(SDNode *N, unsigned MachineOpc, EVT VT1,
1187
                       EVT VT2, SDValue Op1, SDValue Op2);
1188
  SDNode *SelectNodeTo(SDNode *N, unsigned MachineOpc, SDVTList VTs,
1189
                       ArrayRef<SDValue> Ops);
1190
1191
  /// This *mutates* the specified node to have the specified
1192
  /// return type, opcode, and operands.
1193
  SDNode *MorphNodeTo(SDNode *N, unsigned Opc, SDVTList VTs,
1194
                      ArrayRef<SDValue> Ops);
1195
1196
  /// Mutate the specified strict FP node to its non-strict equivalent,
1197
  /// unlinking the node from its chain and dropping the metadata arguments.
1198
  /// The node must be a strict FP node.
1199
  SDNode *mutateStrictFPToFP(SDNode *Node);
1200
1201
  /// These are used for target selectors to create a new node
1202
  /// with specified return type(s), MachineInstr opcode, and operands.
1203
  ///
1204
  /// Note that getMachineNode returns the resultant node.  If there is already
1205
  /// a node of the specified opcode and operands, it returns that node instead
1206
  /// of the current one.
1207
  MachineSDNode *getMachineNode(unsigned Opcode, const SDLoc &dl, EVT VT);
1208
  MachineSDNode *getMachineNode(unsigned Opcode, const SDLoc &dl, EVT VT,
1209
                                SDValue Op1);
1210
  MachineSDNode *getMachineNode(unsigned Opcode, const SDLoc &dl, EVT VT,
1211
                                SDValue Op1, SDValue Op2);
1212
  MachineSDNode *getMachineNode(unsigned Opcode, const SDLoc &dl, EVT VT,
1213
                                SDValue Op1, SDValue Op2, SDValue Op3);
1214
  MachineSDNode *getMachineNode(unsigned Opcode, const SDLoc &dl, EVT VT,
1215
                                ArrayRef<SDValue> Ops);
1216
  MachineSDNode *getMachineNode(unsigned Opcode, const SDLoc &dl, EVT VT1,
1217
                                EVT VT2, SDValue Op1, SDValue Op2);
1218
  MachineSDNode *getMachineNode(unsigned Opcode, const SDLoc &dl, EVT VT1,
1219
                                EVT VT2, SDValue Op1, SDValue Op2, SDValue Op3);
1220
  MachineSDNode *getMachineNode(unsigned Opcode, const SDLoc &dl, EVT VT1,
1221
                                EVT VT2, ArrayRef<SDValue> Ops);
1222
  MachineSDNode *getMachineNode(unsigned Opcode, const SDLoc &dl, EVT VT1,
1223
                                EVT VT2, EVT VT3, SDValue Op1, SDValue Op2);
1224
  MachineSDNode *getMachineNode(unsigned Opcode, const SDLoc &dl, EVT VT1,
1225
                                EVT VT2, EVT VT3, SDValue Op1, SDValue Op2,
1226
                                SDValue Op3);
1227
  MachineSDNode *getMachineNode(unsigned Opcode, const SDLoc &dl, EVT VT1,
1228
                                EVT VT2, EVT VT3, ArrayRef<SDValue> Ops);
1229
  MachineSDNode *getMachineNode(unsigned Opcode, const SDLoc &dl,
1230
                                ArrayRef<EVT> ResultTys, ArrayRef<SDValue> Ops);
1231
  MachineSDNode *getMachineNode(unsigned Opcode, const SDLoc &dl, SDVTList VTs,
1232
                                ArrayRef<SDValue> Ops);
1233
1234
  /// A convenience function for creating TargetInstrInfo::EXTRACT_SUBREG nodes.
1235
  SDValue getTargetExtractSubreg(int SRIdx, const SDLoc &DL, EVT VT,
1236
                                 SDValue Operand);
1237
1238
  /// A convenience function for creating TargetInstrInfo::INSERT_SUBREG nodes.
1239
  SDValue getTargetInsertSubreg(int SRIdx, const SDLoc &DL, EVT VT,
1240
                                SDValue Operand, SDValue Subreg);
1241
1242
  /// Get the specified node if it's already available, or else return NULL.
1243
  SDNode *getNodeIfExists(unsigned Opcode, SDVTList VTList, ArrayRef<SDValue> Ops,
1244
                          const SDNodeFlags Flags = SDNodeFlags());
1245
1246
  /// Creates a SDDbgValue node.
1247
  SDDbgValue *getDbgValue(DIVariable *Var, DIExpression *Expr, SDNode *N,
1248
                          unsigned R, bool IsIndirect, const DebugLoc &DL,
1249
                          unsigned O);
1250
1251
  /// Creates a constant SDDbgValue node.
1252
  SDDbgValue *getConstantDbgValue(DIVariable *Var, DIExpression *Expr,
1253
                                  const Value *C, const DebugLoc &DL,
1254
                                  unsigned O);
1255
1256
  /// Creates a FrameIndex SDDbgValue node.
1257
  SDDbgValue *getFrameIndexDbgValue(DIVariable *Var, DIExpression *Expr,
1258
                                    unsigned FI, bool IsIndirect,
1259
                                    const DebugLoc &DL, unsigned O);
1260
1261
  /// Creates a VReg SDDbgValue node.
1262
  SDDbgValue *getVRegDbgValue(DIVariable *Var, DIExpression *Expr,
1263
                              unsigned VReg, bool IsIndirect,
1264
                              const DebugLoc &DL, unsigned O);
1265
1266
  /// Creates a SDDbgLabel node.
1267
  SDDbgLabel *getDbgLabel(DILabel *Label, const DebugLoc &DL, unsigned O);
1268
1269
  /// Transfer debug values from one node to another, while optionally
1270
  /// generating fragment expressions for split-up values. If \p InvalidateDbg
1271
  /// is set, debug values are invalidated after they are transferred.
1272
  void transferDbgValues(SDValue From, SDValue To, unsigned OffsetInBits = 0,
1273
                         unsigned SizeInBits = 0, bool InvalidateDbg = true);
1274
1275
  /// Remove the specified node from the system. If any of its
1276
  /// operands then becomes dead, remove them as well. Inform UpdateListener
1277
  /// for each node deleted.
1278
  void RemoveDeadNode(SDNode *N);
1279
1280
  /// This method deletes the unreachable nodes in the
1281
  /// given list, and any nodes that become unreachable as a result.
1282
  void RemoveDeadNodes(SmallVectorImpl<SDNode *> &DeadNodes);
1283
1284
  /// Modify anything using 'From' to use 'To' instead.
1285
  /// This can cause recursive merging of nodes in the DAG.  Use the first
1286
  /// version if 'From' is known to have a single result, use the second
1287
  /// if you have two nodes with identical results (or if 'To' has a superset
1288
  /// of the results of 'From'), use the third otherwise.
1289
  ///
1290
  /// These methods all take an optional UpdateListener, which (if not null) is
1291
  /// informed about nodes that are deleted and modified due to recursive
1292
  /// changes in the dag.
1293
  ///
1294
  /// These functions only replace all existing uses. It's possible that as
1295
  /// these replacements are being performed, CSE may cause the From node
1296
  /// to be given new uses. These new uses of From are left in place, and
1297
  /// not automatically transferred to To.
1298
  ///
1299
  void ReplaceAllUsesWith(SDValue From, SDValue To);
1300
  void ReplaceAllUsesWith(SDNode *From, SDNode *To);
1301
  void ReplaceAllUsesWith(SDNode *From, const SDValue *To);
1302
1303
  /// Replace any uses of From with To, leaving
1304
  /// uses of other values produced by From.getNode() alone.
1305
  void ReplaceAllUsesOfValueWith(SDValue From, SDValue To);
1306
1307
  /// Like ReplaceAllUsesOfValueWith, but for multiple values at once.
1308
  /// This correctly handles the case where
1309
  /// there is an overlap between the From values and the To values.
1310
  void ReplaceAllUsesOfValuesWith(const SDValue *From, const SDValue *To,
1311
                                  unsigned Num);
1312
1313
  /// If an existing load has uses of its chain, create a token factor node with
1314
  /// that chain and the new memory node's chain and update users of the old
1315
  /// chain to the token factor. This ensures that the new memory node will have
1316
  /// the same relative memory dependency position as the old load. Returns the
1317
  /// new merged load chain.
1318
  SDValue makeEquivalentMemoryOrdering(LoadSDNode *Old, SDValue New);
1319
1320
  /// Topological-sort the AllNodes list and a
1321
  /// assign a unique node id for each node in the DAG based on their
1322
  /// topological order. Returns the number of nodes.
1323
  unsigned AssignTopologicalOrder();
1324
1325
  /// Move node N in the AllNodes list to be immediately
1326
  /// before the given iterator Position. This may be used to update the
1327
  /// topological ordering when the list of nodes is modified.
1328
10.3k
  void RepositionNode(allnodes_iterator Position, SDNode *N) {
1329
10.3k
    AllNodes.insert(Position, AllNodes.remove(N));
1330
10.3k
  }
1331
1332
  /// Returns an APFloat semantics tag appropriate for the given type. If VT is
1333
  /// a vector type, the element semantics are returned.
1334
20.4k
  static const fltSemantics &EVTToAPFloatSemantics(EVT VT) {
1335
20.4k
    switch (VT.getScalarType().getSimpleVT().SimpleTy) {
1336
20.4k
    
default: 0
llvm_unreachable0
("Unknown FP format");
1337
20.4k
    
case MVT::f16: return APFloat::IEEEhalf()211
;
1338
20.4k
    
case MVT::f32: return APFloat::IEEEsingle()18.5k
;
1339
20.4k
    
case MVT::f64: return APFloat::IEEEdouble()1.42k
;
1340
20.4k
    
case MVT::f80: return APFloat::x87DoubleExtended()273
;
1341
20.4k
    
case MVT::f128: return APFloat::IEEEquad()30
;
1342
20.4k
    
case MVT::ppcf128: return APFloat::PPCDoubleDouble()2
;
1343
20.4k
    }
1344
20.4k
  }
1345
1346
  /// Add a dbg_value SDNode. If SD is non-null that means the
1347
  /// value is produced by SD.
1348
  void AddDbgValue(SDDbgValue *DB, SDNode *SD, bool isParameter);
1349
1350
  /// Add a dbg_label SDNode.
1351
  void AddDbgLabel(SDDbgLabel *DB);
1352
1353
  /// Get the debug values which reference the given SDNode.
1354
549
  ArrayRef<SDDbgValue*> GetDbgValues(const SDNode* SD) const {
1355
549
    return DbgInfo->getSDDbgValues(SD);
1356
549
  }
1357
1358
public:
1359
  /// Return true if there are any SDDbgValue nodes associated
1360
  /// with this SelectionDAG.
1361
1.78M
  bool hasDebugValues() const { return !DbgInfo->empty(); }
1362
1363
572
  SDDbgInfo::DbgIterator DbgBegin() { return DbgInfo->DbgBegin(); }
1364
572
  SDDbgInfo::DbgIterator DbgEnd()   { return DbgInfo->DbgEnd(); }
1365
1366
202
  SDDbgInfo::DbgIterator ByvalParmDbgBegin() {
1367
202
    return DbgInfo->ByvalParmDbgBegin();
1368
202
  }
1369
1370
202
  SDDbgInfo::DbgIterator ByvalParmDbgEnd()   {
1371
202
    return DbgInfo->ByvalParmDbgEnd();
1372
202
  }
1373
1374
286
  SDDbgInfo::DbgLabelIterator DbgLabelBegin() {
1375
286
    return DbgInfo->DbgLabelBegin();
1376
286
  }
1377
286
  SDDbgInfo::DbgLabelIterator DbgLabelEnd() {
1378
286
    return DbgInfo->DbgLabelEnd();
1379
286
  }
1380
1381
  /// To be invoked on an SDNode that is slated to be erased. This
1382
  /// function mirrors \c llvm::salvageDebugInfo.
1383
  void salvageDebugInfo(SDNode &N);
1384
1385
  void dump() const;
1386
1387
  /// Create a stack temporary, suitable for holding the specified value type.
1388
  /// If minAlign is specified, the slot size will have at least that alignment.
1389
  SDValue CreateStackTemporary(EVT VT, unsigned minAlign = 1);
1390
1391
  /// Create a stack temporary suitable for holding either of the specified
1392
  /// value types.
1393
  SDValue CreateStackTemporary(EVT VT1, EVT VT2);
1394
1395
  SDValue FoldSymbolOffset(unsigned Opcode, EVT VT,
1396
                           const GlobalAddressSDNode *GA,
1397
                           const SDNode *N2);
1398
1399
  SDValue FoldConstantArithmetic(unsigned Opcode, const SDLoc &DL, EVT VT,
1400
                                 SDNode *Cst1, SDNode *Cst2);
1401
1402
  SDValue FoldConstantArithmetic(unsigned Opcode, const SDLoc &DL, EVT VT,
1403
                                 const ConstantSDNode *Cst1,
1404
                                 const ConstantSDNode *Cst2);
1405
1406
  SDValue FoldConstantVectorArithmetic(unsigned Opcode, const SDLoc &DL, EVT VT,
1407
                                       ArrayRef<SDValue> Ops,
1408
                                       const SDNodeFlags Flags = SDNodeFlags());
1409
1410
  /// Constant fold a setcc to true or false.
1411
  SDValue FoldSetCC(EVT VT, SDValue N1, SDValue N2, ISD::CondCode Cond,
1412
                    const SDLoc &dl);
1413
1414
  /// See if the specified operand can be simplified with the knowledge that only
1415
  /// the bits specified by Mask are used.  If so, return the simpler operand,
1416
  /// otherwise return a null SDValue.
1417
  ///
1418
  /// (This exists alongside SimplifyDemandedBits because GetDemandedBits can
1419
  /// simplify nodes with multiple uses more aggressively.)
1420
  SDValue GetDemandedBits(SDValue V, const APInt &Mask);
1421
1422
  /// Return true if the sign bit of Op is known to be zero.
1423
  /// We use this predicate to simplify operations downstream.
1424
  bool SignBitIsZero(SDValue Op, unsigned Depth = 0) const;
1425
1426
  /// Return true if 'Op & Mask' is known to be zero.  We
1427
  /// use this predicate to simplify operations downstream.  Op and Mask are
1428
  /// known to be the same type.
1429
  bool MaskedValueIsZero(SDValue Op, const APInt &Mask, unsigned Depth = 0)
1430
    const;
1431
1432
  /// Determine which bits of Op are known to be either zero or one and return
1433
  /// them in Known. For vectors, the known bits are those that are shared by
1434
  /// every vector element.
1435
  /// Targets can implement the computeKnownBitsForTargetNode method in the
1436
  /// TargetLowering class to allow target nodes to be understood.
1437
  KnownBits computeKnownBits(SDValue Op, unsigned Depth = 0) const;
1438
1439
  /// Determine which bits of Op are known to be either zero or one and return
1440
  /// them in Known. The DemandedElts argument allows us to only collect the
1441
  /// known bits that are shared by the requested vector elements.
1442
  /// Targets can implement the computeKnownBitsForTargetNode method in the
1443
  /// TargetLowering class to allow target nodes to be understood.
1444
  KnownBits computeKnownBits(SDValue Op, const APInt &DemandedElts,
1445
                             unsigned Depth = 0) const;
1446
1447
  /// \copydoc SelectionDAG::computeKnownBits(SDValue,unsigned)
1448
  void computeKnownBits(SDValue Op, KnownBits &Known,
1449
18.0M
                        unsigned Depth = 0) const {
1450
18.0M
    Known = computeKnownBits(Op, Depth);
1451
18.0M
  }
1452
1453
  /// \copydoc SelectionDAG::computeKnownBits(SDValue,const APInt&,unsigned)
1454
  void computeKnownBits(SDValue Op, KnownBits &Known, const APInt &DemandedElts,
1455
240k
                        unsigned Depth = 0) const {
1456
240k
    Known = computeKnownBits(Op, DemandedElts, Depth);
1457
240k
  }
1458
1459
  /// Used to represent the possible overflow behavior of an operation.
1460
  /// Never: the operation cannot overflow.
1461
  /// Always: the operation will always overflow.
1462
  /// Sometime: the operation may or may not overflow.
1463
  enum OverflowKind {
1464
    OFK_Never,
1465
    OFK_Sometime,
1466
    OFK_Always,
1467
  };
1468
1469
  /// Determine if the result of the addition of 2 node can overflow.
1470
  OverflowKind computeOverflowKind(SDValue N0, SDValue N1) const;
1471
1472
  /// Test if the given value is known to have exactly one bit set. This differs
1473
  /// from computeKnownBits in that it doesn't necessarily determine which bit
1474
  /// is set.
1475
  bool isKnownToBeAPowerOfTwo(SDValue Val) const;
1476
1477
  /// Return the number of times the sign bit of the register is replicated into
1478
  /// the other bits. We know that at least 1 bit is always equal to the sign
1479
  /// bit (itself), but other cases can give us information. For example,
1480
  /// immediately after an "SRA X, 2", we know that the top 3 bits are all equal
1481
  /// to each other, so we return 3. Targets can implement the
1482
  /// ComputeNumSignBitsForTarget method in the TargetLowering class to allow
1483
  /// target nodes to be understood.
1484
  unsigned ComputeNumSignBits(SDValue Op, unsigned Depth = 0) const;
1485
1486
  /// Return the number of times the sign bit of the register is replicated into
1487
  /// the other bits. We know that at least 1 bit is always equal to the sign
1488
  /// bit (itself), but other cases can give us information. For example,
1489
  /// immediately after an "SRA X, 2", we know that the top 3 bits are all equal
1490
  /// to each other, so we return 3. The DemandedElts argument allows
1491
  /// us to only collect the minimum sign bits of the requested vector elements.
1492
  /// Targets can implement the ComputeNumSignBitsForTarget method in the
1493
  /// TargetLowering class to allow target nodes to be understood.
1494
  unsigned ComputeNumSignBits(SDValue Op, const APInt &DemandedElts,
1495
                              unsigned Depth = 0) const;
1496
1497
  /// Return true if the specified operand is an ISD::ADD with a ConstantSDNode
1498
  /// on the right-hand side, or if it is an ISD::OR with a ConstantSDNode that
1499
  /// is guaranteed to have the same semantics as an ADD. This handles the
1500
  /// equivalence:
1501
  ///     X|Cst == X+Cst iff X&Cst = 0.
1502
  bool isBaseWithConstantOffset(SDValue Op) const;
1503
1504
  /// Test whether the given SDValue is known to never be NaN. If \p SNaN is
1505
  /// true, returns if \p Op is known to never be a signaling NaN (it may still
1506
  /// be a qNaN).
1507
  bool isKnownNeverNaN(SDValue Op, bool SNaN = false, unsigned Depth = 0) const;
1508
1509
  /// \returns true if \p Op is known to never be a signaling NaN.
1510
463
  bool isKnownNeverSNaN(SDValue Op, unsigned Depth = 0) const {
1511
463
    return isKnownNeverNaN(Op, true, Depth);
1512
463
  }
1513
1514
  /// Test whether the given floating point SDValue is known to never be
1515
  /// positive or negative zero.
1516
  bool isKnownNeverZeroFloat(SDValue Op) const;
1517
1518
  /// Test whether the given SDValue is known to contain non-zero value(s).
1519
  bool isKnownNeverZero(SDValue Op) const;
1520
1521
  /// Test whether two SDValues are known to compare equal. This
1522
  /// is true if they are the same value, or if one is negative zero and the
1523
  /// other positive zero.
1524
  bool isEqualTo(SDValue A, SDValue B) const;
1525
1526
  /// Return true if A and B have no common bits set. As an example, this can
1527
  /// allow an 'add' to be transformed into an 'or'.
1528
  bool haveNoCommonBitsSet(SDValue A, SDValue B) const;
1529
1530
  /// Match a binop + shuffle pyramid that represents a horizontal reduction
1531
  /// over the elements of a vector starting from the EXTRACT_VECTOR_ELT node /p
1532
  /// Extract. The reduction must use one of the opcodes listed in /p
1533
  /// CandidateBinOps and on success /p BinOp will contain the matching opcode.
1534
  /// Returns the vector that is being reduced on, or SDValue() if a reduction
1535
  /// was not matched.
1536
  SDValue matchBinOpReduction(SDNode *Extract, ISD::NodeType &BinOp,
1537
                              ArrayRef<ISD::NodeType> CandidateBinOps);
1538
1539
  /// Utility function used by legalize and lowering to
1540
  /// "unroll" a vector operation by splitting out the scalars and operating
1541
  /// on each element individually.  If the ResNE is 0, fully unroll the vector
1542
  /// op. If ResNE is less than the width of the vector op, unroll up to ResNE.
1543
  /// If the  ResNE is greater than the width of the vector op, unroll the
1544
  /// vector op and fill the end of the resulting vector with UNDEFS.
1545
  SDValue UnrollVectorOp(SDNode *N, unsigned ResNE = 0);
1546
1547
  /// Return true if loads are next to each other and can be
1548
  /// merged. Check that both are nonvolatile and if LD is loading
1549
  /// 'Bytes' bytes from a location that is 'Dist' units away from the
1550
  /// location that the 'Base' load is loading from.
1551
  bool areNonVolatileConsecutiveLoads(LoadSDNode *LD, LoadSDNode *Base,
1552
                                      unsigned Bytes, int Dist) const;
1553
1554
  /// Infer alignment of a load / store address. Return 0 if
1555
  /// it cannot be inferred.
1556
  unsigned InferPtrAlignment(SDValue Ptr) const;
1557
1558
  /// Compute the VTs needed for the low/hi parts of a type
1559
  /// which is split (or expanded) into two not necessarily identical pieces.
1560
  std::pair<EVT, EVT> GetSplitDestVTs(const EVT &VT) const;
1561
1562
  /// Split the vector with EXTRACT_SUBVECTOR using the provides
1563
  /// VTs and return the low/high part.
1564
  std::pair<SDValue, SDValue> SplitVector(const SDValue &N, const SDLoc &DL,
1565
                                          const EVT &LoVT, const EVT &HiVT);
1566
1567
  /// Split the vector with EXTRACT_SUBVECTOR and return the low/high part.
1568
18.5k
  std::pair<SDValue, SDValue> SplitVector(const SDValue &N, const SDLoc &DL) {
1569
18.5k
    EVT LoVT, HiVT;
1570
18.5k
    std::tie(LoVT, HiVT) = GetSplitDestVTs(N.getValueType());
1571
18.5k
    return SplitVector(N, DL, LoVT, HiVT);
1572
18.5k
  }
1573
1574
  /// Split the node's operand with EXTRACT_SUBVECTOR and
1575
  /// return the low/high part.
1576
  std::pair<SDValue, SDValue> SplitVectorOperand(const SDNode *N, unsigned OpNo)
1577
16.9k
  {
1578
16.9k
    return SplitVector(N->getOperand(OpNo), SDLoc(N));
1579
16.9k
  }
1580
1581
  /// Append the extracted elements from Start to Count out of the vector Op
1582
  /// in Args. If Count is 0, all of the elements will be extracted.
1583
  void ExtractVectorElements(SDValue Op, SmallVectorImpl<SDValue> &Args,
1584
                             unsigned Start = 0, unsigned Count = 0);
1585
1586
  /// Compute the default alignment value for the given type.
1587
  unsigned getEVTAlignment(EVT MemoryVT) const;
1588
1589
  /// Test whether the given value is a constant int or similar node.
1590
  SDNode *isConstantIntBuildVectorOrConstantInt(SDValue N);
1591
1592
  /// Test whether the given value is a constant FP or similar node.
1593
  SDNode *isConstantFPBuildVectorOrConstantFP(SDValue N);
1594
1595
  /// \returns true if \p N is any kind of constant or build_vector of
1596
  /// constants, int or float. If a vector, it may not necessarily be a splat.
1597
8.10k
  inline bool isConstantValueOfAnyType(SDValue N) {
1598
8.10k
    return isConstantIntBuildVectorOrConstantInt(N) ||
1599
8.10k
           
isConstantFPBuildVectorOrConstantFP(N)6.16k
;
1600
8.10k
  }
1601
1602
private:
1603
  void InsertNode(SDNode *N);
1604
  bool RemoveNodeFromCSEMaps(SDNode *N);
1605
  void AddModifiedNodeToCSEMaps(SDNode *N);
1606
  SDNode *FindModifiedNodeSlot(SDNode *N, SDValue Op, void *&InsertPos);
1607
  SDNode *FindModifiedNodeSlot(SDNode *N, SDValue Op1, SDValue Op2,
1608
                               void *&InsertPos);
1609
  SDNode *FindModifiedNodeSlot(SDNode *N, ArrayRef<SDValue> Ops,
1610
                               void *&InsertPos);
1611
  SDNode *UpdateSDLocOnMergeSDNode(SDNode *N, const SDLoc &loc);
1612
1613
  void DeleteNodeNotInCSEMaps(SDNode *N);
1614
  void DeallocateNode(SDNode *N);
1615
1616
  void allnodes_clear();
1617
1618
  /// Look up the node specified by ID in CSEMap.  If it exists, return it.  If
1619
  /// not, return the insertion token that will make insertion faster.  This
1620
  /// overload is for nodes other than Constant or ConstantFP, use the other one
1621
  /// for those.
1622
  SDNode *FindNodeOrInsertPos(const FoldingSetNodeID &ID, void *&InsertPos);
1623
1624
  /// Look up the node specified by ID in CSEMap.  If it exists, return it.  If
1625
  /// not, return the insertion token that will make insertion faster.  Performs
1626
  /// additional processing for constant nodes.
1627
  SDNode *FindNodeOrInsertPos(const FoldingSetNodeID &ID, const SDLoc &DL,
1628
                              void *&InsertPos);
1629
1630
  /// List of non-single value types.
1631
  FoldingSet<SDVTListNode> VTListMap;
1632
1633
  /// Maps to auto-CSE operations.
1634
  std::vector<CondCodeSDNode*> CondCodeNodes;
1635
1636
  std::vector<SDNode*> ValueTypeNodes;
1637
  std::map<EVT, SDNode*, EVT::compareRawBits> ExtendedValueTypeNodes;
1638
  StringMap<SDNode*> ExternalSymbols;
1639
1640
  std::map<std::pair<std::string, unsigned char>,SDNode*> TargetExternalSymbols;
1641
  DenseMap<MCSymbol *, SDNode *> MCSymbols;
1642
};
1643
1644
template <> struct GraphTraits<SelectionDAG*> : public GraphTraits<SDNode*> {
1645
  using nodes_iterator = pointer_iterator<SelectionDAG::allnodes_iterator>;
1646
1647
  static nodes_iterator nodes_begin(SelectionDAG *G) {
1648
    return nodes_iterator(G->allnodes_begin());
1649
  }
1650
1651
  static nodes_iterator nodes_end(SelectionDAG *G) {
1652
    return nodes_iterator(G->allnodes_end());
1653
  }
1654
};
1655
1656
template <class TargetMemSDNode>
1657
SDValue SelectionDAG::getTargetMemSDNode(SDVTList VTs,
1658
                                         ArrayRef<SDValue> Ops,
1659
                                         const SDLoc &dl, EVT MemVT,
1660
642
                                         MachineMemOperand *MMO) {
1661
642
  /// Compose node ID and try to find an existing node.
1662
642
  FoldingSetNodeID ID;
1663
642
  unsigned Opcode =
1664
642
    TargetMemSDNode(dl.getIROrder(), DebugLoc(), VTs, MemVT, MMO).getOpcode();
1665
642
  ID.AddInteger(Opcode);
1666
642
  ID.AddPointer(VTs.VTs);
1667
3.52k
  for (auto& Op : Ops) {
1668
3.52k
    ID.AddPointer(Op.getNode());
1669
3.52k
    ID.AddInteger(Op.getResNo());
1670
3.52k
  }
1671
642
  ID.AddInteger(MemVT.getRawBits());
1672
642
  ID.AddInteger(MMO->getPointerInfo().getAddrSpace());
1673
642
  ID.AddInteger(getSyntheticNodeSubclassData<TargetMemSDNode>(
1674
642
    dl.getIROrder(), VTs, MemVT, MMO));
1675
642
1676
642
  void *IP = nullptr;
1677
642
  if (SDNode *E = FindNodeOrInsertPos(ID, dl, IP)) {
1678
0
    cast<TargetMemSDNode>(E)->refineAlignment(MMO);
1679
0
    return SDValue(E, 0);
1680
0
  }
1681
642
1682
642
  /// Existing node was not found. Create a new one.
1683
642
  auto *N = newSDNode<TargetMemSDNode>(dl.getIROrder(), dl.getDebugLoc(), VTs,
1684
642
                                       MemVT, MMO);
1685
642
  createOperands(N, Ops);
1686
642
  CSEMap.InsertNode(N, IP);
1687
642
  InsertNode(N);
1688
642
  return SDValue(N, 0);
1689
642
}
llvm::SDValue llvm::SelectionDAG::getTargetMemSDNode<llvm::TruncSStoreSDNode>(llvm::SDVTList, llvm::ArrayRef<llvm::SDValue>, llvm::SDLoc const&, llvm::EVT, llvm::MachineMemOperand*)
Line
Count
Source
1660
37
                                         MachineMemOperand *MMO) {
1661
37
  /// Compose node ID and try to find an existing node.
1662
37
  FoldingSetNodeID ID;
1663
37
  unsigned Opcode =
1664
37
    TargetMemSDNode(dl.getIROrder(), DebugLoc(), VTs, MemVT, MMO).getOpcode();
1665
37
  ID.AddInteger(Opcode);
1666
37
  ID.AddPointer(VTs.VTs);
1667
148
  for (auto& Op : Ops) {
1668
148
    ID.AddPointer(Op.getNode());
1669
148
    ID.AddInteger(Op.getResNo());
1670
148
  }
1671
37
  ID.AddInteger(MemVT.getRawBits());
1672
37
  ID.AddInteger(MMO->getPointerInfo().getAddrSpace());
1673
37
  ID.AddInteger(getSyntheticNodeSubclassData<TargetMemSDNode>(
1674
37
    dl.getIROrder(), VTs, MemVT, MMO));
1675
37
1676
37
  void *IP = nullptr;
1677
37
  if (SDNode *E = FindNodeOrInsertPos(ID, dl, IP)) {
1678
0
    cast<TargetMemSDNode>(E)->refineAlignment(MMO);
1679
0
    return SDValue(E, 0);
1680
0
  }
1681
37
1682
37
  /// Existing node was not found. Create a new one.
1683
37
  auto *N = newSDNode<TargetMemSDNode>(dl.getIROrder(), dl.getDebugLoc(), VTs,
1684
37
                                       MemVT, MMO);
1685
37
  createOperands(N, Ops);
1686
37
  CSEMap.InsertNode(N, IP);
1687
37
  InsertNode(N);
1688
37
  return SDValue(N, 0);
1689
37
}
llvm::SDValue llvm::SelectionDAG::getTargetMemSDNode<llvm::TruncUSStoreSDNode>(llvm::SDVTList, llvm::ArrayRef<llvm::SDValue>, llvm::SDLoc const&, llvm::EVT, llvm::MachineMemOperand*)
Line
Count
Source
1660
64
                                         MachineMemOperand *MMO) {
1661
64
  /// Compose node ID and try to find an existing node.
1662
64
  FoldingSetNodeID ID;
1663
64
  unsigned Opcode =
1664
64
    TargetMemSDNode(dl.getIROrder(), DebugLoc(), VTs, MemVT, MMO).getOpcode();
1665
64
  ID.AddInteger(Opcode);
1666
64
  ID.AddPointer(VTs.VTs);
1667
256
  for (auto& Op : Ops) {
1668
256
    ID.AddPointer(Op.getNode());
1669
256
    ID.AddInteger(Op.getResNo());
1670
256
  }
1671
64
  ID.AddInteger(MemVT.getRawBits());
1672
64
  ID.AddInteger(MMO->getPointerInfo().getAddrSpace());
1673
64
  ID.AddInteger(getSyntheticNodeSubclassData<TargetMemSDNode>(
1674
64
    dl.getIROrder(), VTs, MemVT, MMO));
1675
64
1676
64
  void *IP = nullptr;
1677
64
  if (SDNode *E = FindNodeOrInsertPos(ID, dl, IP)) {
1678
0
    cast<TargetMemSDNode>(E)->refineAlignment(MMO);
1679
0
    return SDValue(E, 0);
1680
0
  }
1681
64
1682
64
  /// Existing node was not found. Create a new one.
1683
64
  auto *N = newSDNode<TargetMemSDNode>(dl.getIROrder(), dl.getDebugLoc(), VTs,
1684
64
                                       MemVT, MMO);
1685
64
  createOperands(N, Ops);
1686
64
  CSEMap.InsertNode(N, IP);
1687
64
  InsertNode(N);
1688
64
  return SDValue(N, 0);
1689
64
}
llvm::SDValue llvm::SelectionDAG::getTargetMemSDNode<llvm::MaskedTruncSStoreSDNode>(llvm::SDVTList, llvm::ArrayRef<llvm::SDValue>, llvm::SDLoc const&, llvm::EVT, llvm::MachineMemOperand*)
Line
Count
Source
1660
31
                                         MachineMemOperand *MMO) {
1661
31
  /// Compose node ID and try to find an existing node.
1662
31
  FoldingSetNodeID ID;
1663
31
  unsigned Opcode =
1664
31
    TargetMemSDNode(dl.getIROrder(), DebugLoc(), VTs, MemVT, MMO).getOpcode();
1665
31
  ID.AddInteger(Opcode);
1666
31
  ID.AddPointer(VTs.VTs);
1667
124
  for (auto& Op : Ops) {
1668
124
    ID.AddPointer(Op.getNode());
1669
124
    ID.AddInteger(Op.getResNo());
1670
124
  }
1671
31
  ID.AddInteger(MemVT.getRawBits());
1672
31
  ID.AddInteger(MMO->getPointerInfo().getAddrSpace());
1673
31
  ID.AddInteger(getSyntheticNodeSubclassData<TargetMemSDNode>(
1674
31
    dl.getIROrder(), VTs, MemVT, MMO));
1675
31
1676
31
  void *IP = nullptr;
1677
31
  if (SDNode *E = FindNodeOrInsertPos(ID, dl, IP)) {
1678
0
    cast<TargetMemSDNode>(E)->refineAlignment(MMO);
1679
0
    return SDValue(E, 0);
1680
0
  }
1681
31
1682
31
  /// Existing node was not found. Create a new one.
1683
31
  auto *N = newSDNode<TargetMemSDNode>(dl.getIROrder(), dl.getDebugLoc(), VTs,
1684
31
                                       MemVT, MMO);
1685
31
  createOperands(N, Ops);
1686
31
  CSEMap.InsertNode(N, IP);
1687
31
  InsertNode(N);
1688
31
  return SDValue(N, 0);
1689
31
}
llvm::SDValue llvm::SelectionDAG::getTargetMemSDNode<llvm::MaskedTruncUSStoreSDNode>(llvm::SDVTList, llvm::ArrayRef<llvm::SDValue>, llvm::SDLoc const&, llvm::EVT, llvm::MachineMemOperand*)
Line
Count
Source
1660
31
                                         MachineMemOperand *MMO) {
1661
31
  /// Compose node ID and try to find an existing node.
1662
31
  FoldingSetNodeID ID;
1663
31
  unsigned Opcode =
1664
31
    TargetMemSDNode(dl.getIROrder(), DebugLoc(), VTs, MemVT, MMO).getOpcode();
1665
31
  ID.AddInteger(Opcode);
1666
31
  ID.AddPointer(VTs.VTs);
1667
124
  for (auto& Op : Ops) {
1668
124
    ID.AddPointer(Op.getNode());
1669
124
    ID.AddInteger(Op.getResNo());
1670
124
  }
1671
31
  ID.AddInteger(MemVT.getRawBits());
1672
31
  ID.AddInteger(MMO->getPointerInfo().getAddrSpace());
1673
31
  ID.AddInteger(getSyntheticNodeSubclassData<TargetMemSDNode>(
1674
31
    dl.getIROrder(), VTs, MemVT, MMO));
1675
31
1676
31
  void *IP = nullptr;
1677
31
  if (SDNode *E = FindNodeOrInsertPos(ID, dl, IP)) {
1678
0
    cast<TargetMemSDNode>(E)->refineAlignment(MMO);
1679
0
    return SDValue(E, 0);
1680
0
  }
1681
31
1682
31
  /// Existing node was not found. Create a new one.
1683
31
  auto *N = newSDNode<TargetMemSDNode>(dl.getIROrder(), dl.getDebugLoc(), VTs,
1684
31
                                       MemVT, MMO);
1685
31
  createOperands(N, Ops);
1686
31
  CSEMap.InsertNode(N, IP);
1687
31
  InsertNode(N);
1688
31
  return SDValue(N, 0);
1689
31
}
llvm::SDValue llvm::SelectionDAG::getTargetMemSDNode<llvm::X86MaskedScatterSDNode>(llvm::SDVTList, llvm::ArrayRef<llvm::SDValue>, llvm::SDLoc const&, llvm::EVT, llvm::MachineMemOperand*)
Line
Count
Source
1660
124
                                         MachineMemOperand *MMO) {
1661
124
  /// Compose node ID and try to find an existing node.
1662
124
  FoldingSetNodeID ID;
1663
124
  unsigned Opcode =
1664
124
    TargetMemSDNode(dl.getIROrder(), DebugLoc(), VTs, MemVT, MMO).getOpcode();
1665
124
  ID.AddInteger(Opcode);
1666
124
  ID.AddPointer(VTs.VTs);
1667
744
  for (auto& Op : Ops) {
1668
744
    ID.AddPointer(Op.getNode());
1669
744
    ID.AddInteger(Op.getResNo());
1670
744
  }
1671
124
  ID.AddInteger(MemVT.getRawBits());
1672
124
  ID.AddInteger(MMO->getPointerInfo().getAddrSpace());
1673
124
  ID.AddInteger(getSyntheticNodeSubclassData<TargetMemSDNode>(
1674
124
    dl.getIROrder(), VTs, MemVT, MMO));
1675
124
1676
124
  void *IP = nullptr;
1677
124
  if (SDNode *E = FindNodeOrInsertPos(ID, dl, IP)) {
1678
0
    cast<TargetMemSDNode>(E)->refineAlignment(MMO);
1679
0
    return SDValue(E, 0);
1680
0
  }
1681
124
1682
124
  /// Existing node was not found. Create a new one.
1683
124
  auto *N = newSDNode<TargetMemSDNode>(dl.getIROrder(), dl.getDebugLoc(), VTs,
1684
124
                                       MemVT, MMO);
1685
124
  createOperands(N, Ops);
1686
124
  CSEMap.InsertNode(N, IP);
1687
124
  InsertNode(N);
1688
124
  return SDValue(N, 0);
1689
124
}
llvm::SDValue llvm::SelectionDAG::getTargetMemSDNode<llvm::X86MaskedGatherSDNode>(llvm::SDVTList, llvm::ArrayRef<llvm::SDValue>, llvm::SDLoc const&, llvm::EVT, llvm::MachineMemOperand*)
Line
Count
Source
1660
355
                                         MachineMemOperand *MMO) {
1661
355
  /// Compose node ID and try to find an existing node.
1662
355
  FoldingSetNodeID ID;
1663
355
  unsigned Opcode =
1664
355
    TargetMemSDNode(dl.getIROrder(), DebugLoc(), VTs, MemVT, MMO).getOpcode();
1665
355
  ID.AddInteger(Opcode);
1666
355
  ID.AddPointer(VTs.VTs);
1667
2.13k
  for (auto& Op : Ops) {
1668
2.13k
    ID.AddPointer(Op.getNode());
1669
2.13k
    ID.AddInteger(Op.getResNo());
1670
2.13k
  }
1671
355
  ID.AddInteger(MemVT.getRawBits());
1672
355
  ID.AddInteger(MMO->getPointerInfo().getAddrSpace());
1673
355
  ID.AddInteger(getSyntheticNodeSubclassData<TargetMemSDNode>(
1674
355
    dl.getIROrder(), VTs, MemVT, MMO));
1675
355
1676
355
  void *IP = nullptr;
1677
355
  if (SDNode *E = FindNodeOrInsertPos(ID, dl, IP)) {
1678
0
    cast<TargetMemSDNode>(E)->refineAlignment(MMO);
1679
0
    return SDValue(E, 0);
1680
0
  }
1681
355
1682
355
  /// Existing node was not found. Create a new one.
1683
355
  auto *N = newSDNode<TargetMemSDNode>(dl.getIROrder(), dl.getDebugLoc(), VTs,
1684
355
                                       MemVT, MMO);
1685
355
  createOperands(N, Ops);
1686
355
  CSEMap.InsertNode(N, IP);
1687
355
  InsertNode(N);
1688
355
  return SDValue(N, 0);
1689
355
}
1690
1691
} // end namespace llvm
1692
1693
#endif // LLVM_CODEGEN_SELECTIONDAG_H