2 * This file is part of cparser.
3 * Copyright (C) 2007-2009 Matthias Braun <matze@braunis.de>
5 * This program is free software; you can redistribute it and/or
6 * modify it under the terms of the GNU General Public License
7 * as published by the Free Software Foundation; either version 2
8 * of the License, or (at your option) any later version.
10 * This program is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 * GNU General Public License for more details.
15 * You should have received a copy of the GNU General Public License
16 * along with this program; if not, write to the Free Software
17 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
28 #include <libfirm/firm.h>
29 #include <libfirm/adt/obst.h>
30 #include <libfirm/be.h>
34 #include "adt/error.h"
35 #include "adt/array.h"
36 #include "adt/strutil.h"
44 #include "diagnostic.h"
45 #include "lang_features.h"
47 #include "type_hash.h"
52 #include "entitymap_t.h"
53 #include "driver/firm_opt.h"
55 typedef struct trampoline_region trampoline_region;
56 struct trampoline_region {
57 ir_entity *function; /**< The function that is called by this trampoline */
58 ir_entity *region; /**< created region for the trampoline */
61 fp_model_t firm_fp_model = fp_model_precise;
63 static const backend_params *be_params;
65 static ir_type *ir_type_char;
66 static ir_type *ir_type_wchar_t;
68 /* architecture specific floating point arithmetic mode (if any) */
69 static ir_mode *mode_float_arithmetic;
71 /* alignment of stack parameters */
72 static unsigned stack_param_align;
74 static int next_value_number_function;
75 static ir_node *continue_label;
76 static ir_node *break_label;
77 static ir_node *current_switch;
78 static bool saw_default_label;
79 static label_t **all_labels;
80 static entity_t **inner_functions;
81 static ir_node *ijmp_list;
82 static bool constant_folding;
84 #define PUSH_BREAK(val) \
85 ir_node *const old_break_label = break_label; \
86 ((void)(break_label = (val)))
88 ((void)(break_label = old_break_label))
90 #define PUSH_CONTINUE(val) \
91 ir_node *const old_continue_label = continue_label; \
92 ((void)(continue_label = (val)))
93 #define POP_CONTINUE() \
94 ((void)(continue_label = old_continue_label))
96 #define PUSH_IRG(val) \
97 ir_graph *const old_irg = current_ir_graph; \
98 ir_graph *const new_irg = (val); \
99 ((void)(current_ir_graph = new_irg))
102 (assert(current_ir_graph == new_irg), (void)(current_ir_graph = old_irg))
104 static const entity_t *current_function_entity;
105 static ir_node *current_function_name;
106 static ir_node *current_funcsig;
107 static ir_graph *current_function;
108 static translation_unit_t *current_translation_unit;
109 static trampoline_region *current_trampolines;
110 static ir_type *current_outer_frame;
111 static ir_node *current_static_link;
112 static ir_entity *current_vararg_entity;
114 static entitymap_t entitymap;
116 static struct obstack asm_obst;
118 typedef enum declaration_kind_t {
119 DECLARATION_KIND_UNKNOWN,
120 DECLARATION_KIND_VARIABLE_LENGTH_ARRAY,
121 DECLARATION_KIND_GLOBAL_VARIABLE,
122 DECLARATION_KIND_LOCAL_VARIABLE,
123 DECLARATION_KIND_LOCAL_VARIABLE_ENTITY,
124 DECLARATION_KIND_PARAMETER,
125 DECLARATION_KIND_PARAMETER_ENTITY,
126 DECLARATION_KIND_FUNCTION,
127 DECLARATION_KIND_COMPOUND_MEMBER,
128 DECLARATION_KIND_INNER_FUNCTION
129 } declaration_kind_t;
131 static ir_type *get_ir_type_incomplete(type_t *type);
133 static void enqueue_inner_function(entity_t *entity)
135 if (inner_functions == NULL)
136 inner_functions = NEW_ARR_F(entity_t *, 0);
137 ARR_APP1(entity_t*, inner_functions, entity);
140 static ir_node *uninitialized_local_var(ir_graph *irg, ir_mode *mode, int pos)
142 const entity_t *entity = get_irg_loc_description(irg, pos);
144 if (entity != NULL) {
145 source_position_t const *const pos = &entity->base.source_position;
146 warningf(WARN_UNINITIALIZED, pos, "'%N' might be used uninitialized", entity);
148 return new_r_Unknown(irg, mode);
151 static src_loc_t dbg_retrieve(const dbg_info *dbg)
153 source_position_t const *const pos = (source_position_t const*)dbg;
155 return (src_loc_t){ pos->input_name, pos->lineno, pos->colno };
157 return (src_loc_t){ NULL, 0, 0 };
161 static dbg_info *get_dbg_info(const source_position_t *pos)
163 return (dbg_info*) pos;
166 static void dbg_print_type_dbg_info(char *buffer, size_t buffer_size,
167 const type_dbg_info *dbg)
170 print_to_buffer(buffer, buffer_size);
171 const type_t *type = (const type_t*) dbg;
173 finish_print_to_buffer();
176 static type_dbg_info *get_type_dbg_info_(const type_t *type)
178 return (type_dbg_info*) type;
181 /* is the current block a reachable one? */
182 static bool currently_reachable(void)
184 ir_node *const block = get_cur_block();
185 return block != NULL && !is_Bad(block);
188 static void set_unreachable_now(void)
193 ir_mode *atomic_modes[ATOMIC_TYPE_LAST+1];
195 static ir_node *_expression_to_firm(const expression_t *expression);
196 static ir_node *expression_to_firm(const expression_t *expression);
198 static unsigned decide_modulo_shift(unsigned type_size)
200 if (architecture_modulo_shift == 0)
202 if (type_size < architecture_modulo_shift)
203 return architecture_modulo_shift;
207 static ir_mode *init_atomic_ir_mode(atomic_type_kind_t kind)
209 unsigned flags = get_atomic_type_flags(kind);
210 unsigned size = get_atomic_type_size(kind);
211 if ((flags & ATOMIC_TYPE_FLAG_FLOAT)
212 && !(flags & ATOMIC_TYPE_FLAG_COMPLEX)) {
214 case 4: return get_modeF();
215 case 8: return get_modeD();
216 default: panic("unexpected kind");
218 } else if (flags & ATOMIC_TYPE_FLAG_INTEGER) {
220 unsigned bit_size = size * 8;
221 bool is_signed = (flags & ATOMIC_TYPE_FLAG_SIGNED) != 0;
222 unsigned modulo_shift = decide_modulo_shift(bit_size);
224 snprintf(name, sizeof(name), "%s%u", is_signed ? "I" : "U", bit_size);
225 return new_int_mode(name, irma_twos_complement, bit_size, is_signed,
233 * Initialises the atomic modes depending on the machine size.
235 static void init_atomic_modes(void)
237 atomic_modes[ATOMIC_TYPE_VOID] = mode_ANY;
238 for (int i = 0; i <= ATOMIC_TYPE_LAST; ++i) {
239 if (atomic_modes[i] != NULL)
241 atomic_modes[i] = init_atomic_ir_mode((atomic_type_kind_t) i);
245 ir_mode *get_atomic_mode(atomic_type_kind_t kind)
247 assert(kind <= ATOMIC_TYPE_LAST);
248 return atomic_modes[kind];
251 static ir_node *get_vla_size(array_type_t *const type)
253 ir_node *size_node = type->size_node;
254 if (size_node == NULL) {
255 size_node = expression_to_firm(type->size_expression);
256 type->size_node = size_node;
261 static unsigned count_parameters(const function_type_t *function_type)
265 function_parameter_t *parameter = function_type->parameters;
266 for ( ; parameter != NULL; parameter = parameter->next) {
274 * Creates a Firm type for an atomic type
276 static ir_type *create_atomic_type(atomic_type_kind_t akind, const type_t *type)
278 ir_mode *mode = atomic_modes[akind];
279 type_dbg_info *dbgi = get_type_dbg_info_(type);
280 ir_type *irtype = new_d_type_primitive(mode, dbgi);
281 il_alignment_t alignment = get_atomic_type_alignment(akind);
283 set_type_size_bytes(irtype, get_atomic_type_size(akind));
284 set_type_alignment_bytes(irtype, alignment);
290 * Creates a Firm type for a complex type
292 static ir_type *create_complex_type(const atomic_type_t *type)
294 atomic_type_kind_t kind = type->akind;
295 ir_mode *mode = atomic_modes[kind];
296 ident *id = get_mode_ident(mode);
300 /* FIXME: finish the array */
305 * Creates a Firm type for an imaginary type
307 static ir_type *create_imaginary_type(const atomic_type_t *type)
309 return create_atomic_type(type->akind, (const type_t*)type);
313 * return type of a parameter (and take transparent union gnu extension into
316 static type_t *get_parameter_type(type_t *orig_type)
318 type_t *type = skip_typeref(orig_type);
319 if (is_type_union(type)
320 && get_type_modifiers(orig_type) & DM_TRANSPARENT_UNION) {
321 compound_t *compound = type->compound.compound;
322 type = compound->members.entities->declaration.type;
328 static ir_type *create_method_type(const function_type_t *function_type, bool for_closure)
330 type_t *return_type = skip_typeref(function_type->return_type);
332 int n_parameters = count_parameters(function_type)
333 + (for_closure ? 1 : 0);
334 int n_results = is_type_void(return_type) ? 0 : 1;
335 type_dbg_info *dbgi = get_type_dbg_info_((const type_t*) function_type);
336 ir_type *irtype = new_d_type_method(n_parameters, n_results, dbgi);
338 if (!is_type_void(return_type)) {
339 ir_type *restype = get_ir_type(return_type);
340 set_method_res_type(irtype, 0, restype);
343 function_parameter_t *parameter = function_type->parameters;
346 ir_type *p_irtype = get_ir_type(type_void_ptr);
347 set_method_param_type(irtype, n, p_irtype);
350 for ( ; parameter != NULL; parameter = parameter->next) {
351 type_t *type = get_parameter_type(parameter->type);
352 ir_type *p_irtype = get_ir_type(type);
353 set_method_param_type(irtype, n, p_irtype);
357 bool is_variadic = function_type->variadic;
360 set_method_variadicity(irtype, variadicity_variadic);
362 unsigned cc = get_method_calling_convention(irtype);
363 switch (function_type->calling_convention) {
364 case CC_DEFAULT: /* unspecified calling convention, equal to one of the other, typically cdecl */
367 set_method_calling_convention(irtype, SET_CDECL(cc));
374 /* only non-variadic function can use stdcall, else use cdecl */
375 set_method_calling_convention(irtype, SET_STDCALL(cc));
381 /* only non-variadic function can use fastcall, else use cdecl */
382 set_method_calling_convention(irtype, SET_FASTCALL(cc));
386 /* Hmm, leave default, not accepted by the parser yet. */
391 set_method_calling_convention(irtype, get_method_calling_convention(irtype) | cc_this_call);
393 const decl_modifiers_t modifiers = function_type->modifiers;
394 if (modifiers & DM_CONST)
395 add_method_additional_properties(irtype, mtp_property_const);
396 if (modifiers & DM_PURE)
397 add_method_additional_properties(irtype, mtp_property_pure);
398 if (modifiers & DM_RETURNS_TWICE)
399 add_method_additional_properties(irtype, mtp_property_returns_twice);
400 if (modifiers & DM_NORETURN)
401 add_method_additional_properties(irtype, mtp_property_noreturn);
402 if (modifiers & DM_NOTHROW)
403 add_method_additional_properties(irtype, mtp_property_nothrow);
404 if (modifiers & DM_MALLOC)
405 add_method_additional_properties(irtype, mtp_property_malloc);
410 static ir_type *create_pointer_type(pointer_type_t *type)
412 type_dbg_info *dbgi = get_type_dbg_info_((const type_t*) type);
413 type_t *points_to = type->points_to;
414 ir_type *ir_points_to = get_ir_type_incomplete(points_to);
415 ir_type *irtype = new_d_type_pointer(ir_points_to, dbgi);
420 static ir_type *create_reference_type(reference_type_t *type)
422 type_dbg_info *dbgi = get_type_dbg_info_((const type_t*) type);
423 type_t *refers_to = type->refers_to;
424 ir_type *ir_refers_to = get_ir_type_incomplete(refers_to);
425 ir_type *irtype = new_d_type_pointer(ir_refers_to, dbgi);
430 static ir_type *create_array_type(array_type_t *type)
432 type_dbg_info *dbgi = get_type_dbg_info_((const type_t*) type);
433 type_t *element_type = type->element_type;
434 ir_type *ir_element_type = get_ir_type(element_type);
435 ir_type *irtype = new_d_type_array(1, ir_element_type, dbgi);
437 const int align = get_type_alignment_bytes(ir_element_type);
438 set_type_alignment_bytes(irtype, align);
440 if (type->size_constant) {
441 int n_elements = type->size;
443 set_array_bounds_int(irtype, 0, 0, n_elements);
445 size_t elemsize = get_type_size_bytes(ir_element_type);
446 if (elemsize % align > 0) {
447 elemsize += align - (elemsize % align);
449 set_type_size_bytes(irtype, n_elements * elemsize);
451 set_array_lower_bound_int(irtype, 0, 0);
453 set_type_state(irtype, layout_fixed);
459 * Return the signed integer type of size bits.
461 * @param size the size
463 static ir_type *get_signed_int_type_for_bit_size(ir_type *base_tp,
467 static ir_mode *s_modes[64 + 1] = {NULL, };
471 if (size <= 0 || size > 64)
474 mode = s_modes[size];
478 snprintf(name, sizeof(name), "bf_I%u", size);
479 mode = new_int_mode(name, irma_twos_complement, size, 1, 0);
480 s_modes[size] = mode;
483 type_dbg_info *dbgi = get_type_dbg_info_(type);
484 res = new_d_type_primitive(mode, dbgi);
485 set_primitive_base_type(res, base_tp);
491 * Return the unsigned integer type of size bits.
493 * @param size the size
495 static ir_type *get_unsigned_int_type_for_bit_size(ir_type *base_tp,
499 static ir_mode *u_modes[64 + 1] = {NULL, };
503 if (size <= 0 || size > 64)
506 mode = u_modes[size];
510 snprintf(name, sizeof(name), "bf_U%u", size);
511 mode = new_int_mode(name, irma_twos_complement, size, 0, 0);
512 u_modes[size] = mode;
515 type_dbg_info *dbgi = get_type_dbg_info_(type);
516 res = new_d_type_primitive(mode, dbgi);
517 set_primitive_base_type(res, base_tp);
522 static ir_type *create_bitfield_type(const entity_t *entity)
524 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
525 type_t *base = skip_typeref(entity->declaration.type);
526 assert(is_type_integer(base));
527 ir_type *irbase = get_ir_type(base);
529 unsigned bit_size = entity->compound_member.bit_size;
531 if (is_type_signed(base)) {
532 return get_signed_int_type_for_bit_size(irbase, bit_size, base);
534 return get_unsigned_int_type_for_bit_size(irbase, bit_size, base);
539 * Construct firm type from ast struct type.
541 static ir_type *create_compound_type(compound_type_t *const type, bool const incomplete)
543 compound_t *compound = type->compound;
545 if (compound->irtype != NULL && (compound->irtype_complete || incomplete)) {
546 return compound->irtype;
549 bool const is_union = type->base.kind == TYPE_COMPOUND_UNION;
551 symbol_t *type_symbol = compound->base.symbol;
553 if (type_symbol != NULL) {
554 id = new_id_from_str(type_symbol->string);
557 id = id_unique("__anonymous_union.%u");
559 id = id_unique("__anonymous_struct.%u");
565 irtype = new_type_union(id);
567 irtype = new_type_struct(id);
570 compound->irtype_complete = false;
571 compound->irtype = irtype;
577 layout_union_type(type);
579 layout_struct_type(type);
582 compound->irtype_complete = true;
584 entity_t *entry = compound->members.entities;
585 for ( ; entry != NULL; entry = entry->base.next) {
586 if (entry->kind != ENTITY_COMPOUND_MEMBER)
589 symbol_t *symbol = entry->base.symbol;
590 type_t *entry_type = entry->declaration.type;
592 if (symbol == NULL) {
593 /* anonymous bitfield member, skip */
594 if (entry->compound_member.bitfield)
596 assert(is_type_compound(entry_type));
597 ident = id_unique("anon.%u");
599 ident = new_id_from_str(symbol->string);
602 dbg_info *dbgi = get_dbg_info(&entry->base.source_position);
604 ir_type *entry_irtype;
605 if (entry->compound_member.bitfield) {
606 entry_irtype = create_bitfield_type(entry);
608 entry_irtype = get_ir_type(entry_type);
610 ir_entity *entity = new_d_entity(irtype, ident, entry_irtype, dbgi);
612 set_entity_offset(entity, entry->compound_member.offset);
613 set_entity_offset_bits_remainder(entity,
614 entry->compound_member.bit_offset);
616 assert(entry->declaration.kind == DECLARATION_KIND_UNKNOWN);
617 entry->declaration.kind = DECLARATION_KIND_COMPOUND_MEMBER;
618 entry->compound_member.entity = entity;
621 set_type_alignment_bytes(irtype, compound->alignment);
622 set_type_size_bytes(irtype, compound->size);
623 set_type_state(irtype, layout_fixed);
628 static ir_tarval *fold_constant_to_tarval(expression_t const *);
630 static void determine_enum_values(enum_type_t *const type)
632 ir_mode *const mode = atomic_modes[type->base.akind];
633 ir_tarval *const one = get_mode_one(mode);
634 ir_tarval * tv_next = get_mode_null(mode);
636 enum_t *enume = type->enume;
637 entity_t *entry = enume->base.next;
638 for (; entry != NULL; entry = entry->base.next) {
639 if (entry->kind != ENTITY_ENUM_VALUE)
642 expression_t *const init = entry->enum_value.value;
644 tv_next = fold_constant_to_tarval(init);
646 assert(entry->enum_value.tv == NULL || entry->enum_value.tv == tv_next);
647 entry->enum_value.tv = tv_next;
648 tv_next = tarval_add(tv_next, one);
652 static ir_type *create_enum_type(enum_type_t *const type)
654 return create_atomic_type(type->base.akind, (const type_t*) type);
657 static ir_type *get_ir_type_incomplete(type_t *type)
659 type = skip_typeref(type);
661 if (type->base.firm_type != NULL) {
662 return type->base.firm_type;
665 if (is_type_compound(type)) {
666 return create_compound_type(&type->compound, true);
668 return get_ir_type(type);
672 ir_type *get_ir_type(type_t *type)
674 type = skip_typeref(type);
676 if (type->base.firm_type != NULL) {
677 return type->base.firm_type;
680 ir_type *firm_type = NULL;
681 switch (type->kind) {
683 firm_type = create_atomic_type(type->atomic.akind, type);
686 firm_type = create_complex_type(&type->atomic);
689 firm_type = create_imaginary_type(&type->atomic);
692 firm_type = create_method_type(&type->function, false);
695 firm_type = create_pointer_type(&type->pointer);
698 firm_type = create_reference_type(&type->reference);
701 firm_type = create_array_type(&type->array);
703 case TYPE_COMPOUND_STRUCT:
704 case TYPE_COMPOUND_UNION:
705 firm_type = create_compound_type(&type->compound, false);
708 firm_type = create_enum_type(&type->enumt);
716 if (firm_type == NULL)
717 panic("unknown type found");
719 type->base.firm_type = firm_type;
723 static ir_mode *get_ir_mode_storage(type_t *type)
725 type = skip_typeref(type);
727 /* Firm doesn't report a mode for arrays and structs/unions. */
728 if (!is_type_scalar(type)) {
732 ir_type *const irtype = get_ir_type(type);
733 ir_mode *const mode = get_type_mode(irtype);
734 assert(mode != NULL);
739 * get arithmetic mode for a type. This is different from get_ir_mode_storage,
740 * int that it returns bigger modes for floating point on some platforms
741 * (x87 internally does arithemtic with 80bits)
743 static ir_mode *get_ir_mode_arithmetic(type_t *type)
745 ir_mode *mode = get_ir_mode_storage(type);
746 if (mode_is_float(mode) && mode_float_arithmetic != NULL) {
747 return mode_float_arithmetic;
754 * Return a node representing the size of a type.
756 static ir_node *get_type_size_node(type_t *type)
759 ir_mode *mode = get_ir_mode_arithmetic(type_size_t);
760 type = skip_typeref(type);
762 if (is_type_array(type) && type->array.is_vla) {
763 ir_node *size_node = get_vla_size(&type->array);
764 ir_node *elem_size = get_type_size_node(type->array.element_type);
765 ir_node *real_size = new_d_Mul(NULL, size_node, elem_size, mode);
769 size = get_type_size(type);
770 return new_Const_long(mode, size);
773 /** Names of the runtime functions. */
774 static const struct {
775 int id; /**< the rts id */
776 int n_res; /**< number of return values */
777 const char *name; /**< the name of the rts function */
778 int n_params; /**< number of parameters */
779 unsigned flags; /**< language flags */
781 { rts_debugbreak, 0, "__debugbreak", 0, _MS },
782 { rts_abort, 0, "abort", 0, _C89 },
783 { rts_alloca, 1, "alloca", 1, _ALL },
784 { rts_abs, 1, "abs", 1, _C89 },
785 { rts_labs, 1, "labs", 1, _C89 },
786 { rts_llabs, 1, "llabs", 1, _C99 },
787 { rts_imaxabs, 1, "imaxabs", 1, _C99 },
789 { rts_fabs, 1, "fabs", 1, _C89 },
790 { rts_sqrt, 1, "sqrt", 1, _C89 },
791 { rts_cbrt, 1, "cbrt", 1, _C99 },
792 { rts_exp, 1, "exp", 1, _C89 },
793 { rts_exp2, 1, "exp2", 1, _C89 },
794 { rts_exp10, 1, "exp10", 1, _GNUC },
795 { rts_log, 1, "log", 1, _C89 },
796 { rts_log2, 1, "log2", 1, _C89 },
797 { rts_log10, 1, "log10", 1, _C89 },
798 { rts_pow, 1, "pow", 2, _C89 },
799 { rts_sin, 1, "sin", 1, _C89 },
800 { rts_cos, 1, "cos", 1, _C89 },
801 { rts_tan, 1, "tan", 1, _C89 },
802 { rts_asin, 1, "asin", 1, _C89 },
803 { rts_acos, 1, "acos", 1, _C89 },
804 { rts_atan, 1, "atan", 1, _C89 },
805 { rts_sinh, 1, "sinh", 1, _C89 },
806 { rts_cosh, 1, "cosh", 1, _C89 },
807 { rts_tanh, 1, "tanh", 1, _C89 },
809 { rts_fabsf, 1, "fabsf", 1, _C99 },
810 { rts_sqrtf, 1, "sqrtf", 1, _C99 },
811 { rts_cbrtf, 1, "cbrtf", 1, _C99 },
812 { rts_expf, 1, "expf", 1, _C99 },
813 { rts_exp2f, 1, "exp2f", 1, _C99 },
814 { rts_exp10f, 1, "exp10f", 1, _GNUC },
815 { rts_logf, 1, "logf", 1, _C99 },
816 { rts_log2f, 1, "log2f", 1, _C99 },
817 { rts_log10f, 1, "log10f", 1, _C99 },
818 { rts_powf, 1, "powf", 2, _C99 },
819 { rts_sinf, 1, "sinf", 1, _C99 },
820 { rts_cosf, 1, "cosf", 1, _C99 },
821 { rts_tanf, 1, "tanf", 1, _C99 },
822 { rts_asinf, 1, "asinf", 1, _C99 },
823 { rts_acosf, 1, "acosf", 1, _C99 },
824 { rts_atanf, 1, "atanf", 1, _C99 },
825 { rts_sinhf, 1, "sinhf", 1, _C99 },
826 { rts_coshf, 1, "coshf", 1, _C99 },
827 { rts_tanhf, 1, "tanhf", 1, _C99 },
829 { rts_fabsl, 1, "fabsl", 1, _C99 },
830 { rts_sqrtl, 1, "sqrtl", 1, _C99 },
831 { rts_cbrtl, 1, "cbrtl", 1, _C99 },
832 { rts_expl, 1, "expl", 1, _C99 },
833 { rts_exp2l, 1, "exp2l", 1, _C99 },
834 { rts_exp10l, 1, "exp10l", 1, _GNUC },
835 { rts_logl, 1, "logl", 1, _C99 },
836 { rts_log2l, 1, "log2l", 1, _C99 },
837 { rts_log10l, 1, "log10l", 1, _C99 },
838 { rts_powl, 1, "powl", 2, _C99 },
839 { rts_sinl, 1, "sinl", 1, _C99 },
840 { rts_cosl, 1, "cosl", 1, _C99 },
841 { rts_tanl, 1, "tanl", 1, _C99 },
842 { rts_asinl, 1, "asinl", 1, _C99 },
843 { rts_acosl, 1, "acosl", 1, _C99 },
844 { rts_atanl, 1, "atanl", 1, _C99 },
845 { rts_sinhl, 1, "sinhl", 1, _C99 },
846 { rts_coshl, 1, "coshl", 1, _C99 },
847 { rts_tanhl, 1, "tanhl", 1, _C99 },
849 { rts_strcmp, 1, "strcmp", 2, _C89 },
850 { rts_strncmp, 1, "strncmp", 3, _C89 },
851 { rts_strcpy, 1, "strcpy", 2, _C89 },
852 { rts_strlen, 1, "strlen", 1, _C89 },
853 { rts_memcpy, 1, "memcpy", 3, _C89 },
854 { rts_mempcpy, 1, "mempcpy", 3, _GNUC },
855 { rts_memmove, 1, "memmove", 3, _C89 },
856 { rts_memset, 1, "memset", 3, _C89 },
857 { rts_memcmp, 1, "memcmp", 3, _C89 },
860 static ident *rts_idents[lengthof(rts_data)];
862 static create_ld_ident_func create_ld_ident = create_name_linux_elf;
864 void set_create_ld_ident(ident *(*func)(entity_t*))
866 create_ld_ident = func;
869 static bool declaration_is_definition(const entity_t *entity)
871 switch (entity->kind) {
872 case ENTITY_VARIABLE:
873 return entity->declaration.storage_class != STORAGE_CLASS_EXTERN;
874 case ENTITY_FUNCTION:
875 return entity->function.body != NULL;
876 case ENTITY_PARAMETER:
877 case ENTITY_COMPOUND_MEMBER:
881 case ENTITY_ENUM_VALUE:
882 case ENTITY_NAMESPACE:
884 case ENTITY_LOCAL_LABEL:
887 panic("declaration_is_definition called on non-declaration");
891 * Handle GNU attributes for entities
893 * @param ent the entity
894 * @param decl the routine declaration
896 static void handle_decl_modifiers(ir_entity *irentity, entity_t *entity)
898 assert(is_declaration(entity));
899 decl_modifiers_t modifiers = entity->declaration.modifiers;
901 if (is_method_entity(irentity)) {
902 if (modifiers & DM_PURE)
903 add_entity_additional_properties(irentity, mtp_property_pure);
904 if (modifiers & DM_CONST)
905 add_entity_additional_properties(irentity, mtp_property_const);
906 if (modifiers & DM_NOINLINE)
907 add_entity_additional_properties(irentity, mtp_property_noinline);
908 if (modifiers & DM_FORCEINLINE)
909 add_entity_additional_properties(irentity, mtp_property_always_inline);
910 if (modifiers & DM_NAKED)
911 add_entity_additional_properties(irentity, mtp_property_naked);
912 if (entity->kind == ENTITY_FUNCTION && entity->function.is_inline)
913 add_entity_additional_properties(irentity,
914 mtp_property_inline_recommended);
916 if ((modifiers & DM_USED) && declaration_is_definition(entity)) {
917 add_entity_linkage(irentity, IR_LINKAGE_HIDDEN_USER);
919 if ((modifiers & DM_WEAK) && declaration_is_definition(entity)
920 && entity->declaration.storage_class != STORAGE_CLASS_EXTERN) {
921 add_entity_linkage(irentity, IR_LINKAGE_WEAK);
925 static bool is_main(entity_t *entity)
927 static symbol_t *sym_main = NULL;
928 if (sym_main == NULL) {
929 sym_main = symbol_table_insert("main");
932 if (entity->base.symbol != sym_main)
934 /* must be in outermost scope */
935 if (entity->base.parent_scope != ¤t_translation_unit->scope)
942 * Creates an entity representing a function.
944 * @param entity the function declaration/definition
945 * @param owner_type the owner type of this function, NULL
946 * for global functions
948 static ir_entity *get_function_entity(entity_t *entity, ir_type *owner_type)
950 assert(entity->kind == ENTITY_FUNCTION);
951 if (entity->function.irentity != NULL)
952 return entity->function.irentity;
954 switch (entity->function.btk) {
957 case BUILTIN_LIBC_CHECK:
963 symbol_t *symbol = entity->base.symbol;
964 ident *id = new_id_from_str(symbol->string);
966 /* already an entity defined? */
967 ir_entity *irentity = entitymap_get(&entitymap, symbol);
968 bool const has_body = entity->function.body != NULL;
969 if (irentity != NULL) {
973 ir_type *ir_type_method;
974 if (entity->function.need_closure)
975 ir_type_method = create_method_type(&entity->declaration.type->function, true);
977 ir_type_method = get_ir_type(entity->declaration.type);
979 bool nested_function = false;
980 if (owner_type == NULL)
981 owner_type = get_glob_type();
983 nested_function = true;
985 dbg_info *const dbgi = get_dbg_info(&entity->base.source_position);
986 irentity = new_d_entity(owner_type, id, ir_type_method, dbgi);
990 ld_id = id_unique("inner.%u");
992 ld_id = create_ld_ident(entity);
993 set_entity_ld_ident(irentity, ld_id);
995 handle_decl_modifiers(irentity, entity);
997 if (! nested_function) {
998 storage_class_tag_t const storage_class
999 = (storage_class_tag_t) entity->declaration.storage_class;
1000 if (storage_class == STORAGE_CLASS_STATIC) {
1001 set_entity_visibility(irentity, ir_visibility_local);
1003 set_entity_visibility(irentity, ir_visibility_external);
1006 bool const is_inline = entity->function.is_inline;
1007 if (is_inline && has_body) {
1008 if (((c_mode & _C99) && storage_class == STORAGE_CLASS_NONE)
1009 || ((c_mode & _C99) == 0
1010 && storage_class == STORAGE_CLASS_EXTERN)) {
1011 add_entity_linkage(irentity, IR_LINKAGE_NO_CODEGEN);
1015 /* nested functions are always local */
1016 set_entity_visibility(irentity, ir_visibility_local);
1019 /* We should check for file scope here, but as long as we compile C only
1020 this is not needed. */
1021 if (!freestanding && !has_body) {
1022 /* check for a known runtime function */
1023 for (size_t i = 0; i < lengthof(rts_data); ++i) {
1024 if (id != rts_idents[i])
1027 function_type_t *function_type
1028 = &entity->declaration.type->function;
1029 /* rts_entities code can't handle a "wrong" number of parameters */
1030 if (function_type->unspecified_parameters)
1033 /* check number of parameters */
1034 int n_params = count_parameters(function_type);
1035 if (n_params != rts_data[i].n_params)
1038 type_t *return_type = skip_typeref(function_type->return_type);
1039 int n_res = is_type_void(return_type) ? 0 : 1;
1040 if (n_res != rts_data[i].n_res)
1043 /* ignore those rts functions not necessary needed for current mode */
1044 if ((c_mode & rts_data[i].flags) == 0)
1046 assert(rts_entities[rts_data[i].id] == NULL);
1047 rts_entities[rts_data[i].id] = irentity;
1051 entitymap_insert(&entitymap, symbol, irentity);
1054 entity->declaration.kind = DECLARATION_KIND_FUNCTION;
1055 entity->function.irentity = irentity;
1061 * Creates a SymConst for a given entity.
1063 * @param dbgi debug info
1064 * @param entity the entity
1066 static ir_node *create_symconst(dbg_info *dbgi, ir_entity *entity)
1068 assert(entity != NULL);
1069 union symconst_symbol sym;
1070 sym.entity_p = entity;
1071 return new_d_SymConst(dbgi, mode_P, sym, symconst_addr_ent);
1074 static ir_node *create_Const_from_bool(ir_mode *const mode, bool const v)
1076 return new_Const((v ? get_mode_one : get_mode_null)(mode));
1079 static ir_node *create_conv_from_b(dbg_info *dbgi, ir_node *value,
1082 if (is_Const(value)) {
1083 return create_Const_from_bool(dest_mode, !is_Const_null(value));
1086 ir_node *cond = new_d_Cond(dbgi, value);
1087 ir_node *proj_true = new_Proj(cond, mode_X, pn_Cond_true);
1088 ir_node *proj_false = new_Proj(cond, mode_X, pn_Cond_false);
1089 ir_node *tblock = new_Block(1, &proj_true);
1090 ir_node *fblock = new_Block(1, &proj_false);
1091 set_cur_block(tblock);
1092 ir_node *const1 = new_Const(get_mode_one(dest_mode));
1093 ir_node *tjump = new_Jmp();
1094 set_cur_block(fblock);
1095 ir_node *const0 = new_Const(get_mode_null(dest_mode));
1096 ir_node *fjump = new_Jmp();
1098 ir_node *in[2] = { tjump, fjump };
1099 ir_node *mergeblock = new_Block(2, in);
1100 set_cur_block(mergeblock);
1101 ir_node *phi_in[2] = { const1, const0 };
1102 ir_node *phi = new_Phi(2, phi_in, dest_mode);
1106 static ir_node *create_conv(dbg_info *dbgi, ir_node *value, ir_mode *dest_mode)
1108 ir_mode *value_mode = get_irn_mode(value);
1110 if (value_mode == dest_mode)
1113 if (dest_mode == mode_b) {
1114 ir_node *zero = new_Const(get_mode_null(value_mode));
1115 ir_node *cmp = new_d_Cmp(dbgi, value, zero, ir_relation_unordered_less_greater);
1117 } else if (value_mode == mode_b) {
1118 return create_conv_from_b(dbgi, value, dest_mode);
1121 return new_d_Conv(dbgi, value, dest_mode);
1125 * Creates a SymConst node representing a string constant.
1127 * @param src_pos the source position of the string constant
1128 * @param id_prefix a prefix for the name of the generated string constant
1129 * @param value the value of the string constant
1131 static ir_node *string_to_firm(source_position_t const *const src_pos, char const *const id_prefix, string_t const *const value)
1133 size_t const slen = get_string_len(value) + 1;
1134 ir_initializer_t *const initializer = create_initializer_compound(slen);
1135 ir_type * elem_type;
1136 switch (value->encoding) {
1137 case STRING_ENCODING_CHAR: {
1138 elem_type = ir_type_char;
1140 ir_mode *const mode = get_type_mode(elem_type);
1141 char const *p = value->begin;
1142 for (size_t i = 0; i < slen; ++i) {
1143 ir_tarval *tv = new_tarval_from_long(*p++, mode);
1144 ir_initializer_t *val = create_initializer_tarval(tv);
1145 set_initializer_compound_value(initializer, i, val);
1150 case STRING_ENCODING_WIDE: {
1151 elem_type = ir_type_wchar_t;
1153 ir_mode *const mode = get_type_mode(elem_type);
1154 char const *p = value->begin;
1155 for (size_t i = 0; i < slen; ++i) {
1156 assert(p <= value->begin + value->size);
1157 utf32 v = read_utf8_char(&p);
1158 ir_tarval *tv = new_tarval_from_long(v, mode);
1159 ir_initializer_t *val = create_initializer_tarval(tv);
1160 set_initializer_compound_value(initializer, i, val);
1165 panic("invalid string encoding");
1168 ir_type *const type = new_type_array(1, elem_type);
1169 set_array_bounds_int(type, 0, 0, slen);
1170 set_type_size_bytes( type, slen * get_type_size_bytes(elem_type));
1171 set_type_state( type, layout_fixed);
1173 ir_type *const global_type = get_glob_type();
1174 ident *const id = id_unique(id_prefix);
1175 dbg_info *const dbgi = get_dbg_info(src_pos);
1176 ir_entity *const entity = new_d_entity(global_type, id, type, dbgi);
1177 set_entity_ld_ident( entity, id);
1178 set_entity_visibility( entity, ir_visibility_private);
1179 add_entity_linkage( entity, IR_LINKAGE_CONSTANT);
1180 set_entity_initializer(entity, initializer);
1182 return create_symconst(dbgi, entity);
1185 static bool try_create_integer(literal_expression_t *literal, type_t *type)
1187 assert(type->kind == TYPE_ATOMIC);
1188 atomic_type_kind_t akind = type->atomic.akind;
1190 ir_mode *const mode = atomic_modes[akind];
1191 char const *const str = literal->value.begin;
1192 ir_tarval *const tv = new_tarval_from_str(str, literal->suffix - str, mode);
1193 if (tv == tarval_bad)
1196 literal->base.type = type;
1197 literal->target_value = tv;
1201 void determine_literal_type(literal_expression_t *const literal)
1203 assert(literal->base.kind == EXPR_LITERAL_INTEGER);
1205 /* -1: signed only, 0: any, 1: unsigned only */
1207 !is_type_signed(literal->base.type) ? 1 :
1208 literal->value.begin[0] == '0' ? 0 :
1209 -1; /* Decimal literals only try signed types. */
1211 tarval_int_overflow_mode_t old_mode = tarval_get_integer_overflow_mode();
1212 tarval_set_integer_overflow_mode(TV_OVERFLOW_BAD);
1214 if (try_create_integer(literal, literal->base.type))
1217 /* now try if the constant is small enough for some types */
1218 if (sign >= 0 && try_create_integer(literal, type_unsigned_int))
1220 if (sign <= 0 && try_create_integer(literal, type_long))
1222 if (sign >= 0 && try_create_integer(literal, type_unsigned_long))
1224 /* last try? then we should not report tarval_bad */
1226 tarval_set_integer_overflow_mode(TV_OVERFLOW_WRAP);
1227 if (sign <= 0 && try_create_integer(literal, type_long_long))
1232 tarval_set_integer_overflow_mode(TV_OVERFLOW_WRAP);
1233 bool res = try_create_integer(literal, type_unsigned_long_long);
1235 panic("internal error when parsing number literal");
1238 tarval_set_integer_overflow_mode(old_mode);
1242 * Creates a Const node representing a constant.
1244 static ir_node *literal_to_firm(const literal_expression_t *literal)
1246 type_t *type = skip_typeref(literal->base.type);
1247 ir_mode *mode = get_ir_mode_storage(type);
1248 const char *string = literal->value.begin;
1249 size_t size = literal->value.size;
1252 switch (literal->base.kind) {
1253 case EXPR_LITERAL_INTEGER:
1254 assert(literal->target_value != NULL);
1255 tv = literal->target_value;
1258 case EXPR_LITERAL_FLOATINGPOINT:
1259 tv = new_tarval_from_str(string, size, mode);
1262 case EXPR_LITERAL_BOOLEAN:
1263 if (string[0] == 't') {
1264 tv = get_mode_one(mode);
1266 assert(string[0] == 'f');
1267 case EXPR_LITERAL_MS_NOOP:
1268 tv = get_mode_null(mode);
1273 panic("Invalid literal kind found");
1276 dbg_info *dbgi = get_dbg_info(&literal->base.source_position);
1277 ir_node *res = new_d_Const(dbgi, tv);
1278 ir_mode *mode_arith = get_ir_mode_arithmetic(type);
1279 return create_conv(dbgi, res, mode_arith);
1283 * Creates a Const node representing a character constant.
1285 static ir_node *char_literal_to_firm(string_literal_expression_t const *literal)
1287 type_t *type = skip_typeref(literal->base.type);
1288 ir_mode *mode = get_ir_mode_storage(type);
1289 const char *string = literal->value.begin;
1290 size_t size = literal->value.size;
1293 switch (literal->value.encoding) {
1294 case STRING_ENCODING_WIDE: {
1295 utf32 v = read_utf8_char(&string);
1297 size_t len = snprintf(buf, sizeof(buf), UTF32_PRINTF_FORMAT, v);
1299 tv = new_tarval_from_str(buf, len, mode);
1303 case STRING_ENCODING_CHAR: {
1306 = get_atomic_type_flags(ATOMIC_TYPE_CHAR) & ATOMIC_TYPE_FLAG_SIGNED;
1307 if (size == 1 && char_is_signed) {
1308 v = (signed char)string[0];
1311 for (size_t i = 0; i < size; ++i) {
1312 v = (v << 8) | ((unsigned char)string[i]);
1316 size_t len = snprintf(buf, sizeof(buf), "%lld", v);
1318 tv = new_tarval_from_str(buf, len, mode);
1323 panic("Invalid literal kind found");
1326 dbg_info *dbgi = get_dbg_info(&literal->base.source_position);
1327 ir_node *res = new_d_Const(dbgi, tv);
1328 ir_mode *mode_arith = get_ir_mode_arithmetic(type);
1329 return create_conv(dbgi, res, mode_arith);
1333 * Allocate an area of size bytes aligned at alignment
1336 static ir_entity *alloc_trampoline(ir_type *frame_type, int size, unsigned alignment)
1338 static unsigned area_cnt = 0;
1341 ir_type *tp = new_type_array(1, ir_type_char);
1342 set_array_bounds_int(tp, 0, 0, size);
1343 set_type_alignment_bytes(tp, alignment);
1345 snprintf(buf, sizeof(buf), "trampolin%u", area_cnt++);
1346 ident *name = new_id_from_str(buf);
1347 ir_entity *area = new_entity(frame_type, name, tp);
1349 /* mark this entity as compiler generated */
1350 set_entity_compiler_generated(area, 1);
1355 * Return a node representing a trampoline region
1356 * for a given function entity.
1358 * @param dbgi debug info
1359 * @param entity the function entity
1361 static ir_node *get_trampoline_region(dbg_info *dbgi, ir_entity *entity)
1363 ir_entity *region = NULL;
1366 if (current_trampolines != NULL) {
1367 for (i = ARR_LEN(current_trampolines) - 1; i >= 0; --i) {
1368 if (current_trampolines[i].function == entity) {
1369 region = current_trampolines[i].region;
1374 current_trampolines = NEW_ARR_F(trampoline_region, 0);
1376 ir_graph *irg = current_ir_graph;
1377 if (region == NULL) {
1378 /* create a new region */
1379 ir_type *frame_tp = get_irg_frame_type(irg);
1380 trampoline_region reg;
1381 reg.function = entity;
1383 reg.region = alloc_trampoline(frame_tp,
1384 be_params->trampoline_size,
1385 be_params->trampoline_align);
1386 ARR_APP1(trampoline_region, current_trampolines, reg);
1387 region = reg.region;
1389 return new_d_simpleSel(dbgi, get_irg_no_mem(irg), get_irg_frame(irg),
1394 * Creates a trampoline for a function represented by an entity.
1396 * @param dbgi debug info
1397 * @param mode the (reference) mode for the function address
1398 * @param entity the function entity
1400 static ir_node *create_trampoline(dbg_info *dbgi, ir_mode *mode,
1403 assert(entity != NULL);
1405 in[0] = get_trampoline_region(dbgi, entity);
1406 in[1] = create_symconst(dbgi, entity);
1407 in[2] = get_irg_frame(current_ir_graph);
1409 ir_node *irn = new_d_Builtin(dbgi, get_store(), 3, in, ir_bk_inner_trampoline, get_unknown_type());
1410 set_store(new_Proj(irn, mode_M, pn_Builtin_M));
1411 return new_Proj(irn, mode, pn_Builtin_max+1);
1415 * Dereference an address.
1417 * @param dbgi debug info
1418 * @param type the type of the dereferenced result (the points_to type)
1419 * @param addr the address to dereference
1421 static ir_node *deref_address(dbg_info *const dbgi, type_t *const type,
1422 ir_node *const addr)
1424 type_t *skipped = skip_typeref(type);
1425 if (is_type_incomplete(skipped))
1428 ir_type *irtype = get_ir_type(skipped);
1429 if (is_compound_type(irtype)
1430 || is_Method_type(irtype)
1431 || is_Array_type(irtype)) {
1435 ir_cons_flags flags = skipped->base.qualifiers & TYPE_QUALIFIER_VOLATILE
1436 ? cons_volatile : cons_none;
1437 ir_mode *const mode = get_type_mode(irtype);
1438 ir_node *const memory = get_store();
1439 ir_node *const load = new_d_Load(dbgi, memory, addr, mode, flags);
1440 ir_node *const load_mem = new_d_Proj(dbgi, load, mode_M, pn_Load_M);
1441 ir_node *const load_res = new_d_Proj(dbgi, load, mode, pn_Load_res);
1443 set_store(load_mem);
1445 ir_mode *const mode_arithmetic = get_ir_mode_arithmetic(skipped);
1446 return create_conv(dbgi, load_res, mode_arithmetic);
1450 * Returns the correct base address depending on whether it is a parameter or a
1451 * normal local variable.
1453 static ir_node *get_local_frame(ir_entity *const ent)
1455 ir_graph *const irg = current_ir_graph;
1456 const ir_type *const owner = get_entity_owner(ent);
1457 if (owner == current_outer_frame) {
1458 assert(current_static_link != NULL);
1459 return current_static_link;
1461 return get_irg_frame(irg);
1466 * Keep all memory edges of the given block.
1468 static void keep_all_memory(ir_node *block)
1470 ir_node *old = get_cur_block();
1472 set_cur_block(block);
1473 keep_alive(get_store());
1474 /* TODO: keep all memory edges from restricted pointers */
1478 static ir_node *enum_constant_to_firm(reference_expression_t const *const ref)
1480 entity_t *entity = ref->entity;
1481 if (entity->enum_value.tv == NULL) {
1482 type_t *type = skip_typeref(entity->enum_value.enum_type);
1483 assert(type->kind == TYPE_ENUM);
1484 determine_enum_values(&type->enumt);
1487 return new_Const(entity->enum_value.tv);
1490 static ir_node *reference_addr(const reference_expression_t *ref)
1492 dbg_info *dbgi = get_dbg_info(&ref->base.source_position);
1493 entity_t *entity = ref->entity;
1494 assert(is_declaration(entity));
1496 if (entity->kind == ENTITY_FUNCTION
1497 && entity->function.btk != BUILTIN_NONE) {
1498 ir_entity *irentity = get_function_entity(entity, NULL);
1499 /* for gcc compatibility we have to produce (dummy) addresses for some
1500 * builtins which don't have entities */
1501 if (irentity == NULL) {
1502 source_position_t const *const pos = &ref->base.source_position;
1503 warningf(WARN_OTHER, pos, "taking address of builtin '%N'", ref->entity);
1505 /* simply create a NULL pointer */
1506 ir_mode *mode = get_ir_mode_arithmetic(type_void_ptr);
1507 ir_node *res = new_Const(get_mode_null(mode));
1513 switch((declaration_kind_t) entity->declaration.kind) {
1514 case DECLARATION_KIND_UNKNOWN:
1516 case DECLARATION_KIND_PARAMETER:
1517 case DECLARATION_KIND_LOCAL_VARIABLE:
1518 /* you can store to a local variable (so we don't panic but return NULL
1519 * as an indicator for no real address) */
1521 case DECLARATION_KIND_GLOBAL_VARIABLE: {
1522 ir_node *const addr = create_symconst(dbgi, entity->variable.v.entity);
1526 case DECLARATION_KIND_LOCAL_VARIABLE_ENTITY:
1527 case DECLARATION_KIND_PARAMETER_ENTITY: {
1528 ir_entity *irentity = entity->variable.v.entity;
1529 ir_node *frame = get_local_frame(irentity);
1530 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, irentity);
1534 case DECLARATION_KIND_VARIABLE_LENGTH_ARRAY:
1535 return entity->variable.v.vla_base;
1537 case DECLARATION_KIND_FUNCTION: {
1538 return create_symconst(dbgi, entity->function.irentity);
1541 case DECLARATION_KIND_INNER_FUNCTION: {
1542 type_t *const type = skip_typeref(entity->declaration.type);
1543 ir_mode *const mode = get_ir_mode_storage(type);
1544 if (!entity->function.goto_to_outer && !entity->function.need_closure) {
1545 /* inner function not using the closure */
1546 return create_symconst(dbgi, entity->function.irentity);
1548 /* need trampoline here */
1549 return create_trampoline(dbgi, mode, entity->function.irentity);
1553 case DECLARATION_KIND_COMPOUND_MEMBER:
1554 panic("not implemented reference type");
1557 panic("reference to declaration with unknown type found");
1560 static ir_node *reference_expression_to_firm(const reference_expression_t *ref)
1562 dbg_info *const dbgi = get_dbg_info(&ref->base.source_position);
1563 entity_t *const entity = ref->entity;
1564 assert(is_declaration(entity));
1566 switch ((declaration_kind_t)entity->declaration.kind) {
1567 case DECLARATION_KIND_LOCAL_VARIABLE:
1568 case DECLARATION_KIND_PARAMETER: {
1569 type_t *const type = skip_typeref(entity->declaration.type);
1570 ir_mode *const mode = get_ir_mode_storage(type);
1571 ir_node *const value = get_value(entity->variable.v.value_number, mode);
1572 return create_conv(dbgi, value, get_ir_mode_arithmetic(type));
1576 ir_node *const addr = reference_addr(ref);
1577 return deref_address(dbgi, entity->declaration.type, addr);
1583 * Transform calls to builtin functions.
1585 static ir_node *process_builtin_call(const call_expression_t *call)
1587 dbg_info *dbgi = get_dbg_info(&call->base.source_position);
1589 assert(call->function->kind == EXPR_REFERENCE);
1590 reference_expression_t *builtin = &call->function->reference;
1592 type_t *expr_type = skip_typeref(builtin->base.type);
1593 assert(is_type_pointer(expr_type));
1595 type_t *function_type = skip_typeref(expr_type->pointer.points_to);
1597 switch (builtin->entity->function.btk) {
1600 case BUILTIN_ALLOCA: {
1601 expression_t *argument = call->arguments->expression;
1602 ir_node *size = expression_to_firm(argument);
1604 ir_node *store = get_store();
1605 ir_node *alloca = new_d_Alloc(dbgi, store, size, get_unknown_type(),
1607 ir_node *proj_m = new_Proj(alloca, mode_M, pn_Alloc_M);
1609 ir_node *res = new_Proj(alloca, mode_P_data, pn_Alloc_res);
1614 type_t *type = function_type->function.return_type;
1615 ir_mode *mode = get_ir_mode_arithmetic(type);
1616 ir_tarval *tv = get_mode_infinite(mode);
1617 ir_node *res = new_d_Const(dbgi, tv);
1621 /* Ignore string for now... */
1622 assert(is_type_function(function_type));
1623 type_t *type = function_type->function.return_type;
1624 ir_mode *mode = get_ir_mode_arithmetic(type);
1625 ir_tarval *tv = get_mode_NAN(mode);
1626 ir_node *res = new_d_Const(dbgi, tv);
1629 case BUILTIN_EXPECT: {
1630 expression_t *argument = call->arguments->expression;
1631 return _expression_to_firm(argument);
1633 case BUILTIN_VA_END:
1634 /* evaluate the argument of va_end for its side effects */
1635 _expression_to_firm(call->arguments->expression);
1637 case BUILTIN_OBJECT_SIZE: {
1638 /* determine value of "type" */
1639 expression_t *type_expression = call->arguments->next->expression;
1640 long type_val = fold_constant_to_int(type_expression);
1641 type_t *type = function_type->function.return_type;
1642 ir_mode *mode = get_ir_mode_arithmetic(type);
1643 /* just produce a "I don't know" result */
1644 ir_tarval *result = type_val & 2 ? get_mode_null(mode) :
1645 get_mode_minus_one(mode);
1647 return new_d_Const(dbgi, result);
1649 case BUILTIN_ROTL: {
1650 ir_node *val = expression_to_firm(call->arguments->expression);
1651 ir_node *shf = expression_to_firm(call->arguments->next->expression);
1652 ir_mode *mode = get_irn_mode(val);
1653 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
1654 return new_d_Rotl(dbgi, val, create_conv(dbgi, shf, mode_uint), mode);
1656 case BUILTIN_ROTR: {
1657 ir_node *val = expression_to_firm(call->arguments->expression);
1658 ir_node *shf = expression_to_firm(call->arguments->next->expression);
1659 ir_mode *mode = get_irn_mode(val);
1660 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
1661 ir_node *c = new_Const_long(mode_uint, get_mode_size_bits(mode));
1662 ir_node *sub = new_d_Sub(dbgi, c, create_conv(dbgi, shf, mode_uint), mode_uint);
1663 return new_d_Rotl(dbgi, val, sub, mode);
1668 case BUILTIN_LIBC_CHECK:
1669 panic("builtin did not produce an entity");
1671 panic("invalid builtin found");
1675 * Transform a call expression.
1676 * Handles some special cases, like alloca() calls, which must be resolved
1677 * BEFORE the inlines runs. Inlining routines calling alloca() is dangerous,
1678 * 176.gcc for instance might allocate 2GB instead of 256 MB if alloca is not
1681 static ir_node *call_expression_to_firm(const call_expression_t *const call)
1683 dbg_info *const dbgi = get_dbg_info(&call->base.source_position);
1684 assert(currently_reachable());
1686 expression_t *function = call->function;
1687 ir_node *callee = NULL;
1688 bool firm_builtin = false;
1689 ir_builtin_kind firm_builtin_kind = ir_bk_trap;
1690 if (function->kind == EXPR_REFERENCE) {
1691 const reference_expression_t *ref = &function->reference;
1692 entity_t *entity = ref->entity;
1694 if (entity->kind == ENTITY_FUNCTION) {
1695 builtin_kind_t builtin = entity->function.btk;
1696 if (builtin == BUILTIN_FIRM) {
1697 firm_builtin = true;
1698 firm_builtin_kind = entity->function.b.firm_builtin_kind;
1699 } else if (builtin != BUILTIN_NONE && builtin != BUILTIN_LIBC
1700 && builtin != BUILTIN_LIBC_CHECK) {
1701 return process_builtin_call(call);
1706 callee = expression_to_firm(function);
1708 type_t *type = skip_typeref(function->base.type);
1709 assert(is_type_pointer(type));
1710 pointer_type_t *pointer_type = &type->pointer;
1711 type_t *points_to = skip_typeref(pointer_type->points_to);
1712 assert(is_type_function(points_to));
1713 function_type_t *function_type = &points_to->function;
1715 int n_parameters = 0;
1716 ir_type *ir_method_type = get_ir_type((type_t*) function_type);
1717 ir_type *new_method_type = NULL;
1718 if (function_type->variadic || function_type->unspecified_parameters) {
1719 const call_argument_t *argument = call->arguments;
1720 for ( ; argument != NULL; argument = argument->next) {
1724 /* we need to construct a new method type matching the call
1726 type_dbg_info *tdbgi = get_type_dbg_info_((const type_t*) function_type);
1727 int n_res = get_method_n_ress(ir_method_type);
1728 new_method_type = new_d_type_method(n_parameters, n_res, tdbgi);
1729 set_method_calling_convention(new_method_type,
1730 get_method_calling_convention(ir_method_type));
1731 set_method_additional_properties(new_method_type,
1732 get_method_additional_properties(ir_method_type));
1733 set_method_variadicity(new_method_type,
1734 get_method_variadicity(ir_method_type));
1736 for (int i = 0; i < n_res; ++i) {
1737 set_method_res_type(new_method_type, i,
1738 get_method_res_type(ir_method_type, i));
1740 argument = call->arguments;
1741 for (int i = 0; i < n_parameters; ++i, argument = argument->next) {
1742 expression_t *expression = argument->expression;
1743 ir_type *irtype = get_ir_type(expression->base.type);
1744 set_method_param_type(new_method_type, i, irtype);
1746 ir_method_type = new_method_type;
1748 n_parameters = get_method_n_params(ir_method_type);
1751 ir_node *in[n_parameters];
1753 const call_argument_t *argument = call->arguments;
1754 for (int n = 0; n < n_parameters; ++n) {
1755 expression_t *expression = argument->expression;
1756 ir_node *arg_node = expression_to_firm(expression);
1758 type_t *arg_type = skip_typeref(expression->base.type);
1759 if (!is_type_compound(arg_type)) {
1760 ir_mode *const mode = get_ir_mode_storage(arg_type);
1761 arg_node = create_conv(dbgi, arg_node, mode);
1766 argument = argument->next;
1770 if (function_type->modifiers & DM_CONST) {
1771 store = get_irg_no_mem(current_ir_graph);
1773 store = get_store();
1777 type_t *return_type = skip_typeref(function_type->return_type);
1778 ir_node *result = NULL;
1780 node = new_d_Builtin(dbgi, store, n_parameters, in, firm_builtin_kind,
1782 if (! (function_type->modifiers & DM_CONST)) {
1783 ir_node *mem = new_Proj(node, mode_M, pn_Builtin_M);
1787 if (!is_type_void(return_type)) {
1788 assert(is_type_scalar(return_type));
1789 ir_mode *mode = get_ir_mode_storage(return_type);
1790 result = new_Proj(node, mode, pn_Builtin_max+1);
1791 ir_mode *mode_arith = get_ir_mode_arithmetic(return_type);
1792 result = create_conv(NULL, result, mode_arith);
1795 node = new_d_Call(dbgi, store, callee, n_parameters, in, ir_method_type);
1796 if (! (function_type->modifiers & DM_CONST)) {
1797 ir_node *mem = new_Proj(node, mode_M, pn_Call_M);
1801 if (!is_type_void(return_type)) {
1802 ir_node *const resproj = new_Proj(node, mode_T, pn_Call_T_result);
1803 ir_mode *const mode = get_ir_mode_storage(return_type);
1804 result = new_Proj(resproj, mode, 0);
1805 ir_mode *const mode_arith = get_ir_mode_arithmetic(return_type);
1806 result = create_conv(NULL, result, mode_arith);
1810 if (function_type->modifiers & DM_NORETURN) {
1811 /* A dead end: Keep the Call and the Block. Also place all further
1812 * nodes into a new and unreachable block. */
1814 keep_alive(get_cur_block());
1815 ir_node *block = new_Block(0, NULL);
1816 set_cur_block(block);
1822 static ir_node *statement_to_firm(statement_t *statement);
1823 static ir_node *compound_statement_to_firm(compound_statement_t *compound);
1825 static ir_node *expression_to_addr(const expression_t *expression);
1826 static ir_node *create_condition_evaluation(const expression_t *expression,
1827 ir_node *true_block,
1828 ir_node *false_block);
1830 static void assign_value(dbg_info *dbgi, ir_node *addr, type_t *type,
1833 if (!is_type_compound(type)) {
1834 ir_mode *mode = get_ir_mode_storage(type);
1835 value = create_conv(dbgi, value, mode);
1838 ir_node *memory = get_store();
1840 if (is_type_scalar(type)) {
1841 ir_cons_flags flags = type->base.qualifiers & TYPE_QUALIFIER_VOLATILE
1842 ? cons_volatile : cons_none;
1843 ir_node *store = new_d_Store(dbgi, memory, addr, value, flags);
1844 ir_node *store_mem = new_d_Proj(dbgi, store, mode_M, pn_Store_M);
1845 set_store(store_mem);
1847 ir_type *irtype = get_ir_type(type);
1848 ir_node *copyb = new_d_CopyB(dbgi, memory, addr, value, irtype);
1849 ir_node *copyb_mem = new_Proj(copyb, mode_M, pn_CopyB_M);
1850 set_store(copyb_mem);
1854 static ir_tarval *create_bitfield_mask(ir_mode *mode, int offset, int size)
1856 ir_tarval *all_one = get_mode_all_one(mode);
1857 int mode_size = get_mode_size_bits(mode);
1858 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
1860 assert(offset >= 0);
1862 assert(offset + size <= mode_size);
1863 if (size == mode_size) {
1867 long shiftr = get_mode_size_bits(mode) - size;
1868 long shiftl = offset;
1869 ir_tarval *tv_shiftr = new_tarval_from_long(shiftr, mode_uint);
1870 ir_tarval *tv_shiftl = new_tarval_from_long(shiftl, mode_uint);
1871 ir_tarval *mask0 = tarval_shr(all_one, tv_shiftr);
1872 ir_tarval *mask1 = tarval_shl(mask0, tv_shiftl);
1877 static ir_node *bitfield_store_to_firm(dbg_info *dbgi,
1878 ir_entity *entity, ir_node *addr, ir_node *value, bool set_volatile,
1881 ir_type *entity_type = get_entity_type(entity);
1882 ir_type *base_type = get_primitive_base_type(entity_type);
1883 ir_mode *mode = get_type_mode(base_type);
1884 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
1886 value = create_conv(dbgi, value, mode);
1888 /* kill upper bits of value and shift to right position */
1889 unsigned bitoffset = get_entity_offset_bits_remainder(entity);
1890 unsigned bitsize = get_mode_size_bits(get_type_mode(entity_type));
1891 unsigned base_bits = get_mode_size_bits(mode);
1892 unsigned shiftwidth = base_bits - bitsize;
1894 ir_node *shiftcount = new_Const_long(mode_uint, shiftwidth);
1895 ir_node *shiftl = new_d_Shl(dbgi, value, shiftcount, mode);
1897 unsigned shrwidth = base_bits - bitsize - bitoffset;
1898 ir_node *shrconst = new_Const_long(mode_uint, shrwidth);
1899 ir_node *shiftr = new_d_Shr(dbgi, shiftl, shrconst, mode);
1901 /* load current value */
1902 ir_node *mem = get_store();
1903 ir_node *load = new_d_Load(dbgi, mem, addr, mode,
1904 set_volatile ? cons_volatile : cons_none);
1905 ir_node *load_mem = new_d_Proj(dbgi, load, mode_M, pn_Load_M);
1906 ir_node *load_res = new_d_Proj(dbgi, load, mode, pn_Load_res);
1907 ir_tarval *shift_mask = create_bitfield_mask(mode, bitoffset, bitsize);
1908 ir_tarval *inv_mask = tarval_not(shift_mask);
1909 ir_node *inv_mask_node = new_d_Const(dbgi, inv_mask);
1910 ir_node *load_res_masked = new_d_And(dbgi, load_res, inv_mask_node, mode);
1912 /* construct new value and store */
1913 ir_node *new_val = new_d_Or(dbgi, load_res_masked, shiftr, mode);
1914 ir_node *store = new_d_Store(dbgi, load_mem, addr, new_val,
1915 set_volatile ? cons_volatile : cons_none);
1916 ir_node *store_mem = new_d_Proj(dbgi, store, mode_M, pn_Store_M);
1917 set_store(store_mem);
1923 ir_node *count_res_shr = new_Const_long(mode_uint, base_bits - bitsize);
1924 if (mode_is_signed(mode)) {
1925 res_shr = new_d_Shrs(dbgi, shiftl, count_res_shr, mode);
1927 res_shr = new_d_Shr(dbgi, shiftl, count_res_shr, mode);
1932 static ir_node *bitfield_extract_to_firm(const select_expression_t *expression,
1935 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
1936 entity_t *entity = expression->compound_entry;
1937 type_t *base_type = entity->declaration.type;
1938 ir_mode *mode = get_ir_mode_storage(base_type);
1939 ir_node *mem = get_store();
1940 ir_node *load = new_d_Load(dbgi, mem, addr, mode, cons_none);
1941 ir_node *load_mem = new_d_Proj(dbgi, load, mode_M, pn_Load_M);
1942 ir_node *load_res = new_d_Proj(dbgi, load, mode, pn_Load_res);
1943 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
1945 ir_mode *amode = mode;
1946 /* optimisation, since shifting in modes < machine_size is usually
1948 if (get_mode_size_bits(amode) < get_mode_size_bits(mode_uint)) {
1951 unsigned amode_size = get_mode_size_bits(amode);
1952 load_res = create_conv(dbgi, load_res, amode);
1954 set_store(load_mem);
1956 /* kill upper bits */
1957 assert(expression->compound_entry->kind == ENTITY_COMPOUND_MEMBER);
1958 unsigned bitoffset = entity->compound_member.bit_offset;
1959 unsigned bitsize = entity->compound_member.bit_size;
1960 unsigned shift_bitsl = amode_size - bitoffset - bitsize;
1961 ir_tarval *tvl = new_tarval_from_long((long)shift_bitsl, mode_uint);
1962 ir_node *countl = new_d_Const(dbgi, tvl);
1963 ir_node *shiftl = new_d_Shl(dbgi, load_res, countl, amode);
1965 unsigned shift_bitsr = bitoffset + shift_bitsl;
1966 assert(shift_bitsr <= amode_size);
1967 ir_tarval *tvr = new_tarval_from_long((long)shift_bitsr, mode_uint);
1968 ir_node *countr = new_d_Const(dbgi, tvr);
1970 if (mode_is_signed(mode)) {
1971 shiftr = new_d_Shrs(dbgi, shiftl, countr, amode);
1973 shiftr = new_d_Shr(dbgi, shiftl, countr, amode);
1976 type_t *type = expression->base.type;
1977 ir_mode *resmode = get_ir_mode_arithmetic(type);
1978 return create_conv(dbgi, shiftr, resmode);
1981 /* make sure the selected compound type is constructed */
1982 static void construct_select_compound(const select_expression_t *expression)
1984 type_t *type = skip_typeref(expression->compound->base.type);
1985 if (is_type_pointer(type)) {
1986 type = type->pointer.points_to;
1988 (void) get_ir_type(type);
1991 static ir_node *set_value_for_expression_addr(const expression_t *expression,
1992 ir_node *value, ir_node *addr)
1994 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
1995 type_t *type = skip_typeref(expression->base.type);
1997 if (!is_type_compound(type)) {
1998 ir_mode *mode = get_ir_mode_storage(type);
1999 value = create_conv(dbgi, value, mode);
2002 if (expression->kind == EXPR_REFERENCE) {
2003 const reference_expression_t *ref = &expression->reference;
2005 entity_t *entity = ref->entity;
2006 assert(is_declaration(entity));
2007 assert(entity->declaration.kind != DECLARATION_KIND_UNKNOWN);
2008 if (entity->declaration.kind == DECLARATION_KIND_LOCAL_VARIABLE ||
2009 entity->declaration.kind == DECLARATION_KIND_PARAMETER) {
2010 set_value(entity->variable.v.value_number, value);
2016 addr = expression_to_addr(expression);
2017 assert(addr != NULL);
2019 if (expression->kind == EXPR_SELECT) {
2020 const select_expression_t *select = &expression->select;
2022 construct_select_compound(select);
2024 entity_t *entity = select->compound_entry;
2025 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
2026 if (entity->compound_member.bitfield) {
2027 ir_entity *irentity = entity->compound_member.entity;
2029 = select->base.type->base.qualifiers & TYPE_QUALIFIER_VOLATILE;
2030 value = bitfield_store_to_firm(dbgi, irentity, addr, value,
2031 set_volatile, true);
2036 assign_value(dbgi, addr, type, value);
2040 static void set_value_for_expression(const expression_t *expression,
2043 set_value_for_expression_addr(expression, value, NULL);
2046 static ir_node *get_value_from_lvalue(const expression_t *expression,
2049 if (expression->kind == EXPR_REFERENCE) {
2050 const reference_expression_t *ref = &expression->reference;
2052 entity_t *entity = ref->entity;
2053 assert(entity->kind == ENTITY_VARIABLE
2054 || entity->kind == ENTITY_PARAMETER);
2055 assert(entity->declaration.kind != DECLARATION_KIND_UNKNOWN);
2057 if (entity->declaration.kind == DECLARATION_KIND_LOCAL_VARIABLE ||
2058 entity->declaration.kind == DECLARATION_KIND_PARAMETER) {
2059 value_number = entity->variable.v.value_number;
2060 assert(addr == NULL);
2061 type_t *type = skip_typeref(expression->base.type);
2062 ir_mode *mode = get_ir_mode_storage(type);
2063 ir_node *res = get_value(value_number, mode);
2064 return create_conv(NULL, res, get_ir_mode_arithmetic(type));
2068 assert(addr != NULL);
2069 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2072 if (expression->kind == EXPR_SELECT &&
2073 expression->select.compound_entry->compound_member.bitfield) {
2074 construct_select_compound(&expression->select);
2075 value = bitfield_extract_to_firm(&expression->select, addr);
2077 value = deref_address(dbgi, expression->base.type, addr);
2084 static ir_node *create_incdec(const unary_expression_t *expression)
2086 dbg_info *const dbgi = get_dbg_info(&expression->base.source_position);
2087 const expression_t *value_expr = expression->value;
2088 ir_node *addr = expression_to_addr(value_expr);
2089 ir_node *value = get_value_from_lvalue(value_expr, addr);
2091 type_t *type = skip_typeref(expression->base.type);
2092 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
2095 if (is_type_pointer(type)) {
2096 pointer_type_t *pointer_type = &type->pointer;
2097 offset = get_type_size_node(pointer_type->points_to);
2099 assert(is_type_arithmetic(type));
2100 offset = new_Const(get_mode_one(mode));
2104 ir_node *store_value;
2105 switch(expression->base.kind) {
2106 case EXPR_UNARY_POSTFIX_INCREMENT:
2108 store_value = new_d_Add(dbgi, value, offset, mode);
2110 case EXPR_UNARY_POSTFIX_DECREMENT:
2112 store_value = new_d_Sub(dbgi, value, offset, mode);
2114 case EXPR_UNARY_PREFIX_INCREMENT:
2115 result = new_d_Add(dbgi, value, offset, mode);
2116 store_value = result;
2118 case EXPR_UNARY_PREFIX_DECREMENT:
2119 result = new_d_Sub(dbgi, value, offset, mode);
2120 store_value = result;
2123 panic("no incdec expr in create_incdec");
2126 set_value_for_expression_addr(value_expr, store_value, addr);
2131 static bool is_local_variable(expression_t *expression)
2133 if (expression->kind != EXPR_REFERENCE)
2135 reference_expression_t *ref_expr = &expression->reference;
2136 entity_t *entity = ref_expr->entity;
2137 if (entity->kind != ENTITY_VARIABLE)
2139 assert(entity->declaration.kind != DECLARATION_KIND_UNKNOWN);
2140 return entity->declaration.kind == DECLARATION_KIND_LOCAL_VARIABLE;
2143 static ir_relation get_relation(const expression_kind_t kind)
2146 case EXPR_BINARY_EQUAL: return ir_relation_equal;
2147 case EXPR_BINARY_ISLESSGREATER: return ir_relation_less_greater;
2148 case EXPR_BINARY_NOTEQUAL: return ir_relation_unordered_less_greater;
2149 case EXPR_BINARY_ISLESS:
2150 case EXPR_BINARY_LESS: return ir_relation_less;
2151 case EXPR_BINARY_ISLESSEQUAL:
2152 case EXPR_BINARY_LESSEQUAL: return ir_relation_less_equal;
2153 case EXPR_BINARY_ISGREATER:
2154 case EXPR_BINARY_GREATER: return ir_relation_greater;
2155 case EXPR_BINARY_ISGREATEREQUAL:
2156 case EXPR_BINARY_GREATEREQUAL: return ir_relation_greater_equal;
2157 case EXPR_BINARY_ISUNORDERED: return ir_relation_unordered;
2162 panic("trying to get ir_relation from non-comparison binexpr type");
2166 * Handle the assume optimizer hint: check if a Confirm
2167 * node can be created.
2169 * @param dbi debug info
2170 * @param expr the IL assume expression
2172 * we support here only some simple cases:
2177 static ir_node *handle_assume_compare(dbg_info *dbi,
2178 const binary_expression_t *expression)
2180 expression_t *op1 = expression->left;
2181 expression_t *op2 = expression->right;
2182 entity_t *var2, *var = NULL;
2183 ir_node *res = NULL;
2184 ir_relation relation = get_relation(expression->base.kind);
2186 if (is_local_variable(op1) && is_local_variable(op2)) {
2187 var = op1->reference.entity;
2188 var2 = op2->reference.entity;
2190 type_t *const type = skip_typeref(var->declaration.type);
2191 ir_mode *const mode = get_ir_mode_storage(type);
2193 ir_node *const irn1 = get_value(var->variable.v.value_number, mode);
2194 ir_node *const irn2 = get_value(var2->variable.v.value_number, mode);
2196 res = new_d_Confirm(dbi, irn2, irn1, get_inversed_relation(relation));
2197 set_value(var2->variable.v.value_number, res);
2199 res = new_d_Confirm(dbi, irn1, irn2, relation);
2200 set_value(var->variable.v.value_number, res);
2205 expression_t *con = NULL;
2206 if (is_local_variable(op1) && is_constant_expression(op2) == EXPR_CLASS_CONSTANT) {
2207 var = op1->reference.entity;
2209 } else if (is_constant_expression(op1) == EXPR_CLASS_CONSTANT && is_local_variable(op2)) {
2210 relation = get_inversed_relation(relation);
2211 var = op2->reference.entity;
2216 type_t *const type = skip_typeref(var->declaration.type);
2217 ir_mode *const mode = get_ir_mode_storage(type);
2219 res = get_value(var->variable.v.value_number, mode);
2220 res = new_d_Confirm(dbi, res, expression_to_firm(con), relation);
2221 set_value(var->variable.v.value_number, res);
2227 * Handle the assume optimizer hint.
2229 * @param dbi debug info
2230 * @param expr the IL assume expression
2232 static ir_node *handle_assume(dbg_info *dbi, const expression_t *expression)
2234 switch(expression->kind) {
2235 case EXPR_BINARY_EQUAL:
2236 case EXPR_BINARY_NOTEQUAL:
2237 case EXPR_BINARY_LESS:
2238 case EXPR_BINARY_LESSEQUAL:
2239 case EXPR_BINARY_GREATER:
2240 case EXPR_BINARY_GREATEREQUAL:
2241 return handle_assume_compare(dbi, &expression->binary);
2247 static ir_node *create_cast(dbg_info *dbgi, ir_node *value_node,
2248 type_t *from_type, type_t *type)
2250 type = skip_typeref(type);
2251 if (is_type_void(type)) {
2252 /* make sure firm type is constructed */
2253 (void) get_ir_type(type);
2256 if (!is_type_scalar(type)) {
2257 /* make sure firm type is constructed */
2258 (void) get_ir_type(type);
2262 from_type = skip_typeref(from_type);
2263 ir_mode *mode = get_ir_mode_storage(type);
2264 /* check for conversion from / to __based types */
2265 if (is_type_pointer(type) && is_type_pointer(from_type)) {
2266 const variable_t *from_var = from_type->pointer.base_variable;
2267 const variable_t *to_var = type->pointer.base_variable;
2268 if (from_var != to_var) {
2269 if (from_var != NULL) {
2270 ir_node *const addr = create_symconst(dbgi, from_var->v.entity);
2271 ir_node *const base = deref_address(dbgi, from_var->base.type, addr);
2272 value_node = new_d_Add(dbgi, value_node, base, mode);
2274 if (to_var != NULL) {
2275 ir_node *const addr = create_symconst(dbgi, to_var->v.entity);
2276 ir_node *const base = deref_address(dbgi, to_var->base.type, addr);
2277 value_node = new_d_Sub(dbgi, value_node, base, mode);
2282 if (is_type_atomic(type, ATOMIC_TYPE_BOOL)) {
2283 /* bool adjustments (we save a mode_Bu, but have to temporarily
2284 * convert to mode_b so we only get a 0/1 value */
2285 value_node = create_conv(dbgi, value_node, mode_b);
2288 ir_mode *mode_arith = get_ir_mode_arithmetic(type);
2289 ir_node *node = create_conv(dbgi, value_node, mode);
2290 node = create_conv(dbgi, node, mode_arith);
2295 static ir_node *unary_expression_to_firm(const unary_expression_t *expression)
2297 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2298 type_t *type = skip_typeref(expression->base.type);
2300 const expression_t *value = expression->value;
2302 switch(expression->base.kind) {
2303 case EXPR_UNARY_TAKE_ADDRESS:
2304 return expression_to_addr(value);
2306 case EXPR_UNARY_NEGATE: {
2307 ir_node *value_node = expression_to_firm(value);
2308 ir_mode *mode = get_ir_mode_arithmetic(type);
2309 return new_d_Minus(dbgi, value_node, mode);
2311 case EXPR_UNARY_PLUS:
2312 return expression_to_firm(value);
2313 case EXPR_UNARY_BITWISE_NEGATE: {
2314 ir_node *value_node = expression_to_firm(value);
2315 ir_mode *mode = get_ir_mode_arithmetic(type);
2316 return new_d_Not(dbgi, value_node, mode);
2318 case EXPR_UNARY_NOT: {
2319 ir_node *value_node = _expression_to_firm(value);
2320 value_node = create_conv(dbgi, value_node, mode_b);
2321 ir_node *res = new_d_Not(dbgi, value_node, mode_b);
2324 case EXPR_UNARY_DEREFERENCE: {
2325 ir_node *value_node = expression_to_firm(value);
2326 type_t *value_type = skip_typeref(value->base.type);
2327 assert(is_type_pointer(value_type));
2329 /* check for __based */
2330 const variable_t *const base_var = value_type->pointer.base_variable;
2331 if (base_var != NULL) {
2332 ir_node *const addr = create_symconst(dbgi, base_var->v.entity);
2333 ir_node *const base = deref_address(dbgi, base_var->base.type, addr);
2334 value_node = new_d_Add(dbgi, value_node, base, get_ir_mode_storage(value_type));
2336 type_t *points_to = value_type->pointer.points_to;
2337 return deref_address(dbgi, points_to, value_node);
2339 case EXPR_UNARY_POSTFIX_INCREMENT:
2340 case EXPR_UNARY_POSTFIX_DECREMENT:
2341 case EXPR_UNARY_PREFIX_INCREMENT:
2342 case EXPR_UNARY_PREFIX_DECREMENT:
2343 return create_incdec(expression);
2344 case EXPR_UNARY_CAST: {
2345 ir_node *value_node = expression_to_firm(value);
2346 type_t *from_type = value->base.type;
2347 return create_cast(dbgi, value_node, from_type, type);
2349 case EXPR_UNARY_ASSUME:
2350 return handle_assume(dbgi, value);
2355 panic("invalid UNEXPR type found");
2359 * produces a 0/1 depending of the value of a mode_b node
2361 static ir_node *produce_condition_result(const expression_t *expression,
2362 ir_mode *mode, dbg_info *dbgi)
2364 ir_node *const one_block = new_immBlock();
2365 ir_node *const zero_block = new_immBlock();
2366 create_condition_evaluation(expression, one_block, zero_block);
2367 mature_immBlock(one_block);
2368 mature_immBlock(zero_block);
2370 ir_node *const jmp_one = new_rd_Jmp(dbgi, one_block);
2371 ir_node *const jmp_zero = new_rd_Jmp(dbgi, zero_block);
2372 ir_node *const in_cf[2] = { jmp_one, jmp_zero };
2373 ir_node *const block = new_Block(lengthof(in_cf), in_cf);
2374 set_cur_block(block);
2376 ir_node *const one = new_Const(get_mode_one(mode));
2377 ir_node *const zero = new_Const(get_mode_null(mode));
2378 ir_node *const in[2] = { one, zero };
2379 ir_node *const val = new_d_Phi(dbgi, lengthof(in), in, mode);
2384 static ir_node *adjust_for_pointer_arithmetic(dbg_info *dbgi,
2385 ir_node *value, type_t *type)
2387 ir_mode *const mode = get_ir_mode_arithmetic(type_ptrdiff_t);
2388 assert(is_type_pointer(type));
2389 pointer_type_t *const pointer_type = &type->pointer;
2390 type_t *const points_to = skip_typeref(pointer_type->points_to);
2391 ir_node * elem_size = get_type_size_node(points_to);
2392 elem_size = create_conv(dbgi, elem_size, mode);
2393 value = create_conv(dbgi, value, mode);
2394 ir_node *const mul = new_d_Mul(dbgi, value, elem_size, mode);
2398 static ir_node *create_op(dbg_info *dbgi, const binary_expression_t *expression,
2399 ir_node *left, ir_node *right)
2402 type_t *type_left = skip_typeref(expression->left->base.type);
2403 type_t *type_right = skip_typeref(expression->right->base.type);
2405 expression_kind_t kind = expression->base.kind;
2408 case EXPR_BINARY_SHIFTLEFT:
2409 case EXPR_BINARY_SHIFTRIGHT:
2410 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2411 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2412 mode = get_ir_mode_arithmetic(expression->base.type);
2413 right = create_conv(dbgi, right, atomic_modes[ATOMIC_TYPE_UINT]);
2416 case EXPR_BINARY_SUB:
2417 if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
2418 const pointer_type_t *const ptr_type = &type_left->pointer;
2420 mode = get_ir_mode_arithmetic(expression->base.type);
2421 ir_node *const elem_size = get_type_size_node(ptr_type->points_to);
2422 ir_node *const conv_size = new_d_Conv(dbgi, elem_size, mode);
2423 ir_node *const sub = new_d_Sub(dbgi, left, right, mode);
2424 ir_node *const no_mem = new_NoMem();
2425 ir_node *const div = new_d_DivRL(dbgi, no_mem, sub, conv_size,
2426 mode, op_pin_state_floats);
2427 return new_d_Proj(dbgi, div, mode, pn_Div_res);
2430 case EXPR_BINARY_SUB_ASSIGN:
2431 if (is_type_pointer(type_left)) {
2432 right = adjust_for_pointer_arithmetic(dbgi, right, type_left);
2433 mode = get_ir_mode_arithmetic(type_left);
2438 case EXPR_BINARY_ADD:
2439 case EXPR_BINARY_ADD_ASSIGN:
2440 if (is_type_pointer(type_left)) {
2441 right = adjust_for_pointer_arithmetic(dbgi, right, type_left);
2442 mode = get_ir_mode_arithmetic(type_left);
2444 } else if (is_type_pointer(type_right)) {
2445 left = adjust_for_pointer_arithmetic(dbgi, left, type_right);
2446 mode = get_ir_mode_arithmetic(type_right);
2453 mode = get_ir_mode_arithmetic(type_right);
2454 left = create_conv(dbgi, left, mode);
2459 case EXPR_BINARY_ADD_ASSIGN:
2460 case EXPR_BINARY_ADD:
2461 return new_d_Add(dbgi, left, right, mode);
2462 case EXPR_BINARY_SUB_ASSIGN:
2463 case EXPR_BINARY_SUB:
2464 return new_d_Sub(dbgi, left, right, mode);
2465 case EXPR_BINARY_MUL_ASSIGN:
2466 case EXPR_BINARY_MUL:
2467 return new_d_Mul(dbgi, left, right, mode);
2468 case EXPR_BINARY_BITWISE_AND:
2469 case EXPR_BINARY_BITWISE_AND_ASSIGN:
2470 return new_d_And(dbgi, left, right, mode);
2471 case EXPR_BINARY_BITWISE_OR:
2472 case EXPR_BINARY_BITWISE_OR_ASSIGN:
2473 return new_d_Or(dbgi, left, right, mode);
2474 case EXPR_BINARY_BITWISE_XOR:
2475 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
2476 return new_d_Eor(dbgi, left, right, mode);
2477 case EXPR_BINARY_SHIFTLEFT:
2478 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2479 return new_d_Shl(dbgi, left, right, mode);
2480 case EXPR_BINARY_SHIFTRIGHT:
2481 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2482 if (mode_is_signed(mode)) {
2483 return new_d_Shrs(dbgi, left, right, mode);
2485 return new_d_Shr(dbgi, left, right, mode);
2487 case EXPR_BINARY_DIV:
2488 case EXPR_BINARY_DIV_ASSIGN: {
2489 ir_node *pin = new_Pin(new_NoMem());
2490 ir_node *op = new_d_Div(dbgi, pin, left, right, mode,
2491 op_pin_state_floats);
2492 ir_node *res = new_d_Proj(dbgi, op, mode, pn_Div_res);
2495 case EXPR_BINARY_MOD:
2496 case EXPR_BINARY_MOD_ASSIGN: {
2497 ir_node *pin = new_Pin(new_NoMem());
2498 ir_node *op = new_d_Mod(dbgi, pin, left, right, mode,
2499 op_pin_state_floats);
2500 ir_node *res = new_d_Proj(dbgi, op, mode, pn_Mod_res);
2504 panic("unexpected expression kind");
2508 static ir_node *create_lazy_op(const binary_expression_t *expression)
2510 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2511 type_t *type = skip_typeref(expression->base.type);
2512 ir_mode *mode = get_ir_mode_arithmetic(type);
2514 if (is_constant_expression(expression->left) == EXPR_CLASS_CONSTANT) {
2515 bool val = fold_constant_to_bool(expression->left);
2516 expression_kind_t ekind = expression->base.kind;
2517 assert(ekind == EXPR_BINARY_LOGICAL_AND || ekind == EXPR_BINARY_LOGICAL_OR);
2518 if (ekind == EXPR_BINARY_LOGICAL_AND) {
2520 return new_Const(get_mode_null(mode));
2524 return new_Const(get_mode_one(mode));
2528 if (is_constant_expression(expression->right) == EXPR_CLASS_CONSTANT) {
2529 bool valr = fold_constant_to_bool(expression->right);
2530 return create_Const_from_bool(mode, valr);
2533 return produce_condition_result(expression->right, mode, dbgi);
2536 return produce_condition_result((const expression_t*) expression, mode,
2540 typedef ir_node * (*create_arithmetic_func)(dbg_info *dbgi, ir_node *left,
2541 ir_node *right, ir_mode *mode);
2543 static ir_node *create_assign_binop(const binary_expression_t *expression)
2545 dbg_info *const dbgi = get_dbg_info(&expression->base.source_position);
2546 const expression_t *left_expr = expression->left;
2547 type_t *type = skip_typeref(left_expr->base.type);
2548 ir_node *right = expression_to_firm(expression->right);
2549 ir_node *left_addr = expression_to_addr(left_expr);
2550 ir_node *left = get_value_from_lvalue(left_expr, left_addr);
2551 ir_node *result = create_op(dbgi, expression, left, right);
2553 result = create_cast(dbgi, result, expression->right->base.type, type);
2555 result = set_value_for_expression_addr(left_expr, result, left_addr);
2557 if (!is_type_compound(type)) {
2558 ir_mode *mode_arithmetic = get_ir_mode_arithmetic(type);
2559 result = create_conv(dbgi, result, mode_arithmetic);
2564 static ir_node *binary_expression_to_firm(const binary_expression_t *expression)
2566 expression_kind_t kind = expression->base.kind;
2569 case EXPR_BINARY_EQUAL:
2570 case EXPR_BINARY_NOTEQUAL:
2571 case EXPR_BINARY_LESS:
2572 case EXPR_BINARY_LESSEQUAL:
2573 case EXPR_BINARY_GREATER:
2574 case EXPR_BINARY_GREATEREQUAL:
2575 case EXPR_BINARY_ISGREATER:
2576 case EXPR_BINARY_ISGREATEREQUAL:
2577 case EXPR_BINARY_ISLESS:
2578 case EXPR_BINARY_ISLESSEQUAL:
2579 case EXPR_BINARY_ISLESSGREATER:
2580 case EXPR_BINARY_ISUNORDERED: {
2581 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2582 ir_node *left = expression_to_firm(expression->left);
2583 ir_node *right = expression_to_firm(expression->right);
2584 ir_relation relation = get_relation(kind);
2585 ir_node *cmp = new_d_Cmp(dbgi, left, right, relation);
2588 case EXPR_BINARY_ASSIGN: {
2589 ir_node *addr = expression_to_addr(expression->left);
2590 ir_node *right = expression_to_firm(expression->right);
2592 = set_value_for_expression_addr(expression->left, right, addr);
2594 type_t *type = skip_typeref(expression->base.type);
2595 if (!is_type_compound(type)) {
2596 ir_mode *mode_arithmetic = get_ir_mode_arithmetic(type);
2597 res = create_conv(NULL, res, mode_arithmetic);
2601 case EXPR_BINARY_ADD:
2602 case EXPR_BINARY_SUB:
2603 case EXPR_BINARY_MUL:
2604 case EXPR_BINARY_DIV:
2605 case EXPR_BINARY_MOD:
2606 case EXPR_BINARY_BITWISE_AND:
2607 case EXPR_BINARY_BITWISE_OR:
2608 case EXPR_BINARY_BITWISE_XOR:
2609 case EXPR_BINARY_SHIFTLEFT:
2610 case EXPR_BINARY_SHIFTRIGHT:
2612 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2613 ir_node *left = expression_to_firm(expression->left);
2614 ir_node *right = expression_to_firm(expression->right);
2615 return create_op(dbgi, expression, left, right);
2617 case EXPR_BINARY_LOGICAL_AND:
2618 case EXPR_BINARY_LOGICAL_OR:
2619 return create_lazy_op(expression);
2620 case EXPR_BINARY_COMMA:
2621 /* create side effects of left side */
2622 (void) expression_to_firm(expression->left);
2623 return _expression_to_firm(expression->right);
2625 case EXPR_BINARY_ADD_ASSIGN:
2626 case EXPR_BINARY_SUB_ASSIGN:
2627 case EXPR_BINARY_MUL_ASSIGN:
2628 case EXPR_BINARY_MOD_ASSIGN:
2629 case EXPR_BINARY_DIV_ASSIGN:
2630 case EXPR_BINARY_BITWISE_AND_ASSIGN:
2631 case EXPR_BINARY_BITWISE_OR_ASSIGN:
2632 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
2633 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2634 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2635 return create_assign_binop(expression);
2637 panic("invalid binexpr type");
2641 static ir_node *array_access_addr(const array_access_expression_t *expression)
2643 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2644 ir_node *base_addr = expression_to_firm(expression->array_ref);
2645 ir_node *offset = expression_to_firm(expression->index);
2646 type_t *ref_type = skip_typeref(expression->array_ref->base.type);
2647 ir_node *real_offset = adjust_for_pointer_arithmetic(dbgi, offset, ref_type);
2648 ir_node *result = new_d_Add(dbgi, base_addr, real_offset, mode_P_data);
2653 static ir_node *array_access_to_firm(
2654 const array_access_expression_t *expression)
2656 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2657 ir_node *addr = array_access_addr(expression);
2658 type_t *type = revert_automatic_type_conversion(
2659 (const expression_t*) expression);
2660 type = skip_typeref(type);
2662 return deref_address(dbgi, type, addr);
2665 static long get_offsetof_offset(const offsetof_expression_t *expression)
2667 type_t *orig_type = expression->type;
2670 designator_t *designator = expression->designator;
2671 for ( ; designator != NULL; designator = designator->next) {
2672 type_t *type = skip_typeref(orig_type);
2673 /* be sure the type is constructed */
2674 (void) get_ir_type(type);
2676 if (designator->symbol != NULL) {
2677 assert(is_type_compound(type));
2678 symbol_t *symbol = designator->symbol;
2680 compound_t *compound = type->compound.compound;
2681 entity_t *iter = compound->members.entities;
2682 for (; iter->base.symbol != symbol; iter = iter->base.next) {}
2684 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
2685 assert(iter->declaration.kind == DECLARATION_KIND_COMPOUND_MEMBER);
2686 offset += get_entity_offset(iter->compound_member.entity);
2688 orig_type = iter->declaration.type;
2690 expression_t *array_index = designator->array_index;
2691 assert(designator->array_index != NULL);
2692 assert(is_type_array(type));
2694 long index = fold_constant_to_int(array_index);
2695 ir_type *arr_type = get_ir_type(type);
2696 ir_type *elem_type = get_array_element_type(arr_type);
2697 long elem_size = get_type_size_bytes(elem_type);
2699 offset += index * elem_size;
2701 orig_type = type->array.element_type;
2708 static ir_node *offsetof_to_firm(const offsetof_expression_t *expression)
2710 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
2711 long offset = get_offsetof_offset(expression);
2712 ir_tarval *tv = new_tarval_from_long(offset, mode);
2713 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2715 return new_d_Const(dbgi, tv);
2718 static void create_local_initializer(initializer_t *initializer, dbg_info *dbgi,
2719 ir_entity *entity, type_t *type);
2720 static ir_initializer_t *create_ir_initializer(
2721 const initializer_t *initializer, type_t *type);
2723 static ir_entity *create_initializer_entity(dbg_info *dbgi,
2724 initializer_t *initializer,
2727 /* create the ir_initializer */
2728 PUSH_IRG(get_const_code_irg());
2729 ir_initializer_t *irinitializer = create_ir_initializer(initializer, type);
2732 ident *const id = id_unique("initializer.%u");
2733 ir_type *const irtype = get_ir_type(type);
2734 ir_type *const global_type = get_glob_type();
2735 ir_entity *const entity = new_d_entity(global_type, id, irtype, dbgi);
2736 set_entity_ld_ident(entity, id);
2737 set_entity_visibility(entity, ir_visibility_private);
2738 add_entity_linkage(entity, IR_LINKAGE_CONSTANT);
2739 set_entity_initializer(entity, irinitializer);
2743 static ir_node *compound_literal_addr(compound_literal_expression_t const *const expression)
2745 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2746 type_t *type = expression->type;
2747 initializer_t *initializer = expression->initializer;
2749 if (is_constant_initializer(initializer) == EXPR_CLASS_CONSTANT) {
2750 ir_entity *entity = create_initializer_entity(dbgi, initializer, type);
2751 return create_symconst(dbgi, entity);
2753 /* create an entity on the stack */
2754 ident *const id = id_unique("CompLit.%u");
2755 ir_type *const irtype = get_ir_type(type);
2756 ir_type *frame_type = get_irg_frame_type(current_ir_graph);
2758 ir_entity *const entity = new_d_entity(frame_type, id, irtype, dbgi);
2759 set_entity_ld_ident(entity, id);
2761 /* create initialisation code */
2762 create_local_initializer(initializer, dbgi, entity, type);
2764 /* create a sel for the compound literal address */
2765 ir_node *frame = get_irg_frame(current_ir_graph);
2766 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, entity);
2771 static ir_node *compound_literal_to_firm(compound_literal_expression_t const* const expr)
2773 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
2774 type_t *const type = expr->type;
2775 ir_node *const addr = compound_literal_addr(expr);
2776 return deref_address(dbgi, type, addr);
2780 * Transform a sizeof expression into Firm code.
2782 static ir_node *sizeof_to_firm(const typeprop_expression_t *expression)
2784 type_t *const type = skip_typeref(expression->type);
2785 /* ยง6.5.3.4:2 if the type is a VLA, evaluate the expression. */
2786 if (is_type_array(type) && type->array.is_vla
2787 && expression->tp_expression != NULL) {
2788 expression_to_firm(expression->tp_expression);
2791 return get_type_size_node(type);
2794 static entity_t *get_expression_entity(const expression_t *expression)
2796 if (expression->kind != EXPR_REFERENCE)
2799 return expression->reference.entity;
2802 static unsigned get_cparser_entity_alignment(const entity_t *entity)
2804 switch(entity->kind) {
2805 case DECLARATION_KIND_CASES:
2806 return entity->declaration.alignment;
2809 return entity->compound.alignment;
2810 case ENTITY_TYPEDEF:
2811 return entity->typedefe.alignment;
2819 * Transform an alignof expression into Firm code.
2821 static ir_node *alignof_to_firm(const typeprop_expression_t *expression)
2823 unsigned alignment = 0;
2825 const expression_t *tp_expression = expression->tp_expression;
2826 if (tp_expression != NULL) {
2827 entity_t *entity = get_expression_entity(tp_expression);
2828 if (entity != NULL) {
2829 alignment = get_cparser_entity_alignment(entity);
2833 if (alignment == 0) {
2834 type_t *type = expression->type;
2835 alignment = get_type_alignment(type);
2838 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2839 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
2840 ir_tarval *tv = new_tarval_from_long(alignment, mode);
2841 return new_d_Const(dbgi, tv);
2844 static void init_ir_types(void);
2846 static ir_tarval *fold_constant_to_tarval(const expression_t *expression)
2848 assert(is_constant_expression(expression) == EXPR_CLASS_CONSTANT);
2850 bool constant_folding_old = constant_folding;
2851 constant_folding = true;
2852 int old_optimize = get_optimize();
2853 int old_constant_folding = get_opt_constant_folding();
2855 set_opt_constant_folding(1);
2859 PUSH_IRG(get_const_code_irg());
2860 ir_node *const cnst = _expression_to_firm(expression);
2863 set_optimize(old_optimize);
2864 set_opt_constant_folding(old_constant_folding);
2866 if (!is_Const(cnst)) {
2867 panic("couldn't fold constant");
2870 constant_folding = constant_folding_old;
2872 ir_tarval *const tv = get_Const_tarval(cnst);
2873 ir_mode *const mode = get_ir_mode_arithmetic(skip_typeref(expression->base.type));
2874 return tarval_convert_to(tv, mode);
2877 /* this function is only used in parser.c, but it relies on libfirm functionality */
2878 bool constant_is_negative(const expression_t *expression)
2880 ir_tarval *tv = fold_constant_to_tarval(expression);
2881 return tarval_is_negative(tv);
2884 long fold_constant_to_int(const expression_t *expression)
2886 ir_tarval *tv = fold_constant_to_tarval(expression);
2887 if (!tarval_is_long(tv)) {
2888 panic("result of constant folding is not integer");
2891 return get_tarval_long(tv);
2894 bool fold_constant_to_bool(const expression_t *expression)
2896 ir_tarval *tv = fold_constant_to_tarval(expression);
2897 return !tarval_is_null(tv);
2900 static ir_node *conditional_to_firm(const conditional_expression_t *expression)
2902 dbg_info *const dbgi = get_dbg_info(&expression->base.source_position);
2904 /* first try to fold a constant condition */
2905 if (is_constant_expression(expression->condition) == EXPR_CLASS_CONSTANT) {
2906 bool val = fold_constant_to_bool(expression->condition);
2908 expression_t *true_expression = expression->true_expression;
2909 if (true_expression == NULL)
2910 true_expression = expression->condition;
2911 return expression_to_firm(true_expression);
2913 return expression_to_firm(expression->false_expression);
2917 ir_node *const true_block = new_immBlock();
2918 ir_node *const false_block = new_immBlock();
2919 ir_node *const cond_expr = create_condition_evaluation(expression->condition, true_block, false_block);
2920 mature_immBlock(true_block);
2921 mature_immBlock(false_block);
2923 set_cur_block(true_block);
2925 if (expression->true_expression != NULL) {
2926 true_val = expression_to_firm(expression->true_expression);
2927 } else if (cond_expr != NULL && get_irn_mode(cond_expr) != mode_b) {
2928 true_val = cond_expr;
2930 /* Condition ended with a short circuit (&&, ||, !) operation or a
2931 * comparison. Generate a "1" as value for the true branch. */
2932 true_val = new_Const(get_mode_one(mode_Is));
2934 ir_node *const true_jmp = new_d_Jmp(dbgi);
2936 set_cur_block(false_block);
2937 ir_node *const false_val = expression_to_firm(expression->false_expression);
2938 ir_node *const false_jmp = new_d_Jmp(dbgi);
2940 /* create the common block */
2941 ir_node *const in_cf[2] = { true_jmp, false_jmp };
2942 ir_node *const block = new_Block(lengthof(in_cf), in_cf);
2943 set_cur_block(block);
2945 /* TODO improve static semantics, so either both or no values are NULL */
2946 if (true_val == NULL || false_val == NULL)
2949 ir_node *const in[2] = { true_val, false_val };
2950 type_t *const type = skip_typeref(expression->base.type);
2951 ir_mode *const mode = get_ir_mode_arithmetic(type);
2952 ir_node *const val = new_d_Phi(dbgi, lengthof(in), in, mode);
2958 * Returns an IR-node representing the address of a field.
2960 static ir_node *select_addr(const select_expression_t *expression)
2962 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2964 construct_select_compound(expression);
2966 ir_node *compound_addr = expression_to_firm(expression->compound);
2968 entity_t *entry = expression->compound_entry;
2969 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
2970 assert(entry->declaration.kind == DECLARATION_KIND_COMPOUND_MEMBER);
2972 if (constant_folding) {
2973 ir_mode *mode = get_irn_mode(compound_addr);
2974 ir_mode *mode_uint = get_reference_mode_unsigned_eq(mode);
2975 ir_node *ofs = new_Const_long(mode_uint, entry->compound_member.offset);
2976 return new_d_Add(dbgi, compound_addr, ofs, mode);
2978 ir_entity *irentity = entry->compound_member.entity;
2979 assert(irentity != NULL);
2980 return new_d_simpleSel(dbgi, new_NoMem(), compound_addr, irentity);
2984 static ir_node *select_to_firm(const select_expression_t *expression)
2986 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2987 ir_node *addr = select_addr(expression);
2988 type_t *type = revert_automatic_type_conversion(
2989 (const expression_t*) expression);
2990 type = skip_typeref(type);
2992 entity_t *entry = expression->compound_entry;
2993 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
2995 if (entry->compound_member.bitfield) {
2996 return bitfield_extract_to_firm(expression, addr);
2999 return deref_address(dbgi, type, addr);
3002 /* Values returned by __builtin_classify_type. */
3003 typedef enum gcc_type_class
3009 enumeral_type_class,
3012 reference_type_class,
3016 function_type_class,
3027 static ir_node *classify_type_to_firm(const classify_type_expression_t *const expr)
3029 type_t *type = expr->type_expression->base.type;
3031 /* FIXME gcc returns different values depending on whether compiling C or C++
3032 * e.g. int x[10] is pointer_type_class in C, but array_type_class in C++ */
3035 type = skip_typeref(type);
3036 switch (type->kind) {
3038 const atomic_type_t *const atomic_type = &type->atomic;
3039 switch (atomic_type->akind) {
3040 /* gcc cannot do that */
3041 case ATOMIC_TYPE_VOID:
3042 tc = void_type_class;
3045 case ATOMIC_TYPE_WCHAR_T: /* gcc handles this as integer */
3046 case ATOMIC_TYPE_CHAR: /* gcc handles this as integer */
3047 case ATOMIC_TYPE_SCHAR: /* gcc handles this as integer */
3048 case ATOMIC_TYPE_UCHAR: /* gcc handles this as integer */
3049 case ATOMIC_TYPE_SHORT:
3050 case ATOMIC_TYPE_USHORT:
3051 case ATOMIC_TYPE_INT:
3052 case ATOMIC_TYPE_UINT:
3053 case ATOMIC_TYPE_LONG:
3054 case ATOMIC_TYPE_ULONG:
3055 case ATOMIC_TYPE_LONGLONG:
3056 case ATOMIC_TYPE_ULONGLONG:
3057 case ATOMIC_TYPE_BOOL: /* gcc handles this as integer */
3058 tc = integer_type_class;
3061 case ATOMIC_TYPE_FLOAT:
3062 case ATOMIC_TYPE_DOUBLE:
3063 case ATOMIC_TYPE_LONG_DOUBLE:
3064 tc = real_type_class;
3067 panic("Unexpected atomic type in classify_type_to_firm().");
3070 case TYPE_COMPLEX: tc = complex_type_class; goto make_const;
3071 case TYPE_IMAGINARY: tc = complex_type_class; goto make_const;
3072 case TYPE_ARRAY: /* gcc handles this as pointer */
3073 case TYPE_FUNCTION: /* gcc handles this as pointer */
3074 case TYPE_POINTER: tc = pointer_type_class; goto make_const;
3075 case TYPE_COMPOUND_STRUCT: tc = record_type_class; goto make_const;
3076 case TYPE_COMPOUND_UNION: tc = union_type_class; goto make_const;
3078 /* gcc handles this as integer */
3079 case TYPE_ENUM: tc = integer_type_class; goto make_const;
3081 /* gcc classifies the referenced type */
3082 case TYPE_REFERENCE: type = type->reference.refers_to; continue;
3084 /* typedef/typeof should be skipped already */
3090 panic("unexpected TYPE classify_type_to_firm().");
3094 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
3095 ir_mode *const mode = atomic_modes[ATOMIC_TYPE_INT];
3096 ir_tarval *const tv = new_tarval_from_long(tc, mode);
3097 return new_d_Const(dbgi, tv);
3100 static ir_node *function_name_to_firm(
3101 const funcname_expression_t *const expr)
3103 switch(expr->kind) {
3104 case FUNCNAME_FUNCTION:
3105 case FUNCNAME_PRETTY_FUNCTION:
3106 case FUNCNAME_FUNCDNAME:
3107 if (current_function_name == NULL) {
3108 source_position_t const *const src_pos = &expr->base.source_position;
3109 char const *const name = current_function_entity->base.symbol->string;
3110 string_t const string = { name, strlen(name), STRING_ENCODING_CHAR };
3111 current_function_name = string_to_firm(src_pos, "__func__.%u", &string);
3113 return current_function_name;
3114 case FUNCNAME_FUNCSIG:
3115 if (current_funcsig == NULL) {
3116 source_position_t const *const src_pos = &expr->base.source_position;
3117 ir_entity *const ent = get_irg_entity(current_ir_graph);
3118 char const *const name = get_entity_ld_name(ent);
3119 string_t const string = { name, strlen(name), STRING_ENCODING_CHAR };
3120 current_funcsig = string_to_firm(src_pos, "__FUNCSIG__.%u", &string);
3122 return current_funcsig;
3124 panic("Unsupported function name");
3127 static ir_node *statement_expression_to_firm(const statement_expression_t *expr)
3129 statement_t *statement = expr->statement;
3131 assert(statement->kind == STATEMENT_COMPOUND);
3132 return compound_statement_to_firm(&statement->compound);
3135 static ir_node *va_start_expression_to_firm(
3136 const va_start_expression_t *const expr)
3138 ir_entity *param_ent = current_vararg_entity;
3139 if (param_ent == NULL) {
3140 size_t const n = IR_VA_START_PARAMETER_NUMBER;
3141 ir_type *const frame_type = get_irg_frame_type(current_ir_graph);
3142 ir_type *const param_type = get_unknown_type();
3143 param_ent = new_parameter_entity(frame_type, n, param_type);
3144 current_vararg_entity = param_ent;
3147 ir_node *const frame = get_irg_frame(current_ir_graph);
3148 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
3149 ir_node *const no_mem = new_NoMem();
3150 ir_node *const arg_sel = new_d_simpleSel(dbgi, no_mem, frame, param_ent);
3152 set_value_for_expression(expr->ap, arg_sel);
3157 static ir_node *va_arg_expression_to_firm(const va_arg_expression_t *const expr)
3159 type_t *const type = expr->base.type;
3160 expression_t *const ap_expr = expr->ap;
3161 ir_node *const ap_addr = expression_to_addr(ap_expr);
3162 ir_node *const ap = get_value_from_lvalue(ap_expr, ap_addr);
3163 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
3164 ir_node *const res = deref_address(dbgi, type, ap);
3166 ir_node *const cnst = get_type_size_node(expr->base.type);
3167 ir_mode *const mode = get_irn_mode(cnst);
3168 ir_node *const c1 = new_Const_long(mode, stack_param_align - 1);
3169 ir_node *const c2 = new_d_Add(dbgi, cnst, c1, mode);
3170 ir_node *const c3 = new_Const_long(mode, -(long)stack_param_align);
3171 ir_node *const c4 = new_d_And(dbgi, c2, c3, mode);
3172 ir_node *const add = new_d_Add(dbgi, ap, c4, mode_P_data);
3174 set_value_for_expression_addr(ap_expr, add, ap_addr);
3180 * Generate Firm for a va_copy expression.
3182 static ir_node *va_copy_expression_to_firm(const va_copy_expression_t *const expr)
3184 ir_node *const src = expression_to_firm(expr->src);
3185 set_value_for_expression(expr->dst, src);
3189 static ir_node *dereference_addr(const unary_expression_t *const expression)
3191 assert(expression->base.kind == EXPR_UNARY_DEREFERENCE);
3192 return expression_to_firm(expression->value);
3196 * Returns a IR-node representing an lvalue of the given expression.
3198 static ir_node *expression_to_addr(const expression_t *expression)
3200 switch(expression->kind) {
3201 case EXPR_ARRAY_ACCESS:
3202 return array_access_addr(&expression->array_access);
3204 return call_expression_to_firm(&expression->call);
3205 case EXPR_COMPOUND_LITERAL:
3206 return compound_literal_addr(&expression->compound_literal);
3207 case EXPR_REFERENCE:
3208 return reference_addr(&expression->reference);
3210 return select_addr(&expression->select);
3211 case EXPR_UNARY_DEREFERENCE:
3212 return dereference_addr(&expression->unary);
3216 panic("trying to get address of non-lvalue");
3219 static ir_node *builtin_constant_to_firm(
3220 const builtin_constant_expression_t *expression)
3222 ir_mode *const mode = get_ir_mode_arithmetic(expression->base.type);
3223 bool const v = is_constant_expression(expression->value) == EXPR_CLASS_CONSTANT;
3224 return create_Const_from_bool(mode, v);
3227 static ir_node *builtin_types_compatible_to_firm(
3228 const builtin_types_compatible_expression_t *expression)
3230 type_t *const left = get_unqualified_type(skip_typeref(expression->left));
3231 type_t *const right = get_unqualified_type(skip_typeref(expression->right));
3232 bool const value = types_compatible(left, right);
3233 ir_mode *const mode = get_ir_mode_arithmetic(expression->base.type);
3234 return create_Const_from_bool(mode, value);
3237 static ir_node *get_label_block(label_t *label)
3239 if (label->block != NULL)
3240 return label->block;
3242 ir_node *block = new_immBlock();
3243 label->block = block;
3245 ARR_APP1(label_t *, all_labels, label);
3250 * Pointer to a label. This is used for the
3251 * GNU address-of-label extension.
3253 static ir_node *label_address_to_firm(const label_address_expression_t *label)
3255 /* Beware: Might be called from create initializer with current_ir_graph
3256 * set to const_code_irg. */
3257 PUSH_IRG(current_function);
3258 dbg_info *dbgi = get_dbg_info(&label->base.source_position);
3259 ir_node *block = get_label_block(label->label);
3260 ir_entity *entity = create_Block_entity(block);
3263 symconst_symbol value;
3264 value.entity_p = entity;
3265 return new_d_SymConst(dbgi, mode_P_code, value, symconst_addr_ent);
3269 * creates firm nodes for an expression. The difference between this function
3270 * and expression_to_firm is, that this version might produce mode_b nodes
3271 * instead of mode_Is.
3273 static ir_node *_expression_to_firm(expression_t const *const expr)
3276 if (!constant_folding) {
3277 assert(!expr->base.transformed);
3278 ((expression_t*)expr)->base.transformed = true;
3282 switch (expr->kind) {
3283 case EXPR_ALIGNOF: return alignof_to_firm( &expr->typeprop);
3284 case EXPR_ARRAY_ACCESS: return array_access_to_firm( &expr->array_access);
3285 case EXPR_BINARY_CASES: return binary_expression_to_firm( &expr->binary);
3286 case EXPR_BUILTIN_CONSTANT_P: return builtin_constant_to_firm( &expr->builtin_constant);
3287 case EXPR_BUILTIN_TYPES_COMPATIBLE_P: return builtin_types_compatible_to_firm(&expr->builtin_types_compatible);
3288 case EXPR_CALL: return call_expression_to_firm( &expr->call);
3289 case EXPR_CLASSIFY_TYPE: return classify_type_to_firm( &expr->classify_type);
3290 case EXPR_COMPOUND_LITERAL: return compound_literal_to_firm( &expr->compound_literal);
3291 case EXPR_CONDITIONAL: return conditional_to_firm( &expr->conditional);
3292 case EXPR_FUNCNAME: return function_name_to_firm( &expr->funcname);
3293 case EXPR_LABEL_ADDRESS: return label_address_to_firm( &expr->label_address);
3294 case EXPR_LITERAL_CASES: return literal_to_firm( &expr->literal);
3295 case EXPR_LITERAL_CHARACTER: return char_literal_to_firm( &expr->string_literal);
3296 case EXPR_OFFSETOF: return offsetof_to_firm( &expr->offsetofe);
3297 case EXPR_REFERENCE: return reference_expression_to_firm( &expr->reference);
3298 case EXPR_ENUM_CONSTANT: return enum_constant_to_firm( &expr->reference);
3299 case EXPR_SELECT: return select_to_firm( &expr->select);
3300 case EXPR_SIZEOF: return sizeof_to_firm( &expr->typeprop);
3301 case EXPR_STATEMENT: return statement_expression_to_firm( &expr->statement);
3302 case EXPR_UNARY_CASES: return unary_expression_to_firm( &expr->unary);
3303 case EXPR_VA_ARG: return va_arg_expression_to_firm( &expr->va_arge);
3304 case EXPR_VA_COPY: return va_copy_expression_to_firm( &expr->va_copye);
3305 case EXPR_VA_START: return va_start_expression_to_firm( &expr->va_starte);
3307 case EXPR_STRING_LITERAL: return string_to_firm(&expr->base.source_position, "str.%u", &expr->string_literal.value);
3309 case EXPR_ERROR: break;
3311 panic("invalid expression found");
3315 * Check if a given expression is a GNU __builtin_expect() call.
3317 static bool is_builtin_expect(const expression_t *expression)
3319 if (expression->kind != EXPR_CALL)
3322 expression_t *function = expression->call.function;
3323 if (function->kind != EXPR_REFERENCE)
3325 reference_expression_t *ref = &function->reference;
3326 if (ref->entity->kind != ENTITY_FUNCTION ||
3327 ref->entity->function.btk != BUILTIN_EXPECT)
3333 static bool produces_mode_b(const expression_t *expression)
3335 switch (expression->kind) {
3336 case EXPR_BINARY_EQUAL:
3337 case EXPR_BINARY_NOTEQUAL:
3338 case EXPR_BINARY_LESS:
3339 case EXPR_BINARY_LESSEQUAL:
3340 case EXPR_BINARY_GREATER:
3341 case EXPR_BINARY_GREATEREQUAL:
3342 case EXPR_BINARY_ISGREATER:
3343 case EXPR_BINARY_ISGREATEREQUAL:
3344 case EXPR_BINARY_ISLESS:
3345 case EXPR_BINARY_ISLESSEQUAL:
3346 case EXPR_BINARY_ISLESSGREATER:
3347 case EXPR_BINARY_ISUNORDERED:
3348 case EXPR_UNARY_NOT:
3352 if (is_builtin_expect(expression)) {
3353 expression_t *argument = expression->call.arguments->expression;
3354 return produces_mode_b(argument);
3357 case EXPR_BINARY_COMMA:
3358 return produces_mode_b(expression->binary.right);
3365 static ir_node *expression_to_firm(const expression_t *expression)
3367 if (!produces_mode_b(expression)) {
3368 ir_node *res = _expression_to_firm(expression);
3369 assert(res == NULL || get_irn_mode(res) != mode_b);
3373 if (is_constant_expression(expression) == EXPR_CLASS_CONSTANT) {
3374 return new_Const(fold_constant_to_tarval(expression));
3377 /* we have to produce a 0/1 from the mode_b expression */
3378 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3379 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
3380 return produce_condition_result(expression, mode, dbgi);
3384 * create a short-circuit expression evaluation that tries to construct
3385 * efficient control flow structures for &&, || and ! expressions
3387 static ir_node *create_condition_evaluation(const expression_t *expression,
3388 ir_node *true_block,
3389 ir_node *false_block)
3391 switch(expression->kind) {
3392 case EXPR_UNARY_NOT: {
3393 const unary_expression_t *unary_expression = &expression->unary;
3394 create_condition_evaluation(unary_expression->value, false_block,
3398 case EXPR_BINARY_LOGICAL_AND: {
3399 const binary_expression_t *binary_expression = &expression->binary;
3401 ir_node *extra_block = new_immBlock();
3402 create_condition_evaluation(binary_expression->left, extra_block,
3404 mature_immBlock(extra_block);
3405 set_cur_block(extra_block);
3406 create_condition_evaluation(binary_expression->right, true_block,
3410 case EXPR_BINARY_LOGICAL_OR: {
3411 const binary_expression_t *binary_expression = &expression->binary;
3413 ir_node *extra_block = new_immBlock();
3414 create_condition_evaluation(binary_expression->left, true_block,
3416 mature_immBlock(extra_block);
3417 set_cur_block(extra_block);
3418 create_condition_evaluation(binary_expression->right, true_block,
3426 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3427 ir_node *cond_expr = _expression_to_firm(expression);
3428 ir_node *condition = create_conv(dbgi, cond_expr, mode_b);
3429 ir_node *cond = new_d_Cond(dbgi, condition);
3430 ir_node *true_proj = new_d_Proj(dbgi, cond, mode_X, pn_Cond_true);
3431 ir_node *false_proj = new_d_Proj(dbgi, cond, mode_X, pn_Cond_false);
3433 /* set branch prediction info based on __builtin_expect */
3434 if (is_builtin_expect(expression) && is_Cond(cond)) {
3435 call_argument_t *argument = expression->call.arguments->next;
3436 if (is_constant_expression(argument->expression) == EXPR_CLASS_CONSTANT) {
3437 bool const cnst = fold_constant_to_bool(argument->expression);
3438 cond_jmp_predicate const pred = cnst ? COND_JMP_PRED_TRUE : COND_JMP_PRED_FALSE;
3439 set_Cond_jmp_pred(cond, pred);
3443 add_immBlock_pred(true_block, true_proj);
3444 add_immBlock_pred(false_block, false_proj);
3446 set_unreachable_now();
3450 static void create_variable_entity(entity_t *variable,
3451 declaration_kind_t declaration_kind,
3452 ir_type *parent_type)
3454 assert(variable->kind == ENTITY_VARIABLE);
3455 type_t *type = skip_typeref(variable->declaration.type);
3457 ident *const id = new_id_from_str(variable->base.symbol->string);
3458 ir_type *const irtype = get_ir_type(type);
3459 dbg_info *const dbgi = get_dbg_info(&variable->base.source_position);
3460 ir_entity *const irentity = new_d_entity(parent_type, id, irtype, dbgi);
3461 unsigned alignment = variable->declaration.alignment;
3463 set_entity_alignment(irentity, alignment);
3465 handle_decl_modifiers(irentity, variable);
3467 variable->declaration.kind = (unsigned char) declaration_kind;
3468 variable->variable.v.entity = irentity;
3469 set_entity_ld_ident(irentity, create_ld_ident(variable));
3471 if (type->base.qualifiers & TYPE_QUALIFIER_VOLATILE) {
3472 set_entity_volatility(irentity, volatility_is_volatile);
3477 typedef struct type_path_entry_t type_path_entry_t;
3478 struct type_path_entry_t {
3480 ir_initializer_t *initializer;
3482 entity_t *compound_entry;
3485 typedef struct type_path_t type_path_t;
3486 struct type_path_t {
3487 type_path_entry_t *path;
3492 static __attribute__((unused)) void debug_print_type_path(const type_path_t *path)
3494 size_t len = ARR_LEN(path->path);
3496 for (size_t i = 0; i < len; ++i) {
3497 const type_path_entry_t *entry = & path->path[i];
3499 type_t *type = skip_typeref(entry->type);
3500 if (is_type_compound(type)) {
3501 fprintf(stderr, ".%s", entry->compound_entry->base.symbol->string);
3502 } else if (is_type_array(type)) {
3503 fprintf(stderr, "[%u]", (unsigned) entry->index);
3505 fprintf(stderr, "-INVALID-");
3508 fprintf(stderr, " (");
3509 print_type(path->top_type);
3510 fprintf(stderr, ")");
3513 static type_path_entry_t *get_type_path_top(const type_path_t *path)
3515 size_t len = ARR_LEN(path->path);
3517 return & path->path[len-1];
3520 static type_path_entry_t *append_to_type_path(type_path_t *path)
3522 size_t len = ARR_LEN(path->path);
3523 ARR_RESIZE(type_path_entry_t, path->path, len+1);
3525 type_path_entry_t *result = & path->path[len];
3526 memset(result, 0, sizeof(result[0]));
3530 static size_t get_compound_member_count(const compound_type_t *type)
3532 compound_t *compound = type->compound;
3533 size_t n_members = 0;
3534 entity_t *member = compound->members.entities;
3535 for ( ; member != NULL; member = member->base.next) {
3542 static ir_initializer_t *get_initializer_entry(type_path_t *path)
3544 type_t *orig_top_type = path->top_type;
3545 type_t *top_type = skip_typeref(orig_top_type);
3547 assert(is_type_compound(top_type) || is_type_array(top_type));
3549 if (ARR_LEN(path->path) == 0) {
3552 type_path_entry_t *top = get_type_path_top(path);
3553 ir_initializer_t *initializer = top->initializer;
3554 return get_initializer_compound_value(initializer, top->index);
3558 static void descend_into_subtype(type_path_t *path)
3560 type_t *orig_top_type = path->top_type;
3561 type_t *top_type = skip_typeref(orig_top_type);
3563 assert(is_type_compound(top_type) || is_type_array(top_type));
3565 ir_initializer_t *initializer = get_initializer_entry(path);
3567 type_path_entry_t *top = append_to_type_path(path);
3568 top->type = top_type;
3572 if (is_type_compound(top_type)) {
3573 compound_t *const compound = top_type->compound.compound;
3574 entity_t *const entry = skip_unnamed_bitfields(compound->members.entities);
3576 top->compound_entry = entry;
3578 len = get_compound_member_count(&top_type->compound);
3579 if (entry != NULL) {
3580 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3581 path->top_type = entry->declaration.type;
3584 assert(is_type_array(top_type));
3585 assert(top_type->array.size > 0);
3588 path->top_type = top_type->array.element_type;
3589 len = top_type->array.size;
3591 if (initializer == NULL
3592 || get_initializer_kind(initializer) == IR_INITIALIZER_NULL) {
3593 initializer = create_initializer_compound(len);
3594 /* we have to set the entry at the 2nd latest path entry... */
3595 size_t path_len = ARR_LEN(path->path);
3596 assert(path_len >= 1);
3598 type_path_entry_t *entry = & path->path[path_len-2];
3599 ir_initializer_t *tinitializer = entry->initializer;
3600 set_initializer_compound_value(tinitializer, entry->index,
3604 top->initializer = initializer;
3607 static void ascend_from_subtype(type_path_t *path)
3609 type_path_entry_t *top = get_type_path_top(path);
3611 path->top_type = top->type;
3613 size_t len = ARR_LEN(path->path);
3614 ARR_RESIZE(type_path_entry_t, path->path, len-1);
3617 static void walk_designator(type_path_t *path, const designator_t *designator)
3619 /* designators start at current object type */
3620 ARR_RESIZE(type_path_entry_t, path->path, 1);
3622 for ( ; designator != NULL; designator = designator->next) {
3623 type_path_entry_t *top = get_type_path_top(path);
3624 type_t *orig_type = top->type;
3625 type_t *type = skip_typeref(orig_type);
3627 if (designator->symbol != NULL) {
3628 assert(is_type_compound(type));
3630 symbol_t *symbol = designator->symbol;
3632 compound_t *compound = type->compound.compound;
3633 entity_t *iter = compound->members.entities;
3634 for (; iter->base.symbol != symbol; iter = iter->base.next, ++index) {}
3635 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
3637 /* revert previous initialisations of other union elements */
3638 if (type->kind == TYPE_COMPOUND_UNION) {
3639 ir_initializer_t *initializer = top->initializer;
3640 if (initializer != NULL
3641 && get_initializer_kind(initializer) == IR_INITIALIZER_COMPOUND) {
3642 /* are we writing to a new element? */
3643 ir_initializer_t *oldi
3644 = get_initializer_compound_value(initializer, index);
3645 if (get_initializer_kind(oldi) == IR_INITIALIZER_NULL) {
3646 /* clear initializer */
3648 = get_initializer_compound_n_entries(initializer);
3649 ir_initializer_t *nulli = get_initializer_null();
3650 for (size_t i = 0; i < len; ++i) {
3651 set_initializer_compound_value(initializer, i,
3658 top->type = orig_type;
3659 top->compound_entry = iter;
3661 orig_type = iter->declaration.type;
3663 expression_t *array_index = designator->array_index;
3664 assert(is_type_array(type));
3666 long index = fold_constant_to_int(array_index);
3667 assert(0 <= index && (!type->array.size_constant || (size_t)index < type->array.size));
3669 top->type = orig_type;
3670 top->index = (size_t) index;
3671 orig_type = type->array.element_type;
3673 path->top_type = orig_type;
3675 if (designator->next != NULL) {
3676 descend_into_subtype(path);
3680 path->invalid = false;
3683 static void advance_current_object(type_path_t *path)
3685 if (path->invalid) {
3686 /* TODO: handle this... */
3687 panic("invalid initializer in ast2firm (excessive elements)");
3690 type_path_entry_t *top = get_type_path_top(path);
3692 type_t *type = skip_typeref(top->type);
3693 if (is_type_union(type)) {
3694 /* only the first element is initialized in unions */
3695 top->compound_entry = NULL;
3696 } else if (is_type_struct(type)) {
3697 entity_t *entry = top->compound_entry;
3700 entry = skip_unnamed_bitfields(entry->base.next);
3701 top->compound_entry = entry;
3702 if (entry != NULL) {
3703 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3704 path->top_type = entry->declaration.type;
3708 assert(is_type_array(type));
3711 if (!type->array.size_constant || top->index < type->array.size) {
3716 /* we're past the last member of the current sub-aggregate, try if we
3717 * can ascend in the type hierarchy and continue with another subobject */
3718 size_t len = ARR_LEN(path->path);
3721 ascend_from_subtype(path);
3722 advance_current_object(path);
3724 path->invalid = true;
3729 static ir_initializer_t *create_ir_initializer_value(
3730 const initializer_value_t *initializer)
3732 if (is_type_compound(initializer->value->base.type)) {
3733 panic("initializer creation for compounds not implemented yet");
3735 type_t *type = initializer->value->base.type;
3736 expression_t *expr = initializer->value;
3737 ir_node *value = expression_to_firm(expr);
3738 ir_mode *mode = get_ir_mode_storage(type);
3739 value = create_conv(NULL, value, mode);
3740 return create_initializer_const(value);
3743 /** test wether type can be initialized by a string constant */
3744 static bool is_string_type(type_t *type)
3746 if (!is_type_array(type))
3749 type_t *const inner = skip_typeref(type->array.element_type);
3750 return is_type_integer(inner);
3753 static ir_initializer_t *create_ir_initializer_list(
3754 const initializer_list_t *initializer, type_t *type)
3757 memset(&path, 0, sizeof(path));
3758 path.top_type = type;
3759 path.path = NEW_ARR_F(type_path_entry_t, 0);
3761 descend_into_subtype(&path);
3763 for (size_t i = 0; i < initializer->len; ++i) {
3764 const initializer_t *sub_initializer = initializer->initializers[i];
3766 if (sub_initializer->kind == INITIALIZER_DESIGNATOR) {
3767 walk_designator(&path, sub_initializer->designator.designator);
3771 if (sub_initializer->kind == INITIALIZER_VALUE) {
3772 /* we might have to descend into types until we're at a scalar
3775 type_t *orig_top_type = path.top_type;
3776 type_t *top_type = skip_typeref(orig_top_type);
3778 if (is_type_scalar(top_type))
3780 descend_into_subtype(&path);
3782 } else if (sub_initializer->kind == INITIALIZER_STRING) {
3783 /* we might have to descend into types until we're at a scalar
3786 type_t *orig_top_type = path.top_type;
3787 type_t *top_type = skip_typeref(orig_top_type);
3789 if (is_string_type(top_type))
3791 descend_into_subtype(&path);
3795 ir_initializer_t *sub_irinitializer
3796 = create_ir_initializer(sub_initializer, path.top_type);
3798 size_t path_len = ARR_LEN(path.path);
3799 assert(path_len >= 1);
3800 type_path_entry_t *entry = & path.path[path_len-1];
3801 ir_initializer_t *tinitializer = entry->initializer;
3802 set_initializer_compound_value(tinitializer, entry->index,
3805 advance_current_object(&path);
3808 assert(ARR_LEN(path.path) >= 1);
3809 ir_initializer_t *result = path.path[0].initializer;
3810 DEL_ARR_F(path.path);
3815 static ir_initializer_t *create_ir_initializer_string(initializer_t const *const init, type_t *type)
3817 type = skip_typeref(type);
3819 assert(type->kind == TYPE_ARRAY);
3820 assert(type->array.size_constant);
3821 string_literal_expression_t const *const str = get_init_string(init);
3822 size_t const str_len = str->value.size;
3823 size_t const arr_len = type->array.size;
3824 ir_initializer_t *const irinit = create_initializer_compound(arr_len);
3825 ir_mode *const mode = get_ir_mode_storage(type->array.element_type);
3826 char const * p = str->value.begin;
3827 switch (str->value.encoding) {
3828 case STRING_ENCODING_CHAR:
3829 for (size_t i = 0; i != arr_len; ++i) {
3830 char const c = i < str_len ? *p++ : 0;
3831 ir_tarval *const tv = new_tarval_from_long(c, mode);
3832 ir_initializer_t *const tvinit = create_initializer_tarval(tv);
3833 set_initializer_compound_value(irinit, i, tvinit);
3837 case STRING_ENCODING_WIDE:
3838 for (size_t i = 0; i != arr_len; ++i) {
3839 utf32 const c = i < str_len ? read_utf8_char(&p) : 0;
3840 ir_tarval *const tv = new_tarval_from_long(c, mode);
3841 ir_initializer_t *const tvinit = create_initializer_tarval(tv);
3842 set_initializer_compound_value(irinit, i, tvinit);
3850 static ir_initializer_t *create_ir_initializer(
3851 const initializer_t *initializer, type_t *type)
3853 switch(initializer->kind) {
3854 case INITIALIZER_STRING:
3855 return create_ir_initializer_string(initializer, type);
3857 case INITIALIZER_LIST:
3858 return create_ir_initializer_list(&initializer->list, type);
3860 case INITIALIZER_VALUE:
3861 return create_ir_initializer_value(&initializer->value);
3863 case INITIALIZER_DESIGNATOR:
3864 panic("unexpected designator initializer found");
3866 panic("unknown initializer");
3869 /** ANSI C ยง6.7.8:21: If there are fewer initializers [..] than there
3870 * are elements [...] the remainder of the aggregate shall be initialized
3871 * implicitly the same as objects that have static storage duration. */
3872 static void create_dynamic_null_initializer(ir_entity *entity, dbg_info *dbgi,
3875 /* for unions we must NOT do anything for null initializers */
3876 ir_type *owner = get_entity_owner(entity);
3877 if (is_Union_type(owner)) {
3881 ir_type *ent_type = get_entity_type(entity);
3882 /* create sub-initializers for a compound type */
3883 if (is_compound_type(ent_type)) {
3884 unsigned n_members = get_compound_n_members(ent_type);
3885 for (unsigned n = 0; n < n_members; ++n) {
3886 ir_entity *member = get_compound_member(ent_type, n);
3887 ir_node *addr = new_d_simpleSel(dbgi, new_NoMem(), base_addr,
3889 create_dynamic_null_initializer(member, dbgi, addr);
3893 if (is_Array_type(ent_type)) {
3894 assert(has_array_upper_bound(ent_type, 0));
3895 long n = get_array_upper_bound_int(ent_type, 0);
3896 for (long i = 0; i < n; ++i) {
3897 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
3898 ir_tarval *index_tv = new_tarval_from_long(i, mode_uint);
3899 ir_node *cnst = new_d_Const(dbgi, index_tv);
3900 ir_node *in[1] = { cnst };
3901 ir_entity *arrent = get_array_element_entity(ent_type);
3902 ir_node *addr = new_d_Sel(dbgi, new_NoMem(), base_addr, 1, in,
3904 create_dynamic_null_initializer(arrent, dbgi, addr);
3909 ir_mode *value_mode = get_type_mode(ent_type);
3910 ir_node *node = new_Const(get_mode_null(value_mode));
3912 /* is it a bitfield type? */
3913 if (is_Primitive_type(ent_type) &&
3914 get_primitive_base_type(ent_type) != NULL) {
3915 bitfield_store_to_firm(dbgi, entity, base_addr, node, false, false);
3919 ir_node *mem = get_store();
3920 ir_node *store = new_d_Store(dbgi, mem, base_addr, node, cons_none);
3921 ir_node *proj_m = new_Proj(store, mode_M, pn_Store_M);
3925 static void create_dynamic_initializer_sub(ir_initializer_t *initializer,
3926 ir_entity *entity, ir_type *type, dbg_info *dbgi, ir_node *base_addr)
3928 switch(get_initializer_kind(initializer)) {
3929 case IR_INITIALIZER_NULL:
3930 create_dynamic_null_initializer(entity, dbgi, base_addr);
3932 case IR_INITIALIZER_CONST: {
3933 ir_node *node = get_initializer_const_value(initializer);
3934 ir_type *ent_type = get_entity_type(entity);
3936 /* is it a bitfield type? */
3937 if (is_Primitive_type(ent_type) &&
3938 get_primitive_base_type(ent_type) != NULL) {
3939 bitfield_store_to_firm(dbgi, entity, base_addr, node, false, false);
3943 assert(get_type_mode(type) == get_irn_mode(node));
3944 ir_node *mem = get_store();
3945 ir_node *store = new_d_Store(dbgi, mem, base_addr, node, cons_none);
3946 ir_node *proj_m = new_Proj(store, mode_M, pn_Store_M);
3950 case IR_INITIALIZER_TARVAL: {
3951 ir_tarval *tv = get_initializer_tarval_value(initializer);
3952 ir_node *cnst = new_d_Const(dbgi, tv);
3953 ir_type *ent_type = get_entity_type(entity);
3955 /* is it a bitfield type? */
3956 if (is_Primitive_type(ent_type) &&
3957 get_primitive_base_type(ent_type) != NULL) {
3958 bitfield_store_to_firm(dbgi, entity, base_addr, cnst, false, false);
3962 assert(get_type_mode(type) == get_tarval_mode(tv));
3963 ir_node *mem = get_store();
3964 ir_node *store = new_d_Store(dbgi, mem, base_addr, cnst, cons_none);
3965 ir_node *proj_m = new_Proj(store, mode_M, pn_Store_M);
3969 case IR_INITIALIZER_COMPOUND: {
3970 assert(is_compound_type(type) || is_Array_type(type));
3972 if (is_Array_type(type)) {
3973 assert(has_array_upper_bound(type, 0));
3974 n_members = get_array_upper_bound_int(type, 0);
3976 n_members = get_compound_n_members(type);
3979 if (get_initializer_compound_n_entries(initializer)
3980 != (unsigned) n_members)
3981 panic("initializer doesn't match compound type");
3983 for (int i = 0; i < n_members; ++i) {
3986 ir_entity *sub_entity;
3987 if (is_Array_type(type)) {
3988 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
3989 ir_tarval *index_tv = new_tarval_from_long(i, mode_uint);
3990 ir_node *cnst = new_d_Const(dbgi, index_tv);
3991 ir_node *in[1] = { cnst };
3992 irtype = get_array_element_type(type);
3993 sub_entity = get_array_element_entity(type);
3994 addr = new_d_Sel(dbgi, new_NoMem(), base_addr, 1, in,
3997 sub_entity = get_compound_member(type, i);
3998 irtype = get_entity_type(sub_entity);
3999 addr = new_d_simpleSel(dbgi, new_NoMem(), base_addr,
4003 ir_initializer_t *sub_init
4004 = get_initializer_compound_value(initializer, i);
4006 create_dynamic_initializer_sub(sub_init, sub_entity, irtype, dbgi,
4013 panic("invalid IR_INITIALIZER found");
4016 static void create_dynamic_initializer(ir_initializer_t *initializer,
4017 dbg_info *dbgi, ir_entity *entity)
4019 ir_node *frame = get_irg_frame(current_ir_graph);
4020 ir_node *base_addr = new_d_simpleSel(dbgi, new_NoMem(), frame, entity);
4021 ir_type *type = get_entity_type(entity);
4023 create_dynamic_initializer_sub(initializer, entity, type, dbgi, base_addr);
4026 static void create_local_initializer(initializer_t *initializer, dbg_info *dbgi,
4027 ir_entity *entity, type_t *type)
4029 ir_node *memory = get_store();
4030 ir_node *nomem = new_NoMem();
4031 ir_node *frame = get_irg_frame(current_ir_graph);
4032 ir_node *addr = new_d_simpleSel(dbgi, nomem, frame, entity);
4034 if (initializer->kind == INITIALIZER_VALUE) {
4035 initializer_value_t *initializer_value = &initializer->value;
4037 ir_node *value = expression_to_firm(initializer_value->value);
4038 type = skip_typeref(type);
4039 assign_value(dbgi, addr, type, value);
4043 if (is_constant_initializer(initializer) == EXPR_CLASS_VARIABLE) {
4044 ir_initializer_t *irinitializer
4045 = create_ir_initializer(initializer, type);
4047 create_dynamic_initializer(irinitializer, dbgi, entity);
4051 /* create a "template" entity which is copied to the entity on the stack */
4052 ir_entity *const init_entity
4053 = create_initializer_entity(dbgi, initializer, type);
4054 ir_node *const src_addr = create_symconst(dbgi, init_entity);
4055 ir_type *const irtype = get_ir_type(type);
4056 ir_node *const copyb = new_d_CopyB(dbgi, memory, addr, src_addr, irtype);
4058 ir_node *const copyb_mem = new_Proj(copyb, mode_M, pn_CopyB_M);
4059 set_store(copyb_mem);
4062 static void create_initializer_local_variable_entity(entity_t *entity)
4064 assert(entity->kind == ENTITY_VARIABLE);
4065 initializer_t *initializer = entity->variable.initializer;
4066 dbg_info *dbgi = get_dbg_info(&entity->base.source_position);
4067 ir_entity *irentity = entity->variable.v.entity;
4068 type_t *type = entity->declaration.type;
4070 create_local_initializer(initializer, dbgi, irentity, type);
4073 static void create_variable_initializer(entity_t *entity)
4075 assert(entity->kind == ENTITY_VARIABLE);
4076 initializer_t *initializer = entity->variable.initializer;
4077 if (initializer == NULL)
4080 declaration_kind_t declaration_kind
4081 = (declaration_kind_t) entity->declaration.kind;
4082 if (declaration_kind == DECLARATION_KIND_LOCAL_VARIABLE_ENTITY) {
4083 create_initializer_local_variable_entity(entity);
4087 type_t *type = entity->declaration.type;
4088 type_qualifiers_t tq = get_type_qualifier(type, true);
4090 if (initializer->kind == INITIALIZER_VALUE) {
4091 expression_t * value = initializer->value.value;
4092 type_t *const init_type = skip_typeref(value->base.type);
4094 if (!is_type_scalar(init_type)) {
4096 while (value->kind == EXPR_UNARY_CAST)
4097 value = value->unary.value;
4099 if (value->kind != EXPR_COMPOUND_LITERAL)
4100 panic("expected non-scalar initializer to be a compound literal");
4101 initializer = value->compound_literal.initializer;
4102 goto have_initializer;
4105 ir_node * node = expression_to_firm(value);
4106 dbg_info *const dbgi = get_dbg_info(&entity->base.source_position);
4107 ir_mode *const mode = get_ir_mode_storage(init_type);
4108 node = create_conv(dbgi, node, mode);
4110 if (declaration_kind == DECLARATION_KIND_LOCAL_VARIABLE) {
4111 set_value(entity->variable.v.value_number, node);
4113 assert(declaration_kind == DECLARATION_KIND_GLOBAL_VARIABLE);
4115 ir_entity *irentity = entity->variable.v.entity;
4117 if (tq & TYPE_QUALIFIER_CONST
4118 && get_entity_owner(irentity) != get_tls_type()) {
4119 add_entity_linkage(irentity, IR_LINKAGE_CONSTANT);
4121 set_atomic_ent_value(irentity, node);
4125 assert(declaration_kind == DECLARATION_KIND_LOCAL_VARIABLE_ENTITY ||
4126 declaration_kind == DECLARATION_KIND_GLOBAL_VARIABLE);
4128 ir_entity *irentity = entity->variable.v.entity;
4129 ir_initializer_t *irinitializer
4130 = create_ir_initializer(initializer, type);
4132 if (tq & TYPE_QUALIFIER_CONST) {
4133 add_entity_linkage(irentity, IR_LINKAGE_CONSTANT);
4135 set_entity_initializer(irentity, irinitializer);
4139 static void create_variable_length_array(entity_t *entity)
4141 assert(entity->kind == ENTITY_VARIABLE);
4142 assert(entity->variable.initializer == NULL);
4144 entity->declaration.kind = DECLARATION_KIND_VARIABLE_LENGTH_ARRAY;
4145 entity->variable.v.vla_base = NULL;
4147 /* TODO: record VLA somewhere so we create the free node when we leave
4151 static void allocate_variable_length_array(entity_t *entity)
4153 assert(entity->kind == ENTITY_VARIABLE);
4154 assert(entity->variable.initializer == NULL);
4155 assert(currently_reachable());
4157 dbg_info *dbgi = get_dbg_info(&entity->base.source_position);
4158 type_t *type = entity->declaration.type;
4159 ir_type *el_type = get_ir_type(type->array.element_type);
4161 /* make sure size_node is calculated */
4162 get_type_size_node(type);
4163 ir_node *elems = type->array.size_node;
4164 ir_node *mem = get_store();
4165 ir_node *alloc = new_d_Alloc(dbgi, mem, elems, el_type, stack_alloc);
4167 ir_node *proj_m = new_d_Proj(dbgi, alloc, mode_M, pn_Alloc_M);
4168 ir_node *addr = new_d_Proj(dbgi, alloc, mode_P_data, pn_Alloc_res);
4171 assert(entity->declaration.kind == DECLARATION_KIND_VARIABLE_LENGTH_ARRAY);
4172 entity->variable.v.vla_base = addr;
4175 static bool var_needs_entity(variable_t const *const var)
4177 if (var->address_taken)
4179 type_t *const type = skip_typeref(var->base.type);
4180 return !is_type_scalar(type) || type->base.qualifiers & TYPE_QUALIFIER_VOLATILE;
4184 * Creates a Firm local variable from a declaration.
4186 static void create_local_variable(entity_t *entity)
4188 assert(entity->kind == ENTITY_VARIABLE);
4189 assert(entity->declaration.kind == DECLARATION_KIND_UNKNOWN);
4191 if (!var_needs_entity(&entity->variable)) {
4192 entity->declaration.kind = DECLARATION_KIND_LOCAL_VARIABLE;
4193 entity->variable.v.value_number = next_value_number_function;
4194 set_irg_loc_description(current_ir_graph, next_value_number_function, entity);
4195 ++next_value_number_function;
4199 /* is it a variable length array? */
4200 type_t *const type = skip_typeref(entity->declaration.type);
4201 if (is_type_array(type) && !type->array.size_constant) {
4202 create_variable_length_array(entity);
4206 ir_type *const frame_type = get_irg_frame_type(current_ir_graph);
4207 create_variable_entity(entity, DECLARATION_KIND_LOCAL_VARIABLE_ENTITY, frame_type);
4210 static void create_local_static_variable(entity_t *entity)
4212 assert(entity->kind == ENTITY_VARIABLE);
4213 assert(entity->declaration.kind == DECLARATION_KIND_UNKNOWN);
4215 type_t *type = skip_typeref(entity->declaration.type);
4216 ir_type *const var_type = entity->variable.thread_local ?
4217 get_tls_type() : get_glob_type();
4218 ir_type *const irtype = get_ir_type(type);
4219 dbg_info *const dbgi = get_dbg_info(&entity->base.source_position);
4221 size_t l = strlen(entity->base.symbol->string);
4222 char buf[l + sizeof(".%u")];
4223 snprintf(buf, sizeof(buf), "%s.%%u", entity->base.symbol->string);
4224 ident *const id = id_unique(buf);
4225 ir_entity *const irentity = new_d_entity(var_type, id, irtype, dbgi);
4227 if (type->base.qualifiers & TYPE_QUALIFIER_VOLATILE) {
4228 set_entity_volatility(irentity, volatility_is_volatile);
4231 entity->declaration.kind = DECLARATION_KIND_GLOBAL_VARIABLE;
4232 entity->variable.v.entity = irentity;
4234 set_entity_ld_ident(irentity, id);
4235 set_entity_visibility(irentity, ir_visibility_local);
4237 if (entity->variable.initializer == NULL) {
4238 ir_initializer_t *null_init = get_initializer_null();
4239 set_entity_initializer(irentity, null_init);
4242 PUSH_IRG(get_const_code_irg());
4243 create_variable_initializer(entity);
4249 static ir_node *return_statement_to_firm(return_statement_t *statement)
4251 if (!currently_reachable())
4254 dbg_info *const dbgi = get_dbg_info(&statement->base.source_position);
4255 type_t *const type = skip_typeref(current_function_entity->declaration.type->function.return_type);
4256 ir_node * res = statement->value ? expression_to_firm(statement->value) : NULL;
4259 if (!is_type_void(type)) {
4260 ir_mode *const mode = get_ir_mode_storage(type);
4262 res = create_conv(dbgi, res, mode);
4264 res = new_Unknown(mode);
4271 ir_node *const in[1] = { res };
4272 ir_node *const store = get_store();
4273 ir_node *const ret = new_d_Return(dbgi, store, in_len, in);
4275 ir_node *end_block = get_irg_end_block(current_ir_graph);
4276 add_immBlock_pred(end_block, ret);
4278 set_unreachable_now();
4282 static ir_node *expression_statement_to_firm(expression_statement_t *statement)
4284 if (!currently_reachable())
4287 return expression_to_firm(statement->expression);
4290 static void create_local_declarations(entity_t*);
4292 static ir_node *compound_statement_to_firm(compound_statement_t *compound)
4294 create_local_declarations(compound->scope.entities);
4296 ir_node *result = NULL;
4297 statement_t *statement = compound->statements;
4298 for ( ; statement != NULL; statement = statement->base.next) {
4299 result = statement_to_firm(statement);
4305 static void create_global_variable(entity_t *entity)
4307 ir_linkage linkage = IR_LINKAGE_DEFAULT;
4308 ir_visibility visibility = ir_visibility_external;
4309 storage_class_tag_t storage
4310 = (storage_class_tag_t)entity->declaration.storage_class;
4311 decl_modifiers_t modifiers = entity->declaration.modifiers;
4312 assert(entity->kind == ENTITY_VARIABLE);
4315 case STORAGE_CLASS_EXTERN: visibility = ir_visibility_external; break;
4316 case STORAGE_CLASS_STATIC: visibility = ir_visibility_local; break;
4317 case STORAGE_CLASS_NONE: visibility = ir_visibility_external; break;
4318 case STORAGE_CLASS_TYPEDEF:
4319 case STORAGE_CLASS_AUTO:
4320 case STORAGE_CLASS_REGISTER:
4321 panic("invalid storage class for global var");
4324 /* "common" symbols */
4325 if (storage == STORAGE_CLASS_NONE
4326 && entity->variable.initializer == NULL
4327 && !entity->variable.thread_local
4328 && (modifiers & DM_WEAK) == 0) {
4329 linkage |= IR_LINKAGE_MERGE;
4332 ir_type *var_type = get_glob_type();
4333 if (entity->variable.thread_local) {
4334 var_type = get_tls_type();
4336 create_variable_entity(entity, DECLARATION_KIND_GLOBAL_VARIABLE, var_type);
4337 ir_entity *irentity = entity->variable.v.entity;
4338 add_entity_linkage(irentity, linkage);
4339 set_entity_visibility(irentity, visibility);
4340 if (entity->variable.initializer == NULL
4341 && storage != STORAGE_CLASS_EXTERN) {
4342 ir_initializer_t *null_init = get_initializer_null();
4343 set_entity_initializer(irentity, null_init);
4347 static void create_local_declaration(entity_t *entity)
4349 assert(is_declaration(entity));
4351 /* construct type */
4352 (void) get_ir_type(entity->declaration.type);
4353 if (entity->base.symbol == NULL) {
4357 switch ((storage_class_tag_t) entity->declaration.storage_class) {
4358 case STORAGE_CLASS_STATIC:
4359 if (entity->kind == ENTITY_FUNCTION) {
4360 (void)get_function_entity(entity, NULL);
4362 create_local_static_variable(entity);
4365 case STORAGE_CLASS_EXTERN:
4366 if (entity->kind == ENTITY_FUNCTION) {
4367 assert(entity->function.body == NULL);
4368 (void)get_function_entity(entity, NULL);
4370 create_global_variable(entity);
4371 create_variable_initializer(entity);
4374 case STORAGE_CLASS_NONE:
4375 case STORAGE_CLASS_AUTO:
4376 case STORAGE_CLASS_REGISTER:
4377 if (entity->kind == ENTITY_FUNCTION) {
4378 if (entity->function.body != NULL) {
4379 ir_type *owner = get_irg_frame_type(current_ir_graph);
4380 (void)get_function_entity(entity, owner);
4381 entity->declaration.kind = DECLARATION_KIND_INNER_FUNCTION;
4382 enqueue_inner_function(entity);
4384 (void)get_function_entity(entity, NULL);
4387 create_local_variable(entity);
4390 case STORAGE_CLASS_TYPEDEF:
4393 panic("invalid storage class found");
4396 static void create_local_declarations(entity_t *e)
4398 for (; e; e = e->base.next) {
4399 if (is_declaration(e))
4400 create_local_declaration(e);
4404 static void initialize_local_declaration(entity_t *entity)
4406 if (entity->base.symbol == NULL)
4409 // no need to emit code in dead blocks
4410 if (entity->declaration.storage_class != STORAGE_CLASS_STATIC
4411 && !currently_reachable())
4414 switch ((declaration_kind_t) entity->declaration.kind) {
4415 case DECLARATION_KIND_LOCAL_VARIABLE:
4416 case DECLARATION_KIND_LOCAL_VARIABLE_ENTITY:
4417 create_variable_initializer(entity);
4420 case DECLARATION_KIND_VARIABLE_LENGTH_ARRAY:
4421 allocate_variable_length_array(entity);
4424 case DECLARATION_KIND_COMPOUND_MEMBER:
4425 case DECLARATION_KIND_GLOBAL_VARIABLE:
4426 case DECLARATION_KIND_FUNCTION:
4427 case DECLARATION_KIND_INNER_FUNCTION:
4430 case DECLARATION_KIND_PARAMETER:
4431 case DECLARATION_KIND_PARAMETER_ENTITY:
4432 panic("can't initialize parameters");
4434 case DECLARATION_KIND_UNKNOWN:
4435 panic("can't initialize unknown declaration");
4437 panic("invalid declaration kind");
4440 static ir_node *declaration_statement_to_firm(declaration_statement_t *statement)
4442 entity_t *entity = statement->declarations_begin;
4446 entity_t *const last = statement->declarations_end;
4447 for ( ;; entity = entity->base.next) {
4448 if (is_declaration(entity)) {
4449 initialize_local_declaration(entity);
4450 } else if (entity->kind == ENTITY_TYPEDEF) {
4451 /* ยง6.7.7:3 Any array size expressions associated with variable length
4452 * array declarators are evaluated each time the declaration of the
4453 * typedef name is reached in the order of execution. */
4454 type_t *const type = skip_typeref(entity->typedefe.type);
4455 if (is_type_array(type) && type->array.is_vla)
4456 get_vla_size(&type->array);
4465 static ir_node *if_statement_to_firm(if_statement_t *statement)
4467 create_local_declarations(statement->scope.entities);
4469 /* Create the condition. */
4470 ir_node *true_block = NULL;
4471 ir_node *false_block = NULL;
4472 if (currently_reachable()) {
4473 true_block = new_immBlock();
4474 false_block = new_immBlock();
4475 create_condition_evaluation(statement->condition, true_block, false_block);
4476 mature_immBlock(true_block);
4477 mature_immBlock(false_block);
4480 /* Create the true statement. */
4481 set_cur_block(true_block);
4482 statement_to_firm(statement->true_statement);
4483 ir_node *fallthrough_block = get_cur_block();
4485 /* Create the false statement. */
4486 set_cur_block(false_block);
4487 if (statement->false_statement != NULL) {
4488 statement_to_firm(statement->false_statement);
4491 /* Handle the block after the if-statement. Minor simplification and
4492 * optimisation: Reuse the false/true block as fallthrough block, if the
4493 * true/false statement does not pass control to the fallthrough block, e.g.
4494 * in the typical if (x) return; pattern. */
4495 if (fallthrough_block) {
4496 if (currently_reachable()) {
4497 ir_node *const t_jump = new_r_Jmp(fallthrough_block);
4498 ir_node *const f_jump = new_Jmp();
4499 ir_node *const in[] = { t_jump, f_jump };
4500 fallthrough_block = new_Block(2, in);
4502 set_cur_block(fallthrough_block);
4509 * Add an unconditional jump to the target block. If the source block is not
4510 * reachable, then a Bad predecessor is created to prevent Phi-less unreachable
4511 * loops. This is necessary if the jump potentially enters a loop.
4513 static void jump_to(ir_node *const target_block)
4515 ir_node *const pred = currently_reachable() ? new_Jmp() : new_Bad(mode_X);
4516 add_immBlock_pred(target_block, pred);
4517 set_cur_block(target_block);
4521 * Add an unconditional jump to the target block, if the current block is
4522 * reachable and do nothing otherwise. This is only valid if the jump does not
4523 * enter a loop (a back edge is ok).
4525 static void jump_if_reachable(ir_node *const target_block)
4527 if (currently_reachable())
4528 add_immBlock_pred(target_block, new_Jmp());
4531 static ir_node *get_break_label(void)
4533 if (break_label == NULL) {
4534 break_label = new_immBlock();
4539 static ir_node *do_while_statement_to_firm(do_while_statement_t *statement)
4541 create_local_declarations(statement->scope.entities);
4543 /* create the header block */
4544 ir_node *header_block = new_immBlock();
4547 PUSH_CONTINUE(header_block);
4549 /* The loop body. */
4550 ir_node *body_block = NULL;
4551 expression_t *const cond = statement->condition;
4552 /* Avoid an explicit body block in case of do ... while (0);. */
4553 if (is_constant_expression(cond) != EXPR_CLASS_CONSTANT || fold_constant_to_bool(cond)) {
4554 /* Not do ... while (0);. */
4555 body_block = new_immBlock();
4556 jump_to(body_block);
4558 statement_to_firm(statement->body);
4560 /* create the condition */
4561 jump_if_reachable(header_block);
4562 mature_immBlock(header_block);
4563 set_cur_block(header_block);
4564 ir_node *const false_block = get_break_label();
4566 create_condition_evaluation(statement->condition, body_block, false_block);
4567 mature_immBlock(body_block);
4569 jump_if_reachable(false_block);
4571 mature_immBlock(false_block);
4572 set_cur_block(false_block);
4579 static ir_node *for_statement_to_firm(for_statement_t *statement)
4581 create_local_declarations(statement->scope.entities);
4583 if (currently_reachable()) {
4584 entity_t *entity = statement->scope.entities;
4585 for ( ; entity != NULL; entity = entity->base.next) {
4586 if (!is_declaration(entity))
4589 initialize_local_declaration(entity);
4592 if (statement->initialisation != NULL) {
4593 expression_to_firm(statement->initialisation);
4597 /* Create the header block */
4598 ir_node *const header_block = new_immBlock();
4599 jump_to(header_block);
4601 /* Create the condition. */
4602 ir_node *false_block;
4603 expression_t *const cond = statement->condition;
4604 if (cond && (is_constant_expression(cond) != EXPR_CLASS_CONSTANT || !fold_constant_to_bool(cond))) {
4605 false_block = new_immBlock();
4607 ir_node *const body_block = new_immBlock();
4608 create_condition_evaluation(cond, body_block, false_block);
4609 mature_immBlock(body_block);
4610 set_cur_block(body_block);
4615 keep_alive(header_block);
4616 keep_all_memory(header_block);
4619 /* Create the step block, if necessary. */
4620 ir_node * step_block = header_block;
4621 expression_t *const step = statement->step;
4623 step_block = new_immBlock();
4626 PUSH_BREAK(false_block);
4627 PUSH_CONTINUE(step_block);
4629 /* Create the loop body. */
4630 statement_to_firm(statement->body);
4631 jump_if_reachable(step_block);
4633 /* Create the step code. */
4635 mature_immBlock(step_block);
4636 set_cur_block(step_block);
4637 expression_to_firm(step);
4638 jump_if_reachable(header_block);
4641 mature_immBlock(header_block);
4642 assert(false_block == NULL || false_block == break_label);
4643 false_block = break_label;
4644 if (false_block != NULL) {
4645 mature_immBlock(false_block);
4647 set_cur_block(false_block);
4654 static ir_node *create_jump_statement(const statement_t *statement, ir_node *target_block)
4656 if (!currently_reachable())
4659 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
4660 ir_node *jump = new_d_Jmp(dbgi);
4661 add_immBlock_pred(target_block, jump);
4663 set_unreachable_now();
4667 static ir_switch_table *create_switch_table(const switch_statement_t *statement)
4669 /* determine number of cases */
4671 for (case_label_statement_t *l = statement->first_case; l != NULL;
4674 if (l->expression == NULL)
4676 if (l->is_empty_range)
4681 ir_switch_table *res = ir_new_switch_table(current_ir_graph, n_cases);
4683 for (case_label_statement_t *l = statement->first_case; l != NULL;
4685 if (l->expression == NULL) {
4686 l->pn = pn_Switch_default;
4689 if (l->is_empty_range)
4691 ir_tarval *min = fold_constant_to_tarval(l->expression);
4692 ir_tarval *max = min;
4693 long pn = (long) i+1;
4694 if (l->end_range != NULL)
4695 max = fold_constant_to_tarval(l->end_range);
4696 ir_switch_table_set(res, i++, min, max, pn);
4702 static ir_node *switch_statement_to_firm(switch_statement_t *statement)
4704 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
4705 ir_node *switch_node = NULL;
4707 if (currently_reachable()) {
4708 ir_node *expression = expression_to_firm(statement->expression);
4709 ir_switch_table *table = create_switch_table(statement);
4710 unsigned n_outs = (unsigned)ir_switch_table_get_n_entries(table) + 1;
4712 switch_node = new_d_Switch(dbgi, expression, n_outs, table);
4715 set_unreachable_now();
4718 ir_node *const old_switch = current_switch;
4719 const bool old_saw_default_label = saw_default_label;
4720 saw_default_label = false;
4721 current_switch = switch_node;
4723 statement_to_firm(statement->body);
4725 if (currently_reachable()) {
4726 add_immBlock_pred(get_break_label(), new_Jmp());
4729 if (!saw_default_label && switch_node) {
4730 ir_node *proj = new_d_Proj(dbgi, switch_node, mode_X, pn_Switch_default);
4731 add_immBlock_pred(get_break_label(), proj);
4734 if (break_label != NULL) {
4735 mature_immBlock(break_label);
4737 set_cur_block(break_label);
4739 assert(current_switch == switch_node);
4740 current_switch = old_switch;
4741 saw_default_label = old_saw_default_label;
4746 static ir_node *case_label_to_firm(const case_label_statement_t *statement)
4748 if (statement->is_empty_range)
4751 if (current_switch != NULL) {
4752 ir_node *block = new_immBlock();
4753 /* Fallthrough from previous case */
4754 jump_if_reachable(block);
4756 ir_node *const proj = new_Proj(current_switch, mode_X, statement->pn);
4757 add_immBlock_pred(block, proj);
4758 if (statement->expression == NULL)
4759 saw_default_label = true;
4761 mature_immBlock(block);
4762 set_cur_block(block);
4765 return statement_to_firm(statement->statement);
4768 static ir_node *label_to_firm(const label_statement_t *statement)
4770 ir_node *block = get_label_block(statement->label);
4774 keep_all_memory(block);
4776 return statement_to_firm(statement->statement);
4779 static ir_node *computed_goto_to_firm(computed_goto_statement_t const *const statement)
4781 if (!currently_reachable())
4784 ir_node *const irn = expression_to_firm(statement->expression);
4785 dbg_info *const dbgi = get_dbg_info(&statement->base.source_position);
4786 ir_node *const ijmp = new_d_IJmp(dbgi, irn);
4788 set_irn_link(ijmp, ijmp_list);
4791 set_unreachable_now();
4795 static ir_node *asm_statement_to_firm(const asm_statement_t *statement)
4797 bool needs_memory = statement->is_volatile;
4798 size_t n_clobbers = 0;
4799 asm_clobber_t *clobber = statement->clobbers;
4800 for ( ; clobber != NULL; clobber = clobber->next) {
4801 const char *clobber_str = clobber->clobber.begin;
4803 if (!be_is_valid_clobber(clobber_str)) {
4804 errorf(&statement->base.source_position,
4805 "invalid clobber '%s' specified", clobber->clobber);
4809 if (streq(clobber_str, "memory")) {
4810 needs_memory = true;
4814 ident *id = new_id_from_str(clobber_str);
4815 obstack_ptr_grow(&asm_obst, id);
4818 assert(obstack_object_size(&asm_obst) == n_clobbers * sizeof(ident*));
4819 ident **clobbers = NULL;
4820 if (n_clobbers > 0) {
4821 clobbers = obstack_finish(&asm_obst);
4824 size_t n_inputs = 0;
4825 asm_argument_t *argument = statement->inputs;
4826 for ( ; argument != NULL; argument = argument->next)
4828 size_t n_outputs = 0;
4829 argument = statement->outputs;
4830 for ( ; argument != NULL; argument = argument->next)
4833 unsigned next_pos = 0;
4835 ir_node *ins[n_inputs + n_outputs + 1];
4838 ir_asm_constraint tmp_in_constraints[n_outputs];
4840 const expression_t *out_exprs[n_outputs];
4841 ir_node *out_addrs[n_outputs];
4842 size_t out_size = 0;
4844 argument = statement->outputs;
4845 for ( ; argument != NULL; argument = argument->next) {
4846 const char *constraints = argument->constraints.begin;
4847 asm_constraint_flags_t asm_flags
4848 = be_parse_asm_constraints(constraints);
4851 source_position_t const *const pos = &statement->base.source_position;
4852 if (asm_flags & ASM_CONSTRAINT_FLAG_NO_SUPPORT) {
4853 warningf(WARN_OTHER, pos, "some constraints in '%s' are not supported", constraints);
4855 if (asm_flags & ASM_CONSTRAINT_FLAG_INVALID) {
4856 errorf(pos, "some constraints in '%s' are invalid", constraints);
4859 if (! (asm_flags & ASM_CONSTRAINT_FLAG_MODIFIER_WRITE)) {
4860 errorf(pos, "no write flag specified for output constraints '%s'", constraints);
4865 unsigned pos = next_pos++;
4866 if ( (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE)
4867 || (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER) ) {
4868 expression_t *expr = argument->expression;
4869 ir_node *addr = expression_to_addr(expr);
4870 /* in+output, construct an artifical same_as constraint on the
4872 if (asm_flags & ASM_CONSTRAINT_FLAG_MODIFIER_READ) {
4874 ir_node *value = get_value_from_lvalue(expr, addr);
4876 snprintf(buf, sizeof(buf), "%u", (unsigned) out_size);
4878 ir_asm_constraint constraint;
4879 constraint.pos = pos;
4880 constraint.constraint = new_id_from_str(buf);
4881 constraint.mode = get_ir_mode_storage(expr->base.type);
4882 tmp_in_constraints[in_size] = constraint;
4883 ins[in_size] = value;
4888 out_exprs[out_size] = expr;
4889 out_addrs[out_size] = addr;
4891 } else if (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP) {
4892 /* pure memory ops need no input (but we have to make sure we
4893 * attach to the memory) */
4894 assert(! (asm_flags &
4895 (ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE
4896 | ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER)));
4897 needs_memory = true;
4899 /* we need to attach the address to the inputs */
4900 expression_t *expr = argument->expression;
4902 ir_asm_constraint constraint;
4903 constraint.pos = pos;
4904 constraint.constraint = new_id_from_str(constraints);
4905 constraint.mode = mode_M;
4906 tmp_in_constraints[in_size] = constraint;
4908 ins[in_size] = expression_to_addr(expr);
4912 errorf(&statement->base.source_position,
4913 "only modifiers but no place set in constraints '%s'",
4918 ir_asm_constraint constraint;
4919 constraint.pos = pos;
4920 constraint.constraint = new_id_from_str(constraints);
4921 constraint.mode = get_ir_mode_storage(argument->expression->base.type);
4923 obstack_grow(&asm_obst, &constraint, sizeof(constraint));
4925 assert(obstack_object_size(&asm_obst)
4926 == out_size * sizeof(ir_asm_constraint));
4927 ir_asm_constraint *output_constraints = obstack_finish(&asm_obst);
4930 obstack_grow(&asm_obst, tmp_in_constraints,
4931 in_size * sizeof(tmp_in_constraints[0]));
4932 /* find and count input and output arguments */
4933 argument = statement->inputs;
4934 for ( ; argument != NULL; argument = argument->next) {
4935 const char *constraints = argument->constraints.begin;
4936 asm_constraint_flags_t asm_flags
4937 = be_parse_asm_constraints(constraints);
4939 if (asm_flags & ASM_CONSTRAINT_FLAG_NO_SUPPORT) {
4940 errorf(&statement->base.source_position,
4941 "some constraints in '%s' are not supported", constraints);
4944 if (asm_flags & ASM_CONSTRAINT_FLAG_INVALID) {
4945 errorf(&statement->base.source_position,
4946 "some constraints in '%s' are invalid", constraints);
4949 if (asm_flags & ASM_CONSTRAINT_FLAG_MODIFIER_WRITE) {
4950 errorf(&statement->base.source_position,
4951 "write flag specified for input constraints '%s'",
4957 if ( (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE)
4958 || (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER) ) {
4959 /* we can treat this as "normal" input */
4960 input = expression_to_firm(argument->expression);
4961 } else if (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP) {
4962 /* pure memory ops need no input (but we have to make sure we
4963 * attach to the memory) */
4964 assert(! (asm_flags &
4965 (ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE
4966 | ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER)));
4967 needs_memory = true;
4968 input = expression_to_addr(argument->expression);
4970 errorf(&statement->base.source_position,
4971 "only modifiers but no place set in constraints '%s'",
4976 ir_asm_constraint constraint;
4977 constraint.pos = next_pos++;
4978 constraint.constraint = new_id_from_str(constraints);
4979 constraint.mode = get_irn_mode(input);
4981 obstack_grow(&asm_obst, &constraint, sizeof(constraint));
4982 ins[in_size++] = input;
4985 ir_node *mem = needs_memory ? get_store() : new_NoMem();
4986 assert(obstack_object_size(&asm_obst)
4987 == in_size * sizeof(ir_asm_constraint));
4988 ir_asm_constraint *input_constraints = obstack_finish(&asm_obst);
4990 /* create asm node */
4991 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
4993 ident *asm_text = new_id_from_str(statement->asm_text.begin);
4995 ir_node *node = new_d_ASM(dbgi, mem, in_size, ins, input_constraints,
4996 out_size, output_constraints,
4997 n_clobbers, clobbers, asm_text);
4999 if (statement->is_volatile) {
5000 set_irn_pinned(node, op_pin_state_pinned);
5002 set_irn_pinned(node, op_pin_state_floats);
5005 /* create output projs & connect them */
5007 ir_node *projm = new_Proj(node, mode_M, out_size);
5012 for (i = 0; i < out_size; ++i) {
5013 const expression_t *out_expr = out_exprs[i];
5015 ir_mode *mode = get_ir_mode_storage(out_expr->base.type);
5016 ir_node *proj = new_Proj(node, mode, pn);
5017 ir_node *addr = out_addrs[i];
5019 set_value_for_expression_addr(out_expr, proj, addr);
5025 static ir_node *ms_try_statement_to_firm(ms_try_statement_t *statement)
5027 statement_to_firm(statement->try_statement);
5028 source_position_t const *const pos = &statement->base.source_position;
5029 warningf(WARN_OTHER, pos, "structured exception handling ignored");
5033 static ir_node *leave_statement_to_firm(leave_statement_t *statement)
5035 errorf(&statement->base.source_position, "__leave not supported yet");
5040 * Transform a statement.
5042 static ir_node *statement_to_firm(statement_t *const stmt)
5045 assert(!stmt->base.transformed);
5046 stmt->base.transformed = true;
5049 switch (stmt->kind) {
5050 case STATEMENT_ASM: return asm_statement_to_firm( &stmt->asms);
5051 case STATEMENT_CASE_LABEL: return case_label_to_firm( &stmt->case_label);
5052 case STATEMENT_COMPOUND: return compound_statement_to_firm( &stmt->compound);
5053 case STATEMENT_COMPUTED_GOTO: return computed_goto_to_firm( &stmt->computed_goto);
5054 case STATEMENT_DECLARATION: return declaration_statement_to_firm(&stmt->declaration);
5055 case STATEMENT_DO_WHILE: return do_while_statement_to_firm( &stmt->do_while);
5056 case STATEMENT_EMPTY: return NULL; /* nothing */
5057 case STATEMENT_EXPRESSION: return expression_statement_to_firm( &stmt->expression);
5058 case STATEMENT_FOR: return for_statement_to_firm( &stmt->fors);
5059 case STATEMENT_IF: return if_statement_to_firm( &stmt->ifs);
5060 case STATEMENT_LABEL: return label_to_firm( &stmt->label);
5061 case STATEMENT_LEAVE: return leave_statement_to_firm( &stmt->leave);
5062 case STATEMENT_MS_TRY: return ms_try_statement_to_firm( &stmt->ms_try);
5063 case STATEMENT_RETURN: return return_statement_to_firm( &stmt->returns);
5064 case STATEMENT_SWITCH: return switch_statement_to_firm( &stmt->switchs);
5066 case STATEMENT_BREAK: return create_jump_statement(stmt, get_break_label());
5067 case STATEMENT_CONTINUE: return create_jump_statement(stmt, continue_label);
5068 case STATEMENT_GOTO: return create_jump_statement(stmt, get_label_block(stmt->gotos.label));
5070 case STATEMENT_ERROR: panic("error statement found");
5072 panic("statement not implemented");
5075 static int count_local_variables(const entity_t *entity,
5076 const entity_t *const last)
5079 entity_t const *const end = last != NULL ? last->base.next : NULL;
5080 for (; entity != end; entity = entity->base.next) {
5081 if ((entity->kind == ENTITY_VARIABLE || entity->kind == ENTITY_PARAMETER) &&
5082 !var_needs_entity(&entity->variable))
5088 static void count_local_variables_in_stmt(statement_t *stmt, void *const env)
5090 int *const count = env;
5092 switch (stmt->kind) {
5093 case STATEMENT_DECLARATION: {
5094 const declaration_statement_t *const decl_stmt = &stmt->declaration;
5095 *count += count_local_variables(decl_stmt->declarations_begin,
5096 decl_stmt->declarations_end);
5101 *count += count_local_variables(stmt->fors.scope.entities, NULL);
5110 * Return the number of local (alias free) variables used by a function.
5112 static int get_function_n_local_vars(entity_t *entity)
5114 const function_t *function = &entity->function;
5117 /* count parameters */
5118 count += count_local_variables(function->parameters.entities, NULL);
5120 /* count local variables declared in body */
5121 walk_statements(function->body, count_local_variables_in_stmt, &count);
5126 * Build Firm code for the parameters of a function.
5128 static void initialize_function_parameters(entity_t *entity)
5130 assert(entity->kind == ENTITY_FUNCTION);
5131 ir_graph *irg = current_ir_graph;
5132 ir_node *args = get_irg_args(irg);
5134 ir_type *function_irtype;
5136 if (entity->function.need_closure) {
5137 /* add an extra parameter for the static link */
5138 entity->function.static_link = new_r_Proj(args, mode_P_data, 0);
5141 /* Matze: IMO this is wrong, nested functions should have an own
5142 * type and not rely on strange parameters... */
5143 function_irtype = create_method_type(&entity->declaration.type->function, true);
5145 function_irtype = get_ir_type(entity->declaration.type);
5150 entity_t *parameter = entity->function.parameters.entities;
5151 for ( ; parameter != NULL; parameter = parameter->base.next, ++n) {
5152 if (parameter->kind != ENTITY_PARAMETER)
5155 assert(parameter->declaration.kind == DECLARATION_KIND_UNKNOWN);
5156 type_t *type = skip_typeref(parameter->declaration.type);
5158 dbg_info *const dbgi = get_dbg_info(¶meter->base.source_position);
5159 ir_type *const param_irtype = get_method_param_type(function_irtype, n);
5160 if (var_needs_entity(¶meter->variable)) {
5161 ir_type *frame_type = get_irg_frame_type(irg);
5163 = new_d_parameter_entity(frame_type, n, param_irtype, dbgi);
5164 parameter->declaration.kind = DECLARATION_KIND_PARAMETER_ENTITY;
5165 parameter->variable.v.entity = param;
5169 ir_mode *param_mode = get_type_mode(param_irtype);
5171 ir_node *value = new_rd_Proj(dbgi, args, param_mode, pn);
5173 ir_mode *mode = get_ir_mode_storage(type);
5174 value = create_conv(NULL, value, mode);
5176 parameter->declaration.kind = DECLARATION_KIND_PARAMETER;
5177 parameter->variable.v.value_number = next_value_number_function;
5178 set_irg_loc_description(current_ir_graph, next_value_number_function,
5180 ++next_value_number_function;
5182 set_value(parameter->variable.v.value_number, value);
5186 static void add_function_pointer(ir_type *segment, ir_entity *method,
5187 const char *unique_template)
5189 ir_type *method_type = get_entity_type(method);
5190 ir_type *ptr_type = new_type_pointer(method_type);
5192 /* these entities don't really have a name but firm only allows
5194 * Note that we mustn't give these entities a name since for example
5195 * Mach-O doesn't allow them. */
5196 ident *ide = id_unique(unique_template);
5197 ir_entity *ptr = new_entity(segment, ide, ptr_type);
5198 ir_graph *irg = get_const_code_irg();
5199 ir_node *val = new_rd_SymConst_addr_ent(NULL, irg, mode_P_code,
5202 set_entity_ld_ident(ptr, new_id_from_chars("", 0));
5203 set_entity_compiler_generated(ptr, 1);
5204 set_entity_visibility(ptr, ir_visibility_private);
5205 add_entity_linkage(ptr, IR_LINKAGE_CONSTANT|IR_LINKAGE_HIDDEN_USER);
5206 set_atomic_ent_value(ptr, val);
5210 * Generate possible IJmp branches to a given label block.
5212 static void gen_ijmp_branches(ir_node *block)
5215 for (ijmp = ijmp_list; ijmp != NULL; ijmp = get_irn_link(ijmp)) {
5216 add_immBlock_pred(block, ijmp);
5221 * Create code for a function and all inner functions.
5223 * @param entity the function entity
5225 static void create_function(entity_t *entity)
5227 assert(entity->kind == ENTITY_FUNCTION);
5228 ir_entity *function_entity = get_function_entity(entity, current_outer_frame);
5230 if (entity->function.body == NULL)
5233 inner_functions = NULL;
5234 current_trampolines = NULL;
5236 if (entity->declaration.modifiers & DM_CONSTRUCTOR) {
5237 ir_type *segment = get_segment_type(IR_SEGMENT_CONSTRUCTORS);
5238 add_function_pointer(segment, function_entity, "constructor_ptr.%u");
5240 if (entity->declaration.modifiers & DM_DESTRUCTOR) {
5241 ir_type *segment = get_segment_type(IR_SEGMENT_DESTRUCTORS);
5242 add_function_pointer(segment, function_entity, "destructor_ptr.%u");
5245 current_function_entity = entity;
5246 current_function_name = NULL;
5247 current_funcsig = NULL;
5249 assert(all_labels == NULL);
5250 all_labels = NEW_ARR_F(label_t *, 0);
5253 int n_local_vars = get_function_n_local_vars(entity);
5254 ir_graph *irg = new_ir_graph(function_entity, n_local_vars);
5255 current_ir_graph = irg;
5257 ir_graph *old_current_function = current_function;
5258 current_function = irg;
5260 ir_entity *const old_current_vararg_entity = current_vararg_entity;
5261 current_vararg_entity = NULL;
5263 set_irg_fp_model(irg, firm_fp_model);
5264 tarval_enable_fp_ops(1);
5265 set_irn_dbg_info(get_irg_start_block(irg),
5266 get_entity_dbg_info(function_entity));
5268 next_value_number_function = 0;
5269 initialize_function_parameters(entity);
5270 current_static_link = entity->function.static_link;
5272 statement_to_firm(entity->function.body);
5274 ir_node *end_block = get_irg_end_block(irg);
5276 /* do we have a return statement yet? */
5277 if (currently_reachable()) {
5278 type_t *type = skip_typeref(entity->declaration.type);
5279 assert(is_type_function(type));
5280 type_t *const return_type = skip_typeref(type->function.return_type);
5283 if (is_type_void(return_type)) {
5284 ret = new_Return(get_store(), 0, NULL);
5286 ir_mode *const mode = get_ir_mode_storage(return_type);
5289 /* ยง5.1.2.2.3 main implicitly returns 0 */
5290 if (is_main(entity)) {
5291 in[0] = new_Const(get_mode_null(mode));
5293 in[0] = new_Unknown(mode);
5295 ret = new_Return(get_store(), 1, in);
5297 add_immBlock_pred(end_block, ret);
5300 for (int i = ARR_LEN(all_labels) - 1; i >= 0; --i) {
5301 label_t *label = all_labels[i];
5302 if (label->address_taken) {
5303 gen_ijmp_branches(label->block);
5305 mature_immBlock(label->block);
5308 DEL_ARR_F(all_labels);
5311 irg_finalize_cons(irg);
5313 /* finalize the frame type */
5314 ir_type *frame_type = get_irg_frame_type(irg);
5315 int n = get_compound_n_members(frame_type);
5318 for (int i = 0; i < n; ++i) {
5319 ir_entity *member = get_compound_member(frame_type, i);
5320 ir_type *entity_type = get_entity_type(member);
5322 int align = get_type_alignment_bytes(entity_type);
5323 if (align > align_all)
5327 misalign = offset % align;
5329 offset += align - misalign;
5333 set_entity_offset(member, offset);
5334 offset += get_type_size_bytes(entity_type);
5336 set_type_size_bytes(frame_type, offset);
5337 set_type_alignment_bytes(frame_type, align_all);
5339 irg_verify(irg, VERIFY_ENFORCE_SSA);
5340 current_vararg_entity = old_current_vararg_entity;
5341 current_function = old_current_function;
5343 if (current_trampolines != NULL) {
5344 DEL_ARR_F(current_trampolines);
5345 current_trampolines = NULL;
5348 /* create inner functions if any */
5349 entity_t **inner = inner_functions;
5350 if (inner != NULL) {
5351 ir_type *rem_outer_frame = current_outer_frame;
5352 current_outer_frame = get_irg_frame_type(current_ir_graph);
5353 for (int i = ARR_LEN(inner) - 1; i >= 0; --i) {
5354 create_function(inner[i]);
5358 current_outer_frame = rem_outer_frame;
5362 static void scope_to_firm(scope_t *scope)
5364 /* first pass: create declarations */
5365 entity_t *entity = scope->entities;
5366 for ( ; entity != NULL; entity = entity->base.next) {
5367 if (entity->base.symbol == NULL)
5370 if (entity->kind == ENTITY_FUNCTION) {
5371 if (entity->function.btk != BUILTIN_NONE) {
5372 /* builtins have no representation */
5375 (void)get_function_entity(entity, NULL);
5376 } else if (entity->kind == ENTITY_VARIABLE) {
5377 create_global_variable(entity);
5378 } else if (entity->kind == ENTITY_NAMESPACE) {
5379 scope_to_firm(&entity->namespacee.members);
5383 /* second pass: create code/initializers */
5384 entity = scope->entities;
5385 for ( ; entity != NULL; entity = entity->base.next) {
5386 if (entity->base.symbol == NULL)
5389 if (entity->kind == ENTITY_FUNCTION) {
5390 if (entity->function.btk != BUILTIN_NONE) {
5391 /* builtins have no representation */
5394 create_function(entity);
5395 } else if (entity->kind == ENTITY_VARIABLE) {
5396 assert(entity->declaration.kind
5397 == DECLARATION_KIND_GLOBAL_VARIABLE);
5398 current_ir_graph = get_const_code_irg();
5399 create_variable_initializer(entity);
5404 void init_ast2firm(void)
5406 obstack_init(&asm_obst);
5407 init_atomic_modes();
5409 ir_set_debug_retrieve(dbg_retrieve);
5410 ir_set_type_debug_retrieve(dbg_print_type_dbg_info);
5412 /* create idents for all known runtime functions */
5413 for (size_t i = 0; i < lengthof(rts_data); ++i) {
5414 rts_idents[i] = new_id_from_str(rts_data[i].name);
5417 entitymap_init(&entitymap);
5420 static void init_ir_types(void)
5422 static int ir_types_initialized = 0;
5423 if (ir_types_initialized)
5425 ir_types_initialized = 1;
5427 ir_type_char = get_ir_type(type_char);
5428 ir_type_wchar_t = get_ir_type(type_wchar_t);
5430 be_params = be_get_backend_param();
5431 mode_float_arithmetic = be_params->mode_float_arithmetic;
5433 stack_param_align = be_params->stack_param_align;
5436 void exit_ast2firm(void)
5438 entitymap_destroy(&entitymap);
5439 obstack_free(&asm_obst, NULL);
5442 static void global_asm_to_firm(statement_t *s)
5444 for (; s != NULL; s = s->base.next) {
5445 assert(s->kind == STATEMENT_ASM);
5447 char const *const text = s->asms.asm_text.begin;
5448 size_t const size = s->asms.asm_text.size;
5449 ident *const id = new_id_from_chars(text, size);
5454 static const char *get_cwd(void)
5456 static char buf[1024];
5457 if (buf[0] == '\0') {
5458 return getcwd(buf, sizeof(buf));
5463 void translation_unit_to_firm(translation_unit_t *unit)
5465 if (c_mode & _CXX) {
5466 be_dwarf_set_source_language(DW_LANG_C_plus_plus);
5467 } else if (c_mode & _C99) {
5468 be_dwarf_set_source_language(DW_LANG_C99);
5469 } else if (c_mode & _C89) {
5470 be_dwarf_set_source_language(DW_LANG_C89);
5472 be_dwarf_set_source_language(DW_LANG_C);
5474 const char *cwd = get_cwd();
5476 be_dwarf_set_compilation_directory(cwd);
5479 /* initialize firm arithmetic */
5480 tarval_set_integer_overflow_mode(TV_OVERFLOW_WRAP);
5481 ir_set_uninitialized_local_variable_func(uninitialized_local_var);
5483 /* just to be sure */
5484 continue_label = NULL;
5486 current_switch = NULL;
5487 current_translation_unit = unit;
5491 scope_to_firm(&unit->scope);
5492 global_asm_to_firm(unit->global_asm);
5494 current_ir_graph = NULL;
5495 current_translation_unit = NULL;