mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2026-04-21 08:17:40 +00:00
Rename Type::PrimitiveID to TypeId and ::getPrimitiveID() to ::getTypeID()
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@14201 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
@@ -145,7 +145,7 @@ const Type *AbstractBytecodeParser::getType(unsigned ID) {
|
||||
//cerr << "Looking up Type ID: " << ID << "\n";
|
||||
|
||||
if (ID < Type::FirstDerivedTyID)
|
||||
if (const Type *T = Type::getPrimitiveType((Type::PrimitiveID)ID))
|
||||
if (const Type *T = Type::getPrimitiveType((Type::TypeID)ID))
|
||||
return T; // Asked for a primitive type...
|
||||
|
||||
// Otherwise, derived types need offset...
|
||||
@@ -467,7 +467,7 @@ const Type *AbstractBytecodeParser::ParseTypeConstant() {
|
||||
unsigned PrimType = read_vbr_uint();
|
||||
|
||||
const Type *Val = 0;
|
||||
if ((Val = Type::getPrimitiveType((Type::PrimitiveID)PrimType)))
|
||||
if ((Val = Type::getPrimitiveType((Type::TypeID)PrimType)))
|
||||
return Val;
|
||||
|
||||
switch (PrimType) {
|
||||
@@ -615,7 +615,7 @@ void AbstractBytecodeParser::ParseConstantValue(unsigned TypeID) {
|
||||
|
||||
// Ok, not an ConstantExpr. We now know how to read the given type...
|
||||
const Type *Ty = getType(TypeID);
|
||||
switch (Ty->getPrimitiveID()) {
|
||||
switch (Ty->getTypeID()) {
|
||||
case Type::BoolTyID: {
|
||||
unsigned Val = read_vbr_uint();
|
||||
if (Val != 0 && Val != 1)
|
||||
|
||||
@@ -264,7 +264,7 @@ private:
|
||||
/// fancy features are supported.
|
||||
const Type *getGlobalTableType(unsigned Slot) {
|
||||
if (Slot < Type::FirstDerivedTyID) {
|
||||
const Type *Ty = Type::getPrimitiveType((Type::PrimitiveID)Slot);
|
||||
const Type *Ty = Type::getPrimitiveType((Type::TypeID)Slot);
|
||||
assert(Ty && "Not a primitive type ID?");
|
||||
return Ty;
|
||||
}
|
||||
@@ -276,7 +276,7 @@ private:
|
||||
|
||||
unsigned getGlobalTableTypeSlot(const Type *Ty) {
|
||||
if (Ty->isPrimitiveType())
|
||||
return Ty->getPrimitiveID();
|
||||
return Ty->getTypeID();
|
||||
TypeListTy::iterator I = find(ModuleTypes.begin(),
|
||||
ModuleTypes.end(), Ty);
|
||||
if (I == ModuleTypes.end())
|
||||
|
||||
@@ -24,7 +24,7 @@ const Type *BytecodeParser::parseTypeConstant(const unsigned char *&Buf,
|
||||
unsigned PrimType = read_vbr_uint(Buf, EndBuf);
|
||||
|
||||
const Type *Val = 0;
|
||||
if ((Val = Type::getPrimitiveType((Type::PrimitiveID)PrimType)))
|
||||
if ((Val = Type::getPrimitiveType((Type::TypeID)PrimType)))
|
||||
return Val;
|
||||
|
||||
switch (PrimType) {
|
||||
@@ -190,7 +190,7 @@ Constant *BytecodeParser::parseConstantValue(const unsigned char *&Buf,
|
||||
|
||||
// Ok, not an ConstantExpr. We now know how to read the given type...
|
||||
const Type *Ty = getType(TypeID);
|
||||
switch (Ty->getPrimitiveID()) {
|
||||
switch (Ty->getTypeID()) {
|
||||
case Type::BoolTyID: {
|
||||
unsigned Val = read_vbr_uint(Buf, EndBuf);
|
||||
if (Val != 0 && Val != 1) throw std::string("Invalid boolean value read.");
|
||||
|
||||
@@ -145,7 +145,7 @@ const Type *AbstractBytecodeParser::getType(unsigned ID) {
|
||||
//cerr << "Looking up Type ID: " << ID << "\n";
|
||||
|
||||
if (ID < Type::FirstDerivedTyID)
|
||||
if (const Type *T = Type::getPrimitiveType((Type::PrimitiveID)ID))
|
||||
if (const Type *T = Type::getPrimitiveType((Type::TypeID)ID))
|
||||
return T; // Asked for a primitive type...
|
||||
|
||||
// Otherwise, derived types need offset...
|
||||
@@ -467,7 +467,7 @@ const Type *AbstractBytecodeParser::ParseTypeConstant() {
|
||||
unsigned PrimType = read_vbr_uint();
|
||||
|
||||
const Type *Val = 0;
|
||||
if ((Val = Type::getPrimitiveType((Type::PrimitiveID)PrimType)))
|
||||
if ((Val = Type::getPrimitiveType((Type::TypeID)PrimType)))
|
||||
return Val;
|
||||
|
||||
switch (PrimType) {
|
||||
@@ -615,7 +615,7 @@ void AbstractBytecodeParser::ParseConstantValue(unsigned TypeID) {
|
||||
|
||||
// Ok, not an ConstantExpr. We now know how to read the given type...
|
||||
const Type *Ty = getType(TypeID);
|
||||
switch (Ty->getPrimitiveID()) {
|
||||
switch (Ty->getTypeID()) {
|
||||
case Type::BoolTyID: {
|
||||
unsigned Val = read_vbr_uint();
|
||||
if (Val != 0 && Val != 1)
|
||||
|
||||
@@ -264,7 +264,7 @@ private:
|
||||
/// fancy features are supported.
|
||||
const Type *getGlobalTableType(unsigned Slot) {
|
||||
if (Slot < Type::FirstDerivedTyID) {
|
||||
const Type *Ty = Type::getPrimitiveType((Type::PrimitiveID)Slot);
|
||||
const Type *Ty = Type::getPrimitiveType((Type::TypeID)Slot);
|
||||
assert(Ty && "Not a primitive type ID?");
|
||||
return Ty;
|
||||
}
|
||||
@@ -276,7 +276,7 @@ private:
|
||||
|
||||
unsigned getGlobalTableTypeSlot(const Type *Ty) {
|
||||
if (Ty->isPrimitiveType())
|
||||
return Ty->getPrimitiveID();
|
||||
return Ty->getTypeID();
|
||||
TypeListTy::iterator I = find(ModuleTypes.begin(),
|
||||
ModuleTypes.end(), Ty);
|
||||
if (I == ModuleTypes.end())
|
||||
|
||||
@@ -25,7 +25,7 @@ using namespace llvm;
|
||||
|
||||
unsigned BytecodeParser::getTypeSlot(const Type *Ty) {
|
||||
if (Ty->isPrimitiveType())
|
||||
return Ty->getPrimitiveID();
|
||||
return Ty->getTypeID();
|
||||
|
||||
// Scan the compaction table for the type if needed.
|
||||
if (CompactionTable.size() > Type::TypeTyID) {
|
||||
@@ -56,7 +56,7 @@ const Type *BytecodeParser::getType(unsigned ID) {
|
||||
//cerr << "Looking up Type ID: " << ID << "\n";
|
||||
|
||||
if (ID < Type::FirstDerivedTyID)
|
||||
if (const Type *T = Type::getPrimitiveType((Type::PrimitiveID)ID))
|
||||
if (const Type *T = Type::getPrimitiveType((Type::TypeID)ID))
|
||||
return T; // Asked for a primitive type...
|
||||
|
||||
// Otherwise, derived types need offset...
|
||||
|
||||
@@ -173,7 +173,7 @@ private:
|
||||
/// fancy features are supported.
|
||||
const Type *getGlobalTableType(unsigned Slot) {
|
||||
if (Slot < Type::FirstDerivedTyID) {
|
||||
const Type *Ty = Type::getPrimitiveType((Type::PrimitiveID)Slot);
|
||||
const Type *Ty = Type::getPrimitiveType((Type::TypeID)Slot);
|
||||
assert(Ty && "Not a primitive type ID?");
|
||||
return Ty;
|
||||
}
|
||||
@@ -185,7 +185,7 @@ private:
|
||||
|
||||
unsigned getGlobalTableTypeSlot(const Type *Ty) {
|
||||
if (Ty->isPrimitiveType())
|
||||
return Ty->getPrimitiveID();
|
||||
return Ty->getTypeID();
|
||||
TypeValuesListTy::iterator I = find(ModuleTypeValues.begin(),
|
||||
ModuleTypeValues.end(), Ty);
|
||||
if (I == ModuleTypeValues.end())
|
||||
|
||||
@@ -20,14 +20,14 @@
|
||||
using namespace llvm;
|
||||
|
||||
void BytecodeWriter::outputType(const Type *T) {
|
||||
output_vbr((unsigned)T->getPrimitiveID(), Out);
|
||||
output_vbr((unsigned)T->getTypeID(), Out);
|
||||
|
||||
// That's all there is to handling primitive types...
|
||||
if (T->isPrimitiveType()) {
|
||||
return; // We might do this if we alias a prim type: %x = type int
|
||||
}
|
||||
|
||||
switch (T->getPrimitiveID()) { // Handle derived types now.
|
||||
switch (T->getTypeID()) { // Handle derived types now.
|
||||
case Type::FunctionTyID: {
|
||||
const FunctionType *MT = cast<FunctionType>(T);
|
||||
int Slot = Table.getSlot(MT->getReturnType());
|
||||
@@ -47,7 +47,7 @@ void BytecodeWriter::outputType(const Type *T) {
|
||||
|
||||
// Terminate list with VoidTy if we are a varargs function...
|
||||
if (MT->isVarArg())
|
||||
output_vbr((unsigned)Type::VoidTy->getPrimitiveID(), Out);
|
||||
output_vbr((unsigned)Type::VoidTyID, Out);
|
||||
break;
|
||||
}
|
||||
|
||||
@@ -74,7 +74,7 @@ void BytecodeWriter::outputType(const Type *T) {
|
||||
}
|
||||
|
||||
// Terminate list with VoidTy
|
||||
output_vbr((unsigned)Type::VoidTy->getPrimitiveID(), Out);
|
||||
output_vbr((unsigned)Type::VoidTyID, Out);
|
||||
break;
|
||||
}
|
||||
|
||||
@@ -124,7 +124,7 @@ void BytecodeWriter::outputConstant(const Constant *CPV) {
|
||||
output_vbr(0U, Out); // flag as not a ConstantExpr
|
||||
}
|
||||
|
||||
switch (CPV->getType()->getPrimitiveID()) {
|
||||
switch (CPV->getType()->getTypeID()) {
|
||||
case Type::BoolTyID: // Boolean Types
|
||||
if (cast<ConstantBool>(CPV)->getValue())
|
||||
output_vbr(1U, Out);
|
||||
|
||||
@@ -70,7 +70,7 @@ static void outputInstructionFormat0(const Instruction *I, unsigned Opcode,
|
||||
|
||||
if (isa<SequentialType>(*TI)) {
|
||||
unsigned IdxId;
|
||||
switch (I->getOperand(Idx)->getType()->getPrimitiveID()) {
|
||||
switch (I->getOperand(Idx)->getType()->getTypeID()) {
|
||||
default: assert(0 && "Unknown index type!");
|
||||
case Type::UIntTyID: IdxId = 0; break;
|
||||
case Type::IntTyID: IdxId = 1; break;
|
||||
@@ -298,7 +298,7 @@ void BytecodeWriter::outputInstruction(const Instruction &I) {
|
||||
I != E; ++I, ++Idx)
|
||||
if (isa<SequentialType>(*I)) {
|
||||
unsigned IdxId;
|
||||
switch (GEP->getOperand(Idx)->getType()->getPrimitiveID()) {
|
||||
switch (GEP->getOperand(Idx)->getType()->getTypeID()) {
|
||||
default: assert(0 && "Unknown index type!");
|
||||
case Type::UIntTyID: IdxId = 0; break;
|
||||
case Type::IntTyID: IdxId = 1; break;
|
||||
|
||||
@@ -41,8 +41,8 @@ SlotCalculator::SlotCalculator(const Module *M ) {
|
||||
//
|
||||
SC_DEBUG("Inserting primitive types:\n");
|
||||
for (unsigned i = 0; i < Type::FirstDerivedTyID; ++i) {
|
||||
assert(Type::getPrimitiveType((Type::PrimitiveID)i));
|
||||
insertValue(Type::getPrimitiveType((Type::PrimitiveID)i), true);
|
||||
assert(Type::getPrimitiveType((Type::TypeID)i));
|
||||
insertValue(Type::getPrimitiveType((Type::TypeID)i), true);
|
||||
}
|
||||
|
||||
if (M == 0) return; // Empty table...
|
||||
@@ -58,8 +58,8 @@ SlotCalculator::SlotCalculator(const Function *M ) {
|
||||
//
|
||||
SC_DEBUG("Inserting primitive types:\n");
|
||||
for (unsigned i = 0; i < Type::FirstDerivedTyID; ++i) {
|
||||
assert(Type::getPrimitiveType((Type::PrimitiveID)i));
|
||||
insertValue(Type::getPrimitiveType((Type::PrimitiveID)i), true);
|
||||
assert(Type::getPrimitiveType((Type::TypeID)i));
|
||||
insertValue(Type::getPrimitiveType((Type::TypeID)i), true);
|
||||
}
|
||||
|
||||
if (TheModule == 0) return; // Empty table...
|
||||
@@ -408,7 +408,7 @@ unsigned SlotCalculator::getOrCreateCompactionTableSlot(const Value *V) {
|
||||
|
||||
// Make sure to insert the null entry if the thing we are inserting is not a
|
||||
// null constant.
|
||||
if (TyPlane.empty() && hasNullValue(V->getType()->getPrimitiveID())) {
|
||||
if (TyPlane.empty() && hasNullValue(V->getType()->getTypeID())) {
|
||||
Value *ZeroInitializer = Constant::getNullValue(V->getType());
|
||||
if (V != ZeroInitializer) {
|
||||
TyPlane.push_back(ZeroInitializer);
|
||||
@@ -435,7 +435,7 @@ void SlotCalculator::buildCompactionTable(const Function *F) {
|
||||
// First step, insert the primitive types.
|
||||
CompactionTable.resize(Type::TypeTyID+1);
|
||||
for (unsigned i = 0; i != Type::FirstDerivedTyID; ++i) {
|
||||
const Type *PrimTy = Type::getPrimitiveType((Type::PrimitiveID)i);
|
||||
const Type *PrimTy = Type::getPrimitiveType((Type::TypeID)i);
|
||||
CompactionTable[Type::TypeTyID].push_back(PrimTy);
|
||||
CompactionNodeMap[PrimTy] = i;
|
||||
}
|
||||
@@ -754,7 +754,7 @@ int SlotCalculator::doInsertValue(const Value *D) {
|
||||
}
|
||||
Ty = (unsigned)ValSlot;
|
||||
} else {
|
||||
Ty = Typ->getPrimitiveID();
|
||||
Ty = Typ->getTypeID();
|
||||
}
|
||||
|
||||
if (Table.size() <= Ty) // Make sure we have the type plane allocated...
|
||||
|
||||
@@ -106,7 +106,7 @@ SlotTable::SlotNum SlotTable::remove( const Type* Typ ) {
|
||||
// and that their Primitive ID is equal to their slot #
|
||||
void SlotTable::insertPrimitives() {
|
||||
for (PlaneNum plane = 0; plane < Type::FirstDerivedTyID; ++plane) {
|
||||
const Type* Ty = Type::getPrimitiveType((Type::PrimitiveID) plane);
|
||||
const Type* Ty = Type::getPrimitiveType((Type::TypeID) plane);
|
||||
assert(Ty && "Couldn't get primitive type id");
|
||||
SlotNum slot = this->insert(Ty);
|
||||
assert(slot == plane && "Type slot didn't match plane number");
|
||||
|
||||
@@ -46,7 +46,7 @@ public:
|
||||
|
||||
/// This type is used throughout the code to make it clear that an
|
||||
/// unsigned value refers to a type plane number and not something else.
|
||||
/// @brief The type of a plane number (corresponds to Type::PrimitiveID).
|
||||
/// @brief The type of a plane number (corresponds to Type::TypeID).
|
||||
typedef unsigned PlaneNum;
|
||||
|
||||
/// @brief Some constants used as flags instead of actual slot numbers
|
||||
@@ -58,7 +58,7 @@ public:
|
||||
/// @brief A single plane of Values. Intended index is slot number.
|
||||
typedef std::vector<const Value*> ValuePlane;
|
||||
|
||||
/// @brief A table of Values. Intended index is Type::PrimitiveID.
|
||||
/// @brief A table of Values. Intended index is Type::TypeID.
|
||||
typedef std::vector<ValuePlane> ValueTable;
|
||||
|
||||
/// @brief A map of values to slot numbers.
|
||||
|
||||
Reference in New Issue
Block a user