LLVM 23.0.0git
LegalizeTypes.h
Go to the documentation of this file.
1//===-- LegalizeTypes.h - DAG Type Legalizer class definition ---*- C++ -*-===//
2//
3// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4// See https://llvm.org/LICENSE.txt for license information.
5// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6//
7//===----------------------------------------------------------------------===//
8//
9// This file defines the DAGTypeLegalizer class. This is a private interface
10// shared between the code that implements the SelectionDAG::LegalizeTypes
11// method.
12//
13//===----------------------------------------------------------------------===//
14
15#ifndef LLVM_LIB_CODEGEN_SELECTIONDAG_LEGALIZETYPES_H
16#define LLVM_LIB_CODEGEN_SELECTIONDAG_LEGALIZETYPES_H
17
18#include "MatchContext.h"
19#include "llvm/ADT/DenseMap.h"
20#include "llvm/CodeGen/SelectionDAG.h"
21#include "llvm/CodeGen/TargetLowering.h"
22#include "llvm/Support/Compiler.h"
23
24namespace llvm {
25
26//===----------------------------------------------------------------------===//
27/// This takes an arbitrary SelectionDAG as input and hacks on it until only
28/// value types the target machine can handle are left. This involves promoting
29/// small sizes to large sizes or splitting up large values into small values.
30///
31class LLVM_LIBRARY_VISIBILITY DAGTypeLegalizer {
32 const TargetLowering &TLI;
33 SelectionDAG &DAG;
34public:
35 /// This pass uses the NodeId on the SDNodes to hold information about the
36 /// state of the node. The enum has all the values.
37 enum NodeIdFlags {
38 /// All operands have been processed, so this node is ready to be handled.
39 ReadyToProcess = 0,
40
41 /// This is a new node, not before seen, that was created in the process of
42 /// legalizing some other node.
43 NewNode = -1,
44
45 /// This node's ID needs to be set to the number of its unprocessed
46 /// operands.
47 Unanalyzed = -2,
48
49 /// This is a node that has already been processed.
50 Processed = -3
51
52 // 1+ - This is a node which has this many unprocessed operands.
53 };
54private:
55
56 /// This is a bitvector that contains two bits for each simple value type,
57 /// where the two bits correspond to the LegalizeAction enum from
58 /// TargetLowering. This can be queried with "getTypeAction(VT)".
59 TargetLowering::ValueTypeActionImpl ValueTypeActions;
60
61 /// Return how we should legalize values of this type.
62 TargetLowering::LegalizeTypeAction getTypeAction(EVT VT) const {
63 return TLI.getTypeAction(*DAG.getContext(), VT);
64 }
65
66 /// Return true if this type is legal on this target.
67 bool isTypeLegal(EVT VT) const {
68 return TLI.getTypeAction(*DAG.getContext(), VT) == TargetLowering::TypeLegal;
69 }
70
71 /// Return true if this is a simple legal type.
72 bool isSimpleLegalType(EVT VT) const {
73 return VT.isSimple() && TLI.isTypeLegal(VT);
74 }
75
76 EVT getSetCCResultType(EVT VT) const {
77 return TLI.getSetCCResultType(DAG.getDataLayout(), *DAG.getContext(), VT);
78 }
79
80 /// Pretend all of this node's results are legal.
81 bool IgnoreNodeResults(SDNode *N) const {
82 return N->getOpcode() == ISD::TargetConstant ||
83 N->getOpcode() == ISD::Register;
84 }
85
86 // Bijection from SDValue to unique id. As each created node gets a
87 // new id we do not need to worry about reuse expunging. Should we
88 // run out of ids, we can do a one time expensive compactifcation.
89 typedef unsigned TableId;
90
91 TableId NextValueId = 1;
92
93 SmallDenseMap<SDValue, TableId, 8> ValueToIdMap;
94 SmallDenseMap<TableId, SDValue, 8> IdToValueMap;
95
96 /// For integer nodes that are below legal width, this map indicates what
97 /// promoted value to use.
98 SmallDenseMap<TableId, TableId, 8> PromotedIntegers;
99
100 /// For integer nodes that need to be expanded this map indicates which
101 /// operands are the expanded version of the input.
102 SmallDenseMap<TableId, std::pair<TableId, TableId>, 8> ExpandedIntegers;
103
104 /// For floating-point nodes converted to integers of the same size, this map
105 /// indicates the converted value to use.
106 SmallDenseMap<TableId, TableId, 8> SoftenedFloats;
107
108 /// For floating-point nodes that have a smaller precision than the smallest
109 /// supported precision, this map indicates what promoted value to use.
110 SmallDenseMap<TableId, TableId, 8> PromotedFloats;
111
112 /// For floating-point nodes that have a smaller precision than the smallest
113 /// supported precision, this map indicates the converted value to use.
114 SmallDenseMap<TableId, TableId, 8> SoftPromotedHalfs;
115
116 /// For float nodes that need to be expanded this map indicates which operands
117 /// are the expanded version of the input.
118 SmallDenseMap<TableId, std::pair<TableId, TableId>, 8> ExpandedFloats;
119
120 /// For nodes that are <1 x ty>, this map indicates the scalar value of type
121 /// 'ty' to use.
122 SmallDenseMap<TableId, TableId, 8> ScalarizedVectors;
123
124 /// For nodes that need to be split this map indicates which operands are the
125 /// expanded version of the input.
126 SmallDenseMap<TableId, std::pair<TableId, TableId>, 8> SplitVectors;
127
128 /// For vector nodes that need to be widened, indicates the widened value to
129 /// use.
130 SmallDenseMap<TableId, TableId, 8> WidenedVectors;
131
132 /// For values that have been replaced with another, indicates the replacement
133 /// value to use.
134 SmallDenseMap<TableId, TableId, 8> ReplacedValues;
135
136 /// This defines a worklist of nodes to process. In order to be pushed onto
137 /// this worklist, all operands of a node must have already been processed.
138 SmallVector<SDNode*, 128> Worklist;
139
140 TableId getTableId(SDValue V) {
141 assert(V.getNode() && "Getting TableId on SDValue()");
142
143 auto I = ValueToIdMap.find(V);
144 if (I != ValueToIdMap.end()) {
145 // replace if there's been a shift.
146 RemapId(I->second);
147 assert(I->second && "All Ids should be nonzero");
148 return I->second;
149 }
150 // Add if it's not there.
151 ValueToIdMap.insert(std::make_pair(V, NextValueId));
152 IdToValueMap.insert(std::make_pair(NextValueId, V));
153 ++NextValueId;
154 assert(NextValueId != 0 &&
155 "Ran out of Ids. Increase id type size or add compactification");
156 return NextValueId - 1;
157 }
158
159 const SDValue &getSDValue(TableId &Id) {
160 RemapId(Id);
161 assert(Id && "TableId should be non-zero");
162 auto I = IdToValueMap.find(Id);
163 assert(I != IdToValueMap.end() && "cannot find Id in map");
164 return I->second;
165 }
166
167public:
168 explicit DAGTypeLegalizer(SelectionDAG &dag)
169 : TLI(dag.getTargetLoweringInfo()), DAG(dag),
170 ValueTypeActions(TLI.getValueTypeActions()) {
171 }
172
173 /// This is the main entry point for the type legalizer. This does a
174 /// top-down traversal of the dag, legalizing types as it goes. Returns
175 /// "true" if it made any changes.
176 bool run();
177
178 void NoteDeletion(SDNode *Old, SDNode *New) {
179 assert(Old != New && "node replaced with self");
180 for (unsigned i = 0, e = Old->getNumValues(); i != e; ++i) {
181 TableId NewId = getTableId(SDValue(New, i));
182 TableId OldId = getTableId(SDValue(Old, i));
183
184 if (OldId != NewId) {
185 ReplacedValues[OldId] = NewId;
186
187 // Delete Node from tables. We cannot do this when OldId == NewId,
188 // because NewId can still have table references to it in
189 // ReplacedValues.
190 IdToValueMap.erase(OldId);
191 PromotedIntegers.erase(OldId);
192 ExpandedIntegers.erase(OldId);
193 SoftenedFloats.erase(OldId);
194 PromotedFloats.erase(OldId);
195 SoftPromotedHalfs.erase(OldId);
196 ExpandedFloats.erase(OldId);
197 ScalarizedVectors.erase(OldId);
198 SplitVectors.erase(OldId);
199 WidenedVectors.erase(OldId);
200 }
201
202 ValueToIdMap.erase(SDValue(Old, i));
203 }
204 }
205
206 SelectionDAG &getDAG() const { return DAG; }
207
208private:
209 SDNode *AnalyzeNewNode(SDNode *N);
210 void AnalyzeNewValue(SDValue &Val);
211 void PerformExpensiveChecks();
212 void RemapId(TableId &Id);
213 void RemapValue(SDValue &V);
214
215 // Common routines.
216 SDValue BitConvertToInteger(SDValue Op);
217 SDValue BitConvertVectorToIntegerVector(SDValue Op);
218 SDValue CreateStackStoreLoad(SDValue Op, EVT DestVT);
219 bool CustomLowerNode(SDNode *N, EVT VT, bool LegalizeResult);
220 bool CustomWidenLowerNode(SDNode *N, EVT VT);
221
222 /// Replace each result of the given MERGE_VALUES node with the corresponding
223 /// input operand, except for the result 'ResNo', for which the corresponding
224 /// input operand is returned.
225 SDValue DisintegrateMERGE_VALUES(SDNode *N, unsigned ResNo);
226
227 SDValue JoinIntegers(SDValue Lo, SDValue Hi);
228
229 std::pair<SDValue, SDValue> ExpandAtomic(SDNode *Node);
230
231 SDValue PromoteTargetBoolean(SDValue Bool, EVT ValVT);
232
233 void ReplaceValueWith(SDValue From, SDValue To);
234 void SplitInteger(SDValue Op, SDValue &Lo, SDValue &Hi);
235 void SplitInteger(SDValue Op, EVT LoVT, EVT HiVT,
236 SDValue &Lo, SDValue &Hi);
237
238 //===--------------------------------------------------------------------===//
239 // Integer Promotion Support: LegalizeIntegerTypes.cpp
240 //===--------------------------------------------------------------------===//
241
242 /// Given a processed operand Op which was promoted to a larger integer type,
243 /// this returns the promoted value. The low bits of the promoted value
244 /// corresponding to the original type are exactly equal to Op.
245 /// The extra bits contain rubbish, so the promoted value may need to be zero-
246 /// or sign-extended from the original type before it is usable (the helpers
247 /// SExtPromotedInteger and ZExtPromotedInteger can do this for you).
248 /// For example, if Op is an i16 and was promoted to an i32, then this method
249 /// returns an i32, the lower 16 bits of which coincide with Op, and the upper
250 /// 16 bits of which contain rubbish.
251 SDValue GetPromotedInteger(SDValue Op) {
252 TableId &PromotedId = PromotedIntegers[getTableId(Op)];
253 SDValue PromotedOp = getSDValue(PromotedId);
254 assert(PromotedOp.getNode() && "Operand wasn't promoted?");
255 return PromotedOp;
256 }
257 void SetPromotedInteger(SDValue Op, SDValue Result);
258
259 /// Get a promoted operand and sign extend it to the final size.
260 SDValue SExtPromotedInteger(SDValue Op) {
261 EVT OldVT = Op.getValueType();
262 SDLoc dl(Op);
263 Op = GetPromotedInteger(Op);
264 return DAG.getNode(ISD::SIGN_EXTEND_INREG, dl, Op.getValueType(), Op,
265 DAG.getValueType(OldVT));
266 }
267
268 /// Get a promoted operand and zero extend it to the final size.
269 SDValue ZExtPromotedInteger(SDValue Op) {
270 EVT OldVT = Op.getValueType();
271 SDLoc dl(Op);
272 Op = GetPromotedInteger(Op);
273 return DAG.getZeroExtendInReg(Op, dl, OldVT);
274 }
275
276 // Promote the given operand V (vector or scalar) according to N's specific
277 // reduction kind. N must be an integer VECREDUCE_* or VP_REDUCE_*. Returns
278 // the nominal extension opcode (ISD::(ANY|ZERO|SIGN)_EXTEND) and the
279 // promoted value.
280 SDValue PromoteIntOpVectorReduction(SDNode *N, SDValue V);
281
282 // Integer Result Promotion.
283 void PromoteIntegerResult(SDNode *N, unsigned ResNo);
284 SDValue PromoteIntRes_MERGE_VALUES(SDNode *N, unsigned ResNo);
285 SDValue PromoteIntRes_AssertSext(SDNode *N);
286 SDValue PromoteIntRes_AssertZext(SDNode *N);
287 SDValue PromoteIntRes_Atomic0(AtomicSDNode *N);
288 SDValue PromoteIntRes_Atomic1(AtomicSDNode *N);
289 SDValue PromoteIntRes_AtomicCmpSwap(AtomicSDNode *N, unsigned ResNo);
290 SDValue PromoteIntRes_EXTRACT_SUBVECTOR(SDNode *N);
291 SDValue PromoteIntRes_INSERT_SUBVECTOR(SDNode *N);
292 SDValue PromoteIntRes_VECTOR_REVERSE(SDNode *N);
293 SDValue PromoteIntRes_VECTOR_SHUFFLE(SDNode *N);
294 SDValue PromoteIntRes_VECTOR_SPLICE(SDNode *N);
295 SDValue PromoteIntRes_VECTOR_INTERLEAVE_DEINTERLEAVE(SDNode *N);
296 SDValue PromoteIntRes_BUILD_VECTOR(SDNode *N);
297 SDValue PromoteIntRes_ScalarOp(SDNode *N);
298 SDValue PromoteIntRes_STEP_VECTOR(SDNode *N);
299 SDValue PromoteIntRes_EXTEND_VECTOR_INREG(SDNode *N);
300 SDValue PromoteIntRes_INSERT_VECTOR_ELT(SDNode *N);
301 SDValue PromoteIntRes_CONCAT_VECTORS(SDNode *N);
302 SDValue PromoteIntRes_BITCAST(SDNode *N);
303 SDValue PromoteIntRes_BSWAP(SDNode *N);
304 SDValue PromoteIntRes_BITREVERSE(SDNode *N);
305 SDValue PromoteIntRes_BUILD_PAIR(SDNode *N);
306 SDValue PromoteIntRes_Constant(SDNode *N);
307 SDValue PromoteIntRes_CTLZ(SDNode *N);
308 SDValue PromoteIntRes_CTLS(SDNode *N);
309 SDValue PromoteIntRes_CTPOP_PARITY(SDNode *N);
310 SDValue PromoteIntRes_CTTZ(SDNode *N);
311 SDValue PromoteIntRes_VP_CttzElements(SDNode *N);
312 SDValue PromoteIntRes_EXTRACT_VECTOR_ELT(SDNode *N);
313 SDValue PromoteIntRes_FP_TO_XINT(SDNode *N);
314 SDValue PromoteIntRes_FP_TO_XINT_SAT(SDNode *N);
315 SDValue PromoteIntRes_FP_TO_FP16_BF16(SDNode *N);
316 SDValue PromoteIntRes_CONVERT_TO_ARBITRARY_FP(SDNode *N);
317 SDValue PromoteIntRes_STRICT_FP_TO_FP16_BF16(SDNode *N);
318 SDValue PromoteIntRes_XRINT(SDNode *N);
319 SDValue PromoteIntRes_FREEZE(SDNode *N);
320 SDValue PromoteIntRes_INT_EXTEND(SDNode *N);
321 SDValue PromoteIntRes_LOAD(LoadSDNode *N);
322 SDValue PromoteIntRes_VP_LOAD(VPLoadSDNode *N);
323 SDValue PromoteIntRes_MLOAD(MaskedLoadSDNode *N);
324 SDValue PromoteIntRes_MGATHER(MaskedGatherSDNode *N);
325 SDValue PromoteIntRes_VECTOR_COMPRESS(SDNode *N);
326 SDValue PromoteIntRes_Overflow(SDNode *N);
327 SDValue PromoteIntRes_FFREXP(SDNode *N);
328 SDValue PromoteIntRes_SADDSUBO(SDNode *N, unsigned ResNo);
329 SDValue PromoteIntRes_CMP(SDNode *N);
330 SDValue PromoteIntRes_Select(SDNode *N);
331 SDValue PromoteIntRes_SELECT_CC(SDNode *N);
332 SDValue PromoteIntRes_SETCC(SDNode *N);
333 SDValue PromoteIntRes_SHL(SDNode *N);
334 SDValue PromoteIntRes_SimpleIntBinOp(SDNode *N);
335 SDValue PromoteIntRes_ZExtIntBinOp(SDNode *N);
336 SDValue PromoteIntRes_SExtIntBinOp(SDNode *N);
337 SDValue PromoteIntRes_ZExtMaskedIntBinOp(SDNode *N);
338 SDValue PromoteIntRes_SExtMaskedIntBinOp(SDNode *N);
339 SDValue PromoteIntRes_UMINUMAX(SDNode *N);
340 SDValue PromoteIntRes_SIGN_EXTEND_INREG(SDNode *N);
341 SDValue PromoteIntRes_SRA(SDNode *N);
342 SDValue PromoteIntRes_SRL(SDNode *N);
343 SDValue PromoteIntRes_TRUNCATE(SDNode *N);
344 SDValue PromoteIntRes_UADDSUBO(SDNode *N, unsigned ResNo);
345 SDValue PromoteIntRes_UADDSUBO_CARRY(SDNode *N, unsigned ResNo);
346 SDValue PromoteIntRes_SADDSUBO_CARRY(SDNode *N, unsigned ResNo);
347 SDValue PromoteIntRes_UNDEF(SDNode *N);
348 SDValue PromoteIntRes_VAARG(SDNode *N);
349 SDValue PromoteIntRes_VSCALE(SDNode *N);
350 SDValue PromoteIntRes_XMULO(SDNode *N, unsigned ResNo);
351 template <class MatchContextClass>
352 SDValue PromoteIntRes_ADDSUBSHLSAT(SDNode *N);
353 SDValue PromoteIntRes_MULFIX(SDNode *N);
354 SDValue PromoteIntRes_DIVFIX(SDNode *N);
355 SDValue PromoteIntRes_GET_ROUNDING(SDNode *N);
356 SDValue PromoteIntRes_VECREDUCE(SDNode *N);
357 SDValue PromoteIntRes_VP_REDUCE(SDNode *N);
358 SDValue PromoteIntRes_ABS(SDNode *N);
359 SDValue PromoteIntRes_Rotate(SDNode *N);
360 SDValue PromoteIntRes_FunnelShift(SDNode *N);
361 SDValue PromoteIntRes_VPFunnelShift(SDNode *N);
362 SDValue PromoteIntRes_CLMUL(SDNode *N);
363 SDValue PromoteIntRes_PEXT(SDNode *N);
364 SDValue PromoteIntRes_PDEP(SDNode *N);
365 SDValue PromoteIntRes_IS_FPCLASS(SDNode *N);
366 SDValue PromoteIntRes_PATCHPOINT(SDNode *N);
367 SDValue PromoteIntRes_READ_REGISTER(SDNode *N);
368 SDValue PromoteIntRes_VECTOR_FIND_LAST_ACTIVE(SDNode *N);
369 SDValue PromoteIntRes_GET_ACTIVE_LANE_MASK(SDNode *N);
370 SDValue PromoteIntRes_PARTIAL_REDUCE_MLA(SDNode *N);
371 SDValue PromoteIntRes_LOOP_DEPENDENCE_MASK(SDNode *N);
372
373 // Integer Operand Promotion.
374 bool PromoteIntegerOperand(SDNode *N, unsigned OpNo);
375 SDValue PromoteIntOp_ANY_EXTEND(SDNode *N);
376 SDValue PromoteIntOp_ANY_EXTEND_VECTOR_INREG(SDNode *N);
377 SDValue PromoteIntOp_ATOMIC_STORE(AtomicSDNode *N);
378 SDValue PromoteIntOp_BITCAST(SDNode *N);
379 SDValue PromoteIntOp_BUILD_PAIR(SDNode *N);
380 SDValue PromoteIntOp_BR_CC(SDNode *N, unsigned OpNo);
381 SDValue PromoteIntOp_BRCOND(SDNode *N, unsigned OpNo);
382 SDValue PromoteIntOp_COND_LOOP(SDNode *N, unsigned OpNo);
383 SDValue PromoteIntOp_BUILD_VECTOR(SDNode *N);
384 SDValue PromoteIntOp_INSERT_VECTOR_ELT(SDNode *N, unsigned OpNo);
385 SDValue PromoteIntOp_EXTRACT_VECTOR_ELT(SDNode *N);
386 SDValue PromoteIntOp_EXTRACT_SUBVECTOR(SDNode *N);
387 SDValue PromoteIntOp_INSERT_SUBVECTOR(SDNode *N);
388 SDValue PromoteIntOp_FAKE_USE(SDNode *N);
389 SDValue PromoteIntOp_CONCAT_VECTORS(SDNode *N);
390 SDValue PromoteIntOp_ScalarOp(SDNode *N);
391 SDValue PromoteIntOp_SELECT(SDNode *N, unsigned OpNo);
392 SDValue PromoteIntOp_SELECT_CC(SDNode *N, unsigned OpNo);
393 SDValue PromoteIntOp_SETCC(SDNode *N, unsigned OpNo);
394 SDValue PromoteIntOp_Shift(SDNode *N);
395 SDValue PromoteIntOp_CMP(SDNode *N);
396 SDValue PromoteIntOp_FunnelShift(SDNode *N);
397 SDValue PromoteIntOp_SIGN_EXTEND(SDNode *N);
398 SDValue PromoteIntOp_VP_SIGN_EXTEND(SDNode *N);
399 SDValue PromoteIntOp_SINT_TO_FP(SDNode *N);
400 SDValue PromoteIntOp_STRICT_SINT_TO_FP(SDNode *N);
401 SDValue PromoteIntOp_STORE(StoreSDNode *N, unsigned OpNo);
402 SDValue PromoteIntOp_TRUNCATE(SDNode *N);
403 SDValue PromoteIntOp_UINT_TO_FP(SDNode *N);
404 SDValue PromoteIntOp_STRICT_UINT_TO_FP(SDNode *N);
405 SDValue PromoteIntOp_CONVERT_FROM_ARBITRARY_FP(SDNode *N);
406 SDValue PromoteIntOp_ZERO_EXTEND(SDNode *N);
407 SDValue PromoteIntOp_VP_ZERO_EXTEND(SDNode *N);
408 SDValue PromoteIntOp_MSTORE(MaskedStoreSDNode *N, unsigned OpNo);
409 SDValue PromoteIntOp_MLOAD(MaskedLoadSDNode *N, unsigned OpNo);
410 SDValue PromoteIntOp_MSCATTER(MaskedScatterSDNode *N, unsigned OpNo);
411 SDValue PromoteIntOp_MGATHER(MaskedGatherSDNode *N, unsigned OpNo);
412 SDValue PromoteIntOp_VECTOR_COMPRESS(SDNode *N, unsigned OpNo);
413 SDValue PromoteIntOp_FRAMERETURNADDR(SDNode *N);
414 SDValue PromoteIntOp_FIX(SDNode *N);
415 SDValue PromoteIntOp_ExpOp(SDNode *N);
416 SDValue PromoteIntOp_VECREDUCE(SDNode *N);
417 SDValue PromoteIntOp_VP_REDUCE(SDNode *N, unsigned OpNo);
418 SDValue PromoteIntOp_VP_STORE(VPStoreSDNode *N, unsigned OpNo);
419 SDValue PromoteIntOp_SET_ROUNDING(SDNode *N);
420 SDValue PromoteIntOp_STACKMAP(SDNode *N, unsigned OpNo);
421 SDValue PromoteIntOp_PATCHPOINT(SDNode *N, unsigned OpNo);
422 SDValue PromoteIntOp_WRITE_REGISTER(SDNode *N, unsigned OpNo);
423 SDValue PromoteIntOp_VP_STRIDED(SDNode *N, unsigned OpNo);
424 SDValue PromoteIntOp_VP_SPLICE(SDNode *N, unsigned OpNo);
425 SDValue PromoteIntOp_VECTOR_HISTOGRAM(SDNode *N, unsigned OpNo);
426 SDValue PromoteIntOp_UnaryBooleanVectorOp(SDNode *N, unsigned OpNo);
427 SDValue PromoteIntOp_GET_ACTIVE_LANE_MASK(SDNode *N);
428 SDValue PromoteIntOp_PARTIAL_REDUCE_MLA(SDNode *N);
429 SDValue PromoteIntOp_LOOP_DEPENDENCE_MASK(SDNode *N);
430 SDValue PromoteIntOp_MaskedBinOp(SDNode *N, unsigned OpNo);
431
432 void SExtOrZExtPromotedOperands(SDValue &LHS, SDValue &RHS);
433 void PromoteSetCCOperands(SDValue &LHS,SDValue &RHS, ISD::CondCode Code);
434
435 //===--------------------------------------------------------------------===//
436 // Integer Expansion Support: LegalizeIntegerTypes.cpp
437 //===--------------------------------------------------------------------===//
438
439 /// Given a processed operand Op which was expanded into two integers of half
440 /// the size, this returns the two halves. The low bits of Op are exactly
441 /// equal to the bits of Lo; the high bits exactly equal Hi.
442 /// For example, if Op is an i64 which was expanded into two i32's, then this
443 /// method returns the two i32's, with Lo being equal to the lower 32 bits of
444 /// Op, and Hi being equal to the upper 32 bits.
445 void GetExpandedInteger(SDValue Op, SDValue &Lo, SDValue &Hi);
446 void SetExpandedInteger(SDValue Op, SDValue Lo, SDValue Hi);
447
448 // Integer Result Expansion.
449 void ExpandIntegerResult(SDNode *N, unsigned ResNo);
450 void ExpandIntRes_ANY_EXTEND (SDNode *N, SDValue &Lo, SDValue &Hi);
451 void ExpandIntRes_AssertSext (SDNode *N, SDValue &Lo, SDValue &Hi);
452 void ExpandIntRes_AssertZext (SDNode *N, SDValue &Lo, SDValue &Hi);
453 void ExpandIntRes_Constant (SDNode *N, SDValue &Lo, SDValue &Hi);
454 void ExpandIntRes_ABS (SDNode *N, SDValue &Lo, SDValue &Hi);
455 void ExpandIntRes_ABD (SDNode *N, SDValue &Lo, SDValue &Hi);
456 void ExpandIntRes_CTLZ (SDNode *N, SDValue &Lo, SDValue &Hi);
457 void ExpandIntRes_CTLS (SDNode *N, SDValue &Lo, SDValue &Hi);
458 void ExpandIntRes_CTPOP (SDNode *N, SDValue &Lo, SDValue &Hi);
459 void ExpandIntRes_CTTZ (SDNode *N, SDValue &Lo, SDValue &Hi);
460 void ExpandIntRes_LOAD (LoadSDNode *N, SDValue &Lo, SDValue &Hi);
461 void ExpandIntRes_READCOUNTER (SDNode *N, SDValue &Lo, SDValue &Hi);
462 void ExpandIntRes_SIGN_EXTEND (SDNode *N, SDValue &Lo, SDValue &Hi);
463 void ExpandIntRes_SIGN_EXTEND_INREG (SDNode *N, SDValue &Lo, SDValue &Hi);
464 void ExpandIntRes_TRUNCATE (SDNode *N, SDValue &Lo, SDValue &Hi);
465 void ExpandIntRes_ZERO_EXTEND (SDNode *N, SDValue &Lo, SDValue &Hi);
466 void ExpandIntRes_GET_ROUNDING (SDNode *N, SDValue &Lo, SDValue &Hi);
467 void ExpandIntRes_FP_TO_XINT (SDNode *N, SDValue &Lo, SDValue &Hi);
468 void ExpandIntRes_FP_TO_XINT_SAT (SDNode *N, SDValue &Lo, SDValue &Hi);
469 void ExpandIntRes_XROUND_XRINT (SDNode *N, SDValue &Lo, SDValue &Hi);
470
471 void ExpandIntRes_Logical (SDNode *N, SDValue &Lo, SDValue &Hi);
472 void ExpandIntRes_ADDSUB (SDNode *N, SDValue &Lo, SDValue &Hi);
473 void ExpandIntRes_ADDSUBC (SDNode *N, SDValue &Lo, SDValue &Hi);
474 void ExpandIntRes_ADDSUBE (SDNode *N, SDValue &Lo, SDValue &Hi);
475 void ExpandIntRes_UADDSUBO_CARRY (SDNode *N, SDValue &Lo, SDValue &Hi);
476 void ExpandIntRes_SADDSUBO_CARRY (SDNode *N, SDValue &Lo, SDValue &Hi);
477 void ExpandIntRes_BITREVERSE (SDNode *N, SDValue &Lo, SDValue &Hi);
478 void ExpandIntRes_BSWAP (SDNode *N, SDValue &Lo, SDValue &Hi);
479 void ExpandIntRes_PARITY (SDNode *N, SDValue &Lo, SDValue &Hi);
480 void ExpandIntRes_MUL (SDNode *N, SDValue &Lo, SDValue &Hi);
481 void ExpandIntRes_SDIV (SDNode *N, SDValue &Lo, SDValue &Hi);
482 void ExpandIntRes_SREM (SDNode *N, SDValue &Lo, SDValue &Hi);
483 void ExpandIntRes_UDIV (SDNode *N, SDValue &Lo, SDValue &Hi);
484 void ExpandIntRes_UREM (SDNode *N, SDValue &Lo, SDValue &Hi);
485 void ExpandIntRes_ShiftThroughStack (SDNode *N, SDValue &Lo, SDValue &Hi);
486 void ExpandIntRes_Shift (SDNode *N, SDValue &Lo, SDValue &Hi);
487
488 void ExpandIntRes_MINMAX (SDNode *N, SDValue &Lo, SDValue &Hi);
489
490 void ExpandIntRes_CMP (SDNode *N, SDValue &Lo, SDValue &Hi);
491 void ExpandIntRes_SETCC (SDNode *N, SDValue &Lo, SDValue &Hi);
492
493 void ExpandIntRes_SADDSUBO (SDNode *N, SDValue &Lo, SDValue &Hi);
494 void ExpandIntRes_UADDSUBO (SDNode *N, SDValue &Lo, SDValue &Hi);
495 void ExpandIntRes_XMULO (SDNode *N, SDValue &Lo, SDValue &Hi);
496 void ExpandIntRes_AVG (SDNode *N, SDValue &Lo, SDValue &Hi);
497 void ExpandIntRes_ADDSUBSAT (SDNode *N, SDValue &Lo, SDValue &Hi);
498 void ExpandIntRes_SHLSAT (SDNode *N, SDValue &Lo, SDValue &Hi);
499 void ExpandIntRes_MULFIX (SDNode *N, SDValue &Lo, SDValue &Hi);
500 void ExpandIntRes_DIVFIX (SDNode *N, SDValue &Lo, SDValue &Hi);
501
502 void ExpandIntRes_ATOMIC_LOAD (SDNode *N, SDValue &Lo, SDValue &Hi);
503 void ExpandIntRes_VECREDUCE (SDNode *N, SDValue &Lo, SDValue &Hi);
504
505 void ExpandIntRes_Rotate (SDNode *N, SDValue &Lo, SDValue &Hi);
506 void ExpandIntRes_FunnelShift (SDNode *N, SDValue &Lo, SDValue &Hi);
507 void ExpandIntRes_CLMUL(SDNode *N, SDValue &Lo, SDValue &Hi);
508 void ExpandIntRes_PEXT(SDNode *N, SDValue &Lo, SDValue &Hi);
509 void ExpandIntRes_PDEP(SDNode *N, SDValue &Lo, SDValue &Hi);
510
511 void ExpandIntRes_VSCALE (SDNode *N, SDValue &Lo, SDValue &Hi);
512 void ExpandIntRes_READ_REGISTER(SDNode *N, SDValue &Lo, SDValue &Hi);
513 void ExpandIntRes_CTTZ_ELTS(SDNode *N, SDValue &Lo, SDValue &Hi);
514
515 void ExpandShiftByConstant(SDNode *N, const APInt &Amt,
516 SDValue &Lo, SDValue &Hi);
517 bool ExpandShiftWithKnownAmountBit(SDNode *N, SDValue &Lo, SDValue &Hi);
518 bool ExpandShiftWithUnknownAmountBit(SDNode *N, SDValue &Lo, SDValue &Hi);
519
520 // Integer Operand Expansion.
521 bool ExpandIntegerOperand(SDNode *N, unsigned OpNo);
522 SDValue ExpandIntOp_BR_CC(SDNode *N);
523 SDValue ExpandIntOp_SELECT_CC(SDNode *N);
524 SDValue ExpandIntOp_SETCC(SDNode *N);
525 SDValue ExpandIntOp_SETCCCARRY(SDNode *N);
526 SDValue ExpandIntOp_Shift(SDNode *N);
527 SDValue ExpandIntOp_CMP(SDNode *N);
528 SDValue ExpandIntOp_STORE(StoreSDNode *N, unsigned OpNo);
529 SDValue ExpandIntOp_TRUNCATE(SDNode *N);
530 SDValue ExpandIntOp_XINT_TO_FP(SDNode *N);
531 SDValue ExpandIntOp_RETURNADDR(SDNode *N);
532 SDValue ExpandIntOp_ATOMIC_STORE(SDNode *N);
533 SDValue ExpandIntOp_SPLAT_VECTOR(SDNode *N);
534 SDValue ExpandIntOp_STACKMAP(SDNode *N, unsigned OpNo);
535 SDValue ExpandIntOp_PATCHPOINT(SDNode *N, unsigned OpNo);
536 SDValue ExpandIntOp_VP_STRIDED(SDNode *N, unsigned OpNo);
537 SDValue ExpandIntOp_WRITE_REGISTER(SDNode *N, unsigned OpNo);
538
539 void IntegerExpandSetCCOperands(SDValue &NewLHS, SDValue &NewRHS,
540 ISD::CondCode &CCCode, const SDLoc &dl);
541
542 //===--------------------------------------------------------------------===//
543 // Float to Integer Conversion Support: LegalizeFloatTypes.cpp
544 //===--------------------------------------------------------------------===//
545
546 /// GetSoftenedFloat - Given a processed operand Op which was converted to an
547 /// integer of the same size, this returns the integer. The integer contains
548 /// exactly the same bits as Op - only the type changed. For example, if Op
549 /// is an f32 which was softened to an i32, then this method returns an i32,
550 /// the bits of which coincide with those of Op
551 SDValue GetSoftenedFloat(SDValue Op) {
552 TableId Id = getTableId(Op);
553 auto Iter = SoftenedFloats.find(Id);
554 if (Iter == SoftenedFloats.end()) {
555 assert(isSimpleLegalType(Op.getValueType()) &&
556 "Operand wasn't converted to integer?");
557 return Op;
558 }
559 SDValue SoftenedOp = getSDValue(Iter->second);
560 assert(SoftenedOp.getNode() && "Unconverted op in SoftenedFloats?");
561 return SoftenedOp;
562 }
563 void SetSoftenedFloat(SDValue Op, SDValue Result);
564
565 // Convert Float Results to Integer.
566 void SoftenFloatResult(SDNode *N, unsigned ResNo);
567 SDValue SoftenFloatRes_Unary(SDNode *N, RTLIB::Libcall LC);
568 bool SoftenFloatRes_UnaryWithTwoFPResults(
569 SDNode *N, RTLIB::Libcall LC, std::optional<unsigned> CallRetResNo = {});
570 SDValue SoftenFloatRes_Binary(SDNode *N, RTLIB::Libcall LC);
571 SDValue SoftenFloatRes_MERGE_VALUES(SDNode *N, unsigned ResNo);
572 SDValue SoftenFloatRes_ARITH_FENCE(SDNode *N);
573 SDValue SoftenFloatRes_BITCAST(SDNode *N);
574 SDValue SoftenFloatRes_BUILD_PAIR(SDNode *N);
575 SDValue SoftenFloatRes_ConstantFP(SDNode *N);
576 SDValue SoftenFloatRes_EXTRACT_ELEMENT(SDNode *N);
577 SDValue SoftenFloatRes_EXTRACT_VECTOR_ELT(SDNode *N, unsigned ResNo);
578 SDValue SoftenFloatRes_FABS(SDNode *N);
579 SDValue SoftenFloatRes_FACOS(SDNode *N);
580 SDValue SoftenFloatRes_FASIN(SDNode *N);
581 SDValue SoftenFloatRes_FATAN(SDNode *N);
582 SDValue SoftenFloatRes_FATAN2(SDNode *N);
583 SDValue SoftenFloatRes_FCANONICALIZE(SDNode *N);
584 SDValue SoftenFloatRes_FMINNUM(SDNode *N);
585 SDValue SoftenFloatRes_FMAXNUM(SDNode *N);
586 SDValue SoftenFloatRes_FMINIMUMNUM(SDNode *N);
587 SDValue SoftenFloatRes_FMAXIMUMNUM(SDNode *N);
588 SDValue SoftenFloatRes_FMINIMUM(SDNode *N);
589 SDValue SoftenFloatRes_FMAXIMUM(SDNode *N);
590 SDValue SoftenFloatRes_FADD(SDNode *N);
591 SDValue SoftenFloatRes_FCBRT(SDNode *N);
592 SDValue SoftenFloatRes_FCEIL(SDNode *N);
593 SDValue SoftenFloatRes_FCOPYSIGN(SDNode *N);
594 SDValue SoftenFloatRes_FCOS(SDNode *N);
595 SDValue SoftenFloatRes_FCOSH(SDNode *N);
596 SDValue SoftenFloatRes_FDIV(SDNode *N);
597 SDValue SoftenFloatRes_FEXP(SDNode *N);
598 SDValue SoftenFloatRes_FEXP2(SDNode *N);
599 SDValue SoftenFloatRes_FEXP10(SDNode *N);
600 SDValue SoftenFloatRes_FFLOOR(SDNode *N);
601 SDValue SoftenFloatRes_FLOG(SDNode *N);
602 SDValue SoftenFloatRes_FLOG2(SDNode *N);
603 SDValue SoftenFloatRes_FLOG10(SDNode *N);
604 SDValue SoftenFloatRes_FMA(SDNode *N);
605 SDValue SoftenFloatRes_FMUL(SDNode *N);
606 SDValue SoftenFloatRes_FNEARBYINT(SDNode *N);
607 SDValue SoftenFloatRes_FNEG(SDNode *N);
608 SDValue SoftenFloatRes_FP_EXTEND(SDNode *N);
609 SDValue SoftenFloatRes_FP16_TO_FP(SDNode *N);
610 SDValue SoftenFloatRes_BF16_TO_FP(SDNode *N);
611 SDValue SoftenFloatRes_FP_ROUND(SDNode *N);
612 SDValue SoftenFloatRes_FPOW(SDNode *N);
613 SDValue SoftenFloatRes_ExpOp(SDNode *N);
614 SDValue SoftenFloatRes_FFREXP(SDNode *N);
615 SDValue SoftenFloatRes_FSINCOS(SDNode *N);
616 SDValue SoftenFloatRes_FMODF(SDNode *N);
617 SDValue SoftenFloatRes_FREEZE(SDNode *N);
618 SDValue SoftenFloatRes_FREM(SDNode *N);
619 SDValue SoftenFloatRes_FRINT(SDNode *N);
620 SDValue SoftenFloatRes_FROUND(SDNode *N);
621 SDValue SoftenFloatRes_FROUNDEVEN(SDNode *N);
622 SDValue SoftenFloatRes_FSIN(SDNode *N);
623 SDValue SoftenFloatRes_FSINH(SDNode *N);
624 SDValue SoftenFloatRes_FSQRT(SDNode *N);
625 SDValue SoftenFloatRes_FSUB(SDNode *N);
626 SDValue SoftenFloatRes_FTAN(SDNode *N);
627 SDValue SoftenFloatRes_FTANH(SDNode *N);
628 SDValue SoftenFloatRes_FTRUNC(SDNode *N);
629 SDValue SoftenFloatRes_LOAD(SDNode *N);
630 SDValue SoftenFloatRes_ATOMIC_LOAD(SDNode *N);
631 SDValue SoftenFloatRes_SELECT(SDNode *N);
632 SDValue SoftenFloatRes_SELECT_CC(SDNode *N);
633 SDValue SoftenFloatRes_UNDEF(SDNode *N);
634 SDValue SoftenFloatRes_VAARG(SDNode *N);
635 SDValue SoftenFloatRes_XINT_TO_FP(SDNode *N);
636 SDValue SoftenFloatRes_VECREDUCE(SDNode *N);
637 SDValue SoftenFloatRes_VECREDUCE_SEQ(SDNode *N);
638
639 // Convert Float Operand to Integer.
640 bool SoftenFloatOperand(SDNode *N, unsigned OpNo);
641 SDValue SoftenFloatOp_Unary(SDNode *N, RTLIB::Libcall LC);
642 SDValue SoftenFloatOp_BITCAST(SDNode *N);
643 SDValue SoftenFloatOp_BR_CC(SDNode *N);
644 SDValue SoftenFloatOp_FP_ROUND(SDNode *N);
645 SDValue SoftenFloatOp_FP_TO_XINT(SDNode *N);
646 SDValue SoftenFloatOp_FP_TO_XINT_SAT(SDNode *N);
647 SDValue SoftenFloatOp_LROUND(SDNode *N);
648 SDValue SoftenFloatOp_LLROUND(SDNode *N);
649 SDValue SoftenFloatOp_LRINT(SDNode *N);
650 SDValue SoftenFloatOp_LLRINT(SDNode *N);
651 SDValue SoftenFloatOp_SELECT_CC(SDNode *N);
652 SDValue SoftenFloatOp_SETCC(SDNode *N);
653 SDValue SoftenFloatOp_STORE(SDNode *N, unsigned OpNo);
654 SDValue SoftenFloatOp_ATOMIC_STORE(SDNode *N, unsigned OpNo);
655 SDValue SoftenFloatOp_FCOPYSIGN(SDNode *N);
656 SDValue SoftenFloatOp_FAKE_USE(SDNode *N);
657 SDValue SoftenFloatOp_STACKMAP(SDNode *N, unsigned OpNo);
658 SDValue SoftenFloatOp_PATCHPOINT(SDNode *N, unsigned OpNo);
659
660 //===--------------------------------------------------------------------===//
661 // Float Expansion Support: LegalizeFloatTypes.cpp
662 //===--------------------------------------------------------------------===//
663
664 /// Given a processed operand Op which was expanded into two floating-point
665 /// values of half the size, this returns the two halves.
666 /// The low bits of Op are exactly equal to the bits of Lo; the high bits
667 /// exactly equal Hi. For example, if Op is a ppcf128 which was expanded
668 /// into two f64's, then this method returns the two f64's, with Lo being
669 /// equal to the lower 64 bits of Op, and Hi to the upper 64 bits.
670 void GetExpandedFloat(SDValue Op, SDValue &Lo, SDValue &Hi);
671 void SetExpandedFloat(SDValue Op, SDValue Lo, SDValue Hi);
672
673 // Float Result Expansion.
674 void ExpandFloatResult(SDNode *N, unsigned ResNo);
675 void ExpandFloatRes_ConstantFP(SDNode *N, SDValue &Lo, SDValue &Hi);
676 void ExpandFloatRes_Unary(SDNode *N, RTLIB::Libcall LC,
677 SDValue &Lo, SDValue &Hi);
678 void ExpandFloatRes_Binary(SDNode *N, RTLIB::Libcall LC,
679 SDValue &Lo, SDValue &Hi);
680 void ExpandFloatRes_UnaryWithTwoFPResults(
681 SDNode *N, RTLIB::Libcall LC, std::optional<unsigned> CallRetResNo = {});
682
683 // clang-format off
684 void ExpandFloatRes_AssertNoFPClass(SDNode *N, SDValue &Lo, SDValue &Hi);
685 void ExpandFloatRes_FABS (SDNode *N, SDValue &Lo, SDValue &Hi);
686 void ExpandFloatRes_FACOS (SDNode *N, SDValue &Lo, SDValue &Hi);
687 void ExpandFloatRes_FASIN (SDNode *N, SDValue &Lo, SDValue &Hi);
688 void ExpandFloatRes_FATAN (SDNode *N, SDValue &Lo, SDValue &Hi);
689 void ExpandFloatRes_FATAN2 (SDNode *N, SDValue &Lo, SDValue &Hi);
690 void ExpandFloatRes_FMINNUM (SDNode *N, SDValue &Lo, SDValue &Hi);
691 void ExpandFloatRes_FMAXNUM (SDNode *N, SDValue &Lo, SDValue &Hi);
692 void ExpandFloatRes_FMINIMUMNUM(SDNode *N, SDValue &Lo, SDValue &Hi);
693 void ExpandFloatRes_FMAXIMUMNUM(SDNode *N, SDValue &Lo, SDValue &Hi);
694 void ExpandFloatRes_FADD (SDNode *N, SDValue &Lo, SDValue &Hi);
695 void ExpandFloatRes_FCBRT (SDNode *N, SDValue &Lo, SDValue &Hi);
696 void ExpandFloatRes_FCEIL (SDNode *N, SDValue &Lo, SDValue &Hi);
697 void ExpandFloatRes_FCOPYSIGN (SDNode *N, SDValue &Lo, SDValue &Hi);
698 void ExpandFloatRes_FCOS (SDNode *N, SDValue &Lo, SDValue &Hi);
699 void ExpandFloatRes_FCOSH (SDNode *N, SDValue &Lo, SDValue &Hi);
700 void ExpandFloatRes_FDIV (SDNode *N, SDValue &Lo, SDValue &Hi);
701 void ExpandFloatRes_FEXP (SDNode *N, SDValue &Lo, SDValue &Hi);
702 void ExpandFloatRes_FEXP2 (SDNode *N, SDValue &Lo, SDValue &Hi);
703 void ExpandFloatRes_FEXP10 (SDNode *N, SDValue &Lo, SDValue &Hi);
704 void ExpandFloatRes_FFLOOR (SDNode *N, SDValue &Lo, SDValue &Hi);
705 void ExpandFloatRes_FLOG (SDNode *N, SDValue &Lo, SDValue &Hi);
706 void ExpandFloatRes_FLOG2 (SDNode *N, SDValue &Lo, SDValue &Hi);
707 void ExpandFloatRes_FLOG10 (SDNode *N, SDValue &Lo, SDValue &Hi);
708 void ExpandFloatRes_FMA (SDNode *N, SDValue &Lo, SDValue &Hi);
709 void ExpandFloatRes_FMUL (SDNode *N, SDValue &Lo, SDValue &Hi);
710 void ExpandFloatRes_FNEARBYINT(SDNode *N, SDValue &Lo, SDValue &Hi);
711 void ExpandFloatRes_FNEG (SDNode *N, SDValue &Lo, SDValue &Hi);
712 void ExpandFloatRes_FP_EXTEND (SDNode *N, SDValue &Lo, SDValue &Hi);
713 void ExpandFloatRes_FPOW (SDNode *N, SDValue &Lo, SDValue &Hi);
714 void ExpandFloatRes_FPOWI (SDNode *N, SDValue &Lo, SDValue &Hi);
715 void ExpandFloatRes_FLDEXP (SDNode *N, SDValue &Lo, SDValue &Hi);
716 void ExpandFloatRes_FREEZE (SDNode *N, SDValue &Lo, SDValue &Hi);
717 void ExpandFloatRes_FREM (SDNode *N, SDValue &Lo, SDValue &Hi);
718 void ExpandFloatRes_FRINT (SDNode *N, SDValue &Lo, SDValue &Hi);
719 void ExpandFloatRes_FROUND (SDNode *N, SDValue &Lo, SDValue &Hi);
720 void ExpandFloatRes_FROUNDEVEN(SDNode *N, SDValue &Lo, SDValue &Hi);
721 void ExpandFloatRes_FSIN (SDNode *N, SDValue &Lo, SDValue &Hi);
722 void ExpandFloatRes_FSINH (SDNode *N, SDValue &Lo, SDValue &Hi);
723 void ExpandFloatRes_FSQRT (SDNode *N, SDValue &Lo, SDValue &Hi);
724 void ExpandFloatRes_FSUB (SDNode *N, SDValue &Lo, SDValue &Hi);
725 void ExpandFloatRes_FTAN (SDNode *N, SDValue &Lo, SDValue &Hi);
726 void ExpandFloatRes_FTANH (SDNode *N, SDValue &Lo, SDValue &Hi);
727 void ExpandFloatRes_FTRUNC (SDNode *N, SDValue &Lo, SDValue &Hi);
728 void ExpandFloatRes_LOAD (SDNode *N, SDValue &Lo, SDValue &Hi);
729 void ExpandFloatRes_XINT_TO_FP(SDNode *N, SDValue &Lo, SDValue &Hi);
730 void ExpandFloatRes_FMODF(SDNode *N);
731 void ExpandFloatRes_FSINCOS(SDNode* N);
732 void ExpandFloatRes_FSINCOSPI(SDNode* N);
733 // clang-format on
734
735 // Float Operand Expansion.
736 bool ExpandFloatOperand(SDNode *N, unsigned OpNo);
737 SDValue ExpandFloatOp_BR_CC(SDNode *N);
738 SDValue ExpandFloatOp_FCOPYSIGN(SDNode *N);
739 SDValue ExpandFloatOp_FP_ROUND(SDNode *N);
740 SDValue ExpandFloatOp_FP_TO_XINT(SDNode *N);
741 SDValue ExpandFloatOp_LROUND(SDNode *N);
742 SDValue ExpandFloatOp_LLROUND(SDNode *N);
743 SDValue ExpandFloatOp_LRINT(SDNode *N);
744 SDValue ExpandFloatOp_LLRINT(SDNode *N);
745 SDValue ExpandFloatOp_SELECT_CC(SDNode *N);
746 SDValue ExpandFloatOp_SETCC(SDNode *N);
747 SDValue ExpandFloatOp_STORE(SDNode *N, unsigned OpNo);
748
749 void FloatExpandSetCCOperands(SDValue &NewLHS, SDValue &NewRHS,
750 ISD::CondCode &CCCode, const SDLoc &dl,
751 SDValue &Chain, bool IsSignaling = false);
752
753 //===--------------------------------------------------------------------===//
754 // Float promotion support: LegalizeFloatTypes.cpp
755 //===--------------------------------------------------------------------===//
756
757 SDValue GetPromotedFloat(SDValue Op) {
758 TableId &PromotedId = PromotedFloats[getTableId(Op)];
759 SDValue PromotedOp = getSDValue(PromotedId);
760 assert(PromotedOp.getNode() && "Operand wasn't promoted?");
761 return PromotedOp;
762 }
763 void SetPromotedFloat(SDValue Op, SDValue Result);
764
765 SDValue BitcastToInt_ATOMIC_SWAP(SDNode *N);
766
767 //===--------------------------------------------------------------------===//
768 // Half soft promotion support: LegalizeFloatTypes.cpp
769 //===--------------------------------------------------------------------===//
770
771 SDValue GetSoftPromotedHalf(SDValue Op) {
772 TableId &PromotedId = SoftPromotedHalfs[getTableId(Op)];
773 SDValue PromotedOp = getSDValue(PromotedId);
774 assert(PromotedOp.getNode() && "Operand wasn't promoted?");
775 return PromotedOp;
776 }
777 void SetSoftPromotedHalf(SDValue Op, SDValue Result);
778
779 void SoftPromoteHalfResult(SDNode *N, unsigned ResNo);
780 SDValue SoftPromoteHalfRes_ARITH_FENCE(SDNode *N);
781 SDValue SoftPromoteHalfRes_BinOp(SDNode *N);
782 SDValue SoftPromoteHalfRes_UnaryWithTwoFPResults(SDNode *N);
783 SDValue SoftPromoteHalfRes_BITCAST(SDNode *N);
784 SDValue SoftPromoteHalfRes_ConstantFP(SDNode *N);
785 SDValue SoftPromoteHalfRes_EXTRACT_VECTOR_ELT(SDNode *N);
786 SDValue SoftPromoteHalfRes_FCOPYSIGN(SDNode *N);
787 SDValue SoftPromoteHalfRes_FMAD(SDNode *N);
788 SDValue SoftPromoteHalfRes_ExpOp(SDNode *N);
789 SDValue SoftPromoteHalfRes_FFREXP(SDNode *N);
790 SDValue SoftPromoteHalfRes_FP_ROUND(SDNode *N);
791 SDValue SoftPromoteHalfRes_LOAD(SDNode *N);
792 SDValue SoftPromoteHalfRes_ATOMIC_LOAD(SDNode *N);
793 SDValue SoftPromoteHalfRes_SELECT(SDNode *N);
794 SDValue SoftPromoteHalfRes_SELECT_CC(SDNode *N);
795 SDValue SoftPromoteHalfRes_UnaryOp(SDNode *N);
796 SDValue SoftPromoteHalfRes_FABS(SDNode *N);
797 SDValue SoftPromoteHalfRes_FNEG(SDNode *N);
798 SDValue SoftPromoteHalfRes_AssertNoFPClass(SDNode *N);
799 SDValue SoftPromoteHalfRes_XINT_TO_FP(SDNode *N);
800 SDValue SoftPromoteHalfRes_CONVERT_FROM_ARBITRARY_FP(SDNode *N);
801 SDValue SoftPromoteHalfRes_UNDEF(SDNode *N);
802 SDValue SoftPromoteHalfRes_VECREDUCE(SDNode *N);
803 SDValue SoftPromoteHalfRes_VECREDUCE_SEQ(SDNode *N);
804
805 bool SoftPromoteHalfOperand(SDNode *N, unsigned OpNo);
806 SDValue SoftPromoteHalfOp_BITCAST(SDNode *N);
807 SDValue SoftPromoteHalfOp_FAKE_USE(SDNode *N, unsigned OpNo);
808 SDValue SoftPromoteHalfOp_FCOPYSIGN(SDNode *N, unsigned OpNo);
809 SDValue SoftPromoteHalfOp_FP_EXTEND(SDNode *N);
810 SDValue SoftPromoteHalfOp_Op0WithStrict(SDNode *N);
811 SDValue SoftPromoteHalfOp_FP_TO_XINT_SAT(SDNode *N);
812 SDValue SoftPromoteHalfOp_CONVERT_TO_ARBITRARY_FP(SDNode *N);
813 SDValue SoftPromoteHalfOp_SETCC(SDNode *N);
814 SDValue SoftPromoteHalfOp_SELECT_CC(SDNode *N, unsigned OpNo);
815 SDValue SoftPromoteHalfOp_BR_CC(SDNode *N);
816 SDValue SoftPromoteHalfOp_STORE(SDNode *N, unsigned OpNo);
817 SDValue SoftPromoteHalfOp_ATOMIC_STORE(SDNode *N, unsigned OpNo);
818 SDValue SoftPromoteHalfOp_STACKMAP(SDNode *N, unsigned OpNo);
819 SDValue SoftPromoteHalfOp_PATCHPOINT(SDNode *N, unsigned OpNo);
820
821 //===--------------------------------------------------------------------===//
822 // Scalarization Support: LegalizeVectorTypes.cpp
823 //===--------------------------------------------------------------------===//
824
825 /// Given a processed one-element vector Op which was scalarized to its
826 /// element type, this returns the element. For example, if Op is a v1i32,
827 /// Op = < i32 val >, this method returns val, an i32.
828 SDValue GetScalarizedVector(SDValue Op) {
829 TableId &ScalarizedId = ScalarizedVectors[getTableId(Op)];
830 SDValue ScalarizedOp = getSDValue(ScalarizedId);
831 assert(ScalarizedOp.getNode() && "Operand wasn't scalarized?");
832 return ScalarizedOp;
833 }
834 void SetScalarizedVector(SDValue Op, SDValue Result);
835
836 // Vector Result Scalarization: <1 x ty> -> ty.
837 void ScalarizeVectorResult(SDNode *N, unsigned ResNo);
838 SDValue ScalarizeVecRes_MERGE_VALUES(SDNode *N, unsigned ResNo);
839 SDValue ScalarizeVecRes_LOOP_DEPENDENCE_MASK(SDNode *N);
840 SDValue ScalarizeVecRes_BinOp(SDNode *N);
841 SDValue ScalarizeVecRes_MaskedBinOp(SDNode *N);
842 SDValue ScalarizeVecRes_CMP(SDNode *N);
843 SDValue ScalarizeVecRes_TernaryOp(SDNode *N);
844 SDValue ScalarizeVecRes_UnaryOp(SDNode *N);
845 SDValue ScalarizeVecRes_StrictFPOp(SDNode *N);
846 SDValue ScalarizeVecRes_OverflowOp(SDNode *N, unsigned ResNo);
847 SDValue ScalarizeVecRes_InregOp(SDNode *N);
848 SDValue ScalarizeVecRes_VecInregOp(SDNode *N);
849
850 SDValue ScalarizeVecRes_ADDRSPACECAST(SDNode *N);
851 SDValue ScalarizeVecRes_BITCAST(SDNode *N);
852 SDValue ScalarizeVecRes_BUILD_VECTOR(SDNode *N);
853 SDValue ScalarizeVecRes_EXTRACT_SUBVECTOR(SDNode *N);
854 SDValue ScalarizeVecRes_FP_ROUND(SDNode *N);
855 SDValue ScalarizeVecRes_CONVERT_FROM_ARBITRARY_FP(SDNode *N);
856 SDValue ScalarizeVecRes_CONVERT_TO_ARBITRARY_FP(SDNode *N);
857 SDValue ScalarizeVecRes_UnaryOpWithExtraInput(SDNode *N);
858 SDValue ScalarizeVecRes_INSERT_VECTOR_ELT(SDNode *N);
859 SDValue ScalarizeVecRes_LOAD(LoadSDNode *N);
860 SDValue ScalarizeVecRes_ATOMIC_LOAD(AtomicSDNode *N);
861 SDValue ScalarizeVecRes_SCALAR_TO_VECTOR(SDNode *N);
862 SDValue ScalarizeVecRes_VSELECT(SDNode *N);
863 SDValue ScalarizeVecRes_SELECT(SDNode *N);
864 SDValue ScalarizeVecRes_SELECT_CC(SDNode *N);
865 SDValue ScalarizeVecRes_SETCC(SDNode *N);
866 SDValue ScalarizeVecRes_UNDEF(SDNode *N);
867 SDValue ScalarizeVecRes_VECTOR_SHUFFLE(SDNode *N);
868 SDValue ScalarizeVecRes_FP_TO_XINT_SAT(SDNode *N);
869 SDValue ScalarizeVecRes_IS_FPCLASS(SDNode *N);
870
871 SDValue ScalarizeVecRes_FIX(SDNode *N);
872 SDValue ScalarizeVecRes_UnaryOpWithTwoResults(SDNode *N, unsigned ResNo);
873
874 // Vector Operand Scalarization: <1 x ty> -> ty.
875 bool ScalarizeVectorOperand(SDNode *N, unsigned OpNo);
876 SDValue ScalarizeVecOp_BITCAST(SDNode *N);
877 SDValue ScalarizeVecOp_UnaryOp(SDNode *N);
878 SDValue ScalarizeVecOp_UnaryOpWithExtraInput(SDNode *N);
879 SDValue ScalarizeVecOp_UnaryOp_StrictFP(SDNode *N);
880 SDValue ScalarizeVecOp_CONCAT_VECTORS(SDNode *N);
881 SDValue ScalarizeVecOp_INSERT_SUBVECTOR(SDNode *N, unsigned OpNo);
882 SDValue ScalarizeVecOp_EXTRACT_VECTOR_ELT(SDNode *N);
883 SDValue ScalarizeVecOp_VSELECT(SDNode *N);
884 SDValue ScalarizeVecOp_VSETCC(SDNode *N);
885 SDValue ScalarizeVecOp_VSTRICT_FSETCC(SDNode *N, unsigned OpNo);
886 SDValue ScalarizeVecOp_STORE(StoreSDNode *N, unsigned OpNo);
887 SDValue ScalarizeVecOp_ATOMIC_STORE(AtomicSDNode *N);
888 SDValue ScalarizeVecOp_FP_ROUND(SDNode *N, unsigned OpNo);
889 SDValue ScalarizeVecOp_STRICT_FP_ROUND(SDNode *N, unsigned OpNo);
890 SDValue ScalarizeVecOp_FP_EXTEND(SDNode *N);
891 SDValue ScalarizeVecOp_STRICT_FP_EXTEND(SDNode *N);
892 SDValue ScalarizeVecOp_VECREDUCE(SDNode *N);
893 SDValue ScalarizeVecOp_VECREDUCE_SEQ(SDNode *N);
894 SDValue ScalarizeVecOp_CMP(SDNode *N);
895 SDValue ScalarizeVecOp_FAKE_USE(SDNode *N);
896 SDValue ScalarizeVecOp_VECTOR_FIND_LAST_ACTIVE(SDNode *N);
897 SDValue ScalarizeVecOp_CTTZ_ELTS(SDNode *N);
898 SDValue ScalarizeVecOp_MaskedBinOp(SDNode *N, unsigned OpNo);
899
900 //===--------------------------------------------------------------------===//
901 // Vector Splitting Support: LegalizeVectorTypes.cpp
902 //===--------------------------------------------------------------------===//
903
904 /// Given a processed vector Op which was split into vectors of half the size,
905 /// this method returns the halves. The first elements of Op coincide with the
906 /// elements of Lo; the remaining elements of Op coincide with the elements of
907 /// Hi: Op is what you would get by concatenating Lo and Hi.
908 /// For example, if Op is a v8i32 that was split into two v4i32's, then this
909 /// method returns the two v4i32's, with Lo corresponding to the first 4
910 /// elements of Op, and Hi to the last 4 elements.
911 void GetSplitVector(SDValue Op, SDValue &Lo, SDValue &Hi);
912 void SetSplitVector(SDValue Op, SDValue Lo, SDValue Hi);
913
914 /// Split mask operator of a VP intrinsic.
915 std::pair<SDValue, SDValue> SplitMask(SDValue Mask);
916
917 /// Split mask operator of a VP intrinsic in a given location.
918 std::pair<SDValue, SDValue> SplitMask(SDValue Mask, const SDLoc &DL);
919
920 // Helper function for incrementing the pointer when splitting
921 // memory operations
922 void IncrementPointer(MemSDNode *N, EVT MemVT, MachinePointerInfo &MPI,
923 SDValue &Ptr, uint64_t *ScaledOffset = nullptr);
924
925 // Vector Result Splitting: <128 x ty> -> 2 x <64 x ty>.
926 void SplitVectorResult(SDNode *N, unsigned ResNo);
927 void SplitVecRes_BinOp(SDNode *N, SDValue &Lo, SDValue &Hi);
928 void SplitVecRes_MaskedBinOp(SDNode *N, SDValue &Lo, SDValue &Hi);
929 void SplitVecRes_TernaryOp(SDNode *N, SDValue &Lo, SDValue &Hi);
930 void SplitVecRes_CMP(SDNode *N, SDValue &Lo, SDValue &Hi);
931 void SplitVecRes_UnaryOp(SDNode *N, SDValue &Lo, SDValue &Hi);
932 void SplitVecRes_ADDRSPACECAST(SDNode *N, SDValue &Lo, SDValue &Hi);
933 void SplitVecRes_UnaryOpWithTwoResults(SDNode *N, unsigned ResNo, SDValue &Lo,
934 SDValue &Hi);
935 void SplitVecRes_ExtendOp(SDNode *N, SDValue &Lo, SDValue &Hi);
936 void SplitVecRes_InregOp(SDNode *N, SDValue &Lo, SDValue &Hi);
937 void SplitVecRes_ExtVecInRegOp(SDNode *N, SDValue &Lo, SDValue &Hi);
938 void SplitVecRes_StrictFPOp(SDNode *N, SDValue &Lo, SDValue &Hi);
939 void SplitVecRes_OverflowOp(SDNode *N, unsigned ResNo,
940 SDValue &Lo, SDValue &Hi);
941
942 void SplitVecRes_FIX(SDNode *N, SDValue &Lo, SDValue &Hi);
943
944 void SplitVecRes_BITCAST(SDNode *N, SDValue &Lo, SDValue &Hi);
945 void SplitVecRes_LOOP_DEPENDENCE_MASK(SDNode *N, SDValue &Lo, SDValue &Hi);
946 void SplitVecRes_BUILD_VECTOR(SDNode *N, SDValue &Lo, SDValue &Hi);
947 void SplitVecRes_CONCAT_VECTORS(SDNode *N, SDValue &Lo, SDValue &Hi);
948 void SplitVecRes_EXTRACT_SUBVECTOR(SDNode *N, SDValue &Lo, SDValue &Hi);
949 void SplitVecRes_INSERT_SUBVECTOR(SDNode *N, SDValue &Lo, SDValue &Hi);
950 void SplitVecRes_FPOp_MultiType(SDNode *N, SDValue &Lo, SDValue &Hi);
951 void SplitVecRes_IS_FPCLASS(SDNode *N, SDValue &Lo, SDValue &Hi);
952 void SplitVecRes_INSERT_VECTOR_ELT(SDNode *N, SDValue &Lo, SDValue &Hi);
953 void SplitVecRes_ATOMIC_LOAD(AtomicSDNode *LD, SDValue &Lo, SDValue &Hi);
954 void SplitVecRes_LOAD(LoadSDNode *LD, SDValue &Lo, SDValue &Hi);
955 void SplitVecRes_VP_LOAD(VPLoadSDNode *LD, SDValue &Lo, SDValue &Hi);
956 void SplitVecRes_VP_LOAD_FF(VPLoadFFSDNode *LD, SDValue &Lo, SDValue &Hi);
957 void SplitVecRes_VP_STRIDED_LOAD(VPStridedLoadSDNode *SLD, SDValue &Lo,
958 SDValue &Hi);
959 void SplitVecRes_MLOAD(MaskedLoadSDNode *MLD, SDValue &Lo, SDValue &Hi);
960 void SplitVecRes_Gather(MemSDNode *VPGT, SDValue &Lo, SDValue &Hi,
961 bool SplitSETCC = false);
962 void SplitVecRes_VECTOR_COMPRESS(SDNode *N, SDValue &Lo, SDValue &Hi);
963 void SplitVecRes_ScalarOp(SDNode *N, SDValue &Lo, SDValue &Hi);
964 void SplitVecRes_STEP_VECTOR(SDNode *N, SDValue &Lo, SDValue &Hi);
965 void SplitVecRes_SETCC(SDNode *N, SDValue &Lo, SDValue &Hi);
966 void SplitVecRes_VECTOR_REVERSE(SDNode *N, SDValue &Lo, SDValue &Hi);
967 void SplitVecRes_VECTOR_SHUFFLE(ShuffleVectorSDNode *N, SDValue &Lo,
968 SDValue &Hi);
969 void SplitVecRes_VECTOR_SPLICE(SDNode *N, SDValue &Lo, SDValue &Hi);
970 void SplitVecRes_VECTOR_DEINTERLEAVE(SDNode *N);
971 void SplitVecRes_VECTOR_INTERLEAVE(SDNode *N);
972 void SplitVecRes_VAARG(SDNode *N, SDValue &Lo, SDValue &Hi);
973 void SplitVecRes_FP_TO_XINT_SAT(SDNode *N, SDValue &Lo, SDValue &Hi);
974 void SplitVecRes_VP_SPLICE(SDNode *N, SDValue &Lo, SDValue &Hi);
975 void SplitVecRes_VP_REVERSE(SDNode *N, SDValue &Lo, SDValue &Hi);
976 void SplitVecRes_PARTIAL_REDUCE_MLA(SDNode *N, SDValue &Lo, SDValue &Hi);
977 void SplitVecRes_GET_ACTIVE_LANE_MASK(SDNode *N, SDValue &Lo, SDValue &Hi);
978
979 // Vector Operand Splitting: <128 x ty> -> 2 x <64 x ty>.
980 bool SplitVectorOperand(SDNode *N, unsigned OpNo);
981 SDValue SplitVecOp_VSELECT(SDNode *N, unsigned OpNo);
982 SDValue SplitVecOp_VECREDUCE(SDNode *N, unsigned OpNo);
983 SDValue SplitVecOp_VECREDUCE_SEQ(SDNode *N);
984 SDValue SplitVecOp_VP_REDUCE(SDNode *N, unsigned OpNo);
985 SDValue SplitVecOp_UnaryOp(SDNode *N);
986 SDValue SplitVecOp_TruncateHelper(SDNode *N);
987 SDValue SplitVecOp_VECTOR_COMPRESS(SDNode *N, unsigned OpNo);
988
989 SDValue SplitVecOp_BITCAST(SDNode *N);
990 SDValue SplitVecOp_INSERT_SUBVECTOR(SDNode *N, unsigned OpNo);
991 SDValue SplitVecOp_EXTRACT_SUBVECTOR(SDNode *N);
992 SDValue SplitVecOp_EXTRACT_VECTOR_ELT(SDNode *N);
993 SDValue SplitVecOp_ExtVecInRegOp(SDNode *N);
994 SDValue SplitVecOp_FAKE_USE(SDNode *N);
995 SDValue SplitVecOp_STORE(StoreSDNode *N, unsigned OpNo);
996 SDValue SplitVecOp_ATOMIC_STORE(AtomicSDNode *N);
997 SDValue SplitVecOp_VP_STORE(VPStoreSDNode *N, unsigned OpNo);
998 SDValue SplitVecOp_VP_STRIDED_STORE(VPStridedStoreSDNode *N, unsigned OpNo);
999 SDValue SplitVecOp_MSTORE(MaskedStoreSDNode *N, unsigned OpNo);
1000 SDValue SplitVecOp_Scatter(MemSDNode *N, unsigned OpNo);
1001 SDValue SplitVecOp_Gather(MemSDNode *MGT, unsigned OpNo);
1002 SDValue SplitVecOp_CONCAT_VECTORS(SDNode *N);
1003 SDValue SplitVecOp_VSETCC(SDNode *N);
1004 SDValue SplitVecOp_FP_ROUND(SDNode *N);
1005 SDValue SplitVecOp_FPOpDifferentTypes(SDNode *N);
1006 SDValue SplitVecOp_CMP(SDNode *N);
1007 SDValue SplitVecOp_FP_TO_XINT_SAT(SDNode *N);
1008 SDValue SplitVecOp_CttzElts(SDNode *N);
1009 SDValue SplitVecOp_VP_CttzElements(SDNode *N);
1010 SDValue SplitVecOp_VECTOR_HISTOGRAM(SDNode *N);
1011 SDValue SplitVecOp_PARTIAL_REDUCE_MLA(SDNode *N);
1012 SDValue SplitVecOp_VECTOR_FIND_LAST_ACTIVE(SDNode *N);
1013
1014 //===--------------------------------------------------------------------===//
1015 // Vector Widening Support: LegalizeVectorTypes.cpp
1016 //===--------------------------------------------------------------------===//
1017
1018 /// Given a processed vector Op which was widened into a larger vector, this
1019 /// method returns the larger vector. The elements of the returned vector
1020 /// consist of the elements of Op followed by elements containing rubbish.
1021 /// For example, if Op is a v2i32 that was widened to a v4i32, then this
1022 /// method returns a v4i32 for which the first two elements are the same as
1023 /// those of Op, while the last two elements contain rubbish.
1024 SDValue GetWidenedVector(SDValue Op) {
1025 TableId &WidenedId = WidenedVectors[getTableId(Op)];
1026 SDValue WidenedOp = getSDValue(WidenedId);
1027 assert(WidenedOp.getNode() && "Operand wasn't widened?");
1028 return WidenedOp;
1029 }
1030 void SetWidenedVector(SDValue Op, SDValue Result);
1031
1032 /// Given a mask Mask, returns the larger vector into which Mask was widened.
1033 SDValue GetWidenedMask(SDValue Mask, ElementCount EC) {
1034 // For VP operations, we must also widen the mask. Note that the mask type
1035 // may not actually need widening, leading it be split along with the VP
1036 // operation.
1037 // FIXME: This could lead to an infinite split/widen loop. We only handle
1038 // the case where the mask needs widening to an identically-sized type as
1039 // the vector inputs.
1040 assert(getTypeAction(Mask.getValueType()) ==
1041 TargetLowering::TypeWidenVector &&
1042 "Unable to widen binary VP op");
1043 Mask = GetWidenedVector(Mask);
1044 assert(Mask.getValueType().getVectorElementCount() == EC &&
1045 "Unable to widen binary VP op");
1046 return Mask;
1047 }
1048
1049 // Widen Vector Result Promotion.
1050 void WidenVectorResult(SDNode *N, unsigned ResNo);
1051 SDValue WidenVecRes_MERGE_VALUES(SDNode* N, unsigned ResNo);
1052 SDValue WidenVecRes_ADDRSPACECAST(SDNode *N);
1053 SDValue WidenVecRes_AssertZext(SDNode* N);
1054 SDValue WidenVecRes_BITCAST(SDNode* N);
1055 SDValue WidenVecRes_LOOP_DEPENDENCE_MASK(SDNode *N);
1056 SDValue WidenVecRes_BUILD_VECTOR(SDNode* N);
1057 SDValue WidenVecRes_CONCAT_VECTORS(SDNode* N);
1058 SDValue WidenVecRes_EXTEND_VECTOR_INREG(SDNode* N);
1059 SDValue WidenVecRes_EXTRACT_SUBVECTOR(SDNode* N);
1060 SDValue WidenVecRes_INSERT_SUBVECTOR(SDNode *N);
1061 SDValue WidenVecRes_INSERT_VECTOR_ELT(SDNode* N);
1062 SDValue WidenVecRes_ATOMIC_LOAD(AtomicSDNode *N);
1063 SDValue WidenVecRes_LOAD(SDNode* N);
1064 SDValue WidenVecRes_VP_LOAD(VPLoadSDNode *N);
1065 SDValue WidenVecRes_VP_LOAD_FF(VPLoadFFSDNode *N);
1066 SDValue WidenVecRes_VP_STRIDED_LOAD(VPStridedLoadSDNode *N);
1067 SDValue WidenVecRes_VECTOR_COMPRESS(SDNode *N);
1068 SDValue WidenVecRes_MLOAD(MaskedLoadSDNode* N);
1069 SDValue WidenVecRes_MGATHER(MaskedGatherSDNode* N);
1070 SDValue WidenVecRes_VP_GATHER(VPGatherSDNode* N);
1071 SDValue WidenVecRes_ScalarOp(SDNode* N);
1072 SDValue WidenVecRes_Select(SDNode *N);
1073 SDValue WidenVSELECTMask(SDNode *N);
1074 SDValue WidenVecRes_SELECT_CC(SDNode* N);
1075 SDValue WidenVecRes_SETCC(SDNode* N);
1076 SDValue WidenVecRes_STRICT_FSETCC(SDNode* N);
1077 SDValue WidenVecRes_UNDEF(SDNode *N);
1078 SDValue WidenVecRes_VECTOR_SHUFFLE(ShuffleVectorSDNode *N);
1079 SDValue WidenVecRes_VECTOR_REVERSE(SDNode *N);
1080 SDValue WidenVecRes_GET_ACTIVE_LANE_MASK(SDNode *N);
1081
1082 SDValue WidenVecRes_Ternary(SDNode *N);
1083 SDValue WidenVecRes_Binary(SDNode *N);
1084 SDValue WidenVecRes_MaskedBinary(SDNode *N);
1085 SDValue WidenVecRes_CMP(SDNode *N);
1086 SDValue WidenVecRes_BinaryCanTrap(SDNode *N);
1087 SDValue WidenVecRes_BinaryWithExtraScalarOp(SDNode *N);
1088 SDValue WidenVecRes_StrictFP(SDNode *N);
1089 SDValue WidenVecRes_OverflowOp(SDNode *N, unsigned ResNo);
1090 SDValue WidenVecRes_Convert(SDNode *N);
1091 SDValue WidenVecRes_Convert_StrictFP(SDNode *N);
1092 SDValue WidenVecRes_FP_TO_XINT_SAT(SDNode *N);
1093 SDValue WidenVecRes_XROUND(SDNode *N);
1094 SDValue WidenVecRes_FCOPYSIGN(SDNode *N);
1095 SDValue WidenVecRes_UnarySameEltsWithScalarArg(SDNode *N);
1096 SDValue WidenVecRes_ExpOp(SDNode *N);
1097 SDValue WidenVecRes_Unary(SDNode *N);
1098 SDValue WidenVecRes_InregOp(SDNode *N);
1099 SDValue WidenVecRes_UnaryOpWithTwoResults(SDNode *N, unsigned ResNo);
1100 void ReplaceOtherWidenResults(SDNode *N, SDNode *WidenNode,
1101 unsigned WidenResNo);
1102
1103 // Widen Vector Operand.
1104 bool WidenVectorOperand(SDNode *N, unsigned OpNo);
1105 SDValue WidenVecOp_BITCAST(SDNode *N);
1106 SDValue WidenVecOp_CONCAT_VECTORS(SDNode *N);
1107 SDValue WidenVecOp_EXTEND(SDNode *N);
1108 SDValue WidenVecOp_CMP(SDNode *N);
1109 SDValue WidenVecOp_EXTRACT_VECTOR_ELT(SDNode *N);
1110 SDValue WidenVecOp_INSERT_SUBVECTOR(SDNode *N);
1111 SDValue WidenVecOp_EXTRACT_SUBVECTOR(SDNode *N);
1112 SDValue WidenVecOp_EXTEND_VECTOR_INREG(SDNode *N);
1113 SDValue WidenVecOp_FAKE_USE(SDNode *N);
1114 SDValue WidenVecOp_STORE(SDNode* N);
1115 SDValue WidenVecOp_ATOMIC_STORE(AtomicSDNode *ST);
1116 SDValue WidenVecOp_VP_STORE(SDNode *N, unsigned OpNo);
1117 SDValue WidenVecOp_VP_STRIDED_STORE(SDNode *N, unsigned OpNo);
1118 SDValue WidenVecOp_MSTORE(SDNode* N, unsigned OpNo);
1119 SDValue WidenVecOp_MGATHER(SDNode* N, unsigned OpNo);
1120 SDValue WidenVecOp_MSCATTER(SDNode* N, unsigned OpNo);
1121 SDValue WidenVecOp_VP_SCATTER(SDNode* N, unsigned OpNo);
1122 SDValue WidenVecOp_SETCC(SDNode* N);
1123 SDValue WidenVecOp_STRICT_FSETCC(SDNode* N);
1124 SDValue WidenVecOp_VSELECT(SDNode *N);
1125
1126 SDValue WidenVecOp_Convert(SDNode *N);
1127 SDValue WidenVecOp_FP_TO_XINT_SAT(SDNode *N);
1128 SDValue WidenVecOp_UnrollVectorOp(SDNode *N);
1129 SDValue WidenVecOp_IS_FPCLASS(SDNode *N);
1130 SDValue WidenVecOp_VECREDUCE(SDNode *N);
1131 SDValue WidenVecOp_VECREDUCE_SEQ(SDNode *N);
1132 SDValue WidenVecOp_VP_REDUCE(SDNode *N);
1133 SDValue WidenVecOp_ExpOp(SDNode *N);
1134 SDValue WidenVecOp_VP_CttzElements(SDNode *N);
1135 SDValue WidenVecOp_VECTOR_FIND_LAST_ACTIVE(SDNode *N);
1136
1137 /// Helper function to generate a set of operations to perform
1138 /// a vector operation for a wider type.
1139 ///
1140 SDValue UnrollVectorOp_StrictFP(SDNode *N, unsigned ResNE);
1141
1142 //===--------------------------------------------------------------------===//
1143 // Vector Widening Utilities Support: LegalizeVectorTypes.cpp
1144 //===--------------------------------------------------------------------===//
1145
1146 /// Helper function to generate a set of loads to load a vector with a
1147 /// resulting wider type. It takes:
1148 /// LdChain: list of chains for the load to be generated.
1149 /// Ld: load to widen
1150 SDValue GenWidenVectorLoads(SmallVectorImpl<SDValue> &LdChain,
1151 LoadSDNode *LD);
1152
1153 /// Helper function to generate a set of extension loads to load a vector with
1154 /// a resulting wider type. It takes:
1155 /// LdChain: list of chains for the load to be generated.
1156 /// Ld: load to widen
1157 /// ExtType: extension element type
1158 SDValue GenWidenVectorExtLoads(SmallVectorImpl<SDValue> &LdChain,
1159 LoadSDNode *LD, ISD::LoadExtType ExtType);
1160
1161 /// Helper function to generate a set of stores to store a widen vector into
1162 /// non-widen memory. Returns true if successful, false otherwise.
1163 /// StChain: list of chains for the stores we have generated
1164 /// ST: store of a widen value
1165 bool GenWidenVectorStores(SmallVectorImpl<SDValue> &StChain, StoreSDNode *ST);
1166
1167 /// Modifies a vector input (widen or narrows) to a vector of NVT. The
1168 /// input vector must have the same element type as NVT.
1169 /// When FillWithZeroes is "on" the vector will be widened with zeroes.
1170 /// By default, the vector will be widened with undefined values.
1171 SDValue ModifyToType(SDValue InOp, EVT NVT, bool FillWithZeroes = false);
1172
1173 /// Return a mask of vector type MaskVT to replace InMask. Also adjust
1174 /// MaskVT to ToMaskVT if needed with vector extension or truncation.
1175 SDValue convertMask(SDValue InMask, EVT MaskVT, EVT ToMaskVT);
1176
1177 //===--------------------------------------------------------------------===//
1178 // Generic Splitting: LegalizeTypesGeneric.cpp
1179 //===--------------------------------------------------------------------===//
1180
1181 // Legalization methods which only use that the illegal type is split into two
1182 // not necessarily identical types. As such they can be used for splitting
1183 // vectors and expanding integers and floats.
1184
1185 void GetSplitOp(SDValue Op, SDValue &Lo, SDValue &Hi) {
1186 if (Op.getValueType().isVector())
1187 GetSplitVector(Op, Lo, Hi);
1188 else if (Op.getValueType().isInteger())
1189 GetExpandedInteger(Op, Lo, Hi);
1190 else
1191 GetExpandedFloat(Op, Lo, Hi);
1192 }
1193
1194 /// Use ISD::EXTRACT_ELEMENT nodes to extract the low and high parts of the
1195 /// given value.
1196 void GetPairElements(SDValue Pair, SDValue &Lo, SDValue &Hi);
1197
1198 // Generic Result Splitting.
1199 void SplitRes_MERGE_VALUES(SDNode *N, unsigned ResNo,
1200 SDValue &Lo, SDValue &Hi);
1201 void SplitVecRes_AssertZext(SDNode *N, SDValue &Lo, SDValue &Hi);
1202 void SplitVecRes_AssertSext(SDNode *N, SDValue &Lo, SDValue &Hi);
1203 void SplitRes_ARITH_FENCE (SDNode *N, SDValue &Lo, SDValue &Hi);
1204 void SplitRes_Select (SDNode *N, SDValue &Lo, SDValue &Hi);
1205 void SplitRes_SELECT_CC (SDNode *N, SDValue &Lo, SDValue &Hi);
1206 void SplitRes_UNDEF (SDNode *N, SDValue &Lo, SDValue &Hi);
1207 void SplitRes_FREEZE (SDNode *N, SDValue &Lo, SDValue &Hi);
1208
1209 //===--------------------------------------------------------------------===//
1210 // Generic Expansion: LegalizeTypesGeneric.cpp
1211 //===--------------------------------------------------------------------===//
1212
1213 // Legalization methods which only use that the illegal type is split into two
1214 // identical types of half the size, and that the Lo/Hi part is stored first
1215 // in memory on little/big-endian machines, followed by the Hi/Lo part. As
1216 // such they can be used for expanding integers and floats.
1217
1218 void GetExpandedOp(SDValue Op, SDValue &Lo, SDValue &Hi) {
1219 if (Op.getValueType().isInteger())
1220 GetExpandedInteger(Op, Lo, Hi);
1221 else
1222 GetExpandedFloat(Op, Lo, Hi);
1223 }
1224
1225
1226 /// This function will split the integer \p Op into \p NumElements
1227 /// operations of type \p EltVT and store them in \p Ops.
1228 void IntegerToVector(SDValue Op, unsigned NumElements,
1229 SmallVectorImpl<SDValue> &Ops, EVT EltVT);
1230
1231 // Generic Result Expansion.
1232 void ExpandRes_MERGE_VALUES (SDNode *N, unsigned ResNo,
1233 SDValue &Lo, SDValue &Hi);
1234 void ExpandRes_BITCAST (SDNode *N, SDValue &Lo, SDValue &Hi);
1235 void ExpandRes_BUILD_PAIR (SDNode *N, SDValue &Lo, SDValue &Hi);
1236 void ExpandRes_EXTRACT_ELEMENT (SDNode *N, SDValue &Lo, SDValue &Hi);
1237 void ExpandRes_EXTRACT_VECTOR_ELT(SDNode *N, SDValue &Lo, SDValue &Hi);
1238 void ExpandRes_NormalLoad (SDNode *N, SDValue &Lo, SDValue &Hi);
1239 void ExpandRes_VAARG (SDNode *N, SDValue &Lo, SDValue &Hi);
1240
1241 // Generic Operand Expansion.
1242 SDValue ExpandOp_BITCAST (SDNode *N);
1243 SDValue ExpandOp_BUILD_VECTOR (SDNode *N);
1244 SDValue ExpandOp_EXTRACT_ELEMENT (SDNode *N);
1245 SDValue ExpandOp_FAKE_USE(SDNode *N);
1246 SDValue ExpandOp_INSERT_VECTOR_ELT(SDNode *N);
1247 SDValue ExpandOp_SCALAR_TO_VECTOR (SDNode *N);
1248 SDValue ExpandOp_NormalStore (SDNode *N, unsigned OpNo);
1249};
1250
1251} // end namespace llvm.
1252
1253#endif
SDValue
return SDValue()
assert
assert(UImm &&(UImm !=~static_cast< T >(0)) &&"Invalid immediate!")
DL
MachineBasicBlock MachineBasicBlock::iterator DebugLoc DL
Definition ARMSLSHardening.cpp:73
LLVM_LIBRARY_VISIBILITY
#define LLVM_LIBRARY_VISIBILITY
Definition Compiler.h:137
DenseMap.h
This file defines the DenseMap class.
Ops
const AbstractManglingParser< Derived, Alloc >::OperatorInfo AbstractManglingParser< Derived, Alloc >::Ops[]
Definition ItaniumDemangle.h:3391
I
#define I(x, y, z)
Definition MD5.cpp:57
TargetLowering.h
This file describes how to lower LLVM code to machine code.
RHS
Value * RHS
Definition X86PartialReduction.cpp:81
LHS
Value * LHS
Definition X86PartialReduction.cpp:80
llvm::DAGTypeLegalizer::DAGTypeLegalizer
DAGTypeLegalizer(SelectionDAG &dag)
Definition LegalizeTypes.h:168
llvm::DAGTypeLegalizer::NoteDeletion
void NoteDeletion(SDNode *Old, SDNode *New)
Definition LegalizeTypes.h:178
llvm::DAGTypeLegalizer::getDAG
SelectionDAG & getDAG() const
Definition LegalizeTypes.h:206
llvm::DAGTypeLegalizer::NodeIdFlags
NodeIdFlags
This pass uses the NodeId on the SDNodes to hold information about the state of the node.
Definition LegalizeTypes.h:37
llvm::DAGTypeLegalizer::ReadyToProcess
@ ReadyToProcess
All operands have been processed, so this node is ready to be handled.
Definition LegalizeTypes.h:39
llvm::DAGTypeLegalizer::NewNode
@ NewNode
This is a new node, not before seen, that was created in the process of legalizing some other node.
Definition LegalizeTypes.h:43
llvm::DAGTypeLegalizer::Unanalyzed
@ Unanalyzed
This node's ID needs to be set to the number of its unprocessed operands.
Definition LegalizeTypes.h:47
llvm::DAGTypeLegalizer::Processed
@ Processed
This is a node that has already been processed.
Definition LegalizeTypes.h:50
llvm::SDNode
Represents one node in the SelectionDAG.
Definition SelectionDAGNodes.h:505
llvm::SDNode::getNumValues
unsigned getNumValues() const
Return the number of values defined/returned by this operator.
Definition SelectionDAGNodes.h:1117
llvm::SDValue
Unlike LLVM values, Selection DAG nodes may return multiple values as the result of a computation.
Definition SelectionDAGNodes.h:147
llvm::SDValue::getNode
SDNode * getNode() const
get the SDNode which holds the desired result
Definition SelectionDAGNodes.h:161
llvm::SelectionDAG
This is used to represent a portion of an LLVM function in a low-level Data Dependence DAG representa...
Definition SelectionDAG.h:231
llvm::SelectionDAG::getZeroExtendInReg
LLVM_ABI SDValue getZeroExtendInReg(SDValue Op, const SDLoc &DL, EVT VT)
Return the expression required to zero extend the Op value assuming it was the smaller SrcTy value.
Definition SelectionDAG.cpp:1621
llvm::SelectionDAG::getDataLayout
const DataLayout & getDataLayout() const
Definition SelectionDAG.h:514
llvm::SelectionDAG::getValueType
LLVM_ABI SDValue getValueType(EVT)
Definition SelectionDAG.cpp:2114
llvm::SelectionDAG::getNode
LLVM_ABI SDValue getNode(unsigned Opcode, const SDLoc &DL, EVT VT, ArrayRef< SDUse > Ops)
Gets or creates the specified node.
Definition SelectionDAG.cpp:11715
llvm::SelectionDAG::getContext
LLVMContext * getContext() const
Definition SelectionDAG.h:534
llvm::TargetLoweringBase::LegalizeTypeAction
LegalizeTypeAction
This enum indicates whether a types are legal for a target, and if not, what action should be used to...
Definition TargetLowering.h:213
llvm::TargetLowering
This class defines information used to lower LLVM code to legal SelectionDAG operators that the targe...
Definition TargetLowering.h:4050
llvm::BitmaskEnumDetail::Mask
constexpr std::underlying_type_t< E > Mask()
Get a bitmask with 1s in all places up to the high-order bit of E's largest value.
Definition BitmaskEnum.h:126
llvm
This is an optimization pass for GlobalISel generic memory operations.
Definition FunctionInfo.h:25
llvm::Op
DWARFExpression::Operation Op
Definition DWARFExpressionPrinter.cpp:25
N
#define N
llvm::EVT
Extended Value Type.
Definition ValueTypes.h:35
Generated on for LLVM by doxygen 1.14.0