mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2024-11-19 01:13:25 +00:00
eb9409dbb9
just like pointers, except that they cannot be backpatched. This means that references are essentially non-owning pointers where the referred object must be deserialized prior to the reference being deserialized. Because of the nature of references, this ordering of objects is always possible. Fixed a bug in backpatching code (returning the backpatched pointer would accidentally include a bit flag). git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@43570 91177308-0d34-0410-b5e6-96231b3b80d8
180 lines
4.2 KiB
C++
180 lines
4.2 KiB
C++
//==- Deserialize.cpp - Generic Object Serialization to Bitcode --*- C++ -*-==//
|
|
//
|
|
// The LLVM Compiler Infrastructure
|
|
//
|
|
// This file was developed by Ted Kremenek and is distributed under the
|
|
// University of Illinois Open Source License. See LICENSE.TXT for details.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
//
|
|
// This file defines the internal methods used for object serialization.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include "llvm/Bitcode/Deserialize.h"
|
|
|
|
using namespace llvm;
|
|
|
|
Deserializer::Deserializer(BitstreamReader& stream)
|
|
: Stream(stream), RecIdx(0), FreeList(NULL) {
|
|
}
|
|
|
|
Deserializer::~Deserializer() {
|
|
assert (RecIdx >= Record.size() &&
|
|
"Still scanning bitcode record when deserialization completed.");
|
|
|
|
#ifdef NDEBUG
|
|
for (MapTy::iterator I=BPatchMap.begin(), E=BPatchMap.end(); I!=E; ++I)
|
|
assert (I->second.hasFinalPtr() &&
|
|
"Some pointers were not backpatched.");
|
|
#endif
|
|
}
|
|
|
|
|
|
bool Deserializer::inRecord() {
|
|
if (Record.size() > 0) {
|
|
if (RecIdx >= Record.size()) {
|
|
RecIdx = 0;
|
|
Record.clear();
|
|
return false;
|
|
}
|
|
else return true;
|
|
}
|
|
else return false;
|
|
}
|
|
|
|
void Deserializer::ReadRecord() {
|
|
// FIXME: Check if we haven't run off the edge of the stream.
|
|
// FIXME: Handle abbreviations.
|
|
|
|
// FIXME: Check for the correct code.
|
|
unsigned Code = Stream.ReadCode();
|
|
|
|
assert (Record.size() == 0);
|
|
Stream.ReadRecord(Code,Record);
|
|
assert (Record.size() > 0);
|
|
}
|
|
|
|
uint64_t Deserializer::ReadInt() {
|
|
// FIXME: Any error recovery/handling with incomplete or bad files?
|
|
if (!inRecord())
|
|
ReadRecord();
|
|
|
|
return Record[RecIdx++];
|
|
}
|
|
|
|
char* Deserializer::ReadCStr(char* cstr, unsigned MaxLen, bool isNullTerm) {
|
|
if (cstr == NULL)
|
|
MaxLen = 0; // Zero this just in case someone does something funny.
|
|
|
|
unsigned len = ReadInt();
|
|
|
|
assert (MaxLen == 0 || (len + (isNullTerm ? 1 : 0)) <= MaxLen);
|
|
|
|
if (!cstr)
|
|
cstr = new char[len + (isNullTerm ? 1 : 0)];
|
|
|
|
assert (cstr != NULL);
|
|
|
|
for (unsigned i = 0; i < len; ++i)
|
|
cstr[i] = (char) ReadInt();
|
|
|
|
if (isNullTerm)
|
|
cstr[len+1] = '\0';
|
|
|
|
return cstr;
|
|
}
|
|
|
|
void Deserializer::ReadCStr(std::vector<char>& buff, bool isNullTerm) {
|
|
unsigned len = ReadInt();
|
|
|
|
buff.clear();
|
|
buff.reserve(len);
|
|
|
|
for (unsigned i = 0; i < len; ++i)
|
|
buff.push_back((char) ReadInt());
|
|
|
|
if (isNullTerm)
|
|
buff.push_back('\0');
|
|
}
|
|
|
|
void Deserializer::RegisterPtr(unsigned PtrId,void* Ptr) {
|
|
BPatchEntry& E = BPatchMap[PtrId];
|
|
assert (E.hasFinalPtr() && "Pointer already registered.");
|
|
E.setFinalPtr(FreeList,Ptr);
|
|
}
|
|
|
|
void Deserializer::ReadUIntPtr(uintptr_t& PtrRef) {
|
|
unsigned PtrId = ReadInt();
|
|
|
|
if (PtrId == 0) {
|
|
PtrRef = 0;
|
|
return;
|
|
}
|
|
|
|
BPatchEntry& E = BPatchMap[PtrId];
|
|
|
|
if (E.hasFinalPtr())
|
|
PtrRef = E.getFinalPtr();
|
|
else {
|
|
// Register backpatch. Check the freelist for a BPNode.
|
|
BPNode* N;
|
|
|
|
if (FreeList) {
|
|
N = FreeList;
|
|
FreeList = FreeList->Next;
|
|
}
|
|
else // No available BPNode. Allocate one.
|
|
N = (BPNode*) Allocator.Allocate<BPNode>();
|
|
|
|
new (N) BPNode(E.getBPNode(),PtrRef);
|
|
E.setBPNode(N);
|
|
}
|
|
}
|
|
|
|
uintptr_t Deserializer::ReadInternalRefPtr() {
|
|
unsigned PtrId = ReadInt();
|
|
|
|
assert (PtrId != 0 && "References cannot refer the NULL address.");
|
|
|
|
BPatchEntry& E = BPatchMap[PtrId];
|
|
|
|
assert (E.hasFinalPtr() &&
|
|
"Cannot backpatch references. Object must be already deserialized.");
|
|
|
|
return E.getFinalPtr();
|
|
}
|
|
|
|
void Deserializer::BPatchEntry::setFinalPtr(BPNode*& FreeList, void* P) {
|
|
assert (!hasFinalPtr());
|
|
|
|
// Perform backpatching.
|
|
|
|
BPNode* Last = NULL;
|
|
|
|
for (BPNode* N = getBPNode() ; N != NULL; N = N->Next) {
|
|
Last = N;
|
|
N->PtrRef |= reinterpret_cast<uintptr_t>(P);
|
|
}
|
|
|
|
if (Last) {
|
|
Last->Next = FreeList;
|
|
FreeList = getBPNode();
|
|
}
|
|
|
|
Ptr = reinterpret_cast<uintptr_t>(P);
|
|
}
|
|
|
|
|
|
#define INT_READ(TYPE)\
|
|
void SerializeTrait<TYPE>::Read(Deserializer& D, TYPE& X) {\
|
|
X = (TYPE) D.ReadInt(); }\
|
|
TYPE SerializeTrait<TYPE>::ReadVal(Deserializer& D) {\
|
|
return (TYPE) D.ReadInt(); }
|
|
|
|
INT_READ(bool)
|
|
INT_READ(unsigned char)
|
|
INT_READ(unsigned short)
|
|
INT_READ(unsigned int)
|
|
INT_READ(unsigned long)
|