X-Git-Url: https://git.xonotic.org/?a=blobdiff_plain;f=ast.h;h=4f26742ba50b7d59bbccf51d2b59b43a4c6acfa6;hb=5b2d99bc99dc093e5cdcd2451eac20596bbedcc0;hp=37ee1714871f8eed816e098d447fdb83c2fb1368;hpb=49f398036092a9323643c4384a3cbd537edfd5e8;p=xonotic%2Fgmqcc.git diff --git a/ast.h b/ast.h index 37ee171..4f26742 100644 --- a/ast.h +++ b/ast.h @@ -36,11 +36,37 @@ typedef struct ast_function_s ast_function; typedef struct ast_block_s ast_block; typedef struct ast_binary_s ast_binary; typedef struct ast_store_s ast_store; +typedef struct ast_binstore_s ast_binstore; typedef struct ast_entfield_s ast_entfield; typedef struct ast_ifthen_s ast_ifthen; typedef struct ast_ternary_s ast_ternary; typedef struct ast_loop_s ast_loop; typedef struct ast_call_s ast_call; +typedef struct ast_unary_s ast_unary; +typedef struct ast_return_s ast_return; +typedef struct ast_member_s ast_member; + +enum { + TYPE_ast_node, + TYPE_ast_expression, + TYPE_ast_value, + TYPE_ast_function, + TYPE_ast_block, + TYPE_ast_binary, + TYPE_ast_store, + TYPE_ast_binstore, + TYPE_ast_entfield, + TYPE_ast_ifthen, + TYPE_ast_ternary, + TYPE_ast_loop, + TYPE_ast_call, + TYPE_ast_unary, + TYPE_ast_return, + TYPE_ast_member +}; + +#define ast_istype(x, t) ( ((ast_node_common*)x)->nodetype == (TYPE_##t) ) +#define ast_ctx(node) (((ast_node_common*)(node))->context) /* Node interface with common components */ @@ -50,12 +76,18 @@ typedef struct lex_ctx context; /* I don't feel comfortable using keywords like 'delete' as names... */ ast_node_delete *destroy; + int nodetype; /* keep: if a node contains this node, 'keep' * prevents its dtor from destroying this node as well. */ bool keep; + /* usecount - so we can delete unused _x,_y and _z nodes... */ + size_t uses; } ast_node_common; +#define ast_use(n) ((ast_node*)(n))->node.uses++ +#define ast_unuse(n) ((ast_node*)(n))->node.uses-- + #define ast_delete(x) ( ( (ast_node*)(x) ) -> node.destroy )((ast_node*)(x)) #define ast_unref(x) do \ { \ @@ -79,7 +111,16 @@ typedef struct ast_expression_codegen *codegen; int vtype; ast_expression *next; + MEM_VECTOR_MAKE(ast_value*, params); + /* The codegen functions should store their output values + * so we can call it multiple times without re-evaluating. + * Store lvalue and rvalue seperately though. So that + * ast_entfield for example can generate both if required. + */ + ir_value *outl; + ir_value *outr; } ast_expression_common; +MEM_VECTOR_PROTO(ast_expression_common, ast_value*, params); /* Value * @@ -107,17 +148,11 @@ struct ast_value_s const char *vstring; int ventity; ast_function *vfunc; - quaternion vquat; - matrix vmat; } constval; ir_value *ir_v; - - /* if vtype is qc_function, params contain parameters, and - * 'next' the return type. - */ - MEM_VECTOR_MAKE(ast_value*, params); }; + ast_value* ast_value_new(lex_ctx ctx, const char *name, int qctype); /* This will NOT delete an underlying ast_function */ void ast_value_delete(ast_value*); @@ -125,9 +160,13 @@ void ast_value_delete(ast_value*); bool ast_value_set_name(ast_value*, const char *name); bool ast_value_codegen(ast_value*, ast_function*, bool lvalue, ir_value**); -bool ast_local_codegen(ast_value *self, ir_function *func); +bool ast_local_codegen(ast_value *self, ir_function *func, bool isparam); bool ast_global_codegen(ast_value *self, ir_builder *ir); +bool GMQCC_WARN ast_value_params_add(ast_value*, ast_value*); + +bool ast_compare_type(ast_expression *a, ast_expression *b); + /* Binary * * A value-returning binary expression. @@ -148,6 +187,64 @@ void ast_binary_delete(ast_binary*); bool ast_binary_codegen(ast_binary*, ast_function*, bool lvalue, ir_value**); +/* Binstore + * + * An assignment including a binary expression with the source as left operand. + * Eg. a += b; is a binstore { INSTR_STORE, INSTR_ADD, a, b } + */ +struct ast_binstore_s +{ + ast_expression_common expression; + + int opstore; + int opbin; + ast_expression *dest; + ast_expression *source; +}; +ast_binstore* ast_binstore_new(lex_ctx ctx, + int storeop, + int op, + ast_expression *left, + ast_expression *right); +void ast_binstore_delete(ast_binstore*); + +bool ast_binstore_codegen(ast_binstore*, ast_function*, bool lvalue, ir_value**); + +/* Unary + * + * Regular unary expressions: not,neg + */ +struct ast_unary_s +{ + ast_expression_common expression; + + int op; + ast_expression *operand; +}; +ast_unary* ast_unary_new(lex_ctx ctx, + int op, + ast_expression *expr); +void ast_unary_delete(ast_unary*); + +bool ast_unary_codegen(ast_unary*, ast_function*, bool lvalue, ir_value**); + +/* Return + * + * Make sure 'return' only happens at the end of a block, otherwise the IR + * will refuse to create further instructions. + * This should be honored by the parser. + */ +struct ast_return_s +{ + ast_expression_common expression; + ast_expression *operand; +}; +ast_return* ast_return_new(lex_ctx ctx, + ast_expression *expr); +void ast_return_delete(ast_return*); + +bool ast_return_codegen(ast_return*, ast_function*, bool lvalue, ir_value**); + /* Entity-field * * This must do 2 things: @@ -174,6 +271,22 @@ void ast_entfield_delete(ast_entfield*); bool ast_entfield_codegen(ast_entfield*, ast_function*, bool lvalue, ir_value**); +/* Member access: + * + * For now used for vectors. If we get structs or unions + * we can have them handled here as well. + */ +struct ast_member_s +{ + ast_expression_common expression; + ast_expression *owner; + unsigned int field; +}; +ast_member* ast_member_new(lex_ctx ctx, ast_expression *owner, unsigned int field); +void ast_member_delete(ast_member*); + +bool ast_member_codegen(ast_member*, ast_function*, bool lvalue, ir_value**); + /* Store * * Stores left<-right and returns left. @@ -183,11 +296,11 @@ struct ast_store_s { ast_expression_common expression; int op; - ast_value *dest; /* When we add pointers this might have to change to expression */ + ast_expression *dest; ast_expression *source; }; ast_store* ast_store_new(lex_ctx ctx, int op, - ast_value *d, ast_expression *s); + ast_expression *d, ast_expression *s); void ast_store_delete(ast_store*); bool ast_store_codegen(ast_store*, ast_function*, bool lvalue, ir_value**); @@ -310,6 +423,8 @@ bool ast_call_codegen(ast_call*, ast_function*, bool lvalue, ir_value**); MEM_VECTOR_PROTO(ast_call, ast_expression*, params); +bool ast_call_add_param(ast_call*, ast_expression*); + /* Blocks * */ @@ -322,10 +437,13 @@ struct ast_block_s }; ast_block* ast_block_new(lex_ctx ctx); void ast_block_delete(ast_block*); +bool ast_block_set_type(ast_block*, ast_expression *from); MEM_VECTOR_PROTO(ast_block, ast_value*, locals); MEM_VECTOR_PROTO(ast_block, ast_expression*, exprs); +bool ast_block_add_expr(ast_block*, ast_expression *expr); + bool ast_block_codegen(ast_block*, ast_function*, bool lvalue, ir_value**); /* Function @@ -360,7 +478,6 @@ struct ast_function_s char labelbuf[64]; MEM_VECTOR_MAKE(ast_block*, blocks); - MEM_VECTOR_MAKE(ast_value*, params); }; ast_function* ast_function_new(lex_ctx ctx, const char *name, ast_value *vtype); /* This will NOT delete the underlying ast_value */ @@ -371,7 +488,6 @@ void ast_function_delete(ast_function*); const char* ast_function_label(ast_function*, const char *prefix); MEM_VECTOR_PROTO(ast_function, ast_block*, blocks); -MEM_VECTOR_PROTO(ast_function, ast_value*, params); bool ast_function_codegen(ast_function *self, ir_builder *builder);