Bug Summary

File:include/llvm/CodeGen/TargetLowering.h
Warning:line 1079, column 9
Called C++ object pointer is null

Annotated Source Code

Press '?' to see keyboard shortcuts

clang -cc1 -triple x86_64-pc-linux-gnu -analyze -disable-free -disable-llvm-verifier -discard-value-names -main-file-name ARMTargetTransformInfo.cpp -analyzer-store=region -analyzer-opt-analyze-nested-blocks -analyzer-eagerly-assume -analyzer-checker=core -analyzer-checker=apiModeling -analyzer-checker=unix -analyzer-checker=deadcode -analyzer-checker=cplusplus -analyzer-checker=security.insecureAPI.UncheckedReturn -analyzer-checker=security.insecureAPI.getpw -analyzer-checker=security.insecureAPI.gets -analyzer-checker=security.insecureAPI.mktemp -analyzer-checker=security.insecureAPI.mkstemp -analyzer-checker=security.insecureAPI.vfork -analyzer-checker=nullability.NullPassedToNonnull -analyzer-checker=nullability.NullReturnedFromNonnull -analyzer-output plist -w -mrelocation-model pic -pic-level 2 -mthread-model posix -fmath-errno -masm-verbose -mconstructor-aliases -munwind-tables -fuse-init-array -target-cpu x86-64 -dwarf-column-info -debugger-tuning=gdb -momit-leaf-frame-pointer -ffunction-sections -fdata-sections -resource-dir /usr/lib/llvm-7/lib/clang/7.0.0 -D _DEBUG -D _GNU_SOURCE -D __STDC_CONSTANT_MACROS -D __STDC_FORMAT_MACROS -D __STDC_LIMIT_MACROS -I /build/llvm-toolchain-snapshot-7~svn337103/build-llvm/lib/Target/ARM -I /build/llvm-toolchain-snapshot-7~svn337103/lib/Target/ARM -I /build/llvm-toolchain-snapshot-7~svn337103/build-llvm/include -I /build/llvm-toolchain-snapshot-7~svn337103/include -U NDEBUG -internal-isystem /usr/lib/gcc/x86_64-linux-gnu/7.3.0/../../../../include/c++/7.3.0 -internal-isystem /usr/lib/gcc/x86_64-linux-gnu/7.3.0/../../../../include/x86_64-linux-gnu/c++/7.3.0 -internal-isystem /usr/lib/gcc/x86_64-linux-gnu/7.3.0/../../../../include/x86_64-linux-gnu/c++/7.3.0 -internal-isystem /usr/lib/gcc/x86_64-linux-gnu/7.3.0/../../../../include/c++/7.3.0/backward -internal-isystem /usr/include/clang/7.0.0/include/ -internal-isystem /usr/local/include -internal-isystem /usr/lib/llvm-7/lib/clang/7.0.0/include -internal-externc-isystem /usr/lib/gcc/x86_64-linux-gnu/7.3.0/include -internal-externc-isystem /usr/include/x86_64-linux-gnu -internal-externc-isystem /include -internal-externc-isystem /usr/include -O2 -Wno-unused-parameter -Wwrite-strings -Wno-missing-field-initializers -Wno-long-long -Wno-maybe-uninitialized -Wno-comment -std=c++11 -fdeprecated-macro -fdebug-compilation-dir /build/llvm-toolchain-snapshot-7~svn337103/build-llvm/lib/Target/ARM -ferror-limit 19 -fmessage-length 0 -fvisibility-inlines-hidden -fobjc-runtime=gcc -fdiagnostics-show-option -vectorize-loops -vectorize-slp -analyzer-output=html -analyzer-config stable-report-filename=true -o /tmp/scan-build-2018-07-15-073923-5500-1 -x c++ /build/llvm-toolchain-snapshot-7~svn337103/lib/Target/ARM/ARMTargetTransformInfo.cpp

/build/llvm-toolchain-snapshot-7~svn337103/lib/Target/ARM/ARMTargetTransformInfo.cpp

1//===- ARMTargetTransformInfo.cpp - ARM specific TTI ----------------------===//
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#include "ARMTargetTransformInfo.h"
11#include "ARMSubtarget.h"
12#include "MCTargetDesc/ARMAddressingModes.h"
13#include "llvm/ADT/APInt.h"
14#include "llvm/ADT/SmallVector.h"
15#include "llvm/Analysis/LoopInfo.h"
16#include "llvm/CodeGen/CostTable.h"
17#include "llvm/CodeGen/ISDOpcodes.h"
18#include "llvm/CodeGen/ValueTypes.h"
19#include "llvm/IR/BasicBlock.h"
20#include "llvm/IR/CallSite.h"
21#include "llvm/IR/DataLayout.h"
22#include "llvm/IR/DerivedTypes.h"
23#include "llvm/IR/Instruction.h"
24#include "llvm/IR/Instructions.h"
25#include "llvm/IR/Type.h"
26#include "llvm/MC/SubtargetFeature.h"
27#include "llvm/Support/Casting.h"
28#include "llvm/Support/MachineValueType.h"
29#include "llvm/Target/TargetMachine.h"
30#include <algorithm>
31#include <cassert>
32#include <cstdint>
33#include <utility>
34
35using namespace llvm;
36
37#define DEBUG_TYPE"armtti" "armtti"
38
39bool ARMTTIImpl::areInlineCompatible(const Function *Caller,
40 const Function *Callee) const {
41 const TargetMachine &TM = getTLI()->getTargetMachine();
42 const FeatureBitset &CallerBits =
43 TM.getSubtargetImpl(*Caller)->getFeatureBits();
44 const FeatureBitset &CalleeBits =
45 TM.getSubtargetImpl(*Callee)->getFeatureBits();
46
47 // To inline a callee, all features not in the whitelist must match exactly.
48 bool MatchExact = (CallerBits & ~InlineFeatureWhitelist) ==
49 (CalleeBits & ~InlineFeatureWhitelist);
50 // For features in the whitelist, the callee's features must be a subset of
51 // the callers'.
52 bool MatchSubset = ((CallerBits & CalleeBits) & InlineFeatureWhitelist) ==
53 (CalleeBits & InlineFeatureWhitelist);
54 return MatchExact && MatchSubset;
55}
56
57int ARMTTIImpl::getIntImmCost(const APInt &Imm, Type *Ty) {
58 assert(Ty->isIntegerTy())(static_cast <bool> (Ty->isIntegerTy()) ? void (0) :
__assert_fail ("Ty->isIntegerTy()", "/build/llvm-toolchain-snapshot-7~svn337103/lib/Target/ARM/ARMTargetTransformInfo.cpp"
, 58, __extension__ __PRETTY_FUNCTION__))
;
59
60 unsigned Bits = Ty->getPrimitiveSizeInBits();
61 if (Bits == 0 || Imm.getActiveBits() >= 64)
62 return 4;
63
64 int64_t SImmVal = Imm.getSExtValue();
65 uint64_t ZImmVal = Imm.getZExtValue();
66 if (!ST->isThumb()) {
67 if ((SImmVal >= 0 && SImmVal < 65536) ||
68 (ARM_AM::getSOImmVal(ZImmVal) != -1) ||
69 (ARM_AM::getSOImmVal(~ZImmVal) != -1))
70 return 1;
71 return ST->hasV6T2Ops() ? 2 : 3;
72 }
73 if (ST->isThumb2()) {
74 if ((SImmVal >= 0 && SImmVal < 65536) ||
75 (ARM_AM::getT2SOImmVal(ZImmVal) != -1) ||
76 (ARM_AM::getT2SOImmVal(~ZImmVal) != -1))
77 return 1;
78 return ST->hasV6T2Ops() ? 2 : 3;
79 }
80 // Thumb1.
81 if (SImmVal >= 0 && SImmVal < 256)
82 return 1;
83 if ((~SImmVal < 256) || ARM_AM::isThumbImmShiftedVal(ZImmVal))
84 return 2;
85 // Load from constantpool.
86 return 3;
87}
88
89// Constants smaller than 256 fit in the immediate field of
90// Thumb1 instructions so we return a zero cost and 1 otherwise.
91int ARMTTIImpl::getIntImmCodeSizeCost(unsigned Opcode, unsigned Idx,
92 const APInt &Imm, Type *Ty) {
93 if (Imm.isNonNegative() && Imm.getLimitedValue() < 256)
94 return 0;
95
96 return 1;
97}
98
99int ARMTTIImpl::getIntImmCost(unsigned Opcode, unsigned Idx, const APInt &Imm,
100 Type *Ty) {
101 // Division by a constant can be turned into multiplication, but only if we
102 // know it's constant. So it's not so much that the immediate is cheap (it's
103 // not), but that the alternative is worse.
104 // FIXME: this is probably unneeded with GlobalISel.
105 if ((Opcode == Instruction::SDiv || Opcode == Instruction::UDiv ||
106 Opcode == Instruction::SRem || Opcode == Instruction::URem) &&
107 Idx == 1)
108 return 0;
109
110 if (Opcode == Instruction::And)
111 // Conversion to BIC is free, and means we can use ~Imm instead.
112 return std::min(getIntImmCost(Imm, Ty), getIntImmCost(~Imm, Ty));
113
114 if (Opcode == Instruction::Add)
115 // Conversion to SUB is free, and means we can use -Imm instead.
116 return std::min(getIntImmCost(Imm, Ty), getIntImmCost(-Imm, Ty));
117
118 if (Opcode == Instruction::ICmp && Imm.isNegative() &&
119 Ty->getIntegerBitWidth() == 32) {
120 int64_t NegImm = -Imm.getSExtValue();
121 if (ST->isThumb2() && NegImm < 1<<12)
122 // icmp X, #-C -> cmn X, #C
123 return 0;
124 if (ST->isThumb() && NegImm < 1<<8)
125 // icmp X, #-C -> adds X, #C
126 return 0;
127 }
128
129 // xor a, -1 can always be folded to MVN
130 if (Opcode == Instruction::Xor && Imm.isAllOnesValue())
131 return 0;
132
133 return getIntImmCost(Imm, Ty);
134}
135
136int ARMTTIImpl::getCastInstrCost(unsigned Opcode, Type *Dst, Type *Src,
137 const Instruction *I) {
138 int ISD = TLI->InstructionOpcodeToISD(Opcode);
139 assert(ISD && "Invalid opcode")(static_cast <bool> (ISD && "Invalid opcode") ?
void (0) : __assert_fail ("ISD && \"Invalid opcode\""
, "/build/llvm-toolchain-snapshot-7~svn337103/lib/Target/ARM/ARMTargetTransformInfo.cpp"
, 139, __extension__ __PRETTY_FUNCTION__))
;
140
141 // Single to/from double precision conversions.
142 static const CostTblEntry NEONFltDblTbl[] = {
143 // Vector fptrunc/fpext conversions.
144 { ISD::FP_ROUND, MVT::v2f64, 2 },
145 { ISD::FP_EXTEND, MVT::v2f32, 2 },
146 { ISD::FP_EXTEND, MVT::v4f32, 4 }
147 };
148
149 if (Src->isVectorTy() && ST->hasNEON() && (ISD == ISD::FP_ROUND ||
150 ISD == ISD::FP_EXTEND)) {
151 std::pair<int, MVT> LT = TLI->getTypeLegalizationCost(DL, Src);
152 if (const auto *Entry = CostTableLookup(NEONFltDblTbl, ISD, LT.second))
153 return LT.first * Entry->Cost;
154 }
155
156 EVT SrcTy = TLI->getValueType(DL, Src);
157 EVT DstTy = TLI->getValueType(DL, Dst);
158
159 if (!SrcTy.isSimple() || !DstTy.isSimple())
160 return BaseT::getCastInstrCost(Opcode, Dst, Src);
161
162 // Some arithmetic, load and store operations have specific instructions
163 // to cast up/down their types automatically at no extra cost.
164 // TODO: Get these tables to know at least what the related operations are.
165 static const TypeConversionCostTblEntry NEONVectorConversionTbl[] = {
166 { ISD::SIGN_EXTEND, MVT::v4i32, MVT::v4i16, 0 },
167 { ISD::ZERO_EXTEND, MVT::v4i32, MVT::v4i16, 0 },
168 { ISD::SIGN_EXTEND, MVT::v2i64, MVT::v2i32, 1 },
169 { ISD::ZERO_EXTEND, MVT::v2i64, MVT::v2i32, 1 },
170 { ISD::TRUNCATE, MVT::v4i32, MVT::v4i64, 0 },
171 { ISD::TRUNCATE, MVT::v4i16, MVT::v4i32, 1 },
172
173 // The number of vmovl instructions for the extension.
174 { ISD::SIGN_EXTEND, MVT::v4i64, MVT::v4i16, 3 },
175 { ISD::ZERO_EXTEND, MVT::v4i64, MVT::v4i16, 3 },
176 { ISD::SIGN_EXTEND, MVT::v8i32, MVT::v8i8, 3 },
177 { ISD::ZERO_EXTEND, MVT::v8i32, MVT::v8i8, 3 },
178 { ISD::SIGN_EXTEND, MVT::v8i64, MVT::v8i8, 7 },
179 { ISD::ZERO_EXTEND, MVT::v8i64, MVT::v8i8, 7 },
180 { ISD::SIGN_EXTEND, MVT::v8i64, MVT::v8i16, 6 },
181 { ISD::ZERO_EXTEND, MVT::v8i64, MVT::v8i16, 6 },
182 { ISD::SIGN_EXTEND, MVT::v16i32, MVT::v16i8, 6 },
183 { ISD::ZERO_EXTEND, MVT::v16i32, MVT::v16i8, 6 },
184
185 // Operations that we legalize using splitting.
186 { ISD::TRUNCATE, MVT::v16i8, MVT::v16i32, 6 },
187 { ISD::TRUNCATE, MVT::v8i8, MVT::v8i32, 3 },
188
189 // Vector float <-> i32 conversions.
190 { ISD::SINT_TO_FP, MVT::v4f32, MVT::v4i32, 1 },
191 { ISD::UINT_TO_FP, MVT::v4f32, MVT::v4i32, 1 },
192
193 { ISD::SINT_TO_FP, MVT::v2f32, MVT::v2i8, 3 },
194 { ISD::UINT_TO_FP, MVT::v2f32, MVT::v2i8, 3 },
195 { ISD::SINT_TO_FP, MVT::v2f32, MVT::v2i16, 2 },
196 { ISD::UINT_TO_FP, MVT::v2f32, MVT::v2i16, 2 },
197 { ISD::SINT_TO_FP, MVT::v2f32, MVT::v2i32, 1 },
198 { ISD::UINT_TO_FP, MVT::v2f32, MVT::v2i32, 1 },
199 { ISD::SINT_TO_FP, MVT::v4f32, MVT::v4i1, 3 },
200 { ISD::UINT_TO_FP, MVT::v4f32, MVT::v4i1, 3 },
201 { ISD::SINT_TO_FP, MVT::v4f32, MVT::v4i8, 3 },
202 { ISD::UINT_TO_FP, MVT::v4f32, MVT::v4i8, 3 },
203 { ISD::SINT_TO_FP, MVT::v4f32, MVT::v4i16, 2 },
204 { ISD::UINT_TO_FP, MVT::v4f32, MVT::v4i16, 2 },
205 { ISD::SINT_TO_FP, MVT::v8f32, MVT::v8i16, 4 },
206 { ISD::UINT_TO_FP, MVT::v8f32, MVT::v8i16, 4 },
207 { ISD::SINT_TO_FP, MVT::v8f32, MVT::v8i32, 2 },
208 { ISD::UINT_TO_FP, MVT::v8f32, MVT::v8i32, 2 },
209 { ISD::SINT_TO_FP, MVT::v16f32, MVT::v16i16, 8 },
210 { ISD::UINT_TO_FP, MVT::v16f32, MVT::v16i16, 8 },
211 { ISD::SINT_TO_FP, MVT::v16f32, MVT::v16i32, 4 },
212 { ISD::UINT_TO_FP, MVT::v16f32, MVT::v16i32, 4 },
213
214 { ISD::FP_TO_SINT, MVT::v4i32, MVT::v4f32, 1 },
215 { ISD::FP_TO_UINT, MVT::v4i32, MVT::v4f32, 1 },
216 { ISD::FP_TO_SINT, MVT::v4i8, MVT::v4f32, 3 },
217 { ISD::FP_TO_UINT, MVT::v4i8, MVT::v4f32, 3 },
218 { ISD::FP_TO_SINT, MVT::v4i16, MVT::v4f32, 2 },
219 { ISD::FP_TO_UINT, MVT::v4i16, MVT::v4f32, 2 },
220
221 // Vector double <-> i32 conversions.
222 { ISD::SINT_TO_FP, MVT::v2f64, MVT::v2i32, 2 },
223 { ISD::UINT_TO_FP, MVT::v2f64, MVT::v2i32, 2 },
224
225 { ISD::SINT_TO_FP, MVT::v2f64, MVT::v2i8, 4 },
226 { ISD::UINT_TO_FP, MVT::v2f64, MVT::v2i8, 4 },
227 { ISD::SINT_TO_FP, MVT::v2f64, MVT::v2i16, 3 },
228 { ISD::UINT_TO_FP, MVT::v2f64, MVT::v2i16, 3 },
229 { ISD::SINT_TO_FP, MVT::v2f64, MVT::v2i32, 2 },
230 { ISD::UINT_TO_FP, MVT::v2f64, MVT::v2i32, 2 },
231
232 { ISD::FP_TO_SINT, MVT::v2i32, MVT::v2f64, 2 },
233 { ISD::FP_TO_UINT, MVT::v2i32, MVT::v2f64, 2 },
234 { ISD::FP_TO_SINT, MVT::v8i16, MVT::v8f32, 4 },
235 { ISD::FP_TO_UINT, MVT::v8i16, MVT::v8f32, 4 },
236 { ISD::FP_TO_SINT, MVT::v16i16, MVT::v16f32, 8 },
237 { ISD::FP_TO_UINT, MVT::v16i16, MVT::v16f32, 8 }
238 };
239
240 if (SrcTy.isVector() && ST->hasNEON()) {
241 if (const auto *Entry = ConvertCostTableLookup(NEONVectorConversionTbl, ISD,
242 DstTy.getSimpleVT(),
243 SrcTy.getSimpleVT()))
244 return Entry->Cost;
245 }
246
247 // Scalar float to integer conversions.
248 static const TypeConversionCostTblEntry NEONFloatConversionTbl[] = {
249 { ISD::FP_TO_SINT, MVT::i1, MVT::f32, 2 },
250 { ISD::FP_TO_UINT, MVT::i1, MVT::f32, 2 },
251 { ISD::FP_TO_SINT, MVT::i1, MVT::f64, 2 },
252 { ISD::FP_TO_UINT, MVT::i1, MVT::f64, 2 },
253 { ISD::FP_TO_SINT, MVT::i8, MVT::f32, 2 },
254 { ISD::FP_TO_UINT, MVT::i8, MVT::f32, 2 },
255 { ISD::FP_TO_SINT, MVT::i8, MVT::f64, 2 },
256 { ISD::FP_TO_UINT, MVT::i8, MVT::f64, 2 },
257 { ISD::FP_TO_SINT, MVT::i16, MVT::f32, 2 },
258 { ISD::FP_TO_UINT, MVT::i16, MVT::f32, 2 },
259 { ISD::FP_TO_SINT, MVT::i16, MVT::f64, 2 },
260 { ISD::FP_TO_UINT, MVT::i16, MVT::f64, 2 },
261 { ISD::FP_TO_SINT, MVT::i32, MVT::f32, 2 },
262 { ISD::FP_TO_UINT, MVT::i32, MVT::f32, 2 },
263 { ISD::FP_TO_SINT, MVT::i32, MVT::f64, 2 },
264 { ISD::FP_TO_UINT, MVT::i32, MVT::f64, 2 },
265 { ISD::FP_TO_SINT, MVT::i64, MVT::f32, 10 },
266 { ISD::FP_TO_UINT, MVT::i64, MVT::f32, 10 },
267 { ISD::FP_TO_SINT, MVT::i64, MVT::f64, 10 },
268 { ISD::FP_TO_UINT, MVT::i64, MVT::f64, 10 }
269 };
270 if (SrcTy.isFloatingPoint() && ST->hasNEON()) {
271 if (const auto *Entry = ConvertCostTableLookup(NEONFloatConversionTbl, ISD,
272 DstTy.getSimpleVT(),
273 SrcTy.getSimpleVT()))
274 return Entry->Cost;
275 }
276
277 // Scalar integer to float conversions.
278 static const TypeConversionCostTblEntry NEONIntegerConversionTbl[] = {
279 { ISD::SINT_TO_FP, MVT::f32, MVT::i1, 2 },
280 { ISD::UINT_TO_FP, MVT::f32, MVT::i1, 2 },
281 { ISD::SINT_TO_FP, MVT::f64, MVT::i1, 2 },
282 { ISD::UINT_TO_FP, MVT::f64, MVT::i1, 2 },
283 { ISD::SINT_TO_FP, MVT::f32, MVT::i8, 2 },
284 { ISD::UINT_TO_FP, MVT::f32, MVT::i8, 2 },
285 { ISD::SINT_TO_FP, MVT::f64, MVT::i8, 2 },
286 { ISD::UINT_TO_FP, MVT::f64, MVT::i8, 2 },
287 { ISD::SINT_TO_FP, MVT::f32, MVT::i16, 2 },
288 { ISD::UINT_TO_FP, MVT::f32, MVT::i16, 2 },
289 { ISD::SINT_TO_FP, MVT::f64, MVT::i16, 2 },
290 { ISD::UINT_TO_FP, MVT::f64, MVT::i16, 2 },
291 { ISD::SINT_TO_FP, MVT::f32, MVT::i32, 2 },
292 { ISD::UINT_TO_FP, MVT::f32, MVT::i32, 2 },
293 { ISD::SINT_TO_FP, MVT::f64, MVT::i32, 2 },
294 { ISD::UINT_TO_FP, MVT::f64, MVT::i32, 2 },
295 { ISD::SINT_TO_FP, MVT::f32, MVT::i64, 10 },
296 { ISD::UINT_TO_FP, MVT::f32, MVT::i64, 10 },
297 { ISD::SINT_TO_FP, MVT::f64, MVT::i64, 10 },
298 { ISD::UINT_TO_FP, MVT::f64, MVT::i64, 10 }
299 };
300
301 if (SrcTy.isInteger() && ST->hasNEON()) {
302 if (const auto *Entry = ConvertCostTableLookup(NEONIntegerConversionTbl,
303 ISD, DstTy.getSimpleVT(),
304 SrcTy.getSimpleVT()))
305 return Entry->Cost;
306 }
307
308 // Scalar integer conversion costs.
309 static const TypeConversionCostTblEntry ARMIntegerConversionTbl[] = {
310 // i16 -> i64 requires two dependent operations.
311 { ISD::SIGN_EXTEND, MVT::i64, MVT::i16, 2 },
312
313 // Truncates on i64 are assumed to be free.
314 { ISD::TRUNCATE, MVT::i32, MVT::i64, 0 },
315 { ISD::TRUNCATE, MVT::i16, MVT::i64, 0 },
316 { ISD::TRUNCATE, MVT::i8, MVT::i64, 0 },
317 { ISD::TRUNCATE, MVT::i1, MVT::i64, 0 }
318 };
319
320 if (SrcTy.isInteger()) {
321 if (const auto *Entry = ConvertCostTableLookup(ARMIntegerConversionTbl, ISD,
322 DstTy.getSimpleVT(),
323 SrcTy.getSimpleVT()))
324 return Entry->Cost;
325 }
326
327 return BaseT::getCastInstrCost(Opcode, Dst, Src);
328}
329
330int ARMTTIImpl::getVectorInstrCost(unsigned Opcode, Type *ValTy,
331 unsigned Index) {
332 // Penalize inserting into an D-subregister. We end up with a three times
333 // lower estimated throughput on swift.
334 if (ST->hasSlowLoadDSubregister() && Opcode == Instruction::InsertElement &&
335 ValTy->isVectorTy() && ValTy->getScalarSizeInBits() <= 32)
336 return 3;
337
338 if ((Opcode == Instruction::InsertElement ||
339 Opcode == Instruction::ExtractElement)) {
340 // Cross-class copies are expensive on many microarchitectures,
341 // so assume they are expensive by default.
342 if (ValTy->getVectorElementType()->isIntegerTy())
343 return 3;
344
345 // Even if it's not a cross class copy, this likely leads to mixing
346 // of NEON and VFP code and should be therefore penalized.
347 if (ValTy->isVectorTy() &&
348 ValTy->getScalarSizeInBits() <= 32)
349 return std::max(BaseT::getVectorInstrCost(Opcode, ValTy, Index), 2U);
350 }
351
352 return BaseT::getVectorInstrCost(Opcode, ValTy, Index);
353}
354
355int ARMTTIImpl::getCmpSelInstrCost(unsigned Opcode, Type *ValTy, Type *CondTy,
356 const Instruction *I) {
357 int ISD = TLI->InstructionOpcodeToISD(Opcode);
358 // On NEON a vector select gets lowered to vbsl.
359 if (ST->hasNEON() && ValTy->isVectorTy() && ISD == ISD::SELECT) {
1
Assuming the condition is true
12
Assuming 'ISD' is equal to SELECT
13
Taking true branch
360 // Lowering of some vector selects is currently far from perfect.
361 static const TypeConversionCostTblEntry NEONVectorSelectTbl[] = {
362 { ISD::SELECT, MVT::v4i1, MVT::v4i64, 4*4 + 1*2 + 1 },
363 { ISD::SELECT, MVT::v8i1, MVT::v8i64, 50 },
364 { ISD::SELECT, MVT::v16i1, MVT::v16i64, 100 }
365 };
366
367 EVT SelCondTy = TLI->getValueType(DL, CondTy);
14
Passing null pointer value via 2nd parameter 'Ty'
15
Calling 'TargetLoweringBase::getValueType'
368 EVT SelValTy = TLI->getValueType(DL, ValTy);
369 if (SelCondTy.isSimple() && SelValTy.isSimple()) {
370 if (const auto *Entry = ConvertCostTableLookup(NEONVectorSelectTbl, ISD,
371 SelCondTy.getSimpleVT(),
372 SelValTy.getSimpleVT()))
373 return Entry->Cost;
374 }
375
376 std::pair<int, MVT> LT = TLI->getTypeLegalizationCost(DL, ValTy);
377 return LT.first;
378 }
379
380 return BaseT::getCmpSelInstrCost(Opcode, ValTy, CondTy, I);
2
Passing value via 3rd parameter 'CondTy'
3
Calling 'BasicTTIImplBase::getCmpSelInstrCost'
381}
382
383int ARMTTIImpl::getAddressComputationCost(Type *Ty, ScalarEvolution *SE,
384 const SCEV *Ptr) {
385 // Address computations in vectorized code with non-consecutive addresses will
386 // likely result in more instructions compared to scalar code where the
387 // computation can more often be merged into the index mode. The resulting
388 // extra micro-ops can significantly decrease throughput.
389 unsigned NumVectorInstToHideOverhead = 10;
390 int MaxMergeDistance = 64;
391
392 if (Ty->isVectorTy() && SE &&
393 !BaseT::isConstantStridedAccessLessThan(SE, Ptr, MaxMergeDistance + 1))
394 return NumVectorInstToHideOverhead;
395
396 // In many cases the address computation is not merged into the instruction
397 // addressing mode.
398 return 1;
399}
400
401int ARMTTIImpl::getShuffleCost(TTI::ShuffleKind Kind, Type *Tp, int Index,
402 Type *SubTp) {
403 // We only handle costs of reverse and select shuffles for now.
404 if (Kind != TTI::SK_Reverse && Kind != TTI::SK_Select)
405 return BaseT::getShuffleCost(Kind, Tp, Index, SubTp);
406
407 if (Kind == TTI::SK_Reverse) {
408 static const CostTblEntry NEONShuffleTbl[] = {
409 // Reverse shuffle cost one instruction if we are shuffling within a
410 // double word (vrev) or two if we shuffle a quad word (vrev, vext).
411 {ISD::VECTOR_SHUFFLE, MVT::v2i32, 1},
412 {ISD::VECTOR_SHUFFLE, MVT::v2f32, 1},
413 {ISD::VECTOR_SHUFFLE, MVT::v2i64, 1},
414 {ISD::VECTOR_SHUFFLE, MVT::v2f64, 1},
415
416 {ISD::VECTOR_SHUFFLE, MVT::v4i32, 2},
417 {ISD::VECTOR_SHUFFLE, MVT::v4f32, 2},
418 {ISD::VECTOR_SHUFFLE, MVT::v8i16, 2},
419 {ISD::VECTOR_SHUFFLE, MVT::v16i8, 2}};
420
421 std::pair<int, MVT> LT = TLI->getTypeLegalizationCost(DL, Tp);
422
423 if (const auto *Entry = CostTableLookup(NEONShuffleTbl, ISD::VECTOR_SHUFFLE,
424 LT.second))
425 return LT.first * Entry->Cost;
426
427 return BaseT::getShuffleCost(Kind, Tp, Index, SubTp);
428 }
429 if (Kind == TTI::SK_Select) {
430 static const CostTblEntry NEONSelShuffleTbl[] = {
431 // Select shuffle cost table for ARM. Cost is the number of instructions
432 // required to create the shuffled vector.
433
434 {ISD::VECTOR_SHUFFLE, MVT::v2f32, 1},
435 {ISD::VECTOR_SHUFFLE, MVT::v2i64, 1},
436 {ISD::VECTOR_SHUFFLE, MVT::v2f64, 1},
437 {ISD::VECTOR_SHUFFLE, MVT::v2i32, 1},
438
439 {ISD::VECTOR_SHUFFLE, MVT::v4i32, 2},
440 {ISD::VECTOR_SHUFFLE, MVT::v4f32, 2},
441 {ISD::VECTOR_SHUFFLE, MVT::v4i16, 2},
442
443 {ISD::VECTOR_SHUFFLE, MVT::v8i16, 16},
444
445 {ISD::VECTOR_SHUFFLE, MVT::v16i8, 32}};
446
447 std::pair<int, MVT> LT = TLI->getTypeLegalizationCost(DL, Tp);
448 if (const auto *Entry = CostTableLookup(NEONSelShuffleTbl,
449 ISD::VECTOR_SHUFFLE, LT.second))
450 return LT.first * Entry->Cost;
451 return BaseT::getShuffleCost(Kind, Tp, Index, SubTp);
452 }
453 return BaseT::getShuffleCost(Kind, Tp, Index, SubTp);
454}
455
456int ARMTTIImpl::getArithmeticInstrCost(
457 unsigned Opcode, Type *Ty, TTI::OperandValueKind Op1Info,
458 TTI::OperandValueKind Op2Info, TTI::OperandValueProperties Opd1PropInfo,
459 TTI::OperandValueProperties Opd2PropInfo,
460 ArrayRef<const Value *> Args) {
461 int ISDOpcode = TLI->InstructionOpcodeToISD(Opcode);
462 std::pair<int, MVT> LT = TLI->getTypeLegalizationCost(DL, Ty);
463
464 const unsigned FunctionCallDivCost = 20;
465 const unsigned ReciprocalDivCost = 10;
466 static const CostTblEntry CostTbl[] = {
467 // Division.
468 // These costs are somewhat random. Choose a cost of 20 to indicate that
469 // vectorizing devision (added function call) is going to be very expensive.
470 // Double registers types.
471 { ISD::SDIV, MVT::v1i64, 1 * FunctionCallDivCost},
472 { ISD::UDIV, MVT::v1i64, 1 * FunctionCallDivCost},
473 { ISD::SREM, MVT::v1i64, 1 * FunctionCallDivCost},
474 { ISD::UREM, MVT::v1i64, 1 * FunctionCallDivCost},
475 { ISD::SDIV, MVT::v2i32, 2 * FunctionCallDivCost},
476 { ISD::UDIV, MVT::v2i32, 2 * FunctionCallDivCost},
477 { ISD::SREM, MVT::v2i32, 2 * FunctionCallDivCost},
478 { ISD::UREM, MVT::v2i32, 2 * FunctionCallDivCost},
479 { ISD::SDIV, MVT::v4i16, ReciprocalDivCost},
480 { ISD::UDIV, MVT::v4i16, ReciprocalDivCost},
481 { ISD::SREM, MVT::v4i16, 4 * FunctionCallDivCost},
482 { ISD::UREM, MVT::v4i16, 4 * FunctionCallDivCost},
483 { ISD::SDIV, MVT::v8i8, ReciprocalDivCost},
484 { ISD::UDIV, MVT::v8i8, ReciprocalDivCost},
485 { ISD::SREM, MVT::v8i8, 8 * FunctionCallDivCost},
486 { ISD::UREM, MVT::v8i8, 8 * FunctionCallDivCost},
487 // Quad register types.
488 { ISD::SDIV, MVT::v2i64, 2 * FunctionCallDivCost},
489 { ISD::UDIV, MVT::v2i64, 2 * FunctionCallDivCost},
490 { ISD::SREM, MVT::v2i64, 2 * FunctionCallDivCost},
491 { ISD::UREM, MVT::v2i64, 2 * FunctionCallDivCost},
492 { ISD::SDIV, MVT::v4i32, 4 * FunctionCallDivCost},
493 { ISD::UDIV, MVT::v4i32, 4 * FunctionCallDivCost},
494 { ISD::SREM, MVT::v4i32, 4 * FunctionCallDivCost},
495 { ISD::UREM, MVT::v4i32, 4 * FunctionCallDivCost},
496 { ISD::SDIV, MVT::v8i16, 8 * FunctionCallDivCost},
497 { ISD::UDIV, MVT::v8i16, 8 * FunctionCallDivCost},
498 { ISD::SREM, MVT::v8i16, 8 * FunctionCallDivCost},
499 { ISD::UREM, MVT::v8i16, 8 * FunctionCallDivCost},
500 { ISD::SDIV, MVT::v16i8, 16 * FunctionCallDivCost},
501 { ISD::UDIV, MVT::v16i8, 16 * FunctionCallDivCost},
502 { ISD::SREM, MVT::v16i8, 16 * FunctionCallDivCost},
503 { ISD::UREM, MVT::v16i8, 16 * FunctionCallDivCost},
504 // Multiplication.
505 };
506
507 if (ST->hasNEON())
508 if (const auto *Entry = CostTableLookup(CostTbl, ISDOpcode, LT.second))
509 return LT.first * Entry->Cost;
510
511 int Cost = BaseT::getArithmeticInstrCost(Opcode, Ty, Op1Info, Op2Info,
512 Opd1PropInfo, Opd2PropInfo);
513
514 // This is somewhat of a hack. The problem that we are facing is that SROA
515 // creates a sequence of shift, and, or instructions to construct values.
516 // These sequences are recognized by the ISel and have zero-cost. Not so for
517 // the vectorized code. Because we have support for v2i64 but not i64 those
518 // sequences look particularly beneficial to vectorize.
519 // To work around this we increase the cost of v2i64 operations to make them
520 // seem less beneficial.
521 if (LT.second == MVT::v2i64 &&
522 Op2Info == TargetTransformInfo::OK_UniformConstantValue)
523 Cost += 4;
524
525 return Cost;
526}
527
528int ARMTTIImpl::getMemoryOpCost(unsigned Opcode, Type *Src, unsigned Alignment,
529 unsigned AddressSpace, const Instruction *I) {
530 std::pair<int, MVT> LT = TLI->getTypeLegalizationCost(DL, Src);
531
532 if (Src->isVectorTy() && Alignment != 16 &&
533 Src->getVectorElementType()->isDoubleTy()) {
534 // Unaligned loads/stores are extremely inefficient.
535 // We need 4 uops for vst.1/vld.1 vs 1uop for vldr/vstr.
536 return LT.first * 4;
537 }
538 return LT.first;
539}
540
541int ARMTTIImpl::getInterleavedMemoryOpCost(unsigned Opcode, Type *VecTy,
542 unsigned Factor,
543 ArrayRef<unsigned> Indices,
544 unsigned Alignment,
545 unsigned AddressSpace) {
546 assert(Factor >= 2 && "Invalid interleave factor")(static_cast <bool> (Factor >= 2 && "Invalid interleave factor"
) ? void (0) : __assert_fail ("Factor >= 2 && \"Invalid interleave factor\""
, "/build/llvm-toolchain-snapshot-7~svn337103/lib/Target/ARM/ARMTargetTransformInfo.cpp"
, 546, __extension__ __PRETTY_FUNCTION__))
;
547 assert(isa<VectorType>(VecTy) && "Expect a vector type")(static_cast <bool> (isa<VectorType>(VecTy) &&
"Expect a vector type") ? void (0) : __assert_fail ("isa<VectorType>(VecTy) && \"Expect a vector type\""
, "/build/llvm-toolchain-snapshot-7~svn337103/lib/Target/ARM/ARMTargetTransformInfo.cpp"
, 547, __extension__ __PRETTY_FUNCTION__))
;
548
549 // vldN/vstN doesn't support vector types of i64/f64 element.
550 bool EltIs64Bits = DL.getTypeSizeInBits(VecTy->getScalarType()) == 64;
551
552 if (Factor <= TLI->getMaxSupportedInterleaveFactor() && !EltIs64Bits) {
553 unsigned NumElts = VecTy->getVectorNumElements();
554 auto *SubVecTy = VectorType::get(VecTy->getScalarType(), NumElts / Factor);
555
556 // vldN/vstN only support legal vector types of size 64 or 128 in bits.
557 // Accesses having vector types that are a multiple of 128 bits can be
558 // matched to more than one vldN/vstN instruction.
559 if (NumElts % Factor == 0 &&
560 TLI->isLegalInterleavedAccessType(SubVecTy, DL))
561 return Factor * TLI->getNumInterleavedAccesses(SubVecTy, DL);
562 }
563
564 return BaseT::getInterleavedMemoryOpCost(Opcode, VecTy, Factor, Indices,
565 Alignment, AddressSpace);
566}
567
568void ARMTTIImpl::getUnrollingPreferences(Loop *L, ScalarEvolution &SE,
569 TTI::UnrollingPreferences &UP) {
570 // Only currently enable these preferences for M-Class cores.
571 if (!ST->isMClass())
572 return BasicTTIImplBase::getUnrollingPreferences(L, SE, UP);
573
574 // Disable loop unrolling for Oz and Os.
575 UP.OptSizeThreshold = 0;
576 UP.PartialOptSizeThreshold = 0;
577 if (L->getHeader()->getParent()->optForSize())
578 return;
579
580 // Only enable on Thumb-2 targets.
581 if (!ST->isThumb2())
582 return;
583
584 SmallVector<BasicBlock*, 4> ExitingBlocks;
585 L->getExitingBlocks(ExitingBlocks);
586 LLVM_DEBUG(dbgs() << "Loop has:\n"do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("armtti")) { dbgs() << "Loop has:\n" << "Blocks: "
<< L->getNumBlocks() << "\n" << "Exit blocks: "
<< ExitingBlocks.size() << "\n"; } } while (false
)
587 << "Blocks: " << L->getNumBlocks() << "\n"do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("armtti")) { dbgs() << "Loop has:\n" << "Blocks: "
<< L->getNumBlocks() << "\n" << "Exit blocks: "
<< ExitingBlocks.size() << "\n"; } } while (false
)
588 << "Exit blocks: " << ExitingBlocks.size() << "\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("armtti")) { dbgs() << "Loop has:\n" << "Blocks: "
<< L->getNumBlocks() << "\n" << "Exit blocks: "
<< ExitingBlocks.size() << "\n"; } } while (false
)
;
589
590 // Only allow another exit other than the latch. This acts as an early exit
591 // as it mirrors the profitability calculation of the runtime unroller.
592 if (ExitingBlocks.size() > 2)
593 return;
594
595 // Limit the CFG of the loop body for targets with a branch predictor.
596 // Allowing 4 blocks permits if-then-else diamonds in the body.
597 if (ST->hasBranchPredictor() && L->getNumBlocks() > 4)
598 return;
599
600 // Scan the loop: don't unroll loops with calls as this could prevent
601 // inlining.
602 unsigned Cost = 0;
603 for (auto *BB : L->getBlocks()) {
604 for (auto &I : *BB) {
605 if (isa<CallInst>(I) || isa<InvokeInst>(I)) {
606 ImmutableCallSite CS(&I);
607 if (const Function *F = CS.getCalledFunction()) {
608 if (!isLoweredToCall(F))
609 continue;
610 }
611 return;
612 }
613 SmallVector<const Value*, 4> Operands(I.value_op_begin(),
614 I.value_op_end());
615 Cost += getUserCost(&I, Operands);
616 }
617 }
618
619 LLVM_DEBUG(dbgs() << "Cost of loop: " << Cost << "\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("armtti")) { dbgs() << "Cost of loop: " << Cost <<
"\n"; } } while (false)
;
620
621 UP.Partial = true;
622 UP.Runtime = true;
623 UP.UnrollRemainder = true;
624 UP.DefaultUnrollRuntimeCount = 4;
625 UP.UnrollAndJam = true;
626 UP.UnrollAndJamInnerLoopThreshold = 60;
627
628 // Force unrolling small loops can be very useful because of the branch
629 // taken cost of the backedge.
630 if (Cost < 12)
631 UP.Force = true;
632}

