165 lines
5.0 KiB
C++
165 lines
5.0 KiB
C++
//===- CodeGenRegisters.h - Register and RegisterClass Info -----*- C++ -*-===//
|
|
//
|
|
// The LLVM Compiler Infrastructure
|
|
//
|
|
// This file is distributed under the University of Illinois Open Source
|
|
// License. See LICENSE.TXT for details.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
//
|
|
// This file defines structures to encapsulate information gleaned from the
|
|
// target register and register class definitions.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#ifndef CODEGEN_REGISTERS_H
|
|
#define CODEGEN_REGISTERS_H
|
|
|
|
#include "Record.h"
|
|
#include "llvm/CodeGen/ValueTypes.h"
|
|
#include "llvm/ADT/DenseMap.h"
|
|
#include <cstdlib>
|
|
#include <map>
|
|
#include <string>
|
|
#include <set>
|
|
#include <vector>
|
|
|
|
namespace llvm {
|
|
class CodeGenRegBank;
|
|
|
|
/// CodeGenRegister - Represents a register definition.
|
|
struct CodeGenRegister {
|
|
Record *TheDef;
|
|
unsigned EnumValue;
|
|
unsigned CostPerUse;
|
|
|
|
// Map SubRegIndex -> Register.
|
|
typedef std::map<Record*, CodeGenRegister*, LessRecord> SubRegMap;
|
|
|
|
CodeGenRegister(Record *R, unsigned Enum);
|
|
|
|
const std::string &getName() const;
|
|
|
|
// Get a map of sub-registers computed lazily.
|
|
// This includes unique entries for all sub-sub-registers.
|
|
const SubRegMap &getSubRegs(CodeGenRegBank&);
|
|
|
|
const SubRegMap &getSubRegs() const {
|
|
assert(SubRegsComplete && "Must precompute sub-registers");
|
|
return SubRegs;
|
|
}
|
|
|
|
private:
|
|
bool SubRegsComplete;
|
|
SubRegMap SubRegs;
|
|
};
|
|
|
|
|
|
struct CodeGenRegisterClass {
|
|
Record *TheDef;
|
|
std::string Namespace;
|
|
std::vector<Record*> Elements;
|
|
std::vector<MVT::SimpleValueType> VTs;
|
|
unsigned SpillSize;
|
|
unsigned SpillAlignment;
|
|
int CopyCost;
|
|
bool Allocatable;
|
|
// Map SubRegIndex -> RegisterClass
|
|
DenseMap<Record*,Record*> SubRegClasses;
|
|
std::string MethodProtos, MethodBodies;
|
|
|
|
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 containsRegister(Record *R) const {
|
|
for (unsigned i = 0, e = Elements.size(); i != e; ++i)
|
|
if (Elements[i] == R) return true;
|
|
return false;
|
|
}
|
|
|
|
// Returns true if RC is a strict subclass.
|
|
// RC is a sub-class of this class if it is a valid replacement for any
|
|
// instruction operand where a register of this classis required. It must
|
|
// satisfy these conditions:
|
|
//
|
|
// 1. All RC registers are also in this.
|
|
// 2. The RC spill size must not be smaller than our spill size.
|
|
// 3. RC spill alignment must be compatible with ours.
|
|
//
|
|
bool hasSubClass(const CodeGenRegisterClass *RC) const {
|
|
|
|
if (RC->Elements.size() > Elements.size() ||
|
|
(SpillAlignment && RC->SpillAlignment % SpillAlignment) ||
|
|
SpillSize > RC->SpillSize)
|
|
return false;
|
|
|
|
std::set<Record*> RegSet;
|
|
for (unsigned i = 0, e = Elements.size(); i != e; ++i) {
|
|
Record *Reg = Elements[i];
|
|
RegSet.insert(Reg);
|
|
}
|
|
|
|
for (unsigned i = 0, e = RC->Elements.size(); i != e; ++i) {
|
|
Record *Reg = RC->Elements[i];
|
|
if (!RegSet.count(Reg))
|
|
return false;
|
|
}
|
|
|
|
return true;
|
|
}
|
|
|
|
CodeGenRegisterClass(Record *R);
|
|
};
|
|
|
|
// CodeGenRegBank - Represent a target's registers and the relations between
|
|
// them.
|
|
class CodeGenRegBank {
|
|
RecordKeeper &Records;
|
|
std::vector<Record*> SubRegIndices;
|
|
unsigned NumNamedIndices;
|
|
std::vector<CodeGenRegister> Registers;
|
|
DenseMap<Record*, CodeGenRegister*> Def2Reg;
|
|
|
|
// Composite SubRegIndex instances.
|
|
// Map (SubRegIndex, SubRegIndex) -> SubRegIndex.
|
|
typedef DenseMap<std::pair<Record*, Record*>, Record*> CompositeMap;
|
|
CompositeMap Composite;
|
|
|
|
// Populate the Composite map from sub-register relationships.
|
|
void computeComposites();
|
|
|
|
public:
|
|
CodeGenRegBank(RecordKeeper&);
|
|
|
|
// Sub-register indices. The first NumNamedIndices are defined by the user
|
|
// in the .td files. The rest are synthesized such that all sub-registers
|
|
// have a unique name.
|
|
const std::vector<Record*> &getSubRegIndices() { return SubRegIndices; }
|
|
unsigned getNumNamedIndices() { return NumNamedIndices; }
|
|
|
|
// Map a SubRegIndex Record to its enum value.
|
|
unsigned getSubRegIndexNo(Record *idx);
|
|
|
|
// Find or create a sub-register index representing the A+B composition.
|
|
Record *getCompositeSubRegIndex(Record *A, Record *B, bool create = false);
|
|
|
|
const std::vector<CodeGenRegister> &getRegisters() { return Registers; }
|
|
|
|
// Find a register from its Record def.
|
|
CodeGenRegister *getReg(Record*);
|
|
|
|
// Computed derived records such as missing sub-register indices.
|
|
void computeDerivedInfo();
|
|
};
|
|
}
|
|
|
|
#endif
|