LLVM 23.0.0git
AMDGPURegBankLegalizeRules.h
Go to the documentation of this file.
1//===- AMDGPURegBankLegalizeRules --------------------------------*- C++ -*-==//
2//
3// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4// See https://llvm.org/LICENSE.txt for license information.
5// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6//
7//===----------------------------------------------------------------------===//
8
9#ifndef LLVM_LIB_TARGET_AMDGPU_AMDGPUREGBANKLEGALIZERULES_H
10#define LLVM_LIB_TARGET_AMDGPU_AMDGPUREGBANKLEGALIZERULES_H
11
12#include "llvm/ADT/DenseMap.h"
14#include <functional>
15
16namespace llvm {
17
18class LLT;
20class MachineInstr;
21class GCNSubtarget;
22class MachineFunction;
23template <typename T> class GenericUniformityInfo;
24template <typename T> class GenericSSAContext;
27
28namespace AMDGPU {
29
30/// \returns true if \p Ty is a pointer type with size \p Width.
31bool isAnyPtr(LLT Ty, unsigned Width);
32
33// IDs used to build predicate for RegBankLegalizeRule. Predicate can have one
34// or more IDs and each represents a check for 'uniform or divergent' + LLT or
35// just LLT on register operand.
36// Most often checking one operand is enough to decide which RegBankLLTMapping
37// to apply (see Fast Rules), IDs are useful when two or more operands need to
38// be checked.
130
131// How to apply register bank on register operand.
132// In most cases, this serves as a LLT and register bank assert.
133// Can change operands and insert copies, extends, truncs, and read-any-lanes.
134// Anything more complicated requires LoweringMethod.
224
225// Instruction needs to be replaced with sequence of instructions. Lowering was
226// not done by legalizer since instructions is available in either sgpr or vgpr.
227// For example S64 AND is available on sgpr, for that reason S64 AND is legal in
228// context of Legalizer that only checks LLT. But S64 AND is not available on
229// vgpr. Lower it to two S32 vgpr ANDs.
254
257 Standard, // S16, S32, S64, V2S16
258 StandardB, // B32, B64, B96, B128
259 Vector, // S32, V2S32, V3S32, V4S32
260};
261
267 std::initializer_list<RegBankLLTMappingApplyID> DstOpMappingList,
268 std::initializer_list<RegBankLLTMappingApplyID> SrcOpMappingList,
270};
271
274 std::function<bool(const MachineInstr &)> TestFunc;
276 std::initializer_list<UniformityLLTOpPredicateID> OpList,
277 std::function<bool(const MachineInstr &)> TestFunc = nullptr);
278
279 bool match(const MachineInstr &MI, const MachineUniformityInfo &MUI,
280 const MachineRegisterInfo &MRI) const;
281};
282
287
289 // "Slow Rules". More complex 'Rules[i].Predicate', check them one by one.
291
292 // "Fast Rules"
293 // Instead of testing each 'Rules[i].Predicate' we do direct access to
294 // RegBankLLTMapping using getFastPredicateSlot. For example if:
295 // - FastTypes == Standard Uni[0] holds Mapping in case Op 0 is uniform S32
296 // - FastTypes == Vector Div[3] holds Mapping in case Op 0 is divergent V4S32
297 FastRulesTypes FastTypes = NoFastRules;
298#define InvMapping RegBankLLTMapping({InvalidMapping}, {InvalidMapping})
299 RegBankLLTMapping Uni[4] = {InvMapping, InvMapping, InvMapping, InvMapping};
300 RegBankLLTMapping Div[4] = {InvMapping, InvMapping, InvMapping, InvMapping};
301
302public:
305
306 const RegBankLLTMapping *
308 const MachineUniformityInfo &MUI) const;
309
310 void addRule(RegBankLegalizeRule Rule);
311
313 RegBankLLTMapping RuleApplyIDs);
315 RegBankLLTMapping RuleApplyIDs);
316
317private:
318 int getFastPredicateSlot(UniformityLLTOpPredicateID Ty) const;
319};
320
321// Essentially 'map<Opcode(or intrinsic_opcode), SetOfRulesForOpcode>' but a
322// little more efficient.
324 const GCNSubtarget *ST;
326 // Separate maps for G-opcodes and intrinsics since they are in different
327 // enums. Multiple opcodes can share same set of rules.
328 // RulesAlias = map<Opcode, KeyOpcode>
329 // Rules = map<KeyOpcode, SetOfRulesForOpcode>
334 class RuleSetInitializer {
335 SetOfRulesForOpcode *RuleSet;
336
337 public:
338 // Used for clang-format line breaks and to force writing all rules for
339 // opcode in same place.
340 template <class AliasMap, class RulesMap>
341 RuleSetInitializer(std::initializer_list<unsigned> OpcList,
342 AliasMap &RulesAlias, RulesMap &Rules,
343 FastRulesTypes FastTypes = NoFastRules) {
344 unsigned KeyOpcode = *OpcList.begin();
345 for (unsigned Opc : OpcList) {
346 [[maybe_unused]] auto [_, NewInput] =
347 RulesAlias.try_emplace(Opc, KeyOpcode);
348 assert(NewInput && "Can't redefine existing Rules");
349 }
350
351 auto [DenseMapIter, NewInput] = Rules.try_emplace(KeyOpcode, FastTypes);
352 assert(NewInput && "Can't redefine existing Rules");
353
354 RuleSet = &DenseMapIter->second;
355 }
356
357 RuleSetInitializer(const RuleSetInitializer &) = delete;
358 RuleSetInitializer &operator=(const RuleSetInitializer &) = delete;
359 RuleSetInitializer(RuleSetInitializer &&) = delete;
360 RuleSetInitializer &operator=(RuleSetInitializer &&) = delete;
361 ~RuleSetInitializer() = default;
362
363 RuleSetInitializer &Div(UniformityLLTOpPredicateID Ty,
364 RegBankLLTMapping RuleApplyIDs,
365 bool STPred = true) {
366 if (STPred)
367 RuleSet->addFastRuleDivergent(Ty, RuleApplyIDs);
368 return *this;
369 }
370
371 RuleSetInitializer &Uni(UniformityLLTOpPredicateID Ty,
372 RegBankLLTMapping RuleApplyIDs,
373 bool STPred = true) {
374 if (STPred)
375 RuleSet->addFastRuleUniform(Ty, RuleApplyIDs);
376 return *this;
377 }
378
379 RuleSetInitializer &Any(RegBankLegalizeRule Init, bool STPred = true) {
380 if (STPred)
381 RuleSet->addRule(Init);
382 return *this;
383 }
384 };
385
386 RuleSetInitializer addRulesForGOpcs(std::initializer_list<unsigned> OpcList,
387 FastRulesTypes FastTypes = NoFastRules);
388
389 RuleSetInitializer addRulesForIOpcs(std::initializer_list<unsigned> OpcList,
390 FastRulesTypes FastTypes = NoFastRules);
391
392public:
393 // Initialize rules for all opcodes.
395
396 // In case we don't want to regenerate same rules, we can use already
397 // generated rules but need to refresh references to objects that are
398 // created for this run.
400 ST = &_ST;
401 MRI = &_MRI;
402 };
403
405};
406
407} // end namespace AMDGPU
408} // end namespace llvm
409
410#endif
unsigned const MachineRegisterInfo * MRI
assert(UImm &&(UImm !=~static_cast< T >(0)) &&"Invalid immediate!")
#define InvMapping
This file defines the DenseMap class.
IRTranslator LLVM IR MI
This file defines the SmallVector class.
RegBankLegalizeRules(const GCNSubtarget &ST, MachineRegisterInfo &MRI)
const SetOfRulesForOpcode * getRulesForOpc(MachineInstr &MI) const
void refreshRefs(const GCNSubtarget &_ST, MachineRegisterInfo &_MRI)
const RegBankLLTMapping * findMappingForMI(const MachineInstr &MI, const MachineRegisterInfo &MRI, const MachineUniformityInfo &MUI) const
void addFastRuleDivergent(UniformityLLTOpPredicateID Ty, RegBankLLTMapping RuleApplyIDs)
void addFastRuleUniform(UniformityLLTOpPredicateID Ty, RegBankLLTMapping RuleApplyIDs)
Representation of each machine instruction.
MachineRegisterInfo - Keep track of information for virtual and physical registers,...
This is a 'vector' (really, a variable-sized array), optimized for the case when the array is small.
bool isAnyPtr(LLT Ty, unsigned Width)
This is an optimization pass for GlobalISel generic memory operations.
Definition Types.h:26
GenericUniformityInfo< MachineSSAContext > MachineUniformityInfo
GenericSSAContext< MachineFunction > MachineSSAContext
SmallVector< UniformityLLTOpPredicateID, 4 > OpUniformityAndTypes
PredicateMapping(std::initializer_list< UniformityLLTOpPredicateID > OpList, std::function< bool(const MachineInstr &)> TestFunc=nullptr)
bool match(const MachineInstr &MI, const MachineUniformityInfo &MUI, const MachineRegisterInfo &MRI) const
std::function< bool(const MachineInstr &)> TestFunc
RegBankLLTMapping(std::initializer_list< RegBankLLTMappingApplyID > DstOpMappingList, std::initializer_list< RegBankLLTMappingApplyID > SrcOpMappingList, LoweringMethodID LoweringMethod=DoNotLower)
SmallVector< RegBankLLTMappingApplyID, 2 > DstOpMapping
SmallVector< RegBankLLTMappingApplyID, 4 > SrcOpMapping