File: | lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp |
Warning: | line 4493, column 48 Division by zero |
Press '?' to see keyboard shortcuts
Keyboard shortcuts:
1 | //===------- LegalizeVectorTypes.cpp - Legalization of vector types -------===// | |||
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 performs vector type splitting and scalarization for LegalizeTypes. | |||
11 | // Scalarization is the act of changing a computation in an illegal one-element | |||
12 | // vector type to be a computation in its scalar element type. For example, | |||
13 | // implementing <1 x f32> arithmetic in a scalar f32 register. This is needed | |||
14 | // as a base case when scalarizing vector arithmetic like <4 x f32>, which | |||
15 | // eventually decomposes to scalars if the target doesn't support v4f32 or v2f32 | |||
16 | // types. | |||
17 | // Splitting is the act of changing a computation in an invalid vector type to | |||
18 | // be a computation in two vectors of half the size. For example, implementing | |||
19 | // <128 x f32> operations in terms of two <64 x f32> operations. | |||
20 | // | |||
21 | //===----------------------------------------------------------------------===// | |||
22 | ||||
23 | #include "LegalizeTypes.h" | |||
24 | #include "llvm/IR/DataLayout.h" | |||
25 | #include "llvm/Support/ErrorHandling.h" | |||
26 | #include "llvm/Support/raw_ostream.h" | |||
27 | using namespace llvm; | |||
28 | ||||
29 | #define DEBUG_TYPE"legalize-types" "legalize-types" | |||
30 | ||||
31 | //===----------------------------------------------------------------------===// | |||
32 | // Result Vector Scalarization: <1 x ty> -> ty. | |||
33 | //===----------------------------------------------------------------------===// | |||
34 | ||||
35 | void DAGTypeLegalizer::ScalarizeVectorResult(SDNode *N, unsigned ResNo) { | |||
36 | LLVM_DEBUG(dbgs() << "Scalarize node result " << ResNo << ": "; N->dump(&DAG);do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType ("legalize-types")) { dbgs() << "Scalarize node result " << ResNo << ": "; N->dump(&DAG); dbgs() << "\n"; } } while (false) | |||
37 | dbgs() << "\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType ("legalize-types")) { dbgs() << "Scalarize node result " << ResNo << ": "; N->dump(&DAG); dbgs() << "\n"; } } while (false); | |||
38 | SDValue R = SDValue(); | |||
39 | ||||
40 | switch (N->getOpcode()) { | |||
41 | default: | |||
42 | #ifndef NDEBUG | |||
43 | dbgs() << "ScalarizeVectorResult #" << ResNo << ": "; | |||
44 | N->dump(&DAG); | |||
45 | dbgs() << "\n"; | |||
46 | #endif | |||
47 | report_fatal_error("Do not know how to scalarize the result of this " | |||
48 | "operator!\n"); | |||
49 | ||||
50 | case ISD::MERGE_VALUES: R = ScalarizeVecRes_MERGE_VALUES(N, ResNo);break; | |||
51 | case ISD::BITCAST: R = ScalarizeVecRes_BITCAST(N); break; | |||
52 | case ISD::BUILD_VECTOR: R = ScalarizeVecRes_BUILD_VECTOR(N); break; | |||
53 | case ISD::EXTRACT_SUBVECTOR: R = ScalarizeVecRes_EXTRACT_SUBVECTOR(N); break; | |||
54 | case ISD::FP_ROUND: R = ScalarizeVecRes_FP_ROUND(N); break; | |||
55 | case ISD::FP_ROUND_INREG: R = ScalarizeVecRes_InregOp(N); break; | |||
56 | case ISD::FPOWI: R = ScalarizeVecRes_FPOWI(N); break; | |||
57 | case ISD::INSERT_VECTOR_ELT: R = ScalarizeVecRes_INSERT_VECTOR_ELT(N); break; | |||
58 | case ISD::LOAD: R = ScalarizeVecRes_LOAD(cast<LoadSDNode>(N));break; | |||
59 | case ISD::SCALAR_TO_VECTOR: R = ScalarizeVecRes_SCALAR_TO_VECTOR(N); break; | |||
60 | case ISD::SIGN_EXTEND_INREG: R = ScalarizeVecRes_InregOp(N); break; | |||
61 | case ISD::VSELECT: R = ScalarizeVecRes_VSELECT(N); break; | |||
62 | case ISD::SELECT: R = ScalarizeVecRes_SELECT(N); break; | |||
63 | case ISD::SELECT_CC: R = ScalarizeVecRes_SELECT_CC(N); break; | |||
64 | case ISD::SETCC: R = ScalarizeVecRes_SETCC(N); break; | |||
65 | case ISD::UNDEF: R = ScalarizeVecRes_UNDEF(N); break; | |||
66 | case ISD::VECTOR_SHUFFLE: R = ScalarizeVecRes_VECTOR_SHUFFLE(N); break; | |||
67 | case ISD::ANY_EXTEND_VECTOR_INREG: | |||
68 | case ISD::SIGN_EXTEND_VECTOR_INREG: | |||
69 | case ISD::ZERO_EXTEND_VECTOR_INREG: | |||
70 | R = ScalarizeVecRes_VecInregOp(N); | |||
71 | break; | |||
72 | case ISD::ANY_EXTEND: | |||
73 | case ISD::BITREVERSE: | |||
74 | case ISD::BSWAP: | |||
75 | case ISD::CTLZ: | |||
76 | case ISD::CTLZ_ZERO_UNDEF: | |||
77 | case ISD::CTPOP: | |||
78 | case ISD::CTTZ: | |||
79 | case ISD::CTTZ_ZERO_UNDEF: | |||
80 | case ISD::FABS: | |||
81 | case ISD::FCEIL: | |||
82 | case ISD::FCOS: | |||
83 | case ISD::FEXP: | |||
84 | case ISD::FEXP2: | |||
85 | case ISD::FFLOOR: | |||
86 | case ISD::FLOG: | |||
87 | case ISD::FLOG10: | |||
88 | case ISD::FLOG2: | |||
89 | case ISD::FNEARBYINT: | |||
90 | case ISD::FNEG: | |||
91 | case ISD::FP_EXTEND: | |||
92 | case ISD::FP_TO_SINT: | |||
93 | case ISD::FP_TO_UINT: | |||
94 | case ISD::FRINT: | |||
95 | case ISD::FROUND: | |||
96 | case ISD::FSIN: | |||
97 | case ISD::FSQRT: | |||
98 | case ISD::FTRUNC: | |||
99 | case ISD::SIGN_EXTEND: | |||
100 | case ISD::SINT_TO_FP: | |||
101 | case ISD::TRUNCATE: | |||
102 | case ISD::UINT_TO_FP: | |||
103 | case ISD::ZERO_EXTEND: | |||
104 | case ISD::FCANONICALIZE: | |||
105 | R = ScalarizeVecRes_UnaryOp(N); | |||
106 | break; | |||
107 | ||||
108 | case ISD::ADD: | |||
109 | case ISD::AND: | |||
110 | case ISD::FADD: | |||
111 | case ISD::FCOPYSIGN: | |||
112 | case ISD::FDIV: | |||
113 | case ISD::FMUL: | |||
114 | case ISD::FMINNUM: | |||
115 | case ISD::FMAXNUM: | |||
116 | case ISD::FMINNUM_IEEE: | |||
117 | case ISD::FMAXNUM_IEEE: | |||
118 | case ISD::FMINIMUM: | |||
119 | case ISD::FMAXIMUM: | |||
120 | case ISD::SMIN: | |||
121 | case ISD::SMAX: | |||
122 | case ISD::UMIN: | |||
123 | case ISD::UMAX: | |||
124 | ||||
125 | case ISD::SADDSAT: | |||
126 | case ISD::UADDSAT: | |||
127 | case ISD::SSUBSAT: | |||
128 | case ISD::USUBSAT: | |||
129 | ||||
130 | case ISD::FPOW: | |||
131 | case ISD::FREM: | |||
132 | case ISD::FSUB: | |||
133 | case ISD::MUL: | |||
134 | case ISD::OR: | |||
135 | case ISD::SDIV: | |||
136 | case ISD::SREM: | |||
137 | case ISD::SUB: | |||
138 | case ISD::UDIV: | |||
139 | case ISD::UREM: | |||
140 | case ISD::XOR: | |||
141 | case ISD::SHL: | |||
142 | case ISD::SRA: | |||
143 | case ISD::SRL: | |||
144 | R = ScalarizeVecRes_BinOp(N); | |||
145 | break; | |||
146 | case ISD::FMA: | |||
147 | R = ScalarizeVecRes_TernaryOp(N); | |||
148 | break; | |||
149 | case ISD::STRICT_FADD: | |||
150 | case ISD::STRICT_FSUB: | |||
151 | case ISD::STRICT_FMUL: | |||
152 | case ISD::STRICT_FDIV: | |||
153 | case ISD::STRICT_FREM: | |||
154 | case ISD::STRICT_FSQRT: | |||
155 | case ISD::STRICT_FMA: | |||
156 | case ISD::STRICT_FPOW: | |||
157 | case ISD::STRICT_FPOWI: | |||
158 | case ISD::STRICT_FSIN: | |||
159 | case ISD::STRICT_FCOS: | |||
160 | case ISD::STRICT_FEXP: | |||
161 | case ISD::STRICT_FEXP2: | |||
162 | case ISD::STRICT_FLOG: | |||
163 | case ISD::STRICT_FLOG10: | |||
164 | case ISD::STRICT_FLOG2: | |||
165 | case ISD::STRICT_FRINT: | |||
166 | case ISD::STRICT_FNEARBYINT: | |||
167 | case ISD::STRICT_FMAXNUM: | |||
168 | case ISD::STRICT_FMINNUM: | |||
169 | case ISD::STRICT_FCEIL: | |||
170 | case ISD::STRICT_FFLOOR: | |||
171 | case ISD::STRICT_FROUND: | |||
172 | case ISD::STRICT_FTRUNC: | |||
173 | R = ScalarizeVecRes_StrictFPOp(N); | |||
174 | break; | |||
175 | case ISD::SMULFIX: | |||
176 | R = ScalarizeVecRes_SMULFIX(N); | |||
177 | break; | |||
178 | } | |||
179 | ||||
180 | // If R is null, the sub-method took care of registering the result. | |||
181 | if (R.getNode()) | |||
182 | SetScalarizedVector(SDValue(N, ResNo), R); | |||
183 | } | |||
184 | ||||
185 | SDValue DAGTypeLegalizer::ScalarizeVecRes_BinOp(SDNode *N) { | |||
186 | SDValue LHS = GetScalarizedVector(N->getOperand(0)); | |||
187 | SDValue RHS = GetScalarizedVector(N->getOperand(1)); | |||
188 | return DAG.getNode(N->getOpcode(), SDLoc(N), | |||
189 | LHS.getValueType(), LHS, RHS, N->getFlags()); | |||
190 | } | |||
191 | ||||
192 | SDValue DAGTypeLegalizer::ScalarizeVecRes_TernaryOp(SDNode *N) { | |||
193 | SDValue Op0 = GetScalarizedVector(N->getOperand(0)); | |||
194 | SDValue Op1 = GetScalarizedVector(N->getOperand(1)); | |||
195 | SDValue Op2 = GetScalarizedVector(N->getOperand(2)); | |||
196 | return DAG.getNode(N->getOpcode(), SDLoc(N), | |||
197 | Op0.getValueType(), Op0, Op1, Op2); | |||
198 | } | |||
199 | ||||
200 | SDValue DAGTypeLegalizer::ScalarizeVecRes_SMULFIX(SDNode *N) { | |||
201 | SDValue Op0 = GetScalarizedVector(N->getOperand(0)); | |||
202 | SDValue Op1 = GetScalarizedVector(N->getOperand(1)); | |||
203 | SDValue Op2 = N->getOperand(2); | |||
204 | return DAG.getNode(N->getOpcode(), SDLoc(N), Op0.getValueType(), Op0, Op1, | |||
205 | Op2); | |||
206 | } | |||
207 | ||||
208 | SDValue DAGTypeLegalizer::ScalarizeVecRes_StrictFPOp(SDNode *N) { | |||
209 | EVT VT = N->getValueType(0).getVectorElementType(); | |||
210 | unsigned NumOpers = N->getNumOperands(); | |||
211 | SDValue Chain = N->getOperand(0); | |||
212 | EVT ValueVTs[] = {VT, MVT::Other}; | |||
213 | SDLoc dl(N); | |||
214 | ||||
215 | SmallVector<SDValue, 4> Opers; | |||
216 | ||||
217 | // The Chain is the first operand. | |||
218 | Opers.push_back(Chain); | |||
219 | ||||
220 | // Now process the remaining operands. | |||
221 | for (unsigned i = 1; i < NumOpers; ++i) { | |||
222 | SDValue Oper = N->getOperand(i); | |||
223 | ||||
224 | if (Oper.getValueType().isVector()) | |||
225 | Oper = GetScalarizedVector(Oper); | |||
226 | ||||
227 | Opers.push_back(Oper); | |||
228 | } | |||
229 | ||||
230 | SDValue Result = DAG.getNode(N->getOpcode(), dl, ValueVTs, Opers); | |||
231 | ||||
232 | // Legalize the chain result - switch anything that used the old chain to | |||
233 | // use the new one. | |||
234 | ReplaceValueWith(SDValue(N, 1), Result.getValue(1)); | |||
235 | return Result; | |||
236 | } | |||
237 | ||||
238 | SDValue DAGTypeLegalizer::ScalarizeVecRes_MERGE_VALUES(SDNode *N, | |||
239 | unsigned ResNo) { | |||
240 | SDValue Op = DisintegrateMERGE_VALUES(N, ResNo); | |||
241 | return GetScalarizedVector(Op); | |||
242 | } | |||
243 | ||||
244 | SDValue DAGTypeLegalizer::ScalarizeVecRes_BITCAST(SDNode *N) { | |||
245 | SDValue Op = N->getOperand(0); | |||
246 | if (Op.getValueType().isVector() | |||
247 | && Op.getValueType().getVectorNumElements() == 1 | |||
248 | && !isSimpleLegalType(Op.getValueType())) | |||
249 | Op = GetScalarizedVector(Op); | |||
250 | EVT NewVT = N->getValueType(0).getVectorElementType(); | |||
251 | return DAG.getNode(ISD::BITCAST, SDLoc(N), | |||
252 | NewVT, Op); | |||
253 | } | |||
254 | ||||
255 | SDValue DAGTypeLegalizer::ScalarizeVecRes_BUILD_VECTOR(SDNode *N) { | |||
256 | EVT EltVT = N->getValueType(0).getVectorElementType(); | |||
257 | SDValue InOp = N->getOperand(0); | |||
258 | // The BUILD_VECTOR operands may be of wider element types and | |||
259 | // we may need to truncate them back to the requested return type. | |||
260 | if (EltVT.isInteger()) | |||
261 | return DAG.getNode(ISD::TRUNCATE, SDLoc(N), EltVT, InOp); | |||
262 | return InOp; | |||
263 | } | |||
264 | ||||
265 | SDValue DAGTypeLegalizer::ScalarizeVecRes_EXTRACT_SUBVECTOR(SDNode *N) { | |||
266 | return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, SDLoc(N), | |||
267 | N->getValueType(0).getVectorElementType(), | |||
268 | N->getOperand(0), N->getOperand(1)); | |||
269 | } | |||
270 | ||||
271 | SDValue DAGTypeLegalizer::ScalarizeVecRes_FP_ROUND(SDNode *N) { | |||
272 | EVT NewVT = N->getValueType(0).getVectorElementType(); | |||
273 | SDValue Op = GetScalarizedVector(N->getOperand(0)); | |||
274 | return DAG.getNode(ISD::FP_ROUND, SDLoc(N), | |||
275 | NewVT, Op, N->getOperand(1)); | |||
276 | } | |||
277 | ||||
278 | SDValue DAGTypeLegalizer::ScalarizeVecRes_FPOWI(SDNode *N) { | |||
279 | SDValue Op = GetScalarizedVector(N->getOperand(0)); | |||
280 | return DAG.getNode(ISD::FPOWI, SDLoc(N), | |||
281 | Op.getValueType(), Op, N->getOperand(1)); | |||
282 | } | |||
283 | ||||
284 | SDValue DAGTypeLegalizer::ScalarizeVecRes_INSERT_VECTOR_ELT(SDNode *N) { | |||
285 | // The value to insert may have a wider type than the vector element type, | |||
286 | // so be sure to truncate it to the element type if necessary. | |||
287 | SDValue Op = N->getOperand(1); | |||
288 | EVT EltVT = N->getValueType(0).getVectorElementType(); | |||
289 | if (Op.getValueType() != EltVT) | |||
290 | // FIXME: Can this happen for floating point types? | |||
291 | Op = DAG.getNode(ISD::TRUNCATE, SDLoc(N), EltVT, Op); | |||
292 | return Op; | |||
293 | } | |||
294 | ||||
295 | SDValue DAGTypeLegalizer::ScalarizeVecRes_LOAD(LoadSDNode *N) { | |||
296 | assert(N->isUnindexed() && "Indexed vector load?")((N->isUnindexed() && "Indexed vector load?") ? static_cast <void> (0) : __assert_fail ("N->isUnindexed() && \"Indexed vector load?\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 296, __PRETTY_FUNCTION__)); | |||
297 | ||||
298 | SDValue Result = DAG.getLoad( | |||
299 | ISD::UNINDEXED, N->getExtensionType(), | |||
300 | N->getValueType(0).getVectorElementType(), SDLoc(N), N->getChain(), | |||
301 | N->getBasePtr(), DAG.getUNDEF(N->getBasePtr().getValueType()), | |||
302 | N->getPointerInfo(), N->getMemoryVT().getVectorElementType(), | |||
303 | N->getOriginalAlignment(), N->getMemOperand()->getFlags(), | |||
304 | N->getAAInfo()); | |||
305 | ||||
306 | // Legalize the chain result - switch anything that used the old chain to | |||
307 | // use the new one. | |||
308 | ReplaceValueWith(SDValue(N, 1), Result.getValue(1)); | |||
309 | return Result; | |||
310 | } | |||
311 | ||||
312 | SDValue DAGTypeLegalizer::ScalarizeVecRes_UnaryOp(SDNode *N) { | |||
313 | // Get the dest type - it doesn't always match the input type, e.g. int_to_fp. | |||
314 | EVT DestVT = N->getValueType(0).getVectorElementType(); | |||
315 | SDValue Op = N->getOperand(0); | |||
316 | EVT OpVT = Op.getValueType(); | |||
317 | SDLoc DL(N); | |||
318 | // The result needs scalarizing, but it's not a given that the source does. | |||
319 | // This is a workaround for targets where it's impossible to scalarize the | |||
320 | // result of a conversion, because the source type is legal. | |||
321 | // For instance, this happens on AArch64: v1i1 is illegal but v1i{8,16,32} | |||
322 | // are widened to v8i8, v4i16, and v2i32, which is legal, because v1i64 is | |||
323 | // legal and was not scalarized. | |||
324 | // See the similar logic in ScalarizeVecRes_SETCC | |||
325 | if (getTypeAction(OpVT) == TargetLowering::TypeScalarizeVector) { | |||
326 | Op = GetScalarizedVector(Op); | |||
327 | } else { | |||
328 | EVT VT = OpVT.getVectorElementType(); | |||
329 | Op = DAG.getNode( | |||
330 | ISD::EXTRACT_VECTOR_ELT, DL, VT, Op, | |||
331 | DAG.getConstant(0, DL, TLI.getVectorIdxTy(DAG.getDataLayout()))); | |||
332 | } | |||
333 | return DAG.getNode(N->getOpcode(), SDLoc(N), DestVT, Op); | |||
334 | } | |||
335 | ||||
336 | SDValue DAGTypeLegalizer::ScalarizeVecRes_InregOp(SDNode *N) { | |||
337 | EVT EltVT = N->getValueType(0).getVectorElementType(); | |||
338 | EVT ExtVT = cast<VTSDNode>(N->getOperand(1))->getVT().getVectorElementType(); | |||
339 | SDValue LHS = GetScalarizedVector(N->getOperand(0)); | |||
340 | return DAG.getNode(N->getOpcode(), SDLoc(N), EltVT, | |||
341 | LHS, DAG.getValueType(ExtVT)); | |||
342 | } | |||
343 | ||||
344 | SDValue DAGTypeLegalizer::ScalarizeVecRes_VecInregOp(SDNode *N) { | |||
345 | SDLoc DL(N); | |||
346 | SDValue Op = N->getOperand(0); | |||
347 | ||||
348 | EVT OpVT = Op.getValueType(); | |||
349 | EVT OpEltVT = OpVT.getVectorElementType(); | |||
350 | EVT EltVT = N->getValueType(0).getVectorElementType(); | |||
351 | ||||
352 | if (getTypeAction(OpVT) == TargetLowering::TypeScalarizeVector) { | |||
353 | Op = GetScalarizedVector(Op); | |||
354 | } else { | |||
355 | Op = DAG.getNode( | |||
356 | ISD::EXTRACT_VECTOR_ELT, DL, OpEltVT, Op, | |||
357 | DAG.getConstant(0, DL, TLI.getVectorIdxTy(DAG.getDataLayout()))); | |||
358 | } | |||
359 | ||||
360 | switch (N->getOpcode()) { | |||
361 | case ISD::ANY_EXTEND_VECTOR_INREG: | |||
362 | return DAG.getNode(ISD::ANY_EXTEND, DL, EltVT, Op); | |||
363 | case ISD::SIGN_EXTEND_VECTOR_INREG: | |||
364 | return DAG.getNode(ISD::SIGN_EXTEND, DL, EltVT, Op); | |||
365 | case ISD::ZERO_EXTEND_VECTOR_INREG: | |||
366 | return DAG.getNode(ISD::ZERO_EXTEND, DL, EltVT, Op); | |||
367 | } | |||
368 | ||||
369 | llvm_unreachable("Illegal extend_vector_inreg opcode")::llvm::llvm_unreachable_internal("Illegal extend_vector_inreg opcode" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 369); | |||
370 | } | |||
371 | ||||
372 | SDValue DAGTypeLegalizer::ScalarizeVecRes_SCALAR_TO_VECTOR(SDNode *N) { | |||
373 | // If the operand is wider than the vector element type then it is implicitly | |||
374 | // truncated. Make that explicit here. | |||
375 | EVT EltVT = N->getValueType(0).getVectorElementType(); | |||
376 | SDValue InOp = N->getOperand(0); | |||
377 | if (InOp.getValueType() != EltVT) | |||
378 | return DAG.getNode(ISD::TRUNCATE, SDLoc(N), EltVT, InOp); | |||
379 | return InOp; | |||
380 | } | |||
381 | ||||
382 | SDValue DAGTypeLegalizer::ScalarizeVecRes_VSELECT(SDNode *N) { | |||
383 | SDValue Cond = N->getOperand(0); | |||
384 | EVT OpVT = Cond.getValueType(); | |||
385 | SDLoc DL(N); | |||
386 | // The vselect result and true/value operands needs scalarizing, but it's | |||
387 | // not a given that the Cond does. For instance, in AVX512 v1i1 is legal. | |||
388 | // See the similar logic in ScalarizeVecRes_SETCC | |||
389 | if (getTypeAction(OpVT) == TargetLowering::TypeScalarizeVector) { | |||
390 | Cond = GetScalarizedVector(Cond); | |||
391 | } else { | |||
392 | EVT VT = OpVT.getVectorElementType(); | |||
393 | Cond = DAG.getNode( | |||
394 | ISD::EXTRACT_VECTOR_ELT, DL, VT, Cond, | |||
395 | DAG.getConstant(0, DL, TLI.getVectorIdxTy(DAG.getDataLayout()))); | |||
396 | } | |||
397 | ||||
398 | SDValue LHS = GetScalarizedVector(N->getOperand(1)); | |||
399 | TargetLowering::BooleanContent ScalarBool = | |||
400 | TLI.getBooleanContents(false, false); | |||
401 | TargetLowering::BooleanContent VecBool = TLI.getBooleanContents(true, false); | |||
402 | ||||
403 | // If integer and float booleans have different contents then we can't | |||
404 | // reliably optimize in all cases. There is a full explanation for this in | |||
405 | // DAGCombiner::visitSELECT() where the same issue affects folding | |||
406 | // (select C, 0, 1) to (xor C, 1). | |||
407 | if (TLI.getBooleanContents(false, false) != | |||
408 | TLI.getBooleanContents(false, true)) { | |||
409 | // At least try the common case where the boolean is generated by a | |||
410 | // comparison. | |||
411 | if (Cond->getOpcode() == ISD::SETCC) { | |||
412 | EVT OpVT = Cond->getOperand(0).getValueType(); | |||
413 | ScalarBool = TLI.getBooleanContents(OpVT.getScalarType()); | |||
414 | VecBool = TLI.getBooleanContents(OpVT); | |||
415 | } else | |||
416 | ScalarBool = TargetLowering::UndefinedBooleanContent; | |||
417 | } | |||
418 | ||||
419 | EVT CondVT = Cond.getValueType(); | |||
420 | if (ScalarBool != VecBool) { | |||
421 | switch (ScalarBool) { | |||
422 | case TargetLowering::UndefinedBooleanContent: | |||
423 | break; | |||
424 | case TargetLowering::ZeroOrOneBooleanContent: | |||
425 | assert(VecBool == TargetLowering::UndefinedBooleanContent ||((VecBool == TargetLowering::UndefinedBooleanContent || VecBool == TargetLowering::ZeroOrNegativeOneBooleanContent) ? static_cast <void> (0) : __assert_fail ("VecBool == TargetLowering::UndefinedBooleanContent || VecBool == TargetLowering::ZeroOrNegativeOneBooleanContent" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 426, __PRETTY_FUNCTION__)) | |||
426 | VecBool == TargetLowering::ZeroOrNegativeOneBooleanContent)((VecBool == TargetLowering::UndefinedBooleanContent || VecBool == TargetLowering::ZeroOrNegativeOneBooleanContent) ? static_cast <void> (0) : __assert_fail ("VecBool == TargetLowering::UndefinedBooleanContent || VecBool == TargetLowering::ZeroOrNegativeOneBooleanContent" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 426, __PRETTY_FUNCTION__)); | |||
427 | // Vector read from all ones, scalar expects a single 1 so mask. | |||
428 | Cond = DAG.getNode(ISD::AND, SDLoc(N), CondVT, | |||
429 | Cond, DAG.getConstant(1, SDLoc(N), CondVT)); | |||
430 | break; | |||
431 | case TargetLowering::ZeroOrNegativeOneBooleanContent: | |||
432 | assert(VecBool == TargetLowering::UndefinedBooleanContent ||((VecBool == TargetLowering::UndefinedBooleanContent || VecBool == TargetLowering::ZeroOrOneBooleanContent) ? static_cast< void> (0) : __assert_fail ("VecBool == TargetLowering::UndefinedBooleanContent || VecBool == TargetLowering::ZeroOrOneBooleanContent" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 433, __PRETTY_FUNCTION__)) | |||
433 | VecBool == TargetLowering::ZeroOrOneBooleanContent)((VecBool == TargetLowering::UndefinedBooleanContent || VecBool == TargetLowering::ZeroOrOneBooleanContent) ? static_cast< void> (0) : __assert_fail ("VecBool == TargetLowering::UndefinedBooleanContent || VecBool == TargetLowering::ZeroOrOneBooleanContent" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 433, __PRETTY_FUNCTION__)); | |||
434 | // Vector reads from a one, scalar from all ones so sign extend. | |||
435 | Cond = DAG.getNode(ISD::SIGN_EXTEND_INREG, SDLoc(N), CondVT, | |||
436 | Cond, DAG.getValueType(MVT::i1)); | |||
437 | break; | |||
438 | } | |||
439 | } | |||
440 | ||||
441 | // Truncate the condition if needed | |||
442 | auto BoolVT = getSetCCResultType(CondVT); | |||
443 | if (BoolVT.bitsLT(CondVT)) | |||
444 | Cond = DAG.getNode(ISD::TRUNCATE, SDLoc(N), BoolVT, Cond); | |||
445 | ||||
446 | return DAG.getSelect(SDLoc(N), | |||
447 | LHS.getValueType(), Cond, LHS, | |||
448 | GetScalarizedVector(N->getOperand(2))); | |||
449 | } | |||
450 | ||||
451 | SDValue DAGTypeLegalizer::ScalarizeVecRes_SELECT(SDNode *N) { | |||
452 | SDValue LHS = GetScalarizedVector(N->getOperand(1)); | |||
453 | return DAG.getSelect(SDLoc(N), | |||
454 | LHS.getValueType(), N->getOperand(0), LHS, | |||
455 | GetScalarizedVector(N->getOperand(2))); | |||
456 | } | |||
457 | ||||
458 | SDValue DAGTypeLegalizer::ScalarizeVecRes_SELECT_CC(SDNode *N) { | |||
459 | SDValue LHS = GetScalarizedVector(N->getOperand(2)); | |||
460 | return DAG.getNode(ISD::SELECT_CC, SDLoc(N), LHS.getValueType(), | |||
461 | N->getOperand(0), N->getOperand(1), | |||
462 | LHS, GetScalarizedVector(N->getOperand(3)), | |||
463 | N->getOperand(4)); | |||
464 | } | |||
465 | ||||
466 | SDValue DAGTypeLegalizer::ScalarizeVecRes_UNDEF(SDNode *N) { | |||
467 | return DAG.getUNDEF(N->getValueType(0).getVectorElementType()); | |||
468 | } | |||
469 | ||||
470 | SDValue DAGTypeLegalizer::ScalarizeVecRes_VECTOR_SHUFFLE(SDNode *N) { | |||
471 | // Figure out if the scalar is the LHS or RHS and return it. | |||
472 | SDValue Arg = N->getOperand(2).getOperand(0); | |||
473 | if (Arg.isUndef()) | |||
474 | return DAG.getUNDEF(N->getValueType(0).getVectorElementType()); | |||
475 | unsigned Op = !cast<ConstantSDNode>(Arg)->isNullValue(); | |||
476 | return GetScalarizedVector(N->getOperand(Op)); | |||
477 | } | |||
478 | ||||
479 | SDValue DAGTypeLegalizer::ScalarizeVecRes_SETCC(SDNode *N) { | |||
480 | assert(N->getValueType(0).isVector() &&((N->getValueType(0).isVector() && N->getOperand (0).getValueType().isVector() && "Operand types must be vectors" ) ? static_cast<void> (0) : __assert_fail ("N->getValueType(0).isVector() && N->getOperand(0).getValueType().isVector() && \"Operand types must be vectors\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 482, __PRETTY_FUNCTION__)) | |||
481 | N->getOperand(0).getValueType().isVector() &&((N->getValueType(0).isVector() && N->getOperand (0).getValueType().isVector() && "Operand types must be vectors" ) ? static_cast<void> (0) : __assert_fail ("N->getValueType(0).isVector() && N->getOperand(0).getValueType().isVector() && \"Operand types must be vectors\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 482, __PRETTY_FUNCTION__)) | |||
482 | "Operand types must be vectors")((N->getValueType(0).isVector() && N->getOperand (0).getValueType().isVector() && "Operand types must be vectors" ) ? static_cast<void> (0) : __assert_fail ("N->getValueType(0).isVector() && N->getOperand(0).getValueType().isVector() && \"Operand types must be vectors\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 482, __PRETTY_FUNCTION__)); | |||
483 | SDValue LHS = N->getOperand(0); | |||
484 | SDValue RHS = N->getOperand(1); | |||
485 | EVT OpVT = LHS.getValueType(); | |||
486 | EVT NVT = N->getValueType(0).getVectorElementType(); | |||
487 | SDLoc DL(N); | |||
488 | ||||
489 | // The result needs scalarizing, but it's not a given that the source does. | |||
490 | if (getTypeAction(OpVT) == TargetLowering::TypeScalarizeVector) { | |||
491 | LHS = GetScalarizedVector(LHS); | |||
492 | RHS = GetScalarizedVector(RHS); | |||
493 | } else { | |||
494 | EVT VT = OpVT.getVectorElementType(); | |||
495 | LHS = DAG.getNode( | |||
496 | ISD::EXTRACT_VECTOR_ELT, DL, VT, LHS, | |||
497 | DAG.getConstant(0, DL, TLI.getVectorIdxTy(DAG.getDataLayout()))); | |||
498 | RHS = DAG.getNode( | |||
499 | ISD::EXTRACT_VECTOR_ELT, DL, VT, RHS, | |||
500 | DAG.getConstant(0, DL, TLI.getVectorIdxTy(DAG.getDataLayout()))); | |||
501 | } | |||
502 | ||||
503 | // Turn it into a scalar SETCC. | |||
504 | SDValue Res = DAG.getNode(ISD::SETCC, DL, MVT::i1, LHS, RHS, | |||
505 | N->getOperand(2)); | |||
506 | // Vectors may have a different boolean contents to scalars. Promote the | |||
507 | // value appropriately. | |||
508 | ISD::NodeType ExtendCode = | |||
509 | TargetLowering::getExtendForContent(TLI.getBooleanContents(OpVT)); | |||
510 | return DAG.getNode(ExtendCode, DL, NVT, Res); | |||
511 | } | |||
512 | ||||
513 | ||||
514 | //===----------------------------------------------------------------------===// | |||
515 | // Operand Vector Scalarization <1 x ty> -> ty. | |||
516 | //===----------------------------------------------------------------------===// | |||
517 | ||||
518 | bool DAGTypeLegalizer::ScalarizeVectorOperand(SDNode *N, unsigned OpNo) { | |||
519 | LLVM_DEBUG(dbgs() << "Scalarize node operand " << OpNo << ": "; N->dump(&DAG);do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType ("legalize-types")) { dbgs() << "Scalarize node operand " << OpNo << ": "; N->dump(&DAG); dbgs() << "\n"; } } while (false) | |||
520 | dbgs() << "\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType ("legalize-types")) { dbgs() << "Scalarize node operand " << OpNo << ": "; N->dump(&DAG); dbgs() << "\n"; } } while (false); | |||
521 | SDValue Res = SDValue(); | |||
522 | ||||
523 | if (!Res.getNode()) { | |||
524 | switch (N->getOpcode()) { | |||
525 | default: | |||
526 | #ifndef NDEBUG | |||
527 | dbgs() << "ScalarizeVectorOperand Op #" << OpNo << ": "; | |||
528 | N->dump(&DAG); | |||
529 | dbgs() << "\n"; | |||
530 | #endif | |||
531 | report_fatal_error("Do not know how to scalarize this operator's " | |||
532 | "operand!\n"); | |||
533 | case ISD::BITCAST: | |||
534 | Res = ScalarizeVecOp_BITCAST(N); | |||
535 | break; | |||
536 | case ISD::ANY_EXTEND: | |||
537 | case ISD::ZERO_EXTEND: | |||
538 | case ISD::SIGN_EXTEND: | |||
539 | case ISD::TRUNCATE: | |||
540 | case ISD::FP_TO_SINT: | |||
541 | case ISD::FP_TO_UINT: | |||
542 | case ISD::SINT_TO_FP: | |||
543 | case ISD::UINT_TO_FP: | |||
544 | Res = ScalarizeVecOp_UnaryOp(N); | |||
545 | break; | |||
546 | case ISD::CONCAT_VECTORS: | |||
547 | Res = ScalarizeVecOp_CONCAT_VECTORS(N); | |||
548 | break; | |||
549 | case ISD::EXTRACT_VECTOR_ELT: | |||
550 | Res = ScalarizeVecOp_EXTRACT_VECTOR_ELT(N); | |||
551 | break; | |||
552 | case ISD::VSELECT: | |||
553 | Res = ScalarizeVecOp_VSELECT(N); | |||
554 | break; | |||
555 | case ISD::SETCC: | |||
556 | Res = ScalarizeVecOp_VSETCC(N); | |||
557 | break; | |||
558 | case ISD::STORE: | |||
559 | Res = ScalarizeVecOp_STORE(cast<StoreSDNode>(N), OpNo); | |||
560 | break; | |||
561 | case ISD::FP_ROUND: | |||
562 | Res = ScalarizeVecOp_FP_ROUND(N, OpNo); | |||
563 | break; | |||
564 | } | |||
565 | } | |||
566 | ||||
567 | // If the result is null, the sub-method took care of registering results etc. | |||
568 | if (!Res.getNode()) return false; | |||
569 | ||||
570 | // If the result is N, the sub-method updated N in place. Tell the legalizer | |||
571 | // core about this. | |||
572 | if (Res.getNode() == N) | |||
573 | return true; | |||
574 | ||||
575 | assert(Res.getValueType() == N->getValueType(0) && N->getNumValues() == 1 &&((Res.getValueType() == N->getValueType(0) && N-> getNumValues() == 1 && "Invalid operand expansion") ? static_cast<void> (0) : __assert_fail ("Res.getValueType() == N->getValueType(0) && N->getNumValues() == 1 && \"Invalid operand expansion\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 576, __PRETTY_FUNCTION__)) | |||
576 | "Invalid operand expansion")((Res.getValueType() == N->getValueType(0) && N-> getNumValues() == 1 && "Invalid operand expansion") ? static_cast<void> (0) : __assert_fail ("Res.getValueType() == N->getValueType(0) && N->getNumValues() == 1 && \"Invalid operand expansion\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 576, __PRETTY_FUNCTION__)); | |||
577 | ||||
578 | ReplaceValueWith(SDValue(N, 0), Res); | |||
579 | return false; | |||
580 | } | |||
581 | ||||
582 | /// If the value to convert is a vector that needs to be scalarized, it must be | |||
583 | /// <1 x ty>. Convert the element instead. | |||
584 | SDValue DAGTypeLegalizer::ScalarizeVecOp_BITCAST(SDNode *N) { | |||
585 | SDValue Elt = GetScalarizedVector(N->getOperand(0)); | |||
586 | return DAG.getNode(ISD::BITCAST, SDLoc(N), | |||
587 | N->getValueType(0), Elt); | |||
588 | } | |||
589 | ||||
590 | /// If the input is a vector that needs to be scalarized, it must be <1 x ty>. | |||
591 | /// Do the operation on the element instead. | |||
592 | SDValue DAGTypeLegalizer::ScalarizeVecOp_UnaryOp(SDNode *N) { | |||
593 | assert(N->getValueType(0).getVectorNumElements() == 1 &&((N->getValueType(0).getVectorNumElements() == 1 && "Unexpected vector type!") ? static_cast<void> (0) : __assert_fail ("N->getValueType(0).getVectorNumElements() == 1 && \"Unexpected vector type!\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 594, __PRETTY_FUNCTION__)) | |||
594 | "Unexpected vector type!")((N->getValueType(0).getVectorNumElements() == 1 && "Unexpected vector type!") ? static_cast<void> (0) : __assert_fail ("N->getValueType(0).getVectorNumElements() == 1 && \"Unexpected vector type!\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 594, __PRETTY_FUNCTION__)); | |||
595 | SDValue Elt = GetScalarizedVector(N->getOperand(0)); | |||
596 | SDValue Op = DAG.getNode(N->getOpcode(), SDLoc(N), | |||
597 | N->getValueType(0).getScalarType(), Elt); | |||
598 | // Revectorize the result so the types line up with what the uses of this | |||
599 | // expression expect. | |||
600 | return DAG.getNode(ISD::SCALAR_TO_VECTOR, SDLoc(N), N->getValueType(0), Op); | |||
601 | } | |||
602 | ||||
603 | /// The vectors to concatenate have length one - use a BUILD_VECTOR instead. | |||
604 | SDValue DAGTypeLegalizer::ScalarizeVecOp_CONCAT_VECTORS(SDNode *N) { | |||
605 | SmallVector<SDValue, 8> Ops(N->getNumOperands()); | |||
606 | for (unsigned i = 0, e = N->getNumOperands(); i < e; ++i) | |||
607 | Ops[i] = GetScalarizedVector(N->getOperand(i)); | |||
608 | return DAG.getBuildVector(N->getValueType(0), SDLoc(N), Ops); | |||
609 | } | |||
610 | ||||
611 | /// If the input is a vector that needs to be scalarized, it must be <1 x ty>, | |||
612 | /// so just return the element, ignoring the index. | |||
613 | SDValue DAGTypeLegalizer::ScalarizeVecOp_EXTRACT_VECTOR_ELT(SDNode *N) { | |||
614 | EVT VT = N->getValueType(0); | |||
615 | SDValue Res = GetScalarizedVector(N->getOperand(0)); | |||
616 | if (Res.getValueType() != VT) | |||
617 | Res = VT.isFloatingPoint() | |||
618 | ? DAG.getNode(ISD::FP_EXTEND, SDLoc(N), VT, Res) | |||
619 | : DAG.getNode(ISD::ANY_EXTEND, SDLoc(N), VT, Res); | |||
620 | return Res; | |||
621 | } | |||
622 | ||||
623 | /// If the input condition is a vector that needs to be scalarized, it must be | |||
624 | /// <1 x i1>, so just convert to a normal ISD::SELECT | |||
625 | /// (still with vector output type since that was acceptable if we got here). | |||
626 | SDValue DAGTypeLegalizer::ScalarizeVecOp_VSELECT(SDNode *N) { | |||
627 | SDValue ScalarCond = GetScalarizedVector(N->getOperand(0)); | |||
628 | EVT VT = N->getValueType(0); | |||
629 | ||||
630 | return DAG.getNode(ISD::SELECT, SDLoc(N), VT, ScalarCond, N->getOperand(1), | |||
631 | N->getOperand(2)); | |||
632 | } | |||
633 | ||||
634 | /// If the operand is a vector that needs to be scalarized then the | |||
635 | /// result must be v1i1, so just convert to a scalar SETCC and wrap | |||
636 | /// with a scalar_to_vector since the res type is legal if we got here | |||
637 | SDValue DAGTypeLegalizer::ScalarizeVecOp_VSETCC(SDNode *N) { | |||
638 | assert(N->getValueType(0).isVector() &&((N->getValueType(0).isVector() && N->getOperand (0).getValueType().isVector() && "Operand types must be vectors" ) ? static_cast<void> (0) : __assert_fail ("N->getValueType(0).isVector() && N->getOperand(0).getValueType().isVector() && \"Operand types must be vectors\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 640, __PRETTY_FUNCTION__)) | |||
639 | N->getOperand(0).getValueType().isVector() &&((N->getValueType(0).isVector() && N->getOperand (0).getValueType().isVector() && "Operand types must be vectors" ) ? static_cast<void> (0) : __assert_fail ("N->getValueType(0).isVector() && N->getOperand(0).getValueType().isVector() && \"Operand types must be vectors\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 640, __PRETTY_FUNCTION__)) | |||
640 | "Operand types must be vectors")((N->getValueType(0).isVector() && N->getOperand (0).getValueType().isVector() && "Operand types must be vectors" ) ? static_cast<void> (0) : __assert_fail ("N->getValueType(0).isVector() && N->getOperand(0).getValueType().isVector() && \"Operand types must be vectors\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 640, __PRETTY_FUNCTION__)); | |||
641 | assert(N->getValueType(0) == MVT::v1i1 && "Expected v1i1 type")((N->getValueType(0) == MVT::v1i1 && "Expected v1i1 type" ) ? static_cast<void> (0) : __assert_fail ("N->getValueType(0) == MVT::v1i1 && \"Expected v1i1 type\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 641, __PRETTY_FUNCTION__)); | |||
642 | ||||
643 | EVT VT = N->getValueType(0); | |||
644 | SDValue LHS = GetScalarizedVector(N->getOperand(0)); | |||
645 | SDValue RHS = GetScalarizedVector(N->getOperand(1)); | |||
646 | ||||
647 | EVT OpVT = N->getOperand(0).getValueType(); | |||
648 | EVT NVT = VT.getVectorElementType(); | |||
649 | SDLoc DL(N); | |||
650 | // Turn it into a scalar SETCC. | |||
651 | SDValue Res = DAG.getNode(ISD::SETCC, DL, MVT::i1, LHS, RHS, | |||
652 | N->getOperand(2)); | |||
653 | ||||
654 | // Vectors may have a different boolean contents to scalars. Promote the | |||
655 | // value appropriately. | |||
656 | ISD::NodeType ExtendCode = | |||
657 | TargetLowering::getExtendForContent(TLI.getBooleanContents(OpVT)); | |||
658 | ||||
659 | Res = DAG.getNode(ExtendCode, DL, NVT, Res); | |||
660 | ||||
661 | return DAG.getNode(ISD::SCALAR_TO_VECTOR, DL, VT, Res); | |||
662 | } | |||
663 | ||||
664 | /// If the value to store is a vector that needs to be scalarized, it must be | |||
665 | /// <1 x ty>. Just store the element. | |||
666 | SDValue DAGTypeLegalizer::ScalarizeVecOp_STORE(StoreSDNode *N, unsigned OpNo){ | |||
667 | assert(N->isUnindexed() && "Indexed store of one-element vector?")((N->isUnindexed() && "Indexed store of one-element vector?" ) ? static_cast<void> (0) : __assert_fail ("N->isUnindexed() && \"Indexed store of one-element vector?\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 667, __PRETTY_FUNCTION__)); | |||
668 | assert(OpNo == 1 && "Do not know how to scalarize this operand!")((OpNo == 1 && "Do not know how to scalarize this operand!" ) ? static_cast<void> (0) : __assert_fail ("OpNo == 1 && \"Do not know how to scalarize this operand!\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 668, __PRETTY_FUNCTION__)); | |||
669 | SDLoc dl(N); | |||
670 | ||||
671 | if (N->isTruncatingStore()) | |||
672 | return DAG.getTruncStore( | |||
673 | N->getChain(), dl, GetScalarizedVector(N->getOperand(1)), | |||
674 | N->getBasePtr(), N->getPointerInfo(), | |||
675 | N->getMemoryVT().getVectorElementType(), N->getAlignment(), | |||
676 | N->getMemOperand()->getFlags(), N->getAAInfo()); | |||
677 | ||||
678 | return DAG.getStore(N->getChain(), dl, GetScalarizedVector(N->getOperand(1)), | |||
679 | N->getBasePtr(), N->getPointerInfo(), | |||
680 | N->getOriginalAlignment(), N->getMemOperand()->getFlags(), | |||
681 | N->getAAInfo()); | |||
682 | } | |||
683 | ||||
684 | /// If the value to round is a vector that needs to be scalarized, it must be | |||
685 | /// <1 x ty>. Convert the element instead. | |||
686 | SDValue DAGTypeLegalizer::ScalarizeVecOp_FP_ROUND(SDNode *N, unsigned OpNo) { | |||
687 | SDValue Elt = GetScalarizedVector(N->getOperand(0)); | |||
688 | SDValue Res = DAG.getNode(ISD::FP_ROUND, SDLoc(N), | |||
689 | N->getValueType(0).getVectorElementType(), Elt, | |||
690 | N->getOperand(1)); | |||
691 | return DAG.getNode(ISD::SCALAR_TO_VECTOR, SDLoc(N), N->getValueType(0), Res); | |||
692 | } | |||
693 | ||||
694 | //===----------------------------------------------------------------------===// | |||
695 | // Result Vector Splitting | |||
696 | //===----------------------------------------------------------------------===// | |||
697 | ||||
698 | /// This method is called when the specified result of the specified node is | |||
699 | /// found to need vector splitting. At this point, the node may also have | |||
700 | /// invalid operands or may have other results that need legalization, we just | |||
701 | /// know that (at least) one result needs vector splitting. | |||
702 | void DAGTypeLegalizer::SplitVectorResult(SDNode *N, unsigned ResNo) { | |||
703 | LLVM_DEBUG(dbgs() << "Split node result: "; N->dump(&DAG); dbgs() << "\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType ("legalize-types")) { dbgs() << "Split node result: "; N ->dump(&DAG); dbgs() << "\n"; } } while (false); | |||
704 | SDValue Lo, Hi; | |||
705 | ||||
706 | // See if the target wants to custom expand this node. | |||
707 | if (CustomLowerNode(N, N->getValueType(ResNo), true)) | |||
708 | return; | |||
709 | ||||
710 | switch (N->getOpcode()) { | |||
711 | default: | |||
712 | #ifndef NDEBUG | |||
713 | dbgs() << "SplitVectorResult #" << ResNo << ": "; | |||
714 | N->dump(&DAG); | |||
715 | dbgs() << "\n"; | |||
716 | #endif | |||
717 | report_fatal_error("Do not know how to split the result of this " | |||
718 | "operator!\n"); | |||
719 | ||||
720 | case ISD::MERGE_VALUES: SplitRes_MERGE_VALUES(N, ResNo, Lo, Hi); break; | |||
721 | case ISD::VSELECT: | |||
722 | case ISD::SELECT: SplitRes_SELECT(N, Lo, Hi); break; | |||
723 | case ISD::SELECT_CC: SplitRes_SELECT_CC(N, Lo, Hi); break; | |||
724 | case ISD::UNDEF: SplitRes_UNDEF(N, Lo, Hi); break; | |||
725 | case ISD::BITCAST: SplitVecRes_BITCAST(N, Lo, Hi); break; | |||
726 | case ISD::BUILD_VECTOR: SplitVecRes_BUILD_VECTOR(N, Lo, Hi); break; | |||
727 | case ISD::CONCAT_VECTORS: SplitVecRes_CONCAT_VECTORS(N, Lo, Hi); break; | |||
728 | case ISD::EXTRACT_SUBVECTOR: SplitVecRes_EXTRACT_SUBVECTOR(N, Lo, Hi); break; | |||
729 | case ISD::INSERT_SUBVECTOR: SplitVecRes_INSERT_SUBVECTOR(N, Lo, Hi); break; | |||
730 | case ISD::FP_ROUND_INREG: SplitVecRes_InregOp(N, Lo, Hi); break; | |||
731 | case ISD::FPOWI: SplitVecRes_FPOWI(N, Lo, Hi); break; | |||
732 | case ISD::FCOPYSIGN: SplitVecRes_FCOPYSIGN(N, Lo, Hi); break; | |||
733 | case ISD::INSERT_VECTOR_ELT: SplitVecRes_INSERT_VECTOR_ELT(N, Lo, Hi); break; | |||
734 | case ISD::SCALAR_TO_VECTOR: SplitVecRes_SCALAR_TO_VECTOR(N, Lo, Hi); break; | |||
735 | case ISD::SIGN_EXTEND_INREG: SplitVecRes_InregOp(N, Lo, Hi); break; | |||
736 | case ISD::LOAD: | |||
737 | SplitVecRes_LOAD(cast<LoadSDNode>(N), Lo, Hi); | |||
738 | break; | |||
739 | case ISD::MLOAD: | |||
740 | SplitVecRes_MLOAD(cast<MaskedLoadSDNode>(N), Lo, Hi); | |||
741 | break; | |||
742 | case ISD::MGATHER: | |||
743 | SplitVecRes_MGATHER(cast<MaskedGatherSDNode>(N), Lo, Hi); | |||
744 | break; | |||
745 | case ISD::SETCC: | |||
746 | SplitVecRes_SETCC(N, Lo, Hi); | |||
747 | break; | |||
748 | case ISD::VECTOR_SHUFFLE: | |||
749 | SplitVecRes_VECTOR_SHUFFLE(cast<ShuffleVectorSDNode>(N), Lo, Hi); | |||
750 | break; | |||
751 | ||||
752 | case ISD::ANY_EXTEND_VECTOR_INREG: | |||
753 | case ISD::SIGN_EXTEND_VECTOR_INREG: | |||
754 | case ISD::ZERO_EXTEND_VECTOR_INREG: | |||
755 | SplitVecRes_ExtVecInRegOp(N, Lo, Hi); | |||
756 | break; | |||
757 | ||||
758 | case ISD::BITREVERSE: | |||
759 | case ISD::BSWAP: | |||
760 | case ISD::CTLZ: | |||
761 | case ISD::CTTZ: | |||
762 | case ISD::CTLZ_ZERO_UNDEF: | |||
763 | case ISD::CTTZ_ZERO_UNDEF: | |||
764 | case ISD::CTPOP: | |||
765 | case ISD::FABS: | |||
766 | case ISD::FCEIL: | |||
767 | case ISD::FCOS: | |||
768 | case ISD::FEXP: | |||
769 | case ISD::FEXP2: | |||
770 | case ISD::FFLOOR: | |||
771 | case ISD::FLOG: | |||
772 | case ISD::FLOG10: | |||
773 | case ISD::FLOG2: | |||
774 | case ISD::FNEARBYINT: | |||
775 | case ISD::FNEG: | |||
776 | case ISD::FP_EXTEND: | |||
777 | case ISD::FP_ROUND: | |||
778 | case ISD::FP_TO_SINT: | |||
779 | case ISD::FP_TO_UINT: | |||
780 | case ISD::FRINT: | |||
781 | case ISD::FROUND: | |||
782 | case ISD::FSIN: | |||
783 | case ISD::FSQRT: | |||
784 | case ISD::FTRUNC: | |||
785 | case ISD::SINT_TO_FP: | |||
786 | case ISD::TRUNCATE: | |||
787 | case ISD::UINT_TO_FP: | |||
788 | case ISD::FCANONICALIZE: | |||
789 | SplitVecRes_UnaryOp(N, Lo, Hi); | |||
790 | break; | |||
791 | ||||
792 | case ISD::ANY_EXTEND: | |||
793 | case ISD::SIGN_EXTEND: | |||
794 | case ISD::ZERO_EXTEND: | |||
795 | SplitVecRes_ExtendOp(N, Lo, Hi); | |||
796 | break; | |||
797 | ||||
798 | case ISD::ADD: | |||
799 | case ISD::SUB: | |||
800 | case ISD::MUL: | |||
801 | case ISD::MULHS: | |||
802 | case ISD::MULHU: | |||
803 | case ISD::FADD: | |||
804 | case ISD::FSUB: | |||
805 | case ISD::FMUL: | |||
806 | case ISD::FMINNUM: | |||
807 | case ISD::FMAXNUM: | |||
808 | case ISD::FMINIMUM: | |||
809 | case ISD::FMAXIMUM: | |||
810 | case ISD::SDIV: | |||
811 | case ISD::UDIV: | |||
812 | case ISD::FDIV: | |||
813 | case ISD::FPOW: | |||
814 | case ISD::AND: | |||
815 | case ISD::OR: | |||
816 | case ISD::XOR: | |||
817 | case ISD::SHL: | |||
818 | case ISD::SRA: | |||
819 | case ISD::SRL: | |||
820 | case ISD::UREM: | |||
821 | case ISD::SREM: | |||
822 | case ISD::FREM: | |||
823 | case ISD::SMIN: | |||
824 | case ISD::SMAX: | |||
825 | case ISD::UMIN: | |||
826 | case ISD::UMAX: | |||
827 | case ISD::SADDSAT: | |||
828 | case ISD::UADDSAT: | |||
829 | case ISD::SSUBSAT: | |||
830 | case ISD::USUBSAT: | |||
831 | SplitVecRes_BinOp(N, Lo, Hi); | |||
832 | break; | |||
833 | case ISD::FMA: | |||
834 | SplitVecRes_TernaryOp(N, Lo, Hi); | |||
835 | break; | |||
836 | case ISD::STRICT_FADD: | |||
837 | case ISD::STRICT_FSUB: | |||
838 | case ISD::STRICT_FMUL: | |||
839 | case ISD::STRICT_FDIV: | |||
840 | case ISD::STRICT_FREM: | |||
841 | case ISD::STRICT_FSQRT: | |||
842 | case ISD::STRICT_FMA: | |||
843 | case ISD::STRICT_FPOW: | |||
844 | case ISD::STRICT_FPOWI: | |||
845 | case ISD::STRICT_FSIN: | |||
846 | case ISD::STRICT_FCOS: | |||
847 | case ISD::STRICT_FEXP: | |||
848 | case ISD::STRICT_FEXP2: | |||
849 | case ISD::STRICT_FLOG: | |||
850 | case ISD::STRICT_FLOG10: | |||
851 | case ISD::STRICT_FLOG2: | |||
852 | case ISD::STRICT_FRINT: | |||
853 | case ISD::STRICT_FNEARBYINT: | |||
854 | case ISD::STRICT_FMAXNUM: | |||
855 | case ISD::STRICT_FMINNUM: | |||
856 | case ISD::STRICT_FCEIL: | |||
857 | case ISD::STRICT_FFLOOR: | |||
858 | case ISD::STRICT_FROUND: | |||
859 | case ISD::STRICT_FTRUNC: | |||
860 | SplitVecRes_StrictFPOp(N, Lo, Hi); | |||
861 | break; | |||
862 | case ISD::SMULFIX: | |||
863 | SplitVecRes_SMULFIX(N, Lo, Hi); | |||
864 | break; | |||
865 | } | |||
866 | ||||
867 | // If Lo/Hi is null, the sub-method took care of registering results etc. | |||
868 | if (Lo.getNode()) | |||
869 | SetSplitVector(SDValue(N, ResNo), Lo, Hi); | |||
870 | } | |||
871 | ||||
872 | void DAGTypeLegalizer::SplitVecRes_BinOp(SDNode *N, SDValue &Lo, | |||
873 | SDValue &Hi) { | |||
874 | SDValue LHSLo, LHSHi; | |||
875 | GetSplitVector(N->getOperand(0), LHSLo, LHSHi); | |||
876 | SDValue RHSLo, RHSHi; | |||
877 | GetSplitVector(N->getOperand(1), RHSLo, RHSHi); | |||
878 | SDLoc dl(N); | |||
879 | ||||
880 | const SDNodeFlags Flags = N->getFlags(); | |||
881 | unsigned Opcode = N->getOpcode(); | |||
882 | Lo = DAG.getNode(Opcode, dl, LHSLo.getValueType(), LHSLo, RHSLo, Flags); | |||
883 | Hi = DAG.getNode(Opcode, dl, LHSHi.getValueType(), LHSHi, RHSHi, Flags); | |||
884 | } | |||
885 | ||||
886 | void DAGTypeLegalizer::SplitVecRes_TernaryOp(SDNode *N, SDValue &Lo, | |||
887 | SDValue &Hi) { | |||
888 | SDValue Op0Lo, Op0Hi; | |||
889 | GetSplitVector(N->getOperand(0), Op0Lo, Op0Hi); | |||
890 | SDValue Op1Lo, Op1Hi; | |||
891 | GetSplitVector(N->getOperand(1), Op1Lo, Op1Hi); | |||
892 | SDValue Op2Lo, Op2Hi; | |||
893 | GetSplitVector(N->getOperand(2), Op2Lo, Op2Hi); | |||
894 | SDLoc dl(N); | |||
895 | ||||
896 | Lo = DAG.getNode(N->getOpcode(), dl, Op0Lo.getValueType(), | |||
897 | Op0Lo, Op1Lo, Op2Lo); | |||
898 | Hi = DAG.getNode(N->getOpcode(), dl, Op0Hi.getValueType(), | |||
899 | Op0Hi, Op1Hi, Op2Hi); | |||
900 | } | |||
901 | ||||
902 | void DAGTypeLegalizer::SplitVecRes_SMULFIX(SDNode *N, SDValue &Lo, | |||
903 | SDValue &Hi) { | |||
904 | SDValue LHSLo, LHSHi; | |||
905 | GetSplitVector(N->getOperand(0), LHSLo, LHSHi); | |||
906 | SDValue RHSLo, RHSHi; | |||
907 | GetSplitVector(N->getOperand(1), RHSLo, RHSHi); | |||
908 | SDLoc dl(N); | |||
909 | SDValue Op2 = N->getOperand(2); | |||
910 | ||||
911 | unsigned Opcode = N->getOpcode(); | |||
912 | Lo = DAG.getNode(Opcode, dl, LHSLo.getValueType(), LHSLo, RHSLo, Op2); | |||
913 | Hi = DAG.getNode(Opcode, dl, LHSHi.getValueType(), LHSHi, RHSHi, Op2); | |||
914 | } | |||
915 | ||||
916 | void DAGTypeLegalizer::SplitVecRes_BITCAST(SDNode *N, SDValue &Lo, | |||
917 | SDValue &Hi) { | |||
918 | // We know the result is a vector. The input may be either a vector or a | |||
919 | // scalar value. | |||
920 | EVT LoVT, HiVT; | |||
921 | std::tie(LoVT, HiVT) = DAG.GetSplitDestVTs(N->getValueType(0)); | |||
922 | SDLoc dl(N); | |||
923 | ||||
924 | SDValue InOp = N->getOperand(0); | |||
925 | EVT InVT = InOp.getValueType(); | |||
926 | ||||
927 | // Handle some special cases efficiently. | |||
928 | switch (getTypeAction(InVT)) { | |||
929 | case TargetLowering::TypeLegal: | |||
930 | case TargetLowering::TypePromoteInteger: | |||
931 | case TargetLowering::TypePromoteFloat: | |||
932 | case TargetLowering::TypeSoftenFloat: | |||
933 | case TargetLowering::TypeScalarizeVector: | |||
934 | case TargetLowering::TypeWidenVector: | |||
935 | break; | |||
936 | case TargetLowering::TypeExpandInteger: | |||
937 | case TargetLowering::TypeExpandFloat: | |||
938 | // A scalar to vector conversion, where the scalar needs expansion. | |||
939 | // If the vector is being split in two then we can just convert the | |||
940 | // expanded pieces. | |||
941 | if (LoVT == HiVT) { | |||
942 | GetExpandedOp(InOp, Lo, Hi); | |||
943 | if (DAG.getDataLayout().isBigEndian()) | |||
944 | std::swap(Lo, Hi); | |||
945 | Lo = DAG.getNode(ISD::BITCAST, dl, LoVT, Lo); | |||
946 | Hi = DAG.getNode(ISD::BITCAST, dl, HiVT, Hi); | |||
947 | return; | |||
948 | } | |||
949 | break; | |||
950 | case TargetLowering::TypeSplitVector: | |||
951 | // If the input is a vector that needs to be split, convert each split | |||
952 | // piece of the input now. | |||
953 | GetSplitVector(InOp, Lo, Hi); | |||
954 | Lo = DAG.getNode(ISD::BITCAST, dl, LoVT, Lo); | |||
955 | Hi = DAG.getNode(ISD::BITCAST, dl, HiVT, Hi); | |||
956 | return; | |||
957 | } | |||
958 | ||||
959 | // In the general case, convert the input to an integer and split it by hand. | |||
960 | EVT LoIntVT = EVT::getIntegerVT(*DAG.getContext(), LoVT.getSizeInBits()); | |||
961 | EVT HiIntVT = EVT::getIntegerVT(*DAG.getContext(), HiVT.getSizeInBits()); | |||
962 | if (DAG.getDataLayout().isBigEndian()) | |||
963 | std::swap(LoIntVT, HiIntVT); | |||
964 | ||||
965 | SplitInteger(BitConvertToInteger(InOp), LoIntVT, HiIntVT, Lo, Hi); | |||
966 | ||||
967 | if (DAG.getDataLayout().isBigEndian()) | |||
968 | std::swap(Lo, Hi); | |||
969 | Lo = DAG.getNode(ISD::BITCAST, dl, LoVT, Lo); | |||
970 | Hi = DAG.getNode(ISD::BITCAST, dl, HiVT, Hi); | |||
971 | } | |||
972 | ||||
973 | void DAGTypeLegalizer::SplitVecRes_BUILD_VECTOR(SDNode *N, SDValue &Lo, | |||
974 | SDValue &Hi) { | |||
975 | EVT LoVT, HiVT; | |||
976 | SDLoc dl(N); | |||
977 | std::tie(LoVT, HiVT) = DAG.GetSplitDestVTs(N->getValueType(0)); | |||
978 | unsigned LoNumElts = LoVT.getVectorNumElements(); | |||
979 | SmallVector<SDValue, 8> LoOps(N->op_begin(), N->op_begin()+LoNumElts); | |||
980 | Lo = DAG.getBuildVector(LoVT, dl, LoOps); | |||
981 | ||||
982 | SmallVector<SDValue, 8> HiOps(N->op_begin()+LoNumElts, N->op_end()); | |||
983 | Hi = DAG.getBuildVector(HiVT, dl, HiOps); | |||
984 | } | |||
985 | ||||
986 | void DAGTypeLegalizer::SplitVecRes_CONCAT_VECTORS(SDNode *N, SDValue &Lo, | |||
987 | SDValue &Hi) { | |||
988 | assert(!(N->getNumOperands() & 1) && "Unsupported CONCAT_VECTORS")((!(N->getNumOperands() & 1) && "Unsupported CONCAT_VECTORS" ) ? static_cast<void> (0) : __assert_fail ("!(N->getNumOperands() & 1) && \"Unsupported CONCAT_VECTORS\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 988, __PRETTY_FUNCTION__)); | |||
989 | SDLoc dl(N); | |||
990 | unsigned NumSubvectors = N->getNumOperands() / 2; | |||
991 | if (NumSubvectors == 1) { | |||
992 | Lo = N->getOperand(0); | |||
993 | Hi = N->getOperand(1); | |||
994 | return; | |||
995 | } | |||
996 | ||||
997 | EVT LoVT, HiVT; | |||
998 | std::tie(LoVT, HiVT) = DAG.GetSplitDestVTs(N->getValueType(0)); | |||
999 | ||||
1000 | SmallVector<SDValue, 8> LoOps(N->op_begin(), N->op_begin()+NumSubvectors); | |||
1001 | Lo = DAG.getNode(ISD::CONCAT_VECTORS, dl, LoVT, LoOps); | |||
1002 | ||||
1003 | SmallVector<SDValue, 8> HiOps(N->op_begin()+NumSubvectors, N->op_end()); | |||
1004 | Hi = DAG.getNode(ISD::CONCAT_VECTORS, dl, HiVT, HiOps); | |||
1005 | } | |||
1006 | ||||
1007 | void DAGTypeLegalizer::SplitVecRes_EXTRACT_SUBVECTOR(SDNode *N, SDValue &Lo, | |||
1008 | SDValue &Hi) { | |||
1009 | SDValue Vec = N->getOperand(0); | |||
1010 | SDValue Idx = N->getOperand(1); | |||
1011 | SDLoc dl(N); | |||
1012 | ||||
1013 | EVT LoVT, HiVT; | |||
1014 | std::tie(LoVT, HiVT) = DAG.GetSplitDestVTs(N->getValueType(0)); | |||
1015 | ||||
1016 | Lo = DAG.getNode(ISD::EXTRACT_SUBVECTOR, dl, LoVT, Vec, Idx); | |||
1017 | uint64_t IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue(); | |||
1018 | Hi = DAG.getNode(ISD::EXTRACT_SUBVECTOR, dl, HiVT, Vec, | |||
1019 | DAG.getConstant(IdxVal + LoVT.getVectorNumElements(), dl, | |||
1020 | TLI.getVectorIdxTy(DAG.getDataLayout()))); | |||
1021 | } | |||
1022 | ||||
1023 | void DAGTypeLegalizer::SplitVecRes_INSERT_SUBVECTOR(SDNode *N, SDValue &Lo, | |||
1024 | SDValue &Hi) { | |||
1025 | SDValue Vec = N->getOperand(0); | |||
1026 | SDValue SubVec = N->getOperand(1); | |||
1027 | SDValue Idx = N->getOperand(2); | |||
1028 | SDLoc dl(N); | |||
1029 | GetSplitVector(Vec, Lo, Hi); | |||
1030 | ||||
1031 | EVT VecVT = Vec.getValueType(); | |||
1032 | unsigned VecElems = VecVT.getVectorNumElements(); | |||
1033 | unsigned SubElems = SubVec.getValueType().getVectorNumElements(); | |||
1034 | ||||
1035 | // If we know the index is 0, and we know the subvector doesn't cross the | |||
1036 | // boundary between the halves, we can avoid spilling the vector, and insert | |||
1037 | // into the lower half of the split vector directly. | |||
1038 | // TODO: The IdxVal == 0 constraint is artificial, we could do this whenever | |||
1039 | // the index is constant and there is no boundary crossing. But those cases | |||
1040 | // don't seem to get hit in practice. | |||
1041 | if (ConstantSDNode *ConstIdx = dyn_cast<ConstantSDNode>(Idx)) { | |||
1042 | unsigned IdxVal = ConstIdx->getZExtValue(); | |||
1043 | if ((IdxVal == 0) && (IdxVal + SubElems <= VecElems / 2)) { | |||
1044 | EVT LoVT, HiVT; | |||
1045 | std::tie(LoVT, HiVT) = DAG.GetSplitDestVTs(N->getValueType(0)); | |||
1046 | Lo = DAG.getNode(ISD::INSERT_SUBVECTOR, dl, LoVT, Lo, SubVec, Idx); | |||
1047 | return; | |||
1048 | } | |||
1049 | } | |||
1050 | ||||
1051 | // Spill the vector to the stack. | |||
1052 | SDValue StackPtr = DAG.CreateStackTemporary(VecVT); | |||
1053 | SDValue Store = | |||
1054 | DAG.getStore(DAG.getEntryNode(), dl, Vec, StackPtr, MachinePointerInfo()); | |||
1055 | ||||
1056 | // Store the new subvector into the specified index. | |||
1057 | SDValue SubVecPtr = TLI.getVectorElementPointer(DAG, StackPtr, VecVT, Idx); | |||
1058 | Type *VecType = VecVT.getTypeForEVT(*DAG.getContext()); | |||
1059 | unsigned Alignment = DAG.getDataLayout().getPrefTypeAlignment(VecType); | |||
1060 | Store = DAG.getStore(Store, dl, SubVec, SubVecPtr, MachinePointerInfo()); | |||
1061 | ||||
1062 | // Load the Lo part from the stack slot. | |||
1063 | Lo = | |||
1064 | DAG.getLoad(Lo.getValueType(), dl, Store, StackPtr, MachinePointerInfo()); | |||
1065 | ||||
1066 | // Increment the pointer to the other part. | |||
1067 | unsigned IncrementSize = Lo.getValueSizeInBits() / 8; | |||
1068 | StackPtr = | |||
1069 | DAG.getNode(ISD::ADD, dl, StackPtr.getValueType(), StackPtr, | |||
1070 | DAG.getConstant(IncrementSize, dl, StackPtr.getValueType())); | |||
1071 | ||||
1072 | // Load the Hi part from the stack slot. | |||
1073 | Hi = DAG.getLoad(Hi.getValueType(), dl, Store, StackPtr, MachinePointerInfo(), | |||
1074 | MinAlign(Alignment, IncrementSize)); | |||
1075 | } | |||
1076 | ||||
1077 | void DAGTypeLegalizer::SplitVecRes_FPOWI(SDNode *N, SDValue &Lo, | |||
1078 | SDValue &Hi) { | |||
1079 | SDLoc dl(N); | |||
1080 | GetSplitVector(N->getOperand(0), Lo, Hi); | |||
1081 | Lo = DAG.getNode(ISD::FPOWI, dl, Lo.getValueType(), Lo, N->getOperand(1)); | |||
1082 | Hi = DAG.getNode(ISD::FPOWI, dl, Hi.getValueType(), Hi, N->getOperand(1)); | |||
1083 | } | |||
1084 | ||||
1085 | void DAGTypeLegalizer::SplitVecRes_FCOPYSIGN(SDNode *N, SDValue &Lo, | |||
1086 | SDValue &Hi) { | |||
1087 | SDValue LHSLo, LHSHi; | |||
1088 | GetSplitVector(N->getOperand(0), LHSLo, LHSHi); | |||
1089 | SDLoc DL(N); | |||
1090 | ||||
1091 | SDValue RHSLo, RHSHi; | |||
1092 | SDValue RHS = N->getOperand(1); | |||
1093 | EVT RHSVT = RHS.getValueType(); | |||
1094 | if (getTypeAction(RHSVT) == TargetLowering::TypeSplitVector) | |||
1095 | GetSplitVector(RHS, RHSLo, RHSHi); | |||
1096 | else | |||
1097 | std::tie(RHSLo, RHSHi) = DAG.SplitVector(RHS, SDLoc(RHS)); | |||
1098 | ||||
1099 | ||||
1100 | Lo = DAG.getNode(ISD::FCOPYSIGN, DL, LHSLo.getValueType(), LHSLo, RHSLo); | |||
1101 | Hi = DAG.getNode(ISD::FCOPYSIGN, DL, LHSHi.getValueType(), LHSHi, RHSHi); | |||
1102 | } | |||
1103 | ||||
1104 | void DAGTypeLegalizer::SplitVecRes_InregOp(SDNode *N, SDValue &Lo, | |||
1105 | SDValue &Hi) { | |||
1106 | SDValue LHSLo, LHSHi; | |||
1107 | GetSplitVector(N->getOperand(0), LHSLo, LHSHi); | |||
1108 | SDLoc dl(N); | |||
1109 | ||||
1110 | EVT LoVT, HiVT; | |||
1111 | std::tie(LoVT, HiVT) = | |||
1112 | DAG.GetSplitDestVTs(cast<VTSDNode>(N->getOperand(1))->getVT()); | |||
1113 | ||||
1114 | Lo = DAG.getNode(N->getOpcode(), dl, LHSLo.getValueType(), LHSLo, | |||
1115 | DAG.getValueType(LoVT)); | |||
1116 | Hi = DAG.getNode(N->getOpcode(), dl, LHSHi.getValueType(), LHSHi, | |||
1117 | DAG.getValueType(HiVT)); | |||
1118 | } | |||
1119 | ||||
1120 | void DAGTypeLegalizer::SplitVecRes_ExtVecInRegOp(SDNode *N, SDValue &Lo, | |||
1121 | SDValue &Hi) { | |||
1122 | unsigned Opcode = N->getOpcode(); | |||
1123 | SDValue N0 = N->getOperand(0); | |||
1124 | ||||
1125 | SDLoc dl(N); | |||
1126 | SDValue InLo, InHi; | |||
1127 | ||||
1128 | if (getTypeAction(N0.getValueType()) == TargetLowering::TypeSplitVector) | |||
1129 | GetSplitVector(N0, InLo, InHi); | |||
1130 | else | |||
1131 | std::tie(InLo, InHi) = DAG.SplitVectorOperand(N, 0); | |||
1132 | ||||
1133 | EVT InLoVT = InLo.getValueType(); | |||
1134 | unsigned InNumElements = InLoVT.getVectorNumElements(); | |||
1135 | ||||
1136 | EVT OutLoVT, OutHiVT; | |||
1137 | std::tie(OutLoVT, OutHiVT) = DAG.GetSplitDestVTs(N->getValueType(0)); | |||
1138 | unsigned OutNumElements = OutLoVT.getVectorNumElements(); | |||
1139 | assert((2 * OutNumElements) <= InNumElements &&(((2 * OutNumElements) <= InNumElements && "Illegal extend vector in reg split" ) ? static_cast<void> (0) : __assert_fail ("(2 * OutNumElements) <= InNumElements && \"Illegal extend vector in reg split\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 1140, __PRETTY_FUNCTION__)) | |||
1140 | "Illegal extend vector in reg split")(((2 * OutNumElements) <= InNumElements && "Illegal extend vector in reg split" ) ? static_cast<void> (0) : __assert_fail ("(2 * OutNumElements) <= InNumElements && \"Illegal extend vector in reg split\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 1140, __PRETTY_FUNCTION__)); | |||
1141 | ||||
1142 | // *_EXTEND_VECTOR_INREG instructions extend the lowest elements of the | |||
1143 | // input vector (i.e. we only use InLo): | |||
1144 | // OutLo will extend the first OutNumElements from InLo. | |||
1145 | // OutHi will extend the next OutNumElements from InLo. | |||
1146 | ||||
1147 | // Shuffle the elements from InLo for OutHi into the bottom elements to | |||
1148 | // create a 'fake' InHi. | |||
1149 | SmallVector<int, 8> SplitHi(InNumElements, -1); | |||
1150 | for (unsigned i = 0; i != OutNumElements; ++i) | |||
1151 | SplitHi[i] = i + OutNumElements; | |||
1152 | InHi = DAG.getVectorShuffle(InLoVT, dl, InLo, DAG.getUNDEF(InLoVT), SplitHi); | |||
1153 | ||||
1154 | Lo = DAG.getNode(Opcode, dl, OutLoVT, InLo); | |||
1155 | Hi = DAG.getNode(Opcode, dl, OutHiVT, InHi); | |||
1156 | } | |||
1157 | ||||
1158 | void DAGTypeLegalizer::SplitVecRes_StrictFPOp(SDNode *N, SDValue &Lo, | |||
1159 | SDValue &Hi) { | |||
1160 | unsigned NumOps = N->getNumOperands(); | |||
1161 | SDValue Chain = N->getOperand(0); | |||
1162 | EVT LoVT, HiVT; | |||
1163 | SDLoc dl(N); | |||
1164 | std::tie(LoVT, HiVT) = DAG.GetSplitDestVTs(N->getValueType(0)); | |||
1165 | ||||
1166 | SmallVector<SDValue, 4> OpsLo; | |||
1167 | SmallVector<SDValue, 4> OpsHi; | |||
1168 | ||||
1169 | // The Chain is the first operand. | |||
1170 | OpsLo.push_back(Chain); | |||
1171 | OpsHi.push_back(Chain); | |||
1172 | ||||
1173 | // Now process the remaining operands. | |||
1174 | for (unsigned i = 1; i < NumOps; ++i) { | |||
1175 | SDValue Op = N->getOperand(i); | |||
1176 | SDValue OpLo = Op; | |||
1177 | SDValue OpHi = Op; | |||
1178 | ||||
1179 | EVT InVT = Op.getValueType(); | |||
1180 | if (InVT.isVector()) { | |||
1181 | // If the input also splits, handle it directly for a | |||
1182 | // compile time speedup. Otherwise split it by hand. | |||
1183 | if (getTypeAction(InVT) == TargetLowering::TypeSplitVector) | |||
1184 | GetSplitVector(Op, OpLo, OpHi); | |||
1185 | else | |||
1186 | std::tie(OpLo, OpHi) = DAG.SplitVectorOperand(N, i); | |||
1187 | } | |||
1188 | ||||
1189 | OpsLo.push_back(OpLo); | |||
1190 | OpsHi.push_back(OpHi); | |||
1191 | } | |||
1192 | ||||
1193 | EVT LoValueVTs[] = {LoVT, MVT::Other}; | |||
1194 | EVT HiValueVTs[] = {HiVT, MVT::Other}; | |||
1195 | Lo = DAG.getNode(N->getOpcode(), dl, LoValueVTs, OpsLo); | |||
1196 | Hi = DAG.getNode(N->getOpcode(), dl, HiValueVTs, OpsHi); | |||
1197 | ||||
1198 | // Build a factor node to remember that this Op is independent of the | |||
1199 | // other one. | |||
1200 | Chain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, | |||
1201 | Lo.getValue(1), Hi.getValue(1)); | |||
1202 | ||||
1203 | // Legalize the chain result - switch anything that used the old chain to | |||
1204 | // use the new one. | |||
1205 | ReplaceValueWith(SDValue(N, 1), Chain); | |||
1206 | } | |||
1207 | ||||
1208 | void DAGTypeLegalizer::SplitVecRes_INSERT_VECTOR_ELT(SDNode *N, SDValue &Lo, | |||
1209 | SDValue &Hi) { | |||
1210 | SDValue Vec = N->getOperand(0); | |||
1211 | SDValue Elt = N->getOperand(1); | |||
1212 | SDValue Idx = N->getOperand(2); | |||
1213 | SDLoc dl(N); | |||
1214 | GetSplitVector(Vec, Lo, Hi); | |||
1215 | ||||
1216 | if (ConstantSDNode *CIdx = dyn_cast<ConstantSDNode>(Idx)) { | |||
1217 | unsigned IdxVal = CIdx->getZExtValue(); | |||
1218 | unsigned LoNumElts = Lo.getValueType().getVectorNumElements(); | |||
1219 | if (IdxVal < LoNumElts) | |||
1220 | Lo = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, | |||
1221 | Lo.getValueType(), Lo, Elt, Idx); | |||
1222 | else | |||
1223 | Hi = | |||
1224 | DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, Hi.getValueType(), Hi, Elt, | |||
1225 | DAG.getConstant(IdxVal - LoNumElts, dl, | |||
1226 | TLI.getVectorIdxTy(DAG.getDataLayout()))); | |||
1227 | return; | |||
1228 | } | |||
1229 | ||||
1230 | // See if the target wants to custom expand this node. | |||
1231 | if (CustomLowerNode(N, N->getValueType(0), true)) | |||
1232 | return; | |||
1233 | ||||
1234 | // Make the vector elements byte-addressable if they aren't already. | |||
1235 | EVT VecVT = Vec.getValueType(); | |||
1236 | EVT EltVT = VecVT.getVectorElementType(); | |||
1237 | if (VecVT.getScalarSizeInBits() < 8) { | |||
1238 | EltVT = MVT::i8; | |||
1239 | VecVT = EVT::getVectorVT(*DAG.getContext(), EltVT, | |||
1240 | VecVT.getVectorNumElements()); | |||
1241 | Vec = DAG.getNode(ISD::ANY_EXTEND, dl, VecVT, Vec); | |||
1242 | // Extend the element type to match if needed. | |||
1243 | if (EltVT.bitsGT(Elt.getValueType())) | |||
1244 | Elt = DAG.getNode(ISD::ANY_EXTEND, dl, EltVT, Elt); | |||
1245 | } | |||
1246 | ||||
1247 | // Spill the vector to the stack. | |||
1248 | SDValue StackPtr = DAG.CreateStackTemporary(VecVT); | |||
1249 | auto &MF = DAG.getMachineFunction(); | |||
1250 | auto FrameIndex = cast<FrameIndexSDNode>(StackPtr.getNode())->getIndex(); | |||
1251 | auto PtrInfo = MachinePointerInfo::getFixedStack(MF, FrameIndex); | |||
1252 | SDValue Store = DAG.getStore(DAG.getEntryNode(), dl, Vec, StackPtr, PtrInfo); | |||
1253 | ||||
1254 | // Store the new element. This may be larger than the vector element type, | |||
1255 | // so use a truncating store. | |||
1256 | SDValue EltPtr = TLI.getVectorElementPointer(DAG, StackPtr, VecVT, Idx); | |||
1257 | Type *VecType = VecVT.getTypeForEVT(*DAG.getContext()); | |||
1258 | unsigned Alignment = DAG.getDataLayout().getPrefTypeAlignment(VecType); | |||
1259 | Store = DAG.getTruncStore(Store, dl, Elt, EltPtr, | |||
1260 | MachinePointerInfo::getUnknownStack(MF), EltVT); | |||
1261 | ||||
1262 | EVT LoVT, HiVT; | |||
1263 | std::tie(LoVT, HiVT) = DAG.GetSplitDestVTs(VecVT); | |||
1264 | ||||
1265 | // Load the Lo part from the stack slot. | |||
1266 | Lo = DAG.getLoad(LoVT, dl, Store, StackPtr, PtrInfo); | |||
1267 | ||||
1268 | // Increment the pointer to the other part. | |||
1269 | unsigned IncrementSize = LoVT.getSizeInBits() / 8; | |||
1270 | StackPtr = DAG.getNode(ISD::ADD, dl, StackPtr.getValueType(), StackPtr, | |||
1271 | DAG.getConstant(IncrementSize, dl, | |||
1272 | StackPtr.getValueType())); | |||
1273 | ||||
1274 | // Load the Hi part from the stack slot. | |||
1275 | Hi = DAG.getLoad(HiVT, dl, Store, StackPtr, | |||
1276 | PtrInfo.getWithOffset(IncrementSize), | |||
1277 | MinAlign(Alignment, IncrementSize)); | |||
1278 | ||||
1279 | // If we adjusted the original type, we need to truncate the results. | |||
1280 | std::tie(LoVT, HiVT) = DAG.GetSplitDestVTs(N->getValueType(0)); | |||
1281 | if (LoVT != Lo.getValueType()) | |||
1282 | Lo = DAG.getNode(ISD::TRUNCATE, dl, LoVT, Lo); | |||
1283 | if (HiVT != Hi.getValueType()) | |||
1284 | Hi = DAG.getNode(ISD::TRUNCATE, dl, HiVT, Hi); | |||
1285 | } | |||
1286 | ||||
1287 | void DAGTypeLegalizer::SplitVecRes_SCALAR_TO_VECTOR(SDNode *N, SDValue &Lo, | |||
1288 | SDValue &Hi) { | |||
1289 | EVT LoVT, HiVT; | |||
1290 | SDLoc dl(N); | |||
1291 | std::tie(LoVT, HiVT) = DAG.GetSplitDestVTs(N->getValueType(0)); | |||
1292 | Lo = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, LoVT, N->getOperand(0)); | |||
1293 | Hi = DAG.getUNDEF(HiVT); | |||
1294 | } | |||
1295 | ||||
1296 | void DAGTypeLegalizer::SplitVecRes_LOAD(LoadSDNode *LD, SDValue &Lo, | |||
1297 | SDValue &Hi) { | |||
1298 | assert(ISD::isUNINDEXEDLoad(LD) && "Indexed load during type legalization!")((ISD::isUNINDEXEDLoad(LD) && "Indexed load during type legalization!" ) ? static_cast<void> (0) : __assert_fail ("ISD::isUNINDEXEDLoad(LD) && \"Indexed load during type legalization!\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 1298, __PRETTY_FUNCTION__)); | |||
1299 | EVT LoVT, HiVT; | |||
1300 | SDLoc dl(LD); | |||
1301 | std::tie(LoVT, HiVT) = DAG.GetSplitDestVTs(LD->getValueType(0)); | |||
1302 | ||||
1303 | ISD::LoadExtType ExtType = LD->getExtensionType(); | |||
1304 | SDValue Ch = LD->getChain(); | |||
1305 | SDValue Ptr = LD->getBasePtr(); | |||
1306 | SDValue Offset = DAG.getUNDEF(Ptr.getValueType()); | |||
1307 | EVT MemoryVT = LD->getMemoryVT(); | |||
1308 | unsigned Alignment = LD->getOriginalAlignment(); | |||
1309 | MachineMemOperand::Flags MMOFlags = LD->getMemOperand()->getFlags(); | |||
1310 | AAMDNodes AAInfo = LD->getAAInfo(); | |||
1311 | ||||
1312 | EVT LoMemVT, HiMemVT; | |||
1313 | std::tie(LoMemVT, HiMemVT) = DAG.GetSplitDestVTs(MemoryVT); | |||
1314 | ||||
1315 | Lo = DAG.getLoad(ISD::UNINDEXED, ExtType, LoVT, dl, Ch, Ptr, Offset, | |||
1316 | LD->getPointerInfo(), LoMemVT, Alignment, MMOFlags, AAInfo); | |||
1317 | ||||
1318 | unsigned IncrementSize = LoMemVT.getSizeInBits()/8; | |||
1319 | Ptr = DAG.getObjectPtrOffset(dl, Ptr, IncrementSize); | |||
1320 | Hi = DAG.getLoad(ISD::UNINDEXED, ExtType, HiVT, dl, Ch, Ptr, Offset, | |||
1321 | LD->getPointerInfo().getWithOffset(IncrementSize), HiMemVT, | |||
1322 | Alignment, MMOFlags, AAInfo); | |||
1323 | ||||
1324 | // Build a factor node to remember that this load is independent of the | |||
1325 | // other one. | |||
1326 | Ch = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Lo.getValue(1), | |||
1327 | Hi.getValue(1)); | |||
1328 | ||||
1329 | // Legalize the chain result - switch anything that used the old chain to | |||
1330 | // use the new one. | |||
1331 | ReplaceValueWith(SDValue(LD, 1), Ch); | |||
1332 | } | |||
1333 | ||||
1334 | void DAGTypeLegalizer::SplitVecRes_MLOAD(MaskedLoadSDNode *MLD, | |||
1335 | SDValue &Lo, SDValue &Hi) { | |||
1336 | EVT LoVT, HiVT; | |||
1337 | SDLoc dl(MLD); | |||
1338 | std::tie(LoVT, HiVT) = DAG.GetSplitDestVTs(MLD->getValueType(0)); | |||
1339 | ||||
1340 | SDValue Ch = MLD->getChain(); | |||
1341 | SDValue Ptr = MLD->getBasePtr(); | |||
1342 | SDValue Mask = MLD->getMask(); | |||
1343 | SDValue PassThru = MLD->getPassThru(); | |||
1344 | unsigned Alignment = MLD->getOriginalAlignment(); | |||
1345 | ISD::LoadExtType ExtType = MLD->getExtensionType(); | |||
1346 | ||||
1347 | // if Alignment is equal to the vector size, | |||
1348 | // take the half of it for the second part | |||
1349 | unsigned SecondHalfAlignment = | |||
1350 | (Alignment == MLD->getValueType(0).getSizeInBits()/8) ? | |||
1351 | Alignment/2 : Alignment; | |||
1352 | ||||
1353 | // Split Mask operand | |||
1354 | SDValue MaskLo, MaskHi; | |||
1355 | if (getTypeAction(Mask.getValueType()) == TargetLowering::TypeSplitVector) | |||
1356 | GetSplitVector(Mask, MaskLo, MaskHi); | |||
1357 | else | |||
1358 | std::tie(MaskLo, MaskHi) = DAG.SplitVector(Mask, dl); | |||
1359 | ||||
1360 | EVT MemoryVT = MLD->getMemoryVT(); | |||
1361 | EVT LoMemVT, HiMemVT; | |||
1362 | std::tie(LoMemVT, HiMemVT) = DAG.GetSplitDestVTs(MemoryVT); | |||
1363 | ||||
1364 | SDValue PassThruLo, PassThruHi; | |||
1365 | if (getTypeAction(PassThru.getValueType()) == TargetLowering::TypeSplitVector) | |||
1366 | GetSplitVector(PassThru, PassThruLo, PassThruHi); | |||
1367 | else | |||
1368 | std::tie(PassThruLo, PassThruHi) = DAG.SplitVector(PassThru, dl); | |||
1369 | ||||
1370 | MachineMemOperand *MMO = DAG.getMachineFunction(). | |||
1371 | getMachineMemOperand(MLD->getPointerInfo(), | |||
1372 | MachineMemOperand::MOLoad, LoMemVT.getStoreSize(), | |||
1373 | Alignment, MLD->getAAInfo(), MLD->getRanges()); | |||
1374 | ||||
1375 | Lo = DAG.getMaskedLoad(LoVT, dl, Ch, Ptr, MaskLo, PassThruLo, LoMemVT, MMO, | |||
1376 | ExtType, MLD->isExpandingLoad()); | |||
1377 | ||||
1378 | Ptr = TLI.IncrementMemoryAddress(Ptr, MaskLo, dl, LoMemVT, DAG, | |||
1379 | MLD->isExpandingLoad()); | |||
1380 | unsigned HiOffset = LoMemVT.getStoreSize(); | |||
1381 | ||||
1382 | MMO = DAG.getMachineFunction().getMachineMemOperand( | |||
1383 | MLD->getPointerInfo().getWithOffset(HiOffset), MachineMemOperand::MOLoad, | |||
1384 | HiMemVT.getStoreSize(), SecondHalfAlignment, MLD->getAAInfo(), | |||
1385 | MLD->getRanges()); | |||
1386 | ||||
1387 | Hi = DAG.getMaskedLoad(HiVT, dl, Ch, Ptr, MaskHi, PassThruHi, HiMemVT, MMO, | |||
1388 | ExtType, MLD->isExpandingLoad()); | |||
1389 | ||||
1390 | // Build a factor node to remember that this load is independent of the | |||
1391 | // other one. | |||
1392 | Ch = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Lo.getValue(1), | |||
1393 | Hi.getValue(1)); | |||
1394 | ||||
1395 | // Legalize the chain result - switch anything that used the old chain to | |||
1396 | // use the new one. | |||
1397 | ReplaceValueWith(SDValue(MLD, 1), Ch); | |||
1398 | ||||
1399 | } | |||
1400 | ||||
1401 | void DAGTypeLegalizer::SplitVecRes_MGATHER(MaskedGatherSDNode *MGT, | |||
1402 | SDValue &Lo, SDValue &Hi) { | |||
1403 | EVT LoVT, HiVT; | |||
1404 | SDLoc dl(MGT); | |||
1405 | std::tie(LoVT, HiVT) = DAG.GetSplitDestVTs(MGT->getValueType(0)); | |||
1406 | ||||
1407 | SDValue Ch = MGT->getChain(); | |||
1408 | SDValue Ptr = MGT->getBasePtr(); | |||
1409 | SDValue Mask = MGT->getMask(); | |||
1410 | SDValue PassThru = MGT->getPassThru(); | |||
1411 | SDValue Index = MGT->getIndex(); | |||
1412 | SDValue Scale = MGT->getScale(); | |||
1413 | unsigned Alignment = MGT->getOriginalAlignment(); | |||
1414 | ||||
1415 | // Split Mask operand | |||
1416 | SDValue MaskLo, MaskHi; | |||
1417 | if (getTypeAction(Mask.getValueType()) == TargetLowering::TypeSplitVector) | |||
1418 | GetSplitVector(Mask, MaskLo, MaskHi); | |||
1419 | else | |||
1420 | std::tie(MaskLo, MaskHi) = DAG.SplitVector(Mask, dl); | |||
1421 | ||||
1422 | EVT MemoryVT = MGT->getMemoryVT(); | |||
1423 | EVT LoMemVT, HiMemVT; | |||
1424 | // Split MemoryVT | |||
1425 | std::tie(LoMemVT, HiMemVT) = DAG.GetSplitDestVTs(MemoryVT); | |||
1426 | ||||
1427 | SDValue PassThruLo, PassThruHi; | |||
1428 | if (getTypeAction(PassThru.getValueType()) == TargetLowering::TypeSplitVector) | |||
1429 | GetSplitVector(PassThru, PassThruLo, PassThruHi); | |||
1430 | else | |||
1431 | std::tie(PassThruLo, PassThruHi) = DAG.SplitVector(PassThru, dl); | |||
1432 | ||||
1433 | SDValue IndexHi, IndexLo; | |||
1434 | if (getTypeAction(Index.getValueType()) == TargetLowering::TypeSplitVector) | |||
1435 | GetSplitVector(Index, IndexLo, IndexHi); | |||
1436 | else | |||
1437 | std::tie(IndexLo, IndexHi) = DAG.SplitVector(Index, dl); | |||
1438 | ||||
1439 | MachineMemOperand *MMO = DAG.getMachineFunction(). | |||
1440 | getMachineMemOperand(MGT->getPointerInfo(), | |||
1441 | MachineMemOperand::MOLoad, LoMemVT.getStoreSize(), | |||
1442 | Alignment, MGT->getAAInfo(), MGT->getRanges()); | |||
1443 | ||||
1444 | SDValue OpsLo[] = {Ch, PassThruLo, MaskLo, Ptr, IndexLo, Scale}; | |||
1445 | Lo = DAG.getMaskedGather(DAG.getVTList(LoVT, MVT::Other), LoVT, dl, OpsLo, | |||
1446 | MMO); | |||
1447 | ||||
1448 | SDValue OpsHi[] = {Ch, PassThruHi, MaskHi, Ptr, IndexHi, Scale}; | |||
1449 | Hi = DAG.getMaskedGather(DAG.getVTList(HiVT, MVT::Other), HiVT, dl, OpsHi, | |||
1450 | MMO); | |||
1451 | ||||
1452 | // Build a factor node to remember that this load is independent of the | |||
1453 | // other one. | |||
1454 | Ch = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Lo.getValue(1), | |||
1455 | Hi.getValue(1)); | |||
1456 | ||||
1457 | // Legalize the chain result - switch anything that used the old chain to | |||
1458 | // use the new one. | |||
1459 | ReplaceValueWith(SDValue(MGT, 1), Ch); | |||
1460 | } | |||
1461 | ||||
1462 | ||||
1463 | void DAGTypeLegalizer::SplitVecRes_SETCC(SDNode *N, SDValue &Lo, SDValue &Hi) { | |||
1464 | assert(N->getValueType(0).isVector() &&((N->getValueType(0).isVector() && N->getOperand (0).getValueType().isVector() && "Operand types must be vectors" ) ? static_cast<void> (0) : __assert_fail ("N->getValueType(0).isVector() && N->getOperand(0).getValueType().isVector() && \"Operand types must be vectors\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 1466, __PRETTY_FUNCTION__)) | |||
1465 | N->getOperand(0).getValueType().isVector() &&((N->getValueType(0).isVector() && N->getOperand (0).getValueType().isVector() && "Operand types must be vectors" ) ? static_cast<void> (0) : __assert_fail ("N->getValueType(0).isVector() && N->getOperand(0).getValueType().isVector() && \"Operand types must be vectors\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 1466, __PRETTY_FUNCTION__)) | |||
1466 | "Operand types must be vectors")((N->getValueType(0).isVector() && N->getOperand (0).getValueType().isVector() && "Operand types must be vectors" ) ? static_cast<void> (0) : __assert_fail ("N->getValueType(0).isVector() && N->getOperand(0).getValueType().isVector() && \"Operand types must be vectors\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 1466, __PRETTY_FUNCTION__)); | |||
1467 | ||||
1468 | EVT LoVT, HiVT; | |||
1469 | SDLoc DL(N); | |||
1470 | std::tie(LoVT, HiVT) = DAG.GetSplitDestVTs(N->getValueType(0)); | |||
1471 | ||||
1472 | // If the input also splits, handle it directly. Otherwise split it by hand. | |||
1473 | SDValue LL, LH, RL, RH; | |||
1474 | if (getTypeAction(N->getOperand(0).getValueType()) == | |||
1475 | TargetLowering::TypeSplitVector) | |||
1476 | GetSplitVector(N->getOperand(0), LL, LH); | |||
1477 | else | |||
1478 | std::tie(LL, LH) = DAG.SplitVectorOperand(N, 0); | |||
1479 | ||||
1480 | if (getTypeAction(N->getOperand(1).getValueType()) == | |||
1481 | TargetLowering::TypeSplitVector) | |||
1482 | GetSplitVector(N->getOperand(1), RL, RH); | |||
1483 | else | |||
1484 | std::tie(RL, RH) = DAG.SplitVectorOperand(N, 1); | |||
1485 | ||||
1486 | Lo = DAG.getNode(N->getOpcode(), DL, LoVT, LL, RL, N->getOperand(2)); | |||
1487 | Hi = DAG.getNode(N->getOpcode(), DL, HiVT, LH, RH, N->getOperand(2)); | |||
1488 | } | |||
1489 | ||||
1490 | void DAGTypeLegalizer::SplitVecRes_UnaryOp(SDNode *N, SDValue &Lo, | |||
1491 | SDValue &Hi) { | |||
1492 | // Get the dest types - they may not match the input types, e.g. int_to_fp. | |||
1493 | EVT LoVT, HiVT; | |||
1494 | SDLoc dl(N); | |||
1495 | std::tie(LoVT, HiVT) = DAG.GetSplitDestVTs(N->getValueType(0)); | |||
1496 | ||||
1497 | // If the input also splits, handle it directly for a compile time speedup. | |||
1498 | // Otherwise split it by hand. | |||
1499 | EVT InVT = N->getOperand(0).getValueType(); | |||
1500 | if (getTypeAction(InVT) == TargetLowering::TypeSplitVector) | |||
1501 | GetSplitVector(N->getOperand(0), Lo, Hi); | |||
1502 | else | |||
1503 | std::tie(Lo, Hi) = DAG.SplitVectorOperand(N, 0); | |||
1504 | ||||
1505 | if (N->getOpcode() == ISD::FP_ROUND) { | |||
1506 | Lo = DAG.getNode(N->getOpcode(), dl, LoVT, Lo, N->getOperand(1)); | |||
1507 | Hi = DAG.getNode(N->getOpcode(), dl, HiVT, Hi, N->getOperand(1)); | |||
1508 | } else { | |||
1509 | Lo = DAG.getNode(N->getOpcode(), dl, LoVT, Lo); | |||
1510 | Hi = DAG.getNode(N->getOpcode(), dl, HiVT, Hi); | |||
1511 | } | |||
1512 | } | |||
1513 | ||||
1514 | void DAGTypeLegalizer::SplitVecRes_ExtendOp(SDNode *N, SDValue &Lo, | |||
1515 | SDValue &Hi) { | |||
1516 | SDLoc dl(N); | |||
1517 | EVT SrcVT = N->getOperand(0).getValueType(); | |||
1518 | EVT DestVT = N->getValueType(0); | |||
1519 | EVT LoVT, HiVT; | |||
1520 | std::tie(LoVT, HiVT) = DAG.GetSplitDestVTs(DestVT); | |||
1521 | ||||
1522 | // We can do better than a generic split operation if the extend is doing | |||
1523 | // more than just doubling the width of the elements and the following are | |||
1524 | // true: | |||
1525 | // - The number of vector elements is even, | |||
1526 | // - the source type is legal, | |||
1527 | // - the type of a split source is illegal, | |||
1528 | // - the type of an extended (by doubling element size) source is legal, and | |||
1529 | // - the type of that extended source when split is legal. | |||
1530 | // | |||
1531 | // This won't necessarily completely legalize the operation, but it will | |||
1532 | // more effectively move in the right direction and prevent falling down | |||
1533 | // to scalarization in many cases due to the input vector being split too | |||
1534 | // far. | |||
1535 | unsigned NumElements = SrcVT.getVectorNumElements(); | |||
1536 | if ((NumElements & 1) == 0 && | |||
1537 | SrcVT.getSizeInBits() * 2 < DestVT.getSizeInBits()) { | |||
1538 | LLVMContext &Ctx = *DAG.getContext(); | |||
1539 | EVT NewSrcVT = SrcVT.widenIntegerVectorElementType(Ctx); | |||
1540 | EVT SplitSrcVT = SrcVT.getHalfNumVectorElementsVT(Ctx); | |||
1541 | ||||
1542 | EVT SplitLoVT, SplitHiVT; | |||
1543 | std::tie(SplitLoVT, SplitHiVT) = DAG.GetSplitDestVTs(NewSrcVT); | |||
1544 | if (TLI.isTypeLegal(SrcVT) && !TLI.isTypeLegal(SplitSrcVT) && | |||
1545 | TLI.isTypeLegal(NewSrcVT) && TLI.isTypeLegal(SplitLoVT)) { | |||
1546 | LLVM_DEBUG(dbgs() << "Split vector extend via incremental extend:";do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType ("legalize-types")) { dbgs() << "Split vector extend via incremental extend:" ; N->dump(&DAG); dbgs() << "\n"; } } while (false ) | |||
1547 | N->dump(&DAG); dbgs() << "\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType ("legalize-types")) { dbgs() << "Split vector extend via incremental extend:" ; N->dump(&DAG); dbgs() << "\n"; } } while (false ); | |||
1548 | // Extend the source vector by one step. | |||
1549 | SDValue NewSrc = | |||
1550 | DAG.getNode(N->getOpcode(), dl, NewSrcVT, N->getOperand(0)); | |||
1551 | // Get the low and high halves of the new, extended one step, vector. | |||
1552 | std::tie(Lo, Hi) = DAG.SplitVector(NewSrc, dl); | |||
1553 | // Extend those vector halves the rest of the way. | |||
1554 | Lo = DAG.getNode(N->getOpcode(), dl, LoVT, Lo); | |||
1555 | Hi = DAG.getNode(N->getOpcode(), dl, HiVT, Hi); | |||
1556 | return; | |||
1557 | } | |||
1558 | } | |||
1559 | // Fall back to the generic unary operator splitting otherwise. | |||
1560 | SplitVecRes_UnaryOp(N, Lo, Hi); | |||
1561 | } | |||
1562 | ||||
1563 | void DAGTypeLegalizer::SplitVecRes_VECTOR_SHUFFLE(ShuffleVectorSDNode *N, | |||
1564 | SDValue &Lo, SDValue &Hi) { | |||
1565 | // The low and high parts of the original input give four input vectors. | |||
1566 | SDValue Inputs[4]; | |||
1567 | SDLoc dl(N); | |||
1568 | GetSplitVector(N->getOperand(0), Inputs[0], Inputs[1]); | |||
1569 | GetSplitVector(N->getOperand(1), Inputs[2], Inputs[3]); | |||
1570 | EVT NewVT = Inputs[0].getValueType(); | |||
1571 | unsigned NewElts = NewVT.getVectorNumElements(); | |||
1572 | ||||
1573 | // If Lo or Hi uses elements from at most two of the four input vectors, then | |||
1574 | // express it as a vector shuffle of those two inputs. Otherwise extract the | |||
1575 | // input elements by hand and construct the Lo/Hi output using a BUILD_VECTOR. | |||
1576 | SmallVector<int, 16> Ops; | |||
1577 | for (unsigned High = 0; High < 2; ++High) { | |||
1578 | SDValue &Output = High ? Hi : Lo; | |||
1579 | ||||
1580 | // Build a shuffle mask for the output, discovering on the fly which | |||
1581 | // input vectors to use as shuffle operands (recorded in InputUsed). | |||
1582 | // If building a suitable shuffle vector proves too hard, then bail | |||
1583 | // out with useBuildVector set. | |||
1584 | unsigned InputUsed[2] = { -1U, -1U }; // Not yet discovered. | |||
1585 | unsigned FirstMaskIdx = High * NewElts; | |||
1586 | bool useBuildVector = false; | |||
1587 | for (unsigned MaskOffset = 0; MaskOffset < NewElts; ++MaskOffset) { | |||
1588 | // The mask element. This indexes into the input. | |||
1589 | int Idx = N->getMaskElt(FirstMaskIdx + MaskOffset); | |||
1590 | ||||
1591 | // The input vector this mask element indexes into. | |||
1592 | unsigned Input = (unsigned)Idx / NewElts; | |||
1593 | ||||
1594 | if (Input >= array_lengthof(Inputs)) { | |||
1595 | // The mask element does not index into any input vector. | |||
1596 | Ops.push_back(-1); | |||
1597 | continue; | |||
1598 | } | |||
1599 | ||||
1600 | // Turn the index into an offset from the start of the input vector. | |||
1601 | Idx -= Input * NewElts; | |||
1602 | ||||
1603 | // Find or create a shuffle vector operand to hold this input. | |||
1604 | unsigned OpNo; | |||
1605 | for (OpNo = 0; OpNo < array_lengthof(InputUsed); ++OpNo) { | |||
1606 | if (InputUsed[OpNo] == Input) { | |||
1607 | // This input vector is already an operand. | |||
1608 | break; | |||
1609 | } else if (InputUsed[OpNo] == -1U) { | |||
1610 | // Create a new operand for this input vector. | |||
1611 | InputUsed[OpNo] = Input; | |||
1612 | break; | |||
1613 | } | |||
1614 | } | |||
1615 | ||||
1616 | if (OpNo >= array_lengthof(InputUsed)) { | |||
1617 | // More than two input vectors used! Give up on trying to create a | |||
1618 | // shuffle vector. Insert all elements into a BUILD_VECTOR instead. | |||
1619 | useBuildVector = true; | |||
1620 | break; | |||
1621 | } | |||
1622 | ||||
1623 | // Add the mask index for the new shuffle vector. | |||
1624 | Ops.push_back(Idx + OpNo * NewElts); | |||
1625 | } | |||
1626 | ||||
1627 | if (useBuildVector) { | |||
1628 | EVT EltVT = NewVT.getVectorElementType(); | |||
1629 | SmallVector<SDValue, 16> SVOps; | |||
1630 | ||||
1631 | // Extract the input elements by hand. | |||
1632 | for (unsigned MaskOffset = 0; MaskOffset < NewElts; ++MaskOffset) { | |||
1633 | // The mask element. This indexes into the input. | |||
1634 | int Idx = N->getMaskElt(FirstMaskIdx + MaskOffset); | |||
1635 | ||||
1636 | // The input vector this mask element indexes into. | |||
1637 | unsigned Input = (unsigned)Idx / NewElts; | |||
1638 | ||||
1639 | if (Input >= array_lengthof(Inputs)) { | |||
1640 | // The mask element is "undef" or indexes off the end of the input. | |||
1641 | SVOps.push_back(DAG.getUNDEF(EltVT)); | |||
1642 | continue; | |||
1643 | } | |||
1644 | ||||
1645 | // Turn the index into an offset from the start of the input vector. | |||
1646 | Idx -= Input * NewElts; | |||
1647 | ||||
1648 | // Extract the vector element by hand. | |||
1649 | SVOps.push_back(DAG.getNode( | |||
1650 | ISD::EXTRACT_VECTOR_ELT, dl, EltVT, Inputs[Input], | |||
1651 | DAG.getConstant(Idx, dl, TLI.getVectorIdxTy(DAG.getDataLayout())))); | |||
1652 | } | |||
1653 | ||||
1654 | // Construct the Lo/Hi output using a BUILD_VECTOR. | |||
1655 | Output = DAG.getBuildVector(NewVT, dl, SVOps); | |||
1656 | } else if (InputUsed[0] == -1U) { | |||
1657 | // No input vectors were used! The result is undefined. | |||
1658 | Output = DAG.getUNDEF(NewVT); | |||
1659 | } else { | |||
1660 | SDValue Op0 = Inputs[InputUsed[0]]; | |||
1661 | // If only one input was used, use an undefined vector for the other. | |||
1662 | SDValue Op1 = InputUsed[1] == -1U ? | |||
1663 | DAG.getUNDEF(NewVT) : Inputs[InputUsed[1]]; | |||
1664 | // At least one input vector was used. Create a new shuffle vector. | |||
1665 | Output = DAG.getVectorShuffle(NewVT, dl, Op0, Op1, Ops); | |||
1666 | } | |||
1667 | ||||
1668 | Ops.clear(); | |||
1669 | } | |||
1670 | } | |||
1671 | ||||
1672 | ||||
1673 | //===----------------------------------------------------------------------===// | |||
1674 | // Operand Vector Splitting | |||
1675 | //===----------------------------------------------------------------------===// | |||
1676 | ||||
1677 | /// This method is called when the specified operand of the specified node is | |||
1678 | /// found to need vector splitting. At this point, all of the result types of | |||
1679 | /// the node are known to be legal, but other operands of the node may need | |||
1680 | /// legalization as well as the specified one. | |||
1681 | bool DAGTypeLegalizer::SplitVectorOperand(SDNode *N, unsigned OpNo) { | |||
1682 | LLVM_DEBUG(dbgs() << "Split node operand: "; N->dump(&DAG); dbgs() << "\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType ("legalize-types")) { dbgs() << "Split node operand: "; N->dump(&DAG); dbgs() << "\n"; } } while (false ); | |||
1683 | SDValue Res = SDValue(); | |||
1684 | ||||
1685 | // See if the target wants to custom split this node. | |||
1686 | if (CustomLowerNode(N, N->getOperand(OpNo).getValueType(), false)) | |||
1687 | return false; | |||
1688 | ||||
1689 | if (!Res.getNode()) { | |||
1690 | switch (N->getOpcode()) { | |||
1691 | default: | |||
1692 | #ifndef NDEBUG | |||
1693 | dbgs() << "SplitVectorOperand Op #" << OpNo << ": "; | |||
1694 | N->dump(&DAG); | |||
1695 | dbgs() << "\n"; | |||
1696 | #endif | |||
1697 | report_fatal_error("Do not know how to split this operator's " | |||
1698 | "operand!\n"); | |||
1699 | ||||
1700 | case ISD::SETCC: Res = SplitVecOp_VSETCC(N); break; | |||
1701 | case ISD::BITCAST: Res = SplitVecOp_BITCAST(N); break; | |||
1702 | case ISD::EXTRACT_SUBVECTOR: Res = SplitVecOp_EXTRACT_SUBVECTOR(N); break; | |||
1703 | case ISD::EXTRACT_VECTOR_ELT:Res = SplitVecOp_EXTRACT_VECTOR_ELT(N); break; | |||
1704 | case ISD::CONCAT_VECTORS: Res = SplitVecOp_CONCAT_VECTORS(N); break; | |||
1705 | case ISD::TRUNCATE: | |||
1706 | Res = SplitVecOp_TruncateHelper(N); | |||
1707 | break; | |||
1708 | case ISD::FP_ROUND: Res = SplitVecOp_FP_ROUND(N); break; | |||
1709 | case ISD::FCOPYSIGN: Res = SplitVecOp_FCOPYSIGN(N); break; | |||
1710 | case ISD::STORE: | |||
1711 | Res = SplitVecOp_STORE(cast<StoreSDNode>(N), OpNo); | |||
1712 | break; | |||
1713 | case ISD::MSTORE: | |||
1714 | Res = SplitVecOp_MSTORE(cast<MaskedStoreSDNode>(N), OpNo); | |||
1715 | break; | |||
1716 | case ISD::MSCATTER: | |||
1717 | Res = SplitVecOp_MSCATTER(cast<MaskedScatterSDNode>(N), OpNo); | |||
1718 | break; | |||
1719 | case ISD::MGATHER: | |||
1720 | Res = SplitVecOp_MGATHER(cast<MaskedGatherSDNode>(N), OpNo); | |||
1721 | break; | |||
1722 | case ISD::VSELECT: | |||
1723 | Res = SplitVecOp_VSELECT(N, OpNo); | |||
1724 | break; | |||
1725 | case ISD::SINT_TO_FP: | |||
1726 | case ISD::UINT_TO_FP: | |||
1727 | if (N->getValueType(0).bitsLT(N->getOperand(0).getValueType())) | |||
1728 | Res = SplitVecOp_TruncateHelper(N); | |||
1729 | else | |||
1730 | Res = SplitVecOp_UnaryOp(N); | |||
1731 | break; | |||
1732 | case ISD::FP_TO_SINT: | |||
1733 | case ISD::FP_TO_UINT: | |||
1734 | case ISD::CTTZ: | |||
1735 | case ISD::CTLZ: | |||
1736 | case ISD::CTPOP: | |||
1737 | case ISD::FP_EXTEND: | |||
1738 | case ISD::SIGN_EXTEND: | |||
1739 | case ISD::ZERO_EXTEND: | |||
1740 | case ISD::ANY_EXTEND: | |||
1741 | case ISD::FTRUNC: | |||
1742 | case ISD::FCANONICALIZE: | |||
1743 | Res = SplitVecOp_UnaryOp(N); | |||
1744 | break; | |||
1745 | ||||
1746 | case ISD::ANY_EXTEND_VECTOR_INREG: | |||
1747 | case ISD::SIGN_EXTEND_VECTOR_INREG: | |||
1748 | case ISD::ZERO_EXTEND_VECTOR_INREG: | |||
1749 | Res = SplitVecOp_ExtVecInRegOp(N); | |||
1750 | break; | |||
1751 | ||||
1752 | case ISD::VECREDUCE_FADD: | |||
1753 | case ISD::VECREDUCE_FMUL: | |||
1754 | case ISD::VECREDUCE_ADD: | |||
1755 | case ISD::VECREDUCE_MUL: | |||
1756 | case ISD::VECREDUCE_AND: | |||
1757 | case ISD::VECREDUCE_OR: | |||
1758 | case ISD::VECREDUCE_XOR: | |||
1759 | case ISD::VECREDUCE_SMAX: | |||
1760 | case ISD::VECREDUCE_SMIN: | |||
1761 | case ISD::VECREDUCE_UMAX: | |||
1762 | case ISD::VECREDUCE_UMIN: | |||
1763 | case ISD::VECREDUCE_FMAX: | |||
1764 | case ISD::VECREDUCE_FMIN: | |||
1765 | Res = SplitVecOp_VECREDUCE(N, OpNo); | |||
1766 | break; | |||
1767 | } | |||
1768 | } | |||
1769 | ||||
1770 | // If the result is null, the sub-method took care of registering results etc. | |||
1771 | if (!Res.getNode()) return false; | |||
1772 | ||||
1773 | // If the result is N, the sub-method updated N in place. Tell the legalizer | |||
1774 | // core about this. | |||
1775 | if (Res.getNode() == N) | |||
1776 | return true; | |||
1777 | ||||
1778 | assert(Res.getValueType() == N->getValueType(0) && N->getNumValues() == 1 &&((Res.getValueType() == N->getValueType(0) && N-> getNumValues() == 1 && "Invalid operand expansion") ? static_cast<void> (0) : __assert_fail ("Res.getValueType() == N->getValueType(0) && N->getNumValues() == 1 && \"Invalid operand expansion\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 1779, __PRETTY_FUNCTION__)) | |||
1779 | "Invalid operand expansion")((Res.getValueType() == N->getValueType(0) && N-> getNumValues() == 1 && "Invalid operand expansion") ? static_cast<void> (0) : __assert_fail ("Res.getValueType() == N->getValueType(0) && N->getNumValues() == 1 && \"Invalid operand expansion\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 1779, __PRETTY_FUNCTION__)); | |||
1780 | ||||
1781 | ReplaceValueWith(SDValue(N, 0), Res); | |||
1782 | return false; | |||
1783 | } | |||
1784 | ||||
1785 | SDValue DAGTypeLegalizer::SplitVecOp_VSELECT(SDNode *N, unsigned OpNo) { | |||
1786 | // The only possibility for an illegal operand is the mask, since result type | |||
1787 | // legalization would have handled this node already otherwise. | |||
1788 | assert(OpNo == 0 && "Illegal operand must be mask")((OpNo == 0 && "Illegal operand must be mask") ? static_cast <void> (0) : __assert_fail ("OpNo == 0 && \"Illegal operand must be mask\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 1788, __PRETTY_FUNCTION__)); | |||
1789 | ||||
1790 | SDValue Mask = N->getOperand(0); | |||
1791 | SDValue Src0 = N->getOperand(1); | |||
1792 | SDValue Src1 = N->getOperand(2); | |||
1793 | EVT Src0VT = Src0.getValueType(); | |||
1794 | SDLoc DL(N); | |||
1795 | assert(Mask.getValueType().isVector() && "VSELECT without a vector mask?")((Mask.getValueType().isVector() && "VSELECT without a vector mask?" ) ? static_cast<void> (0) : __assert_fail ("Mask.getValueType().isVector() && \"VSELECT without a vector mask?\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 1795, __PRETTY_FUNCTION__)); | |||
1796 | ||||
1797 | SDValue Lo, Hi; | |||
1798 | GetSplitVector(N->getOperand(0), Lo, Hi); | |||
1799 | assert(Lo.getValueType() == Hi.getValueType() &&((Lo.getValueType() == Hi.getValueType() && "Lo and Hi have differing types" ) ? static_cast<void> (0) : __assert_fail ("Lo.getValueType() == Hi.getValueType() && \"Lo and Hi have differing types\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 1800, __PRETTY_FUNCTION__)) | |||
1800 | "Lo and Hi have differing types")((Lo.getValueType() == Hi.getValueType() && "Lo and Hi have differing types" ) ? static_cast<void> (0) : __assert_fail ("Lo.getValueType() == Hi.getValueType() && \"Lo and Hi have differing types\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 1800, __PRETTY_FUNCTION__)); | |||
1801 | ||||
1802 | EVT LoOpVT, HiOpVT; | |||
1803 | std::tie(LoOpVT, HiOpVT) = DAG.GetSplitDestVTs(Src0VT); | |||
1804 | assert(LoOpVT == HiOpVT && "Asymmetric vector split?")((LoOpVT == HiOpVT && "Asymmetric vector split?") ? static_cast <void> (0) : __assert_fail ("LoOpVT == HiOpVT && \"Asymmetric vector split?\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 1804, __PRETTY_FUNCTION__)); | |||
1805 | ||||
1806 | SDValue LoOp0, HiOp0, LoOp1, HiOp1, LoMask, HiMask; | |||
1807 | std::tie(LoOp0, HiOp0) = DAG.SplitVector(Src0, DL); | |||
1808 | std::tie(LoOp1, HiOp1) = DAG.SplitVector(Src1, DL); | |||
1809 | std::tie(LoMask, HiMask) = DAG.SplitVector(Mask, DL); | |||
1810 | ||||
1811 | SDValue LoSelect = | |||
1812 | DAG.getNode(ISD::VSELECT, DL, LoOpVT, LoMask, LoOp0, LoOp1); | |||
1813 | SDValue HiSelect = | |||
1814 | DAG.getNode(ISD::VSELECT, DL, HiOpVT, HiMask, HiOp0, HiOp1); | |||
1815 | ||||
1816 | return DAG.getNode(ISD::CONCAT_VECTORS, DL, Src0VT, LoSelect, HiSelect); | |||
1817 | } | |||
1818 | ||||
1819 | SDValue DAGTypeLegalizer::SplitVecOp_VECREDUCE(SDNode *N, unsigned OpNo) { | |||
1820 | EVT ResVT = N->getValueType(0); | |||
1821 | SDValue Lo, Hi; | |||
1822 | SDLoc dl(N); | |||
1823 | ||||
1824 | SDValue VecOp = N->getOperand(OpNo); | |||
1825 | EVT VecVT = VecOp.getValueType(); | |||
1826 | assert(VecVT.isVector() && "Can only split reduce vector operand")((VecVT.isVector() && "Can only split reduce vector operand" ) ? static_cast<void> (0) : __assert_fail ("VecVT.isVector() && \"Can only split reduce vector operand\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 1826, __PRETTY_FUNCTION__)); | |||
1827 | GetSplitVector(VecOp, Lo, Hi); | |||
1828 | EVT LoOpVT, HiOpVT; | |||
1829 | std::tie(LoOpVT, HiOpVT) = DAG.GetSplitDestVTs(VecVT); | |||
1830 | ||||
1831 | bool NoNaN = N->getFlags().hasNoNaNs(); | |||
1832 | unsigned CombineOpc = 0; | |||
1833 | switch (N->getOpcode()) { | |||
1834 | case ISD::VECREDUCE_FADD: CombineOpc = ISD::FADD; break; | |||
1835 | case ISD::VECREDUCE_FMUL: CombineOpc = ISD::FMUL; break; | |||
1836 | case ISD::VECREDUCE_ADD: CombineOpc = ISD::ADD; break; | |||
1837 | case ISD::VECREDUCE_MUL: CombineOpc = ISD::MUL; break; | |||
1838 | case ISD::VECREDUCE_AND: CombineOpc = ISD::AND; break; | |||
1839 | case ISD::VECREDUCE_OR: CombineOpc = ISD::OR; break; | |||
1840 | case ISD::VECREDUCE_XOR: CombineOpc = ISD::XOR; break; | |||
1841 | case ISD::VECREDUCE_SMAX: CombineOpc = ISD::SMAX; break; | |||
1842 | case ISD::VECREDUCE_SMIN: CombineOpc = ISD::SMIN; break; | |||
1843 | case ISD::VECREDUCE_UMAX: CombineOpc = ISD::UMAX; break; | |||
1844 | case ISD::VECREDUCE_UMIN: CombineOpc = ISD::UMIN; break; | |||
1845 | case ISD::VECREDUCE_FMAX: | |||
1846 | CombineOpc = NoNaN ? ISD::FMAXNUM : ISD::FMAXIMUM; | |||
1847 | break; | |||
1848 | case ISD::VECREDUCE_FMIN: | |||
1849 | CombineOpc = NoNaN ? ISD::FMINNUM : ISD::FMINIMUM; | |||
1850 | break; | |||
1851 | default: | |||
1852 | llvm_unreachable("Unexpected reduce ISD node")::llvm::llvm_unreachable_internal("Unexpected reduce ISD node" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 1852); | |||
1853 | } | |||
1854 | ||||
1855 | // Use the appropriate scalar instruction on the split subvectors before | |||
1856 | // reducing the now partially reduced smaller vector. | |||
1857 | SDValue Partial = DAG.getNode(CombineOpc, dl, LoOpVT, Lo, Hi, N->getFlags()); | |||
1858 | return DAG.getNode(N->getOpcode(), dl, ResVT, Partial, N->getFlags()); | |||
1859 | } | |||
1860 | ||||
1861 | SDValue DAGTypeLegalizer::SplitVecOp_UnaryOp(SDNode *N) { | |||
1862 | // The result has a legal vector type, but the input needs splitting. | |||
1863 | EVT ResVT = N->getValueType(0); | |||
1864 | SDValue Lo, Hi; | |||
1865 | SDLoc dl(N); | |||
1866 | GetSplitVector(N->getOperand(0), Lo, Hi); | |||
1867 | EVT InVT = Lo.getValueType(); | |||
1868 | ||||
1869 | EVT OutVT = EVT::getVectorVT(*DAG.getContext(), ResVT.getVectorElementType(), | |||
1870 | InVT.getVectorNumElements()); | |||
1871 | ||||
1872 | Lo = DAG.getNode(N->getOpcode(), dl, OutVT, Lo); | |||
1873 | Hi = DAG.getNode(N->getOpcode(), dl, OutVT, Hi); | |||
1874 | ||||
1875 | return DAG.getNode(ISD::CONCAT_VECTORS, dl, ResVT, Lo, Hi); | |||
1876 | } | |||
1877 | ||||
1878 | SDValue DAGTypeLegalizer::SplitVecOp_BITCAST(SDNode *N) { | |||
1879 | // For example, i64 = BITCAST v4i16 on alpha. Typically the vector will | |||
1880 | // end up being split all the way down to individual components. Convert the | |||
1881 | // split pieces into integers and reassemble. | |||
1882 | SDValue Lo, Hi; | |||
1883 | GetSplitVector(N->getOperand(0), Lo, Hi); | |||
1884 | Lo = BitConvertToInteger(Lo); | |||
1885 | Hi = BitConvertToInteger(Hi); | |||
1886 | ||||
1887 | if (DAG.getDataLayout().isBigEndian()) | |||
1888 | std::swap(Lo, Hi); | |||
1889 | ||||
1890 | return DAG.getNode(ISD::BITCAST, SDLoc(N), N->getValueType(0), | |||
1891 | JoinIntegers(Lo, Hi)); | |||
1892 | } | |||
1893 | ||||
1894 | SDValue DAGTypeLegalizer::SplitVecOp_EXTRACT_SUBVECTOR(SDNode *N) { | |||
1895 | // We know that the extracted result type is legal. | |||
1896 | EVT SubVT = N->getValueType(0); | |||
1897 | SDValue Idx = N->getOperand(1); | |||
1898 | SDLoc dl(N); | |||
1899 | SDValue Lo, Hi; | |||
1900 | GetSplitVector(N->getOperand(0), Lo, Hi); | |||
1901 | ||||
1902 | uint64_t LoElts = Lo.getValueType().getVectorNumElements(); | |||
1903 | uint64_t IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue(); | |||
1904 | ||||
1905 | if (IdxVal < LoElts) { | |||
1906 | assert(IdxVal + SubVT.getVectorNumElements() <= LoElts &&((IdxVal + SubVT.getVectorNumElements() <= LoElts && "Extracted subvector crosses vector split!") ? static_cast< void> (0) : __assert_fail ("IdxVal + SubVT.getVectorNumElements() <= LoElts && \"Extracted subvector crosses vector split!\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 1907, __PRETTY_FUNCTION__)) | |||
1907 | "Extracted subvector crosses vector split!")((IdxVal + SubVT.getVectorNumElements() <= LoElts && "Extracted subvector crosses vector split!") ? static_cast< void> (0) : __assert_fail ("IdxVal + SubVT.getVectorNumElements() <= LoElts && \"Extracted subvector crosses vector split!\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 1907, __PRETTY_FUNCTION__)); | |||
1908 | return DAG.getNode(ISD::EXTRACT_SUBVECTOR, dl, SubVT, Lo, Idx); | |||
1909 | } else { | |||
1910 | return DAG.getNode(ISD::EXTRACT_SUBVECTOR, dl, SubVT, Hi, | |||
1911 | DAG.getConstant(IdxVal - LoElts, dl, | |||
1912 | Idx.getValueType())); | |||
1913 | } | |||
1914 | } | |||
1915 | ||||
1916 | SDValue DAGTypeLegalizer::SplitVecOp_EXTRACT_VECTOR_ELT(SDNode *N) { | |||
1917 | SDValue Vec = N->getOperand(0); | |||
1918 | SDValue Idx = N->getOperand(1); | |||
1919 | EVT VecVT = Vec.getValueType(); | |||
1920 | ||||
1921 | if (isa<ConstantSDNode>(Idx)) { | |||
1922 | uint64_t IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue(); | |||
1923 | assert(IdxVal < VecVT.getVectorNumElements() && "Invalid vector index!")((IdxVal < VecVT.getVectorNumElements() && "Invalid vector index!" ) ? static_cast<void> (0) : __assert_fail ("IdxVal < VecVT.getVectorNumElements() && \"Invalid vector index!\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 1923, __PRETTY_FUNCTION__)); | |||
1924 | ||||
1925 | SDValue Lo, Hi; | |||
1926 | GetSplitVector(Vec, Lo, Hi); | |||
1927 | ||||
1928 | uint64_t LoElts = Lo.getValueType().getVectorNumElements(); | |||
1929 | ||||
1930 | if (IdxVal < LoElts) | |||
1931 | return SDValue(DAG.UpdateNodeOperands(N, Lo, Idx), 0); | |||
1932 | return SDValue(DAG.UpdateNodeOperands(N, Hi, | |||
1933 | DAG.getConstant(IdxVal - LoElts, SDLoc(N), | |||
1934 | Idx.getValueType())), 0); | |||
1935 | } | |||
1936 | ||||
1937 | // See if the target wants to custom expand this node. | |||
1938 | if (CustomLowerNode(N, N->getValueType(0), true)) | |||
1939 | return SDValue(); | |||
1940 | ||||
1941 | // Make the vector elements byte-addressable if they aren't already. | |||
1942 | SDLoc dl(N); | |||
1943 | EVT EltVT = VecVT.getVectorElementType(); | |||
1944 | if (VecVT.getScalarSizeInBits() < 8) { | |||
1945 | EltVT = MVT::i8; | |||
1946 | VecVT = EVT::getVectorVT(*DAG.getContext(), EltVT, | |||
1947 | VecVT.getVectorNumElements()); | |||
1948 | Vec = DAG.getNode(ISD::ANY_EXTEND, dl, VecVT, Vec); | |||
1949 | } | |||
1950 | ||||
1951 | // Store the vector to the stack. | |||
1952 | SDValue StackPtr = DAG.CreateStackTemporary(VecVT); | |||
1953 | auto &MF = DAG.getMachineFunction(); | |||
1954 | auto FrameIndex = cast<FrameIndexSDNode>(StackPtr.getNode())->getIndex(); | |||
1955 | auto PtrInfo = MachinePointerInfo::getFixedStack(MF, FrameIndex); | |||
1956 | SDValue Store = DAG.getStore(DAG.getEntryNode(), dl, Vec, StackPtr, PtrInfo); | |||
1957 | ||||
1958 | // Load back the required element. | |||
1959 | StackPtr = TLI.getVectorElementPointer(DAG, StackPtr, VecVT, Idx); | |||
1960 | ||||
1961 | // FIXME: This is to handle i1 vectors with elements promoted to i8. | |||
1962 | // i1 vector handling needs general improvement. | |||
1963 | if (N->getValueType(0).bitsLT(EltVT)) { | |||
1964 | SDValue Load = DAG.getLoad(EltVT, dl, Store, StackPtr, | |||
1965 | MachinePointerInfo::getUnknownStack(DAG.getMachineFunction())); | |||
1966 | return DAG.getZExtOrTrunc(Load, dl, N->getValueType(0)); | |||
1967 | } | |||
1968 | ||||
1969 | return DAG.getExtLoad( | |||
1970 | ISD::EXTLOAD, dl, N->getValueType(0), Store, StackPtr, | |||
1971 | MachinePointerInfo::getUnknownStack(DAG.getMachineFunction()), EltVT); | |||
1972 | } | |||
1973 | ||||
1974 | SDValue DAGTypeLegalizer::SplitVecOp_ExtVecInRegOp(SDNode *N) { | |||
1975 | SDValue Lo, Hi; | |||
1976 | ||||
1977 | // *_EXTEND_VECTOR_INREG only reference the lower half of the input, so | |||
1978 | // splitting the result has the same effect as splitting the input operand. | |||
1979 | SplitVecRes_ExtVecInRegOp(N, Lo, Hi); | |||
1980 | ||||
1981 | return DAG.getNode(ISD::CONCAT_VECTORS, SDLoc(N), N->getValueType(0), Lo, Hi); | |||
1982 | } | |||
1983 | ||||
1984 | SDValue DAGTypeLegalizer::SplitVecOp_MGATHER(MaskedGatherSDNode *MGT, | |||
1985 | unsigned OpNo) { | |||
1986 | EVT LoVT, HiVT; | |||
1987 | SDLoc dl(MGT); | |||
1988 | std::tie(LoVT, HiVT) = DAG.GetSplitDestVTs(MGT->getValueType(0)); | |||
1989 | ||||
1990 | SDValue Ch = MGT->getChain(); | |||
1991 | SDValue Ptr = MGT->getBasePtr(); | |||
1992 | SDValue Index = MGT->getIndex(); | |||
1993 | SDValue Scale = MGT->getScale(); | |||
1994 | SDValue Mask = MGT->getMask(); | |||
1995 | SDValue PassThru = MGT->getPassThru(); | |||
1996 | unsigned Alignment = MGT->getOriginalAlignment(); | |||
1997 | ||||
1998 | SDValue MaskLo, MaskHi; | |||
1999 | if (getTypeAction(Mask.getValueType()) == TargetLowering::TypeSplitVector) | |||
2000 | // Split Mask operand | |||
2001 | GetSplitVector(Mask, MaskLo, MaskHi); | |||
2002 | else | |||
2003 | std::tie(MaskLo, MaskHi) = DAG.SplitVector(Mask, dl); | |||
2004 | ||||
2005 | EVT MemoryVT = MGT->getMemoryVT(); | |||
2006 | EVT LoMemVT, HiMemVT; | |||
2007 | std::tie(LoMemVT, HiMemVT) = DAG.GetSplitDestVTs(MemoryVT); | |||
2008 | ||||
2009 | SDValue PassThruLo, PassThruHi; | |||
2010 | if (getTypeAction(PassThru.getValueType()) == TargetLowering::TypeSplitVector) | |||
2011 | GetSplitVector(PassThru, PassThruLo, PassThruHi); | |||
2012 | else | |||
2013 | std::tie(PassThruLo, PassThruHi) = DAG.SplitVector(PassThru, dl); | |||
2014 | ||||
2015 | SDValue IndexHi, IndexLo; | |||
2016 | if (getTypeAction(Index.getValueType()) == TargetLowering::TypeSplitVector) | |||
2017 | GetSplitVector(Index, IndexLo, IndexHi); | |||
2018 | else | |||
2019 | std::tie(IndexLo, IndexHi) = DAG.SplitVector(Index, dl); | |||
2020 | ||||
2021 | MachineMemOperand *MMO = DAG.getMachineFunction(). | |||
2022 | getMachineMemOperand(MGT->getPointerInfo(), | |||
2023 | MachineMemOperand::MOLoad, LoMemVT.getStoreSize(), | |||
2024 | Alignment, MGT->getAAInfo(), MGT->getRanges()); | |||
2025 | ||||
2026 | SDValue OpsLo[] = {Ch, PassThruLo, MaskLo, Ptr, IndexLo, Scale}; | |||
2027 | SDValue Lo = DAG.getMaskedGather(DAG.getVTList(LoVT, MVT::Other), LoVT, dl, | |||
2028 | OpsLo, MMO); | |||
2029 | ||||
2030 | MMO = DAG.getMachineFunction(). | |||
2031 | getMachineMemOperand(MGT->getPointerInfo(), | |||
2032 | MachineMemOperand::MOLoad, HiMemVT.getStoreSize(), | |||
2033 | Alignment, MGT->getAAInfo(), | |||
2034 | MGT->getRanges()); | |||
2035 | ||||
2036 | SDValue OpsHi[] = {Ch, PassThruHi, MaskHi, Ptr, IndexHi, Scale}; | |||
2037 | SDValue Hi = DAG.getMaskedGather(DAG.getVTList(HiVT, MVT::Other), HiVT, dl, | |||
2038 | OpsHi, MMO); | |||
2039 | ||||
2040 | // Build a factor node to remember that this load is independent of the | |||
2041 | // other one. | |||
2042 | Ch = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Lo.getValue(1), | |||
2043 | Hi.getValue(1)); | |||
2044 | ||||
2045 | // Legalize the chain result - switch anything that used the old chain to | |||
2046 | // use the new one. | |||
2047 | ReplaceValueWith(SDValue(MGT, 1), Ch); | |||
2048 | ||||
2049 | SDValue Res = DAG.getNode(ISD::CONCAT_VECTORS, dl, MGT->getValueType(0), Lo, | |||
2050 | Hi); | |||
2051 | ReplaceValueWith(SDValue(MGT, 0), Res); | |||
2052 | return SDValue(); | |||
2053 | } | |||
2054 | ||||
2055 | SDValue DAGTypeLegalizer::SplitVecOp_MSTORE(MaskedStoreSDNode *N, | |||
2056 | unsigned OpNo) { | |||
2057 | SDValue Ch = N->getChain(); | |||
2058 | SDValue Ptr = N->getBasePtr(); | |||
2059 | SDValue Mask = N->getMask(); | |||
2060 | SDValue Data = N->getValue(); | |||
2061 | EVT MemoryVT = N->getMemoryVT(); | |||
2062 | unsigned Alignment = N->getOriginalAlignment(); | |||
2063 | SDLoc DL(N); | |||
2064 | ||||
2065 | EVT LoMemVT, HiMemVT; | |||
2066 | std::tie(LoMemVT, HiMemVT) = DAG.GetSplitDestVTs(MemoryVT); | |||
2067 | ||||
2068 | SDValue DataLo, DataHi; | |||
2069 | if (getTypeAction(Data.getValueType()) == TargetLowering::TypeSplitVector) | |||
2070 | // Split Data operand | |||
2071 | GetSplitVector(Data, DataLo, DataHi); | |||
2072 | else | |||
2073 | std::tie(DataLo, DataHi) = DAG.SplitVector(Data, DL); | |||
2074 | ||||
2075 | SDValue MaskLo, MaskHi; | |||
2076 | if (getTypeAction(Mask.getValueType()) == TargetLowering::TypeSplitVector) | |||
2077 | // Split Mask operand | |||
2078 | GetSplitVector(Mask, MaskLo, MaskHi); | |||
2079 | else | |||
2080 | std::tie(MaskLo, MaskHi) = DAG.SplitVector(Mask, DL); | |||
2081 | ||||
2082 | // if Alignment is equal to the vector size, | |||
2083 | // take the half of it for the second part | |||
2084 | unsigned SecondHalfAlignment = | |||
2085 | (Alignment == Data->getValueType(0).getSizeInBits()/8) ? | |||
2086 | Alignment/2 : Alignment; | |||
2087 | ||||
2088 | SDValue Lo, Hi; | |||
2089 | MachineMemOperand *MMO = DAG.getMachineFunction(). | |||
2090 | getMachineMemOperand(N->getPointerInfo(), | |||
2091 | MachineMemOperand::MOStore, LoMemVT.getStoreSize(), | |||
2092 | Alignment, N->getAAInfo(), N->getRanges()); | |||
2093 | ||||
2094 | Lo = DAG.getMaskedStore(Ch, DL, DataLo, Ptr, MaskLo, LoMemVT, MMO, | |||
2095 | N->isTruncatingStore(), | |||
2096 | N->isCompressingStore()); | |||
2097 | ||||
2098 | Ptr = TLI.IncrementMemoryAddress(Ptr, MaskLo, DL, LoMemVT, DAG, | |||
2099 | N->isCompressingStore()); | |||
2100 | unsigned HiOffset = LoMemVT.getStoreSize(); | |||
2101 | ||||
2102 | MMO = DAG.getMachineFunction().getMachineMemOperand( | |||
2103 | N->getPointerInfo().getWithOffset(HiOffset), MachineMemOperand::MOStore, | |||
2104 | HiMemVT.getStoreSize(), SecondHalfAlignment, N->getAAInfo(), | |||
2105 | N->getRanges()); | |||
2106 | ||||
2107 | Hi = DAG.getMaskedStore(Ch, DL, DataHi, Ptr, MaskHi, HiMemVT, MMO, | |||
2108 | N->isTruncatingStore(), N->isCompressingStore()); | |||
2109 | ||||
2110 | // Build a factor node to remember that this store is independent of the | |||
2111 | // other one. | |||
2112 | return DAG.getNode(ISD::TokenFactor, DL, MVT::Other, Lo, Hi); | |||
2113 | } | |||
2114 | ||||
2115 | SDValue DAGTypeLegalizer::SplitVecOp_MSCATTER(MaskedScatterSDNode *N, | |||
2116 | unsigned OpNo) { | |||
2117 | SDValue Ch = N->getChain(); | |||
2118 | SDValue Ptr = N->getBasePtr(); | |||
2119 | SDValue Mask = N->getMask(); | |||
2120 | SDValue Index = N->getIndex(); | |||
2121 | SDValue Scale = N->getScale(); | |||
2122 | SDValue Data = N->getValue(); | |||
2123 | EVT MemoryVT = N->getMemoryVT(); | |||
2124 | unsigned Alignment = N->getOriginalAlignment(); | |||
2125 | SDLoc DL(N); | |||
2126 | ||||
2127 | // Split all operands | |||
2128 | EVT LoMemVT, HiMemVT; | |||
2129 | std::tie(LoMemVT, HiMemVT) = DAG.GetSplitDestVTs(MemoryVT); | |||
2130 | ||||
2131 | SDValue DataLo, DataHi; | |||
2132 | if (getTypeAction(Data.getValueType()) == TargetLowering::TypeSplitVector) | |||
2133 | // Split Data operand | |||
2134 | GetSplitVector(Data, DataLo, DataHi); | |||
2135 | else | |||
2136 | std::tie(DataLo, DataHi) = DAG.SplitVector(Data, DL); | |||
2137 | ||||
2138 | SDValue MaskLo, MaskHi; | |||
2139 | if (getTypeAction(Mask.getValueType()) == TargetLowering::TypeSplitVector) | |||
2140 | // Split Mask operand | |||
2141 | GetSplitVector(Mask, MaskLo, MaskHi); | |||
2142 | else | |||
2143 | std::tie(MaskLo, MaskHi) = DAG.SplitVector(Mask, DL); | |||
2144 | ||||
2145 | SDValue IndexHi, IndexLo; | |||
2146 | if (getTypeAction(Index.getValueType()) == TargetLowering::TypeSplitVector) | |||
2147 | GetSplitVector(Index, IndexLo, IndexHi); | |||
2148 | else | |||
2149 | std::tie(IndexLo, IndexHi) = DAG.SplitVector(Index, DL); | |||
2150 | ||||
2151 | SDValue Lo; | |||
2152 | MachineMemOperand *MMO = DAG.getMachineFunction(). | |||
2153 | getMachineMemOperand(N->getPointerInfo(), | |||
2154 | MachineMemOperand::MOStore, LoMemVT.getStoreSize(), | |||
2155 | Alignment, N->getAAInfo(), N->getRanges()); | |||
2156 | ||||
2157 | SDValue OpsLo[] = {Ch, DataLo, MaskLo, Ptr, IndexLo, Scale}; | |||
2158 | Lo = DAG.getMaskedScatter(DAG.getVTList(MVT::Other), DataLo.getValueType(), | |||
2159 | DL, OpsLo, MMO); | |||
2160 | ||||
2161 | MMO = DAG.getMachineFunction(). | |||
2162 | getMachineMemOperand(N->getPointerInfo(), | |||
2163 | MachineMemOperand::MOStore, HiMemVT.getStoreSize(), | |||
2164 | Alignment, N->getAAInfo(), N->getRanges()); | |||
2165 | ||||
2166 | // The order of the Scatter operation after split is well defined. The "Hi" | |||
2167 | // part comes after the "Lo". So these two operations should be chained one | |||
2168 | // after another. | |||
2169 | SDValue OpsHi[] = {Lo, DataHi, MaskHi, Ptr, IndexHi, Scale}; | |||
2170 | return DAG.getMaskedScatter(DAG.getVTList(MVT::Other), DataHi.getValueType(), | |||
2171 | DL, OpsHi, MMO); | |||
2172 | } | |||
2173 | ||||
2174 | SDValue DAGTypeLegalizer::SplitVecOp_STORE(StoreSDNode *N, unsigned OpNo) { | |||
2175 | assert(N->isUnindexed() && "Indexed store of vector?")((N->isUnindexed() && "Indexed store of vector?") ? static_cast<void> (0) : __assert_fail ("N->isUnindexed() && \"Indexed store of vector?\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 2175, __PRETTY_FUNCTION__)); | |||
2176 | assert(OpNo == 1 && "Can only split the stored value")((OpNo == 1 && "Can only split the stored value") ? static_cast <void> (0) : __assert_fail ("OpNo == 1 && \"Can only split the stored value\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 2176, __PRETTY_FUNCTION__)); | |||
2177 | SDLoc DL(N); | |||
2178 | ||||
2179 | bool isTruncating = N->isTruncatingStore(); | |||
2180 | SDValue Ch = N->getChain(); | |||
2181 | SDValue Ptr = N->getBasePtr(); | |||
2182 | EVT MemoryVT = N->getMemoryVT(); | |||
2183 | unsigned Alignment = N->getOriginalAlignment(); | |||
2184 | MachineMemOperand::Flags MMOFlags = N->getMemOperand()->getFlags(); | |||
2185 | AAMDNodes AAInfo = N->getAAInfo(); | |||
2186 | SDValue Lo, Hi; | |||
2187 | GetSplitVector(N->getOperand(1), Lo, Hi); | |||
2188 | ||||
2189 | EVT LoMemVT, HiMemVT; | |||
2190 | std::tie(LoMemVT, HiMemVT) = DAG.GetSplitDestVTs(MemoryVT); | |||
2191 | ||||
2192 | // Scalarize if the split halves are not byte-sized. | |||
2193 | if (!LoMemVT.isByteSized() || !HiMemVT.isByteSized()) | |||
2194 | return TLI.scalarizeVectorStore(N, DAG); | |||
2195 | ||||
2196 | unsigned IncrementSize = LoMemVT.getSizeInBits()/8; | |||
2197 | ||||
2198 | if (isTruncating) | |||
2199 | Lo = DAG.getTruncStore(Ch, DL, Lo, Ptr, N->getPointerInfo(), LoMemVT, | |||
2200 | Alignment, MMOFlags, AAInfo); | |||
2201 | else | |||
2202 | Lo = DAG.getStore(Ch, DL, Lo, Ptr, N->getPointerInfo(), Alignment, MMOFlags, | |||
2203 | AAInfo); | |||
2204 | ||||
2205 | // Increment the pointer to the other half. | |||
2206 | Ptr = DAG.getObjectPtrOffset(DL, Ptr, IncrementSize); | |||
2207 | ||||
2208 | if (isTruncating) | |||
2209 | Hi = DAG.getTruncStore(Ch, DL, Hi, Ptr, | |||
2210 | N->getPointerInfo().getWithOffset(IncrementSize), | |||
2211 | HiMemVT, Alignment, MMOFlags, AAInfo); | |||
2212 | else | |||
2213 | Hi = DAG.getStore(Ch, DL, Hi, Ptr, | |||
2214 | N->getPointerInfo().getWithOffset(IncrementSize), | |||
2215 | Alignment, MMOFlags, AAInfo); | |||
2216 | ||||
2217 | return DAG.getNode(ISD::TokenFactor, DL, MVT::Other, Lo, Hi); | |||
2218 | } | |||
2219 | ||||
2220 | SDValue DAGTypeLegalizer::SplitVecOp_CONCAT_VECTORS(SDNode *N) { | |||
2221 | SDLoc DL(N); | |||
2222 | ||||
2223 | // The input operands all must have the same type, and we know the result | |||
2224 | // type is valid. Convert this to a buildvector which extracts all the | |||
2225 | // input elements. | |||
2226 | // TODO: If the input elements are power-two vectors, we could convert this to | |||
2227 | // a new CONCAT_VECTORS node with elements that are half-wide. | |||
2228 | SmallVector<SDValue, 32> Elts; | |||
2229 | EVT EltVT = N->getValueType(0).getVectorElementType(); | |||
2230 | for (const SDValue &Op : N->op_values()) { | |||
2231 | for (unsigned i = 0, e = Op.getValueType().getVectorNumElements(); | |||
2232 | i != e; ++i) { | |||
2233 | Elts.push_back(DAG.getNode( | |||
2234 | ISD::EXTRACT_VECTOR_ELT, DL, EltVT, Op, | |||
2235 | DAG.getConstant(i, DL, TLI.getVectorIdxTy(DAG.getDataLayout())))); | |||
2236 | } | |||
2237 | } | |||
2238 | ||||
2239 | return DAG.getBuildVector(N->getValueType(0), DL, Elts); | |||
2240 | } | |||
2241 | ||||
2242 | SDValue DAGTypeLegalizer::SplitVecOp_TruncateHelper(SDNode *N) { | |||
2243 | // The result type is legal, but the input type is illegal. If splitting | |||
2244 | // ends up with the result type of each half still being legal, just | |||
2245 | // do that. If, however, that would result in an illegal result type, | |||
2246 | // we can try to get more clever with power-two vectors. Specifically, | |||
2247 | // split the input type, but also widen the result element size, then | |||
2248 | // concatenate the halves and truncate again. For example, consider a target | |||
2249 | // where v8i8 is legal and v8i32 is not (ARM, which doesn't have 256-bit | |||
2250 | // vectors). To perform a "%res = v8i8 trunc v8i32 %in" we do: | |||
2251 | // %inlo = v4i32 extract_subvector %in, 0 | |||
2252 | // %inhi = v4i32 extract_subvector %in, 4 | |||
2253 | // %lo16 = v4i16 trunc v4i32 %inlo | |||
2254 | // %hi16 = v4i16 trunc v4i32 %inhi | |||
2255 | // %in16 = v8i16 concat_vectors v4i16 %lo16, v4i16 %hi16 | |||
2256 | // %res = v8i8 trunc v8i16 %in16 | |||
2257 | // | |||
2258 | // Without this transform, the original truncate would end up being | |||
2259 | // scalarized, which is pretty much always a last resort. | |||
2260 | SDValue InVec = N->getOperand(0); | |||
2261 | EVT InVT = InVec->getValueType(0); | |||
2262 | EVT OutVT = N->getValueType(0); | |||
2263 | unsigned NumElements = OutVT.getVectorNumElements(); | |||
2264 | bool IsFloat = OutVT.isFloatingPoint(); | |||
2265 | ||||
2266 | // Widening should have already made sure this is a power-two vector | |||
2267 | // if we're trying to split it at all. assert() that's true, just in case. | |||
2268 | assert(!(NumElements & 1) && "Splitting vector, but not in half!")((!(NumElements & 1) && "Splitting vector, but not in half!" ) ? static_cast<void> (0) : __assert_fail ("!(NumElements & 1) && \"Splitting vector, but not in half!\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 2268, __PRETTY_FUNCTION__)); | |||
2269 | ||||
2270 | unsigned InElementSize = InVT.getScalarSizeInBits(); | |||
2271 | unsigned OutElementSize = OutVT.getScalarSizeInBits(); | |||
2272 | ||||
2273 | // Determine the split output VT. If its legal we can just split dirctly. | |||
2274 | EVT LoOutVT, HiOutVT; | |||
2275 | std::tie(LoOutVT, HiOutVT) = DAG.GetSplitDestVTs(OutVT); | |||
2276 | assert(LoOutVT == HiOutVT && "Unequal split?")((LoOutVT == HiOutVT && "Unequal split?") ? static_cast <void> (0) : __assert_fail ("LoOutVT == HiOutVT && \"Unequal split?\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 2276, __PRETTY_FUNCTION__)); | |||
2277 | ||||
2278 | // If the input elements are only 1/2 the width of the result elements, | |||
2279 | // just use the normal splitting. Our trick only work if there's room | |||
2280 | // to split more than once. | |||
2281 | if (isTypeLegal(LoOutVT) || | |||
2282 | InElementSize <= OutElementSize * 2) | |||
2283 | return SplitVecOp_UnaryOp(N); | |||
2284 | SDLoc DL(N); | |||
2285 | ||||
2286 | // Don't touch if this will be scalarized. | |||
2287 | EVT FinalVT = InVT; | |||
2288 | while (getTypeAction(FinalVT) == TargetLowering::TypeSplitVector) | |||
2289 | FinalVT = FinalVT.getHalfNumVectorElementsVT(*DAG.getContext()); | |||
2290 | ||||
2291 | if (getTypeAction(FinalVT) == TargetLowering::TypeScalarizeVector) | |||
2292 | return SplitVecOp_UnaryOp(N); | |||
2293 | ||||
2294 | // Get the split input vector. | |||
2295 | SDValue InLoVec, InHiVec; | |||
2296 | GetSplitVector(InVec, InLoVec, InHiVec); | |||
2297 | ||||
2298 | // Truncate them to 1/2 the element size. | |||
2299 | EVT HalfElementVT = IsFloat ? | |||
2300 | EVT::getFloatingPointVT(InElementSize/2) : | |||
2301 | EVT::getIntegerVT(*DAG.getContext(), InElementSize/2); | |||
2302 | EVT HalfVT = EVT::getVectorVT(*DAG.getContext(), HalfElementVT, | |||
2303 | NumElements/2); | |||
2304 | SDValue HalfLo = DAG.getNode(N->getOpcode(), DL, HalfVT, InLoVec); | |||
2305 | SDValue HalfHi = DAG.getNode(N->getOpcode(), DL, HalfVT, InHiVec); | |||
2306 | // Concatenate them to get the full intermediate truncation result. | |||
2307 | EVT InterVT = EVT::getVectorVT(*DAG.getContext(), HalfElementVT, NumElements); | |||
2308 | SDValue InterVec = DAG.getNode(ISD::CONCAT_VECTORS, DL, InterVT, HalfLo, | |||
2309 | HalfHi); | |||
2310 | // Now finish up by truncating all the way down to the original result | |||
2311 | // type. This should normally be something that ends up being legal directly, | |||
2312 | // but in theory if a target has very wide vectors and an annoyingly | |||
2313 | // restricted set of legal types, this split can chain to build things up. | |||
2314 | return IsFloat | |||
2315 | ? DAG.getNode(ISD::FP_ROUND, DL, OutVT, InterVec, | |||
2316 | DAG.getTargetConstant( | |||
2317 | 0, DL, TLI.getPointerTy(DAG.getDataLayout()))) | |||
2318 | : DAG.getNode(ISD::TRUNCATE, DL, OutVT, InterVec); | |||
2319 | } | |||
2320 | ||||
2321 | SDValue DAGTypeLegalizer::SplitVecOp_VSETCC(SDNode *N) { | |||
2322 | assert(N->getValueType(0).isVector() &&((N->getValueType(0).isVector() && N->getOperand (0).getValueType().isVector() && "Operand types must be vectors" ) ? static_cast<void> (0) : __assert_fail ("N->getValueType(0).isVector() && N->getOperand(0).getValueType().isVector() && \"Operand types must be vectors\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 2324, __PRETTY_FUNCTION__)) | |||
2323 | N->getOperand(0).getValueType().isVector() &&((N->getValueType(0).isVector() && N->getOperand (0).getValueType().isVector() && "Operand types must be vectors" ) ? static_cast<void> (0) : __assert_fail ("N->getValueType(0).isVector() && N->getOperand(0).getValueType().isVector() && \"Operand types must be vectors\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 2324, __PRETTY_FUNCTION__)) | |||
2324 | "Operand types must be vectors")((N->getValueType(0).isVector() && N->getOperand (0).getValueType().isVector() && "Operand types must be vectors" ) ? static_cast<void> (0) : __assert_fail ("N->getValueType(0).isVector() && N->getOperand(0).getValueType().isVector() && \"Operand types must be vectors\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 2324, __PRETTY_FUNCTION__)); | |||
2325 | // The result has a legal vector type, but the input needs splitting. | |||
2326 | SDValue Lo0, Hi0, Lo1, Hi1, LoRes, HiRes; | |||
2327 | SDLoc DL(N); | |||
2328 | GetSplitVector(N->getOperand(0), Lo0, Hi0); | |||
2329 | GetSplitVector(N->getOperand(1), Lo1, Hi1); | |||
2330 | unsigned PartElements = Lo0.getValueType().getVectorNumElements(); | |||
2331 | EVT PartResVT = EVT::getVectorVT(*DAG.getContext(), MVT::i1, PartElements); | |||
2332 | EVT WideResVT = EVT::getVectorVT(*DAG.getContext(), MVT::i1, 2*PartElements); | |||
2333 | ||||
2334 | LoRes = DAG.getNode(ISD::SETCC, DL, PartResVT, Lo0, Lo1, N->getOperand(2)); | |||
2335 | HiRes = DAG.getNode(ISD::SETCC, DL, PartResVT, Hi0, Hi1, N->getOperand(2)); | |||
2336 | SDValue Con = DAG.getNode(ISD::CONCAT_VECTORS, DL, WideResVT, LoRes, HiRes); | |||
2337 | return PromoteTargetBoolean(Con, N->getValueType(0)); | |||
2338 | } | |||
2339 | ||||
2340 | ||||
2341 | SDValue DAGTypeLegalizer::SplitVecOp_FP_ROUND(SDNode *N) { | |||
2342 | // The result has a legal vector type, but the input needs splitting. | |||
2343 | EVT ResVT = N->getValueType(0); | |||
2344 | SDValue Lo, Hi; | |||
2345 | SDLoc DL(N); | |||
2346 | GetSplitVector(N->getOperand(0), Lo, Hi); | |||
2347 | EVT InVT = Lo.getValueType(); | |||
2348 | ||||
2349 | EVT OutVT = EVT::getVectorVT(*DAG.getContext(), ResVT.getVectorElementType(), | |||
2350 | InVT.getVectorNumElements()); | |||
2351 | ||||
2352 | Lo = DAG.getNode(ISD::FP_ROUND, DL, OutVT, Lo, N->getOperand(1)); | |||
2353 | Hi = DAG.getNode(ISD::FP_ROUND, DL, OutVT, Hi, N->getOperand(1)); | |||
2354 | ||||
2355 | return DAG.getNode(ISD::CONCAT_VECTORS, DL, ResVT, Lo, Hi); | |||
2356 | } | |||
2357 | ||||
2358 | SDValue DAGTypeLegalizer::SplitVecOp_FCOPYSIGN(SDNode *N) { | |||
2359 | // The result (and the first input) has a legal vector type, but the second | |||
2360 | // input needs splitting. | |||
2361 | return DAG.UnrollVectorOp(N, N->getValueType(0).getVectorNumElements()); | |||
2362 | } | |||
2363 | ||||
2364 | ||||
2365 | //===----------------------------------------------------------------------===// | |||
2366 | // Result Vector Widening | |||
2367 | //===----------------------------------------------------------------------===// | |||
2368 | ||||
2369 | void DAGTypeLegalizer::WidenVectorResult(SDNode *N, unsigned ResNo) { | |||
2370 | LLVM_DEBUG(dbgs() << "Widen node result " << ResNo << ": "; N->dump(&DAG);do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType ("legalize-types")) { dbgs() << "Widen node result " << ResNo << ": "; N->dump(&DAG); dbgs() << "\n" ; } } while (false) | |||
2371 | dbgs() << "\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType ("legalize-types")) { dbgs() << "Widen node result " << ResNo << ": "; N->dump(&DAG); dbgs() << "\n" ; } } while (false); | |||
2372 | ||||
2373 | // See if the target wants to custom widen this node. | |||
2374 | if (CustomWidenLowerNode(N, N->getValueType(ResNo))) | |||
2375 | return; | |||
2376 | ||||
2377 | SDValue Res = SDValue(); | |||
2378 | switch (N->getOpcode()) { | |||
2379 | default: | |||
2380 | #ifndef NDEBUG | |||
2381 | dbgs() << "WidenVectorResult #" << ResNo << ": "; | |||
2382 | N->dump(&DAG); | |||
2383 | dbgs() << "\n"; | |||
2384 | #endif | |||
2385 | llvm_unreachable("Do not know how to widen the result of this operator!")::llvm::llvm_unreachable_internal("Do not know how to widen the result of this operator!" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 2385); | |||
2386 | ||||
2387 | case ISD::MERGE_VALUES: Res = WidenVecRes_MERGE_VALUES(N, ResNo); break; | |||
2388 | case ISD::BITCAST: Res = WidenVecRes_BITCAST(N); break; | |||
2389 | case ISD::BUILD_VECTOR: Res = WidenVecRes_BUILD_VECTOR(N); break; | |||
2390 | case ISD::CONCAT_VECTORS: Res = WidenVecRes_CONCAT_VECTORS(N); break; | |||
2391 | case ISD::EXTRACT_SUBVECTOR: Res = WidenVecRes_EXTRACT_SUBVECTOR(N); break; | |||
2392 | case ISD::FP_ROUND_INREG: Res = WidenVecRes_InregOp(N); break; | |||
2393 | case ISD::INSERT_VECTOR_ELT: Res = WidenVecRes_INSERT_VECTOR_ELT(N); break; | |||
2394 | case ISD::LOAD: Res = WidenVecRes_LOAD(N); break; | |||
2395 | case ISD::SCALAR_TO_VECTOR: Res = WidenVecRes_SCALAR_TO_VECTOR(N); break; | |||
2396 | case ISD::SIGN_EXTEND_INREG: Res = WidenVecRes_InregOp(N); break; | |||
2397 | case ISD::VSELECT: | |||
2398 | case ISD::SELECT: Res = WidenVecRes_SELECT(N); break; | |||
2399 | case ISD::SELECT_CC: Res = WidenVecRes_SELECT_CC(N); break; | |||
2400 | case ISD::SETCC: Res = WidenVecRes_SETCC(N); break; | |||
2401 | case ISD::UNDEF: Res = WidenVecRes_UNDEF(N); break; | |||
2402 | case ISD::VECTOR_SHUFFLE: | |||
2403 | Res = WidenVecRes_VECTOR_SHUFFLE(cast<ShuffleVectorSDNode>(N)); | |||
2404 | break; | |||
2405 | case ISD::MLOAD: | |||
2406 | Res = WidenVecRes_MLOAD(cast<MaskedLoadSDNode>(N)); | |||
2407 | break; | |||
2408 | case ISD::MGATHER: | |||
2409 | Res = WidenVecRes_MGATHER(cast<MaskedGatherSDNode>(N)); | |||
2410 | break; | |||
2411 | ||||
2412 | case ISD::ADD: | |||
2413 | case ISD::AND: | |||
2414 | case ISD::MUL: | |||
2415 | case ISD::MULHS: | |||
2416 | case ISD::MULHU: | |||
2417 | case ISD::OR: | |||
2418 | case ISD::SUB: | |||
2419 | case ISD::XOR: | |||
2420 | case ISD::FMINNUM: | |||
2421 | case ISD::FMAXNUM: | |||
2422 | case ISD::FMINIMUM: | |||
2423 | case ISD::FMAXIMUM: | |||
2424 | case ISD::SMIN: | |||
2425 | case ISD::SMAX: | |||
2426 | case ISD::UMIN: | |||
2427 | case ISD::UMAX: | |||
2428 | case ISD::UADDSAT: | |||
2429 | case ISD::SADDSAT: | |||
2430 | case ISD::USUBSAT: | |||
2431 | case ISD::SSUBSAT: | |||
2432 | Res = WidenVecRes_Binary(N); | |||
2433 | break; | |||
2434 | ||||
2435 | case ISD::FADD: | |||
2436 | case ISD::FMUL: | |||
2437 | case ISD::FPOW: | |||
2438 | case ISD::FSUB: | |||
2439 | case ISD::FDIV: | |||
2440 | case ISD::FREM: | |||
2441 | case ISD::SDIV: | |||
2442 | case ISD::UDIV: | |||
2443 | case ISD::SREM: | |||
2444 | case ISD::UREM: | |||
2445 | Res = WidenVecRes_BinaryCanTrap(N); | |||
2446 | break; | |||
2447 | ||||
2448 | case ISD::STRICT_FADD: | |||
2449 | case ISD::STRICT_FSUB: | |||
2450 | case ISD::STRICT_FMUL: | |||
2451 | case ISD::STRICT_FDIV: | |||
2452 | case ISD::STRICT_FREM: | |||
2453 | case ISD::STRICT_FSQRT: | |||
2454 | case ISD::STRICT_FMA: | |||
2455 | case ISD::STRICT_FPOW: | |||
2456 | case ISD::STRICT_FPOWI: | |||
2457 | case ISD::STRICT_FSIN: | |||
2458 | case ISD::STRICT_FCOS: | |||
2459 | case ISD::STRICT_FEXP: | |||
2460 | case ISD::STRICT_FEXP2: | |||
2461 | case ISD::STRICT_FLOG: | |||
2462 | case ISD::STRICT_FLOG10: | |||
2463 | case ISD::STRICT_FLOG2: | |||
2464 | case ISD::STRICT_FRINT: | |||
2465 | case ISD::STRICT_FNEARBYINT: | |||
2466 | case ISD::STRICT_FMAXNUM: | |||
2467 | case ISD::STRICT_FMINNUM: | |||
2468 | case ISD::STRICT_FCEIL: | |||
2469 | case ISD::STRICT_FFLOOR: | |||
2470 | case ISD::STRICT_FROUND: | |||
2471 | case ISD::STRICT_FTRUNC: | |||
2472 | Res = WidenVecRes_StrictFP(N); | |||
2473 | break; | |||
2474 | ||||
2475 | case ISD::FCOPYSIGN: | |||
2476 | Res = WidenVecRes_FCOPYSIGN(N); | |||
2477 | break; | |||
2478 | ||||
2479 | case ISD::FPOWI: | |||
2480 | Res = WidenVecRes_POWI(N); | |||
2481 | break; | |||
2482 | ||||
2483 | case ISD::SHL: | |||
2484 | case ISD::SRA: | |||
2485 | case ISD::SRL: | |||
2486 | Res = WidenVecRes_Shift(N); | |||
2487 | break; | |||
2488 | ||||
2489 | case ISD::ANY_EXTEND_VECTOR_INREG: | |||
2490 | case ISD::SIGN_EXTEND_VECTOR_INREG: | |||
2491 | case ISD::ZERO_EXTEND_VECTOR_INREG: | |||
2492 | Res = WidenVecRes_EXTEND_VECTOR_INREG(N); | |||
2493 | break; | |||
2494 | ||||
2495 | case ISD::ANY_EXTEND: | |||
2496 | case ISD::FP_EXTEND: | |||
2497 | case ISD::FP_ROUND: | |||
2498 | case ISD::FP_TO_SINT: | |||
2499 | case ISD::FP_TO_UINT: | |||
2500 | case ISD::SIGN_EXTEND: | |||
2501 | case ISD::SINT_TO_FP: | |||
2502 | case ISD::TRUNCATE: | |||
2503 | case ISD::UINT_TO_FP: | |||
2504 | case ISD::ZERO_EXTEND: | |||
2505 | Res = WidenVecRes_Convert(N); | |||
2506 | break; | |||
2507 | ||||
2508 | case ISD::FABS: | |||
2509 | case ISD::FCEIL: | |||
2510 | case ISD::FCOS: | |||
2511 | case ISD::FEXP: | |||
2512 | case ISD::FEXP2: | |||
2513 | case ISD::FFLOOR: | |||
2514 | case ISD::FLOG: | |||
2515 | case ISD::FLOG10: | |||
2516 | case ISD::FLOG2: | |||
2517 | case ISD::FNEARBYINT: | |||
2518 | case ISD::FRINT: | |||
2519 | case ISD::FROUND: | |||
2520 | case ISD::FSIN: | |||
2521 | case ISD::FSQRT: | |||
2522 | case ISD::FTRUNC: { | |||
2523 | // We're going to widen this vector op to a legal type by padding with undef | |||
2524 | // elements. If the wide vector op is eventually going to be expanded to | |||
2525 | // scalar libcalls, then unroll into scalar ops now to avoid unnecessary | |||
2526 | // libcalls on the undef elements. We are assuming that if the scalar op | |||
2527 | // requires expanding, then the vector op needs expanding too. | |||
2528 | EVT VT = N->getValueType(0); | |||
2529 | if (TLI.isOperationExpand(N->getOpcode(), VT.getScalarType())) { | |||
2530 | EVT WideVecVT = TLI.getTypeToTransformTo(*DAG.getContext(), VT); | |||
2531 | assert(!TLI.isOperationLegalOrCustom(N->getOpcode(), WideVecVT) &&((!TLI.isOperationLegalOrCustom(N->getOpcode(), WideVecVT) && "Target supports vector op, but scalar requires expansion?" ) ? static_cast<void> (0) : __assert_fail ("!TLI.isOperationLegalOrCustom(N->getOpcode(), WideVecVT) && \"Target supports vector op, but scalar requires expansion?\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 2532, __PRETTY_FUNCTION__)) | |||
2532 | "Target supports vector op, but scalar requires expansion?")((!TLI.isOperationLegalOrCustom(N->getOpcode(), WideVecVT) && "Target supports vector op, but scalar requires expansion?" ) ? static_cast<void> (0) : __assert_fail ("!TLI.isOperationLegalOrCustom(N->getOpcode(), WideVecVT) && \"Target supports vector op, but scalar requires expansion?\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 2532, __PRETTY_FUNCTION__)); | |||
2533 | Res = DAG.UnrollVectorOp(N, WideVecVT.getVectorNumElements()); | |||
2534 | break; | |||
2535 | } | |||
2536 | } | |||
2537 | // If the target has custom/legal support for the scalar FP intrinsic ops | |||
2538 | // (they are probably not destined to become libcalls), then widen those like | |||
2539 | // any other unary ops. | |||
2540 | LLVM_FALLTHROUGH[[clang::fallthrough]]; | |||
2541 | ||||
2542 | case ISD::BITREVERSE: | |||
2543 | case ISD::BSWAP: | |||
2544 | case ISD::CTLZ: | |||
2545 | case ISD::CTPOP: | |||
2546 | case ISD::CTTZ: | |||
2547 | case ISD::FNEG: | |||
2548 | case ISD::FCANONICALIZE: | |||
2549 | Res = WidenVecRes_Unary(N); | |||
2550 | break; | |||
2551 | case ISD::FMA: | |||
2552 | Res = WidenVecRes_Ternary(N); | |||
2553 | break; | |||
2554 | } | |||
2555 | ||||
2556 | // If Res is null, the sub-method took care of registering the result. | |||
2557 | if (Res.getNode()) | |||
2558 | SetWidenedVector(SDValue(N, ResNo), Res); | |||
2559 | } | |||
2560 | ||||
2561 | SDValue DAGTypeLegalizer::WidenVecRes_Ternary(SDNode *N) { | |||
2562 | // Ternary op widening. | |||
2563 | SDLoc dl(N); | |||
2564 | EVT WidenVT = TLI.getTypeToTransformTo(*DAG.getContext(), N->getValueType(0)); | |||
2565 | SDValue InOp1 = GetWidenedVector(N->getOperand(0)); | |||
2566 | SDValue InOp2 = GetWidenedVector(N->getOperand(1)); | |||
2567 | SDValue InOp3 = GetWidenedVector(N->getOperand(2)); | |||
2568 | return DAG.getNode(N->getOpcode(), dl, WidenVT, InOp1, InOp2, InOp3); | |||
2569 | } | |||
2570 | ||||
2571 | SDValue DAGTypeLegalizer::WidenVecRes_Binary(SDNode *N) { | |||
2572 | // Binary op widening. | |||
2573 | SDLoc dl(N); | |||
2574 | EVT WidenVT = TLI.getTypeToTransformTo(*DAG.getContext(), N->getValueType(0)); | |||
2575 | SDValue InOp1 = GetWidenedVector(N->getOperand(0)); | |||
2576 | SDValue InOp2 = GetWidenedVector(N->getOperand(1)); | |||
2577 | return DAG.getNode(N->getOpcode(), dl, WidenVT, InOp1, InOp2, N->getFlags()); | |||
2578 | } | |||
2579 | ||||
2580 | // Given a vector of operations that have been broken up to widen, see | |||
2581 | // if we can collect them together into the next widest legal VT. This | |||
2582 | // implementation is trap-safe. | |||
2583 | static SDValue CollectOpsToWiden(SelectionDAG &DAG, const TargetLowering &TLI, | |||
2584 | SmallVectorImpl<SDValue> &ConcatOps, | |||
2585 | unsigned ConcatEnd, EVT VT, EVT MaxVT, | |||
2586 | EVT WidenVT) { | |||
2587 | // Check to see if we have a single operation with the widen type. | |||
2588 | if (ConcatEnd == 1) { | |||
2589 | VT = ConcatOps[0].getValueType(); | |||
2590 | if (VT == WidenVT) | |||
2591 | return ConcatOps[0]; | |||
2592 | } | |||
2593 | ||||
2594 | SDLoc dl(ConcatOps[0]); | |||
2595 | EVT WidenEltVT = WidenVT.getVectorElementType(); | |||
2596 | int Idx = 0; | |||
2597 | ||||
2598 | // while (Some element of ConcatOps is not of type MaxVT) { | |||
2599 | // From the end of ConcatOps, collect elements of the same type and put | |||
2600 | // them into an op of the next larger supported type | |||
2601 | // } | |||
2602 | while (ConcatOps[ConcatEnd-1].getValueType() != MaxVT) { | |||
2603 | Idx = ConcatEnd - 1; | |||
2604 | VT = ConcatOps[Idx--].getValueType(); | |||
2605 | while (Idx >= 0 && ConcatOps[Idx].getValueType() == VT) | |||
2606 | Idx--; | |||
2607 | ||||
2608 | int NextSize = VT.isVector() ? VT.getVectorNumElements() : 1; | |||
2609 | EVT NextVT; | |||
2610 | do { | |||
2611 | NextSize *= 2; | |||
2612 | NextVT = EVT::getVectorVT(*DAG.getContext(), WidenEltVT, NextSize); | |||
2613 | } while (!TLI.isTypeLegal(NextVT)); | |||
2614 | ||||
2615 | if (!VT.isVector()) { | |||
2616 | // Scalar type, create an INSERT_VECTOR_ELEMENT of type NextVT | |||
2617 | SDValue VecOp = DAG.getUNDEF(NextVT); | |||
2618 | unsigned NumToInsert = ConcatEnd - Idx - 1; | |||
2619 | for (unsigned i = 0, OpIdx = Idx+1; i < NumToInsert; i++, OpIdx++) { | |||
2620 | VecOp = DAG.getNode( | |||
2621 | ISD::INSERT_VECTOR_ELT, dl, NextVT, VecOp, ConcatOps[OpIdx], | |||
2622 | DAG.getConstant(i, dl, TLI.getVectorIdxTy(DAG.getDataLayout()))); | |||
2623 | } | |||
2624 | ConcatOps[Idx+1] = VecOp; | |||
2625 | ConcatEnd = Idx + 2; | |||
2626 | } else { | |||
2627 | // Vector type, create a CONCAT_VECTORS of type NextVT | |||
2628 | SDValue undefVec = DAG.getUNDEF(VT); | |||
2629 | unsigned OpsToConcat = NextSize/VT.getVectorNumElements(); | |||
2630 | SmallVector<SDValue, 16> SubConcatOps(OpsToConcat); | |||
2631 | unsigned RealVals = ConcatEnd - Idx - 1; | |||
2632 | unsigned SubConcatEnd = 0; | |||
2633 | unsigned SubConcatIdx = Idx + 1; | |||
2634 | while (SubConcatEnd < RealVals) | |||
2635 | SubConcatOps[SubConcatEnd++] = ConcatOps[++Idx]; | |||
2636 | while (SubConcatEnd < OpsToConcat) | |||
2637 | SubConcatOps[SubConcatEnd++] = undefVec; | |||
2638 | ConcatOps[SubConcatIdx] = DAG.getNode(ISD::CONCAT_VECTORS, dl, | |||
2639 | NextVT, SubConcatOps); | |||
2640 | ConcatEnd = SubConcatIdx + 1; | |||
2641 | } | |||
2642 | } | |||
2643 | ||||
2644 | // Check to see if we have a single operation with the widen type. | |||
2645 | if (ConcatEnd == 1) { | |||
2646 | VT = ConcatOps[0].getValueType(); | |||
2647 | if (VT == WidenVT) | |||
2648 | return ConcatOps[0]; | |||
2649 | } | |||
2650 | ||||
2651 | // add undefs of size MaxVT until ConcatOps grows to length of WidenVT | |||
2652 | unsigned NumOps = WidenVT.getVectorNumElements()/MaxVT.getVectorNumElements(); | |||
2653 | if (NumOps != ConcatEnd ) { | |||
2654 | SDValue UndefVal = DAG.getUNDEF(MaxVT); | |||
2655 | for (unsigned j = ConcatEnd; j < NumOps; ++j) | |||
2656 | ConcatOps[j] = UndefVal; | |||
2657 | } | |||
2658 | return DAG.getNode(ISD::CONCAT_VECTORS, dl, WidenVT, | |||
2659 | makeArrayRef(ConcatOps.data(), NumOps)); | |||
2660 | } | |||
2661 | ||||
2662 | SDValue DAGTypeLegalizer::WidenVecRes_BinaryCanTrap(SDNode *N) { | |||
2663 | // Binary op widening for operations that can trap. | |||
2664 | unsigned Opcode = N->getOpcode(); | |||
2665 | SDLoc dl(N); | |||
2666 | EVT WidenVT = TLI.getTypeToTransformTo(*DAG.getContext(), N->getValueType(0)); | |||
2667 | EVT WidenEltVT = WidenVT.getVectorElementType(); | |||
2668 | EVT VT = WidenVT; | |||
2669 | unsigned NumElts = VT.getVectorNumElements(); | |||
2670 | const SDNodeFlags Flags = N->getFlags(); | |||
2671 | while (!TLI.isTypeLegal(VT) && NumElts != 1) { | |||
2672 | NumElts = NumElts / 2; | |||
2673 | VT = EVT::getVectorVT(*DAG.getContext(), WidenEltVT, NumElts); | |||
2674 | } | |||
2675 | ||||
2676 | if (NumElts != 1 && !TLI.canOpTrap(N->getOpcode(), VT)) { | |||
2677 | // Operation doesn't trap so just widen as normal. | |||
2678 | SDValue InOp1 = GetWidenedVector(N->getOperand(0)); | |||
2679 | SDValue InOp2 = GetWidenedVector(N->getOperand(1)); | |||
2680 | return DAG.getNode(N->getOpcode(), dl, WidenVT, InOp1, InOp2, Flags); | |||
2681 | } | |||
2682 | ||||
2683 | // No legal vector version so unroll the vector operation and then widen. | |||
2684 | if (NumElts == 1) | |||
2685 | return DAG.UnrollVectorOp(N, WidenVT.getVectorNumElements()); | |||
2686 | ||||
2687 | // Since the operation can trap, apply operation on the original vector. | |||
2688 | EVT MaxVT = VT; | |||
2689 | SDValue InOp1 = GetWidenedVector(N->getOperand(0)); | |||
2690 | SDValue InOp2 = GetWidenedVector(N->getOperand(1)); | |||
2691 | unsigned CurNumElts = N->getValueType(0).getVectorNumElements(); | |||
2692 | ||||
2693 | SmallVector<SDValue, 16> ConcatOps(CurNumElts); | |||
2694 | unsigned ConcatEnd = 0; // Current ConcatOps index. | |||
2695 | int Idx = 0; // Current Idx into input vectors. | |||
2696 | ||||
2697 | // NumElts := greatest legal vector size (at most WidenVT) | |||
2698 | // while (orig. vector has unhandled elements) { | |||
2699 | // take munches of size NumElts from the beginning and add to ConcatOps | |||
2700 | // NumElts := next smaller supported vector size or 1 | |||
2701 | // } | |||
2702 | while (CurNumElts != 0) { | |||
2703 | while (CurNumElts >= NumElts) { | |||
2704 | SDValue EOp1 = DAG.getNode( | |||
2705 | ISD::EXTRACT_SUBVECTOR, dl, VT, InOp1, | |||
2706 | DAG.getConstant(Idx, dl, TLI.getVectorIdxTy(DAG.getDataLayout()))); | |||
2707 | SDValue EOp2 = DAG.getNode( | |||
2708 | ISD::EXTRACT_SUBVECTOR, dl, VT, InOp2, | |||
2709 | DAG.getConstant(Idx, dl, TLI.getVectorIdxTy(DAG.getDataLayout()))); | |||
2710 | ConcatOps[ConcatEnd++] = DAG.getNode(Opcode, dl, VT, EOp1, EOp2, Flags); | |||
2711 | Idx += NumElts; | |||
2712 | CurNumElts -= NumElts; | |||
2713 | } | |||
2714 | do { | |||
2715 | NumElts = NumElts / 2; | |||
2716 | VT = EVT::getVectorVT(*DAG.getContext(), WidenEltVT, NumElts); | |||
2717 | } while (!TLI.isTypeLegal(VT) && NumElts != 1); | |||
2718 | ||||
2719 | if (NumElts == 1) { | |||
2720 | for (unsigned i = 0; i != CurNumElts; ++i, ++Idx) { | |||
2721 | SDValue EOp1 = DAG.getNode( | |||
2722 | ISD::EXTRACT_VECTOR_ELT, dl, WidenEltVT, InOp1, | |||
2723 | DAG.getConstant(Idx, dl, TLI.getVectorIdxTy(DAG.getDataLayout()))); | |||
2724 | SDValue EOp2 = DAG.getNode( | |||
2725 | ISD::EXTRACT_VECTOR_ELT, dl, WidenEltVT, InOp2, | |||
2726 | DAG.getConstant(Idx, dl, TLI.getVectorIdxTy(DAG.getDataLayout()))); | |||
2727 | ConcatOps[ConcatEnd++] = DAG.getNode(Opcode, dl, WidenEltVT, | |||
2728 | EOp1, EOp2, Flags); | |||
2729 | } | |||
2730 | CurNumElts = 0; | |||
2731 | } | |||
2732 | } | |||
2733 | ||||
2734 | return CollectOpsToWiden(DAG, TLI, ConcatOps, ConcatEnd, VT, MaxVT, WidenVT); | |||
2735 | } | |||
2736 | ||||
2737 | SDValue DAGTypeLegalizer::WidenVecRes_StrictFP(SDNode *N) { | |||
2738 | // StrictFP op widening for operations that can trap. | |||
2739 | unsigned NumOpers = N->getNumOperands(); | |||
2740 | unsigned Opcode = N->getOpcode(); | |||
2741 | SDLoc dl(N); | |||
2742 | EVT WidenVT = TLI.getTypeToTransformTo(*DAG.getContext(), N->getValueType(0)); | |||
2743 | EVT WidenEltVT = WidenVT.getVectorElementType(); | |||
2744 | EVT VT = WidenVT; | |||
2745 | unsigned NumElts = VT.getVectorNumElements(); | |||
2746 | while (!TLI.isTypeLegal(VT) && NumElts != 1) { | |||
2747 | NumElts = NumElts / 2; | |||
2748 | VT = EVT::getVectorVT(*DAG.getContext(), WidenEltVT, NumElts); | |||
2749 | } | |||
2750 | ||||
2751 | // No legal vector version so unroll the vector operation and then widen. | |||
2752 | if (NumElts == 1) | |||
2753 | return DAG.UnrollVectorOp(N, WidenVT.getVectorNumElements()); | |||
2754 | ||||
2755 | // Since the operation can trap, apply operation on the original vector. | |||
2756 | EVT MaxVT = VT; | |||
2757 | SmallVector<SDValue, 4> InOps; | |||
2758 | unsigned CurNumElts = N->getValueType(0).getVectorNumElements(); | |||
2759 | ||||
2760 | SmallVector<SDValue, 16> ConcatOps(CurNumElts); | |||
2761 | SmallVector<SDValue, 16> Chains; | |||
2762 | unsigned ConcatEnd = 0; // Current ConcatOps index. | |||
2763 | int Idx = 0; // Current Idx into input vectors. | |||
2764 | ||||
2765 | // The Chain is the first operand. | |||
2766 | InOps.push_back(N->getOperand(0)); | |||
2767 | ||||
2768 | // Now process the remaining operands. | |||
2769 | for (unsigned i = 1; i < NumOpers; ++i) { | |||
2770 | SDValue Oper = N->getOperand(i); | |||
2771 | ||||
2772 | if (Oper.getValueType().isVector()) { | |||
2773 | assert(Oper.getValueType() == N->getValueType(0) &&((Oper.getValueType() == N->getValueType(0) && "Invalid operand type to widen!" ) ? static_cast<void> (0) : __assert_fail ("Oper.getValueType() == N->getValueType(0) && \"Invalid operand type to widen!\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 2774, __PRETTY_FUNCTION__)) | |||
2774 | "Invalid operand type to widen!")((Oper.getValueType() == N->getValueType(0) && "Invalid operand type to widen!" ) ? static_cast<void> (0) : __assert_fail ("Oper.getValueType() == N->getValueType(0) && \"Invalid operand type to widen!\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 2774, __PRETTY_FUNCTION__)); | |||
2775 | Oper = GetWidenedVector(Oper); | |||
2776 | } | |||
2777 | ||||
2778 | InOps.push_back(Oper); | |||
2779 | } | |||
2780 | ||||
2781 | // NumElts := greatest legal vector size (at most WidenVT) | |||
2782 | // while (orig. vector has unhandled elements) { | |||
2783 | // take munches of size NumElts from the beginning and add to ConcatOps | |||
2784 | // NumElts := next smaller supported vector size or 1 | |||
2785 | // } | |||
2786 | while (CurNumElts != 0) { | |||
2787 | while (CurNumElts >= NumElts) { | |||
2788 | SmallVector<SDValue, 4> EOps; | |||
2789 | ||||
2790 | for (unsigned i = 0; i < NumOpers; ++i) { | |||
2791 | SDValue Op = InOps[i]; | |||
2792 | ||||
2793 | if (Op.getValueType().isVector()) | |||
2794 | Op = DAG.getNode( | |||
2795 | ISD::EXTRACT_SUBVECTOR, dl, VT, Op, | |||
2796 | DAG.getConstant(Idx, dl, TLI.getVectorIdxTy(DAG.getDataLayout()))); | |||
2797 | ||||
2798 | EOps.push_back(Op); | |||
2799 | } | |||
2800 | ||||
2801 | EVT OperVT[] = {VT, MVT::Other}; | |||
2802 | SDValue Oper = DAG.getNode(Opcode, dl, OperVT, EOps); | |||
2803 | ConcatOps[ConcatEnd++] = Oper; | |||
2804 | Chains.push_back(Oper.getValue(1)); | |||
2805 | Idx += NumElts; | |||
2806 | CurNumElts -= NumElts; | |||
2807 | } | |||
2808 | do { | |||
2809 | NumElts = NumElts / 2; | |||
2810 | VT = EVT::getVectorVT(*DAG.getContext(), WidenEltVT, NumElts); | |||
2811 | } while (!TLI.isTypeLegal(VT) && NumElts != 1); | |||
2812 | ||||
2813 | if (NumElts == 1) { | |||
2814 | for (unsigned i = 0; i != CurNumElts; ++i, ++Idx) { | |||
2815 | SmallVector<SDValue, 4> EOps; | |||
2816 | ||||
2817 | for (unsigned i = 0; i < NumOpers; ++i) { | |||
2818 | SDValue Op = InOps[i]; | |||
2819 | ||||
2820 | if (Op.getValueType().isVector()) | |||
2821 | Op = DAG.getNode( | |||
2822 | ISD::EXTRACT_VECTOR_ELT, dl, WidenEltVT, Op, | |||
2823 | DAG.getConstant(Idx, dl, | |||
2824 | TLI.getVectorIdxTy(DAG.getDataLayout()))); | |||
2825 | ||||
2826 | EOps.push_back(Op); | |||
2827 | } | |||
2828 | ||||
2829 | EVT WidenVT[] = {WidenEltVT, MVT::Other}; | |||
2830 | SDValue Oper = DAG.getNode(Opcode, dl, WidenVT, EOps); | |||
2831 | ConcatOps[ConcatEnd++] = Oper; | |||
2832 | Chains.push_back(Oper.getValue(1)); | |||
2833 | } | |||
2834 | CurNumElts = 0; | |||
2835 | } | |||
2836 | } | |||
2837 | ||||
2838 | // Build a factor node to remember all the Ops that have been created. | |||
2839 | SDValue NewChain; | |||
2840 | if (Chains.size() == 1) | |||
2841 | NewChain = Chains[0]; | |||
2842 | else | |||
2843 | NewChain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Chains); | |||
2844 | ReplaceValueWith(SDValue(N, 1), NewChain); | |||
2845 | ||||
2846 | return CollectOpsToWiden(DAG, TLI, ConcatOps, ConcatEnd, VT, MaxVT, WidenVT); | |||
2847 | } | |||
2848 | ||||
2849 | SDValue DAGTypeLegalizer::WidenVecRes_Convert(SDNode *N) { | |||
2850 | SDValue InOp = N->getOperand(0); | |||
2851 | SDLoc DL(N); | |||
2852 | ||||
2853 | EVT WidenVT = TLI.getTypeToTransformTo(*DAG.getContext(), N->getValueType(0)); | |||
2854 | unsigned WidenNumElts = WidenVT.getVectorNumElements(); | |||
2855 | ||||
2856 | EVT InVT = InOp.getValueType(); | |||
2857 | EVT InEltVT = InVT.getVectorElementType(); | |||
2858 | EVT InWidenVT = EVT::getVectorVT(*DAG.getContext(), InEltVT, WidenNumElts); | |||
2859 | ||||
2860 | unsigned Opcode = N->getOpcode(); | |||
2861 | unsigned InVTNumElts = InVT.getVectorNumElements(); | |||
2862 | const SDNodeFlags Flags = N->getFlags(); | |||
2863 | if (getTypeAction(InVT) == TargetLowering::TypeWidenVector) { | |||
2864 | InOp = GetWidenedVector(N->getOperand(0)); | |||
2865 | InVT = InOp.getValueType(); | |||
2866 | InVTNumElts = InVT.getVectorNumElements(); | |||
2867 | if (InVTNumElts == WidenNumElts) { | |||
2868 | if (N->getNumOperands() == 1) | |||
2869 | return DAG.getNode(Opcode, DL, WidenVT, InOp); | |||
2870 | return DAG.getNode(Opcode, DL, WidenVT, InOp, N->getOperand(1), Flags); | |||
2871 | } | |||
2872 | if (WidenVT.getSizeInBits() == InVT.getSizeInBits()) { | |||
2873 | // If both input and result vector types are of same width, extend | |||
2874 | // operations should be done with SIGN/ZERO_EXTEND_VECTOR_INREG, which | |||
2875 | // accepts fewer elements in the result than in the input. | |||
2876 | if (Opcode == ISD::ANY_EXTEND) | |||
2877 | return DAG.getNode(ISD::ANY_EXTEND_VECTOR_INREG, DL, WidenVT, InOp); | |||
2878 | if (Opcode == ISD::SIGN_EXTEND) | |||
2879 | return DAG.getNode(ISD::SIGN_EXTEND_VECTOR_INREG, DL, WidenVT, InOp); | |||
2880 | if (Opcode == ISD::ZERO_EXTEND) | |||
2881 | return DAG.getNode(ISD::ZERO_EXTEND_VECTOR_INREG, DL, WidenVT, InOp); | |||
2882 | } | |||
2883 | } | |||
2884 | ||||
2885 | if (TLI.isTypeLegal(InWidenVT)) { | |||
2886 | // Because the result and the input are different vector types, widening | |||
2887 | // the result could create a legal type but widening the input might make | |||
2888 | // it an illegal type that might lead to repeatedly splitting the input | |||
2889 | // and then widening it. To avoid this, we widen the input only if | |||
2890 | // it results in a legal type. | |||
2891 | if (WidenNumElts % InVTNumElts == 0) { | |||
2892 | // Widen the input and call convert on the widened input vector. | |||
2893 | unsigned NumConcat = WidenNumElts/InVTNumElts; | |||
2894 | SmallVector<SDValue, 16> Ops(NumConcat, DAG.getUNDEF(InVT)); | |||
2895 | Ops[0] = InOp; | |||
2896 | SDValue InVec = DAG.getNode(ISD::CONCAT_VECTORS, DL, InWidenVT, Ops); | |||
2897 | if (N->getNumOperands() == 1) | |||
2898 | return DAG.getNode(Opcode, DL, WidenVT, InVec); | |||
2899 | return DAG.getNode(Opcode, DL, WidenVT, InVec, N->getOperand(1), Flags); | |||
2900 | } | |||
2901 | ||||
2902 | if (InVTNumElts % WidenNumElts == 0) { | |||
2903 | SDValue InVal = DAG.getNode( | |||
2904 | ISD::EXTRACT_SUBVECTOR, DL, InWidenVT, InOp, | |||
2905 | DAG.getConstant(0, DL, TLI.getVectorIdxTy(DAG.getDataLayout()))); | |||
2906 | // Extract the input and convert the shorten input vector. | |||
2907 | if (N->getNumOperands() == 1) | |||
2908 | return DAG.getNode(Opcode, DL, WidenVT, InVal); | |||
2909 | return DAG.getNode(Opcode, DL, WidenVT, InVal, N->getOperand(1), Flags); | |||
2910 | } | |||
2911 | } | |||
2912 | ||||
2913 | // Otherwise unroll into some nasty scalar code and rebuild the vector. | |||
2914 | EVT EltVT = WidenVT.getVectorElementType(); | |||
2915 | SmallVector<SDValue, 16> Ops(WidenNumElts, DAG.getUNDEF(EltVT)); | |||
2916 | // Use the original element count so we don't do more scalar opts than | |||
2917 | // necessary. | |||
2918 | unsigned MinElts = N->getValueType(0).getVectorNumElements(); | |||
2919 | for (unsigned i=0; i < MinElts; ++i) { | |||
2920 | SDValue Val = DAG.getNode( | |||
2921 | ISD::EXTRACT_VECTOR_ELT, DL, InEltVT, InOp, | |||
2922 | DAG.getConstant(i, DL, TLI.getVectorIdxTy(DAG.getDataLayout()))); | |||
2923 | if (N->getNumOperands() == 1) | |||
2924 | Ops[i] = DAG.getNode(Opcode, DL, EltVT, Val); | |||
2925 | else | |||
2926 | Ops[i] = DAG.getNode(Opcode, DL, EltVT, Val, N->getOperand(1), Flags); | |||
2927 | } | |||
2928 | ||||
2929 | return DAG.getBuildVector(WidenVT, DL, Ops); | |||
2930 | } | |||
2931 | ||||
2932 | SDValue DAGTypeLegalizer::WidenVecRes_EXTEND_VECTOR_INREG(SDNode *N) { | |||
2933 | unsigned Opcode = N->getOpcode(); | |||
2934 | SDValue InOp = N->getOperand(0); | |||
2935 | SDLoc DL(N); | |||
2936 | ||||
2937 | EVT WidenVT = TLI.getTypeToTransformTo(*DAG.getContext(), N->getValueType(0)); | |||
2938 | EVT WidenSVT = WidenVT.getVectorElementType(); | |||
2939 | unsigned WidenNumElts = WidenVT.getVectorNumElements(); | |||
2940 | ||||
2941 | EVT InVT = InOp.getValueType(); | |||
2942 | EVT InSVT = InVT.getVectorElementType(); | |||
2943 | unsigned InVTNumElts = InVT.getVectorNumElements(); | |||
2944 | ||||
2945 | if (getTypeAction(InVT) == TargetLowering::TypeWidenVector) { | |||
2946 | InOp = GetWidenedVector(InOp); | |||
2947 | InVT = InOp.getValueType(); | |||
2948 | if (InVT.getSizeInBits() == WidenVT.getSizeInBits()) { | |||
2949 | switch (Opcode) { | |||
2950 | case ISD::ANY_EXTEND_VECTOR_INREG: | |||
2951 | case ISD::SIGN_EXTEND_VECTOR_INREG: | |||
2952 | case ISD::ZERO_EXTEND_VECTOR_INREG: | |||
2953 | return DAG.getNode(Opcode, DL, WidenVT, InOp); | |||
2954 | } | |||
2955 | } | |||
2956 | } | |||
2957 | ||||
2958 | // Unroll, extend the scalars and rebuild the vector. | |||
2959 | SmallVector<SDValue, 16> Ops; | |||
2960 | for (unsigned i = 0, e = std::min(InVTNumElts, WidenNumElts); i != e; ++i) { | |||
2961 | SDValue Val = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, DL, InSVT, InOp, | |||
2962 | DAG.getConstant(i, DL, TLI.getVectorIdxTy(DAG.getDataLayout()))); | |||
2963 | switch (Opcode) { | |||
2964 | case ISD::ANY_EXTEND_VECTOR_INREG: | |||
2965 | Val = DAG.getNode(ISD::ANY_EXTEND, DL, WidenSVT, Val); | |||
2966 | break; | |||
2967 | case ISD::SIGN_EXTEND_VECTOR_INREG: | |||
2968 | Val = DAG.getNode(ISD::SIGN_EXTEND, DL, WidenSVT, Val); | |||
2969 | break; | |||
2970 | case ISD::ZERO_EXTEND_VECTOR_INREG: | |||
2971 | Val = DAG.getNode(ISD::ZERO_EXTEND, DL, WidenSVT, Val); | |||
2972 | break; | |||
2973 | default: | |||
2974 | llvm_unreachable("A *_EXTEND_VECTOR_INREG node was expected")::llvm::llvm_unreachable_internal("A *_EXTEND_VECTOR_INREG node was expected" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 2974); | |||
2975 | } | |||
2976 | Ops.push_back(Val); | |||
2977 | } | |||
2978 | ||||
2979 | while (Ops.size() != WidenNumElts) | |||
2980 | Ops.push_back(DAG.getUNDEF(WidenSVT)); | |||
2981 | ||||
2982 | return DAG.getBuildVector(WidenVT, DL, Ops); | |||
2983 | } | |||
2984 | ||||
2985 | SDValue DAGTypeLegalizer::WidenVecRes_FCOPYSIGN(SDNode *N) { | |||
2986 | // If this is an FCOPYSIGN with same input types, we can treat it as a | |||
2987 | // normal (can trap) binary op. | |||
2988 | if (N->getOperand(0).getValueType() == N->getOperand(1).getValueType()) | |||
2989 | return WidenVecRes_BinaryCanTrap(N); | |||
2990 | ||||
2991 | // If the types are different, fall back to unrolling. | |||
2992 | EVT WidenVT = TLI.getTypeToTransformTo(*DAG.getContext(), N->getValueType(0)); | |||
2993 | return DAG.UnrollVectorOp(N, WidenVT.getVectorNumElements()); | |||
2994 | } | |||
2995 | ||||
2996 | SDValue DAGTypeLegalizer::WidenVecRes_POWI(SDNode *N) { | |||
2997 | EVT WidenVT = TLI.getTypeToTransformTo(*DAG.getContext(), N->getValueType(0)); | |||
2998 | SDValue InOp = GetWidenedVector(N->getOperand(0)); | |||
2999 | SDValue ShOp = N->getOperand(1); | |||
3000 | return DAG.getNode(N->getOpcode(), SDLoc(N), WidenVT, InOp, ShOp); | |||
3001 | } | |||
3002 | ||||
3003 | SDValue DAGTypeLegalizer::WidenVecRes_Shift(SDNode *N) { | |||
3004 | EVT WidenVT = TLI.getTypeToTransformTo(*DAG.getContext(), N->getValueType(0)); | |||
3005 | SDValue InOp = GetWidenedVector(N->getOperand(0)); | |||
3006 | SDValue ShOp = N->getOperand(1); | |||
3007 | ||||
3008 | EVT ShVT = ShOp.getValueType(); | |||
3009 | if (getTypeAction(ShVT) == TargetLowering::TypeWidenVector) { | |||
3010 | ShOp = GetWidenedVector(ShOp); | |||
3011 | ShVT = ShOp.getValueType(); | |||
3012 | } | |||
3013 | EVT ShWidenVT = EVT::getVectorVT(*DAG.getContext(), | |||
3014 | ShVT.getVectorElementType(), | |||
3015 | WidenVT.getVectorNumElements()); | |||
3016 | if (ShVT != ShWidenVT) | |||
3017 | ShOp = ModifyToType(ShOp, ShWidenVT); | |||
3018 | ||||
3019 | return DAG.getNode(N->getOpcode(), SDLoc(N), WidenVT, InOp, ShOp); | |||
3020 | } | |||
3021 | ||||
3022 | SDValue DAGTypeLegalizer::WidenVecRes_Unary(SDNode *N) { | |||
3023 | // Unary op widening. | |||
3024 | EVT WidenVT = TLI.getTypeToTransformTo(*DAG.getContext(), N->getValueType(0)); | |||
3025 | SDValue InOp = GetWidenedVector(N->getOperand(0)); | |||
3026 | return DAG.getNode(N->getOpcode(), SDLoc(N), WidenVT, InOp); | |||
3027 | } | |||
3028 | ||||
3029 | SDValue DAGTypeLegalizer::WidenVecRes_InregOp(SDNode *N) { | |||
3030 | EVT WidenVT = TLI.getTypeToTransformTo(*DAG.getContext(), N->getValueType(0)); | |||
3031 | EVT ExtVT = EVT::getVectorVT(*DAG.getContext(), | |||
3032 | cast<VTSDNode>(N->getOperand(1))->getVT() | |||
3033 | .getVectorElementType(), | |||
3034 | WidenVT.getVectorNumElements()); | |||
3035 | SDValue WidenLHS = GetWidenedVector(N->getOperand(0)); | |||
3036 | return DAG.getNode(N->getOpcode(), SDLoc(N), | |||
3037 | WidenVT, WidenLHS, DAG.getValueType(ExtVT)); | |||
3038 | } | |||
3039 | ||||
3040 | SDValue DAGTypeLegalizer::WidenVecRes_MERGE_VALUES(SDNode *N, unsigned ResNo) { | |||
3041 | SDValue WidenVec = DisintegrateMERGE_VALUES(N, ResNo); | |||
3042 | return GetWidenedVector(WidenVec); | |||
3043 | } | |||
3044 | ||||
3045 | SDValue DAGTypeLegalizer::WidenVecRes_BITCAST(SDNode *N) { | |||
3046 | SDValue InOp = N->getOperand(0); | |||
3047 | EVT InVT = InOp.getValueType(); | |||
3048 | EVT VT = N->getValueType(0); | |||
3049 | EVT WidenVT = TLI.getTypeToTransformTo(*DAG.getContext(), VT); | |||
3050 | SDLoc dl(N); | |||
3051 | ||||
3052 | switch (getTypeAction(InVT)) { | |||
3053 | case TargetLowering::TypeLegal: | |||
3054 | break; | |||
3055 | case TargetLowering::TypePromoteInteger: | |||
3056 | // If the incoming type is a vector that is being promoted, then | |||
3057 | // we know that the elements are arranged differently and that we | |||
3058 | // must perform the conversion using a stack slot. | |||
3059 | if (InVT.isVector()) | |||
3060 | break; | |||
3061 | ||||
3062 | // If the InOp is promoted to the same size, convert it. Otherwise, | |||
3063 | // fall out of the switch and widen the promoted input. | |||
3064 | InOp = GetPromotedInteger(InOp); | |||
3065 | InVT = InOp.getValueType(); | |||
3066 | if (WidenVT.bitsEq(InVT)) | |||
3067 | return DAG.getNode(ISD::BITCAST, dl, WidenVT, InOp); | |||
3068 | break; | |||
3069 | case TargetLowering::TypeSoftenFloat: | |||
3070 | case TargetLowering::TypePromoteFloat: | |||
3071 | case TargetLowering::TypeExpandInteger: | |||
3072 | case TargetLowering::TypeExpandFloat: | |||
3073 | case TargetLowering::TypeScalarizeVector: | |||
3074 | case TargetLowering::TypeSplitVector: | |||
3075 | break; | |||
3076 | case TargetLowering::TypeWidenVector: | |||
3077 | // If the InOp is widened to the same size, convert it. Otherwise, fall | |||
3078 | // out of the switch and widen the widened input. | |||
3079 | InOp = GetWidenedVector(InOp); | |||
3080 | InVT = InOp.getValueType(); | |||
3081 | if (WidenVT.bitsEq(InVT)) | |||
3082 | // The input widens to the same size. Convert to the widen value. | |||
3083 | return DAG.getNode(ISD::BITCAST, dl, WidenVT, InOp); | |||
3084 | break; | |||
3085 | } | |||
3086 | ||||
3087 | unsigned WidenSize = WidenVT.getSizeInBits(); | |||
3088 | unsigned InSize = InVT.getSizeInBits(); | |||
3089 | // x86mmx is not an acceptable vector element type, so don't try. | |||
3090 | if (WidenSize % InSize == 0 && InVT != MVT::x86mmx) { | |||
3091 | // Determine new input vector type. The new input vector type will use | |||
3092 | // the same element type (if its a vector) or use the input type as a | |||
3093 | // vector. It is the same size as the type to widen to. | |||
3094 | EVT NewInVT; | |||
3095 | unsigned NewNumElts = WidenSize / InSize; | |||
3096 | if (InVT.isVector()) { | |||
3097 | EVT InEltVT = InVT.getVectorElementType(); | |||
3098 | NewInVT = EVT::getVectorVT(*DAG.getContext(), InEltVT, | |||
3099 | WidenSize / InEltVT.getSizeInBits()); | |||
3100 | } else { | |||
3101 | NewInVT = EVT::getVectorVT(*DAG.getContext(), InVT, NewNumElts); | |||
3102 | } | |||
3103 | ||||
3104 | if (TLI.isTypeLegal(NewInVT)) { | |||
3105 | SDValue NewVec; | |||
3106 | if (InVT.isVector()) { | |||
3107 | // Because the result and the input are different vector types, widening | |||
3108 | // the result could create a legal type but widening the input might make | |||
3109 | // it an illegal type that might lead to repeatedly splitting the input | |||
3110 | // and then widening it. To avoid this, we widen the input only if | |||
3111 | // it results in a legal type. | |||
3112 | SmallVector<SDValue, 16> Ops(NewNumElts, DAG.getUNDEF(InVT)); | |||
3113 | Ops[0] = InOp; | |||
3114 | ||||
3115 | NewVec = DAG.getNode(ISD::CONCAT_VECTORS, dl, NewInVT, Ops); | |||
3116 | } else { | |||
3117 | NewVec = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, NewInVT, InOp); | |||
3118 | } | |||
3119 | return DAG.getNode(ISD::BITCAST, dl, WidenVT, NewVec); | |||
3120 | } | |||
3121 | } | |||
3122 | ||||
3123 | return CreateStackStoreLoad(InOp, WidenVT); | |||
3124 | } | |||
3125 | ||||
3126 | SDValue DAGTypeLegalizer::WidenVecRes_BUILD_VECTOR(SDNode *N) { | |||
3127 | SDLoc dl(N); | |||
3128 | // Build a vector with undefined for the new nodes. | |||
3129 | EVT VT = N->getValueType(0); | |||
3130 | ||||
3131 | // Integer BUILD_VECTOR operands may be larger than the node's vector element | |||
3132 | // type. The UNDEFs need to have the same type as the existing operands. | |||
3133 | EVT EltVT = N->getOperand(0).getValueType(); | |||
3134 | unsigned NumElts = VT.getVectorNumElements(); | |||
3135 | ||||
3136 | EVT WidenVT = TLI.getTypeToTransformTo(*DAG.getContext(), VT); | |||
3137 | unsigned WidenNumElts = WidenVT.getVectorNumElements(); | |||
3138 | ||||
3139 | SmallVector<SDValue, 16> NewOps(N->op_begin(), N->op_end()); | |||
3140 | assert(WidenNumElts >= NumElts && "Shrinking vector instead of widening!")((WidenNumElts >= NumElts && "Shrinking vector instead of widening!" ) ? static_cast<void> (0) : __assert_fail ("WidenNumElts >= NumElts && \"Shrinking vector instead of widening!\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 3140, __PRETTY_FUNCTION__)); | |||
3141 | NewOps.append(WidenNumElts - NumElts, DAG.getUNDEF(EltVT)); | |||
3142 | ||||
3143 | return DAG.getBuildVector(WidenVT, dl, NewOps); | |||
3144 | } | |||
3145 | ||||
3146 | SDValue DAGTypeLegalizer::WidenVecRes_CONCAT_VECTORS(SDNode *N) { | |||
3147 | EVT InVT = N->getOperand(0).getValueType(); | |||
3148 | EVT WidenVT = TLI.getTypeToTransformTo(*DAG.getContext(), N->getValueType(0)); | |||
3149 | SDLoc dl(N); | |||
3150 | unsigned WidenNumElts = WidenVT.getVectorNumElements(); | |||
3151 | unsigned NumInElts = InVT.getVectorNumElements(); | |||
3152 | unsigned NumOperands = N->getNumOperands(); | |||
3153 | ||||
3154 | bool InputWidened = false; // Indicates we need to widen the input. | |||
3155 | if (getTypeAction(InVT) != TargetLowering::TypeWidenVector) { | |||
3156 | if (WidenVT.getVectorNumElements() % InVT.getVectorNumElements() == 0) { | |||
3157 | // Add undef vectors to widen to correct length. | |||
3158 | unsigned NumConcat = WidenVT.getVectorNumElements() / | |||
3159 | InVT.getVectorNumElements(); | |||
3160 | SDValue UndefVal = DAG.getUNDEF(InVT); | |||
3161 | SmallVector<SDValue, 16> Ops(NumConcat); | |||
3162 | for (unsigned i=0; i < NumOperands; ++i) | |||
3163 | Ops[i] = N->getOperand(i); | |||
3164 | for (unsigned i = NumOperands; i != NumConcat; ++i) | |||
3165 | Ops[i] = UndefVal; | |||
3166 | return DAG.getNode(ISD::CONCAT_VECTORS, dl, WidenVT, Ops); | |||
3167 | } | |||
3168 | } else { | |||
3169 | InputWidened = true; | |||
3170 | if (WidenVT == TLI.getTypeToTransformTo(*DAG.getContext(), InVT)) { | |||
3171 | // The inputs and the result are widen to the same value. | |||
3172 | unsigned i; | |||
3173 | for (i=1; i < NumOperands; ++i) | |||
3174 | if (!N->getOperand(i).isUndef()) | |||
3175 | break; | |||
3176 | ||||
3177 | if (i == NumOperands) | |||
3178 | // Everything but the first operand is an UNDEF so just return the | |||
3179 | // widened first operand. | |||
3180 | return GetWidenedVector(N->getOperand(0)); | |||
3181 | ||||
3182 | if (NumOperands == 2) { | |||
3183 | // Replace concat of two operands with a shuffle. | |||
3184 | SmallVector<int, 16> MaskOps(WidenNumElts, -1); | |||
3185 | for (unsigned i = 0; i < NumInElts; ++i) { | |||
3186 | MaskOps[i] = i; | |||
3187 | MaskOps[i + NumInElts] = i + WidenNumElts; | |||
3188 | } | |||
3189 | return DAG.getVectorShuffle(WidenVT, dl, | |||
3190 | GetWidenedVector(N->getOperand(0)), | |||
3191 | GetWidenedVector(N->getOperand(1)), | |||
3192 | MaskOps); | |||
3193 | } | |||
3194 | } | |||
3195 | } | |||
3196 | ||||
3197 | // Fall back to use extracts and build vector. | |||
3198 | EVT EltVT = WidenVT.getVectorElementType(); | |||
3199 | SmallVector<SDValue, 16> Ops(WidenNumElts); | |||
3200 | unsigned Idx = 0; | |||
3201 | for (unsigned i=0; i < NumOperands; ++i) { | |||
3202 | SDValue InOp = N->getOperand(i); | |||
3203 | if (InputWidened) | |||
3204 | InOp = GetWidenedVector(InOp); | |||
3205 | for (unsigned j=0; j < NumInElts; ++j) | |||
3206 | Ops[Idx++] = DAG.getNode( | |||
3207 | ISD::EXTRACT_VECTOR_ELT, dl, EltVT, InOp, | |||
3208 | DAG.getConstant(j, dl, TLI.getVectorIdxTy(DAG.getDataLayout()))); | |||
3209 | } | |||
3210 | SDValue UndefVal = DAG.getUNDEF(EltVT); | |||
3211 | for (; Idx < WidenNumElts; ++Idx) | |||
3212 | Ops[Idx] = UndefVal; | |||
3213 | return DAG.getBuildVector(WidenVT, dl, Ops); | |||
3214 | } | |||
3215 | ||||
3216 | SDValue DAGTypeLegalizer::WidenVecRes_EXTRACT_SUBVECTOR(SDNode *N) { | |||
3217 | EVT VT = N->getValueType(0); | |||
3218 | EVT WidenVT = TLI.getTypeToTransformTo(*DAG.getContext(), VT); | |||
3219 | unsigned WidenNumElts = WidenVT.getVectorNumElements(); | |||
3220 | SDValue InOp = N->getOperand(0); | |||
3221 | SDValue Idx = N->getOperand(1); | |||
3222 | SDLoc dl(N); | |||
3223 | ||||
3224 | if (getTypeAction(InOp.getValueType()) == TargetLowering::TypeWidenVector) | |||
3225 | InOp = GetWidenedVector(InOp); | |||
3226 | ||||
3227 | EVT InVT = InOp.getValueType(); | |||
3228 | ||||
3229 | // Check if we can just return the input vector after widening. | |||
3230 | uint64_t IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue(); | |||
3231 | if (IdxVal == 0 && InVT == WidenVT) | |||
3232 | return InOp; | |||
3233 | ||||
3234 | // Check if we can extract from the vector. | |||
3235 | unsigned InNumElts = InVT.getVectorNumElements(); | |||
3236 | if (IdxVal % WidenNumElts == 0 && IdxVal + WidenNumElts < InNumElts) | |||
3237 | return DAG.getNode(ISD::EXTRACT_SUBVECTOR, dl, WidenVT, InOp, Idx); | |||
3238 | ||||
3239 | // We could try widening the input to the right length but for now, extract | |||
3240 | // the original elements, fill the rest with undefs and build a vector. | |||
3241 | SmallVector<SDValue, 16> Ops(WidenNumElts); | |||
3242 | EVT EltVT = VT.getVectorElementType(); | |||
3243 | unsigned NumElts = VT.getVectorNumElements(); | |||
3244 | unsigned i; | |||
3245 | for (i=0; i < NumElts; ++i) | |||
3246 | Ops[i] = | |||
3247 | DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, EltVT, InOp, | |||
3248 | DAG.getConstant(IdxVal + i, dl, | |||
3249 | TLI.getVectorIdxTy(DAG.getDataLayout()))); | |||
3250 | ||||
3251 | SDValue UndefVal = DAG.getUNDEF(EltVT); | |||
3252 | for (; i < WidenNumElts; ++i) | |||
3253 | Ops[i] = UndefVal; | |||
3254 | return DAG.getBuildVector(WidenVT, dl, Ops); | |||
3255 | } | |||
3256 | ||||
3257 | SDValue DAGTypeLegalizer::WidenVecRes_INSERT_VECTOR_ELT(SDNode *N) { | |||
3258 | SDValue InOp = GetWidenedVector(N->getOperand(0)); | |||
3259 | return DAG.getNode(ISD::INSERT_VECTOR_ELT, SDLoc(N), | |||
3260 | InOp.getValueType(), InOp, | |||
3261 | N->getOperand(1), N->getOperand(2)); | |||
3262 | } | |||
3263 | ||||
3264 | SDValue DAGTypeLegalizer::WidenVecRes_LOAD(SDNode *N) { | |||
3265 | LoadSDNode *LD = cast<LoadSDNode>(N); | |||
3266 | ISD::LoadExtType ExtType = LD->getExtensionType(); | |||
3267 | ||||
3268 | SDValue Result; | |||
3269 | SmallVector<SDValue, 16> LdChain; // Chain for the series of load | |||
3270 | if (ExtType != ISD::NON_EXTLOAD) | |||
3271 | Result = GenWidenVectorExtLoads(LdChain, LD, ExtType); | |||
3272 | else | |||
3273 | Result = GenWidenVectorLoads(LdChain, LD); | |||
3274 | ||||
3275 | // If we generate a single load, we can use that for the chain. Otherwise, | |||
3276 | // build a factor node to remember the multiple loads are independent and | |||
3277 | // chain to that. | |||
3278 | SDValue NewChain; | |||
3279 | if (LdChain.size() == 1) | |||
3280 | NewChain = LdChain[0]; | |||
3281 | else | |||
3282 | NewChain = DAG.getNode(ISD::TokenFactor, SDLoc(LD), MVT::Other, LdChain); | |||
3283 | ||||
3284 | // Modified the chain - switch anything that used the old chain to use | |||
3285 | // the new one. | |||
3286 | ReplaceValueWith(SDValue(N, 1), NewChain); | |||
3287 | ||||
3288 | return Result; | |||
3289 | } | |||
3290 | ||||
3291 | SDValue DAGTypeLegalizer::WidenVecRes_MLOAD(MaskedLoadSDNode *N) { | |||
3292 | ||||
3293 | EVT WidenVT = TLI.getTypeToTransformTo(*DAG.getContext(),N->getValueType(0)); | |||
3294 | SDValue Mask = N->getMask(); | |||
3295 | EVT MaskVT = Mask.getValueType(); | |||
3296 | SDValue PassThru = GetWidenedVector(N->getPassThru()); | |||
3297 | ISD::LoadExtType ExtType = N->getExtensionType(); | |||
3298 | SDLoc dl(N); | |||
3299 | ||||
3300 | // The mask should be widened as well | |||
3301 | EVT WideMaskVT = EVT::getVectorVT(*DAG.getContext(), | |||
3302 | MaskVT.getVectorElementType(), | |||
3303 | WidenVT.getVectorNumElements()); | |||
3304 | Mask = ModifyToType(Mask, WideMaskVT, true); | |||
3305 | ||||
3306 | SDValue Res = DAG.getMaskedLoad(WidenVT, dl, N->getChain(), N->getBasePtr(), | |||
3307 | Mask, PassThru, N->getMemoryVT(), | |||
3308 | N->getMemOperand(), ExtType, | |||
3309 | N->isExpandingLoad()); | |||
3310 | // Legalize the chain result - switch anything that used the old chain to | |||
3311 | // use the new one. | |||
3312 | ReplaceValueWith(SDValue(N, 1), Res.getValue(1)); | |||
3313 | return Res; | |||
3314 | } | |||
3315 | ||||
3316 | SDValue DAGTypeLegalizer::WidenVecRes_MGATHER(MaskedGatherSDNode *N) { | |||
3317 | ||||
3318 | EVT WideVT = TLI.getTypeToTransformTo(*DAG.getContext(), N->getValueType(0)); | |||
3319 | SDValue Mask = N->getMask(); | |||
3320 | EVT MaskVT = Mask.getValueType(); | |||
3321 | SDValue PassThru = GetWidenedVector(N->getPassThru()); | |||
3322 | SDValue Scale = N->getScale(); | |||
3323 | unsigned NumElts = WideVT.getVectorNumElements(); | |||
3324 | SDLoc dl(N); | |||
3325 | ||||
3326 | // The mask should be widened as well | |||
3327 | EVT WideMaskVT = EVT::getVectorVT(*DAG.getContext(), | |||
3328 | MaskVT.getVectorElementType(), | |||
3329 | WideVT.getVectorNumElements()); | |||
3330 | Mask = ModifyToType(Mask, WideMaskVT, true); | |||
3331 | ||||
3332 | // Widen the Index operand | |||
3333 | SDValue Index = N->getIndex(); | |||
3334 | EVT WideIndexVT = EVT::getVectorVT(*DAG.getContext(), | |||
3335 | Index.getValueType().getScalarType(), | |||
3336 | NumElts); | |||
3337 | Index = ModifyToType(Index, WideIndexVT); | |||
3338 | SDValue Ops[] = { N->getChain(), PassThru, Mask, N->getBasePtr(), Index, | |||
3339 | Scale }; | |||
3340 | SDValue Res = DAG.getMaskedGather(DAG.getVTList(WideVT, MVT::Other), | |||
3341 | N->getMemoryVT(), dl, Ops, | |||
3342 | N->getMemOperand()); | |||
3343 | ||||
3344 | // Legalize the chain result - switch anything that used the old chain to | |||
3345 | // use the new one. | |||
3346 | ReplaceValueWith(SDValue(N, 1), Res.getValue(1)); | |||
3347 | return Res; | |||
3348 | } | |||
3349 | ||||
3350 | SDValue DAGTypeLegalizer::WidenVecRes_SCALAR_TO_VECTOR(SDNode *N) { | |||
3351 | EVT WidenVT = TLI.getTypeToTransformTo(*DAG.getContext(), N->getValueType(0)); | |||
3352 | return DAG.getNode(ISD::SCALAR_TO_VECTOR, SDLoc(N), | |||
3353 | WidenVT, N->getOperand(0)); | |||
3354 | } | |||
3355 | ||||
3356 | // Return true if this is a node that could have two SETCCs as operands. | |||
3357 | static inline bool isLogicalMaskOp(unsigned Opcode) { | |||
3358 | switch (Opcode) { | |||
3359 | case ISD::AND: | |||
3360 | case ISD::OR: | |||
3361 | case ISD::XOR: | |||
3362 | return true; | |||
3363 | } | |||
3364 | return false; | |||
3365 | } | |||
3366 | ||||
3367 | // This is used just for the assert in convertMask(). Check that this either | |||
3368 | // a SETCC or a previously handled SETCC by convertMask(). | |||
3369 | #ifndef NDEBUG | |||
3370 | static inline bool isSETCCorConvertedSETCC(SDValue N) { | |||
3371 | if (N.getOpcode() == ISD::EXTRACT_SUBVECTOR) | |||
3372 | N = N.getOperand(0); | |||
3373 | else if (N.getOpcode() == ISD::CONCAT_VECTORS) { | |||
3374 | for (unsigned i = 1; i < N->getNumOperands(); ++i) | |||
3375 | if (!N->getOperand(i)->isUndef()) | |||
3376 | return false; | |||
3377 | N = N.getOperand(0); | |||
3378 | } | |||
3379 | ||||
3380 | if (N.getOpcode() == ISD::TRUNCATE) | |||
3381 | N = N.getOperand(0); | |||
3382 | else if (N.getOpcode() == ISD::SIGN_EXTEND) | |||
3383 | N = N.getOperand(0); | |||
3384 | ||||
3385 | if (isLogicalMaskOp(N.getOpcode())) | |||
3386 | return isSETCCorConvertedSETCC(N.getOperand(0)) && | |||
3387 | isSETCCorConvertedSETCC(N.getOperand(1)); | |||
3388 | ||||
3389 | return (N.getOpcode() == ISD::SETCC || | |||
3390 | ISD::isBuildVectorOfConstantSDNodes(N.getNode())); | |||
3391 | } | |||
3392 | #endif | |||
3393 | ||||
3394 | // Return a mask of vector type MaskVT to replace InMask. Also adjust MaskVT | |||
3395 | // to ToMaskVT if needed with vector extension or truncation. | |||
3396 | SDValue DAGTypeLegalizer::convertMask(SDValue InMask, EVT MaskVT, | |||
3397 | EVT ToMaskVT) { | |||
3398 | // Currently a SETCC or a AND/OR/XOR with two SETCCs are handled. | |||
3399 | // FIXME: This code seems to be too restrictive, we might consider | |||
3400 | // generalizing it or dropping it. | |||
3401 | assert(isSETCCorConvertedSETCC(InMask) && "Unexpected mask argument.")((isSETCCorConvertedSETCC(InMask) && "Unexpected mask argument." ) ? static_cast<void> (0) : __assert_fail ("isSETCCorConvertedSETCC(InMask) && \"Unexpected mask argument.\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 3401, __PRETTY_FUNCTION__)); | |||
3402 | ||||
3403 | // Make a new Mask node, with a legal result VT. | |||
3404 | SmallVector<SDValue, 4> Ops; | |||
3405 | for (unsigned i = 0, e = InMask->getNumOperands(); i < e; ++i) | |||
3406 | Ops.push_back(InMask->getOperand(i)); | |||
3407 | SDValue Mask = DAG.getNode(InMask->getOpcode(), SDLoc(InMask), MaskVT, Ops); | |||
3408 | ||||
3409 | // If MaskVT has smaller or bigger elements than ToMaskVT, a vector sign | |||
3410 | // extend or truncate is needed. | |||
3411 | LLVMContext &Ctx = *DAG.getContext(); | |||
3412 | unsigned MaskScalarBits = MaskVT.getScalarSizeInBits(); | |||
3413 | unsigned ToMaskScalBits = ToMaskVT.getScalarSizeInBits(); | |||
3414 | if (MaskScalarBits < ToMaskScalBits) { | |||
3415 | EVT ExtVT = EVT::getVectorVT(Ctx, ToMaskVT.getVectorElementType(), | |||
3416 | MaskVT.getVectorNumElements()); | |||
3417 | Mask = DAG.getNode(ISD::SIGN_EXTEND, SDLoc(Mask), ExtVT, Mask); | |||
3418 | } else if (MaskScalarBits > ToMaskScalBits) { | |||
3419 | EVT TruncVT = EVT::getVectorVT(Ctx, ToMaskVT.getVectorElementType(), | |||
3420 | MaskVT.getVectorNumElements()); | |||
3421 | Mask = DAG.getNode(ISD::TRUNCATE, SDLoc(Mask), TruncVT, Mask); | |||
3422 | } | |||
3423 | ||||
3424 | assert(Mask->getValueType(0).getScalarSizeInBits() ==((Mask->getValueType(0).getScalarSizeInBits() == ToMaskVT. getScalarSizeInBits() && "Mask should have the right element size by now." ) ? static_cast<void> (0) : __assert_fail ("Mask->getValueType(0).getScalarSizeInBits() == ToMaskVT.getScalarSizeInBits() && \"Mask should have the right element size by now.\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 3426, __PRETTY_FUNCTION__)) | |||
3425 | ToMaskVT.getScalarSizeInBits() &&((Mask->getValueType(0).getScalarSizeInBits() == ToMaskVT. getScalarSizeInBits() && "Mask should have the right element size by now." ) ? static_cast<void> (0) : __assert_fail ("Mask->getValueType(0).getScalarSizeInBits() == ToMaskVT.getScalarSizeInBits() && \"Mask should have the right element size by now.\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 3426, __PRETTY_FUNCTION__)) | |||
3426 | "Mask should have the right element size by now.")((Mask->getValueType(0).getScalarSizeInBits() == ToMaskVT. getScalarSizeInBits() && "Mask should have the right element size by now." ) ? static_cast<void> (0) : __assert_fail ("Mask->getValueType(0).getScalarSizeInBits() == ToMaskVT.getScalarSizeInBits() && \"Mask should have the right element size by now.\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 3426, __PRETTY_FUNCTION__)); | |||
3427 | ||||
3428 | // Adjust Mask to the right number of elements. | |||
3429 | unsigned CurrMaskNumEls = Mask->getValueType(0).getVectorNumElements(); | |||
3430 | if (CurrMaskNumEls > ToMaskVT.getVectorNumElements()) { | |||
3431 | MVT IdxTy = TLI.getVectorIdxTy(DAG.getDataLayout()); | |||
3432 | SDValue ZeroIdx = DAG.getConstant(0, SDLoc(Mask), IdxTy); | |||
3433 | Mask = DAG.getNode(ISD::EXTRACT_SUBVECTOR, SDLoc(Mask), ToMaskVT, Mask, | |||
3434 | ZeroIdx); | |||
3435 | } else if (CurrMaskNumEls < ToMaskVT.getVectorNumElements()) { | |||
3436 | unsigned NumSubVecs = (ToMaskVT.getVectorNumElements() / CurrMaskNumEls); | |||
3437 | EVT SubVT = Mask->getValueType(0); | |||
3438 | SmallVector<SDValue, 16> SubOps(NumSubVecs, DAG.getUNDEF(SubVT)); | |||
3439 | SubOps[0] = Mask; | |||
3440 | Mask = DAG.getNode(ISD::CONCAT_VECTORS, SDLoc(Mask), ToMaskVT, SubOps); | |||
3441 | } | |||
3442 | ||||
3443 | assert((Mask->getValueType(0) == ToMaskVT) &&(((Mask->getValueType(0) == ToMaskVT) && "A mask of ToMaskVT should have been produced by now." ) ? static_cast<void> (0) : __assert_fail ("(Mask->getValueType(0) == ToMaskVT) && \"A mask of ToMaskVT should have been produced by now.\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 3444, __PRETTY_FUNCTION__)) | |||
3444 | "A mask of ToMaskVT should have been produced by now.")(((Mask->getValueType(0) == ToMaskVT) && "A mask of ToMaskVT should have been produced by now." ) ? static_cast<void> (0) : __assert_fail ("(Mask->getValueType(0) == ToMaskVT) && \"A mask of ToMaskVT should have been produced by now.\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 3444, __PRETTY_FUNCTION__)); | |||
3445 | ||||
3446 | return Mask; | |||
3447 | } | |||
3448 | ||||
3449 | // This method tries to handle VSELECT and its mask by legalizing operands | |||
3450 | // (which may require widening) and if needed adjusting the mask vector type | |||
3451 | // to match that of the VSELECT. Without it, many cases end up with | |||
3452 | // scalarization of the SETCC, with many unnecessary instructions. | |||
3453 | SDValue DAGTypeLegalizer::WidenVSELECTAndMask(SDNode *N) { | |||
3454 | LLVMContext &Ctx = *DAG.getContext(); | |||
3455 | SDValue Cond = N->getOperand(0); | |||
3456 | ||||
3457 | if (N->getOpcode() != ISD::VSELECT) | |||
3458 | return SDValue(); | |||
3459 | ||||
3460 | if (Cond->getOpcode() != ISD::SETCC && !isLogicalMaskOp(Cond->getOpcode())) | |||
3461 | return SDValue(); | |||
3462 | ||||
3463 | // If this is a splitted VSELECT that was previously already handled, do | |||
3464 | // nothing. | |||
3465 | EVT CondVT = Cond->getValueType(0); | |||
3466 | if (CondVT.getScalarSizeInBits() != 1) | |||
3467 | return SDValue(); | |||
3468 | ||||
3469 | EVT VSelVT = N->getValueType(0); | |||
3470 | // Only handle vector types which are a power of 2. | |||
3471 | if (!isPowerOf2_64(VSelVT.getSizeInBits())) | |||
3472 | return SDValue(); | |||
3473 | ||||
3474 | // Don't touch if this will be scalarized. | |||
3475 | EVT FinalVT = VSelVT; | |||
3476 | while (getTypeAction(FinalVT) == TargetLowering::TypeSplitVector) | |||
3477 | FinalVT = FinalVT.getHalfNumVectorElementsVT(Ctx); | |||
3478 | ||||
3479 | if (FinalVT.getVectorNumElements() == 1) | |||
3480 | return SDValue(); | |||
3481 | ||||
3482 | // If there is support for an i1 vector mask, don't touch. | |||
3483 | if (Cond.getOpcode() == ISD::SETCC) { | |||
3484 | EVT SetCCOpVT = Cond->getOperand(0).getValueType(); | |||
3485 | while (TLI.getTypeAction(Ctx, SetCCOpVT) != TargetLowering::TypeLegal) | |||
3486 | SetCCOpVT = TLI.getTypeToTransformTo(Ctx, SetCCOpVT); | |||
3487 | EVT SetCCResVT = getSetCCResultType(SetCCOpVT); | |||
3488 | if (SetCCResVT.getScalarSizeInBits() == 1) | |||
3489 | return SDValue(); | |||
3490 | } else if (CondVT.getScalarType() == MVT::i1) { | |||
3491 | // If there is support for an i1 vector mask (or only scalar i1 conditions), | |||
3492 | // don't touch. | |||
3493 | while (TLI.getTypeAction(Ctx, CondVT) != TargetLowering::TypeLegal) | |||
3494 | CondVT = TLI.getTypeToTransformTo(Ctx, CondVT); | |||
3495 | ||||
3496 | if (CondVT.getScalarType() == MVT::i1) | |||
3497 | return SDValue(); | |||
3498 | } | |||
3499 | ||||
3500 | // Get the VT and operands for VSELECT, and widen if needed. | |||
3501 | SDValue VSelOp1 = N->getOperand(1); | |||
3502 | SDValue VSelOp2 = N->getOperand(2); | |||
3503 | if (getTypeAction(VSelVT) == TargetLowering::TypeWidenVector) { | |||
3504 | VSelVT = TLI.getTypeToTransformTo(Ctx, VSelVT); | |||
3505 | VSelOp1 = GetWidenedVector(VSelOp1); | |||
3506 | VSelOp2 = GetWidenedVector(VSelOp2); | |||
3507 | } | |||
3508 | ||||
3509 | // The mask of the VSELECT should have integer elements. | |||
3510 | EVT ToMaskVT = VSelVT; | |||
3511 | if (!ToMaskVT.getScalarType().isInteger()) | |||
3512 | ToMaskVT = ToMaskVT.changeVectorElementTypeToInteger(); | |||
3513 | ||||
3514 | SDValue Mask; | |||
3515 | if (Cond->getOpcode() == ISD::SETCC) { | |||
3516 | EVT MaskVT = getSetCCResultType(Cond.getOperand(0).getValueType()); | |||
3517 | Mask = convertMask(Cond, MaskVT, ToMaskVT); | |||
3518 | } else if (isLogicalMaskOp(Cond->getOpcode()) && | |||
3519 | Cond->getOperand(0).getOpcode() == ISD::SETCC && | |||
3520 | Cond->getOperand(1).getOpcode() == ISD::SETCC) { | |||
3521 | // Cond is (AND/OR/XOR (SETCC, SETCC)) | |||
3522 | SDValue SETCC0 = Cond->getOperand(0); | |||
3523 | SDValue SETCC1 = Cond->getOperand(1); | |||
3524 | EVT VT0 = getSetCCResultType(SETCC0.getOperand(0).getValueType()); | |||
3525 | EVT VT1 = getSetCCResultType(SETCC1.getOperand(0).getValueType()); | |||
3526 | unsigned ScalarBits0 = VT0.getScalarSizeInBits(); | |||
3527 | unsigned ScalarBits1 = VT1.getScalarSizeInBits(); | |||
3528 | unsigned ScalarBits_ToMask = ToMaskVT.getScalarSizeInBits(); | |||
3529 | EVT MaskVT; | |||
3530 | // If the two SETCCs have different VTs, either extend/truncate one of | |||
3531 | // them to the other "towards" ToMaskVT, or truncate one and extend the | |||
3532 | // other to ToMaskVT. | |||
3533 | if (ScalarBits0 != ScalarBits1) { | |||
3534 | EVT NarrowVT = ((ScalarBits0 < ScalarBits1) ? VT0 : VT1); | |||
3535 | EVT WideVT = ((NarrowVT == VT0) ? VT1 : VT0); | |||
3536 | if (ScalarBits_ToMask >= WideVT.getScalarSizeInBits()) | |||
3537 | MaskVT = WideVT; | |||
3538 | else if (ScalarBits_ToMask <= NarrowVT.getScalarSizeInBits()) | |||
3539 | MaskVT = NarrowVT; | |||
3540 | else | |||
3541 | MaskVT = ToMaskVT; | |||
3542 | } else | |||
3543 | // If the two SETCCs have the same VT, don't change it. | |||
3544 | MaskVT = VT0; | |||
3545 | ||||
3546 | // Make new SETCCs and logical nodes. | |||
3547 | SETCC0 = convertMask(SETCC0, VT0, MaskVT); | |||
3548 | SETCC1 = convertMask(SETCC1, VT1, MaskVT); | |||
3549 | Cond = DAG.getNode(Cond->getOpcode(), SDLoc(Cond), MaskVT, SETCC0, SETCC1); | |||
3550 | ||||
3551 | // Convert the logical op for VSELECT if needed. | |||
3552 | Mask = convertMask(Cond, MaskVT, ToMaskVT); | |||
3553 | } else | |||
3554 | return SDValue(); | |||
3555 | ||||
3556 | return DAG.getNode(ISD::VSELECT, SDLoc(N), VSelVT, Mask, VSelOp1, VSelOp2); | |||
3557 | } | |||
3558 | ||||
3559 | SDValue DAGTypeLegalizer::WidenVecRes_SELECT(SDNode *N) { | |||
3560 | EVT WidenVT = TLI.getTypeToTransformTo(*DAG.getContext(), N->getValueType(0)); | |||
3561 | unsigned WidenNumElts = WidenVT.getVectorNumElements(); | |||
3562 | ||||
3563 | SDValue Cond1 = N->getOperand(0); | |||
3564 | EVT CondVT = Cond1.getValueType(); | |||
3565 | if (CondVT.isVector()) { | |||
3566 | if (SDValue Res = WidenVSELECTAndMask(N)) | |||
3567 | return Res; | |||
3568 | ||||
3569 | EVT CondEltVT = CondVT.getVectorElementType(); | |||
3570 | EVT CondWidenVT = EVT::getVectorVT(*DAG.getContext(), | |||
3571 | CondEltVT, WidenNumElts); | |||
3572 | if (getTypeAction(CondVT) == TargetLowering::TypeWidenVector) | |||
3573 | Cond1 = GetWidenedVector(Cond1); | |||
3574 | ||||
3575 | // If we have to split the condition there is no point in widening the | |||
3576 | // select. This would result in an cycle of widening the select -> | |||
3577 | // widening the condition operand -> splitting the condition operand -> | |||
3578 | // splitting the select -> widening the select. Instead split this select | |||
3579 | // further and widen the resulting type. | |||
3580 | if (getTypeAction(CondVT) == TargetLowering::TypeSplitVector) { | |||
3581 | SDValue SplitSelect = SplitVecOp_VSELECT(N, 0); | |||
3582 | SDValue Res = ModifyToType(SplitSelect, WidenVT); | |||
3583 | return Res; | |||
3584 | } | |||
3585 | ||||
3586 | if (Cond1.getValueType() != CondWidenVT) | |||
3587 | Cond1 = ModifyToType(Cond1, CondWidenVT); | |||
3588 | } | |||
3589 | ||||
3590 | SDValue InOp1 = GetWidenedVector(N->getOperand(1)); | |||
3591 | SDValue InOp2 = GetWidenedVector(N->getOperand(2)); | |||
3592 | assert(InOp1.getValueType() == WidenVT && InOp2.getValueType() == WidenVT)((InOp1.getValueType() == WidenVT && InOp2.getValueType () == WidenVT) ? static_cast<void> (0) : __assert_fail ( "InOp1.getValueType() == WidenVT && InOp2.getValueType() == WidenVT" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 3592, __PRETTY_FUNCTION__)); | |||
3593 | return DAG.getNode(N->getOpcode(), SDLoc(N), | |||
3594 | WidenVT, Cond1, InOp1, InOp2); | |||
3595 | } | |||
3596 | ||||
3597 | SDValue DAGTypeLegalizer::WidenVecRes_SELECT_CC(SDNode *N) { | |||
3598 | SDValue InOp1 = GetWidenedVector(N->getOperand(2)); | |||
3599 | SDValue InOp2 = GetWidenedVector(N->getOperand(3)); | |||
3600 | return DAG.getNode(ISD::SELECT_CC, SDLoc(N), | |||
3601 | InOp1.getValueType(), N->getOperand(0), | |||
3602 | N->getOperand(1), InOp1, InOp2, N->getOperand(4)); | |||
3603 | } | |||
3604 | ||||
3605 | SDValue DAGTypeLegalizer::WidenVecRes_UNDEF(SDNode *N) { | |||
3606 | EVT WidenVT = TLI.getTypeToTransformTo(*DAG.getContext(), N->getValueType(0)); | |||
3607 | return DAG.getUNDEF(WidenVT); | |||
3608 | } | |||
3609 | ||||
3610 | SDValue DAGTypeLegalizer::WidenVecRes_VECTOR_SHUFFLE(ShuffleVectorSDNode *N) { | |||
3611 | EVT VT = N->getValueType(0); | |||
3612 | SDLoc dl(N); | |||
3613 | ||||
3614 | EVT WidenVT = TLI.getTypeToTransformTo(*DAG.getContext(), VT); | |||
3615 | unsigned NumElts = VT.getVectorNumElements(); | |||
3616 | unsigned WidenNumElts = WidenVT.getVectorNumElements(); | |||
3617 | ||||
3618 | SDValue InOp1 = GetWidenedVector(N->getOperand(0)); | |||
3619 | SDValue InOp2 = GetWidenedVector(N->getOperand(1)); | |||
3620 | ||||
3621 | // Adjust mask based on new input vector length. | |||
3622 | SmallVector<int, 16> NewMask; | |||
3623 | for (unsigned i = 0; i != NumElts; ++i) { | |||
3624 | int Idx = N->getMaskElt(i); | |||
3625 | if (Idx < (int)NumElts) | |||
3626 | NewMask.push_back(Idx); | |||
3627 | else | |||
3628 | NewMask.push_back(Idx - NumElts + WidenNumElts); | |||
3629 | } | |||
3630 | for (unsigned i = NumElts; i != WidenNumElts; ++i) | |||
3631 | NewMask.push_back(-1); | |||
3632 | return DAG.getVectorShuffle(WidenVT, dl, InOp1, InOp2, NewMask); | |||
3633 | } | |||
3634 | ||||
3635 | SDValue DAGTypeLegalizer::WidenVecRes_SETCC(SDNode *N) { | |||
3636 | assert(N->getValueType(0).isVector() &&((N->getValueType(0).isVector() && N->getOperand (0).getValueType().isVector() && "Operands must be vectors" ) ? static_cast<void> (0) : __assert_fail ("N->getValueType(0).isVector() && N->getOperand(0).getValueType().isVector() && \"Operands must be vectors\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 3638, __PRETTY_FUNCTION__)) | |||
3637 | N->getOperand(0).getValueType().isVector() &&((N->getValueType(0).isVector() && N->getOperand (0).getValueType().isVector() && "Operands must be vectors" ) ? static_cast<void> (0) : __assert_fail ("N->getValueType(0).isVector() && N->getOperand(0).getValueType().isVector() && \"Operands must be vectors\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 3638, __PRETTY_FUNCTION__)) | |||
3638 | "Operands must be vectors")((N->getValueType(0).isVector() && N->getOperand (0).getValueType().isVector() && "Operands must be vectors" ) ? static_cast<void> (0) : __assert_fail ("N->getValueType(0).isVector() && N->getOperand(0).getValueType().isVector() && \"Operands must be vectors\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 3638, __PRETTY_FUNCTION__)); | |||
3639 | EVT WidenVT = TLI.getTypeToTransformTo(*DAG.getContext(), N->getValueType(0)); | |||
3640 | unsigned WidenNumElts = WidenVT.getVectorNumElements(); | |||
3641 | ||||
3642 | SDValue InOp1 = N->getOperand(0); | |||
3643 | EVT InVT = InOp1.getValueType(); | |||
3644 | assert(InVT.isVector() && "can not widen non-vector type")((InVT.isVector() && "can not widen non-vector type") ? static_cast<void> (0) : __assert_fail ("InVT.isVector() && \"can not widen non-vector type\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 3644, __PRETTY_FUNCTION__)); | |||
3645 | EVT WidenInVT = EVT::getVectorVT(*DAG.getContext(), | |||
3646 | InVT.getVectorElementType(), WidenNumElts); | |||
3647 | ||||
3648 | // The input and output types often differ here, and it could be that while | |||
3649 | // we'd prefer to widen the result type, the input operands have been split. | |||
3650 | // In this case, we also need to split the result of this node as well. | |||
3651 | if (getTypeAction(InVT) == TargetLowering::TypeSplitVector) { | |||
3652 | SDValue SplitVSetCC = SplitVecOp_VSETCC(N); | |||
3653 | SDValue Res = ModifyToType(SplitVSetCC, WidenVT); | |||
3654 | return Res; | |||
3655 | } | |||
3656 | ||||
3657 | InOp1 = GetWidenedVector(InOp1); | |||
3658 | SDValue InOp2 = GetWidenedVector(N->getOperand(1)); | |||
3659 | ||||
3660 | // Assume that the input and output will be widen appropriately. If not, | |||
3661 | // we will have to unroll it at some point. | |||
3662 | assert(InOp1.getValueType() == WidenInVT &&((InOp1.getValueType() == WidenInVT && InOp2.getValueType () == WidenInVT && "Input not widened to expected type!" ) ? static_cast<void> (0) : __assert_fail ("InOp1.getValueType() == WidenInVT && InOp2.getValueType() == WidenInVT && \"Input not widened to expected type!\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 3664, __PRETTY_FUNCTION__)) | |||
3663 | InOp2.getValueType() == WidenInVT &&((InOp1.getValueType() == WidenInVT && InOp2.getValueType () == WidenInVT && "Input not widened to expected type!" ) ? static_cast<void> (0) : __assert_fail ("InOp1.getValueType() == WidenInVT && InOp2.getValueType() == WidenInVT && \"Input not widened to expected type!\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 3664, __PRETTY_FUNCTION__)) | |||
3664 | "Input not widened to expected type!")((InOp1.getValueType() == WidenInVT && InOp2.getValueType () == WidenInVT && "Input not widened to expected type!" ) ? static_cast<void> (0) : __assert_fail ("InOp1.getValueType() == WidenInVT && InOp2.getValueType() == WidenInVT && \"Input not widened to expected type!\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 3664, __PRETTY_FUNCTION__)); | |||
3665 | (void)WidenInVT; | |||
3666 | return DAG.getNode(ISD::SETCC, SDLoc(N), | |||
3667 | WidenVT, InOp1, InOp2, N->getOperand(2)); | |||
3668 | } | |||
3669 | ||||
3670 | ||||
3671 | //===----------------------------------------------------------------------===// | |||
3672 | // Widen Vector Operand | |||
3673 | //===----------------------------------------------------------------------===// | |||
3674 | bool DAGTypeLegalizer::WidenVectorOperand(SDNode *N, unsigned OpNo) { | |||
3675 | LLVM_DEBUG(dbgs() << "Widen node operand " << OpNo << ": "; N->dump(&DAG);do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType ("legalize-types")) { dbgs() << "Widen node operand " << OpNo << ": "; N->dump(&DAG); dbgs() << "\n" ; } } while (false) | |||
| ||||
3676 | dbgs() << "\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType ("legalize-types")) { dbgs() << "Widen node operand " << OpNo << ": "; N->dump(&DAG); dbgs() << "\n" ; } } while (false); | |||
3677 | SDValue Res = SDValue(); | |||
3678 | ||||
3679 | // See if the target wants to custom widen this node. | |||
3680 | if (CustomLowerNode(N, N->getOperand(OpNo).getValueType(), false)) | |||
3681 | return false; | |||
3682 | ||||
3683 | switch (N->getOpcode()) { | |||
3684 | default: | |||
3685 | #ifndef NDEBUG | |||
3686 | dbgs() << "WidenVectorOperand op #" << OpNo << ": "; | |||
3687 | N->dump(&DAG); | |||
3688 | dbgs() << "\n"; | |||
3689 | #endif | |||
3690 | llvm_unreachable("Do not know how to widen this operator's operand!")::llvm::llvm_unreachable_internal("Do not know how to widen this operator's operand!" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 3690); | |||
3691 | ||||
3692 | case ISD::BITCAST: Res = WidenVecOp_BITCAST(N); break; | |||
3693 | case ISD::CONCAT_VECTORS: Res = WidenVecOp_CONCAT_VECTORS(N); break; | |||
3694 | case ISD::EXTRACT_SUBVECTOR: Res = WidenVecOp_EXTRACT_SUBVECTOR(N); break; | |||
3695 | case ISD::EXTRACT_VECTOR_ELT: Res = WidenVecOp_EXTRACT_VECTOR_ELT(N); break; | |||
3696 | case ISD::STORE: Res = WidenVecOp_STORE(N); break; | |||
3697 | case ISD::MSTORE: Res = WidenVecOp_MSTORE(N, OpNo); break; | |||
3698 | case ISD::MGATHER: Res = WidenVecOp_MGATHER(N, OpNo); break; | |||
3699 | case ISD::MSCATTER: Res = WidenVecOp_MSCATTER(N, OpNo); break; | |||
3700 | case ISD::SETCC: Res = WidenVecOp_SETCC(N); break; | |||
3701 | case ISD::FCOPYSIGN: Res = WidenVecOp_FCOPYSIGN(N); break; | |||
3702 | ||||
3703 | case ISD::ANY_EXTEND: | |||
3704 | case ISD::SIGN_EXTEND: | |||
3705 | case ISD::ZERO_EXTEND: | |||
3706 | Res = WidenVecOp_EXTEND(N); | |||
3707 | break; | |||
3708 | ||||
3709 | case ISD::FP_EXTEND: | |||
3710 | case ISD::FP_TO_SINT: | |||
3711 | case ISD::FP_TO_UINT: | |||
3712 | case ISD::SINT_TO_FP: | |||
3713 | case ISD::UINT_TO_FP: | |||
3714 | case ISD::TRUNCATE: | |||
3715 | Res = WidenVecOp_Convert(N); | |||
3716 | break; | |||
3717 | } | |||
3718 | ||||
3719 | // If Res is null, the sub-method took care of registering the result. | |||
3720 | if (!Res.getNode()) return false; | |||
3721 | ||||
3722 | // If the result is N, the sub-method updated N in place. Tell the legalizer | |||
3723 | // core about this. | |||
3724 | if (Res.getNode() == N) | |||
3725 | return true; | |||
3726 | ||||
3727 | ||||
3728 | assert(Res.getValueType() == N->getValueType(0) && N->getNumValues() == 1 &&((Res.getValueType() == N->getValueType(0) && N-> getNumValues() == 1 && "Invalid operand expansion") ? static_cast<void> (0) : __assert_fail ("Res.getValueType() == N->getValueType(0) && N->getNumValues() == 1 && \"Invalid operand expansion\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 3729, __PRETTY_FUNCTION__)) | |||
3729 | "Invalid operand expansion")((Res.getValueType() == N->getValueType(0) && N-> getNumValues() == 1 && "Invalid operand expansion") ? static_cast<void> (0) : __assert_fail ("Res.getValueType() == N->getValueType(0) && N->getNumValues() == 1 && \"Invalid operand expansion\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 3729, __PRETTY_FUNCTION__)); | |||
3730 | ||||
3731 | ReplaceValueWith(SDValue(N, 0), Res); | |||
3732 | return false; | |||
3733 | } | |||
3734 | ||||
3735 | SDValue DAGTypeLegalizer::WidenVecOp_EXTEND(SDNode *N) { | |||
3736 | SDLoc DL(N); | |||
3737 | EVT VT = N->getValueType(0); | |||
3738 | ||||
3739 | SDValue InOp = N->getOperand(0); | |||
3740 | assert(getTypeAction(InOp.getValueType()) ==((getTypeAction(InOp.getValueType()) == TargetLowering::TypeWidenVector && "Unexpected type action") ? static_cast<void> (0) : __assert_fail ("getTypeAction(InOp.getValueType()) == TargetLowering::TypeWidenVector && \"Unexpected type action\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 3742, __PRETTY_FUNCTION__)) | |||
3741 | TargetLowering::TypeWidenVector &&((getTypeAction(InOp.getValueType()) == TargetLowering::TypeWidenVector && "Unexpected type action") ? static_cast<void> (0) : __assert_fail ("getTypeAction(InOp.getValueType()) == TargetLowering::TypeWidenVector && \"Unexpected type action\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 3742, __PRETTY_FUNCTION__)) | |||
3742 | "Unexpected type action")((getTypeAction(InOp.getValueType()) == TargetLowering::TypeWidenVector && "Unexpected type action") ? static_cast<void> (0) : __assert_fail ("getTypeAction(InOp.getValueType()) == TargetLowering::TypeWidenVector && \"Unexpected type action\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 3742, __PRETTY_FUNCTION__)); | |||
3743 | InOp = GetWidenedVector(InOp); | |||
3744 | assert(VT.getVectorNumElements() <((VT.getVectorNumElements() < InOp.getValueType().getVectorNumElements () && "Input wasn't widened!") ? static_cast<void> (0) : __assert_fail ("VT.getVectorNumElements() < InOp.getValueType().getVectorNumElements() && \"Input wasn't widened!\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 3746, __PRETTY_FUNCTION__)) | |||
3745 | InOp.getValueType().getVectorNumElements() &&((VT.getVectorNumElements() < InOp.getValueType().getVectorNumElements () && "Input wasn't widened!") ? static_cast<void> (0) : __assert_fail ("VT.getVectorNumElements() < InOp.getValueType().getVectorNumElements() && \"Input wasn't widened!\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 3746, __PRETTY_FUNCTION__)) | |||
3746 | "Input wasn't widened!")((VT.getVectorNumElements() < InOp.getValueType().getVectorNumElements () && "Input wasn't widened!") ? static_cast<void> (0) : __assert_fail ("VT.getVectorNumElements() < InOp.getValueType().getVectorNumElements() && \"Input wasn't widened!\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 3746, __PRETTY_FUNCTION__)); | |||
3747 | ||||
3748 | // We may need to further widen the operand until it has the same total | |||
3749 | // vector size as the result. | |||
3750 | EVT InVT = InOp.getValueType(); | |||
3751 | if (InVT.getSizeInBits() != VT.getSizeInBits()) { | |||
3752 | EVT InEltVT = InVT.getVectorElementType(); | |||
3753 | for (int i = MVT::FIRST_VECTOR_VALUETYPE, e = MVT::LAST_VECTOR_VALUETYPE; i < e; ++i) { | |||
3754 | EVT FixedVT = (MVT::SimpleValueType)i; | |||
3755 | EVT FixedEltVT = FixedVT.getVectorElementType(); | |||
3756 | if (TLI.isTypeLegal(FixedVT) && | |||
3757 | FixedVT.getSizeInBits() == VT.getSizeInBits() && | |||
3758 | FixedEltVT == InEltVT) { | |||
3759 | assert(FixedVT.getVectorNumElements() >= VT.getVectorNumElements() &&((FixedVT.getVectorNumElements() >= VT.getVectorNumElements () && "Not enough elements in the fixed type for the operand!" ) ? static_cast<void> (0) : __assert_fail ("FixedVT.getVectorNumElements() >= VT.getVectorNumElements() && \"Not enough elements in the fixed type for the operand!\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 3760, __PRETTY_FUNCTION__)) | |||
3760 | "Not enough elements in the fixed type for the operand!")((FixedVT.getVectorNumElements() >= VT.getVectorNumElements () && "Not enough elements in the fixed type for the operand!" ) ? static_cast<void> (0) : __assert_fail ("FixedVT.getVectorNumElements() >= VT.getVectorNumElements() && \"Not enough elements in the fixed type for the operand!\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 3760, __PRETTY_FUNCTION__)); | |||
3761 | assert(FixedVT.getVectorNumElements() != InVT.getVectorNumElements() &&((FixedVT.getVectorNumElements() != InVT.getVectorNumElements () && "We can't have the same type as we started with!" ) ? static_cast<void> (0) : __assert_fail ("FixedVT.getVectorNumElements() != InVT.getVectorNumElements() && \"We can't have the same type as we started with!\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 3762, __PRETTY_FUNCTION__)) | |||
3762 | "We can't have the same type as we started with!")((FixedVT.getVectorNumElements() != InVT.getVectorNumElements () && "We can't have the same type as we started with!" ) ? static_cast<void> (0) : __assert_fail ("FixedVT.getVectorNumElements() != InVT.getVectorNumElements() && \"We can't have the same type as we started with!\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 3762, __PRETTY_FUNCTION__)); | |||
3763 | if (FixedVT.getVectorNumElements() > InVT.getVectorNumElements()) | |||
3764 | InOp = DAG.getNode( | |||
3765 | ISD::INSERT_SUBVECTOR, DL, FixedVT, DAG.getUNDEF(FixedVT), InOp, | |||
3766 | DAG.getConstant(0, DL, TLI.getVectorIdxTy(DAG.getDataLayout()))); | |||
3767 | else | |||
3768 | InOp = DAG.getNode( | |||
3769 | ISD::EXTRACT_SUBVECTOR, DL, FixedVT, InOp, | |||
3770 | DAG.getConstant(0, DL, TLI.getVectorIdxTy(DAG.getDataLayout()))); | |||
3771 | break; | |||
3772 | } | |||
3773 | } | |||
3774 | InVT = InOp.getValueType(); | |||
3775 | if (InVT.getSizeInBits() != VT.getSizeInBits()) | |||
3776 | // We couldn't find a legal vector type that was a widening of the input | |||
3777 | // and could be extended in-register to the result type, so we have to | |||
3778 | // scalarize. | |||
3779 | return WidenVecOp_Convert(N); | |||
3780 | } | |||
3781 | ||||
3782 | // Use special DAG nodes to represent the operation of extending the | |||
3783 | // low lanes. | |||
3784 | switch (N->getOpcode()) { | |||
3785 | default: | |||
3786 | llvm_unreachable("Extend legalization on extend operation!")::llvm::llvm_unreachable_internal("Extend legalization on extend operation!" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 3786); | |||
3787 | case ISD::ANY_EXTEND: | |||
3788 | return DAG.getNode(ISD::ANY_EXTEND_VECTOR_INREG, DL, VT, InOp); | |||
3789 | case ISD::SIGN_EXTEND: | |||
3790 | return DAG.getNode(ISD::SIGN_EXTEND_VECTOR_INREG, DL, VT, InOp); | |||
3791 | case ISD::ZERO_EXTEND: | |||
3792 | return DAG.getNode(ISD::ZERO_EXTEND_VECTOR_INREG, DL, VT, InOp); | |||
3793 | } | |||
3794 | } | |||
3795 | ||||
3796 | SDValue DAGTypeLegalizer::WidenVecOp_FCOPYSIGN(SDNode *N) { | |||
3797 | // The result (and first input) is legal, but the second input is illegal. | |||
3798 | // We can't do much to fix that, so just unroll and let the extracts off of | |||
3799 | // the second input be widened as needed later. | |||
3800 | return DAG.UnrollVectorOp(N); | |||
3801 | } | |||
3802 | ||||
3803 | SDValue DAGTypeLegalizer::WidenVecOp_Convert(SDNode *N) { | |||
3804 | // Since the result is legal and the input is illegal. | |||
3805 | EVT VT = N->getValueType(0); | |||
3806 | EVT EltVT = VT.getVectorElementType(); | |||
3807 | SDLoc dl(N); | |||
3808 | unsigned NumElts = VT.getVectorNumElements(); | |||
3809 | SDValue InOp = N->getOperand(0); | |||
3810 | assert(getTypeAction(InOp.getValueType()) ==((getTypeAction(InOp.getValueType()) == TargetLowering::TypeWidenVector && "Unexpected type action") ? static_cast<void> (0) : __assert_fail ("getTypeAction(InOp.getValueType()) == TargetLowering::TypeWidenVector && \"Unexpected type action\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 3812, __PRETTY_FUNCTION__)) | |||
3811 | TargetLowering::TypeWidenVector &&((getTypeAction(InOp.getValueType()) == TargetLowering::TypeWidenVector && "Unexpected type action") ? static_cast<void> (0) : __assert_fail ("getTypeAction(InOp.getValueType()) == TargetLowering::TypeWidenVector && \"Unexpected type action\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 3812, __PRETTY_FUNCTION__)) | |||
3812 | "Unexpected type action")((getTypeAction(InOp.getValueType()) == TargetLowering::TypeWidenVector && "Unexpected type action") ? static_cast<void> (0) : __assert_fail ("getTypeAction(InOp.getValueType()) == TargetLowering::TypeWidenVector && \"Unexpected type action\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 3812, __PRETTY_FUNCTION__)); | |||
3813 | InOp = GetWidenedVector(InOp); | |||
3814 | EVT InVT = InOp.getValueType(); | |||
3815 | unsigned Opcode = N->getOpcode(); | |||
3816 | ||||
3817 | // See if a widened result type would be legal, if so widen the node. | |||
3818 | EVT WideVT = EVT::getVectorVT(*DAG.getContext(), EltVT, | |||
3819 | InVT.getVectorNumElements()); | |||
3820 | if (TLI.isTypeLegal(WideVT)) { | |||
3821 | SDValue Res = DAG.getNode(Opcode, dl, WideVT, InOp); | |||
3822 | return DAG.getNode( | |||
3823 | ISD::EXTRACT_SUBVECTOR, dl, VT, Res, | |||
3824 | DAG.getConstant(0, dl, TLI.getVectorIdxTy(DAG.getDataLayout()))); | |||
3825 | } | |||
3826 | ||||
3827 | EVT InEltVT = InVT.getVectorElementType(); | |||
3828 | ||||
3829 | // Unroll the convert into some scalar code and create a nasty build vector. | |||
3830 | SmallVector<SDValue, 16> Ops(NumElts); | |||
3831 | for (unsigned i=0; i < NumElts; ++i) | |||
3832 | Ops[i] = DAG.getNode( | |||
3833 | Opcode, dl, EltVT, | |||
3834 | DAG.getNode( | |||
3835 | ISD::EXTRACT_VECTOR_ELT, dl, InEltVT, InOp, | |||
3836 | DAG.getConstant(i, dl, TLI.getVectorIdxTy(DAG.getDataLayout())))); | |||
3837 | ||||
3838 | return DAG.getBuildVector(VT, dl, Ops); | |||
3839 | } | |||
3840 | ||||
3841 | SDValue DAGTypeLegalizer::WidenVecOp_BITCAST(SDNode *N) { | |||
3842 | EVT VT = N->getValueType(0); | |||
3843 | SDValue InOp = GetWidenedVector(N->getOperand(0)); | |||
3844 | EVT InWidenVT = InOp.getValueType(); | |||
3845 | SDLoc dl(N); | |||
3846 | ||||
3847 | // Check if we can convert between two legal vector types and extract. | |||
3848 | unsigned InWidenSize = InWidenVT.getSizeInBits(); | |||
3849 | unsigned Size = VT.getSizeInBits(); | |||
3850 | // x86mmx is not an acceptable vector element type, so don't try. | |||
3851 | if (InWidenSize % Size == 0 && !VT.isVector() && VT != MVT::x86mmx) { | |||
3852 | unsigned NewNumElts = InWidenSize / Size; | |||
3853 | EVT NewVT = EVT::getVectorVT(*DAG.getContext(), VT, NewNumElts); | |||
3854 | if (TLI.isTypeLegal(NewVT)) { | |||
3855 | SDValue BitOp = DAG.getNode(ISD::BITCAST, dl, NewVT, InOp); | |||
3856 | return DAG.getNode( | |||
3857 | ISD::EXTRACT_VECTOR_ELT, dl, VT, BitOp, | |||
3858 | DAG.getConstant(0, dl, TLI.getVectorIdxTy(DAG.getDataLayout()))); | |||
3859 | } | |||
3860 | } | |||
3861 | ||||
3862 | return CreateStackStoreLoad(InOp, VT); | |||
3863 | } | |||
3864 | ||||
3865 | SDValue DAGTypeLegalizer::WidenVecOp_CONCAT_VECTORS(SDNode *N) { | |||
3866 | EVT VT = N->getValueType(0); | |||
3867 | EVT EltVT = VT.getVectorElementType(); | |||
3868 | EVT InVT = N->getOperand(0).getValueType(); | |||
3869 | SDLoc dl(N); | |||
3870 | ||||
3871 | // If the widen width for this operand is the same as the width of the concat | |||
3872 | // and all but the first operand is undef, just use the widened operand. | |||
3873 | unsigned NumOperands = N->getNumOperands(); | |||
3874 | if (VT == TLI.getTypeToTransformTo(*DAG.getContext(), InVT)) { | |||
3875 | unsigned i; | |||
3876 | for (i = 1; i < NumOperands; ++i) | |||
3877 | if (!N->getOperand(i).isUndef()) | |||
3878 | break; | |||
3879 | ||||
3880 | if (i == NumOperands) | |||
3881 | return GetWidenedVector(N->getOperand(0)); | |||
3882 | } | |||
3883 | ||||
3884 | // Otherwise, fall back to a nasty build vector. | |||
3885 | unsigned NumElts = VT.getVectorNumElements(); | |||
3886 | SmallVector<SDValue, 16> Ops(NumElts); | |||
3887 | ||||
3888 | unsigned NumInElts = InVT.getVectorNumElements(); | |||
3889 | ||||
3890 | unsigned Idx = 0; | |||
3891 | for (unsigned i=0; i < NumOperands; ++i) { | |||
3892 | SDValue InOp = N->getOperand(i); | |||
3893 | assert(getTypeAction(InOp.getValueType()) ==((getTypeAction(InOp.getValueType()) == TargetLowering::TypeWidenVector && "Unexpected type action") ? static_cast<void> (0) : __assert_fail ("getTypeAction(InOp.getValueType()) == TargetLowering::TypeWidenVector && \"Unexpected type action\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 3895, __PRETTY_FUNCTION__)) | |||
3894 | TargetLowering::TypeWidenVector &&((getTypeAction(InOp.getValueType()) == TargetLowering::TypeWidenVector && "Unexpected type action") ? static_cast<void> (0) : __assert_fail ("getTypeAction(InOp.getValueType()) == TargetLowering::TypeWidenVector && \"Unexpected type action\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 3895, __PRETTY_FUNCTION__)) | |||
3895 | "Unexpected type action")((getTypeAction(InOp.getValueType()) == TargetLowering::TypeWidenVector && "Unexpected type action") ? static_cast<void> (0) : __assert_fail ("getTypeAction(InOp.getValueType()) == TargetLowering::TypeWidenVector && \"Unexpected type action\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 3895, __PRETTY_FUNCTION__)); | |||
3896 | InOp = GetWidenedVector(InOp); | |||
3897 | for (unsigned j=0; j < NumInElts; ++j) | |||
3898 | Ops[Idx++] = DAG.getNode( | |||
3899 | ISD::EXTRACT_VECTOR_ELT, dl, EltVT, InOp, | |||
3900 | DAG.getConstant(j, dl, TLI.getVectorIdxTy(DAG.getDataLayout()))); | |||
3901 | } | |||
3902 | return DAG.getBuildVector(VT, dl, Ops); | |||
3903 | } | |||
3904 | ||||
3905 | SDValue DAGTypeLegalizer::WidenVecOp_EXTRACT_SUBVECTOR(SDNode *N) { | |||
3906 | SDValue InOp = GetWidenedVector(N->getOperand(0)); | |||
3907 | return DAG.getNode(ISD::EXTRACT_SUBVECTOR, SDLoc(N), | |||
3908 | N->getValueType(0), InOp, N->getOperand(1)); | |||
3909 | } | |||
3910 | ||||
3911 | SDValue DAGTypeLegalizer::WidenVecOp_EXTRACT_VECTOR_ELT(SDNode *N) { | |||
3912 | SDValue InOp = GetWidenedVector(N->getOperand(0)); | |||
3913 | return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, SDLoc(N), | |||
3914 | N->getValueType(0), InOp, N->getOperand(1)); | |||
3915 | } | |||
3916 | ||||
3917 | SDValue DAGTypeLegalizer::WidenVecOp_STORE(SDNode *N) { | |||
3918 | // We have to widen the value, but we want only to store the original | |||
3919 | // vector type. | |||
3920 | StoreSDNode *ST = cast<StoreSDNode>(N); | |||
3921 | ||||
3922 | if (!ST->getMemoryVT().getScalarType().isByteSized()) | |||
3923 | return TLI.scalarizeVectorStore(ST, DAG); | |||
3924 | ||||
3925 | SmallVector<SDValue, 16> StChain; | |||
3926 | if (ST->isTruncatingStore()) | |||
3927 | GenWidenVectorTruncStores(StChain, ST); | |||
3928 | else | |||
3929 | GenWidenVectorStores(StChain, ST); | |||
3930 | ||||
3931 | if (StChain.size() == 1) | |||
3932 | return StChain[0]; | |||
3933 | else | |||
3934 | return DAG.getNode(ISD::TokenFactor, SDLoc(ST), MVT::Other, StChain); | |||
3935 | } | |||
3936 | ||||
3937 | SDValue DAGTypeLegalizer::WidenVecOp_MSTORE(SDNode *N, unsigned OpNo) { | |||
3938 | assert((OpNo == 1 || OpNo == 3) &&(((OpNo == 1 || OpNo == 3) && "Can widen only data or mask operand of mstore" ) ? static_cast<void> (0) : __assert_fail ("(OpNo == 1 || OpNo == 3) && \"Can widen only data or mask operand of mstore\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 3939, __PRETTY_FUNCTION__)) | |||
3939 | "Can widen only data or mask operand of mstore")(((OpNo == 1 || OpNo == 3) && "Can widen only data or mask operand of mstore" ) ? static_cast<void> (0) : __assert_fail ("(OpNo == 1 || OpNo == 3) && \"Can widen only data or mask operand of mstore\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 3939, __PRETTY_FUNCTION__)); | |||
3940 | MaskedStoreSDNode *MST = cast<MaskedStoreSDNode>(N); | |||
3941 | SDValue Mask = MST->getMask(); | |||
3942 | EVT MaskVT = Mask.getValueType(); | |||
3943 | SDValue StVal = MST->getValue(); | |||
3944 | SDLoc dl(N); | |||
3945 | ||||
3946 | if (OpNo == 1) { | |||
3947 | // Widen the value. | |||
3948 | StVal = GetWidenedVector(StVal); | |||
3949 | ||||
3950 | // The mask should be widened as well. | |||
3951 | EVT WideVT = StVal.getValueType(); | |||
3952 | EVT WideMaskVT = EVT::getVectorVT(*DAG.getContext(), | |||
3953 | MaskVT.getVectorElementType(), | |||
3954 | WideVT.getVectorNumElements()); | |||
3955 | Mask = ModifyToType(Mask, WideMaskVT, true); | |||
3956 | } else { | |||
3957 | // Widen the mask. | |||
3958 | EVT WideMaskVT = TLI.getTypeToTransformTo(*DAG.getContext(), MaskVT); | |||
3959 | Mask = ModifyToType(Mask, WideMaskVT, true); | |||
3960 | ||||
3961 | EVT ValueVT = StVal.getValueType(); | |||
3962 | EVT WideVT = EVT::getVectorVT(*DAG.getContext(), | |||
3963 | ValueVT.getVectorElementType(), | |||
3964 | WideMaskVT.getVectorNumElements()); | |||
3965 | StVal = ModifyToType(StVal, WideVT); | |||
3966 | } | |||
3967 | ||||
3968 | assert(Mask.getValueType().getVectorNumElements() ==((Mask.getValueType().getVectorNumElements() == StVal.getValueType ().getVectorNumElements() && "Mask and data vectors should have the same number of elements" ) ? static_cast<void> (0) : __assert_fail ("Mask.getValueType().getVectorNumElements() == StVal.getValueType().getVectorNumElements() && \"Mask and data vectors should have the same number of elements\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 3970, __PRETTY_FUNCTION__)) | |||
3969 | StVal.getValueType().getVectorNumElements() &&((Mask.getValueType().getVectorNumElements() == StVal.getValueType ().getVectorNumElements() && "Mask and data vectors should have the same number of elements" ) ? static_cast<void> (0) : __assert_fail ("Mask.getValueType().getVectorNumElements() == StVal.getValueType().getVectorNumElements() && \"Mask and data vectors should have the same number of elements\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 3970, __PRETTY_FUNCTION__)) | |||
3970 | "Mask and data vectors should have the same number of elements")((Mask.getValueType().getVectorNumElements() == StVal.getValueType ().getVectorNumElements() && "Mask and data vectors should have the same number of elements" ) ? static_cast<void> (0) : __assert_fail ("Mask.getValueType().getVectorNumElements() == StVal.getValueType().getVectorNumElements() && \"Mask and data vectors should have the same number of elements\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 3970, __PRETTY_FUNCTION__)); | |||
3971 | return DAG.getMaskedStore(MST->getChain(), dl, StVal, MST->getBasePtr(), | |||
3972 | Mask, MST->getMemoryVT(), MST->getMemOperand(), | |||
3973 | false, MST->isCompressingStore()); | |||
3974 | } | |||
3975 | ||||
3976 | SDValue DAGTypeLegalizer::WidenVecOp_MGATHER(SDNode *N, unsigned OpNo) { | |||
3977 | assert(OpNo == 4 && "Can widen only the index of mgather")((OpNo == 4 && "Can widen only the index of mgather") ? static_cast<void> (0) : __assert_fail ("OpNo == 4 && \"Can widen only the index of mgather\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 3977, __PRETTY_FUNCTION__)); | |||
3978 | auto *MG = cast<MaskedGatherSDNode>(N); | |||
3979 | SDValue DataOp = MG->getPassThru(); | |||
3980 | SDValue Mask = MG->getMask(); | |||
3981 | SDValue Scale = MG->getScale(); | |||
3982 | ||||
3983 | // Just widen the index. It's allowed to have extra elements. | |||
3984 | SDValue Index = GetWidenedVector(MG->getIndex()); | |||
3985 | ||||
3986 | SDLoc dl(N); | |||
3987 | SDValue Ops[] = {MG->getChain(), DataOp, Mask, MG->getBasePtr(), Index, | |||
3988 | Scale}; | |||
3989 | SDValue Res = DAG.getMaskedGather(MG->getVTList(), MG->getMemoryVT(), dl, Ops, | |||
3990 | MG->getMemOperand()); | |||
3991 | ReplaceValueWith(SDValue(N, 1), Res.getValue(1)); | |||
3992 | ReplaceValueWith(SDValue(N, 0), Res.getValue(0)); | |||
3993 | return SDValue(); | |||
3994 | } | |||
3995 | ||||
3996 | SDValue DAGTypeLegalizer::WidenVecOp_MSCATTER(SDNode *N, unsigned OpNo) { | |||
3997 | MaskedScatterSDNode *MSC = cast<MaskedScatterSDNode>(N); | |||
3998 | SDValue DataOp = MSC->getValue(); | |||
3999 | SDValue Mask = MSC->getMask(); | |||
4000 | SDValue Index = MSC->getIndex(); | |||
4001 | SDValue Scale = MSC->getScale(); | |||
4002 | ||||
4003 | unsigned NumElts; | |||
4004 | if (OpNo == 1) { | |||
4005 | DataOp = GetWidenedVector(DataOp); | |||
4006 | NumElts = DataOp.getValueType().getVectorNumElements(); | |||
4007 | ||||
4008 | // Widen index. | |||
4009 | EVT IndexVT = Index.getValueType(); | |||
4010 | EVT WideIndexVT = EVT::getVectorVT(*DAG.getContext(), | |||
4011 | IndexVT.getVectorElementType(), NumElts); | |||
4012 | Index = ModifyToType(Index, WideIndexVT); | |||
4013 | ||||
4014 | // The mask should be widened as well. | |||
4015 | EVT MaskVT = Mask.getValueType(); | |||
4016 | EVT WideMaskVT = EVT::getVectorVT(*DAG.getContext(), | |||
4017 | MaskVT.getVectorElementType(), NumElts); | |||
4018 | Mask = ModifyToType(Mask, WideMaskVT, true); | |||
4019 | } else if (OpNo == 4) { | |||
4020 | // Just widen the index. It's allowed to have extra elements. | |||
4021 | Index = GetWidenedVector(Index); | |||
4022 | } else | |||
4023 | llvm_unreachable("Can't widen this operand of mscatter")::llvm::llvm_unreachable_internal("Can't widen this operand of mscatter" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 4023); | |||
4024 | ||||
4025 | SDValue Ops[] = {MSC->getChain(), DataOp, Mask, MSC->getBasePtr(), Index, | |||
4026 | Scale}; | |||
4027 | return DAG.getMaskedScatter(DAG.getVTList(MVT::Other), | |||
4028 | MSC->getMemoryVT(), SDLoc(N), Ops, | |||
4029 | MSC->getMemOperand()); | |||
4030 | } | |||
4031 | ||||
4032 | SDValue DAGTypeLegalizer::WidenVecOp_SETCC(SDNode *N) { | |||
4033 | SDValue InOp0 = GetWidenedVector(N->getOperand(0)); | |||
4034 | SDValue InOp1 = GetWidenedVector(N->getOperand(1)); | |||
4035 | SDLoc dl(N); | |||
4036 | EVT VT = N->getValueType(0); | |||
4037 | ||||
4038 | // WARNING: In this code we widen the compare instruction with garbage. | |||
4039 | // This garbage may contain denormal floats which may be slow. Is this a real | |||
4040 | // concern ? Should we zero the unused lanes if this is a float compare ? | |||
4041 | ||||
4042 | // Get a new SETCC node to compare the newly widened operands. | |||
4043 | // Only some of the compared elements are legal. | |||
4044 | EVT SVT = TLI.getSetCCResultType(DAG.getDataLayout(), *DAG.getContext(), | |||
4045 | InOp0.getValueType()); | |||
4046 | // The result type is legal, if its vXi1, keep vXi1 for the new SETCC. | |||
4047 | if (VT.getScalarType() == MVT::i1) | |||
4048 | SVT = EVT::getVectorVT(*DAG.getContext(), MVT::i1, | |||
4049 | SVT.getVectorNumElements()); | |||
4050 | ||||
4051 | SDValue WideSETCC = DAG.getNode(ISD::SETCC, SDLoc(N), | |||
4052 | SVT, InOp0, InOp1, N->getOperand(2)); | |||
4053 | ||||
4054 | // Extract the needed results from the result vector. | |||
4055 | EVT ResVT = EVT::getVectorVT(*DAG.getContext(), | |||
4056 | SVT.getVectorElementType(), | |||
4057 | VT.getVectorNumElements()); | |||
4058 | SDValue CC = DAG.getNode( | |||
4059 | ISD::EXTRACT_SUBVECTOR, dl, ResVT, WideSETCC, | |||
4060 | DAG.getConstant(0, dl, TLI.getVectorIdxTy(DAG.getDataLayout()))); | |||
4061 | ||||
4062 | return PromoteTargetBoolean(CC, VT); | |||
4063 | } | |||
4064 | ||||
4065 | ||||
4066 | //===----------------------------------------------------------------------===// | |||
4067 | // Vector Widening Utilities | |||
4068 | //===----------------------------------------------------------------------===// | |||
4069 | ||||
4070 | // Utility function to find the type to chop up a widen vector for load/store | |||
4071 | // TLI: Target lowering used to determine legal types. | |||
4072 | // Width: Width left need to load/store. | |||
4073 | // WidenVT: The widen vector type to load to/store from | |||
4074 | // Align: If 0, don't allow use of a wider type | |||
4075 | // WidenEx: If Align is not 0, the amount additional we can load/store from. | |||
4076 | ||||
4077 | static EVT FindMemType(SelectionDAG& DAG, const TargetLowering &TLI, | |||
4078 | unsigned Width, EVT WidenVT, | |||
4079 | unsigned Align = 0, unsigned WidenEx = 0) { | |||
4080 | EVT WidenEltVT = WidenVT.getVectorElementType(); | |||
4081 | unsigned WidenWidth = WidenVT.getSizeInBits(); | |||
4082 | unsigned WidenEltWidth = WidenEltVT.getSizeInBits(); | |||
4083 | unsigned AlignInBits = Align*8; | |||
4084 | ||||
4085 | // If we have one element to load/store, return it. | |||
4086 | EVT RetVT = WidenEltVT; | |||
4087 | if (Width == WidenEltWidth) | |||
4088 | return RetVT; | |||
4089 | ||||
4090 | // See if there is larger legal integer than the element type to load/store. | |||
4091 | unsigned VT; | |||
4092 | for (VT = (unsigned)MVT::LAST_INTEGER_VALUETYPE; | |||
4093 | VT >= (unsigned)MVT::FIRST_INTEGER_VALUETYPE; --VT) { | |||
4094 | EVT MemVT((MVT::SimpleValueType) VT); | |||
4095 | unsigned MemVTWidth = MemVT.getSizeInBits(); | |||
4096 | if (MemVT.getSizeInBits() <= WidenEltWidth) | |||
4097 | break; | |||
4098 | auto Action = TLI.getTypeAction(*DAG.getContext(), MemVT); | |||
4099 | if ((Action == TargetLowering::TypeLegal || | |||
4100 | Action == TargetLowering::TypePromoteInteger) && | |||
4101 | (WidenWidth % MemVTWidth) == 0 && | |||
4102 | isPowerOf2_32(WidenWidth / MemVTWidth) && | |||
4103 | (MemVTWidth <= Width || | |||
4104 | (Align!=0 && MemVTWidth<=AlignInBits && MemVTWidth<=Width+WidenEx))) { | |||
4105 | RetVT = MemVT; | |||
4106 | break; | |||
4107 | } | |||
4108 | } | |||
4109 | ||||
4110 | // See if there is a larger vector type to load/store that has the same vector | |||
4111 | // element type and is evenly divisible with the WidenVT. | |||
4112 | for (VT = (unsigned)MVT::LAST_VECTOR_VALUETYPE; | |||
4113 | VT >= (unsigned)MVT::FIRST_VECTOR_VALUETYPE; --VT) { | |||
4114 | EVT MemVT = (MVT::SimpleValueType) VT; | |||
4115 | unsigned MemVTWidth = MemVT.getSizeInBits(); | |||
4116 | if (TLI.isTypeLegal(MemVT) && WidenEltVT == MemVT.getVectorElementType() && | |||
4117 | (WidenWidth % MemVTWidth) == 0 && | |||
4118 | isPowerOf2_32(WidenWidth / MemVTWidth) && | |||
4119 | (MemVTWidth <= Width || | |||
4120 | (Align!=0 && MemVTWidth<=AlignInBits && MemVTWidth<=Width+WidenEx))) { | |||
4121 | if (RetVT.getSizeInBits() < MemVTWidth || MemVT == WidenVT) | |||
4122 | return MemVT; | |||
4123 | } | |||
4124 | } | |||
4125 | ||||
4126 | return RetVT; | |||
4127 | } | |||
4128 | ||||
4129 | // Builds a vector type from scalar loads | |||
4130 | // VecTy: Resulting Vector type | |||
4131 | // LDOps: Load operators to build a vector type | |||
4132 | // [Start,End) the list of loads to use. | |||
4133 | static SDValue BuildVectorFromScalar(SelectionDAG& DAG, EVT VecTy, | |||
4134 | SmallVectorImpl<SDValue> &LdOps, | |||
4135 | unsigned Start, unsigned End) { | |||
4136 | const TargetLowering &TLI = DAG.getTargetLoweringInfo(); | |||
4137 | SDLoc dl(LdOps[Start]); | |||
4138 | EVT LdTy = LdOps[Start].getValueType(); | |||
4139 | unsigned Width = VecTy.getSizeInBits(); | |||
4140 | unsigned NumElts = Width / LdTy.getSizeInBits(); | |||
4141 | EVT NewVecVT = EVT::getVectorVT(*DAG.getContext(), LdTy, NumElts); | |||
4142 | ||||
4143 | unsigned Idx = 1; | |||
4144 | SDValue VecOp = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, NewVecVT,LdOps[Start]); | |||
4145 | ||||
4146 | for (unsigned i = Start + 1; i != End; ++i) { | |||
4147 | EVT NewLdTy = LdOps[i].getValueType(); | |||
4148 | if (NewLdTy != LdTy) { | |||
4149 | NumElts = Width / NewLdTy.getSizeInBits(); | |||
4150 | NewVecVT = EVT::getVectorVT(*DAG.getContext(), NewLdTy, NumElts); | |||
4151 | VecOp = DAG.getNode(ISD::BITCAST, dl, NewVecVT, VecOp); | |||
4152 | // Readjust position and vector position based on new load type. | |||
4153 | Idx = Idx * LdTy.getSizeInBits() / NewLdTy.getSizeInBits(); | |||
4154 | LdTy = NewLdTy; | |||
4155 | } | |||
4156 | VecOp = DAG.getNode( | |||
4157 | ISD::INSERT_VECTOR_ELT, dl, NewVecVT, VecOp, LdOps[i], | |||
4158 | DAG.getConstant(Idx++, dl, TLI.getVectorIdxTy(DAG.getDataLayout()))); | |||
4159 | } | |||
4160 | return DAG.getNode(ISD::BITCAST, dl, VecTy, VecOp); | |||
4161 | } | |||
4162 | ||||
4163 | SDValue DAGTypeLegalizer::GenWidenVectorLoads(SmallVectorImpl<SDValue> &LdChain, | |||
4164 | LoadSDNode *LD) { | |||
4165 | // The strategy assumes that we can efficiently load power-of-two widths. | |||
4166 | // The routine chops the vector into the largest vector loads with the same | |||
4167 | // element type or scalar loads and then recombines it to the widen vector | |||
4168 | // type. | |||
4169 | EVT WidenVT = TLI.getTypeToTransformTo(*DAG.getContext(),LD->getValueType(0)); | |||
4170 | unsigned WidenWidth = WidenVT.getSizeInBits(); | |||
4171 | EVT LdVT = LD->getMemoryVT(); | |||
4172 | SDLoc dl(LD); | |||
4173 | assert(LdVT.isVector() && WidenVT.isVector())((LdVT.isVector() && WidenVT.isVector()) ? static_cast <void> (0) : __assert_fail ("LdVT.isVector() && WidenVT.isVector()" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 4173, __PRETTY_FUNCTION__)); | |||
4174 | assert(LdVT.getVectorElementType() == WidenVT.getVectorElementType())((LdVT.getVectorElementType() == WidenVT.getVectorElementType ()) ? static_cast<void> (0) : __assert_fail ("LdVT.getVectorElementType() == WidenVT.getVectorElementType()" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 4174, __PRETTY_FUNCTION__)); | |||
4175 | ||||
4176 | // Load information | |||
4177 | SDValue Chain = LD->getChain(); | |||
4178 | SDValue BasePtr = LD->getBasePtr(); | |||
4179 | unsigned Align = LD->getAlignment(); | |||
4180 | MachineMemOperand::Flags MMOFlags = LD->getMemOperand()->getFlags(); | |||
4181 | AAMDNodes AAInfo = LD->getAAInfo(); | |||
4182 | ||||
4183 | int LdWidth = LdVT.getSizeInBits(); | |||
4184 | int WidthDiff = WidenWidth - LdWidth; | |||
4185 | unsigned LdAlign = LD->isVolatile() ? 0 : Align; // Allow wider loads. | |||
4186 | ||||
4187 | // Find the vector type that can load from. | |||
4188 | EVT NewVT = FindMemType(DAG, TLI, LdWidth, WidenVT, LdAlign, WidthDiff); | |||
4189 | int NewVTWidth = NewVT.getSizeInBits(); | |||
4190 | SDValue LdOp = DAG.getLoad(NewVT, dl, Chain, BasePtr, LD->getPointerInfo(), | |||
4191 | Align, MMOFlags, AAInfo); | |||
4192 | LdChain.push_back(LdOp.getValue(1)); | |||
4193 | ||||
4194 | // Check if we can load the element with one instruction. | |||
4195 | if (LdWidth <= NewVTWidth) { | |||
4196 | if (!NewVT.isVector()) { | |||
4197 | unsigned NumElts = WidenWidth / NewVTWidth; | |||
4198 | EVT NewVecVT = EVT::getVectorVT(*DAG.getContext(), NewVT, NumElts); | |||
4199 | SDValue VecOp = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, NewVecVT, LdOp); | |||
4200 | return DAG.getNode(ISD::BITCAST, dl, WidenVT, VecOp); | |||
4201 | } | |||
4202 | if (NewVT == WidenVT) | |||
4203 | return LdOp; | |||
4204 | ||||
4205 | assert(WidenWidth % NewVTWidth == 0)((WidenWidth % NewVTWidth == 0) ? static_cast<void> (0) : __assert_fail ("WidenWidth % NewVTWidth == 0", "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 4205, __PRETTY_FUNCTION__)); | |||
4206 | unsigned NumConcat = WidenWidth / NewVTWidth; | |||
4207 | SmallVector<SDValue, 16> ConcatOps(NumConcat); | |||
4208 | SDValue UndefVal = DAG.getUNDEF(NewVT); | |||
4209 | ConcatOps[0] = LdOp; | |||
4210 | for (unsigned i = 1; i != NumConcat; ++i) | |||
4211 | ConcatOps[i] = UndefVal; | |||
4212 | return DAG.getNode(ISD::CONCAT_VECTORS, dl, WidenVT, ConcatOps); | |||
4213 | } | |||
4214 | ||||
4215 | // Load vector by using multiple loads from largest vector to scalar. | |||
4216 | SmallVector<SDValue, 16> LdOps; | |||
4217 | LdOps.push_back(LdOp); | |||
4218 | ||||
4219 | LdWidth -= NewVTWidth; | |||
4220 | unsigned Offset = 0; | |||
4221 | ||||
4222 | while (LdWidth > 0) { | |||
4223 | unsigned Increment = NewVTWidth / 8; | |||
4224 | Offset += Increment; | |||
4225 | BasePtr = DAG.getObjectPtrOffset(dl, BasePtr, Increment); | |||
4226 | ||||
4227 | SDValue L; | |||
4228 | if (LdWidth < NewVTWidth) { | |||
4229 | // The current type we are using is too large. Find a better size. | |||
4230 | NewVT = FindMemType(DAG, TLI, LdWidth, WidenVT, LdAlign, WidthDiff); | |||
4231 | NewVTWidth = NewVT.getSizeInBits(); | |||
4232 | L = DAG.getLoad(NewVT, dl, Chain, BasePtr, | |||
4233 | LD->getPointerInfo().getWithOffset(Offset), | |||
4234 | MinAlign(Align, Increment), MMOFlags, AAInfo); | |||
4235 | LdChain.push_back(L.getValue(1)); | |||
4236 | if (L->getValueType(0).isVector() && NewVTWidth >= LdWidth) { | |||
4237 | // Later code assumes the vector loads produced will be mergeable, so we | |||
4238 | // must pad the final entry up to the previous width. Scalars are | |||
4239 | // combined separately. | |||
4240 | SmallVector<SDValue, 16> Loads; | |||
4241 | Loads.push_back(L); | |||
4242 | unsigned size = L->getValueSizeInBits(0); | |||
4243 | while (size < LdOp->getValueSizeInBits(0)) { | |||
4244 | Loads.push_back(DAG.getUNDEF(L->getValueType(0))); | |||
4245 | size += L->getValueSizeInBits(0); | |||
4246 | } | |||
4247 | L = DAG.getNode(ISD::CONCAT_VECTORS, dl, LdOp->getValueType(0), Loads); | |||
4248 | } | |||
4249 | } else { | |||
4250 | L = DAG.getLoad(NewVT, dl, Chain, BasePtr, | |||
4251 | LD->getPointerInfo().getWithOffset(Offset), | |||
4252 | MinAlign(Align, Increment), MMOFlags, AAInfo); | |||
4253 | LdChain.push_back(L.getValue(1)); | |||
4254 | } | |||
4255 | ||||
4256 | LdOps.push_back(L); | |||
4257 | LdOp = L; | |||
4258 | ||||
4259 | LdWidth -= NewVTWidth; | |||
4260 | } | |||
4261 | ||||
4262 | // Build the vector from the load operations. | |||
4263 | unsigned End = LdOps.size(); | |||
4264 | if (!LdOps[0].getValueType().isVector()) | |||
4265 | // All the loads are scalar loads. | |||
4266 | return BuildVectorFromScalar(DAG, WidenVT, LdOps, 0, End); | |||
4267 | ||||
4268 | // If the load contains vectors, build the vector using concat vector. | |||
4269 | // All of the vectors used to load are power-of-2, and the scalar loads can be | |||
4270 | // combined to make a power-of-2 vector. | |||
4271 | SmallVector<SDValue, 16> ConcatOps(End); | |||
4272 | int i = End - 1; | |||
4273 | int Idx = End; | |||
4274 | EVT LdTy = LdOps[i].getValueType(); | |||
4275 | // First, combine the scalar loads to a vector. | |||
4276 | if (!LdTy.isVector()) { | |||
4277 | for (--i; i >= 0; --i) { | |||
4278 | LdTy = LdOps[i].getValueType(); | |||
4279 | if (LdTy.isVector()) | |||
4280 | break; | |||
4281 | } | |||
4282 | ConcatOps[--Idx] = BuildVectorFromScalar(DAG, LdTy, LdOps, i + 1, End); | |||
4283 | } | |||
4284 | ConcatOps[--Idx] = LdOps[i]; | |||
4285 | for (--i; i >= 0; --i) { | |||
4286 | EVT NewLdTy = LdOps[i].getValueType(); | |||
4287 | if (NewLdTy != LdTy) { | |||
4288 | // Create a larger vector. | |||
4289 | ConcatOps[End-1] = DAG.getNode(ISD::CONCAT_VECTORS, dl, NewLdTy, | |||
4290 | makeArrayRef(&ConcatOps[Idx], End - Idx)); | |||
4291 | Idx = End - 1; | |||
4292 | LdTy = NewLdTy; | |||
4293 | } | |||
4294 | ConcatOps[--Idx] = LdOps[i]; | |||
4295 | } | |||
4296 | ||||
4297 | if (WidenWidth == LdTy.getSizeInBits() * (End - Idx)) | |||
4298 | return DAG.getNode(ISD::CONCAT_VECTORS, dl, WidenVT, | |||
4299 | makeArrayRef(&ConcatOps[Idx], End - Idx)); | |||
4300 | ||||
4301 | // We need to fill the rest with undefs to build the vector. | |||
4302 | unsigned NumOps = WidenWidth / LdTy.getSizeInBits(); | |||
4303 | SmallVector<SDValue, 16> WidenOps(NumOps); | |||
4304 | SDValue UndefVal = DAG.getUNDEF(LdTy); | |||
4305 | { | |||
4306 | unsigned i = 0; | |||
4307 | for (; i != End-Idx; ++i) | |||
4308 | WidenOps[i] = ConcatOps[Idx+i]; | |||
4309 | for (; i != NumOps; ++i) | |||
4310 | WidenOps[i] = UndefVal; | |||
4311 | } | |||
4312 | return DAG.getNode(ISD::CONCAT_VECTORS, dl, WidenVT, WidenOps); | |||
4313 | } | |||
4314 | ||||
4315 | SDValue | |||
4316 | DAGTypeLegalizer::GenWidenVectorExtLoads(SmallVectorImpl<SDValue> &LdChain, | |||
4317 | LoadSDNode *LD, | |||
4318 | ISD::LoadExtType ExtType) { | |||
4319 | // For extension loads, it may not be more efficient to chop up the vector | |||
4320 | // and then extend it. Instead, we unroll the load and build a new vector. | |||
4321 | EVT WidenVT = TLI.getTypeToTransformTo(*DAG.getContext(),LD->getValueType(0)); | |||
4322 | EVT LdVT = LD->getMemoryVT(); | |||
4323 | SDLoc dl(LD); | |||
4324 | assert(LdVT.isVector() && WidenVT.isVector())((LdVT.isVector() && WidenVT.isVector()) ? static_cast <void> (0) : __assert_fail ("LdVT.isVector() && WidenVT.isVector()" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 4324, __PRETTY_FUNCTION__)); | |||
4325 | ||||
4326 | // Load information | |||
4327 | SDValue Chain = LD->getChain(); | |||
4328 | SDValue BasePtr = LD->getBasePtr(); | |||
4329 | unsigned Align = LD->getAlignment(); | |||
4330 | MachineMemOperand::Flags MMOFlags = LD->getMemOperand()->getFlags(); | |||
4331 | AAMDNodes AAInfo = LD->getAAInfo(); | |||
4332 | ||||
4333 | EVT EltVT = WidenVT.getVectorElementType(); | |||
4334 | EVT LdEltVT = LdVT.getVectorElementType(); | |||
4335 | unsigned NumElts = LdVT.getVectorNumElements(); | |||
4336 | ||||
4337 | // Load each element and widen. | |||
4338 | unsigned WidenNumElts = WidenVT.getVectorNumElements(); | |||
4339 | SmallVector<SDValue, 16> Ops(WidenNumElts); | |||
4340 | unsigned Increment = LdEltVT.getSizeInBits() / 8; | |||
4341 | Ops[0] = | |||
4342 | DAG.getExtLoad(ExtType, dl, EltVT, Chain, BasePtr, LD->getPointerInfo(), | |||
4343 | LdEltVT, Align, MMOFlags, AAInfo); | |||
4344 | LdChain.push_back(Ops[0].getValue(1)); | |||
4345 | unsigned i = 0, Offset = Increment; | |||
4346 | for (i=1; i < NumElts; ++i, Offset += Increment) { | |||
4347 | SDValue NewBasePtr = DAG.getObjectPtrOffset(dl, BasePtr, Offset); | |||
4348 | Ops[i] = DAG.getExtLoad(ExtType, dl, EltVT, Chain, NewBasePtr, | |||
4349 | LD->getPointerInfo().getWithOffset(Offset), LdEltVT, | |||
4350 | Align, MMOFlags, AAInfo); | |||
4351 | LdChain.push_back(Ops[i].getValue(1)); | |||
4352 | } | |||
4353 | ||||
4354 | // Fill the rest with undefs. | |||
4355 | SDValue UndefVal = DAG.getUNDEF(EltVT); | |||
4356 | for (; i != WidenNumElts; ++i) | |||
4357 | Ops[i] = UndefVal; | |||
4358 | ||||
4359 | return DAG.getBuildVector(WidenVT, dl, Ops); | |||
4360 | } | |||
4361 | ||||
4362 | void DAGTypeLegalizer::GenWidenVectorStores(SmallVectorImpl<SDValue> &StChain, | |||
4363 | StoreSDNode *ST) { | |||
4364 | // The strategy assumes that we can efficiently store power-of-two widths. | |||
4365 | // The routine chops the vector into the largest vector stores with the same | |||
4366 | // element type or scalar stores. | |||
4367 | SDValue Chain = ST->getChain(); | |||
4368 | SDValue BasePtr = ST->getBasePtr(); | |||
4369 | unsigned Align = ST->getAlignment(); | |||
4370 | MachineMemOperand::Flags MMOFlags = ST->getMemOperand()->getFlags(); | |||
4371 | AAMDNodes AAInfo = ST->getAAInfo(); | |||
4372 | SDValue ValOp = GetWidenedVector(ST->getValue()); | |||
4373 | SDLoc dl(ST); | |||
4374 | ||||
4375 | EVT StVT = ST->getMemoryVT(); | |||
4376 | unsigned StWidth = StVT.getSizeInBits(); | |||
4377 | EVT ValVT = ValOp.getValueType(); | |||
4378 | unsigned ValWidth = ValVT.getSizeInBits(); | |||
4379 | EVT ValEltVT = ValVT.getVectorElementType(); | |||
4380 | unsigned ValEltWidth = ValEltVT.getSizeInBits(); | |||
4381 | assert(StVT.getVectorElementType() == ValEltVT)((StVT.getVectorElementType() == ValEltVT) ? static_cast<void > (0) : __assert_fail ("StVT.getVectorElementType() == ValEltVT" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 4381, __PRETTY_FUNCTION__)); | |||
4382 | ||||
4383 | int Idx = 0; // current index to store | |||
4384 | unsigned Offset = 0; // offset from base to store | |||
4385 | while (StWidth != 0) { | |||
4386 | // Find the largest vector type we can store with. | |||
4387 | EVT NewVT = FindMemType(DAG, TLI, StWidth, ValVT); | |||
4388 | unsigned NewVTWidth = NewVT.getSizeInBits(); | |||
4389 | unsigned Increment = NewVTWidth / 8; | |||
4390 | if (NewVT.isVector()) { | |||
4391 | unsigned NumVTElts = NewVT.getVectorNumElements(); | |||
4392 | do { | |||
4393 | SDValue EOp = DAG.getNode( | |||
4394 | ISD::EXTRACT_SUBVECTOR, dl, NewVT, ValOp, | |||
4395 | DAG.getConstant(Idx, dl, TLI.getVectorIdxTy(DAG.getDataLayout()))); | |||
4396 | StChain.push_back(DAG.getStore( | |||
4397 | Chain, dl, EOp, BasePtr, ST->getPointerInfo().getWithOffset(Offset), | |||
4398 | MinAlign(Align, Offset), MMOFlags, AAInfo)); | |||
4399 | StWidth -= NewVTWidth; | |||
4400 | Offset += Increment; | |||
4401 | Idx += NumVTElts; | |||
4402 | ||||
4403 | BasePtr = DAG.getObjectPtrOffset(dl, BasePtr, Increment); | |||
4404 | } while (StWidth != 0 && StWidth >= NewVTWidth); | |||
4405 | } else { | |||
4406 | // Cast the vector to the scalar type we can store. | |||
4407 | unsigned NumElts = ValWidth / NewVTWidth; | |||
4408 | EVT NewVecVT = EVT::getVectorVT(*DAG.getContext(), NewVT, NumElts); | |||
4409 | SDValue VecOp = DAG.getNode(ISD::BITCAST, dl, NewVecVT, ValOp); | |||
4410 | // Readjust index position based on new vector type. | |||
4411 | Idx = Idx * ValEltWidth / NewVTWidth; | |||
4412 | do { | |||
4413 | SDValue EOp = DAG.getNode( | |||
4414 | ISD::EXTRACT_VECTOR_ELT, dl, NewVT, VecOp, | |||
4415 | DAG.getConstant(Idx++, dl, | |||
4416 | TLI.getVectorIdxTy(DAG.getDataLayout()))); | |||
4417 | StChain.push_back(DAG.getStore( | |||
4418 | Chain, dl, EOp, BasePtr, ST->getPointerInfo().getWithOffset(Offset), | |||
4419 | MinAlign(Align, Offset), MMOFlags, AAInfo)); | |||
4420 | StWidth -= NewVTWidth; | |||
4421 | Offset += Increment; | |||
4422 | BasePtr = DAG.getObjectPtrOffset(dl, BasePtr, Increment); | |||
4423 | } while (StWidth != 0 && StWidth >= NewVTWidth); | |||
4424 | // Restore index back to be relative to the original widen element type. | |||
4425 | Idx = Idx * NewVTWidth / ValEltWidth; | |||
4426 | } | |||
4427 | } | |||
4428 | } | |||
4429 | ||||
4430 | void | |||
4431 | DAGTypeLegalizer::GenWidenVectorTruncStores(SmallVectorImpl<SDValue> &StChain, | |||
4432 | StoreSDNode *ST) { | |||
4433 | // For extension loads, it may not be more efficient to truncate the vector | |||
4434 | // and then store it. Instead, we extract each element and then store it. | |||
4435 | SDValue Chain = ST->getChain(); | |||
4436 | SDValue BasePtr = ST->getBasePtr(); | |||
4437 | unsigned Align = ST->getAlignment(); | |||
4438 | MachineMemOperand::Flags MMOFlags = ST->getMemOperand()->getFlags(); | |||
4439 | AAMDNodes AAInfo = ST->getAAInfo(); | |||
4440 | SDValue ValOp = GetWidenedVector(ST->getValue()); | |||
4441 | SDLoc dl(ST); | |||
4442 | ||||
4443 | EVT StVT = ST->getMemoryVT(); | |||
4444 | EVT ValVT = ValOp.getValueType(); | |||
4445 | ||||
4446 | // It must be true that the wide vector type is bigger than where we need to | |||
4447 | // store. | |||
4448 | assert(StVT.isVector() && ValOp.getValueType().isVector())((StVT.isVector() && ValOp.getValueType().isVector()) ? static_cast<void> (0) : __assert_fail ("StVT.isVector() && ValOp.getValueType().isVector()" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 4448, __PRETTY_FUNCTION__)); | |||
4449 | assert(StVT.bitsLT(ValOp.getValueType()))((StVT.bitsLT(ValOp.getValueType())) ? static_cast<void> (0) : __assert_fail ("StVT.bitsLT(ValOp.getValueType())", "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 4449, __PRETTY_FUNCTION__)); | |||
4450 | ||||
4451 | // For truncating stores, we can not play the tricks of chopping legal vector | |||
4452 | // types and bitcast it to the right type. Instead, we unroll the store. | |||
4453 | EVT StEltVT = StVT.getVectorElementType(); | |||
4454 | EVT ValEltVT = ValVT.getVectorElementType(); | |||
4455 | unsigned Increment = ValEltVT.getSizeInBits() / 8; | |||
4456 | unsigned NumElts = StVT.getVectorNumElements(); | |||
4457 | SDValue EOp = DAG.getNode( | |||
4458 | ISD::EXTRACT_VECTOR_ELT, dl, ValEltVT, ValOp, | |||
4459 | DAG.getConstant(0, dl, TLI.getVectorIdxTy(DAG.getDataLayout()))); | |||
4460 | StChain.push_back(DAG.getTruncStore(Chain, dl, EOp, BasePtr, | |||
4461 | ST->getPointerInfo(), StEltVT, Align, | |||
4462 | MMOFlags, AAInfo)); | |||
4463 | unsigned Offset = Increment; | |||
4464 | for (unsigned i=1; i < NumElts; ++i, Offset += Increment) { | |||
4465 | SDValue NewBasePtr = DAG.getObjectPtrOffset(dl, BasePtr, Offset); | |||
4466 | SDValue EOp = DAG.getNode( | |||
4467 | ISD::EXTRACT_VECTOR_ELT, dl, ValEltVT, ValOp, | |||
4468 | DAG.getConstant(0, dl, TLI.getVectorIdxTy(DAG.getDataLayout()))); | |||
4469 | StChain.push_back(DAG.getTruncStore( | |||
4470 | Chain, dl, EOp, NewBasePtr, ST->getPointerInfo().getWithOffset(Offset), | |||
4471 | StEltVT, MinAlign(Align, Offset), MMOFlags, AAInfo)); | |||
4472 | } | |||
4473 | } | |||
4474 | ||||
4475 | /// Modifies a vector input (widen or narrows) to a vector of NVT. The | |||
4476 | /// input vector must have the same element type as NVT. | |||
4477 | /// FillWithZeroes specifies that the vector should be widened with zeroes. | |||
4478 | SDValue DAGTypeLegalizer::ModifyToType(SDValue InOp, EVT NVT, | |||
4479 | bool FillWithZeroes) { | |||
4480 | // Note that InOp might have been widened so it might already have | |||
4481 | // the right width or it might need be narrowed. | |||
4482 | EVT InVT = InOp.getValueType(); | |||
4483 | assert(InVT.getVectorElementType() == NVT.getVectorElementType() &&((InVT.getVectorElementType() == NVT.getVectorElementType() && "input and widen element type must match") ? static_cast< void> (0) : __assert_fail ("InVT.getVectorElementType() == NVT.getVectorElementType() && \"input and widen element type must match\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 4484, __PRETTY_FUNCTION__)) | |||
4484 | "input and widen element type must match")((InVT.getVectorElementType() == NVT.getVectorElementType() && "input and widen element type must match") ? static_cast< void> (0) : __assert_fail ("InVT.getVectorElementType() == NVT.getVectorElementType() && \"input and widen element type must match\"" , "/build/llvm-toolchain-snapshot-8~svn350071/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp" , 4484, __PRETTY_FUNCTION__)); | |||
4485 | SDLoc dl(InOp); | |||
4486 | ||||
4487 | // Check if InOp already has the right width. | |||
4488 | if (InVT == NVT) | |||
4489 | return InOp; | |||
4490 | ||||
4491 | unsigned InNumElts = InVT.getVectorNumElements(); | |||
4492 | unsigned WidenNumElts = NVT.getVectorNumElements(); | |||
4493 | if (WidenNumElts > InNumElts && WidenNumElts % InNumElts == 0) { | |||
| ||||
4494 | unsigned NumConcat = WidenNumElts / InNumElts; | |||
4495 | SmallVector<SDValue, 16> Ops(NumConcat); | |||
4496 | SDValue FillVal = FillWithZeroes ? DAG.getConstant(0, dl, InVT) : | |||
4497 | DAG.getUNDEF(InVT); | |||
4498 | Ops[0] = InOp; | |||
4499 | for (unsigned i = 1; i != NumConcat; ++i) | |||
4500 | Ops[i] = FillVal; | |||
4501 | ||||
4502 | return DAG.getNode(ISD::CONCAT_VECTORS, dl, NVT, Ops); | |||
4503 | } | |||
4504 | ||||
4505 | if (WidenNumElts < InNumElts && InNumElts % WidenNumElts) | |||
4506 | return DAG.getNode( | |||
4507 | ISD::EXTRACT_SUBVECTOR, dl, NVT, InOp, | |||
4508 | DAG.getConstant(0, dl, TLI.getVectorIdxTy(DAG.getDataLayout()))); | |||
4509 | ||||
4510 | // Fall back to extract and build. | |||
4511 | SmallVector<SDValue, 16> Ops(WidenNumElts); | |||
4512 | EVT EltVT = NVT.getVectorElementType(); | |||
4513 | unsigned MinNumElts = std::min(WidenNumElts, InNumElts); | |||
4514 | unsigned Idx; | |||
4515 | for (Idx = 0; Idx < MinNumElts; ++Idx) | |||
4516 | Ops[Idx] = DAG.getNode( | |||
4517 | ISD::EXTRACT_VECTOR_ELT, dl, EltVT, InOp, | |||
4518 | DAG.getConstant(Idx, dl, TLI.getVectorIdxTy(DAG.getDataLayout()))); | |||
4519 | ||||
4520 | SDValue FillVal = FillWithZeroes ? DAG.getConstant(0, dl, EltVT) : | |||
4521 | DAG.getUNDEF(EltVT); | |||
4522 | for ( ; Idx < WidenNumElts; ++Idx) | |||
4523 | Ops[Idx] = FillVal; | |||
4524 | return DAG.getBuildVector(NVT, dl, Ops); | |||
4525 | } |
1 | //===- CodeGen/ValueTypes.h - Low-Level Target independ. types --*- 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 defines the set of low-level target independent types which various |
11 | // values in the code generator are. This allows the target specific behavior |
12 | // of instructions to be described to target independent passes. |
13 | // |
14 | //===----------------------------------------------------------------------===// |
15 | |
16 | #ifndef LLVM_CODEGEN_VALUETYPES_H |
17 | #define LLVM_CODEGEN_VALUETYPES_H |
18 | |
19 | #include "llvm/Support/Compiler.h" |
20 | #include "llvm/Support/MachineValueType.h" |
21 | #include "llvm/Support/MathExtras.h" |
22 | #include <cassert> |
23 | #include <cstdint> |
24 | #include <string> |
25 | |
26 | namespace llvm { |
27 | |
28 | class LLVMContext; |
29 | class Type; |
30 | |
31 | /// Extended Value Type. Capable of holding value types which are not native |
32 | /// for any processor (such as the i12345 type), as well as the types an MVT |
33 | /// can represent. |
34 | struct EVT { |
35 | private: |
36 | MVT V = MVT::INVALID_SIMPLE_VALUE_TYPE; |
37 | Type *LLVMTy = nullptr; |
38 | |
39 | public: |
40 | constexpr EVT() = default; |
41 | constexpr EVT(MVT::SimpleValueType SVT) : V(SVT) {} |
42 | constexpr EVT(MVT S) : V(S) {} |
43 | |
44 | bool operator==(EVT VT) const { |
45 | return !(*this != VT); |
46 | } |
47 | bool operator!=(EVT VT) const { |
48 | if (V.SimpleTy != VT.V.SimpleTy) |
49 | return true; |
50 | if (V.SimpleTy == MVT::INVALID_SIMPLE_VALUE_TYPE) |
51 | return LLVMTy != VT.LLVMTy; |
52 | return false; |
53 | } |
54 | |
55 | /// Returns the EVT that represents a floating-point type with the given |
56 | /// number of bits. There are two floating-point types with 128 bits - this |
57 | /// returns f128 rather than ppcf128. |
58 | static EVT getFloatingPointVT(unsigned BitWidth) { |
59 | return MVT::getFloatingPointVT(BitWidth); |
60 | } |
61 | |
62 | /// Returns the EVT that represents an integer with the given number of |
63 | /// bits. |
64 | static EVT getIntegerVT(LLVMContext &Context, unsigned BitWidth) { |
65 | MVT M = MVT::getIntegerVT(BitWidth); |
66 | if (M.SimpleTy != MVT::INVALID_SIMPLE_VALUE_TYPE) |
67 | return M; |
68 | return getExtendedIntegerVT(Context, BitWidth); |
69 | } |
70 | |
71 | /// Returns the EVT that represents a vector NumElements in length, where |
72 | /// each element is of type VT. |
73 | static EVT getVectorVT(LLVMContext &Context, EVT VT, unsigned NumElements, |
74 | bool IsScalable = false) { |
75 | MVT M = MVT::getVectorVT(VT.V, NumElements, IsScalable); |
76 | if (M.SimpleTy != MVT::INVALID_SIMPLE_VALUE_TYPE) |
77 | return M; |
78 | |
79 | assert(!IsScalable && "We don't support extended scalable types yet")((!IsScalable && "We don't support extended scalable types yet" ) ? static_cast<void> (0) : __assert_fail ("!IsScalable && \"We don't support extended scalable types yet\"" , "/build/llvm-toolchain-snapshot-8~svn350071/include/llvm/CodeGen/ValueTypes.h" , 79, __PRETTY_FUNCTION__)); |
80 | return getExtendedVectorVT(Context, VT, NumElements); |
81 | } |
82 | |
83 | /// Returns the EVT that represents a vector EC.Min elements in length, |
84 | /// where each element is of type VT. |
85 | static EVT getVectorVT(LLVMContext &Context, EVT VT, MVT::ElementCount EC) { |
86 | MVT M = MVT::getVectorVT(VT.V, EC); |
87 | if (M.SimpleTy != MVT::INVALID_SIMPLE_VALUE_TYPE) |
88 | return M; |
89 | assert (!EC.Scalable && "We don't support extended scalable types yet")((!EC.Scalable && "We don't support extended scalable types yet" ) ? static_cast<void> (0) : __assert_fail ("!EC.Scalable && \"We don't support extended scalable types yet\"" , "/build/llvm-toolchain-snapshot-8~svn350071/include/llvm/CodeGen/ValueTypes.h" , 89, __PRETTY_FUNCTION__)); |
90 | return getExtendedVectorVT(Context, VT, EC.Min); |
91 | } |
92 | |
93 | /// Return a vector with the same number of elements as this vector, but |
94 | /// with the element type converted to an integer type with the same |
95 | /// bitwidth. |
96 | EVT changeVectorElementTypeToInteger() const { |
97 | if (!isSimple()) { |
98 | assert (!isScalableVector() &&((!isScalableVector() && "We don't support extended scalable types yet" ) ? static_cast<void> (0) : __assert_fail ("!isScalableVector() && \"We don't support extended scalable types yet\"" , "/build/llvm-toolchain-snapshot-8~svn350071/include/llvm/CodeGen/ValueTypes.h" , 99, __PRETTY_FUNCTION__)) |
99 | "We don't support extended scalable types yet")((!isScalableVector() && "We don't support extended scalable types yet" ) ? static_cast<void> (0) : __assert_fail ("!isScalableVector() && \"We don't support extended scalable types yet\"" , "/build/llvm-toolchain-snapshot-8~svn350071/include/llvm/CodeGen/ValueTypes.h" , 99, __PRETTY_FUNCTION__)); |
100 | return changeExtendedVectorElementTypeToInteger(); |
101 | } |
102 | MVT EltTy = getSimpleVT().getVectorElementType(); |
103 | unsigned BitWidth = EltTy.getSizeInBits(); |
104 | MVT IntTy = MVT::getIntegerVT(BitWidth); |
105 | MVT VecTy = MVT::getVectorVT(IntTy, getVectorNumElements(), |
106 | isScalableVector()); |
107 | assert(VecTy.SimpleTy != MVT::INVALID_SIMPLE_VALUE_TYPE &&((VecTy.SimpleTy != MVT::INVALID_SIMPLE_VALUE_TYPE && "Simple vector VT not representable by simple integer vector VT!" ) ? static_cast<void> (0) : __assert_fail ("VecTy.SimpleTy != MVT::INVALID_SIMPLE_VALUE_TYPE && \"Simple vector VT not representable by simple integer vector VT!\"" , "/build/llvm-toolchain-snapshot-8~svn350071/include/llvm/CodeGen/ValueTypes.h" , 108, __PRETTY_FUNCTION__)) |
108 | "Simple vector VT not representable by simple integer vector VT!")((VecTy.SimpleTy != MVT::INVALID_SIMPLE_VALUE_TYPE && "Simple vector VT not representable by simple integer vector VT!" ) ? static_cast<void> (0) : __assert_fail ("VecTy.SimpleTy != MVT::INVALID_SIMPLE_VALUE_TYPE && \"Simple vector VT not representable by simple integer vector VT!\"" , "/build/llvm-toolchain-snapshot-8~svn350071/include/llvm/CodeGen/ValueTypes.h" , 108, __PRETTY_FUNCTION__)); |
109 | return VecTy; |
110 | } |
111 | |
112 | /// Return the type converted to an equivalently sized integer or vector |
113 | /// with integer element type. Similar to changeVectorElementTypeToInteger, |
114 | /// but also handles scalars. |
115 | EVT changeTypeToInteger() { |
116 | if (isVector()) |
117 | return changeVectorElementTypeToInteger(); |
118 | |
119 | if (isSimple()) |
120 | return MVT::getIntegerVT(getSizeInBits()); |
121 | |
122 | return changeExtendedTypeToInteger(); |
123 | } |
124 | |
125 | /// Test if the given EVT is simple (as opposed to being extended). |
126 | bool isSimple() const { |
127 | return V.SimpleTy != MVT::INVALID_SIMPLE_VALUE_TYPE; |
128 | } |
129 | |
130 | /// Test if the given EVT is extended (as opposed to being simple). |
131 | bool isExtended() const { |
132 | return !isSimple(); |
133 | } |
134 | |
135 | /// Return true if this is a FP or a vector FP type. |
136 | bool isFloatingPoint() const { |
137 | return isSimple() ? V.isFloatingPoint() : isExtendedFloatingPoint(); |
138 | } |
139 | |
140 | /// Return true if this is an integer or a vector integer type. |
141 | bool isInteger() const { |
142 | return isSimple() ? V.isInteger() : isExtendedInteger(); |
143 | } |
144 | |
145 | /// Return true if this is an integer, but not a vector. |
146 | bool isScalarInteger() const { |
147 | return isSimple() ? V.isScalarInteger() : isExtendedScalarInteger(); |
148 | } |
149 | |
150 | /// Return true if this is a vector value type. |
151 | bool isVector() const { |
152 | return isSimple() ? V.isVector() : isExtendedVector(); |
153 | } |
154 | |
155 | /// Return true if this is a vector type where the runtime |
156 | /// length is machine dependent |
157 | bool isScalableVector() const { |
158 | // FIXME: We don't support extended scalable types yet, because the |
159 | // matching IR type doesn't exist. Once it has been added, this can |
160 | // be changed to call isExtendedScalableVector. |
161 | if (!isSimple()) |
162 | return false; |
163 | return V.isScalableVector(); |
164 | } |
165 | |
166 | /// Return true if this is a 16-bit vector type. |
167 | bool is16BitVector() const { |
168 | return isSimple() ? V.is16BitVector() : isExtended16BitVector(); |
169 | } |
170 | |
171 | /// Return true if this is a 32-bit vector type. |
172 | bool is32BitVector() const { |
173 | return isSimple() ? V.is32BitVector() : isExtended32BitVector(); |
174 | } |
175 | |
176 | /// Return true if this is a 64-bit vector type. |
177 | bool is64BitVector() const { |
178 | return isSimple() ? V.is64BitVector() : isExtended64BitVector(); |
179 | } |
180 | |
181 | /// Return true if this is a 128-bit vector type. |
182 | bool is128BitVector() const { |
183 | return isSimple() ? V.is128BitVector() : isExtended128BitVector(); |
184 | } |
185 | |
186 | /// Return true if this is a 256-bit vector type. |
187 | bool is256BitVector() const { |
188 | return isSimple() ? V.is256BitVector() : isExtended256BitVector(); |
189 | } |
190 | |
191 | /// Return true if this is a 512-bit vector type. |
192 | bool is512BitVector() const { |
193 | return isSimple() ? V.is512BitVector() : isExtended512BitVector(); |
194 | } |
195 | |
196 | /// Return true if this is a 1024-bit vector type. |
197 | bool is1024BitVector() const { |
198 | return isSimple() ? V.is1024BitVector() : isExtended1024BitVector(); |
199 | } |
200 | |
201 | /// Return true if this is a 2048-bit vector type. |
202 | bool is2048BitVector() const { |
203 | return isSimple() ? V.is2048BitVector() : isExtended2048BitVector(); |
204 | } |
205 | |
206 | /// Return true if this is an overloaded type for TableGen. |
207 | bool isOverloaded() const { |
208 | return (V==MVT::iAny || V==MVT::fAny || V==MVT::vAny || V==MVT::iPTRAny); |
209 | } |
210 | |
211 | /// Return true if the bit size is a multiple of 8. |
212 | bool isByteSized() const { |
213 | return (getSizeInBits() & 7) == 0; |
214 | } |
215 | |
216 | /// Return true if the size is a power-of-two number of bytes. |
217 | bool isRound() const { |
218 | unsigned BitSize = getSizeInBits(); |
219 | return BitSize >= 8 && !(BitSize & (BitSize - 1)); |
220 | } |
221 | |
222 | /// Return true if this has the same number of bits as VT. |
223 | bool bitsEq(EVT VT) const { |
224 | if (EVT::operator==(VT)) return true; |
225 | return getSizeInBits() == VT.getSizeInBits(); |
226 | } |
227 | |
228 | /// Return true if this has more bits than VT. |
229 | bool bitsGT(EVT VT) const { |
230 | if (EVT::operator==(VT)) return false; |
231 | return getSizeInBits() > VT.getSizeInBits(); |
232 | } |
233 | |
234 | /// Return true if this has no less bits than VT. |
235 | bool bitsGE(EVT VT) const { |
236 | if (EVT::operator==(VT)) return true; |
237 | return getSizeInBits() >= VT.getSizeInBits(); |
238 | } |
239 | |
240 | /// Return true if this has less bits than VT. |
241 | bool bitsLT(EVT VT) const { |
242 | if (EVT::operator==(VT)) return false; |
243 | return getSizeInBits() < VT.getSizeInBits(); |
244 | } |
245 | |
246 | /// Return true if this has no more bits than VT. |
247 | bool bitsLE(EVT VT) const { |
248 | if (EVT::operator==(VT)) return true; |
249 | return getSizeInBits() <= VT.getSizeInBits(); |
250 | } |
251 | |
252 | /// Return the SimpleValueType held in the specified simple EVT. |
253 | MVT getSimpleVT() const { |
254 | assert(isSimple() && "Expected a SimpleValueType!")((isSimple() && "Expected a SimpleValueType!") ? static_cast <void> (0) : __assert_fail ("isSimple() && \"Expected a SimpleValueType!\"" , "/build/llvm-toolchain-snapshot-8~svn350071/include/llvm/CodeGen/ValueTypes.h" , 254, __PRETTY_FUNCTION__)); |
255 | return V; |
256 | } |
257 | |
258 | /// If this is a vector type, return the element type, otherwise return |
259 | /// this. |
260 | EVT getScalarType() const { |
261 | return isVector() ? getVectorElementType() : *this; |
262 | } |
263 | |
264 | /// Given a vector type, return the type of each element. |
265 | EVT getVectorElementType() const { |
266 | assert(isVector() && "Invalid vector type!")((isVector() && "Invalid vector type!") ? static_cast <void> (0) : __assert_fail ("isVector() && \"Invalid vector type!\"" , "/build/llvm-toolchain-snapshot-8~svn350071/include/llvm/CodeGen/ValueTypes.h" , 266, __PRETTY_FUNCTION__)); |
267 | if (isSimple()) |
268 | return V.getVectorElementType(); |
269 | return getExtendedVectorElementType(); |
270 | } |
271 | |
272 | /// Given a vector type, return the number of elements it contains. |
273 | unsigned getVectorNumElements() const { |
274 | assert(isVector() && "Invalid vector type!")((isVector() && "Invalid vector type!") ? static_cast <void> (0) : __assert_fail ("isVector() && \"Invalid vector type!\"" , "/build/llvm-toolchain-snapshot-8~svn350071/include/llvm/CodeGen/ValueTypes.h" , 274, __PRETTY_FUNCTION__)); |
275 | if (isSimple()) |
276 | return V.getVectorNumElements(); |
277 | return getExtendedVectorNumElements(); |
278 | } |
279 | |
280 | // Given a (possibly scalable) vector type, return the ElementCount |
281 | MVT::ElementCount getVectorElementCount() const { |
282 | assert((isVector()) && "Invalid vector type!")(((isVector()) && "Invalid vector type!") ? static_cast <void> (0) : __assert_fail ("(isVector()) && \"Invalid vector type!\"" , "/build/llvm-toolchain-snapshot-8~svn350071/include/llvm/CodeGen/ValueTypes.h" , 282, __PRETTY_FUNCTION__)); |
283 | if (isSimple()) |
284 | return V.getVectorElementCount(); |
285 | |
286 | assert(!isScalableVector() &&((!isScalableVector() && "We don't support extended scalable types yet" ) ? static_cast<void> (0) : __assert_fail ("!isScalableVector() && \"We don't support extended scalable types yet\"" , "/build/llvm-toolchain-snapshot-8~svn350071/include/llvm/CodeGen/ValueTypes.h" , 287, __PRETTY_FUNCTION__)) |
287 | "We don't support extended scalable types yet")((!isScalableVector() && "We don't support extended scalable types yet" ) ? static_cast<void> (0) : __assert_fail ("!isScalableVector() && \"We don't support extended scalable types yet\"" , "/build/llvm-toolchain-snapshot-8~svn350071/include/llvm/CodeGen/ValueTypes.h" , 287, __PRETTY_FUNCTION__)); |
288 | return {getExtendedVectorNumElements(), false}; |
289 | } |
290 | |
291 | /// Return the size of the specified value type in bits. |
292 | unsigned getSizeInBits() const { |
293 | if (isSimple()) |
294 | return V.getSizeInBits(); |
295 | return getExtendedSizeInBits(); |
296 | } |
297 | |
298 | unsigned getScalarSizeInBits() const { |
299 | return getScalarType().getSizeInBits(); |
300 | } |
301 | |
302 | /// Return the number of bytes overwritten by a store of the specified value |
303 | /// type. |
304 | unsigned getStoreSize() const { |
305 | return (getSizeInBits() + 7) / 8; |
306 | } |
307 | |
308 | /// Return the number of bits overwritten by a store of the specified value |
309 | /// type. |
310 | unsigned getStoreSizeInBits() const { |
311 | return getStoreSize() * 8; |
312 | } |
313 | |
314 | /// Rounds the bit-width of the given integer EVT up to the nearest power of |
315 | /// two (and at least to eight), and returns the integer EVT with that |
316 | /// number of bits. |
317 | EVT getRoundIntegerType(LLVMContext &Context) const { |
318 | assert(isInteger() && !isVector() && "Invalid integer type!")((isInteger() && !isVector() && "Invalid integer type!" ) ? static_cast<void> (0) : __assert_fail ("isInteger() && !isVector() && \"Invalid integer type!\"" , "/build/llvm-toolchain-snapshot-8~svn350071/include/llvm/CodeGen/ValueTypes.h" , 318, __PRETTY_FUNCTION__)); |
319 | unsigned BitWidth = getSizeInBits(); |
320 | if (BitWidth <= 8) |
321 | return EVT(MVT::i8); |
322 | return getIntegerVT(Context, 1 << Log2_32_Ceil(BitWidth)); |
323 | } |
324 | |
325 | /// Finds the smallest simple value type that is greater than or equal to |
326 | /// half the width of this EVT. If no simple value type can be found, an |
327 | /// extended integer value type of half the size (rounded up) is returned. |
328 | EVT getHalfSizedIntegerVT(LLVMContext &Context) const { |
329 | assert(isInteger() && !isVector() && "Invalid integer type!")((isInteger() && !isVector() && "Invalid integer type!" ) ? static_cast<void> (0) : __assert_fail ("isInteger() && !isVector() && \"Invalid integer type!\"" , "/build/llvm-toolchain-snapshot-8~svn350071/include/llvm/CodeGen/ValueTypes.h" , 329, __PRETTY_FUNCTION__)); |
330 | unsigned EVTSize = getSizeInBits(); |
331 | for (unsigned IntVT = MVT::FIRST_INTEGER_VALUETYPE; |
332 | IntVT <= MVT::LAST_INTEGER_VALUETYPE; ++IntVT) { |
333 | EVT HalfVT = EVT((MVT::SimpleValueType)IntVT); |
334 | if (HalfVT.getSizeInBits() * 2 >= EVTSize) |
335 | return HalfVT; |
336 | } |
337 | return getIntegerVT(Context, (EVTSize + 1) / 2); |
338 | } |
339 | |
340 | /// Return a VT for an integer vector type with the size of the |
341 | /// elements doubled. The typed returned may be an extended type. |
342 | EVT widenIntegerVectorElementType(LLVMContext &Context) const { |
343 | EVT EltVT = getVectorElementType(); |
344 | EltVT = EVT::getIntegerVT(Context, 2 * EltVT.getSizeInBits()); |
345 | return EVT::getVectorVT(Context, EltVT, getVectorElementCount()); |
346 | } |
347 | |
348 | // Return a VT for a vector type with the same element type but |
349 | // half the number of elements. The type returned may be an |
350 | // extended type. |
351 | EVT getHalfNumVectorElementsVT(LLVMContext &Context) const { |
352 | EVT EltVT = getVectorElementType(); |
353 | auto EltCnt = getVectorElementCount(); |
354 | assert(!(EltCnt.Min & 1) && "Splitting vector, but not in half!")((!(EltCnt.Min & 1) && "Splitting vector, but not in half!" ) ? static_cast<void> (0) : __assert_fail ("!(EltCnt.Min & 1) && \"Splitting vector, but not in half!\"" , "/build/llvm-toolchain-snapshot-8~svn350071/include/llvm/CodeGen/ValueTypes.h" , 354, __PRETTY_FUNCTION__)); |
355 | return EVT::getVectorVT(Context, EltVT, EltCnt / 2); |
356 | } |
357 | |
358 | /// Returns true if the given vector is a power of 2. |
359 | bool isPow2VectorType() const { |
360 | unsigned NElts = getVectorNumElements(); |
361 | return !(NElts & (NElts - 1)); |
362 | } |
363 | |
364 | /// Widens the length of the given vector EVT up to the nearest power of 2 |
365 | /// and returns that type. |
366 | EVT getPow2VectorType(LLVMContext &Context) const { |
367 | if (!isPow2VectorType()) { |
368 | unsigned NElts = getVectorNumElements(); |
369 | unsigned Pow2NElts = 1 << Log2_32_Ceil(NElts); |
370 | return EVT::getVectorVT(Context, getVectorElementType(), Pow2NElts, |
371 | isScalableVector()); |
372 | } |
373 | else { |
374 | return *this; |
375 | } |
376 | } |
377 | |
378 | /// This function returns value type as a string, e.g. "i32". |
379 | std::string getEVTString() const; |
380 | |
381 | /// This method returns an LLVM type corresponding to the specified EVT. |
382 | /// For integer types, this returns an unsigned type. Note that this will |
383 | /// abort for types that cannot be represented. |
384 | Type *getTypeForEVT(LLVMContext &Context) const; |
385 | |
386 | /// Return the value type corresponding to the specified type. |
387 | /// This returns all pointers as iPTR. If HandleUnknown is true, unknown |
388 | /// types are returned as Other, otherwise they are invalid. |
389 | static EVT getEVT(Type *Ty, bool HandleUnknown = false); |
390 | |
391 | intptr_t getRawBits() const { |
392 | if (isSimple()) |
393 | return V.SimpleTy; |
394 | else |
395 | return (intptr_t)(LLVMTy); |
396 | } |
397 | |
398 | /// A meaningless but well-behaved order, useful for constructing |
399 | /// containers. |
400 | struct compareRawBits { |
401 | bool operator()(EVT L, EVT R) const { |
402 | if (L.V.SimpleTy == R.V.SimpleTy) |
403 | return L.LLVMTy < R.LLVMTy; |
404 | else |
405 | return L.V.SimpleTy < R.V.SimpleTy; |
406 | } |
407 | }; |
408 | |
409 | private: |
410 | // Methods for handling the Extended-type case in functions above. |
411 | // These are all out-of-line to prevent users of this header file |
412 | // from having a dependency on Type.h. |
413 | EVT changeExtendedTypeToInteger() const; |
414 | EVT changeExtendedVectorElementTypeToInteger() const; |
415 | static EVT getExtendedIntegerVT(LLVMContext &C, unsigned BitWidth); |
416 | static EVT getExtendedVectorVT(LLVMContext &C, EVT VT, |
417 | unsigned NumElements); |
418 | bool isExtendedFloatingPoint() const LLVM_READONLY__attribute__((__pure__)); |
419 | bool isExtendedInteger() const LLVM_READONLY__attribute__((__pure__)); |
420 | bool isExtendedScalarInteger() const LLVM_READONLY__attribute__((__pure__)); |
421 | bool isExtendedVector() const LLVM_READONLY__attribute__((__pure__)); |
422 | bool isExtended16BitVector() const LLVM_READONLY__attribute__((__pure__)); |
423 | bool isExtended32BitVector() const LLVM_READONLY__attribute__((__pure__)); |
424 | bool isExtended64BitVector() const LLVM_READONLY__attribute__((__pure__)); |
425 | bool isExtended128BitVector() const LLVM_READONLY__attribute__((__pure__)); |
426 | bool isExtended256BitVector() const LLVM_READONLY__attribute__((__pure__)); |
427 | bool isExtended512BitVector() const LLVM_READONLY__attribute__((__pure__)); |
428 | bool isExtended1024BitVector() const LLVM_READONLY__attribute__((__pure__)); |
429 | bool isExtended2048BitVector() const LLVM_READONLY__attribute__((__pure__)); |
430 | EVT getExtendedVectorElementType() const; |
431 | unsigned getExtendedVectorNumElements() const LLVM_READONLY__attribute__((__pure__)); |
432 | unsigned getExtendedSizeInBits() const LLVM_READONLY__attribute__((__pure__)); |
433 | }; |
434 | |
435 | } // end namespace llvm |
436 | |
437 | #endif // LLVM_CODEGEN_VALUETYPES_H |