2007-04-22 08:22:05 +02:00
|
|
|
//===- BitstreamReader.h - Low-level bitstream reader interface -*- C++ -*-===//
|
|
|
|
//
|
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
2007-12-29 20:59:42 +01:00
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
2007-04-22 08:22:05 +02:00
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
|
|
|
// This header defines the BitstreamReader class. This class can be used to
|
|
|
|
// read an arbitrary bitstream, regardless of its contents.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2013-01-10 01:45:19 +01:00
|
|
|
#ifndef LLVM_BITCODE_BITSTREAMREADER_H
|
|
|
|
#define LLVM_BITCODE_BITSTREAMREADER_H
|
2007-04-22 08:22:05 +02:00
|
|
|
|
2012-02-06 23:30:29 +01:00
|
|
|
#include "llvm/ADT/OwningPtr.h"
|
2007-04-22 08:22:05 +02:00
|
|
|
#include "llvm/Bitcode/BitCodes.h"
|
2012-02-07 11:53:19 +01:00
|
|
|
#include "llvm/Support/Endian.h"
|
2012-02-06 23:36:39 +01:00
|
|
|
#include "llvm/Support/StreamableMemoryObject.h"
|
2009-04-01 20:45:54 +02:00
|
|
|
#include <climits>
|
2009-08-27 08:41:46 +02:00
|
|
|
#include <string>
|
2007-04-29 10:05:07 +02:00
|
|
|
#include <vector>
|
2007-04-22 08:22:05 +02:00
|
|
|
|
|
|
|
namespace llvm {
|
2009-02-21 00:04:06 +01:00
|
|
|
|
2007-11-10 03:00:38 +01:00
|
|
|
class Deserializer;
|
2009-02-21 00:04:06 +01:00
|
|
|
|
2007-04-22 08:22:05 +02:00
|
|
|
class BitstreamReader {
|
2009-04-26 22:59:02 +02:00
|
|
|
public:
|
|
|
|
/// BlockInfo - This contains information emitted to BLOCKINFO_BLOCK blocks.
|
|
|
|
/// These describe abbreviations that all blocks of the specified ID inherit.
|
|
|
|
struct BlockInfo {
|
|
|
|
unsigned BlockID;
|
|
|
|
std::vector<BitCodeAbbrev*> Abbrevs;
|
2009-04-27 00:21:57 +02:00
|
|
|
std::string Name;
|
2012-11-25 16:23:39 +01:00
|
|
|
|
2009-04-27 00:21:57 +02:00
|
|
|
std::vector<std::pair<unsigned, std::string> > RecordNames;
|
2009-04-26 22:59:02 +02:00
|
|
|
};
|
|
|
|
private:
|
2012-02-06 23:30:29 +01:00
|
|
|
OwningPtr<StreamableMemoryObject> BitcodeBytes;
|
2012-11-25 16:23:39 +01:00
|
|
|
|
2009-04-26 22:59:02 +02:00
|
|
|
std::vector<BlockInfo> BlockInfoRecords;
|
|
|
|
|
2009-04-27 22:04:08 +02:00
|
|
|
/// IgnoreBlockInfoNames - This is set to true if we don't care about the
|
|
|
|
/// block/record name information in the BlockInfo block. Only llvm-bcanalyzer
|
|
|
|
/// uses this.
|
|
|
|
bool IgnoreBlockInfoNames;
|
2012-09-17 09:16:40 +02:00
|
|
|
|
|
|
|
BitstreamReader(const BitstreamReader&) LLVM_DELETED_FUNCTION;
|
|
|
|
void operator=(const BitstreamReader&) LLVM_DELETED_FUNCTION;
|
2009-04-26 22:59:02 +02:00
|
|
|
public:
|
2012-02-06 23:30:29 +01:00
|
|
|
BitstreamReader() : IgnoreBlockInfoNames(true) {
|
2009-04-26 22:59:02 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
BitstreamReader(const unsigned char *Start, const unsigned char *End) {
|
2009-04-27 22:04:08 +02:00
|
|
|
IgnoreBlockInfoNames = true;
|
2009-04-26 22:59:02 +02:00
|
|
|
init(Start, End);
|
|
|
|
}
|
|
|
|
|
2012-02-06 23:30:29 +01:00
|
|
|
BitstreamReader(StreamableMemoryObject *bytes) {
|
|
|
|
BitcodeBytes.reset(bytes);
|
|
|
|
}
|
|
|
|
|
2009-04-26 22:59:02 +02:00
|
|
|
void init(const unsigned char *Start, const unsigned char *End) {
|
|
|
|
assert(((End-Start) & 3) == 0 &&"Bitcode stream not a multiple of 4 bytes");
|
2012-02-06 23:30:29 +01:00
|
|
|
BitcodeBytes.reset(getNonStreamedMemoryObject(Start, End));
|
2009-04-26 22:59:02 +02:00
|
|
|
}
|
|
|
|
|
2012-02-06 23:30:29 +01:00
|
|
|
StreamableMemoryObject &getBitcodeBytes() { return *BitcodeBytes; }
|
|
|
|
|
2009-04-26 22:59:02 +02:00
|
|
|
~BitstreamReader() {
|
|
|
|
// Free the BlockInfoRecords.
|
|
|
|
while (!BlockInfoRecords.empty()) {
|
|
|
|
BlockInfo &Info = BlockInfoRecords.back();
|
|
|
|
// Free blockinfo abbrev info.
|
|
|
|
for (unsigned i = 0, e = static_cast<unsigned>(Info.Abbrevs.size());
|
|
|
|
i != e; ++i)
|
|
|
|
Info.Abbrevs[i]->dropRef();
|
|
|
|
BlockInfoRecords.pop_back();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-04-27 22:04:08 +02:00
|
|
|
/// CollectBlockInfoNames - This is called by clients that want block/record
|
|
|
|
/// name information.
|
|
|
|
void CollectBlockInfoNames() { IgnoreBlockInfoNames = false; }
|
|
|
|
bool isIgnoringBlockInfoNames() { return IgnoreBlockInfoNames; }
|
2012-11-25 16:23:39 +01:00
|
|
|
|
2009-04-26 22:59:02 +02:00
|
|
|
//===--------------------------------------------------------------------===//
|
|
|
|
// Block Manipulation
|
|
|
|
//===--------------------------------------------------------------------===//
|
|
|
|
|
2009-04-26 23:07:02 +02:00
|
|
|
/// hasBlockInfoRecords - Return true if we've already read and processed the
|
|
|
|
/// block info block for this Bitstream. We only process it for the first
|
|
|
|
/// cursor that walks over it.
|
|
|
|
bool hasBlockInfoRecords() const { return !BlockInfoRecords.empty(); }
|
2012-11-25 16:23:39 +01:00
|
|
|
|
2009-04-26 22:59:02 +02:00
|
|
|
/// getBlockInfo - If there is block info for the specified ID, return it,
|
|
|
|
/// otherwise return null.
|
2009-04-27 00:21:57 +02:00
|
|
|
const BlockInfo *getBlockInfo(unsigned BlockID) const {
|
2009-04-26 22:59:02 +02:00
|
|
|
// Common case, the most recent entry matches BlockID.
|
|
|
|
if (!BlockInfoRecords.empty() && BlockInfoRecords.back().BlockID == BlockID)
|
|
|
|
return &BlockInfoRecords.back();
|
|
|
|
|
|
|
|
for (unsigned i = 0, e = static_cast<unsigned>(BlockInfoRecords.size());
|
|
|
|
i != e; ++i)
|
|
|
|
if (BlockInfoRecords[i].BlockID == BlockID)
|
|
|
|
return &BlockInfoRecords[i];
|
|
|
|
return 0;
|
|
|
|
}
|
2009-02-21 00:04:06 +01:00
|
|
|
|
2009-04-26 22:59:02 +02:00
|
|
|
BlockInfo &getOrCreateBlockInfo(unsigned BlockID) {
|
2009-04-27 00:21:57 +02:00
|
|
|
if (const BlockInfo *BI = getBlockInfo(BlockID))
|
|
|
|
return *const_cast<BlockInfo*>(BI);
|
2009-04-26 22:59:02 +02:00
|
|
|
|
|
|
|
// Otherwise, add a new record.
|
|
|
|
BlockInfoRecords.push_back(BlockInfo());
|
|
|
|
BlockInfoRecords.back().BlockID = BlockID;
|
|
|
|
return BlockInfoRecords.back();
|
|
|
|
}
|
|
|
|
|
|
|
|
};
|
|
|
|
|
|
|
|
class BitstreamCursor {
|
|
|
|
friend class Deserializer;
|
|
|
|
BitstreamReader *BitStream;
|
2012-02-06 23:30:29 +01:00
|
|
|
size_t NextChar;
|
2012-11-25 16:23:39 +01:00
|
|
|
|
2007-04-22 08:22:05 +02:00
|
|
|
/// CurWord - This is the current data we have pulled from the stream but have
|
|
|
|
/// not returned to the client.
|
|
|
|
uint32_t CurWord;
|
2012-11-25 16:23:39 +01:00
|
|
|
|
2007-04-22 08:22:05 +02:00
|
|
|
/// BitsInCurWord - This is the number of bits in CurWord that are valid. This
|
|
|
|
/// is always from [0...31] inclusive.
|
|
|
|
unsigned BitsInCurWord;
|
2012-11-25 16:23:39 +01:00
|
|
|
|
2007-04-22 08:22:05 +02:00
|
|
|
// CurCodeSize - This is the declared size of code values used for the current
|
|
|
|
// block, in bits.
|
|
|
|
unsigned CurCodeSize;
|
2012-11-25 16:23:39 +01:00
|
|
|
|
2007-04-23 20:57:58 +02:00
|
|
|
/// CurAbbrevs - Abbrevs installed at in this block.
|
|
|
|
std::vector<BitCodeAbbrev*> CurAbbrevs;
|
2012-11-25 16:23:39 +01:00
|
|
|
|
2007-04-23 20:57:58 +02:00
|
|
|
struct Block {
|
|
|
|
unsigned PrevCodeSize;
|
|
|
|
std::vector<BitCodeAbbrev*> PrevAbbrevs;
|
|
|
|
explicit Block(unsigned PCS) : PrevCodeSize(PCS) {}
|
|
|
|
};
|
2012-11-25 16:23:39 +01:00
|
|
|
|
2007-04-23 20:57:58 +02:00
|
|
|
/// BlockScope - This tracks the codesize of parent blocks.
|
|
|
|
SmallVector<Block, 8> BlockScope;
|
2012-11-25 16:23:39 +01:00
|
|
|
|
2007-04-22 08:22:05 +02:00
|
|
|
public:
|
2009-04-26 22:59:02 +02:00
|
|
|
BitstreamCursor() : BitStream(0), NextChar(0) {
|
|
|
|
}
|
2009-04-26 23:07:02 +02:00
|
|
|
BitstreamCursor(const BitstreamCursor &RHS) : BitStream(0), NextChar(0) {
|
|
|
|
operator=(RHS);
|
|
|
|
}
|
2012-11-25 16:23:39 +01:00
|
|
|
|
2009-04-26 22:59:02 +02:00
|
|
|
explicit BitstreamCursor(BitstreamReader &R) : BitStream(&R) {
|
2012-02-06 23:30:29 +01:00
|
|
|
NextChar = 0;
|
2007-05-01 06:59:06 +02:00
|
|
|
CurWord = 0;
|
|
|
|
BitsInCurWord = 0;
|
2009-04-26 22:59:02 +02:00
|
|
|
CurCodeSize = 2;
|
2007-05-01 06:59:06 +02:00
|
|
|
}
|
2012-11-25 16:23:39 +01:00
|
|
|
|
2009-04-26 22:59:02 +02:00
|
|
|
void init(BitstreamReader &R) {
|
|
|
|
freeState();
|
2012-11-25 16:23:39 +01:00
|
|
|
|
2009-04-26 22:59:02 +02:00
|
|
|
BitStream = &R;
|
2012-02-06 23:30:29 +01:00
|
|
|
NextChar = 0;
|
2007-04-22 08:22:05 +02:00
|
|
|
CurWord = 0;
|
|
|
|
BitsInCurWord = 0;
|
|
|
|
CurCodeSize = 2;
|
|
|
|
}
|
2012-11-25 16:23:39 +01:00
|
|
|
|
2009-04-26 22:59:02 +02:00
|
|
|
~BitstreamCursor() {
|
|
|
|
freeState();
|
|
|
|
}
|
2012-11-25 16:23:39 +01:00
|
|
|
|
2013-01-19 19:19:39 +01:00
|
|
|
void operator=(const BitstreamCursor &RHS);
|
2012-11-25 16:23:39 +01:00
|
|
|
|
2013-01-19 19:19:39 +01:00
|
|
|
void freeState();
|
|
|
|
|
2009-04-26 22:59:02 +02:00
|
|
|
/// GetAbbrevIDWidth - Return the number of bits used to encode an abbrev #.
|
|
|
|
unsigned GetAbbrevIDWidth() const { return CurCodeSize; }
|
2012-11-25 16:23:39 +01:00
|
|
|
|
2012-02-06 23:30:29 +01:00
|
|
|
bool isEndPos(size_t pos) {
|
|
|
|
return BitStream->getBitcodeBytes().isObjectEnd(static_cast<uint64_t>(pos));
|
|
|
|
}
|
|
|
|
|
|
|
|
bool canSkipToPos(size_t pos) const {
|
|
|
|
// pos can be skipped to if it is a valid address or one byte past the end.
|
|
|
|
return pos == 0 || BitStream->getBitcodeBytes().isValidAddress(
|
|
|
|
static_cast<uint64_t>(pos - 1));
|
|
|
|
}
|
|
|
|
|
|
|
|
unsigned char getByte(size_t pos) {
|
|
|
|
uint8_t byte = -1;
|
|
|
|
BitStream->getBitcodeBytes().readByte(pos, &byte);
|
|
|
|
return byte;
|
|
|
|
}
|
|
|
|
|
|
|
|
uint32_t getWord(size_t pos) {
|
2013-01-19 19:19:39 +01:00
|
|
|
uint8_t buf[4] = { 0xFF, 0xFF, 0xFF, 0xFF };
|
|
|
|
BitStream->getBitcodeBytes().readBytes(pos, sizeof(buf), buf, NULL);
|
2012-02-07 11:53:19 +01:00
|
|
|
return *reinterpret_cast<support::ulittle32_t *>(buf);
|
2012-02-06 23:30:29 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
bool AtEndOfStream() {
|
|
|
|
return isEndPos(NextChar) && BitsInCurWord == 0;
|
2007-05-06 10:12:09 +02:00
|
|
|
}
|
2012-11-25 16:23:39 +01:00
|
|
|
|
2007-04-29 21:17:32 +02:00
|
|
|
/// GetCurrentBitNo - Return the bit # of the bit we are reading.
|
|
|
|
uint64_t GetCurrentBitNo() const {
|
2012-02-06 23:30:29 +01:00
|
|
|
return NextChar*CHAR_BIT - BitsInCurWord;
|
2007-04-29 21:17:32 +02:00
|
|
|
}
|
2012-11-25 16:23:39 +01:00
|
|
|
|
2009-04-27 00:21:57 +02:00
|
|
|
BitstreamReader *getBitStreamReader() {
|
|
|
|
return BitStream;
|
|
|
|
}
|
|
|
|
const BitstreamReader *getBitStreamReader() const {
|
|
|
|
return BitStream;
|
|
|
|
}
|
2012-11-25 16:23:39 +01:00
|
|
|
|
|
|
|
|
2007-05-01 06:59:06 +02:00
|
|
|
/// JumpToBit - Reset the stream to the specified bit number.
|
|
|
|
void JumpToBit(uint64_t BitNo) {
|
2007-05-06 05:24:19 +02:00
|
|
|
uintptr_t ByteNo = uintptr_t(BitNo/8) & ~3;
|
|
|
|
uintptr_t WordBitNo = uintptr_t(BitNo) & 31;
|
2012-02-06 23:30:29 +01:00
|
|
|
assert(canSkipToPos(ByteNo) && "Invalid location");
|
2012-11-25 16:23:39 +01:00
|
|
|
|
2007-05-01 06:59:06 +02:00
|
|
|
// Move the cursor to the right word.
|
2012-02-06 23:30:29 +01:00
|
|
|
NextChar = ByteNo;
|
2007-05-01 06:59:06 +02:00
|
|
|
BitsInCurWord = 0;
|
2007-11-30 23:39:46 +01:00
|
|
|
CurWord = 0;
|
2012-11-25 16:23:39 +01:00
|
|
|
|
2007-05-01 06:59:06 +02:00
|
|
|
// Skip over any bits that are already consumed.
|
2009-04-26 22:59:02 +02:00
|
|
|
if (WordBitNo)
|
2008-05-05 20:30:58 +02:00
|
|
|
Read(static_cast<unsigned>(WordBitNo));
|
2007-05-01 06:59:06 +02:00
|
|
|
}
|
2012-11-25 16:23:39 +01:00
|
|
|
|
|
|
|
|
2007-04-22 08:22:05 +02:00
|
|
|
uint32_t Read(unsigned NumBits) {
|
2009-07-07 20:39:49 +02:00
|
|
|
assert(NumBits <= 32 && "Cannot return more than 32 bits!");
|
2007-04-22 08:22:05 +02:00
|
|
|
// If the field is fully contained by CurWord, return it quickly.
|
|
|
|
if (BitsInCurWord >= NumBits) {
|
|
|
|
uint32_t R = CurWord & ((1U << NumBits)-1);
|
|
|
|
CurWord >>= NumBits;
|
|
|
|
BitsInCurWord -= NumBits;
|
|
|
|
return R;
|
|
|
|
}
|
|
|
|
|
|
|
|
// If we run out of data, stop at the end of the stream.
|
2012-02-06 23:30:29 +01:00
|
|
|
if (isEndPos(NextChar)) {
|
2007-04-22 08:22:05 +02:00
|
|
|
CurWord = 0;
|
|
|
|
BitsInCurWord = 0;
|
|
|
|
return 0;
|
|
|
|
}
|
2009-02-21 00:04:06 +01:00
|
|
|
|
2007-04-22 08:22:05 +02:00
|
|
|
unsigned R = CurWord;
|
|
|
|
|
|
|
|
// Read the next word from the stream.
|
2012-02-06 23:30:29 +01:00
|
|
|
CurWord = getWord(NextChar);
|
2007-04-22 08:22:05 +02:00
|
|
|
NextChar += 4;
|
2009-02-21 00:04:06 +01:00
|
|
|
|
2007-04-22 08:22:05 +02:00
|
|
|
// Extract NumBits-BitsInCurWord from what we just read.
|
|
|
|
unsigned BitsLeft = NumBits-BitsInCurWord;
|
2009-02-21 00:04:06 +01:00
|
|
|
|
2007-04-22 08:22:05 +02:00
|
|
|
// Be careful here, BitsLeft is in the range [1..32] inclusive.
|
|
|
|
R |= (CurWord & (~0U >> (32-BitsLeft))) << BitsInCurWord;
|
2009-02-21 00:04:06 +01:00
|
|
|
|
2007-04-22 08:22:05 +02:00
|
|
|
// BitsLeft bits have just been used up from CurWord.
|
|
|
|
if (BitsLeft != 32)
|
|
|
|
CurWord >>= BitsLeft;
|
|
|
|
else
|
|
|
|
CurWord = 0;
|
|
|
|
BitsInCurWord = 32-BitsLeft;
|
|
|
|
return R;
|
|
|
|
}
|
2009-02-21 00:04:06 +01:00
|
|
|
|
2007-04-23 20:57:58 +02:00
|
|
|
uint64_t Read64(unsigned NumBits) {
|
|
|
|
if (NumBits <= 32) return Read(NumBits);
|
2009-02-21 00:04:06 +01:00
|
|
|
|
2007-04-23 20:57:58 +02:00
|
|
|
uint64_t V = Read(32);
|
|
|
|
return V | (uint64_t)Read(NumBits-32) << 32;
|
|
|
|
}
|
2009-02-21 00:04:06 +01:00
|
|
|
|
2007-04-22 08:22:05 +02:00
|
|
|
uint32_t ReadVBR(unsigned NumBits) {
|
|
|
|
uint32_t Piece = Read(NumBits);
|
2007-04-22 17:00:52 +02:00
|
|
|
if ((Piece & (1U << (NumBits-1))) == 0)
|
2007-04-22 08:22:05 +02:00
|
|
|
return Piece;
|
|
|
|
|
|
|
|
uint32_t Result = 0;
|
|
|
|
unsigned NextBit = 0;
|
|
|
|
while (1) {
|
|
|
|
Result |= (Piece & ((1U << (NumBits-1))-1)) << NextBit;
|
|
|
|
|
2007-04-22 17:00:52 +02:00
|
|
|
if ((Piece & (1U << (NumBits-1))) == 0)
|
2007-04-22 08:22:05 +02:00
|
|
|
return Result;
|
2009-02-21 00:04:06 +01:00
|
|
|
|
2007-04-22 08:22:05 +02:00
|
|
|
NextBit += NumBits-1;
|
|
|
|
Piece = Read(NumBits);
|
|
|
|
}
|
|
|
|
}
|
2009-02-21 00:04:06 +01:00
|
|
|
|
2009-07-07 20:39:49 +02:00
|
|
|
// ReadVBR64 - Read a VBR that may have a value up to 64-bits in size. The
|
|
|
|
// chunk size of the VBR must still be <= 32 bits though.
|
2007-04-22 08:22:05 +02:00
|
|
|
uint64_t ReadVBR64(unsigned NumBits) {
|
2009-07-07 20:39:49 +02:00
|
|
|
uint32_t Piece = Read(NumBits);
|
|
|
|
if ((Piece & (1U << (NumBits-1))) == 0)
|
|
|
|
return uint64_t(Piece);
|
2009-02-21 00:04:06 +01:00
|
|
|
|
2007-04-22 08:22:05 +02:00
|
|
|
uint64_t Result = 0;
|
|
|
|
unsigned NextBit = 0;
|
|
|
|
while (1) {
|
2009-07-07 20:39:49 +02:00
|
|
|
Result |= uint64_t(Piece & ((1U << (NumBits-1))-1)) << NextBit;
|
2009-02-21 00:04:06 +01:00
|
|
|
|
2009-07-07 20:39:49 +02:00
|
|
|
if ((Piece & (1U << (NumBits-1))) == 0)
|
2007-04-22 08:22:05 +02:00
|
|
|
return Result;
|
2009-02-21 00:04:06 +01:00
|
|
|
|
2007-04-22 08:22:05 +02:00
|
|
|
NextBit += NumBits-1;
|
|
|
|
Piece = Read(NumBits);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void SkipToWord() {
|
|
|
|
BitsInCurWord = 0;
|
|
|
|
CurWord = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
unsigned ReadCode() {
|
|
|
|
return Read(CurCodeSize);
|
|
|
|
}
|
|
|
|
|
2009-02-21 00:04:06 +01:00
|
|
|
|
2007-04-22 08:22:05 +02:00
|
|
|
// Block header:
|
|
|
|
// [ENTER_SUBBLOCK, blockid, newcodelen, <align4bytes>, blocklen]
|
|
|
|
|
|
|
|
/// ReadSubBlockID - Having read the ENTER_SUBBLOCK code, read the BlockID for
|
|
|
|
/// the block.
|
|
|
|
unsigned ReadSubBlockID() {
|
|
|
|
return ReadVBR(bitc::BlockIDWidth);
|
|
|
|
}
|
2009-02-21 00:04:06 +01:00
|
|
|
|
2007-04-22 08:22:05 +02:00
|
|
|
/// SkipBlock - Having read the ENTER_SUBBLOCK abbrevid and a BlockID, skip
|
|
|
|
/// over the body of this block. If the block record is malformed, return
|
|
|
|
/// true.
|
|
|
|
bool SkipBlock() {
|
|
|
|
// Read and ignore the codelen value. Since we are skipping this block, we
|
|
|
|
// don't care what code widths are used inside of it.
|
|
|
|
ReadVBR(bitc::CodeLenWidth);
|
|
|
|
SkipToWord();
|
|
|
|
unsigned NumWords = Read(bitc::BlockSizeWidth);
|
2009-02-21 00:04:06 +01:00
|
|
|
|
2007-04-22 08:22:05 +02:00
|
|
|
// Check that the block wasn't partially defined, and that the offset isn't
|
|
|
|
// bogus.
|
2012-02-06 23:30:29 +01:00
|
|
|
size_t SkipTo = NextChar + NumWords*4;
|
|
|
|
if (AtEndOfStream() || !canSkipToPos(SkipTo))
|
2007-04-22 08:22:05 +02:00
|
|
|
return true;
|
2009-02-21 00:04:06 +01:00
|
|
|
|
2011-06-25 19:08:50 +02:00
|
|
|
NextChar = SkipTo;
|
2007-04-22 08:22:05 +02:00
|
|
|
return false;
|
|
|
|
}
|
2009-02-21 00:04:06 +01:00
|
|
|
|
2007-11-10 03:00:38 +01:00
|
|
|
/// EnterSubBlock - Having read the ENTER_SUBBLOCK abbrevid, enter
|
Change encoding of instruction operands in bitcode binaries to be relative
to the instruction position. The old encoding would give an absolute
ID which counts up within a function, and only resets at the next function.
I.e., Instead of having:
... = icmp eq i32 n-1, n-2
br i1 ..., label %bb1, label %bb2
it will now be roughly:
... = icmp eq i32 1, 2
br i1 1, label %bb1, label %bb2
This makes it so that ids remain relatively small and can be encoded
in fewer bits.
With this encoding, forward reference operands will be given
negative-valued IDs. Use signed VBRs for the most common case
of forward references, which is phi instructions.
To retain backward compatibility we bump the bitcode version
from 0 to 1 to distinguish between the different encodings.
llvm-svn: 165739
2012-10-11 22:20:40 +02:00
|
|
|
/// the block, and return true if the block has an error.
|
2013-01-19 19:19:39 +01:00
|
|
|
bool EnterSubBlock(unsigned BlockID, unsigned *NumWordsP = 0);
|
|
|
|
|
2007-04-22 08:22:05 +02:00
|
|
|
bool ReadBlockEnd() {
|
|
|
|
if (BlockScope.empty()) return true;
|
2009-02-21 00:04:06 +01:00
|
|
|
|
2007-04-22 08:22:05 +02:00
|
|
|
// Block tail:
|
|
|
|
// [END_BLOCK, <align4bytes>]
|
|
|
|
SkipToWord();
|
2009-02-21 00:04:06 +01:00
|
|
|
|
2007-11-10 03:00:38 +01:00
|
|
|
PopBlockScope();
|
|
|
|
return false;
|
|
|
|
}
|
2009-02-21 00:04:06 +01:00
|
|
|
|
2007-11-10 03:00:38 +01:00
|
|
|
private:
|
|
|
|
void PopBlockScope() {
|
2007-04-23 20:57:58 +02:00
|
|
|
CurCodeSize = BlockScope.back().PrevCodeSize;
|
2009-02-21 00:04:06 +01:00
|
|
|
|
2007-04-23 20:57:58 +02:00
|
|
|
// Delete abbrevs from popped scope.
|
2008-05-05 20:30:58 +02:00
|
|
|
for (unsigned i = 0, e = static_cast<unsigned>(CurAbbrevs.size());
|
|
|
|
i != e; ++i)
|
2007-05-04 19:35:19 +02:00
|
|
|
CurAbbrevs[i]->dropRef();
|
2009-02-21 00:04:06 +01:00
|
|
|
|
2007-04-23 20:57:58 +02:00
|
|
|
BlockScope.back().PrevAbbrevs.swap(CurAbbrevs);
|
2007-04-22 08:22:05 +02:00
|
|
|
BlockScope.pop_back();
|
2009-02-21 00:04:06 +01:00
|
|
|
}
|
|
|
|
|
2009-04-26 22:59:02 +02:00
|
|
|
//===--------------------------------------------------------------------===//
|
2007-04-22 08:22:05 +02:00
|
|
|
// Record Processing
|
|
|
|
//===--------------------------------------------------------------------===//
|
2009-02-21 00:04:06 +01:00
|
|
|
|
2007-05-04 22:33:47 +02:00
|
|
|
private:
|
2009-04-06 23:37:10 +02:00
|
|
|
void ReadAbbreviatedLiteral(const BitCodeAbbrevOp &Op,
|
|
|
|
SmallVectorImpl<uint64_t> &Vals) {
|
|
|
|
assert(Op.isLiteral() && "Not a literal");
|
|
|
|
// If the abbrev specifies the literal value to use, use it.
|
|
|
|
Vals.push_back(Op.getLiteralValue());
|
|
|
|
}
|
2012-11-25 16:23:39 +01:00
|
|
|
|
2009-02-21 00:04:06 +01:00
|
|
|
void ReadAbbreviatedField(const BitCodeAbbrevOp &Op,
|
2007-05-04 22:33:47 +02:00
|
|
|
SmallVectorImpl<uint64_t> &Vals) {
|
2009-04-06 23:37:10 +02:00
|
|
|
assert(!Op.isLiteral() && "Use ReadAbbreviatedLiteral for literals!");
|
2012-02-05 23:14:15 +01:00
|
|
|
|
2009-04-06 23:34:58 +02:00
|
|
|
// Decode the value as we are commanded.
|
|
|
|
switch (Op.getEncoding()) {
|
2012-02-05 23:14:15 +01:00
|
|
|
default: llvm_unreachable("Unknown encoding!");
|
2009-04-06 23:34:58 +02:00
|
|
|
case BitCodeAbbrevOp::Fixed:
|
|
|
|
Vals.push_back(Read((unsigned)Op.getEncodingData()));
|
|
|
|
break;
|
|
|
|
case BitCodeAbbrevOp::VBR:
|
|
|
|
Vals.push_back(ReadVBR64((unsigned)Op.getEncodingData()));
|
|
|
|
break;
|
|
|
|
case BitCodeAbbrevOp::Char6:
|
|
|
|
Vals.push_back(BitCodeAbbrevOp::DecodeChar6(Read(6)));
|
|
|
|
break;
|
2007-05-04 22:33:47 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
public:
|
2009-04-07 00:43:46 +02:00
|
|
|
|
2012-11-25 16:23:39 +01:00
|
|
|
/// getAbbrev - Return the abbreviation for the specified AbbrevId.
|
2009-04-07 00:43:46 +02:00
|
|
|
const BitCodeAbbrev *getAbbrev(unsigned AbbrevID) {
|
|
|
|
unsigned AbbrevNo = AbbrevID-bitc::FIRST_APPLICATION_ABBREV;
|
|
|
|
assert(AbbrevNo < CurAbbrevs.size() && "Invalid abbrev #!");
|
|
|
|
return CurAbbrevs[AbbrevNo];
|
|
|
|
}
|
2012-11-25 16:23:39 +01:00
|
|
|
|
2009-04-07 04:56:46 +02:00
|
|
|
unsigned ReadRecord(unsigned AbbrevID, SmallVectorImpl<uint64_t> &Vals,
|
2013-01-19 19:19:39 +01:00
|
|
|
const char **BlobStart = 0, unsigned *BlobLen = 0);
|
|
|
|
|
2009-04-07 04:56:46 +02:00
|
|
|
unsigned ReadRecord(unsigned AbbrevID, SmallVectorImpl<uint64_t> &Vals,
|
|
|
|
const char *&BlobStart, unsigned &BlobLen) {
|
|
|
|
return ReadRecord(AbbrevID, Vals, &BlobStart, &BlobLen);
|
|
|
|
}
|
|
|
|
|
2012-11-25 16:23:39 +01:00
|
|
|
|
2007-04-23 20:57:58 +02:00
|
|
|
//===--------------------------------------------------------------------===//
|
|
|
|
// Abbrev Processing
|
|
|
|
//===--------------------------------------------------------------------===//
|
2009-02-21 00:04:06 +01:00
|
|
|
|
2013-01-19 19:19:39 +01:00
|
|
|
void ReadAbbrevRecord();
|
|
|
|
|
|
|
|
bool ReadBlockInfoBlock();
|
2007-04-22 08:22:05 +02:00
|
|
|
};
|
2012-11-25 16:23:39 +01:00
|
|
|
|
2007-04-22 08:22:05 +02:00
|
|
|
} // End llvm namespace
|
|
|
|
|
|
|
|
#endif
|