+static ir_node *expression_to_addr(const expression_t *expression);
+
+static void set_value_for_expression(const expression_t *expression,
+ ir_node *value)
+{
+ if(expression->type == EXPR_REFERENCE) {
+ reference_expression_t *ref = (reference_expression_t*) expression;
+
+ declaration_t *declaration = ref->declaration;
+ assert(declaration->declaration_type != DECLARATION_TYPE_UNKNOWN);
+ if(declaration->declaration_type == DECLARATION_TYPE_LOCAL_VARIABLE) {
+ set_value(declaration->v.value_number, value);
+ return;
+ }
+ }
+
+ dbg_info *dbgi = get_dbg_info(&expression->source_position);
+ ir_node *addr = expression_to_addr(expression);
+ assert(get_irn_mode(value) == get_ir_mode(expression->datatype));
+ ir_node *memory = get_store();
+ ir_node *store = new_d_Store(dbgi, memory, addr, value);
+ ir_node *store_mem = new_d_Proj(dbgi, store, mode_M, pn_Store_M);
+ set_store(store_mem);
+}
+
+static ir_node *create_conv(dbg_info *dbgi, ir_node *value, ir_mode *dest_mode)
+{
+ ir_mode *value_mode = get_irn_mode(value);
+
+ if(value_mode == dest_mode)
+ return value;
+
+ if(dest_mode == mode_b) {
+ ir_node *zero = new_Const(value_mode, get_mode_null(value_mode));
+ ir_node *cmp = new_d_Cmp(dbgi, value, zero);
+ ir_node *proj = new_d_Proj(dbgi, cmp, mode_b, pn_Cmp_Lg);
+ return proj;
+ }
+
+ return new_d_Conv(dbgi, value, dest_mode);
+}
+
+static ir_node *unary_expression_to_firm(const unary_expression_t *expression)
+{
+ dbg_info *dbgi = get_dbg_info(&expression->expression.source_position);
+ type_t *type = expression->expression.datatype;
+ ir_mode *mode = get_ir_mode(type);
+
+ if(expression->type == UNEXPR_TAKE_ADDRESS)
+ return expression_to_addr(expression->value);
+
+ const expression_t *value = expression->value;
+ ir_node *value_node = expression_to_firm(value);
+
+ switch(expression->type) {
+ case UNEXPR_NEGATE:
+ return new_d_Minus(dbgi, value_node, mode);
+ case UNEXPR_PLUS:
+ return value_node;
+ case UNEXPR_BITWISE_NEGATE:
+ return new_d_Not(dbgi, value_node, mode);
+ case UNEXPR_NOT:
+ if(get_irn_mode(value_node) != mode_b) {
+ value_node = create_conv(dbgi, value_node, mode_b);
+ }
+ value_node = new_d_Not(dbgi, value_node, mode_b);
+ if(mode != mode_b) {
+ value_node = create_conv(dbgi, value_node, mode);
+ }
+ return value_node;
+ case UNEXPR_DEREFERENCE:
+ return load_from_expression_addr(type, value_node, dbgi);
+ case UNEXPR_POSTFIX_INCREMENT: {
+ ir_node *one = new_Const(mode, get_mode_one(mode));
+ ir_node *new_value = new_d_Add(dbgi, value_node, one, mode);
+ set_value_for_expression(value, new_value);
+ return value_node;
+ }
+ case UNEXPR_POSTFIX_DECREMENT: {
+ ir_node *one = new_Const(mode, get_mode_one(mode));
+ ir_node *new_value = new_d_Sub(dbgi, value_node, one, mode);
+ set_value_for_expression(value, new_value);
+ return value_node;
+ }
+ case UNEXPR_PREFIX_INCREMENT: {
+ ir_node *one = new_Const(mode, get_mode_one(mode));
+ ir_node *new_value = new_d_Add(dbgi, value_node, one, mode);
+ set_value_for_expression(value, new_value);
+ return new_value;
+ }
+ case UNEXPR_PREFIX_DECREMENT: {
+ ir_node *one = new_Const(mode, get_mode_one(mode));
+ ir_node *new_value = new_d_Sub(dbgi, value_node, one, mode);
+ set_value_for_expression(value, new_value);
+ return new_value;
+ }
+ case UNEXPR_CAST:
+ return create_conv(dbgi, value_node, mode);
+
+ case UNEXPR_TAKE_ADDRESS:
+ case UNEXPR_INVALID:
+ break;
+ }
+ panic("invalid UNEXPR type found");
+}
+
+static long get_pnc(binary_expression_type_t type)
+{
+ switch(type) {
+ case BINEXPR_EQUAL: return pn_Cmp_Eq;
+ case BINEXPR_NOTEQUAL: return pn_Cmp_Lg;
+ case BINEXPR_LESS: return pn_Cmp_Lt;
+ case BINEXPR_LESSEQUAL: return pn_Cmp_Le;
+ case BINEXPR_GREATER: return pn_Cmp_Gt;
+ case BINEXPR_GREATEREQUAL: return pn_Cmp_Ge;
+ default:
+ break;
+ }
+ panic("trying to get pn_Cmp from non-comparison binexpr type");
+}
+
+static ir_node *create_lazy_op(const binary_expression_t *expression)
+{
+ dbg_info *dbgi = get_dbg_info(&expression->expression.source_position);
+
+ bool is_or = (expression->type == BINEXPR_LOGICAL_OR);
+ assert(is_or || expression->type == BINEXPR_LOGICAL_AND);
+
+ ir_node *val1 = expression_to_modeb(expression->left);
+ ir_node *cond = new_d_Cond(dbgi, val1);
+ ir_node *true_proj = new_d_Proj(dbgi, cond, mode_X, pn_Cond_true);
+ ir_node *false_proj = new_d_Proj(dbgi, cond, mode_X, pn_Cond_false);
+
+ ir_node *fallthrough_block = new_immBlock();
+
+ /* the true case */
+ ir_node *calc_val2_block = new_immBlock();
+ if(is_or) {
+ add_immBlock_pred(calc_val2_block, false_proj);
+ } else {
+ add_immBlock_pred(calc_val2_block, true_proj);
+ }
+
+ mature_immBlock(calc_val2_block);
+
+ ir_node *val2 = expression_to_modeb(expression->right);
+ if(get_cur_block() != NULL) {
+ ir_node *jmp = new_d_Jmp(dbgi);
+ add_immBlock_pred(fallthrough_block, jmp);
+ }
+
+ /* fallthrough */
+ ir_node *constb;
+ if(is_or) {
+ constb = new_d_Const(dbgi, mode_b, get_tarval_b_true());
+ add_immBlock_pred(fallthrough_block, true_proj);
+ } else {
+ constb = new_d_Const(dbgi, mode_b, get_tarval_b_false());
+ add_immBlock_pred(fallthrough_block, false_proj);
+ }
+ mature_immBlock(fallthrough_block);
+
+ set_cur_block(fallthrough_block);
+
+ ir_node *in[2] = { val2, constb };
+ ir_node *val = new_d_Phi(dbgi, 2, in, mode_b);
+
+ return val;
+}
+
+typedef ir_node * (*create_arithmetic_func)(dbg_info *dbgi, ir_node *left,
+ ir_node *right, ir_mode *mode);
+
+static ir_node *create_arithmetic_binop(const binary_expression_t *expression,
+ create_arithmetic_func func)
+{
+ dbg_info *dbgi = get_dbg_info(&expression->expression.source_position);
+ ir_node *left = expression_to_firm(expression->left);
+ ir_node *right = expression_to_firm(expression->right);
+ type_t *type = expression->right->datatype;
+ /* be careful with the modes, because in asithmetic assign nodes only
+ * the right operand has the mode of the arithmetic alread */
+ ir_mode *mode = get_ir_mode(type);
+ left = create_conv(dbgi, left, mode);
+ ir_node *res = func(dbgi, left, right, mode);
+
+ return res;
+}
+
+static ir_node *create_arithmetic_assign_binop(
+ const binary_expression_t *expression, create_arithmetic_func func)
+{
+ dbg_info *dbgi = get_dbg_info(&expression->expression.source_position);
+ ir_node *value = create_arithmetic_binop(expression, func);
+ type_t *type = expression->expression.datatype;
+ ir_mode *mode = get_ir_mode(type);
+
+ assert(type->type != TYPE_POINTER);
+
+ value = create_conv(dbgi, value, mode);
+ set_value_for_expression(expression->left, value);
+
+ return value;
+}
+
+static ir_node *create_add(const binary_expression_t *expression)
+{
+ dbg_info *dbgi = get_dbg_info(&expression->expression.source_position);
+ ir_node *left = expression_to_firm(expression->left);
+ ir_node *right = expression_to_firm(expression->right);
+ type_t *type = expression->expression.datatype;
+ ir_mode *mode = get_ir_mode(type);
+
+ expression_t *expr_left = expression->left;
+ expression_t *expr_right = expression->right;
+ type_t *type_left = skip_typeref(expr_left->datatype);
+ type_t *type_right = skip_typeref(expr_right->datatype);
+
+ if(is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
+ return new_d_Add(dbgi, left, right, mode);
+ }
+
+ ir_node *pointer;
+ ir_node *integer;
+ pointer_type_t *pointer_type;
+ if(type_left->type == TYPE_POINTER) {
+ pointer = left;
+ integer = right;
+ pointer_type = (pointer_type_t*) type_left;
+ } else {
+ assert(type_right->type == TYPE_POINTER);
+ pointer = right;
+ integer = left;
+ pointer_type = (pointer_type_t*) type_right;
+ }
+
+ type_t *points_to = pointer_type->points_to;
+ unsigned elem_size = get_type_size(points_to);
+
+ assert(elem_size >= 1);
+ if(elem_size > 1) {
+ integer = create_conv(dbgi, integer, mode_Is);
+ ir_node *cnst = new_Const_long(mode_Is, (int) elem_size);
+ ir_node *mul = new_d_Mul(dbgi, integer, cnst, mode_Is);
+ integer = mul;
+ }
+
+ ir_node *res = new_d_Add(dbgi, pointer, integer, mode);
+
+ return res;
+}
+
+static ir_node *create_sub(const binary_expression_t *expression)
+{
+ dbg_info *dbgi = get_dbg_info(&expression->expression.source_position);
+ ir_node *left = expression_to_firm(expression->left);
+ ir_node *right = expression_to_firm(expression->right);
+ type_t *type = expression->expression.datatype;
+ ir_mode *mode = get_ir_mode(type);
+
+ expression_t *expr_left = expression->left;
+ expression_t *expr_right = expression->right;
+ type_t *type_left = skip_typeref(expr_left->datatype);
+ type_t *type_right = skip_typeref(expr_right->datatype);
+
+ if((is_type_arithmetic(type_left) && is_type_arithmetic(type_right))
+ || (type_left->type == TYPE_POINTER
+ && type_right->type == TYPE_POINTER)) {
+ return new_d_Sub(dbgi, left, right, mode);
+ }
+
+ assert(type_right->type == TYPE_POINTER);
+ ir_node *pointer = left;
+ ir_node *integer = right;
+ pointer_type_t *pointer_type = (pointer_type_t*) type_right;
+
+ type_t *points_to = pointer_type->points_to;
+ unsigned elem_size = get_type_size(points_to);
+
+ assert(elem_size >= 1);
+ if(elem_size > 1) {
+ ir_node *cnst = new_Const_long(mode_Iu, elem_size);
+ ir_node *mul = new_d_Mul(dbgi, integer, cnst, mode_Iu);
+ integer = mul;
+ }
+
+ ir_node *res = new_d_Sub(dbgi, pointer, integer, mode);
+
+ return res;
+}
+
+static ir_node *create_divmod(const binary_expression_t *expression)
+{
+ dbg_info *dbgi = get_dbg_info(&expression->expression.source_position);
+ ir_node *left = expression_to_firm(expression->left);
+ ir_node *right = expression_to_firm(expression->right);
+ ir_node *pin = new_Pin(new_NoMem());
+ type_t *type = expression->expression.datatype;
+ ir_mode *mode = get_ir_mode(type);
+ ir_node *op;
+ ir_node *res;
+
+ if(expression->type == BINEXPR_DIV) {
+ if(mode_is_float(mode)) {
+ op = new_d_Quot(dbgi, pin, left, right, mode, op_pin_state_floats);
+ res = new_d_Proj(dbgi, op, mode, pn_Quot_res);
+ } else {
+ op = new_d_Div(dbgi, pin, left, right, mode, op_pin_state_floats);
+ res = new_d_Proj(dbgi, op, mode, pn_Div_res);
+ }
+ } else {
+ assert(expression->type == BINEXPR_MOD);
+ assert(!mode_is_float(mode));
+ op = new_d_Mod(dbgi, pin, left, right, mode, op_pin_state_floats);
+ res = new_d_Proj(dbgi, op, mode, pn_Mod_res);
+ }
+
+ return res;
+}
+
+
+
+static ir_node *binary_expression_to_firm(const binary_expression_t *expression)
+{
+ binary_expression_type_t type = expression->type;
+ switch(type) {
+ case BINEXPR_EQUAL:
+ case BINEXPR_NOTEQUAL:
+ case BINEXPR_LESS:
+ case BINEXPR_LESSEQUAL:
+ case BINEXPR_GREATER:
+ case BINEXPR_GREATEREQUAL: {
+ dbg_info *dbgi = get_dbg_info(&expression->expression.source_position);
+ ir_node *left = expression_to_firm(expression->left);
+ ir_node *right = expression_to_firm(expression->right);
+ ir_node *cmp = new_d_Cmp(dbgi, left, right);
+ long pnc = get_pnc(type);
+ ir_node *proj = new_d_Proj(dbgi, cmp, mode_b, pnc);
+ return proj;
+ }
+ case BINEXPR_ASSIGN: {
+ ir_node *right = expression_to_firm(expression->right);
+ set_value_for_expression(expression->left, right);
+ return right;
+ }
+ case BINEXPR_ADD:
+ return create_add(expression);
+ case BINEXPR_SUB:
+ return create_sub(expression);
+ case BINEXPR_MUL:
+ return create_arithmetic_binop(expression, new_d_Mul);
+ case BINEXPR_BITWISE_AND:
+ return create_arithmetic_binop(expression, new_d_And);
+ case BINEXPR_BITWISE_OR:
+ return create_arithmetic_binop(expression, new_d_Or);
+ case BINEXPR_BITWISE_XOR:
+ return create_arithmetic_binop(expression, new_d_Eor);
+ case BINEXPR_SHIFTLEFT:
+ return create_arithmetic_binop(expression, new_d_Shl);
+ case BINEXPR_SHIFTRIGHT:
+ return create_arithmetic_binop(expression, new_d_Shr);
+ case BINEXPR_DIV:
+ case BINEXPR_MOD:
+ return create_divmod(expression);
+ case BINEXPR_LOGICAL_AND:
+ case BINEXPR_LOGICAL_OR:
+ return create_lazy_op(expression);
+ case BINEXPR_COMMA:
+ expression_to_firm(expression->left);
+ return expression_to_firm(expression->right);
+ case BINEXPR_ADD_ASSIGN:
+ return create_arithmetic_assign_binop(expression, new_d_Add);
+ case BINEXPR_SUB_ASSIGN:
+ return create_arithmetic_assign_binop(expression, new_d_Sub);
+ case BINEXPR_MUL_ASSIGN:
+ return create_arithmetic_assign_binop(expression, new_d_Mul);
+ case BINEXPR_BITWISE_AND_ASSIGN:
+ return create_arithmetic_assign_binop(expression, new_d_And);
+ case BINEXPR_BITWISE_OR_ASSIGN:
+ return create_arithmetic_assign_binop(expression, new_d_Or);
+ case BINEXPR_BITWISE_XOR_ASSIGN:
+ return create_arithmetic_assign_binop(expression, new_d_Eor);
+ case BINEXPR_SHIFTLEFT_ASSIGN:
+ return create_arithmetic_assign_binop(expression, new_d_Shl);
+ case BINEXPR_SHIFTRIGHT_ASSIGN:
+ return create_arithmetic_assign_binop(expression, new_d_Shr);
+ default:
+ panic("TODO binexpr type");
+ }
+}
+
+static ir_node *array_access_addr(const array_access_expression_t *expression)
+{
+ dbg_info *dbgi = get_dbg_info(&expression->expression.source_position);
+
+ ir_node *base_addr = expression_to_firm(expression->array_ref);
+ ir_node *offset = expression_to_firm(expression->index);
+ offset = create_conv(dbgi, offset, mode_Iu);
+
+ unsigned elem_size = get_type_size(expression->expression.datatype);
+ ir_node *elem_size_const = new_Const_long(mode_Iu, elem_size);
+ ir_node *real_offset = new_d_Mul(dbgi, offset, elem_size_const,
+ mode_Iu);
+ ir_node *result = new_d_Add(dbgi, base_addr, real_offset, mode_P);
+
+ return result;
+}
+
+static ir_node *array_access_to_firm(
+ const array_access_expression_t *expression)
+{
+
+ dbg_info *dbgi = get_dbg_info(&expression->expression.source_position);
+ ir_node *addr = array_access_addr(expression);
+ type_t *type = expression->expression.datatype;
+
+ return load_from_expression_addr(type, addr, dbgi);
+}
+
+static ir_node *sizeof_to_firm(const sizeof_expression_t *expression)
+{
+ type_t *type = expression->type;
+ if(type == NULL) {
+ type = expression->size_expression->datatype;
+ assert(type != NULL);
+ }
+
+ ir_mode *mode = get_ir_mode(expression->expression.datatype);
+ unsigned size = get_type_size(type);
+ ir_node *size_node = new_Const_long(mode, size);
+
+ return size_node;
+}
+
+static ir_node *conditional_to_firm(const conditional_expression_t *expression)
+{
+ dbg_info *dbgi = get_dbg_info(&expression->expression.source_position);
+
+ ir_node *condition = expression_to_modeb(expression->condition);
+ ir_node *cond = new_d_Cond(dbgi, condition);
+ ir_node *true_proj = new_d_Proj(dbgi, cond, mode_X, pn_Cond_true);
+ ir_node *false_proj = new_d_Proj(dbgi, cond, mode_X, pn_Cond_false);
+
+ /* create the true block */
+ ir_node *true_block = new_immBlock();
+ add_immBlock_pred(true_block, true_proj);
+ mature_immBlock(true_block);
+
+ ir_node *true_val = expression_to_firm(expression->true_expression);
+ ir_node *true_jmp = new_Jmp();
+
+ /* create the false block */
+ ir_node *false_block = new_immBlock();
+ add_immBlock_pred(false_block, false_proj);
+ mature_immBlock(false_block);
+
+ ir_node *false_val = expression_to_firm(expression->false_expression);
+ ir_node *false_jmp = new_Jmp();
+
+ /* create the common block */
+ ir_node *common_block = new_immBlock();
+ add_immBlock_pred(common_block, true_jmp);
+ add_immBlock_pred(common_block, false_jmp);
+ mature_immBlock(common_block);
+
+ ir_node *in[2] = { true_val, false_val };
+ ir_mode *mode = get_irn_mode(true_val);
+ assert(get_irn_mode(false_val) == mode);
+ ir_node *val = new_d_Phi(dbgi, 2, in, mode);
+
+ return val;
+}
+
+static ir_node *expression_to_addr(const expression_t *expression)
+{
+ switch(expression->type) {
+ case EXPR_REFERENCE:
+ return reference_addr((const reference_expression_t*) expression);
+ case EXPR_ARRAY_ACCESS:
+ return array_access_addr((const array_access_expression_t*) expression);
+ default:
+ break;
+ }
+ panic("trying to get address of non-lvalue");
+}
+
+static ir_node *_expression_to_firm(const expression_t *expression)