mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2025-10-30 16:17:05 +00:00
e8fdde179d
* Internal rep no longer has a constant pool * Support emission of recursive types * Don't output a constant pool for an external method * The bytecode writer is no longer a module analyzer git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@449 91177308-0d34-0410-b5e6-96231b3b80d8
76 lines
2.3 KiB
C++
76 lines
2.3 KiB
C++
//===-- WriterInternals.h - Data structures shared by the Writer -*- C++ -*--=//
|
|
//
|
|
// This header defines the interface used between components of the bytecode
|
|
// writer.
|
|
//
|
|
// Note that the performance of this library is not terribly important, because
|
|
// it shouldn't be used by JIT type applications... so it is not a huge focus
|
|
// at least. :)
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#ifndef LLVM_LIB_BYTECODE_WRITER_WRITERINTERNALS_H
|
|
#define LLVM_LIB_BYTECODE_WRITER_WRITERINTERNALS_H
|
|
|
|
#include "llvm/Bytecode/Writer.h"
|
|
#include "llvm/Bytecode/Format.h"
|
|
#include "llvm/Analysis/SlotCalculator.h"
|
|
#include "llvm/Bytecode/Primitives.h"
|
|
#include "llvm/Instruction.h"
|
|
#include <deque>
|
|
|
|
class BytecodeWriter {
|
|
deque<unsigned char> &Out;
|
|
SlotCalculator Table;
|
|
public:
|
|
BytecodeWriter(deque<unsigned char> &o, const Module *M);
|
|
|
|
protected:
|
|
void outputConstants(bool isMethod);
|
|
void processMethod(const Method *M);
|
|
void processBasicBlock(const BasicBlock *BB);
|
|
void processInstruction(const Instruction *I);
|
|
|
|
private :
|
|
inline void outputSignature() {
|
|
static const unsigned char *Sig = (const unsigned char*)"llvm";
|
|
Out.insert(Out.end(), Sig, Sig+4); // output the bytecode signature...
|
|
}
|
|
|
|
void outputModuleInfoBlock(const Module *C);
|
|
void outputSymbolTable(const SymbolTable &ST);
|
|
bool outputConstant(const ConstPoolVal *CPV);
|
|
void outputType(const Type *T);
|
|
};
|
|
|
|
|
|
|
|
|
|
// BytecodeBlock - Little helper class that helps us do backpatching of bytecode
|
|
// block sizes really easily. It backpatches when it goes out of scope.
|
|
//
|
|
class BytecodeBlock {
|
|
unsigned Loc;
|
|
deque<unsigned char> &Out;
|
|
|
|
BytecodeBlock(const BytecodeBlock &); // do not implement
|
|
void operator=(const BytecodeBlock &); // do not implement
|
|
public:
|
|
inline BytecodeBlock(unsigned ID, deque<unsigned char> &o) : Out(o) {
|
|
output(ID, Out);
|
|
output((unsigned)0, Out); // Reserve the space for the block size...
|
|
Loc = Out.size();
|
|
}
|
|
|
|
inline ~BytecodeBlock() { // Do backpatch when block goes out
|
|
// of scope...
|
|
//cerr << "OldLoc = " << Loc << " NewLoc = " << NewLoc << " diff = "
|
|
// << (NewLoc-Loc) << endl;
|
|
output((unsigned)(Out.size()-Loc), Out, (int)Loc-4);
|
|
align32(Out); // Blocks must ALWAYS be aligned
|
|
}
|
|
};
|
|
|
|
|
|
#endif
|