static bool ast_binstore_codegen(ast_binstore*, ast_function*, bool lvalue, ir_value**);
static void ast_binary_delete(ast_binary*);
static bool ast_binary_codegen(ast_binary*, ast_function*, bool lvalue, ir_value**);
+static void ast_range_delete(ast_range *);
+static bool ast_range_codegen(ast_range*, ast_function*, bool lvalue, ir_value**);
/* It must not be possible to get here. */
static GMQCC_NORETURN void _ast_node_destroy(ast_node *self)
ast_instantiate(ast_binary, ctx, ast_binary_delete);
ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_binary_codegen);
+ if (ast_istype(right, ast_unary) && OPTS_OPTIMIZATION(OPTIM_PEEPHOLE)) {
+ ast_unary *unary = ((ast_unary*)right);
+ ast_expression *normal = unary->operand;
+
+ /* make a-(-b) => a + b */
+ if (unary->op == VINSTR_NEG_F || unary->op == VINSTR_NEG_V) {
+ if (op == INSTR_SUB_F) {
+ op = INSTR_ADD_F;
+ right = normal;
+ ++opts_optimizationcount[OPTIM_PEEPHOLE];
+ } else if (op == INSTR_SUB_V) {
+ op = INSTR_ADD_V;
+ right = normal;
+ ++opts_optimizationcount[OPTIM_PEEPHOLE];
+ }
+ }
+ }
+
self->op = op;
self->left = left;
self->right = right;
self->op = op;
self->operand = expr;
+
if (ast_istype(expr, ast_unary) && OPTS_OPTIMIZATION(OPTIM_PEEPHOLE)) {
ast_unary *prev = (ast_unary*)((ast_unary*)expr)->operand;
+
+ /* Handle for double negation */
+ if (((ast_unary*)expr)->op == op)
+ prev = (ast_unary*)((ast_unary*)expr)->operand;
+
if (ast_istype(prev, ast_unary)) {
ast_expression_delete((ast_expression*)self);
mem_d(self);
ast_propagate_effects(self, expr);
- if (op >= INSTR_NOT_F && op <= INSTR_NOT_FNC) {
- self->expression.vtype = TYPE_FLOAT;
- } else if (op >= VINSTR_NEG_F && op <= VINSTR_NEG_V) {
+ if ((op >= INSTR_NOT_F && op <= INSTR_NOT_FNC) || op == VINSTR_NEG_F) {
self->expression.vtype = TYPE_FLOAT;
+ } else if (op == VINSTR_NEG_V) {
+ self->expression.vtype = TYPE_VECTOR;
} else {
compile_error(ctx, "cannot determine type of unary operation %s", util_instr_str[op]);
}
mem_d(self);
}
+ast_range* ast_range_new(lex_ctx_t ctx, ast_expression *lower, ast_expression *upper) {
+ ast_instantiate(ast_range, ctx, ast_range_delete);
+ ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_range_codegen);
+
+ self->lower = lower;
+ self->upper = upper;
+
+ ast_propagate_effects(self, lower);
+ ast_propagate_effects(self, upper);
+
+ return self;
+}
+
+void ast_range_delete(ast_range *self) {
+ ast_unref(self->upper);
+ ast_unref(self->lower);
+
+ ast_expression_delete((ast_expression*)self);
+ mem_d(self);
+}
+
ast_label* ast_label_new(lex_ctx_t ctx, const char *name, bool undefined)
{
ast_instantiate(ast_label, ctx, ast_label_delete);
self->fixedparams = NULL;
self->return_value = NULL;
+ self->static_names = NULL;
+ self->static_count = 0;
+
return self;
cleanup:
*/
ast_unref(self->vtype);
}
+ for (i = 0; i < vec_size(self->static_names); ++i)
+ mem_d(self->static_names[i]);
+ vec_free(self->static_names);
for (i = 0; i < vec_size(self->blocks); ++i)
ast_delete(self->blocks[i]);
vec_free(self->blocks);
ir_value *dummy;
ast_expression *ec;
ast_expression_codegen *cgen;
+
size_t i;
(void)ir;
return true;
}
+bool ast_range_codegen(ast_range *self, ast_function *func, bool lvalue, ir_value **out) {
+ ast_expression_codegen *cgen = NULL;
+ ir_value *irupper = NULL;
+ ir_value *irlower = NULL;
+
+ if (lvalue) {
+ compile_error(ast_ctx(self), "range expression is not an l-value");
+ return false;
+ }
+
+ /* generate (lower .. upper) */
+ cgen = self->lower->codegen;
+ if (!(*cgen)((ast_expression*)(self->lower), func, false, &irlower))
+ return false;
+ cgen = self->upper->codegen;
+ if (!(*cgen)((ast_expression*)(self->upper), func, false, &irupper))
+ return false;
+
+ (void)lvalue;
+ (void)out;
+
+ return true;
+}
+
bool ast_label_codegen(ast_label *self, ast_function *func, bool lvalue, ir_value **out)
{
size_t i;