1 //===- CodeGenRegisters.h - Register and RegisterClass Info -----*- C++ -*-===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file defines structures to encapsulate information gleaned from the
11 // target register and register class definitions.
13 //===----------------------------------------------------------------------===//
15 #ifndef CODEGEN_REGISTERS_H
16 #define CODEGEN_REGISTERS_H
18 #include "SetTheory.h"
19 #include "llvm/TableGen/Record.h"
20 #include "llvm/CodeGen/ValueTypes.h"
21 #include "llvm/ADT/ArrayRef.h"
22 #include "llvm/ADT/BitVector.h"
23 #include "llvm/ADT/DenseMap.h"
24 #include "llvm/ADT/SetVector.h"
25 #include "llvm/Support/ErrorHandling.h"
35 /// CodeGenSubRegIndex - Represents a sub-register index.
36 class CodeGenSubRegIndex {
38 const unsigned EnumValue;
41 CodeGenSubRegIndex(Record *R, unsigned Enum);
43 const std::string &getName() const;
44 std::string getNamespace() const;
45 std::string getQualifiedName() const;
47 // Order CodeGenSubRegIndex pointers by EnumValue.
49 bool operator()(const CodeGenSubRegIndex *A,
50 const CodeGenSubRegIndex *B) const {
52 return A->EnumValue < B->EnumValue;
56 // Map of composite subreg indices.
57 typedef std::map<CodeGenSubRegIndex*, CodeGenSubRegIndex*, Less> CompMap;
59 // Returns the subreg index that results from composing this with Idx.
60 // Returns NULL if this and Idx don't compose.
61 CodeGenSubRegIndex *compose(CodeGenSubRegIndex *Idx) const {
62 CompMap::const_iterator I = Composed.find(Idx);
63 return I == Composed.end() ? 0 : I->second;
66 // Add a composite subreg index: this+A = B.
67 // Return a conflicting composite, or NULL
68 CodeGenSubRegIndex *addComposite(CodeGenSubRegIndex *A,
69 CodeGenSubRegIndex *B) {
70 std::pair<CompMap::iterator, bool> Ins =
71 Composed.insert(std::make_pair(A, B));
72 return (Ins.second || Ins.first->second == B) ? 0 : Ins.first->second;
75 // Update the composite maps of components specified in 'ComposedOf'.
76 void updateComponents(CodeGenRegBank&);
78 // Clean out redundant composite mappings.
79 void cleanComposites();
81 // Return the map of composites.
82 const CompMap &getComposites() const { return Composed; }
88 /// CodeGenRegister - Represents a register definition.
89 struct CodeGenRegister {
93 bool CoveredBySubRegs;
95 // Map SubRegIndex -> Register.
96 typedef std::map<CodeGenSubRegIndex*, CodeGenRegister*,
97 CodeGenSubRegIndex::Less> SubRegMap;
99 CodeGenRegister(Record *R, unsigned Enum);
101 const std::string &getName() const;
103 // Get a map of sub-registers computed lazily.
104 // This includes unique entries for all sub-sub-registers.
105 const SubRegMap &getSubRegs(CodeGenRegBank&);
107 const SubRegMap &getSubRegs() const {
108 assert(SubRegsComplete && "Must precompute sub-registers");
112 // Add sub-registers to OSet following a pre-order defined by the .td file.
113 void addSubRegsPreOrder(SetVector<const CodeGenRegister*> &OSet,
114 CodeGenRegBank&) const;
116 // List of super-registers in topological order, small to large.
117 typedef std::vector<const CodeGenRegister*> SuperRegList;
119 // Get the list of super-registers. This is valid after getSubReg
120 // visits all registers during RegBank construction.
121 const SuperRegList &getSuperRegs() const {
122 assert(SubRegsComplete && "Must precompute sub-registers");
126 // List of register units in ascending order.
127 typedef SmallVector<unsigned, 16> RegUnitList;
129 // Get the list of register units.
130 // This is only valid after getSubRegs() completes.
131 const RegUnitList &getRegUnits() const { return RegUnits; }
133 // Inherit register units from subregisters.
134 // Return true if the RegUnits changed.
135 bool inheritRegUnits(CodeGenRegBank &RegBank);
137 // Adopt a register unit for pressure tracking.
138 // A unit is adopted iff its unit number is >= NumNativeRegUnits.
139 void adoptRegUnit(unsigned RUID) { RegUnits.push_back(RUID); }
141 // Get the sum of this register's register unit weights.
142 unsigned getWeight(const CodeGenRegBank &RegBank) const;
144 // Order CodeGenRegister pointers by EnumValue.
146 bool operator()(const CodeGenRegister *A,
147 const CodeGenRegister *B) const {
149 return A->EnumValue < B->EnumValue;
153 // Canonically ordered set.
154 typedef std::set<const CodeGenRegister*, Less> Set;
157 bool SubRegsComplete;
159 SuperRegList SuperRegs;
160 RegUnitList RegUnits;
164 class CodeGenRegisterClass {
165 CodeGenRegister::Set Members;
166 // Allocation orders. Order[0] always contains all registers in Members.
167 std::vector<SmallVector<Record*, 16> > Orders;
168 // Bit mask of sub-classes including this, indexed by their EnumValue.
169 BitVector SubClasses;
170 // List of super-classes, topologocally ordered to have the larger classes
171 // first. This is the same as sorting by EnumValue.
172 SmallVector<CodeGenRegisterClass*, 4> SuperClasses;
176 // For a synthesized class, inherit missing properties from the nearest
178 void inheritProperties(CodeGenRegBank&);
180 // Map SubRegIndex -> sub-class. This is the largest sub-class where all
181 // registers have a SubRegIndex sub-register.
182 DenseMap<CodeGenSubRegIndex*, CodeGenRegisterClass*> SubClassWithSubReg;
184 // Map SubRegIndex -> set of super-reg classes. This is all register
185 // classes SuperRC such that:
187 // R:SubRegIndex in this RC for all R in SuperRC.
189 DenseMap<CodeGenSubRegIndex*,
190 SmallPtrSet<CodeGenRegisterClass*, 8> > SuperRegClasses;
194 std::string Namespace;
195 std::vector<MVT::SimpleValueType> VTs;
197 unsigned SpillAlignment;
200 // Map SubRegIndex -> RegisterClass
201 DenseMap<Record*,Record*> SubRegClasses;
202 std::string AltOrderSelect;
204 // Return the Record that defined this class, or NULL if the class was
205 // created by TableGen.
206 Record *getDef() const { return TheDef; }
208 const std::string &getName() const { return Name; }
209 std::string getQualifiedName() const;
210 const std::vector<MVT::SimpleValueType> &getValueTypes() const {return VTs;}
211 unsigned getNumValueTypes() const { return VTs.size(); }
213 MVT::SimpleValueType getValueTypeNum(unsigned VTNum) const {
214 if (VTNum < VTs.size())
216 llvm_unreachable("VTNum greater than number of ValueTypes in RegClass!");
219 // Return true if this this class contains the register.
220 bool contains(const CodeGenRegister*) const;
222 // Returns true if RC is a subclass.
223 // RC is a sub-class of this class if it is a valid replacement for any
224 // instruction operand where a register of this classis required. It must
225 // satisfy these conditions:
227 // 1. All RC registers are also in this.
228 // 2. The RC spill size must not be smaller than our spill size.
229 // 3. RC spill alignment must be compatible with ours.
231 bool hasSubClass(const CodeGenRegisterClass *RC) const {
232 return SubClasses.test(RC->EnumValue);
235 // getSubClassWithSubReg - Returns the largest sub-class where all
236 // registers have a SubIdx sub-register.
237 CodeGenRegisterClass*
238 getSubClassWithSubReg(CodeGenSubRegIndex *SubIdx) const {
239 return SubClassWithSubReg.lookup(SubIdx);
242 void setSubClassWithSubReg(CodeGenSubRegIndex *SubIdx,
243 CodeGenRegisterClass *SubRC) {
244 SubClassWithSubReg[SubIdx] = SubRC;
247 // getSuperRegClasses - Returns a bit vector of all register classes
248 // containing only SubIdx super-registers of this class.
249 void getSuperRegClasses(CodeGenSubRegIndex *SubIdx, BitVector &Out) const;
251 // addSuperRegClass - Add a class containing only SudIdx super-registers.
252 void addSuperRegClass(CodeGenSubRegIndex *SubIdx,
253 CodeGenRegisterClass *SuperRC) {
254 SuperRegClasses[SubIdx].insert(SuperRC);
257 // getSubClasses - Returns a constant BitVector of subclasses indexed by
259 // The SubClasses vector includs an entry for this class.
260 const BitVector &getSubClasses() const { return SubClasses; }
262 // getSuperClasses - Returns a list of super classes ordered by EnumValue.
263 // The array does not include an entry for this class.
264 ArrayRef<CodeGenRegisterClass*> getSuperClasses() const {
268 // Returns an ordered list of class members.
269 // The order of registers is the same as in the .td file.
270 // No = 0 is the default allocation order, No = 1 is the first alternative.
271 ArrayRef<Record*> getOrder(unsigned No = 0) const {
275 // Return the total number of allocation orders available.
276 unsigned getNumOrders() const { return Orders.size(); }
278 // Get the set of registers. This set contains the same registers as
280 const CodeGenRegister::Set &getMembers() const { return Members; }
282 CodeGenRegisterClass(CodeGenRegBank&, Record *R);
284 // A key representing the parts of a register class used for forming
285 // sub-classes. Note the ordering provided by this key is not the same as
286 // the topological order used for the EnumValues.
288 const CodeGenRegister::Set *Members;
290 unsigned SpillAlignment;
293 : Members(O.Members),
294 SpillSize(O.SpillSize),
295 SpillAlignment(O.SpillAlignment) {}
297 Key(const CodeGenRegister::Set *M, unsigned S = 0, unsigned A = 0)
298 : Members(M), SpillSize(S), SpillAlignment(A) {}
300 Key(const CodeGenRegisterClass &RC)
301 : Members(&RC.getMembers()),
302 SpillSize(RC.SpillSize),
303 SpillAlignment(RC.SpillAlignment) {}
305 // Lexicographical order of (Members, SpillSize, SpillAlignment).
306 bool operator<(const Key&) const;
309 // Create a non-user defined register class.
310 CodeGenRegisterClass(StringRef Name, Key Props);
312 // Called by CodeGenRegBank::CodeGenRegBank().
313 static void computeSubClasses(CodeGenRegBank&);
316 // Each RegUnitSet is a sorted vector with a name.
318 typedef std::vector<unsigned>::const_iterator iterator;
321 std::vector<unsigned> Units;
324 // CodeGenRegBank - Represent a target's registers and the relations between
326 class CodeGenRegBank {
327 RecordKeeper &Records;
331 std::vector<CodeGenSubRegIndex*> SubRegIndices;
332 DenseMap<Record*, CodeGenSubRegIndex*> Def2SubRegIdx;
333 unsigned NumNamedIndices;
336 std::vector<CodeGenRegister*> Registers;
337 DenseMap<Record*, CodeGenRegister*> Def2Reg;
338 unsigned NumNativeRegUnits;
339 unsigned NumRegUnits; // # native + adopted register units.
341 // Map each register unit to a weight (for register pressure).
342 // Includes native and adopted register units.
343 std::vector<unsigned> RegUnitWeights;
346 std::vector<CodeGenRegisterClass*> RegClasses;
347 DenseMap<Record*, CodeGenRegisterClass*> Def2RC;
348 typedef std::map<CodeGenRegisterClass::Key, CodeGenRegisterClass*> RCKeyMap;
351 // Remember each unique set of register units. Initially, this contains a
352 // unique set for each register class. Simliar sets are coalesced with
353 // pruneUnitSets and new supersets are inferred during computeRegUnitSets.
354 std::vector<RegUnitSet> RegUnitSets;
356 // Map RegisterClass index to the index of the RegUnitSet that contains the
357 // class's units and any inferred RegUnit supersets.
358 std::vector<std::vector<unsigned> > RegClassUnitSets;
360 // Add RC to *2RC maps.
361 void addToMaps(CodeGenRegisterClass*);
363 // Create a synthetic sub-class if it is missing.
364 CodeGenRegisterClass *getOrCreateSubClass(const CodeGenRegisterClass *RC,
365 const CodeGenRegister::Set *Membs,
368 // Infer missing register classes.
369 void computeInferredRegisterClasses();
370 void inferCommonSubClass(CodeGenRegisterClass *RC);
371 void inferSubClassWithSubReg(CodeGenRegisterClass *RC);
372 void inferMatchingSuperRegClass(CodeGenRegisterClass *RC,
373 unsigned FirstSubRegRC = 0);
375 // Iteratively prune unit sets.
376 void pruneUnitSets();
378 // Compute a weight for each register unit created during getSubRegs.
379 void computeRegUnitWeights();
381 // Create a RegUnitSet for each RegClass and infer superclasses.
382 void computeRegUnitSets();
384 // Populate the Composite map from sub-register relationships.
385 void computeComposites();
388 CodeGenRegBank(RecordKeeper&);
390 SetTheory &getSets() { return Sets; }
392 // Sub-register indices. The first NumNamedIndices are defined by the user
393 // in the .td files. The rest are synthesized such that all sub-registers
394 // have a unique name.
395 ArrayRef<CodeGenSubRegIndex*> getSubRegIndices() { return SubRegIndices; }
396 unsigned getNumNamedIndices() { return NumNamedIndices; }
398 // Find a SubRegIndex form its Record def.
399 CodeGenSubRegIndex *getSubRegIdx(Record*);
401 // Find or create a sub-register index representing the A+B composition.
402 CodeGenSubRegIndex *getCompositeSubRegIndex(CodeGenSubRegIndex *A,
403 CodeGenSubRegIndex *B);
405 const std::vector<CodeGenRegister*> &getRegisters() { return Registers; }
407 // Find a register from its Record def.
408 CodeGenRegister *getReg(Record*);
410 // Get a Register's index into the Registers array.
411 unsigned getRegIndex(const CodeGenRegister *Reg) const {
412 return Reg->EnumValue - 1;
415 // Create a new non-native register unit that can be adopted by a register
416 // to increase its pressure. Note that NumNativeRegUnits is not increased.
417 unsigned newRegUnit(unsigned Weight) {
418 if (!RegUnitWeights.empty()) {
419 assert(Weight && "should only add allocatable units");
420 RegUnitWeights.resize(NumRegUnits+1);
421 RegUnitWeights[NumRegUnits] = Weight;
423 return NumRegUnits++;
426 // Native units are the singular unit of a leaf register. Register aliasing
427 // is completely characterized by native units. Adopted units exist to give
428 // register additional weight but don't affect aliasing.
429 bool isNativeUnit(unsigned RUID) {
430 return RUID < NumNativeRegUnits;
433 ArrayRef<CodeGenRegisterClass*> getRegClasses() const {
437 // Find a register class from its def.
438 CodeGenRegisterClass *getRegClass(Record*);
440 /// getRegisterClassForRegister - Find the register class that contains the
441 /// specified physical register. If the register is not in a register
442 /// class, return null. If the register is in multiple classes, and the
443 /// classes have a superset-subset relationship and the same set of types,
444 /// return the superclass. Otherwise return null.
445 const CodeGenRegisterClass* getRegClassForRegister(Record *R);
447 // Get a register unit's weight. Zero for unallocatable registers.
448 unsigned getRegUnitWeight(unsigned RUID) const {
449 return RegUnitWeights[RUID];
452 // Increase a RegUnitWeight.
453 void increaseRegUnitWeight(unsigned RUID, unsigned Inc) {
454 RegUnitWeights[RUID] += Inc;
457 // Get the number of register pressure dimensions.
458 unsigned getNumRegPressureSets() const { return RegUnitSets.size(); }
460 // Get a set of register unit IDs for a given dimension of pressure.
461 RegUnitSet getRegPressureSet(unsigned Idx) const {
462 return RegUnitSets[Idx];
465 // Get a list of pressure set IDs for a register class. Liveness of a
466 // register in this class impacts each pressure set in this list by the
467 // weight of the register. An exact solution requires all registers in a
468 // class to have the same class, but it is not strictly guaranteed.
469 ArrayRef<unsigned> getRCPressureSetIDs(unsigned RCIdx) const {
470 return RegClassUnitSets[RCIdx];
473 // Computed derived records such as missing sub-register indices.
474 void computeDerivedInfo();
476 // Compute full overlap sets for every register. These sets include the
477 // rarely used aliases that are neither sub nor super-registers.
479 // Map[R1].count(R2) is reflexive and symmetric, but not transitive.
481 // If R1 is a sub-register of R2, Map[R1] is a subset of Map[R2].
482 void computeOverlaps(std::map<const CodeGenRegister*,
483 CodeGenRegister::Set> &Map);
485 // Compute the set of registers completely covered by the registers in Regs.
486 // The returned BitVector will have a bit set for each register in Regs,
487 // all sub-registers, and all super-registers that are covered by the
488 // registers in Regs.
490 // This is used to compute the mask of call-preserved registers from a list
492 BitVector computeCoveredRegisters(ArrayRef<Record*> Regs);