CodeGenRegisters.h [plain text]
#ifndef CODEGEN_REGISTERS_H
#define CODEGEN_REGISTERS_H
#include "Record.h"
#include "SetTheory.h"
#include "llvm/CodeGen/ValueTypes.h"
#include "llvm/ADT/ArrayRef.h"
#include "llvm/ADT/DenseMap.h"
#include "llvm/ADT/SetVector.h"
#include <cstdlib>
#include <map>
#include <string>
#include <set>
#include <vector>
namespace llvm {
class CodeGenRegBank;
struct CodeGenRegister {
Record *TheDef;
unsigned EnumValue;
unsigned CostPerUse;
typedef std::map<Record*, CodeGenRegister*, LessRecord> SubRegMap;
CodeGenRegister(Record *R, unsigned Enum);
const std::string &getName() const;
const SubRegMap &getSubRegs(CodeGenRegBank&);
const SubRegMap &getSubRegs() const {
assert(SubRegsComplete && "Must precompute sub-registers");
return SubRegs;
}
void addSubRegsPreOrder(SetVector<CodeGenRegister*> &OSet) const;
typedef std::vector<CodeGenRegister*> SuperRegList;
const SuperRegList &getSuperRegs() const {
assert(SubRegsComplete && "Must precompute sub-registers");
return SuperRegs;
}
struct Less {
bool operator()(const CodeGenRegister *A,
const CodeGenRegister *B) const {
return A->EnumValue < B->EnumValue;
}
};
typedef std::set<const CodeGenRegister*, Less> Set;
private:
bool SubRegsComplete;
SubRegMap SubRegs;
SuperRegList SuperRegs;
};
class CodeGenRegisterClass {
CodeGenRegister::Set Members;
const std::vector<Record*> *Elements;
std::vector<SmallVector<Record*, 16> > AltOrders;
public:
Record *TheDef;
std::string Namespace;
std::vector<MVT::SimpleValueType> VTs;
unsigned SpillSize;
unsigned SpillAlignment;
int CopyCost;
bool Allocatable;
DenseMap<Record*,Record*> SubRegClasses;
std::string AltOrderSelect;
const std::string &getName() const;
const std::vector<MVT::SimpleValueType> &getValueTypes() const {return VTs;}
unsigned getNumValueTypes() const { return VTs.size(); }
MVT::SimpleValueType getValueTypeNum(unsigned VTNum) const {
if (VTNum < VTs.size())
return VTs[VTNum];
assert(0 && "VTNum greater than number of ValueTypes in RegClass!");
abort();
}
bool contains(const CodeGenRegister*) const;
bool hasSubClass(const CodeGenRegisterClass *RC) const;
ArrayRef<Record*> getOrder(unsigned No = 0) const {
if (No == 0)
return *Elements;
else
return AltOrders[No - 1];
}
unsigned getNumOrders() const { return 1 + AltOrders.size(); }
CodeGenRegisterClass(CodeGenRegBank&, Record *R);
};
class CodeGenRegBank {
RecordKeeper &Records;
SetTheory Sets;
std::vector<Record*> SubRegIndices;
unsigned NumNamedIndices;
std::vector<CodeGenRegister*> Registers;
DenseMap<Record*, CodeGenRegister*> Def2Reg;
std::vector<CodeGenRegisterClass> RegClasses;
DenseMap<Record*, CodeGenRegisterClass*> Def2RC;
typedef DenseMap<std::pair<Record*, Record*>, Record*> CompositeMap;
CompositeMap Composite;
void computeComposites();
public:
CodeGenRegBank(RecordKeeper&);
SetTheory &getSets() { return Sets; }
const std::vector<Record*> &getSubRegIndices() { return SubRegIndices; }
unsigned getNumNamedIndices() { return NumNamedIndices; }
unsigned getSubRegIndexNo(Record *idx);
Record *getCompositeSubRegIndex(Record *A, Record *B, bool create = false);
const std::vector<CodeGenRegister*> &getRegisters() { return Registers; }
CodeGenRegister *getReg(Record*);
const std::vector<CodeGenRegisterClass> &getRegClasses() {
return RegClasses;
}
CodeGenRegisterClass *getRegClass(Record*);
const CodeGenRegisterClass* getRegClassForRegister(Record *R);
void computeDerivedInfo();
void computeOverlaps(std::map<const CodeGenRegister*,
CodeGenRegister::Set> &Map);
};
}
#endif