1 | //===- MCSubtargetInfo.cpp - Subtarget Information ------------------------===// |
2 | // |
3 | // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. |
4 | // See https://llvm.org/LICENSE.txt for license information. |
5 | // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception |
6 | // |
7 | //===----------------------------------------------------------------------===// |
8 | |
9 | #include "llvm/MC/MCSubtargetInfo.h" |
10 | #include "llvm/ADT/ArrayRef.h" |
11 | #include "llvm/ADT/StringRef.h" |
12 | #include "llvm/ADT/Twine.h" |
13 | #include "llvm/MC/MCInstrItineraries.h" |
14 | #include "llvm/MC/MCSchedule.h" |
15 | #include "llvm/Support/Format.h" |
16 | #include "llvm/Support/raw_ostream.h" |
17 | #include "llvm/TargetParser/SubtargetFeature.h" |
18 | #include <algorithm> |
19 | #include <cassert> |
20 | #include <cstring> |
21 | #include <optional> |
22 | |
23 | using namespace llvm; |
24 | |
25 | /// Find KV in array using binary search. |
26 | template <typename T> |
27 | static const T *Find(StringRef S, ArrayRef<T> A) { |
28 | // Binary search the array |
29 | auto F = llvm::lower_bound(A, S); |
30 | // If not found then return NULL |
31 | if (F == A.end() || StringRef(F->Key) != S) return nullptr; |
32 | // Return the found array item |
33 | return F; |
34 | } |
35 | |
36 | /// For each feature that is (transitively) implied by this feature, set it. |
37 | static |
38 | void SetImpliedBits(FeatureBitset &Bits, const FeatureBitset &Implies, |
39 | ArrayRef<SubtargetFeatureKV> FeatureTable) { |
40 | // OR the Implies bits in outside the loop. This allows the Implies for CPUs |
41 | // which might imply features not in FeatureTable to use this. |
42 | Bits |= Implies; |
43 | for (const SubtargetFeatureKV &FE : FeatureTable) |
44 | if (Implies.test(I: FE.Value)) |
45 | SetImpliedBits(Bits, Implies: FE.Implies.getAsBitset(), FeatureTable); |
46 | } |
47 | |
48 | /// For each feature that (transitively) implies this feature, clear it. |
49 | static |
50 | void ClearImpliedBits(FeatureBitset &Bits, unsigned Value, |
51 | ArrayRef<SubtargetFeatureKV> FeatureTable) { |
52 | for (const SubtargetFeatureKV &FE : FeatureTable) { |
53 | if (FE.Implies.getAsBitset().test(I: Value)) { |
54 | Bits.reset(I: FE.Value); |
55 | ClearImpliedBits(Bits, Value: FE.Value, FeatureTable); |
56 | } |
57 | } |
58 | } |
59 | |
60 | static void ApplyFeatureFlag(FeatureBitset &Bits, StringRef Feature, |
61 | ArrayRef<SubtargetFeatureKV> FeatureTable) { |
62 | assert(SubtargetFeatures::hasFlag(Feature) && |
63 | "Feature flags should start with '+' or '-'" ); |
64 | |
65 | // Find feature in table. |
66 | const SubtargetFeatureKV *FeatureEntry = |
67 | Find(S: SubtargetFeatures::StripFlag(Feature), A: FeatureTable); |
68 | // If there is a match |
69 | if (FeatureEntry) { |
70 | // Enable/disable feature in bits |
71 | if (SubtargetFeatures::isEnabled(Feature)) { |
72 | Bits.set(FeatureEntry->Value); |
73 | |
74 | // For each feature that this implies, set it. |
75 | SetImpliedBits(Bits, Implies: FeatureEntry->Implies.getAsBitset(), FeatureTable); |
76 | } else { |
77 | Bits.reset(I: FeatureEntry->Value); |
78 | |
79 | // For each feature that implies this, clear it. |
80 | ClearImpliedBits(Bits, Value: FeatureEntry->Value, FeatureTable); |
81 | } |
82 | } else { |
83 | errs() << "'" << Feature << "' is not a recognized feature for this target" |
84 | << " (ignoring feature)\n" ; |
85 | } |
86 | } |
87 | |
88 | /// Return the length of the longest entry in the table. |
89 | static size_t getLongestEntryLength(ArrayRef<SubtargetFeatureKV> Table) { |
90 | size_t MaxLen = 0; |
91 | for (auto &I : Table) |
92 | MaxLen = std::max(a: MaxLen, b: std::strlen(s: I.Key)); |
93 | return MaxLen; |
94 | } |
95 | |
96 | static size_t getLongestEntryLength(ArrayRef<StringRef> Table) { |
97 | size_t MaxLen = 0; |
98 | for (StringRef I : Table) |
99 | MaxLen = std::max(a: MaxLen, b: I.size()); |
100 | return MaxLen; |
101 | } |
102 | |
103 | /// Display help for feature and mcpu choices. |
104 | static void Help(ArrayRef<StringRef> CPUNames, |
105 | ArrayRef<SubtargetFeatureKV> FeatTable) { |
106 | // the static variable ensures that the help information only gets |
107 | // printed once even though a target machine creates multiple subtargets |
108 | static bool PrintOnce = false; |
109 | if (PrintOnce) { |
110 | return; |
111 | } |
112 | |
113 | // Determine the length of the longest CPU and Feature entries. |
114 | unsigned MaxCPULen = getLongestEntryLength(Table: CPUNames); |
115 | unsigned MaxFeatLen = getLongestEntryLength(Table: FeatTable); |
116 | |
117 | // Print the CPU table. |
118 | errs() << "Available CPUs for this target:\n\n" ; |
119 | for (auto &CPUName : CPUNames) { |
120 | // Skip apple-latest, as that's only meant to be used in |
121 | // disassemblers/debuggers, and we don't want normal code to be built with |
122 | // it as an -mcpu= |
123 | if (CPUName == "apple-latest" ) |
124 | continue; |
125 | errs() << format(Fmt: " %-*s - Select the %s processor.\n" , Vals: MaxCPULen, |
126 | Vals: CPUName.str().c_str(), Vals: CPUName.str().c_str()); |
127 | } |
128 | errs() << '\n'; |
129 | |
130 | // Print the Feature table. |
131 | errs() << "Available features for this target:\n\n" ; |
132 | for (auto &Feature : FeatTable) |
133 | errs() << format(Fmt: " %-*s - %s.\n" , Vals: MaxFeatLen, Vals: Feature.Key, Vals: Feature.Desc); |
134 | errs() << '\n'; |
135 | |
136 | errs() << "Use +feature to enable a feature, or -feature to disable it.\n" |
137 | "For example, llc -mcpu=mycpu -mattr=+feature1,-feature2\n" ; |
138 | |
139 | PrintOnce = true; |
140 | } |
141 | |
142 | /// Display help for mcpu choices only |
143 | static void cpuHelp(ArrayRef<StringRef> CPUNames) { |
144 | // the static variable ensures that the help information only gets |
145 | // printed once even though a target machine creates multiple subtargets |
146 | static bool PrintOnce = false; |
147 | if (PrintOnce) { |
148 | return; |
149 | } |
150 | |
151 | // Print the CPU table. |
152 | errs() << "Available CPUs for this target:\n\n" ; |
153 | for (auto &CPU : CPUNames) { |
154 | // Skip apple-latest, as that's only meant to be used in |
155 | // disassemblers/debuggers, and we don't want normal code to be built with |
156 | // it as an -mcpu= |
157 | if (CPU == "apple-latest" ) |
158 | continue; |
159 | errs() << "\t" << CPU << "\n" ; |
160 | } |
161 | errs() << '\n'; |
162 | |
163 | errs() << "Use -mcpu or -mtune to specify the target's processor.\n" |
164 | "For example, clang --target=aarch64-unknown-linux-gnu " |
165 | "-mcpu=cortex-a35\n" ; |
166 | |
167 | PrintOnce = true; |
168 | } |
169 | |
170 | static FeatureBitset getFeatures(MCSubtargetInfo &STI, StringRef CPU, |
171 | StringRef TuneCPU, StringRef FS, |
172 | ArrayRef<StringRef> ProcNames, |
173 | ArrayRef<SubtargetSubTypeKV> ProcDesc, |
174 | ArrayRef<SubtargetFeatureKV> ProcFeatures) { |
175 | SubtargetFeatures Features(FS); |
176 | |
177 | if (ProcDesc.empty() || ProcFeatures.empty()) |
178 | return FeatureBitset(); |
179 | |
180 | assert(llvm::is_sorted(ProcDesc) && "CPU table is not sorted" ); |
181 | assert(llvm::is_sorted(ProcFeatures) && "CPU features table is not sorted" ); |
182 | // Resulting bits |
183 | FeatureBitset Bits; |
184 | |
185 | // Check if help is needed |
186 | if (CPU == "help" ) |
187 | Help(CPUNames: ProcNames, FeatTable: ProcFeatures); |
188 | |
189 | // Find CPU entry if CPU name is specified. |
190 | else if (!CPU.empty()) { |
191 | const SubtargetSubTypeKV *CPUEntry = Find(S: CPU, A: ProcDesc); |
192 | |
193 | // If there is a match |
194 | if (CPUEntry) { |
195 | // Set the features implied by this CPU feature, if any. |
196 | SetImpliedBits(Bits, Implies: CPUEntry->Implies.getAsBitset(), FeatureTable: ProcFeatures); |
197 | } else { |
198 | errs() << "'" << CPU << "' is not a recognized processor for this target" |
199 | << " (ignoring processor)\n" ; |
200 | } |
201 | } |
202 | |
203 | if (!TuneCPU.empty()) { |
204 | const SubtargetSubTypeKV *CPUEntry = Find(S: TuneCPU, A: ProcDesc); |
205 | |
206 | // If there is a match |
207 | if (CPUEntry) { |
208 | // Set the features implied by this CPU feature, if any. |
209 | SetImpliedBits(Bits, Implies: CPUEntry->TuneImplies.getAsBitset(), FeatureTable: ProcFeatures); |
210 | } else if (TuneCPU != CPU) { |
211 | errs() << "'" << TuneCPU << "' is not a recognized processor for this " |
212 | << "target (ignoring processor)\n" ; |
213 | } |
214 | } |
215 | |
216 | // Iterate through each feature |
217 | for (const std::string &Feature : Features.getFeatures()) { |
218 | // Check for help |
219 | if (Feature == "+help" ) |
220 | Help(CPUNames: ProcNames, FeatTable: ProcFeatures); |
221 | else if (Feature == "+cpuhelp" ) |
222 | cpuHelp(CPUNames: ProcNames); |
223 | else |
224 | ApplyFeatureFlag(Bits, Feature, FeatureTable: ProcFeatures); |
225 | } |
226 | |
227 | return Bits; |
228 | } |
229 | |
230 | void MCSubtargetInfo::InitMCProcessorInfo(StringRef CPU, StringRef TuneCPU, |
231 | StringRef FS) { |
232 | FeatureBits = |
233 | getFeatures(STI&: *this, CPU, TuneCPU, FS, ProcNames, ProcDesc, ProcFeatures); |
234 | FeatureString = std::string(FS); |
235 | |
236 | if (!TuneCPU.empty()) |
237 | CPUSchedModel = &getSchedModelForCPU(CPU: TuneCPU); |
238 | else |
239 | CPUSchedModel = &MCSchedModel::Default; |
240 | } |
241 | |
242 | void MCSubtargetInfo::setDefaultFeatures(StringRef CPU, StringRef TuneCPU, |
243 | StringRef FS) { |
244 | FeatureBits = |
245 | getFeatures(STI&: *this, CPU, TuneCPU, FS, ProcNames, ProcDesc, ProcFeatures); |
246 | FeatureString = std::string(FS); |
247 | } |
248 | |
249 | MCSubtargetInfo::MCSubtargetInfo( |
250 | const Triple &TT, StringRef C, StringRef TC, StringRef FS, |
251 | ArrayRef<StringRef> PN, ArrayRef<SubtargetFeatureKV> PF, |
252 | ArrayRef<SubtargetSubTypeKV> PD, const MCWriteProcResEntry *WPR, |
253 | const MCWriteLatencyEntry *WL, const MCReadAdvanceEntry *RA, |
254 | const InstrStage *IS, const unsigned *OC, const unsigned *FP) |
255 | : TargetTriple(TT), CPU(std::string(C)), TuneCPU(std::string(TC)), |
256 | ProcNames(PN), ProcFeatures(PF), ProcDesc(PD), WriteProcResTable(WPR), |
257 | WriteLatencyTable(WL), ReadAdvanceTable(RA), Stages(IS), |
258 | OperandCycles(OC), ForwardingPaths(FP) { |
259 | InitMCProcessorInfo(CPU, TuneCPU, FS); |
260 | } |
261 | |
262 | FeatureBitset MCSubtargetInfo::ToggleFeature(uint64_t FB) { |
263 | FeatureBits.flip(I: FB); |
264 | return FeatureBits; |
265 | } |
266 | |
267 | FeatureBitset MCSubtargetInfo::ToggleFeature(const FeatureBitset &FB) { |
268 | FeatureBits ^= FB; |
269 | return FeatureBits; |
270 | } |
271 | |
272 | FeatureBitset MCSubtargetInfo::SetFeatureBitsTransitively( |
273 | const FeatureBitset &FB) { |
274 | SetImpliedBits(Bits&: FeatureBits, Implies: FB, FeatureTable: ProcFeatures); |
275 | return FeatureBits; |
276 | } |
277 | |
278 | FeatureBitset MCSubtargetInfo::ClearFeatureBitsTransitively( |
279 | const FeatureBitset &FB) { |
280 | for (unsigned I = 0, E = FB.size(); I < E; I++) { |
281 | if (FB[I]) { |
282 | FeatureBits.reset(I); |
283 | ClearImpliedBits(Bits&: FeatureBits, Value: I, FeatureTable: ProcFeatures); |
284 | } |
285 | } |
286 | return FeatureBits; |
287 | } |
288 | |
289 | FeatureBitset MCSubtargetInfo::ToggleFeature(StringRef Feature) { |
290 | // Find feature in table. |
291 | const SubtargetFeatureKV *FeatureEntry = |
292 | Find(S: SubtargetFeatures::StripFlag(Feature), A: ProcFeatures); |
293 | // If there is a match |
294 | if (FeatureEntry) { |
295 | if (FeatureBits.test(I: FeatureEntry->Value)) { |
296 | FeatureBits.reset(I: FeatureEntry->Value); |
297 | // For each feature that implies this, clear it. |
298 | ClearImpliedBits(Bits&: FeatureBits, Value: FeatureEntry->Value, FeatureTable: ProcFeatures); |
299 | } else { |
300 | FeatureBits.set(FeatureEntry->Value); |
301 | |
302 | // For each feature that this implies, set it. |
303 | SetImpliedBits(Bits&: FeatureBits, Implies: FeatureEntry->Implies.getAsBitset(), |
304 | FeatureTable: ProcFeatures); |
305 | } |
306 | } else { |
307 | errs() << "'" << Feature << "' is not a recognized feature for this target" |
308 | << " (ignoring feature)\n" ; |
309 | } |
310 | |
311 | return FeatureBits; |
312 | } |
313 | |
314 | FeatureBitset MCSubtargetInfo::ApplyFeatureFlag(StringRef FS) { |
315 | ::ApplyFeatureFlag(Bits&: FeatureBits, Feature: FS, FeatureTable: ProcFeatures); |
316 | return FeatureBits; |
317 | } |
318 | |
319 | bool MCSubtargetInfo::checkFeatures(StringRef FS) const { |
320 | SubtargetFeatures T(FS); |
321 | return all_of(Range: T.getFeatures(), P: [this](const std::string &F) { |
322 | assert(SubtargetFeatures::hasFlag(F) && |
323 | "Feature flags should start with '+' or '-'" ); |
324 | const SubtargetFeatureKV *FeatureEntry = |
325 | Find(S: SubtargetFeatures::StripFlag(Feature: F), A: ProcFeatures); |
326 | if (!FeatureEntry) |
327 | report_fatal_error(reason: Twine("'" ) + F + |
328 | "' is not a recognized feature for this target" ); |
329 | |
330 | return FeatureBits.test(I: FeatureEntry->Value) == |
331 | SubtargetFeatures::isEnabled(Feature: F); |
332 | }); |
333 | } |
334 | |
335 | const MCSchedModel &MCSubtargetInfo::getSchedModelForCPU(StringRef CPU) const { |
336 | assert(llvm::is_sorted(ProcDesc) && |
337 | "Processor machine model table is not sorted" ); |
338 | |
339 | // Find entry |
340 | const SubtargetSubTypeKV *CPUEntry = Find(S: CPU, A: ProcDesc); |
341 | |
342 | if (!CPUEntry) { |
343 | if (CPU != "help" ) // Don't error if the user asked for help. |
344 | errs() << "'" << CPU |
345 | << "' is not a recognized processor for this target" |
346 | << " (ignoring processor)\n" ; |
347 | return MCSchedModel::Default; |
348 | } |
349 | assert(CPUEntry->SchedModel && "Missing processor SchedModel value" ); |
350 | return *CPUEntry->SchedModel; |
351 | } |
352 | |
353 | InstrItineraryData |
354 | MCSubtargetInfo::getInstrItineraryForCPU(StringRef CPU) const { |
355 | const MCSchedModel &SchedModel = getSchedModelForCPU(CPU); |
356 | return InstrItineraryData(SchedModel, Stages, OperandCycles, ForwardingPaths); |
357 | } |
358 | |
359 | void MCSubtargetInfo::initInstrItins(InstrItineraryData &InstrItins) const { |
360 | InstrItins = InstrItineraryData(getSchedModel(), Stages, OperandCycles, |
361 | ForwardingPaths); |
362 | } |
363 | |
364 | std::vector<SubtargetFeatureKV> |
365 | MCSubtargetInfo::getEnabledProcessorFeatures() const { |
366 | std::vector<SubtargetFeatureKV> EnabledFeatures; |
367 | auto IsEnabled = [&](const SubtargetFeatureKV &FeatureKV) { |
368 | return FeatureBits.test(I: FeatureKV.Value); |
369 | }; |
370 | llvm::copy_if(Range: ProcFeatures, Out: std::back_inserter(x&: EnabledFeatures), P: IsEnabled); |
371 | return EnabledFeatures; |
372 | } |
373 | |
374 | std::optional<unsigned> MCSubtargetInfo::getCacheSize(unsigned Level) const { |
375 | return std::nullopt; |
376 | } |
377 | |
378 | std::optional<unsigned> |
379 | MCSubtargetInfo::getCacheAssociativity(unsigned Level) const { |
380 | return std::nullopt; |
381 | } |
382 | |
383 | std::optional<unsigned> |
384 | MCSubtargetInfo::getCacheLineSize(unsigned Level) const { |
385 | return std::nullopt; |
386 | } |
387 | |
388 | unsigned MCSubtargetInfo::getPrefetchDistance() const { |
389 | return 0; |
390 | } |
391 | |
392 | unsigned MCSubtargetInfo::getMaxPrefetchIterationsAhead() const { |
393 | return UINT_MAX; |
394 | } |
395 | |
396 | bool MCSubtargetInfo::enableWritePrefetching() const { |
397 | return false; |
398 | } |
399 | |
400 | unsigned MCSubtargetInfo::getMinPrefetchStride(unsigned NumMemAccesses, |
401 | unsigned NumStridedMemAccesses, |
402 | unsigned NumPrefetches, |
403 | bool HasCall) const { |
404 | return 1; |
405 | } |
406 | |
407 | bool MCSubtargetInfo::shouldPrefetchAddressSpace(unsigned AS) const { |
408 | return !AS; |
409 | } |
410 | |