/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/BasicTTIImpl.h

1//===- BasicTTIImpl.h -------------------------------------------*- 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/// \file
11/// This file provides a helper that implements much of the TTI interface in
12/// terms of the target-independent code generator and TargetLowering
13/// interfaces.
14//
15//===----------------------------------------------------------------------===//
16
17#ifndef LLVM_CODEGEN_BASICTTIIMPL_H
18#define LLVM_CODEGEN_BASICTTIIMPL_H
19
20#include "llvm/ADT/APInt.h"
21#include "llvm/ADT/ArrayRef.h"
22#include "llvm/ADT/BitVector.h"
23#include "llvm/ADT/SmallPtrSet.h"
24#include "llvm/ADT/SmallVector.h"
25#include "llvm/Analysis/LoopInfo.h"
26#include "llvm/Analysis/TargetTransformInfo.h"
27#include "llvm/Analysis/TargetTransformInfoImpl.h"
28#include "llvm/CodeGen/ISDOpcodes.h"
29#include "llvm/CodeGen/TargetLowering.h"
30#include "llvm/CodeGen/TargetSubtargetInfo.h"
31#include "llvm/CodeGen/ValueTypes.h"
32#include "llvm/IR/BasicBlock.h"
33#include "llvm/IR/CallSite.h"
34#include "llvm/IR/Constant.h"
35#include "llvm/IR/Constants.h"
36#include "llvm/IR/DataLayout.h"
37#include "llvm/IR/DerivedTypes.h"
38#include "llvm/IR/InstrTypes.h"
39#include "llvm/IR/Instruction.h"
40#include "llvm/IR/Instructions.h"
41#include "llvm/IR/Intrinsics.h"
42#include "llvm/IR/Operator.h"
43#include "llvm/IR/Type.h"
44#include "llvm/IR/Value.h"
45#include "llvm/MC/MCSchedule.h"
46#include "llvm/Support/Casting.h"
47#include "llvm/Support/CommandLine.h"
48#include "llvm/Support/ErrorHandling.h"
49#include "llvm/Support/MachineValueType.h"
50#include "llvm/Support/MathExtras.h"
51#include <algorithm>
52#include <cassert>
53#include <cstdint>
54#include <limits>
55#include <utility>
56
57namespace llvm {
58
59class Function;
60class GlobalValue;
61class LLVMContext;
62class ScalarEvolution;
63class SCEV;
64class TargetMachine;
65
66extern cl::opt<unsigned> PartialUnrollingThreshold;
67
68/// Base class which can be used to help build a TTI implementation.
69///
70/// This class provides as much implementation of the TTI interface as is
71/// possible using the target independent parts of the code generator.
72///
73/// In order to subclass it, your class must implement a getST() method to
74/// return the subtarget, and a getTLI() method to return the target lowering.
75/// We need these methods implemented in the derived class so that this class
76/// doesn't have to duplicate storage for them.
77template <typename T>
78class BasicTTIImplBase : public TargetTransformInfoImplCRTPBase<T> {
79private:
80 using BaseT = TargetTransformInfoImplCRTPBase<T>;
81 using TTI = TargetTransformInfo;
82
83 /// Estimate a cost of shuffle as a sequence of extract and insert
84 /// operations.
85 unsigned getPermuteShuffleOverhead(Type *Ty) {
86 assert(Ty->isVectorTy() && "Can only shuffle vectors")(static_cast <bool> (Ty->isVectorTy() && "Can only shuffle vectors"
) ? void (0) : __assert_fail ("Ty->isVectorTy() && \"Can only shuffle vectors\""
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/BasicTTIImpl.h"
, 86, __extension__ __PRETTY_FUNCTION__))
;
87 unsigned Cost = 0;
88 // Shuffle cost is equal to the cost of extracting element from its argument
89 // plus the cost of inserting them onto the result vector.
90
91 // e.g. <4 x float> has a mask of <0,5,2,7> i.e we need to extract from
92 // index 0 of first vector, index 1 of second vector,index 2 of first
93 // vector and finally index 3 of second vector and insert them at index
94 // <0,1,2,3> of result vector.
95 for (int i = 0, e = Ty->getVectorNumElements(); i < e; ++i) {
96 Cost += static_cast<T *>(this)
97 ->getVectorInstrCost(Instruction::InsertElement, Ty, i);
98 Cost += static_cast<T *>(this)
99 ->getVectorInstrCost(Instruction::ExtractElement, Ty, i);
100 }
101 return Cost;
102 }
103
104 /// Local query method delegates up to T which *must* implement this!
105 const TargetSubtargetInfo *getST() const {
106 return static_cast<const T *>(this)->getST();
107 }
108
109 /// Local query method delegates up to T which *must* implement this!
110 const TargetLoweringBase *getTLI() const {
111 return static_cast<const T *>(this)->getTLI();
112 }
113
114 static ISD::MemIndexedMode getISDIndexedMode(TTI::MemIndexedMode M) {
115 switch (M) {
116 case TTI::MIM_Unindexed:
117 return ISD::UNINDEXED;
118 case TTI::MIM_PreInc:
119 return ISD::PRE_INC;
120 case TTI::MIM_PreDec:
121 return ISD::PRE_DEC;
122 case TTI::MIM_PostInc:
123 return ISD::POST_INC;
124 case TTI::MIM_PostDec:
125 return ISD::POST_DEC;
126 }
127 llvm_unreachable("Unexpected MemIndexedMode")::llvm::llvm_unreachable_internal("Unexpected MemIndexedMode"
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/BasicTTIImpl.h"
, 127)
;
128 }
129
130protected:
131 explicit BasicTTIImplBase(const TargetMachine *TM, const DataLayout &DL)
132 : BaseT(DL) {}
133
134 using TargetTransformInfoImplBase::DL;
135
136public:
137 /// \name Scalar TTI Implementations
138 /// @{
139 bool allowsMisalignedMemoryAccesses(LLVMContext &Context,
140 unsigned BitWidth, unsigned AddressSpace,
141 unsigned Alignment, bool *Fast) const {
142 EVT E = EVT::getIntegerVT(Context, BitWidth);
143 return getTLI()->allowsMisalignedMemoryAccesses(E, AddressSpace, Alignment, Fast);
144 }
145
146 bool hasBranchDivergence() { return false; }
147
148 bool isSourceOfDivergence(const Value *V) { return false; }
149
150 bool isAlwaysUniform(const Value *V) { return false; }
151
152 unsigned getFlatAddressSpace() {
153 // Return an invalid address space.
154 return -1;
155 }
156
157 bool isLegalAddImmediate(int64_t imm) {
158 return getTLI()->isLegalAddImmediate(imm);
159 }
160
161 bool isLegalICmpImmediate(int64_t imm) {
162 return getTLI()->isLegalICmpImmediate(imm);
163 }
164
165 bool isLegalAddressingMode(Type *Ty, GlobalValue *BaseGV, int64_t BaseOffset,
166 bool HasBaseReg, int64_t Scale,
167 unsigned AddrSpace, Instruction *I = nullptr) {
168 TargetLoweringBase::AddrMode AM;
169 AM.BaseGV = BaseGV;
170 AM.BaseOffs = BaseOffset;
171 AM.HasBaseReg = HasBaseReg;
172 AM.Scale = Scale;
173 return getTLI()->isLegalAddressingMode(DL, AM, Ty, AddrSpace, I);
174 }
175
176 bool isIndexedLoadLegal(TTI::MemIndexedMode M, Type *Ty,
177 const DataLayout &DL) const {
178 EVT VT = getTLI()->getValueType(DL, Ty);
179 return getTLI()->isIndexedLoadLegal(getISDIndexedMode(M), VT);
180 }
181
182 bool isIndexedStoreLegal(TTI::MemIndexedMode M, Type *Ty,
183 const DataLayout &DL) const {
184 EVT VT = getTLI()->getValueType(DL, Ty);
185 return getTLI()->isIndexedStoreLegal(getISDIndexedMode(M), VT);
186 }
187
188 bool isLSRCostLess(TTI::LSRCost C1, TTI::LSRCost C2) {
189 return TargetTransformInfoImplBase::isLSRCostLess(C1, C2);
190 }
191
192 int getScalingFactorCost(Type *Ty, GlobalValue *BaseGV, int64_t BaseOffset,
193 bool HasBaseReg, int64_t Scale, unsigned AddrSpace) {
194 TargetLoweringBase::AddrMode AM;
195 AM.BaseGV = BaseGV;
196 AM.BaseOffs = BaseOffset;
197 AM.HasBaseReg = HasBaseReg;
198 AM.Scale = Scale;
199 return getTLI()->getScalingFactorCost(DL, AM, Ty, AddrSpace);
200 }
201
202 bool isTruncateFree(Type *Ty1, Type *Ty2) {
203 return getTLI()->isTruncateFree(Ty1, Ty2);
204 }
205
206 bool isProfitableToHoist(Instruction *I) {
207 return getTLI()->isProfitableToHoist(I);
208 }
209
210 bool useAA() const { return getST()->useAA(); }
211
212 bool isTypeLegal(Type *Ty) {
213 EVT VT = getTLI()->getValueType(DL, Ty);
214 return getTLI()->isTypeLegal(VT);
215 }
216
217 int getGEPCost(Type *PointeeType, const Value *Ptr,
218 ArrayRef<const Value *> Operands) {
219 return BaseT::getGEPCost(PointeeType, Ptr, Operands);
220 }
221
222 int getExtCost(const Instruction *I, const Value *Src) {
223 if (getTLI()->isExtFree(I))
224 return TargetTransformInfo::TCC_Free;
225
226 if (isa<ZExtInst>(I) || isa<SExtInst>(I))
227 if (const LoadInst *LI = dyn_cast<LoadInst>(Src))
228 if (getTLI()->isExtLoad(LI, I, DL))
229 return TargetTransformInfo::TCC_Free;
230
231 return TargetTransformInfo::TCC_Basic;
232 }
233
234 unsigned getIntrinsicCost(Intrinsic::ID IID, Type *RetTy,
235 ArrayRef<const Value *> Arguments) {
236 return BaseT::getIntrinsicCost(IID, RetTy, Arguments);
237 }
238
239 unsigned getIntrinsicCost(Intrinsic::ID IID, Type *RetTy,
240 ArrayRef<Type *> ParamTys) {
241 if (IID == Intrinsic::cttz) {
242 if (getTLI()->isCheapToSpeculateCttz())
243 return TargetTransformInfo::TCC_Basic;
244 return TargetTransformInfo::TCC_Expensive;
245 }
246
247 if (IID == Intrinsic::ctlz) {
248 if (getTLI()->isCheapToSpeculateCtlz())
249 return TargetTransformInfo::TCC_Basic;
250 return TargetTransformInfo::TCC_Expensive;
251 }
252
253 return BaseT::getIntrinsicCost(IID, RetTy, ParamTys);
254 }
255
256 unsigned getEstimatedNumberOfCaseClusters(const SwitchInst &SI,
257 unsigned &JumpTableSize) {
258 /// Try to find the estimated number of clusters. Note that the number of
259 /// clusters identified in this function could be different from the actural
260 /// numbers found in lowering. This function ignore switches that are
261 /// lowered with a mix of jump table / bit test / BTree. This function was
262 /// initially intended to be used when estimating the cost of switch in
263 /// inline cost heuristic, but it's a generic cost model to be used in other
264 /// places (e.g., in loop unrolling).
265 unsigned N = SI.getNumCases();
266 const TargetLoweringBase *TLI = getTLI();
267 const DataLayout &DL = this->getDataLayout();
268
269 JumpTableSize = 0;
270 bool IsJTAllowed = TLI->areJTsAllowed(SI.getParent()->getParent());
271
272 // Early exit if both a jump table and bit test are not allowed.
273 if (N < 1 || (!IsJTAllowed && DL.getIndexSizeInBits(0u) < N))
274 return N;
275
276 APInt MaxCaseVal = SI.case_begin()->getCaseValue()->getValue();
277 APInt MinCaseVal = MaxCaseVal;
278 for (auto CI : SI.cases()) {
279 const APInt &CaseVal = CI.getCaseValue()->getValue();
280 if (CaseVal.sgt(MaxCaseVal))
281 MaxCaseVal = CaseVal;
282 if (CaseVal.slt(MinCaseVal))
283 MinCaseVal = CaseVal;
284 }
285
286 // Check if suitable for a bit test
287 if (N <= DL.getIndexSizeInBits(0u)) {
288 SmallPtrSet<const BasicBlock *, 4> Dests;
289 for (auto I : SI.cases())
290 Dests.insert(I.getCaseSuccessor());
291
292 if (TLI->isSuitableForBitTests(Dests.size(), N, MinCaseVal, MaxCaseVal,
293 DL))
294 return 1;
295 }
296
297 // Check if suitable for a jump table.
298 if (IsJTAllowed) {
299 if (N < 2 || N < TLI->getMinimumJumpTableEntries())
300 return N;
301 uint64_t Range =
302 (MaxCaseVal - MinCaseVal)
303 .getLimitedValue(std::numeric_limits<uint64_t>::max() - 1) + 1;
304 // Check whether a range of clusters is dense enough for a jump table
305 if (TLI->isSuitableForJumpTable(&SI, N, Range)) {
306 JumpTableSize = Range;
307 return 1;
308 }
309 }
310 return N;
311 }
312
313 unsigned getJumpBufAlignment() { return getTLI()->getJumpBufAlignment(); }
314
315 unsigned getJumpBufSize() { return getTLI()->getJumpBufSize(); }
316
317 bool shouldBuildLookupTables() {
318 const TargetLoweringBase *TLI = getTLI();
319 return TLI->isOperationLegalOrCustom(ISD::BR_JT, MVT::Other) ||
320 TLI->isOperationLegalOrCustom(ISD::BRIND, MVT::Other);
321 }
322
323 bool haveFastSqrt(Type *Ty) {
324 const TargetLoweringBase *TLI = getTLI();
325 EVT VT = TLI->getValueType(DL, Ty);
326 return TLI->isTypeLegal(VT) &&
327 TLI->isOperationLegalOrCustom(ISD::FSQRT, VT);
328 }
329
330 bool isFCmpOrdCheaperThanFCmpZero(Type *Ty) {
331 return true;
332 }
333
334 unsigned getFPOpCost(Type *Ty) {
335 // Check whether FADD is available, as a proxy for floating-point in
336 // general.
337 const TargetLoweringBase *TLI = getTLI();
338 EVT VT = TLI->getValueType(DL, Ty);
339 if (TLI->isOperationLegalOrCustomOrPromote(ISD::FADD, VT))
340 return TargetTransformInfo::TCC_Basic;
341 return TargetTransformInfo::TCC_Expensive;
342 }
343
344 unsigned getOperationCost(unsigned Opcode, Type *Ty, Type *OpTy) {
345 const TargetLoweringBase *TLI = getTLI();
346 switch (Opcode) {
347 default: break;
348 case Instruction::Trunc:
349 if (TLI->isTruncateFree(OpTy, Ty))
350 return TargetTransformInfo::TCC_Free;
351 return TargetTransformInfo::TCC_Basic;
352 case Instruction::ZExt:
353 if (TLI->isZExtFree(OpTy, Ty))
354 return TargetTransformInfo::TCC_Free;
355 return TargetTransformInfo::TCC_Basic;
356 }
357
358 return BaseT::getOperationCost(Opcode, Ty, OpTy);
359 }
360
361 unsigned getInliningThresholdMultiplier() { return 1; }
362
363 void getUnrollingPreferences(Loop *L, ScalarEvolution &SE,
364 TTI::UnrollingPreferences &UP) {
365 // This unrolling functionality is target independent, but to provide some
366 // motivation for its intended use, for x86:
367
368 // According to the Intel 64 and IA-32 Architectures Optimization Reference
369 // Manual, Intel Core models and later have a loop stream detector (and
370 // associated uop queue) that can benefit from partial unrolling.
371 // The relevant requirements are:
372 // - The loop must have no more than 4 (8 for Nehalem and later) branches
373 // taken, and none of them may be calls.
374 // - The loop can have no more than 18 (28 for Nehalem and later) uops.
375
376 // According to the Software Optimization Guide for AMD Family 15h
377 // Processors, models 30h-4fh (Steamroller and later) have a loop predictor
378 // and loop buffer which can benefit from partial unrolling.
379 // The relevant requirements are:
380 // - The loop must have fewer than 16 branches
381 // - The loop must have less than 40 uops in all executed loop branches
382
383 // The number of taken branches in a loop is hard to estimate here, and
384 // benchmarking has revealed that it is better not to be conservative when
385 // estimating the branch count. As a result, we'll ignore the branch limits
386 // until someone finds a case where it matters in practice.
387
388 unsigned MaxOps;
389 const TargetSubtargetInfo *ST = getST();
390 if (PartialUnrollingThreshold.getNumOccurrences() > 0)
391 MaxOps = PartialUnrollingThreshold;
392 else if (ST->getSchedModel().LoopMicroOpBufferSize > 0)
393 MaxOps = ST->getSchedModel().LoopMicroOpBufferSize;
394 else
395 return;
396
397 // Scan the loop: don't unroll loops with calls.
398 for (Loop::block_iterator I = L->block_begin(), E = L->block_end(); I != E;
399 ++I) {
400 BasicBlock *BB = *I;
401
402 for (BasicBlock::iterator J = BB->begin(), JE = BB->end(); J != JE; ++J)
403 if (isa<CallInst>(J) || isa<InvokeInst>(J)) {
404 ImmutableCallSite CS(&*J);
405 if (const Function *F = CS.getCalledFunction()) {
406 if (!static_cast<T *>(this)->isLoweredToCall(F))
407 continue;
408 }
409
410 return;
411 }
412 }
413
414 // Enable runtime and partial unrolling up to the specified size.
415 // Enable using trip count upper bound to unroll loops.
416 UP.Partial = UP.Runtime = UP.UpperBound = true;
417 UP.PartialThreshold = MaxOps;
418
419 // Avoid unrolling when optimizing for size.
420 UP.OptSizeThreshold = 0;
421 UP.PartialOptSizeThreshold = 0;
422
423 // Set number of instructions optimized when "back edge"
424 // becomes "fall through" to default value of 2.
425 UP.BEInsns = 2;
426 }
427
428 int getInstructionLatency(const Instruction *I) {
429 if (isa<LoadInst>(I))
430 return getST()->getSchedModel().DefaultLoadLatency;
431
432 return BaseT::getInstructionLatency(I);
433 }
434
435 /// @}
436
437 /// \name Vector TTI Implementations
438 /// @{
439
440 unsigned getNumberOfRegisters(bool Vector) { return Vector ? 0 : 1; }
441
442 unsigned getRegisterBitWidth(bool Vector) const { return 32; }
443
444 /// Estimate the overhead of scalarizing an instruction. Insert and Extract
445 /// are set if the result needs to be inserted and/or extracted from vectors.
446 unsigned getScalarizationOverhead(Type *Ty, bool Insert, bool Extract) {
447 assert(Ty->isVectorTy() && "Can only scalarize vectors")(static_cast <bool> (Ty->isVectorTy() && "Can only scalarize vectors"
) ? void (0) : __assert_fail ("Ty->isVectorTy() && \"Can only scalarize vectors\""
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/BasicTTIImpl.h"
, 447, __extension__ __PRETTY_FUNCTION__))
;
448 unsigned Cost = 0;
449
450 for (int i = 0, e = Ty->getVectorNumElements(); i < e; ++i) {
451 if (Insert)
452 Cost += static_cast<T *>(this)
453 ->getVectorInstrCost(Instruction::InsertElement, Ty, i);
454 if (Extract)
455 Cost += static_cast<T *>(this)
456 ->getVectorInstrCost(Instruction::ExtractElement, Ty, i);
457 }
458
459 return Cost;
460 }
461
462 /// Estimate the overhead of scalarizing an instructions unique
463 /// non-constant operands. The types of the arguments are ordinarily
464 /// scalar, in which case the costs are multiplied with VF.
465 unsigned getOperandsScalarizationOverhead(ArrayRef<const Value *> Args,
466 unsigned VF) {
467 unsigned Cost = 0;
468 SmallPtrSet<const Value*, 4> UniqueOperands;
469 for (const Value *A : Args) {
470 if (!isa<Constant>(A) && UniqueOperands.insert(A).second) {
471 Type *VecTy = nullptr;
472 if (A->getType()->isVectorTy()) {
473 VecTy = A->getType();
474 // If A is a vector operand, VF should be 1 or correspond to A.
475 assert((VF == 1 || VF == VecTy->getVectorNumElements()) &&(static_cast <bool> ((VF == 1 || VF == VecTy->getVectorNumElements
()) && "Vector argument does not match VF") ? void (0
) : __assert_fail ("(VF == 1 || VF == VecTy->getVectorNumElements()) && \"Vector argument does not match VF\""
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/BasicTTIImpl.h"
, 476, __extension__ __PRETTY_FUNCTION__))
476 "Vector argument does not match VF")(static_cast <bool> ((VF == 1 || VF == VecTy->getVectorNumElements
()) && "Vector argument does not match VF") ? void (0
) : __assert_fail ("(VF == 1 || VF == VecTy->getVectorNumElements()) && \"Vector argument does not match VF\""
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/BasicTTIImpl.h"
, 476, __extension__ __PRETTY_FUNCTION__))
;
477 }
478 else
479 VecTy = VectorType::get(A->getType(), VF);
480
481 Cost += getScalarizationOverhead(VecTy, false, true);
482 }
483 }
484
485 return Cost;
486 }
487
488 unsigned getScalarizationOverhead(Type *VecTy, ArrayRef<const Value *> Args) {
489 assert(VecTy->isVectorTy())(static_cast <bool> (VecTy->isVectorTy()) ? void (0)
: __assert_fail ("VecTy->isVectorTy()", "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/BasicTTIImpl.h"
, 489, __extension__ __PRETTY_FUNCTION__))
;
490
491 unsigned Cost = 0;
492
493 Cost += getScalarizationOverhead(VecTy, true, false);
494 if (!Args.empty())
495 Cost += getOperandsScalarizationOverhead(Args,
496 VecTy->getVectorNumElements());
497 else
498 // When no information on arguments is provided, we add the cost
499 // associated with one argument as a heuristic.
500 Cost += getScalarizationOverhead(VecTy, false, true);
501
502 return Cost;
503 }
504
505 unsigned getMaxInterleaveFactor(unsigned VF) { return 1; }
506
507 unsigned getArithmeticInstrCost(
508 unsigned Opcode, Type *Ty,
509 TTI::OperandValueKind Opd1Info = TTI::OK_AnyValue,
510 TTI::OperandValueKind Opd2Info = TTI::OK_AnyValue,
511 TTI::OperandValueProperties Opd1PropInfo = TTI::OP_None,
512 TTI::OperandValueProperties Opd2PropInfo = TTI::OP_None,
513 ArrayRef<const Value *> Args = ArrayRef<const Value *>()) {
514 // Check if any of the operands are vector operands.
515 const TargetLoweringBase *TLI = getTLI();
516 int ISD = TLI->InstructionOpcodeToISD(Opcode);
517 assert(ISD && "Invalid opcode")(static_cast <bool> (ISD && "Invalid opcode") ?
void (0) : __assert_fail ("ISD && \"Invalid opcode\""
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/BasicTTIImpl.h"
, 517, __extension__ __PRETTY_FUNCTION__))
;
518
519 std::pair<unsigned, MVT> LT = TLI->getTypeLegalizationCost(DL, Ty);
520
521 bool IsFloat = Ty->isFPOrFPVectorTy();
522 // Assume that floating point arithmetic operations cost twice as much as
523 // integer operations.
524 unsigned OpCost = (IsFloat ? 2 : 1);
525
526 if (TLI->isOperationLegalOrPromote(ISD, LT.second)) {
527 // The operation is legal. Assume it costs 1.
528 // TODO: Once we have extract/insert subvector cost we need to use them.
529 return LT.first * OpCost;
530 }
531
532 if (!TLI->isOperationExpand(ISD, LT.second)) {
533 // If the operation is custom lowered, then assume that the code is twice
534 // as expensive.
535 return LT.first * 2 * OpCost;
536 }
537
538 // Else, assume that we need to scalarize this op.
539 // TODO: If one of the types get legalized by splitting, handle this
540 // similarly to what getCastInstrCost() does.
541 if (Ty->isVectorTy()) {
542 unsigned Num = Ty->getVectorNumElements();
543 unsigned Cost = static_cast<T *>(this)
544 ->getArithmeticInstrCost(Opcode, Ty->getScalarType());
545 // Return the cost of multiple scalar invocation plus the cost of
546 // inserting and extracting the values.
547 return getScalarizationOverhead(Ty, Args) + Num * Cost;
548 }
549
550 // We don't know anything about this scalar instruction.
551 return OpCost;
552 }
553
554 unsigned getShuffleCost(TTI::ShuffleKind Kind, Type *Tp, int Index,
555 Type *SubTp) {
556 switch (Kind) {
557 case TTI::SK_Select:
558 case TTI::SK_Transpose:
559 case TTI::SK_PermuteSingleSrc:
560 case TTI::SK_PermuteTwoSrc:
561 return getPermuteShuffleOverhead(Tp);
562 default:
563 return 1;
564 }
565 }
566
567 unsigned getCastInstrCost(unsigned Opcode, Type *Dst, Type *Src,
568 const Instruction *I = nullptr) {
569 const TargetLoweringBase *TLI = getTLI();
570 int ISD = TLI->InstructionOpcodeToISD(Opcode);
571 assert(ISD && "Invalid opcode")(static_cast <bool> (ISD && "Invalid opcode") ?
void (0) : __assert_fail ("ISD && \"Invalid opcode\""
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/BasicTTIImpl.h"
, 571, __extension__ __PRETTY_FUNCTION__))
;
572 std::pair<unsigned, MVT> SrcLT = TLI->getTypeLegalizationCost(DL, Src);
573 std::pair<unsigned, MVT> DstLT = TLI->getTypeLegalizationCost(DL, Dst);
574
575 // Check for NOOP conversions.
576 if (SrcLT.first == DstLT.first &&
577 SrcLT.second.getSizeInBits() == DstLT.second.getSizeInBits()) {
578
579 // Bitcast between types that are legalized to the same type are free.
580 if (Opcode == Instruction::BitCast || Opcode == Instruction::Trunc)
581 return 0;
582 }
583
584 if (Opcode == Instruction::Trunc &&
585 TLI->isTruncateFree(SrcLT.second, DstLT.second))
586 return 0;
587
588 if (Opcode == Instruction::ZExt &&
589 TLI->isZExtFree(SrcLT.second, DstLT.second))
590 return 0;
591
592 if (Opcode == Instruction::AddrSpaceCast &&
593 TLI->isNoopAddrSpaceCast(Src->getPointerAddressSpace(),
594 Dst->getPointerAddressSpace()))
595 return 0;
596
597 // If this is a zext/sext of a load, return 0 if the corresponding
598 // extending load exists on target.
599 if ((Opcode == Instruction::ZExt || Opcode == Instruction::SExt) &&
600 I && isa<LoadInst>(I->getOperand(0))) {
601 EVT ExtVT = EVT::getEVT(Dst);
602 EVT LoadVT = EVT::getEVT(Src);
603 unsigned LType =
604 ((Opcode == Instruction::ZExt) ? ISD::ZEXTLOAD : ISD::SEXTLOAD);
605 if (TLI->isLoadExtLegal(LType, ExtVT, LoadVT))
606 return 0;
607 }
608
609 // If the cast is marked as legal (or promote) then assume low cost.
610 if (SrcLT.first == DstLT.first &&
611 TLI->isOperationLegalOrPromote(ISD, DstLT.second))
612 return 1;
613
614 // Handle scalar conversions.
615 if (!Src->isVectorTy() && !Dst->isVectorTy()) {
616 // Scalar bitcasts are usually free.
617 if (Opcode == Instruction::BitCast)
618 return 0;
619
620 // Just check the op cost. If the operation is legal then assume it costs
621 // 1.
622 if (!TLI->isOperationExpand(ISD, DstLT.second))
623 return 1;
624
625 // Assume that illegal scalar instruction are expensive.
626 return 4;
627 }
628
629 // Check vector-to-vector casts.
630 if (Dst->isVectorTy() && Src->isVectorTy()) {
631 // If the cast is between same-sized registers, then the check is simple.
632 if (SrcLT.first == DstLT.first &&
633 SrcLT.second.getSizeInBits() == DstLT.second.getSizeInBits()) {
634
635 // Assume that Zext is done using AND.
636 if (Opcode == Instruction::ZExt)
637 return 1;
638
639 // Assume that sext is done using SHL and SRA.
640 if (Opcode == Instruction::SExt)
641 return 2;
642
643 // Just check the op cost. If the operation is legal then assume it
644 // costs
645 // 1 and multiply by the type-legalization overhead.
646 if (!TLI->isOperationExpand(ISD, DstLT.second))
647 return SrcLT.first * 1;
648 }
649
650 // If we are legalizing by splitting, query the concrete TTI for the cost
651 // of casting the original vector twice. We also need to factor in the
652 // cost of the split itself. Count that as 1, to be consistent with
653 // TLI->getTypeLegalizationCost().
654 if ((TLI->getTypeAction(Src->getContext(), TLI->getValueType(DL, Src)) ==
655 TargetLowering::TypeSplitVector) ||
656 (TLI->getTypeAction(Dst->getContext(), TLI->getValueType(DL, Dst)) ==
657 TargetLowering::TypeSplitVector)) {
658 Type *SplitDst = VectorType::get(Dst->getVectorElementType(),
659 Dst->getVectorNumElements() / 2);
660 Type *SplitSrc = VectorType::get(Src->getVectorElementType(),
661 Src->getVectorNumElements() / 2);
662 T *TTI = static_cast<T *>(this);
663 return TTI->getVectorSplitCost() +
664 (2 * TTI->getCastInstrCost(Opcode, SplitDst, SplitSrc, I));
665 }
666
667 // In other cases where the source or destination are illegal, assume
668 // the operation will get scalarized.
669 unsigned Num = Dst->getVectorNumElements();
670 unsigned Cost = static_cast<T *>(this)->getCastInstrCost(
671 Opcode, Dst->getScalarType(), Src->getScalarType(), I);
672
673 // Return the cost of multiple scalar invocation plus the cost of
674 // inserting and extracting the values.
675 return getScalarizationOverhead(Dst, true, true) + Num * Cost;
676 }
677
678 // We already handled vector-to-vector and scalar-to-scalar conversions.
679 // This
680 // is where we handle bitcast between vectors and scalars. We need to assume
681 // that the conversion is scalarized in one way or another.
682 if (Opcode == Instruction::BitCast)
683 // Illegal bitcasts are done by storing and loading from a stack slot.
684 return (Src->isVectorTy() ? getScalarizationOverhead(Src, false, true)
685 : 0) +
686 (Dst->isVectorTy() ? getScalarizationOverhead(Dst, true, false)
687 : 0);
688
689 llvm_unreachable("Unhandled cast")::llvm::llvm_unreachable_internal("Unhandled cast", "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/BasicTTIImpl.h"
, 689)
;
690 }
691
692 unsigned getExtractWithExtendCost(unsigned Opcode, Type *Dst,
693 VectorType *VecTy, unsigned Index) {
694 return static_cast<T *>(this)->getVectorInstrCost(
695 Instruction::ExtractElement, VecTy, Index) +
696 static_cast<T *>(this)->getCastInstrCost(Opcode, Dst,
697 VecTy->getElementType());
698 }
699
700 unsigned getCFInstrCost(unsigned Opcode) {
701 // Branches are assumed to be predicted.
702 return 0;
703 }
704
705 unsigned getCmpSelInstrCost(unsigned Opcode, Type *ValTy, Type *CondTy,
706 const Instruction *I) {
707 const TargetLoweringBase *TLI = getTLI();
708 int ISD = TLI->InstructionOpcodeToISD(Opcode);
709 assert(ISD && "Invalid opcode")(static_cast <bool> (ISD && "Invalid opcode") ?
void (0) : __assert_fail ("ISD && \"Invalid opcode\""
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/BasicTTIImpl.h"
, 709, __extension__ __PRETTY_FUNCTION__))
;
710
711 // Selects on vectors are actually vector selects.
712 if (ISD == ISD::SELECT) {
4
Assuming 'ISD' is not equal to SELECT
5
Taking false branch
713 assert(CondTy && "CondTy must exist")(static_cast <bool> (CondTy && "CondTy must exist"
) ? void (0) : __assert_fail ("CondTy && \"CondTy must exist\""
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/BasicTTIImpl.h"
, 713, __extension__ __PRETTY_FUNCTION__))
;
714 if (CondTy->isVectorTy())
715 ISD = ISD::VSELECT;
716 }
717 std::pair<unsigned, MVT> LT = TLI->getTypeLegalizationCost(DL, ValTy);
718
719 if (!(ValTy->isVectorTy() && !LT.second.isVector()) &&
6
Taking false branch
720 !TLI->isOperationExpand(ISD, LT.second)) {
721 // The operation is legal. Assume it costs 1. Multiply
722 // by the type-legalization overhead.
723 return LT.first * 1;
724 }
725
726 // Otherwise, assume that the cast is scalarized.
727 // TODO: If one of the types get legalized by splitting, handle this
728 // similarly to what getCastInstrCost() does.
729 if (ValTy->isVectorTy()) {
7
Taking true branch
730 unsigned Num = ValTy->getVectorNumElements();
731 if (CondTy)
8
Assuming 'CondTy' is null
9
Taking false branch
732 CondTy = CondTy->getScalarType();
733 unsigned Cost = static_cast<T *>(this)->getCmpSelInstrCost(
11
Calling 'ARMTTIImpl::getCmpSelInstrCost'
734 Opcode, ValTy->getScalarType(), CondTy, I);
10
Passing null pointer value via 3rd parameter 'CondTy'
735
736 // Return the cost of multiple scalar invocation plus the cost of
737 // inserting and extracting the values.
738 return getScalarizationOverhead(ValTy, true, false) + Num * Cost;
739 }
740
741 // Unknown scalar opcode.
742 return 1;
743 }
744
745 unsigned getVectorInstrCost(unsigned Opcode, Type *Val, unsigned Index) {
746 std::pair<unsigned, MVT> LT =
747 getTLI()->getTypeLegalizationCost(DL, Val->getScalarType());
748
749 return LT.first;
750 }
751
752 unsigned getMemoryOpCost(unsigned Opcode, Type *Src, unsigned Alignment,
753 unsigned AddressSpace, const Instruction *I = nullptr) {
754 assert(!Src->isVoidTy() && "Invalid type")(static_cast <bool> (!Src->isVoidTy() && "Invalid type"
) ? void (0) : __assert_fail ("!Src->isVoidTy() && \"Invalid type\""
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/BasicTTIImpl.h"
, 754, __extension__ __PRETTY_FUNCTION__))
;
755 std::pair<unsigned, MVT> LT = getTLI()->getTypeLegalizationCost(DL, Src);
756
757 // Assuming that all loads of legal types cost 1.
758 unsigned Cost = LT.first;
759
760 if (Src->isVectorTy() &&
761 Src->getPrimitiveSizeInBits() < LT.second.getSizeInBits()) {
762 // This is a vector load that legalizes to a larger type than the vector
763 // itself. Unless the corresponding extending load or truncating store is
764 // legal, then this will scalarize.
765 TargetLowering::LegalizeAction LA = TargetLowering::Expand;
766 EVT MemVT = getTLI()->getValueType(DL, Src);
767 if (Opcode == Instruction::Store)
768 LA = getTLI()->getTruncStoreAction(LT.second, MemVT);
769 else
770 LA = getTLI()->getLoadExtAction(ISD::EXTLOAD, LT.second, MemVT);
771
772 if (LA != TargetLowering::Legal && LA != TargetLowering::Custom) {
773 // This is a vector load/store for some illegal type that is scalarized.
774 // We must account for the cost of building or decomposing the vector.
775 Cost += getScalarizationOverhead(Src, Opcode != Instruction::Store,
776 Opcode == Instruction::Store);
777 }
778 }
779
780 return Cost;
781 }
782
783 unsigned getInterleavedMemoryOpCost(unsigned Opcode, Type *VecTy,
784 unsigned Factor,
785 ArrayRef<unsigned> Indices,
786 unsigned Alignment,
787 unsigned AddressSpace) {
788 VectorType *VT = dyn_cast<VectorType>(VecTy);
789 assert(VT && "Expect a vector type for interleaved memory op")(static_cast <bool> (VT && "Expect a vector type for interleaved memory op"
) ? void (0) : __assert_fail ("VT && \"Expect a vector type for interleaved memory op\""
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/BasicTTIImpl.h"
, 789, __extension__ __PRETTY_FUNCTION__))
;
790
791 unsigned NumElts = VT->getNumElements();
792 assert(Factor > 1 && NumElts % Factor == 0 && "Invalid interleave factor")(static_cast <bool> (Factor > 1 && NumElts %
Factor == 0 && "Invalid interleave factor") ? void (
0) : __assert_fail ("Factor > 1 && NumElts % Factor == 0 && \"Invalid interleave factor\""
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/BasicTTIImpl.h"
, 792, __extension__ __PRETTY_FUNCTION__))
;
793
794 unsigned NumSubElts = NumElts / Factor;
795 VectorType *SubVT = VectorType::get(VT->getElementType(), NumSubElts);
796
797 // Firstly, the cost of load/store operation.
798 unsigned Cost = static_cast<T *>(this)->getMemoryOpCost(
799 Opcode, VecTy, Alignment, AddressSpace);
800
801 // Legalize the vector type, and get the legalized and unlegalized type
802 // sizes.
803 MVT VecTyLT = getTLI()->getTypeLegalizationCost(DL, VecTy).second;
804 unsigned VecTySize =
805 static_cast<T *>(this)->getDataLayout().getTypeStoreSize(VecTy);
806 unsigned VecTyLTSize = VecTyLT.getStoreSize();
807
808 // Return the ceiling of dividing A by B.
809 auto ceil = [](unsigned A, unsigned B) { return (A + B - 1) / B; };
810
811 // Scale the cost of the memory operation by the fraction of legalized
812 // instructions that will actually be used. We shouldn't account for the
813 // cost of dead instructions since they will be removed.
814 //
815 // E.g., An interleaved load of factor 8:
816 // %vec = load <16 x i64>, <16 x i64>* %ptr
817 // %v0 = shufflevector %vec, undef, <0, 8>
818 //
819 // If <16 x i64> is legalized to 8 v2i64 loads, only 2 of the loads will be
820 // used (those corresponding to elements [0:1] and [8:9] of the unlegalized
821 // type). The other loads are unused.
822 //
823 // We only scale the cost of loads since interleaved store groups aren't
824 // allowed to have gaps.
825 if (Opcode == Instruction::Load && VecTySize > VecTyLTSize) {
826 // The number of loads of a legal type it will take to represent a load
827 // of the unlegalized vector type.
828 unsigned NumLegalInsts = ceil(VecTySize, VecTyLTSize);
829
830 // The number of elements of the unlegalized type that correspond to a
831 // single legal instruction.
832 unsigned NumEltsPerLegalInst = ceil(NumElts, NumLegalInsts);
833
834 // Determine which legal instructions will be used.
835 BitVector UsedInsts(NumLegalInsts, false);
836 for (unsigned Index : Indices)
837 for (unsigned Elt = 0; Elt < NumSubElts; ++Elt)
838 UsedInsts.set((Index + Elt * Factor) / NumEltsPerLegalInst);
839
840 // Scale the cost of the load by the fraction of legal instructions that
841 // will be used.
842 Cost *= UsedInsts.count() / NumLegalInsts;
843 }
844
845 // Then plus the cost of interleave operation.
846 if (Opcode == Instruction::Load) {
847 // The interleave cost is similar to extract sub vectors' elements
848 // from the wide vector, and insert them into sub vectors.
849 //
850 // E.g. An interleaved load of factor 2 (with one member of index 0):
851 // %vec = load <8 x i32>, <8 x i32>* %ptr
852 // %v0 = shuffle %vec, undef, <0, 2, 4, 6> ; Index 0
853 // The cost is estimated as extract elements at 0, 2, 4, 6 from the
854 // <8 x i32> vector and insert them into a <4 x i32> vector.
855
856 assert(Indices.size() <= Factor &&(static_cast <bool> (Indices.size() <= Factor &&
"Interleaved memory op has too many members") ? void (0) : __assert_fail
("Indices.size() <= Factor && \"Interleaved memory op has too many members\""
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/BasicTTIImpl.h"
, 857, __extension__ __PRETTY_FUNCTION__))
857 "Interleaved memory op has too many members")(static_cast <bool> (Indices.size() <= Factor &&
"Interleaved memory op has too many members") ? void (0) : __assert_fail
("Indices.size() <= Factor && \"Interleaved memory op has too many members\""
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/BasicTTIImpl.h"
, 857, __extension__ __PRETTY_FUNCTION__))
;
858
859 for (unsigned Index : Indices) {
860 assert(Index < Factor && "Invalid index for interleaved memory op")(static_cast <bool> (Index < Factor && "Invalid index for interleaved memory op"
) ? void (0) : __assert_fail ("Index < Factor && \"Invalid index for interleaved memory op\""
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/BasicTTIImpl.h"
, 860, __extension__ __PRETTY_FUNCTION__))
;
861
862 // Extract elements from loaded vector for each sub vector.
863 for (unsigned i = 0; i < NumSubElts; i++)
864 Cost += static_cast<T *>(this)->getVectorInstrCost(
865 Instruction::ExtractElement, VT, Index + i * Factor);
866 }
867
868 unsigned InsSubCost = 0;
869 for (unsigned i = 0; i < NumSubElts; i++)
870 InsSubCost += static_cast<T *>(this)->getVectorInstrCost(
871 Instruction::InsertElement, SubVT, i);
872
873 Cost += Indices.size() * InsSubCost;
874 } else {
875 // The interleave cost is extract all elements from sub vectors, and
876 // insert them into the wide vector.
877 //
878 // E.g. An interleaved store of factor 2:
879 // %v0_v1 = shuffle %v0, %v1, <0, 4, 1, 5, 2, 6, 3, 7>
880 // store <8 x i32> %interleaved.vec, <8 x i32>* %ptr
881 // The cost is estimated as extract all elements from both <4 x i32>
882 // vectors and insert into the <8 x i32> vector.
883
884 unsigned ExtSubCost = 0;
885 for (unsigned i = 0; i < NumSubElts; i++)
886 ExtSubCost += static_cast<T *>(this)->getVectorInstrCost(
887 Instruction::ExtractElement, SubVT, i);
888 Cost += ExtSubCost * Factor;
889
890 for (unsigned i = 0; i < NumElts; i++)
891 Cost += static_cast<T *>(this)
892 ->getVectorInstrCost(Instruction::InsertElement, VT, i);
893 }
894
895 return Cost;
896 }
897
898 /// Get intrinsic cost based on arguments.
899 unsigned getIntrinsicInstrCost(Intrinsic::ID IID, Type *RetTy,
900 ArrayRef<Value *> Args, FastMathFlags FMF,
901 unsigned VF = 1) {
902 unsigned RetVF = (RetTy->isVectorTy() ? RetTy->getVectorNumElements() : 1);
903 assert((RetVF == 1 || VF == 1) && "VF > 1 and RetVF is a vector type")(static_cast <bool> ((RetVF == 1 || VF == 1) &&
"VF > 1 and RetVF is a vector type") ? void (0) : __assert_fail
("(RetVF == 1 || VF == 1) && \"VF > 1 and RetVF is a vector type\""
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/BasicTTIImpl.h"
, 903, __extension__ __PRETTY_FUNCTION__))
;
904
905 switch (IID) {
906 default: {
907 // Assume that we need to scalarize this intrinsic.
908 SmallVector<Type *, 4> Types;
909 for (Value *Op : Args) {
910 Type *OpTy = Op->getType();
911 assert(VF == 1 || !OpTy->isVectorTy())(static_cast <bool> (VF == 1 || !OpTy->isVectorTy())
? void (0) : __assert_fail ("VF == 1 || !OpTy->isVectorTy()"
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/BasicTTIImpl.h"
, 911, __extension__ __PRETTY_FUNCTION__))
;
912 Types.push_back(VF == 1 ? OpTy : VectorType::get(OpTy, VF));
913 }
914
915 if (VF > 1 && !RetTy->isVoidTy())
916 RetTy = VectorType::get(RetTy, VF);
917
918 // Compute the scalarization overhead based on Args for a vector
919 // intrinsic. A vectorizer will pass a scalar RetTy and VF > 1, while
920 // CostModel will pass a vector RetTy and VF is 1.
921 unsigned ScalarizationCost = std::numeric_limits<unsigned>::max();
922 if (RetVF > 1 || VF > 1) {
923 ScalarizationCost = 0;
924 if (!RetTy->isVoidTy())
925 ScalarizationCost += getScalarizationOverhead(RetTy, true, false);
926 ScalarizationCost += getOperandsScalarizationOverhead(Args, VF);
927 }
928
929 return static_cast<T *>(this)->
930 getIntrinsicInstrCost(IID, RetTy, Types, FMF, ScalarizationCost);
931 }
932 case Intrinsic::masked_scatter: {
933 assert(VF == 1 && "Can't vectorize types here.")(static_cast <bool> (VF == 1 && "Can't vectorize types here."
) ? void (0) : __assert_fail ("VF == 1 && \"Can't vectorize types here.\""
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/BasicTTIImpl.h"
, 933, __extension__ __PRETTY_FUNCTION__))
;
934 Value *Mask = Args[3];
935 bool VarMask = !isa<Constant>(Mask);
936 unsigned Alignment = cast<ConstantInt>(Args[2])->getZExtValue();
937 return
938 static_cast<T *>(this)->getGatherScatterOpCost(Instruction::Store,
939 Args[0]->getType(),
940 Args[1], VarMask,
941 Alignment);
942 }
943 case Intrinsic::masked_gather: {
944 assert(VF == 1 && "Can't vectorize types here.")(static_cast <bool> (VF == 1 && "Can't vectorize types here."
) ? void (0) : __assert_fail ("VF == 1 && \"Can't vectorize types here.\""
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/BasicTTIImpl.h"
, 944, __extension__ __PRETTY_FUNCTION__))
;
945 Value *Mask = Args[2];
946 bool VarMask = !isa<Constant>(Mask);
947 unsigned Alignment = cast<ConstantInt>(Args[1])->getZExtValue();
948 return
949 static_cast<T *>(this)->getGatherScatterOpCost(Instruction::Load,
950 RetTy, Args[0], VarMask,
951 Alignment);
952 }
953 case Intrinsic::experimental_vector_reduce_add:
954 case Intrinsic::experimental_vector_reduce_mul:
955 case Intrinsic::experimental_vector_reduce_and:
956 case Intrinsic::experimental_vector_reduce_or:
957 case Intrinsic::experimental_vector_reduce_xor:
958 case Intrinsic::experimental_vector_reduce_fadd:
959 case Intrinsic::experimental_vector_reduce_fmul:
960 case Intrinsic::experimental_vector_reduce_smax:
961 case Intrinsic::experimental_vector_reduce_smin:
962 case Intrinsic::experimental_vector_reduce_fmax:
963 case Intrinsic::experimental_vector_reduce_fmin:
964 case Intrinsic::experimental_vector_reduce_umax:
965 case Intrinsic::experimental_vector_reduce_umin:
966 return getIntrinsicInstrCost(IID, RetTy, Args[0]->getType(), FMF);
967 }
968 }
969
970 /// Get intrinsic cost based on argument types.
971 /// If ScalarizationCostPassed is std::numeric_limits<unsigned>::max(), the
972 /// cost of scalarizing the arguments and the return value will be computed
973 /// based on types.
974 unsigned getIntrinsicInstrCost(
975 Intrinsic::ID IID, Type *RetTy, ArrayRef<Type *> Tys, FastMathFlags FMF,
976 unsigned ScalarizationCostPassed = std::numeric_limits<unsigned>::max()) {
977 SmallVector<unsigned, 2> ISDs;
978 unsigned SingleCallCost = 10; // Library call cost. Make it expensive.
979 switch (IID) {
980 default: {
981 // Assume that we need to scalarize this intrinsic.
982 unsigned ScalarizationCost = ScalarizationCostPassed;
983 unsigned ScalarCalls = 1;
984 Type *ScalarRetTy = RetTy;
985 if (RetTy->isVectorTy()) {
986 if (ScalarizationCostPassed == std::numeric_limits<unsigned>::max())
987 ScalarizationCost = getScalarizationOverhead(RetTy, true, false);
988 ScalarCalls = std::max(ScalarCalls, RetTy->getVectorNumElements());
989 ScalarRetTy = RetTy->getScalarType();
990 }
991 SmallVector<Type *, 4> ScalarTys;
992 for (unsigned i = 0, ie = Tys.size(); i != ie; ++i) {
993 Type *Ty = Tys[i];
994 if (Ty->isVectorTy()) {
995 if (ScalarizationCostPassed == std::numeric_limits<unsigned>::max())
996 ScalarizationCost += getScalarizationOverhead(Ty, false, true);
997 ScalarCalls = std::max(ScalarCalls, Ty->getVectorNumElements());
998 Ty = Ty->getScalarType();
999 }
1000 ScalarTys.push_back(Ty);
1001 }
1002 if (ScalarCalls == 1)
1003 return 1; // Return cost of a scalar intrinsic. Assume it to be cheap.
1004
1005 unsigned ScalarCost = static_cast<T *>(this)->getIntrinsicInstrCost(
1006 IID, ScalarRetTy, ScalarTys, FMF);
1007
1008 return ScalarCalls * ScalarCost + ScalarizationCost;
1009 }
1010 // Look for intrinsics that can be lowered directly or turned into a scalar
1011 // intrinsic call.
1012 case Intrinsic::sqrt:
1013 ISDs.push_back(ISD::FSQRT);
1014 break;
1015 case Intrinsic::sin:
1016 ISDs.push_back(ISD::FSIN);
1017 break;
1018 case Intrinsic::cos:
1019 ISDs.push_back(ISD::FCOS);
1020 break;
1021 case Intrinsic::exp:
1022 ISDs.push_back(ISD::FEXP);
1023 break;
1024 case Intrinsic::exp2:
1025 ISDs.push_back(ISD::FEXP2);
1026 break;
1027 case Intrinsic::log:
1028 ISDs.push_back(ISD::FLOG);
1029 break;
1030 case Intrinsic::log10:
1031 ISDs.push_back(ISD::FLOG10);
1032 break;
1033 case Intrinsic::log2:
1034 ISDs.push_back(ISD::FLOG2);
1035 break;
1036 case Intrinsic::fabs:
1037 ISDs.push_back(ISD::FABS);
1038 break;
1039 case Intrinsic::minnum:
1040 ISDs.push_back(ISD::FMINNUM);
1041 if (FMF.noNaNs())
1042 ISDs.push_back(ISD::FMINNAN);
1043 break;
1044 case Intrinsic::maxnum:
1045 ISDs.push_back(ISD::FMAXNUM);
1046 if (FMF.noNaNs())
1047 ISDs.push_back(ISD::FMAXNAN);
1048 break;
1049 case Intrinsic::copysign:
1050 ISDs.push_back(ISD::FCOPYSIGN);
1051 break;
1052 case Intrinsic::floor:
1053 ISDs.push_back(ISD::FFLOOR);
1054 break;
1055 case Intrinsic::ceil:
1056 ISDs.push_back(ISD::FCEIL);
1057 break;
1058 case Intrinsic::trunc:
1059 ISDs.push_back(ISD::FTRUNC);
1060 break;
1061 case Intrinsic::nearbyint:
1062 ISDs.push_back(ISD::FNEARBYINT);
1063 break;
1064 case Intrinsic::rint:
1065 ISDs.push_back(ISD::FRINT);
1066 break;
1067 case Intrinsic::round:
1068 ISDs.push_back(ISD::FROUND);
1069 break;
1070 case Intrinsic::pow:
1071 ISDs.push_back(ISD::FPOW);
1072 break;
1073 case Intrinsic::fma:
1074 ISDs.push_back(ISD::FMA);
1075 break;
1076 case Intrinsic::fmuladd:
1077 ISDs.push_back(ISD::FMA);
1078 break;
1079 // FIXME: We should return 0 whenever getIntrinsicCost == TCC_Free.
1080 case Intrinsic::lifetime_start:
1081 case Intrinsic::lifetime_end:
1082 case Intrinsic::sideeffect:
1083 return 0;
1084 case Intrinsic::masked_store:
1085 return static_cast<T *>(this)
1086 ->getMaskedMemoryOpCost(Instruction::Store, Tys[0], 0, 0);
1087 case Intrinsic::masked_load:
1088 return static_cast<T *>(this)
1089 ->getMaskedMemoryOpCost(Instruction::Load, RetTy, 0, 0);
1090 case Intrinsic::experimental_vector_reduce_add:
1091 return static_cast<T *>(this)->getArithmeticReductionCost(
1092 Instruction::Add, Tys[0], /*IsPairwiseForm=*/false);
1093 case Intrinsic::experimental_vector_reduce_mul:
1094 return static_cast<T *>(this)->getArithmeticReductionCost(
1095 Instruction::Mul, Tys[0], /*IsPairwiseForm=*/false);
1096 case Intrinsic::experimental_vector_reduce_and:
1097 return static_cast<T *>(this)->getArithmeticReductionCost(
1098 Instruction::And, Tys[0], /*IsPairwiseForm=*/false);
1099 case Intrinsic::experimental_vector_reduce_or:
1100 return static_cast<T *>(this)->getArithmeticReductionCost(
1101 Instruction::Or, Tys[0], /*IsPairwiseForm=*/false);
1102 case Intrinsic::experimental_vector_reduce_xor:
1103 return static_cast<T *>(this)->getArithmeticReductionCost(
1104 Instruction::Xor, Tys[0], /*IsPairwiseForm=*/false);
1105 case Intrinsic::experimental_vector_reduce_fadd:
1106 return static_cast<T *>(this)->getArithmeticReductionCost(
1107 Instruction::FAdd, Tys[0], /*IsPairwiseForm=*/false);
1108 case Intrinsic::experimental_vector_reduce_fmul:
1109 return static_cast<T *>(this)->getArithmeticReductionCost(
1110 Instruction::FMul, Tys[0], /*IsPairwiseForm=*/false);
1111 case Intrinsic::experimental_vector_reduce_smax:
1112 case Intrinsic::experimental_vector_reduce_smin:
1113 case Intrinsic::experimental_vector_reduce_fmax:
1114 case Intrinsic::experimental_vector_reduce_fmin:
1115 return static_cast<T *>(this)->getMinMaxReductionCost(
1116 Tys[0], CmpInst::makeCmpResultType(Tys[0]), /*IsPairwiseForm=*/false,
1117 /*IsSigned=*/true);
1118 case Intrinsic::experimental_vector_reduce_umax:
1119 case Intrinsic::experimental_vector_reduce_umin:
1120 return static_cast<T *>(this)->getMinMaxReductionCost(
1121 Tys[0], CmpInst::makeCmpResultType(Tys[0]), /*IsPairwiseForm=*/false,
1122 /*IsSigned=*/false);
1123 case Intrinsic::ctpop:
1124 ISDs.push_back(ISD::CTPOP);
1125 // In case of legalization use TCC_Expensive. This is cheaper than a
1126 // library call but still not a cheap instruction.
1127 SingleCallCost = TargetTransformInfo::TCC_Expensive;
1128 break;
1129 // FIXME: ctlz, cttz, ...
1130 }
1131
1132 const TargetLoweringBase *TLI = getTLI();
1133 std::pair<unsigned, MVT> LT = TLI->getTypeLegalizationCost(DL, RetTy);
1134
1135 SmallVector<unsigned, 2> LegalCost;
1136 SmallVector<unsigned, 2> CustomCost;
1137 for (unsigned ISD : ISDs) {
1138 if (TLI->isOperationLegalOrPromote(ISD, LT.second)) {
1139 if (IID == Intrinsic::fabs && TLI->isFAbsFree(LT.second)) {
1140 return 0;
1141 }
1142
1143 // The operation is legal. Assume it costs 1.
1144 // If the type is split to multiple registers, assume that there is some
1145 // overhead to this.
1146 // TODO: Once we have extract/insert subvector cost we need to use them.
1147 if (LT.first > 1)
1148 LegalCost.push_back(LT.first * 2);
1149 else
1150 LegalCost.push_back(LT.first * 1);
1151 } else if (!TLI->isOperationExpand(ISD, LT.second)) {
1152 // If the operation is custom lowered then assume
1153 // that the code is twice as expensive.
1154 CustomCost.push_back(LT.first * 2);
1155 }
1156 }
1157
1158 auto MinLegalCostI = std::min_element(LegalCost.begin(), LegalCost.end());
1159 if (MinLegalCostI != LegalCost.end())
1160 return *MinLegalCostI;
1161
1162 auto MinCustomCostI = std::min_element(CustomCost.begin(), CustomCost.end());
1163 if (MinCustomCostI != CustomCost.end())
1164 return *MinCustomCostI;
1165
1166 // If we can't lower fmuladd into an FMA estimate the cost as a floating
1167 // point mul followed by an add.
1168 if (IID == Intrinsic::fmuladd)
1169 return static_cast<T *>(this)
1170 ->getArithmeticInstrCost(BinaryOperator::FMul, RetTy) +
1171 static_cast<T *>(this)
1172 ->getArithmeticInstrCost(BinaryOperator::FAdd, RetTy);
1173
1174 // Else, assume that we need to scalarize this intrinsic. For math builtins
1175 // this will emit a costly libcall, adding call overhead and spills. Make it
1176 // very expensive.
1177 if (RetTy->isVectorTy()) {
1178 unsigned ScalarizationCost =
1179 ((ScalarizationCostPassed != std::numeric_limits<unsigned>::max())
1180 ? ScalarizationCostPassed
1181 : getScalarizationOverhead(RetTy, true, false));
1182 unsigned ScalarCalls = RetTy->getVectorNumElements();
1183 SmallVector<Type *, 4> ScalarTys;
1184 for (unsigned i = 0, ie = Tys.size(); i != ie; ++i) {
1185 Type *Ty = Tys[i];
1186 if (Ty->isVectorTy())
1187 Ty = Ty->getScalarType();
1188 ScalarTys.push_back(Ty);
1189 }
1190 unsigned ScalarCost = static_cast<T *>(this)->getIntrinsicInstrCost(
1191 IID, RetTy->getScalarType(), ScalarTys, FMF);
1192 for (unsigned i = 0, ie = Tys.size(); i != ie; ++i) {
1193 if (Tys[i]->isVectorTy()) {
1194 if (ScalarizationCostPassed == std::numeric_limits<unsigned>::max())
1195 ScalarizationCost += getScalarizationOverhead(Tys[i], false, true);
1196 ScalarCalls = std::max(ScalarCalls, Tys[i]->getVectorNumElements());
1197 }
1198 }
1199
1200 return ScalarCalls * ScalarCost + ScalarizationCost;
1201 }
1202
1203 // This is going to be turned into a library call, make it expensive.
1204 return SingleCallCost;
1205 }
1206
1207 /// Compute a cost of the given call instruction.
1208 ///
1209 /// Compute the cost of calling function F with return type RetTy and
1210 /// argument types Tys. F might be nullptr, in this case the cost of an
1211 /// arbitrary call with the specified signature will be returned.
1212 /// This is used, for instance, when we estimate call of a vector
1213 /// counterpart of the given function.
1214 /// \param F Called function, might be nullptr.
1215 /// \param RetTy Return value types.
1216 /// \param Tys Argument types.
1217 /// \returns The cost of Call instruction.
1218 unsigned getCallInstrCost(Function *F, Type *RetTy, ArrayRef<Type *> Tys) {
1219 return 10;
1220 }
1221
1222 unsigned getNumberOfParts(Type *Tp) {
1223 std::pair<unsigned, MVT> LT = getTLI()->getTypeLegalizationCost(DL, Tp);
1224 return LT.first;
1225 }
1226
1227 unsigned getAddressComputationCost(Type *Ty, ScalarEvolution *,
1228 const SCEV *) {
1229 return 0;
1230 }
1231
1232 /// Try to calculate arithmetic and shuffle op costs for reduction operations.
1233 /// We're assuming that reduction operation are performing the following way:
1234 /// 1. Non-pairwise reduction
1235 /// %val1 = shufflevector<n x t> %val, <n x t> %undef,
1236 /// <n x i32> <i32 n/2, i32 n/2 + 1, ..., i32 n, i32 undef, ..., i32 undef>
1237 /// \----------------v-------------/ \----------v------------/
1238 /// n/2 elements n/2 elements
1239 /// %red1 = op <n x t> %val, <n x t> val1
1240 /// After this operation we have a vector %red1 where only the first n/2
1241 /// elements are meaningful, the second n/2 elements are undefined and can be
1242 /// dropped. All other operations are actually working with the vector of
1243 /// length n/2, not n, though the real vector length is still n.
1244 /// %val2 = shufflevector<n x t> %red1, <n x t> %undef,
1245 /// <n x i32> <i32 n/4, i32 n/4 + 1, ..., i32 n/2, i32 undef, ..., i32 undef>
1246 /// \----------------v-------------/ \----------v------------/
1247 /// n/4 elements 3*n/4 elements
1248 /// %red2 = op <n x t> %red1, <n x t> val2 - working with the vector of
1249 /// length n/2, the resulting vector has length n/4 etc.
1250 /// 2. Pairwise reduction:
1251 /// Everything is the same except for an additional shuffle operation which
1252 /// is used to produce operands for pairwise kind of reductions.
1253 /// %val1 = shufflevector<n x t> %val, <n x t> %undef,
1254 /// <n x i32> <i32 0, i32 2, ..., i32 n-2, i32 undef, ..., i32 undef>
1255 /// \-------------v----------/ \----------v------------/
1256 /// n/2 elements n/2 elements
1257 /// %val2 = shufflevector<n x t> %val, <n x t> %undef,
1258 /// <n x i32> <i32 1, i32 3, ..., i32 n-1, i32 undef, ..., i32 undef>
1259 /// \-------------v----------/ \----------v------------/
1260 /// n/2 elements n/2 elements
1261 /// %red1 = op <n x t> %val1, <n x t> val2
1262 /// Again, the operation is performed on <n x t> vector, but the resulting
1263 /// vector %red1 is <n/2 x t> vector.
1264 ///
1265 /// The cost model should take into account that the actual length of the
1266 /// vector is reduced on each iteration.
1267 unsigned getArithmeticReductionCost(unsigned Opcode, Type *Ty,
1268 bool IsPairwise) {
1269 assert(Ty->isVectorTy() && "Expect a vector type")(static_cast <bool> (Ty->isVectorTy() && "Expect a vector type"
) ? void (0) : __assert_fail ("Ty->isVectorTy() && \"Expect a vector type\""
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/BasicTTIImpl.h"
, 1269, __extension__ __PRETTY_FUNCTION__))
;
1270 Type *ScalarTy = Ty->getVectorElementType();
1271 unsigned NumVecElts = Ty->getVectorNumElements();
1272 unsigned NumReduxLevels = Log2_32(NumVecElts);
1273 unsigned ArithCost = 0;
1274 unsigned ShuffleCost = 0;
1275 auto *ConcreteTTI = static_cast<T *>(this);
1276 std::pair<unsigned, MVT> LT =
1277 ConcreteTTI->getTLI()->getTypeLegalizationCost(DL, Ty);
1278 unsigned LongVectorCount = 0;
1279 unsigned MVTLen =
1280 LT.second.isVector() ? LT.second.getVectorNumElements() : 1;
1281 while (NumVecElts > MVTLen) {
1282 NumVecElts /= 2;
1283 // Assume the pairwise shuffles add a cost.
1284 ShuffleCost += (IsPairwise + 1) *
1285 ConcreteTTI->getShuffleCost(TTI::SK_ExtractSubvector, Ty,
1286 NumVecElts, Ty);
1287 ArithCost += ConcreteTTI->getArithmeticInstrCost(Opcode, Ty);
1288 Ty = VectorType::get(ScalarTy, NumVecElts);
1289 ++LongVectorCount;
1290 }
1291 // The minimal length of the vector is limited by the real length of vector
1292 // operations performed on the current platform. That's why several final
1293 // reduction operations are performed on the vectors with the same
1294 // architecture-dependent length.
1295 ShuffleCost += (NumReduxLevels - LongVectorCount) * (IsPairwise + 1) *
1296 ConcreteTTI->getShuffleCost(TTI::SK_ExtractSubvector, Ty,
1297 NumVecElts, Ty);
1298 ArithCost += (NumReduxLevels - LongVectorCount) *
1299 ConcreteTTI->getArithmeticInstrCost(Opcode, Ty);
1300 return ShuffleCost + ArithCost + getScalarizationOverhead(Ty, false, true);
1301 }
1302
1303 /// Try to calculate op costs for min/max reduction operations.
1304 /// \param CondTy Conditional type for the Select instruction.
1305 unsigned getMinMaxReductionCost(Type *Ty, Type *CondTy, bool IsPairwise,
1306 bool) {
1307 assert(Ty->isVectorTy() && "Expect a vector type")(static_cast <bool> (Ty->isVectorTy() && "Expect a vector type"
) ? void (0) : __assert_fail ("Ty->isVectorTy() && \"Expect a vector type\""
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/BasicTTIImpl.h"
, 1307, __extension__ __PRETTY_FUNCTION__))
;
1308 Type *ScalarTy = Ty->getVectorElementType();
1309 Type *ScalarCondTy = CondTy->getVectorElementType();
1310 unsigned NumVecElts = Ty->getVectorNumElements();
1311 unsigned NumReduxLevels = Log2_32(NumVecElts);
1312 unsigned CmpOpcode;
1313 if (Ty->isFPOrFPVectorTy()) {
1314 CmpOpcode = Instruction::FCmp;
1315 } else {
1316 assert(Ty->isIntOrIntVectorTy() &&(static_cast <bool> (Ty->isIntOrIntVectorTy() &&
"expecting floating point or integer type for min/max reduction"
) ? void (0) : __assert_fail ("Ty->isIntOrIntVectorTy() && \"expecting floating point or integer type for min/max reduction\""
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/BasicTTIImpl.h"
, 1317, __extension__ __PRETTY_FUNCTION__))
1317 "expecting floating point or integer type for min/max reduction")(static_cast <bool> (Ty->isIntOrIntVectorTy() &&
"expecting floating point or integer type for min/max reduction"
) ? void (0) : __assert_fail ("Ty->isIntOrIntVectorTy() && \"expecting floating point or integer type for min/max reduction\""
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/BasicTTIImpl.h"
, 1317, __extension__ __PRETTY_FUNCTION__))
;
1318 CmpOpcode = Instruction::ICmp;
1319 }
1320 unsigned MinMaxCost = 0;
1321 unsigned ShuffleCost = 0;
1322 auto *ConcreteTTI = static_cast<T *>(this);
1323 std::pair<unsigned, MVT> LT =
1324 ConcreteTTI->getTLI()->getTypeLegalizationCost(DL, Ty);
1325 unsigned LongVectorCount = 0;
1326 unsigned MVTLen =
1327 LT.second.isVector() ? LT.second.getVectorNumElements() : 1;
1328 while (NumVecElts > MVTLen) {
1329 NumVecElts /= 2;
1330 // Assume the pairwise shuffles add a cost.
1331 ShuffleCost += (IsPairwise + 1) *
1332 ConcreteTTI->getShuffleCost(TTI::SK_ExtractSubvector, Ty,
1333 NumVecElts, Ty);
1334 MinMaxCost +=
1335 ConcreteTTI->getCmpSelInstrCost(CmpOpcode, Ty, CondTy, nullptr) +
1336 ConcreteTTI->getCmpSelInstrCost(Instruction::Select, Ty, CondTy,
1337 nullptr);
1338 Ty = VectorType::get(ScalarTy, NumVecElts);
1339 CondTy = VectorType::get(ScalarCondTy, NumVecElts);
1340 ++LongVectorCount;
1341 }
1342 // The minimal length of the vector is limited by the real length of vector
1343 // operations performed on the current platform. That's why several final
1344 // reduction opertions are perfomed on the vectors with the same
1345 // architecture-dependent length.
1346 ShuffleCost += (NumReduxLevels - LongVectorCount) * (IsPairwise + 1) *
1347 ConcreteTTI->getShuffleCost(TTI::SK_ExtractSubvector, Ty,
1348 NumVecElts, Ty);
1349 MinMaxCost +=
1350 (NumReduxLevels - LongVectorCount) *
1351 (ConcreteTTI->getCmpSelInstrCost(CmpOpcode, Ty, CondTy, nullptr) +
1352 ConcreteTTI->getCmpSelInstrCost(Instruction::Select, Ty, CondTy,
1353 nullptr));
1354 // Need 3 extractelement instructions for scalarization + an additional
1355 // scalar select instruction.
1356 return ShuffleCost + MinMaxCost +
1357 3 * getScalarizationOverhead(Ty, /*Insert=*/false,
1358 /*Extract=*/true) +
1359 ConcreteTTI->getCmpSelInstrCost(Instruction::Select, ScalarTy,
1360 ScalarCondTy, nullptr);
1361 }
1362
1363 unsigned getVectorSplitCost() { return 1; }
1364
1365 /// @}
1366};
1367
1368/// Concrete BasicTTIImpl that can be used if no further customization
1369/// is needed.
1370class BasicTTIImpl : public BasicTTIImplBase<BasicTTIImpl> {
1371 using BaseT = BasicTTIImplBase<BasicTTIImpl>;
1372
1373 friend class BasicTTIImplBase<BasicTTIImpl>;
1374
1375 const TargetSubtargetInfo *ST;
1376 const TargetLoweringBase *TLI;
1377
1378 const TargetSubtargetInfo *getST() const { return ST; }
1379 const TargetLoweringBase *getTLI() const { return TLI; }
1380
1381public:
1382 explicit BasicTTIImpl(const TargetMachine *ST, const Function &F);
1383};
1384
1385} // end namespace llvm
1386
1387#endif // LLVM_CODEGEN_BASICTTIIMPL_H

