1 //===- BitcodeReader.h - Internal BitcodeReader impl ------------*- C++ -*-===//
3 // The LLVM Compiler Infrastructure
5 // This file was developed by Chris Lattner and is distributed under
6 // the University of Illinois Open Source License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This header defines the BitcodeReader class.
12 //===----------------------------------------------------------------------===//
14 #ifndef BITCODE_READER_H
15 #define BITCODE_READER_H
17 #include "llvm/ModuleProvider.h"
18 #include "llvm/Type.h"
19 #include "llvm/User.h"
20 #include "llvm/Bitcode/BitstreamReader.h"
21 #include "llvm/Bitcode/LLVMBitCodes.h"
22 #include "llvm/ADT/DenseMap.h"
28 class BitcodeReaderValueList : public User {
29 std::vector<Use> Uses;
31 BitcodeReaderValueList() : User(Type::VoidTy, Value::ArgumentVal, 0, 0) {}
33 // vector compatibility methods
34 unsigned size() const { return getNumOperands(); }
35 void push_back(Value *V) {
36 Uses.push_back(Use(V, this));
37 OperandList = &Uses[0];
41 Value *operator[](unsigned i) const { return getOperand(i); }
43 Value *back() const { return Uses.back(); }
44 void pop_back() { Uses.pop_back(); --NumOperands; }
45 bool empty() const { return NumOperands == 0; }
46 void shrinkTo(unsigned N) {
47 assert(N < NumOperands && "Invalid shrinkTo request!");
51 virtual void print(std::ostream&) const {}
53 Constant *getConstantFwdRef(unsigned Idx, const Type *Ty);
54 void initVal(unsigned Idx, Value *V) {
55 assert(Uses[Idx] == 0 && "Cannot init an already init'd Use!");
56 Uses[Idx].init(V, this);
61 class BitcodeReader : public ModuleProvider {
63 BitstreamReader Stream;
65 const char *ErrorString;
67 std::vector<PATypeHolder> TypeList;
68 BitcodeReaderValueList ValueList;
69 std::vector<std::pair<GlobalVariable*, unsigned> > GlobalInits;
70 std::vector<std::pair<GlobalAlias*, unsigned> > AliasInits;
72 // When reading the module header, this list is populated with functions that
73 // have bodies later in the file.
74 std::vector<Function*> FunctionsWithBodies;
76 // After the module header has been read, the FunctionsWithBodies list is
77 // reversed. This keeps track of whether we've done this yet.
78 bool HasReversedFunctionsWithBodies;
80 /// DeferredFunctionInfo - When function bodies are initially scanned, this
81 /// map contains info about where to find deferred function body (in the
82 /// stream) and what linkage the original function had.
83 DenseMap<Function*, std::pair<uint64_t, unsigned> > DeferredFunctionInfo;
85 BitcodeReader(MemoryBuffer *buffer) : Buffer(buffer), ErrorString(0) {
86 HasReversedFunctionsWithBodies = false;
91 /// releaseMemoryBuffer - This causes the reader to completely forget about
92 /// the memory buffer it contains, which prevents the buffer from being
93 /// destroyed when it is deleted.
94 void releaseMemoryBuffer() {
98 virtual bool materializeFunction(Function *F, std::string *ErrInfo = 0);
100 virtual Module *materializeModule(std::string *ErrInfo = 0) {
102 //if (ParseAllFunctionBodies(ErrMsg))
107 bool Error(const char *Str) {
111 const char *getErrorString() const { return ErrorString; }
113 /// @brief Main interface to parsing a bitcode buffer.
114 /// @returns true if an error occurred.
117 const Type *getTypeByID(unsigned ID, bool isTypeTable = false);
119 bool ParseModule(const std::string &ModuleID);
120 bool ParseTypeTable();
121 bool ParseTypeSymbolTable();
122 bool ParseValueSymbolTable();
123 bool ParseConstants();
124 bool ParseFunction();
125 bool ResolveGlobalAndAliasInits();
128 } // End llvm namespace