X-Git-Url: https://git.xonotic.org/?a=blobdiff_plain;f=ast.h;h=00802ca3168aca62fbab474dc20111b78a3465b0;hb=9e3399df197c7cea44028a86c961a14df6e62d20;hp=16f980709d518f3eddf66b7120b90d2f71b928d6;hpb=906f319673f6a2eddb62e59acc970b9497f3e96a;p=xonotic%2Fgmqcc.git diff --git a/ast.h b/ast.h index 16f9807..00802ca 100644 --- a/ast.h +++ b/ast.h @@ -46,6 +46,8 @@ typedef struct ast_unary_s ast_unary; typedef struct ast_return_s ast_return; typedef struct ast_member_s ast_member; typedef struct ast_array_index_s ast_array_index; +typedef struct ast_breakcont_s ast_breakcont; +typedef struct ast_switch_s ast_switch; enum { TYPE_ast_node, @@ -64,7 +66,9 @@ enum { TYPE_ast_unary, TYPE_ast_return, TYPE_ast_member, - TYPE_ast_array_index + TYPE_ast_array_index, + TYPE_ast_breakcont, + TYPE_ast_switch }; #define ast_istype(x, t) ( ((ast_node_common*)x)->nodetype == (TYPE_##t) ) @@ -394,9 +398,6 @@ struct ast_ternary_s /* It's all just 'expressions', since an ast_block is one too. */ ast_expression *on_true; ast_expression *on_false; - /* After a ternary expression we find ourselves in a new IR block - * and start with a PHI node */ - ir_value *phi_out; }; ast_ternary* ast_ternary_new(lex_ctx ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse); void ast_ternary_delete(ast_ternary*); @@ -445,6 +446,45 @@ void ast_loop_delete(ast_loop*); bool ast_loop_codegen(ast_loop*, ast_function*, bool lvalue, ir_value**); +/* Break/Continue + */ +struct ast_breakcont_s +{ + ast_expression_common expression; + bool is_continue; +}; +ast_breakcont* ast_breakcont_new(lex_ctx ctx, bool iscont); +void ast_breakcont_delete(ast_breakcont*); + +bool ast_breakcont_codegen(ast_breakcont*, ast_function*, bool lvalue, ir_value**); + +/* Switch Statements + * + * A few notes about this: with the original QCVM, no real optimization + * is possible. The SWITCH instruction set isn't really helping a lot, since + * it only collapes the EQ and IF instructions into one. + * Note: Declaring local variables inside caseblocks is normal. + * Since we don't have to deal with a stack there's no unnatural behaviour to + * be expected from it. + * TODO: Ticket #20 + */ +typedef struct { + ast_expression *value; /* #20 will replace this */ + ast_expression *code; +} ast_switch_case; +struct ast_switch_s +{ + ast_expression_common expression; + + ast_expression *operand; + ast_switch_case *cases; +}; + +ast_switch* ast_switch_new(lex_ctx ctx, ast_expression *op); +void ast_switch_delete(ast_switch*); + +bool ast_switch_codegen(ast_switch*, ast_function*, bool lvalue, ir_value**); + /* CALL node * * Contains an ast_expression as target, rather than an ast_function/value. @@ -509,6 +549,15 @@ struct ast_function_s ir_block *breakblock; ir_block *continueblock; +#if 0 + /* In order for early-out logic not to go over + * excessive jumps, we remember their target + * blocks... + */ + ir_block *iftrue; + ir_block *iffalse; +#endif + size_t labelcount; /* in order for thread safety - for the optional * channel abesed multithreading... keeping a buffer