/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/TargetLowering.h

1//===- llvm/CodeGen/TargetLowering.h - Target Lowering Info -----*- 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/// \file
11/// This file describes how to lower LLVM code to machine code. This has two
12/// main components:
13///
14/// 1. Which ValueTypes are natively supported by the target.
15/// 2. Which operations are supported for supported ValueTypes.
16/// 3. Cost thresholds for alternative implementations of certain operations.
17///
18/// In addition it has a few other components, like information about FP
19/// immediates.
20///
21//===----------------------------------------------------------------------===//
22
23#ifndef LLVM_CODEGEN_TARGETLOWERING_H
24#define LLVM_CODEGEN_TARGETLOWERING_H
25
26#include "llvm/ADT/APInt.h"
27#include "llvm/ADT/ArrayRef.h"
28#include "llvm/ADT/DenseMap.h"
29#include "llvm/ADT/STLExtras.h"
30#include "llvm/ADT/SmallVector.h"
31#include "llvm/ADT/StringRef.h"
32#include "llvm/Analysis/DivergenceAnalysis.h"
33#include "llvm/CodeGen/DAGCombine.h"
34#include "llvm/CodeGen/ISDOpcodes.h"
35#include "llvm/CodeGen/RuntimeLibcalls.h"
36#include "llvm/CodeGen/SelectionDAG.h"
37#include "llvm/CodeGen/SelectionDAGNodes.h"
38#include "llvm/CodeGen/TargetCallingConv.h"
39#include "llvm/CodeGen/ValueTypes.h"
40#include "llvm/IR/Attributes.h"
41#include "llvm/IR/CallSite.h"
42#include "llvm/IR/CallingConv.h"
43#include "llvm/IR/DataLayout.h"
44#include "llvm/IR/DerivedTypes.h"
45#include "llvm/IR/Function.h"
46#include "llvm/IR/IRBuilder.h"
47#include "llvm/IR/InlineAsm.h"
48#include "llvm/IR/Instruction.h"
49#include "llvm/IR/Instructions.h"
50#include "llvm/IR/Type.h"
51#include "llvm/MC/MCRegisterInfo.h"
52#include "llvm/Support/AtomicOrdering.h"
53#include "llvm/Support/Casting.h"
54#include "llvm/Support/ErrorHandling.h"
55#include "llvm/Support/MachineValueType.h"
56#include "llvm/Target/TargetMachine.h"
57#include <algorithm>
58#include <cassert>
59#include <climits>
60#include <cstdint>
61#include <iterator>
62#include <map>
63#include <string>
64#include <utility>
65#include <vector>
66
67namespace llvm {
68
69class BranchProbability;
70class CCState;
71class CCValAssign;
72class Constant;
73class FastISel;
74class FunctionLoweringInfo;
75class GlobalValue;
76class IntrinsicInst;
77struct KnownBits;
78class LLVMContext;
79class MachineBasicBlock;
80class MachineFunction;
81class MachineInstr;
82class MachineJumpTableInfo;
83class MachineLoop;
84class MachineRegisterInfo;
85class MCContext;
86class MCExpr;
87class Module;
88class TargetRegisterClass;
89class TargetLibraryInfo;
90class TargetRegisterInfo;
91class Value;
92
93namespace Sched {
94
95 enum Preference {
96 None, // No preference
97 Source, // Follow source order.
98 RegPressure, // Scheduling for lowest register pressure.
99 Hybrid, // Scheduling for both latency and register pressure.
100 ILP, // Scheduling for ILP in low register pressure mode.
101 VLIW // Scheduling for VLIW targets.
102 };
103
104} // end namespace Sched
105
106/// This base class for TargetLowering contains the SelectionDAG-independent
107/// parts that can be used from the rest of CodeGen.
108class TargetLoweringBase {
109public:
110 /// This enum indicates whether operations are valid for a target, and if not,
111 /// what action should be used to make them valid.
112 enum LegalizeAction : uint8_t {
113 Legal, // The target natively supports this operation.
114 Promote, // This operation should be executed in a larger type.
115 Expand, // Try to expand this to other ops, otherwise use a libcall.
116 LibCall, // Don't try to expand this to other ops, always use a libcall.
117 Custom // Use the LowerOperation hook to implement custom lowering.
118 };
119
120 /// This enum indicates whether a types are legal for a target, and if not,
121 /// what action should be used to make them valid.
122 enum LegalizeTypeAction : uint8_t {
123 TypeLegal, // The target natively supports this type.
124 TypePromoteInteger, // Replace this integer with a larger one.
125 TypeExpandInteger, // Split this integer into two of half the size.
126 TypeSoftenFloat, // Convert this float to a same size integer type,
127 // if an operation is not supported in target HW.
128 TypeExpandFloat, // Split this float into two of half the size.
129 TypeScalarizeVector, // Replace this one-element vector with its element.
130 TypeSplitVector, // Split this vector into two of half the size.
131 TypeWidenVector, // This vector should be widened into a larger vector.
132 TypePromoteFloat // Replace this float with a larger one.
133 };
134
135 /// LegalizeKind holds the legalization kind that needs to happen to EVT
136 /// in order to type-legalize it.
137 using LegalizeKind = std::pair<LegalizeTypeAction, EVT>;
138
139 /// Enum that describes how the target represents true/false values.
140 enum BooleanContent {
141 UndefinedBooleanContent, // Only bit 0 counts, the rest can hold garbage.
142 ZeroOrOneBooleanContent, // All bits zero except for bit 0.
143 ZeroOrNegativeOneBooleanContent // All bits equal to bit 0.
144 };
145
146 /// Enum that describes what type of support for selects the target has.
147 enum SelectSupportKind {
148 ScalarValSelect, // The target supports scalar selects (ex: cmov).
149 ScalarCondVectorVal, // The target supports selects with a scalar condition
150 // and vector values (ex: cmov).
151 VectorMaskSelect // The target supports vector selects with a vector
152 // mask (ex: x86 blends).
153 };
154
155 /// Enum that specifies what an atomic load/AtomicRMWInst is expanded
156 /// to, if at all. Exists because different targets have different levels of
157 /// support for these atomic instructions, and also have different options
158 /// w.r.t. what they should expand to.
159 enum class AtomicExpansionKind {
160 None, // Don't expand the instruction.
161 LLSC, // Expand the instruction into loadlinked/storeconditional; used
162 // by ARM/AArch64.
163 LLOnly, // Expand the (load) instruction into just a load-linked, which has
164 // greater atomic guarantees than a normal load.
165 CmpXChg, // Expand the instruction into cmpxchg; used by at least X86.
166 };
167
168 /// Enum that specifies when a multiplication should be expanded.
169 enum class MulExpansionKind {
170 Always, // Always expand the instruction.
171 OnlyLegalOrCustom, // Only expand when the resulting instructions are legal
172 // or custom.
173 };
174
175 class ArgListEntry {
176 public:
177 Value *Val = nullptr;
178 SDValue Node = SDValue();
179 Type *Ty = nullptr;
180 bool IsSExt : 1;
181 bool IsZExt : 1;
182 bool IsInReg : 1;
183 bool IsSRet : 1;
184 bool IsNest : 1;
185 bool IsByVal : 1;
186 bool IsInAlloca : 1;
187 bool IsReturned : 1;
188 bool IsSwiftSelf : 1;
189 bool IsSwiftError : 1;
190 uint16_t Alignment = 0;
191
192 ArgListEntry()
193 : IsSExt(false), IsZExt(false), IsInReg(false), IsSRet(false),
194 IsNest(false), IsByVal(false), IsInAlloca(false), IsReturned(false),
195 IsSwiftSelf(false), IsSwiftError(false) {}
196
197 void setAttributes(ImmutableCallSite *CS, unsigned ArgIdx);
198 };
199 using ArgListTy = std::vector<ArgListEntry>;
200
201 virtual void markLibCallAttributes(MachineFunction *MF, unsigned CC,
202 ArgListTy &Args) const {};
203
204 static ISD::NodeType getExtendForContent(BooleanContent Content) {
205 switch (Content) {
206 case UndefinedBooleanContent:
207 // Extend by adding rubbish bits.
208 return ISD::ANY_EXTEND;
209 case ZeroOrOneBooleanContent:
210 // Extend by adding zero bits.
211 return ISD::ZERO_EXTEND;
212 case ZeroOrNegativeOneBooleanContent:
213 // Extend by copying the sign bit.
214 return ISD::SIGN_EXTEND;
215 }
216 llvm_unreachable("Invalid content kind")::llvm::llvm_unreachable_internal("Invalid content kind", "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/TargetLowering.h"
, 216)
;
217 }
218
219 /// NOTE: The TargetMachine owns TLOF.
220 explicit TargetLoweringBase(const TargetMachine &TM);
221 TargetLoweringBase(const TargetLoweringBase &) = delete;
222 TargetLoweringBase &operator=(const TargetLoweringBase &) = delete;
223 virtual ~TargetLoweringBase() = default;
224
225protected:
226 /// Initialize all of the actions to default values.
227 void initActions();
228
229public:
230 const TargetMachine &getTargetMachine() const { return TM; }
231
232 virtual bool useSoftFloat() const { return false; }
233
234 /// Return the pointer type for the given address space, defaults to
235 /// the pointer type from the data layout.
236 /// FIXME: The default needs to be removed once all the code is updated.
237 MVT getPointerTy(const DataLayout &DL, uint32_t AS = 0) const {
238 return MVT::getIntegerVT(DL.getPointerSizeInBits(AS));
239 }
240
241 /// Return the type for frame index, which is determined by
242 /// the alloca address space specified through the data layout.
243 MVT getFrameIndexTy(const DataLayout &DL) const {
244 return getPointerTy(DL, DL.getAllocaAddrSpace());
245 }
246
247 /// Return the type for operands of fence.
248 /// TODO: Let fence operands be of i32 type and remove this.
249 virtual MVT getFenceOperandTy(const DataLayout &DL) const {
250 return getPointerTy(DL);
251 }
252
253 /// EVT is not used in-tree, but is used by out-of-tree target.
254 /// A documentation for this function would be nice...
255 virtual MVT getScalarShiftAmountTy(const DataLayout &, EVT) const;
256
257 EVT getShiftAmountTy(EVT LHSTy, const DataLayout &DL,
258 bool LegalTypes = true) const;
259
260 /// Returns the type to be used for the index operand of:
261 /// ISD::INSERT_VECTOR_ELT, ISD::EXTRACT_VECTOR_ELT,
262 /// ISD::INSERT_SUBVECTOR, and ISD::EXTRACT_SUBVECTOR
263 virtual MVT getVectorIdxTy(const DataLayout &DL) const {
264 return getPointerTy(DL);
265 }
266
267 virtual bool isSelectSupported(SelectSupportKind /*kind*/) const {
268 return true;
269 }
270
271 /// Return true if multiple condition registers are available.
272 bool hasMultipleConditionRegisters() const {
273 return HasMultipleConditionRegisters;
274 }
275
276 /// Return true if the target has BitExtract instructions.
277 bool hasExtractBitsInsn() const { return HasExtractBitsInsn; }
278
279 /// Return the preferred vector type legalization action.
280 virtual TargetLoweringBase::LegalizeTypeAction
281 getPreferredVectorAction(EVT VT) const {
282 // The default action for one element vectors is to scalarize
283 if (VT.getVectorNumElements() == 1)
284 return TypeScalarizeVector;
285 // The default action for other vectors is to promote
286 return TypePromoteInteger;
287 }
288
289 // There are two general methods for expanding a BUILD_VECTOR node:
290 // 1. Use SCALAR_TO_VECTOR on the defined scalar values and then shuffle
291 // them together.
292 // 2. Build the vector on the stack and then load it.
293 // If this function returns true, then method (1) will be used, subject to
294 // the constraint that all of the necessary shuffles are legal (as determined
295 // by isShuffleMaskLegal). If this function returns false, then method (2) is
296 // always used. The vector type, and the number of defined values, are
297 // provided.
298 virtual bool
299 shouldExpandBuildVectorWithShuffles(EVT /* VT */,
300 unsigned DefinedValues) const {
301 return DefinedValues < 3;
302 }
303
304 /// Return true if integer divide is usually cheaper than a sequence of
305 /// several shifts, adds, and multiplies for this target.
306 /// The definition of "cheaper" may depend on whether we're optimizing
307 /// for speed or for size.
308 virtual bool isIntDivCheap(EVT VT, AttributeList Attr) const { return false; }
309
310 /// Return true if the target can handle a standalone remainder operation.
311 virtual bool hasStandaloneRem(EVT VT) const {
312 return true;
313 }
314
315 /// Return true if SQRT(X) shouldn't be replaced with X*RSQRT(X).
316 virtual bool isFsqrtCheap(SDValue X, SelectionDAG &DAG) const {
317 // Default behavior is to replace SQRT(X) with X*RSQRT(X).
318 return false;
319 }
320
321 /// Reciprocal estimate status values used by the functions below.
322 enum ReciprocalEstimate : int {
323 Unspecified = -1,
324 Disabled = 0,
325 Enabled = 1
326 };
327
328 /// Return a ReciprocalEstimate enum value for a square root of the given type
329 /// based on the function's attributes. If the operation is not overridden by
330 /// the function's attributes, "Unspecified" is returned and target defaults
331 /// are expected to be used for instruction selection.
332 int getRecipEstimateSqrtEnabled(EVT VT, MachineFunction &MF) const;
333
334 /// Return a ReciprocalEstimate enum value for a division of the given type
335 /// based on the function's attributes. If the operation is not overridden by
336 /// the function's attributes, "Unspecified" is returned and target defaults
337 /// are expected to be used for instruction selection.
338 int getRecipEstimateDivEnabled(EVT VT, MachineFunction &MF) const;
339
340 /// Return the refinement step count for a square root of the given type based
341 /// on the function's attributes. If the operation is not overridden by
342 /// the function's attributes, "Unspecified" is returned and target defaults
343 /// are expected to be used for instruction selection.
344 int getSqrtRefinementSteps(EVT VT, MachineFunction &MF) const;
345
346 /// Return the refinement step count for a division of the given type based
347 /// on the function's attributes. If the operation is not overridden by
348 /// the function's attributes, "Unspecified" is returned and target defaults
349 /// are expected to be used for instruction selection.
350 int getDivRefinementSteps(EVT VT, MachineFunction &MF) const;
351
352 /// Returns true if target has indicated at least one type should be bypassed.
353 bool isSlowDivBypassed() const { return !BypassSlowDivWidths.empty(); }
354
355 /// Returns map of slow types for division or remainder with corresponding
356 /// fast types
357 const DenseMap<unsigned int, unsigned int> &getBypassSlowDivWidths() const {
358 return BypassSlowDivWidths;
359 }
360
361 /// Return true if Flow Control is an expensive operation that should be
362 /// avoided.
363 bool isJumpExpensive() const { return JumpIsExpensive; }
364
365 /// Return true if selects are only cheaper than branches if the branch is
366 /// unlikely to be predicted right.
367 bool isPredictableSelectExpensive() const {
368 return PredictableSelectIsExpensive;
369 }
370
371 /// If a branch or a select condition is skewed in one direction by more than
372 /// this factor, it is very likely to be predicted correctly.
373 virtual BranchProbability getPredictableBranchThreshold() const;
374
375 /// Return true if the following transform is beneficial:
376 /// fold (conv (load x)) -> (load (conv*)x)
377 /// On architectures that don't natively support some vector loads
378 /// efficiently, casting the load to a smaller vector of larger types and
379 /// loading is more efficient, however, this can be undone by optimizations in
380 /// dag combiner.
381 virtual bool isLoadBitCastBeneficial(EVT LoadVT,
382 EVT BitcastVT) const {
383 // Don't do if we could do an indexed load on the original type, but not on
384 // the new one.
385 if (!LoadVT.isSimple() || !BitcastVT.isSimple())
386 return true;
387
388 MVT LoadMVT = LoadVT.getSimpleVT();
389
390 // Don't bother doing this if it's just going to be promoted again later, as
391 // doing so might interfere with other combines.
392 if (getOperationAction(ISD::LOAD, LoadMVT) == Promote &&
393 getTypeToPromoteTo(ISD::LOAD, LoadMVT) == BitcastVT.getSimpleVT())
394 return false;
395
396 return true;
397 }
398
399 /// Return true if the following transform is beneficial:
400 /// (store (y (conv x)), y*)) -> (store x, (x*))
401 virtual bool isStoreBitCastBeneficial(EVT StoreVT, EVT BitcastVT) const {
402 // Default to the same logic as loads.
403 return isLoadBitCastBeneficial(StoreVT, BitcastVT);
404 }
405
406 /// Return true if it is expected to be cheaper to do a store of a non-zero
407 /// vector constant with the given size and type for the address space than to
408 /// store the individual scalar element constants.
409 virtual bool storeOfVectorConstantIsCheap(EVT MemVT,
410 unsigned NumElem,
411 unsigned AddrSpace) const {
412 return false;
413 }
414
415 /// Allow store merging after legalization in addition to before legalization.
416 /// This may catch stores that do not exist earlier (eg, stores created from
417 /// intrinsics).
418 virtual bool mergeStoresAfterLegalization() const { return true; }
419
420 /// Returns if it's reasonable to merge stores to MemVT size.
421 virtual bool canMergeStoresTo(unsigned AS, EVT MemVT,
422 const SelectionDAG &DAG) const {
423 return true;
424 }
425
426 /// Return true if it is cheap to speculate a call to intrinsic cttz.
427 virtual bool isCheapToSpeculateCttz() const {
428 return false;
429 }
430
431 /// Return true if it is cheap to speculate a call to intrinsic ctlz.
432 virtual bool isCheapToSpeculateCtlz() const {
433 return false;
434 }
435
436 /// Return true if ctlz instruction is fast.
437 virtual bool isCtlzFast() const {
438 return false;
439 }
440
441 /// Return true if it is safe to transform an integer-domain bitwise operation
442 /// into the equivalent floating-point operation. This should be set to true
443 /// if the target has IEEE-754-compliant fabs/fneg operations for the input
444 /// type.
445 virtual bool hasBitPreservingFPLogic(EVT VT) const {
446 return false;
447 }
448
449 /// Return true if it is cheaper to split the store of a merged int val
450 /// from a pair of smaller values into multiple stores.
451 virtual bool isMultiStoresCheaperThanBitsMerge(EVT LTy, EVT HTy) const {
452 return false;
453 }
454
455 /// Return if the target supports combining a
456 /// chain like:
457 /// \code
458 /// %andResult = and %val1, #mask
459 /// %icmpResult = icmp %andResult, 0
460 /// \endcode
461 /// into a single machine instruction of a form like:
462 /// \code
463 /// cc = test %register, #mask
464 /// \endcode
465 virtual bool isMaskAndCmp0FoldingBeneficial(const Instruction &AndI) const {
466 return false;
467 }
468
469 /// Use bitwise logic to make pairs of compares more efficient. For example:
470 /// and (seteq A, B), (seteq C, D) --> seteq (or (xor A, B), (xor C, D)), 0
471 /// This should be true when it takes more than one instruction to lower
472 /// setcc (cmp+set on x86 scalar), when bitwise ops are faster than logic on
473 /// condition bits (crand on PowerPC), and/or when reducing cmp+br is a win.
474 virtual bool convertSetCCLogicToBitwiseLogic(EVT VT) const {
475 return false;
476 }
477
478 /// Return the preferred operand type if the target has a quick way to compare
479 /// integer values of the given size. Assume that any legal integer type can
480 /// be compared efficiently. Targets may override this to allow illegal wide
481 /// types to return a vector type if there is support to compare that type.
482 virtual MVT hasFastEqualityCompare(unsigned NumBits) const {
483 MVT VT = MVT::getIntegerVT(NumBits);
484 return isTypeLegal(VT) ? VT : MVT::INVALID_SIMPLE_VALUE_TYPE;
485 }
486
487 /// Return true if the target should transform:
488 /// (X & Y) == Y ---> (~X & Y) == 0
489 /// (X & Y) != Y ---> (~X & Y) != 0
490 ///
491 /// This may be profitable if the target has a bitwise and-not operation that
492 /// sets comparison flags. A target may want to limit the transformation based
493 /// on the type of Y or if Y is a constant.
494 ///
495 /// Note that the transform will not occur if Y is known to be a power-of-2
496 /// because a mask and compare of a single bit can be handled by inverting the
497 /// predicate, for example:
498 /// (X & 8) == 8 ---> (X & 8) != 0
499 virtual bool hasAndNotCompare(SDValue Y) const {
500 return false;
501 }
502
503 /// Return true if the target has a bitwise and-not operation:
504 /// X = ~A & B
505 /// This can be used to simplify select or other instructions.
506 virtual bool hasAndNot(SDValue X) const {
507 // If the target has the more complex version of this operation, assume that
508 // it has this operation too.
509 return hasAndNotCompare(X);
510 }
511
512 /// There are two ways to clear extreme bits (either low or high):
513 /// Mask: x & (-1 << y) (the instcombine canonical form)
514 /// Shifts: x >> y << y
515 /// Return true if the variant with 2 shifts is preferred.
516 /// Return false if there is no preference.
517 virtual bool preferShiftsToClearExtremeBits(SDValue X) const {
518 // By default, let's assume that no one prefers shifts.
519 return false;
520 }
521
522 /// Return true if the target wants to use the optimization that
523 /// turns ext(promotableInst1(...(promotableInstN(load)))) into
524 /// promotedInst1(...(promotedInstN(ext(load)))).
525 bool enableExtLdPromotion() const { return EnableExtLdPromotion; }
526
527 /// Return true if the target can combine store(extractelement VectorTy,
528 /// Idx).
529 /// \p Cost[out] gives the cost of that transformation when this is true.
530 virtual bool canCombineStoreAndExtract(Type *VectorTy, Value *Idx,
531 unsigned &Cost) const {
532 return false;
533 }
534
535 /// Return true if target supports floating point exceptions.
536 bool hasFloatingPointExceptions() const {
537 return HasFloatingPointExceptions;
538 }
539
540 /// Return true if target always beneficiates from combining into FMA for a
541 /// given value type. This must typically return false on targets where FMA
542 /// takes more cycles to execute than FADD.
543 virtual bool enableAggressiveFMAFusion(EVT VT) const {
544 return false;
545 }
546
547 /// Return the ValueType of the result of SETCC operations.
548 virtual EVT getSetCCResultType(const DataLayout &DL, LLVMContext &Context,
549 EVT VT) const;
550
551 /// Return the ValueType for comparison libcalls. Comparions libcalls include
552 /// floating point comparion calls, and Ordered/Unordered check calls on
553 /// floating point numbers.
554 virtual
555 MVT::SimpleValueType getCmpLibcallReturnType() const;
556
557 /// For targets without i1 registers, this gives the nature of the high-bits
558 /// of boolean values held in types wider than i1.
559 ///
560 /// "Boolean values" are special true/false values produced by nodes like
561 /// SETCC and consumed (as the condition) by nodes like SELECT and BRCOND.
562 /// Not to be confused with general values promoted from i1. Some cpus
563 /// distinguish between vectors of boolean and scalars; the isVec parameter
564 /// selects between the two kinds. For example on X86 a scalar boolean should
565 /// be zero extended from i1, while the elements of a vector of booleans
566 /// should be sign extended from i1.
567 ///
568 /// Some cpus also treat floating point types the same way as they treat
569 /// vectors instead of the way they treat scalars.
570 BooleanContent getBooleanContents(bool isVec, bool isFloat) const {
571 if (isVec)
572 return BooleanVectorContents;
573 return isFloat ? BooleanFloatContents : BooleanContents;
574 }
575
576 BooleanContent getBooleanContents(EVT Type) const {
577 return getBooleanContents(Type.isVector(), Type.isFloatingPoint());
578 }
579
580 /// Return target scheduling preference.
581 Sched::Preference getSchedulingPreference() const {
582 return SchedPreferenceInfo;
583 }
584
585 /// Some scheduler, e.g. hybrid, can switch to different scheduling heuristics
586 /// for different nodes. This function returns the preference (or none) for
587 /// the given node.
588 virtual Sched::Preference getSchedulingPreference(SDNode *) const {
589 return Sched::None;
590 }
591
592 /// Return the register class that should be used for the specified value
593 /// type.
594 virtual const TargetRegisterClass *getRegClassFor(MVT VT) const {
595 const TargetRegisterClass *RC = RegClassForVT[VT.SimpleTy];
596 assert(RC && "This value type is not natively supported!")(static_cast <bool> (RC && "This value type is not natively supported!"
) ? void (0) : __assert_fail ("RC && \"This value type is not natively supported!\""
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/TargetLowering.h"
, 596, __extension__ __PRETTY_FUNCTION__))
;
597 return RC;
598 }
599
600 /// Return the 'representative' register class for the specified value
601 /// type.
602 ///
603 /// The 'representative' register class is the largest legal super-reg
604 /// register class for the register class of the value type. For example, on
605 /// i386 the rep register class for i8, i16, and i32 are GR32; while the rep
606 /// register class is GR64 on x86_64.
607 virtual const TargetRegisterClass *getRepRegClassFor(MVT VT) const {
608 const TargetRegisterClass *RC = RepRegClassForVT[VT.SimpleTy];
609 return RC;
610 }
611
612 /// Return the cost of the 'representative' register class for the specified
613 /// value type.
614 virtual uint8_t getRepRegClassCostFor(MVT VT) const {
615 return RepRegClassCostForVT[VT.SimpleTy];
616 }
617
618 /// Return true if the target has native support for the specified value type.
619 /// This means that it has a register that directly holds it without
620 /// promotions or expansions.
621 bool isTypeLegal(EVT VT) const {
622 assert(!VT.isSimple() ||(static_cast <bool> (!VT.isSimple() || (unsigned)VT.getSimpleVT
().SimpleTy < array_lengthof(RegClassForVT)) ? void (0) : __assert_fail
("!VT.isSimple() || (unsigned)VT.getSimpleVT().SimpleTy < array_lengthof(RegClassForVT)"
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/TargetLowering.h"
, 623, __extension__ __PRETTY_FUNCTION__))
623 (unsigned)VT.getSimpleVT().SimpleTy < array_lengthof(RegClassForVT))(static_cast <bool> (!VT.isSimple() || (unsigned)VT.getSimpleVT
().SimpleTy < array_lengthof(RegClassForVT)) ? void (0) : __assert_fail
("!VT.isSimple() || (unsigned)VT.getSimpleVT().SimpleTy < array_lengthof(RegClassForVT)"
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/TargetLowering.h"
, 623, __extension__ __PRETTY_FUNCTION__))
;
624 return VT.isSimple() && RegClassForVT[VT.getSimpleVT().SimpleTy] != nullptr;
625 }
626
627 class ValueTypeActionImpl {
628 /// ValueTypeActions - For each value type, keep a LegalizeTypeAction enum
629 /// that indicates how instruction selection should deal with the type.
630 LegalizeTypeAction ValueTypeActions[MVT::LAST_VALUETYPE];
631
632 public:
633 ValueTypeActionImpl() {
634 std::fill(std::begin(ValueTypeActions), std::end(ValueTypeActions),
635 TypeLegal);
636 }
637
638 LegalizeTypeAction getTypeAction(MVT VT) const {
639 return ValueTypeActions[VT.SimpleTy];
640 }
641
642 void setTypeAction(MVT VT, LegalizeTypeAction Action) {
643 ValueTypeActions[VT.SimpleTy] = Action;
644 }
645 };
646
647 const ValueTypeActionImpl &getValueTypeActions() const {
648 return ValueTypeActions;
649 }
650
651 /// Return how we should legalize values of this type, either it is already
652 /// legal (return 'Legal') or we need to promote it to a larger type (return
653 /// 'Promote'), or we need to expand it into multiple registers of smaller
654 /// integer type (return 'Expand'). 'Custom' is not an option.
655 LegalizeTypeAction getTypeAction(LLVMContext &Context, EVT VT) const {
656 return getTypeConversion(Context, VT).first;
657 }
658 LegalizeTypeAction getTypeAction(MVT VT) const {
659 return ValueTypeActions.getTypeAction(VT);
660 }
661
662 /// For types supported by the target, this is an identity function. For
663 /// types that must be promoted to larger types, this returns the larger type
664 /// to promote to. For integer types that are larger than the largest integer
665 /// register, this contains one step in the expansion to get to the smaller
666 /// register. For illegal floating point types, this returns the integer type
667 /// to transform to.
668 EVT getTypeToTransformTo(LLVMContext &Context, EVT VT) const {
669 return getTypeConversion(Context, VT).second;
670 }
671
672 /// For types supported by the target, this is an identity function. For
673 /// types that must be expanded (i.e. integer types that are larger than the
674 /// largest integer register or illegal floating point types), this returns
675 /// the largest legal type it will be expanded to.
676 EVT getTypeToExpandTo(LLVMContext &Context, EVT VT) const {
677 assert(!VT.isVector())(static_cast <bool> (!VT.isVector()) ? void (0) : __assert_fail
("!VT.isVector()", "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/TargetLowering.h"
, 677, __extension__ __PRETTY_FUNCTION__))
;
678 while (true) {
679 switch (getTypeAction(Context, VT)) {
680 case TypeLegal:
681 return VT;
682 case TypeExpandInteger:
683 VT = getTypeToTransformTo(Context, VT);
684 break;
685 default:
686 llvm_unreachable("Type is not legal nor is it to be expanded!")::llvm::llvm_unreachable_internal("Type is not legal nor is it to be expanded!"
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/TargetLowering.h"
, 686)
;
687 }
688 }
689 }
690
691 /// Vector types are broken down into some number of legal first class types.
692 /// For example, EVT::v8f32 maps to 2 EVT::v4f32 with Altivec or SSE1, or 8
693 /// promoted EVT::f64 values with the X86 FP stack. Similarly, EVT::v2i64
694 /// turns into 4 EVT::i32 values with both PPC and X86.
695 ///
696 /// This method returns the number of registers needed, and the VT for each
697 /// register. It also returns the VT and quantity of the intermediate values
698 /// before they are promoted/expanded.
699 unsigned getVectorTypeBreakdown(LLVMContext &Context, EVT VT,
700 EVT &IntermediateVT,
701 unsigned &NumIntermediates,
702 MVT &RegisterVT) const;
703
704 /// Certain targets such as MIPS require that some types such as vectors are
705 /// always broken down into scalars in some contexts. This occurs even if the
706 /// vector type is legal.
707 virtual unsigned getVectorTypeBreakdownForCallingConv(
708 LLVMContext &Context, EVT VT, EVT &IntermediateVT,
709 unsigned &NumIntermediates, MVT &RegisterVT) const {
710 return getVectorTypeBreakdown(Context, VT, IntermediateVT, NumIntermediates,
711 RegisterVT);
712 }
713
714 struct IntrinsicInfo {
715 unsigned opc = 0; // target opcode
716 EVT memVT; // memory VT
717
718 // value representing memory location
719 PointerUnion<const Value *, const PseudoSourceValue *> ptrVal;
720
721 int offset = 0; // offset off of ptrVal
722 unsigned size = 0; // the size of the memory location
723 // (taken from memVT if zero)
724 unsigned align = 1; // alignment
725
726 MachineMemOperand::Flags flags = MachineMemOperand::MONone;
727 IntrinsicInfo() = default;
728 };
729
730 /// Given an intrinsic, checks if on the target the intrinsic will need to map
731 /// to a MemIntrinsicNode (touches memory). If this is the case, it returns
732 /// true and store the intrinsic information into the IntrinsicInfo that was
733 /// passed to the function.
734 virtual bool getTgtMemIntrinsic(IntrinsicInfo &, const CallInst &,
735 MachineFunction &,
736 unsigned /*Intrinsic*/) const {
737 return false;
738 }
739
740 /// Returns true if the target can instruction select the specified FP
741 /// immediate natively. If false, the legalizer will materialize the FP
742 /// immediate as a load from a constant pool.
743 virtual bool isFPImmLegal(const APFloat &/*Imm*/, EVT /*VT*/) const {
744 return false;
745 }
746
747 /// Targets can use this to indicate that they only support *some*
748 /// VECTOR_SHUFFLE operations, those with specific masks. By default, if a
749 /// target supports the VECTOR_SHUFFLE node, all mask values are assumed to be
750 /// legal.
751 virtual bool isShuffleMaskLegal(ArrayRef<int> /*Mask*/, EVT /*VT*/) const {
752 return true;
753 }
754
755 /// Returns true if the operation can trap for the value type.
756 ///
757 /// VT must be a legal type. By default, we optimistically assume most
758 /// operations don't trap except for integer divide and remainder.
759 virtual bool canOpTrap(unsigned Op, EVT VT) const;
760
761 /// Similar to isShuffleMaskLegal. Targets can use this to indicate if there
762 /// is a suitable VECTOR_SHUFFLE that can be used to replace a VAND with a
763 /// constant pool entry.
764 virtual bool isVectorClearMaskLegal(ArrayRef<int> /*Mask*/,
765 EVT /*VT*/) const {
766 return false;
767 }
768
769 /// Return how this operation should be treated: either it is legal, needs to
770 /// be promoted to a larger size, needs to be expanded to some other code
771 /// sequence, or the target has a custom expander for it.
772 LegalizeAction getOperationAction(unsigned Op, EVT VT) const {
773 if (VT.isExtended()) return Expand;
774 // If a target-specific SDNode requires legalization, require the target
775 // to provide custom legalization for it.
776 if (Op >= array_lengthof(OpActions[0])) return Custom;
777 return OpActions[(unsigned)VT.getSimpleVT().SimpleTy][Op];
778 }
779
780 LegalizeAction getStrictFPOperationAction(unsigned Op, EVT VT) const {
781 unsigned EqOpc;
782 switch (Op) {
783 default: llvm_unreachable("Unexpected FP pseudo-opcode")::llvm::llvm_unreachable_internal("Unexpected FP pseudo-opcode"
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/TargetLowering.h"
, 783)
;
784 case ISD::STRICT_FADD: EqOpc = ISD::FADD; break;
785 case ISD::STRICT_FSUB: EqOpc = ISD::FSUB; break;
786 case ISD::STRICT_FMUL: EqOpc = ISD::FMUL; break;
787 case ISD::STRICT_FDIV: EqOpc = ISD::FDIV; break;
788 case ISD::STRICT_FSQRT: EqOpc = ISD::FSQRT; break;
789 case ISD::STRICT_FPOW: EqOpc = ISD::FPOW; break;
790 case ISD::STRICT_FPOWI: EqOpc = ISD::FPOWI; break;
791 case ISD::STRICT_FMA: EqOpc = ISD::FMA; break;
792 case ISD::STRICT_FSIN: EqOpc = ISD::FSIN; break;
793 case ISD::STRICT_FCOS: EqOpc = ISD::FCOS; break;
794 case ISD::STRICT_FEXP: EqOpc = ISD::FEXP; break;
795 case ISD::STRICT_FEXP2: EqOpc = ISD::FEXP2; break;
796 case ISD::STRICT_FLOG: EqOpc = ISD::FLOG; break;
797 case ISD::STRICT_FLOG10: EqOpc = ISD::FLOG10; break;
798 case ISD::STRICT_FLOG2: EqOpc = ISD::FLOG2; break;
799 case ISD::STRICT_FRINT: EqOpc = ISD::FRINT; break;
800 case ISD::STRICT_FNEARBYINT: EqOpc = ISD::FNEARBYINT; break;
801 }
802
803 auto Action = getOperationAction(EqOpc, VT);
804
805 // We don't currently handle Custom or Promote for strict FP pseudo-ops.
806 // For now, we just expand for those cases.
807 if (Action != Legal)
808 Action = Expand;
809
810 return Action;
811 }
812
813 /// Return true if the specified operation is legal on this target or can be
814 /// made legal with custom lowering. This is used to help guide high-level
815 /// lowering decisions.
816 bool isOperationLegalOrCustom(unsigned Op, EVT VT) const {
817 return (VT == MVT::Other || isTypeLegal(VT)) &&
818 (getOperationAction(Op, VT) == Legal ||
819 getOperationAction(Op, VT) == Custom);
820 }
821
822 /// Return true if the specified operation is legal on this target or can be
823 /// made legal using promotion. This is used to help guide high-level lowering
824 /// decisions.
825 bool isOperationLegalOrPromote(unsigned Op, EVT VT) const {
826 return (VT == MVT::Other || isTypeLegal(VT)) &&
827 (getOperationAction(Op, VT) == Legal ||
828 getOperationAction(Op, VT) == Promote);
829 }
830
831 /// Return true if the specified operation is legal on this target or can be
832 /// made legal with custom lowering or using promotion. This is used to help
833 /// guide high-level lowering decisions.
834 bool isOperationLegalOrCustomOrPromote(unsigned Op, EVT VT) const {
835 return (VT == MVT::Other || isTypeLegal(VT)) &&
836 (getOperationAction(Op, VT) == Legal ||
837 getOperationAction(Op, VT) == Custom ||
838 getOperationAction(Op, VT) == Promote);
839 }
840
841 /// Return true if the operation uses custom lowering, regardless of whether
842 /// the type is legal or not.
843 bool isOperationCustom(unsigned Op, EVT VT) const {
844 return getOperationAction(Op, VT) == Custom;
845 }
846
847 /// Return true if lowering to a jump table is allowed.
848 virtual bool areJTsAllowed(const Function *Fn) const {
849 if (Fn->getFnAttribute("no-jump-tables").getValueAsString() == "true")
850 return false;
851
852 return isOperationLegalOrCustom(ISD::BR_JT, MVT::Other) ||
853 isOperationLegalOrCustom(ISD::BRIND, MVT::Other);
854 }
855
856 /// Check whether the range [Low,High] fits in a machine word.
857 bool rangeFitsInWord(const APInt &Low, const APInt &High,
858 const DataLayout &DL) const {
859 // FIXME: Using the pointer type doesn't seem ideal.
860 uint64_t BW = DL.getIndexSizeInBits(0u);
861 uint64_t Range = (High - Low).getLimitedValue(UINT64_MAX(18446744073709551615UL) - 1) + 1;
862 return Range <= BW;
863 }
864
865 /// Return true if lowering to a jump table is suitable for a set of case
866 /// clusters which may contain \p NumCases cases, \p Range range of values.
867 /// FIXME: This function check the maximum table size and density, but the
868 /// minimum size is not checked. It would be nice if the minimum size is
869 /// also combined within this function. Currently, the minimum size check is
870 /// performed in findJumpTable() in SelectionDAGBuiler and
871 /// getEstimatedNumberOfCaseClusters() in BasicTTIImpl.
872 virtual bool isSuitableForJumpTable(const SwitchInst *SI, uint64_t NumCases,
873 uint64_t Range) const {
874 const bool OptForSize = SI->getParent()->getParent()->optForSize();
875 const unsigned MinDensity = getMinimumJumpTableDensity(OptForSize);
876 const unsigned MaxJumpTableSize =
877 OptForSize || getMaximumJumpTableSize() == 0
878 ? UINT_MAX(2147483647 *2U +1U)
879 : getMaximumJumpTableSize();
880 // Check whether a range of clusters is dense enough for a jump table.
881 if (Range <= MaxJumpTableSize &&
882 (NumCases * 100 >= Range * MinDensity)) {
883 return true;
884 }
885 return false;
886 }
887
888 /// Return true if lowering to a bit test is suitable for a set of case
889 /// clusters which contains \p NumDests unique destinations, \p Low and
890 /// \p High as its lowest and highest case values, and expects \p NumCmps
891 /// case value comparisons. Check if the number of destinations, comparison
892 /// metric, and range are all suitable.
893 bool isSuitableForBitTests(unsigned NumDests, unsigned NumCmps,
894 const APInt &Low, const APInt &High,
895 const DataLayout &DL) const {
896 // FIXME: I don't think NumCmps is the correct metric: a single case and a
897 // range of cases both require only one branch to lower. Just looking at the
898 // number of clusters and destinations should be enough to decide whether to
899 // build bit tests.
900
901 // To lower a range with bit tests, the range must fit the bitwidth of a
902 // machine word.
903 if (!rangeFitsInWord(Low, High, DL))
904 return false;
905
906 // Decide whether it's profitable to lower this range with bit tests. Each
907 // destination requires a bit test and branch, and there is an overall range
908 // check branch. For a small number of clusters, separate comparisons might
909 // be cheaper, and for many destinations, splitting the range might be
910 // better.
911 return (NumDests == 1 && NumCmps >= 3) || (NumDests == 2 && NumCmps >= 5) ||
912 (NumDests == 3 && NumCmps >= 6);
913 }
914
915 /// Return true if the specified operation is illegal on this target or
916 /// unlikely to be made legal with custom lowering. This is used to help guide
917 /// high-level lowering decisions.
918 bool isOperationExpand(unsigned Op, EVT VT) const {
919 return (!isTypeLegal(VT) || getOperationAction(Op, VT) == Expand);
920 }
921
922 /// Return true if the specified operation is legal on this target.
923 bool isOperationLegal(unsigned Op, EVT VT) const {
924 return (VT == MVT::Other || isTypeLegal(VT)) &&
925 getOperationAction(Op, VT) == Legal;
926 }
927
928 /// Return how this load with extension should be treated: either it is legal,
929 /// needs to be promoted to a larger size, needs to be expanded to some other
930 /// code sequence, or the target has a custom expander for it.
931 LegalizeAction getLoadExtAction(unsigned ExtType, EVT ValVT,
932 EVT MemVT) const {
933 if (ValVT.isExtended() || MemVT.isExtended()) return Expand;
934 unsigned ValI = (unsigned) ValVT.getSimpleVT().SimpleTy;
935 unsigned MemI = (unsigned) MemVT.getSimpleVT().SimpleTy;
936 assert(ExtType < ISD::LAST_LOADEXT_TYPE && ValI < MVT::LAST_VALUETYPE &&(static_cast <bool> (ExtType < ISD::LAST_LOADEXT_TYPE
&& ValI < MVT::LAST_VALUETYPE && MemI <
MVT::LAST_VALUETYPE && "Table isn't big enough!") ? void
(0) : __assert_fail ("ExtType < ISD::LAST_LOADEXT_TYPE && ValI < MVT::LAST_VALUETYPE && MemI < MVT::LAST_VALUETYPE && \"Table isn't big enough!\""
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/TargetLowering.h"
, 937, __extension__ __PRETTY_FUNCTION__))
937 MemI < MVT::LAST_VALUETYPE && "Table isn't big enough!")(static_cast <bool> (ExtType < ISD::LAST_LOADEXT_TYPE
&& ValI < MVT::LAST_VALUETYPE && MemI <
MVT::LAST_VALUETYPE && "Table isn't big enough!") ? void
(0) : __assert_fail ("ExtType < ISD::LAST_LOADEXT_TYPE && ValI < MVT::LAST_VALUETYPE && MemI < MVT::LAST_VALUETYPE && \"Table isn't big enough!\""
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/TargetLowering.h"
, 937, __extension__ __PRETTY_FUNCTION__))
;
938 unsigned Shift = 4 * ExtType;
939 return (LegalizeAction)((LoadExtActions[ValI][MemI] >> Shift) & 0xf);
940 }
941
942 /// Return true if the specified load with extension is legal on this target.
943 bool isLoadExtLegal(unsigned ExtType, EVT ValVT, EVT MemVT) const {
944 return getLoadExtAction(ExtType, ValVT, MemVT) == Legal;
945 }
946
947 /// Return true if the specified load with extension is legal or custom
948 /// on this target.
949 bool isLoadExtLegalOrCustom(unsigned ExtType, EVT ValVT, EVT MemVT) const {
950 return getLoadExtAction(ExtType, ValVT, MemVT) == Legal ||
951 getLoadExtAction(ExtType, ValVT, MemVT) == Custom;
952 }
953
954 /// Return how this store with truncation should be treated: either it is
955 /// legal, needs to be promoted to a larger size, needs to be expanded to some
956 /// other code sequence, or the target has a custom expander for it.
957 LegalizeAction getTruncStoreAction(EVT ValVT, EVT MemVT) const {
958 if (ValVT.isExtended() || MemVT.isExtended()) return Expand;
959 unsigned ValI = (unsigned) ValVT.getSimpleVT().SimpleTy;
960 unsigned MemI = (unsigned) MemVT.getSimpleVT().SimpleTy;
961 assert(ValI < MVT::LAST_VALUETYPE && MemI < MVT::LAST_VALUETYPE &&(static_cast <bool> (ValI < MVT::LAST_VALUETYPE &&
MemI < MVT::LAST_VALUETYPE && "Table isn't big enough!"
) ? void (0) : __assert_fail ("ValI < MVT::LAST_VALUETYPE && MemI < MVT::LAST_VALUETYPE && \"Table isn't big enough!\""
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/TargetLowering.h"
, 962, __extension__ __PRETTY_FUNCTION__))
962 "Table isn't big enough!")(static_cast <bool> (ValI < MVT::LAST_VALUETYPE &&
MemI < MVT::LAST_VALUETYPE && "Table isn't big enough!"
) ? void (0) : __assert_fail ("ValI < MVT::LAST_VALUETYPE && MemI < MVT::LAST_VALUETYPE && \"Table isn't big enough!\""
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/TargetLowering.h"
, 962, __extension__ __PRETTY_FUNCTION__))
;
963 return TruncStoreActions[ValI][MemI];
964 }
965
966 /// Return true if the specified store with truncation is legal on this
967 /// target.
968 bool isTruncStoreLegal(EVT ValVT, EVT MemVT) const {
969 return isTypeLegal(ValVT) && getTruncStoreAction(ValVT, MemVT) == Legal;
970 }
971
972 /// Return true if the specified store with truncation has solution on this
973 /// target.
974 bool isTruncStoreLegalOrCustom(EVT ValVT, EVT MemVT) const {
975 return isTypeLegal(ValVT) &&
976 (getTruncStoreAction(ValVT, MemVT) == Legal ||
977 getTruncStoreAction(ValVT, MemVT) == Custom);
978 }
979
980 /// Return how the indexed load should be treated: either it is legal, needs
981 /// to be promoted to a larger size, needs to be expanded to some other code
982 /// sequence, or the target has a custom expander for it.
983 LegalizeAction
984 getIndexedLoadAction(unsigned IdxMode, MVT VT) const {
985 assert(IdxMode < ISD::LAST_INDEXED_MODE && VT.isValid() &&(static_cast <bool> (IdxMode < ISD::LAST_INDEXED_MODE
&& VT.isValid() && "Table isn't big enough!"
) ? void (0) : __assert_fail ("IdxMode < ISD::LAST_INDEXED_MODE && VT.isValid() && \"Table isn't big enough!\""
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/TargetLowering.h"
, 986, __extension__ __PRETTY_FUNCTION__))
986 "Table isn't big enough!")(static_cast <bool> (IdxMode < ISD::LAST_INDEXED_MODE
&& VT.isValid() && "Table isn't big enough!"
) ? void (0) : __assert_fail ("IdxMode < ISD::LAST_INDEXED_MODE && VT.isValid() && \"Table isn't big enough!\""
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/TargetLowering.h"
, 986, __extension__ __PRETTY_FUNCTION__))
;
987 unsigned Ty = (unsigned)VT.SimpleTy;
988 return (LegalizeAction)((IndexedModeActions[Ty][IdxMode] & 0xf0) >> 4);
989 }
990
991 /// Return true if the specified indexed load is legal on this target.
992 bool isIndexedLoadLegal(unsigned IdxMode, EVT VT) const {
993 return VT.isSimple() &&
994 (getIndexedLoadAction(IdxMode, VT.getSimpleVT()) == Legal ||
995 getIndexedLoadAction(IdxMode, VT.getSimpleVT()) == Custom);
996 }
997
998 /// Return how the indexed store should be treated: either it is legal, needs
999 /// to be promoted to a larger size, needs to be expanded to some other code
1000 /// sequence, or the target has a custom expander for it.
1001 LegalizeAction
1002 getIndexedStoreAction(unsigned IdxMode, MVT VT) const {
1003 assert(IdxMode < ISD::LAST_INDEXED_MODE && VT.isValid() &&(static_cast <bool> (IdxMode < ISD::LAST_INDEXED_MODE
&& VT.isValid() && "Table isn't big enough!"
) ? void (0) : __assert_fail ("IdxMode < ISD::LAST_INDEXED_MODE && VT.isValid() && \"Table isn't big enough!\""
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/TargetLowering.h"
, 1004, __extension__ __PRETTY_FUNCTION__))
1004 "Table isn't big enough!")(static_cast <bool> (IdxMode < ISD::LAST_INDEXED_MODE
&& VT.isValid() && "Table isn't big enough!"
) ? void (0) : __assert_fail ("IdxMode < ISD::LAST_INDEXED_MODE && VT.isValid() && \"Table isn't big enough!\""
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/TargetLowering.h"
, 1004, __extension__ __PRETTY_FUNCTION__))
;
1005 unsigned Ty = (unsigned)VT.SimpleTy;
1006 return (LegalizeAction)(IndexedModeActions[Ty][IdxMode] & 0x0f);
1007 }
1008
1009 /// Return true if the specified indexed load is legal on this target.
1010 bool isIndexedStoreLegal(unsigned IdxMode, EVT VT) const {
1011 return VT.isSimple() &&
1012 (getIndexedStoreAction(IdxMode, VT.getSimpleVT()) == Legal ||
1013 getIndexedStoreAction(IdxMode, VT.getSimpleVT()) == Custom);
1014 }
1015
1016 /// Return how the condition code should be treated: either it is legal, needs
1017 /// to be expanded to some other code sequence, or the target has a custom
1018 /// expander for it.
1019 LegalizeAction
1020 getCondCodeAction(ISD::CondCode CC, MVT VT) const {
1021 assert((unsigned)CC < array_lengthof(CondCodeActions) &&(static_cast <bool> ((unsigned)CC < array_lengthof(CondCodeActions
) && ((unsigned)VT.SimpleTy >> 3) < array_lengthof
(CondCodeActions[0]) && "Table isn't big enough!") ? void
(0) : __assert_fail ("(unsigned)CC < array_lengthof(CondCodeActions) && ((unsigned)VT.SimpleTy >> 3) < array_lengthof(CondCodeActions[0]) && \"Table isn't big enough!\""
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/TargetLowering.h"
, 1023, __extension__ __PRETTY_FUNCTION__))
1022 ((unsigned)VT.SimpleTy >> 3) < array_lengthof(CondCodeActions[0]) &&(static_cast <bool> ((unsigned)CC < array_lengthof(CondCodeActions
) && ((unsigned)VT.SimpleTy >> 3) < array_lengthof
(CondCodeActions[0]) && "Table isn't big enough!") ? void
(0) : __assert_fail ("(unsigned)CC < array_lengthof(CondCodeActions) && ((unsigned)VT.SimpleTy >> 3) < array_lengthof(CondCodeActions[0]) && \"Table isn't big enough!\""
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/TargetLowering.h"
, 1023, __extension__ __PRETTY_FUNCTION__))
1023 "Table isn't big enough!")(static_cast <bool> ((unsigned)CC < array_lengthof(CondCodeActions
) && ((unsigned)VT.SimpleTy >> 3) < array_lengthof
(CondCodeActions[0]) && "Table isn't big enough!") ? void
(0) : __assert_fail ("(unsigned)CC < array_lengthof(CondCodeActions) && ((unsigned)VT.SimpleTy >> 3) < array_lengthof(CondCodeActions[0]) && \"Table isn't big enough!\""
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/TargetLowering.h"
, 1023, __extension__ __PRETTY_FUNCTION__))
;
1024 // See setCondCodeAction for how this is encoded.
1025 uint32_t Shift = 4 * (VT.SimpleTy & 0x7);
1026 uint32_t Value = CondCodeActions[CC][VT.SimpleTy >> 3];
1027 LegalizeAction Action = (LegalizeAction) ((Value >> Shift) & 0xF);
1028 assert(Action != Promote && "Can't promote condition code!")(static_cast <bool> (Action != Promote && "Can't promote condition code!"
) ? void (0) : __assert_fail ("Action != Promote && \"Can't promote condition code!\""
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/TargetLowering.h"
, 1028, __extension__ __PRETTY_FUNCTION__))
;
1029 return Action;
1030 }
1031
1032 /// Return true if the specified condition code is legal on this target.
1033 bool isCondCodeLegal(ISD::CondCode CC, MVT VT) const {
1034 return getCondCodeAction(CC, VT) == Legal;
1035 }
1036
1037 /// Return true if the specified condition code is legal or custom on this
1038 /// target.
1039 bool isCondCodeLegalOrCustom(ISD::CondCode CC, MVT VT) const {
1040 return getCondCodeAction(CC, VT) == Legal ||
1041 getCondCodeAction(CC, VT) == Custom;
1042 }
1043
1044 /// If the action for this operation is to promote, this method returns the
1045 /// ValueType to promote to.
1046 MVT getTypeToPromoteTo(unsigned Op, MVT VT) const {
1047 assert(getOperationAction(Op, VT) == Promote &&(static_cast <bool> (getOperationAction(Op, VT) == Promote
&& "This operation isn't promoted!") ? void (0) : __assert_fail
("getOperationAction(Op, VT) == Promote && \"This operation isn't promoted!\""
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/TargetLowering.h"
, 1048, __extension__ __PRETTY_FUNCTION__))
1048 "This operation isn't promoted!")(static_cast <bool> (getOperationAction(Op, VT) == Promote
&& "This operation isn't promoted!") ? void (0) : __assert_fail
("getOperationAction(Op, VT) == Promote && \"This operation isn't promoted!\""
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/TargetLowering.h"
, 1048, __extension__ __PRETTY_FUNCTION__))
;
1049
1050 // See if this has an explicit type specified.
1051 std::map<std::pair<unsigned, MVT::SimpleValueType>,
1052 MVT::SimpleValueType>::const_iterator PTTI =
1053 PromoteToType.find(std::make_pair(Op, VT.SimpleTy));
1054 if (PTTI != PromoteToType.end()) return PTTI->second;
1055
1056 assert((VT.isInteger() || VT.isFloatingPoint()) &&(static_cast <bool> ((VT.isInteger() || VT.isFloatingPoint
()) && "Cannot autopromote this type, add it with AddPromotedToType."
) ? void (0) : __assert_fail ("(VT.isInteger() || VT.isFloatingPoint()) && \"Cannot autopromote this type, add it with AddPromotedToType.\""
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/TargetLowering.h"
, 1057, __extension__ __PRETTY_FUNCTION__))
1057 "Cannot autopromote this type, add it with AddPromotedToType.")(static_cast <bool> ((VT.isInteger() || VT.isFloatingPoint
()) && "Cannot autopromote this type, add it with AddPromotedToType."
) ? void (0) : __assert_fail ("(VT.isInteger() || VT.isFloatingPoint()) && \"Cannot autopromote this type, add it with AddPromotedToType.\""
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/TargetLowering.h"
, 1057, __extension__ __PRETTY_FUNCTION__))
;
1058
1059 MVT NVT = VT;
1060 do {
1061 NVT = (MVT::SimpleValueType)(NVT.SimpleTy+1);
1062 assert(NVT.isInteger() == VT.isInteger() && NVT != MVT::isVoid &&(static_cast <bool> (NVT.isInteger() == VT.isInteger() &&
NVT != MVT::isVoid && "Didn't find type to promote to!"
) ? void (0) : __assert_fail ("NVT.isInteger() == VT.isInteger() && NVT != MVT::isVoid && \"Didn't find type to promote to!\""
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/TargetLowering.h"
, 1063, __extension__ __PRETTY_FUNCTION__))
1063 "Didn't find type to promote to!")(static_cast <bool> (NVT.isInteger() == VT.isInteger() &&
NVT != MVT::isVoid && "Didn't find type to promote to!"
) ? void (0) : __assert_fail ("NVT.isInteger() == VT.isInteger() && NVT != MVT::isVoid && \"Didn't find type to promote to!\""
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/TargetLowering.h"
, 1063, __extension__ __PRETTY_FUNCTION__))
;
1064 } while (!isTypeLegal(NVT) ||
1065 getOperationAction(Op, NVT) == Promote);
1066 return NVT;
1067 }
1068
1069 /// Return the EVT corresponding to this LLVM type. This is fixed by the LLVM
1070 /// operations except for the pointer size. If AllowUnknown is true, this
1071 /// will return MVT::Other for types with no EVT counterpart (e.g. structs),
1072 /// otherwise it will assert.
1073 EVT getValueType(const DataLayout &DL, Type *Ty,
1074 bool AllowUnknown = false) const {
1075 // Lower scalar pointers to native pointer types.
1076 if (PointerType *PTy = dyn_cast<PointerType>(Ty))
16
Taking false branch
1077 return getPointerTy(DL, PTy->getAddressSpace());
1078
1079 if (Ty->isVectorTy()) {
17
Called C++ object pointer is null
1080 VectorType *VTy = cast<VectorType>(Ty);
1081 Type *Elm = VTy->getElementType();
1082 // Lower vectors of pointers to native pointer types.
1083 if (PointerType *PT = dyn_cast<PointerType>(Elm)) {
1084 EVT PointerTy(getPointerTy(DL, PT->getAddressSpace()));
1085 Elm = PointerTy.getTypeForEVT(Ty->getContext());
1086 }
1087
1088 return EVT::getVectorVT(Ty->getContext(), EVT::getEVT(Elm, false),
1089 VTy->getNumElements());
1090 }
1091 return EVT::getEVT(Ty, AllowUnknown);
1092 }
1093
1094 /// Return the MVT corresponding to this LLVM type. See getValueType.
1095 MVT getSimpleValueType(const DataLayout &DL, Type *Ty,
1096 bool AllowUnknown = false) const {
1097 return getValueType(DL, Ty, AllowUnknown).getSimpleVT();
1098 }
1099
1100 /// Return the desired alignment for ByVal or InAlloca aggregate function
1101 /// arguments in the caller parameter area. This is the actual alignment, not
1102 /// its logarithm.
1103 virtual unsigned getByValTypeAlignment(Type *Ty, const DataLayout &DL) const;
1104
1105 /// Return the type of registers that this ValueType will eventually require.
1106 MVT getRegisterType(MVT VT) const {
1107 assert((unsigned)VT.SimpleTy < array_lengthof(RegisterTypeForVT))(static_cast <bool> ((unsigned)VT.SimpleTy < array_lengthof
(RegisterTypeForVT)) ? void (0) : __assert_fail ("(unsigned)VT.SimpleTy < array_lengthof(RegisterTypeForVT)"
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/TargetLowering.h"
, 1107, __extension__ __PRETTY_FUNCTION__))
;
1108 return RegisterTypeForVT[VT.SimpleTy];
1109 }
1110
1111 /// Return the type of registers that this ValueType will eventually require.
1112 MVT getRegisterType(LLVMContext &Context, EVT VT) const {
1113 if (VT.isSimple()) {
1114 assert((unsigned)VT.getSimpleVT().SimpleTy <(static_cast <bool> ((unsigned)VT.getSimpleVT().SimpleTy
< array_lengthof(RegisterTypeForVT)) ? void (0) : __assert_fail
("(unsigned)VT.getSimpleVT().SimpleTy < array_lengthof(RegisterTypeForVT)"
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/TargetLowering.h"
, 1115, __extension__ __PRETTY_FUNCTION__))
1115 array_lengthof(RegisterTypeForVT))(static_cast <bool> ((unsigned)VT.getSimpleVT().SimpleTy
< array_lengthof(RegisterTypeForVT)) ? void (0) : __assert_fail
("(unsigned)VT.getSimpleVT().SimpleTy < array_lengthof(RegisterTypeForVT)"
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/TargetLowering.h"
, 1115, __extension__ __PRETTY_FUNCTION__))
;
1116 return RegisterTypeForVT[VT.getSimpleVT().SimpleTy];
1117 }
1118 if (VT.isVector()) {
1119 EVT VT1;
1120 MVT RegisterVT;
1121 unsigned NumIntermediates;
1122 (void)getVectorTypeBreakdown(Context, VT, VT1,
1123 NumIntermediates, RegisterVT);
1124 return RegisterVT;
1125 }
1126 if (VT.isInteger()) {
1127 return getRegisterType(Context, getTypeToTransformTo(Context, VT));
1128 }
1129 llvm_unreachable("Unsupported extended type!")::llvm::llvm_unreachable_internal("Unsupported extended type!"
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/TargetLowering.h"
, 1129)
;
1130 }
1131
1132 /// Return the number of registers that this ValueType will eventually
1133 /// require.
1134 ///
1135 /// This is one for any types promoted to live in larger registers, but may be
1136 /// more than one for types (like i64) that are split into pieces. For types
1137 /// like i140, which are first promoted then expanded, it is the number of
1138 /// registers needed to hold all the bits of the original type. For an i140
1139 /// on a 32 bit machine this means 5 registers.
1140 unsigned getNumRegisters(LLVMContext &Context, EVT VT) const {
1141 if (VT.isSimple()) {
1142 assert((unsigned)VT.getSimpleVT().SimpleTy <(static_cast <bool> ((unsigned)VT.getSimpleVT().SimpleTy
< array_lengthof(NumRegistersForVT)) ? void (0) : __assert_fail
("(unsigned)VT.getSimpleVT().SimpleTy < array_lengthof(NumRegistersForVT)"
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/TargetLowering.h"
, 1143, __extension__ __PRETTY_FUNCTION__))
1143 array_lengthof(NumRegistersForVT))(static_cast <bool> ((unsigned)VT.getSimpleVT().SimpleTy
< array_lengthof(NumRegistersForVT)) ? void (0) : __assert_fail
("(unsigned)VT.getSimpleVT().SimpleTy < array_lengthof(NumRegistersForVT)"
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/TargetLowering.h"
, 1143, __extension__ __PRETTY_FUNCTION__))
;
1144 return NumRegistersForVT[VT.getSimpleVT().SimpleTy];
1145 }
1146 if (VT.isVector()) {
1147 EVT VT1;
1148 MVT VT2;
1149 unsigned NumIntermediates;
1150 return getVectorTypeBreakdown(Context, VT, VT1, NumIntermediates, VT2);
1151 }
1152 if (VT.isInteger()) {
1153 unsigned BitWidth = VT.getSizeInBits();
1154 unsigned RegWidth = getRegisterType(Context, VT).getSizeInBits();
1155 return (BitWidth + RegWidth - 1) / RegWidth;
1156 }
1157 llvm_unreachable("Unsupported extended type!")::llvm::llvm_unreachable_internal("Unsupported extended type!"
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/TargetLowering.h"
, 1157)
;
1158 }
1159
1160 /// Certain combinations of ABIs, Targets and features require that types
1161 /// are legal for some operations and not for other operations.
1162 /// For MIPS all vector types must be passed through the integer register set.
1163 virtual MVT getRegisterTypeForCallingConv(LLVMContext &Context,
1164 EVT VT) const {
1165 return getRegisterType(Context, VT);
1166 }
1167
1168 /// Certain targets require unusual breakdowns of certain types. For MIPS,
1169 /// this occurs when a vector type is used, as vector are passed through the
1170 /// integer register set.
1171 virtual unsigned getNumRegistersForCallingConv(LLVMContext &Context,
1172 EVT VT) const {
1173 return getNumRegisters(Context, VT);
1174 }
1175
1176 /// Certain targets have context senstive alignment requirements, where one
1177 /// type has the alignment requirement of another type.
1178 virtual unsigned getABIAlignmentForCallingConv(Type *ArgTy,
1179 DataLayout DL) const {
1180 return DL.getABITypeAlignment(ArgTy);
1181 }
1182
1183 /// If true, then instruction selection should seek to shrink the FP constant
1184 /// of the specified type to a smaller type in order to save space and / or
1185 /// reduce runtime.
1186 virtual bool ShouldShrinkFPConstant(EVT) const { return true; }
1187
1188 // Return true if it is profitable to reduce the given load node to a smaller
1189 // type.
1190 //
1191 // e.g. (i16 (trunc (i32 (load x))) -> i16 load x should be performed
1192 virtual bool shouldReduceLoadWidth(SDNode *Load,
1193 ISD::LoadExtType ExtTy,
1194 EVT NewVT) const {
1195 return true;
1196 }
1197
1198 /// When splitting a value of the specified type into parts, does the Lo
1199 /// or Hi part come first? This usually follows the endianness, except
1200 /// for ppcf128, where the Hi part always comes first.
1201 bool hasBigEndianPartOrdering(EVT VT, const DataLayout &DL) const {
1202 return DL.isBigEndian() || VT == MVT::ppcf128;
1203 }
1204
1205 /// If true, the target has custom DAG combine transformations that it can
1206 /// perform for the specified node.
1207 bool hasTargetDAGCombine(ISD::NodeType NT) const {
1208 assert(unsigned(NT >> 3) < array_lengthof(TargetDAGCombineArray))(static_cast <bool> (unsigned(NT >> 3) < array_lengthof
(TargetDAGCombineArray)) ? void (0) : __assert_fail ("unsigned(NT >> 3) < array_lengthof(TargetDAGCombineArray)"
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/TargetLowering.h"
, 1208, __extension__ __PRETTY_FUNCTION__))
;
1209 return TargetDAGCombineArray[NT >> 3] & (1 << (NT&7));
1210 }
1211
1212 unsigned getGatherAllAliasesMaxDepth() const {
1213 return GatherAllAliasesMaxDepth;
1214 }
1215
1216 /// Returns the size of the platform's va_list object.
1217 virtual unsigned getVaListSizeInBits(const DataLayout &DL) const {
1218 return getPointerTy(DL).getSizeInBits();
1219 }
1220
1221 /// Get maximum # of store operations permitted for llvm.memset
1222 ///
1223 /// This function returns the maximum number of store operations permitted
1224 /// to replace a call to llvm.memset. The value is set by the target at the
1225 /// performance threshold for such a replacement. If OptSize is true,
1226 /// return the limit for functions that have OptSize attribute.
1227 unsigned getMaxStoresPerMemset(bool OptSize) const {
1228 return OptSize ? MaxStoresPerMemsetOptSize : MaxStoresPerMemset;
1229 }
1230
1231 /// Get maximum # of store operations permitted for llvm.memcpy
1232 ///
1233 /// This function returns the maximum number of store operations permitted
1234 /// to replace a call to llvm.memcpy. The value is set by the target at the
1235 /// performance threshold for such a replacement. If OptSize is true,
1236 /// return the limit for functions that have OptSize attribute.
1237 unsigned getMaxStoresPerMemcpy(bool OptSize) const {
1238 return OptSize ? MaxStoresPerMemcpyOptSize : MaxStoresPerMemcpy;
1239 }
1240
1241 /// \brief Get maximum # of store operations to be glued together
1242 ///
1243 /// This function returns the maximum number of store operations permitted
1244 /// to glue together during lowering of llvm.memcpy. The value is set by
1245 // the target at the performance threshold for such a replacement.
1246 virtual unsigned getMaxGluedStoresPerMemcpy() const {
1247 return MaxGluedStoresPerMemcpy;
1248 }
1249
1250 /// Get maximum # of load operations permitted for memcmp
1251 ///
1252 /// This function returns the maximum number of load operations permitted
1253 /// to replace a call to memcmp. The value is set by the target at the
1254 /// performance threshold for such a replacement. If OptSize is true,
1255 /// return the limit for functions that have OptSize attribute.
1256 unsigned getMaxExpandSizeMemcmp(bool OptSize) const {
1257 return OptSize ? MaxLoadsPerMemcmpOptSize : MaxLoadsPerMemcmp;
1258 }
1259
1260 /// For memcmp expansion when the memcmp result is only compared equal or
1261 /// not-equal to 0, allow up to this number of load pairs per block. As an
1262 /// example, this may allow 'memcmp(a, b, 3) == 0' in a single block:
1263 /// a0 = load2bytes &a[0]
1264 /// b0 = load2bytes &b[0]
1265 /// a2 = load1byte &a[2]
1266 /// b2 = load1byte &b[2]
1267 /// r = cmp eq (a0 ^ b0 | a2 ^ b2), 0
1268 virtual unsigned getMemcmpEqZeroLoadsPerBlock() const {
1269 return 1;
1270 }
1271
1272 /// Get maximum # of store operations permitted for llvm.memmove
1273 ///
1274 /// This function returns the maximum number of store operations permitted
1275 /// to replace a call to llvm.memmove. The value is set by the target at the
1276 /// performance threshold for such a replacement. If OptSize is true,
1277 /// return the limit for functions that have OptSize attribute.
1278 unsigned getMaxStoresPerMemmove(bool OptSize) const {
1279 return OptSize ? MaxStoresPerMemmoveOptSize : MaxStoresPerMemmove;
1280 }
1281
1282 /// Determine if the target supports unaligned memory accesses.
1283 ///
1284 /// This function returns true if the target allows unaligned memory accesses
1285 /// of the specified type in the given address space. If true, it also returns
1286 /// whether the unaligned memory access is "fast" in the last argument by
1287 /// reference. This is used, for example, in situations where an array
1288 /// copy/move/set is converted to a sequence of store operations. Its use
1289 /// helps to ensure that such replacements don't generate code that causes an
1290 /// alignment error (trap) on the target machine.
1291 virtual bool allowsMisalignedMemoryAccesses(EVT,
1292 unsigned AddrSpace = 0,
1293 unsigned Align = 1,
1294 bool * /*Fast*/ = nullptr) const {
1295 return false;
1296 }
1297
1298 /// Return true if the target supports a memory access of this type for the
1299 /// given address space and alignment. If the access is allowed, the optional
1300 /// final parameter returns if the access is also fast (as defined by the
1301 /// target).
1302 bool allowsMemoryAccess(LLVMContext &Context, const DataLayout &DL, EVT VT,
1303 unsigned AddrSpace = 0, unsigned Alignment = 1,
1304 bool *Fast = nullptr) const;
1305
1306 /// Returns the target specific optimal type for load and store operations as
1307 /// a result of memset, memcpy, and memmove lowering.
1308 ///
1309 /// If DstAlign is zero that means it's safe to destination alignment can
1310 /// satisfy any constraint. Similarly if SrcAlign is zero it means there isn't
1311 /// a need to check it against alignment requirement, probably because the
1312 /// source does not need to be loaded. If 'IsMemset' is true, that means it's
1313 /// expanding a memset. If 'ZeroMemset' is true, that means it's a memset of
1314 /// zero. 'MemcpyStrSrc' indicates whether the memcpy source is constant so it
1315 /// does not need to be loaded. It returns EVT::Other if the type should be
1316 /// determined using generic target-independent logic.
1317 virtual EVT getOptimalMemOpType(uint64_t /*Size*/,
1318 unsigned /*DstAlign*/, unsigned /*SrcAlign*/,
1319 bool /*IsMemset*/,
1320 bool /*ZeroMemset*/,
1321 bool /*MemcpyStrSrc*/,
1322 MachineFunction &/*MF*/) const {
1323 return MVT::Other;
1324 }
1325
1326 /// Returns true if it's safe to use load / store of the specified type to
1327 /// expand memcpy / memset inline.
1328 ///
1329 /// This is mostly true for all types except for some special cases. For
1330 /// example, on X86 targets without SSE2 f64 load / store are done with fldl /
1331 /// fstpl which also does type conversion. Note the specified type doesn't
1332 /// have to be legal as the hook is used before type legalization.
1333 virtual bool isSafeMemOpType(MVT /*VT*/) const { return true; }
1334
1335 /// Determine if we should use _setjmp or setjmp to implement llvm.setjmp.
1336 bool usesUnderscoreSetJmp() const {
1337 return UseUnderscoreSetJmp;
1338 }
1339
1340 /// Determine if we should use _longjmp or longjmp to implement llvm.longjmp.
1341 bool usesUnderscoreLongJmp() const {
1342 return UseUnderscoreLongJmp;
1343 }
1344
1345 /// Return lower limit for number of blocks in a jump table.
1346 virtual unsigned getMinimumJumpTableEntries() const;
1347
1348 /// Return lower limit of the density in a jump table.
1349 unsigned getMinimumJumpTableDensity(bool OptForSize) const;
1350
1351 /// Return upper limit for number of entries in a jump table.
1352 /// Zero if no limit.
1353 unsigned getMaximumJumpTableSize() const;
1354
1355 virtual bool isJumpTableRelative() const {
1356 return TM.isPositionIndependent();
1357 }
1358
1359 /// If a physical register, this specifies the register that
1360 /// llvm.savestack/llvm.restorestack should save and restore.
1361 unsigned getStackPointerRegisterToSaveRestore() const {
1362 return StackPointerRegisterToSaveRestore;
1363 }
1364
1365 /// If a physical register, this returns the register that receives the
1366 /// exception address on entry to an EH pad.
1367 virtual unsigned
1368 getExceptionPointerRegister(const Constant *PersonalityFn) const {
1369 // 0 is guaranteed to be the NoRegister value on all targets
1370 return 0;
1371 }
1372
1373 /// If a physical register, this returns the register that receives the
1374 /// exception typeid on entry to a landing pad.
1375 virtual unsigned
1376 getExceptionSelectorRegister(const Constant *PersonalityFn) const {
1377 // 0 is guaranteed to be the NoRegister value on all targets
1378 return 0;
1379 }
1380
1381 virtual bool needsFixedCatchObjects() const {
1382 report_fatal_error("Funclet EH is not implemented for this target");
1383 }
1384
1385 /// Returns the target's jmp_buf size in bytes (if never set, the default is
1386 /// 200)
1387 unsigned getJumpBufSize() const {
1388 return JumpBufSize;
1389 }
1390
1391 /// Returns the target's jmp_buf alignment in bytes (if never set, the default
1392 /// is 0)
1393 unsigned getJumpBufAlignment() const {
1394 return JumpBufAlignment;
1395 }
1396
1397 /// Return the minimum stack alignment of an argument.
1398 unsigned getMinStackArgumentAlignment() const {
1399 return MinStackArgumentAlignment;
1400 }
1401
1402 /// Return the minimum function alignment.
1403 unsigned getMinFunctionAlignment() const {
1404 return MinFunctionAlignment;
1405 }
1406
1407 /// Return the preferred function alignment.
1408 unsigned getPrefFunctionAlignment() const {
1409 return PrefFunctionAlignment;
1410 }
1411
1412 /// Return the preferred loop alignment.
1413 virtual unsigned getPrefLoopAlignment(MachineLoop *ML = nullptr) const {
1414 return PrefLoopAlignment;
1415 }
1416
1417 /// If the target has a standard location for the stack protector guard,
1418 /// returns the address of that location. Otherwise, returns nullptr.
1419 /// DEPRECATED: please override useLoadStackGuardNode and customize
1420 /// LOAD_STACK_GUARD, or customize \@llvm.stackguard().
1421 virtual Value *getIRStackGuard(IRBuilder<> &IRB) const;
1422
1423 /// Inserts necessary declarations for SSP (stack protection) purpose.
1424 /// Should be used only when getIRStackGuard returns nullptr.
1425 virtual void insertSSPDeclarations(Module &M) const;
1426
1427 /// Return the variable that's previously inserted by insertSSPDeclarations,
1428 /// if any, otherwise return nullptr. Should be used only when
1429 /// getIRStackGuard returns nullptr.
1430 virtual Value *getSDagStackGuard(const Module &M) const;
1431
1432 /// If this function returns true, stack protection checks should XOR the
1433 /// frame pointer (or whichever pointer is used to address locals) into the
1434 /// stack guard value before checking it. getIRStackGuard must return nullptr
1435 /// if this returns true.
1436 virtual bool useStackGuardXorFP() const { return false; }
1437
1438 /// If the target has a standard stack protection check function that
1439 /// performs validation and error handling, returns the function. Otherwise,
1440 /// returns nullptr. Must be previously inserted by insertSSPDeclarations.
1441 /// Should be used only when getIRStackGuard returns nullptr.
1442 virtual Value *getSSPStackGuardCheck(const Module &M) const;
1443
1444protected:
1445 Value *getDefaultSafeStackPointerLocation(IRBuilder<> &IRB,
1446 bool UseTLS) const;
1447
1448public:
1449 /// Returns the target-specific address of the unsafe stack pointer.
1450 virtual Value *getSafeStackPointerLocation(IRBuilder<> &IRB) const;
1451
1452 /// Returns the name of the symbol used to emit stack probes or the empty
1453 /// string if not applicable.
1454 virtual StringRef getStackProbeSymbolName(MachineFunction &MF) const {
1455 return "";
1456 }
1457
1458 /// Returns true if a cast between SrcAS and DestAS is a noop.
1459 virtual bool isNoopAddrSpaceCast(unsigned SrcAS, unsigned DestAS) const {
1460 return false;
1461 }
1462
1463 /// Returns true if a cast from SrcAS to DestAS is "cheap", such that e.g. we
1464 /// are happy to sink it into basic blocks.
1465 virtual bool isCheapAddrSpaceCast(unsigned SrcAS, unsigned DestAS) const {
1466 return isNoopAddrSpaceCast(SrcAS, DestAS);
1467 }
1468
1469 /// Return true if the pointer arguments to CI should be aligned by aligning
1470 /// the object whose address is being passed. If so then MinSize is set to the
1471 /// minimum size the object must be to be aligned and PrefAlign is set to the
1472 /// preferred alignment.
1473 virtual bool shouldAlignPointerArgs(CallInst * /*CI*/, unsigned & /*MinSize*/,
1474 unsigned & /*PrefAlign*/) const {
1475 return false;
1476 }
1477
1478 //===--------------------------------------------------------------------===//
1479 /// \name Helpers for TargetTransformInfo implementations
1480 /// @{
1481
1482 /// Get the ISD node that corresponds to the Instruction class opcode.
1483 int InstructionOpcodeToISD(unsigned Opcode) const;
1484
1485 /// Estimate the cost of type-legalization and the legalized type.
1486 std::pair<int, MVT> getTypeLegalizationCost(const DataLayout &DL,
1487 Type *Ty) const;
1488
1489 /// @}
1490
1491 //===--------------------------------------------------------------------===//
1492 /// \name Helpers for atomic expansion.
1493 /// @{
1494
1495 /// Returns the maximum atomic operation size (in bits) supported by
1496 /// the backend. Atomic operations greater than this size (as well
1497 /// as ones that are not naturally aligned), will be expanded by
1498 /// AtomicExpandPass into an __atomic_* library call.
1499 unsigned getMaxAtomicSizeInBitsSupported() const {
1500 return MaxAtomicSizeInBitsSupported;
1501 }
1502
1503 /// Returns the size of the smallest cmpxchg or ll/sc instruction
1504 /// the backend supports. Any smaller operations are widened in
1505 /// AtomicExpandPass.
1506 ///
1507 /// Note that *unlike* operations above the maximum size, atomic ops
1508 /// are still natively supported below the minimum; they just
1509 /// require a more complex expansion.
1510 unsigned getMinCmpXchgSizeInBits() const { return MinCmpXchgSizeInBits; }
1511
1512 /// Whether the target supports unaligned atomic operations.
1513 bool supportsUnalignedAtomics() const { return SupportsUnalignedAtomics; }
1514
1515 /// Whether AtomicExpandPass should automatically insert fences and reduce
1516 /// ordering for this atomic. This should be true for most architectures with
1517 /// weak memory ordering. Defaults to false.
1518 virtual bool shouldInsertFencesForAtomic(const Instruction *I) const {
1519 return false;
1520 }
1521
1522 /// Perform a load-linked operation on Addr, returning a "Value *" with the
1523 /// corresponding pointee type. This may entail some non-trivial operations to
1524 /// truncate or reconstruct types that will be illegal in the backend. See
1525 /// ARMISelLowering for an example implementation.
1526 virtual Value *emitLoadLinked(IRBuilder<> &Builder, Value *Addr,
1527 AtomicOrdering Ord) const {
1528 llvm_unreachable("Load linked unimplemented on this target")::llvm::llvm_unreachable_internal("Load linked unimplemented on this target"
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/TargetLowering.h"
, 1528)
;
1529 }
1530
1531 /// Perform a store-conditional operation to Addr. Return the status of the
1532 /// store. This should be 0 if the store succeeded, non-zero otherwise.
1533 virtual Value *emitStoreConditional(IRBuilder<> &Builder, Value *Val,
1534 Value *Addr, AtomicOrdering Ord) const {
1535 llvm_unreachable("Store conditional unimplemented on this target")::llvm::llvm_unreachable_internal("Store conditional unimplemented on this target"
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/TargetLowering.h"
, 1535)
;
1536 }
1537
1538 /// Inserts in the IR a target-specific intrinsic specifying a fence.
1539 /// It is called by AtomicExpandPass before expanding an
1540 /// AtomicRMW/AtomicCmpXchg/AtomicStore/AtomicLoad
1541 /// if shouldInsertFencesForAtomic returns true.
1542 ///
1543 /// Inst is the original atomic instruction, prior to other expansions that
1544 /// may be performed.
1545 ///
1546 /// This function should either return a nullptr, or a pointer to an IR-level
1547 /// Instruction*. Even complex fence sequences can be represented by a
1548 /// single Instruction* through an intrinsic to be lowered later.
1549 /// Backends should override this method to produce target-specific intrinsic
1550 /// for their fences.
1551 /// FIXME: Please note that the default implementation here in terms of
1552 /// IR-level fences exists for historical/compatibility reasons and is
1553 /// *unsound* ! Fences cannot, in general, be used to restore sequential
1554 /// consistency. For example, consider the following example:
1555 /// atomic<int> x = y = 0;
1556 /// int r1, r2, r3, r4;
1557 /// Thread 0:
1558 /// x.store(1);
1559 /// Thread 1:
1560 /// y.store(1);
1561 /// Thread 2:
1562 /// r1 = x.load();
1563 /// r2 = y.load();
1564 /// Thread 3:
1565 /// r3 = y.load();
1566 /// r4 = x.load();
1567 /// r1 = r3 = 1 and r2 = r4 = 0 is impossible as long as the accesses are all
1568 /// seq_cst. But if they are lowered to monotonic accesses, no amount of
1569 /// IR-level fences can prevent it.
1570 /// @{
1571 virtual Instruction *emitLeadingFence(IRBuilder<> &Builder, Instruction *Inst,
1572 AtomicOrdering Ord) const {
1573 if (isReleaseOrStronger(Ord) && Inst->hasAtomicStore())
1574 return Builder.CreateFence(Ord);
1575 else
1576 return nullptr;
1577 }
1578
1579 virtual Instruction *emitTrailingFence(IRBuilder<> &Builder,
1580 Instruction *Inst,
1581 AtomicOrdering Ord) const {
1582 if (isAcquireOrStronger(Ord))
1583 return Builder.CreateFence(Ord);
1584 else
1585 return nullptr;
1586 }
1587 /// @}
1588
1589 // Emits code that executes when the comparison result in the ll/sc
1590 // expansion of a cmpxchg instruction is such that the store-conditional will
1591 // not execute. This makes it possible to balance out the load-linked with
1592 // a dedicated instruction, if desired.
1593 // E.g., on ARM, if ldrex isn't followed by strex, the exclusive monitor would
1594 // be unnecessarily held, except if clrex, inserted by this hook, is executed.
1595 virtual void emitAtomicCmpXchgNoStoreLLBalance(IRBuilder<> &Builder) const {}
1596
1597 /// Returns true if the given (atomic) store should be expanded by the
1598 /// IR-level AtomicExpand pass into an "atomic xchg" which ignores its input.
1599 virtual bool shouldExpandAtomicStoreInIR(StoreInst *SI) const {
1600 return false;
1601 }
1602
1603 /// Returns true if arguments should be sign-extended in lib calls.
1604 virtual bool shouldSignExtendTypeInLibCall(EVT Type, bool IsSigned) const {
1605 return IsSigned;
1606 }
1607
1608 /// Returns how the given (atomic) load should be expanded by the
1609 /// IR-level AtomicExpand pass.
1610 virtual AtomicExpansionKind shouldExpandAtomicLoadInIR(LoadInst *LI) const {
1611 return AtomicExpansionKind::None;
1612 }
1613
1614 /// Returns true if the given atomic cmpxchg should be expanded by the
1615 /// IR-level AtomicExpand pass into a load-linked/store-conditional sequence
1616 /// (through emitLoadLinked() and emitStoreConditional()).
1617 virtual bool shouldExpandAtomicCmpXchgInIR(AtomicCmpXchgInst *AI) const {
1618 return false;
1619 }
1620
1621 /// Returns how the IR-level AtomicExpand pass should expand the given
1622 /// AtomicRMW, if at all. Default is to never expand.
1623 virtual AtomicExpansionKind shouldExpandAtomicRMWInIR(AtomicRMWInst *) const {
1624 return AtomicExpansionKind::None;
1625 }
1626
1627 /// On some platforms, an AtomicRMW that never actually modifies the value
1628 /// (such as fetch_add of 0) can be turned into a fence followed by an
1629 /// atomic load. This may sound useless, but it makes it possible for the
1630 /// processor to keep the cacheline shared, dramatically improving
1631 /// performance. And such idempotent RMWs are useful for implementing some
1632 /// kinds of locks, see for example (justification + benchmarks):
1633 /// http://www.hpl.hp.com/techreports/2012/HPL-2012-68.pdf
1634 /// This method tries doing that transformation, returning the atomic load if
1635 /// it succeeds, and nullptr otherwise.
1636 /// If shouldExpandAtomicLoadInIR returns true on that load, it will undergo
1637 /// another round of expansion.
1638 virtual LoadInst *
1639 lowerIdempotentRMWIntoFencedLoad(AtomicRMWInst *RMWI) const {
1640 return nullptr;
1641 }
1642
1643 /// Returns how the platform's atomic operations are extended (ZERO_EXTEND,
1644 /// SIGN_EXTEND, or ANY_EXTEND).
1645 virtual ISD::NodeType getExtendForAtomicOps() const {
1646 return ISD::ZERO_EXTEND;
1647 }
1648
1649 /// @}
1650
1651 /// Returns true if we should normalize
1652 /// select(N0&N1, X, Y) => select(N0, select(N1, X, Y), Y) and
1653 /// select(N0|N1, X, Y) => select(N0, select(N1, X, Y, Y)) if it is likely
1654 /// that it saves us from materializing N0 and N1 in an integer register.
1655 /// Targets that are able to perform and/or on flags should return false here.
1656 virtual bool shouldNormalizeToSelectSequence(LLVMContext &Context,
1657 EVT VT) const {
1658 // If a target has multiple condition registers, then it likely has logical
1659 // operations on those registers.
1660 if (hasMultipleConditionRegisters())
1661 return false;
1662 // Only do the transform if the value won't be split into multiple
1663 // registers.
1664 LegalizeTypeAction Action = getTypeAction(Context, VT);
1665 return Action != TypeExpandInteger && Action != TypeExpandFloat &&
1666 Action != TypeSplitVector;
1667 }
1668
1669 /// Return true if a select of constants (select Cond, C1, C2) should be
1670 /// transformed into simple math ops with the condition value. For example:
1671 /// select Cond, C1, C1-1 --> add (zext Cond), C1-1
1672 virtual bool convertSelectOfConstantsToMath(EVT VT) const {
1673 return false;
1674 }
1675
1676 //===--------------------------------------------------------------------===//
1677 // TargetLowering Configuration Methods - These methods should be invoked by
1678 // the derived class constructor to configure this object for the target.
1679 //
1680protected:
1681 /// Specify how the target extends the result of integer and floating point
1682 /// boolean values from i1 to a wider type. See getBooleanContents.
1683 void setBooleanContents(BooleanContent Ty) {
1684 BooleanContents = Ty;
1685 BooleanFloatContents = Ty;
1686 }
1687
1688 /// Specify how the target extends the result of integer and floating point
1689 /// boolean values from i1 to a wider type. See getBooleanContents.
1690 void setBooleanContents(BooleanContent IntTy, BooleanContent FloatTy) {
1691 BooleanContents = IntTy;
1692 BooleanFloatContents = FloatTy;
1693 }
1694
1695 /// Specify how the target extends the result of a vector boolean value from a
1696 /// vector of i1 to a wider type. See getBooleanContents.
1697 void setBooleanVectorContents(BooleanContent Ty) {
1698 BooleanVectorContents = Ty;
1699 }
1700
1701 /// Specify the target scheduling preference.
1702 void setSchedulingPreference(Sched::Preference Pref) {
1703 SchedPreferenceInfo = Pref;
1704 }
1705
1706 /// Indicate whether this target prefers to use _setjmp to implement
1707 /// llvm.setjmp or the version without _. Defaults to false.
1708 void setUseUnderscoreSetJmp(bool Val) {
1709 UseUnderscoreSetJmp = Val;
1710 }
1711
1712 /// Indicate whether this target prefers to use _longjmp to implement
1713 /// llvm.longjmp or the version without _. Defaults to false.
1714 void setUseUnderscoreLongJmp(bool Val) {
1715 UseUnderscoreLongJmp = Val;
1716 }
1717
1718 /// Indicate the minimum number of blocks to generate jump tables.
1719 void setMinimumJumpTableEntries(unsigned Val);
1720
1721 /// Indicate the maximum number of entries in jump tables.
1722 /// Set to zero to generate unlimited jump tables.
1723 void setMaximumJumpTableSize(unsigned);
1724
1725 /// If set to a physical register, this specifies the register that
1726 /// llvm.savestack/llvm.restorestack should save and restore.
1727 void setStackPointerRegisterToSaveRestore(unsigned R) {
1728 StackPointerRegisterToSaveRestore = R;
1729 }
1730
1731 /// Tells the code generator that the target has multiple (allocatable)
1732 /// condition registers that can be used to store the results of comparisons
1733 /// for use by selects and conditional branches. With multiple condition
1734 /// registers, the code generator will not aggressively sink comparisons into
1735 /// the blocks of their users.
1736 void setHasMultipleConditionRegisters(bool hasManyRegs = true) {
1737 HasMultipleConditionRegisters = hasManyRegs;
1738 }
1739
1740 /// Tells the code generator that the target has BitExtract instructions.
1741 /// The code generator will aggressively sink "shift"s into the blocks of
1742 /// their users if the users will generate "and" instructions which can be
1743 /// combined with "shift" to BitExtract instructions.
1744 void setHasExtractBitsInsn(bool hasExtractInsn = true) {
1745 HasExtractBitsInsn = hasExtractInsn;
1746 }
1747
1748 /// Tells the code generator not to expand logic operations on comparison
1749 /// predicates into separate sequences that increase the amount of flow
1750 /// control.
1751 void setJumpIsExpensive(bool isExpensive = true);
1752
1753 /// Tells the code generator that this target supports floating point
1754 /// exceptions and cares about preserving floating point exception behavior.
1755 void setHasFloatingPointExceptions(bool FPExceptions = true) {
1756 HasFloatingPointExceptions = FPExceptions;
1757 }
1758
1759 /// Tells the code generator which bitwidths to bypass.
1760 void addBypassSlowDiv(unsigned int SlowBitWidth, unsigned int FastBitWidth) {
1761 BypassSlowDivWidths[SlowBitWidth] = FastBitWidth;
1762 }
1763
1764 /// Add the specified register class as an available regclass for the
1765 /// specified value type. This indicates the selector can handle values of
1766 /// that class natively.
1767 void addRegisterClass(MVT VT, const TargetRegisterClass *RC) {
1768 assert((unsigned)VT.SimpleTy < array_lengthof(RegClassForVT))(static_cast <bool> ((unsigned)VT.SimpleTy < array_lengthof
(RegClassForVT)) ? void (0) : __assert_fail ("(unsigned)VT.SimpleTy < array_lengthof(RegClassForVT)"
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/TargetLowering.h"
, 1768, __extension__ __PRETTY_FUNCTION__))
;
1769 RegClassForVT[VT.SimpleTy] = RC;
1770 }
1771
1772 /// Return the largest legal super-reg register class of the register class
1773 /// for the specified type and its associated "cost".
1774 virtual std::pair<const TargetRegisterClass *, uint8_t>
1775 findRepresentativeClass(const TargetRegisterInfo *TRI, MVT VT) const;
1776
1777 /// Once all of the register classes are added, this allows us to compute
1778 /// derived properties we expose.
1779 void computeRegisterProperties(const TargetRegisterInfo *TRI);
1780
1781 /// Indicate that the specified operation does not work with the specified
1782 /// type and indicate what to do about it. Note that VT may refer to either
1783 /// the type of a result or that of an operand of Op.
1784 void setOperationAction(unsigned Op, MVT VT,
1785 LegalizeAction Action) {
1786 assert(Op < array_lengthof(OpActions[0]) && "Table isn't big enough!")(static_cast <bool> (Op < array_lengthof(OpActions[0
]) && "Table isn't big enough!") ? void (0) : __assert_fail
("Op < array_lengthof(OpActions[0]) && \"Table isn't big enough!\""
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/TargetLowering.h"
, 1786, __extension__ __PRETTY_FUNCTION__))
;
1787 OpActions[(unsigned)VT.SimpleTy][Op] = Action;
1788 }
1789
1790 /// Indicate that the specified load with extension does not work with the
1791 /// specified type and indicate what to do about it.
1792 void setLoadExtAction(unsigned ExtType, MVT ValVT, MVT MemVT,
1793 LegalizeAction Action) {
1794 assert(ExtType < ISD::LAST_LOADEXT_TYPE && ValVT.isValid() &&(static_cast <bool> (ExtType < ISD::LAST_LOADEXT_TYPE
&& ValVT.isValid() && MemVT.isValid() &&
"Table isn't big enough!") ? void (0) : __assert_fail ("ExtType < ISD::LAST_LOADEXT_TYPE && ValVT.isValid() && MemVT.isValid() && \"Table isn't big enough!\""
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/TargetLowering.h"
, 1795, __extension__ __PRETTY_FUNCTION__))
1795 MemVT.isValid() && "Table isn't big enough!")(static_cast <bool> (ExtType < ISD::LAST_LOADEXT_TYPE
&& ValVT.isValid() && MemVT.isValid() &&
"Table isn't big enough!") ? void (0) : __assert_fail ("ExtType < ISD::LAST_LOADEXT_TYPE && ValVT.isValid() && MemVT.isValid() && \"Table isn't big enough!\""
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/TargetLowering.h"
, 1795, __extension__ __PRETTY_FUNCTION__))
;
1796 assert((unsigned)Action < 0x10 && "too many bits for bitfield array")(static_cast <bool> ((unsigned)Action < 0x10 &&
"too many bits for bitfield array") ? void (0) : __assert_fail
("(unsigned)Action < 0x10 && \"too many bits for bitfield array\""
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/TargetLowering.h"
, 1796, __extension__ __PRETTY_FUNCTION__))
;
1797 unsigned Shift = 4 * ExtType;
1798 LoadExtActions[ValVT.SimpleTy][MemVT.SimpleTy] &= ~((uint16_t)0xF << Shift);
1799 LoadExtActions[ValVT.SimpleTy][MemVT.SimpleTy] |= (uint16_t)Action << Shift;
1800 }
1801
1802 /// Indicate that the specified truncating store does not work with the
1803 /// specified type and indicate what to do about it.
1804 void setTruncStoreAction(MVT ValVT, MVT MemVT,
1805 LegalizeAction Action) {
1806 assert(ValVT.isValid() && MemVT.isValid() && "Table isn't big enough!")(static_cast <bool> (ValVT.isValid() && MemVT.isValid
() && "Table isn't big enough!") ? void (0) : __assert_fail
("ValVT.isValid() && MemVT.isValid() && \"Table isn't big enough!\""
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/TargetLowering.h"
, 1806, __extension__ __PRETTY_FUNCTION__))
;
1807 TruncStoreActions[(unsigned)ValVT.SimpleTy][MemVT.SimpleTy] = Action;
1808 }
1809
1810 /// Indicate that the specified indexed load does or does not work with the
1811 /// specified type and indicate what to do abort it.
1812 ///
1813 /// NOTE: All indexed mode loads are initialized to Expand in
1814 /// TargetLowering.cpp
1815 void setIndexedLoadAction(unsigned IdxMode, MVT VT,
1816 LegalizeAction Action) {
1817 assert(VT.isValid() && IdxMode < ISD::LAST_INDEXED_MODE &&(static_cast <bool> (VT.isValid() && IdxMode <
ISD::LAST_INDEXED_MODE && (unsigned)Action < 0xf &&
"Table isn't big enough!") ? void (0) : __assert_fail ("VT.isValid() && IdxMode < ISD::LAST_INDEXED_MODE && (unsigned)Action < 0xf && \"Table isn't big enough!\""
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/TargetLowering.h"
, 1818, __extension__ __PRETTY_FUNCTION__))
1818 (unsigned)Action < 0xf && "Table isn't big enough!")(static_cast <bool> (VT.isValid() && IdxMode <
ISD::LAST_INDEXED_MODE && (unsigned)Action < 0xf &&
"Table isn't big enough!") ? void (0) : __assert_fail ("VT.isValid() && IdxMode < ISD::LAST_INDEXED_MODE && (unsigned)Action < 0xf && \"Table isn't big enough!\""
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/TargetLowering.h"
, 1818, __extension__ __PRETTY_FUNCTION__))
;
1819 // Load action are kept in the upper half.
1820 IndexedModeActions[(unsigned)VT.SimpleTy][IdxMode] &= ~0xf0;
1821 IndexedModeActions[(unsigned)VT.SimpleTy][IdxMode] |= ((uint8_t)Action) <<4;
1822 }
1823
1824 /// Indicate that the specified indexed store does or does not work with the
1825 /// specified type and indicate what to do about it.
1826 ///
1827 /// NOTE: All indexed mode stores are initialized to Expand in
1828 /// TargetLowering.cpp
1829 void setIndexedStoreAction(unsigned IdxMode, MVT VT,
1830 LegalizeAction Action) {
1831 assert(VT.isValid() && IdxMode < ISD::LAST_INDEXED_MODE &&(static_cast <bool> (VT.isValid() && IdxMode <
ISD::LAST_INDEXED_MODE && (unsigned)Action < 0xf &&
"Table isn't big enough!") ? void (0) : __assert_fail ("VT.isValid() && IdxMode < ISD::LAST_INDEXED_MODE && (unsigned)Action < 0xf && \"Table isn't big enough!\""
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/TargetLowering.h"
, 1832, __extension__ __PRETTY_FUNCTION__))
1832 (unsigned)Action < 0xf && "Table isn't big enough!")(static_cast <bool> (VT.isValid() && IdxMode <
ISD::LAST_INDEXED_MODE && (unsigned)Action < 0xf &&
"Table isn't big enough!") ? void (0) : __assert_fail ("VT.isValid() && IdxMode < ISD::LAST_INDEXED_MODE && (unsigned)Action < 0xf && \"Table isn't big enough!\""
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/TargetLowering.h"
, 1832, __extension__ __PRETTY_FUNCTION__))
;
1833 // Store action are kept in the lower half.
1834 IndexedModeActions[(unsigned)VT.SimpleTy][IdxMode] &= ~0x0f;
1835 IndexedModeActions[(unsigned)VT.SimpleTy][IdxMode] |= ((uint8_t)Action);
1836 }
1837
1838 /// Indicate that the specified condition code is or isn't supported on the
1839 /// target and indicate what to do about it.
1840 void setCondCodeAction(ISD::CondCode CC, MVT VT,
1841 LegalizeAction Action) {
1842 assert(VT.isValid() && (unsigned)CC < array_lengthof(CondCodeActions) &&(static_cast <bool> (VT.isValid() && (unsigned)
CC < array_lengthof(CondCodeActions) && "Table isn't big enough!"
) ? void (0) : __assert_fail ("VT.isValid() && (unsigned)CC < array_lengthof(CondCodeActions) && \"Table isn't big enough!\""
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/TargetLowering.h"
, 1843, __extension__ __PRETTY_FUNCTION__))
1843 "Table isn't big enough!")(static_cast <bool> (VT.isValid() && (unsigned)
CC < array_lengthof(CondCodeActions) && "Table isn't big enough!"
) ? void (0) : __assert_fail ("VT.isValid() && (unsigned)CC < array_lengthof(CondCodeActions) && \"Table isn't big enough!\""
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/TargetLowering.h"
, 1843, __extension__ __PRETTY_FUNCTION__))
;
1844 assert((unsigned)Action < 0x10 && "too many bits for bitfield array")(static_cast <bool> ((unsigned)Action < 0x10 &&
"too many bits for bitfield array") ? void (0) : __assert_fail
("(unsigned)Action < 0x10 && \"too many bits for bitfield array\""
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/TargetLowering.h"
, 1844, __extension__ __PRETTY_FUNCTION__))
;
1845 /// The lower 3 bits of the SimpleTy index into Nth 4bit set from the 32-bit
1846 /// value and the upper 29 bits index into the second dimension of the array
1847 /// to select what 32-bit value to use.
1848 uint32_t Shift = 4 * (VT.SimpleTy & 0x7);
1849 CondCodeActions[CC][VT.SimpleTy >> 3] &= ~((uint32_t)0xF << Shift);
1850 CondCodeActions[CC][VT.SimpleTy >> 3] |= (uint32_t)Action << Shift;
1851 }
1852
1853 /// If Opc/OrigVT is specified as being promoted, the promotion code defaults
1854 /// to trying a larger integer/fp until it can find one that works. If that
1855 /// default is insufficient, this method can be used by the target to override
1856 /// the default.
1857 void AddPromotedToType(unsigned Opc, MVT OrigVT, MVT DestVT) {
1858 PromoteToType[std::make_pair(Opc, OrigVT.SimpleTy)] = DestVT.SimpleTy;
1859 }
1860
1861 /// Convenience method to set an operation to Promote and specify the type
1862 /// in a single call.
1863 void setOperationPromotedToType(unsigned Opc, MVT OrigVT, MVT DestVT) {
1864 setOperationAction(Opc, OrigVT, Promote);
1865 AddPromotedToType(Opc, OrigVT, DestVT);
1866 }
1867
1868 /// Targets should invoke this method for each target independent node that
1869 /// they want to provide a custom DAG combiner for by implementing the
1870 /// PerformDAGCombine virtual method.
1871 void setTargetDAGCombine(ISD::NodeType NT) {
1872 assert(unsigned(NT >> 3) < array_lengthof(TargetDAGCombineArray))(static_cast <bool> (unsigned(NT >> 3) < array_lengthof
(TargetDAGCombineArray)) ? void (0) : __assert_fail ("unsigned(NT >> 3) < array_lengthof(TargetDAGCombineArray)"
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/TargetLowering.h"
, 1872, __extension__ __PRETTY_FUNCTION__))
;
1873 TargetDAGCombineArray[NT >> 3] |= 1 << (NT&7);
1874 }
1875
1876 /// Set the target's required jmp_buf buffer size (in bytes); default is 200
1877 void setJumpBufSize(unsigned Size) {
1878 JumpBufSize = Size;
1879 }
1880
1881 /// Set the target's required jmp_buf buffer alignment (in bytes); default is
1882 /// 0
1883 void setJumpBufAlignment(unsigned Align) {
1884 JumpBufAlignment = Align;
1885 }
1886
1887 /// Set the target's minimum function alignment (in log2(bytes))
1888 void setMinFunctionAlignment(unsigned Align) {
1889 MinFunctionAlignment = Align;
1890 }
1891
1892 /// Set the target's preferred function alignment. This should be set if
1893 /// there is a performance benefit to higher-than-minimum alignment (in
1894 /// log2(bytes))
1895 void setPrefFunctionAlignment(unsigned Align) {
1896 PrefFunctionAlignment = Align;
1897 }
1898
1899 /// Set the target's preferred loop alignment. Default alignment is zero, it
1900 /// means the target does not care about loop alignment. The alignment is
1901 /// specified in log2(bytes). The target may also override
1902 /// getPrefLoopAlignment to provide per-loop values.
1903 void setPrefLoopAlignment(unsigned Align) {
1904 PrefLoopAlignment = Align;
1905 }
1906
1907 /// Set the minimum stack alignment of an argument (in log2(bytes)).
1908 void setMinStackArgumentAlignment(unsigned Align) {
1909 MinStackArgumentAlignment = Align;
1910 }
1911
1912 /// Set the maximum atomic operation size supported by the
1913 /// backend. Atomic operations greater than this size (as well as
1914 /// ones that are not naturally aligned), will be expanded by
1915 /// AtomicExpandPass into an __atomic_* library call.
1916 void setMaxAtomicSizeInBitsSupported(unsigned SizeInBits) {
1917 MaxAtomicSizeInBitsSupported = SizeInBits;
1918 }
1919
1920 /// Sets the minimum cmpxchg or ll/sc size supported by the backend.
1921 void setMinCmpXchgSizeInBits(unsigned SizeInBits) {
1922 MinCmpXchgSizeInBits = SizeInBits;
1923 }
1924
1925 /// Sets whether unaligned atomic operations are supported.
1926 void setSupportsUnalignedAtomics(bool UnalignedSupported) {
1927 SupportsUnalignedAtomics = UnalignedSupported;
1928 }
1929
1930public:
1931 //===--------------------------------------------------------------------===//
1932 // Addressing mode description hooks (used by LSR etc).
1933 //
1934
1935 /// CodeGenPrepare sinks address calculations into the same BB as Load/Store
1936 /// instructions reading the address. This allows as much computation as
1937 /// possible to be done in the address mode for that operand. This hook lets
1938 /// targets also pass back when this should be done on intrinsics which
1939 /// load/store.
1940 virtual bool getAddrModeArguments(IntrinsicInst * /*I*/,
1941 SmallVectorImpl<Value*> &/*Ops*/,
1942 Type *&/*AccessTy*/) const {
1943 return false;
1944 }
1945
1946 /// This represents an addressing mode of:
1947 /// BaseGV + BaseOffs + BaseReg + Scale*ScaleReg
1948 /// If BaseGV is null, there is no BaseGV.
1949 /// If BaseOffs is zero, there is no base offset.
1950 /// If HasBaseReg is false, there is no base register.
1951 /// If Scale is zero, there is no ScaleReg. Scale of 1 indicates a reg with
1952 /// no scale.
1953 struct AddrMode {
1954 GlobalValue *BaseGV = nullptr;
1955 int64_t BaseOffs = 0;
1956 bool HasBaseReg = false;
1957 int64_t Scale = 0;
1958 AddrMode() = default;
1959 };
1960
1961 /// Return true if the addressing mode represented by AM is legal for this
1962 /// target, for a load/store of the specified type.
1963 ///
1964 /// The type may be VoidTy, in which case only return true if the addressing
1965 /// mode is legal for a load/store of any legal type. TODO: Handle
1966 /// pre/postinc as well.
1967 ///
1968 /// If the address space cannot be determined, it will be -1.
1969 ///
1970 /// TODO: Remove default argument
1971 virtual bool isLegalAddressingMode(const DataLayout &DL, const AddrMode &AM,
1972 Type *Ty, unsigned AddrSpace,
1973 Instruction *I = nullptr) const;
1974
1975 /// Return the cost of the scaling factor used in the addressing mode
1976 /// represented by AM for this target, for a load/store of the specified type.
1977 ///
1978 /// If the AM is supported, the return value must be >= 0.
1979 /// If the AM is not supported, it returns a negative value.
1980 /// TODO: Handle pre/postinc as well.
1981 /// TODO: Remove default argument
1982 virtual int getScalingFactorCost(const DataLayout &DL, const AddrMode &AM,
1983 Type *Ty, unsigned AS = 0) const {
1984 // Default: assume that any scaling factor used in a legal AM is free.
1985 if (isLegalAddressingMode(DL, AM, Ty, AS))
1986 return 0;
1987 return -1;
1988 }
1989
1990 /// Return true if the specified immediate is legal icmp immediate, that is
1991 /// the target has icmp instructions which can compare a register against the
1992 /// immediate without having to materialize the immediate into a register.
1993 virtual bool isLegalICmpImmediate(int64_t) const {
1994 return true;
1995 }
1996
1997 /// Return true if the specified immediate is legal add immediate, that is the
1998 /// target has add instructions which can add a register with the immediate
1999 /// without having to materialize the immediate into a register.
2000 virtual bool isLegalAddImmediate(int64_t) const {
2001 return true;
2002 }
2003
2004 /// Return true if it's significantly cheaper to shift a vector by a uniform
2005 /// scalar than by an amount which will vary across each lane. On x86, for
2006 /// example, there is a "psllw" instruction for the former case, but no simple
2007 /// instruction for a general "a << b" operation on vectors.
2008 virtual bool isVectorShiftByScalarCheap(Type *Ty) const {
2009 return false;
2010 }
2011
2012 /// Returns true if the opcode is a commutative binary operation.
2013 virtual bool isCommutativeBinOp(unsigned Opcode) const {
2014 // FIXME: This should get its info from the td file.
2015 switch (Opcode) {
2016 case ISD::ADD:
2017 case ISD::SMIN:
2018 case ISD::SMAX:
2019 case ISD::UMIN:
2020 case ISD::UMAX:
2021 case ISD::MUL:
2022 case ISD::MULHU:
2023 case ISD::MULHS:
2024 case ISD::SMUL_LOHI:
2025 case ISD::UMUL_LOHI:
2026 case ISD::FADD:
2027 case ISD::FMUL:
2028 case ISD::AND:
2029 case ISD::OR:
2030 case ISD::XOR:
2031 case ISD::SADDO:
2032 case ISD::UADDO:
2033 case ISD::ADDC:
2034 case ISD::ADDE:
2035 case ISD::FMINNUM:
2036 case ISD::FMAXNUM:
2037 case ISD::FMINNAN:
2038 case ISD::FMAXNAN:
2039 return true;
2040 default: return false;
2041 }
2042 }
2043
2044 /// Return true if it's free to truncate a value of type FromTy to type
2045 /// ToTy. e.g. On x86 it's free to truncate a i32 value in register EAX to i16
2046 /// by referencing its sub-register AX.
2047 /// Targets must return false when FromTy <= ToTy.
2048 virtual bool isTruncateFree(Type *FromTy, Type *ToTy) const {
2049 return false;
2050 }
2051
2052 /// Return true if a truncation from FromTy to ToTy is permitted when deciding
2053 /// whether a call is in tail position. Typically this means that both results
2054 /// would be assigned to the same register or stack slot, but it could mean
2055 /// the target performs adequate checks of its own before proceeding with the
2056 /// tail call. Targets must return false when FromTy <= ToTy.
2057 virtual bool allowTruncateForTailCall(Type *FromTy, Type *ToTy) const {
2058 return false;
2059 }
2060
2061 virtual bool isTruncateFree(EVT FromVT, EVT ToVT) const {
2062 return false;
2063 }
2064
2065 virtual bool isProfitableToHoist(Instruction *I) const { return true; }
2066
2067 /// Return true if the extension represented by \p I is free.
2068 /// Unlikely the is[Z|FP]ExtFree family which is based on types,
2069 /// this method can use the context provided by \p I to decide
2070 /// whether or not \p I is free.
2071 /// This method extends the behavior of the is[Z|FP]ExtFree family.
2072 /// In other words, if is[Z|FP]Free returns true, then this method
2073 /// returns true as well. The converse is not true.
2074 /// The target can perform the adequate checks by overriding isExtFreeImpl.
2075 /// \pre \p I must be a sign, zero, or fp extension.
2076 bool isExtFree(const Instruction *I) const {
2077 switch (I->getOpcode()) {
2078 case Instruction::FPExt:
2079 if (isFPExtFree(EVT::getEVT(I->getType()),
2080 EVT::getEVT(I->getOperand(0)->getType())))
2081 return true;
2082 break;
2083 case Instruction::ZExt:
2084 if (isZExtFree(I->getOperand(0)->getType(), I->getType()))
2085 return true;
2086 break;
2087 case Instruction::SExt:
2088 break;
2089 default:
2090 llvm_unreachable("Instruction is not an extension")::llvm::llvm_unreachable_internal("Instruction is not an extension"
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/TargetLowering.h"
, 2090)
;
2091 }
2092 return isExtFreeImpl(I);
2093 }
2094
2095 /// Return true if \p Load and \p Ext can form an ExtLoad.
2096 /// For example, in AArch64
2097 /// %L = load i8, i8* %ptr
2098 /// %E = zext i8 %L to i32
2099 /// can be lowered into one load instruction
2100 /// ldrb w0, [x0]
2101 bool isExtLoad(const LoadInst *Load, const Instruction *Ext,
2102 const DataLayout &DL) const {
2103 EVT VT = getValueType(DL, Ext->getType());
2104 EVT LoadVT = getValueType(DL, Load->getType());
2105
2106 // If the load has other users and the truncate is not free, the ext
2107 // probably isn't free.
2108 if (!Load->hasOneUse() && (isTypeLegal(LoadVT) || !isTypeLegal(VT)) &&
2109 !isTruncateFree(Ext->getType(), Load->getType()))
2110 return false;
2111
2112 // Check whether the target supports casts folded into loads.
2113 unsigned LType;
2114 if (isa<ZExtInst>(Ext))
2115 LType = ISD::ZEXTLOAD;
2116 else {
2117 assert(isa<SExtInst>(Ext) && "Unexpected ext type!")(static_cast <bool> (isa<SExtInst>(Ext) &&
"Unexpected ext type!") ? void (0) : __assert_fail ("isa<SExtInst>(Ext) && \"Unexpected ext type!\""
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/TargetLowering.h"
, 2117, __extension__ __PRETTY_FUNCTION__))
;
2118 LType = ISD::SEXTLOAD;
2119 }
2120
2121 return isLoadExtLegal(LType, VT, LoadVT);
2122 }
2123
2124 /// Return true if any actual instruction that defines a value of type FromTy
2125 /// implicitly zero-extends the value to ToTy in the result register.
2126 ///
2127 /// The function should return true when it is likely that the truncate can
2128 /// be freely folded with an instruction defining a value of FromTy. If
2129 /// the defining instruction is unknown (because you're looking at a
2130 /// function argument, PHI, etc.) then the target may require an
2131 /// explicit truncate, which is not necessarily free, but this function
2132 /// does not deal with those cases.
2133 /// Targets must return false when FromTy >= ToTy.
2134 virtual bool isZExtFree(Type *FromTy, Type *ToTy) const {
2135 return false;
2136 }
2137
2138 virtual bool isZExtFree(EVT FromTy, EVT ToTy) const {
2139 return false;
2140 }
2141
2142 /// Return true if the target supplies and combines to a paired load
2143 /// two loaded values of type LoadedType next to each other in memory.
2144 /// RequiredAlignment gives the minimal alignment constraints that must be met
2145 /// to be able to select this paired load.
2146 ///
2147 /// This information is *not* used to generate actual paired loads, but it is
2148 /// used to generate a sequence of loads that is easier to combine into a
2149 /// paired load.
2150 /// For instance, something like this:
2151 /// a = load i64* addr
2152 /// b = trunc i64 a to i32
2153 /// c = lshr i64 a, 32
2154 /// d = trunc i64 c to i32
2155 /// will be optimized into:
2156 /// b = load i32* addr1
2157 /// d = load i32* addr2
2158 /// Where addr1 = addr2 +/- sizeof(i32).
2159 ///
2160 /// In other words, unless the target performs a post-isel load combining,
2161 /// this information should not be provided because it will generate more
2162 /// loads.
2163 virtual bool hasPairedLoad(EVT /*LoadedType*/,
2164 unsigned & /*RequiredAlignment*/) const {
2165 return false;
2166 }
2167
2168 /// Return true if the target has a vector blend instruction.
2169 virtual bool hasVectorBlend() const { return false; }
2170
2171 /// Get the maximum supported factor for interleaved memory accesses.
2172 /// Default to be the minimum interleave factor: 2.
2173 virtual unsigned getMaxSupportedInterleaveFactor() const { return 2; }
2174
2175 /// Lower an interleaved load to target specific intrinsics. Return
2176 /// true on success.
2177 ///
2178 /// \p LI is the vector load instruction.
2179 /// \p Shuffles is the shufflevector list to DE-interleave the loaded vector.
2180 /// \p Indices is the corresponding indices for each shufflevector.
2181 /// \p Factor is the interleave factor.
2182 virtual bool lowerInterleavedLoad(LoadInst *LI,
2183 ArrayRef<ShuffleVectorInst *> Shuffles,
2184 ArrayRef<unsigned> Indices,
2185 unsigned Factor) const {
2186 return false;
2187 }
2188
2189 /// Lower an interleaved store to target specific intrinsics. Return
2190 /// true on success.
2191 ///
2192 /// \p SI is the vector store instruction.
2193 /// \p SVI is the shufflevector to RE-interleave the stored vector.
2194 /// \p Factor is the interleave factor.
2195 virtual bool lowerInterleavedStore(StoreInst *SI, ShuffleVectorInst *SVI,
2196 unsigned Factor) const {
2197 return false;
2198 }
2199
2200 /// Return true if zero-extending the specific node Val to type VT2 is free
2201 /// (either because it's implicitly zero-extended such as ARM ldrb / ldrh or
2202 /// because it's folded such as X86 zero-extending loads).
2203 virtual bool isZExtFree(SDValue Val, EVT VT2) const {
2204 return isZExtFree(Val.getValueType(), VT2);
2205 }
2206
2207 /// Return true if an fpext operation is free (for instance, because
2208 /// single-precision floating-point numbers are implicitly extended to
2209 /// double-precision).
2210 virtual bool isFPExtFree(EVT DestVT, EVT SrcVT) const {
2211 assert(SrcVT.isFloatingPoint() && DestVT.isFloatingPoint() &&(static_cast <bool> (SrcVT.isFloatingPoint() &&
DestVT.isFloatingPoint() && "invalid fpext types") ?
void (0) : __assert_fail ("SrcVT.isFloatingPoint() && DestVT.isFloatingPoint() && \"invalid fpext types\""
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/TargetLowering.h"
, 2212, __extension__ __PRETTY_FUNCTION__))
2212 "invalid fpext types")(static_cast <bool> (SrcVT.isFloatingPoint() &&
DestVT.isFloatingPoint() && "invalid fpext types") ?
void (0) : __assert_fail ("SrcVT.isFloatingPoint() && DestVT.isFloatingPoint() && \"invalid fpext types\""
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/TargetLowering.h"
, 2212, __extension__ __PRETTY_FUNCTION__))
;
2213 return false;
2214 }
2215
2216 /// Return true if an fpext operation input to an \p Opcode operation is free
2217 /// (for instance, because half-precision floating-point numbers are
2218 /// implicitly extended to float-precision) for an FMA instruction.
2219 virtual bool isFPExtFoldable(unsigned Opcode, EVT DestVT, EVT SrcVT) const {
2220 assert(DestVT.isFloatingPoint() && SrcVT.isFloatingPoint() &&(static_cast <bool> (DestVT.isFloatingPoint() &&
SrcVT.isFloatingPoint() && "invalid fpext types") ? void
(0) : __assert_fail ("DestVT.isFloatingPoint() && SrcVT.isFloatingPoint() && \"invalid fpext types\""
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/TargetLowering.h"
, 2221, __extension__ __PRETTY_FUNCTION__))
2221 "invalid fpext types")(static_cast <bool> (DestVT.isFloatingPoint() &&
SrcVT.isFloatingPoint() && "invalid fpext types") ? void
(0) : __assert_fail ("DestVT.isFloatingPoint() && SrcVT.isFloatingPoint() && \"invalid fpext types\""
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/TargetLowering.h"
, 2221, __extension__ __PRETTY_FUNCTION__))
;
2222 return isFPExtFree(DestVT, SrcVT);
2223 }
2224
2225 /// Return true if folding a vector load into ExtVal (a sign, zero, or any
2226 /// extend node) is profitable.
2227 virtual bool isVectorLoadExtDesirable(SDValue ExtVal) const { return false; }
2228
2229 /// Return true if an fneg operation is free to the point where it is never
2230 /// worthwhile to replace it with a bitwise operation.
2231 virtual bool isFNegFree(EVT VT) const {
2232 assert(VT.isFloatingPoint())(static_cast <bool> (VT.isFloatingPoint()) ? void (0) :
__assert_fail ("VT.isFloatingPoint()", "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/TargetLowering.h"
, 2232, __extension__ __PRETTY_FUNCTION__))
;
2233 return false;
2234 }
2235
2236 /// Return true if an fabs operation is free to the point where it is never
2237 /// worthwhile to replace it with a bitwise operation.
2238 virtual bool isFAbsFree(EVT VT) const {
2239 assert(VT.isFloatingPoint())(static_cast <bool> (VT.isFloatingPoint()) ? void (0) :
__assert_fail ("VT.isFloatingPoint()", "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/TargetLowering.h"
, 2239, __extension__ __PRETTY_FUNCTION__))
;
2240 return false;
2241 }
2242
2243 /// Return true if an FMA operation is faster than a pair of fmul and fadd
2244 /// instructions. fmuladd intrinsics will be expanded to FMAs when this method
2245 /// returns true, otherwise fmuladd is expanded to fmul + fadd.
2246 ///
2247 /// NOTE: This may be called before legalization on types for which FMAs are
2248 /// not legal, but should return true if those types will eventually legalize
2249 /// to types that support FMAs. After legalization, it will only be called on
2250 /// types that support FMAs (via Legal or Custom actions)
2251 virtual bool isFMAFasterThanFMulAndFAdd(EVT) const {
2252 return false;
2253 }
2254
2255 /// Return true if it's profitable to narrow operations of type VT1 to
2256 /// VT2. e.g. on x86, it's profitable to narrow from i32 to i8 but not from
2257 /// i32 to i16.
2258 virtual bool isNarrowingProfitable(EVT /*VT1*/, EVT /*VT2*/) const {
2259 return false;
2260 }
2261
2262 /// Return true if it is beneficial to convert a load of a constant to
2263 /// just the constant itself.
2264 /// On some targets it might be more efficient to use a combination of
2265 /// arithmetic instructions to materialize the constant instead of loading it
2266 /// from a constant pool.
2267 virtual bool shouldConvertConstantLoadToIntImm(const APInt &Imm,
2268 Type *Ty) const {
2269 return false;
2270 }
2271
2272 /// Return true if EXTRACT_SUBVECTOR is cheap for extracting this result type
2273 /// from this source type with this index. This is needed because
2274 /// EXTRACT_SUBVECTOR usually has custom lowering that depends on the index of
2275 /// the first element, and only the target knows which lowering is cheap.
2276 virtual bool isExtractSubvectorCheap(EVT ResVT, EVT SrcVT,
2277 unsigned Index) const {
2278 return false;
2279 }
2280
2281 // Return true if it is profitable to use a scalar input to a BUILD_VECTOR
2282 // even if the vector itself has multiple uses.
2283 virtual bool aggressivelyPreferBuildVectorSources(EVT VecVT) const {
2284 return false;
2285 }
2286
2287 // Return true if CodeGenPrepare should consider splitting large offset of a
2288 // GEP to make the GEP fit into the addressing mode and can be sunk into the
2289 // same blocks of its users.
2290 virtual bool shouldConsiderGEPOffsetSplit() const { return false; }
2291
2292 //===--------------------------------------------------------------------===//
2293 // Runtime Library hooks
2294 //
2295
2296 /// Rename the default libcall routine name for the specified libcall.
2297 void setLibcallName(RTLIB::Libcall Call, const char *Name) {
2298 LibcallRoutineNames[Call] = Name;
2299 }
2300
2301 /// Get the libcall routine name for the specified libcall.
2302 const char *getLibcallName(RTLIB::Libcall Call) const {
2303 return LibcallRoutineNames[Call];
2304 }
2305
2306 /// Override the default CondCode to be used to test the result of the
2307 /// comparison libcall against zero.
2308 void setCmpLibcallCC(RTLIB::Libcall Call, ISD::CondCode CC) {
2309 CmpLibcallCCs[Call] = CC;
2310 }
2311
2312 /// Get the CondCode that's to be used to test the result of the comparison
2313 /// libcall against zero.
2314 ISD::CondCode getCmpLibcallCC(RTLIB::Libcall Call) const {
2315 return CmpLibcallCCs[Call];
2316 }
2317
2318 /// Set the CallingConv that should be used for the specified libcall.
2319 void setLibcallCallingConv(RTLIB::Libcall Call, CallingConv::ID CC) {
2320 LibcallCallingConvs[Call] = CC;
2321 }
2322
2323 /// Get the CallingConv that should be used for the specified libcall.
2324 CallingConv::ID getLibcallCallingConv(RTLIB::Libcall Call) const {
2325 return LibcallCallingConvs[Call];
2326 }
2327
2328 /// Execute target specific actions to finalize target lowering.
2329 /// This is used to set extra flags in MachineFrameInformation and freezing
2330 /// the set of reserved registers.
2331 /// The default implementation just freezes the set of reserved registers.
2332 virtual void finalizeLowering(MachineFunction &MF) const;
2333
2334private:
2335 const TargetMachine &TM;
2336
2337 /// Tells the code generator that the target has multiple (allocatable)
2338 /// condition registers that can be used to store the results of comparisons
2339 /// for use by selects and conditional branches. With multiple condition
2340 /// registers, the code generator will not aggressively sink comparisons into
2341 /// the blocks of their users.
2342 bool HasMultipleConditionRegisters;
2343
2344 /// Tells the code generator that the target has BitExtract instructions.
2345 /// The code generator will aggressively sink "shift"s into the blocks of
2346 /// their users if the users will generate "and" instructions which can be
2347 /// combined with "shift" to BitExtract instructions.
2348 bool HasExtractBitsInsn;
2349
2350 /// Tells the code generator to bypass slow divide or remainder
2351 /// instructions. For example, BypassSlowDivWidths[32,8] tells the code
2352 /// generator to bypass 32-bit integer div/rem with an 8-bit unsigned integer
2353 /// div/rem when the operands are positive and less than 256.
2354 DenseMap <unsigned int, unsigned int> BypassSlowDivWidths;
2355
2356 /// Tells the code generator that it shouldn't generate extra flow control
2357 /// instructions and should attempt to combine flow control instructions via
2358 /// predication.
2359 bool JumpIsExpensive;
2360
2361 /// Whether the target supports or cares about preserving floating point
2362 /// exception behavior.
2363 bool HasFloatingPointExceptions;
2364
2365 /// This target prefers to use _setjmp to implement llvm.setjmp.
2366 ///
2367 /// Defaults to false.
2368 bool UseUnderscoreSetJmp;
2369
2370 /// This target prefers to use _longjmp to implement llvm.longjmp.
2371 ///
2372 /// Defaults to false.
2373 bool UseUnderscoreLongJmp;
2374
2375 /// Information about the contents of the high-bits in boolean values held in
2376 /// a type wider than i1. See getBooleanContents.
2377 BooleanContent BooleanContents;
2378
2379 /// Information about the contents of the high-bits in boolean values held in
2380 /// a type wider than i1. See getBooleanContents.
2381 BooleanContent BooleanFloatContents;
2382
2383 /// Information about the contents of the high-bits in boolean vector values
2384 /// when the element type is wider than i1. See getBooleanContents.
2385 BooleanContent BooleanVectorContents;
2386
2387 /// The target scheduling preference: shortest possible total cycles or lowest
2388 /// register usage.
2389 Sched::Preference SchedPreferenceInfo;
2390
2391 /// The size, in bytes, of the target's jmp_buf buffers
2392 unsigned JumpBufSize;
2393
2394 /// The alignment, in bytes, of the target's jmp_buf buffers
2395 unsigned JumpBufAlignment;
2396
2397 /// The minimum alignment that any argument on the stack needs to have.
2398 unsigned MinStackArgumentAlignment;
2399
2400 /// The minimum function alignment (used when optimizing for size, and to
2401 /// prevent explicitly provided alignment from leading to incorrect code).
2402 unsigned MinFunctionAlignment;
2403
2404 /// The preferred function alignment (used when alignment unspecified and
2405 /// optimizing for speed).
2406 unsigned PrefFunctionAlignment;
2407
2408 /// The preferred loop alignment.
2409 unsigned PrefLoopAlignment;
2410
2411 /// Size in bits of the maximum atomics size the backend supports.
2412 /// Accesses larger than this will be expanded by AtomicExpandPass.
2413 unsigned MaxAtomicSizeInBitsSupported;
2414
2415 /// Size in bits of the minimum cmpxchg or ll/sc operation the
2416 /// backend supports.
2417 unsigned MinCmpXchgSizeInBits;
2418
2419 /// This indicates if the target supports unaligned atomic operations.
2420 bool SupportsUnalignedAtomics;
2421
2422 /// If set to a physical register, this specifies the register that
2423 /// llvm.savestack/llvm.restorestack should save and restore.
2424 unsigned StackPointerRegisterToSaveRestore;
2425
2426 /// This indicates the default register class to use for each ValueType the
2427 /// target supports natively.
2428 const TargetRegisterClass *RegClassForVT[MVT::LAST_VALUETYPE];
2429 unsigned char NumRegistersForVT[MVT::LAST_VALUETYPE];
2430 MVT RegisterTypeForVT[MVT::LAST_VALUETYPE];
2431
2432 /// This indicates the "representative" register class to use for each
2433 /// ValueType the target supports natively. This information is used by the
2434 /// scheduler to track register pressure. By default, the representative
2435 /// register class is the largest legal super-reg register class of the
2436 /// register class of the specified type. e.g. On x86, i8, i16, and i32's
2437 /// representative class would be GR32.
2438 const TargetRegisterClass *RepRegClassForVT[MVT::LAST_VALUETYPE];
2439
2440 /// This indicates the "cost" of the "representative" register class for each
2441 /// ValueType. The cost is used by the scheduler to approximate register
2442 /// pressure.
2443 uint8_t RepRegClassCostForVT[MVT::LAST_VALUETYPE];
2444
2445 /// For any value types we are promoting or expanding, this contains the value
2446 /// type that we are changing to. For Expanded types, this contains one step
2447 /// of the expand (e.g. i64 -> i32), even if there are multiple steps required
2448 /// (e.g. i64 -> i16). For types natively supported by the system, this holds
2449 /// the same type (e.g. i32 -> i32).
2450 MVT TransformToType[MVT::LAST_VALUETYPE];
2451
2452 /// For each operation and each value type, keep a LegalizeAction that
2453 /// indicates how instruction selection should deal with the operation. Most
2454 /// operations are Legal (aka, supported natively by the target), but
2455 /// operations that are not should be described. Note that operations on
2456 /// non-legal value types are not described here.
2457 LegalizeAction OpActions[MVT::LAST_VALUETYPE][ISD::BUILTIN_OP_END];
2458
2459 /// For each load extension type and each value type, keep a LegalizeAction
2460 /// that indicates how instruction selection should deal with a load of a
2461 /// specific value type and extension type. Uses 4-bits to store the action
2462 /// for each of the 4 load ext types.
2463 uint16_t LoadExtActions[MVT::LAST_VALUETYPE][MVT::LAST_VALUETYPE];
2464
2465 /// For each value type pair keep a LegalizeAction that indicates whether a
2466 /// truncating store of a specific value type and truncating type is legal.
2467 LegalizeAction TruncStoreActions[MVT::LAST_VALUETYPE][MVT::LAST_VALUETYPE];
2468
2469 /// For each indexed mode and each value type, keep a pair of LegalizeAction
2470 /// that indicates how instruction selection should deal with the load /
2471 /// store.
2472 ///
2473 /// The first dimension is the value_type for the reference. The second
2474 /// dimension represents the various modes for load store.
2475 uint8_t IndexedModeActions[MVT::LAST_VALUETYPE][ISD::LAST_INDEXED_MODE];
2476
2477 /// For each condition code (ISD::CondCode) keep a LegalizeAction that
2478 /// indicates how instruction selection should deal with the condition code.
2479 ///
2480 /// Because each CC action takes up 4 bits, we need to have the array size be
2481 /// large enough to fit all of the value types. This can be done by rounding
2482 /// up the MVT::LAST_VALUETYPE value to the next multiple of 8.
2483 uint32_t CondCodeActions[ISD::SETCC_INVALID][(MVT::LAST_VALUETYPE + 7) / 8];
2484
2485protected:
2486 ValueTypeActionImpl ValueTypeActions;
2487
2488private:
2489 LegalizeKind getTypeConversion(LLVMContext &Context, EVT VT) const;
2490
2491 /// Targets can specify ISD nodes that they would like PerformDAGCombine
2492 /// callbacks for by calling setTargetDAGCombine(), which sets a bit in this
2493 /// array.
2494 unsigned char
2495 TargetDAGCombineArray[(ISD::BUILTIN_OP_END+CHAR_BIT8-1)/CHAR_BIT8];
2496
2497 /// For operations that must be promoted to a specific type, this holds the
2498 /// destination type. This map should be sparse, so don't hold it as an
2499 /// array.
2500 ///
2501 /// Targets add entries to this map with AddPromotedToType(..), clients access
2502 /// this with getTypeToPromoteTo(..).
2503 std::map<std::pair<unsigned, MVT::SimpleValueType>, MVT::SimpleValueType>
2504 PromoteToType;
2505
2506 /// Stores the name each libcall.
2507 const char *LibcallRoutineNames[RTLIB::UNKNOWN_LIBCALL + 1];
2508
2509 /// The ISD::CondCode that should be used to test the result of each of the
2510 /// comparison libcall against zero.
2511 ISD::CondCode CmpLibcallCCs[RTLIB::UNKNOWN_LIBCALL];
2512
2513 /// Stores the CallingConv that should be used for each libcall.
2514 CallingConv::ID LibcallCallingConvs[RTLIB::UNKNOWN_LIBCALL];
2515
2516 /// Set default libcall names and calling conventions.
2517 void InitLibcalls(const Triple &TT);
2518
2519protected:
2520 /// Return true if the extension represented by \p I is free.
2521 /// \pre \p I is a sign, zero, or fp extension and
2522 /// is[Z|FP]ExtFree of the related types is not true.
2523 virtual bool isExtFreeImpl(const Instruction *I) const { return false; }
2524
2525 /// Depth that GatherAllAliases should should continue looking for chain
2526 /// dependencies when trying to find a more preferable chain. As an
2527 /// approximation, this should be more than the number of consecutive stores
2528 /// expected to be merged.
2529 unsigned GatherAllAliasesMaxDepth;
2530
2531 /// Specify maximum number of store instructions per memset call.
2532 ///
2533 /// When lowering \@llvm.memset this field specifies the maximum number of
2534 /// store operations that may be substituted for the call to memset. Targets
2535 /// must set this value based on the cost threshold for that target. Targets
2536 /// should assume that the memset will be done using as many of the largest
2537 /// store operations first, followed by smaller ones, if necessary, per
2538 /// alignment restrictions. For example, storing 9 bytes on a 32-bit machine
2539 /// with 16-bit alignment would result in four 2-byte stores and one 1-byte
2540 /// store. This only applies to setting a constant array of a constant size.
2541 unsigned MaxStoresPerMemset;
2542
2543 /// Maximum number of stores operations that may be substituted for the call
2544 /// to memset, used for functions with OptSize attribute.
2545 unsigned MaxStoresPerMemsetOptSize;
2546
2547 /// Specify maximum bytes of store instructions per memcpy call.
2548 ///
2549 /// When lowering \@llvm.memcpy this field specifies the maximum number of
2550 /// store operations that may be substituted for a call to memcpy. Targets
2551 /// must set this value based on the cost threshold for that target. Targets
2552 /// should assume that the memcpy will be done using as many of the largest
2553 /// store operations first, followed by smaller ones, if necessary, per
2554 /// alignment restrictions. For example, storing 7 bytes on a 32-bit machine
2555 /// with 32-bit alignment would result in one 4-byte store, a one 2-byte store
2556 /// and one 1-byte store. This only applies to copying a constant array of
2557 /// constant size.
2558 unsigned MaxStoresPerMemcpy;
2559
2560
2561 /// \brief Specify max number of store instructions to glue in inlined memcpy.
2562 ///
2563 /// When memcpy is inlined based on MaxStoresPerMemcpy, specify maximum number
2564 /// of store instructions to keep together. This helps in pairing and
2565 // vectorization later on.
2566 unsigned MaxGluedStoresPerMemcpy = 0;
2567
2568 /// Maximum number of store operations that may be substituted for a call to
2569 /// memcpy, used for functions with OptSize attribute.
2570 unsigned MaxStoresPerMemcpyOptSize;
2571 unsigned MaxLoadsPerMemcmp;
2572 unsigned MaxLoadsPerMemcmpOptSize;
2573
2574 /// Specify maximum bytes of store instructions per memmove call.
2575 ///
2576 /// When lowering \@llvm.memmove this field specifies the maximum number of
2577 /// store instructions that may be substituted for a call to memmove. Targets
2578 /// must set this value based on the cost threshold for that target. Targets
2579 /// should assume that the memmove will be done using as many of the largest
2580 /// store operations first, followed by smaller ones, if necessary, per
2581 /// alignment restrictions. For example, moving 9 bytes on a 32-bit machine
2582 /// with 8-bit alignment would result in nine 1-byte stores. This only
2583 /// applies to copying a constant array of constant size.
2584 unsigned MaxStoresPerMemmove;
2585
2586 /// Maximum number of store instructions that may be substituted for a call to
2587 /// memmove, used for functions with OptSize attribute.
2588 unsigned MaxStoresPerMemmoveOptSize;
2589
2590 /// Tells the code generator that select is more expensive than a branch if
2591 /// the branch is usually predicted right.
2592 bool PredictableSelectIsExpensive;
2593
2594 /// \see enableExtLdPromotion.
2595 bool EnableExtLdPromotion;
2596
2597 /// Return true if the value types that can be represented by the specified
2598 /// register class are all legal.
2599 bool isLegalRC(const TargetRegisterInfo &TRI,
2600 const TargetRegisterClass &RC) const;
2601
2602 /// Replace/modify any TargetFrameIndex operands with a targte-dependent
2603 /// sequence of memory operands that is recognized by PrologEpilogInserter.
2604 MachineBasicBlock *emitPatchPoint(MachineInstr &MI,
2605 MachineBasicBlock *MBB) const;
2606
2607 /// Replace/modify the XRay custom event operands with target-dependent
2608 /// details.
2609 MachineBasicBlock *emitXRayCustomEvent(MachineInstr &MI,
2610 MachineBasicBlock *MBB) const;
2611
2612 /// Replace/modify the XRay typed event operands with target-dependent
2613 /// details.
2614 MachineBasicBlock *emitXRayTypedEvent(MachineInstr &MI,
2615 MachineBasicBlock *MBB) const;
2616};
2617
2618/// This class defines information used to lower LLVM code to legal SelectionDAG
2619/// operators that the target instruction selector can accept natively.
2620///
2621/// This class also defines callbacks that targets must implement to lower
2622/// target-specific constructs to SelectionDAG operators.
2623class TargetLowering : public TargetLoweringBase {
2624public:
2625 struct DAGCombinerInfo;
2626
2627 TargetLowering(const TargetLowering &) = delete;
2628 TargetLowering &operator=(const TargetLowering &) = delete;
2629
2630 /// NOTE: The TargetMachine owns TLOF.
2631 explicit TargetLowering(const TargetMachine &TM);
2632
2633 bool isPositionIndependent() const;
2634
2635 virtual bool isSDNodeSourceOfDivergence(const SDNode *N,
2636 FunctionLoweringInfo *FLI,
2637 DivergenceAnalysis *DA) const {
2638 return false;
2639 }
2640
2641 virtual bool isSDNodeAlwaysUniform(const SDNode * N) const {
2642 return false;
2643 }
2644
2645 /// Returns true by value, base pointer and offset pointer and addressing mode
2646 /// by reference if the node's address can be legally represented as
2647 /// pre-indexed load / store address.
2648 virtual bool getPreIndexedAddressParts(SDNode * /*N*/, SDValue &/*Base*/,
2649 SDValue &/*Offset*/,
2650 ISD::MemIndexedMode &/*AM*/,
2651 SelectionDAG &/*DAG*/) const {
2652 return false;
2653 }
2654
2655 /// Returns true by value, base pointer and offset pointer and addressing mode
2656 /// by reference if this node can be combined with a load / store to form a
2657 /// post-indexed load / store.
2658 virtual bool getPostIndexedAddressParts(SDNode * /*N*/, SDNode * /*Op*/,
2659 SDValue &/*Base*/,
2660 SDValue &/*Offset*/,
2661 ISD::MemIndexedMode &/*AM*/,
2662 SelectionDAG &/*DAG*/) const {
2663 return false;
2664 }
2665
2666 /// Return the entry encoding for a jump table in the current function. The
2667 /// returned value is a member of the MachineJumpTableInfo::JTEntryKind enum.
2668 virtual unsigned getJumpTableEncoding() const;
2669
2670 virtual const MCExpr *
2671 LowerCustomJumpTableEntry(const MachineJumpTableInfo * /*MJTI*/,
2672 const MachineBasicBlock * /*MBB*/, unsigned /*uid*/,
2673 MCContext &/*Ctx*/) const {
2674 llvm_unreachable("Need to implement this hook if target has custom JTIs")::llvm::llvm_unreachable_internal("Need to implement this hook if target has custom JTIs"
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/TargetLowering.h"
, 2674)
;
2675 }
2676
2677 /// Returns relocation base for the given PIC jumptable.
2678 virtual SDValue getPICJumpTableRelocBase(SDValue Table,
2679 SelectionDAG &DAG) const;
2680
2681 /// This returns the relocation base for the given PIC jumptable, the same as
2682 /// getPICJumpTableRelocBase, but as an MCExpr.
2683 virtual const MCExpr *
2684 getPICJumpTableRelocBaseExpr(const MachineFunction *MF,
2685 unsigned JTI, MCContext &Ctx) const;
2686
2687 /// Return true if folding a constant offset with the given GlobalAddress is
2688 /// legal. It is frequently not legal in PIC relocation models.
2689 virtual bool isOffsetFoldingLegal(const GlobalAddressSDNode *GA) const;
2690
2691 bool isInTailCallPosition(SelectionDAG &DAG, SDNode *Node,
2692 SDValue &Chain) const;
2693
2694 void softenSetCCOperands(SelectionDAG &DAG, EVT VT, SDValue &NewLHS,
2695 SDValue &NewRHS, ISD::CondCode &CCCode,
2696 const SDLoc &DL) const;
2697
2698 /// Returns a pair of (return value, chain).
2699 /// It is an error to pass RTLIB::UNKNOWN_LIBCALL as \p LC.
2700 std::pair<SDValue, SDValue> makeLibCall(SelectionDAG &DAG, RTLIB::Libcall LC,
2701 EVT RetVT, ArrayRef<SDValue> Ops,
2702 bool isSigned, const SDLoc &dl,
2703 bool doesNotReturn = false,
2704 bool isReturnValueUsed = true) const;
2705
2706 /// Check whether parameters to a call that are passed in callee saved
2707 /// registers are the same as from the calling function. This needs to be
2708 /// checked for tail call eligibility.
2709 bool parametersInCSRMatch(const MachineRegisterInfo &MRI,
2710 const uint32_t *CallerPreservedMask,
2711 const SmallVectorImpl<CCValAssign> &ArgLocs,
2712 const SmallVectorImpl<SDValue> &OutVals) const;
2713
2714 //===--------------------------------------------------------------------===//
2715 // TargetLowering Optimization Methods
2716 //
2717
2718 /// A convenience struct that encapsulates a DAG, and two SDValues for
2719 /// returning information from TargetLowering to its clients that want to
2720 /// combine.
2721 struct TargetLoweringOpt {
2722 SelectionDAG &DAG;
2723 bool LegalTys;
2724 bool LegalOps;
2725 SDValue Old;
2726 SDValue New;
2727
2728 explicit TargetLoweringOpt(SelectionDAG &InDAG,
2729 bool LT, bool LO) :
2730 DAG(InDAG), LegalTys(LT), LegalOps(LO) {}
2731
2732 bool LegalTypes() const { return LegalTys; }
2733 bool LegalOperations() const { return LegalOps; }
2734
2735 bool CombineTo(SDValue O, SDValue N) {
2736 Old = O;
2737 New = N;
2738 return true;
2739 }
2740 };
2741
2742 /// Check to see if the specified operand of the specified instruction is a
2743 /// constant integer. If so, check to see if there are any bits set in the
2744 /// constant that are not demanded. If so, shrink the constant and return
2745 /// true.
2746 bool ShrinkDemandedConstant(SDValue Op, const APInt &Demanded,
2747 TargetLoweringOpt &TLO) const;
2748
2749 // Target hook to do target-specific const optimization, which is called by
2750 // ShrinkDemandedConstant. This function should return true if the target
2751 // doesn't want ShrinkDemandedConstant to further optimize the constant.
2752 virtual bool targetShrinkDemandedConstant(SDValue Op, const APInt &Demanded,
2753 TargetLoweringOpt &TLO) const {
2754 return false;
2755 }
2756
2757 /// Convert x+y to (VT)((SmallVT)x+(SmallVT)y) if the casts are free. This
2758 /// uses isZExtFree and ZERO_EXTEND for the widening cast, but it could be
2759 /// generalized for targets with other types of implicit widening casts.
2760 bool ShrinkDemandedOp(SDValue Op, unsigned BitWidth, const APInt &Demanded,
2761 TargetLoweringOpt &TLO) const;
2762
2763 /// Helper for SimplifyDemandedBits that can simplify an operation with
2764 /// multiple uses. This function simplifies operand \p OpIdx of \p User and
2765 /// then updates \p User with the simplified version. No other uses of
2766 /// \p OpIdx are updated. If \p User is the only user of \p OpIdx, this
2767 /// function behaves exactly like function SimplifyDemandedBits declared
2768 /// below except that it also updates the DAG by calling
2769 /// DCI.CommitTargetLoweringOpt.
2770 bool SimplifyDemandedBits(SDNode *User, unsigned OpIdx, const APInt &Demanded,
2771 DAGCombinerInfo &DCI, TargetLoweringOpt &TLO) const;
2772
2773 /// Look at Op. At this point, we know that only the DemandedMask bits of the
2774 /// result of Op are ever used downstream. If we can use this information to
2775 /// simplify Op, create a new simplified DAG node and return true, returning
2776 /// the original and new nodes in Old and New. Otherwise, analyze the
2777 /// expression and return a mask of KnownOne and KnownZero bits for the
2778 /// expression (used to simplify the caller). The KnownZero/One bits may only
2779 /// be accurate for those bits in the DemandedMask.
2780 /// \p AssumeSingleUse When this parameter is true, this function will
2781 /// attempt to simplify \p Op even if there are multiple uses.
2782 /// Callers are responsible for correctly updating the DAG based on the
2783 /// results of this function, because simply replacing replacing TLO.Old
2784 /// with TLO.New will be incorrect when this parameter is true and TLO.Old
2785 /// has multiple uses.
2786 bool SimplifyDemandedBits(SDValue Op, const APInt &DemandedMask,
2787 KnownBits &Known,
2788 TargetLoweringOpt &TLO,
2789 unsigned Depth = 0,
2790 bool AssumeSingleUse = false) const;
2791
2792 /// Helper wrapper around SimplifyDemandedBits
2793 bool SimplifyDemandedBits(SDValue Op, const APInt &DemandedMask,
2794 DAGCombinerInfo &DCI) const;
2795
2796 /// Look at Vector Op. At this point, we know that only the DemandedElts
2797 /// elements of the result of Op are ever used downstream. If we can use
2798 /// this information to simplify Op, create a new simplified DAG node and
2799 /// return true, storing the original and new nodes in TLO.
2800 /// Otherwise, analyze the expression and return a mask of KnownUndef and
2801 /// KnownZero elements for the expression (used to simplify the caller).
2802 /// The KnownUndef/Zero elements may only be accurate for those bits
2803 /// in the DemandedMask.
2804 /// \p AssumeSingleUse When this parameter is true, this function will
2805 /// attempt to simplify \p Op even if there are multiple uses.
2806 /// Callers are responsible for correctly updating the DAG based on the
2807 /// results of this function, because simply replacing replacing TLO.Old
2808 /// with TLO.New will be incorrect when this parameter is true and TLO.Old
2809 /// has multiple uses.
2810 bool SimplifyDemandedVectorElts(SDValue Op, const APInt &DemandedElts,
2811 APInt &KnownUndef, APInt &KnownZero,
2812 TargetLoweringOpt &TLO, unsigned Depth = 0,
2813 bool AssumeSingleUse = false) const;
2814
2815 /// Helper wrapper around SimplifyDemandedVectorElts
2816 bool SimplifyDemandedVectorElts(SDValue Op, const APInt &DemandedElts,
2817 APInt &KnownUndef, APInt &KnownZero,
2818 DAGCombinerInfo &DCI) const;
2819
2820 /// Determine which of the bits specified in Mask are known to be either zero
2821 /// or one and return them in the KnownZero/KnownOne bitsets. The DemandedElts
2822 /// argument allows us to only collect the known bits that are shared by the
2823 /// requested vector elements.
2824 virtual void computeKnownBitsForTargetNode(const SDValue Op,
2825 KnownBits &Known,
2826 const APInt &DemandedElts,
2827 const SelectionDAG &DAG,
2828 unsigned Depth = 0) const;
2829
2830 /// Determine which of the bits of FrameIndex \p FIOp are known to be 0.
2831 /// Default implementation computes low bits based on alignment
2832 /// information. This should preserve known bits passed into it.
2833 virtual void computeKnownBitsForFrameIndex(const SDValue FIOp,
2834 KnownBits &Known,
2835 const APInt &DemandedElts,
2836 const SelectionDAG &DAG,
2837 unsigned Depth = 0) const;
2838
2839 /// This method can be implemented by targets that want to expose additional
2840 /// information about sign bits to the DAG Combiner. The DemandedElts
2841 /// argument allows us to only collect the minimum sign bits that are shared
2842 /// by the requested vector elements.
2843 virtual unsigned ComputeNumSignBitsForTargetNode(SDValue Op,
2844 const APInt &DemandedElts,
2845 const SelectionDAG &DAG,
2846 unsigned Depth = 0) const;
2847
2848 /// Attempt to simplify any target nodes based on the demanded vector
2849 /// elements, returning true on success. Otherwise, analyze the expression and
2850 /// return a mask of KnownUndef and KnownZero elements for the expression
2851 /// (used to simplify the caller). The KnownUndef/Zero elements may only be
2852 /// accurate for those bits in the DemandedMask
2853 virtual bool SimplifyDemandedVectorEltsForTargetNode(
2854 SDValue Op, const APInt &DemandedElts, APInt &KnownUndef,
2855 APInt &KnownZero, TargetLoweringOpt &TLO, unsigned Depth = 0) const;
2856
2857 struct DAGCombinerInfo {
2858 void *DC; // The DAG Combiner object.
2859 CombineLevel Level;
2860 bool CalledByLegalizer;
2861
2862 public:
2863 SelectionDAG &DAG;
2864
2865 DAGCombinerInfo(SelectionDAG &dag, CombineLevel level, bool cl, void *dc)
2866 : DC(dc), Level(level), CalledByLegalizer(cl), DAG(dag) {}
2867
2868 bool isBeforeLegalize() const { return Level == BeforeLegalizeTypes; }
2869 bool isBeforeLegalizeOps() const { return Level < AfterLegalizeVectorOps; }
2870 bool isAfterLegalizeDAG() const {
2871 return Level == AfterLegalizeDAG;
2872 }
2873 CombineLevel getDAGCombineLevel() { return Level; }
2874 bool isCalledByLegalizer() const { return CalledByLegalizer; }
2875
2876 void AddToWorklist(SDNode *N);
2877 SDValue CombineTo(SDNode *N, ArrayRef<SDValue> To, bool AddTo = true);
2878 SDValue CombineTo(SDNode *N, SDValue Res, bool AddTo = true);
2879 SDValue CombineTo(SDNode *N, SDValue Res0, SDValue Res1, bool AddTo = true);
2880
2881 void CommitTargetLoweringOpt(const TargetLoweringOpt &TLO);
2882 };
2883
2884 /// Return if the N is a constant or constant vector equal to the true value
2885 /// from getBooleanContents().
2886 bool isConstTrueVal(const SDNode *N) const;
2887
2888 /// Return if the N is a constant or constant vector equal to the false value
2889 /// from getBooleanContents().
2890 bool isConstFalseVal(const SDNode *N) const;
2891
2892 /// Return if \p N is a True value when extended to \p VT.
2893 bool isExtendedTrueVal(const ConstantSDNode *N, EVT VT, bool Signed) const;
2894
2895 /// Try to simplify a setcc built with the specified operands and cc. If it is
2896 /// unable to simplify it, return a null SDValue.
2897 SDValue SimplifySetCC(EVT VT, SDValue N0, SDValue N1, ISD::CondCode Cond,
2898 bool foldBooleans, DAGCombinerInfo &DCI,
2899 const SDLoc &dl) const;
2900
2901 // For targets which wrap address, unwrap for analysis.
2902 virtual SDValue unwrapAddress(SDValue N) const { return N; }
2903
2904 /// Returns true (and the GlobalValue and the offset) if the node is a
2905 /// GlobalAddress + offset.
2906 virtual bool
2907 isGAPlusOffset(SDNode *N, const GlobalValue* &GA, int64_t &Offset) const;
2908
2909 /// This method will be invoked for all target nodes and for any
2910 /// target-independent nodes that the target has registered with invoke it
2911 /// for.
2912 ///
2913 /// The semantics are as follows:
2914 /// Return Value:
2915 /// SDValue.Val == 0 - No change was made
2916 /// SDValue.Val == N - N was replaced, is dead, and is already handled.
2917 /// otherwise - N should be replaced by the returned Operand.
2918 ///
2919 /// In addition, methods provided by DAGCombinerInfo may be used to perform
2920 /// more complex transformations.
2921 ///
2922 virtual SDValue PerformDAGCombine(SDNode *N, DAGCombinerInfo &DCI) const;
2923
2924 /// Return true if it is profitable to move a following shift through this
2925 // node, adjusting any immediate operands as necessary to preserve semantics.
2926 // This transformation may not be desirable if it disrupts a particularly
2927 // auspicious target-specific tree (e.g. bitfield extraction in AArch64).
2928 // By default, it returns true.
2929 virtual bool isDesirableToCommuteWithShift(const SDNode *N) const {
2930 return true;
2931 }
2932
2933 // Return true if it is profitable to combine a BUILD_VECTOR with a stride-pattern
2934 // to a shuffle and a truncate.
2935 // Example of such a combine:
2936 // v4i32 build_vector((extract_elt V, 1),
2937 // (extract_elt V, 3),
2938 // (extract_elt V, 5),
2939 // (extract_elt V, 7))
2940 // -->
2941 // v4i32 truncate (bitcast (shuffle<1,u,3,u,5,u,7,u> V, u) to v4i64)
2942 virtual bool isDesirableToCombineBuildVectorToShuffleTruncate(
2943 ArrayRef<int> ShuffleMask, EVT SrcVT, EVT TruncVT) const {
2944 return false;
2945 }
2946
2947 /// Return true if the target has native support for the specified value type
2948 /// and it is 'desirable' to use the type for the given node type. e.g. On x86
2949 /// i16 is legal, but undesirable since i16 instruction encodings are longer
2950 /// and some i16 instructions are slow.
2951 virtual bool isTypeDesirableForOp(unsigned /*Opc*/, EVT VT) const {
2952 // By default, assume all legal types are desirable.
2953 return isTypeLegal(VT);
2954 }
2955
2956 /// Return true if it is profitable for dag combiner to transform a floating
2957 /// point op of specified opcode to a equivalent op of an integer
2958 /// type. e.g. f32 load -> i32 load can be profitable on ARM.
2959 virtual bool isDesirableToTransformToIntegerOp(unsigned /*Opc*/,
2960 EVT /*VT*/) const {
2961 return false;
2962 }
2963
2964 /// This method query the target whether it is beneficial for dag combiner to
2965 /// promote the specified node. If true, it should return the desired
2966 /// promotion type by reference.
2967 virtual bool IsDesirableToPromoteOp(SDValue /*Op*/, EVT &/*PVT*/) const {
2968 return false;
2969 }
2970
2971 /// Return true if the target supports swifterror attribute. It optimizes
2972 /// loads and stores to reading and writing a specific register.
2973 virtual bool supportSwiftError() const {
2974 return false;
2975 }
2976
2977 /// Return true if the target supports that a subset of CSRs for the given
2978 /// machine function is handled explicitly via copies.
2979 virtual bool supportSplitCSR(MachineFunction *MF) const {
2980 return false;
2981 }
2982
2983 /// Perform necessary initialization to handle a subset of CSRs explicitly
2984 /// via copies. This function is called at the beginning of instruction
2985 /// selection.
2986 virtual void initializeSplitCSR(MachineBasicBlock *Entry) const {
2987 llvm_unreachable("Not Implemented")::llvm::llvm_unreachable_internal("Not Implemented", "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/TargetLowering.h"
, 2987)
;
2988 }
2989
2990 /// Insert explicit copies in entry and exit blocks. We copy a subset of
2991 /// CSRs to virtual registers in the entry block, and copy them back to
2992 /// physical registers in the exit blocks. This function is called at the end
2993 /// of instruction selection.
2994 virtual void insertCopiesSplitCSR(
2995 MachineBasicBlock *Entry,
2996 const SmallVectorImpl<MachineBasicBlock *> &Exits) const {
2997 llvm_unreachable("Not Implemented")::llvm::llvm_unreachable_internal("Not Implemented", "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/TargetLowering.h"
, 2997)
;
2998 }
2999
3000 //===--------------------------------------------------------------------===//
3001 // Lowering methods - These methods must be implemented by targets so that
3002 // the SelectionDAGBuilder code knows how to lower these.
3003 //
3004
3005 /// This hook must be implemented to lower the incoming (formal) arguments,
3006 /// described by the Ins array, into the specified DAG. The implementation
3007 /// should fill in the InVals array with legal-type argument values, and
3008 /// return the resulting token chain value.
3009 virtual SDValue LowerFormalArguments(
3010 SDValue /*Chain*/, CallingConv::ID /*CallConv*/, bool /*isVarArg*/,
3011 const SmallVectorImpl<ISD::InputArg> & /*Ins*/, const SDLoc & /*dl*/,
3012 SelectionDAG & /*DAG*/, SmallVectorImpl<SDValue> & /*InVals*/) const {
3013 llvm_unreachable("Not Implemented")::llvm::llvm_unreachable_internal("Not Implemented", "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/TargetLowering.h"
, 3013)
;
3014 }
3015
3016 /// This structure contains all information that is necessary for lowering
3017 /// calls. It is passed to TLI::LowerCallTo when the SelectionDAG builder
3018 /// needs to lower a call, and targets will see this struct in their LowerCall
3019 /// implementation.
3020 struct CallLoweringInfo {
3021 SDValue Chain;
3022 Type *RetTy = nullptr;
3023 bool RetSExt : 1;
3024 bool RetZExt : 1;
3025 bool IsVarArg : 1;
3026 bool IsInReg : 1;
3027 bool DoesNotReturn : 1;
3028 bool IsReturnValueUsed : 1;
3029 bool IsConvergent : 1;
3030 bool IsPatchPoint : 1;
3031
3032 // IsTailCall should be modified by implementations of
3033 // TargetLowering::LowerCall that perform tail call conversions.
3034 bool IsTailCall = false;
3035
3036 // Is Call lowering done post SelectionDAG type legalization.
3037 bool IsPostTypeLegalization = false;
3038
3039 unsigned NumFixedArgs = -1;
3040 CallingConv::ID CallConv = CallingConv::C;
3041 SDValue Callee;
3042 ArgListTy Args;
3043 SelectionDAG &DAG;
3044 SDLoc DL;
3045 ImmutableCallSite CS;
3046 SmallVector<ISD::OutputArg, 32> Outs;
3047 SmallVector<SDValue, 32> OutVals;
3048 SmallVector<ISD::InputArg, 32> Ins;
3049 SmallVector<SDValue, 4> InVals;
3050
3051 CallLoweringInfo(SelectionDAG &DAG)
3052 : RetSExt(false), RetZExt(false), IsVarArg(false), IsInReg(false),
3053 DoesNotReturn(false), IsReturnValueUsed(true), IsConvergent(false),
3054 IsPatchPoint(false), DAG(DAG) {}
3055
3056 CallLoweringInfo &setDebugLoc(const SDLoc &dl) {
3057 DL = dl;
3058 return *this;
3059 }
3060
3061 CallLoweringInfo &setChain(SDValue InChain) {
3062 Chain = InChain;
3063 return *this;
3064 }
3065
3066 // setCallee with target/module-specific attributes
3067 CallLoweringInfo &setLibCallee(CallingConv::ID CC, Type *ResultType,
3068 SDValue Target, ArgListTy &&ArgsList) {
3069 RetTy = ResultType;
3070 Callee = Target;
3071 CallConv = CC;
3072 NumFixedArgs = ArgsList.size();
3073 Args = std::move(ArgsList);
3074
3075 DAG.getTargetLoweringInfo().markLibCallAttributes(
3076 &(DAG.getMachineFunction()), CC, Args);
3077 return *this;
3078 }
3079
3080 CallLoweringInfo &setCallee(CallingConv::ID CC, Type *ResultType,
3081 SDValue Target, ArgListTy &&ArgsList) {
3082 RetTy = ResultType;
3083 Callee = Target;
3084 CallConv = CC;
3085 NumFixedArgs = ArgsList.size();
3086 Args = std::move(ArgsList);
3087 return *this;
3088 }
3089
3090 CallLoweringInfo &setCallee(Type *ResultType, FunctionType *FTy,
3091 SDValue Target, ArgListTy &&ArgsList,
3092 ImmutableCallSite Call) {
3093 RetTy = ResultType;
3094
3095 IsInReg = Call.hasRetAttr(Attribute::InReg);
3096 DoesNotReturn =
3097 Call.doesNotReturn() ||
3098 (!Call.isInvoke() &&
3099 isa<UnreachableInst>(Call.getInstruction()->getNextNode()));
3100 IsVarArg = FTy->isVarArg();
3101 IsReturnValueUsed = !Call.getInstruction()->use_empty();
3102 RetSExt = Call.hasRetAttr(Attribute::SExt);
3103 RetZExt = Call.hasRetAttr(Attribute::ZExt);
3104
3105 Callee = Target;
3106
3107 CallConv = Call.getCallingConv();
3108 NumFixedArgs = FTy->getNumParams();
3109 Args = std::move(ArgsList);
3110
3111 CS = Call;
3112
3113 return *this;
3114 }
3115
3116 CallLoweringInfo &setInRegister(bool Value = true) {
3117 IsInReg = Value;
3118 return *this;
3119 }
3120
3121 CallLoweringInfo &setNoReturn(bool Value = true) {
3122 DoesNotReturn = Value;
3123 return *this;
3124 }
3125
3126 CallLoweringInfo &setVarArg(bool Value = true) {
3127 IsVarArg = Value;
3128 return *this;
3129 }
3130
3131 CallLoweringInfo &setTailCall(bool Value = true) {
3132 IsTailCall = Value;
3133 return *this;
3134 }
3135
3136 CallLoweringInfo &setDiscardResult(bool Value = true) {
3137 IsReturnValueUsed = !Value;
3138 return *this;
3139 }
3140
3141 CallLoweringInfo &setConvergent(bool Value = true) {
3142 IsConvergent = Value;
3143 return *this;
3144 }
3145
3146 CallLoweringInfo &setSExtResult(bool Value = true) {
3147 RetSExt = Value;
3148 return *this;
3149 }
3150
3151 CallLoweringInfo &setZExtResult(bool Value = true) {
3152 RetZExt = Value;
3153 return *this;
3154 }
3155
3156 CallLoweringInfo &setIsPatchPoint(bool Value = true) {
3157 IsPatchPoint = Value;
3158 return *this;
3159 }
3160
3161 CallLoweringInfo &setIsPostTypeLegalization(bool Value=true) {
3162 IsPostTypeLegalization = Value;
3163 return *this;
3164 }
3165
3166 ArgListTy &getArgs() {
3167 return Args;
3168 }
3169 };
3170
3171 /// This function lowers an abstract call to a function into an actual call.
3172 /// This returns a pair of operands. The first element is the return value
3173 /// for the function (if RetTy is not VoidTy). The second element is the
3174 /// outgoing token chain. It calls LowerCall to do the actual lowering.
3175 std::pair<SDValue, SDValue> LowerCallTo(CallLoweringInfo &CLI) const;
3176
3177 /// This hook must be implemented to lower calls into the specified
3178 /// DAG. The outgoing arguments to the call are described by the Outs array,
3179 /// and the values to be returned by the call are described by the Ins
3180 /// array. The implementation should fill in the InVals array with legal-type
3181 /// return values from the call, and return the resulting token chain value.
3182 virtual SDValue
3183 LowerCall(CallLoweringInfo &/*CLI*/,
3184 SmallVectorImpl<SDValue> &/*InVals*/) const {
3185 llvm_unreachable("Not Implemented")::llvm::llvm_unreachable_internal("Not Implemented", "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/TargetLowering.h"
, 3185)
;
3186 }
3187
3188 /// Target-specific cleanup for formal ByVal parameters.
3189 virtual void HandleByVal(CCState *, unsigned &, unsigned) const {}
3190
3191 /// This hook should be implemented to check whether the return values
3192 /// described by the Outs array can fit into the return registers. If false
3193 /// is returned, an sret-demotion is performed.
3194 virtual bool CanLowerReturn(CallingConv::ID /*CallConv*/,
3195 MachineFunction &/*MF*/, bool /*isVarArg*/,
3196 const SmallVectorImpl<ISD::OutputArg> &/*Outs*/,
3197 LLVMContext &/*Context*/) const
3198 {
3199 // Return true by default to get preexisting behavior.
3200 return true;
3201 }
3202
3203 /// This hook must be implemented to lower outgoing return values, described
3204 /// by the Outs array, into the specified DAG. The implementation should
3205 /// return the resulting token chain value.
3206 virtual SDValue LowerReturn(SDValue /*Chain*/, CallingConv::ID /*CallConv*/,
3207 bool /*isVarArg*/,
3208 const SmallVectorImpl<ISD::OutputArg> & /*Outs*/,
3209 const SmallVectorImpl<SDValue> & /*OutVals*/,
3210 const SDLoc & /*dl*/,
3211 SelectionDAG & /*DAG*/) const {
3212 llvm_unreachable("Not Implemented")::llvm::llvm_unreachable_internal("Not Implemented", "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/TargetLowering.h"
, 3212)
;
3213 }
3214
3215 /// Return true if result of the specified node is used by a return node
3216 /// only. It also compute and return the input chain for the tail call.
3217 ///
3218 /// This is used to determine whether it is possible to codegen a libcall as
3219 /// tail call at legalization time.
3220 virtual bool isUsedByReturnOnly(SDNode *, SDValue &/*Chain*/) const {
3221 return false;
3222 }
3223
3224 /// Return true if the target may be able emit the call instruction as a tail
3225 /// call. This is used by optimization passes to determine if it's profitable
3226 /// to duplicate return instructions to enable tailcall optimization.
3227 virtual bool mayBeEmittedAsTailCall(const CallInst *) const {
3228 return false;
3229 }
3230
3231 /// Return the builtin name for the __builtin___clear_cache intrinsic
3232 /// Default is to invoke the clear cache library call
3233 virtual const char * getClearCacheBuiltinName() const {
3234 return "__clear_cache";
3235 }
3236
3237 /// Return the register ID of the name passed in. Used by named register
3238 /// global variables extension. There is no target-independent behaviour
3239 /// so the default action is to bail.
3240 virtual unsigned getRegisterByName(const char* RegName, EVT VT,
3241 SelectionDAG &DAG) const {
3242 report_fatal_error("Named registers not implemented for this target");
3243 }
3244
3245 /// Return the type that should be used to zero or sign extend a
3246 /// zeroext/signext integer return value. FIXME: Some C calling conventions
3247 /// require the return type to be promoted, but this is not true all the time,
3248 /// e.g. i1/i8/i16 on x86/x86_64. It is also not necessary for non-C calling
3249 /// conventions. The frontend should handle this and include all of the
3250 /// necessary information.
3251 virtual EVT getTypeForExtReturn(LLVMContext &Context, EVT VT,
3252 ISD::NodeType /*ExtendKind*/) const {
3253 EVT MinVT = getRegisterType(Context, MVT::i32);
3254 return VT.bitsLT(MinVT) ? MinVT : VT;
3255 }
3256
3257 /// For some targets, an LLVM struct type must be broken down into multiple
3258 /// simple types, but the calling convention specifies that the entire struct
3259 /// must be passed in a block of consecutive registers.
3260 virtual bool
3261 functionArgumentNeedsConsecutiveRegisters(Type *Ty, CallingConv::ID CallConv,
3262 bool isVarArg) const {
3263 return false;
3264 }
3265
3266 /// Returns a 0 terminated array of registers that can be safely used as
3267 /// scratch registers.
3268 virtual const MCPhysReg *getScratchRegisters(CallingConv::ID CC) const {
3269 return nullptr;
3270 }
3271
3272 /// This callback is used to prepare for a volatile or atomic load.
3273 /// It takes a chain node as input and returns the chain for the load itself.
3274 ///
3275 /// Having a callback like this is necessary for targets like SystemZ,
3276 /// which allows a CPU to reuse the result of a previous load indefinitely,
3277 /// even if a cache-coherent store is performed by another CPU. The default
3278 /// implementation does nothing.
3279 virtual SDValue prepareVolatileOrAtomicLoad(SDValue Chain, const SDLoc &DL,
3280 SelectionDAG &DAG) const {
3281 return Chain;
3282 }
3283
3284 /// This callback is used to inspect load/store instructions and add
3285 /// target-specific MachineMemOperand flags to them. The default
3286 /// implementation does nothing.
3287 virtual MachineMemOperand::Flags getMMOFlags(const Instruction &I) const {
3288 return MachineMemOperand::MONone;
3289 }
3290
3291 /// This callback is invoked by the type legalizer to legalize nodes with an
3292 /// illegal operand type but legal result types. It replaces the
3293 /// LowerOperation callback in the type Legalizer. The reason we can not do
3294 /// away with LowerOperation entirely is that LegalizeDAG isn't yet ready to
3295 /// use this callback.
3296 ///
3297 /// TODO: Consider merging with ReplaceNodeResults.
3298 ///
3299 /// The target places new result values for the node in Results (their number
3300 /// and types must exactly match those of the original return values of
3301 /// the node), or leaves Results empty, which indicates that the node is not
3302 /// to be custom lowered after all.
3303 /// The default implementation calls LowerOperation.
3304 virtual void LowerOperationWrapper(SDNode *N,
3305 SmallVectorImpl<SDValue> &Results,
3306 SelectionDAG &DAG) const;
3307
3308 /// This callback is invoked for operations that are unsupported by the
3309 /// target, which are registered to use 'custom' lowering, and whose defined
3310 /// values are all legal. If the target has no operations that require custom
3311 /// lowering, it need not implement this. The default implementation of this
3312 /// aborts.
3313 virtual SDValue LowerOperation(SDValue Op, SelectionDAG &DAG) const;
3314
3315 /// This callback is invoked when a node result type is illegal for the
3316 /// target, and the operation was registered to use 'custom' lowering for that
3317 /// result type. The target places new result values for the node in Results
3318 /// (their number and types must exactly match those of the original return
3319 /// values of the node), or leaves Results empty, which indicates that the
3320 /// node is not to be custom lowered after all.
3321 ///
3322 /// If the target has no operations that require custom lowering, it need not
3323 /// implement this. The default implementation aborts.
3324 virtual void ReplaceNodeResults(SDNode * /*N*/,
3325 SmallVectorImpl<SDValue> &/*Results*/,
3326 SelectionDAG &/*DAG*/) const {
3327 llvm_unreachable("ReplaceNodeResults not implemented for this target!")::llvm::llvm_unreachable_internal("ReplaceNodeResults not implemented for this target!"
, "/build/llvm-toolchain-snapshot-7~svn337103/include/llvm/CodeGen/TargetLowering.h"
, 3327)
;
3328 }
3329
3330 /// This method returns the name of a target specific DAG node.
3331 virtual const char *getTargetNodeName(unsigned Opcode) const;
3332
3333 /// This method returns a target specific FastISel object, or null if the
3334 /// target does not support "fast" ISel.
3335 virtual FastISel *createFastISel(FunctionLoweringInfo &,
3336 const TargetLibraryInfo *) const {
3337 return nullptr;
3338 }
3339
3340 bool verifyReturnAddressArgumentIsConstant(SDValue Op,
3341 SelectionDAG &DAG) const;
3342
3343 //===--------------------------------------------------------------------===//
3344 // Inline Asm Support hooks
3345 //
3346
3347 /// This hook allows the target to expand an inline asm call to be explicit
3348 /// llvm code if it wants to. This is useful for turning simple inline asms
3349 /// into LLVM intrinsics, which gives the compiler more information about the
3350 /// behavior of the code.
3351 virtual bool ExpandInlineAsm(CallInst *) const {
3352 return false;
3353 }
3354
3355 enum ConstraintType {
3356 C_Register, // Constraint represents specific register(s).
3357 C_RegisterClass, // Constraint represents any of register(s) in class.
3358 C_Memory, // Memory constraint.
3359 C_Other, // Something else.
3360 C_Unknown // Unsupported constraint.
3361 };
3362
3363 enum ConstraintWeight {
3364 // Generic weights.
3365 CW_Invalid = -1, // No match.
3366 CW_Okay = 0, // Acceptable.
3367 CW_Good = 1, // Good weight.
3368 CW_Better = 2, // Better weight.
3369 CW_Best = 3, // Best weight.
3370
3371 // Well-known weights.
3372 CW_SpecificReg = CW_Okay, // Specific register operands.
3373 CW_Register = CW_Good, // Register operands.
3374 CW_Memory = CW_Better, // Memory operands.
3375 CW_Constant = CW_Best, // Constant operand.
3376 CW_Default = CW_Okay // Default or don't know type.
3377 };
3378
3379 /// This contains information for each constraint that we are lowering.
3380 struct AsmOperandInfo : public InlineAsm::ConstraintInfo {
3381 /// This contains the actual string for the code, like "m". TargetLowering
3382 /// picks the 'best' code from ConstraintInfo::Codes that most closely
3383 /// matches the operand.
3384 std::string ConstraintCode;
3385
3386 /// Information about the constraint code, e.g. Register, RegisterClass,
3387 /// Memory, Other, Unknown.
3388 TargetLowering::ConstraintType ConstraintType = TargetLowering::C_Unknown;
3389
3390 /// If this is the result output operand or a clobber, this is null,
3391 /// otherwise it is the incoming operand to the CallInst. This gets
3392 /// modified as the asm is processed.
3393 Value *CallOperandVal = nullptr;
3394
3395 /// The ValueType for the operand value.
3396 MVT ConstraintVT = MVT::Other;
3397
3398 /// Copy constructor for copying from a ConstraintInfo.
3399 AsmOperandInfo(InlineAsm::ConstraintInfo Info)
3400 : InlineAsm::ConstraintInfo(std::move(Info)) {}
3401
3402 /// Return true of this is an input operand that is a matching constraint
3403 /// like "4".
3404 bool isMatchingInputConstraint() const;
3405
3406 /// If this is an input matching constraint, this method returns the output
3407 /// operand it matches.
3408 unsigned getMatchedOperand() const;
3409 };
3410
3411 using AsmOperandInfoVector = std::vector<AsmOperandInfo>;
3412
3413 /// Split up the constraint string from the inline assembly value into the
3414 /// specific constraints and their prefixes, and also tie in the associated
3415 /// operand values. If this returns an empty vector, and if the constraint
3416 /// string itself isn't empty, there was an error parsing.
3417 virtual AsmOperandInfoVector ParseConstraints(const DataLayout &DL,
3418 const TargetRegisterInfo *TRI,
3419 ImmutableCallSite CS) const;
3420
3421 /// Examine constraint type and operand type and determine a weight value.
3422 /// The operand object must already have been set up with the operand type.
3423 virtual ConstraintWeight getMultipleConstraintMatchWeight(
3424 AsmOperandInfo &info, int maIndex) const;
3425
3426 /// Examine constraint string and operand type and determine a weight value.
3427 /// The operand object must already have been set up with the operand type.
3428 virtual ConstraintWeight getSingleConstraintMatchWeight(
3429 AsmOperandInfo &info, const char *constraint) const;
3430
3431 /// Determines the constraint code and constraint type to use for the specific
3432 /// AsmOperandInfo, setting OpInfo.ConstraintCode and OpInfo.ConstraintType.
3433 /// If the actual operand being passed in is available, it can be passed in as
3434 /// Op, otherwise an empty SDValue can be passed.
3435 virtual void ComputeConstraintToUse(AsmOperandInfo &OpInfo,
3436 SDValue Op,
3437 SelectionDAG *DAG = nullptr) const;
3438
3439 /// Given a constraint, return the type of constraint it is for this target.
3440 virtual ConstraintType getConstraintType(StringRef Constraint) const;
3441
3442 /// Given a physical register constraint (e.g. {edx}), return the register
3443 /// number and the register class for the register.
3444 ///
3445 /// Given a register class constraint, like 'r', if this corresponds directly
3446 /// to an LLVM register class, return a register of 0 and the register class
3447 /// pointer.
3448 ///
3449 /// This should only be used for C_Register constraints. On error, this
3450 /// returns a register number of 0 and a null register class pointer.
3451 virtual std::pair<unsigned, const TargetRegisterClass *>
3452 getRegForInlineAsmConstraint(const TargetRegisterInfo *TRI,
3453 StringRef Constraint, MVT VT) const;
3454
3455 virtual unsigned getInlineAsmMemConstraint(StringRef ConstraintCode) const {
3456 if (ConstraintCode == "i")
3457 return InlineAsm::Constraint_i;
3458 else if (ConstraintCode == "m")
3459 return InlineAsm::Constraint_m;
3460 return InlineAsm::Constraint_Unknown;
3461 }
3462
3463 /// Try to replace an X constraint, which matches anything, with another that
3464 /// has more specific requirements based on the type of the corresponding
3465 /// operand. This returns null if there is no replacement to make.
3466 virtual const char *LowerXConstraint(EVT ConstraintVT) const;
3467
3468 /// Lower the specified operand into the Ops vector. If it is invalid, don't
3469 /// add anything to Ops.
3470 virtual void LowerAsmOperandForConstraint(SDValue Op, std::string &Constraint,
3471 std::vector<SDValue> &Ops,
3472 SelectionDAG &DAG) const;
3473
3474 //===--------------------------------------------------------------------===//
3475 // Div utility functions
3476 //
3477 SDValue BuildSDIV(SDNode *N, const APInt &Divisor, SelectionDAG &DAG,
3478 bool IsAfterLegalization,
3479 std::vector<SDNode *> *Created) const;
3480 SDValue BuildUDIV(SDNode *N, const APInt &Divisor, SelectionDAG &DAG,
3481 bool IsAfterLegalization,
3482 std::vector<SDNode *> *Created) const;
3483
3484 /// Targets may override this function to provide custom SDIV lowering for
3485 /// power-of-2 denominators. If the target returns an empty SDValue, LLVM
3486 /// assumes SDIV is expensive and replaces it with a series of other integer
3487 /// operations.
3488 virtual SDValue BuildSDIVPow2(SDNode *N, const APInt &Divisor,
3489 SelectionDAG &DAG,
3490 std::vector<SDNode *> *Created) const;
3491
3492 /// Indicate whether this target prefers to combine FDIVs with the same
3493 /// divisor. If the transform should never be done, return zero. If the
3494 /// transform should be done, return the minimum number of divisor uses
3495 /// that must exist.
3496 virtual unsigned combineRepeatedFPDivisors() const {
3497 return 0;
3498 }
3499
3500 /// Hooks for building estimates in place of slower divisions and square
3501 /// roots.
3502
3503 /// Return either a square root or its reciprocal estimate value for the input
3504 /// operand.
3505 /// \p Enabled is a ReciprocalEstimate enum with value either 'Unspecified' or
3506 /// 'Enabled' as set by a potential default override attribute.
3507 /// If \p RefinementSteps is 'Unspecified', the number of Newton-Raphson
3508 /// refinement iterations required to generate a sufficient (though not
3509 /// necessarily IEEE-754 compliant) estimate is returned in that parameter.
3510 /// The boolean UseOneConstNR output is used to select a Newton-Raphson
3511 /// algorithm implementation that uses either one or two constants.
3512 /// The boolean Reciprocal is used to select whether the estimate is for the
3513 /// square root of the input operand or the reciprocal of its square root.
3514 /// A target may choose to implement its own refinement within this function.
3515 /// If that's true, then return '0' as the number of RefinementSteps to avoid
3516 /// any further refinement of the estimate.
3517 /// An empty SDValue return means no estimate sequence can be created.
3518 virtual SDValue getSqrtEstimate(SDValue Operand, SelectionDAG &DAG,
3519 int Enabled, int &RefinementSteps,
3520 bool &UseOneConstNR, bool Reciprocal) const {
3521 return SDValue();
3522 }
3523
3524 /// Return a reciprocal estimate value for the input operand.
3525 /// \p Enabled is a ReciprocalEstimate enum with value either 'Unspecified' or
3526 /// 'Enabled' as set by a potential default override attribute.
3527 /// If \p RefinementSteps is 'Unspecified', the number of Newton-Raphson
3528 /// refinement iterations required to generate a sufficient (though not
3529 /// necessarily IEEE-754 compliant) estimate is returned in that parameter.
3530 /// A target may choose to implement its own refinement within this function.
3531 /// If that's true, then return '0' as the number of RefinementSteps to avoid
3532 /// any further refinement of the estimate.
3533 /// An empty SDValue return means no estimate sequence can be created.
3534 virtual SDValue getRecipEstimate(SDValue Operand, SelectionDAG &DAG,
3535 int Enabled, int &RefinementSteps) const {
3536 return SDValue();
3537 }
3538
3539 //===--------------------------------------------------------------------===//
3540 // Legalization utility functions
3541 //
3542
3543 /// Expand a MUL or [US]MUL_LOHI of n-bit values into two or four nodes,
3544 /// respectively, each computing an n/2-bit part of the result.
3545 /// \param Result A vector that will be filled with the parts of the result
3546 /// in little-endian order.
3547 /// \param LL Low bits of the LHS of the MUL. You can use this parameter
3548 /// if you want to control how low bits are extracted from the LHS.
3549 /// \param LH High bits of the LHS of the MUL. See LL for meaning.
3550 /// \param RL Low bits of the RHS of the MUL. See LL for meaning
3551 /// \param RH High bits of the RHS of the MUL. See LL for meaning.
3552 /// \returns true if the node has been expanded, false if it has not
3553 bool expandMUL_LOHI(unsigned Opcode, EVT VT, SDLoc dl, SDValue LHS,
3554 SDValue RHS, SmallVectorImpl<SDValue> &Result, EVT HiLoVT,
3555 SelectionDAG &DAG, MulExpansionKind Kind,
3556 SDValue LL = SDValue(), SDValue LH = SDValue(),
3557 SDValue RL = SDValue(), SDValue RH = SDValue()) const;
3558
3559 /// Expand a MUL into two nodes. One that computes the high bits of
3560 /// the result and one that computes the low bits.
3561 /// \param HiLoVT The value type to use for the Lo and Hi nodes.
3562 /// \param LL Low bits of the LHS of the MUL. You can use this parameter
3563 /// if you want to control how low bits are extracted from the LHS.
3564 /// \param LH High bits of the LHS of the MUL. See LL for meaning.
3565 /// \param RL Low bits of the RHS of the MUL. See LL for meaning
3566 /// \param RH High bits of the RHS of the MUL. See LL for meaning.
3567 /// \returns true if the node has been expanded. false if it has not
3568 bool expandMUL(SDNode *N, SDValue &Lo, SDValue &Hi, EVT HiLoVT,
3569 SelectionDAG &DAG, MulExpansionKind Kind,
3570 SDValue LL = SDValue(), SDValue LH = SDValue(),
3571 SDValue RL = SDValue(), SDValue RH = SDValue()) const;
3572
3573 /// Expand float(f32) to SINT(i64) conversion
3574 /// \param N Node to expand
3575 /// \param Result output after conversion
3576 /// \returns True, if the expansion was successful, false otherwise
3577 bool expandFP_TO_SINT(SDNode *N, SDValue &Result, SelectionDAG &DAG) const;
3578
3579 /// Turn load of vector type into a load of the individual elements.
3580 /// \param LD load to expand
3581 /// \returns MERGE_VALUEs of the scalar loads with their chains.
3582 SDValue scalarizeVectorLoad(LoadSDNode *LD, SelectionDAG &DAG) const;
3583
3584 // Turn a store of a vector type into stores of the individual elements.
3585 /// \param ST Store with a vector value type
3586 /// \returns MERGE_VALUs of the individual store chains.
3587 SDValue scalarizeVectorStore(StoreSDNode *ST, SelectionDAG &DAG) const;
3588
3589 /// Expands an unaligned load to 2 half-size loads for an integer, and
3590 /// possibly more for vectors.
3591 std::pair<SDValue, SDValue> expandUnalignedLoad(LoadSDNode *LD,
3592 SelectionDAG &DAG) const;
3593
3594 /// Expands an unaligned store to 2 half-size stores for integer values, and
3595 /// possibly more for vectors.
3596 SDValue expandUnalignedStore(StoreSDNode *ST, SelectionDAG &DAG) const;
3597
3598 /// Increments memory address \p Addr according to the type of the value
3599 /// \p DataVT that should be stored. If the data is stored in compressed
3600 /// form, the memory address should be incremented according to the number of
3601 /// the stored elements. This number is equal to the number of '1's bits
3602 /// in the \p Mask.
3603 /// \p DataVT is a vector type. \p Mask is a vector value.
3604 /// \p DataVT and \p Mask have the same number of vector elements.
3605 SDValue IncrementMemoryAddress(SDValue Addr, SDValue Mask, const SDLoc &DL,
3606 EVT DataVT, SelectionDAG &DAG,
3607 bool IsCompressedMemory) const;
3608
3609 /// Get a pointer to vector element \p Idx located in memory for a vector of
3610 /// type \p VecVT starting at a base address of \p VecPtr. If \p Idx is out of
3611 /// bounds the returned pointer is unspecified, but will be within the vector
3612 /// bounds.
3613 SDValue getVectorElementPointer(SelectionDAG &DAG, SDValue VecPtr, EVT VecVT,
3614 SDValue Idx) const;
3615
3616 //===--------------------------------------------------------------------===//
3617 // Instruction Emitting Hooks
3618 //
3619
3620 /// This method should be implemented by targets that mark instructions with
3621 /// the 'usesCustomInserter' flag. These instructions are special in various
3622 /// ways, which require special support to insert. The specified MachineInstr
3623 /// is created but not inserted into any basic blocks, and this method is
3624 /// called to expand it into a sequence of instructions, potentially also
3625 /// creating new basic blocks and control flow.
3626 /// As long as the returned basic block is different (i.e., we created a new
3627 /// one), the custom inserter is free to modify the rest of \p MBB.
3628 virtual MachineBasicBlock *
3629 EmitInstrWithCustomInserter(MachineInstr &MI, MachineBasicBlock *MBB) const;
3630
3631 /// This method should be implemented by targets that mark instructions with
3632 /// the 'hasPostISelHook' flag. These instructions must be adjusted after
3633 /// instruction selection by target hooks. e.g. To fill in optional defs for
3634 /// ARM 's' setting instructions.
3635 virtual void AdjustInstrPostInstrSelection(MachineInstr &MI,
3636 SDNode *Node) const;
3637
3638 /// If this function returns true, SelectionDAGBuilder emits a
3639 /// LOAD_STACK_GUARD node when it is lowering Intrinsic::stackprotector.
3640 virtual bool useLoadStackGuardNode() const {
3641 return false;
3642 }
3643
3644 virtual SDValue emitStackGuardXorFP(SelectionDAG &DAG, SDValue Val,
3645 const SDLoc &DL) const {
3646 llvm_unreachable("not implemented for this target")::llvm::llvm_unreachable_internal("not implemented for this target"
, "/build/llvm-toolchain-sn