1
0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-10-30 23:42:52 +01:00
llvm-mirror/lib/Bytecode/Reader/ConstantReader.cpp

400 lines
13 KiB
C++
Raw Normal View History

//===- ReadConst.cpp - Code to constants and constant pools ---------------===//
2001-06-06 22:29:01 +02:00
//
// This file implements functionality to deserialize constants and entire
// constant pools.
//
// Note that this library should be as fast as possible, reentrant, and
// threadsafe!!
//
//===----------------------------------------------------------------------===//
2001-06-06 22:29:01 +02:00
#include "ReaderInternals.h"
2001-06-06 22:29:01 +02:00
#include "llvm/Module.h"
#include "llvm/Constants.h"
#include "llvm/GlobalVariable.h"
#include <algorithm>
#include <iostream>
using std::make_pair;
2001-06-06 22:29:01 +02:00
const Type *BytecodeParser::parseTypeConstant(const uchar *&Buf,
const uchar *EndBuf) {
2001-06-06 22:29:01 +02:00
unsigned PrimType;
if (read_vbr(Buf, EndBuf, PrimType)) return failure<const Type*>(0);
2001-06-06 22:29:01 +02:00
const Type *Val = 0;
if ((Val = Type::getPrimitiveType((Type::PrimitiveID)PrimType)))
return Val;
2001-06-06 22:29:01 +02:00
switch (PrimType) {
2002-03-29 04:51:11 +01:00
case Type::FunctionTyID: {
2001-06-06 22:29:01 +02:00
unsigned Typ;
if (read_vbr(Buf, EndBuf, Typ)) return failure(Val);
2001-06-06 22:29:01 +02:00
const Type *RetType = getType(Typ);
if (RetType == 0) return failure(Val);
2001-06-06 22:29:01 +02:00
unsigned NumParams;
if (read_vbr(Buf, EndBuf, NumParams)) return failure(Val);
2001-06-06 22:29:01 +02:00
std::vector<const Type*> Params;
while (NumParams--) {
if (read_vbr(Buf, EndBuf, Typ)) return failure(Val);
2001-06-06 22:29:01 +02:00
const Type *Ty = getType(Typ);
if (Ty == 0) return failure(Val);
2001-06-06 22:29:01 +02:00
Params.push_back(Ty);
}
bool isVarArg = Params.size() && Params.back() == Type::VoidTy;
if (isVarArg) Params.pop_back();
2002-03-29 04:51:11 +01:00
return FunctionType::get(RetType, Params, isVarArg);
2001-06-06 22:29:01 +02:00
}
case Type::ArrayTyID: {
unsigned ElTyp;
if (read_vbr(Buf, EndBuf, ElTyp)) return failure(Val);
2001-06-06 22:29:01 +02:00
const Type *ElementType = getType(ElTyp);
if (ElementType == 0) return failure(Val);
2001-06-06 22:29:01 +02:00
unsigned NumElements;
if (read_vbr(Buf, EndBuf, NumElements)) return failure(Val);
2001-10-24 08:21:22 +02:00
BCR_TRACE(5, "Array Type Constant #" << ElTyp << " size="
<< NumElements << "\n");
2001-10-24 08:21:22 +02:00
return ArrayType::get(ElementType, NumElements);
2001-06-06 22:29:01 +02:00
}
case Type::StructTyID: {
unsigned Typ;
std::vector<const Type*> Elements;
2001-06-06 22:29:01 +02:00
if (read_vbr(Buf, EndBuf, Typ)) return failure(Val);
2001-06-06 22:29:01 +02:00
while (Typ) { // List is terminated by void/0 typeid
const Type *Ty = getType(Typ);
if (Ty == 0) return failure(Val);
2001-06-06 22:29:01 +02:00
Elements.push_back(Ty);
if (read_vbr(Buf, EndBuf, Typ)) return failure(Val);
2001-06-06 22:29:01 +02:00
}
2001-10-24 08:21:22 +02:00
return StructType::get(Elements);
2001-06-06 22:29:01 +02:00
}
case Type::PointerTyID: {
unsigned ElTyp;
if (read_vbr(Buf, EndBuf, ElTyp)) return failure(Val);
BCR_TRACE(5, "Pointer Type Constant #" << (ElTyp-14) << "\n");
2001-06-06 22:29:01 +02:00
const Type *ElementType = getType(ElTyp);
if (ElementType == 0) return failure(Val);
2001-10-24 08:21:22 +02:00
return PointerType::get(ElementType);
2001-06-06 22:29:01 +02:00
}
case Type::OpaqueTyID: {
2001-10-24 08:21:22 +02:00
return OpaqueType::get();
}
2001-06-06 22:29:01 +02:00
default:
std::cerr << __FILE__ << ":" << __LINE__
2002-06-30 18:04:37 +02:00
<< ": Don't know how to deserialize"
<< " primitive Type " << PrimType << "\n";
return failure(Val);
}
}
// refineAbstractType - The callback method is invoked when one of the
// elements of TypeValues becomes more concrete...
//
void BytecodeParser::refineAbstractType(const DerivedType *OldType,
const Type *NewType) {
if (OldType == NewType &&
OldType->isAbstract()) return; // Type is modified, but same
TypeValuesListTy::iterator I = find(MethodTypeValues.begin(),
MethodTypeValues.end(), OldType);
if (I == MethodTypeValues.end()) {
I = find(ModuleTypeValues.begin(), ModuleTypeValues.end(), OldType);
assert(I != ModuleTypeValues.end() &&
"Can't refine a type I don't know about!");
2001-06-06 22:29:01 +02:00
}
if (OldType == NewType) {
assert(!OldType->isAbstract());
I->removeUserFromConcrete();
} else {
*I = NewType; // Update to point to new, more refined type.
}
}
// parseTypeConstants - We have to use this wierd code to handle recursive
// types. We know that recursive types will only reference the current slab of
// values in the type plane, but they can forward reference types before they
// have been read. For example, Type #0 might be '{ Ty#1 }' and Type #1 might
// be 'Ty#0*'. When reading Type #0, type number one doesn't exist. To fix
// this ugly problem, we pesimistically insert an opaque type for each type we
// are about to read. This means that forward references will resolve to
// something and when we reread the type later, we can replace the opaque type
// with a new resolved concrete type.
//
void debug_type_tables();
bool BytecodeParser::parseTypeConstants(const uchar *&Buf, const uchar *EndBuf,
TypeValuesListTy &Tab,
unsigned NumEntries) {
assert(Tab.size() == 0 && "should not have read type constants in before!");
// Insert a bunch of opaque types to be resolved later...
2001-10-24 08:21:22 +02:00
for (unsigned i = 0; i < NumEntries; ++i)
Tab.push_back(PATypeHandle<Type>(OpaqueType::get(), this));
// Loop through reading all of the types. Forward types will make use of the
// opaque types just inserted.
//
2001-10-24 08:21:22 +02:00
for (unsigned i = 0; i < NumEntries; ++i) {
const Type *NewTy = parseTypeConstant(Buf, EndBuf), *OldTy = Tab[i].get();
if (NewTy == 0) return failure(true);
2001-10-24 08:21:22 +02:00
BCR_TRACE(4, "#" << i << ": Read Type Constant: '" << NewTy <<
"' Replacing: " << OldTy << "\n");
// Don't insertValue the new type... instead we want to replace the opaque
// type with the new concrete value...
//
// Refine the abstract type to the new type. This causes all uses of the
// abstract type to use the newty. This also will cause the opaque type
// to be deleted...
//
((DerivedType*)Tab[i].get())->refineAbstractTypeTo(NewTy);
// This should have replace the old opaque type with the new type in the
// value table... or with a preexisting type that was already in the system
assert(Tab[i] != OldTy && "refineAbstractType didn't work!");
}
BCR_TRACE(5, "Resulting types:\n");
2001-10-24 08:21:22 +02:00
for (unsigned i = 0; i < NumEntries; ++i) {
BCR_TRACE(5, (void*)Tab[i].get() << " - " << Tab[i].get() << "\n");
}
debug_type_tables();
2001-06-06 22:29:01 +02:00
return false;
}
bool BytecodeParser::parseConstantValue(const uchar *&Buf, const uchar *EndBuf,
const Type *Ty, Constant *&V) {
// We must check for a ConstantExpr before switching by type because
// a ConstantExpr can be of any type, and has no explicit value.
//
unsigned isExprNumArgs; // 0 if not expr; numArgs if is expr
if (read_vbr(Buf, EndBuf, isExprNumArgs)) return failure(true);
if (isExprNumArgs) {
// FIXME: Encoding of constant exprs could be much more compact!
unsigned Opcode;
std::vector<Constant*> ArgVec;
ArgVec.reserve(isExprNumArgs);
if (read_vbr(Buf, EndBuf, Opcode)) return failure(true);
// Read the slot number and types of each of the arguments
for (unsigned i = 0; i != isExprNumArgs; ++i) {
unsigned ArgValSlot, ArgTypeSlot;
if (read_vbr(Buf, EndBuf, ArgValSlot)) return failure(true);
if (read_vbr(Buf, EndBuf, ArgTypeSlot)) return failure(true);
const Type *ArgTy = getType(ArgTypeSlot);
if (ArgTy == 0) return failure(true);
BCR_TRACE(4, "CE Arg " << i << ": Type: '" << ArgTy << "' slot: "
<< ArgValSlot << "\n");
// Get the arg value from its slot if it exists, otherwise a placeholder
Value *Val = getValue(ArgTy, ArgValSlot, false);
Constant *C;
if (Val) {
if (!(C = dyn_cast<Constant>(Val))) return failure(true);
BCR_TRACE(5, "Constant Found in ValueTable!\n");
} else { // Nope... find or create a forward ref. for it
C = fwdRefs.GetFwdRefToConstant(ArgTy, ArgValSlot);
}
ArgVec.push_back(C);
}
// Construct a ConstantExpr of the appropriate kind
if (isExprNumArgs == 1) { // All one-operand expressions
V = ConstantExpr::get(Opcode, ArgVec[0], Ty);
} else if (Opcode == Instruction::GetElementPtr) { // GetElementPtr
std::vector<Constant*> IdxList(ArgVec.begin()+1, ArgVec.end());
V = ConstantExpr::getGetElementPtr(ArgVec[0], IdxList);
} else { // All other 2-operand expressions
V = ConstantExpr::get(Opcode, ArgVec[0], ArgVec[1]);
}
return false;
}
// Ok, not an ConstantExpr. We now know how to read the given type...
2001-06-06 22:29:01 +02:00
switch (Ty->getPrimitiveID()) {
case Type::BoolTyID: {
unsigned Val;
if (read_vbr(Buf, EndBuf, Val)) return failure(true);
if (Val != 0 && Val != 1) return failure(true);
V = ConstantBool::get(Val == 1);
2001-06-06 22:29:01 +02:00
break;
}
case Type::UByteTyID: // Unsigned integer types...
case Type::UShortTyID:
case Type::UIntTyID: {
unsigned Val;
if (read_vbr(Buf, EndBuf, Val)) return failure(true);
if (!ConstantUInt::isValueValidForType(Ty, Val)) return failure(true);
V = ConstantUInt::get(Ty, Val);
2001-06-06 22:29:01 +02:00
break;
}
case Type::ULongTyID: {
uint64_t Val;
if (read_vbr(Buf, EndBuf, Val)) return failure(true);
V = ConstantUInt::get(Ty, Val);
2001-06-06 22:29:01 +02:00
break;
}
case Type::SByteTyID: // Unsigned integer types...
case Type::ShortTyID:
case Type::IntTyID: {
int Val;
if (read_vbr(Buf, EndBuf, Val)) return failure(true);
if (!ConstantSInt::isValueValidForType(Ty, Val)) return failure(true);
V = ConstantSInt::get(Ty, Val);
2001-06-06 22:29:01 +02:00
break;
}
case Type::LongTyID: {
int64_t Val;
if (read_vbr(Buf, EndBuf, Val)) return failure(true);
V = ConstantSInt::get(Ty, Val);
2001-06-06 22:29:01 +02:00
break;
}
case Type::FloatTyID: {
float F;
if (input_data(Buf, EndBuf, &F, &F+1)) return failure(true);
V = ConstantFP::get(Ty, F);
break;
}
case Type::DoubleTyID: {
double Val;
if (input_data(Buf, EndBuf, &Val, &Val+1)) return failure(true);
V = ConstantFP::get(Ty, Val);
break;
}
2001-06-06 22:29:01 +02:00
case Type::TypeTyID:
assert(0 && "Type constants should be handled seperately!!!");
abort();
2001-06-06 22:29:01 +02:00
case Type::ArrayTyID: {
const ArrayType *AT = cast<const ArrayType>(Ty);
unsigned NumElements = AT->getNumElements();
2001-06-06 22:29:01 +02:00
std::vector<Constant*> Elements;
2001-06-06 22:29:01 +02:00
while (NumElements--) { // Read all of the elements of the constant.
unsigned Slot;
if (read_vbr(Buf, EndBuf, Slot)) return failure(true);
2001-06-06 22:29:01 +02:00
Value *V = getValue(AT->getElementType(), Slot, false);
if (!V || !isa<Constant>(V)) return failure(true);
Elements.push_back(cast<Constant>(V));
2001-06-06 22:29:01 +02:00
}
V = ConstantArray::get(AT, Elements);
2001-06-06 22:29:01 +02:00
break;
}
case Type::StructTyID: {
const StructType *ST = cast<StructType>(Ty);
2001-06-06 22:29:01 +02:00
const StructType::ElementTypes &ET = ST->getElementTypes();
std::vector<Constant *> Elements;
2001-06-06 22:29:01 +02:00
for (unsigned i = 0; i < ET.size(); ++i) {
unsigned Slot;
if (read_vbr(Buf, EndBuf, Slot)) return failure(true);
2001-06-06 22:29:01 +02:00
Value *V = getValue(ET[i], Slot, false);
if (!V || !isa<Constant>(V))
return failure(true);
Elements.push_back(cast<Constant>(V));
2001-06-06 22:29:01 +02:00
}
V = ConstantStruct::get(ST, Elements);
2001-06-06 22:29:01 +02:00
break;
}
case Type::PointerTyID: {
const PointerType *PT = cast<const PointerType>(Ty);
unsigned SubClass;
if (read_vbr(Buf, EndBuf, SubClass)) return failure(true);
switch (SubClass) {
case 0: // ConstantPointerNull value...
V = ConstantPointerNull::get(PT);
break;
case 1: { // ConstantPointerRef value...
unsigned Slot;
if (read_vbr(Buf, EndBuf, Slot)) return failure(true);
BCR_TRACE(4, "CPR: Type: '" << Ty << "' slot: " << Slot << "\n");
// Check to see if we have already read this global variable yet...
Value *Val = getValue(PT, Slot, false);
GlobalValue* GV;
if (Val) {
if (!(GV = dyn_cast<GlobalValue>(Val))) return failure(true);
BCR_TRACE(5, "Value Found in ValueTable!\n");
} else { // Nope... find or create a forward ref. for it
GV = fwdRefs.GetFwdRefToGlobal(PT, Slot);
}
V = ConstantPointerRef::get(GV);
break;
}
default:
BCR_TRACE(5, "UNKNOWN Pointer Constant Type!\n");
return failure(true);
}
break;
}
2001-06-06 22:29:01 +02:00
default:
std::cerr << __FILE__ << ":" << __LINE__
2002-06-30 18:04:37 +02:00
<< ": Don't know how to deserialize constant value of type '"
<< Ty->getName() << "'\n";
return failure(true);
2001-06-06 22:29:01 +02:00
}
2001-06-06 22:29:01 +02:00
return false;
}
bool BytecodeParser::ParseConstantPool(const uchar *&Buf, const uchar *EndBuf,
ValueTable &Tab,
TypeValuesListTy &TypeTab) {
2001-06-06 22:29:01 +02:00
while (Buf < EndBuf) {
unsigned NumEntries, Typ;
if (read_vbr(Buf, EndBuf, NumEntries) ||
read_vbr(Buf, EndBuf, Typ)) return failure(true);
2001-06-06 22:29:01 +02:00
const Type *Ty = getType(Typ);
if (Ty == 0) return failure(true);
BCR_TRACE(3, "Type: '" << Ty << "' NumEntries: " << NumEntries << "\n");
2001-06-06 22:29:01 +02:00
if (Typ == Type::TypeTyID) {
if (parseTypeConstants(Buf, EndBuf, TypeTab, NumEntries)) return true;
} else {
2001-10-24 08:21:22 +02:00
for (unsigned i = 0; i < NumEntries; ++i) {
Constant *I;
int Slot;
if (parseConstantValue(Buf, EndBuf, Ty, I)) return failure(true);
assert(I && "parseConstantValue returned `!failure' and NULL result");
BCR_TRACE(4, "Read Constant: '" << I << "'\n");
if ((Slot = insertValue(I, Tab)) < 0) return failure(true);
resolveRefsToConstant(I, (unsigned) Slot);
}
2001-06-06 22:29:01 +02:00
}
}
if (Buf > EndBuf) return failure(true);
return false;
2001-06-06 22:29:01 +02:00
}