X-Git-Url: https://git.xonotic.org/?a=blobdiff_plain;f=ast.h;h=725f123cec9f45156cf5d29e229ee1ae93c13899;hb=edd9ded23cce132f72671a7a277aece026d305fa;hp=fc4fef3553e51dd08a9a8f12bffbdb83a36a0c73;hpb=a7957a9fdc6baf3eaa7f62fc00e1a50a23ffa634;p=xonotic%2Fgmqcc.git diff --git a/ast.h b/ast.h index fc4fef3..725f123 100644 --- a/ast.h +++ b/ast.h @@ -36,6 +36,7 @@ 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; @@ -43,6 +44,29 @@ 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 */ @@ -52,6 +76,7 @@ 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. */ @@ -75,6 +100,16 @@ typedef bool ast_expression_codegen(ast_expression*, ast_function*, bool lvalue, ir_value**); +/* TODO: the codegen function should take an output-type parameter + * indicating whether a variable, type, label etc. is expected, and + * an environment! + * Then later an ast_ident could have a codegen using this to figure + * out what to look for. + * eg. in code which uses a not-yet defined variable, the expression + * would take an ast_ident, and the codegen would be called with + * type `expression`, so the ast_ident's codegen would search for + * variables through the environment (or functions, constants...). + */ typedef struct { ast_node_common node; @@ -82,6 +117,14 @@ typedef struct int vtype; ast_expression *next; MEM_VECTOR_MAKE(ast_value*, params); + bool variadic; + /* 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); @@ -113,10 +156,14 @@ struct ast_value_s ast_function *vfunc; } constval; + /* usecount for the parser */ + size_t uses; + ir_value *ir_v; }; ast_value* ast_value_new(lex_ctx ctx, const char *name, int qctype); +ast_value* ast_value_copy(const ast_value *self); /* This will NOT delete an underlying ast_function */ void ast_value_delete(ast_value*); @@ -128,6 +175,12 @@ 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); +ast_expression* ast_type_copy(lex_ctx ctx, const ast_expression *ex); +#define ast_type_adopt(a, b) ast_type_adopt_impl((ast_expression*)(a), (ast_expression*)(b)) +bool ast_type_adopt_impl(ast_expression *self, const ast_expression *other); +void ast_type_to_string(ast_expression *e, char *buf, size_t bufsize); + /* Binary * * A value-returning binary expression. @@ -148,6 +201,29 @@ 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 @@ -209,6 +285,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. @@ -342,6 +434,7 @@ ast_call* ast_call_new(lex_ctx ctx, ast_expression *funcexpr); void ast_call_delete(ast_call*); bool ast_call_codegen(ast_call*, ast_function*, bool lvalue, ir_value**); +bool ast_call_check_types(ast_call*); MEM_VECTOR_PROTO(ast_call, ast_expression*, params); @@ -354,6 +447,7 @@ struct ast_block_s MEM_VECTOR_MAKE(ast_value*, locals); MEM_VECTOR_MAKE(ast_expression*, exprs); + MEM_VECTOR_MAKE(ast_expression*, collect); }; ast_block* ast_block_new(lex_ctx ctx); void ast_block_delete(ast_block*); @@ -361,8 +455,10 @@ 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); +MEM_VECTOR_PROTO(ast_block, ast_expression*, collect); bool ast_block_codegen(ast_block*, ast_function*, bool lvalue, ir_value**); +bool ast_block_collect(ast_block*, ast_expression*); /* Function *