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,
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) )
ast_expression *next;
/* arrays get a member-count */
size_t count;
- MEM_VECTOR_MAKE(ast_value*, params);
+ ast_value* *params;
bool variadic;
/* The codegen functions should store their output values
* so we can call it multiple times without re-evaluating.
ir_value *outl;
ir_value *outr;
} ast_expression_common;
-MEM_VECTOR_PROTO(ast_expression_common, ast_value*, params);
/* Value
*
bool ast_local_codegen(ast_value *self, ir_function *func, bool isparam);
bool ast_global_codegen(ast_value *self, ir_builder *ir, bool isfield);
-bool GMQCC_WARN ast_value_params_add(ast_value*, ast_value*);
+void 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);
/* 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*);
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.
{
ast_expression_common expression;
ast_expression *func;
- MEM_VECTOR_MAKE(ast_expression*, params);
+ ast_expression* *params;
};
ast_call* ast_call_new(lex_ctx ctx,
ast_expression *funcexpr);
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);
-
/* Blocks
*
*/
{
ast_expression_common expression;
- MEM_VECTOR_MAKE(ast_value*, locals);
- MEM_VECTOR_MAKE(ast_expression*, exprs);
- MEM_VECTOR_MAKE(ast_expression*, collect);
+ ast_value* *locals;
+ ast_expression* *exprs;
+ ast_expression* *collect;
};
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);
-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*);
+void ast_block_collect(ast_block*, ast_expression*);
/* Function
*
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
*/
char labelbuf[64];
- MEM_VECTOR_MAKE(ast_block*, blocks);
+ ast_block* *blocks;
};
ast_function* ast_function_new(lex_ctx ctx, const char *name, ast_value *vtype);
/* This will NOT delete the underlying ast_value */
*/
const char* ast_function_label(ast_function*, const char *prefix);
-MEM_VECTOR_PROTO(ast_function, ast_block*, blocks);
-
bool ast_function_codegen(ast_function *self, ir_builder *builder);
/* Expression union