blob: 1d2fe32af6141c0345d12efe3a1e153caf2f595d [file] [log] [blame]
Reid Spencerf89143c2004-06-29 23:31:01 +00001//===-- Reader.h - Interface To Bytecode Reading ----------------*- C++ -*-===//
Misha Brukman8a96c532005-04-21 21:44:41 +00002//
Reid Spencerf89143c2004-06-29 23:31:01 +00003// The LLVM Compiler Infrastructure
4//
Misha Brukman8a96c532005-04-21 21:44:41 +00005// This file was developed by Reid Spencer and is distributed under the
Reid Spencerf89143c2004-06-29 23:31:01 +00006// University of Illinois Open Source License. See LICENSE.TXT for details.
Misha Brukman8a96c532005-04-21 21:44:41 +00007//
Reid Spencerf89143c2004-06-29 23:31:01 +00008//===----------------------------------------------------------------------===//
9//
Misha Brukman8a96c532005-04-21 21:44:41 +000010// This header file defines the interface to the Bytecode Reader which is
Reid Spencerf89143c2004-06-29 23:31:01 +000011// responsible for correctly interpreting bytecode files (backwards compatible)
12// and materializing a module from the bytecode read.
13//
14//===----------------------------------------------------------------------===//
15
16#ifndef BYTECODE_PARSER_H
17#define BYTECODE_PARSER_H
18
19#include "llvm/Constants.h"
20#include "llvm/DerivedTypes.h"
21#include "llvm/GlobalValue.h"
22#include "llvm/Function.h"
23#include "llvm/ModuleProvider.h"
Reid Spencera86159c2004-07-04 11:04:56 +000024#include "llvm/Bytecode/Analyzer.h"
Reid Spencerf89143c2004-06-29 23:31:01 +000025#include <utility>
26#include <map>
Reid Spencer233fe722006-08-22 16:09:19 +000027#include <setjmp.h>
Reid Spencerf89143c2004-06-29 23:31:01 +000028
29namespace llvm {
30
31class BytecodeHandler; ///< Forward declare the handler interface
32
33/// This class defines the interface for parsing a buffer of bytecode. The
34/// parser itself takes no action except to call the various functions of
35/// the handler interface. The parser's sole responsibility is the correct
Misha Brukman8a96c532005-04-21 21:44:41 +000036/// interpretation of the bytecode buffer. The handler is responsible for
37/// instantiating and keeping track of all values. As a convenience, the parser
Reid Spencerf89143c2004-06-29 23:31:01 +000038/// is responsible for materializing types and will pass them through the
39/// handler interface as necessary.
40/// @see BytecodeHandler
41/// @brief Bytecode Reader interface
42class BytecodeReader : public ModuleProvider {
43
44/// @name Constructors
45/// @{
46public:
47 /// @brief Default constructor. By default, no handler is used.
Misha Brukman8a96c532005-04-21 21:44:41 +000048 BytecodeReader(BytecodeHandler* h = 0) {
Reid Spencerd3539b82004-11-14 22:00:09 +000049 decompressedBlock = 0;
Reid Spencer17f52c52004-11-06 23:17:23 +000050 Handler = h;
Reid Spencerf89143c2004-06-29 23:31:01 +000051 }
52
Misha Brukman8a96c532005-04-21 21:44:41 +000053 ~BytecodeReader() {
54 freeState();
Chris Lattner19925222004-11-15 21:55:06 +000055 if (decompressedBlock) {
Reid Spencerd3539b82004-11-14 22:00:09 +000056 ::free(decompressedBlock);
Chris Lattner19925222004-11-15 21:55:06 +000057 decompressedBlock = 0;
58 }
Reid Spencer17f52c52004-11-06 23:17:23 +000059 }
Reid Spencerf89143c2004-06-29 23:31:01 +000060
61/// @}
62/// @name Types
63/// @{
64public:
Reid Spencerad89bd62004-07-25 18:07:36 +000065
Reid Spencerf89143c2004-06-29 23:31:01 +000066 /// @brief A convenience type for the buffer pointer
67 typedef const unsigned char* BufPtr;
68
69 /// @brief The type used for a vector of potentially abstract types
70 typedef std::vector<PATypeHolder> TypeListTy;
71
72 /// This type provides a vector of Value* via the User class for
73 /// storage of Values that have been constructed when reading the
74 /// bytecode. Because of forward referencing, constant replacement
75 /// can occur so we ensure that our list of Value* is updated
76 /// properly through those transitions. This ensures that the
77 /// correct Value* is in our list when it comes time to associate
78 /// constants with global variables at the end of reading the
79 /// globals section.
80 /// @brief A list of values as a User of those Values.
Chris Lattnercad28bd2005-01-29 00:36:19 +000081 class ValueList : public User {
82 std::vector<Use> Uses;
83 public:
Chris Lattnerfea49302005-08-16 21:59:52 +000084 ValueList() : User(Type::VoidTy, Value::ArgumentVal, 0, 0) {}
Reid Spencerf89143c2004-06-29 23:31:01 +000085
86 // vector compatibility methods
87 unsigned size() const { return getNumOperands(); }
Chris Lattnercad28bd2005-01-29 00:36:19 +000088 void push_back(Value *V) {
89 Uses.push_back(Use(V, this));
90 OperandList = &Uses[0];
91 ++NumOperands;
92 }
93 Value *back() const { return Uses.back(); }
94 void pop_back() { Uses.pop_back(); --NumOperands; }
95 bool empty() const { return NumOperands == 0; }
Reid Spencerf89143c2004-06-29 23:31:01 +000096 virtual void print(std::ostream& os) const {
Chris Lattnercad28bd2005-01-29 00:36:19 +000097 for (unsigned i = 0; i < size(); ++i) {
Reid Spencera86159c2004-07-04 11:04:56 +000098 os << i << " ";
99 getOperand(i)->print(os);
100 os << "\n";
Reid Spencerf89143c2004-06-29 23:31:01 +0000101 }
102 }
103 };
104
105 /// @brief A 2 dimensional table of values
106 typedef std::vector<ValueList*> ValueTable;
107
Misha Brukman8a96c532005-04-21 21:44:41 +0000108 /// This map is needed so that forward references to constants can be looked
Reid Spencerf89143c2004-06-29 23:31:01 +0000109 /// up by Type and slot number when resolving those references.
110 /// @brief A mapping of a Type/slot pair to a Constant*.
Chris Lattner389bd042004-12-09 06:19:44 +0000111 typedef std::map<std::pair<unsigned,unsigned>, Constant*> ConstantRefsType;
Reid Spencerf89143c2004-06-29 23:31:01 +0000112
113 /// For lazy read-in of functions, we need to save the location in the
114 /// data stream where the function is located. This structure provides that
115 /// information. Lazy read-in is used mostly by the JIT which only wants to
Misha Brukman8a96c532005-04-21 21:44:41 +0000116 /// resolve functions as it needs them.
Reid Spencerf89143c2004-06-29 23:31:01 +0000117 /// @brief Keeps pointers to function contents for later use.
118 struct LazyFunctionInfo {
119 const unsigned char *Buf, *EndBuf;
120 LazyFunctionInfo(const unsigned char *B = 0, const unsigned char *EB = 0)
121 : Buf(B), EndBuf(EB) {}
122 };
123
124 /// @brief A mapping of functions to their LazyFunctionInfo for lazy reading.
125 typedef std::map<Function*, LazyFunctionInfo> LazyFunctionMap;
126
127 /// @brief A list of global variables and the slot number that initializes
128 /// them.
129 typedef std::vector<std::pair<GlobalVariable*, unsigned> > GlobalInitsList;
130
131 /// This type maps a typeslot/valueslot pair to the corresponding Value*.
132 /// It is used for dealing with forward references as values are read in.
133 /// @brief A map for dealing with forward references of values.
134 typedef std::map<std::pair<unsigned,unsigned>,Value*> ForwardReferenceMap;
135
136/// @}
137/// @name Methods
138/// @{
139public:
Reid Spencer233fe722006-08-22 16:09:19 +0000140 /// @returns true if an error occurred
Reid Spencerf89143c2004-06-29 23:31:01 +0000141 /// @brief Main interface to parsing a bytecode buffer.
Reid Spencer233fe722006-08-22 16:09:19 +0000142 bool ParseBytecode(
Anton Korobeynikov7d515442006-09-01 20:35:17 +0000143 volatile BufPtr Buf, ///< Beginning of the bytecode buffer
Reid Spencer5c15fe52004-07-05 00:57:50 +0000144 unsigned Length, ///< Length of the bytecode buffer
Reid Spencer233fe722006-08-22 16:09:19 +0000145 const std::string &ModuleID, ///< An identifier for the module constructed.
146 std::string* ErrMsg = 0 ///< Optional place for error message
Reid Spencerf89143c2004-06-29 23:31:01 +0000147 );
148
Reid Spencerf89143c2004-06-29 23:31:01 +0000149 /// @brief Parse all function bodies
Reid Spencer99655e12006-08-25 19:54:53 +0000150 bool ParseAllFunctionBodies(std::string* ErrMsg);
Reid Spencerf89143c2004-06-29 23:31:01 +0000151
Reid Spencerf89143c2004-06-29 23:31:01 +0000152 /// @brief Parse the next function of specific type
Reid Spencer99655e12006-08-25 19:54:53 +0000153 bool ParseFunction(Function* Func, std::string* ErrMsg) ;
Reid Spencerf89143c2004-06-29 23:31:01 +0000154
155 /// This method is abstract in the parent ModuleProvider class. Its
156 /// implementation is identical to the ParseFunction method.
157 /// @see ParseFunction
158 /// @brief Make a specific function materialize.
Reid Spencer99655e12006-08-25 19:54:53 +0000159 virtual bool materializeFunction(Function *F, std::string *ErrMsg = 0) {
Reid Spencerf89143c2004-06-29 23:31:01 +0000160 LazyFunctionMap::iterator Fi = LazyFunctionLoadMap.find(F);
Reid Spencer99655e12006-08-25 19:54:53 +0000161 if (Fi == LazyFunctionLoadMap.end())
162 return false;
163 if (ParseFunction(F,ErrMsg))
Chris Lattner0300f3e2006-07-06 21:35:01 +0000164 return true;
Chris Lattner0300f3e2006-07-06 21:35:01 +0000165 return false;
Reid Spencerf89143c2004-06-29 23:31:01 +0000166 }
167
168 /// This method is abstract in the parent ModuleProvider class. Its
Misha Brukman8a96c532005-04-21 21:44:41 +0000169 /// implementation is identical to ParseAllFunctionBodies.
Reid Spencerf89143c2004-06-29 23:31:01 +0000170 /// @see ParseAllFunctionBodies
171 /// @brief Make the whole module materialize
Reid Spencer99655e12006-08-25 19:54:53 +0000172 virtual Module* materializeModule(std::string *ErrMsg = 0) {
173 if (ParseAllFunctionBodies(ErrMsg))
Chris Lattner0300f3e2006-07-06 21:35:01 +0000174 return 0;
Reid Spencerf89143c2004-06-29 23:31:01 +0000175 return TheModule;
176 }
177
178 /// This method is provided by the parent ModuleProvde class and overriden
179 /// here. It simply releases the module from its provided and frees up our
180 /// state.
181 /// @brief Release our hold on the generated module
Chris Lattner94aa7f32006-07-07 06:06:06 +0000182 Module* releaseModule(std::string *ErrInfo = 0) {
Reid Spencerf89143c2004-06-29 23:31:01 +0000183 // Since we're losing control of this Module, we must hand it back complete
Reid Spencer49521432006-11-11 11:54:25 +0000184 Module *M = ModuleProvider::releaseModule(ErrInfo);
Reid Spencerf89143c2004-06-29 23:31:01 +0000185 freeState();
186 return M;
187 }
188
189/// @}
190/// @name Parsing Units For Subclasses
191/// @{
192protected:
193 /// @brief Parse whole module scope
194 void ParseModule();
195
196 /// @brief Parse the version information block
197 void ParseVersionInfo();
198
199 /// @brief Parse the ModuleGlobalInfo block
200 void ParseModuleGlobalInfo();
201
202 /// @brief Parse a symbol table
203 void ParseSymbolTable( Function* Func, SymbolTable *ST);
204
Reid Spencerf89143c2004-06-29 23:31:01 +0000205 /// @brief Parse functions lazily.
206 void ParseFunctionLazily();
207
208 /// @brief Parse a function body
209 void ParseFunctionBody(Function* Func);
210
Reid Spencera86159c2004-07-04 11:04:56 +0000211 /// @brief Parse the type list portion of a compaction table
Chris Lattner45b5dd22004-08-03 23:41:28 +0000212 void ParseCompactionTypes(unsigned NumEntries);
Reid Spencera86159c2004-07-04 11:04:56 +0000213
Reid Spencerf89143c2004-06-29 23:31:01 +0000214 /// @brief Parse a compaction table
215 void ParseCompactionTable();
216
217 /// @brief Parse global types
218 void ParseGlobalTypes();
219
Reid Spencerf89143c2004-06-29 23:31:01 +0000220 /// @brief Parse a basic block (for LLVM 1.0 basic block blocks)
221 BasicBlock* ParseBasicBlock(unsigned BlockNo);
222
Reid Spencerf89143c2004-06-29 23:31:01 +0000223 /// @brief parse an instruction list (for post LLVM 1.0 instruction lists
224 /// with blocks differentiated by terminating instructions.
225 unsigned ParseInstructionList(
226 Function* F ///< The function into which BBs will be inserted
227 );
Misha Brukman8a96c532005-04-21 21:44:41 +0000228
Reid Spencerf89143c2004-06-29 23:31:01 +0000229 /// @brief Parse a single instruction.
230 void ParseInstruction(
231 std::vector<unsigned>& Args, ///< The arguments to be filled in
232 BasicBlock* BB ///< The BB the instruction goes in
233 );
234
235 /// @brief Parse the whole constant pool
Misha Brukman8a96c532005-04-21 21:44:41 +0000236 void ParseConstantPool(ValueTable& Values, TypeListTy& Types,
Reid Spencera86159c2004-07-04 11:04:56 +0000237 bool isFunction);
Reid Spencerf89143c2004-06-29 23:31:01 +0000238
Chris Lattner3bc5a602006-01-25 23:08:15 +0000239 /// @brief Parse a single constant pool value
240 Value *ParseConstantPoolValue(unsigned TypeID);
Reid Spencerf89143c2004-06-29 23:31:01 +0000241
242 /// @brief Parse a block of types constants
Reid Spencer66906512004-07-11 17:24:05 +0000243 void ParseTypes(TypeListTy &Tab, unsigned NumEntries);
Reid Spencerf89143c2004-06-29 23:31:01 +0000244
245 /// @brief Parse a single type constant
Reid Spencer66906512004-07-11 17:24:05 +0000246 const Type *ParseType();
Reid Spencerf89143c2004-06-29 23:31:01 +0000247
248 /// @brief Parse a string constants block
249 void ParseStringConstants(unsigned NumEntries, ValueTable &Tab);
250
Chris Lattnerf0edc6c2006-10-12 18:32:30 +0000251 /// @brief Release our memory.
252 void freeState() {
253 freeTable(FunctionValues);
254 freeTable(ModuleValues);
255 }
256
Reid Spencerf89143c2004-06-29 23:31:01 +0000257/// @}
258/// @name Data
259/// @{
260private:
Reid Spencer233fe722006-08-22 16:09:19 +0000261 std::string ErrorMsg; ///< A place to hold an error message through longjmp
262 jmp_buf context; ///< Where to return to if an error occurs.
Misha Brukman8a96c532005-04-21 21:44:41 +0000263 char* decompressedBlock; ///< Result of decompression
Reid Spencerf89143c2004-06-29 23:31:01 +0000264 BufPtr MemStart; ///< Start of the memory buffer
265 BufPtr MemEnd; ///< End of the memory buffer
266 BufPtr BlockStart; ///< Start of current block being parsed
267 BufPtr BlockEnd; ///< End of current block being parsed
268 BufPtr At; ///< Where we're currently parsing at
269
Reid Spencera86159c2004-07-04 11:04:56 +0000270 /// Information about the module, extracted from the bytecode revision number.
Chris Lattner45b5dd22004-08-03 23:41:28 +0000271 ///
Reid Spencerf89143c2004-06-29 23:31:01 +0000272 unsigned char RevisionNum; // The rev # itself
273
Chris Lattner45b5dd22004-08-03 23:41:28 +0000274 /// CompactionTypes - If a compaction table is active in the current function,
275 /// this is the mapping that it contains. We keep track of what resolved type
276 /// it is as well as what global type entry it is.
277 std::vector<std::pair<const Type*, unsigned> > CompactionTypes;
Reid Spencerf89143c2004-06-29 23:31:01 +0000278
279 /// @brief If a compaction table is active in the current function,
280 /// this is the mapping that it contains.
281 std::vector<std::vector<Value*> > CompactionValues;
282
283 /// @brief This vector is used to deal with forward references to types in
284 /// a module.
285 TypeListTy ModuleTypes;
Chris Lattnereebac5f2005-10-03 21:26:53 +0000286
287 /// @brief This is an inverse mapping of ModuleTypes from the type to an
288 /// index. Because refining types causes the index of this map to be
289 /// invalidated, any time we refine a type, we clear this cache and recompute
290 /// it next time we need it. These entries are ordered by the pointer value.
291 std::vector<std::pair<const Type*, unsigned> > ModuleTypeIDCache;
Reid Spencerf89143c2004-06-29 23:31:01 +0000292
293 /// @brief This vector is used to deal with forward references to types in
294 /// a function.
295 TypeListTy FunctionTypes;
296
297 /// When the ModuleGlobalInfo section is read, we create a Function object
298 /// for each function in the module. When the function is loaded, after the
299 /// module global info is read, this Function is populated. Until then, the
300 /// functions in this vector just hold the function signature.
301 std::vector<Function*> FunctionSignatureList;
302
303 /// @brief This is the table of values belonging to the current function
304 ValueTable FunctionValues;
305
306 /// @brief This is the table of values belonging to the module (global)
307 ValueTable ModuleValues;
308
309 /// @brief This keeps track of function level forward references.
310 ForwardReferenceMap ForwardReferences;
311
312 /// @brief The basic blocks we've parsed, while parsing a function.
313 std::vector<BasicBlock*> ParsedBasicBlocks;
314
Chris Lattner1c765b02004-10-14 01:49:34 +0000315 /// This maintains a mapping between <Type, Slot #>'s and forward references
316 /// to constants. Such values may be referenced before they are defined, and
317 /// if so, the temporary object that they represent is held here. @brief
318 /// Temporary place for forward references to constants.
Reid Spencerf89143c2004-06-29 23:31:01 +0000319 ConstantRefsType ConstantFwdRefs;
320
321 /// Constant values are read in after global variables. Because of this, we
322 /// must defer setting the initializers on global variables until after module
Chris Lattner1c765b02004-10-14 01:49:34 +0000323 /// level constants have been read. In the mean time, this list keeps track
324 /// of what we must do.
Reid Spencerf89143c2004-06-29 23:31:01 +0000325 GlobalInitsList GlobalInits;
326
327 // For lazy reading-in of functions, we need to save away several pieces of
328 // information about each function: its begin and end pointer in the buffer
329 // and its FunctionSlot.
330 LazyFunctionMap LazyFunctionLoadMap;
331
Misha Brukman8a96c532005-04-21 21:44:41 +0000332 /// This stores the parser's handler which is used for handling tasks other
333 /// just than reading bytecode into the IR. If this is non-null, calls on
334 /// the (polymorphic) BytecodeHandler interface (see llvm/Bytecode/Handler.h)
335 /// will be made to report the logical structure of the bytecode file. What
336 /// the handler does with the events it receives is completely orthogonal to
Reid Spencerf89143c2004-06-29 23:31:01 +0000337 /// the business of parsing the bytecode and building the IR. This is used,
338 /// for example, by the llvm-abcd tool for analysis of byte code.
339 /// @brief Handler for parsing events.
340 BytecodeHandler* Handler;
341
Reid Spencer3e595462006-01-19 06:57:58 +0000342
Reid Spencerf89143c2004-06-29 23:31:01 +0000343/// @}
344/// @name Implementation Details
345/// @{
346private:
347 /// @brief Determines if this module has a function or not.
348 bool hasFunctions() { return ! FunctionSignatureList.empty(); }
349
350 /// @brief Determines if the type id has an implicit null value.
351 bool hasImplicitNull(unsigned TyID );
352
353 /// @brief Converts a type slot number to its Type*
354 const Type *getType(unsigned ID);
355
Reid Spencerd798a512006-11-14 04:47:22 +0000356 /// @brief Read in a type id and turn it into a Type*
357 inline const Type* readType();
Reid Spencera86159c2004-07-04 11:04:56 +0000358
Reid Spencerf89143c2004-06-29 23:31:01 +0000359 /// @brief Converts a Type* to its type slot number
360 unsigned getTypeSlot(const Type *Ty);
361
362 /// @brief Converts a normal type slot number to a compacted type slot num.
363 unsigned getCompactionTypeSlot(unsigned type);
364
Reid Spencera86159c2004-07-04 11:04:56 +0000365 /// @brief Gets the global type corresponding to the TypeId
366 const Type *getGlobalTableType(unsigned TypeId);
Reid Spencerf89143c2004-06-29 23:31:01 +0000367
368 /// This is just like getTypeSlot, but when a compaction table is in use,
Misha Brukman8a96c532005-04-21 21:44:41 +0000369 /// it is ignored.
Reid Spencerf89143c2004-06-29 23:31:01 +0000370 unsigned getGlobalTableTypeSlot(const Type *Ty);
Misha Brukman8a96c532005-04-21 21:44:41 +0000371
Reid Spencera86159c2004-07-04 11:04:56 +0000372 /// @brief Get a value from its typeid and slot number
Reid Spencerf89143c2004-06-29 23:31:01 +0000373 Value* getValue(unsigned TypeID, unsigned num, bool Create = true);
374
Chris Lattner2c6c14d2004-08-04 00:19:23 +0000375 /// @brief Get a value from its type and slot number, ignoring compaction
376 /// tables.
377 Value *getGlobalTableValue(unsigned TyID, unsigned SlotNo);
Reid Spencerf89143c2004-06-29 23:31:01 +0000378
Reid Spencerf89143c2004-06-29 23:31:01 +0000379 /// @brief Get a basic block for current function
380 BasicBlock *getBasicBlock(unsigned ID);
381
Reid Spencera86159c2004-07-04 11:04:56 +0000382 /// @brief Get a constant value from its typeid and value slot.
Reid Spencerf89143c2004-06-29 23:31:01 +0000383 Constant* getConstantValue(unsigned typeSlot, unsigned valSlot);
384
385 /// @brief Convenience function for getting a constant value when
386 /// the Type has already been resolved.
387 Constant* getConstantValue(const Type *Ty, unsigned valSlot) {
388 return getConstantValue(getTypeSlot(Ty), valSlot);
389 }
390
Reid Spencerf89143c2004-06-29 23:31:01 +0000391 /// @brief Insert a newly created value
392 unsigned insertValue(Value *V, unsigned Type, ValueTable &Table);
393
394 /// @brief Insert the arguments of a function.
395 void insertArguments(Function* F );
396
Misha Brukman8a96c532005-04-21 21:44:41 +0000397 /// @brief Resolve all references to the placeholder (if any) for the
Reid Spencerf89143c2004-06-29 23:31:01 +0000398 /// given constant.
Chris Lattner389bd042004-12-09 06:19:44 +0000399 void ResolveReferencesToConstant(Constant *C, unsigned Typ, unsigned Slot);
Reid Spencerf89143c2004-06-29 23:31:01 +0000400
Reid Spencerf89143c2004-06-29 23:31:01 +0000401 /// @brief Free a table, making sure to free the ValueList in the table.
402 void freeTable(ValueTable &Tab) {
403 while (!Tab.empty()) {
404 delete Tab.back();
405 Tab.pop_back();
406 }
407 }
408
Reid Spencer233fe722006-08-22 16:09:19 +0000409 inline void error(const std::string& errmsg);
Reid Spencer24399722004-07-09 22:21:33 +0000410
Reid Spencerf89143c2004-06-29 23:31:01 +0000411 BytecodeReader(const BytecodeReader &); // DO NOT IMPLEMENT
412 void operator=(const BytecodeReader &); // DO NOT IMPLEMENT
413
414/// @}
415/// @name Reader Primitives
416/// @{
417private:
418
419 /// @brief Is there more to parse in the current block?
420 inline bool moreInBlock();
421
422 /// @brief Have we read past the end of the block
423 inline void checkPastBlockEnd(const char * block_name);
424
425 /// @brief Align to 32 bits
426 inline void align32();
427
428 /// @brief Read an unsigned integer as 32-bits
429 inline unsigned read_uint();
430
431 /// @brief Read an unsigned integer with variable bit rate encoding
432 inline unsigned read_vbr_uint();
433
Reid Spencerad89bd62004-07-25 18:07:36 +0000434 /// @brief Read an unsigned integer of no more than 24-bits with variable
435 /// bit rate encoding.
436 inline unsigned read_vbr_uint24();
437
Reid Spencerf89143c2004-06-29 23:31:01 +0000438 /// @brief Read an unsigned 64-bit integer with variable bit rate encoding.
439 inline uint64_t read_vbr_uint64();
440
441 /// @brief Read a signed 64-bit integer with variable bit rate encoding.
442 inline int64_t read_vbr_int64();
443
444 /// @brief Read a string
445 inline std::string read_str();
446
Reid Spencer66906512004-07-11 17:24:05 +0000447 /// @brief Read a float value
448 inline void read_float(float& FloatVal);
449
450 /// @brief Read a double value
451 inline void read_double(double& DoubleVal);
452
Reid Spencerf89143c2004-06-29 23:31:01 +0000453 /// @brief Read an arbitrary data chunk of fixed length
454 inline void read_data(void *Ptr, void *End);
455
Reid Spencera86159c2004-07-04 11:04:56 +0000456 /// @brief Read a bytecode block header
Reid Spencerf89143c2004-06-29 23:31:01 +0000457 inline void read_block(unsigned &Type, unsigned &Size);
Reid Spencerf89143c2004-06-29 23:31:01 +0000458/// @}
459};
460
Reid Spencera86159c2004-07-04 11:04:56 +0000461/// @brief A function for creating a BytecodeAnalzer as a handler
462/// for the Bytecode reader.
Misha Brukman8a96c532005-04-21 21:44:41 +0000463BytecodeHandler* createBytecodeAnalyzerHandler(BytecodeAnalysis& bca,
Reid Spencer572c2562004-08-21 20:50:49 +0000464 std::ostream* output );
Reid Spencera86159c2004-07-04 11:04:56 +0000465
466
Reid Spencerf89143c2004-06-29 23:31:01 +0000467} // End llvm namespace
468
469// vim: sw=2
470#endif