2009-05-20 02:12:17 +02:00
|
|
|
/*
|
|
|
|
* Android "Almost" C Compiler.
|
|
|
|
* This is a compiler for a small subset of the C language, intended for use
|
|
|
|
* in scripting environments where speed and memory footprint are important.
|
|
|
|
*
|
|
|
|
* This code is based upon the "unobfuscated" version of the
|
2009-05-22 21:06:27 +02:00
|
|
|
* Obfuscated Tiny C compiler, see the file LICENSE for details.
|
2009-05-20 02:12:17 +02:00
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
2009-05-11 04:59:24 +02:00
|
|
|
#include <ctype.h>
|
|
|
|
#include <dlfcn.h>
|
2009-06-10 00:53:47 +02:00
|
|
|
#include <errno.h>
|
2009-05-10 23:09:03 +02:00
|
|
|
#include <stdarg.h>
|
2009-05-20 21:12:06 +02:00
|
|
|
#include <stdint.h>
|
2009-05-08 22:57:37 +02:00
|
|
|
#include <stdio.h>
|
2009-05-11 04:16:42 +02:00
|
|
|
#include <stdlib.h>
|
|
|
|
#include <string.h>
|
2009-06-08 23:34:26 +02:00
|
|
|
#include <cutils/hashmap.h>
|
2009-05-10 23:09:03 +02:00
|
|
|
|
2009-06-10 00:53:47 +02:00
|
|
|
#if defined(__i386__)
|
|
|
|
#include <sys/mman.h>
|
|
|
|
#endif
|
|
|
|
|
2009-05-14 00:10:04 +02:00
|
|
|
#if defined(__arm__)
|
|
|
|
#include <unistd.h>
|
|
|
|
#endif
|
|
|
|
|
2009-05-20 02:12:17 +02:00
|
|
|
#if defined(__arm__)
|
|
|
|
#define DEFAULT_ARM_CODEGEN
|
2009-05-20 21:12:06 +02:00
|
|
|
#define PROVIDE_ARM_CODEGEN
|
2009-05-20 02:12:17 +02:00
|
|
|
#elif defined(__i386__)
|
|
|
|
#define DEFAULT_X86_CODEGEN
|
2009-05-20 21:12:06 +02:00
|
|
|
#define PROVIDE_X86_CODEGEN
|
2009-05-20 02:12:17 +02:00
|
|
|
#elif defined(__x86_64__)
|
|
|
|
#define DEFAULT_X64_CODEGEN
|
2009-05-20 21:12:06 +02:00
|
|
|
#define PROVIDE_X64_CODEGEN
|
2009-05-20 02:12:17 +02:00
|
|
|
#endif
|
|
|
|
|
|
|
|
#ifdef PROVIDE_ARM_CODEGEN
|
2009-05-14 01:24:17 +02:00
|
|
|
#include "disassem.h"
|
2009-05-20 02:12:17 +02:00
|
|
|
#endif
|
2009-05-14 01:24:17 +02:00
|
|
|
|
2009-05-22 21:06:27 +02:00
|
|
|
#include <acc/acc.h>
|
|
|
|
|
2009-05-27 21:25:55 +02:00
|
|
|
#define LOG_API(...) do {} while(0)
|
|
|
|
// #define LOG_API(...) fprintf (stderr, __VA_ARGS__)
|
|
|
|
|
2009-06-18 04:13:52 +02:00
|
|
|
#define LOG_STACK(...) do {} while(0)
|
|
|
|
// #define LOG_STACK(...) fprintf (stderr, __VA_ARGS__)
|
|
|
|
|
|
|
|
// #define ENABLE_ARM_DISASSEMBLY
|
2009-06-12 06:12:23 +02:00
|
|
|
// #define PROVIDE_TRACE_CODEGEN
|
|
|
|
|
2009-05-11 20:54:30 +02:00
|
|
|
namespace acc {
|
|
|
|
|
2009-07-07 23:48:51 +02:00
|
|
|
// Subset of STL vector.
|
|
|
|
template<class E> class Vector {
|
|
|
|
public:
|
|
|
|
Vector() {
|
|
|
|
mpBase = 0;
|
|
|
|
mUsed = 0;
|
|
|
|
mSize = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
~Vector() {
|
|
|
|
if (mpBase) {
|
|
|
|
for(size_t i = 0; i < mUsed; i++) {
|
|
|
|
mpBase[mUsed].~E();
|
|
|
|
}
|
|
|
|
free(mpBase);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
inline E& operator[](size_t i) {
|
|
|
|
return mpBase[i];
|
|
|
|
}
|
|
|
|
|
|
|
|
inline E& front() {
|
|
|
|
return mpBase[0];
|
|
|
|
}
|
|
|
|
|
|
|
|
inline E& back() {
|
|
|
|
return mpBase[mUsed - 1];
|
|
|
|
}
|
|
|
|
|
|
|
|
void pop_back() {
|
|
|
|
mUsed -= 1;
|
|
|
|
mpBase[mUsed].~E();
|
|
|
|
}
|
|
|
|
|
|
|
|
void push_back(const E& item) {
|
|
|
|
* ensure(1) = item;
|
|
|
|
}
|
|
|
|
|
|
|
|
size_t size() {
|
|
|
|
return mUsed;
|
|
|
|
}
|
|
|
|
|
|
|
|
private:
|
|
|
|
E* ensure(int n) {
|
|
|
|
size_t newUsed = mUsed + n;
|
|
|
|
if (newUsed > mSize) {
|
|
|
|
size_t newSize = mSize * 2 + 10;
|
|
|
|
if (newSize < newUsed) {
|
|
|
|
newSize = newUsed;
|
|
|
|
}
|
|
|
|
mpBase = (E*) realloc(mpBase, sizeof(E) * newSize);
|
|
|
|
mSize = newSize;
|
|
|
|
}
|
|
|
|
E* result = mpBase + mUsed;
|
|
|
|
mUsed = newUsed;
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
E* mpBase;
|
|
|
|
size_t mUsed;
|
|
|
|
size_t mSize;
|
|
|
|
};
|
|
|
|
|
2009-05-29 22:53:44 +02:00
|
|
|
class ErrorSink {
|
|
|
|
public:
|
|
|
|
void error(const char *fmt, ...) {
|
|
|
|
va_list ap;
|
|
|
|
va_start(ap, fmt);
|
|
|
|
verror(fmt, ap);
|
|
|
|
va_end(ap);
|
|
|
|
}
|
|
|
|
|
2009-07-09 01:59:18 +02:00
|
|
|
virtual ~ErrorSink() {}
|
2009-05-29 22:53:44 +02:00
|
|
|
virtual void verror(const char* fmt, va_list ap) = 0;
|
|
|
|
};
|
|
|
|
|
|
|
|
class Compiler : public ErrorSink {
|
2009-07-07 23:48:51 +02:00
|
|
|
typedef int tokenid_t;
|
|
|
|
enum TypeTag {
|
|
|
|
TY_INT, TY_CHAR, TY_VOID, TY_FLOAT, TY_DOUBLE,
|
|
|
|
TY_POINTER, TY_FUNC, TY_PARAM
|
|
|
|
};
|
|
|
|
|
|
|
|
struct Type {
|
|
|
|
TypeTag tag;
|
|
|
|
tokenid_t id; // For function arguments
|
|
|
|
Type* pHead;
|
|
|
|
Type* pTail;
|
|
|
|
};
|
2009-07-07 02:24:34 +02:00
|
|
|
|
2009-05-11 23:49:29 +02:00
|
|
|
class CodeBuf {
|
2009-05-29 02:15:32 +02:00
|
|
|
char* ind; // Output code pointer
|
2009-05-11 23:49:29 +02:00
|
|
|
char* pProgramBase;
|
2009-05-29 22:53:44 +02:00
|
|
|
ErrorSink* mErrorSink;
|
|
|
|
int mSize;
|
2009-06-11 19:53:51 +02:00
|
|
|
bool mOverflowed;
|
2009-05-08 23:54:15 +02:00
|
|
|
|
2009-05-11 23:49:29 +02:00
|
|
|
void release() {
|
|
|
|
if (pProgramBase != 0) {
|
|
|
|
free(pProgramBase);
|
|
|
|
pProgramBase = 0;
|
|
|
|
}
|
|
|
|
}
|
2009-05-08 23:54:15 +02:00
|
|
|
|
2009-06-11 19:53:51 +02:00
|
|
|
bool check(int n) {
|
2009-05-29 22:53:44 +02:00
|
|
|
int newSize = ind - pProgramBase + n;
|
2009-06-11 19:53:51 +02:00
|
|
|
bool overflow = newSize > mSize;
|
|
|
|
if (overflow && !mOverflowed) {
|
|
|
|
mOverflowed = true;
|
2009-05-29 22:53:44 +02:00
|
|
|
if (mErrorSink) {
|
|
|
|
mErrorSink->error("Code too large: %d bytes", newSize);
|
|
|
|
}
|
|
|
|
}
|
2009-06-11 19:53:51 +02:00
|
|
|
return overflow;
|
2009-05-29 22:53:44 +02:00
|
|
|
}
|
|
|
|
|
2009-05-11 23:49:29 +02:00
|
|
|
public:
|
|
|
|
CodeBuf() {
|
|
|
|
pProgramBase = 0;
|
|
|
|
ind = 0;
|
2009-05-29 22:53:44 +02:00
|
|
|
mErrorSink = 0;
|
|
|
|
mSize = 0;
|
2009-06-11 19:53:51 +02:00
|
|
|
mOverflowed = false;
|
2009-05-11 23:49:29 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
~CodeBuf() {
|
|
|
|
release();
|
|
|
|
}
|
2009-05-08 23:54:15 +02:00
|
|
|
|
2009-05-11 23:49:29 +02:00
|
|
|
void init(int size) {
|
|
|
|
release();
|
2009-05-29 22:53:44 +02:00
|
|
|
mSize = size;
|
2009-05-11 23:49:29 +02:00
|
|
|
pProgramBase = (char*) calloc(1, size);
|
|
|
|
ind = pProgramBase;
|
|
|
|
}
|
2009-05-10 23:09:03 +02:00
|
|
|
|
2009-05-29 22:53:44 +02:00
|
|
|
void setErrorSink(ErrorSink* pErrorSink) {
|
|
|
|
mErrorSink = pErrorSink;
|
|
|
|
}
|
|
|
|
|
2009-05-14 00:10:04 +02:00
|
|
|
int o4(int n) {
|
2009-06-11 19:53:51 +02:00
|
|
|
if(check(4)) {
|
|
|
|
return 0;
|
|
|
|
}
|
2009-05-20 21:12:06 +02:00
|
|
|
intptr_t result = (intptr_t) ind;
|
2009-05-14 00:10:04 +02:00
|
|
|
* (int*) ind = n;
|
|
|
|
ind += 4;
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
2009-05-11 23:49:29 +02:00
|
|
|
/*
|
|
|
|
* Output a byte. Handles all values, 0..ff.
|
|
|
|
*/
|
|
|
|
void ob(int n) {
|
2009-06-11 19:53:51 +02:00
|
|
|
if(check(1)) {
|
|
|
|
return;
|
|
|
|
}
|
2009-05-11 23:49:29 +02:00
|
|
|
*ind++ = n;
|
|
|
|
}
|
|
|
|
|
|
|
|
inline void* getBase() {
|
|
|
|
return (void*) pProgramBase;
|
|
|
|
}
|
|
|
|
|
2009-05-20 21:12:06 +02:00
|
|
|
intptr_t getSize() {
|
2009-05-11 23:49:29 +02:00
|
|
|
return ind - pProgramBase;
|
|
|
|
}
|
|
|
|
|
2009-05-20 21:12:06 +02:00
|
|
|
intptr_t getPC() {
|
|
|
|
return (intptr_t) ind;
|
2009-05-11 23:49:29 +02:00
|
|
|
}
|
|
|
|
};
|
|
|
|
|
2009-05-22 21:06:27 +02:00
|
|
|
/**
|
|
|
|
* A code generator creates an in-memory program, generating the code on
|
|
|
|
* the fly. There is one code generator implementation for each supported
|
|
|
|
* architecture.
|
|
|
|
*
|
|
|
|
* The code generator implements the following abstract machine:
|
2009-07-07 02:24:34 +02:00
|
|
|
* R0 - the accumulator.
|
2009-05-22 21:06:27 +02:00
|
|
|
* FP - a frame pointer for accessing function arguments and local
|
|
|
|
* variables.
|
|
|
|
* SP - a stack pointer for storing intermediate results while evaluating
|
|
|
|
* expressions. The stack pointer grows downwards.
|
|
|
|
*
|
|
|
|
* The function calling convention is that all arguments are placed on the
|
|
|
|
* stack such that the first argument has the lowest address.
|
|
|
|
* After the call, the result is in R0. The caller is responsible for
|
|
|
|
* removing the arguments from the stack.
|
2009-07-07 02:24:34 +02:00
|
|
|
* The R0 register is not saved across function calls. The
|
2009-05-22 21:06:27 +02:00
|
|
|
* FP and SP registers are saved.
|
|
|
|
*/
|
|
|
|
|
2009-05-11 23:49:29 +02:00
|
|
|
class CodeGenerator {
|
|
|
|
public:
|
2009-05-29 22:53:44 +02:00
|
|
|
CodeGenerator() {
|
|
|
|
mErrorSink = 0;
|
|
|
|
pCodeBuf = 0;
|
2009-07-07 23:48:51 +02:00
|
|
|
pushType();
|
2009-05-29 22:53:44 +02:00
|
|
|
}
|
2009-05-11 23:49:29 +02:00
|
|
|
virtual ~CodeGenerator() {}
|
|
|
|
|
2009-05-13 19:58:45 +02:00
|
|
|
virtual void init(CodeBuf* pCodeBuf) {
|
2009-05-11 23:49:29 +02:00
|
|
|
this->pCodeBuf = pCodeBuf;
|
2009-05-29 22:53:44 +02:00
|
|
|
pCodeBuf->setErrorSink(mErrorSink);
|
|
|
|
}
|
|
|
|
|
2009-06-12 06:12:23 +02:00
|
|
|
virtual void setErrorSink(ErrorSink* pErrorSink) {
|
2009-05-29 22:53:44 +02:00
|
|
|
mErrorSink = pErrorSink;
|
|
|
|
if (pCodeBuf) {
|
|
|
|
pCodeBuf->setErrorSink(mErrorSink);
|
|
|
|
}
|
2009-05-11 23:49:29 +02:00
|
|
|
}
|
|
|
|
|
2009-05-22 21:06:27 +02:00
|
|
|
/* Emit a function prolog.
|
|
|
|
* argCount is the number of arguments.
|
|
|
|
* Save the old value of the FP.
|
|
|
|
* Set the new value of the FP.
|
|
|
|
* Convert from the native platform calling convention to
|
|
|
|
* our stack-based calling convention. This may require
|
|
|
|
* pushing arguments from registers to the stack.
|
|
|
|
* Allocate "N" bytes of stack space. N isn't known yet, so
|
|
|
|
* just emit the instructions for adjusting the stack, and return
|
|
|
|
* the address to patch up. The patching will be done in
|
|
|
|
* functionExit().
|
|
|
|
* returns address to patch with local variable size.
|
2009-05-13 19:58:45 +02:00
|
|
|
*/
|
2009-05-14 00:10:04 +02:00
|
|
|
virtual int functionEntry(int argCount) = 0;
|
2009-05-13 19:58:45 +02:00
|
|
|
|
2009-05-22 21:06:27 +02:00
|
|
|
/* Emit a function epilog.
|
|
|
|
* Restore the old SP and FP register values.
|
|
|
|
* Return to the calling function.
|
|
|
|
* argCount - the number of arguments to the function.
|
|
|
|
* localVariableAddress - returned from functionEntry()
|
|
|
|
* localVariableSize - the size in bytes of the local variables.
|
|
|
|
*/
|
|
|
|
virtual void functionExit(int argCount, int localVariableAddress,
|
|
|
|
int localVariableSize) = 0;
|
2009-05-13 19:58:45 +02:00
|
|
|
|
2009-05-22 21:06:27 +02:00
|
|
|
/* load immediate value to R0 */
|
2009-07-07 23:48:51 +02:00
|
|
|
virtual void li(int i, Type* pType) = 0;
|
2009-07-07 03:33:20 +02:00
|
|
|
|
2009-07-08 22:04:41 +02:00
|
|
|
/* Load floating point value from global address. */
|
|
|
|
virtual void loadFloat(int address, Type* pType) = 0;
|
2009-05-13 19:58:45 +02:00
|
|
|
|
2009-05-22 21:06:27 +02:00
|
|
|
/* Jump to a target, and return the address of the word that
|
|
|
|
* holds the target data, in case it needs to be fixed up later.
|
|
|
|
*/
|
2009-05-13 19:58:45 +02:00
|
|
|
virtual int gjmp(int t) = 0;
|
|
|
|
|
2009-05-22 21:06:27 +02:00
|
|
|
/* Test R0 and jump to a target if the test succeeds.
|
|
|
|
* l = 0: je, l == 1: jne
|
|
|
|
* Return the address of the word that holds the targed data, in
|
|
|
|
* case it needs to be fixed up later.
|
|
|
|
*/
|
2009-05-13 19:58:45 +02:00
|
|
|
virtual int gtst(bool l, int t) = 0;
|
|
|
|
|
2009-07-07 02:24:34 +02:00
|
|
|
/* Compare TOS against R0, and store the boolean result in R0.
|
|
|
|
* Pops TOS.
|
2009-05-22 21:06:27 +02:00
|
|
|
* op specifies the comparison.
|
|
|
|
*/
|
2009-07-09 05:40:31 +02:00
|
|
|
virtual void gcmp(int op, Type* pResultType) = 0;
|
2009-05-13 19:58:45 +02:00
|
|
|
|
2009-07-07 02:24:34 +02:00
|
|
|
/* Perform the arithmetic op specified by op. TOS is the
|
2009-05-22 21:06:27 +02:00
|
|
|
* left argument, R0 is the right argument.
|
2009-07-07 02:24:34 +02:00
|
|
|
* Pops TOS.
|
2009-05-22 21:06:27 +02:00
|
|
|
*/
|
2009-05-14 00:10:04 +02:00
|
|
|
virtual void genOp(int op) = 0;
|
2009-05-13 19:58:45 +02:00
|
|
|
|
2009-07-07 02:24:34 +02:00
|
|
|
/* Compare 0 against R0, and store the boolean result in R0.
|
|
|
|
* op specifies the comparison.
|
2009-05-22 21:06:27 +02:00
|
|
|
*/
|
2009-07-09 05:40:31 +02:00
|
|
|
virtual void gUnaryCmp(int op, Type* pResultType) = 0;
|
2009-05-13 19:58:45 +02:00
|
|
|
|
2009-07-07 02:24:34 +02:00
|
|
|
/* Perform the arithmetic op specified by op. 0 is the
|
|
|
|
* left argument, R0 is the right argument.
|
2009-05-22 21:06:27 +02:00
|
|
|
*/
|
2009-07-07 02:24:34 +02:00
|
|
|
virtual void genUnaryOp(int op) = 0;
|
2009-05-13 19:58:45 +02:00
|
|
|
|
2009-07-07 02:24:34 +02:00
|
|
|
/* Push R0 onto the stack.
|
2009-05-22 21:06:27 +02:00
|
|
|
*/
|
2009-07-07 02:24:34 +02:00
|
|
|
virtual void pushR0() = 0;
|
2009-05-13 19:58:45 +02:00
|
|
|
|
2009-07-07 02:24:34 +02:00
|
|
|
/* Store R0 to the address stored in TOS.
|
|
|
|
* The TOS is popped.
|
|
|
|
* pPointerType is the type of the pointer (of the input R0).
|
2009-05-22 21:06:27 +02:00
|
|
|
*/
|
2009-07-07 02:24:34 +02:00
|
|
|
virtual void storeR0ToTOS(Type* pPointerType) = 0;
|
2009-05-13 19:58:45 +02:00
|
|
|
|
2009-05-22 21:06:27 +02:00
|
|
|
/* Load R0 from the address stored in R0.
|
2009-07-07 02:24:34 +02:00
|
|
|
* pPointerType is the type of the pointer (of the input R0).
|
2009-05-22 21:06:27 +02:00
|
|
|
*/
|
2009-07-07 02:24:34 +02:00
|
|
|
virtual void loadR0FromR0(Type* pPointerType) = 0;
|
2009-05-13 19:58:45 +02:00
|
|
|
|
2009-05-22 21:06:27 +02:00
|
|
|
/* Load the absolute address of a variable to R0.
|
|
|
|
* If ea <= LOCAL, then this is a local variable, or an
|
|
|
|
* argument, addressed relative to FP.
|
|
|
|
* else it is an absolute global address.
|
|
|
|
*/
|
2009-07-07 23:48:51 +02:00
|
|
|
virtual void leaR0(int ea, Type* pPointerType) = 0;
|
2009-05-13 19:58:45 +02:00
|
|
|
|
2009-05-22 21:06:27 +02:00
|
|
|
/* Store R0 to a variable.
|
|
|
|
* If ea <= LOCAL, then this is a local variable, or an
|
|
|
|
* argument, addressed relative to FP.
|
|
|
|
* else it is an absolute global address.
|
|
|
|
*/
|
2009-07-09 01:48:41 +02:00
|
|
|
virtual void storeR0(int ea, Type* pType) = 0;
|
2009-05-22 21:06:27 +02:00
|
|
|
|
|
|
|
/* load R0 from a variable.
|
|
|
|
* If ea <= LOCAL, then this is a local variable, or an
|
|
|
|
* argument, addressed relative to FP.
|
|
|
|
* else it is an absolute global address.
|
|
|
|
* If isIncDec is true, then the stored variable's value
|
|
|
|
* should be post-incremented or post-decremented, based
|
|
|
|
* on the value of op.
|
|
|
|
*/
|
2009-07-07 23:48:51 +02:00
|
|
|
virtual void loadR0(int ea, bool isIncDec, int op, Type* pType) = 0;
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Convert R0 to the given type.
|
|
|
|
*/
|
|
|
|
virtual void convertR0(Type* pType) = 0;
|
2009-05-13 19:58:45 +02:00
|
|
|
|
2009-05-22 21:06:27 +02:00
|
|
|
/* Emit code to adjust the stack for a function call. Return the
|
|
|
|
* label for the address of the instruction that adjusts the
|
|
|
|
* stack size. This will be passed as argument "a" to
|
|
|
|
* endFunctionCallArguments.
|
|
|
|
*/
|
2009-05-14 20:38:49 +02:00
|
|
|
virtual int beginFunctionCallArguments() = 0;
|
|
|
|
|
2009-05-22 21:06:27 +02:00
|
|
|
/* Emit code to store R0 to the stack at byte offset l.
|
2009-07-08 22:04:41 +02:00
|
|
|
* Returns stack size of object (typically 4 or 8 bytes)
|
2009-05-22 21:06:27 +02:00
|
|
|
*/
|
2009-07-08 22:04:41 +02:00
|
|
|
virtual size_t storeR0ToArg(int l) = 0;
|
2009-05-22 21:06:27 +02:00
|
|
|
|
|
|
|
/* Patch the function call preamble.
|
|
|
|
* a is the address returned from beginFunctionCallArguments
|
|
|
|
* l is the number of bytes the arguments took on the stack.
|
|
|
|
* Typically you would also emit code to convert the argument
|
|
|
|
* list into whatever the native function calling convention is.
|
|
|
|
* On ARM for example you would pop the first 5 arguments into
|
|
|
|
* R0..R4
|
|
|
|
*/
|
2009-05-14 20:38:49 +02:00
|
|
|
virtual void endFunctionCallArguments(int a, int l) = 0;
|
2009-05-13 19:58:45 +02:00
|
|
|
|
2009-05-22 21:06:27 +02:00
|
|
|
/* Emit a call to an unknown function. The argument "symbol" needs to
|
|
|
|
* be stored in the location where the address should go. It forms
|
|
|
|
* a chain. The address will be patched later.
|
|
|
|
* Return the address of the word that has to be patched.
|
|
|
|
*/
|
2009-07-07 23:48:51 +02:00
|
|
|
virtual int callForward(int symbol, Type* pFunc) = 0;
|
2009-05-13 19:58:45 +02:00
|
|
|
|
2009-05-22 21:06:27 +02:00
|
|
|
/* Call a function using PC-relative addressing. t is the PC-relative
|
|
|
|
* address of the function. It has already been adjusted for the
|
|
|
|
* architectural jump offset, so just store it as-is.
|
|
|
|
*/
|
2009-07-07 23:48:51 +02:00
|
|
|
virtual void callRelative(int t, Type* pFunc) = 0;
|
2009-05-13 19:58:45 +02:00
|
|
|
|
2009-05-22 21:06:27 +02:00
|
|
|
/* Call a function pointer. L is the number of bytes the arguments
|
|
|
|
* take on the stack. The address of the function is stored at
|
|
|
|
* location SP + l.
|
|
|
|
*/
|
2009-07-07 23:48:51 +02:00
|
|
|
virtual void callIndirect(int l, Type* pFunc) = 0;
|
2009-05-13 19:58:45 +02:00
|
|
|
|
2009-05-22 21:06:27 +02:00
|
|
|
/* Adjust SP after returning from a function call. l is the
|
|
|
|
* number of bytes of arguments stored on the stack. isIndirect
|
|
|
|
* is true if this was an indirect call. (In which case the
|
|
|
|
* address of the function is stored at location SP + l.)
|
|
|
|
*/
|
2009-05-15 23:31:47 +02:00
|
|
|
virtual void adjustStackAfterCall(int l, bool isIndirect) = 0;
|
2009-05-13 19:58:45 +02:00
|
|
|
|
2009-05-22 21:06:27 +02:00
|
|
|
/* Print a disassembly of the assembled code to out. Return
|
|
|
|
* non-zero if there is an error.
|
|
|
|
*/
|
2009-05-14 01:24:17 +02:00
|
|
|
virtual int disassemble(FILE* out) = 0;
|
|
|
|
|
2009-05-22 21:06:27 +02:00
|
|
|
/* Generate a symbol at the current PC. t is the head of a
|
|
|
|
* linked list of addresses to patch.
|
|
|
|
*/
|
2009-05-20 02:12:17 +02:00
|
|
|
virtual void gsym(int t) = 0;
|
2009-05-11 23:49:29 +02:00
|
|
|
|
2009-05-22 21:06:27 +02:00
|
|
|
/*
|
|
|
|
* Do any cleanup work required at the end of a compile.
|
|
|
|
* For example, an instruction cache might need to be
|
|
|
|
* invalidated.
|
|
|
|
* Return non-zero if there is an error.
|
|
|
|
*/
|
|
|
|
virtual int finishCompile() = 0;
|
2009-05-14 00:10:04 +02:00
|
|
|
|
2009-05-14 01:24:17 +02:00
|
|
|
/**
|
|
|
|
* Adjust relative branches by this amount.
|
|
|
|
*/
|
|
|
|
virtual int jumpOffset() = 0;
|
|
|
|
|
2009-07-07 02:24:34 +02:00
|
|
|
/**
|
2009-07-09 01:48:41 +02:00
|
|
|
* Memory alignment (in bytes) for this type of data
|
2009-07-07 02:24:34 +02:00
|
|
|
*/
|
2009-07-09 01:48:41 +02:00
|
|
|
virtual size_t alignment(Type* type) = 0;
|
2009-07-07 02:24:34 +02:00
|
|
|
|
|
|
|
/**
|
|
|
|
* Array element alignment (in bytes) for this type of data.
|
|
|
|
*/
|
|
|
|
virtual size_t sizeOf(Type* type) = 0;
|
|
|
|
|
2009-07-09 01:48:41 +02:00
|
|
|
/**
|
|
|
|
* Stack argument size of this data type.
|
|
|
|
*/
|
|
|
|
virtual size_t stackSizeOf(Type* pType) = 0;
|
|
|
|
|
2009-07-08 22:04:41 +02:00
|
|
|
virtual Type* getR0Type() {
|
|
|
|
return mExpressionStack.back();
|
|
|
|
}
|
|
|
|
|
2009-05-11 23:49:29 +02:00
|
|
|
protected:
|
|
|
|
/*
|
|
|
|
* Output a byte. Handles all values, 0..ff.
|
|
|
|
*/
|
|
|
|
void ob(int n) {
|
|
|
|
pCodeBuf->ob(n);
|
|
|
|
}
|
|
|
|
|
2009-05-20 21:12:06 +02:00
|
|
|
intptr_t o4(int data) {
|
2009-05-20 02:12:17 +02:00
|
|
|
return pCodeBuf->o4(data);
|
2009-05-11 23:49:29 +02:00
|
|
|
}
|
|
|
|
|
2009-05-20 21:12:06 +02:00
|
|
|
intptr_t getBase() {
|
|
|
|
return (intptr_t) pCodeBuf->getBase();
|
2009-05-14 01:24:17 +02:00
|
|
|
}
|
|
|
|
|
2009-05-20 21:12:06 +02:00
|
|
|
intptr_t getPC() {
|
2009-05-11 23:49:29 +02:00
|
|
|
return pCodeBuf->getPC();
|
|
|
|
}
|
2009-05-22 21:06:27 +02:00
|
|
|
|
|
|
|
intptr_t getSize() {
|
|
|
|
return pCodeBuf->getSize();
|
|
|
|
}
|
2009-05-29 22:53:44 +02:00
|
|
|
|
|
|
|
void error(const char* fmt,...) {
|
|
|
|
va_list ap;
|
|
|
|
va_start(ap, fmt);
|
|
|
|
mErrorSink->verror(fmt, ap);
|
|
|
|
va_end(ap);
|
|
|
|
}
|
2009-07-07 02:24:34 +02:00
|
|
|
|
|
|
|
void assert(bool test) {
|
|
|
|
if (!test) {
|
2009-07-08 22:04:41 +02:00
|
|
|
* (char*) 0 = 0;
|
2009-07-07 02:24:34 +02:00
|
|
|
error("code generator assertion failed.");
|
|
|
|
}
|
|
|
|
}
|
2009-07-07 23:48:51 +02:00
|
|
|
|
|
|
|
void setR0Type(Type* pType) {
|
|
|
|
mExpressionStack.back() = pType;
|
|
|
|
}
|
|
|
|
|
|
|
|
Type* getTOSType() {
|
|
|
|
return mExpressionStack[mExpressionStack.size()-2];
|
|
|
|
}
|
|
|
|
|
|
|
|
void pushType() {
|
|
|
|
mExpressionStack.push_back(NULL);
|
|
|
|
}
|
|
|
|
|
|
|
|
void popType() {
|
|
|
|
mExpressionStack.pop_back();
|
|
|
|
}
|
|
|
|
|
|
|
|
bool bitsSame(Type* pA, Type* pB) {
|
|
|
|
return collapseType(pA->tag) == collapseType(pB->tag);
|
|
|
|
}
|
|
|
|
|
|
|
|
TypeTag collapseType(TypeTag tag) {
|
|
|
|
static const TypeTag collapsedTag[] = {
|
|
|
|
TY_INT, TY_INT, TY_VOID, TY_FLOAT, TY_DOUBLE, TY_INT,
|
|
|
|
TY_VOID, TY_VOID};
|
|
|
|
return collapsedTag[tag];
|
|
|
|
}
|
|
|
|
|
2009-07-08 22:04:41 +02:00
|
|
|
TypeTag collapseTypeR0() {
|
|
|
|
return collapseType(getR0Type()->tag);
|
|
|
|
}
|
|
|
|
|
|
|
|
bool isFloatType(Type* pType) {
|
2009-07-08 23:51:31 +02:00
|
|
|
return isFloatTag(pType->tag);
|
|
|
|
}
|
|
|
|
|
|
|
|
bool isFloatTag(TypeTag tag) {
|
2009-07-08 22:04:41 +02:00
|
|
|
return tag == TY_FLOAT || tag == TY_DOUBLE;
|
|
|
|
}
|
|
|
|
|
2009-05-11 23:49:29 +02:00
|
|
|
private:
|
2009-07-07 23:48:51 +02:00
|
|
|
Vector<Type*> mExpressionStack;
|
2009-05-11 23:49:29 +02:00
|
|
|
CodeBuf* pCodeBuf;
|
2009-05-29 22:53:44 +02:00
|
|
|
ErrorSink* mErrorSink;
|
2009-05-11 23:49:29 +02:00
|
|
|
};
|
|
|
|
|
2009-05-20 02:12:17 +02:00
|
|
|
#ifdef PROVIDE_ARM_CODEGEN
|
|
|
|
|
2009-05-13 19:58:45 +02:00
|
|
|
class ARMCodeGenerator : public CodeGenerator {
|
|
|
|
public:
|
|
|
|
ARMCodeGenerator() {}
|
2009-06-18 04:13:52 +02:00
|
|
|
|
2009-05-13 19:58:45 +02:00
|
|
|
virtual ~ARMCodeGenerator() {}
|
|
|
|
|
|
|
|
/* returns address to patch with local variable size
|
|
|
|
*/
|
2009-05-14 00:10:04 +02:00
|
|
|
virtual int functionEntry(int argCount) {
|
2009-06-05 04:56:13 +02:00
|
|
|
LOG_API("functionEntry(%d);\n", argCount);
|
2009-06-18 04:13:52 +02:00
|
|
|
mStackUse = 0;
|
2009-05-15 00:42:26 +02:00
|
|
|
// sp -> arg4 arg5 ...
|
|
|
|
// Push our register-based arguments back on the stack
|
|
|
|
if (argCount > 0) {
|
|
|
|
int regArgCount = argCount <= 4 ? argCount : 4;
|
|
|
|
o4(0xE92D0000 | ((1 << argCount) - 1)); // stmfd sp!, {}
|
2009-06-18 04:13:52 +02:00
|
|
|
mStackUse += regArgCount * 4;
|
2009-05-15 00:42:26 +02:00
|
|
|
}
|
|
|
|
// sp -> arg0 arg1 ...
|
|
|
|
o4(0xE92D4800); // stmfd sp!, {fp, lr}
|
2009-06-18 04:13:52 +02:00
|
|
|
mStackUse += 2 * 4;
|
2009-05-15 00:42:26 +02:00
|
|
|
// sp, fp -> oldfp, retadr, arg0 arg1 ....
|
|
|
|
o4(0xE1A0B00D); // mov fp, sp
|
2009-06-18 04:13:52 +02:00
|
|
|
LOG_STACK("functionEntry: %d\n", mStackUse);
|
2009-05-15 00:42:26 +02:00
|
|
|
return o4(0xE24DD000); // sub sp, sp, # <local variables>
|
2009-06-18 04:13:52 +02:00
|
|
|
// We don't know how many local variables we are going to use,
|
|
|
|
// but we will round the allocation up to a multiple of
|
|
|
|
// STACK_ALIGNMENT, so it won't affect the stack alignment.
|
2009-05-14 00:10:04 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
virtual void functionExit(int argCount, int localVariableAddress, int localVariableSize) {
|
2009-05-27 21:25:55 +02:00
|
|
|
LOG_API("functionExit(%d, %d, %d);\n", argCount, localVariableAddress, localVariableSize);
|
2009-06-18 04:13:52 +02:00
|
|
|
// Round local variable size up to a multiple of stack alignment
|
|
|
|
localVariableSize = ((localVariableSize + STACK_ALIGNMENT - 1) /
|
|
|
|
STACK_ALIGNMENT) * STACK_ALIGNMENT;
|
2009-05-15 00:42:26 +02:00
|
|
|
// Patch local variable allocation code:
|
|
|
|
if (localVariableSize < 0 || localVariableSize > 255) {
|
2009-05-15 02:21:45 +02:00
|
|
|
error("localVariables out of range: %d", localVariableSize);
|
2009-05-14 00:10:04 +02:00
|
|
|
}
|
2009-05-15 00:42:26 +02:00
|
|
|
*(char*) (localVariableAddress) = localVariableSize;
|
|
|
|
|
|
|
|
// sp -> locals .... fp -> oldfp, retadr, arg0, arg1, ...
|
|
|
|
o4(0xE1A0E00B); // mov lr, fp
|
|
|
|
o4(0xE59BB000); // ldr fp, [fp]
|
|
|
|
o4(0xE28ED004); // add sp, lr, #4
|
|
|
|
// sp -> retadr, arg0, ...
|
|
|
|
o4(0xE8BD4000); // ldmfd sp!, {lr}
|
|
|
|
// sp -> arg0 ....
|
|
|
|
if (argCount > 0) {
|
|
|
|
// We store the PC into the lr so we can adjust the sp before
|
2009-05-15 02:21:45 +02:00
|
|
|
// returning. We need to pull off the registers we pushed
|
2009-05-15 00:42:26 +02:00
|
|
|
// earlier. We don't need to actually store them anywhere,
|
|
|
|
// just adjust the stack.
|
|
|
|
int regArgCount = argCount <= 4 ? argCount : 4;
|
|
|
|
o4(0xE28DD000 | (regArgCount << 2)); // add sp, sp, #argCount << 2
|
|
|
|
}
|
|
|
|
o4(0xE12FFF1E); // bx lr
|
2009-05-13 19:58:45 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/* load immediate value */
|
2009-07-07 23:48:51 +02:00
|
|
|
virtual void li(int t, Type* pType) {
|
2009-05-27 21:25:55 +02:00
|
|
|
LOG_API("li(%d);\n", t);
|
2009-05-14 01:24:17 +02:00
|
|
|
if (t >= 0 && t < 255) {
|
2009-05-15 00:42:26 +02:00
|
|
|
o4(0xE3A00000 + t); // mov r0, #0
|
2009-05-14 01:24:17 +02:00
|
|
|
} else if (t >= -256 && t < 0) {
|
|
|
|
// mvn means move constant ^ ~0
|
2009-05-15 00:42:26 +02:00
|
|
|
o4(0xE3E00001 - t); // mvn r0, #0
|
2009-05-14 01:24:17 +02:00
|
|
|
} else {
|
2009-05-14 20:38:49 +02:00
|
|
|
o4(0xE51F0000); // ldr r0, .L3
|
|
|
|
o4(0xEA000000); // b .L99
|
|
|
|
o4(t); // .L3: .word 0
|
|
|
|
// .L99:
|
2009-05-14 01:24:17 +02:00
|
|
|
}
|
2009-07-07 23:48:51 +02:00
|
|
|
setR0Type(pType);
|
2009-05-13 19:58:45 +02:00
|
|
|
}
|
|
|
|
|
2009-07-08 22:04:41 +02:00
|
|
|
virtual void loadFloat(int address, Type* pType) {
|
|
|
|
error("Unimplemented.\n");
|
2009-07-07 23:48:51 +02:00
|
|
|
setR0Type(pType);
|
2009-07-07 03:33:20 +02:00
|
|
|
}
|
|
|
|
|
2009-05-13 19:58:45 +02:00
|
|
|
virtual int gjmp(int t) {
|
2009-05-27 21:25:55 +02:00
|
|
|
LOG_API("gjmp(%d);\n", t);
|
2009-05-15 02:21:45 +02:00
|
|
|
return o4(0xEA000000 | encodeAddress(t)); // b .L33
|
2009-05-13 19:58:45 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/* l = 0: je, l == 1: jne */
|
|
|
|
virtual int gtst(bool l, int t) {
|
2009-05-27 21:25:55 +02:00
|
|
|
LOG_API("gtst(%d, %d);\n", l, t);
|
2009-05-15 02:21:45 +02:00
|
|
|
o4(0xE3500000); // cmp r0,#0
|
|
|
|
int branch = l ? 0x1A000000 : 0x0A000000; // bne : beq
|
|
|
|
return o4(branch | encodeAddress(t));
|
2009-05-13 19:58:45 +02:00
|
|
|
}
|
|
|
|
|
2009-07-09 05:40:31 +02:00
|
|
|
virtual void gcmp(int op, Type* pResultType) {
|
2009-05-27 21:25:55 +02:00
|
|
|
LOG_API("gcmp(%d);\n", op);
|
2009-07-07 02:24:34 +02:00
|
|
|
o4(0xE8BD0002); // ldmfd sp!,{r1}
|
|
|
|
mStackUse -= 4;
|
2009-05-15 02:21:45 +02:00
|
|
|
o4(0xE1510000); // cmp r1, r1
|
|
|
|
switch(op) {
|
|
|
|
case OP_EQUALS:
|
|
|
|
o4(0x03A00001); // moveq r0,#1
|
|
|
|
o4(0x13A00000); // movne r0,#0
|
|
|
|
break;
|
|
|
|
case OP_NOT_EQUALS:
|
|
|
|
o4(0x03A00000); // moveq r0,#0
|
|
|
|
o4(0x13A00001); // movne r0,#1
|
|
|
|
break;
|
|
|
|
case OP_LESS_EQUAL:
|
|
|
|
o4(0xD3A00001); // movle r0,#1
|
|
|
|
o4(0xC3A00000); // movgt r0,#0
|
|
|
|
break;
|
|
|
|
case OP_GREATER:
|
|
|
|
o4(0xD3A00000); // movle r0,#0
|
|
|
|
o4(0xC3A00001); // movgt r0,#1
|
|
|
|
break;
|
|
|
|
case OP_GREATER_EQUAL:
|
|
|
|
o4(0xA3A00001); // movge r0,#1
|
|
|
|
o4(0xB3A00000); // movlt r0,#0
|
|
|
|
break;
|
|
|
|
case OP_LESS:
|
|
|
|
o4(0xA3A00000); // movge r0,#0
|
|
|
|
o4(0xB3A00001); // movlt r0,#1
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
error("Unknown comparison op %d", op);
|
|
|
|
break;
|
|
|
|
}
|
2009-07-07 23:48:51 +02:00
|
|
|
popType();
|
2009-05-13 19:58:45 +02:00
|
|
|
}
|
|
|
|
|
2009-05-14 00:10:04 +02:00
|
|
|
virtual void genOp(int op) {
|
2009-05-27 21:25:55 +02:00
|
|
|
LOG_API("genOp(%d);\n", op);
|
2009-07-07 02:24:34 +02:00
|
|
|
o4(0xE8BD0002); // ldmfd sp!,{r1}
|
|
|
|
mStackUse -= 4;
|
2009-05-14 20:38:49 +02:00
|
|
|
switch(op) {
|
|
|
|
case OP_MUL:
|
|
|
|
o4(0x0E0000091); // mul r0,r1,r0
|
|
|
|
break;
|
2009-05-16 00:12:38 +02:00
|
|
|
case OP_DIV:
|
|
|
|
callRuntime(runtime_DIV);
|
|
|
|
break;
|
|
|
|
case OP_MOD:
|
|
|
|
callRuntime(runtime_MOD);
|
|
|
|
break;
|
2009-05-14 20:38:49 +02:00
|
|
|
case OP_PLUS:
|
|
|
|
o4(0xE0810000); // add r0,r1,r0
|
|
|
|
break;
|
|
|
|
case OP_MINUS:
|
|
|
|
o4(0xE0410000); // sub r0,r1,r0
|
|
|
|
break;
|
|
|
|
case OP_SHIFT_LEFT:
|
|
|
|
o4(0xE1A00011); // lsl r0,r1,r0
|
|
|
|
break;
|
|
|
|
case OP_SHIFT_RIGHT:
|
|
|
|
o4(0xE1A00051); // asr r0,r1,r0
|
|
|
|
break;
|
|
|
|
case OP_BIT_AND:
|
|
|
|
o4(0xE0010000); // and r0,r1,r0
|
|
|
|
break;
|
|
|
|
case OP_BIT_XOR:
|
|
|
|
o4(0xE0210000); // eor r0,r1,r0
|
|
|
|
break;
|
|
|
|
case OP_BIT_OR:
|
|
|
|
o4(0xE1810000); // orr r0,r1,r0
|
|
|
|
break;
|
|
|
|
case OP_BIT_NOT:
|
|
|
|
o4(0xE1E00000); // mvn r0, r0
|
|
|
|
break;
|
|
|
|
default:
|
2009-05-15 00:42:26 +02:00
|
|
|
error("Unimplemented op %d\n", op);
|
2009-05-14 20:38:49 +02:00
|
|
|
break;
|
|
|
|
}
|
2009-07-07 23:48:51 +02:00
|
|
|
popType();
|
2009-05-13 19:58:45 +02:00
|
|
|
}
|
|
|
|
|
2009-07-09 05:40:31 +02:00
|
|
|
virtual void gUnaryCmp(int op, Type* pResultType) {
|
|
|
|
LOG_API("gUnaryCmp(%d);\n", op);
|
2009-05-14 20:38:49 +02:00
|
|
|
o4(0xE3A01000); // mov r1, #0
|
2009-07-07 02:24:34 +02:00
|
|
|
o4(0xE1510000); // cmp r1, r1
|
|
|
|
switch(op) {
|
2009-07-09 05:40:31 +02:00
|
|
|
case OP_LOGICAL_NOT:
|
2009-07-07 02:24:34 +02:00
|
|
|
o4(0x03A00000); // moveq r0,#0
|
|
|
|
o4(0x13A00001); // movne r0,#1
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
error("Unknown unary comparison op %d", op);
|
|
|
|
break;
|
|
|
|
}
|
2009-07-09 05:40:31 +02:00
|
|
|
setR0Type(pResultType);
|
2009-07-07 02:24:34 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
virtual void genUnaryOp(int op) {
|
|
|
|
LOG_API("genOp(%d);\n", op);
|
|
|
|
switch(op) {
|
|
|
|
case OP_MINUS:
|
|
|
|
o4(0xE3A01000); // mov r1, #0
|
|
|
|
o4(0xE0410000); // sub r0,r1,r0
|
|
|
|
break;
|
|
|
|
case OP_BIT_NOT:
|
|
|
|
o4(0xE1E00000); // mvn r0, r0
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
error("Unknown unary op %d\n", op);
|
|
|
|
break;
|
|
|
|
}
|
2009-05-13 19:58:45 +02:00
|
|
|
}
|
|
|
|
|
2009-05-22 21:06:27 +02:00
|
|
|
virtual void pushR0() {
|
2009-05-27 21:25:55 +02:00
|
|
|
LOG_API("pushR0();\n");
|
2009-05-14 20:38:49 +02:00
|
|
|
o4(0xE92D0001); // stmfd sp!,{r0}
|
2009-06-18 04:13:52 +02:00
|
|
|
mStackUse += 4;
|
2009-07-07 23:48:51 +02:00
|
|
|
pushType();
|
2009-06-18 04:13:52 +02:00
|
|
|
LOG_STACK("pushR0: %d\n", mStackUse);
|
2009-05-13 19:58:45 +02:00
|
|
|
}
|
|
|
|
|
2009-07-07 02:24:34 +02:00
|
|
|
virtual void storeR0ToTOS(Type* pPointerType) {
|
|
|
|
LOG_API("storeR0ToTOS(%d);\n", isInt);
|
|
|
|
assert(pPointerType->tag == TY_POINTER);
|
2009-05-14 20:38:49 +02:00
|
|
|
o4(0xE8BD0002); // ldmfd sp!,{r1}
|
2009-06-18 04:13:52 +02:00
|
|
|
mStackUse -= 4;
|
2009-07-07 02:24:34 +02:00
|
|
|
switch (pPointerType->pHead->tag) {
|
|
|
|
case TY_INT:
|
|
|
|
o4(0xE5810000); // str r0, [r1]
|
|
|
|
break;
|
|
|
|
case TY_CHAR:
|
|
|
|
o4(0xE5C10000); // strb r0, [r1]
|
|
|
|
break;
|
|
|
|
default:
|
2009-07-07 23:48:51 +02:00
|
|
|
error("storeR0ToTOS: unimplemented type");
|
2009-07-07 02:24:34 +02:00
|
|
|
break;
|
2009-05-15 04:35:31 +02:00
|
|
|
}
|
2009-07-07 23:48:51 +02:00
|
|
|
popType();
|
2009-05-13 19:58:45 +02:00
|
|
|
}
|
|
|
|
|
2009-07-07 02:24:34 +02:00
|
|
|
virtual void loadR0FromR0(Type* pPointerType) {
|
|
|
|
LOG_API("loadR0FromR0(%d);\n", pPointerType);
|
|
|
|
assert(pPointerType->tag == TY_POINTER);
|
|
|
|
switch (pPointerType->pHead->tag) {
|
|
|
|
case TY_INT:
|
|
|
|
o4(0xE5900000); // ldr r0, [r0]
|
|
|
|
break;
|
|
|
|
case TY_CHAR:
|
|
|
|
o4(0xE5D00000); // ldrb r0, [r0]
|
|
|
|
break;
|
|
|
|
default:
|
2009-07-07 23:48:51 +02:00
|
|
|
error("loadR0FromR0: unimplemented type");
|
2009-07-07 02:24:34 +02:00
|
|
|
break;
|
|
|
|
}
|
2009-07-07 23:48:51 +02:00
|
|
|
setR0Type(pPointerType->pHead);
|
2009-05-13 19:58:45 +02:00
|
|
|
}
|
|
|
|
|
2009-07-07 23:48:51 +02:00
|
|
|
virtual void leaR0(int ea, Type* pPointerType) {
|
2009-05-27 21:25:55 +02:00
|
|
|
LOG_API("leaR0(%d);\n", ea);
|
2009-05-15 22:30:00 +02:00
|
|
|
if (ea < LOCAL) {
|
|
|
|
// Local, fp relative
|
|
|
|
if (ea < -1023 || ea > 1023 || ((ea & 3) != 0)) {
|
|
|
|
error("Offset out of range: %08x", ea);
|
|
|
|
}
|
|
|
|
if (ea < 0) {
|
|
|
|
o4(0xE24B0F00 | (0xff & ((-ea) >> 2))); // sub r0, fp, #ea
|
|
|
|
} else {
|
|
|
|
o4(0xE28B0F00 | (0xff & (ea >> 2))); // add r0, fp, #ea
|
|
|
|
}
|
2009-05-15 04:35:31 +02:00
|
|
|
} else {
|
2009-05-15 22:30:00 +02:00
|
|
|
// Global, absolute.
|
|
|
|
o4(0xE59F0000); // ldr r0, .L1
|
|
|
|
o4(0xEA000000); // b .L99
|
|
|
|
o4(ea); // .L1: .word 0
|
|
|
|
// .L99:
|
2009-05-15 04:35:31 +02:00
|
|
|
}
|
2009-07-07 23:48:51 +02:00
|
|
|
setR0Type(pPointerType);
|
2009-05-13 19:58:45 +02:00
|
|
|
}
|
|
|
|
|
2009-07-09 01:48:41 +02:00
|
|
|
virtual void storeR0(int ea, Type* pType) {
|
2009-05-27 21:25:55 +02:00
|
|
|
LOG_API("storeR0(%d);\n", ea);
|
2009-05-15 22:30:00 +02:00
|
|
|
if (ea < LOCAL) {
|
|
|
|
// Local, fp relative
|
|
|
|
if (ea < -4095 || ea > 4095) {
|
|
|
|
error("Offset out of range: %08x", ea);
|
|
|
|
}
|
|
|
|
if (ea < 0) {
|
|
|
|
o4(0xE50B0000 | (0xfff & (-ea))); // str r0, [fp,#-ea]
|
|
|
|
} else {
|
|
|
|
o4(0xE58B0000 | (0xfff & ea)); // str r0, [fp,#ea]
|
|
|
|
}
|
|
|
|
} else{
|
|
|
|
// Global, absolute
|
|
|
|
o4(0xE59F1000); // ldr r1, .L1
|
|
|
|
o4(0xEA000000); // b .L99
|
|
|
|
o4(ea); // .L1: .word 0
|
|
|
|
o4(0xE5810000); // .L99: str r0, [r1]
|
2009-05-15 00:42:26 +02:00
|
|
|
}
|
2009-05-13 19:58:45 +02:00
|
|
|
}
|
|
|
|
|
2009-07-07 23:48:51 +02:00
|
|
|
virtual void loadR0(int ea, bool isIncDec, int op, Type* pType) {
|
2009-07-08 22:04:41 +02:00
|
|
|
LOG_API("loadR0(%d, %d, %d, %d);\n", ea, isIncDec, op, pType);
|
2009-05-15 22:30:00 +02:00
|
|
|
if (ea < LOCAL) {
|
|
|
|
// Local, fp relative
|
|
|
|
if (ea < -4095 || ea > 4095) {
|
|
|
|
error("Offset out of range: %08x", ea);
|
|
|
|
}
|
|
|
|
if (ea < 0) {
|
|
|
|
o4(0xE51B0000 | (0xfff & (-ea))); // ldr r0, [fp,#-ea]
|
|
|
|
} else {
|
|
|
|
o4(0xE59B0000 | (0xfff & ea)); // ldr r0, [fp,#ea]
|
|
|
|
}
|
2009-05-15 00:42:26 +02:00
|
|
|
} else {
|
2009-05-15 22:30:00 +02:00
|
|
|
// Global, absolute
|
|
|
|
o4(0xE59F2000); // ldr r2, .L1
|
|
|
|
o4(0xEA000000); // b .L99
|
|
|
|
o4(ea); // .L1: .word ea
|
|
|
|
o4(0xE5920000); // .L99: ldr r0, [r2]
|
2009-05-15 00:42:26 +02:00
|
|
|
}
|
2009-05-13 19:58:45 +02:00
|
|
|
|
2009-05-15 22:30:00 +02:00
|
|
|
if (isIncDec) {
|
|
|
|
switch (op) {
|
|
|
|
case OP_INCREMENT:
|
|
|
|
o4(0xE2801001); // add r1, r0, #1
|
|
|
|
break;
|
|
|
|
case OP_DECREMENT:
|
|
|
|
o4(0xE2401001); // sub r1, r0, #1
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
error("unknown opcode: %d", op);
|
|
|
|
}
|
|
|
|
if (ea < LOCAL) {
|
|
|
|
// Local, fp relative
|
|
|
|
// Don't need range check, was already checked above
|
|
|
|
if (ea < 0) {
|
|
|
|
o4(0xE50B1000 | (0xfff & (-ea))); // str r1, [fp,#-ea]
|
|
|
|
} else {
|
|
|
|
o4(0xE58B1000 | (0xfff & ea)); // str r1, [fp,#ea]
|
|
|
|
}
|
|
|
|
} else{
|
|
|
|
// Global, absolute
|
|
|
|
// r2 is already set up from before.
|
|
|
|
o4(0xE5821000); // str r1, [r2]
|
|
|
|
}
|
2009-05-15 04:35:31 +02:00
|
|
|
}
|
2009-07-07 23:48:51 +02:00
|
|
|
setR0Type(pType);
|
|
|
|
}
|
|
|
|
|
|
|
|
virtual void convertR0(Type* pType){
|
2009-07-08 22:04:41 +02:00
|
|
|
Type* pR0Type = getR0Type();
|
|
|
|
if (bitsSame(pType, pR0Type)) {
|
|
|
|
// do nothing special
|
|
|
|
} else if (isFloatType(pType) && isFloatType(pR0Type)) {
|
|
|
|
// do nothing special, both held in same register on x87.
|
|
|
|
} else {
|
|
|
|
error("Incompatible types old: %d new: %d",
|
|
|
|
pR0Type->tag, pType->tag);
|
2009-07-07 23:48:51 +02:00
|
|
|
}
|
2009-07-08 22:04:41 +02:00
|
|
|
setR0Type(pType);
|
2009-05-13 19:58:45 +02:00
|
|
|
}
|
|
|
|
|
2009-05-14 20:38:49 +02:00
|
|
|
virtual int beginFunctionCallArguments() {
|
2009-05-27 21:25:55 +02:00
|
|
|
LOG_API("beginFunctionCallArguments();\n");
|
2009-05-14 20:38:49 +02:00
|
|
|
return o4(0xE24DDF00); // Placeholder
|
|
|
|
}
|
|
|
|
|
2009-07-08 22:04:41 +02:00
|
|
|
virtual size_t storeR0ToArg(int l) {
|
2009-05-27 21:25:55 +02:00
|
|
|
LOG_API("storeR0ToArg(%d);\n", l);
|
2009-05-15 23:31:47 +02:00
|
|
|
if (l < 0 || l > 4096-4) {
|
|
|
|
error("l out of range for stack offset: 0x%08x", l);
|
|
|
|
}
|
|
|
|
o4(0xE58D0000 + l); // str r0, [sp, #4]
|
2009-07-08 22:04:41 +02:00
|
|
|
return 4;
|
2009-05-15 23:31:47 +02:00
|
|
|
}
|
|
|
|
|
2009-05-14 20:38:49 +02:00
|
|
|
virtual void endFunctionCallArguments(int a, int l) {
|
2009-05-27 21:25:55 +02:00
|
|
|
LOG_API("endFunctionCallArguments(0x%08x, %d);\n", a, l);
|
2009-05-14 20:38:49 +02:00
|
|
|
int argCount = l >> 2;
|
2009-06-18 04:13:52 +02:00
|
|
|
int argumentStackUse = l;
|
2009-05-14 20:38:49 +02:00
|
|
|
if (argCount > 0) {
|
|
|
|
int regArgCount = argCount > 4 ? 4 : argCount;
|
2009-06-18 04:13:52 +02:00
|
|
|
argumentStackUse -= regArgCount * 4;
|
2009-05-14 20:38:49 +02:00
|
|
|
o4(0xE8BD0000 | ((1 << regArgCount) - 1)); // ldmfd sp!,{}
|
|
|
|
}
|
2009-06-18 04:13:52 +02:00
|
|
|
mStackUse += argumentStackUse;
|
|
|
|
|
|
|
|
// Align stack.
|
|
|
|
int missalignment = mStackUse - ((mStackUse / STACK_ALIGNMENT)
|
|
|
|
* STACK_ALIGNMENT);
|
|
|
|
mStackAlignmentAdjustment = 0;
|
|
|
|
if (missalignment > 0) {
|
|
|
|
mStackAlignmentAdjustment = STACK_ALIGNMENT - missalignment;
|
|
|
|
}
|
|
|
|
l += mStackAlignmentAdjustment;
|
|
|
|
|
|
|
|
if (l < 0 || l > 0x3FC) {
|
|
|
|
error("L out of range for stack adjustment: 0x%08x", l);
|
|
|
|
}
|
|
|
|
* (int*) a = 0xE24DDF00 | (l >> 2); // sub sp, sp, #0 << 2
|
|
|
|
mStackUse += mStackAlignmentAdjustment;
|
|
|
|
LOG_STACK("endFunctionCallArguments mStackUse: %d, mStackAlignmentAdjustment %d\n",
|
|
|
|
mStackUse, mStackAlignmentAdjustment);
|
2009-05-13 19:58:45 +02:00
|
|
|
}
|
|
|
|
|
2009-07-07 23:48:51 +02:00
|
|
|
virtual int callForward(int symbol, Type* pFunc) {
|
2009-05-27 21:25:55 +02:00
|
|
|
LOG_API("callForward(%d);\n", symbol);
|
2009-07-07 23:48:51 +02:00
|
|
|
setR0Type(pFunc->pHead);
|
2009-05-14 20:38:49 +02:00
|
|
|
// Forward calls are always short (local)
|
|
|
|
return o4(0xEB000000 | encodeAddress(symbol));
|
2009-05-13 19:58:45 +02:00
|
|
|
}
|
|
|
|
|
2009-07-07 23:48:51 +02:00
|
|
|
virtual void callRelative(int t, Type* pFunc) {
|
2009-05-27 21:25:55 +02:00
|
|
|
LOG_API("callRelative(%d);\n", t);
|
2009-07-07 23:48:51 +02:00
|
|
|
setR0Type(pFunc->pHead);
|
2009-05-14 20:38:49 +02:00
|
|
|
int abs = t + getPC() + jumpOffset();
|
2009-05-29 22:53:44 +02:00
|
|
|
LOG_API("abs=%d (0x%08x)\n", abs, abs);
|
2009-05-14 20:38:49 +02:00
|
|
|
if (t >= - (1 << 25) && t < (1 << 25)) {
|
|
|
|
o4(0xEB000000 | encodeAddress(t));
|
|
|
|
} else {
|
|
|
|
// Long call.
|
|
|
|
o4(0xE59FC000); // ldr r12, .L1
|
|
|
|
o4(0xEA000000); // b .L99
|
2009-05-15 04:35:31 +02:00
|
|
|
o4(t - 12); // .L1: .word 0
|
2009-05-14 20:38:49 +02:00
|
|
|
o4(0xE08CC00F); // .L99: add r12,pc
|
|
|
|
o4(0xE12FFF3C); // blx r12
|
|
|
|
}
|
2009-05-13 19:58:45 +02:00
|
|
|
}
|
|
|
|
|
2009-07-07 23:48:51 +02:00
|
|
|
virtual void callIndirect(int l, Type* pFunc) {
|
2009-05-27 21:25:55 +02:00
|
|
|
LOG_API("callIndirect(%d);\n", l);
|
2009-07-07 23:48:51 +02:00
|
|
|
setR0Type(pFunc->pHead);
|
2009-05-15 23:31:47 +02:00
|
|
|
int argCount = l >> 2;
|
|
|
|
int poppedArgs = argCount > 4 ? 4 : argCount;
|
2009-06-18 04:13:52 +02:00
|
|
|
int adjustedL = l - (poppedArgs << 2) + mStackAlignmentAdjustment;
|
2009-05-15 23:31:47 +02:00
|
|
|
if (adjustedL < 0 || adjustedL > 4096-4) {
|
|
|
|
error("l out of range for stack offset: 0x%08x", l);
|
|
|
|
}
|
|
|
|
o4(0xE59DC000 | (0xfff & adjustedL)); // ldr r12, [sp,#adjustedL]
|
|
|
|
o4(0xE12FFF3C); // blx r12
|
2009-05-13 19:58:45 +02:00
|
|
|
}
|
|
|
|
|
2009-05-15 23:31:47 +02:00
|
|
|
virtual void adjustStackAfterCall(int l, bool isIndirect) {
|
2009-05-27 21:25:55 +02:00
|
|
|
LOG_API("adjustStackAfterCall(%d, %d);\n", l, isIndirect);
|
2009-05-14 20:38:49 +02:00
|
|
|
int argCount = l >> 2;
|
2009-05-15 23:31:47 +02:00
|
|
|
int stackArgs = argCount > 4 ? argCount - 4 : 0;
|
2009-06-18 04:13:52 +02:00
|
|
|
int stackUse = stackArgs + (isIndirect ? 1 : 0)
|
|
|
|
+ (mStackAlignmentAdjustment >> 2);
|
2009-05-15 23:31:47 +02:00
|
|
|
if (stackUse) {
|
|
|
|
if (stackUse < 0 || stackUse > 255) {
|
|
|
|
error("L out of range for stack adjustment: 0x%08x", l);
|
|
|
|
}
|
|
|
|
o4(0xE28DDF00 | stackUse); // add sp, sp, #stackUse << 2
|
2009-06-18 04:13:52 +02:00
|
|
|
mStackUse -= stackUse * 4;
|
|
|
|
LOG_STACK("adjustStackAfterCall: %d\n", mStackUse);
|
2009-05-14 20:38:49 +02:00
|
|
|
}
|
2009-05-13 19:58:45 +02:00
|
|
|
}
|
|
|
|
|
2009-05-14 01:24:17 +02:00
|
|
|
virtual int jumpOffset() {
|
2009-05-15 04:35:31 +02:00
|
|
|
return 8;
|
2009-05-14 01:24:17 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/* output a symbol and patch all calls to it */
|
|
|
|
virtual void gsym(int t) {
|
2009-05-27 21:25:55 +02:00
|
|
|
LOG_API("gsym(0x%x)\n", t);
|
2009-05-14 01:24:17 +02:00
|
|
|
int n;
|
|
|
|
int base = getBase();
|
|
|
|
int pc = getPC();
|
2009-05-27 21:25:55 +02:00
|
|
|
LOG_API("pc = 0x%x\n", pc);
|
2009-05-14 01:24:17 +02:00
|
|
|
while (t) {
|
|
|
|
int data = * (int*) t;
|
|
|
|
int decodedOffset = ((BRANCH_REL_ADDRESS_MASK & data) << 2);
|
|
|
|
if (decodedOffset == 0) {
|
|
|
|
n = 0;
|
|
|
|
} else {
|
|
|
|
n = base + decodedOffset; /* next value */
|
|
|
|
}
|
|
|
|
*(int *) t = (data & ~BRANCH_REL_ADDRESS_MASK)
|
|
|
|
| encodeRelAddress(pc - t - 8);
|
|
|
|
t = n;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-05-22 21:06:27 +02:00
|
|
|
virtual int finishCompile() {
|
|
|
|
#if defined(__arm__)
|
|
|
|
const long base = long(getBase());
|
|
|
|
const long curr = long(getPC());
|
|
|
|
int err = cacheflush(base, curr, 0);
|
|
|
|
return err;
|
|
|
|
#else
|
|
|
|
return 0;
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
2009-05-14 01:24:17 +02:00
|
|
|
virtual int disassemble(FILE* out) {
|
2009-05-27 21:25:55 +02:00
|
|
|
#ifdef ENABLE_ARM_DISASSEMBLY
|
|
|
|
disasmOut = out;
|
2009-05-14 01:24:17 +02:00
|
|
|
disasm_interface_t di;
|
|
|
|
di.di_readword = disassemble_readword;
|
|
|
|
di.di_printaddr = disassemble_printaddr;
|
|
|
|
di.di_printf = disassemble_printf;
|
|
|
|
|
|
|
|
int base = getBase();
|
|
|
|
int pc = getPC();
|
|
|
|
for(int i = base; i < pc; i += 4) {
|
|
|
|
fprintf(out, "%08x: %08x ", i, *(int*) i);
|
|
|
|
::disasm(&di, i, 0);
|
|
|
|
}
|
2009-05-27 21:25:55 +02:00
|
|
|
#endif
|
2009-05-14 01:24:17 +02:00
|
|
|
return 0;
|
|
|
|
}
|
2009-05-15 23:31:47 +02:00
|
|
|
|
2009-07-07 02:24:34 +02:00
|
|
|
/**
|
2009-07-09 01:48:41 +02:00
|
|
|
* alignment (in bytes) for this type of data
|
2009-07-07 02:24:34 +02:00
|
|
|
*/
|
2009-07-09 01:48:41 +02:00
|
|
|
virtual size_t alignment(Type* pType){
|
2009-07-07 02:24:34 +02:00
|
|
|
switch(pType->tag) {
|
|
|
|
case TY_DOUBLE:
|
|
|
|
return 8;
|
|
|
|
default:
|
|
|
|
return 4;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Array element alignment (in bytes) for this type of data.
|
|
|
|
*/
|
|
|
|
virtual size_t sizeOf(Type* pType){
|
|
|
|
switch(pType->tag) {
|
|
|
|
case TY_INT:
|
|
|
|
return 4;
|
|
|
|
case TY_CHAR:
|
|
|
|
return 1;
|
|
|
|
default:
|
|
|
|
return 0;
|
|
|
|
case TY_FLOAT:
|
|
|
|
return 4;
|
|
|
|
case TY_DOUBLE:
|
|
|
|
return 8;
|
|
|
|
case TY_POINTER:
|
|
|
|
return 4;
|
|
|
|
}
|
|
|
|
}
|
2009-07-09 01:48:41 +02:00
|
|
|
|
|
|
|
virtual size_t stackSizeOf(Type* pType) {
|
|
|
|
switch(pType->tag) {
|
|
|
|
case TY_DOUBLE:
|
|
|
|
return 8;
|
|
|
|
default:
|
|
|
|
return 4;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-05-13 19:58:45 +02:00
|
|
|
private:
|
2009-05-14 01:24:17 +02:00
|
|
|
static FILE* disasmOut;
|
|
|
|
|
|
|
|
static u_int
|
|
|
|
disassemble_readword(u_int address)
|
|
|
|
{
|
|
|
|
return(*((u_int *)address));
|
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
|
|
|
disassemble_printaddr(u_int address)
|
|
|
|
{
|
|
|
|
fprintf(disasmOut, "0x%08x", address);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
|
|
|
disassemble_printf(const char *fmt, ...) {
|
|
|
|
va_list ap;
|
|
|
|
va_start(ap, fmt);
|
|
|
|
vfprintf(disasmOut, fmt, ap);
|
|
|
|
va_end(ap);
|
|
|
|
}
|
|
|
|
|
|
|
|
static const int BRANCH_REL_ADDRESS_MASK = 0x00ffffff;
|
|
|
|
|
|
|
|
/** Encode a relative address that might also be
|
|
|
|
* a label.
|
|
|
|
*/
|
|
|
|
int encodeAddress(int value) {
|
|
|
|
int base = getBase();
|
|
|
|
if (value >= base && value <= getPC() ) {
|
|
|
|
// This is a label, encode it relative to the base.
|
|
|
|
value = value - base;
|
|
|
|
}
|
|
|
|
return encodeRelAddress(value);
|
|
|
|
}
|
|
|
|
|
|
|
|
int encodeRelAddress(int value) {
|
|
|
|
return BRANCH_REL_ADDRESS_MASK & (value >> 2);
|
|
|
|
}
|
2009-05-13 19:58:45 +02:00
|
|
|
|
2009-05-16 00:12:38 +02:00
|
|
|
typedef int (*int2FnPtr)(int a, int b);
|
|
|
|
void callRuntime(int2FnPtr fn) {
|
|
|
|
o4(0xE59F2000); // ldr r2, .L1
|
|
|
|
o4(0xEA000000); // b .L99
|
|
|
|
o4((int) fn); //.L1: .word fn
|
|
|
|
o4(0xE12FFF32); //.L99: blx r2
|
|
|
|
}
|
|
|
|
|
|
|
|
static int runtime_DIV(int a, int b) {
|
|
|
|
return b / a;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int runtime_MOD(int a, int b) {
|
|
|
|
return b % a;
|
|
|
|
}
|
2009-06-18 04:13:52 +02:00
|
|
|
|
|
|
|
static const int STACK_ALIGNMENT = 8;
|
|
|
|
int mStackUse;
|
|
|
|
// This variable holds the amount we adjusted the stack in the most
|
|
|
|
// recent endFunctionCallArguments call. It's examined by the
|
|
|
|
// following adjustStackAfterCall call.
|
|
|
|
int mStackAlignmentAdjustment;
|
2009-05-13 19:58:45 +02:00
|
|
|
};
|
|
|
|
|
2009-05-27 21:25:55 +02:00
|
|
|
#endif // PROVIDE_ARM_CODEGEN
|
2009-05-20 02:12:17 +02:00
|
|
|
|
|
|
|
#ifdef PROVIDE_X86_CODEGEN
|
|
|
|
|
2009-05-11 23:49:29 +02:00
|
|
|
class X86CodeGenerator : public CodeGenerator {
|
|
|
|
public:
|
|
|
|
X86CodeGenerator() {}
|
|
|
|
virtual ~X86CodeGenerator() {}
|
|
|
|
|
2009-05-12 21:48:35 +02:00
|
|
|
/* returns address to patch with local variable size
|
|
|
|
*/
|
2009-05-14 00:10:04 +02:00
|
|
|
virtual int functionEntry(int argCount) {
|
2009-05-12 21:48:35 +02:00
|
|
|
o(0xe58955); /* push %ebp, mov %esp, %ebp */
|
|
|
|
return oad(0xec81, 0); /* sub $xxx, %esp */
|
|
|
|
}
|
|
|
|
|
2009-05-14 00:10:04 +02:00
|
|
|
virtual void functionExit(int argCount, int localVariableAddress, int localVariableSize) {
|
2009-05-12 21:48:35 +02:00
|
|
|
o(0xc3c9); /* leave, ret */
|
2009-05-14 00:10:04 +02:00
|
|
|
*(int *) localVariableAddress = localVariableSize; /* save local variables */
|
2009-05-12 21:48:35 +02:00
|
|
|
}
|
|
|
|
|
2009-05-11 23:49:29 +02:00
|
|
|
/* load immediate value */
|
2009-07-07 23:48:51 +02:00
|
|
|
virtual void li(int i, Type* pType) {
|
2009-07-07 03:33:20 +02:00
|
|
|
oad(0xb8, i); /* mov $xx, %eax */
|
2009-07-07 23:48:51 +02:00
|
|
|
setR0Type(pType);
|
2009-07-07 03:33:20 +02:00
|
|
|
}
|
|
|
|
|
2009-07-08 22:04:41 +02:00
|
|
|
virtual void loadFloat(int address, Type* pType) {
|
2009-07-07 23:48:51 +02:00
|
|
|
setR0Type(pType);
|
2009-07-08 22:04:41 +02:00
|
|
|
switch (pType->tag) {
|
|
|
|
case TY_FLOAT:
|
|
|
|
oad(0x05D9, address); // flds
|
|
|
|
break;
|
|
|
|
case TY_DOUBLE:
|
|
|
|
oad(0x05DD, address); // fldl
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
assert(false);
|
|
|
|
break;
|
|
|
|
}
|
2009-05-11 23:49:29 +02:00
|
|
|
}
|
|
|
|
|
2009-05-13 19:58:45 +02:00
|
|
|
virtual int gjmp(int t) {
|
2009-05-11 23:49:29 +02:00
|
|
|
return psym(0xe9, t);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* l = 0: je, l == 1: jne */
|
2009-05-13 19:58:45 +02:00
|
|
|
virtual int gtst(bool l, int t) {
|
2009-05-11 23:49:29 +02:00
|
|
|
o(0x0fc085); /* test %eax, %eax, je/jne xxx */
|
|
|
|
return psym(0x84 + l, t);
|
|
|
|
}
|
|
|
|
|
2009-07-09 05:40:31 +02:00
|
|
|
virtual void gcmp(int op, Type* pResultType) {
|
|
|
|
Type* pR0Type = getR0Type();
|
|
|
|
Type* pTOSType = getTOSType();
|
|
|
|
TypeTag tagR0 = pR0Type->tag;
|
|
|
|
TypeTag tagTOS = pTOSType->tag;
|
|
|
|
bool isFloatR0 = isFloatTag(tagR0);
|
|
|
|
bool isFloatTOS = isFloatTag(tagTOS);
|
|
|
|
if (!isFloatR0 && !isFloatTOS) {
|
|
|
|
int t = decodeOp(op);
|
|
|
|
o(0x59); /* pop %ecx */
|
|
|
|
o(0xc139); /* cmp %eax,%ecx */
|
|
|
|
li(0, NULL);
|
|
|
|
o(0x0f); /* setxx %al */
|
|
|
|
o(t + 0x90);
|
|
|
|
o(0xc0);
|
|
|
|
popType();
|
|
|
|
} else {
|
|
|
|
setupFloatOperands();
|
|
|
|
switch (op) {
|
|
|
|
case OP_EQUALS:
|
|
|
|
o(0xe9da); // fucompp
|
|
|
|
o(0xe0df); // fnstsw %ax
|
|
|
|
o(0x9e); // sahf
|
|
|
|
o(0xc0940f); // sete %al
|
|
|
|
o(0xc29b0f); // setnp %dl
|
|
|
|
o(0xd021); // andl %edx, %eax
|
|
|
|
break;
|
|
|
|
case OP_NOT_EQUALS:
|
|
|
|
o(0xe9da); // fucompp
|
|
|
|
o(0xe0df); // fnstsw %ax
|
|
|
|
o(0x9e); // sahf
|
|
|
|
o(0xc0950f); // setne %al
|
|
|
|
o(0xc29a0f); // setp %dl
|
|
|
|
o(0xd009); // orl %edx, %eax
|
|
|
|
break;
|
|
|
|
case OP_GREATER_EQUAL:
|
|
|
|
o(0xe9da); // fucompp
|
|
|
|
o(0xe0df); // fnstsw %ax
|
|
|
|
o(0x05c4f6); // testb $5, %ah
|
|
|
|
o(0xc0940f); // sete %al
|
|
|
|
break;
|
|
|
|
case OP_LESS:
|
|
|
|
o(0xc9d9); // fxch %st(1)
|
|
|
|
o(0xe9da); // fucompp
|
|
|
|
o(0xe0df); // fnstsw %ax
|
|
|
|
o(0x9e); // sahf
|
|
|
|
o(0xc0970f); // seta %al
|
|
|
|
break;
|
|
|
|
case OP_LESS_EQUAL:
|
|
|
|
o(0xc9d9); // fxch %st(1)
|
|
|
|
o(0xe9da); // fucompp
|
|
|
|
o(0xe0df); // fnstsw %ax
|
|
|
|
o(0x9e); // sahf
|
|
|
|
o(0xc0930f); // setea %al
|
|
|
|
break;
|
|
|
|
case OP_GREATER:
|
|
|
|
o(0xe9da); // fucompp
|
|
|
|
o(0xe0df); // fnstsw %ax
|
|
|
|
o(0x45c4f6); // testb $69, %ah
|
|
|
|
o(0xc0940f); // sete %al
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
error("Unknown comparison op");
|
|
|
|
}
|
|
|
|
o(0xc0b60f); // movzbl %al, %eax
|
|
|
|
}
|
|
|
|
setR0Type(pResultType);
|
2009-05-11 23:49:29 +02:00
|
|
|
}
|
|
|
|
|
2009-05-14 00:10:04 +02:00
|
|
|
virtual void genOp(int op) {
|
2009-07-09 05:40:31 +02:00
|
|
|
Type* pR0Type = getR0Type();
|
|
|
|
Type* pTOSType = getTOSType();
|
|
|
|
TypeTag tagR0 = pR0Type->tag;
|
|
|
|
TypeTag tagTOS = pTOSType->tag;
|
|
|
|
bool isFloatR0 = isFloatTag(tagR0);
|
|
|
|
bool isFloatTOS = isFloatTag(tagTOS);
|
|
|
|
if (!isFloatR0 && !isFloatTOS) {
|
|
|
|
// TODO: Deal with pointer arithmetic
|
|
|
|
o(0x59); /* pop %ecx */
|
|
|
|
o(decodeOp(op));
|
|
|
|
if (op == OP_MOD)
|
|
|
|
o(0x92); /* xchg %edx, %eax */
|
|
|
|
popType();
|
|
|
|
} else {
|
|
|
|
Type* pResultType = tagR0 > tagTOS ? pR0Type : pTOSType;
|
|
|
|
setupFloatOperands();
|
|
|
|
// Both float. x87 R0 == left hand, x87 R1 == right hand
|
|
|
|
switch (op) {
|
|
|
|
case OP_MUL:
|
|
|
|
o(0xc9de); // fmulp
|
|
|
|
break;
|
|
|
|
case OP_DIV:
|
|
|
|
o(0xf1de); // fdivp
|
|
|
|
break;
|
|
|
|
case OP_PLUS:
|
|
|
|
o(0xc1de); // faddp
|
|
|
|
break;
|
|
|
|
case OP_MINUS:
|
|
|
|
o(0xe1de); // fsubp
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
error("Unsupported binary floating operation.");
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
popType();
|
|
|
|
setR0Type(pResultType);
|
|
|
|
printf("genop: result type %d\n", pResultType->tag);
|
|
|
|
}
|
2009-05-12 21:48:35 +02:00
|
|
|
}
|
|
|
|
|
2009-07-09 05:40:31 +02:00
|
|
|
|
|
|
|
|
|
|
|
virtual void gUnaryCmp(int op, Type* pResultType) {
|
|
|
|
if (op != OP_LOGICAL_NOT) {
|
|
|
|
error("Unknown unary cmp %d", op);
|
|
|
|
} else {
|
|
|
|
Type* pR0Type = getR0Type();
|
|
|
|
TypeTag tag = collapseType(pR0Type->tag);
|
|
|
|
switch(tag) {
|
|
|
|
case TY_INT: {
|
|
|
|
oad(0xb9, 0); /* movl $0, %ecx */
|
|
|
|
int t = decodeOp(op);
|
|
|
|
o(0xc139); /* cmp %eax,%ecx */
|
|
|
|
li(0, NULL);
|
|
|
|
o(0x0f); /* setxx %al */
|
|
|
|
o(t + 0x90);
|
|
|
|
o(0xc0);
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
case TY_FLOAT:
|
|
|
|
case TY_DOUBLE:
|
|
|
|
o(0xeed9); // fldz
|
|
|
|
o(0xe9da); // fucompp
|
|
|
|
o(0xe0df); // fnstsw %ax
|
|
|
|
o(0x9e); // sahf
|
|
|
|
o(0xc0950f); // setne %al
|
|
|
|
o(0xc29a0f); // setp %dl
|
|
|
|
o(0xd009); // orl %edx, %eax
|
|
|
|
o(0xc0b60f); // movzbl %al, %eax
|
|
|
|
o(0x01f083); // xorl $1, %eax
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
error("genUnaryCmp unsupported type");
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
setR0Type(pResultType);
|
2009-07-07 02:24:34 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
virtual void genUnaryOp(int op) {
|
2009-07-09 05:40:31 +02:00
|
|
|
Type* pR0Type = getR0Type();
|
|
|
|
TypeTag tag = collapseType(pR0Type->tag);
|
|
|
|
switch(tag) {
|
|
|
|
case TY_INT:
|
|
|
|
oad(0xb9, 0); /* movl $0, %ecx */
|
|
|
|
o(decodeOp(op));
|
|
|
|
break;
|
|
|
|
case TY_FLOAT:
|
|
|
|
case TY_DOUBLE:
|
|
|
|
switch (op) {
|
|
|
|
case OP_MINUS:
|
|
|
|
o(0xe0d9); // fchs
|
|
|
|
break;
|
|
|
|
case OP_BIT_NOT:
|
|
|
|
error("Can't apply '~' operator to a float or double.");
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
error("Unknown unary op %d\n", op);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
error("genUnaryOp unsupported type");
|
|
|
|
break;
|
|
|
|
}
|
2009-05-11 23:49:29 +02:00
|
|
|
}
|
|
|
|
|
2009-05-22 21:06:27 +02:00
|
|
|
virtual void pushR0() {
|
2009-07-09 01:48:41 +02:00
|
|
|
Type* pR0Type = getR0Type();
|
|
|
|
TypeTag r0ct = collapseType(pR0Type->tag);
|
|
|
|
switch(r0ct) {
|
|
|
|
case TY_INT:
|
|
|
|
o(0x50); /* push %eax */
|
|
|
|
break;
|
|
|
|
case TY_FLOAT:
|
|
|
|
o(0x50); /* push %eax */
|
|
|
|
o(0x241cd9); // fstps 0(%esp)
|
|
|
|
break;
|
|
|
|
case TY_DOUBLE:
|
|
|
|
o(0x50); /* push %eax */
|
|
|
|
o(0x50); /* push %eax */
|
|
|
|
o(0x241cdd); // fstpl 0(%esp)
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
error("pushR0 %d", r0ct);
|
|
|
|
break;
|
|
|
|
}
|
2009-07-07 23:48:51 +02:00
|
|
|
pushType();
|
2009-05-11 23:49:29 +02:00
|
|
|
}
|
|
|
|
|
2009-07-07 02:24:34 +02:00
|
|
|
virtual void storeR0ToTOS(Type* pPointerType) {
|
|
|
|
assert(pPointerType->tag == TY_POINTER);
|
2009-05-11 23:49:29 +02:00
|
|
|
o(0x59); /* pop %ecx */
|
2009-07-07 23:48:51 +02:00
|
|
|
popType();
|
2009-07-07 02:24:34 +02:00
|
|
|
switch (pPointerType->pHead->tag) {
|
|
|
|
case TY_INT:
|
|
|
|
o(0x0189); /* movl %eax/%al, (%ecx) */
|
|
|
|
break;
|
|
|
|
case TY_CHAR:
|
|
|
|
o(0x0188); /* movl %eax/%al, (%ecx) */
|
|
|
|
break;
|
2009-07-09 01:48:41 +02:00
|
|
|
case TY_FLOAT:
|
|
|
|
o(0x19d9); /* fstps (%ecx) */
|
|
|
|
break;
|
|
|
|
case TY_DOUBLE:
|
|
|
|
o(0x19dd); /* fstpl (%ecx) */
|
|
|
|
break;
|
2009-07-07 02:24:34 +02:00
|
|
|
default:
|
2009-07-07 23:48:51 +02:00
|
|
|
error("storeR0ToTOS: unsupported type");
|
2009-07-07 02:24:34 +02:00
|
|
|
break;
|
|
|
|
}
|
2009-05-12 21:48:35 +02:00
|
|
|
}
|
|
|
|
|
2009-07-07 02:24:34 +02:00
|
|
|
virtual void loadR0FromR0(Type* pPointerType) {
|
|
|
|
assert(pPointerType->tag == TY_POINTER);
|
|
|
|
switch (pPointerType->pHead->tag) {
|
|
|
|
case TY_INT:
|
|
|
|
o(0x8b); /* mov (%eax), %eax */
|
|
|
|
break;
|
|
|
|
case TY_CHAR:
|
|
|
|
o(0xbe0f); /* movsbl (%eax), %eax */
|
|
|
|
break;
|
|
|
|
default:
|
2009-07-07 23:48:51 +02:00
|
|
|
error("loadR0FromR0: unsupported type");
|
2009-07-07 02:24:34 +02:00
|
|
|
break;
|
|
|
|
}
|
2009-05-11 23:49:29 +02:00
|
|
|
ob(0); /* add zero in code */
|
2009-07-07 23:48:51 +02:00
|
|
|
setR0Type(pPointerType->pHead);
|
2009-05-11 23:49:29 +02:00
|
|
|
}
|
|
|
|
|
2009-07-07 23:48:51 +02:00
|
|
|
virtual void leaR0(int ea, Type* pPointerType) {
|
2009-05-11 23:49:29 +02:00
|
|
|
gmov(10, ea); /* leal EA, %eax */
|
2009-07-07 23:48:51 +02:00
|
|
|
setR0Type(pPointerType);
|
2009-05-11 23:49:29 +02:00
|
|
|
}
|
|
|
|
|
2009-07-09 01:48:41 +02:00
|
|
|
virtual void storeR0(int ea, Type* pType) {
|
|
|
|
TypeTag tag = pType->tag;
|
|
|
|
switch (tag) {
|
|
|
|
case TY_INT:
|
|
|
|
gmov(6, ea); /* mov %eax, EA */
|
|
|
|
break;
|
|
|
|
case TY_FLOAT:
|
|
|
|
if (ea < -LOCAL || ea > LOCAL) {
|
|
|
|
oad(0x1dd9, ea); // fstps ea
|
|
|
|
} else {
|
|
|
|
oad(0x9dd9, ea); // fstps ea(%ebp)
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
case TY_DOUBLE:
|
|
|
|
if (ea < -LOCAL || ea > LOCAL) {
|
|
|
|
oad(0x1ddd, ea); // fstpl ea
|
|
|
|
} else {
|
|
|
|
oad(0x9ddd, ea); // fstpl ea(%ebp)
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
error("Unable to store to type %d", tag);
|
|
|
|
break;
|
|
|
|
}
|
2009-05-11 23:49:29 +02:00
|
|
|
}
|
|
|
|
|
2009-07-07 23:48:51 +02:00
|
|
|
virtual void loadR0(int ea, bool isIncDec, int op, Type* pType) {
|
2009-07-08 23:51:31 +02:00
|
|
|
TypeTag tag = collapseType(pType->tag);
|
|
|
|
switch (tag) {
|
|
|
|
case TY_INT:
|
|
|
|
gmov(8, ea); /* mov EA, %eax */
|
|
|
|
if (isIncDec) {
|
|
|
|
/* Implement post-increment or post decrement.
|
|
|
|
*/
|
|
|
|
gmov(0, ea); /* 83 ADD */
|
|
|
|
o(decodeOp(op));
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
case TY_FLOAT:
|
|
|
|
if (ea < -LOCAL || ea > LOCAL) {
|
|
|
|
oad(0x05d9, ea); // flds ea
|
|
|
|
} else {
|
|
|
|
oad(0x85d9, ea); // flds ea(%ebp)
|
|
|
|
}
|
|
|
|
if (isIncDec) {
|
|
|
|
error("inc/dec not implemented for float.");
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
case TY_DOUBLE:
|
|
|
|
if (ea < -LOCAL || ea > LOCAL) {
|
|
|
|
oad(0x05dd, ea); // fldl ea
|
|
|
|
} else {
|
|
|
|
oad(0x85dd, ea); // fldl ea(%ebp)
|
|
|
|
}
|
|
|
|
if (isIncDec) {
|
|
|
|
error("inc/dec not implemented for double.");
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
error("Unable to load type %d", tag);
|
|
|
|
break;
|
2009-05-15 22:30:00 +02:00
|
|
|
}
|
2009-07-07 23:48:51 +02:00
|
|
|
setR0Type(pType);
|
|
|
|
}
|
|
|
|
|
|
|
|
virtual void convertR0(Type* pType){
|
2009-07-08 22:04:41 +02:00
|
|
|
Type* pR0Type = getR0Type();
|
|
|
|
if (pR0Type == NULL) {
|
2009-07-08 23:51:31 +02:00
|
|
|
assert(false);
|
2009-07-08 22:04:41 +02:00
|
|
|
setR0Type(pType);
|
2009-07-07 23:48:51 +02:00
|
|
|
return;
|
|
|
|
}
|
2009-07-08 22:04:41 +02:00
|
|
|
if (bitsSame(pType, pR0Type)) {
|
|
|
|
// do nothing special
|
|
|
|
} else if (isFloatType(pType) && isFloatType(pR0Type)) {
|
|
|
|
// do nothing special, both held in same register on x87.
|
|
|
|
} else {
|
2009-07-08 23:51:31 +02:00
|
|
|
TypeTag r0Tag = collapseType(pR0Type->tag);
|
|
|
|
TypeTag destTag = collapseType(pType->tag);
|
|
|
|
if (r0Tag == TY_INT && isFloatTag(destTag)) {
|
|
|
|
// Convert R0 from int to float
|
|
|
|
o(0x50); // push %eax
|
|
|
|
o(0x2404DB); // fildl 0(%esp)
|
|
|
|
o(0x58); // pop %eax
|
|
|
|
} else if (isFloatTag(r0Tag) && destTag == TY_INT) {
|
|
|
|
// Convert R0 from float to int. Complicated because
|
|
|
|
// need to save and restore the rounding mode.
|
|
|
|
o(0x50); // push %eax
|
|
|
|
o(0x50); // push %eax
|
|
|
|
o(0x02247cD9); // fnstcw 2(%esp)
|
|
|
|
o(0x2444b70f); // movzwl 2(%esp), %eax
|
|
|
|
o(0x02);
|
|
|
|
o(0x0cb4); // movb $12, %ah
|
|
|
|
o(0x24048966); // movw %ax, 0(%esp)
|
|
|
|
o(0x242cd9); // fldcw 0(%esp)
|
|
|
|
o(0x04245cdb); // fistpl 4(%esp)
|
|
|
|
o(0x02246cd9); // fldcw 2(%esp)
|
|
|
|
o(0x58); // pop %eax
|
|
|
|
o(0x58); // pop %eax
|
|
|
|
} else {
|
|
|
|
error("Incompatible types old: %d new: %d",
|
|
|
|
pR0Type->tag, pType->tag);
|
|
|
|
}
|
2009-07-08 22:04:41 +02:00
|
|
|
}
|
|
|
|
setR0Type(pType);
|
2009-05-11 23:49:29 +02:00
|
|
|
}
|
|
|
|
|
2009-05-14 20:38:49 +02:00
|
|
|
virtual int beginFunctionCallArguments() {
|
2009-05-11 23:49:29 +02:00
|
|
|
return oad(0xec81, 0); /* sub $xxx, %esp */
|
|
|
|
}
|
|
|
|
|
2009-07-08 22:04:41 +02:00
|
|
|
virtual size_t storeR0ToArg(int l) {
|
|
|
|
Type* pR0Type = getR0Type();
|
|
|
|
TypeTag r0ct = collapseType(pR0Type->tag);
|
|
|
|
switch(r0ct) {
|
|
|
|
case TY_INT:
|
|
|
|
oad(0x248489, l); /* movl %eax, xxx(%esp) */
|
|
|
|
return 4;
|
|
|
|
case TY_FLOAT:
|
|
|
|
oad(0x249CD9, l); /* fstps xxx(%esp) */
|
|
|
|
return 4;
|
|
|
|
case TY_DOUBLE:
|
|
|
|
oad(0x249CDD, l); /* fstpl xxx(%esp) */
|
|
|
|
return 8;
|
|
|
|
default:
|
|
|
|
assert(false);
|
|
|
|
return 0;
|
|
|
|
}
|
2009-05-11 23:49:29 +02:00
|
|
|
}
|
|
|
|
|
2009-05-15 23:31:47 +02:00
|
|
|
virtual void endFunctionCallArguments(int a, int l) {
|
|
|
|
* (int*) a = l;
|
|
|
|
}
|
|
|
|
|
2009-07-07 23:48:51 +02:00
|
|
|
virtual int callForward(int symbol, Type* pFunc) {
|
|
|
|
setR0Type(pFunc->pHead);
|
2009-05-11 23:49:29 +02:00
|
|
|
return psym(0xe8, symbol); /* call xxx */
|
|
|
|
}
|
|
|
|
|
2009-07-07 23:48:51 +02:00
|
|
|
virtual void callRelative(int t, Type* pFunc) {
|
|
|
|
setR0Type(pFunc->pHead);
|
2009-05-11 23:49:29 +02:00
|
|
|
psym(0xe8, t); /* call xxx */
|
|
|
|
}
|
|
|
|
|
2009-07-07 23:48:51 +02:00
|
|
|
virtual void callIndirect(int l, Type* pFunc) {
|
|
|
|
setR0Type(pFunc->pHead);
|
2009-05-11 23:49:29 +02:00
|
|
|
oad(0x2494ff, l); /* call *xxx(%esp) */
|
|
|
|
}
|
|
|
|
|
2009-05-15 23:31:47 +02:00
|
|
|
virtual void adjustStackAfterCall(int l, bool isIndirect) {
|
|
|
|
if (isIndirect) {
|
|
|
|
l += 4;
|
|
|
|
}
|
2009-06-18 04:13:52 +02:00
|
|
|
if (l > 0) {
|
|
|
|
oad(0xc481, l); /* add $xxx, %esp */
|
|
|
|
}
|
2009-05-11 23:49:29 +02:00
|
|
|
}
|
|
|
|
|
2009-05-14 01:24:17 +02:00
|
|
|
virtual int jumpOffset() {
|
|
|
|
return 5;
|
|
|
|
}
|
|
|
|
|
|
|
|
virtual int disassemble(FILE* out) {
|
2009-05-22 21:06:27 +02:00
|
|
|
return 0;
|
2009-05-14 01:24:17 +02:00
|
|
|
}
|
|
|
|
|
2009-05-20 02:12:17 +02:00
|
|
|
/* output a symbol and patch all calls to it */
|
|
|
|
virtual void gsym(int t) {
|
|
|
|
int n;
|
|
|
|
int pc = getPC();
|
|
|
|
while (t) {
|
|
|
|
n = *(int *) t; /* next value */
|
|
|
|
*(int *) t = pc - t - 4;
|
|
|
|
t = n;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-05-22 21:06:27 +02:00
|
|
|
virtual int finishCompile() {
|
2009-06-10 00:53:47 +02:00
|
|
|
size_t pagesize = 4096;
|
|
|
|
size_t base = (size_t) getBase() & ~ (pagesize - 1);
|
|
|
|
size_t top = ((size_t) getPC() + pagesize - 1) & ~ (pagesize - 1);
|
|
|
|
int err = mprotect((void*) base, top - base, PROT_READ | PROT_WRITE | PROT_EXEC);
|
|
|
|
if (err) {
|
|
|
|
error("mprotect() failed: %d", errno);
|
|
|
|
}
|
|
|
|
return err;
|
2009-05-22 21:06:27 +02:00
|
|
|
}
|
|
|
|
|
2009-07-07 02:24:34 +02:00
|
|
|
/**
|
2009-07-09 01:48:41 +02:00
|
|
|
* Alignment (in bytes) for this type of data
|
2009-07-07 02:24:34 +02:00
|
|
|
*/
|
2009-07-09 01:48:41 +02:00
|
|
|
virtual size_t alignment(Type* pType){
|
2009-07-07 02:24:34 +02:00
|
|
|
switch(pType->tag) {
|
|
|
|
case TY_DOUBLE:
|
|
|
|
return 8;
|
|
|
|
default:
|
|
|
|
return 4;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Array element alignment (in bytes) for this type of data.
|
|
|
|
*/
|
|
|
|
virtual size_t sizeOf(Type* pType){
|
|
|
|
switch(pType->tag) {
|
|
|
|
case TY_INT:
|
|
|
|
return 4;
|
|
|
|
case TY_CHAR:
|
|
|
|
return 1;
|
|
|
|
default:
|
|
|
|
return 0;
|
|
|
|
case TY_FLOAT:
|
|
|
|
return 4;
|
|
|
|
case TY_DOUBLE:
|
|
|
|
return 8;
|
|
|
|
case TY_POINTER:
|
|
|
|
return 4;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-07-09 01:48:41 +02:00
|
|
|
virtual size_t stackSizeOf(Type* pType) {
|
|
|
|
switch(pType->tag) {
|
|
|
|
case TY_DOUBLE:
|
|
|
|
return 8;
|
|
|
|
default:
|
|
|
|
return 4;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-05-12 21:48:35 +02:00
|
|
|
private:
|
2009-05-20 02:12:17 +02:00
|
|
|
|
|
|
|
/** Output 1 to 4 bytes.
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
void o(int n) {
|
|
|
|
/* cannot use unsigned, so we must do a hack */
|
|
|
|
while (n && n != -1) {
|
|
|
|
ob(n & 0xff);
|
|
|
|
n = n >> 8;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* psym is used to put an instruction with a data field which is a
|
|
|
|
reference to a symbol. It is in fact the same as oad ! */
|
|
|
|
int psym(int n, int t) {
|
|
|
|
return oad(n, t);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* instruction + address */
|
|
|
|
int oad(int n, int t) {
|
|
|
|
o(n);
|
|
|
|
int result = getPC();
|
|
|
|
o4(t);
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2009-05-12 21:48:35 +02:00
|
|
|
static const int operatorHelper[];
|
2009-05-11 23:49:29 +02:00
|
|
|
|
2009-05-12 21:48:35 +02:00
|
|
|
int decodeOp(int op) {
|
|
|
|
if (op < 0 || op > OP_COUNT) {
|
2009-05-29 22:53:44 +02:00
|
|
|
error("Out-of-range operator: %d\n", op);
|
2009-06-11 19:53:51 +02:00
|
|
|
op = 0;
|
2009-05-12 21:48:35 +02:00
|
|
|
}
|
|
|
|
return operatorHelper[op];
|
2009-05-11 23:49:29 +02:00
|
|
|
}
|
|
|
|
|
2009-05-14 00:10:04 +02:00
|
|
|
void gmov(int l, int t) {
|
2009-05-11 23:49:29 +02:00
|
|
|
o(l + 0x83);
|
2009-06-10 00:53:47 +02:00
|
|
|
oad((t > -LOCAL && t < LOCAL) << 7 | 5, t);
|
2009-05-11 23:49:29 +02:00
|
|
|
}
|
2009-07-09 05:40:31 +02:00
|
|
|
|
|
|
|
void setupFloatOperands() {
|
|
|
|
Type* pR0Type = getR0Type();
|
|
|
|
Type* pTOSType = getTOSType();
|
|
|
|
TypeTag tagR0 = pR0Type->tag;
|
|
|
|
TypeTag tagTOS = pTOSType->tag;
|
|
|
|
bool isFloatR0 = isFloatTag(tagR0);
|
|
|
|
bool isFloatTOS = isFloatTag(tagTOS);
|
|
|
|
if (! isFloatR0) {
|
|
|
|
// Convert R0 from int to float
|
|
|
|
o(0x50); // push %eax
|
|
|
|
o(0x2404DB); // fildl 0(%esp)
|
|
|
|
o(0x58); // pop %eax
|
|
|
|
}
|
|
|
|
if (! isFloatTOS){
|
|
|
|
o(0x2404DB); // fildl 0(%esp);
|
|
|
|
o(0x58); // pop %eax
|
|
|
|
} else {
|
|
|
|
if (tagTOS == TY_FLOAT) {
|
|
|
|
o(0x2404d9); // flds (%esp)
|
|
|
|
o(0x58); // pop %eax
|
|
|
|
} else {
|
|
|
|
o(0x2404dd); // fldl (%esp)
|
|
|
|
o(0x58); // pop %eax
|
|
|
|
o(0x58); // pop %eax
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2009-05-11 23:49:29 +02:00
|
|
|
};
|
|
|
|
|
2009-05-20 02:12:17 +02:00
|
|
|
#endif // PROVIDE_X86_CODEGEN
|
|
|
|
|
2009-06-12 06:12:23 +02:00
|
|
|
#ifdef PROVIDE_TRACE_CODEGEN
|
|
|
|
class TraceCodeGenerator : public CodeGenerator {
|
|
|
|
private:
|
|
|
|
CodeGenerator* mpBase;
|
|
|
|
|
|
|
|
public:
|
|
|
|
TraceCodeGenerator(CodeGenerator* pBase) {
|
|
|
|
mpBase = pBase;
|
|
|
|
}
|
|
|
|
|
|
|
|
virtual ~TraceCodeGenerator() {
|
|
|
|
delete mpBase;
|
|
|
|
}
|
|
|
|
|
|
|
|
virtual void init(CodeBuf* pCodeBuf) {
|
|
|
|
mpBase->init(pCodeBuf);
|
|
|
|
}
|
|
|
|
|
|
|
|
void setErrorSink(ErrorSink* pErrorSink) {
|
|
|
|
mpBase->setErrorSink(pErrorSink);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* returns address to patch with local variable size
|
|
|
|
*/
|
|
|
|
virtual int functionEntry(int argCount) {
|
|
|
|
int result = mpBase->functionEntry(argCount);
|
|
|
|
fprintf(stderr, "functionEntry(%d) -> %d\n", argCount, result);
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
virtual void functionExit(int argCount, int localVariableAddress, int localVariableSize) {
|
|
|
|
fprintf(stderr, "functionExit(%d, %d, %d)\n",
|
|
|
|
argCount, localVariableAddress, localVariableSize);
|
|
|
|
mpBase->functionExit(argCount, localVariableAddress, localVariableSize);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* load immediate value */
|
2009-07-07 23:48:51 +02:00
|
|
|
virtual void li(int t, Type* pType) {
|
2009-06-12 06:12:23 +02:00
|
|
|
fprintf(stderr, "li(%d)\n", t);
|
2009-07-07 23:48:51 +02:00
|
|
|
mpBase->li(t, pType);
|
2009-06-12 06:12:23 +02:00
|
|
|
}
|
|
|
|
|
2009-07-08 22:04:41 +02:00
|
|
|
virtual void loadFloat(int address, Type* pType) {
|
|
|
|
fprintf(stderr, "loadFloat(%d, type)\n", address);
|
|
|
|
mpBase->loadFloat(address, pType);
|
2009-07-07 03:33:20 +02:00
|
|
|
}
|
|
|
|
|
2009-06-12 06:12:23 +02:00
|
|
|
virtual int gjmp(int t) {
|
|
|
|
int result = mpBase->gjmp(t);
|
|
|
|
fprintf(stderr, "gjmp(%d) = %d\n", t, result);
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* l = 0: je, l == 1: jne */
|
|
|
|
virtual int gtst(bool l, int t) {
|
|
|
|
int result = mpBase->gtst(l, t);
|
|
|
|
fprintf(stderr, "gtst(%d,%d) = %d\n", l, t, result);
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
2009-07-09 05:40:31 +02:00
|
|
|
virtual void gcmp(int op, Type* pResultType) {
|
|
|
|
fprintf(stderr, "gcmp(%d, pResultType)\n", op);
|
|
|
|
mpBase->gcmp(op, pResultType);
|
2009-06-12 06:12:23 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
virtual void genOp(int op) {
|
|
|
|
fprintf(stderr, "genOp(%d)\n", op);
|
|
|
|
mpBase->genOp(op);
|
|
|
|
}
|
|
|
|
|
2009-07-07 02:24:34 +02:00
|
|
|
|
2009-07-09 05:40:31 +02:00
|
|
|
virtual void gUnaryCmp(int op, Type* pResultType) {
|
|
|
|
fprintf(stderr, "gUnaryCmp(%d, pResultType)\n", op);
|
|
|
|
mpBase->gUnaryCmp(op, pResultType);
|
2009-07-07 02:24:34 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
virtual void genUnaryOp(int op) {
|
|
|
|
fprintf(stderr, "genUnaryOp(%d)\n", op);
|
|
|
|
mpBase->genUnaryOp(op);
|
2009-06-12 06:12:23 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
virtual void pushR0() {
|
|
|
|
fprintf(stderr, "pushR0()\n");
|
|
|
|
mpBase->pushR0();
|
|
|
|
}
|
|
|
|
|
2009-07-07 02:24:34 +02:00
|
|
|
virtual void storeR0ToTOS(Type* pPointerType) {
|
2009-07-07 03:33:20 +02:00
|
|
|
fprintf(stderr, "storeR0ToTOS(%d)\n", pPointerType->pHead->tag);
|
2009-07-07 02:24:34 +02:00
|
|
|
mpBase->storeR0ToTOS(pPointerType);
|
2009-06-12 06:12:23 +02:00
|
|
|
}
|
|
|
|
|
2009-07-07 02:24:34 +02:00
|
|
|
virtual void loadR0FromR0(Type* pPointerType) {
|
2009-07-07 03:33:20 +02:00
|
|
|
fprintf(stderr, "loadR0FromR0(%d)\n", pPointerType->pHead->tag);
|
2009-07-07 02:24:34 +02:00
|
|
|
mpBase->loadR0FromR0(pPointerType);
|
2009-06-12 06:12:23 +02:00
|
|
|
}
|
|
|
|
|
2009-07-07 23:48:51 +02:00
|
|
|
virtual void leaR0(int ea, Type* pPointerType) {
|
2009-06-12 06:12:23 +02:00
|
|
|
fprintf(stderr, "leaR0(%d)\n", ea);
|
2009-07-07 23:48:51 +02:00
|
|
|
mpBase->leaR0(ea, pPointerType);
|
2009-06-12 06:12:23 +02:00
|
|
|
}
|
|
|
|
|
2009-07-09 01:48:41 +02:00
|
|
|
virtual void storeR0(int ea, Type* pType) {
|
|
|
|
fprintf(stderr, "storeR0(%d, pType)\n", ea);
|
|
|
|
mpBase->storeR0(ea, pType);
|
2009-06-12 06:12:23 +02:00
|
|
|
}
|
|
|
|
|
2009-07-07 23:48:51 +02:00
|
|
|
virtual void loadR0(int ea, bool isIncDec, int op, Type* pType) {
|
2009-07-08 22:04:41 +02:00
|
|
|
fprintf(stderr, "loadR0(%d, %d, %d, pType)\n", ea, isIncDec, op);
|
2009-07-07 23:48:51 +02:00
|
|
|
mpBase->loadR0(ea, isIncDec, op, pType);
|
|
|
|
}
|
|
|
|
|
|
|
|
virtual void convertR0(Type* pType){
|
|
|
|
fprintf(stderr, "convertR0(pType)\n");
|
|
|
|
mpBase->convertR0(pType);
|
2009-06-12 06:12:23 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
virtual int beginFunctionCallArguments() {
|
|
|
|
int result = mpBase->beginFunctionCallArguments();
|
|
|
|
fprintf(stderr, "beginFunctionCallArguments() = %d\n", result);
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
2009-07-08 22:04:41 +02:00
|
|
|
virtual size_t storeR0ToArg(int l) {
|
2009-06-12 06:12:23 +02:00
|
|
|
fprintf(stderr, "storeR0ToArg(%d)\n", l);
|
2009-07-08 22:04:41 +02:00
|
|
|
return mpBase->storeR0ToArg(l);
|
2009-06-12 06:12:23 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
virtual void endFunctionCallArguments(int a, int l) {
|
|
|
|
fprintf(stderr, "endFunctionCallArguments(%d, %d)\n", a, l);
|
|
|
|
mpBase->endFunctionCallArguments(a, l);
|
|
|
|
}
|
|
|
|
|
2009-07-07 23:48:51 +02:00
|
|
|
virtual int callForward(int symbol, Type* pFunc) {
|
|
|
|
int result = mpBase->callForward(symbol, pFunc);
|
2009-06-12 06:12:23 +02:00
|
|
|
fprintf(stderr, "callForward(%d) = %d\n", symbol, result);
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
2009-07-07 23:48:51 +02:00
|
|
|
virtual void callRelative(int t, Type* pFunc) {
|
2009-06-12 06:12:23 +02:00
|
|
|
fprintf(stderr, "callRelative(%d)\n", t);
|
2009-07-07 23:48:51 +02:00
|
|
|
mpBase->callRelative(t, pFunc);
|
2009-06-12 06:12:23 +02:00
|
|
|
}
|
|
|
|
|
2009-07-07 23:48:51 +02:00
|
|
|
virtual void callIndirect(int l, Type* pFunc) {
|
2009-06-12 06:12:23 +02:00
|
|
|
fprintf(stderr, "callIndirect(%d)\n", l);
|
2009-07-07 23:48:51 +02:00
|
|
|
mpBase->callIndirect(l, pFunc);
|
2009-06-12 06:12:23 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
virtual void adjustStackAfterCall(int l, bool isIndirect) {
|
|
|
|
fprintf(stderr, "adjustStackAfterCall(%d, %d)\n", l, isIndirect);
|
|
|
|
mpBase->adjustStackAfterCall(l, isIndirect);
|
|
|
|
}
|
|
|
|
|
|
|
|
virtual int jumpOffset() {
|
|
|
|
return mpBase->jumpOffset();
|
|
|
|
}
|
|
|
|
|
|
|
|
virtual int disassemble(FILE* out) {
|
|
|
|
return mpBase->disassemble(out);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* output a symbol and patch all calls to it */
|
|
|
|
virtual void gsym(int t) {
|
|
|
|
fprintf(stderr, "gsym(%d)\n", t);
|
|
|
|
mpBase->gsym(t);
|
|
|
|
}
|
|
|
|
|
|
|
|
virtual int finishCompile() {
|
|
|
|
int result = mpBase->finishCompile();
|
|
|
|
fprintf(stderr, "finishCompile() = %d\n", result);
|
|
|
|
return result;
|
|
|
|
}
|
2009-07-07 02:24:34 +02:00
|
|
|
|
|
|
|
/**
|
2009-07-09 01:48:41 +02:00
|
|
|
* Alignment (in bytes) for this type of data
|
2009-07-07 02:24:34 +02:00
|
|
|
*/
|
2009-07-09 01:48:41 +02:00
|
|
|
virtual size_t alignment(Type* pType){
|
|
|
|
return mpBase->alignment(pType);
|
2009-07-07 02:24:34 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Array element alignment (in bytes) for this type of data.
|
|
|
|
*/
|
|
|
|
virtual size_t sizeOf(Type* pType){
|
|
|
|
return mpBase->sizeOf(pType);
|
|
|
|
}
|
2009-07-08 22:04:41 +02:00
|
|
|
|
2009-07-09 01:48:41 +02:00
|
|
|
|
|
|
|
virtual size_t stackSizeOf(Type* pType) {
|
|
|
|
return mpBase->stackSizeOf(pType);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2009-07-08 22:04:41 +02:00
|
|
|
virtual Type* getR0Type() {
|
|
|
|
return mpBase->getR0Type();
|
|
|
|
}
|
2009-06-12 06:12:23 +02:00
|
|
|
};
|
|
|
|
|
|
|
|
#endif // PROVIDE_TRACE_CODEGEN
|
|
|
|
|
2009-06-29 23:29:08 +02:00
|
|
|
class Arena {
|
|
|
|
public:
|
|
|
|
// Used to record a given allocation amount.
|
|
|
|
// Used:
|
|
|
|
// Mark mark = arena.mark();
|
|
|
|
// ... lots of arena.allocate()
|
|
|
|
// arena.free(mark);
|
|
|
|
|
|
|
|
struct Mark {
|
|
|
|
size_t chunk;
|
|
|
|
size_t offset;
|
|
|
|
};
|
|
|
|
|
|
|
|
Arena() {
|
|
|
|
mCurrentChunk = 0;
|
|
|
|
Chunk start(CHUNK_SIZE);
|
|
|
|
mData.push_back(start);
|
|
|
|
}
|
|
|
|
|
|
|
|
~Arena() {
|
|
|
|
for(size_t i = 0; i < mData.size(); i++) {
|
|
|
|
mData[i].free();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// Alloc using the standard alignment size safe for any variable
|
|
|
|
void* alloc(size_t size) {
|
|
|
|
return alloc(size, 8);
|
|
|
|
}
|
|
|
|
|
|
|
|
Mark mark(){
|
|
|
|
Mark result;
|
|
|
|
result.chunk = mCurrentChunk;
|
|
|
|
result.offset = mData[mCurrentChunk].mOffset;
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
void freeToMark(const Mark& mark) {
|
|
|
|
mCurrentChunk = mark.chunk;
|
|
|
|
mData[mCurrentChunk].mOffset = mark.offset;
|
|
|
|
}
|
|
|
|
|
|
|
|
private:
|
|
|
|
// Allocate memory aligned to a given size
|
|
|
|
// and a given power-of-two-sized alignment (e.g. 1,2,4,8,...)
|
|
|
|
// Memory is not zero filled.
|
|
|
|
|
|
|
|
void* alloc(size_t size, size_t alignment) {
|
|
|
|
while (size > mData[mCurrentChunk].remainingCapacity(alignment)) {
|
|
|
|
if (mCurrentChunk + 1 < mData.size()) {
|
|
|
|
mCurrentChunk++;
|
|
|
|
} else {
|
|
|
|
size_t allocSize = CHUNK_SIZE;
|
|
|
|
if (allocSize < size + alignment - 1) {
|
|
|
|
allocSize = size + alignment - 1;
|
|
|
|
}
|
|
|
|
Chunk chunk(allocSize);
|
|
|
|
mData.push_back(chunk);
|
|
|
|
mCurrentChunk++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return mData[mCurrentChunk].allocate(size, alignment);
|
|
|
|
}
|
|
|
|
|
|
|
|
static const size_t CHUNK_SIZE = 128*1024;
|
|
|
|
// Note: this class does not deallocate its
|
|
|
|
// memory when it's destroyed. It depends upon
|
|
|
|
// its parent to deallocate the memory.
|
|
|
|
struct Chunk {
|
|
|
|
Chunk() {
|
|
|
|
mpData = 0;
|
|
|
|
mSize = 0;
|
|
|
|
mOffset = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
Chunk(size_t size) {
|
|
|
|
mSize = size;
|
|
|
|
mpData = (char*) malloc(size);
|
|
|
|
mOffset = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
~Chunk() {
|
|
|
|
// Doesn't deallocate memory.
|
|
|
|
}
|
|
|
|
|
|
|
|
void* allocate(size_t size, size_t alignment) {
|
|
|
|
size_t alignedOffset = aligned(mOffset, alignment);
|
|
|
|
void* result = mpData + alignedOffset;
|
|
|
|
mOffset = alignedOffset + size;
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
void free() {
|
|
|
|
if (mpData) {
|
|
|
|
::free(mpData);
|
|
|
|
mpData = 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
size_t remainingCapacity(size_t alignment) {
|
|
|
|
return aligned(mSize, alignment) - aligned(mOffset, alignment);
|
|
|
|
}
|
|
|
|
|
|
|
|
// Assume alignment is a power of two
|
|
|
|
inline size_t aligned(size_t v, size_t alignment) {
|
|
|
|
size_t mask = alignment-1;
|
|
|
|
return (v + mask) & ~mask;
|
|
|
|
}
|
|
|
|
|
|
|
|
char* mpData;
|
|
|
|
size_t mSize;
|
|
|
|
size_t mOffset;
|
|
|
|
};
|
|
|
|
|
|
|
|
size_t mCurrentChunk;
|
|
|
|
|
|
|
|
Vector<Chunk> mData;
|
|
|
|
};
|
|
|
|
|
|
|
|
struct VariableInfo;
|
|
|
|
|
|
|
|
struct Token {
|
|
|
|
int hash;
|
|
|
|
size_t length;
|
|
|
|
char* pText;
|
|
|
|
tokenid_t id;
|
|
|
|
|
|
|
|
// Current values for the token
|
|
|
|
char* mpMacroDefinition;
|
|
|
|
VariableInfo* mpVariableInfo;
|
|
|
|
};
|
|
|
|
|
|
|
|
class TokenTable {
|
|
|
|
public:
|
|
|
|
// Don't use 0..0xff, allows characters and operators to be tokens too.
|
|
|
|
|
|
|
|
static const int TOKEN_BASE = 0x100;
|
|
|
|
TokenTable() {
|
|
|
|
mpMap = hashmapCreate(128, hashFn, equalsFn);
|
|
|
|
}
|
|
|
|
|
|
|
|
~TokenTable() {
|
|
|
|
hashmapFree(mpMap);
|
|
|
|
}
|
|
|
|
|
|
|
|
void setArena(Arena* pArena) {
|
|
|
|
mpArena = pArena;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Returns a token for a given string of characters.
|
|
|
|
tokenid_t intern(const char* pText, size_t length) {
|
|
|
|
Token probe;
|
|
|
|
int hash = hashmapHash((void*) pText, length);
|
|
|
|
{
|
|
|
|
Token probe;
|
|
|
|
probe.hash = hash;
|
|
|
|
probe.length = length;
|
|
|
|
probe.pText = (char*) pText;
|
|
|
|
Token* pValue = (Token*) hashmapGet(mpMap, &probe);
|
|
|
|
if (pValue) {
|
|
|
|
return pValue->id;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
Token* pToken = (Token*) mpArena->alloc(sizeof(Token));
|
|
|
|
memset(pToken, 0, sizeof(*pToken));
|
|
|
|
pToken->hash = hash;
|
|
|
|
pToken->length = length;
|
|
|
|
pToken->pText = (char*) mpArena->alloc(length + 1);
|
|
|
|
memcpy(pToken->pText, pText, length);
|
|
|
|
pToken->pText[length] = 0;
|
|
|
|
pToken->id = mTokens.size() + TOKEN_BASE;
|
|
|
|
mTokens.push_back(pToken);
|
|
|
|
hashmapPut(mpMap, pToken, pToken);
|
|
|
|
return pToken->id;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Return the Token for a given tokenid.
|
|
|
|
Token& operator[](tokenid_t id) {
|
|
|
|
return *mTokens[id - TOKEN_BASE];
|
|
|
|
}
|
|
|
|
|
|
|
|
inline size_t size() {
|
|
|
|
return mTokens.size();
|
|
|
|
}
|
|
|
|
|
|
|
|
private:
|
|
|
|
|
|
|
|
static int hashFn(void* pKey) {
|
|
|
|
Token* pToken = (Token*) pKey;
|
|
|
|
return pToken->hash;
|
|
|
|
}
|
|
|
|
|
|
|
|
static bool equalsFn(void* keyA, void* keyB) {
|
|
|
|
Token* pTokenA = (Token*) keyA;
|
|
|
|
Token* pTokenB = (Token*) keyB;
|
|
|
|
// Don't need to compare hash values, they should always be equal
|
|
|
|
return pTokenA->length == pTokenB->length
|
|
|
|
&& strcmp(pTokenA->pText, pTokenB->pText) == 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
Hashmap* mpMap;
|
|
|
|
Vector<Token*> mTokens;
|
|
|
|
Arena* mpArena;
|
|
|
|
};
|
|
|
|
|
2009-05-22 21:06:27 +02:00
|
|
|
class InputStream {
|
|
|
|
public:
|
2009-07-09 01:59:18 +02:00
|
|
|
virtual ~InputStream() {}
|
2009-06-05 01:23:40 +02:00
|
|
|
int getChar() {
|
|
|
|
if (bumpLine) {
|
|
|
|
line++;
|
|
|
|
bumpLine = false;
|
|
|
|
}
|
|
|
|
int ch = get();
|
|
|
|
if (ch == '\n') {
|
|
|
|
bumpLine = true;
|
|
|
|
}
|
|
|
|
return ch;
|
|
|
|
}
|
|
|
|
int getLine() {
|
|
|
|
return line;
|
|
|
|
}
|
|
|
|
protected:
|
|
|
|
InputStream() :
|
|
|
|
line(1), bumpLine(false) {
|
|
|
|
}
|
|
|
|
private:
|
2009-05-22 21:06:27 +02:00
|
|
|
virtual int get() = 0;
|
2009-06-05 01:23:40 +02:00
|
|
|
int line;
|
|
|
|
bool bumpLine;
|
2009-05-22 21:06:27 +02:00
|
|
|
};
|
|
|
|
|
|
|
|
class FileInputStream : public InputStream {
|
|
|
|
public:
|
|
|
|
FileInputStream(FILE* in) : f(in) {}
|
|
|
|
private:
|
2009-06-05 01:23:40 +02:00
|
|
|
virtual int get() { return fgetc(f); }
|
2009-05-22 21:06:27 +02:00
|
|
|
FILE* f;
|
|
|
|
};
|
|
|
|
|
|
|
|
class TextInputStream : public InputStream {
|
|
|
|
public:
|
|
|
|
TextInputStream(const char* text, size_t textLength)
|
|
|
|
: pText(text), mTextLength(textLength), mPosition(0) {
|
|
|
|
}
|
2009-06-05 01:23:40 +02:00
|
|
|
|
|
|
|
private:
|
2009-05-22 21:06:27 +02:00
|
|
|
virtual int get() {
|
|
|
|
return mPosition < mTextLength ? pText[mPosition++] : EOF;
|
|
|
|
}
|
|
|
|
|
|
|
|
const char* pText;
|
|
|
|
size_t mTextLength;
|
|
|
|
size_t mPosition;
|
|
|
|
};
|
|
|
|
|
2009-06-05 01:23:40 +02:00
|
|
|
class String {
|
|
|
|
public:
|
|
|
|
String() {
|
|
|
|
mpBase = 0;
|
|
|
|
mUsed = 0;
|
|
|
|
mSize = 0;
|
|
|
|
}
|
|
|
|
|
2009-06-12 04:06:24 +02:00
|
|
|
String(const char* item, int len, bool adopt) {
|
|
|
|
if (len < 0) {
|
|
|
|
len = strlen(item);
|
|
|
|
}
|
2009-06-08 23:34:26 +02:00
|
|
|
if (adopt) {
|
2009-06-12 04:06:24 +02:00
|
|
|
mpBase = (char*) item;
|
2009-06-08 23:34:26 +02:00
|
|
|
mUsed = len;
|
|
|
|
mSize = len + 1;
|
|
|
|
} else {
|
|
|
|
mpBase = 0;
|
|
|
|
mUsed = 0;
|
|
|
|
mSize = 0;
|
|
|
|
appendBytes(item, len);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-06-12 04:06:24 +02:00
|
|
|
String(const String& other) {
|
|
|
|
mpBase = 0;
|
|
|
|
mUsed = 0;
|
|
|
|
mSize = 0;
|
|
|
|
appendBytes(other.getUnwrapped(), other.len());
|
|
|
|
}
|
|
|
|
|
2009-06-05 01:23:40 +02:00
|
|
|
~String() {
|
|
|
|
if (mpBase) {
|
|
|
|
free(mpBase);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-06-12 20:25:59 +02:00
|
|
|
String& operator=(const String& other) {
|
|
|
|
clear();
|
|
|
|
appendBytes(other.getUnwrapped(), other.len());
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
2009-06-12 04:06:24 +02:00
|
|
|
inline char* getUnwrapped() const {
|
2009-06-05 01:23:40 +02:00
|
|
|
return mpBase;
|
|
|
|
}
|
|
|
|
|
2009-06-12 04:06:24 +02:00
|
|
|
void clear() {
|
|
|
|
mUsed = 0;
|
|
|
|
if (mSize > 0) {
|
|
|
|
mpBase[0] = 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-06-05 01:23:40 +02:00
|
|
|
void appendCStr(const char* s) {
|
2009-06-08 23:34:26 +02:00
|
|
|
appendBytes(s, strlen(s));
|
|
|
|
}
|
|
|
|
|
|
|
|
void appendBytes(const char* s, int n) {
|
2009-06-05 01:23:40 +02:00
|
|
|
memcpy(ensure(n), s, n + 1);
|
|
|
|
}
|
|
|
|
|
|
|
|
void append(char c) {
|
|
|
|
* ensure(1) = c;
|
|
|
|
}
|
|
|
|
|
2009-07-01 03:09:56 +02:00
|
|
|
void append(String& other) {
|
|
|
|
appendBytes(other.getUnwrapped(), other.len());
|
|
|
|
}
|
|
|
|
|
2009-06-08 23:34:26 +02:00
|
|
|
char* orphan() {
|
|
|
|
char* result = mpBase;
|
|
|
|
mpBase = 0;
|
|
|
|
mUsed = 0;
|
|
|
|
mSize = 0;
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
2009-06-05 01:23:40 +02:00
|
|
|
void printf(const char* fmt,...) {
|
|
|
|
va_list ap;
|
|
|
|
va_start(ap, fmt);
|
|
|
|
vprintf(fmt, ap);
|
|
|
|
va_end(ap);
|
|
|
|
}
|
|
|
|
|
|
|
|
void vprintf(const char* fmt, va_list ap) {
|
|
|
|
char* temp;
|
|
|
|
int numChars = vasprintf(&temp, fmt, ap);
|
|
|
|
memcpy(ensure(numChars), temp, numChars+1);
|
|
|
|
free(temp);
|
|
|
|
}
|
|
|
|
|
2009-06-12 04:06:24 +02:00
|
|
|
inline size_t len() const {
|
2009-06-05 01:23:40 +02:00
|
|
|
return mUsed;
|
|
|
|
}
|
|
|
|
|
|
|
|
private:
|
|
|
|
char* ensure(int n) {
|
|
|
|
size_t newUsed = mUsed + n;
|
|
|
|
if (newUsed > mSize) {
|
|
|
|
size_t newSize = mSize * 2 + 10;
|
|
|
|
if (newSize < newUsed) {
|
|
|
|
newSize = newUsed;
|
|
|
|
}
|
|
|
|
mpBase = (char*) realloc(mpBase, newSize + 1);
|
|
|
|
mSize = newSize;
|
|
|
|
}
|
|
|
|
mpBase[newUsed] = '\0';
|
|
|
|
char* result = mpBase + mUsed;
|
|
|
|
mUsed = newUsed;
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
char* mpBase;
|
|
|
|
size_t mUsed;
|
|
|
|
size_t mSize;
|
|
|
|
};
|
|
|
|
|
2009-06-29 23:29:08 +02:00
|
|
|
void internKeywords() {
|
|
|
|
// Note: order has to match TOK_ constants
|
|
|
|
static const char* keywords[] = {
|
|
|
|
"int",
|
|
|
|
"char",
|
|
|
|
"void",
|
|
|
|
"if",
|
|
|
|
"else",
|
|
|
|
"while",
|
|
|
|
"break",
|
|
|
|
"return",
|
|
|
|
"for",
|
|
|
|
"pragma",
|
|
|
|
"define",
|
|
|
|
"auto",
|
|
|
|
"case",
|
|
|
|
"const",
|
|
|
|
"continue",
|
|
|
|
"default",
|
|
|
|
"do",
|
|
|
|
"double",
|
|
|
|
"enum",
|
|
|
|
"extern",
|
|
|
|
"float",
|
|
|
|
"goto",
|
|
|
|
"long",
|
|
|
|
"register",
|
|
|
|
"short",
|
|
|
|
"signed",
|
|
|
|
"sizeof",
|
|
|
|
"static",
|
|
|
|
"struct",
|
|
|
|
"switch",
|
|
|
|
"typedef",
|
|
|
|
"union",
|
|
|
|
"unsigned",
|
|
|
|
"volatile",
|
|
|
|
"_Bool",
|
|
|
|
"_Complex",
|
|
|
|
"_Imaginary",
|
|
|
|
"inline",
|
|
|
|
"restrict",
|
|
|
|
0};
|
|
|
|
|
|
|
|
for(int i = 0; keywords[i]; i++) {
|
|
|
|
mTokenTable.intern(keywords[i], strlen(keywords[i]));
|
2009-06-08 23:34:26 +02:00
|
|
|
}
|
2009-06-29 23:29:08 +02:00
|
|
|
}
|
2009-06-08 23:34:26 +02:00
|
|
|
|
2009-06-09 00:55:32 +02:00
|
|
|
struct InputState {
|
|
|
|
InputStream* pStream;
|
|
|
|
int oldCh;
|
|
|
|
};
|
|
|
|
|
2009-06-11 23:29:47 +02:00
|
|
|
struct VariableInfo {
|
2009-06-12 04:06:24 +02:00
|
|
|
void* pAddress;
|
|
|
|
void* pForward; // For a forward direction, linked list of data to fix up
|
2009-06-29 23:29:08 +02:00
|
|
|
tokenid_t tok;
|
|
|
|
size_t level;
|
|
|
|
VariableInfo* pOldDefinition;
|
2009-07-01 03:09:56 +02:00
|
|
|
Type* pType;
|
2009-06-11 23:29:47 +02:00
|
|
|
};
|
|
|
|
|
2009-06-12 04:06:24 +02:00
|
|
|
class SymbolStack {
|
|
|
|
public:
|
|
|
|
SymbolStack() {
|
2009-06-29 23:29:08 +02:00
|
|
|
mpArena = 0;
|
|
|
|
mpTokenTable = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
void setArena(Arena* pArena) {
|
|
|
|
mpArena = pArena;
|
|
|
|
}
|
|
|
|
|
|
|
|
void setTokenTable(TokenTable* pTokenTable) {
|
|
|
|
mpTokenTable = pTokenTable;
|
2009-06-12 04:06:24 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
void pushLevel() {
|
2009-06-29 23:29:08 +02:00
|
|
|
Mark mark;
|
|
|
|
mark.mArenaMark = mpArena->mark();
|
|
|
|
mark.mSymbolHead = mStack.size();
|
|
|
|
mLevelStack.push_back(mark);
|
2009-06-12 04:06:24 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
void popLevel() {
|
2009-06-29 23:29:08 +02:00
|
|
|
// Undo any shadowing that was done:
|
|
|
|
Mark mark = mLevelStack.back();
|
|
|
|
mLevelStack.pop_back();
|
|
|
|
while (mStack.size() > mark.mSymbolHead) {
|
|
|
|
VariableInfo* pV = mStack.back();
|
|
|
|
mStack.pop_back();
|
|
|
|
(*mpTokenTable)[pV->tok].mpVariableInfo = pV->pOldDefinition;
|
|
|
|
}
|
|
|
|
mpArena->freeToMark(mark.mArenaMark);
|
|
|
|
}
|
|
|
|
|
|
|
|
bool isDefinedAtCurrentLevel(tokenid_t tok) {
|
|
|
|
VariableInfo* pV = (*mpTokenTable)[tok].mpVariableInfo;
|
|
|
|
return pV && pV->level == level();
|
|
|
|
}
|
|
|
|
|
|
|
|
VariableInfo* add(tokenid_t tok) {
|
|
|
|
Token& token = (*mpTokenTable)[tok];
|
|
|
|
VariableInfo* pOldV = token.mpVariableInfo;
|
|
|
|
VariableInfo* pNewV =
|
|
|
|
(VariableInfo*) mpArena->alloc(sizeof(VariableInfo));
|
|
|
|
memset(pNewV, 0, sizeof(VariableInfo));
|
|
|
|
pNewV->tok = tok;
|
|
|
|
pNewV->level = level();
|
|
|
|
pNewV->pOldDefinition = pOldV;
|
|
|
|
token.mpVariableInfo = pNewV;
|
|
|
|
mStack.push_back(pNewV);
|
|
|
|
return pNewV;
|
|
|
|
}
|
|
|
|
|
2009-07-01 03:09:56 +02:00
|
|
|
VariableInfo* add(Type* pType) {
|
|
|
|
VariableInfo* pVI = add(pType->id);
|
|
|
|
pVI->pType = pType;
|
|
|
|
return pVI;
|
|
|
|
}
|
|
|
|
|
2009-06-29 23:29:08 +02:00
|
|
|
void forEach(bool (*fn)(VariableInfo*, void*), void* context) {
|
|
|
|
for (size_t i = 0; i < mStack.size(); i++) {
|
|
|
|
if (! fn(mStack[i], context)) {
|
2009-06-12 04:06:24 +02:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
2009-06-12 20:25:59 +02:00
|
|
|
}
|
|
|
|
|
2009-06-12 04:06:24 +02:00
|
|
|
private:
|
2009-06-29 23:29:08 +02:00
|
|
|
inline size_t level() {
|
|
|
|
return mLevelStack.size();
|
2009-06-12 04:06:24 +02:00
|
|
|
}
|
|
|
|
|
2009-06-29 23:29:08 +02:00
|
|
|
struct Mark {
|
|
|
|
Arena::Mark mArenaMark;
|
|
|
|
size_t mSymbolHead;
|
2009-06-12 04:06:24 +02:00
|
|
|
};
|
|
|
|
|
2009-06-29 23:29:08 +02:00
|
|
|
Arena* mpArena;
|
|
|
|
TokenTable* mpTokenTable;
|
|
|
|
Vector<VariableInfo*> mStack;
|
|
|
|
Vector<Mark> mLevelStack;
|
2009-06-12 04:06:24 +02:00
|
|
|
};
|
2009-06-09 00:55:32 +02:00
|
|
|
|
|
|
|
int ch; // Current input character, or EOF
|
2009-06-29 23:29:08 +02:00
|
|
|
tokenid_t tok; // token
|
2009-06-09 00:55:32 +02:00
|
|
|
intptr_t tokc; // token extra info
|
2009-07-07 03:33:20 +02:00
|
|
|
double tokd; // floating point constant value
|
2009-06-09 00:55:32 +02:00
|
|
|
int tokl; // token operator level
|
|
|
|
intptr_t rsym; // return symbol
|
2009-07-07 23:48:51 +02:00
|
|
|
Type* pReturnType; // type of the current function's return.
|
2009-06-09 00:55:32 +02:00
|
|
|
intptr_t loc; // local variable index
|
|
|
|
char* glo; // global variable index
|
2009-06-12 04:06:24 +02:00
|
|
|
String mTokenString;
|
2009-06-09 00:55:32 +02:00
|
|
|
char* dptr; // Macro state: Points to macro text during macro playback.
|
|
|
|
int dch; // Macro state: Saves old value of ch during a macro playback.
|
|
|
|
char* pGlobalBase;
|
2009-06-29 23:29:08 +02:00
|
|
|
|
|
|
|
// Arena for the duration of the compile
|
|
|
|
Arena mGlobalArena;
|
|
|
|
// Arena for data that's only needed when compiling a single function
|
|
|
|
Arena mLocalArena;
|
|
|
|
|
|
|
|
TokenTable mTokenTable;
|
|
|
|
SymbolStack mGlobals;
|
|
|
|
SymbolStack mLocals;
|
|
|
|
|
2009-07-02 00:32:35 +02:00
|
|
|
// Prebuilt types, makes things slightly faster.
|
2009-07-07 02:24:34 +02:00
|
|
|
Type* mkpInt; // int
|
|
|
|
Type* mkpChar; // char
|
|
|
|
Type* mkpVoid; // void
|
2009-07-06 21:07:15 +02:00
|
|
|
Type* mkpFloat;
|
|
|
|
Type* mkpDouble;
|
2009-07-07 23:48:51 +02:00
|
|
|
Type* mkpIntFn;
|
2009-07-02 23:46:19 +02:00
|
|
|
Type* mkpIntPtr;
|
|
|
|
Type* mkpCharPtr;
|
2009-07-08 22:04:41 +02:00
|
|
|
Type* mkpFloatPtr;
|
|
|
|
Type* mkpDoublePtr;
|
2009-07-02 23:46:19 +02:00
|
|
|
Type* mkpPtrIntFn;
|
2009-07-01 03:09:56 +02:00
|
|
|
|
2009-06-09 00:55:32 +02:00
|
|
|
InputStream* file;
|
|
|
|
|
|
|
|
CodeBuf codeBuf;
|
|
|
|
CodeGenerator* pGen;
|
|
|
|
|
2009-06-05 01:23:40 +02:00
|
|
|
String mErrorBuf;
|
|
|
|
|
|
|
|
String mPragmas;
|
|
|
|
int mPragmaStringCount;
|
|
|
|
|
2009-05-11 23:49:29 +02:00
|
|
|
static const int ALLOC_SIZE = 99999;
|
|
|
|
|
2009-06-12 04:06:24 +02:00
|
|
|
static const int TOK_DUMMY = 1;
|
|
|
|
static const int TOK_NUM = 2;
|
2009-07-07 03:33:20 +02:00
|
|
|
static const int TOK_NUM_FLOAT = 3;
|
|
|
|
static const int TOK_NUM_DOUBLE = 4;
|
2009-06-12 04:06:24 +02:00
|
|
|
|
|
|
|
// 3..255 are character and/or operators
|
|
|
|
|
2009-06-11 23:29:47 +02:00
|
|
|
// Keywords start at 0x100 and increase by 1
|
2009-06-29 23:29:08 +02:00
|
|
|
// Order has to match string list in "internKeywords".
|
|
|
|
enum {
|
|
|
|
TOK_KEYWORD = TokenTable::TOKEN_BASE,
|
|
|
|
TOK_INT = TOK_KEYWORD,
|
|
|
|
TOK_CHAR,
|
|
|
|
TOK_VOID,
|
|
|
|
TOK_IF,
|
|
|
|
TOK_ELSE,
|
|
|
|
TOK_WHILE,
|
|
|
|
TOK_BREAK,
|
|
|
|
TOK_RETURN,
|
|
|
|
TOK_FOR,
|
|
|
|
TOK_PRAGMA,
|
|
|
|
TOK_DEFINE,
|
|
|
|
TOK_AUTO,
|
|
|
|
TOK_CASE,
|
|
|
|
TOK_CONST,
|
|
|
|
TOK_CONTINUE,
|
|
|
|
TOK_DEFAULT,
|
|
|
|
TOK_DO,
|
|
|
|
TOK_DOUBLE,
|
|
|
|
TOK_ENUM,
|
|
|
|
TOK_EXTERN,
|
|
|
|
TOK_FLOAT,
|
|
|
|
TOK_GOTO,
|
|
|
|
TOK_LONG,
|
|
|
|
TOK_REGISTER,
|
|
|
|
TOK_SHORT,
|
|
|
|
TOK_SIGNED,
|
|
|
|
TOK_SIZEOF,
|
|
|
|
TOK_STATIC,
|
|
|
|
TOK_STRUCT,
|
|
|
|
TOK_SWITCH,
|
|
|
|
TOK_TYPEDEF,
|
|
|
|
TOK_UNION,
|
|
|
|
TOK_UNSIGNED,
|
|
|
|
TOK_VOLATILE,
|
|
|
|
TOK__BOOL,
|
|
|
|
TOK__COMPLEX,
|
|
|
|
TOK__IMAGINARY,
|
|
|
|
TOK_INLINE,
|
|
|
|
TOK_RESTRICT,
|
|
|
|
// Symbols start after tokens
|
|
|
|
TOK_SYMBOL
|
|
|
|
};
|
2009-05-11 23:49:29 +02:00
|
|
|
|
|
|
|
static const int LOCAL = 0x200;
|
|
|
|
|
|
|
|
static const int SYM_FORWARD = 0;
|
|
|
|
static const int SYM_DEFINE = 1;
|
|
|
|
|
|
|
|
/* tokens in string heap */
|
|
|
|
static const int TAG_TOK = ' ';
|
|
|
|
|
2009-05-12 21:48:35 +02:00
|
|
|
static const int OP_INCREMENT = 0;
|
|
|
|
static const int OP_DECREMENT = 1;
|
|
|
|
static const int OP_MUL = 2;
|
|
|
|
static const int OP_DIV = 3;
|
|
|
|
static const int OP_MOD = 4;
|
|
|
|
static const int OP_PLUS = 5;
|
|
|
|
static const int OP_MINUS = 6;
|
|
|
|
static const int OP_SHIFT_LEFT = 7;
|
|
|
|
static const int OP_SHIFT_RIGHT = 8;
|
|
|
|
static const int OP_LESS_EQUAL = 9;
|
|
|
|
static const int OP_GREATER_EQUAL = 10;
|
|
|
|
static const int OP_LESS = 11;
|
|
|
|
static const int OP_GREATER = 12;
|
|
|
|
static const int OP_EQUALS = 13;
|
|
|
|
static const int OP_NOT_EQUALS = 14;
|
|
|
|
static const int OP_LOGICAL_AND = 15;
|
|
|
|
static const int OP_LOGICAL_OR = 16;
|
|
|
|
static const int OP_BIT_AND = 17;
|
|
|
|
static const int OP_BIT_XOR = 18;
|
|
|
|
static const int OP_BIT_OR = 19;
|
|
|
|
static const int OP_BIT_NOT = 20;
|
|
|
|
static const int OP_LOGICAL_NOT = 21;
|
|
|
|
static const int OP_COUNT = 22;
|
|
|
|
|
|
|
|
/* Operators are searched from front, the two-character operators appear
|
|
|
|
* before the single-character operators with the same first character.
|
|
|
|
* @ is used to pad out single-character operators.
|
|
|
|
*/
|
|
|
|
static const char* operatorChars;
|
|
|
|
static const char operatorLevel[];
|
|
|
|
|
2009-06-29 23:29:08 +02:00
|
|
|
/* Called when we detect an internal problem. Does nothing in production.
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
void internalError() {
|
|
|
|
* (char*) 0 = 0;
|
|
|
|
}
|
|
|
|
|
2009-07-01 03:09:56 +02:00
|
|
|
void assert(bool isTrue) {
|
|
|
|
if (!isTrue) {
|
|
|
|
internalError();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-07-02 00:32:35 +02:00
|
|
|
bool isSymbol(tokenid_t t) {
|
|
|
|
return t >= TOK_SYMBOL &&
|
|
|
|
((size_t) (t-TOK_SYMBOL)) < mTokenTable.size();
|
|
|
|
}
|
|
|
|
|
|
|
|
bool isSymbolOrKeyword(tokenid_t t) {
|
|
|
|
return t >= TOK_KEYWORD &&
|
2009-07-06 21:07:15 +02:00
|
|
|
((size_t) (t-TOK_KEYWORD)) < mTokenTable.size();
|
2009-07-02 00:32:35 +02:00
|
|
|
}
|
|
|
|
|
2009-06-29 23:29:08 +02:00
|
|
|
VariableInfo* VI(tokenid_t t) {
|
2009-07-02 00:32:35 +02:00
|
|
|
assert(isSymbol(t));
|
2009-06-29 23:29:08 +02:00
|
|
|
VariableInfo* pV = mTokenTable[t].mpVariableInfo;
|
|
|
|
if (pV && pV->tok != t) {
|
|
|
|
internalError();
|
|
|
|
}
|
|
|
|
return pV;
|
|
|
|
}
|
|
|
|
|
|
|
|
inline bool isDefined(tokenid_t t) {
|
|
|
|
return t >= TOK_SYMBOL && VI(t) != 0;
|
|
|
|
}
|
|
|
|
|
2009-07-02 00:32:35 +02:00
|
|
|
const char* nameof(tokenid_t t) {
|
|
|
|
assert(isSymbolOrKeyword(t));
|
2009-06-29 23:29:08 +02:00
|
|
|
return mTokenTable[t].pText;
|
|
|
|
}
|
|
|
|
|
2009-05-11 23:49:29 +02:00
|
|
|
void pdef(int t) {
|
2009-06-12 04:06:24 +02:00
|
|
|
mTokenString.append(t);
|
2009-05-11 23:49:29 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
void inp() {
|
|
|
|
if (dptr) {
|
2009-05-29 02:15:32 +02:00
|
|
|
ch = *dptr++;
|
2009-06-08 23:34:26 +02:00
|
|
|
if (ch == 0) {
|
2009-05-11 23:49:29 +02:00
|
|
|
dptr = 0;
|
|
|
|
ch = dch;
|
|
|
|
}
|
|
|
|
} else
|
2009-06-05 01:23:40 +02:00
|
|
|
ch = file->getChar();
|
2009-06-05 04:56:13 +02:00
|
|
|
#if 0
|
|
|
|
printf("ch='%c' 0x%x\n", ch, ch);
|
|
|
|
#endif
|
2009-05-11 23:49:29 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
int isid() {
|
2009-05-14 00:10:04 +02:00
|
|
|
return isalnum(ch) | (ch == '_');
|
2009-05-08 23:54:15 +02:00
|
|
|
}
|
2009-05-11 23:49:29 +02:00
|
|
|
|
2009-06-12 21:49:14 +02:00
|
|
|
/* read a character constant, advances ch to after end of constant */
|
|
|
|
int getq() {
|
|
|
|
int val = ch;
|
2009-05-11 23:49:29 +02:00
|
|
|
if (ch == '\\') {
|
2009-05-10 23:09:03 +02:00
|
|
|
inp();
|
2009-06-12 21:49:14 +02:00
|
|
|
if (isoctal(ch)) {
|
|
|
|
// 1 to 3 octal characters.
|
|
|
|
val = 0;
|
|
|
|
for(int i = 0; i < 3; i++) {
|
|
|
|
if (isoctal(ch)) {
|
|
|
|
val = (val << 3) + ch - '0';
|
|
|
|
inp();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return val;
|
|
|
|
} else if (ch == 'x' || ch == 'X') {
|
|
|
|
// N hex chars
|
|
|
|
inp();
|
|
|
|
if (! isxdigit(ch)) {
|
|
|
|
error("'x' character escape requires at least one digit.");
|
|
|
|
} else {
|
|
|
|
val = 0;
|
|
|
|
while (isxdigit(ch)) {
|
|
|
|
int d = ch;
|
|
|
|
if (isdigit(d)) {
|
|
|
|
d -= '0';
|
|
|
|
} else if (d <= 'F') {
|
|
|
|
d = d - 'A' + 10;
|
|
|
|
} else {
|
|
|
|
d = d - 'a' + 10;
|
|
|
|
}
|
|
|
|
val = (val << 4) + d;
|
|
|
|
inp();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
int val = ch;
|
|
|
|
switch (ch) {
|
|
|
|
case 'a':
|
|
|
|
val = '\a';
|
|
|
|
break;
|
|
|
|
case 'b':
|
|
|
|
val = '\b';
|
|
|
|
break;
|
|
|
|
case 'f':
|
|
|
|
val = '\f';
|
|
|
|
break;
|
|
|
|
case 'n':
|
|
|
|
val = '\n';
|
|
|
|
break;
|
|
|
|
case 'r':
|
|
|
|
val = '\r';
|
|
|
|
break;
|
|
|
|
case 't':
|
|
|
|
val = '\t';
|
|
|
|
break;
|
|
|
|
case 'v':
|
|
|
|
val = '\v';
|
|
|
|
break;
|
|
|
|
case '\\':
|
|
|
|
val = '\\';
|
|
|
|
break;
|
|
|
|
case '\'':
|
|
|
|
val = '\'';
|
|
|
|
break;
|
|
|
|
case '"':
|
|
|
|
val = '"';
|
|
|
|
break;
|
|
|
|
case '?':
|
|
|
|
val = '?';
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
error("Undefined character escape %c", ch);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
inp();
|
|
|
|
return val;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
inp();
|
2009-05-08 23:54:15 +02:00
|
|
|
}
|
2009-06-12 21:49:14 +02:00
|
|
|
return val;
|
|
|
|
}
|
|
|
|
|
|
|
|
static bool isoctal(int ch) {
|
|
|
|
return ch >= '0' && ch <= '7';
|
2009-05-11 23:49:29 +02:00
|
|
|
}
|
|
|
|
|
2009-07-07 03:33:20 +02:00
|
|
|
bool acceptCh(int c) {
|
|
|
|
bool result = c == ch;
|
|
|
|
if (result) {
|
|
|
|
pdef(ch);
|
|
|
|
inp();
|
|
|
|
}
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool acceptDigitsCh() {
|
|
|
|
bool result = false;
|
|
|
|
while (isdigit(ch)) {
|
|
|
|
result = true;
|
|
|
|
pdef(ch);
|
|
|
|
inp();
|
|
|
|
}
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
void parseFloat() {
|
|
|
|
tok = TOK_NUM_DOUBLE;
|
|
|
|
// mTokenString already has the integral part of the number.
|
|
|
|
acceptCh('.');
|
|
|
|
acceptDigitsCh();
|
|
|
|
bool doExp = true;
|
|
|
|
if (acceptCh('e') || acceptCh('E')) {
|
|
|
|
// Don't need to do any extra work
|
|
|
|
} else if (ch == 'f' || ch == 'F') {
|
|
|
|
pdef('e'); // So it can be parsed by strtof.
|
|
|
|
inp();
|
|
|
|
tok = TOK_NUM_FLOAT;
|
|
|
|
} else {
|
|
|
|
doExp = false;
|
|
|
|
}
|
|
|
|
if (doExp) {
|
|
|
|
bool digitsRequired = acceptCh('-');
|
|
|
|
bool digitsFound = acceptDigitsCh();
|
|
|
|
if (digitsRequired && ! digitsFound) {
|
|
|
|
error("malformed exponent");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
char* pText = mTokenString.getUnwrapped();
|
|
|
|
if (tok == TOK_NUM_FLOAT) {
|
|
|
|
tokd = strtof(pText, 0);
|
|
|
|
} else {
|
|
|
|
tokd = strtod(pText, 0);
|
|
|
|
}
|
|
|
|
//fprintf(stderr, "float constant: %s (%d) %g\n", pText, tok, tokd);
|
|
|
|
}
|
|
|
|
|
2009-05-11 23:49:29 +02:00
|
|
|
void next() {
|
|
|
|
int l, a;
|
|
|
|
|
2009-05-14 00:10:04 +02:00
|
|
|
while (isspace(ch) | (ch == '#')) {
|
2009-05-11 23:49:29 +02:00
|
|
|
if (ch == '#') {
|
|
|
|
inp();
|
|
|
|
next();
|
|
|
|
if (tok == TOK_DEFINE) {
|
2009-06-08 23:34:26 +02:00
|
|
|
doDefine();
|
2009-06-05 01:23:40 +02:00
|
|
|
} else if (tok == TOK_PRAGMA) {
|
|
|
|
doPragma();
|
|
|
|
} else {
|
2009-06-12 04:06:24 +02:00
|
|
|
error("Unsupported preprocessor directive \"%s\"",
|
|
|
|
mTokenString.getUnwrapped());
|
2009-05-08 23:54:15 +02:00
|
|
|
}
|
|
|
|
}
|
2009-05-10 23:09:03 +02:00
|
|
|
inp();
|
2009-05-11 23:49:29 +02:00
|
|
|
}
|
|
|
|
tokl = 0;
|
|
|
|
tok = ch;
|
|
|
|
/* encode identifiers & numbers */
|
|
|
|
if (isid()) {
|
2009-06-12 04:06:24 +02:00
|
|
|
mTokenString.clear();
|
2009-05-11 23:49:29 +02:00
|
|
|
while (isid()) {
|
|
|
|
pdef(ch);
|
2009-05-10 23:09:03 +02:00
|
|
|
inp();
|
2009-05-08 23:54:15 +02:00
|
|
|
}
|
2009-05-11 23:49:29 +02:00
|
|
|
if (isdigit(tok)) {
|
2009-07-07 03:33:20 +02:00
|
|
|
// Start of a numeric constant. Could be integer, float, or
|
|
|
|
// double, won't know until we look further.
|
|
|
|
if (ch == '.' || ch == 'e' || ch == 'e'
|
|
|
|
|| ch == 'f' || ch == 'F') {
|
|
|
|
parseFloat();
|
|
|
|
} else {
|
|
|
|
// It's an integer constant
|
|
|
|
tokc = strtol(mTokenString.getUnwrapped(), 0, 0);
|
|
|
|
tok = TOK_NUM;
|
|
|
|
}
|
2009-05-11 23:49:29 +02:00
|
|
|
} else {
|
2009-06-29 23:29:08 +02:00
|
|
|
tok = mTokenTable.intern(mTokenString.getUnwrapped(),
|
|
|
|
mTokenString.len());
|
2009-06-08 23:34:26 +02:00
|
|
|
// Is this a macro?
|
2009-06-29 23:29:08 +02:00
|
|
|
char* pMacroDefinition = mTokenTable[tok].mpMacroDefinition;
|
|
|
|
if(pMacroDefinition) {
|
2009-06-08 23:34:26 +02:00
|
|
|
// Yes, it is a macro
|
2009-06-29 23:29:08 +02:00
|
|
|
dptr = pMacroDefinition;
|
2009-06-08 23:34:26 +02:00
|
|
|
dch = ch;
|
|
|
|
inp();
|
|
|
|
next();
|
2009-05-11 23:49:29 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
} else {
|
2009-05-10 23:09:03 +02:00
|
|
|
inp();
|
2009-05-11 23:49:29 +02:00
|
|
|
if (tok == '\'') {
|
|
|
|
tok = TOK_NUM;
|
2009-06-12 21:49:14 +02:00
|
|
|
tokc = getq();
|
|
|
|
if (ch != '\'') {
|
|
|
|
error("Expected a ' character, got %c", ch);
|
|
|
|
} else {
|
|
|
|
inp();
|
|
|
|
}
|
2009-05-14 00:10:04 +02:00
|
|
|
} else if ((tok == '/') & (ch == '*')) {
|
2009-05-11 23:49:29 +02:00
|
|
|
inp();
|
2009-06-12 22:12:55 +02:00
|
|
|
while (ch && ch != EOF) {
|
|
|
|
while (ch != '*' && ch != EOF)
|
2009-05-11 23:49:29 +02:00
|
|
|
inp();
|
|
|
|
inp();
|
|
|
|
if (ch == '/')
|
|
|
|
ch = 0;
|
|
|
|
}
|
2009-06-12 22:12:55 +02:00
|
|
|
if (ch == EOF) {
|
|
|
|
error("End of file inside comment.");
|
|
|
|
}
|
2009-05-11 23:49:29 +02:00
|
|
|
inp();
|
|
|
|
next();
|
2009-05-15 04:35:31 +02:00
|
|
|
} else if ((tok == '/') & (ch == '/')) {
|
|
|
|
inp();
|
2009-06-12 22:12:55 +02:00
|
|
|
while (ch && (ch != '\n') && (ch != EOF)) {
|
2009-05-15 04:35:31 +02:00
|
|
|
inp();
|
|
|
|
}
|
|
|
|
inp();
|
|
|
|
next();
|
2009-05-11 23:49:29 +02:00
|
|
|
} else {
|
2009-05-12 21:48:35 +02:00
|
|
|
const char* t = operatorChars;
|
|
|
|
int opIndex = 0;
|
2009-05-14 00:10:04 +02:00
|
|
|
while ((l = *t++) != 0) {
|
2009-05-11 23:49:29 +02:00
|
|
|
a = *t++;
|
2009-05-12 21:48:35 +02:00
|
|
|
tokl = operatorLevel[opIndex];
|
|
|
|
tokc = opIndex;
|
2009-05-14 00:10:04 +02:00
|
|
|
if ((l == tok) & ((a == ch) | (a == '@'))) {
|
2009-05-10 23:09:03 +02:00
|
|
|
#if 0
|
2009-05-11 23:49:29 +02:00
|
|
|
printf("%c%c -> tokl=%d tokc=0x%x\n",
|
|
|
|
l, a, tokl, tokc);
|
2009-05-10 23:09:03 +02:00
|
|
|
#endif
|
2009-05-11 23:49:29 +02:00
|
|
|
if (a == ch) {
|
|
|
|
inp();
|
|
|
|
tok = TOK_DUMMY; /* dummy token for double tokens */
|
|
|
|
}
|
|
|
|
break;
|
2009-05-08 23:54:15 +02:00
|
|
|
}
|
2009-05-12 21:48:35 +02:00
|
|
|
opIndex++;
|
|
|
|
}
|
|
|
|
if (l == 0) {
|
|
|
|
tokl = 0;
|
|
|
|
tokc = 0;
|
2009-05-08 23:54:15 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2009-05-10 23:09:03 +02:00
|
|
|
#if 0
|
2009-05-11 23:49:29 +02:00
|
|
|
{
|
2009-06-29 23:29:08 +02:00
|
|
|
String buf;
|
|
|
|
decodeToken(buf, tok);
|
2009-07-01 03:09:56 +02:00
|
|
|
fprintf(stderr, "%s\n", buf.getUnwrapped());
|
|
|
|
}
|
2009-05-10 23:09:03 +02:00
|
|
|
#endif
|
2009-05-11 23:49:29 +02:00
|
|
|
}
|
2009-05-08 23:54:15 +02:00
|
|
|
|
2009-06-08 23:34:26 +02:00
|
|
|
void doDefine() {
|
2009-06-29 23:29:08 +02:00
|
|
|
next();
|
|
|
|
tokenid_t name = tok;
|
2009-06-08 23:34:26 +02:00
|
|
|
String* pName = new String();
|
|
|
|
while (isspace(ch)) {
|
|
|
|
inp();
|
|
|
|
}
|
|
|
|
if (ch == '(') {
|
|
|
|
delete pName;
|
|
|
|
error("Defines with arguments not supported");
|
2009-06-11 19:53:51 +02:00
|
|
|
return;
|
2009-06-08 23:34:26 +02:00
|
|
|
}
|
|
|
|
while (isspace(ch)) {
|
|
|
|
inp();
|
|
|
|
}
|
2009-06-29 23:29:08 +02:00
|
|
|
String value;
|
2009-06-08 23:34:26 +02:00
|
|
|
while (ch != '\n' && ch != EOF) {
|
2009-06-29 23:29:08 +02:00
|
|
|
value.append(ch);
|
2009-06-08 23:34:26 +02:00
|
|
|
inp();
|
|
|
|
}
|
2009-06-29 23:29:08 +02:00
|
|
|
char* pDefn = (char*)mGlobalArena.alloc(value.len() + 1);
|
|
|
|
memcpy(pDefn, value.getUnwrapped(), value.len());
|
|
|
|
pDefn[value.len()] = 0;
|
|
|
|
mTokenTable[name].mpMacroDefinition = pDefn;
|
2009-06-08 23:34:26 +02:00
|
|
|
}
|
|
|
|
|
2009-06-05 01:23:40 +02:00
|
|
|
void doPragma() {
|
|
|
|
// # pragma name(val)
|
|
|
|
int state = 0;
|
|
|
|
while(ch != EOF && ch != '\n' && state < 10) {
|
|
|
|
switch(state) {
|
|
|
|
case 0:
|
|
|
|
if (isspace(ch)) {
|
|
|
|
inp();
|
|
|
|
} else {
|
|
|
|
state++;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
case 1:
|
|
|
|
if (isalnum(ch)) {
|
|
|
|
mPragmas.append(ch);
|
|
|
|
inp();
|
|
|
|
} else if (ch == '(') {
|
|
|
|
mPragmas.append(0);
|
|
|
|
inp();
|
|
|
|
state++;
|
|
|
|
} else {
|
|
|
|
state = 11;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
case 2:
|
|
|
|
if (isalnum(ch)) {
|
|
|
|
mPragmas.append(ch);
|
|
|
|
inp();
|
|
|
|
} else if (ch == ')') {
|
|
|
|
mPragmas.append(0);
|
|
|
|
inp();
|
|
|
|
state = 10;
|
|
|
|
} else {
|
|
|
|
state = 11;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if(state != 10) {
|
|
|
|
error("Unexpected pragma syntax");
|
|
|
|
}
|
|
|
|
mPragmaStringCount += 2;
|
|
|
|
}
|
2009-05-10 23:09:03 +02:00
|
|
|
|
2009-05-29 22:53:44 +02:00
|
|
|
virtual void verror(const char* fmt, va_list ap) {
|
2009-06-05 01:23:40 +02:00
|
|
|
mErrorBuf.printf("%ld: ", file->getLine());
|
|
|
|
mErrorBuf.vprintf(fmt, ap);
|
|
|
|
mErrorBuf.printf("\n");
|
2009-05-11 23:49:29 +02:00
|
|
|
}
|
2009-05-10 23:09:03 +02:00
|
|
|
|
2009-05-20 21:12:06 +02:00
|
|
|
void skip(intptr_t c) {
|
2009-05-11 23:49:29 +02:00
|
|
|
if (tok != c) {
|
|
|
|
error("'%c' expected", c);
|
|
|
|
}
|
|
|
|
next();
|
2009-05-08 23:54:15 +02:00
|
|
|
}
|
|
|
|
|
2009-07-01 03:09:56 +02:00
|
|
|
bool accept(intptr_t c) {
|
|
|
|
if (tok == c) {
|
|
|
|
next();
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2009-07-02 00:32:35 +02:00
|
|
|
bool acceptStringLiteral() {
|
|
|
|
if (tok == '"') {
|
2009-07-07 23:48:51 +02:00
|
|
|
pGen->li((int) glo, mkpCharPtr);
|
2009-07-02 00:32:35 +02:00
|
|
|
// This while loop merges multiple adjacent string constants.
|
|
|
|
while (tok == '"') {
|
|
|
|
while (ch != '"' && ch != EOF) {
|
2009-07-09 01:48:41 +02:00
|
|
|
*allocGlobalSpace(1,1) = getq();
|
2009-07-02 00:32:35 +02:00
|
|
|
}
|
|
|
|
if (ch != '"') {
|
|
|
|
error("Unterminated string constant.");
|
|
|
|
}
|
|
|
|
inp();
|
|
|
|
next();
|
2009-05-11 23:49:29 +02:00
|
|
|
}
|
2009-07-02 00:32:35 +02:00
|
|
|
/* Null terminate */
|
2009-05-29 02:15:32 +02:00
|
|
|
*glo = 0;
|
2009-05-30 03:03:15 +02:00
|
|
|
/* align heap */
|
2009-07-09 01:48:41 +02:00
|
|
|
allocGlobalSpace(1,(char*) (((intptr_t) glo + 4) & -4) - glo);
|
2009-07-02 00:32:35 +02:00
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
/* Parse and evaluate a unary expression.
|
|
|
|
* allowAssignment is true if '=' parsing wanted (quick hack)
|
|
|
|
*/
|
|
|
|
void unary(bool allowAssignment) {
|
|
|
|
intptr_t n, t, a;
|
|
|
|
t = 0;
|
|
|
|
n = 1; /* type of expression 0 = forward, 1 = value, other = lvalue */
|
|
|
|
if (acceptStringLiteral()) {
|
|
|
|
// Nothing else to do.
|
2009-05-11 23:49:29 +02:00
|
|
|
} else {
|
2009-07-02 00:32:35 +02:00
|
|
|
int c = tokl;
|
2009-05-11 23:49:29 +02:00
|
|
|
a = tokc;
|
2009-07-07 03:33:20 +02:00
|
|
|
double ad = tokd;
|
2009-05-11 23:49:29 +02:00
|
|
|
t = tok;
|
|
|
|
next();
|
|
|
|
if (t == TOK_NUM) {
|
2009-07-07 23:48:51 +02:00
|
|
|
pGen->li(a, mkpInt);
|
2009-07-07 03:33:20 +02:00
|
|
|
} else if (t == TOK_NUM_FLOAT) {
|
2009-07-08 22:04:41 +02:00
|
|
|
// Align to 4-byte boundary
|
|
|
|
glo = (char*) (((intptr_t) glo + 3) & -4);
|
|
|
|
* (float*) glo = (float) ad;
|
|
|
|
pGen->loadFloat((int) glo, mkpFloat);
|
|
|
|
glo += 4;
|
2009-07-07 03:33:20 +02:00
|
|
|
} else if (t == TOK_NUM_DOUBLE) {
|
2009-07-08 22:04:41 +02:00
|
|
|
// Align to 8-byte boundary
|
|
|
|
glo = (char*) (((intptr_t) glo + 7) & -8);
|
|
|
|
* (double*) glo = ad;
|
|
|
|
pGen->loadFloat((int) glo, mkpDouble);
|
|
|
|
glo += 8;
|
2009-05-11 23:49:29 +02:00
|
|
|
} else if (c == 2) {
|
|
|
|
/* -, +, !, ~ */
|
2009-07-02 00:32:35 +02:00
|
|
|
unary(false);
|
2009-05-11 23:49:29 +02:00
|
|
|
if (t == '!')
|
2009-07-09 05:40:31 +02:00
|
|
|
pGen->gUnaryCmp(a, mkpInt);
|
|
|
|
else if (t == '+') {
|
|
|
|
// ignore unary plus.
|
|
|
|
} else {
|
2009-07-07 02:24:34 +02:00
|
|
|
pGen->genUnaryOp(a);
|
2009-07-09 05:40:31 +02:00
|
|
|
}
|
2009-05-11 23:49:29 +02:00
|
|
|
} else if (t == '(') {
|
|
|
|
expr();
|
2009-05-10 23:09:03 +02:00
|
|
|
skip(')');
|
2009-05-11 23:49:29 +02:00
|
|
|
} else if (t == '*') {
|
2009-07-02 23:46:19 +02:00
|
|
|
/* This is a pointer dereference, but we currently only
|
|
|
|
* support a pointer dereference if it's immediately
|
|
|
|
* in front of a cast. So parse the cast right here.
|
|
|
|
*/
|
2009-05-10 23:09:03 +02:00
|
|
|
skip('(');
|
2009-07-02 23:46:19 +02:00
|
|
|
Type* pCast = expectCastTypeDeclaration(mLocalArena);
|
|
|
|
// We currently only handle 3 types of cast:
|
|
|
|
// (int*), (char*) , (int (*)())
|
|
|
|
if(typeEqual(pCast, mkpIntPtr)) {
|
|
|
|
t = TOK_INT;
|
|
|
|
} else if (typeEqual(pCast, mkpCharPtr)) {
|
|
|
|
t = TOK_CHAR;
|
2009-07-09 01:48:41 +02:00
|
|
|
} else if (typeEqual(pCast, mkpFloatPtr)) {
|
|
|
|
t = TOK_FLOAT;
|
|
|
|
} else if (typeEqual(pCast, mkpDoublePtr)) {
|
|
|
|
t = TOK_DOUBLE;
|
2009-07-02 23:46:19 +02:00
|
|
|
} else if (typeEqual(pCast, mkpPtrIntFn)){
|
2009-05-11 23:49:29 +02:00
|
|
|
t = 0;
|
2009-07-02 23:46:19 +02:00
|
|
|
} else {
|
|
|
|
String buffer;
|
|
|
|
decodeType(buffer, pCast);
|
|
|
|
error("Unsupported cast type %s", buffer.getUnwrapped());
|
|
|
|
decodeType(buffer, mkpPtrIntFn);
|
2009-05-11 23:49:29 +02:00
|
|
|
}
|
2009-05-10 23:09:03 +02:00
|
|
|
skip(')');
|
2009-07-02 00:32:35 +02:00
|
|
|
unary(false);
|
2009-07-06 21:07:15 +02:00
|
|
|
if (accept('=')) {
|
2009-05-22 21:06:27 +02:00
|
|
|
pGen->pushR0();
|
2009-05-11 23:49:29 +02:00
|
|
|
expr();
|
2009-07-07 02:24:34 +02:00
|
|
|
pGen->storeR0ToTOS(pCast);
|
2009-05-11 23:49:29 +02:00
|
|
|
} else if (t) {
|
2009-07-07 02:24:34 +02:00
|
|
|
pGen->loadR0FromR0(pCast);
|
2009-05-11 23:49:29 +02:00
|
|
|
}
|
2009-07-02 23:46:19 +02:00
|
|
|
// Else we fall through to the function call below, with
|
|
|
|
// t == 0 to trigger an indirect function call. Hack!
|
2009-05-11 23:49:29 +02:00
|
|
|
} else if (t == '&') {
|
2009-07-07 23:48:51 +02:00
|
|
|
VariableInfo* pVI = VI(tok);
|
|
|
|
pGen->leaR0((int) pVI->pAddress,
|
|
|
|
createPtrType(pVI->pType, mLocalArena));
|
2009-05-10 23:09:03 +02:00
|
|
|
next();
|
2009-06-12 04:06:24 +02:00
|
|
|
} else if (t == EOF ) {
|
|
|
|
error("Unexpected EOF.");
|
2009-07-02 00:32:35 +02:00
|
|
|
} else if (!checkSymbol(t)) {
|
2009-06-12 23:40:04 +02:00
|
|
|
// Don't have to do anything special here, the error
|
|
|
|
// message was printed by checkSymbol() above.
|
2009-05-11 23:49:29 +02:00
|
|
|
} else {
|
2009-06-29 23:29:08 +02:00
|
|
|
if (!isDefined(t)) {
|
|
|
|
mGlobals.add(t);
|
|
|
|
// printf("Adding new global function %s\n", nameof(t));
|
2009-06-12 04:06:24 +02:00
|
|
|
}
|
2009-07-07 23:48:51 +02:00
|
|
|
VariableInfo* pVI = VI(t);
|
|
|
|
n = (intptr_t) pVI->pAddress;
|
2009-05-11 23:49:29 +02:00
|
|
|
/* forward reference: try dlsym */
|
2009-05-14 20:38:49 +02:00
|
|
|
if (!n) {
|
2009-07-02 00:32:35 +02:00
|
|
|
n = (intptr_t) dlsym(RTLD_DEFAULT, nameof(t));
|
2009-07-08 22:04:41 +02:00
|
|
|
if (tok == '(') {
|
|
|
|
pVI->pType = mkpIntFn;
|
|
|
|
} else {
|
|
|
|
pVI->pType = mkpInt;
|
|
|
|
}
|
2009-07-07 23:48:51 +02:00
|
|
|
pVI->pAddress = (void*) n;
|
2009-05-14 20:38:49 +02:00
|
|
|
}
|
2009-07-02 00:32:35 +02:00
|
|
|
if ((tok == '=') & allowAssignment) {
|
2009-05-11 23:49:29 +02:00
|
|
|
/* assignment */
|
2009-05-10 23:09:03 +02:00
|
|
|
next();
|
2009-05-11 23:49:29 +02:00
|
|
|
expr();
|
2009-07-09 01:48:41 +02:00
|
|
|
pGen->storeR0(n, pVI->pType);
|
2009-05-11 23:49:29 +02:00
|
|
|
} else if (tok != '(') {
|
|
|
|
/* variable */
|
2009-06-12 20:25:59 +02:00
|
|
|
if (!n) {
|
2009-07-02 00:32:35 +02:00
|
|
|
error("Undefined variable %s", nameof(t));
|
2009-06-12 20:25:59 +02:00
|
|
|
}
|
2009-07-07 23:48:51 +02:00
|
|
|
pGen->loadR0(n, tokl == 11, tokc, pVI->pType);
|
2009-05-11 23:49:29 +02:00
|
|
|
if (tokl == 11) {
|
|
|
|
next();
|
|
|
|
}
|
2009-05-08 23:54:15 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2009-05-10 23:09:03 +02:00
|
|
|
|
2009-05-11 23:49:29 +02:00
|
|
|
/* function call */
|
2009-07-07 23:48:51 +02:00
|
|
|
if (accept('(')) {
|
2009-07-08 22:04:41 +02:00
|
|
|
Type* pArgList = NULL;
|
|
|
|
VariableInfo* pVI = NULL;
|
|
|
|
if (n == 1) { // Indirect function call, push address of fn.
|
|
|
|
pArgList = pGen->getR0Type()->pTail;
|
2009-05-22 21:06:27 +02:00
|
|
|
pGen->pushR0();
|
2009-07-08 22:04:41 +02:00
|
|
|
} else {
|
|
|
|
pVI = VI(t);
|
|
|
|
pArgList = pVI->pType->pTail;
|
|
|
|
}
|
|
|
|
bool varArgs = pArgList == NULL;
|
2009-05-11 23:49:29 +02:00
|
|
|
/* push args and invert order */
|
2009-05-14 20:38:49 +02:00
|
|
|
a = pGen->beginFunctionCallArguments();
|
2009-07-02 00:32:35 +02:00
|
|
|
int l = 0;
|
2009-06-12 21:49:14 +02:00
|
|
|
while (tok != ')' && tok != EOF) {
|
2009-07-08 22:04:41 +02:00
|
|
|
if (! varArgs && !pArgList) {
|
|
|
|
error ("Unexpected argument.");
|
|
|
|
}
|
2009-05-11 23:49:29 +02:00
|
|
|
expr();
|
2009-07-08 22:04:41 +02:00
|
|
|
Type* pTargetType;
|
|
|
|
if (pArgList) {
|
|
|
|
pTargetType = pArgList->pHead;
|
|
|
|
pArgList = pArgList->pTail;
|
|
|
|
} else {
|
|
|
|
pTargetType = pGen->getR0Type();
|
|
|
|
if (pTargetType->tag == TY_FLOAT) {
|
|
|
|
pTargetType = mkpDouble;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
pGen->convertR0(pTargetType);
|
|
|
|
l += pGen->storeR0ToArg(l);
|
2009-07-06 21:07:15 +02:00
|
|
|
if (accept(',')) {
|
|
|
|
// fine
|
|
|
|
} else if ( tok != ')') {
|
|
|
|
error("Expected ',' or ')'");
|
|
|
|
}
|
2009-05-11 23:49:29 +02:00
|
|
|
}
|
2009-07-08 22:04:41 +02:00
|
|
|
if (! varArgs && pArgList) {
|
|
|
|
error ("Expected more argument(s).");
|
|
|
|
}
|
2009-05-14 20:38:49 +02:00
|
|
|
pGen->endFunctionCallArguments(a, l);
|
2009-06-12 21:49:14 +02:00
|
|
|
skip(')');
|
2009-05-11 23:49:29 +02:00
|
|
|
if (!n) {
|
|
|
|
/* forward reference */
|
2009-07-07 23:48:51 +02:00
|
|
|
pVI->pForward = (void*) pGen->callForward((int) pVI->pForward,
|
|
|
|
pVI->pType);
|
2009-05-11 23:49:29 +02:00
|
|
|
} else if (n == 1) {
|
2009-07-07 23:48:51 +02:00
|
|
|
pGen->callIndirect(l, mkpPtrIntFn->pHead);
|
2009-05-11 23:49:29 +02:00
|
|
|
} else {
|
2009-07-07 23:48:51 +02:00
|
|
|
pGen->callRelative(n - codeBuf.getPC() - pGen->jumpOffset(),
|
|
|
|
VI(t)->pType);
|
2009-05-11 23:49:29 +02:00
|
|
|
}
|
2009-06-18 04:13:52 +02:00
|
|
|
pGen->adjustStackAfterCall(l, n == 1);
|
2009-05-08 23:54:15 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-07-02 00:32:35 +02:00
|
|
|
/* Recursive descent parser for binary operations.
|
|
|
|
*/
|
|
|
|
void binaryOp(int level) {
|
2009-05-20 21:12:06 +02:00
|
|
|
intptr_t t, n, a;
|
2009-05-14 00:10:04 +02:00
|
|
|
t = 0;
|
2009-07-02 00:32:35 +02:00
|
|
|
if (level-- == 1)
|
|
|
|
unary(true);
|
2009-05-11 23:49:29 +02:00
|
|
|
else {
|
2009-07-02 00:32:35 +02:00
|
|
|
binaryOp(level);
|
2009-05-11 23:49:29 +02:00
|
|
|
a = 0;
|
2009-07-02 00:32:35 +02:00
|
|
|
while (level == tokl) {
|
2009-05-11 23:49:29 +02:00
|
|
|
n = tok;
|
|
|
|
t = tokc;
|
|
|
|
next();
|
2009-05-11 20:54:30 +02:00
|
|
|
|
2009-07-02 00:32:35 +02:00
|
|
|
if (level > 8) {
|
2009-05-12 21:48:35 +02:00
|
|
|
a = pGen->gtst(t == OP_LOGICAL_OR, a); /* && and || output code generation */
|
2009-07-02 00:32:35 +02:00
|
|
|
binaryOp(level);
|
2009-05-10 23:09:03 +02:00
|
|
|
} else {
|
2009-05-22 21:06:27 +02:00
|
|
|
pGen->pushR0();
|
2009-07-02 00:32:35 +02:00
|
|
|
binaryOp(level);
|
2009-05-11 23:49:29 +02:00
|
|
|
|
2009-07-02 00:32:35 +02:00
|
|
|
if ((level == 4) | (level == 5)) {
|
2009-07-09 05:40:31 +02:00
|
|
|
pGen->gcmp(t, mkpInt);
|
2009-05-11 23:49:29 +02:00
|
|
|
} else {
|
2009-05-12 21:48:35 +02:00
|
|
|
pGen->genOp(t);
|
2009-05-11 23:49:29 +02:00
|
|
|
}
|
2009-05-08 23:54:15 +02:00
|
|
|
}
|
|
|
|
}
|
2009-05-11 23:49:29 +02:00
|
|
|
/* && and || output code generation */
|
2009-07-02 00:32:35 +02:00
|
|
|
if (a && level > 8) {
|
2009-05-12 21:48:35 +02:00
|
|
|
a = pGen->gtst(t == OP_LOGICAL_OR, a);
|
2009-07-07 23:48:51 +02:00
|
|
|
pGen->li(t != OP_LOGICAL_OR, mkpInt);
|
2009-05-14 01:24:17 +02:00
|
|
|
pGen->gjmp(5); /* jmp $ + 5 (sizeof li, FIXME for ARM) */
|
2009-05-12 21:48:35 +02:00
|
|
|
pGen->gsym(a);
|
2009-07-07 23:48:51 +02:00
|
|
|
pGen->li(t == OP_LOGICAL_OR, mkpInt);
|
2009-05-11 23:49:29 +02:00
|
|
|
}
|
2009-05-08 23:54:15 +02:00
|
|
|
}
|
|
|
|
}
|
2009-05-10 23:09:03 +02:00
|
|
|
|
2009-05-11 23:49:29 +02:00
|
|
|
void expr() {
|
2009-07-02 00:32:35 +02:00
|
|
|
binaryOp(11);
|
2009-05-11 23:49:29 +02:00
|
|
|
}
|
2009-05-08 23:54:15 +02:00
|
|
|
|
2009-05-11 23:49:29 +02:00
|
|
|
int test_expr() {
|
|
|
|
expr();
|
2009-05-12 21:48:35 +02:00
|
|
|
return pGen->gtst(0, 0);
|
2009-05-11 23:49:29 +02:00
|
|
|
}
|
2009-05-11 04:59:24 +02:00
|
|
|
|
2009-06-12 20:25:59 +02:00
|
|
|
void block(intptr_t l, bool outermostFunctionBlock) {
|
2009-05-20 21:12:06 +02:00
|
|
|
intptr_t a, n, t;
|
2009-05-10 23:09:03 +02:00
|
|
|
|
2009-07-06 21:07:15 +02:00
|
|
|
Type* pBaseType;
|
|
|
|
if ((pBaseType = acceptPrimitiveType(mLocalArena))) {
|
2009-06-12 23:40:04 +02:00
|
|
|
/* declarations */
|
2009-07-06 21:07:15 +02:00
|
|
|
localDeclarations(pBaseType);
|
2009-06-12 23:40:04 +02:00
|
|
|
} else if (tok == TOK_IF) {
|
2009-05-10 23:09:03 +02:00
|
|
|
next();
|
2009-05-11 23:49:29 +02:00
|
|
|
skip('(');
|
2009-05-10 23:09:03 +02:00
|
|
|
a = test_expr();
|
2009-05-11 23:49:29 +02:00
|
|
|
skip(')');
|
2009-06-12 20:25:59 +02:00
|
|
|
block(l, false);
|
2009-05-11 23:49:29 +02:00
|
|
|
if (tok == TOK_ELSE) {
|
|
|
|
next();
|
2009-05-12 21:48:35 +02:00
|
|
|
n = pGen->gjmp(0); /* jmp */
|
|
|
|
pGen->gsym(a);
|
2009-06-12 20:25:59 +02:00
|
|
|
block(l, false);
|
2009-05-12 21:48:35 +02:00
|
|
|
pGen->gsym(n); /* patch else jmp */
|
2009-05-11 23:49:29 +02:00
|
|
|
} else {
|
2009-05-12 21:48:35 +02:00
|
|
|
pGen->gsym(a); /* patch if test */
|
2009-05-11 23:49:29 +02:00
|
|
|
}
|
2009-05-14 00:10:04 +02:00
|
|
|
} else if ((tok == TOK_WHILE) | (tok == TOK_FOR)) {
|
2009-05-11 23:49:29 +02:00
|
|
|
t = tok;
|
|
|
|
next();
|
|
|
|
skip('(');
|
|
|
|
if (t == TOK_WHILE) {
|
2009-05-14 01:24:17 +02:00
|
|
|
n = codeBuf.getPC(); // top of loop, target of "next" iteration
|
2009-05-10 23:09:03 +02:00
|
|
|
a = test_expr();
|
2009-05-11 23:49:29 +02:00
|
|
|
} else {
|
|
|
|
if (tok != ';')
|
|
|
|
expr();
|
|
|
|
skip(';');
|
|
|
|
n = codeBuf.getPC();
|
|
|
|
a = 0;
|
|
|
|
if (tok != ';')
|
|
|
|
a = test_expr();
|
|
|
|
skip(';');
|
|
|
|
if (tok != ')') {
|
2009-05-12 21:48:35 +02:00
|
|
|
t = pGen->gjmp(0);
|
2009-05-11 23:49:29 +02:00
|
|
|
expr();
|
2009-05-14 01:24:17 +02:00
|
|
|
pGen->gjmp(n - codeBuf.getPC() - pGen->jumpOffset());
|
2009-05-12 21:48:35 +02:00
|
|
|
pGen->gsym(t);
|
2009-05-11 23:49:29 +02:00
|
|
|
n = t + 4;
|
|
|
|
}
|
2009-05-08 23:54:15 +02:00
|
|
|
}
|
2009-05-11 23:49:29 +02:00
|
|
|
skip(')');
|
2009-06-12 20:25:59 +02:00
|
|
|
block((intptr_t) &a, false);
|
2009-05-14 01:24:17 +02:00
|
|
|
pGen->gjmp(n - codeBuf.getPC() - pGen->jumpOffset()); /* jmp */
|
2009-05-12 21:48:35 +02:00
|
|
|
pGen->gsym(a);
|
2009-05-11 23:49:29 +02:00
|
|
|
} else if (tok == '{') {
|
2009-06-12 20:25:59 +02:00
|
|
|
if (! outermostFunctionBlock) {
|
2009-06-29 23:29:08 +02:00
|
|
|
mLocals.pushLevel();
|
2009-06-12 20:25:59 +02:00
|
|
|
}
|
2009-05-10 23:09:03 +02:00
|
|
|
next();
|
2009-06-12 04:06:24 +02:00
|
|
|
while (tok != '}' && tok != EOF)
|
2009-06-12 20:25:59 +02:00
|
|
|
block(l, false);
|
2009-06-12 04:06:24 +02:00
|
|
|
skip('}');
|
2009-06-12 20:25:59 +02:00
|
|
|
if (! outermostFunctionBlock) {
|
2009-06-29 23:29:08 +02:00
|
|
|
mLocals.popLevel();
|
2009-06-12 20:25:59 +02:00
|
|
|
}
|
2009-05-11 23:49:29 +02:00
|
|
|
} else {
|
2009-07-06 21:07:15 +02:00
|
|
|
if (accept(TOK_RETURN)) {
|
2009-07-07 23:48:51 +02:00
|
|
|
if (tok != ';') {
|
2009-05-11 23:49:29 +02:00
|
|
|
expr();
|
2009-07-07 23:48:51 +02:00
|
|
|
pGen->convertR0(pReturnType);
|
|
|
|
}
|
2009-05-12 21:48:35 +02:00
|
|
|
rsym = pGen->gjmp(rsym); /* jmp */
|
2009-07-06 21:07:15 +02:00
|
|
|
} else if (accept(TOK_BREAK)) {
|
2009-05-12 21:48:35 +02:00
|
|
|
*(int *) l = pGen->gjmp(*(int *) l);
|
2009-05-11 23:49:29 +02:00
|
|
|
} else if (tok != ';')
|
|
|
|
expr();
|
|
|
|
skip(';');
|
|
|
|
}
|
2009-05-08 23:54:15 +02:00
|
|
|
}
|
|
|
|
|
2009-07-02 23:46:19 +02:00
|
|
|
bool typeEqual(Type* a, Type* b) {
|
|
|
|
if (a == b) {
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
if (a == NULL || b == NULL) {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
TypeTag at = a->tag;
|
|
|
|
if (at != b->tag) {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
if (at == TY_POINTER) {
|
|
|
|
return typeEqual(a->pHead, b->pHead);
|
|
|
|
} else if (at == TY_FUNC || at == TY_PARAM) {
|
|
|
|
return typeEqual(a->pHead, b->pHead)
|
|
|
|
&& typeEqual(a->pTail, b->pTail);
|
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2009-07-01 03:09:56 +02:00
|
|
|
Type* createType(TypeTag tag, Type* pHead, Type* pTail, Arena& arena) {
|
|
|
|
assert(tag >= TY_INT && tag <= TY_PARAM);
|
|
|
|
Type* pType = (Type*) arena.alloc(sizeof(Type));
|
|
|
|
memset(pType, 0, sizeof(*pType));
|
|
|
|
pType->tag = tag;
|
|
|
|
pType->pHead = pHead;
|
|
|
|
pType->pTail = pTail;
|
|
|
|
return pType;
|
2009-06-05 04:56:13 +02:00
|
|
|
}
|
|
|
|
|
2009-07-02 23:46:19 +02:00
|
|
|
Type* createPtrType(Type* pType, Arena& arena) {
|
|
|
|
return createType(TY_POINTER, pType, NULL, arena);
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Try to print a type in declaration order
|
|
|
|
*/
|
2009-07-01 03:09:56 +02:00
|
|
|
void decodeType(String& buffer, Type* pType) {
|
2009-07-02 23:46:19 +02:00
|
|
|
buffer.clear();
|
2009-07-01 03:09:56 +02:00
|
|
|
if (pType == NULL) {
|
|
|
|
buffer.appendCStr("null");
|
|
|
|
return;
|
|
|
|
}
|
2009-07-02 23:46:19 +02:00
|
|
|
decodeTypeImp(buffer, pType);
|
|
|
|
}
|
|
|
|
|
|
|
|
void decodeTypeImp(String& buffer, Type* pType) {
|
|
|
|
decodeTypeImpPrefix(buffer, pType);
|
|
|
|
|
2009-07-01 03:09:56 +02:00
|
|
|
String temp;
|
|
|
|
if (pType->id != 0) {
|
|
|
|
decodeToken(temp, pType->id);
|
|
|
|
buffer.append(temp);
|
2009-07-02 23:46:19 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
decodeTypeImpPostfix(buffer, pType);
|
|
|
|
}
|
|
|
|
|
|
|
|
void decodeTypeImpPrefix(String& buffer, Type* pType) {
|
|
|
|
TypeTag tag = pType->tag;
|
|
|
|
|
|
|
|
if (tag >= TY_INT && tag <= TY_VOID) {
|
|
|
|
switch (tag) {
|
|
|
|
case TY_INT:
|
|
|
|
buffer.appendCStr("int");
|
|
|
|
break;
|
|
|
|
case TY_CHAR:
|
|
|
|
buffer.appendCStr("char");
|
|
|
|
break;
|
|
|
|
case TY_VOID:
|
|
|
|
buffer.appendCStr("void");
|
|
|
|
break;
|
2009-07-06 21:07:15 +02:00
|
|
|
case TY_FLOAT:
|
|
|
|
buffer.appendCStr("float");
|
|
|
|
break;
|
|
|
|
case TY_DOUBLE:
|
|
|
|
buffer.appendCStr("double");
|
|
|
|
break;
|
2009-07-02 23:46:19 +02:00
|
|
|
default:
|
|
|
|
break;
|
|
|
|
}
|
2009-07-01 03:09:56 +02:00
|
|
|
buffer.append(' ');
|
|
|
|
}
|
2009-07-02 23:46:19 +02:00
|
|
|
|
|
|
|
switch (tag) {
|
2009-07-01 03:09:56 +02:00
|
|
|
case TY_INT:
|
|
|
|
break;
|
|
|
|
case TY_CHAR:
|
|
|
|
break;
|
|
|
|
case TY_VOID:
|
2009-07-02 23:46:19 +02:00
|
|
|
break;
|
2009-07-06 21:07:15 +02:00
|
|
|
case TY_FLOAT:
|
|
|
|
break;
|
|
|
|
case TY_DOUBLE:
|
|
|
|
break;
|
2009-07-01 03:09:56 +02:00
|
|
|
case TY_POINTER:
|
2009-07-02 23:46:19 +02:00
|
|
|
decodeTypeImpPrefix(buffer, pType->pHead);
|
|
|
|
if(pType->pHead && pType->pHead->tag == TY_FUNC) {
|
|
|
|
buffer.append('(');
|
|
|
|
}
|
|
|
|
buffer.append('*');
|
2009-07-01 03:09:56 +02:00
|
|
|
break;
|
|
|
|
case TY_FUNC:
|
2009-07-02 23:46:19 +02:00
|
|
|
decodeTypeImp(buffer, pType->pHead);
|
2009-07-01 03:09:56 +02:00
|
|
|
break;
|
|
|
|
case TY_PARAM:
|
2009-07-02 23:46:19 +02:00
|
|
|
decodeTypeImp(buffer, pType->pHead);
|
2009-07-01 03:09:56 +02:00
|
|
|
break;
|
|
|
|
default:
|
|
|
|
String temp;
|
|
|
|
temp.printf("Unknown tag %d", pType->tag);
|
|
|
|
buffer.append(temp);
|
|
|
|
break;
|
|
|
|
}
|
2009-07-02 23:46:19 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
void decodeTypeImpPostfix(String& buffer, Type* pType) {
|
|
|
|
TypeTag tag = pType->tag;
|
|
|
|
|
|
|
|
switch(tag) {
|
|
|
|
case TY_POINTER:
|
|
|
|
if(pType->pHead && pType->pHead->tag == TY_FUNC) {
|
|
|
|
buffer.append(')');
|
|
|
|
}
|
|
|
|
decodeTypeImpPostfix(buffer, pType->pHead);
|
|
|
|
break;
|
|
|
|
case TY_FUNC:
|
|
|
|
buffer.append('(');
|
|
|
|
for(Type* pArg = pType->pTail; pArg; pArg = pArg->pTail) {
|
|
|
|
decodeTypeImp(buffer, pArg);
|
|
|
|
if (pArg->pTail) {
|
|
|
|
buffer.appendCStr(", ");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
buffer.append(')');
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
break;
|
2009-07-01 03:09:56 +02:00
|
|
|
}
|
2009-06-05 04:56:13 +02:00
|
|
|
}
|
|
|
|
|
2009-07-01 03:09:56 +02:00
|
|
|
void printType(Type* pType) {
|
|
|
|
String buffer;
|
|
|
|
decodeType(buffer, pType);
|
|
|
|
fprintf(stderr, "%s\n", buffer.getUnwrapped());
|
2009-06-05 04:56:13 +02:00
|
|
|
}
|
|
|
|
|
2009-07-01 03:09:56 +02:00
|
|
|
Type* acceptPrimitiveType(Arena& arena) {
|
|
|
|
Type* pType;
|
2009-06-05 04:56:13 +02:00
|
|
|
if (tok == TOK_INT) {
|
2009-07-01 03:09:56 +02:00
|
|
|
pType = mkpInt;
|
2009-06-05 04:56:13 +02:00
|
|
|
} else if (tok == TOK_CHAR) {
|
2009-07-01 03:09:56 +02:00
|
|
|
pType = mkpChar;
|
2009-06-05 04:56:13 +02:00
|
|
|
} else if (tok == TOK_VOID) {
|
2009-07-01 03:09:56 +02:00
|
|
|
pType = mkpVoid;
|
2009-07-06 21:07:15 +02:00
|
|
|
} else if (tok == TOK_FLOAT) {
|
|
|
|
pType = mkpFloat;
|
|
|
|
} else if (tok == TOK_DOUBLE) {
|
|
|
|
pType = mkpDouble;
|
2009-06-05 04:56:13 +02:00
|
|
|
} else {
|
2009-07-01 03:09:56 +02:00
|
|
|
return NULL;
|
2009-06-05 04:56:13 +02:00
|
|
|
}
|
|
|
|
next();
|
2009-07-01 03:09:56 +02:00
|
|
|
return pType;
|
|
|
|
}
|
|
|
|
|
2009-07-02 23:46:19 +02:00
|
|
|
Type* acceptDeclaration(Type* pType, bool nameAllowed, bool nameRequired,
|
|
|
|
Arena& arena) {
|
|
|
|
tokenid_t declName = 0;
|
|
|
|
pType = acceptDecl2(pType, declName, nameAllowed,
|
|
|
|
nameRequired, arena);
|
|
|
|
if (declName) {
|
|
|
|
// Clone the parent type so we can set a unique ID
|
|
|
|
pType = createType(pType->tag, pType->pHead,
|
|
|
|
pType->pTail, arena);
|
|
|
|
|
2009-07-01 03:09:56 +02:00
|
|
|
pType->id = declName;
|
2009-07-02 23:46:19 +02:00
|
|
|
}
|
|
|
|
// fprintf(stderr, "Parsed a declaration: ");
|
|
|
|
// printType(pType);
|
|
|
|
return pType;
|
|
|
|
}
|
|
|
|
|
|
|
|
Type* expectDeclaration(Type* pBaseType, Arena& arena) {
|
|
|
|
Type* pType = acceptDeclaration(pBaseType, true, true, arena);
|
|
|
|
if (! pType) {
|
|
|
|
error("Expected a declaration");
|
2009-07-01 03:09:56 +02:00
|
|
|
}
|
|
|
|
return pType;
|
|
|
|
}
|
|
|
|
|
2009-07-02 23:46:19 +02:00
|
|
|
/* Used for accepting types that appear in casts */
|
|
|
|
Type* acceptCastTypeDeclaration(Arena& arena) {
|
|
|
|
Type* pType = acceptPrimitiveType(arena);
|
|
|
|
if (pType) {
|
|
|
|
pType = acceptDeclaration(pType, false, false, arena);
|
|
|
|
}
|
|
|
|
return pType;
|
|
|
|
}
|
|
|
|
|
|
|
|
Type* expectCastTypeDeclaration(Arena& arena) {
|
|
|
|
Type* pType = acceptCastTypeDeclaration(arena);
|
2009-07-01 03:09:56 +02:00
|
|
|
if (! pType) {
|
|
|
|
error("Expected a declaration");
|
|
|
|
}
|
|
|
|
return pType;
|
2009-06-05 04:56:13 +02:00
|
|
|
}
|
|
|
|
|
2009-07-02 23:46:19 +02:00
|
|
|
Type* acceptDecl2(Type* pType, tokenid_t& declName,
|
|
|
|
bool nameAllowed, bool nameRequired, Arena& arena) {
|
|
|
|
int ptrCounter = 0;
|
|
|
|
while (accept('*')) {
|
|
|
|
ptrCounter++;
|
|
|
|
}
|
|
|
|
pType = acceptDecl3(pType, declName, nameAllowed, nameRequired, arena);
|
|
|
|
while (ptrCounter-- > 0) {
|
2009-07-01 03:09:56 +02:00
|
|
|
pType = createType(TY_POINTER, pType, NULL, arena);
|
2009-06-05 04:56:13 +02:00
|
|
|
}
|
2009-07-01 03:09:56 +02:00
|
|
|
return pType;
|
|
|
|
}
|
|
|
|
|
2009-07-02 23:46:19 +02:00
|
|
|
Type* acceptDecl3(Type* pType, tokenid_t& declName,
|
|
|
|
bool nameAllowed, bool nameRequired, Arena& arena) {
|
|
|
|
// direct-dcl :
|
|
|
|
// name
|
|
|
|
// (dcl)
|
|
|
|
// direct-dcl()
|
|
|
|
// direct-dcl[]
|
|
|
|
Type* pNewHead = NULL;
|
2009-07-01 03:09:56 +02:00
|
|
|
if (accept('(')) {
|
2009-07-02 23:46:19 +02:00
|
|
|
pNewHead = acceptDecl2(pNewHead, declName, nameAllowed,
|
|
|
|
nameRequired, arena);
|
2009-07-01 03:09:56 +02:00
|
|
|
skip(')');
|
2009-07-02 23:46:19 +02:00
|
|
|
} else if ((declName = acceptSymbol()) != 0) {
|
|
|
|
if (nameAllowed == false && declName) {
|
|
|
|
error("Symbol %s not allowed here", nameof(declName));
|
|
|
|
} else if (nameRequired && ! declName) {
|
|
|
|
String temp;
|
|
|
|
decodeToken(temp, tok);
|
|
|
|
error("Expected symbol. Got %s", temp.getUnwrapped());
|
|
|
|
}
|
2009-06-05 04:56:13 +02:00
|
|
|
}
|
2009-07-02 23:46:19 +02:00
|
|
|
while (accept('(')) {
|
2009-07-01 03:09:56 +02:00
|
|
|
// Function declaration
|
2009-07-02 23:46:19 +02:00
|
|
|
Type* pTail = acceptArgs(nameAllowed, arena);
|
2009-07-01 03:09:56 +02:00
|
|
|
pType = createType(TY_FUNC, pType, pTail, arena);
|
|
|
|
skip(')');
|
|
|
|
}
|
2009-07-02 23:46:19 +02:00
|
|
|
|
|
|
|
if (pNewHead) {
|
|
|
|
Type* pA = pNewHead;
|
|
|
|
while (pA->pHead) {
|
|
|
|
pA = pA->pHead;
|
|
|
|
}
|
|
|
|
pA->pHead = pType;
|
|
|
|
pType = pNewHead;
|
|
|
|
}
|
2009-07-01 03:09:56 +02:00
|
|
|
return pType;
|
|
|
|
}
|
|
|
|
|
2009-07-02 23:46:19 +02:00
|
|
|
Type* acceptArgs(bool nameAllowed, Arena& arena) {
|
2009-07-01 03:09:56 +02:00
|
|
|
Type* pHead = NULL;
|
|
|
|
Type* pTail = NULL;
|
|
|
|
for(;;) {
|
|
|
|
Type* pBaseArg = acceptPrimitiveType(arena);
|
|
|
|
if (pBaseArg) {
|
2009-07-02 23:46:19 +02:00
|
|
|
Type* pArg = acceptDeclaration(pBaseArg, nameAllowed, false,
|
|
|
|
arena);
|
2009-07-01 03:09:56 +02:00
|
|
|
if (pArg) {
|
|
|
|
Type* pParam = createType(TY_PARAM, pArg, NULL, arena);
|
|
|
|
if (!pHead) {
|
|
|
|
pHead = pParam;
|
|
|
|
pTail = pParam;
|
|
|
|
} else {
|
|
|
|
pTail->pTail = pParam;
|
|
|
|
pTail = pParam;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (! accept(',')) {
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return pHead;
|
2009-06-05 04:56:13 +02:00
|
|
|
}
|
|
|
|
|
2009-07-01 03:09:56 +02:00
|
|
|
Type* expectPrimitiveType(Arena& arena) {
|
|
|
|
Type* pType = acceptPrimitiveType(arena);
|
|
|
|
if (!pType) {
|
2009-06-29 23:29:08 +02:00
|
|
|
String buf;
|
|
|
|
decodeToken(buf, tok);
|
|
|
|
error("Expected a type, got %s", buf.getUnwrapped());
|
2009-06-05 04:56:13 +02:00
|
|
|
}
|
2009-07-01 03:09:56 +02:00
|
|
|
return pType;
|
2009-06-05 04:56:13 +02:00
|
|
|
}
|
|
|
|
|
2009-07-01 03:09:56 +02:00
|
|
|
void addGlobalSymbol(Type* pDecl) {
|
|
|
|
tokenid_t t = pDecl->id;
|
|
|
|
VariableInfo* pVI = VI(t);
|
2009-06-29 23:29:08 +02:00
|
|
|
if(pVI && pVI->pAddress) {
|
2009-07-01 03:09:56 +02:00
|
|
|
reportDuplicate(t);
|
2009-06-29 23:29:08 +02:00
|
|
|
}
|
2009-07-01 03:09:56 +02:00
|
|
|
mGlobals.add(pDecl);
|
2009-06-12 20:25:59 +02:00
|
|
|
}
|
|
|
|
|
2009-07-01 03:09:56 +02:00
|
|
|
void reportDuplicate(tokenid_t t) {
|
|
|
|
error("Duplicate definition of %s", nameof(t));
|
2009-06-12 04:06:24 +02:00
|
|
|
}
|
|
|
|
|
2009-07-01 03:09:56 +02:00
|
|
|
void addLocalSymbol(Type* pDecl) {
|
|
|
|
tokenid_t t = pDecl->id;
|
|
|
|
if (mLocals.isDefinedAtCurrentLevel(t)) {
|
|
|
|
reportDuplicate(t);
|
2009-06-29 23:29:08 +02:00
|
|
|
}
|
2009-07-01 03:09:56 +02:00
|
|
|
mLocals.add(pDecl);
|
2009-06-12 04:06:24 +02:00
|
|
|
}
|
|
|
|
|
2009-07-06 21:07:15 +02:00
|
|
|
void localDeclarations(Type* pBaseType) {
|
2009-05-20 21:12:06 +02:00
|
|
|
intptr_t a;
|
2009-06-05 04:56:13 +02:00
|
|
|
|
2009-07-06 21:07:15 +02:00
|
|
|
while (pBaseType) {
|
2009-06-12 22:12:55 +02:00
|
|
|
while (tok != ';' && tok != EOF) {
|
2009-07-01 03:09:56 +02:00
|
|
|
Type* pDecl = expectDeclaration(pBaseType, mLocalArena);
|
|
|
|
if (!pDecl) {
|
|
|
|
break;
|
2009-06-12 20:25:59 +02:00
|
|
|
}
|
2009-07-01 03:09:56 +02:00
|
|
|
int variableAddress = 0;
|
|
|
|
addLocalSymbol(pDecl);
|
2009-07-07 02:24:34 +02:00
|
|
|
loc = loc + pGen->sizeOf(pDecl);
|
2009-07-01 03:09:56 +02:00
|
|
|
loc = loc + 4;
|
|
|
|
variableAddress = -loc;
|
|
|
|
VI(pDecl->id)->pAddress = (void*) variableAddress;
|
|
|
|
if (accept('=')) {
|
2009-06-12 23:26:58 +02:00
|
|
|
/* assignment */
|
|
|
|
expr();
|
2009-07-09 01:48:41 +02:00
|
|
|
pGen->storeR0(variableAddress, pDecl);
|
2009-06-12 23:26:58 +02:00
|
|
|
}
|
2009-06-05 04:56:13 +02:00
|
|
|
if (tok == ',')
|
|
|
|
next();
|
|
|
|
}
|
|
|
|
skip(';');
|
2009-07-06 21:07:15 +02:00
|
|
|
pBaseType = acceptPrimitiveType(mLocalArena);
|
2009-06-05 04:56:13 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-06-12 22:53:51 +02:00
|
|
|
bool checkSymbol() {
|
2009-07-02 00:32:35 +02:00
|
|
|
return checkSymbol(tok);
|
2009-06-12 23:40:04 +02:00
|
|
|
}
|
|
|
|
|
2009-06-29 23:29:08 +02:00
|
|
|
void decodeToken(String& buffer, tokenid_t token) {
|
|
|
|
if (token == EOF ) {
|
|
|
|
buffer.printf("EOF");
|
|
|
|
} else if (token == TOK_NUM) {
|
|
|
|
buffer.printf("numeric constant");
|
|
|
|
} else if (token >= 0 && token < 256) {
|
2009-07-01 03:09:56 +02:00
|
|
|
if (token < 32) {
|
|
|
|
buffer.printf("'\\x%02x'", token);
|
|
|
|
} else {
|
|
|
|
buffer.printf("'%c'", token);
|
|
|
|
}
|
2009-06-29 23:29:08 +02:00
|
|
|
} else if (token >= TOK_KEYWORD && token < TOK_SYMBOL) {
|
|
|
|
buffer.printf("keyword \"%s\"", nameof(token));
|
|
|
|
} else {
|
|
|
|
buffer.printf("symbol \"%s\"", nameof(token));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-07-02 00:32:35 +02:00
|
|
|
bool checkSymbol(tokenid_t token) {
|
2009-06-29 23:29:08 +02:00
|
|
|
bool result = token >= TOK_SYMBOL;
|
2009-06-12 22:53:51 +02:00
|
|
|
if (!result) {
|
|
|
|
String temp;
|
2009-06-29 23:29:08 +02:00
|
|
|
decodeToken(temp, token);
|
2009-06-12 22:53:51 +02:00
|
|
|
error("Expected symbol. Got %s", temp.getUnwrapped());
|
|
|
|
}
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
2009-07-01 03:09:56 +02:00
|
|
|
tokenid_t acceptSymbol() {
|
|
|
|
tokenid_t result = 0;
|
|
|
|
if (tok >= TOK_SYMBOL) {
|
|
|
|
result = tok;
|
|
|
|
next();
|
|
|
|
}
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
2009-06-05 04:56:13 +02:00
|
|
|
void globalDeclarations() {
|
|
|
|
while (tok != EOF) {
|
2009-07-01 03:09:56 +02:00
|
|
|
Type* pBaseType = expectPrimitiveType(mGlobalArena);
|
|
|
|
if (!pBaseType) {
|
2009-06-12 22:53:51 +02:00
|
|
|
break;
|
|
|
|
}
|
2009-07-01 03:09:56 +02:00
|
|
|
Type* pDecl = expectDeclaration(pBaseType, mGlobalArena);
|
|
|
|
if (!pDecl) {
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if (! isDefined(pDecl->id)) {
|
|
|
|
addGlobalSymbol(pDecl);
|
2009-06-12 20:25:59 +02:00
|
|
|
}
|
2009-07-01 03:09:56 +02:00
|
|
|
VariableInfo* name = VI(pDecl->id);
|
2009-06-12 20:25:59 +02:00
|
|
|
if (name && name->pAddress) {
|
2009-07-01 03:09:56 +02:00
|
|
|
error("Already defined global %s", nameof(pDecl->id));
|
2009-06-12 20:25:59 +02:00
|
|
|
}
|
2009-07-01 03:09:56 +02:00
|
|
|
if (pDecl->tag < TY_FUNC) {
|
2009-06-05 04:56:13 +02:00
|
|
|
// it's a variable declaration
|
|
|
|
for(;;) {
|
2009-07-01 03:09:56 +02:00
|
|
|
if (name && !name->pAddress) {
|
2009-07-09 01:48:41 +02:00
|
|
|
name->pAddress = (int*) allocGlobalSpace(
|
|
|
|
pGen->alignment(name->pType),
|
|
|
|
pGen->sizeOf(name->pType));
|
2009-06-12 20:25:59 +02:00
|
|
|
}
|
2009-07-01 03:09:56 +02:00
|
|
|
if (accept('=')) {
|
2009-06-12 23:26:58 +02:00
|
|
|
if (tok == TOK_NUM) {
|
|
|
|
if (name) {
|
|
|
|
* (int*) name->pAddress = tokc;
|
|
|
|
}
|
|
|
|
next();
|
|
|
|
} else {
|
|
|
|
error("Expected an integer constant");
|
|
|
|
}
|
|
|
|
}
|
2009-07-01 03:09:56 +02:00
|
|
|
if (!accept(',')) {
|
2009-06-05 04:56:13 +02:00
|
|
|
break;
|
2009-05-11 23:49:29 +02:00
|
|
|
}
|
2009-07-01 03:09:56 +02:00
|
|
|
pDecl = expectDeclaration(pBaseType, mGlobalArena);
|
|
|
|
if (!pDecl) {
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if (! isDefined(pDecl->id)) {
|
|
|
|
addGlobalSymbol(pDecl);
|
|
|
|
}
|
|
|
|
name = VI(pDecl->id);
|
2009-05-11 23:49:29 +02:00
|
|
|
}
|
|
|
|
skip(';');
|
|
|
|
} else {
|
2009-07-01 03:09:56 +02:00
|
|
|
// Function declaration
|
2009-07-06 21:07:15 +02:00
|
|
|
if (accept(';')) {
|
|
|
|
// forward declaration.
|
|
|
|
} else {
|
|
|
|
if (name) {
|
|
|
|
/* patch forward references (XXX: does not work for function
|
|
|
|
pointers) */
|
|
|
|
pGen->gsym((int) name->pForward);
|
|
|
|
/* put function address */
|
|
|
|
name->pAddress = (void*) codeBuf.getPC();
|
|
|
|
}
|
|
|
|
// Calculate stack offsets for parameters
|
|
|
|
mLocals.pushLevel();
|
|
|
|
intptr_t a = 8;
|
|
|
|
int argCount = 0;
|
|
|
|
for (Type* pP = pDecl->pTail; pP; pP = pP->pTail) {
|
|
|
|
Type* pArg = pP->pHead;
|
|
|
|
addLocalSymbol(pArg);
|
|
|
|
/* read param name and compute offset */
|
|
|
|
VI(pArg->id)->pAddress = (void*) a;
|
2009-07-09 01:48:41 +02:00
|
|
|
a = a + pGen->stackSizeOf(pArg);
|
2009-07-06 21:07:15 +02:00
|
|
|
argCount++;
|
|
|
|
}
|
|
|
|
rsym = loc = 0;
|
2009-07-07 23:48:51 +02:00
|
|
|
pReturnType = pDecl->pHead;
|
2009-07-06 21:07:15 +02:00
|
|
|
a = pGen->functionEntry(argCount);
|
|
|
|
block(0, true);
|
|
|
|
pGen->gsym(rsym);
|
|
|
|
pGen->functionExit(argCount, a, loc);
|
|
|
|
mLocals.popLevel();
|
2009-05-11 23:49:29 +02:00
|
|
|
}
|
2009-05-08 23:54:15 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2009-05-11 23:49:29 +02:00
|
|
|
|
2009-07-09 01:48:41 +02:00
|
|
|
char* allocGlobalSpace(size_t alignment, size_t bytes) {
|
|
|
|
size_t base = (((size_t) glo) + alignment - 1) & ~(alignment-1);
|
|
|
|
size_t end = base + bytes;
|
2009-07-09 05:40:31 +02:00
|
|
|
if ((end - (size_t) pGlobalBase) > (size_t) ALLOC_SIZE) {
|
2009-05-30 03:03:15 +02:00
|
|
|
error("Global space exhausted");
|
2009-06-11 19:53:51 +02:00
|
|
|
return NULL;
|
2009-05-30 03:03:15 +02:00
|
|
|
}
|
2009-07-09 01:48:41 +02:00
|
|
|
char* result = (char*) base;
|
|
|
|
glo = (char*) end;
|
2009-05-30 03:03:15 +02:00
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
2009-05-11 23:49:29 +02:00
|
|
|
void cleanup() {
|
|
|
|
if (pGlobalBase != 0) {
|
2009-05-30 03:03:15 +02:00
|
|
|
free(pGlobalBase);
|
2009-05-11 23:49:29 +02:00
|
|
|
pGlobalBase = 0;
|
|
|
|
}
|
|
|
|
if (pGen) {
|
|
|
|
delete pGen;
|
|
|
|
pGen = 0;
|
|
|
|
}
|
2009-05-22 21:06:27 +02:00
|
|
|
if (file) {
|
|
|
|
delete file;
|
|
|
|
file = 0;
|
|
|
|
}
|
2009-05-11 23:49:29 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
void clear() {
|
|
|
|
tok = 0;
|
|
|
|
tokc = 0;
|
|
|
|
tokl = 0;
|
|
|
|
ch = 0;
|
|
|
|
rsym = 0;
|
|
|
|
loc = 0;
|
|
|
|
glo = 0;
|
|
|
|
dptr = 0;
|
|
|
|
dch = 0;
|
|
|
|
file = 0;
|
|
|
|
pGlobalBase = 0;
|
|
|
|
pGen = 0;
|
2009-06-05 01:23:40 +02:00
|
|
|
mPragmaStringCount = 0;
|
2009-05-11 23:49:29 +02:00
|
|
|
}
|
2009-05-08 23:54:15 +02:00
|
|
|
|
2009-05-13 19:58:45 +02:00
|
|
|
void setArchitecture(const char* architecture) {
|
|
|
|
delete pGen;
|
|
|
|
pGen = 0;
|
|
|
|
|
|
|
|
if (architecture != NULL) {
|
2009-05-20 02:12:17 +02:00
|
|
|
#ifdef PROVIDE_ARM_CODEGEN
|
2009-05-20 21:12:06 +02:00
|
|
|
if (! pGen && strcmp(architecture, "arm") == 0) {
|
2009-05-13 19:58:45 +02:00
|
|
|
pGen = new ARMCodeGenerator();
|
2009-05-20 21:12:06 +02:00
|
|
|
}
|
2009-05-20 02:12:17 +02:00
|
|
|
#endif
|
|
|
|
#ifdef PROVIDE_X86_CODEGEN
|
2009-05-20 21:12:06 +02:00
|
|
|
if (! pGen && strcmp(architecture, "x86") == 0) {
|
2009-05-13 19:58:45 +02:00
|
|
|
pGen = new X86CodeGenerator();
|
2009-05-20 21:12:06 +02:00
|
|
|
}
|
2009-05-20 02:12:17 +02:00
|
|
|
#endif
|
2009-05-20 21:12:06 +02:00
|
|
|
if (!pGen ) {
|
2009-05-29 22:53:44 +02:00
|
|
|
error("Unknown architecture %s\n", architecture);
|
2009-05-13 19:58:45 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (pGen == NULL) {
|
2009-05-20 02:12:17 +02:00
|
|
|
#if defined(DEFAULT_ARM_CODEGEN)
|
2009-05-13 19:58:45 +02:00
|
|
|
pGen = new ARMCodeGenerator();
|
2009-05-20 02:12:17 +02:00
|
|
|
#elif defined(DEFAULT_X86_CODEGEN)
|
|
|
|
pGen = new X86CodeGenerator();
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
if (pGen == NULL) {
|
2009-05-29 22:53:44 +02:00
|
|
|
error("No code generator defined.");
|
2009-06-11 19:53:51 +02:00
|
|
|
} else {
|
|
|
|
pGen->setErrorSink(this);
|
2009-05-13 19:58:45 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-05-11 04:59:24 +02:00
|
|
|
public:
|
2009-05-13 19:58:45 +02:00
|
|
|
struct args {
|
|
|
|
args() {
|
|
|
|
architecture = 0;
|
|
|
|
}
|
|
|
|
const char* architecture;
|
|
|
|
};
|
|
|
|
|
2009-05-20 02:12:17 +02:00
|
|
|
Compiler() {
|
2009-05-11 23:49:29 +02:00
|
|
|
clear();
|
|
|
|
}
|
2009-05-11 20:54:30 +02:00
|
|
|
|
2009-05-20 02:12:17 +02:00
|
|
|
~Compiler() {
|
2009-05-11 23:49:29 +02:00
|
|
|
cleanup();
|
|
|
|
}
|
2009-05-11 20:54:30 +02:00
|
|
|
|
2009-05-22 21:06:27 +02:00
|
|
|
int compile(const char* text, size_t textLength) {
|
2009-05-29 22:53:44 +02:00
|
|
|
int result;
|
2009-06-11 19:53:51 +02:00
|
|
|
|
|
|
|
cleanup();
|
|
|
|
clear();
|
2009-06-29 23:29:08 +02:00
|
|
|
mTokenTable.setArena(&mGlobalArena);
|
|
|
|
mGlobals.setArena(&mGlobalArena);
|
|
|
|
mGlobals.setTokenTable(&mTokenTable);
|
|
|
|
mLocals.setArena(&mLocalArena);
|
|
|
|
mLocals.setTokenTable(&mTokenTable);
|
|
|
|
|
|
|
|
internKeywords();
|
2009-07-01 03:09:56 +02:00
|
|
|
createPrimitiveTypes();
|
2009-06-11 19:53:51 +02:00
|
|
|
codeBuf.init(ALLOC_SIZE);
|
|
|
|
setArchitecture(NULL);
|
|
|
|
if (!pGen) {
|
|
|
|
return -1;
|
|
|
|
}
|
2009-06-12 06:12:23 +02:00
|
|
|
#ifdef PROVIDE_TRACE_CODEGEN
|
|
|
|
pGen = new TraceCodeGenerator(pGen);
|
|
|
|
#endif
|
|
|
|
pGen->setErrorSink(this);
|
2009-06-11 19:53:51 +02:00
|
|
|
pGen->init(&codeBuf);
|
|
|
|
file = new TextInputStream(text, textLength);
|
|
|
|
pGlobalBase = (char*) calloc(1, ALLOC_SIZE);
|
|
|
|
glo = pGlobalBase;
|
|
|
|
inp();
|
|
|
|
next();
|
|
|
|
globalDeclarations();
|
2009-06-12 20:25:59 +02:00
|
|
|
checkForUndefinedForwardReferences();
|
2009-06-11 19:53:51 +02:00
|
|
|
result = pGen->finishCompile();
|
|
|
|
if (result == 0) {
|
|
|
|
if (mErrorBuf.len()) {
|
|
|
|
result = -2;
|
2009-05-29 22:53:44 +02:00
|
|
|
}
|
2009-05-20 21:12:06 +02:00
|
|
|
}
|
2009-05-29 22:53:44 +02:00
|
|
|
return result;
|
2009-05-08 23:54:15 +02:00
|
|
|
}
|
2009-05-11 20:54:30 +02:00
|
|
|
|
2009-07-01 03:09:56 +02:00
|
|
|
void createPrimitiveTypes() {
|
|
|
|
mkpInt = createType(TY_INT, NULL, NULL, mGlobalArena);
|
|
|
|
mkpChar = createType(TY_CHAR, NULL, NULL, mGlobalArena);
|
|
|
|
mkpVoid = createType(TY_VOID, NULL, NULL, mGlobalArena);
|
2009-07-06 21:07:15 +02:00
|
|
|
mkpFloat = createType(TY_FLOAT, NULL, NULL, mGlobalArena);
|
|
|
|
mkpDouble = createType(TY_DOUBLE, NULL, NULL, mGlobalArena);
|
2009-07-07 23:48:51 +02:00
|
|
|
mkpIntFn = createType(TY_FUNC, mkpInt, NULL, mGlobalArena);
|
2009-07-02 23:46:19 +02:00
|
|
|
mkpIntPtr = createPtrType(mkpInt, mGlobalArena);
|
|
|
|
mkpCharPtr = createPtrType(mkpChar, mGlobalArena);
|
2009-07-08 22:04:41 +02:00
|
|
|
mkpFloatPtr = createPtrType(mkpFloat, mGlobalArena);
|
|
|
|
mkpDoublePtr = createPtrType(mkpDouble, mGlobalArena);
|
2009-07-07 23:48:51 +02:00
|
|
|
mkpPtrIntFn = createPtrType(mkpIntFn, mGlobalArena);
|
2009-07-01 03:09:56 +02:00
|
|
|
}
|
|
|
|
|
2009-06-12 20:25:59 +02:00
|
|
|
void checkForUndefinedForwardReferences() {
|
2009-06-29 23:29:08 +02:00
|
|
|
mGlobals.forEach(static_ufrcFn, this);
|
2009-06-12 20:25:59 +02:00
|
|
|
}
|
|
|
|
|
2009-06-29 23:29:08 +02:00
|
|
|
static bool static_ufrcFn(VariableInfo* value, void* context) {
|
2009-06-12 20:25:59 +02:00
|
|
|
Compiler* pCompiler = (Compiler*) context;
|
2009-06-29 23:29:08 +02:00
|
|
|
return pCompiler->undefinedForwardReferenceCheck(value);
|
2009-06-12 20:25:59 +02:00
|
|
|
}
|
|
|
|
|
2009-06-29 23:29:08 +02:00
|
|
|
bool undefinedForwardReferenceCheck(VariableInfo* value) {
|
2009-06-12 20:25:59 +02:00
|
|
|
if (!value->pAddress && value->pForward) {
|
2009-06-29 23:29:08 +02:00
|
|
|
error("Undefined forward reference: %s",
|
|
|
|
mTokenTable[value->tok].pText);
|
2009-06-12 20:25:59 +02:00
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2009-05-11 23:49:29 +02:00
|
|
|
int dump(FILE* out) {
|
|
|
|
fwrite(codeBuf.getBase(), 1, codeBuf.getSize(), out);
|
|
|
|
return 0;
|
|
|
|
}
|
2009-05-11 04:59:24 +02:00
|
|
|
|
2009-05-14 01:24:17 +02:00
|
|
|
int disassemble(FILE* out) {
|
|
|
|
return pGen->disassemble(out);
|
|
|
|
}
|
|
|
|
|
2009-05-22 21:06:27 +02:00
|
|
|
/* Look through the symbol table to find a symbol.
|
|
|
|
* If found, return its value.
|
|
|
|
*/
|
|
|
|
void* lookup(const char* name) {
|
2009-06-29 23:29:08 +02:00
|
|
|
tokenid_t tok = mTokenTable.intern(name, strlen(name));
|
|
|
|
VariableInfo* pVariableInfo = VI(tok);
|
2009-06-12 04:06:24 +02:00
|
|
|
if (pVariableInfo) {
|
|
|
|
return pVariableInfo->pAddress;
|
2009-05-22 21:06:27 +02:00
|
|
|
}
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2009-06-05 01:23:40 +02:00
|
|
|
void getPragmas(ACCsizei* actualStringCount,
|
|
|
|
ACCsizei maxStringCount, ACCchar** strings) {
|
|
|
|
int stringCount = mPragmaStringCount;
|
|
|
|
if (actualStringCount) {
|
|
|
|
*actualStringCount = stringCount;
|
|
|
|
}
|
|
|
|
if (stringCount > maxStringCount) {
|
|
|
|
stringCount = maxStringCount;
|
|
|
|
}
|
|
|
|
if (strings) {
|
|
|
|
char* pPragmas = mPragmas.getUnwrapped();
|
|
|
|
while (stringCount-- > 0) {
|
|
|
|
*strings++ = pPragmas;
|
|
|
|
pPragmas += strlen(pPragmas) + 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-05-29 22:53:44 +02:00
|
|
|
char* getErrorMessage() {
|
2009-06-05 01:23:40 +02:00
|
|
|
return mErrorBuf.getUnwrapped();
|
2009-05-29 22:53:44 +02:00
|
|
|
}
|
|
|
|
|
2009-05-11 23:49:29 +02:00
|
|
|
};
|
2009-05-11 20:54:30 +02:00
|
|
|
|
2009-05-20 02:12:17 +02:00
|
|
|
const char* Compiler::operatorChars =
|
2009-05-12 21:48:35 +02:00
|
|
|
"++--*@/@%@+@-@<<>><=>=<@>@==!=&&||&@^@|@~@!@";
|
|
|
|
|
2009-05-20 02:12:17 +02:00
|
|
|
const char Compiler::operatorLevel[] =
|
2009-05-12 21:48:35 +02:00
|
|
|
{11, 11, 1, 1, 1, 2, 2, 3, 3, 4, 4, 4, 4,
|
|
|
|
5, 5, /* ==, != */
|
|
|
|
9, 10, /* &&, || */
|
|
|
|
6, 7, 8, /* & ^ | */
|
|
|
|
2, 2 /* ~ ! */
|
|
|
|
};
|
|
|
|
|
2009-05-20 21:12:06 +02:00
|
|
|
#ifdef PROVIDE_ARM_CODEGEN
|
2009-05-20 02:12:17 +02:00
|
|
|
FILE* Compiler::ARMCodeGenerator::disasmOut;
|
2009-05-20 21:12:06 +02:00
|
|
|
#endif
|
2009-05-14 01:24:17 +02:00
|
|
|
|
2009-05-20 21:12:06 +02:00
|
|
|
#ifdef PROVIDE_X86_CODEGEN
|
2009-05-20 02:12:17 +02:00
|
|
|
const int Compiler::X86CodeGenerator::operatorHelper[] = {
|
2009-05-12 21:48:35 +02:00
|
|
|
0x1, // ++
|
|
|
|
0xff, // --
|
|
|
|
0xc1af0f, // *
|
|
|
|
0xf9f79991, // /
|
|
|
|
0xf9f79991, // % (With manual assist to swap results)
|
|
|
|
0xc801, // +
|
|
|
|
0xd8f7c829, // -
|
|
|
|
0xe0d391, // <<
|
|
|
|
0xf8d391, // >>
|
|
|
|
0xe, // <=
|
|
|
|
0xd, // >=
|
|
|
|
0xc, // <
|
|
|
|
0xf, // >
|
|
|
|
0x4, // ==
|
|
|
|
0x5, // !=
|
|
|
|
0x0, // &&
|
|
|
|
0x1, // ||
|
|
|
|
0xc821, // &
|
|
|
|
0xc831, // ^
|
|
|
|
0xc809, // |
|
|
|
|
0xd0f7, // ~
|
|
|
|
0x4 // !
|
|
|
|
};
|
2009-05-20 21:12:06 +02:00
|
|
|
#endif
|
2009-05-12 21:48:35 +02:00
|
|
|
|
2009-05-22 21:06:27 +02:00
|
|
|
struct ACCscript {
|
|
|
|
ACCscript() {
|
|
|
|
text = 0;
|
|
|
|
textLength = 0;
|
|
|
|
accError = ACC_NO_ERROR;
|
|
|
|
}
|
2009-05-11 20:54:30 +02:00
|
|
|
|
2009-05-22 21:06:27 +02:00
|
|
|
~ACCscript() {
|
|
|
|
delete text;
|
|
|
|
}
|
2009-05-14 00:10:04 +02:00
|
|
|
|
2009-05-22 21:06:27 +02:00
|
|
|
void setError(ACCenum error) {
|
|
|
|
if (accError == ACC_NO_ERROR && error != ACC_NO_ERROR) {
|
|
|
|
accError = error;
|
2009-05-11 20:54:30 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-05-22 21:06:27 +02:00
|
|
|
ACCenum getError() {
|
|
|
|
ACCenum result = accError;
|
|
|
|
accError = ACC_NO_ERROR;
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
Compiler compiler;
|
|
|
|
char* text;
|
|
|
|
int textLength;
|
|
|
|
ACCenum accError;
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
extern "C"
|
|
|
|
ACCscript* accCreateScript() {
|
|
|
|
return new ACCscript();
|
|
|
|
}
|
|
|
|
|
|
|
|
extern "C"
|
|
|
|
ACCenum accGetError( ACCscript* script ) {
|
|
|
|
return script->getError();
|
|
|
|
}
|
|
|
|
|
|
|
|
extern "C"
|
|
|
|
void accDeleteScript(ACCscript* script) {
|
|
|
|
delete script;
|
|
|
|
}
|
|
|
|
|
|
|
|
extern "C"
|
|
|
|
void accScriptSource(ACCscript* script,
|
|
|
|
ACCsizei count,
|
|
|
|
const ACCchar ** string,
|
|
|
|
const ACCint * length) {
|
|
|
|
int totalLength = 0;
|
|
|
|
for(int i = 0; i < count; i++) {
|
|
|
|
int len = -1;
|
|
|
|
const ACCchar* s = string[i];
|
|
|
|
if (length) {
|
|
|
|
len = length[i];
|
|
|
|
}
|
|
|
|
if (len < 0) {
|
|
|
|
len = strlen(s);
|
|
|
|
}
|
|
|
|
totalLength += len;
|
2009-05-11 20:54:30 +02:00
|
|
|
}
|
2009-05-22 21:06:27 +02:00
|
|
|
delete script->text;
|
|
|
|
char* text = new char[totalLength + 1];
|
|
|
|
script->text = text;
|
|
|
|
script->textLength = totalLength;
|
2009-05-27 21:25:55 +02:00
|
|
|
char* dest = text;
|
2009-05-22 21:06:27 +02:00
|
|
|
for(int i = 0; i < count; i++) {
|
|
|
|
int len = -1;
|
|
|
|
const ACCchar* s = string[i];
|
|
|
|
if (length) {
|
|
|
|
len = length[i];
|
|
|
|
}
|
|
|
|
if (len < 0) {
|
|
|
|
len = strlen(s);
|
|
|
|
}
|
2009-05-27 21:25:55 +02:00
|
|
|
memcpy(dest, s, len);
|
|
|
|
dest += len;
|
2009-05-20 02:12:17 +02:00
|
|
|
}
|
2009-05-22 21:06:27 +02:00
|
|
|
text[totalLength] = '\0';
|
|
|
|
}
|
|
|
|
|
|
|
|
extern "C"
|
|
|
|
void accCompileScript(ACCscript* script) {
|
|
|
|
int result = script->compiler.compile(script->text, script->textLength);
|
|
|
|
if (result) {
|
|
|
|
script->setError(ACC_INVALID_OPERATION);
|
2009-05-11 20:54:30 +02:00
|
|
|
}
|
2009-05-22 21:06:27 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
extern "C"
|
|
|
|
void accGetScriptiv(ACCscript* script,
|
|
|
|
ACCenum pname,
|
|
|
|
ACCint * params) {
|
|
|
|
switch (pname) {
|
|
|
|
case ACC_INFO_LOG_LENGTH:
|
|
|
|
*params = 0;
|
|
|
|
break;
|
2009-05-11 20:54:30 +02:00
|
|
|
}
|
2009-05-22 21:06:27 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
extern "C"
|
|
|
|
void accGetScriptInfoLog(ACCscript* script,
|
|
|
|
ACCsizei maxLength,
|
|
|
|
ACCsizei * length,
|
|
|
|
ACCchar * infoLog) {
|
2009-05-29 22:53:44 +02:00
|
|
|
char* message = script->compiler.getErrorMessage();
|
|
|
|
int messageLength = strlen(message) + 1;
|
2009-05-22 21:06:27 +02:00
|
|
|
if (length) {
|
2009-05-29 22:53:44 +02:00
|
|
|
*length = messageLength;
|
2009-05-14 01:24:17 +02:00
|
|
|
}
|
2009-05-29 22:53:44 +02:00
|
|
|
if (infoLog && maxLength > 0) {
|
|
|
|
int trimmedLength = maxLength < messageLength ?
|
|
|
|
maxLength : messageLength;
|
|
|
|
memcpy(infoLog, message, trimmedLength);
|
|
|
|
infoLog[trimmedLength] = 0;
|
2009-05-11 20:54:30 +02:00
|
|
|
}
|
2009-05-22 21:06:27 +02:00
|
|
|
}
|
2009-05-11 20:54:30 +02:00
|
|
|
|
2009-05-22 21:06:27 +02:00
|
|
|
extern "C"
|
|
|
|
void accGetScriptLabel(ACCscript* script, const ACCchar * name,
|
|
|
|
ACCvoid ** address) {
|
|
|
|
void* value = script->compiler.lookup(name);
|
|
|
|
if (value) {
|
|
|
|
*address = value;
|
|
|
|
} else {
|
|
|
|
script->setError(ACC_INVALID_VALUE);
|
|
|
|
}
|
2009-05-11 20:54:30 +02:00
|
|
|
}
|
2009-05-22 21:06:27 +02:00
|
|
|
|
2009-06-05 01:23:40 +02:00
|
|
|
extern "C"
|
|
|
|
void accGetPragmas(ACCscript* script, ACCsizei* actualStringCount,
|
|
|
|
ACCsizei maxStringCount, ACCchar** strings){
|
|
|
|
script->compiler.getPragmas(actualStringCount, maxStringCount, strings);
|
|
|
|
}
|
|
|
|
|
2009-06-18 04:13:52 +02:00
|
|
|
extern "C"
|
|
|
|
void accDisassemble(ACCscript* script) {
|
|
|
|
script->compiler.disassemble(stderr);
|
|
|
|
}
|
|
|
|
|
2009-06-05 01:23:40 +02:00
|
|
|
|
2009-05-22 21:06:27 +02:00
|
|
|
} // namespace acc
|
|
|
|
|