X-Git-Url: https://git.xonotic.org/?a=blobdiff_plain;f=gmqcc.h;h=58e12cfd3f193d713d99132f2b4df863b55706aa;hb=f103544c95f7bda51446ab5f34d15a84fbf3d1bb;hp=7c32c48779a0a6319609886065b914582766766b;hpb=fcc83306f1fc22f72369f5c2b832f87c0bcc1d04;p=xonotic%2Fgmqcc.git diff --git a/gmqcc.h b/gmqcc.h index 7c32c48..58e12cf 100644 --- a/gmqcc.h +++ b/gmqcc.h @@ -1,6 +1,6 @@ /* - * Copyright (C) 2012 - * Dale Weiler + * Copyright (C) 2012 + * Dale Weiler, Wolfgang Bumiller * * Permission is hereby granted, free of charge, to any person obtaining a copy of * this software and associated documentation files (the "Software"), to deal in @@ -22,210 +22,748 @@ */ #ifndef GMQCC_HDR #define GMQCC_HDR +#include +#include +#include #include +#include -//=================================================================== -//============================ lex.c ================================ -//=================================================================== -struct lex_file { - FILE *file; - char peek [5]; - char lastok[8192]; - - int last; - int current; - int length; - int size; -}; +#define GMQCC_VERSION_MAJOR 0 +#define GMQCC_VERSION_MINOR 1 +#define GMQCC_VERSION_PATCH 0 +#define GMQCC_VERSION_BUILD(J,N,P) (((J)<<16)|((N)<<8)|(P)) +#define GMQCC_VERSION \ + GMQCC_VERSION_BUILD(GMQCC_VERSION_MAJOR, GMQCC_VERSION_MINOR, GMQCC_VERSION_PATCH) /* - * It's important that this table never exceed 32 keywords, the ascii - * table starts at 33 (and we don't want conflicts) + * We cannoy rely on C99 at all, since compilers like MSVC + * simply don't support it. We define our own boolean type + * as a result (since we cannot include ). For + * compilers that are in 1999 mode (C99 compliant) we can use + * the language keyword _Bool which can allow for better code + * on GCC and GCC-like compilers, opposed to `int`. */ -#define TOKEN_DO 0 -#define TOKEN_ELSE 1 -#define TOKEN_IF 2 -#define TOKEN_WHILE 3 -#define TOKEN_BREAK 4 -#define TOKEN_CONTINUE 5 -#define TOKEN_RETURN 6 -#define TOKEN_GOTO 7 -#define TOKEN_FOR 8 // extension -#define TOKEN_TYPEDEF 9 // extension - -// ensure the token types are out of the -// bounds of anyothers that may conflict. -#define TOKEN_FLOAT 110 -#define TOKEN_VECTOR 111 -#define TOKEN_STRING 112 -#define TOKEN_ENTITY 113 -#define TOKEN_VOID 114 +#ifndef __cplusplus +# ifdef false +# undef false +# endif /* !false */ +# ifdef true +# undef true +# endif /* !true */ +# define false (0) +# define true (1) +# ifdef __STDC_VERSION__ +# if __STDC_VERSION__ < 199901L && __GNUC__ < 3 + typedef int bool; +# else + typedef _Bool bool; +# endif +# else + typedef int bool; +# endif /* !__STDC_VERSION__ */ +#endif /* !__cplusplus */ /* - * Lexer state constants, these are numbers for where exactly in - * the lexing the lexer is at. Or where it decided to stop if a lexer - * error occurs. These numbers must be > where the ascii-table ends - * and > the last type token which is TOKEN_VOID + * Of some functions which are generated we want to make sure + * that the result isn't ignored. To find such function calls, + * we use this macro. */ -#define LEX_COMMENT 1128 -#define LEX_CHRLIT 1129 -#define LEX_STRLIT 1130 -#define LEX_IDENT 1131 - -int lex_token(struct lex_file *); -void lex_reset(struct lex_file *); -void lex_close(struct lex_file *); -struct lex_file *lex_open (FILE *); - -//=================================================================== -//========================== error.c ================================ -//=================================================================== -#define ERROR_LEX (SHRT_MAX+0) -#define ERROR_PARSE (SHRT_MAX+1) -#define ERROR_INTERNAL (SHRT_MAX+2) -#define ERROR_COMPILER (SHRT_MAX+3) -#define ERROR_PREPRO (SHRT_MAX+4) -int error(int, const char *, ...); - -//=================================================================== -//========================== parse.c ================================ -//=================================================================== -int parse_tree(struct lex_file *); -struct parsenode { - struct parsenode *next; - int type; /* some token */ -}; +#if defined(__GNUC__) || defined(__CLANG__) +# define GMQCC_WARN __attribute__((warn_unused_result)) +#else +# define GMQCC_WARN +#endif +/* + * This is a hack to silent clang regarding empty + * body if statements. + */ +#define GMQCC_SUPPRESS_EMPTY_BODY do { } while (0) -//=================================================================== -//========================== typedef.c ============================== -//=================================================================== -typedef struct typedef_node_t { - char *name; -} typedef_node; +/* + * Inline is not supported in < C90, however some compilers + * like gcc and clang might have an inline attribute we can + * use if present. + */ +#ifdef __STDC_VERSION__ +# if __STDC_VERSION__ < 199901L +# if defined(__GNUC__) || defined (__CLANG__) +# if __GNUC__ < 2 +# define GMQCC_INLINE +# else +# define GMQCC_INLINE __attribute__ ((always_inline)) +# endif +# else +# define GMQCC_INLINE +# endif +# else +# define GMQCC_INLINE inline +# endif +#else +# define GMQCC_INLINE +#endif /* !__STDC_VERSION__ */ -void typedef_init(); -void typedef_clear(); -typedef_node *typedef_find(const char *); -int typedef_add (const char *, const char *); +/* + * noreturn is present in GCC and clang + * it's required for _ast_node_destory otherwise -Wmissing-noreturn + * in clang complains about there being no return since abort() is + * called. + */ +#if (defined(__GNUC__) && __GNUC__ >= 2) || defined(__CLANG__) +# define GMQCC_NORETURN __attribute__ ((noreturn)) +#else +# define GMQCC_NORETURN +#endif +/* + * stdint.h and inttypes.h -less subset + * for systems that don't have it, which we must + * assume is all systems. (int8_t not required) + */ +#if CHAR_MIN == -128 + typedef unsigned char uint8_t; /* same as below */ +#elif SCHAR_MIN == -128 + typedef unsigned char uint8_t; /* same as above */ +#endif +#if SHRT_MAX == 0x7FFF + typedef short int16_t; + typedef unsigned short uint16_t; +#elif INT_MAX == 0x7FFF + typedef int int16_t; + typedef unsigned int uint16_t; +#endif +#if INT_MAX == 0x7FFFFFFF + typedef int int32_t; + typedef unsigned int uint32_t; + typedef long int64_t; + typedef unsigned long uint64_t; +#elif LONG_MAX == 0x7FFFFFFF + typedef long int32_t; + typedef unsigned long uint32_t; -//=================================================================== -//=========================== util.c ================================ -//=================================================================== -void *util_memory_a(unsigned int, unsigned int, const char *); -void util_memory_d(void *, unsigned int, const char *); -char *util_strdup (const char *); + /* + * It's nearly impossible to figure out a 64bit type at + * this point without making assumptions about the build + * enviroment. So if clang or gcc is detected use some + * compiler builtins to create a 64 signed and unsigned + * type. + */ +# if defined(__GNUC__) || defined (__CLANG__) + typedef int int64_t __attribute__((__mode__(__DI__))); + typedef unsigned int uint64_t __attribute__((__mode__(__DI__))); +# else + /* + * Incoorectly size the types so static assertions below will + * fail. There is no valid way to get a 64bit type at this point + * without making assumptions of too many things. + */ + typedef struct { char _fail : 0; } int64_t; + typedef struct { char _fail : 0; } uint64_t; +# endif +#endif +#ifdef _LP64 /* long pointer == 64 */ + typedef unsigned long uintptr_t; + typedef long intptr_t; +#else + typedef unsigned int uintptr_t; + typedef int intptr_t; +#endif +/* Ensure type sizes are correct: */ +typedef char uint8_size_is_correct [sizeof(uint8_t) == 1?1:-1]; +typedef char uint16_size_is_correct [sizeof(uint16_t) == 2?1:-1]; +typedef char uint32_size_is_correct [sizeof(uint32_t) == 4?1:-1]; +typedef char uint64_size_is_correct [sizeof(uint64_t) == 8?1:-1]; +typedef char int16_size_if_correct [sizeof(int16_t) == 2?1:-1]; +typedef char int32_size_is_correct [sizeof(int32_t) == 4?1:-1]; +typedef char int64_size_is_correct [sizeof(int64_t) == 8?1:-1]; +/* intptr_t / uintptr_t correct size check */ +typedef char uintptr_size_is_correct[sizeof(intptr_t) == sizeof(int*)?1:-1]; +typedef char intptr_size_is_correct [sizeof(uintptr_t)== sizeof(int*)?1:-1]; + +/*===================================================================*/ +/*=========================== util.c ================================*/ +/*===================================================================*/ +void *util_memory_a (unsigned int, unsigned int, const char *); +void util_memory_d (void *, unsigned int, const char *); +void util_meminfo (); + +bool util_strupper (const char *); +bool util_strdigit (const char *); +bool util_strncmpexact (const char *, const char *, size_t); +char *util_strdup (const char *); +char *util_strrq (const char *); +char *util_strrnl (const char *); +char *util_strsws (const char *); +char *util_strchp (const char *, const char *); +void util_debug (const char *, const char *, ...); +int util_getline (char **, size_t *, FILE *); +void util_endianswap (void *, int, int); + +uint32_t util_crc32(const char *, int, register const short); #ifdef NOTRACK -# define mem_a(x) malloc(x) -# define mem_d(x) free (x) +# define mem_a(x) malloc(x) +# define mem_d(x) free (x) #else -# define mem_a(x) util_memory_a((x), __LINE__, __FILE__) -# define mem_d(x) util_memory_d((x), __LINE__, __FILE__) +# define mem_a(x) util_memory_a((x), __LINE__, __FILE__) +# define mem_d(x) util_memory_d((x), __LINE__, __FILE__) #endif -#define VECTOR_MAKE(T,N) \ - T* N##_data = NULL; \ - long N##_elements = 0; \ - long N##_allocated = 0; \ - int N##_add(T element) { \ - if (N##_elements == N##_allocated) { \ - if (N##_allocated == 0) { \ - N##_allocated = 12; \ - } else { \ - N##_allocated *= 2; \ - } \ - void *temp = realloc(N##_data, (N##_allocated * sizeof(T))); \ - if (!temp) { \ - free(temp); \ - return -1; \ - } \ - N##_data = (T*)temp; \ - } \ - N##_data[N##_elements] = element; \ - return N##_elements++; \ - } - -//=================================================================== -//=========================== code.c ================================ -//=================================================================== -#define TYPE_VOID 0 -#define TYPE_STRING 1 -#define TYPE_FLOAT 2 -#define TYPE_VECTOR 3 -#define TYPE_ENTITY 4 -#define TYPE_FIELD 5 -#define TYPE_FUNCTION 6 -#define TYPE_POINTER 7 - -/* - * Instructions +/* + * TODO: make these safer to use. Currently this only works on + * x86 and x86_64, some systems will likely not like this. Such + * as BE systems. + */ +#define FLT2INT(Y) *((int32_t*)&(Y)) +#define INT2FLT(Y) *((float *)&(Y)) + +/* Builds vector type (usefull for inside structures) */ +#define VECTOR_SNAP(X,Y) X ## Y +#define VECTOR_FILL(X,Y) VECTOR_SNAP(X,Y) +#define VECTOR_TYPE(T,N) \ + T* N##_data = NULL; \ + long N##_elements = 0; \ + long N##_allocated = 0 +/* Builds vector add */ +#define VECTOR_CORE(T,N) \ + int N##_add(T element) { \ + void *temp = NULL; \ + if (N##_elements == N##_allocated) { \ + if (N##_allocated == 0) { \ + N##_allocated = 12; \ + } else { \ + N##_allocated *= 2; \ + } \ + if (!(temp = mem_a(N##_allocated * sizeof(T)))) { \ + mem_d(temp); \ + return -1; \ + } \ + memcpy(temp, N##_data, (N##_elements * sizeof(T))); \ + mem_d(N##_data); \ + N##_data = (T*)temp; \ + } \ + N##_data[N##_elements] = element; \ + return N##_elements++; \ + } \ + int N##_put(T* elements, size_t len) { \ + len --; \ + elements--; \ + while (N##_add(*++elements) != -1 && len--); \ + return N##_elements; \ + } \ + typedef char VECTOR_FILL(extra_semicolon_,__COUNTER__) +#define VECTOR_PROT(T,N) \ + extern T* N##_data ; \ + extern long N##_elements ; \ + extern long N##_allocated; \ + int N##_add(T); \ + int N##_put(T *, size_t) +#define VECTOR_MAKE(T,N) \ + VECTOR_TYPE(T,N); \ + VECTOR_CORE(T,N) + +/*===================================================================*/ +/*=========================== code.c ================================*/ +/*===================================================================*/ + +/* Note: if you change the order, fix type_sizeof in ir.c */ +enum { + TYPE_VOID , + TYPE_STRING , + TYPE_FLOAT , + TYPE_VECTOR , + TYPE_ENTITY , + TYPE_FIELD , + TYPE_FUNCTION , + TYPE_POINTER , + TYPE_INTEGER , + TYPE_QUATERNION , + TYPE_MATRIX , + TYPE_VARIANT , + + TYPE_COUNT +}; + +extern const char *type_name[TYPE_COUNT]; + +extern size_t type_sizeof[TYPE_COUNT]; +extern uint16_t type_store_instr[TYPE_COUNT]; +/* could use type_store_instr + INSTR_STOREP_F - INSTR_STORE_F + * but this breaks when TYPE_INTEGER is added, since with the enhanced + * instruction set, the old ones are left untouched, thus the _I instructions + * are at a seperate place. + */ +extern uint16_t type_storep_instr[TYPE_COUNT]; + +/* + * Each paramater incerements by 3 since vector types hold + * 3 components (x,y,z). + */ +#define OFS_NULL 0 +#define OFS_RETURN 1 +#define OFS_PARM0 (OFS_RETURN+3) +#define OFS_PARM1 (OFS_PARM0 +3) +#define OFS_PARM2 (OFS_PARM1 +3) +#define OFS_PARM3 (OFS_PARM2 +3) +#define OFS_PARM4 (OFS_PARM3 +3) +#define OFS_PARM5 (OFS_PARM4 +3) +#define OFS_PARM6 (OFS_PARM5 +3) +#define OFS_PARM7 (OFS_PARM6 +3) + +typedef struct { + uint16_t opcode; + + /* operand 1 */ + union { + int16_t s1; /* signed */ + uint16_t u1; /* unsigned */ + } o1; + /* operand 2 */ + union { + int16_t s1; /* signed */ + uint16_t u1; /* unsigned */ + } o2; + /* operand 3 */ + union { + int16_t s1; /* signed */ + uint16_t u1; /* unsigned */ + } o3; + + /* + * This is the same as the structure in darkplaces + * { + * unsigned short op; + * short a,b,c; + * } + * But this one is more sane to work with, and the + * type sizes are guranteed. + */ +} prog_section_statement; + +typedef struct { + /* The types: + * 0 = ev_void + * 1 = ev_string + * 2 = ev_float + * 3 = ev_vector + * 4 = ev_entity + * 5 = ev_field + * 6 = ev_function + * 7 = ev_pointer -- engine only + * 8 = ev_bad -- engine only + */ + uint16_t type; + uint16_t offset; + uint32_t name; +} prog_section_both; +typedef prog_section_both prog_section_def; +typedef prog_section_both prog_section_field; + +typedef struct { + int32_t entry; /* in statement table for instructions */ + uint32_t firstlocal; /* First local in local table */ + uint32_t locals; /* Total ints of params + locals */ + uint32_t profile; /* Always zero (engine uses this) */ + uint32_t name; /* name of function in string table */ + uint32_t file; /* file of the source file */ + uint32_t nargs; /* number of arguments */ + uint8_t argsize[8]; /* size of arguments (keep 8 always?) */ +} prog_section_function; + +/* + * Instructions * These are the external instructions supported by the interperter * this is what things compile to (from the C code). */ -#define INSTR_DONE 0 -// math -#define INSTR_MUL_F 1 -#define INSTR_MUL_V 2 -#define INSTR_MUL_FV 3 -#define INSTR_MUL_VF 4 -#define INSTR_DIV_F 5 -#define INSTR_ADD_F 6 -#define INSTR_ADD_V 7 -#define INSTR_SUB_F 8 -#define INSTR_SUB_V 9 -// compare -#define INSTR_EQ_F 10 -#define INSTR_EQ_V 11 -#define INSTR_EQ_S 12 -#define INSTR_EQ_E 13 -#define INSTR_EQ_FNC 14 -#define INSTR_NE_F 15 -#define INSTR_NE_V 16 -#define INSTR_NE_S 17 -#define INSTR_NE_E 18 -#define INSTR_NE_FNC 19 -// multi compare -#define INSTR_LE 20 -#define INSTR_GE 21 -#define INSTR_LT 22 -#define INSTR_GT 23 -// load and store -#define INSTR_LOAD_F 24 -#define INSTR_LOAD_V 25 -#define INSTR_LOAD_S 26 -#define INSTR_LOAD_ENT 27 -#define INSTR_LOAD_FLD 28 -#define INSTR_LOAD_FNC 29 -#define INSTR_STORE_F 31 -#define INSTR_STORE_V 32 -#define INSTR_STORE_S 33 -#define INSTR_STORE_ENT 34 -#define INSTR_STORE_FLD 35 -#define INSTR_STORE_FNC 36 -// others -#define INSTR_ADDRESS 30 -#define INSTR_RETURN 37 -#define INSTR_NOT_F 38 -#define INSTR_NOT_V 39 -#define INSTR_NOT_S 40 -#define INSTR_NOT_ENT 41 -#define INSTR_NOT_FNC 42 -#define INSTR_IF 43 -#define INSTR_IFNOT 44 -#define INSTR_CALL0 45 -#define INSTR_CALL1 46 -#define INSTR_CALL2 47 -#define INSTR_CALL3 48 -#define INSTR_CALL4 49 -#define INSTR_CALL5 50 -#define INSTR_CALL6 51 -#define INSTR_CALL7 52 -#define INSTR_CALL8 53 -#define INSTR_STATE 54 -#define INSTR_GOTO 55 -#define INSTR_AND 56 -#define INSTR_OR 57 -#define INSTR_BITAND 59 -#define INSTR_BITOR 60 +enum { + INSTR_DONE, + INSTR_MUL_F, + INSTR_MUL_V, + INSTR_MUL_VF, + INSTR_MUL_FV, + INSTR_DIV_F, + INSTR_ADD_F, + INSTR_ADD_V, + INSTR_SUB_F, + INSTR_SUB_V, + INSTR_EQ_F, + INSTR_EQ_V, + INSTR_EQ_S, + INSTR_EQ_E, + INSTR_EQ_FNC, + INSTR_NE_F, + INSTR_NE_V, + INSTR_NE_S, + INSTR_NE_E, + INSTR_NE_FNC, + INSTR_LE, + INSTR_GE, + INSTR_LT, + INSTR_GT, + INSTR_LOAD_F, + INSTR_LOAD_V, + INSTR_LOAD_S, + INSTR_LOAD_ENT, + INSTR_LOAD_FLD, + INSTR_LOAD_FNC, + INSTR_ADDRESS, + INSTR_STORE_F, + INSTR_STORE_V, + INSTR_STORE_S, + INSTR_STORE_ENT, + INSTR_STORE_FLD, + INSTR_STORE_FNC, + INSTR_STOREP_F, + INSTR_STOREP_V, + INSTR_STOREP_S, + INSTR_STOREP_ENT, + INSTR_STOREP_FLD, + INSTR_STOREP_FNC, + INSTR_RETURN, + INSTR_NOT_F, + INSTR_NOT_V, + INSTR_NOT_S, + INSTR_NOT_ENT, + INSTR_NOT_FNC, + INSTR_IF, + INSTR_IFNOT, + INSTR_CALL0, + INSTR_CALL1, + INSTR_CALL2, + INSTR_CALL3, + INSTR_CALL4, + INSTR_CALL5, + INSTR_CALL6, + INSTR_CALL7, + INSTR_CALL8, + INSTR_STATE, + INSTR_GOTO, + INSTR_AND, + INSTR_OR, + INSTR_BITAND, + INSTR_BITOR, + +/* warning: will be reordered */ + INSTR_MUL_Q, + INSTR_MUL_QF, + INSTR_MUL_M, + INSTR_MUL_MF, + INSTR_EQ_Q, + INSTR_EQ_M, + INSTR_NE_Q, + INSTR_NE_M, + INSTR_LOAD_Q, + INSTR_LOAD_M, + INSTR_STORE_Q, + INSTR_STORE_M, + INSTR_STOREP_Q, + INSTR_STOREP_M, + INSTR_INV_Q, + INSTR_INV_M, + /* + * Virtual instructions used by the assembler + * keep at the end but before virtual instructions + * for the IR below. + */ + AINSTR_END, + + /* + * Virtual instructions used by the IR + * Keep at the end! + */ + VINSTR_PHI, + VINSTR_JUMP, + VINSTR_COND +}; + +/* + * The symbols below are created by the following + * expanded macros: + * + * VECTOR_MAKE(prog_section_statement, code_statements); + * VECTOR_MAKE(prog_section_def, code_defs ); + * VECTOR_MAKE(prog_section_field, code_fields ); + * VECTOR_MAKE(prog_section_function, code_functions ); + * VECTOR_MAKE(int, code_globals ); + * VECTOR_MAKE(char, code_chars ); + */ +VECTOR_PROT(prog_section_statement, code_statements); +VECTOR_PROT(prog_section_statement, code_statements); +VECTOR_PROT(prog_section_def, code_defs ); +VECTOR_PROT(prog_section_field, code_fields ); +VECTOR_PROT(prog_section_function, code_functions ); +VECTOR_PROT(int, code_globals ); +VECTOR_PROT(char, code_chars ); + +/* + * code_write -- writes out the compiled file + * code_init -- prepares the code file + */ +bool code_write (const char *filename); +void code_init (); +uint32_t code_genstring (const char *string); +uint32_t code_cachedstring(const char *string); + +/*===================================================================*/ +/*========================= assembler.c =============================*/ +/*===================================================================*/ +static const struct { + const char *m; /* menomic */ + const size_t o; /* operands */ + const size_t l; /* menomic len */ +} asm_instr[] = { + { "DONE" , 1, 4 }, + { "MUL_F" , 3, 5 }, + { "MUL_V" , 3, 5 }, + { "MUL_VF" , 3, 6 }, + { "MUL_FV" , 3, 6 }, + { "DIV" , 0, 3 }, + { "ADD_F" , 3, 5 }, + { "ADD_V" , 3, 5 }, + { "SUB_F" , 3, 5 }, + { "DUB_V" , 3, 5 }, + { "EQ_F" , 0, 4 }, + { "EQ_V" , 0, 4 }, + { "EQ_S" , 0, 4 }, + { "EQ_E" , 0, 4 }, + { "EQ_FNC" , 0, 6 }, + { "NE_F" , 0, 4 }, + { "NE_V" , 0, 4 }, + { "NE_S" , 0, 4 }, + { "NE_E" , 0, 4 }, + { "NE_FNC" , 0, 6 }, + { "LE" , 0, 2 }, + { "GE" , 0, 2 }, + { "LT" , 0, 2 }, + { "GT" , 0, 2 }, + { "FIELD_F" , 0, 7 }, + { "FIELD_V" , 0, 7 }, + { "FIELD_S" , 0, 7 }, + { "FIELD_ENT" , 0, 9 }, + { "FIELD_FLD" , 0, 9 }, + { "FIELD_FNC" , 0, 9 }, + { "ADDRESS" , 0, 7 }, + { "STORE_F" , 0, 7 }, + { "STORE_V" , 0, 7 }, + { "STORE_S" , 0, 7 }, + { "STORE_ENT" , 0, 9 }, + { "STORE_FLD" , 0, 9 }, + { "STORE_FNC" , 0, 9 }, + { "STOREP_F" , 0, 8 }, + { "STOREP_V" , 0, 8 }, + { "STOREP_S" , 0, 8 }, + { "STOREP_ENT", 0, 10}, + { "STOREP_FLD", 0, 10}, + { "STOREP_FNC", 0, 10}, + { "RETURN" , 0, 6 }, + { "NOT_F" , 0, 5 }, + { "NOT_V" , 0, 5 }, + { "NOT_S" , 0, 5 }, + { "NOT_ENT" , 0, 7 }, + { "NOT_FNC" , 0, 7 }, + { "IF" , 0, 2 }, + { "IFNOT" , 0, 5 }, + { "CALL0" , 1, 5 }, + { "CALL1" , 2, 5 }, + { "CALL2" , 3, 5 }, + { "CALL3" , 4, 5 }, + { "CALL4" , 5, 5 }, + { "CALL5" , 6, 5 }, + { "CALL6" , 7, 5 }, + { "CALL7" , 8, 5 }, + { "CALL8" , 9, 5 }, + { "STATE" , 0, 5 }, + { "GOTO" , 0, 4 }, + { "AND" , 0, 3 }, + { "OR" , 0, 2 }, + { "BITAND" , 0, 6 }, + { "BITOR" , 0, 5 }, + + { "MUL_Q" , 3, 5 }, + { "MUL_QF" , 3, 6 }, + { "MUL_M" , 3, 5 }, + { "MUL_MF" , 3, 6 }, + { "EQ_Q" , 0, 4 }, + { "EQ_M" , 0, 4 }, + { "NE_Q" , 0, 4 }, + { "NE_M" , 0, 4 }, + { "FIELD_Q" , 0, 7 }, + { "FIELD_M" , 0, 7 }, + { "STORE_Q" , 0, 7 }, + { "STORE_M" , 0, 7 }, + { "STOREP_Q" , 0, 8 }, + { "STOREP_M" , 0, 8 }, + { "INV_Q" , 0, 5 }, + { "INV_M" , 0, 5 }, + + { "END" , 0, 3 } /* virtual assembler instruction */ +}; + +void asm_init (const char *, FILE **); +void asm_close(FILE *); +void asm_parse(FILE *); +/*===================================================================*/ +/*============================= main.c ==============================*/ +/*===================================================================*/ +enum { + COMPILER_QCC, /* circa QuakeC */ + COMPILER_FTEQCC, /* fteqcc QuakeC */ + COMPILER_QCCX, /* qccx QuakeC */ + COMPILER_GMQCC /* this QuakeC */ +}; +extern bool opts_debug; +extern bool opts_memchk; +extern bool opts_darkplaces_stringtablebug; +extern bool opts_omit_nullcode; +extern int opts_compiler; +/*===================================================================*/ +/*============================= ast.c ===============================*/ +/*===================================================================*/ +#define MEM_VECTOR_PROTO(Towner, Tmem, mem) \ + bool GMQCC_WARN Towner##_##mem##_add(Towner*, Tmem); \ + bool GMQCC_WARN Towner##_##mem##_remove(Towner*, size_t) + +#define MEM_VECTOR_PROTO_ALL(Towner, Tmem, mem) \ + MEM_VECTOR_PROTO(Towner, Tmem, mem); \ + bool GMQCC_WARN Towner##_##mem##_find(Towner*, Tmem, size_t*); \ + void Towner##_##mem##_clear(Towner*) + +#define MEM_VECTOR_MAKE(Twhat, name) \ + Twhat *name; \ + size_t name##_count; \ + size_t name##_alloc + +#define _MEM_VEC_FUN_ADD(Tself, Twhat, mem) \ +bool GMQCC_WARN Tself##_##mem##_add(Tself *self, Twhat f) \ +{ \ + Twhat *reall; \ + if (self->mem##_count == self->mem##_alloc) { \ + if (!self->mem##_alloc) { \ + self->mem##_alloc = 16; \ + } else { \ + self->mem##_alloc *= 2; \ + } \ + reall = (Twhat*)mem_a(sizeof(Twhat) * self->mem##_alloc); \ + if (!reall) { \ + return false; \ + } \ + memcpy(reall, self->mem, sizeof(Twhat) * self->mem##_count); \ + mem_d(self->mem); \ + self->mem = reall; \ + } \ + self->mem[self->mem##_count++] = f; \ + return true; \ +} + +#define _MEM_VEC_FUN_REMOVE(Tself, Twhat, mem) \ +bool GMQCC_WARN Tself##_##mem##_remove(Tself *self, size_t idx) \ +{ \ + size_t i; \ + Twhat *reall; \ + if (idx >= self->mem##_count) { \ + return true; /* huh... */ \ + } \ + for (i = idx; i < self->mem##_count-1; ++i) { \ + self->mem[i] = self->mem[i+1]; \ + } \ + self->mem##_count--; \ + if (self->mem##_count < self->mem##_count/2) { \ + self->mem##_alloc /= 2; \ + reall = (Twhat*)mem_a(sizeof(Twhat) * self->mem##_count); \ + if (!reall) { \ + return false; \ + } \ + memcpy(reall, self->mem, sizeof(Twhat) * self->mem##_count); \ + mem_d(self->mem); \ + self->mem = reall; \ + } \ + return true; \ +} + +#define _MEM_VEC_FUN_FIND(Tself, Twhat, mem) \ +bool GMQCC_WARN Tself##_##mem##_find(Tself *self, Twhat obj, size_t *idx) \ +{ \ + size_t i; \ + for (i = 0; i < self->mem##_count; ++i) { \ + if (self->mem[i] == obj) { \ + if (idx) { \ + *idx = i; \ + } \ + return true; \ + } \ + } \ + return false; \ +} + +#define _MEM_VEC_FUN_CLEAR(Tself, mem) \ +void Tself##_##mem##_clear(Tself *self) \ +{ \ + if (!self->mem) \ + return; \ + mem_d((void*) self->mem); \ + self->mem = NULL; \ + self->mem##_count = 0; \ + self->mem##_alloc = 0; \ +} + +#define MEM_VECTOR_CLEAR(owner, mem) \ + if ((owner)->mem) \ + mem_d((void*)((owner)->mem)); \ + (owner)->mem = NULL; \ + (owner)->mem##_count = 0; \ + (owner)->mem##_alloc = 0 + +#define MEM_VECTOR_INIT(owner, mem) \ +{ \ + (owner)->mem = NULL; \ + (owner)->mem##_count = 0; \ + (owner)->mem##_alloc = 0; \ +} + +#define MEM_VECTOR_MOVE(from, mem, to, tm) \ +{ \ + (to)->tm = (from)->mem; \ + (to)->tm##_count = (from)->mem##_count; \ + (to)->tm##_alloc = (from)->mem##_alloc; \ + (from)->mem = NULL; \ + (from)->mem##_count = 0; \ + (from)->mem##_alloc = 0; \ +} + +#define MEM_VEC_FUNCTIONS(Tself, Twhat, mem) \ +_MEM_VEC_FUN_REMOVE(Tself, Twhat, mem) \ +_MEM_VEC_FUN_ADD(Tself, Twhat, mem) + +#define MEM_VEC_FUNCTIONS_ALL(Tself, Twhat, mem) \ +MEM_VEC_FUNCTIONS(Tself, Twhat, mem) \ +_MEM_VEC_FUN_CLEAR(Tself, mem) \ +_MEM_VEC_FUN_FIND(Tself, Twhat, mem) + +enum store_types { + store_global, + store_local, /* local, assignable for now, should get promoted later */ + store_param, /* parameters, they are locals with a fixed position */ + store_value, /* unassignable */ + store_return /* unassignable, at OFS_RETURN */ +}; + +typedef struct { + float x, y, z; +} vector; + +typedef float matrix[4][4]; /* OpenGL layout */ +typedef float quaternion[4]; /* order: x, y, z, w */ +#define MATRIX(axis, elem) ((4*(axis)) + (elem)) +#define QUAT_X 0 +#define QUAT_Y 1 +#define QUAT_Z 2 +#define QUAT_W 3 + +/* + * A shallow copy of a lex_file to remember where which ast node + * came from. + */ +typedef struct { + const char *file; + size_t line; +} lex_ctx; #endif