Bug Summary

File:lib/Target/ARM/ARMTargetTransformInfo.cpp
Warning:line 1036, 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~svn329677/build-llvm/lib/Target/ARM -I /build/llvm-toolchain-snapshot-7~svn329677/lib/Target/ARM -I /build/llvm-toolchain-snapshot-7~svn329677/build-llvm/include -I /build/llvm-toolchain-snapshot-7~svn329677/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/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~svn329677/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-checker optin.performance.Padding -analyzer-output=html -analyzer-config stable-report-filename=true -o /tmp/scan-build-2018-04-11-031539-24776-1 -x c++ /build/llvm-toolchain-snapshot-7~svn329677/lib/Target/ARM/ARMTargetTransformInfo.cpp

/build/llvm-toolchain-snapshot-7~svn329677/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~svn329677/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~svn329677/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 alternate shuffles for now.
404 if (Kind != TTI::SK_Reverse && Kind != TTI::SK_Alternate)
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_Alternate) {
430 static const CostTblEntry NEONAltShuffleTbl[] = {
431 // Alt 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(NEONAltShuffleTbl,
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~svn329677/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~svn329677/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 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 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
626 // Force unrolling small loops can be very useful because of the branch
627 // taken cost of the backedge.
628 if (Cost < 12)
629 UP.Force = true;
630}

/build/llvm-toolchain-snapshot-7~svn329677/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/// \brief 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~svn329677/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 /// \brief 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 /// \brief 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~svn329677/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~svn329677/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~svn329677/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~svn329677/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~svn329677/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~svn329677/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 if (Kind == TTI::SK_Alternate || Kind == TTI::SK_PermuteTwoSrc ||
557 Kind == TTI::SK_PermuteSingleSrc) {
558 return getPermuteShuffleOverhead(Tp);
559 }
560 return 1;
561 }
562
563 unsigned getCastInstrCost(unsigned Opcode, Type *Dst, Type *Src,
564 const Instruction *I = nullptr) {
565 const TargetLoweringBase *TLI = getTLI();
566 int ISD = TLI->InstructionOpcodeToISD(Opcode);
567 assert(ISD && "Invalid opcode")(static_cast <bool> (ISD && "Invalid opcode") ?
void (0) : __assert_fail ("ISD && \"Invalid opcode\""
, "/build/llvm-toolchain-snapshot-7~svn329677/include/llvm/CodeGen/BasicTTIImpl.h"
, 567, __extension__ __PRETTY_FUNCTION__))
;
568 std::pair<unsigned, MVT> SrcLT = TLI->getTypeLegalizationCost(DL, Src);
569 std::pair<unsigned, MVT> DstLT = TLI->getTypeLegalizationCost(DL, Dst);
570
571 // Check for NOOP conversions.
572 if (SrcLT.first == DstLT.first &&
573 SrcLT.second.getSizeInBits() == DstLT.second.getSizeInBits()) {
574
575 // Bitcast between types that are legalized to the same type are free.
576 if (Opcode == Instruction::BitCast || Opcode == Instruction::Trunc)
577 return 0;
578 }
579
580 if (Opcode == Instruction::Trunc &&
581 TLI->isTruncateFree(SrcLT.second, DstLT.second))
582 return 0;
583
584 if (Opcode == Instruction::ZExt &&
585 TLI->isZExtFree(SrcLT.second, DstLT.second))
586 return 0;
587
588 if (Opcode == Instruction::AddrSpaceCast &&
589 TLI->isNoopAddrSpaceCast(Src->getPointerAddressSpace(),
590 Dst->getPointerAddressSpace()))
591 return 0;
592
593 // If this is a zext/sext of a load, return 0 if the corresponding
594 // extending load exists on target.
595 if ((Opcode == Instruction::ZExt || Opcode == Instruction::SExt) &&
596 I && isa<LoadInst>(I->getOperand(0))) {
597 EVT ExtVT = EVT::getEVT(Dst);
598 EVT LoadVT = EVT::getEVT(Src);
599 unsigned LType =
600 ((Opcode == Instruction::ZExt) ? ISD::ZEXTLOAD : ISD::SEXTLOAD);
601 if (TLI->isLoadExtLegal(LType, ExtVT, LoadVT))
602 return 0;
603 }
604
605 // If the cast is marked as legal (or promote) then assume low cost.
606 if (SrcLT.first == DstLT.first &&
607 TLI->isOperationLegalOrPromote(ISD, DstLT.second))
608 return 1;
609
610 // Handle scalar conversions.
611 if (!Src->isVectorTy() && !Dst->isVectorTy()) {
612 // Scalar bitcasts are usually free.
613 if (Opcode == Instruction::BitCast)
614 return 0;
615
616 // Just check the op cost. If the operation is legal then assume it costs
617 // 1.
618 if (!TLI->isOperationExpand(ISD, DstLT.second))
619 return 1;
620
621 // Assume that illegal scalar instruction are expensive.
622 return 4;
623 }
624
625 // Check vector-to-vector casts.
626 if (Dst->isVectorTy() && Src->isVectorTy()) {
627 // If the cast is between same-sized registers, then the check is simple.
628 if (SrcLT.first == DstLT.first &&
629 SrcLT.second.getSizeInBits() == DstLT.second.getSizeInBits()) {
630
631 // Assume that Zext is done using AND.
632 if (Opcode == Instruction::ZExt)
633 return 1;
634
635 // Assume that sext is done using SHL and SRA.
636 if (Opcode == Instruction::SExt)
637 return 2;
638
639 // Just check the op cost. If the operation is legal then assume it
640 // costs
641 // 1 and multiply by the type-legalization overhead.
642 if (!TLI->isOperationExpand(ISD, DstLT.second))
643 return SrcLT.first * 1;
644 }
645
646 // If we are legalizing by splitting, query the concrete TTI for the cost
647 // of casting the original vector twice. We also need to factor in the
648 // cost of the split itself. Count that as 1, to be consistent with
649 // TLI->getTypeLegalizationCost().
650 if ((TLI->getTypeAction(Src->getContext(), TLI->getValueType(DL, Src)) ==
651 TargetLowering::TypeSplitVector) ||
652 (TLI->getTypeAction(Dst->getContext(), TLI->getValueType(DL, Dst)) ==
653 TargetLowering::TypeSplitVector)) {
654 Type *SplitDst = VectorType::get(Dst->getVectorElementType(),
655 Dst->getVectorNumElements() / 2);
656 Type *SplitSrc = VectorType::get(Src->getVectorElementType(),
657 Src->getVectorNumElements() / 2);
658 T *TTI = static_cast<T *>(this);
659 return TTI->getVectorSplitCost() +
660 (2 * TTI->getCastInstrCost(Opcode, SplitDst, SplitSrc, I));
661 }
662
663 // In other cases where the source or destination are illegal, assume
664 // the operation will get scalarized.
665 unsigned Num = Dst->getVectorNumElements();
666 unsigned Cost = static_cast<T *>(this)->getCastInstrCost(
667 Opcode, Dst->getScalarType(), Src->getScalarType(), I);
668
669 // Return the cost of multiple scalar invocation plus the cost of
670 // inserting and extracting the values.
671 return getScalarizationOverhead(Dst, true, true) + Num * Cost;
672 }
673
674 // We already handled vector-to-vector and scalar-to-scalar conversions.
675 // This
676 // is where we handle bitcast between vectors and scalars. We need to assume
677 // that the conversion is scalarized in one way or another.
678 if (Opcode == Instruction::BitCast)
679 // Illegal bitcasts are done by storing and loading from a stack slot.
680 return (Src->isVectorTy() ? getScalarizationOverhead(Src, false, true)
681 : 0) +
682 (Dst->isVectorTy() ? getScalarizationOverhead(Dst, true, false)
683 : 0);
684
685 llvm_unreachable("Unhandled cast")::llvm::llvm_unreachable_internal("Unhandled cast", "/build/llvm-toolchain-snapshot-7~svn329677/include/llvm/CodeGen/BasicTTIImpl.h"
, 685)
;
686 }
687
688 unsigned getExtractWithExtendCost(unsigned Opcode, Type *Dst,
689 VectorType *VecTy, unsigned Index) {
690 return static_cast<T *>(this)->getVectorInstrCost(
691 Instruction::ExtractElement, VecTy, Index) +
692 static_cast<T *>(this)->getCastInstrCost(Opcode, Dst,
693 VecTy->getElementType());
694 }
695
696 unsigned getCFInstrCost(unsigned Opcode) {
697 // Branches are assumed to be predicted.
698 return 0;
699 }
700
701 unsigned getCmpSelInstrCost(unsigned Opcode, Type *ValTy, Type *CondTy,
702 const Instruction *I) {
703 const TargetLoweringBase *TLI = getTLI();
704 int ISD = TLI->InstructionOpcodeToISD(Opcode);
705 assert(ISD && "Invalid opcode")(static_cast <bool> (ISD && "Invalid opcode") ?
void (0) : __assert_fail ("ISD && \"Invalid opcode\""
, "/build/llvm-toolchain-snapshot-7~svn329677/include/llvm/CodeGen/BasicTTIImpl.h"
, 705, __extension__ __PRETTY_FUNCTION__))
;
706
707 // Selects on vectors are actually vector selects.
708 if (ISD == ISD::SELECT) {
4
Assuming 'ISD' is not equal to SELECT
5
Taking false branch
709 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~svn329677/include/llvm/CodeGen/BasicTTIImpl.h"
, 709, __extension__ __PRETTY_FUNCTION__))
;
710 if (CondTy->isVectorTy())
711 ISD = ISD::VSELECT;
712 }
713 std::pair<unsigned, MVT> LT = TLI->getTypeLegalizationCost(DL, ValTy);
714
715 if (!(ValTy->isVectorTy() && !LT.second.isVector()) &&
6
Taking false branch
716 !TLI->isOperationExpand(ISD, LT.second)) {
717 // The operation is legal. Assume it costs 1. Multiply
718 // by the type-legalization overhead.
719 return LT.first * 1;
720 }
721
722 // Otherwise, assume that the cast is scalarized.
723 // TODO: If one of the types get legalized by splitting, handle this
724 // similarly to what getCastInstrCost() does.
725 if (ValTy->isVectorTy()) {
7
Taking true branch
726 unsigned Num = ValTy->getVectorNumElements();
727 if (CondTy)
8
Assuming 'CondTy' is null
9
Taking false branch
728 CondTy = CondTy->getScalarType();
729 unsigned Cost = static_cast<T *>(this)->getCmpSelInstrCost(
11
Calling 'ARMTTIImpl::getCmpSelInstrCost'
730 Opcode, ValTy->getScalarType(), CondTy, I);
10
Passing null pointer value via 3rd parameter 'CondTy'
731
732 // Return the cost of multiple scalar invocation plus the cost of
733 // inserting and extracting the values.
734 return getScalarizationOverhead(ValTy, true, false) + Num * Cost;
735 }
736
737 // Unknown scalar opcode.
738 return 1;
739 }
740
741 unsigned getVectorInstrCost(unsigned Opcode, Type *Val, unsigned Index) {
742 std::pair<unsigned, MVT> LT =
743 getTLI()->getTypeLegalizationCost(DL, Val->getScalarType());
744
745 return LT.first;
746 }
747
748 unsigned getMemoryOpCost(unsigned Opcode, Type *Src, unsigned Alignment,
749 unsigned AddressSpace, const Instruction *I = nullptr) {
750 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~svn329677/include/llvm/CodeGen/BasicTTIImpl.h"
, 750, __extension__ __PRETTY_FUNCTION__))
;
751 std::pair<unsigned, MVT> LT = getTLI()->getTypeLegalizationCost(DL, Src);
752
753 // Assuming that all loads of legal types cost 1.
754 unsigned Cost = LT.first;
755
756 if (Src->isVectorTy() &&
757 Src->getPrimitiveSizeInBits() < LT.second.getSizeInBits()) {
758 // This is a vector load that legalizes to a larger type than the vector
759 // itself. Unless the corresponding extending load or truncating store is
760 // legal, then this will scalarize.
761 TargetLowering::LegalizeAction LA = TargetLowering::Expand;
762 EVT MemVT = getTLI()->getValueType(DL, Src);
763 if (Opcode == Instruction::Store)
764 LA = getTLI()->getTruncStoreAction(LT.second, MemVT);
765 else
766 LA = getTLI()->getLoadExtAction(ISD::EXTLOAD, LT.second, MemVT);
767
768 if (LA != TargetLowering::Legal && LA != TargetLowering::Custom) {
769 // This is a vector load/store for some illegal type that is scalarized.
770 // We must account for the cost of building or decomposing the vector.
771 Cost += getScalarizationOverhead(Src, Opcode != Instruction::Store,
772 Opcode == Instruction::Store);
773 }
774 }
775
776 return Cost;
777 }
778
779 unsigned getInterleavedMemoryOpCost(unsigned Opcode, Type *VecTy,
780 unsigned Factor,
781 ArrayRef<unsigned> Indices,
782 unsigned Alignment,
783 unsigned AddressSpace) {
784 VectorType *VT = dyn_cast<VectorType>(VecTy);
785 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~svn329677/include/llvm/CodeGen/BasicTTIImpl.h"
, 785, __extension__ __PRETTY_FUNCTION__))
;
786
787 unsigned NumElts = VT->getNumElements();
788 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~svn329677/include/llvm/CodeGen/BasicTTIImpl.h"
, 788, __extension__ __PRETTY_FUNCTION__))
;
789
790 unsigned NumSubElts = NumElts / Factor;
791 VectorType *SubVT = VectorType::get(VT->getElementType(), NumSubElts);
792
793 // Firstly, the cost of load/store operation.
794 unsigned Cost = static_cast<T *>(this)->getMemoryOpCost(
795 Opcode, VecTy, Alignment, AddressSpace);
796
797 // Legalize the vector type, and get the legalized and unlegalized type
798 // sizes.
799 MVT VecTyLT = getTLI()->getTypeLegalizationCost(DL, VecTy).second;
800 unsigned VecTySize =
801 static_cast<T *>(this)->getDataLayout().getTypeStoreSize(VecTy);
802 unsigned VecTyLTSize = VecTyLT.getStoreSize();
803
804 // Return the ceiling of dividing A by B.
805 auto ceil = [](unsigned A, unsigned B) { return (A + B - 1) / B; };
806
807 // Scale the cost of the memory operation by the fraction of legalized
808 // instructions that will actually be used. We shouldn't account for the
809 // cost of dead instructions since they will be removed.
810 //
811 // E.g., An interleaved load of factor 8:
812 // %vec = load <16 x i64>, <16 x i64>* %ptr
813 // %v0 = shufflevector %vec, undef, <0, 8>
814 //
815 // If <16 x i64> is legalized to 8 v2i64 loads, only 2 of the loads will be
816 // used (those corresponding to elements [0:1] and [8:9] of the unlegalized
817 // type). The other loads are unused.
818 //
819 // We only scale the cost of loads since interleaved store groups aren't
820 // allowed to have gaps.
821 if (Opcode == Instruction::Load && VecTySize > VecTyLTSize) {
822 // The number of loads of a legal type it will take to represent a load
823 // of the unlegalized vector type.
824 unsigned NumLegalInsts = ceil(VecTySize, VecTyLTSize);
825
826 // The number of elements of the unlegalized type that correspond to a
827 // single legal instruction.
828 unsigned NumEltsPerLegalInst = ceil(NumElts, NumLegalInsts);
829
830 // Determine which legal instructions will be used.
831 BitVector UsedInsts(NumLegalInsts, false);
832 for (unsigned Index : Indices)
833 for (unsigned Elt = 0; Elt < NumSubElts; ++Elt)
834 UsedInsts.set((Index + Elt * Factor) / NumEltsPerLegalInst);
835
836 // Scale the cost of the load by the fraction of legal instructions that
837 // will be used.
838 Cost *= UsedInsts.count() / NumLegalInsts;
839 }
840
841 // Then plus the cost of interleave operation.
842 if (Opcode == Instruction::Load) {
843 // The interleave cost is similar to extract sub vectors' elements
844 // from the wide vector, and insert them into sub vectors.
845 //
846 // E.g. An interleaved load of factor 2 (with one member of index 0):
847 // %vec = load <8 x i32>, <8 x i32>* %ptr
848 // %v0 = shuffle %vec, undef, <0, 2, 4, 6> ; Index 0
849 // The cost is estimated as extract elements at 0, 2, 4, 6 from the
850 // <8 x i32> vector and insert them into a <4 x i32> vector.
851
852 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~svn329677/include/llvm/CodeGen/BasicTTIImpl.h"
, 853, __extension__ __PRETTY_FUNCTION__))
853 "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~svn329677/include/llvm/CodeGen/BasicTTIImpl.h"
, 853, __extension__ __PRETTY_FUNCTION__))
;
854
855 for (unsigned Index : Indices) {
856 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~svn329677/include/llvm/CodeGen/BasicTTIImpl.h"
, 856, __extension__ __PRETTY_FUNCTION__))
;
857
858 // Extract elements from loaded vector for each sub vector.
859 for (unsigned i = 0; i < NumSubElts; i++)
860 Cost += static_cast<T *>(this)->getVectorInstrCost(
861 Instruction::ExtractElement, VT, Index + i * Factor);
862 }
863
864 unsigned InsSubCost = 0;
865 for (unsigned i = 0; i < NumSubElts; i++)
866 InsSubCost += static_cast<T *>(this)->getVectorInstrCost(
867 Instruction::InsertElement, SubVT, i);
868
869 Cost += Indices.size() * InsSubCost;
870 } else {
871 // The interleave cost is extract all elements from sub vectors, and
872 // insert them into the wide vector.
873 //
874 // E.g. An interleaved store of factor 2:
875 // %v0_v1 = shuffle %v0, %v1, <0, 4, 1, 5, 2, 6, 3, 7>
876 // store <8 x i32> %interleaved.vec, <8 x i32>* %ptr
877 // The cost is estimated as extract all elements from both <4 x i32>
878 // vectors and insert into the <8 x i32> vector.
879
880 unsigned ExtSubCost = 0;
881 for (unsigned i = 0; i < NumSubElts; i++)
882 ExtSubCost += static_cast<T *>(this)->getVectorInstrCost(
883 Instruction::ExtractElement, SubVT, i);
884 Cost += ExtSubCost * Factor;
885
886 for (unsigned i = 0; i < NumElts; i++)
887 Cost += static_cast<T *>(this)
888 ->getVectorInstrCost(Instruction::InsertElement, VT, i);
889 }
890
891 return Cost;
892 }
893
894 /// Get intrinsic cost based on arguments.
895 unsigned getIntrinsicInstrCost(Intrinsic::ID IID, Type *RetTy,
896 ArrayRef<Value *> Args, FastMathFlags FMF,
897 unsigned VF = 1) {
898 unsigned RetVF = (RetTy->isVectorTy() ? RetTy->getVectorNumElements() : 1);
899 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~svn329677/include/llvm/CodeGen/BasicTTIImpl.h"
, 899, __extension__ __PRETTY_FUNCTION__))
;
900
901 switch (IID) {
902 default: {
903 // Assume that we need to scalarize this intrinsic.
904 SmallVector<Type *, 4> Types;
905 for (Value *Op : Args) {
906 Type *OpTy = Op->getType();
907 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~svn329677/include/llvm/CodeGen/BasicTTIImpl.h"
, 907, __extension__ __PRETTY_FUNCTION__))
;
908 Types.push_back(VF == 1 ? OpTy : VectorType::get(OpTy, VF));
909 }
910
911 if (VF > 1 && !RetTy->isVoidTy())
912 RetTy = VectorType::get(RetTy, VF);
913
914 // Compute the scalarization overhead based on Args for a vector
915 // intrinsic. A vectorizer will pass a scalar RetTy and VF > 1, while
916 // CostModel will pass a vector RetTy and VF is 1.
917 unsigned ScalarizationCost = std::numeric_limits<unsigned>::max();
918 if (RetVF > 1 || VF > 1) {
919 ScalarizationCost = 0;
920 if (!RetTy->isVoidTy())
921 ScalarizationCost += getScalarizationOverhead(RetTy, true, false);
922 ScalarizationCost += getOperandsScalarizationOverhead(Args, VF);
923 }
924
925 return static_cast<T *>(this)->
926 getIntrinsicInstrCost(IID, RetTy, Types, FMF, ScalarizationCost);
927 }
928 case Intrinsic::masked_scatter: {
929 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~svn329677/include/llvm/CodeGen/BasicTTIImpl.h"
, 929, __extension__ __PRETTY_FUNCTION__))
;
930 Value *Mask = Args[3];
931 bool VarMask = !isa<Constant>(Mask);
932 unsigned Alignment = cast<ConstantInt>(Args[2])->getZExtValue();
933 return
934 static_cast<T *>(this)->getGatherScatterOpCost(Instruction::Store,
935 Args[0]->getType(),
936 Args[1], VarMask,
937 Alignment);
938 }
939 case Intrinsic::masked_gather: {
940 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~svn329677/include/llvm/CodeGen/BasicTTIImpl.h"
, 940, __extension__ __PRETTY_FUNCTION__))
;
941 Value *Mask = Args[2];
942 bool VarMask = !isa<Constant>(Mask);
943 unsigned Alignment = cast<ConstantInt>(Args[1])->getZExtValue();
944 return
945 static_cast<T *>(this)->getGatherScatterOpCost(Instruction::Load,
946 RetTy, Args[0], VarMask,
947 Alignment);
948 }
949 case Intrinsic::experimental_vector_reduce_add:
950 case Intrinsic::experimental_vector_reduce_mul:
951 case Intrinsic::experimental_vector_reduce_and:
952 case Intrinsic::experimental_vector_reduce_or:
953 case Intrinsic::experimental_vector_reduce_xor:
954 case Intrinsic::experimental_vector_reduce_fadd:
955 case Intrinsic::experimental_vector_reduce_fmul:
956 case Intrinsic::experimental_vector_reduce_smax:
957 case Intrinsic::experimental_vector_reduce_smin:
958 case Intrinsic::experimental_vector_reduce_fmax:
959 case Intrinsic::experimental_vector_reduce_fmin:
960 case Intrinsic::experimental_vector_reduce_umax:
961 case Intrinsic::experimental_vector_reduce_umin:
962 return getIntrinsicInstrCost(IID, RetTy, Args[0]->getType(), FMF);
963 }
964 }
965
966 /// Get intrinsic cost based on argument types.
967 /// If ScalarizationCostPassed is std::numeric_limits<unsigned>::max(), the
968 /// cost of scalarizing the arguments and the return value will be computed
969 /// based on types.
970 unsigned getIntrinsicInstrCost(
971 Intrinsic::ID IID, Type *RetTy, ArrayRef<Type *> Tys, FastMathFlags FMF,
972 unsigned ScalarizationCostPassed = std::numeric_limits<unsigned>::max()) {
973 SmallVector<unsigned, 2> ISDs;
974 unsigned SingleCallCost = 10; // Library call cost. Make it expensive.
975 switch (IID) {
976 default: {
977 // Assume that we need to scalarize this intrinsic.
978 unsigned ScalarizationCost = ScalarizationCostPassed;
979 unsigned ScalarCalls = 1;
980 Type *ScalarRetTy = RetTy;
981 if (RetTy->isVectorTy()) {
982 if (ScalarizationCostPassed == std::numeric_limits<unsigned>::max())
983 ScalarizationCost = getScalarizationOverhead(RetTy, true, false);
984 ScalarCalls = std::max(ScalarCalls, RetTy->getVectorNumElements());
985 ScalarRetTy = RetTy->getScalarType();
986 }
987 SmallVector<Type *, 4> ScalarTys;
988 for (unsigned i = 0, ie = Tys.size(); i != ie; ++i) {
989 Type *Ty = Tys[i];
990 if (Ty->isVectorTy()) {
991 if (ScalarizationCostPassed == std::numeric_limits<unsigned>::max())
992 ScalarizationCost += getScalarizationOverhead(Ty, false, true);
993 ScalarCalls = std::max(ScalarCalls, Ty->getVectorNumElements());
994 Ty = Ty->getScalarType();
995 }
996 ScalarTys.push_back(Ty);
997 }
998 if (ScalarCalls == 1)
999 return 1; // Return cost of a scalar intrinsic. Assume it to be cheap.
1000
1001 unsigned ScalarCost = static_cast<T *>(this)->getIntrinsicInstrCost(
1002 IID, ScalarRetTy, ScalarTys, FMF);
1003
1004 return ScalarCalls * ScalarCost + ScalarizationCost;
1005 }
1006 // Look for intrinsics that can be lowered directly or turned into a scalar
1007 // intrinsic call.
1008 case Intrinsic::sqrt:
1009 ISDs.push_back(ISD::FSQRT);
1010 break;
1011 case Intrinsic::sin:
1012 ISDs.push_back(ISD::FSIN);
1013 break;
1014 case Intrinsic::cos:
1015 ISDs.push_back(ISD::FCOS);
1016 break;
1017 case Intrinsic::exp:
1018 ISDs.push_back(ISD::FEXP);
1019 break;
1020 case Intrinsic::exp2:
1021 ISDs.push_back(ISD::FEXP2);
1022 break;
1023 case Intrinsic::log:
1024 ISDs.push_back(ISD::FLOG);
1025 break;
1026 case Intrinsic::log10:
1027 ISDs.push_back(ISD::FLOG10);
1028 break;
1029 case Intrinsic::log2:
1030 ISDs.push_back(ISD::FLOG2);
1031 break;
1032 case Intrinsic::fabs:
1033 ISDs.push_back(ISD::FABS);
1034 break;
1035 case Intrinsic::minnum:
1036 ISDs.push_back(ISD::FMINNUM);
1037 if (FMF.noNaNs())
1038 ISDs.push_back(ISD::FMINNAN);
1039 break;
1040 case Intrinsic::maxnum:
1041 ISDs.push_back(ISD::FMAXNUM);
1042 if (FMF.noNaNs())
1043 ISDs.push_back(ISD::FMAXNAN);
1044 break;
1045 case Intrinsic::copysign:
1046 ISDs.push_back(ISD::FCOPYSIGN);
1047 break;
1048 case Intrinsic::floor:
1049 ISDs.push_back(ISD::FFLOOR);
1050 break;
1051 case Intrinsic::ceil:
1052 ISDs.push_back(ISD::FCEIL);
1053 break;
1054 case Intrinsic::trunc:
1055 ISDs.push_back(ISD::FTRUNC);
1056 break;
1057 case Intrinsic::nearbyint:
1058 ISDs.push_back(ISD::FNEARBYINT);
1059 break;
1060 case Intrinsic::rint:
1061 ISDs.push_back(ISD::FRINT);
1062 break;
1063 case Intrinsic::round:
1064 ISDs.push_back(ISD::FROUND);
1065 break;
1066 case Intrinsic::pow:
1067 ISDs.push_back(ISD::FPOW);
1068 break;
1069 case Intrinsic::fma:
1070 ISDs.push_back(ISD::FMA);
1071 break;
1072 case Intrinsic::fmuladd:
1073 ISDs.push_back(ISD::FMA);
1074 break;
1075 // FIXME: We should return 0 whenever getIntrinsicCost == TCC_Free.
1076 case Intrinsic::lifetime_start:
1077 case Intrinsic::lifetime_end:
1078 case Intrinsic::sideeffect:
1079 return 0;
1080 case Intrinsic::masked_store:
1081 return static_cast<T *>(this)
1082 ->getMaskedMemoryOpCost(Instruction::Store, Tys[0], 0, 0);
1083 case Intrinsic::masked_load:
1084 return static_cast<T *>(this)
1085 ->getMaskedMemoryOpCost(Instruction::Load, RetTy, 0, 0);
1086 case Intrinsic::experimental_vector_reduce_add:
1087 return static_cast<T *>(this)->getArithmeticReductionCost(
1088 Instruction::Add, Tys[0], /*IsPairwiseForm=*/false);
1089 case Intrinsic::experimental_vector_reduce_mul:
1090 return static_cast<T *>(this)->getArithmeticReductionCost(
1091 Instruction::Mul, Tys[0], /*IsPairwiseForm=*/false);
1092 case Intrinsic::experimental_vector_reduce_and:
1093 return static_cast<T *>(this)->getArithmeticReductionCost(
1094 Instruction::And, Tys[0], /*IsPairwiseForm=*/false);
1095 case Intrinsic::experimental_vector_reduce_or:
1096 return static_cast<T *>(this)->getArithmeticReductionCost(
1097 Instruction::Or, Tys[0], /*IsPairwiseForm=*/false);
1098 case Intrinsic::experimental_vector_reduce_xor:
1099 return static_cast<T *>(this)->getArithmeticReductionCost(
1100 Instruction::Xor, Tys[0], /*IsPairwiseForm=*/false);
1101 case Intrinsic::experimental_vector_reduce_fadd:
1102 return static_cast<T *>(this)->getArithmeticReductionCost(
1103 Instruction::FAdd, Tys[0], /*IsPairwiseForm=*/false);
1104 case Intrinsic::experimental_vector_reduce_fmul:
1105 return static_cast<T *>(this)->getArithmeticReductionCost(
1106 Instruction::FMul, Tys[0], /*IsPairwiseForm=*/false);
1107 case Intrinsic::experimental_vector_reduce_smax:
1108 case Intrinsic::experimental_vector_reduce_smin:
1109 case Intrinsic::experimental_vector_reduce_fmax:
1110 case Intrinsic::experimental_vector_reduce_fmin:
1111 return static_cast<T *>(this)->getMinMaxReductionCost(
1112 Tys[0], CmpInst::makeCmpResultType(Tys[0]), /*IsPairwiseForm=*/false,
1113 /*IsSigned=*/true);
1114 case Intrinsic::experimental_vector_reduce_umax:
1115 case Intrinsic::experimental_vector_reduce_umin:
1116 return static_cast<T *>(this)->getMinMaxReductionCost(
1117 Tys[0], CmpInst::makeCmpResultType(Tys[0]), /*IsPairwiseForm=*/false,
1118 /*IsSigned=*/false);
1119 case Intrinsic::ctpop:
1120 ISDs.push_back(ISD::CTPOP);
1121 // In case of legalization use TCC_Expensive. This is cheaper than a
1122 // library call but still not a cheap instruction.
1123 SingleCallCost = TargetTransformInfo::TCC_Expensive;
1124 break;
1125 // FIXME: ctlz, cttz, ...
1126 }
1127
1128 const TargetLoweringBase *TLI = getTLI();
1129 std::pair<unsigned, MVT> LT = TLI->getTypeLegalizationCost(DL, RetTy);
1130
1131 SmallVector<unsigned, 2> LegalCost;
1132 SmallVector<unsigned, 2> CustomCost;
1133 for (unsigned ISD : ISDs) {
1134 if (TLI->isOperationLegalOrPromote(ISD, LT.second)) {
1135 if (IID == Intrinsic::fabs && TLI->isFAbsFree(LT.second)) {
1136 return 0;
1137 }
1138
1139 // The operation is legal. Assume it costs 1.
1140 // If the type is split to multiple registers, assume that there is some
1141 // overhead to this.
1142 // TODO: Once we have extract/insert subvector cost we need to use them.
1143 if (LT.first > 1)
1144 LegalCost.push_back(LT.first * 2);
1145 else
1146 LegalCost.push_back(LT.first * 1);
1147 } else if (!TLI->isOperationExpand(ISD, LT.second)) {
1148 // If the operation is custom lowered then assume
1149 // that the code is twice as expensive.
1150 CustomCost.push_back(LT.first * 2);
1151 }
1152 }
1153
1154 auto MinLegalCostI = std::min_element(LegalCost.begin(), LegalCost.end());
1155 if (MinLegalCostI != LegalCost.end())
1156 return *MinLegalCostI;
1157
1158 auto MinCustomCostI = std::min_element(CustomCost.begin(), CustomCost.end());
1159 if (MinCustomCostI != CustomCost.end())
1160 return *MinCustomCostI;
1161
1162 // If we can't lower fmuladd into an FMA estimate the cost as a floating
1163 // point mul followed by an add.
1164 if (IID == Intrinsic::fmuladd)
1165 return static_cast<T *>(this)
1166 ->getArithmeticInstrCost(BinaryOperator::FMul, RetTy) +
1167 static_cast<T *>(this)
1168 ->getArithmeticInstrCost(BinaryOperator::FAdd, RetTy);
1169
1170 // Else, assume that we need to scalarize this intrinsic. For math builtins
1171 // this will emit a costly libcall, adding call overhead and spills. Make it
1172 // very expensive.
1173 if (RetTy->isVectorTy()) {
1174 unsigned ScalarizationCost =
1175 ((ScalarizationCostPassed != std::numeric_limits<unsigned>::max())
1176 ? ScalarizationCostPassed
1177 : getScalarizationOverhead(RetTy, true, false));
1178 unsigned ScalarCalls = RetTy->getVectorNumElements();
1179 SmallVector<Type *, 4> ScalarTys;
1180 for (unsigned i = 0, ie = Tys.size(); i != ie; ++i) {
1181 Type *Ty = Tys[i];
1182 if (Ty->isVectorTy())
1183 Ty = Ty->getScalarType();
1184 ScalarTys.push_back(Ty);
1185 }
1186 unsigned ScalarCost = static_cast<T *>(this)->getIntrinsicInstrCost(
1187 IID, RetTy->getScalarType(), ScalarTys, FMF);
1188 for (unsigned i = 0, ie = Tys.size(); i != ie; ++i) {
1189 if (Tys[i]->isVectorTy()) {
1190 if (ScalarizationCostPassed == std::numeric_limits<unsigned>::max())
1191 ScalarizationCost += getScalarizationOverhead(Tys[i], false, true);
1192 ScalarCalls = std::max(ScalarCalls, Tys[i]->getVectorNumElements());
1193 }
1194 }
1195
1196 return ScalarCalls * ScalarCost + ScalarizationCost;
1197 }
1198
1199 // This is going to be turned into a library call, make it expensive.
1200 return SingleCallCost;
1201 }
1202
1203 /// \brief Compute a cost of the given call instruction.
1204 ///
1205 /// Compute the cost of calling function F with return type RetTy and
1206 /// argument types Tys. F might be nullptr, in this case the cost of an
1207 /// arbitrary call with the specified signature will be returned.
1208 /// This is used, for instance, when we estimate call of a vector
1209 /// counterpart of the given function.
1210 /// \param F Called function, might be nullptr.
1211 /// \param RetTy Return value types.
1212 /// \param Tys Argument types.
1213 /// \returns The cost of Call instruction.
1214 unsigned getCallInstrCost(Function *F, Type *RetTy, ArrayRef<Type *> Tys) {
1215 return 10;
1216 }
1217
1218 unsigned getNumberOfParts(Type *Tp) {
1219 std::pair<unsigned, MVT> LT = getTLI()->getTypeLegalizationCost(DL, Tp);
1220 return LT.first;
1221 }
1222
1223 unsigned getAddressComputationCost(Type *Ty, ScalarEvolution *,
1224 const SCEV *) {
1225 return 0;
1226 }
1227
1228 /// Try to calculate arithmetic and shuffle op costs for reduction operations.
1229 /// We're assuming that reduction operation are performing the following way:
1230 /// 1. Non-pairwise reduction
1231 /// %val1 = shufflevector<n x t> %val, <n x t> %undef,
1232 /// <n x i32> <i32 n/2, i32 n/2 + 1, ..., i32 n, i32 undef, ..., i32 undef>
1233 /// \----------------v-------------/ \----------v------------/
1234 /// n/2 elements n/2 elements
1235 /// %red1 = op <n x t> %val, <n x t> val1
1236 /// After this operation we have a vector %red1 where only the first n/2
1237 /// elements are meaningful, the second n/2 elements are undefined and can be
1238 /// dropped. All other operations are actually working with the vector of
1239 /// length n/2, not n, though the real vector length is still n.
1240 /// %val2 = shufflevector<n x t> %red1, <n x t> %undef,
1241 /// <n x i32> <i32 n/4, i32 n/4 + 1, ..., i32 n/2, i32 undef, ..., i32 undef>
1242 /// \----------------v-------------/ \----------v------------/
1243 /// n/4 elements 3*n/4 elements
1244 /// %red2 = op <n x t> %red1, <n x t> val2 - working with the vector of
1245 /// length n/2, the resulting vector has length n/4 etc.
1246 /// 2. Pairwise reduction:
1247 /// Everything is the same except for an additional shuffle operation which
1248 /// is used to produce operands for pairwise kind of reductions.
1249 /// %val1 = shufflevector<n x t> %val, <n x t> %undef,
1250 /// <n x i32> <i32 0, i32 2, ..., i32 n-2, i32 undef, ..., i32 undef>
1251 /// \-------------v----------/ \----------v------------/
1252 /// n/2 elements n/2 elements
1253 /// %val2 = shufflevector<n x t> %val, <n x t> %undef,
1254 /// <n x i32> <i32 1, i32 3, ..., i32 n-1, i32 undef, ..., i32 undef>
1255 /// \-------------v----------/ \----------v------------/
1256 /// n/2 elements n/2 elements
1257 /// %red1 = op <n x t> %val1, <n x t> val2
1258 /// Again, the operation is performed on <n x t> vector, but the resulting
1259 /// vector %red1 is <n/2 x t> vector.
1260 ///
1261 /// The cost model should take into account that the actual length of the
1262 /// vector is reduced on each iteration.
1263 unsigned getArithmeticReductionCost(unsigned Opcode, Type *Ty,
1264 bool IsPairwise) {
1265 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~svn329677/include/llvm/CodeGen/BasicTTIImpl.h"
, 1265, __extension__ __PRETTY_FUNCTION__))
;
1266 Type *ScalarTy = Ty->getVectorElementType();
1267 unsigned NumVecElts = Ty->getVectorNumElements();
1268 unsigned NumReduxLevels = Log2_32(NumVecElts);
1269 unsigned ArithCost = 0;
1270 unsigned ShuffleCost = 0;
1271 auto *ConcreteTTI = static_cast<T *>(this);
1272 std::pair<unsigned, MVT> LT =
1273 ConcreteTTI->getTLI()->getTypeLegalizationCost(DL, Ty);
1274 unsigned LongVectorCount = 0;
1275 unsigned MVTLen =
1276 LT.second.isVector() ? LT.second.getVectorNumElements() : 1;
1277 while (NumVecElts > MVTLen) {
1278 NumVecElts /= 2;
1279 // Assume the pairwise shuffles add a cost.
1280 ShuffleCost += (IsPairwise + 1) *
1281 ConcreteTTI->getShuffleCost(TTI::SK_ExtractSubvector, Ty,
1282 NumVecElts, Ty);
1283 ArithCost += ConcreteTTI->getArithmeticInstrCost(Opcode, Ty);
1284 Ty = VectorType::get(ScalarTy, NumVecElts);
1285 ++LongVectorCount;
1286 }
1287 // The minimal length of the vector is limited by the real length of vector
1288 // operations performed on the current platform. That's why several final
1289 // reduction operations are performed on the vectors with the same
1290 // architecture-dependent length.
1291 ShuffleCost += (NumReduxLevels - LongVectorCount) * (IsPairwise + 1) *
1292 ConcreteTTI->getShuffleCost(TTI::SK_ExtractSubvector, Ty,
1293 NumVecElts, Ty);
1294 ArithCost += (NumReduxLevels - LongVectorCount) *
1295 ConcreteTTI->getArithmeticInstrCost(Opcode, Ty);
1296 return ShuffleCost + ArithCost + getScalarizationOverhead(Ty, false, true);
1297 }
1298
1299 /// Try to calculate op costs for min/max reduction operations.
1300 /// \param CondTy Conditional type for the Select instruction.
1301 unsigned getMinMaxReductionCost(Type *Ty, Type *CondTy, bool IsPairwise,
1302 bool) {
1303 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~svn329677/include/llvm/CodeGen/BasicTTIImpl.h"
, 1303, __extension__ __PRETTY_FUNCTION__))
;
1304 Type *ScalarTy = Ty->getVectorElementType();
1305 Type *ScalarCondTy = CondTy->getVectorElementType();
1306 unsigned NumVecElts = Ty->getVectorNumElements();
1307 unsigned NumReduxLevels = Log2_32(NumVecElts);
1308 unsigned CmpOpcode;
1309 if (Ty->isFPOrFPVectorTy()) {
1310 CmpOpcode = Instruction::FCmp;
1311 } else {
1312 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~svn329677/include/llvm/CodeGen/BasicTTIImpl.h"
, 1313, __extension__ __PRETTY_FUNCTION__))
1313 "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~svn329677/include/llvm/CodeGen/BasicTTIImpl.h"
, 1313, __extension__ __PRETTY_FUNCTION__))
;
1314 CmpOpcode = Instruction::ICmp;
1315 }
1316 unsigned MinMaxCost = 0;
1317 unsigned ShuffleCost = 0;
1318 auto *ConcreteTTI = static_cast<T *>(this);
1319 std::pair<unsigned, MVT> LT =
1320 ConcreteTTI->getTLI()->getTypeLegalizationCost(DL, Ty);
1321 unsigned LongVectorCount = 0;
1322 unsigned MVTLen =
1323 LT.second.isVector() ? LT.second.getVectorNumElements() : 1;
1324 while (NumVecElts > MVTLen) {
1325 NumVecElts /= 2;
1326 // Assume the pairwise shuffles add a cost.
1327 ShuffleCost += (IsPairwise + 1) *
1328 ConcreteTTI->getShuffleCost(TTI::SK_ExtractSubvector, Ty,
1329 NumVecElts, Ty);
1330 MinMaxCost +=
1331 ConcreteTTI->getCmpSelInstrCost(CmpOpcode, Ty, CondTy, nullptr) +
1332 ConcreteTTI->getCmpSelInstrCost(Instruction::Select, Ty, CondTy,
1333 nullptr);
1334 Ty = VectorType::get(ScalarTy, NumVecElts);
1335 CondTy = VectorType::get(ScalarCondTy, NumVecElts);
1336 ++LongVectorCount;
1337 }
1338 // The minimal length of the vector is limited by the real length of vector
1339 // operations performed on the current platform. That's why several final
1340 // reduction opertions are perfomed on the vectors with the same
1341 // architecture-dependent length.
1342 ShuffleCost += (NumReduxLevels - LongVectorCount) * (IsPairwise + 1) *
1343 ConcreteTTI->getShuffleCost(TTI::SK_ExtractSubvector, Ty,
1344 NumVecElts, Ty);
1345 MinMaxCost +=
1346 (NumReduxLevels - LongVectorCount) *
1347 (ConcreteTTI->getCmpSelInstrCost(CmpOpcode, Ty, CondTy, nullptr) +
1348 ConcreteTTI->getCmpSelInstrCost(Instruction::Select, Ty, CondTy,
1349 nullptr));
1350 // Need 3 extractelement instructions for scalarization + an additional
1351 // scalar select instruction.
1352 return ShuffleCost + MinMaxCost +
1353 3 * getScalarizationOverhead(Ty, /*Insert=*/false,
1354 /*Extract=*/true) +
1355 ConcreteTTI->getCmpSelInstrCost(Instruction::Select, ScalarTy,
1356 ScalarCondTy, nullptr);
1357 }
1358
1359 unsigned getVectorSplitCost() { return 1; }
1360
1361 /// @}
1362};
1363
1364/// \brief Concrete BasicTTIImpl that can be used if no further customization
1365/// is needed.
1366class BasicTTIImpl : public BasicTTIImplBase<BasicTTIImpl> {
1367 using BaseT = BasicTTIImplBase<BasicTTIImpl>;
1368
1369 friend class BasicTTIImplBase<BasicTTIImpl>;
1370
1371 const TargetSubtargetInfo *ST;
1372 const TargetLoweringBase *TLI;
1373
1374 const TargetSubtargetInfo *getST() const { return ST; }
1375 const TargetLoweringBase *getTLI() const { return TLI; }
1376
1377public:
1378 explicit BasicTTIImpl(const TargetMachine *ST, const Function &F);
1379};
1380
1381} // end namespace llvm
1382
1383#endif // LLVM_CODEGEN_BASICTTIIMPL_H

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