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 set_entity_additional_properties(irentity, mtp_property_pure);
905 if (modifiers & DM_CONST) {
906 add_entity_additional_properties(irentity, mtp_property_const);
909 if ((modifiers & DM_USED) && declaration_is_definition(entity)) {
910 add_entity_linkage(irentity, IR_LINKAGE_HIDDEN_USER);
912 if ((modifiers & DM_WEAK) && declaration_is_definition(entity)
913 && entity->declaration.storage_class != STORAGE_CLASS_EXTERN) {
914 add_entity_linkage(irentity, IR_LINKAGE_WEAK);
918 static bool is_main(entity_t *entity)
920 static symbol_t *sym_main = NULL;
921 if (sym_main == NULL) {
922 sym_main = symbol_table_insert("main");
925 if (entity->base.symbol != sym_main)
927 /* must be in outermost scope */
928 if (entity->base.parent_scope != ¤t_translation_unit->scope)
935 * Creates an entity representing a function.
937 * @param entity the function declaration/definition
938 * @param owner_type the owner type of this function, NULL
939 * for global functions
941 static ir_entity *get_function_entity(entity_t *entity, ir_type *owner_type)
943 assert(entity->kind == ENTITY_FUNCTION);
944 if (entity->function.irentity != NULL)
945 return entity->function.irentity;
947 switch (entity->function.btk) {
950 case BUILTIN_LIBC_CHECK:
956 symbol_t *symbol = entity->base.symbol;
957 ident *id = new_id_from_str(symbol->string);
959 /* already an entity defined? */
960 ir_entity *irentity = entitymap_get(&entitymap, symbol);
961 bool const has_body = entity->function.body != NULL;
962 if (irentity != NULL) {
966 ir_type *ir_type_method;
967 if (entity->function.need_closure)
968 ir_type_method = create_method_type(&entity->declaration.type->function, true);
970 ir_type_method = get_ir_type(entity->declaration.type);
972 bool nested_function = false;
973 if (owner_type == NULL)
974 owner_type = get_glob_type();
976 nested_function = true;
978 dbg_info *const dbgi = get_dbg_info(&entity->base.source_position);
979 irentity = new_d_entity(owner_type, id, ir_type_method, dbgi);
983 ld_id = id_unique("inner.%u");
985 ld_id = create_ld_ident(entity);
986 set_entity_ld_ident(irentity, ld_id);
988 handle_decl_modifiers(irentity, entity);
990 if (! nested_function) {
991 storage_class_tag_t const storage_class
992 = (storage_class_tag_t) entity->declaration.storage_class;
993 if (storage_class == STORAGE_CLASS_STATIC) {
994 set_entity_visibility(irentity, ir_visibility_local);
996 set_entity_visibility(irentity, ir_visibility_external);
999 bool const is_inline = entity->function.is_inline;
1000 if (is_inline && has_body) {
1001 if (((c_mode & _C99) && storage_class == STORAGE_CLASS_NONE)
1002 || ((c_mode & _C99) == 0
1003 && storage_class == STORAGE_CLASS_EXTERN)) {
1004 add_entity_linkage(irentity, IR_LINKAGE_NO_CODEGEN);
1008 /* nested functions are always local */
1009 set_entity_visibility(irentity, ir_visibility_local);
1012 /* We should check for file scope here, but as long as we compile C only
1013 this is not needed. */
1014 if (!freestanding && !has_body) {
1015 /* check for a known runtime function */
1016 for (size_t i = 0; i < lengthof(rts_data); ++i) {
1017 if (id != rts_idents[i])
1020 function_type_t *function_type
1021 = &entity->declaration.type->function;
1022 /* rts_entities code can't handle a "wrong" number of parameters */
1023 if (function_type->unspecified_parameters)
1026 /* check number of parameters */
1027 int n_params = count_parameters(function_type);
1028 if (n_params != rts_data[i].n_params)
1031 type_t *return_type = skip_typeref(function_type->return_type);
1032 int n_res = is_type_void(return_type) ? 0 : 1;
1033 if (n_res != rts_data[i].n_res)
1036 /* ignore those rts functions not necessary needed for current mode */
1037 if ((c_mode & rts_data[i].flags) == 0)
1039 assert(rts_entities[rts_data[i].id] == NULL);
1040 rts_entities[rts_data[i].id] = irentity;
1044 entitymap_insert(&entitymap, symbol, irentity);
1047 entity->declaration.kind = DECLARATION_KIND_FUNCTION;
1048 entity->function.irentity = irentity;
1054 * Creates a SymConst for a given entity.
1056 * @param dbgi debug info
1057 * @param entity the entity
1059 static ir_node *create_symconst(dbg_info *dbgi, ir_entity *entity)
1061 assert(entity != NULL);
1062 union symconst_symbol sym;
1063 sym.entity_p = entity;
1064 return new_d_SymConst(dbgi, mode_P, sym, symconst_addr_ent);
1067 static ir_node *create_Const_from_bool(ir_mode *const mode, bool const v)
1069 return new_Const((v ? get_mode_one : get_mode_null)(mode));
1072 static ir_node *create_conv_from_b(dbg_info *dbgi, ir_node *value,
1075 if (is_Const(value)) {
1076 return create_Const_from_bool(dest_mode, !is_Const_null(value));
1079 ir_node *cond = new_d_Cond(dbgi, value);
1080 ir_node *proj_true = new_Proj(cond, mode_X, pn_Cond_true);
1081 ir_node *proj_false = new_Proj(cond, mode_X, pn_Cond_false);
1082 ir_node *tblock = new_Block(1, &proj_true);
1083 ir_node *fblock = new_Block(1, &proj_false);
1084 set_cur_block(tblock);
1085 ir_node *const1 = new_Const(get_mode_one(dest_mode));
1086 ir_node *tjump = new_Jmp();
1087 set_cur_block(fblock);
1088 ir_node *const0 = new_Const(get_mode_null(dest_mode));
1089 ir_node *fjump = new_Jmp();
1091 ir_node *in[2] = { tjump, fjump };
1092 ir_node *mergeblock = new_Block(2, in);
1093 set_cur_block(mergeblock);
1094 ir_node *phi_in[2] = { const1, const0 };
1095 ir_node *phi = new_Phi(2, phi_in, dest_mode);
1099 static ir_node *create_conv(dbg_info *dbgi, ir_node *value, ir_mode *dest_mode)
1101 ir_mode *value_mode = get_irn_mode(value);
1103 if (value_mode == dest_mode)
1106 if (dest_mode == mode_b) {
1107 ir_node *zero = new_Const(get_mode_null(value_mode));
1108 ir_node *cmp = new_d_Cmp(dbgi, value, zero, ir_relation_unordered_less_greater);
1110 } else if (value_mode == mode_b) {
1111 return create_conv_from_b(dbgi, value, dest_mode);
1114 return new_d_Conv(dbgi, value, dest_mode);
1118 * Creates a SymConst node representing a string constant.
1120 * @param src_pos the source position of the string constant
1121 * @param id_prefix a prefix for the name of the generated string constant
1122 * @param value the value of the string constant
1124 static ir_node *string_to_firm(source_position_t const *const src_pos, char const *const id_prefix, string_t const *const value)
1126 size_t const slen = get_string_len(value) + 1;
1127 ir_initializer_t *const initializer = create_initializer_compound(slen);
1128 ir_type * elem_type;
1129 switch (value->encoding) {
1130 case STRING_ENCODING_CHAR: {
1131 elem_type = ir_type_char;
1133 ir_mode *const mode = get_type_mode(elem_type);
1134 char const *p = value->begin;
1135 for (size_t i = 0; i < slen; ++i) {
1136 ir_tarval *tv = new_tarval_from_long(*p++, mode);
1137 ir_initializer_t *val = create_initializer_tarval(tv);
1138 set_initializer_compound_value(initializer, i, val);
1143 case STRING_ENCODING_WIDE: {
1144 elem_type = ir_type_wchar_t;
1146 ir_mode *const mode = get_type_mode(elem_type);
1147 char const *p = value->begin;
1148 for (size_t i = 0; i < slen; ++i) {
1149 assert(p <= value->begin + value->size);
1150 utf32 v = read_utf8_char(&p);
1151 ir_tarval *tv = new_tarval_from_long(v, mode);
1152 ir_initializer_t *val = create_initializer_tarval(tv);
1153 set_initializer_compound_value(initializer, i, val);
1158 panic("invalid string encoding");
1161 ir_type *const type = new_type_array(1, elem_type);
1162 set_array_bounds_int(type, 0, 0, slen);
1163 set_type_size_bytes( type, slen * get_type_size_bytes(elem_type));
1164 set_type_state( type, layout_fixed);
1166 ir_type *const global_type = get_glob_type();
1167 ident *const id = id_unique(id_prefix);
1168 dbg_info *const dbgi = get_dbg_info(src_pos);
1169 ir_entity *const entity = new_d_entity(global_type, id, type, dbgi);
1170 set_entity_ld_ident( entity, id);
1171 set_entity_visibility( entity, ir_visibility_private);
1172 add_entity_linkage( entity, IR_LINKAGE_CONSTANT);
1173 set_entity_initializer(entity, initializer);
1175 return create_symconst(dbgi, entity);
1178 static bool try_create_integer(literal_expression_t *literal, type_t *type)
1180 assert(type->kind == TYPE_ATOMIC);
1181 atomic_type_kind_t akind = type->atomic.akind;
1183 ir_mode *const mode = atomic_modes[akind];
1184 char const *const str = literal->value.begin;
1185 ir_tarval *const tv = new_tarval_from_str(str, literal->suffix - str, mode);
1186 if (tv == tarval_bad)
1189 literal->base.type = type;
1190 literal->target_value = tv;
1194 void determine_literal_type(literal_expression_t *const literal)
1196 assert(literal->base.kind == EXPR_LITERAL_INTEGER);
1198 /* -1: signed only, 0: any, 1: unsigned only */
1200 !is_type_signed(literal->base.type) ? 1 :
1201 literal->value.begin[0] == '0' ? 0 :
1202 -1; /* Decimal literals only try signed types. */
1204 tarval_int_overflow_mode_t old_mode = tarval_get_integer_overflow_mode();
1205 tarval_set_integer_overflow_mode(TV_OVERFLOW_BAD);
1207 if (try_create_integer(literal, literal->base.type))
1210 /* now try if the constant is small enough for some types */
1211 if (sign >= 0 && try_create_integer(literal, type_unsigned_int))
1213 if (sign <= 0 && try_create_integer(literal, type_long))
1215 if (sign >= 0 && try_create_integer(literal, type_unsigned_long))
1217 /* last try? then we should not report tarval_bad */
1219 tarval_set_integer_overflow_mode(TV_OVERFLOW_WRAP);
1220 if (sign <= 0 && try_create_integer(literal, type_long_long))
1225 tarval_set_integer_overflow_mode(TV_OVERFLOW_WRAP);
1226 bool res = try_create_integer(literal, type_unsigned_long_long);
1228 panic("internal error when parsing number literal");
1231 tarval_set_integer_overflow_mode(old_mode);
1235 * Creates a Const node representing a constant.
1237 static ir_node *literal_to_firm(const literal_expression_t *literal)
1239 type_t *type = skip_typeref(literal->base.type);
1240 ir_mode *mode = get_ir_mode_storage(type);
1241 const char *string = literal->value.begin;
1242 size_t size = literal->value.size;
1245 switch (literal->base.kind) {
1246 case EXPR_LITERAL_INTEGER:
1247 assert(literal->target_value != NULL);
1248 tv = literal->target_value;
1251 case EXPR_LITERAL_FLOATINGPOINT:
1252 tv = new_tarval_from_str(string, size, mode);
1255 case EXPR_LITERAL_BOOLEAN:
1256 if (string[0] == 't') {
1257 tv = get_mode_one(mode);
1259 assert(string[0] == 'f');
1260 case EXPR_LITERAL_MS_NOOP:
1261 tv = get_mode_null(mode);
1266 panic("Invalid literal kind found");
1269 dbg_info *dbgi = get_dbg_info(&literal->base.source_position);
1270 ir_node *res = new_d_Const(dbgi, tv);
1271 ir_mode *mode_arith = get_ir_mode_arithmetic(type);
1272 return create_conv(dbgi, res, mode_arith);
1276 * Creates a Const node representing a character constant.
1278 static ir_node *char_literal_to_firm(string_literal_expression_t const *literal)
1280 type_t *type = skip_typeref(literal->base.type);
1281 ir_mode *mode = get_ir_mode_storage(type);
1282 const char *string = literal->value.begin;
1283 size_t size = literal->value.size;
1286 switch (literal->value.encoding) {
1287 case STRING_ENCODING_WIDE: {
1288 utf32 v = read_utf8_char(&string);
1290 size_t len = snprintf(buf, sizeof(buf), UTF32_PRINTF_FORMAT, v);
1292 tv = new_tarval_from_str(buf, len, mode);
1296 case STRING_ENCODING_CHAR: {
1299 = get_atomic_type_flags(ATOMIC_TYPE_CHAR) & ATOMIC_TYPE_FLAG_SIGNED;
1300 if (size == 1 && char_is_signed) {
1301 v = (signed char)string[0];
1304 for (size_t i = 0; i < size; ++i) {
1305 v = (v << 8) | ((unsigned char)string[i]);
1309 size_t len = snprintf(buf, sizeof(buf), "%lld", v);
1311 tv = new_tarval_from_str(buf, len, mode);
1316 panic("Invalid literal kind found");
1319 dbg_info *dbgi = get_dbg_info(&literal->base.source_position);
1320 ir_node *res = new_d_Const(dbgi, tv);
1321 ir_mode *mode_arith = get_ir_mode_arithmetic(type);
1322 return create_conv(dbgi, res, mode_arith);
1326 * Allocate an area of size bytes aligned at alignment
1329 static ir_entity *alloc_trampoline(ir_type *frame_type, int size, unsigned alignment)
1331 static unsigned area_cnt = 0;
1334 ir_type *tp = new_type_array(1, ir_type_char);
1335 set_array_bounds_int(tp, 0, 0, size);
1336 set_type_alignment_bytes(tp, alignment);
1338 snprintf(buf, sizeof(buf), "trampolin%u", area_cnt++);
1339 ident *name = new_id_from_str(buf);
1340 ir_entity *area = new_entity(frame_type, name, tp);
1342 /* mark this entity as compiler generated */
1343 set_entity_compiler_generated(area, 1);
1348 * Return a node representing a trampoline region
1349 * for a given function entity.
1351 * @param dbgi debug info
1352 * @param entity the function entity
1354 static ir_node *get_trampoline_region(dbg_info *dbgi, ir_entity *entity)
1356 ir_entity *region = NULL;
1359 if (current_trampolines != NULL) {
1360 for (i = ARR_LEN(current_trampolines) - 1; i >= 0; --i) {
1361 if (current_trampolines[i].function == entity) {
1362 region = current_trampolines[i].region;
1367 current_trampolines = NEW_ARR_F(trampoline_region, 0);
1369 ir_graph *irg = current_ir_graph;
1370 if (region == NULL) {
1371 /* create a new region */
1372 ir_type *frame_tp = get_irg_frame_type(irg);
1373 trampoline_region reg;
1374 reg.function = entity;
1376 reg.region = alloc_trampoline(frame_tp,
1377 be_params->trampoline_size,
1378 be_params->trampoline_align);
1379 ARR_APP1(trampoline_region, current_trampolines, reg);
1380 region = reg.region;
1382 return new_d_simpleSel(dbgi, get_irg_no_mem(irg), get_irg_frame(irg),
1387 * Creates a trampoline for a function represented by an entity.
1389 * @param dbgi debug info
1390 * @param mode the (reference) mode for the function address
1391 * @param entity the function entity
1393 static ir_node *create_trampoline(dbg_info *dbgi, ir_mode *mode,
1396 assert(entity != NULL);
1398 in[0] = get_trampoline_region(dbgi, entity);
1399 in[1] = create_symconst(dbgi, entity);
1400 in[2] = get_irg_frame(current_ir_graph);
1402 ir_node *irn = new_d_Builtin(dbgi, get_store(), 3, in, ir_bk_inner_trampoline, get_unknown_type());
1403 set_store(new_Proj(irn, mode_M, pn_Builtin_M));
1404 return new_Proj(irn, mode, pn_Builtin_max+1);
1408 * Dereference an address.
1410 * @param dbgi debug info
1411 * @param type the type of the dereferenced result (the points_to type)
1412 * @param addr the address to dereference
1414 static ir_node *deref_address(dbg_info *const dbgi, type_t *const type,
1415 ir_node *const addr)
1417 type_t *skipped = skip_typeref(type);
1418 if (is_type_incomplete(skipped))
1421 ir_type *irtype = get_ir_type(skipped);
1422 if (is_compound_type(irtype)
1423 || is_Method_type(irtype)
1424 || is_Array_type(irtype)) {
1428 ir_cons_flags flags = skipped->base.qualifiers & TYPE_QUALIFIER_VOLATILE
1429 ? cons_volatile : cons_none;
1430 ir_mode *const mode = get_type_mode(irtype);
1431 ir_node *const memory = get_store();
1432 ir_node *const load = new_d_Load(dbgi, memory, addr, mode, flags);
1433 ir_node *const load_mem = new_d_Proj(dbgi, load, mode_M, pn_Load_M);
1434 ir_node *const load_res = new_d_Proj(dbgi, load, mode, pn_Load_res);
1436 set_store(load_mem);
1438 ir_mode *const mode_arithmetic = get_ir_mode_arithmetic(skipped);
1439 return create_conv(dbgi, load_res, mode_arithmetic);
1443 * Returns the correct base address depending on whether it is a parameter or a
1444 * normal local variable.
1446 static ir_node *get_local_frame(ir_entity *const ent)
1448 ir_graph *const irg = current_ir_graph;
1449 const ir_type *const owner = get_entity_owner(ent);
1450 if (owner == current_outer_frame) {
1451 assert(current_static_link != NULL);
1452 return current_static_link;
1454 return get_irg_frame(irg);
1459 * Keep all memory edges of the given block.
1461 static void keep_all_memory(ir_node *block)
1463 ir_node *old = get_cur_block();
1465 set_cur_block(block);
1466 keep_alive(get_store());
1467 /* TODO: keep all memory edges from restricted pointers */
1471 static ir_node *enum_constant_to_firm(reference_expression_t const *const ref)
1473 entity_t *entity = ref->entity;
1474 if (entity->enum_value.tv == NULL) {
1475 type_t *type = skip_typeref(entity->enum_value.enum_type);
1476 assert(type->kind == TYPE_ENUM);
1477 determine_enum_values(&type->enumt);
1480 return new_Const(entity->enum_value.tv);
1483 static ir_node *reference_addr(const reference_expression_t *ref)
1485 dbg_info *dbgi = get_dbg_info(&ref->base.source_position);
1486 entity_t *entity = ref->entity;
1487 assert(is_declaration(entity));
1489 if (entity->kind == ENTITY_FUNCTION
1490 && entity->function.btk != BUILTIN_NONE) {
1491 ir_entity *irentity = get_function_entity(entity, NULL);
1492 /* for gcc compatibility we have to produce (dummy) addresses for some
1493 * builtins which don't have entities */
1494 if (irentity == NULL) {
1495 source_position_t const *const pos = &ref->base.source_position;
1496 warningf(WARN_OTHER, pos, "taking address of builtin '%N'", ref->entity);
1498 /* simply create a NULL pointer */
1499 ir_mode *mode = get_ir_mode_arithmetic(type_void_ptr);
1500 ir_node *res = new_Const(get_mode_null(mode));
1506 switch((declaration_kind_t) entity->declaration.kind) {
1507 case DECLARATION_KIND_UNKNOWN:
1509 case DECLARATION_KIND_PARAMETER:
1510 case DECLARATION_KIND_LOCAL_VARIABLE:
1511 /* you can store to a local variable (so we don't panic but return NULL
1512 * as an indicator for no real address) */
1514 case DECLARATION_KIND_GLOBAL_VARIABLE: {
1515 ir_node *const addr = create_symconst(dbgi, entity->variable.v.entity);
1519 case DECLARATION_KIND_LOCAL_VARIABLE_ENTITY:
1520 case DECLARATION_KIND_PARAMETER_ENTITY: {
1521 ir_entity *irentity = entity->variable.v.entity;
1522 ir_node *frame = get_local_frame(irentity);
1523 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, irentity);
1527 case DECLARATION_KIND_VARIABLE_LENGTH_ARRAY:
1528 return entity->variable.v.vla_base;
1530 case DECLARATION_KIND_FUNCTION: {
1531 return create_symconst(dbgi, entity->function.irentity);
1534 case DECLARATION_KIND_INNER_FUNCTION: {
1535 type_t *const type = skip_typeref(entity->declaration.type);
1536 ir_mode *const mode = get_ir_mode_storage(type);
1537 if (!entity->function.goto_to_outer && !entity->function.need_closure) {
1538 /* inner function not using the closure */
1539 return create_symconst(dbgi, entity->function.irentity);
1541 /* need trampoline here */
1542 return create_trampoline(dbgi, mode, entity->function.irentity);
1546 case DECLARATION_KIND_COMPOUND_MEMBER:
1547 panic("not implemented reference type");
1550 panic("reference to declaration with unknown type found");
1553 static ir_node *reference_expression_to_firm(const reference_expression_t *ref)
1555 dbg_info *const dbgi = get_dbg_info(&ref->base.source_position);
1556 entity_t *const entity = ref->entity;
1557 assert(is_declaration(entity));
1559 switch ((declaration_kind_t)entity->declaration.kind) {
1560 case DECLARATION_KIND_LOCAL_VARIABLE:
1561 case DECLARATION_KIND_PARAMETER: {
1562 type_t *const type = skip_typeref(entity->declaration.type);
1563 ir_mode *const mode = get_ir_mode_storage(type);
1564 ir_node *const value = get_value(entity->variable.v.value_number, mode);
1565 return create_conv(dbgi, value, get_ir_mode_arithmetic(type));
1569 ir_node *const addr = reference_addr(ref);
1570 return deref_address(dbgi, entity->declaration.type, addr);
1576 * Transform calls to builtin functions.
1578 static ir_node *process_builtin_call(const call_expression_t *call)
1580 dbg_info *dbgi = get_dbg_info(&call->base.source_position);
1582 assert(call->function->kind == EXPR_REFERENCE);
1583 reference_expression_t *builtin = &call->function->reference;
1585 type_t *expr_type = skip_typeref(builtin->base.type);
1586 assert(is_type_pointer(expr_type));
1588 type_t *function_type = skip_typeref(expr_type->pointer.points_to);
1590 switch (builtin->entity->function.btk) {
1593 case BUILTIN_ALLOCA: {
1594 expression_t *argument = call->arguments->expression;
1595 ir_node *size = expression_to_firm(argument);
1597 ir_node *store = get_store();
1598 ir_node *alloca = new_d_Alloc(dbgi, store, size, get_unknown_type(),
1600 ir_node *proj_m = new_Proj(alloca, mode_M, pn_Alloc_M);
1602 ir_node *res = new_Proj(alloca, mode_P_data, pn_Alloc_res);
1607 type_t *type = function_type->function.return_type;
1608 ir_mode *mode = get_ir_mode_arithmetic(type);
1609 ir_tarval *tv = get_mode_infinite(mode);
1610 ir_node *res = new_d_Const(dbgi, tv);
1614 /* Ignore string for now... */
1615 assert(is_type_function(function_type));
1616 type_t *type = function_type->function.return_type;
1617 ir_mode *mode = get_ir_mode_arithmetic(type);
1618 ir_tarval *tv = get_mode_NAN(mode);
1619 ir_node *res = new_d_Const(dbgi, tv);
1622 case BUILTIN_EXPECT: {
1623 expression_t *argument = call->arguments->expression;
1624 return _expression_to_firm(argument);
1626 case BUILTIN_VA_END:
1627 /* evaluate the argument of va_end for its side effects */
1628 _expression_to_firm(call->arguments->expression);
1630 case BUILTIN_OBJECT_SIZE: {
1631 /* determine value of "type" */
1632 expression_t *type_expression = call->arguments->next->expression;
1633 long type_val = fold_constant_to_int(type_expression);
1634 type_t *type = function_type->function.return_type;
1635 ir_mode *mode = get_ir_mode_arithmetic(type);
1636 /* just produce a "I don't know" result */
1637 ir_tarval *result = type_val & 2 ? get_mode_null(mode) :
1638 get_mode_minus_one(mode);
1640 return new_d_Const(dbgi, result);
1642 case BUILTIN_ROTL: {
1643 ir_node *val = expression_to_firm(call->arguments->expression);
1644 ir_node *shf = expression_to_firm(call->arguments->next->expression);
1645 ir_mode *mode = get_irn_mode(val);
1646 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
1647 return new_d_Rotl(dbgi, val, create_conv(dbgi, shf, mode_uint), mode);
1649 case BUILTIN_ROTR: {
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 ir_node *c = new_Const_long(mode_uint, get_mode_size_bits(mode));
1655 ir_node *sub = new_d_Sub(dbgi, c, create_conv(dbgi, shf, mode_uint), mode_uint);
1656 return new_d_Rotl(dbgi, val, sub, mode);
1661 case BUILTIN_LIBC_CHECK:
1662 panic("builtin did not produce an entity");
1664 panic("invalid builtin found");
1668 * Transform a call expression.
1669 * Handles some special cases, like alloca() calls, which must be resolved
1670 * BEFORE the inlines runs. Inlining routines calling alloca() is dangerous,
1671 * 176.gcc for instance might allocate 2GB instead of 256 MB if alloca is not
1674 static ir_node *call_expression_to_firm(const call_expression_t *const call)
1676 dbg_info *const dbgi = get_dbg_info(&call->base.source_position);
1677 assert(currently_reachable());
1679 expression_t *function = call->function;
1680 ir_node *callee = NULL;
1681 bool firm_builtin = false;
1682 ir_builtin_kind firm_builtin_kind = ir_bk_trap;
1683 if (function->kind == EXPR_REFERENCE) {
1684 const reference_expression_t *ref = &function->reference;
1685 entity_t *entity = ref->entity;
1687 if (entity->kind == ENTITY_FUNCTION) {
1688 builtin_kind_t builtin = entity->function.btk;
1689 if (builtin == BUILTIN_FIRM) {
1690 firm_builtin = true;
1691 firm_builtin_kind = entity->function.b.firm_builtin_kind;
1692 } else if (builtin != BUILTIN_NONE && builtin != BUILTIN_LIBC
1693 && builtin != BUILTIN_LIBC_CHECK) {
1694 return process_builtin_call(call);
1699 callee = expression_to_firm(function);
1701 type_t *type = skip_typeref(function->base.type);
1702 assert(is_type_pointer(type));
1703 pointer_type_t *pointer_type = &type->pointer;
1704 type_t *points_to = skip_typeref(pointer_type->points_to);
1705 assert(is_type_function(points_to));
1706 function_type_t *function_type = &points_to->function;
1708 int n_parameters = 0;
1709 ir_type *ir_method_type = get_ir_type((type_t*) function_type);
1710 ir_type *new_method_type = NULL;
1711 if (function_type->variadic || function_type->unspecified_parameters) {
1712 const call_argument_t *argument = call->arguments;
1713 for ( ; argument != NULL; argument = argument->next) {
1717 /* we need to construct a new method type matching the call
1719 type_dbg_info *tdbgi = get_type_dbg_info_((const type_t*) function_type);
1720 int n_res = get_method_n_ress(ir_method_type);
1721 new_method_type = new_d_type_method(n_parameters, n_res, tdbgi);
1722 set_method_calling_convention(new_method_type,
1723 get_method_calling_convention(ir_method_type));
1724 set_method_additional_properties(new_method_type,
1725 get_method_additional_properties(ir_method_type));
1726 set_method_variadicity(new_method_type,
1727 get_method_variadicity(ir_method_type));
1729 for (int i = 0; i < n_res; ++i) {
1730 set_method_res_type(new_method_type, i,
1731 get_method_res_type(ir_method_type, i));
1733 argument = call->arguments;
1734 for (int i = 0; i < n_parameters; ++i, argument = argument->next) {
1735 expression_t *expression = argument->expression;
1736 ir_type *irtype = get_ir_type(expression->base.type);
1737 set_method_param_type(new_method_type, i, irtype);
1739 ir_method_type = new_method_type;
1741 n_parameters = get_method_n_params(ir_method_type);
1744 ir_node *in[n_parameters];
1746 const call_argument_t *argument = call->arguments;
1747 for (int n = 0; n < n_parameters; ++n) {
1748 expression_t *expression = argument->expression;
1749 ir_node *arg_node = expression_to_firm(expression);
1751 type_t *arg_type = skip_typeref(expression->base.type);
1752 if (!is_type_compound(arg_type)) {
1753 ir_mode *const mode = get_ir_mode_storage(arg_type);
1754 arg_node = create_conv(dbgi, arg_node, mode);
1759 argument = argument->next;
1763 if (function_type->modifiers & DM_CONST) {
1764 store = get_irg_no_mem(current_ir_graph);
1766 store = get_store();
1770 type_t *return_type = skip_typeref(function_type->return_type);
1771 ir_node *result = NULL;
1773 node = new_d_Builtin(dbgi, store, n_parameters, in, firm_builtin_kind,
1775 if (! (function_type->modifiers & DM_CONST)) {
1776 ir_node *mem = new_Proj(node, mode_M, pn_Builtin_M);
1780 if (!is_type_void(return_type)) {
1781 assert(is_type_scalar(return_type));
1782 ir_mode *mode = get_ir_mode_storage(return_type);
1783 result = new_Proj(node, mode, pn_Builtin_max+1);
1784 ir_mode *mode_arith = get_ir_mode_arithmetic(return_type);
1785 result = create_conv(NULL, result, mode_arith);
1788 node = new_d_Call(dbgi, store, callee, n_parameters, in, ir_method_type);
1789 if (! (function_type->modifiers & DM_CONST)) {
1790 ir_node *mem = new_Proj(node, mode_M, pn_Call_M);
1794 if (!is_type_void(return_type)) {
1795 ir_node *const resproj = new_Proj(node, mode_T, pn_Call_T_result);
1796 ir_mode *const mode = get_ir_mode_storage(return_type);
1797 result = new_Proj(resproj, mode, 0);
1798 ir_mode *const mode_arith = get_ir_mode_arithmetic(return_type);
1799 result = create_conv(NULL, result, mode_arith);
1803 if (function_type->modifiers & DM_NORETURN) {
1804 /* A dead end: Keep the Call and the Block. Also place all further
1805 * nodes into a new and unreachable block. */
1807 keep_alive(get_cur_block());
1808 ir_node *block = new_Block(0, NULL);
1809 set_cur_block(block);
1815 static ir_node *statement_to_firm(statement_t *statement);
1816 static ir_node *compound_statement_to_firm(compound_statement_t *compound);
1818 static ir_node *expression_to_addr(const expression_t *expression);
1819 static ir_node *create_condition_evaluation(const expression_t *expression,
1820 ir_node *true_block,
1821 ir_node *false_block);
1823 static void assign_value(dbg_info *dbgi, ir_node *addr, type_t *type,
1826 if (!is_type_compound(type)) {
1827 ir_mode *mode = get_ir_mode_storage(type);
1828 value = create_conv(dbgi, value, mode);
1831 ir_node *memory = get_store();
1833 if (is_type_scalar(type)) {
1834 ir_cons_flags flags = type->base.qualifiers & TYPE_QUALIFIER_VOLATILE
1835 ? cons_volatile : cons_none;
1836 ir_node *store = new_d_Store(dbgi, memory, addr, value, flags);
1837 ir_node *store_mem = new_d_Proj(dbgi, store, mode_M, pn_Store_M);
1838 set_store(store_mem);
1840 ir_type *irtype = get_ir_type(type);
1841 ir_node *copyb = new_d_CopyB(dbgi, memory, addr, value, irtype);
1842 ir_node *copyb_mem = new_Proj(copyb, mode_M, pn_CopyB_M);
1843 set_store(copyb_mem);
1847 static ir_tarval *create_bitfield_mask(ir_mode *mode, int offset, int size)
1849 ir_tarval *all_one = get_mode_all_one(mode);
1850 int mode_size = get_mode_size_bits(mode);
1851 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
1853 assert(offset >= 0);
1855 assert(offset + size <= mode_size);
1856 if (size == mode_size) {
1860 long shiftr = get_mode_size_bits(mode) - size;
1861 long shiftl = offset;
1862 ir_tarval *tv_shiftr = new_tarval_from_long(shiftr, mode_uint);
1863 ir_tarval *tv_shiftl = new_tarval_from_long(shiftl, mode_uint);
1864 ir_tarval *mask0 = tarval_shr(all_one, tv_shiftr);
1865 ir_tarval *mask1 = tarval_shl(mask0, tv_shiftl);
1870 static ir_node *bitfield_store_to_firm(dbg_info *dbgi,
1871 ir_entity *entity, ir_node *addr, ir_node *value, bool set_volatile,
1874 ir_type *entity_type = get_entity_type(entity);
1875 ir_type *base_type = get_primitive_base_type(entity_type);
1876 ir_mode *mode = get_type_mode(base_type);
1877 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
1879 value = create_conv(dbgi, value, mode);
1881 /* kill upper bits of value and shift to right position */
1882 unsigned bitoffset = get_entity_offset_bits_remainder(entity);
1883 unsigned bitsize = get_mode_size_bits(get_type_mode(entity_type));
1884 unsigned base_bits = get_mode_size_bits(mode);
1885 unsigned shiftwidth = base_bits - bitsize;
1887 ir_node *shiftcount = new_Const_long(mode_uint, shiftwidth);
1888 ir_node *shiftl = new_d_Shl(dbgi, value, shiftcount, mode);
1890 unsigned shrwidth = base_bits - bitsize - bitoffset;
1891 ir_node *shrconst = new_Const_long(mode_uint, shrwidth);
1892 ir_node *shiftr = new_d_Shr(dbgi, shiftl, shrconst, mode);
1894 /* load current value */
1895 ir_node *mem = get_store();
1896 ir_node *load = new_d_Load(dbgi, mem, addr, mode,
1897 set_volatile ? cons_volatile : cons_none);
1898 ir_node *load_mem = new_d_Proj(dbgi, load, mode_M, pn_Load_M);
1899 ir_node *load_res = new_d_Proj(dbgi, load, mode, pn_Load_res);
1900 ir_tarval *shift_mask = create_bitfield_mask(mode, bitoffset, bitsize);
1901 ir_tarval *inv_mask = tarval_not(shift_mask);
1902 ir_node *inv_mask_node = new_d_Const(dbgi, inv_mask);
1903 ir_node *load_res_masked = new_d_And(dbgi, load_res, inv_mask_node, mode);
1905 /* construct new value and store */
1906 ir_node *new_val = new_d_Or(dbgi, load_res_masked, shiftr, mode);
1907 ir_node *store = new_d_Store(dbgi, load_mem, addr, new_val,
1908 set_volatile ? cons_volatile : cons_none);
1909 ir_node *store_mem = new_d_Proj(dbgi, store, mode_M, pn_Store_M);
1910 set_store(store_mem);
1916 ir_node *count_res_shr = new_Const_long(mode_uint, base_bits - bitsize);
1917 if (mode_is_signed(mode)) {
1918 res_shr = new_d_Shrs(dbgi, shiftl, count_res_shr, mode);
1920 res_shr = new_d_Shr(dbgi, shiftl, count_res_shr, mode);
1925 static ir_node *bitfield_extract_to_firm(const select_expression_t *expression,
1928 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
1929 entity_t *entity = expression->compound_entry;
1930 type_t *base_type = entity->declaration.type;
1931 ir_mode *mode = get_ir_mode_storage(base_type);
1932 ir_node *mem = get_store();
1933 ir_node *load = new_d_Load(dbgi, mem, addr, mode, cons_none);
1934 ir_node *load_mem = new_d_Proj(dbgi, load, mode_M, pn_Load_M);
1935 ir_node *load_res = new_d_Proj(dbgi, load, mode, pn_Load_res);
1936 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
1938 ir_mode *amode = mode;
1939 /* optimisation, since shifting in modes < machine_size is usually
1941 if (get_mode_size_bits(amode) < get_mode_size_bits(mode_uint)) {
1944 unsigned amode_size = get_mode_size_bits(amode);
1945 load_res = create_conv(dbgi, load_res, amode);
1947 set_store(load_mem);
1949 /* kill upper bits */
1950 assert(expression->compound_entry->kind == ENTITY_COMPOUND_MEMBER);
1951 unsigned bitoffset = entity->compound_member.bit_offset;
1952 unsigned bitsize = entity->compound_member.bit_size;
1953 unsigned shift_bitsl = amode_size - bitoffset - bitsize;
1954 ir_tarval *tvl = new_tarval_from_long((long)shift_bitsl, mode_uint);
1955 ir_node *countl = new_d_Const(dbgi, tvl);
1956 ir_node *shiftl = new_d_Shl(dbgi, load_res, countl, amode);
1958 unsigned shift_bitsr = bitoffset + shift_bitsl;
1959 assert(shift_bitsr <= amode_size);
1960 ir_tarval *tvr = new_tarval_from_long((long)shift_bitsr, mode_uint);
1961 ir_node *countr = new_d_Const(dbgi, tvr);
1963 if (mode_is_signed(mode)) {
1964 shiftr = new_d_Shrs(dbgi, shiftl, countr, amode);
1966 shiftr = new_d_Shr(dbgi, shiftl, countr, amode);
1969 type_t *type = expression->base.type;
1970 ir_mode *resmode = get_ir_mode_arithmetic(type);
1971 return create_conv(dbgi, shiftr, resmode);
1974 /* make sure the selected compound type is constructed */
1975 static void construct_select_compound(const select_expression_t *expression)
1977 type_t *type = skip_typeref(expression->compound->base.type);
1978 if (is_type_pointer(type)) {
1979 type = type->pointer.points_to;
1981 (void) get_ir_type(type);
1984 static ir_node *set_value_for_expression_addr(const expression_t *expression,
1985 ir_node *value, ir_node *addr)
1987 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
1988 type_t *type = skip_typeref(expression->base.type);
1990 if (!is_type_compound(type)) {
1991 ir_mode *mode = get_ir_mode_storage(type);
1992 value = create_conv(dbgi, value, mode);
1995 if (expression->kind == EXPR_REFERENCE) {
1996 const reference_expression_t *ref = &expression->reference;
1998 entity_t *entity = ref->entity;
1999 assert(is_declaration(entity));
2000 assert(entity->declaration.kind != DECLARATION_KIND_UNKNOWN);
2001 if (entity->declaration.kind == DECLARATION_KIND_LOCAL_VARIABLE ||
2002 entity->declaration.kind == DECLARATION_KIND_PARAMETER) {
2003 set_value(entity->variable.v.value_number, value);
2009 addr = expression_to_addr(expression);
2010 assert(addr != NULL);
2012 if (expression->kind == EXPR_SELECT) {
2013 const select_expression_t *select = &expression->select;
2015 construct_select_compound(select);
2017 entity_t *entity = select->compound_entry;
2018 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
2019 if (entity->compound_member.bitfield) {
2020 ir_entity *irentity = entity->compound_member.entity;
2022 = select->base.type->base.qualifiers & TYPE_QUALIFIER_VOLATILE;
2023 value = bitfield_store_to_firm(dbgi, irentity, addr, value,
2024 set_volatile, true);
2029 assign_value(dbgi, addr, type, value);
2033 static void set_value_for_expression(const expression_t *expression,
2036 set_value_for_expression_addr(expression, value, NULL);
2039 static ir_node *get_value_from_lvalue(const expression_t *expression,
2042 if (expression->kind == EXPR_REFERENCE) {
2043 const reference_expression_t *ref = &expression->reference;
2045 entity_t *entity = ref->entity;
2046 assert(entity->kind == ENTITY_VARIABLE
2047 || entity->kind == ENTITY_PARAMETER);
2048 assert(entity->declaration.kind != DECLARATION_KIND_UNKNOWN);
2050 if (entity->declaration.kind == DECLARATION_KIND_LOCAL_VARIABLE ||
2051 entity->declaration.kind == DECLARATION_KIND_PARAMETER) {
2052 value_number = entity->variable.v.value_number;
2053 assert(addr == NULL);
2054 type_t *type = skip_typeref(expression->base.type);
2055 ir_mode *mode = get_ir_mode_storage(type);
2056 ir_node *res = get_value(value_number, mode);
2057 return create_conv(NULL, res, get_ir_mode_arithmetic(type));
2061 assert(addr != NULL);
2062 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2065 if (expression->kind == EXPR_SELECT &&
2066 expression->select.compound_entry->compound_member.bitfield) {
2067 construct_select_compound(&expression->select);
2068 value = bitfield_extract_to_firm(&expression->select, addr);
2070 value = deref_address(dbgi, expression->base.type, addr);
2077 static ir_node *create_incdec(const unary_expression_t *expression)
2079 dbg_info *const dbgi = get_dbg_info(&expression->base.source_position);
2080 const expression_t *value_expr = expression->value;
2081 ir_node *addr = expression_to_addr(value_expr);
2082 ir_node *value = get_value_from_lvalue(value_expr, addr);
2084 type_t *type = skip_typeref(expression->base.type);
2085 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
2088 if (is_type_pointer(type)) {
2089 pointer_type_t *pointer_type = &type->pointer;
2090 offset = get_type_size_node(pointer_type->points_to);
2092 assert(is_type_arithmetic(type));
2093 offset = new_Const(get_mode_one(mode));
2097 ir_node *store_value;
2098 switch(expression->base.kind) {
2099 case EXPR_UNARY_POSTFIX_INCREMENT:
2101 store_value = new_d_Add(dbgi, value, offset, mode);
2103 case EXPR_UNARY_POSTFIX_DECREMENT:
2105 store_value = new_d_Sub(dbgi, value, offset, mode);
2107 case EXPR_UNARY_PREFIX_INCREMENT:
2108 result = new_d_Add(dbgi, value, offset, mode);
2109 store_value = result;
2111 case EXPR_UNARY_PREFIX_DECREMENT:
2112 result = new_d_Sub(dbgi, value, offset, mode);
2113 store_value = result;
2116 panic("no incdec expr in create_incdec");
2119 set_value_for_expression_addr(value_expr, store_value, addr);
2124 static bool is_local_variable(expression_t *expression)
2126 if (expression->kind != EXPR_REFERENCE)
2128 reference_expression_t *ref_expr = &expression->reference;
2129 entity_t *entity = ref_expr->entity;
2130 if (entity->kind != ENTITY_VARIABLE)
2132 assert(entity->declaration.kind != DECLARATION_KIND_UNKNOWN);
2133 return entity->declaration.kind == DECLARATION_KIND_LOCAL_VARIABLE;
2136 static ir_relation get_relation(const expression_kind_t kind)
2139 case EXPR_BINARY_EQUAL: return ir_relation_equal;
2140 case EXPR_BINARY_ISLESSGREATER: return ir_relation_less_greater;
2141 case EXPR_BINARY_NOTEQUAL: return ir_relation_unordered_less_greater;
2142 case EXPR_BINARY_ISLESS:
2143 case EXPR_BINARY_LESS: return ir_relation_less;
2144 case EXPR_BINARY_ISLESSEQUAL:
2145 case EXPR_BINARY_LESSEQUAL: return ir_relation_less_equal;
2146 case EXPR_BINARY_ISGREATER:
2147 case EXPR_BINARY_GREATER: return ir_relation_greater;
2148 case EXPR_BINARY_ISGREATEREQUAL:
2149 case EXPR_BINARY_GREATEREQUAL: return ir_relation_greater_equal;
2150 case EXPR_BINARY_ISUNORDERED: return ir_relation_unordered;
2155 panic("trying to get ir_relation from non-comparison binexpr type");
2159 * Handle the assume optimizer hint: check if a Confirm
2160 * node can be created.
2162 * @param dbi debug info
2163 * @param expr the IL assume expression
2165 * we support here only some simple cases:
2170 static ir_node *handle_assume_compare(dbg_info *dbi,
2171 const binary_expression_t *expression)
2173 expression_t *op1 = expression->left;
2174 expression_t *op2 = expression->right;
2175 entity_t *var2, *var = NULL;
2176 ir_node *res = NULL;
2177 ir_relation relation = get_relation(expression->base.kind);
2179 if (is_local_variable(op1) && is_local_variable(op2)) {
2180 var = op1->reference.entity;
2181 var2 = op2->reference.entity;
2183 type_t *const type = skip_typeref(var->declaration.type);
2184 ir_mode *const mode = get_ir_mode_storage(type);
2186 ir_node *const irn1 = get_value(var->variable.v.value_number, mode);
2187 ir_node *const irn2 = get_value(var2->variable.v.value_number, mode);
2189 res = new_d_Confirm(dbi, irn2, irn1, get_inversed_relation(relation));
2190 set_value(var2->variable.v.value_number, res);
2192 res = new_d_Confirm(dbi, irn1, irn2, relation);
2193 set_value(var->variable.v.value_number, res);
2198 expression_t *con = NULL;
2199 if (is_local_variable(op1) && is_constant_expression(op2) == EXPR_CLASS_CONSTANT) {
2200 var = op1->reference.entity;
2202 } else if (is_constant_expression(op1) == EXPR_CLASS_CONSTANT && is_local_variable(op2)) {
2203 relation = get_inversed_relation(relation);
2204 var = op2->reference.entity;
2209 type_t *const type = skip_typeref(var->declaration.type);
2210 ir_mode *const mode = get_ir_mode_storage(type);
2212 res = get_value(var->variable.v.value_number, mode);
2213 res = new_d_Confirm(dbi, res, expression_to_firm(con), relation);
2214 set_value(var->variable.v.value_number, res);
2220 * Handle the assume optimizer hint.
2222 * @param dbi debug info
2223 * @param expr the IL assume expression
2225 static ir_node *handle_assume(dbg_info *dbi, const expression_t *expression)
2227 switch(expression->kind) {
2228 case EXPR_BINARY_EQUAL:
2229 case EXPR_BINARY_NOTEQUAL:
2230 case EXPR_BINARY_LESS:
2231 case EXPR_BINARY_LESSEQUAL:
2232 case EXPR_BINARY_GREATER:
2233 case EXPR_BINARY_GREATEREQUAL:
2234 return handle_assume_compare(dbi, &expression->binary);
2240 static ir_node *create_cast(dbg_info *dbgi, ir_node *value_node,
2241 type_t *from_type, type_t *type)
2243 type = skip_typeref(type);
2244 if (is_type_void(type)) {
2245 /* make sure firm type is constructed */
2246 (void) get_ir_type(type);
2249 if (!is_type_scalar(type)) {
2250 /* make sure firm type is constructed */
2251 (void) get_ir_type(type);
2255 from_type = skip_typeref(from_type);
2256 ir_mode *mode = get_ir_mode_storage(type);
2257 /* check for conversion from / to __based types */
2258 if (is_type_pointer(type) && is_type_pointer(from_type)) {
2259 const variable_t *from_var = from_type->pointer.base_variable;
2260 const variable_t *to_var = type->pointer.base_variable;
2261 if (from_var != to_var) {
2262 if (from_var != NULL) {
2263 ir_node *const addr = create_symconst(dbgi, from_var->v.entity);
2264 ir_node *const base = deref_address(dbgi, from_var->base.type, addr);
2265 value_node = new_d_Add(dbgi, value_node, base, mode);
2267 if (to_var != NULL) {
2268 ir_node *const addr = create_symconst(dbgi, to_var->v.entity);
2269 ir_node *const base = deref_address(dbgi, to_var->base.type, addr);
2270 value_node = new_d_Sub(dbgi, value_node, base, mode);
2275 if (is_type_atomic(type, ATOMIC_TYPE_BOOL)) {
2276 /* bool adjustments (we save a mode_Bu, but have to temporarily
2277 * convert to mode_b so we only get a 0/1 value */
2278 value_node = create_conv(dbgi, value_node, mode_b);
2281 ir_mode *mode_arith = get_ir_mode_arithmetic(type);
2282 ir_node *node = create_conv(dbgi, value_node, mode);
2283 node = create_conv(dbgi, node, mode_arith);
2288 static ir_node *unary_expression_to_firm(const unary_expression_t *expression)
2290 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2291 type_t *type = skip_typeref(expression->base.type);
2293 const expression_t *value = expression->value;
2295 switch(expression->base.kind) {
2296 case EXPR_UNARY_TAKE_ADDRESS:
2297 return expression_to_addr(value);
2299 case EXPR_UNARY_NEGATE: {
2300 ir_node *value_node = expression_to_firm(value);
2301 ir_mode *mode = get_ir_mode_arithmetic(type);
2302 return new_d_Minus(dbgi, value_node, mode);
2304 case EXPR_UNARY_PLUS:
2305 return expression_to_firm(value);
2306 case EXPR_UNARY_BITWISE_NEGATE: {
2307 ir_node *value_node = expression_to_firm(value);
2308 ir_mode *mode = get_ir_mode_arithmetic(type);
2309 return new_d_Not(dbgi, value_node, mode);
2311 case EXPR_UNARY_NOT: {
2312 ir_node *value_node = _expression_to_firm(value);
2313 value_node = create_conv(dbgi, value_node, mode_b);
2314 ir_node *res = new_d_Not(dbgi, value_node, mode_b);
2317 case EXPR_UNARY_DEREFERENCE: {
2318 ir_node *value_node = expression_to_firm(value);
2319 type_t *value_type = skip_typeref(value->base.type);
2320 assert(is_type_pointer(value_type));
2322 /* check for __based */
2323 const variable_t *const base_var = value_type->pointer.base_variable;
2324 if (base_var != NULL) {
2325 ir_node *const addr = create_symconst(dbgi, base_var->v.entity);
2326 ir_node *const base = deref_address(dbgi, base_var->base.type, addr);
2327 value_node = new_d_Add(dbgi, value_node, base, get_ir_mode_storage(value_type));
2329 type_t *points_to = value_type->pointer.points_to;
2330 return deref_address(dbgi, points_to, value_node);
2332 case EXPR_UNARY_POSTFIX_INCREMENT:
2333 case EXPR_UNARY_POSTFIX_DECREMENT:
2334 case EXPR_UNARY_PREFIX_INCREMENT:
2335 case EXPR_UNARY_PREFIX_DECREMENT:
2336 return create_incdec(expression);
2337 case EXPR_UNARY_CAST: {
2338 ir_node *value_node = expression_to_firm(value);
2339 type_t *from_type = value->base.type;
2340 return create_cast(dbgi, value_node, from_type, type);
2342 case EXPR_UNARY_ASSUME:
2343 return handle_assume(dbgi, value);
2348 panic("invalid UNEXPR type found");
2352 * produces a 0/1 depending of the value of a mode_b node
2354 static ir_node *produce_condition_result(const expression_t *expression,
2355 ir_mode *mode, dbg_info *dbgi)
2357 ir_node *const one_block = new_immBlock();
2358 ir_node *const zero_block = new_immBlock();
2359 create_condition_evaluation(expression, one_block, zero_block);
2360 mature_immBlock(one_block);
2361 mature_immBlock(zero_block);
2363 ir_node *const jmp_one = new_rd_Jmp(dbgi, one_block);
2364 ir_node *const jmp_zero = new_rd_Jmp(dbgi, zero_block);
2365 ir_node *const in_cf[2] = { jmp_one, jmp_zero };
2366 ir_node *const block = new_Block(lengthof(in_cf), in_cf);
2367 set_cur_block(block);
2369 ir_node *const one = new_Const(get_mode_one(mode));
2370 ir_node *const zero = new_Const(get_mode_null(mode));
2371 ir_node *const in[2] = { one, zero };
2372 ir_node *const val = new_d_Phi(dbgi, lengthof(in), in, mode);
2377 static ir_node *adjust_for_pointer_arithmetic(dbg_info *dbgi,
2378 ir_node *value, type_t *type)
2380 ir_mode *const mode = get_ir_mode_arithmetic(type_ptrdiff_t);
2381 assert(is_type_pointer(type));
2382 pointer_type_t *const pointer_type = &type->pointer;
2383 type_t *const points_to = skip_typeref(pointer_type->points_to);
2384 ir_node * elem_size = get_type_size_node(points_to);
2385 elem_size = create_conv(dbgi, elem_size, mode);
2386 value = create_conv(dbgi, value, mode);
2387 ir_node *const mul = new_d_Mul(dbgi, value, elem_size, mode);
2391 static ir_node *create_op(dbg_info *dbgi, const binary_expression_t *expression,
2392 ir_node *left, ir_node *right)
2395 type_t *type_left = skip_typeref(expression->left->base.type);
2396 type_t *type_right = skip_typeref(expression->right->base.type);
2398 expression_kind_t kind = expression->base.kind;
2401 case EXPR_BINARY_SHIFTLEFT:
2402 case EXPR_BINARY_SHIFTRIGHT:
2403 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2404 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2405 mode = get_ir_mode_arithmetic(expression->base.type);
2406 right = create_conv(dbgi, right, atomic_modes[ATOMIC_TYPE_UINT]);
2409 case EXPR_BINARY_SUB:
2410 if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
2411 const pointer_type_t *const ptr_type = &type_left->pointer;
2413 mode = get_ir_mode_arithmetic(expression->base.type);
2414 ir_node *const elem_size = get_type_size_node(ptr_type->points_to);
2415 ir_node *const conv_size = new_d_Conv(dbgi, elem_size, mode);
2416 ir_node *const sub = new_d_Sub(dbgi, left, right, mode);
2417 ir_node *const no_mem = new_NoMem();
2418 ir_node *const div = new_d_DivRL(dbgi, no_mem, sub, conv_size,
2419 mode, op_pin_state_floats);
2420 return new_d_Proj(dbgi, div, mode, pn_Div_res);
2423 case EXPR_BINARY_SUB_ASSIGN:
2424 if (is_type_pointer(type_left)) {
2425 right = adjust_for_pointer_arithmetic(dbgi, right, type_left);
2426 mode = get_ir_mode_arithmetic(type_left);
2431 case EXPR_BINARY_ADD:
2432 case EXPR_BINARY_ADD_ASSIGN:
2433 if (is_type_pointer(type_left)) {
2434 right = adjust_for_pointer_arithmetic(dbgi, right, type_left);
2435 mode = get_ir_mode_arithmetic(type_left);
2437 } else if (is_type_pointer(type_right)) {
2438 left = adjust_for_pointer_arithmetic(dbgi, left, type_right);
2439 mode = get_ir_mode_arithmetic(type_right);
2446 mode = get_ir_mode_arithmetic(type_right);
2447 left = create_conv(dbgi, left, mode);
2452 case EXPR_BINARY_ADD_ASSIGN:
2453 case EXPR_BINARY_ADD:
2454 return new_d_Add(dbgi, left, right, mode);
2455 case EXPR_BINARY_SUB_ASSIGN:
2456 case EXPR_BINARY_SUB:
2457 return new_d_Sub(dbgi, left, right, mode);
2458 case EXPR_BINARY_MUL_ASSIGN:
2459 case EXPR_BINARY_MUL:
2460 return new_d_Mul(dbgi, left, right, mode);
2461 case EXPR_BINARY_BITWISE_AND:
2462 case EXPR_BINARY_BITWISE_AND_ASSIGN:
2463 return new_d_And(dbgi, left, right, mode);
2464 case EXPR_BINARY_BITWISE_OR:
2465 case EXPR_BINARY_BITWISE_OR_ASSIGN:
2466 return new_d_Or(dbgi, left, right, mode);
2467 case EXPR_BINARY_BITWISE_XOR:
2468 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
2469 return new_d_Eor(dbgi, left, right, mode);
2470 case EXPR_BINARY_SHIFTLEFT:
2471 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2472 return new_d_Shl(dbgi, left, right, mode);
2473 case EXPR_BINARY_SHIFTRIGHT:
2474 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2475 if (mode_is_signed(mode)) {
2476 return new_d_Shrs(dbgi, left, right, mode);
2478 return new_d_Shr(dbgi, left, right, mode);
2480 case EXPR_BINARY_DIV:
2481 case EXPR_BINARY_DIV_ASSIGN: {
2482 ir_node *pin = new_Pin(new_NoMem());
2483 ir_node *op = new_d_Div(dbgi, pin, left, right, mode,
2484 op_pin_state_floats);
2485 ir_node *res = new_d_Proj(dbgi, op, mode, pn_Div_res);
2488 case EXPR_BINARY_MOD:
2489 case EXPR_BINARY_MOD_ASSIGN: {
2490 ir_node *pin = new_Pin(new_NoMem());
2491 ir_node *op = new_d_Mod(dbgi, pin, left, right, mode,
2492 op_pin_state_floats);
2493 ir_node *res = new_d_Proj(dbgi, op, mode, pn_Mod_res);
2497 panic("unexpected expression kind");
2501 static ir_node *create_lazy_op(const binary_expression_t *expression)
2503 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2504 type_t *type = skip_typeref(expression->base.type);
2505 ir_mode *mode = get_ir_mode_arithmetic(type);
2507 if (is_constant_expression(expression->left) == EXPR_CLASS_CONSTANT) {
2508 bool val = fold_constant_to_bool(expression->left);
2509 expression_kind_t ekind = expression->base.kind;
2510 assert(ekind == EXPR_BINARY_LOGICAL_AND || ekind == EXPR_BINARY_LOGICAL_OR);
2511 if (ekind == EXPR_BINARY_LOGICAL_AND) {
2513 return new_Const(get_mode_null(mode));
2517 return new_Const(get_mode_one(mode));
2521 if (is_constant_expression(expression->right) == EXPR_CLASS_CONSTANT) {
2522 bool valr = fold_constant_to_bool(expression->right);
2523 return create_Const_from_bool(mode, valr);
2526 return produce_condition_result(expression->right, mode, dbgi);
2529 return produce_condition_result((const expression_t*) expression, mode,
2533 typedef ir_node * (*create_arithmetic_func)(dbg_info *dbgi, ir_node *left,
2534 ir_node *right, ir_mode *mode);
2536 static ir_node *create_assign_binop(const binary_expression_t *expression)
2538 dbg_info *const dbgi = get_dbg_info(&expression->base.source_position);
2539 const expression_t *left_expr = expression->left;
2540 type_t *type = skip_typeref(left_expr->base.type);
2541 ir_node *right = expression_to_firm(expression->right);
2542 ir_node *left_addr = expression_to_addr(left_expr);
2543 ir_node *left = get_value_from_lvalue(left_expr, left_addr);
2544 ir_node *result = create_op(dbgi, expression, left, right);
2546 result = create_cast(dbgi, result, expression->right->base.type, type);
2548 result = set_value_for_expression_addr(left_expr, result, left_addr);
2550 if (!is_type_compound(type)) {
2551 ir_mode *mode_arithmetic = get_ir_mode_arithmetic(type);
2552 result = create_conv(dbgi, result, mode_arithmetic);
2557 static ir_node *binary_expression_to_firm(const binary_expression_t *expression)
2559 expression_kind_t kind = expression->base.kind;
2562 case EXPR_BINARY_EQUAL:
2563 case EXPR_BINARY_NOTEQUAL:
2564 case EXPR_BINARY_LESS:
2565 case EXPR_BINARY_LESSEQUAL:
2566 case EXPR_BINARY_GREATER:
2567 case EXPR_BINARY_GREATEREQUAL:
2568 case EXPR_BINARY_ISGREATER:
2569 case EXPR_BINARY_ISGREATEREQUAL:
2570 case EXPR_BINARY_ISLESS:
2571 case EXPR_BINARY_ISLESSEQUAL:
2572 case EXPR_BINARY_ISLESSGREATER:
2573 case EXPR_BINARY_ISUNORDERED: {
2574 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2575 ir_node *left = expression_to_firm(expression->left);
2576 ir_node *right = expression_to_firm(expression->right);
2577 ir_relation relation = get_relation(kind);
2578 ir_node *cmp = new_d_Cmp(dbgi, left, right, relation);
2581 case EXPR_BINARY_ASSIGN: {
2582 ir_node *addr = expression_to_addr(expression->left);
2583 ir_node *right = expression_to_firm(expression->right);
2585 = set_value_for_expression_addr(expression->left, right, addr);
2587 type_t *type = skip_typeref(expression->base.type);
2588 if (!is_type_compound(type)) {
2589 ir_mode *mode_arithmetic = get_ir_mode_arithmetic(type);
2590 res = create_conv(NULL, res, mode_arithmetic);
2594 case EXPR_BINARY_ADD:
2595 case EXPR_BINARY_SUB:
2596 case EXPR_BINARY_MUL:
2597 case EXPR_BINARY_DIV:
2598 case EXPR_BINARY_MOD:
2599 case EXPR_BINARY_BITWISE_AND:
2600 case EXPR_BINARY_BITWISE_OR:
2601 case EXPR_BINARY_BITWISE_XOR:
2602 case EXPR_BINARY_SHIFTLEFT:
2603 case EXPR_BINARY_SHIFTRIGHT:
2605 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2606 ir_node *left = expression_to_firm(expression->left);
2607 ir_node *right = expression_to_firm(expression->right);
2608 return create_op(dbgi, expression, left, right);
2610 case EXPR_BINARY_LOGICAL_AND:
2611 case EXPR_BINARY_LOGICAL_OR:
2612 return create_lazy_op(expression);
2613 case EXPR_BINARY_COMMA:
2614 /* create side effects of left side */
2615 (void) expression_to_firm(expression->left);
2616 return _expression_to_firm(expression->right);
2618 case EXPR_BINARY_ADD_ASSIGN:
2619 case EXPR_BINARY_SUB_ASSIGN:
2620 case EXPR_BINARY_MUL_ASSIGN:
2621 case EXPR_BINARY_MOD_ASSIGN:
2622 case EXPR_BINARY_DIV_ASSIGN:
2623 case EXPR_BINARY_BITWISE_AND_ASSIGN:
2624 case EXPR_BINARY_BITWISE_OR_ASSIGN:
2625 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
2626 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2627 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2628 return create_assign_binop(expression);
2630 panic("invalid binexpr type");
2634 static ir_node *array_access_addr(const array_access_expression_t *expression)
2636 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2637 ir_node *base_addr = expression_to_firm(expression->array_ref);
2638 ir_node *offset = expression_to_firm(expression->index);
2639 type_t *ref_type = skip_typeref(expression->array_ref->base.type);
2640 ir_node *real_offset = adjust_for_pointer_arithmetic(dbgi, offset, ref_type);
2641 ir_node *result = new_d_Add(dbgi, base_addr, real_offset, mode_P_data);
2646 static ir_node *array_access_to_firm(
2647 const array_access_expression_t *expression)
2649 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2650 ir_node *addr = array_access_addr(expression);
2651 type_t *type = revert_automatic_type_conversion(
2652 (const expression_t*) expression);
2653 type = skip_typeref(type);
2655 return deref_address(dbgi, type, addr);
2658 static long get_offsetof_offset(const offsetof_expression_t *expression)
2660 type_t *orig_type = expression->type;
2663 designator_t *designator = expression->designator;
2664 for ( ; designator != NULL; designator = designator->next) {
2665 type_t *type = skip_typeref(orig_type);
2666 /* be sure the type is constructed */
2667 (void) get_ir_type(type);
2669 if (designator->symbol != NULL) {
2670 assert(is_type_compound(type));
2671 symbol_t *symbol = designator->symbol;
2673 compound_t *compound = type->compound.compound;
2674 entity_t *iter = compound->members.entities;
2675 for (; iter->base.symbol != symbol; iter = iter->base.next) {}
2677 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
2678 assert(iter->declaration.kind == DECLARATION_KIND_COMPOUND_MEMBER);
2679 offset += get_entity_offset(iter->compound_member.entity);
2681 orig_type = iter->declaration.type;
2683 expression_t *array_index = designator->array_index;
2684 assert(designator->array_index != NULL);
2685 assert(is_type_array(type));
2687 long index = fold_constant_to_int(array_index);
2688 ir_type *arr_type = get_ir_type(type);
2689 ir_type *elem_type = get_array_element_type(arr_type);
2690 long elem_size = get_type_size_bytes(elem_type);
2692 offset += index * elem_size;
2694 orig_type = type->array.element_type;
2701 static ir_node *offsetof_to_firm(const offsetof_expression_t *expression)
2703 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
2704 long offset = get_offsetof_offset(expression);
2705 ir_tarval *tv = new_tarval_from_long(offset, mode);
2706 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2708 return new_d_Const(dbgi, tv);
2711 static void create_local_initializer(initializer_t *initializer, dbg_info *dbgi,
2712 ir_entity *entity, type_t *type);
2713 static ir_initializer_t *create_ir_initializer(
2714 const initializer_t *initializer, type_t *type);
2716 static ir_entity *create_initializer_entity(dbg_info *dbgi,
2717 initializer_t *initializer,
2720 /* create the ir_initializer */
2721 PUSH_IRG(get_const_code_irg());
2722 ir_initializer_t *irinitializer = create_ir_initializer(initializer, type);
2725 ident *const id = id_unique("initializer.%u");
2726 ir_type *const irtype = get_ir_type(type);
2727 ir_type *const global_type = get_glob_type();
2728 ir_entity *const entity = new_d_entity(global_type, id, irtype, dbgi);
2729 set_entity_ld_ident(entity, id);
2730 set_entity_visibility(entity, ir_visibility_private);
2731 add_entity_linkage(entity, IR_LINKAGE_CONSTANT);
2732 set_entity_initializer(entity, irinitializer);
2736 static ir_node *compound_literal_addr(compound_literal_expression_t const *const expression)
2738 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2739 type_t *type = expression->type;
2740 initializer_t *initializer = expression->initializer;
2742 if (is_constant_initializer(initializer) == EXPR_CLASS_CONSTANT) {
2743 ir_entity *entity = create_initializer_entity(dbgi, initializer, type);
2744 return create_symconst(dbgi, entity);
2746 /* create an entity on the stack */
2747 ident *const id = id_unique("CompLit.%u");
2748 ir_type *const irtype = get_ir_type(type);
2749 ir_type *frame_type = get_irg_frame_type(current_ir_graph);
2751 ir_entity *const entity = new_d_entity(frame_type, id, irtype, dbgi);
2752 set_entity_ld_ident(entity, id);
2754 /* create initialisation code */
2755 create_local_initializer(initializer, dbgi, entity, type);
2757 /* create a sel for the compound literal address */
2758 ir_node *frame = get_irg_frame(current_ir_graph);
2759 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, entity);
2764 static ir_node *compound_literal_to_firm(compound_literal_expression_t const* const expr)
2766 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
2767 type_t *const type = expr->type;
2768 ir_node *const addr = compound_literal_addr(expr);
2769 return deref_address(dbgi, type, addr);
2773 * Transform a sizeof expression into Firm code.
2775 static ir_node *sizeof_to_firm(const typeprop_expression_t *expression)
2777 type_t *const type = skip_typeref(expression->type);
2778 /* ยง6.5.3.4:2 if the type is a VLA, evaluate the expression. */
2779 if (is_type_array(type) && type->array.is_vla
2780 && expression->tp_expression != NULL) {
2781 expression_to_firm(expression->tp_expression);
2784 return get_type_size_node(type);
2787 static entity_t *get_expression_entity(const expression_t *expression)
2789 if (expression->kind != EXPR_REFERENCE)
2792 return expression->reference.entity;
2795 static unsigned get_cparser_entity_alignment(const entity_t *entity)
2797 switch(entity->kind) {
2798 case DECLARATION_KIND_CASES:
2799 return entity->declaration.alignment;
2802 return entity->compound.alignment;
2803 case ENTITY_TYPEDEF:
2804 return entity->typedefe.alignment;
2812 * Transform an alignof expression into Firm code.
2814 static ir_node *alignof_to_firm(const typeprop_expression_t *expression)
2816 unsigned alignment = 0;
2818 const expression_t *tp_expression = expression->tp_expression;
2819 if (tp_expression != NULL) {
2820 entity_t *entity = get_expression_entity(tp_expression);
2821 if (entity != NULL) {
2822 alignment = get_cparser_entity_alignment(entity);
2826 if (alignment == 0) {
2827 type_t *type = expression->type;
2828 alignment = get_type_alignment(type);
2831 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2832 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
2833 ir_tarval *tv = new_tarval_from_long(alignment, mode);
2834 return new_d_Const(dbgi, tv);
2837 static void init_ir_types(void);
2839 static ir_tarval *fold_constant_to_tarval(const expression_t *expression)
2841 assert(is_constant_expression(expression) == EXPR_CLASS_CONSTANT);
2843 bool constant_folding_old = constant_folding;
2844 constant_folding = true;
2845 int old_optimize = get_optimize();
2846 int old_constant_folding = get_opt_constant_folding();
2848 set_opt_constant_folding(1);
2852 PUSH_IRG(get_const_code_irg());
2853 ir_node *const cnst = _expression_to_firm(expression);
2856 set_optimize(old_optimize);
2857 set_opt_constant_folding(old_constant_folding);
2859 if (!is_Const(cnst)) {
2860 panic("couldn't fold constant");
2863 constant_folding = constant_folding_old;
2865 ir_tarval *const tv = get_Const_tarval(cnst);
2866 ir_mode *const mode = get_ir_mode_arithmetic(skip_typeref(expression->base.type));
2867 return tarval_convert_to(tv, mode);
2870 /* this function is only used in parser.c, but it relies on libfirm functionality */
2871 bool constant_is_negative(const expression_t *expression)
2873 ir_tarval *tv = fold_constant_to_tarval(expression);
2874 return tarval_is_negative(tv);
2877 long fold_constant_to_int(const expression_t *expression)
2879 ir_tarval *tv = fold_constant_to_tarval(expression);
2880 if (!tarval_is_long(tv)) {
2881 panic("result of constant folding is not integer");
2884 return get_tarval_long(tv);
2887 bool fold_constant_to_bool(const expression_t *expression)
2889 ir_tarval *tv = fold_constant_to_tarval(expression);
2890 return !tarval_is_null(tv);
2893 static ir_node *conditional_to_firm(const conditional_expression_t *expression)
2895 dbg_info *const dbgi = get_dbg_info(&expression->base.source_position);
2897 /* first try to fold a constant condition */
2898 if (is_constant_expression(expression->condition) == EXPR_CLASS_CONSTANT) {
2899 bool val = fold_constant_to_bool(expression->condition);
2901 expression_t *true_expression = expression->true_expression;
2902 if (true_expression == NULL)
2903 true_expression = expression->condition;
2904 return expression_to_firm(true_expression);
2906 return expression_to_firm(expression->false_expression);
2910 ir_node *const true_block = new_immBlock();
2911 ir_node *const false_block = new_immBlock();
2912 ir_node *const cond_expr = create_condition_evaluation(expression->condition, true_block, false_block);
2913 mature_immBlock(true_block);
2914 mature_immBlock(false_block);
2916 set_cur_block(true_block);
2918 if (expression->true_expression != NULL) {
2919 true_val = expression_to_firm(expression->true_expression);
2920 } else if (cond_expr != NULL && get_irn_mode(cond_expr) != mode_b) {
2921 true_val = cond_expr;
2923 /* Condition ended with a short circuit (&&, ||, !) operation or a
2924 * comparison. Generate a "1" as value for the true branch. */
2925 true_val = new_Const(get_mode_one(mode_Is));
2927 ir_node *const true_jmp = new_d_Jmp(dbgi);
2929 set_cur_block(false_block);
2930 ir_node *const false_val = expression_to_firm(expression->false_expression);
2931 ir_node *const false_jmp = new_d_Jmp(dbgi);
2933 /* create the common block */
2934 ir_node *const in_cf[2] = { true_jmp, false_jmp };
2935 ir_node *const block = new_Block(lengthof(in_cf), in_cf);
2936 set_cur_block(block);
2938 /* TODO improve static semantics, so either both or no values are NULL */
2939 if (true_val == NULL || false_val == NULL)
2942 ir_node *const in[2] = { true_val, false_val };
2943 type_t *const type = skip_typeref(expression->base.type);
2944 ir_mode *const mode = get_ir_mode_arithmetic(type);
2945 ir_node *const val = new_d_Phi(dbgi, lengthof(in), in, mode);
2951 * Returns an IR-node representing the address of a field.
2953 static ir_node *select_addr(const select_expression_t *expression)
2955 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2957 construct_select_compound(expression);
2959 ir_node *compound_addr = expression_to_firm(expression->compound);
2961 entity_t *entry = expression->compound_entry;
2962 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
2963 assert(entry->declaration.kind == DECLARATION_KIND_COMPOUND_MEMBER);
2965 if (constant_folding) {
2966 ir_mode *mode = get_irn_mode(compound_addr);
2967 ir_mode *mode_uint = get_reference_mode_unsigned_eq(mode);
2968 ir_node *ofs = new_Const_long(mode_uint, entry->compound_member.offset);
2969 return new_d_Add(dbgi, compound_addr, ofs, mode);
2971 ir_entity *irentity = entry->compound_member.entity;
2972 assert(irentity != NULL);
2973 return new_d_simpleSel(dbgi, new_NoMem(), compound_addr, irentity);
2977 static ir_node *select_to_firm(const select_expression_t *expression)
2979 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2980 ir_node *addr = select_addr(expression);
2981 type_t *type = revert_automatic_type_conversion(
2982 (const expression_t*) expression);
2983 type = skip_typeref(type);
2985 entity_t *entry = expression->compound_entry;
2986 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
2988 if (entry->compound_member.bitfield) {
2989 return bitfield_extract_to_firm(expression, addr);
2992 return deref_address(dbgi, type, addr);
2995 /* Values returned by __builtin_classify_type. */
2996 typedef enum gcc_type_class
3002 enumeral_type_class,
3005 reference_type_class,
3009 function_type_class,
3020 static ir_node *classify_type_to_firm(const classify_type_expression_t *const expr)
3022 type_t *type = expr->type_expression->base.type;
3024 /* FIXME gcc returns different values depending on whether compiling C or C++
3025 * e.g. int x[10] is pointer_type_class in C, but array_type_class in C++ */
3028 type = skip_typeref(type);
3029 switch (type->kind) {
3031 const atomic_type_t *const atomic_type = &type->atomic;
3032 switch (atomic_type->akind) {
3033 /* gcc cannot do that */
3034 case ATOMIC_TYPE_VOID:
3035 tc = void_type_class;
3038 case ATOMIC_TYPE_WCHAR_T: /* gcc handles this as integer */
3039 case ATOMIC_TYPE_CHAR: /* gcc handles this as integer */
3040 case ATOMIC_TYPE_SCHAR: /* gcc handles this as integer */
3041 case ATOMIC_TYPE_UCHAR: /* gcc handles this as integer */
3042 case ATOMIC_TYPE_SHORT:
3043 case ATOMIC_TYPE_USHORT:
3044 case ATOMIC_TYPE_INT:
3045 case ATOMIC_TYPE_UINT:
3046 case ATOMIC_TYPE_LONG:
3047 case ATOMIC_TYPE_ULONG:
3048 case ATOMIC_TYPE_LONGLONG:
3049 case ATOMIC_TYPE_ULONGLONG:
3050 case ATOMIC_TYPE_BOOL: /* gcc handles this as integer */
3051 tc = integer_type_class;
3054 case ATOMIC_TYPE_FLOAT:
3055 case ATOMIC_TYPE_DOUBLE:
3056 case ATOMIC_TYPE_LONG_DOUBLE:
3057 tc = real_type_class;
3060 panic("Unexpected atomic type in classify_type_to_firm().");
3063 case TYPE_COMPLEX: tc = complex_type_class; goto make_const;
3064 case TYPE_IMAGINARY: tc = complex_type_class; goto make_const;
3065 case TYPE_ARRAY: /* gcc handles this as pointer */
3066 case TYPE_FUNCTION: /* gcc handles this as pointer */
3067 case TYPE_POINTER: tc = pointer_type_class; goto make_const;
3068 case TYPE_COMPOUND_STRUCT: tc = record_type_class; goto make_const;
3069 case TYPE_COMPOUND_UNION: tc = union_type_class; goto make_const;
3071 /* gcc handles this as integer */
3072 case TYPE_ENUM: tc = integer_type_class; goto make_const;
3074 /* gcc classifies the referenced type */
3075 case TYPE_REFERENCE: type = type->reference.refers_to; continue;
3077 /* typedef/typeof should be skipped already */
3083 panic("unexpected TYPE classify_type_to_firm().");
3087 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
3088 ir_mode *const mode = atomic_modes[ATOMIC_TYPE_INT];
3089 ir_tarval *const tv = new_tarval_from_long(tc, mode);
3090 return new_d_Const(dbgi, tv);
3093 static ir_node *function_name_to_firm(
3094 const funcname_expression_t *const expr)
3096 switch(expr->kind) {
3097 case FUNCNAME_FUNCTION:
3098 case FUNCNAME_PRETTY_FUNCTION:
3099 case FUNCNAME_FUNCDNAME:
3100 if (current_function_name == NULL) {
3101 source_position_t const *const src_pos = &expr->base.source_position;
3102 char const *const name = current_function_entity->base.symbol->string;
3103 string_t const string = { name, strlen(name), STRING_ENCODING_CHAR };
3104 current_function_name = string_to_firm(src_pos, "__func__.%u", &string);
3106 return current_function_name;
3107 case FUNCNAME_FUNCSIG:
3108 if (current_funcsig == NULL) {
3109 source_position_t const *const src_pos = &expr->base.source_position;
3110 ir_entity *const ent = get_irg_entity(current_ir_graph);
3111 char const *const name = get_entity_ld_name(ent);
3112 string_t const string = { name, strlen(name), STRING_ENCODING_CHAR };
3113 current_funcsig = string_to_firm(src_pos, "__FUNCSIG__.%u", &string);
3115 return current_funcsig;
3117 panic("Unsupported function name");
3120 static ir_node *statement_expression_to_firm(const statement_expression_t *expr)
3122 statement_t *statement = expr->statement;
3124 assert(statement->kind == STATEMENT_COMPOUND);
3125 return compound_statement_to_firm(&statement->compound);
3128 static ir_node *va_start_expression_to_firm(
3129 const va_start_expression_t *const expr)
3131 ir_entity *param_ent = current_vararg_entity;
3132 if (param_ent == NULL) {
3133 size_t const n = IR_VA_START_PARAMETER_NUMBER;
3134 ir_type *const frame_type = get_irg_frame_type(current_ir_graph);
3135 ir_type *const param_type = get_unknown_type();
3136 param_ent = new_parameter_entity(frame_type, n, param_type);
3137 current_vararg_entity = param_ent;
3140 ir_node *const frame = get_irg_frame(current_ir_graph);
3141 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
3142 ir_node *const no_mem = new_NoMem();
3143 ir_node *const arg_sel = new_d_simpleSel(dbgi, no_mem, frame, param_ent);
3145 set_value_for_expression(expr->ap, arg_sel);
3150 static ir_node *va_arg_expression_to_firm(const va_arg_expression_t *const expr)
3152 type_t *const type = expr->base.type;
3153 expression_t *const ap_expr = expr->ap;
3154 ir_node *const ap_addr = expression_to_addr(ap_expr);
3155 ir_node *const ap = get_value_from_lvalue(ap_expr, ap_addr);
3156 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
3157 ir_node *const res = deref_address(dbgi, type, ap);
3159 ir_node *const cnst = get_type_size_node(expr->base.type);
3160 ir_mode *const mode = get_irn_mode(cnst);
3161 ir_node *const c1 = new_Const_long(mode, stack_param_align - 1);
3162 ir_node *const c2 = new_d_Add(dbgi, cnst, c1, mode);
3163 ir_node *const c3 = new_Const_long(mode, -(long)stack_param_align);
3164 ir_node *const c4 = new_d_And(dbgi, c2, c3, mode);
3165 ir_node *const add = new_d_Add(dbgi, ap, c4, mode_P_data);
3167 set_value_for_expression_addr(ap_expr, add, ap_addr);
3173 * Generate Firm for a va_copy expression.
3175 static ir_node *va_copy_expression_to_firm(const va_copy_expression_t *const expr)
3177 ir_node *const src = expression_to_firm(expr->src);
3178 set_value_for_expression(expr->dst, src);
3182 static ir_node *dereference_addr(const unary_expression_t *const expression)
3184 assert(expression->base.kind == EXPR_UNARY_DEREFERENCE);
3185 return expression_to_firm(expression->value);
3189 * Returns a IR-node representing an lvalue of the given expression.
3191 static ir_node *expression_to_addr(const expression_t *expression)
3193 switch(expression->kind) {
3194 case EXPR_ARRAY_ACCESS:
3195 return array_access_addr(&expression->array_access);
3197 return call_expression_to_firm(&expression->call);
3198 case EXPR_COMPOUND_LITERAL:
3199 return compound_literal_addr(&expression->compound_literal);
3200 case EXPR_REFERENCE:
3201 return reference_addr(&expression->reference);
3203 return select_addr(&expression->select);
3204 case EXPR_UNARY_DEREFERENCE:
3205 return dereference_addr(&expression->unary);
3209 panic("trying to get address of non-lvalue");
3212 static ir_node *builtin_constant_to_firm(
3213 const builtin_constant_expression_t *expression)
3215 ir_mode *const mode = get_ir_mode_arithmetic(expression->base.type);
3216 bool const v = is_constant_expression(expression->value) == EXPR_CLASS_CONSTANT;
3217 return create_Const_from_bool(mode, v);
3220 static ir_node *builtin_types_compatible_to_firm(
3221 const builtin_types_compatible_expression_t *expression)
3223 type_t *const left = get_unqualified_type(skip_typeref(expression->left));
3224 type_t *const right = get_unqualified_type(skip_typeref(expression->right));
3225 bool const value = types_compatible(left, right);
3226 ir_mode *const mode = get_ir_mode_arithmetic(expression->base.type);
3227 return create_Const_from_bool(mode, value);
3230 static ir_node *get_label_block(label_t *label)
3232 if (label->block != NULL)
3233 return label->block;
3235 ir_node *block = new_immBlock();
3236 label->block = block;
3238 ARR_APP1(label_t *, all_labels, label);
3243 * Pointer to a label. This is used for the
3244 * GNU address-of-label extension.
3246 static ir_node *label_address_to_firm(const label_address_expression_t *label)
3248 /* Beware: Might be called from create initializer with current_ir_graph
3249 * set to const_code_irg. */
3250 PUSH_IRG(current_function);
3251 dbg_info *dbgi = get_dbg_info(&label->base.source_position);
3252 ir_node *block = get_label_block(label->label);
3253 ir_entity *entity = create_Block_entity(block);
3256 symconst_symbol value;
3257 value.entity_p = entity;
3258 return new_d_SymConst(dbgi, mode_P_code, value, symconst_addr_ent);
3262 * creates firm nodes for an expression. The difference between this function
3263 * and expression_to_firm is, that this version might produce mode_b nodes
3264 * instead of mode_Is.
3266 static ir_node *_expression_to_firm(expression_t const *const expr)
3269 if (!constant_folding) {
3270 assert(!expr->base.transformed);
3271 ((expression_t*)expr)->base.transformed = true;
3275 switch (expr->kind) {
3276 case EXPR_ALIGNOF: return alignof_to_firm( &expr->typeprop);
3277 case EXPR_ARRAY_ACCESS: return array_access_to_firm( &expr->array_access);
3278 case EXPR_BINARY_CASES: return binary_expression_to_firm( &expr->binary);
3279 case EXPR_BUILTIN_CONSTANT_P: return builtin_constant_to_firm( &expr->builtin_constant);
3280 case EXPR_BUILTIN_TYPES_COMPATIBLE_P: return builtin_types_compatible_to_firm(&expr->builtin_types_compatible);
3281 case EXPR_CALL: return call_expression_to_firm( &expr->call);
3282 case EXPR_CLASSIFY_TYPE: return classify_type_to_firm( &expr->classify_type);
3283 case EXPR_COMPOUND_LITERAL: return compound_literal_to_firm( &expr->compound_literal);
3284 case EXPR_CONDITIONAL: return conditional_to_firm( &expr->conditional);
3285 case EXPR_FUNCNAME: return function_name_to_firm( &expr->funcname);
3286 case EXPR_LABEL_ADDRESS: return label_address_to_firm( &expr->label_address);
3287 case EXPR_LITERAL_CASES: return literal_to_firm( &expr->literal);
3288 case EXPR_LITERAL_CHARACTER: return char_literal_to_firm( &expr->string_literal);
3289 case EXPR_OFFSETOF: return offsetof_to_firm( &expr->offsetofe);
3290 case EXPR_REFERENCE: return reference_expression_to_firm( &expr->reference);
3291 case EXPR_ENUM_CONSTANT: return enum_constant_to_firm( &expr->reference);
3292 case EXPR_SELECT: return select_to_firm( &expr->select);
3293 case EXPR_SIZEOF: return sizeof_to_firm( &expr->typeprop);
3294 case EXPR_STATEMENT: return statement_expression_to_firm( &expr->statement);
3295 case EXPR_UNARY_CASES: return unary_expression_to_firm( &expr->unary);
3296 case EXPR_VA_ARG: return va_arg_expression_to_firm( &expr->va_arge);
3297 case EXPR_VA_COPY: return va_copy_expression_to_firm( &expr->va_copye);
3298 case EXPR_VA_START: return va_start_expression_to_firm( &expr->va_starte);
3300 case EXPR_STRING_LITERAL: return string_to_firm(&expr->base.source_position, "str.%u", &expr->string_literal.value);
3302 case EXPR_ERROR: break;
3304 panic("invalid expression found");
3308 * Check if a given expression is a GNU __builtin_expect() call.
3310 static bool is_builtin_expect(const expression_t *expression)
3312 if (expression->kind != EXPR_CALL)
3315 expression_t *function = expression->call.function;
3316 if (function->kind != EXPR_REFERENCE)
3318 reference_expression_t *ref = &function->reference;
3319 if (ref->entity->kind != ENTITY_FUNCTION ||
3320 ref->entity->function.btk != BUILTIN_EXPECT)
3326 static bool produces_mode_b(const expression_t *expression)
3328 switch (expression->kind) {
3329 case EXPR_BINARY_EQUAL:
3330 case EXPR_BINARY_NOTEQUAL:
3331 case EXPR_BINARY_LESS:
3332 case EXPR_BINARY_LESSEQUAL:
3333 case EXPR_BINARY_GREATER:
3334 case EXPR_BINARY_GREATEREQUAL:
3335 case EXPR_BINARY_ISGREATER:
3336 case EXPR_BINARY_ISGREATEREQUAL:
3337 case EXPR_BINARY_ISLESS:
3338 case EXPR_BINARY_ISLESSEQUAL:
3339 case EXPR_BINARY_ISLESSGREATER:
3340 case EXPR_BINARY_ISUNORDERED:
3341 case EXPR_UNARY_NOT:
3345 if (is_builtin_expect(expression)) {
3346 expression_t *argument = expression->call.arguments->expression;
3347 return produces_mode_b(argument);
3350 case EXPR_BINARY_COMMA:
3351 return produces_mode_b(expression->binary.right);
3358 static ir_node *expression_to_firm(const expression_t *expression)
3360 if (!produces_mode_b(expression)) {
3361 ir_node *res = _expression_to_firm(expression);
3362 assert(res == NULL || get_irn_mode(res) != mode_b);
3366 if (is_constant_expression(expression) == EXPR_CLASS_CONSTANT) {
3367 return new_Const(fold_constant_to_tarval(expression));
3370 /* we have to produce a 0/1 from the mode_b expression */
3371 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3372 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
3373 return produce_condition_result(expression, mode, dbgi);
3377 * create a short-circuit expression evaluation that tries to construct
3378 * efficient control flow structures for &&, || and ! expressions
3380 static ir_node *create_condition_evaluation(const expression_t *expression,
3381 ir_node *true_block,
3382 ir_node *false_block)
3384 switch(expression->kind) {
3385 case EXPR_UNARY_NOT: {
3386 const unary_expression_t *unary_expression = &expression->unary;
3387 create_condition_evaluation(unary_expression->value, false_block,
3391 case EXPR_BINARY_LOGICAL_AND: {
3392 const binary_expression_t *binary_expression = &expression->binary;
3394 ir_node *extra_block = new_immBlock();
3395 create_condition_evaluation(binary_expression->left, extra_block,
3397 mature_immBlock(extra_block);
3398 set_cur_block(extra_block);
3399 create_condition_evaluation(binary_expression->right, true_block,
3403 case EXPR_BINARY_LOGICAL_OR: {
3404 const binary_expression_t *binary_expression = &expression->binary;
3406 ir_node *extra_block = new_immBlock();
3407 create_condition_evaluation(binary_expression->left, true_block,
3409 mature_immBlock(extra_block);
3410 set_cur_block(extra_block);
3411 create_condition_evaluation(binary_expression->right, true_block,
3419 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3420 ir_node *cond_expr = _expression_to_firm(expression);
3421 ir_node *condition = create_conv(dbgi, cond_expr, mode_b);
3422 ir_node *cond = new_d_Cond(dbgi, condition);
3423 ir_node *true_proj = new_d_Proj(dbgi, cond, mode_X, pn_Cond_true);
3424 ir_node *false_proj = new_d_Proj(dbgi, cond, mode_X, pn_Cond_false);
3426 /* set branch prediction info based on __builtin_expect */
3427 if (is_builtin_expect(expression) && is_Cond(cond)) {
3428 call_argument_t *argument = expression->call.arguments->next;
3429 if (is_constant_expression(argument->expression) == EXPR_CLASS_CONSTANT) {
3430 bool const cnst = fold_constant_to_bool(argument->expression);
3431 cond_jmp_predicate const pred = cnst ? COND_JMP_PRED_TRUE : COND_JMP_PRED_FALSE;
3432 set_Cond_jmp_pred(cond, pred);
3436 add_immBlock_pred(true_block, true_proj);
3437 add_immBlock_pred(false_block, false_proj);
3439 set_unreachable_now();
3443 static void create_variable_entity(entity_t *variable,
3444 declaration_kind_t declaration_kind,
3445 ir_type *parent_type)
3447 assert(variable->kind == ENTITY_VARIABLE);
3448 type_t *type = skip_typeref(variable->declaration.type);
3450 ident *const id = new_id_from_str(variable->base.symbol->string);
3451 ir_type *const irtype = get_ir_type(type);
3452 dbg_info *const dbgi = get_dbg_info(&variable->base.source_position);
3453 ir_entity *const irentity = new_d_entity(parent_type, id, irtype, dbgi);
3454 unsigned alignment = variable->declaration.alignment;
3456 set_entity_alignment(irentity, alignment);
3458 handle_decl_modifiers(irentity, variable);
3460 variable->declaration.kind = (unsigned char) declaration_kind;
3461 variable->variable.v.entity = irentity;
3462 set_entity_ld_ident(irentity, create_ld_ident(variable));
3464 if (type->base.qualifiers & TYPE_QUALIFIER_VOLATILE) {
3465 set_entity_volatility(irentity, volatility_is_volatile);
3470 typedef struct type_path_entry_t type_path_entry_t;
3471 struct type_path_entry_t {
3473 ir_initializer_t *initializer;
3475 entity_t *compound_entry;
3478 typedef struct type_path_t type_path_t;
3479 struct type_path_t {
3480 type_path_entry_t *path;
3485 static __attribute__((unused)) void debug_print_type_path(const type_path_t *path)
3487 size_t len = ARR_LEN(path->path);
3489 for (size_t i = 0; i < len; ++i) {
3490 const type_path_entry_t *entry = & path->path[i];
3492 type_t *type = skip_typeref(entry->type);
3493 if (is_type_compound(type)) {
3494 fprintf(stderr, ".%s", entry->compound_entry->base.symbol->string);
3495 } else if (is_type_array(type)) {
3496 fprintf(stderr, "[%u]", (unsigned) entry->index);
3498 fprintf(stderr, "-INVALID-");
3501 fprintf(stderr, " (");
3502 print_type(path->top_type);
3503 fprintf(stderr, ")");
3506 static type_path_entry_t *get_type_path_top(const type_path_t *path)
3508 size_t len = ARR_LEN(path->path);
3510 return & path->path[len-1];
3513 static type_path_entry_t *append_to_type_path(type_path_t *path)
3515 size_t len = ARR_LEN(path->path);
3516 ARR_RESIZE(type_path_entry_t, path->path, len+1);
3518 type_path_entry_t *result = & path->path[len];
3519 memset(result, 0, sizeof(result[0]));
3523 static size_t get_compound_member_count(const compound_type_t *type)
3525 compound_t *compound = type->compound;
3526 size_t n_members = 0;
3527 entity_t *member = compound->members.entities;
3528 for ( ; member != NULL; member = member->base.next) {
3535 static ir_initializer_t *get_initializer_entry(type_path_t *path)
3537 type_t *orig_top_type = path->top_type;
3538 type_t *top_type = skip_typeref(orig_top_type);
3540 assert(is_type_compound(top_type) || is_type_array(top_type));
3542 if (ARR_LEN(path->path) == 0) {
3545 type_path_entry_t *top = get_type_path_top(path);
3546 ir_initializer_t *initializer = top->initializer;
3547 return get_initializer_compound_value(initializer, top->index);
3551 static void descend_into_subtype(type_path_t *path)
3553 type_t *orig_top_type = path->top_type;
3554 type_t *top_type = skip_typeref(orig_top_type);
3556 assert(is_type_compound(top_type) || is_type_array(top_type));
3558 ir_initializer_t *initializer = get_initializer_entry(path);
3560 type_path_entry_t *top = append_to_type_path(path);
3561 top->type = top_type;
3565 if (is_type_compound(top_type)) {
3566 compound_t *const compound = top_type->compound.compound;
3567 entity_t *const entry = skip_unnamed_bitfields(compound->members.entities);
3569 top->compound_entry = entry;
3571 len = get_compound_member_count(&top_type->compound);
3572 if (entry != NULL) {
3573 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3574 path->top_type = entry->declaration.type;
3577 assert(is_type_array(top_type));
3578 assert(top_type->array.size > 0);
3581 path->top_type = top_type->array.element_type;
3582 len = top_type->array.size;
3584 if (initializer == NULL
3585 || get_initializer_kind(initializer) == IR_INITIALIZER_NULL) {
3586 initializer = create_initializer_compound(len);
3587 /* we have to set the entry at the 2nd latest path entry... */
3588 size_t path_len = ARR_LEN(path->path);
3589 assert(path_len >= 1);
3591 type_path_entry_t *entry = & path->path[path_len-2];
3592 ir_initializer_t *tinitializer = entry->initializer;
3593 set_initializer_compound_value(tinitializer, entry->index,
3597 top->initializer = initializer;
3600 static void ascend_from_subtype(type_path_t *path)
3602 type_path_entry_t *top = get_type_path_top(path);
3604 path->top_type = top->type;
3606 size_t len = ARR_LEN(path->path);
3607 ARR_RESIZE(type_path_entry_t, path->path, len-1);
3610 static void walk_designator(type_path_t *path, const designator_t *designator)
3612 /* designators start at current object type */
3613 ARR_RESIZE(type_path_entry_t, path->path, 1);
3615 for ( ; designator != NULL; designator = designator->next) {
3616 type_path_entry_t *top = get_type_path_top(path);
3617 type_t *orig_type = top->type;
3618 type_t *type = skip_typeref(orig_type);
3620 if (designator->symbol != NULL) {
3621 assert(is_type_compound(type));
3623 symbol_t *symbol = designator->symbol;
3625 compound_t *compound = type->compound.compound;
3626 entity_t *iter = compound->members.entities;
3627 for (; iter->base.symbol != symbol; iter = iter->base.next, ++index) {}
3628 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
3630 /* revert previous initialisations of other union elements */
3631 if (type->kind == TYPE_COMPOUND_UNION) {
3632 ir_initializer_t *initializer = top->initializer;
3633 if (initializer != NULL
3634 && get_initializer_kind(initializer) == IR_INITIALIZER_COMPOUND) {
3635 /* are we writing to a new element? */
3636 ir_initializer_t *oldi
3637 = get_initializer_compound_value(initializer, index);
3638 if (get_initializer_kind(oldi) == IR_INITIALIZER_NULL) {
3639 /* clear initializer */
3641 = get_initializer_compound_n_entries(initializer);
3642 ir_initializer_t *nulli = get_initializer_null();
3643 for (size_t i = 0; i < len; ++i) {
3644 set_initializer_compound_value(initializer, i,
3651 top->type = orig_type;
3652 top->compound_entry = iter;
3654 orig_type = iter->declaration.type;
3656 expression_t *array_index = designator->array_index;
3657 assert(is_type_array(type));
3659 long index = fold_constant_to_int(array_index);
3660 assert(0 <= index && (!type->array.size_constant || (size_t)index < type->array.size));
3662 top->type = orig_type;
3663 top->index = (size_t) index;
3664 orig_type = type->array.element_type;
3666 path->top_type = orig_type;
3668 if (designator->next != NULL) {
3669 descend_into_subtype(path);
3673 path->invalid = false;
3676 static void advance_current_object(type_path_t *path)
3678 if (path->invalid) {
3679 /* TODO: handle this... */
3680 panic("invalid initializer in ast2firm (excessive elements)");
3683 type_path_entry_t *top = get_type_path_top(path);
3685 type_t *type = skip_typeref(top->type);
3686 if (is_type_union(type)) {
3687 /* only the first element is initialized in unions */
3688 top->compound_entry = NULL;
3689 } else if (is_type_struct(type)) {
3690 entity_t *entry = top->compound_entry;
3693 entry = skip_unnamed_bitfields(entry->base.next);
3694 top->compound_entry = entry;
3695 if (entry != NULL) {
3696 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3697 path->top_type = entry->declaration.type;
3701 assert(is_type_array(type));
3704 if (!type->array.size_constant || top->index < type->array.size) {
3709 /* we're past the last member of the current sub-aggregate, try if we
3710 * can ascend in the type hierarchy and continue with another subobject */
3711 size_t len = ARR_LEN(path->path);
3714 ascend_from_subtype(path);
3715 advance_current_object(path);
3717 path->invalid = true;
3722 static ir_initializer_t *create_ir_initializer_value(
3723 const initializer_value_t *initializer)
3725 if (is_type_compound(initializer->value->base.type)) {
3726 panic("initializer creation for compounds not implemented yet");
3728 type_t *type = initializer->value->base.type;
3729 expression_t *expr = initializer->value;
3730 ir_node *value = expression_to_firm(expr);
3731 ir_mode *mode = get_ir_mode_storage(type);
3732 value = create_conv(NULL, value, mode);
3733 return create_initializer_const(value);
3736 /** test wether type can be initialized by a string constant */
3737 static bool is_string_type(type_t *type)
3739 if (!is_type_array(type))
3742 type_t *const inner = skip_typeref(type->array.element_type);
3743 return is_type_integer(inner);
3746 static ir_initializer_t *create_ir_initializer_list(
3747 const initializer_list_t *initializer, type_t *type)
3750 memset(&path, 0, sizeof(path));
3751 path.top_type = type;
3752 path.path = NEW_ARR_F(type_path_entry_t, 0);
3754 descend_into_subtype(&path);
3756 for (size_t i = 0; i < initializer->len; ++i) {
3757 const initializer_t *sub_initializer = initializer->initializers[i];
3759 if (sub_initializer->kind == INITIALIZER_DESIGNATOR) {
3760 walk_designator(&path, sub_initializer->designator.designator);
3764 if (sub_initializer->kind == INITIALIZER_VALUE) {
3765 /* we might have to descend into types until we're at a scalar
3768 type_t *orig_top_type = path.top_type;
3769 type_t *top_type = skip_typeref(orig_top_type);
3771 if (is_type_scalar(top_type))
3773 descend_into_subtype(&path);
3775 } else if (sub_initializer->kind == INITIALIZER_STRING) {
3776 /* we might have to descend into types until we're at a scalar
3779 type_t *orig_top_type = path.top_type;
3780 type_t *top_type = skip_typeref(orig_top_type);
3782 if (is_string_type(top_type))
3784 descend_into_subtype(&path);
3788 ir_initializer_t *sub_irinitializer
3789 = create_ir_initializer(sub_initializer, path.top_type);
3791 size_t path_len = ARR_LEN(path.path);
3792 assert(path_len >= 1);
3793 type_path_entry_t *entry = & path.path[path_len-1];
3794 ir_initializer_t *tinitializer = entry->initializer;
3795 set_initializer_compound_value(tinitializer, entry->index,
3798 advance_current_object(&path);
3801 assert(ARR_LEN(path.path) >= 1);
3802 ir_initializer_t *result = path.path[0].initializer;
3803 DEL_ARR_F(path.path);
3808 static ir_initializer_t *create_ir_initializer_string(initializer_t const *const init, type_t *type)
3810 type = skip_typeref(type);
3812 assert(type->kind == TYPE_ARRAY);
3813 assert(type->array.size_constant);
3814 string_literal_expression_t const *const str = get_init_string(init);
3815 size_t const str_len = str->value.size;
3816 size_t const arr_len = type->array.size;
3817 ir_initializer_t *const irinit = create_initializer_compound(arr_len);
3818 ir_mode *const mode = get_ir_mode_storage(type->array.element_type);
3819 char const * p = str->value.begin;
3820 switch (str->value.encoding) {
3821 case STRING_ENCODING_CHAR:
3822 for (size_t i = 0; i != arr_len; ++i) {
3823 char const c = i < str_len ? *p++ : 0;
3824 ir_tarval *const tv = new_tarval_from_long(c, mode);
3825 ir_initializer_t *const tvinit = create_initializer_tarval(tv);
3826 set_initializer_compound_value(irinit, i, tvinit);
3830 case STRING_ENCODING_WIDE:
3831 for (size_t i = 0; i != arr_len; ++i) {
3832 utf32 const c = i < str_len ? read_utf8_char(&p) : 0;
3833 ir_tarval *const tv = new_tarval_from_long(c, mode);
3834 ir_initializer_t *const tvinit = create_initializer_tarval(tv);
3835 set_initializer_compound_value(irinit, i, tvinit);
3843 static ir_initializer_t *create_ir_initializer(
3844 const initializer_t *initializer, type_t *type)
3846 switch(initializer->kind) {
3847 case INITIALIZER_STRING:
3848 return create_ir_initializer_string(initializer, type);
3850 case INITIALIZER_LIST:
3851 return create_ir_initializer_list(&initializer->list, type);
3853 case INITIALIZER_VALUE:
3854 return create_ir_initializer_value(&initializer->value);
3856 case INITIALIZER_DESIGNATOR:
3857 panic("unexpected designator initializer found");
3859 panic("unknown initializer");
3862 /** ANSI C ยง6.7.8:21: If there are fewer initializers [..] than there
3863 * are elements [...] the remainder of the aggregate shall be initialized
3864 * implicitly the same as objects that have static storage duration. */
3865 static void create_dynamic_null_initializer(ir_entity *entity, dbg_info *dbgi,
3868 /* for unions we must NOT do anything for null initializers */
3869 ir_type *owner = get_entity_owner(entity);
3870 if (is_Union_type(owner)) {
3874 ir_type *ent_type = get_entity_type(entity);
3875 /* create sub-initializers for a compound type */
3876 if (is_compound_type(ent_type)) {
3877 unsigned n_members = get_compound_n_members(ent_type);
3878 for (unsigned n = 0; n < n_members; ++n) {
3879 ir_entity *member = get_compound_member(ent_type, n);
3880 ir_node *addr = new_d_simpleSel(dbgi, new_NoMem(), base_addr,
3882 create_dynamic_null_initializer(member, dbgi, addr);
3886 if (is_Array_type(ent_type)) {
3887 assert(has_array_upper_bound(ent_type, 0));
3888 long n = get_array_upper_bound_int(ent_type, 0);
3889 for (long i = 0; i < n; ++i) {
3890 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
3891 ir_tarval *index_tv = new_tarval_from_long(i, mode_uint);
3892 ir_node *cnst = new_d_Const(dbgi, index_tv);
3893 ir_node *in[1] = { cnst };
3894 ir_entity *arrent = get_array_element_entity(ent_type);
3895 ir_node *addr = new_d_Sel(dbgi, new_NoMem(), base_addr, 1, in,
3897 create_dynamic_null_initializer(arrent, dbgi, addr);
3902 ir_mode *value_mode = get_type_mode(ent_type);
3903 ir_node *node = new_Const(get_mode_null(value_mode));
3905 /* is it a bitfield type? */
3906 if (is_Primitive_type(ent_type) &&
3907 get_primitive_base_type(ent_type) != NULL) {
3908 bitfield_store_to_firm(dbgi, entity, base_addr, node, false, false);
3912 ir_node *mem = get_store();
3913 ir_node *store = new_d_Store(dbgi, mem, base_addr, node, cons_none);
3914 ir_node *proj_m = new_Proj(store, mode_M, pn_Store_M);
3918 static void create_dynamic_initializer_sub(ir_initializer_t *initializer,
3919 ir_entity *entity, ir_type *type, dbg_info *dbgi, ir_node *base_addr)
3921 switch(get_initializer_kind(initializer)) {
3922 case IR_INITIALIZER_NULL:
3923 create_dynamic_null_initializer(entity, dbgi, base_addr);
3925 case IR_INITIALIZER_CONST: {
3926 ir_node *node = get_initializer_const_value(initializer);
3927 ir_type *ent_type = get_entity_type(entity);
3929 /* is it a bitfield type? */
3930 if (is_Primitive_type(ent_type) &&
3931 get_primitive_base_type(ent_type) != NULL) {
3932 bitfield_store_to_firm(dbgi, entity, base_addr, node, false, false);
3936 assert(get_type_mode(type) == get_irn_mode(node));
3937 ir_node *mem = get_store();
3938 ir_node *store = new_d_Store(dbgi, mem, base_addr, node, cons_none);
3939 ir_node *proj_m = new_Proj(store, mode_M, pn_Store_M);
3943 case IR_INITIALIZER_TARVAL: {
3944 ir_tarval *tv = get_initializer_tarval_value(initializer);
3945 ir_node *cnst = new_d_Const(dbgi, tv);
3946 ir_type *ent_type = get_entity_type(entity);
3948 /* is it a bitfield type? */
3949 if (is_Primitive_type(ent_type) &&
3950 get_primitive_base_type(ent_type) != NULL) {
3951 bitfield_store_to_firm(dbgi, entity, base_addr, cnst, false, false);
3955 assert(get_type_mode(type) == get_tarval_mode(tv));
3956 ir_node *mem = get_store();
3957 ir_node *store = new_d_Store(dbgi, mem, base_addr, cnst, cons_none);
3958 ir_node *proj_m = new_Proj(store, mode_M, pn_Store_M);
3962 case IR_INITIALIZER_COMPOUND: {
3963 assert(is_compound_type(type) || is_Array_type(type));
3965 if (is_Array_type(type)) {
3966 assert(has_array_upper_bound(type, 0));
3967 n_members = get_array_upper_bound_int(type, 0);
3969 n_members = get_compound_n_members(type);
3972 if (get_initializer_compound_n_entries(initializer)
3973 != (unsigned) n_members)
3974 panic("initializer doesn't match compound type");
3976 for (int i = 0; i < n_members; ++i) {
3979 ir_entity *sub_entity;
3980 if (is_Array_type(type)) {
3981 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
3982 ir_tarval *index_tv = new_tarval_from_long(i, mode_uint);
3983 ir_node *cnst = new_d_Const(dbgi, index_tv);
3984 ir_node *in[1] = { cnst };
3985 irtype = get_array_element_type(type);
3986 sub_entity = get_array_element_entity(type);
3987 addr = new_d_Sel(dbgi, new_NoMem(), base_addr, 1, in,
3990 sub_entity = get_compound_member(type, i);
3991 irtype = get_entity_type(sub_entity);
3992 addr = new_d_simpleSel(dbgi, new_NoMem(), base_addr,
3996 ir_initializer_t *sub_init
3997 = get_initializer_compound_value(initializer, i);
3999 create_dynamic_initializer_sub(sub_init, sub_entity, irtype, dbgi,
4006 panic("invalid IR_INITIALIZER found");
4009 static void create_dynamic_initializer(ir_initializer_t *initializer,
4010 dbg_info *dbgi, ir_entity *entity)
4012 ir_node *frame = get_irg_frame(current_ir_graph);
4013 ir_node *base_addr = new_d_simpleSel(dbgi, new_NoMem(), frame, entity);
4014 ir_type *type = get_entity_type(entity);
4016 create_dynamic_initializer_sub(initializer, entity, type, dbgi, base_addr);
4019 static void create_local_initializer(initializer_t *initializer, dbg_info *dbgi,
4020 ir_entity *entity, type_t *type)
4022 ir_node *memory = get_store();
4023 ir_node *nomem = new_NoMem();
4024 ir_node *frame = get_irg_frame(current_ir_graph);
4025 ir_node *addr = new_d_simpleSel(dbgi, nomem, frame, entity);
4027 if (initializer->kind == INITIALIZER_VALUE) {
4028 initializer_value_t *initializer_value = &initializer->value;
4030 ir_node *value = expression_to_firm(initializer_value->value);
4031 type = skip_typeref(type);
4032 assign_value(dbgi, addr, type, value);
4036 if (is_constant_initializer(initializer) == EXPR_CLASS_VARIABLE) {
4037 ir_initializer_t *irinitializer
4038 = create_ir_initializer(initializer, type);
4040 create_dynamic_initializer(irinitializer, dbgi, entity);
4044 /* create a "template" entity which is copied to the entity on the stack */
4045 ir_entity *const init_entity
4046 = create_initializer_entity(dbgi, initializer, type);
4047 ir_node *const src_addr = create_symconst(dbgi, init_entity);
4048 ir_type *const irtype = get_ir_type(type);
4049 ir_node *const copyb = new_d_CopyB(dbgi, memory, addr, src_addr, irtype);
4051 ir_node *const copyb_mem = new_Proj(copyb, mode_M, pn_CopyB_M);
4052 set_store(copyb_mem);
4055 static void create_initializer_local_variable_entity(entity_t *entity)
4057 assert(entity->kind == ENTITY_VARIABLE);
4058 initializer_t *initializer = entity->variable.initializer;
4059 dbg_info *dbgi = get_dbg_info(&entity->base.source_position);
4060 ir_entity *irentity = entity->variable.v.entity;
4061 type_t *type = entity->declaration.type;
4063 create_local_initializer(initializer, dbgi, irentity, type);
4066 static void create_variable_initializer(entity_t *entity)
4068 assert(entity->kind == ENTITY_VARIABLE);
4069 initializer_t *initializer = entity->variable.initializer;
4070 if (initializer == NULL)
4073 declaration_kind_t declaration_kind
4074 = (declaration_kind_t) entity->declaration.kind;
4075 if (declaration_kind == DECLARATION_KIND_LOCAL_VARIABLE_ENTITY) {
4076 create_initializer_local_variable_entity(entity);
4080 type_t *type = entity->declaration.type;
4081 type_qualifiers_t tq = get_type_qualifier(type, true);
4083 if (initializer->kind == INITIALIZER_VALUE) {
4084 expression_t * value = initializer->value.value;
4085 type_t *const init_type = skip_typeref(value->base.type);
4087 if (!is_type_scalar(init_type)) {
4089 while (value->kind == EXPR_UNARY_CAST)
4090 value = value->unary.value;
4092 if (value->kind != EXPR_COMPOUND_LITERAL)
4093 panic("expected non-scalar initializer to be a compound literal");
4094 initializer = value->compound_literal.initializer;
4095 goto have_initializer;
4098 ir_node * node = expression_to_firm(value);
4099 dbg_info *const dbgi = get_dbg_info(&entity->base.source_position);
4100 ir_mode *const mode = get_ir_mode_storage(init_type);
4101 node = create_conv(dbgi, node, mode);
4103 if (declaration_kind == DECLARATION_KIND_LOCAL_VARIABLE) {
4104 set_value(entity->variable.v.value_number, node);
4106 assert(declaration_kind == DECLARATION_KIND_GLOBAL_VARIABLE);
4108 ir_entity *irentity = entity->variable.v.entity;
4110 if (tq & TYPE_QUALIFIER_CONST
4111 && get_entity_owner(irentity) != get_tls_type()) {
4112 add_entity_linkage(irentity, IR_LINKAGE_CONSTANT);
4114 set_atomic_ent_value(irentity, node);
4118 assert(declaration_kind == DECLARATION_KIND_LOCAL_VARIABLE_ENTITY ||
4119 declaration_kind == DECLARATION_KIND_GLOBAL_VARIABLE);
4121 ir_entity *irentity = entity->variable.v.entity;
4122 ir_initializer_t *irinitializer
4123 = create_ir_initializer(initializer, type);
4125 if (tq & TYPE_QUALIFIER_CONST) {
4126 add_entity_linkage(irentity, IR_LINKAGE_CONSTANT);
4128 set_entity_initializer(irentity, irinitializer);
4132 static void create_variable_length_array(entity_t *entity)
4134 assert(entity->kind == ENTITY_VARIABLE);
4135 assert(entity->variable.initializer == NULL);
4137 entity->declaration.kind = DECLARATION_KIND_VARIABLE_LENGTH_ARRAY;
4138 entity->variable.v.vla_base = NULL;
4140 /* TODO: record VLA somewhere so we create the free node when we leave
4144 static void allocate_variable_length_array(entity_t *entity)
4146 assert(entity->kind == ENTITY_VARIABLE);
4147 assert(entity->variable.initializer == NULL);
4148 assert(currently_reachable());
4150 dbg_info *dbgi = get_dbg_info(&entity->base.source_position);
4151 type_t *type = entity->declaration.type;
4152 ir_type *el_type = get_ir_type(type->array.element_type);
4154 /* make sure size_node is calculated */
4155 get_type_size_node(type);
4156 ir_node *elems = type->array.size_node;
4157 ir_node *mem = get_store();
4158 ir_node *alloc = new_d_Alloc(dbgi, mem, elems, el_type, stack_alloc);
4160 ir_node *proj_m = new_d_Proj(dbgi, alloc, mode_M, pn_Alloc_M);
4161 ir_node *addr = new_d_Proj(dbgi, alloc, mode_P_data, pn_Alloc_res);
4164 assert(entity->declaration.kind == DECLARATION_KIND_VARIABLE_LENGTH_ARRAY);
4165 entity->variable.v.vla_base = addr;
4168 static bool var_needs_entity(variable_t const *const var)
4170 if (var->address_taken)
4172 type_t *const type = skip_typeref(var->base.type);
4173 return !is_type_scalar(type) || type->base.qualifiers & TYPE_QUALIFIER_VOLATILE;
4177 * Creates a Firm local variable from a declaration.
4179 static void create_local_variable(entity_t *entity)
4181 assert(entity->kind == ENTITY_VARIABLE);
4182 assert(entity->declaration.kind == DECLARATION_KIND_UNKNOWN);
4184 if (!var_needs_entity(&entity->variable)) {
4185 entity->declaration.kind = DECLARATION_KIND_LOCAL_VARIABLE;
4186 entity->variable.v.value_number = next_value_number_function;
4187 set_irg_loc_description(current_ir_graph, next_value_number_function, entity);
4188 ++next_value_number_function;
4192 /* is it a variable length array? */
4193 type_t *const type = skip_typeref(entity->declaration.type);
4194 if (is_type_array(type) && !type->array.size_constant) {
4195 create_variable_length_array(entity);
4199 ir_type *const frame_type = get_irg_frame_type(current_ir_graph);
4200 create_variable_entity(entity, DECLARATION_KIND_LOCAL_VARIABLE_ENTITY, frame_type);
4203 static void create_local_static_variable(entity_t *entity)
4205 assert(entity->kind == ENTITY_VARIABLE);
4206 assert(entity->declaration.kind == DECLARATION_KIND_UNKNOWN);
4208 type_t *type = skip_typeref(entity->declaration.type);
4209 ir_type *const var_type = entity->variable.thread_local ?
4210 get_tls_type() : get_glob_type();
4211 ir_type *const irtype = get_ir_type(type);
4212 dbg_info *const dbgi = get_dbg_info(&entity->base.source_position);
4214 size_t l = strlen(entity->base.symbol->string);
4215 char buf[l + sizeof(".%u")];
4216 snprintf(buf, sizeof(buf), "%s.%%u", entity->base.symbol->string);
4217 ident *const id = id_unique(buf);
4218 ir_entity *const irentity = new_d_entity(var_type, id, irtype, dbgi);
4220 if (type->base.qualifiers & TYPE_QUALIFIER_VOLATILE) {
4221 set_entity_volatility(irentity, volatility_is_volatile);
4224 entity->declaration.kind = DECLARATION_KIND_GLOBAL_VARIABLE;
4225 entity->variable.v.entity = irentity;
4227 set_entity_ld_ident(irentity, id);
4228 set_entity_visibility(irentity, ir_visibility_local);
4230 if (entity->variable.initializer == NULL) {
4231 ir_initializer_t *null_init = get_initializer_null();
4232 set_entity_initializer(irentity, null_init);
4235 PUSH_IRG(get_const_code_irg());
4236 create_variable_initializer(entity);
4242 static ir_node *return_statement_to_firm(return_statement_t *statement)
4244 if (!currently_reachable())
4247 dbg_info *const dbgi = get_dbg_info(&statement->base.source_position);
4248 type_t *const type = skip_typeref(current_function_entity->declaration.type->function.return_type);
4249 ir_node * res = statement->value ? expression_to_firm(statement->value) : NULL;
4252 if (!is_type_void(type)) {
4253 ir_mode *const mode = get_ir_mode_storage(type);
4255 res = create_conv(dbgi, res, mode);
4257 res = new_Unknown(mode);
4264 ir_node *const in[1] = { res };
4265 ir_node *const store = get_store();
4266 ir_node *const ret = new_d_Return(dbgi, store, in_len, in);
4268 ir_node *end_block = get_irg_end_block(current_ir_graph);
4269 add_immBlock_pred(end_block, ret);
4271 set_unreachable_now();
4275 static ir_node *expression_statement_to_firm(expression_statement_t *statement)
4277 if (!currently_reachable())
4280 return expression_to_firm(statement->expression);
4283 static void create_local_declarations(entity_t*);
4285 static ir_node *compound_statement_to_firm(compound_statement_t *compound)
4287 create_local_declarations(compound->scope.entities);
4289 ir_node *result = NULL;
4290 statement_t *statement = compound->statements;
4291 for ( ; statement != NULL; statement = statement->base.next) {
4292 result = statement_to_firm(statement);
4298 static void create_global_variable(entity_t *entity)
4300 ir_linkage linkage = IR_LINKAGE_DEFAULT;
4301 ir_visibility visibility = ir_visibility_external;
4302 storage_class_tag_t storage
4303 = (storage_class_tag_t)entity->declaration.storage_class;
4304 decl_modifiers_t modifiers = entity->declaration.modifiers;
4305 assert(entity->kind == ENTITY_VARIABLE);
4308 case STORAGE_CLASS_EXTERN: visibility = ir_visibility_external; break;
4309 case STORAGE_CLASS_STATIC: visibility = ir_visibility_local; break;
4310 case STORAGE_CLASS_NONE: visibility = ir_visibility_external; break;
4311 case STORAGE_CLASS_TYPEDEF:
4312 case STORAGE_CLASS_AUTO:
4313 case STORAGE_CLASS_REGISTER:
4314 panic("invalid storage class for global var");
4317 /* "common" symbols */
4318 if (storage == STORAGE_CLASS_NONE
4319 && entity->variable.initializer == NULL
4320 && !entity->variable.thread_local
4321 && (modifiers & DM_WEAK) == 0) {
4322 linkage |= IR_LINKAGE_MERGE;
4325 ir_type *var_type = get_glob_type();
4326 if (entity->variable.thread_local) {
4327 var_type = get_tls_type();
4329 create_variable_entity(entity, DECLARATION_KIND_GLOBAL_VARIABLE, var_type);
4330 ir_entity *irentity = entity->variable.v.entity;
4331 add_entity_linkage(irentity, linkage);
4332 set_entity_visibility(irentity, visibility);
4333 if (entity->variable.initializer == NULL
4334 && storage != STORAGE_CLASS_EXTERN) {
4335 ir_initializer_t *null_init = get_initializer_null();
4336 set_entity_initializer(irentity, null_init);
4340 static void create_local_declaration(entity_t *entity)
4342 assert(is_declaration(entity));
4344 /* construct type */
4345 (void) get_ir_type(entity->declaration.type);
4346 if (entity->base.symbol == NULL) {
4350 switch ((storage_class_tag_t) entity->declaration.storage_class) {
4351 case STORAGE_CLASS_STATIC:
4352 if (entity->kind == ENTITY_FUNCTION) {
4353 (void)get_function_entity(entity, NULL);
4355 create_local_static_variable(entity);
4358 case STORAGE_CLASS_EXTERN:
4359 if (entity->kind == ENTITY_FUNCTION) {
4360 assert(entity->function.body == NULL);
4361 (void)get_function_entity(entity, NULL);
4363 create_global_variable(entity);
4364 create_variable_initializer(entity);
4367 case STORAGE_CLASS_NONE:
4368 case STORAGE_CLASS_AUTO:
4369 case STORAGE_CLASS_REGISTER:
4370 if (entity->kind == ENTITY_FUNCTION) {
4371 if (entity->function.body != NULL) {
4372 ir_type *owner = get_irg_frame_type(current_ir_graph);
4373 (void)get_function_entity(entity, owner);
4374 entity->declaration.kind = DECLARATION_KIND_INNER_FUNCTION;
4375 enqueue_inner_function(entity);
4377 (void)get_function_entity(entity, NULL);
4380 create_local_variable(entity);
4383 case STORAGE_CLASS_TYPEDEF:
4386 panic("invalid storage class found");
4389 static void create_local_declarations(entity_t *e)
4391 for (; e; e = e->base.next) {
4392 if (is_declaration(e))
4393 create_local_declaration(e);
4397 static void initialize_local_declaration(entity_t *entity)
4399 if (entity->base.symbol == NULL)
4402 // no need to emit code in dead blocks
4403 if (entity->declaration.storage_class != STORAGE_CLASS_STATIC
4404 && !currently_reachable())
4407 switch ((declaration_kind_t) entity->declaration.kind) {
4408 case DECLARATION_KIND_LOCAL_VARIABLE:
4409 case DECLARATION_KIND_LOCAL_VARIABLE_ENTITY:
4410 create_variable_initializer(entity);
4413 case DECLARATION_KIND_VARIABLE_LENGTH_ARRAY:
4414 allocate_variable_length_array(entity);
4417 case DECLARATION_KIND_COMPOUND_MEMBER:
4418 case DECLARATION_KIND_GLOBAL_VARIABLE:
4419 case DECLARATION_KIND_FUNCTION:
4420 case DECLARATION_KIND_INNER_FUNCTION:
4423 case DECLARATION_KIND_PARAMETER:
4424 case DECLARATION_KIND_PARAMETER_ENTITY:
4425 panic("can't initialize parameters");
4427 case DECLARATION_KIND_UNKNOWN:
4428 panic("can't initialize unknown declaration");
4430 panic("invalid declaration kind");
4433 static ir_node *declaration_statement_to_firm(declaration_statement_t *statement)
4435 entity_t *entity = statement->declarations_begin;
4439 entity_t *const last = statement->declarations_end;
4440 for ( ;; entity = entity->base.next) {
4441 if (is_declaration(entity)) {
4442 initialize_local_declaration(entity);
4443 } else if (entity->kind == ENTITY_TYPEDEF) {
4444 /* ยง6.7.7:3 Any array size expressions associated with variable length
4445 * array declarators are evaluated each time the declaration of the
4446 * typedef name is reached in the order of execution. */
4447 type_t *const type = skip_typeref(entity->typedefe.type);
4448 if (is_type_array(type) && type->array.is_vla)
4449 get_vla_size(&type->array);
4458 static ir_node *if_statement_to_firm(if_statement_t *statement)
4460 create_local_declarations(statement->scope.entities);
4462 /* Create the condition. */
4463 ir_node *true_block = NULL;
4464 ir_node *false_block = NULL;
4465 if (currently_reachable()) {
4466 true_block = new_immBlock();
4467 false_block = new_immBlock();
4468 create_condition_evaluation(statement->condition, true_block, false_block);
4469 mature_immBlock(true_block);
4470 mature_immBlock(false_block);
4473 /* Create the true statement. */
4474 set_cur_block(true_block);
4475 statement_to_firm(statement->true_statement);
4476 ir_node *fallthrough_block = get_cur_block();
4478 /* Create the false statement. */
4479 set_cur_block(false_block);
4480 if (statement->false_statement != NULL) {
4481 statement_to_firm(statement->false_statement);
4484 /* Handle the block after the if-statement. Minor simplification and
4485 * optimisation: Reuse the false/true block as fallthrough block, if the
4486 * true/false statement does not pass control to the fallthrough block, e.g.
4487 * in the typical if (x) return; pattern. */
4488 if (fallthrough_block) {
4489 if (currently_reachable()) {
4490 ir_node *const t_jump = new_r_Jmp(fallthrough_block);
4491 ir_node *const f_jump = new_Jmp();
4492 ir_node *const in[] = { t_jump, f_jump };
4493 fallthrough_block = new_Block(2, in);
4495 set_cur_block(fallthrough_block);
4502 * Add an unconditional jump to the target block. If the source block is not
4503 * reachable, then a Bad predecessor is created to prevent Phi-less unreachable
4504 * loops. This is necessary if the jump potentially enters a loop.
4506 static void jump_to(ir_node *const target_block)
4508 ir_node *const pred = currently_reachable() ? new_Jmp() : new_Bad(mode_X);
4509 add_immBlock_pred(target_block, pred);
4510 set_cur_block(target_block);
4514 * Add an unconditional jump to the target block, if the current block is
4515 * reachable and do nothing otherwise. This is only valid if the jump does not
4516 * enter a loop (a back edge is ok).
4518 static void jump_if_reachable(ir_node *const target_block)
4520 if (currently_reachable())
4521 add_immBlock_pred(target_block, new_Jmp());
4524 static ir_node *get_break_label(void)
4526 if (break_label == NULL) {
4527 break_label = new_immBlock();
4532 static ir_node *do_while_statement_to_firm(do_while_statement_t *statement)
4534 create_local_declarations(statement->scope.entities);
4536 /* create the header block */
4537 ir_node *header_block = new_immBlock();
4540 PUSH_CONTINUE(header_block);
4542 /* The loop body. */
4543 ir_node *body_block = NULL;
4544 expression_t *const cond = statement->condition;
4545 /* Avoid an explicit body block in case of do ... while (0);. */
4546 if (is_constant_expression(cond) != EXPR_CLASS_CONSTANT || fold_constant_to_bool(cond)) {
4547 /* Not do ... while (0);. */
4548 body_block = new_immBlock();
4549 jump_to(body_block);
4551 statement_to_firm(statement->body);
4553 /* create the condition */
4554 jump_if_reachable(header_block);
4555 mature_immBlock(header_block);
4556 set_cur_block(header_block);
4557 ir_node *const false_block = get_break_label();
4559 create_condition_evaluation(statement->condition, body_block, false_block);
4560 mature_immBlock(body_block);
4562 jump_if_reachable(false_block);
4564 mature_immBlock(false_block);
4565 set_cur_block(false_block);
4572 static ir_node *for_statement_to_firm(for_statement_t *statement)
4574 create_local_declarations(statement->scope.entities);
4576 if (currently_reachable()) {
4577 entity_t *entity = statement->scope.entities;
4578 for ( ; entity != NULL; entity = entity->base.next) {
4579 if (!is_declaration(entity))
4582 initialize_local_declaration(entity);
4585 if (statement->initialisation != NULL) {
4586 expression_to_firm(statement->initialisation);
4590 /* Create the header block */
4591 ir_node *const header_block = new_immBlock();
4592 jump_to(header_block);
4594 /* Create the condition. */
4595 ir_node *false_block;
4596 expression_t *const cond = statement->condition;
4597 if (cond && (is_constant_expression(cond) != EXPR_CLASS_CONSTANT || !fold_constant_to_bool(cond))) {
4598 false_block = new_immBlock();
4600 ir_node *const body_block = new_immBlock();
4601 create_condition_evaluation(cond, body_block, false_block);
4602 mature_immBlock(body_block);
4603 set_cur_block(body_block);
4608 keep_alive(header_block);
4609 keep_all_memory(header_block);
4612 /* Create the step block, if necessary. */
4613 ir_node * step_block = header_block;
4614 expression_t *const step = statement->step;
4616 step_block = new_immBlock();
4619 PUSH_BREAK(false_block);
4620 PUSH_CONTINUE(step_block);
4622 /* Create the loop body. */
4623 statement_to_firm(statement->body);
4624 jump_if_reachable(step_block);
4626 /* Create the step code. */
4628 mature_immBlock(step_block);
4629 set_cur_block(step_block);
4630 expression_to_firm(step);
4631 jump_if_reachable(header_block);
4634 mature_immBlock(header_block);
4635 assert(false_block == NULL || false_block == break_label);
4636 false_block = break_label;
4637 if (false_block != NULL) {
4638 mature_immBlock(false_block);
4640 set_cur_block(false_block);
4647 static ir_node *create_jump_statement(const statement_t *statement, ir_node *target_block)
4649 if (!currently_reachable())
4652 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
4653 ir_node *jump = new_d_Jmp(dbgi);
4654 add_immBlock_pred(target_block, jump);
4656 set_unreachable_now();
4660 static ir_switch_table *create_switch_table(const switch_statement_t *statement)
4662 /* determine number of cases */
4664 for (case_label_statement_t *l = statement->first_case; l != NULL;
4667 if (l->expression == NULL)
4669 if (l->is_empty_range)
4674 ir_switch_table *res = ir_new_switch_table(current_ir_graph, n_cases);
4676 for (case_label_statement_t *l = statement->first_case; l != NULL;
4678 if (l->expression == NULL) {
4679 l->pn = pn_Switch_default;
4682 if (l->is_empty_range)
4684 ir_tarval *min = fold_constant_to_tarval(l->expression);
4685 ir_tarval *max = min;
4686 long pn = (long) i+1;
4687 if (l->end_range != NULL)
4688 max = fold_constant_to_tarval(l->end_range);
4689 ir_switch_table_set(res, i++, min, max, pn);
4695 static ir_node *switch_statement_to_firm(switch_statement_t *statement)
4697 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
4698 ir_node *switch_node = NULL;
4700 if (currently_reachable()) {
4701 ir_node *expression = expression_to_firm(statement->expression);
4702 ir_switch_table *table = create_switch_table(statement);
4703 unsigned n_outs = (unsigned)ir_switch_table_get_n_entries(table) + 1;
4705 switch_node = new_d_Switch(dbgi, expression, n_outs, table);
4708 set_unreachable_now();
4711 ir_node *const old_switch = current_switch;
4712 const bool old_saw_default_label = saw_default_label;
4713 saw_default_label = false;
4714 current_switch = switch_node;
4716 statement_to_firm(statement->body);
4718 if (currently_reachable()) {
4719 add_immBlock_pred(get_break_label(), new_Jmp());
4722 if (!saw_default_label && switch_node) {
4723 ir_node *proj = new_d_Proj(dbgi, switch_node, mode_X, pn_Switch_default);
4724 add_immBlock_pred(get_break_label(), proj);
4727 if (break_label != NULL) {
4728 mature_immBlock(break_label);
4730 set_cur_block(break_label);
4732 assert(current_switch == switch_node);
4733 current_switch = old_switch;
4734 saw_default_label = old_saw_default_label;
4739 static ir_node *case_label_to_firm(const case_label_statement_t *statement)
4741 if (statement->is_empty_range)
4744 if (current_switch != NULL) {
4745 ir_node *block = new_immBlock();
4746 /* Fallthrough from previous case */
4747 jump_if_reachable(block);
4749 ir_node *const proj = new_Proj(current_switch, mode_X, statement->pn);
4750 add_immBlock_pred(block, proj);
4751 if (statement->expression == NULL)
4752 saw_default_label = true;
4754 mature_immBlock(block);
4755 set_cur_block(block);
4758 return statement_to_firm(statement->statement);
4761 static ir_node *label_to_firm(const label_statement_t *statement)
4763 ir_node *block = get_label_block(statement->label);
4767 keep_all_memory(block);
4769 return statement_to_firm(statement->statement);
4772 static ir_node *computed_goto_to_firm(computed_goto_statement_t const *const statement)
4774 if (!currently_reachable())
4777 ir_node *const irn = expression_to_firm(statement->expression);
4778 dbg_info *const dbgi = get_dbg_info(&statement->base.source_position);
4779 ir_node *const ijmp = new_d_IJmp(dbgi, irn);
4781 set_irn_link(ijmp, ijmp_list);
4784 set_unreachable_now();
4788 static ir_node *asm_statement_to_firm(const asm_statement_t *statement)
4790 bool needs_memory = statement->is_volatile;
4791 size_t n_clobbers = 0;
4792 asm_clobber_t *clobber = statement->clobbers;
4793 for ( ; clobber != NULL; clobber = clobber->next) {
4794 const char *clobber_str = clobber->clobber.begin;
4796 if (!be_is_valid_clobber(clobber_str)) {
4797 errorf(&statement->base.source_position,
4798 "invalid clobber '%s' specified", clobber->clobber);
4802 if (streq(clobber_str, "memory")) {
4803 needs_memory = true;
4807 ident *id = new_id_from_str(clobber_str);
4808 obstack_ptr_grow(&asm_obst, id);
4811 assert(obstack_object_size(&asm_obst) == n_clobbers * sizeof(ident*));
4812 ident **clobbers = NULL;
4813 if (n_clobbers > 0) {
4814 clobbers = obstack_finish(&asm_obst);
4817 size_t n_inputs = 0;
4818 asm_argument_t *argument = statement->inputs;
4819 for ( ; argument != NULL; argument = argument->next)
4821 size_t n_outputs = 0;
4822 argument = statement->outputs;
4823 for ( ; argument != NULL; argument = argument->next)
4826 unsigned next_pos = 0;
4828 ir_node *ins[n_inputs + n_outputs + 1];
4831 ir_asm_constraint tmp_in_constraints[n_outputs];
4833 const expression_t *out_exprs[n_outputs];
4834 ir_node *out_addrs[n_outputs];
4835 size_t out_size = 0;
4837 argument = statement->outputs;
4838 for ( ; argument != NULL; argument = argument->next) {
4839 const char *constraints = argument->constraints.begin;
4840 asm_constraint_flags_t asm_flags
4841 = be_parse_asm_constraints(constraints);
4844 source_position_t const *const pos = &statement->base.source_position;
4845 if (asm_flags & ASM_CONSTRAINT_FLAG_NO_SUPPORT) {
4846 warningf(WARN_OTHER, pos, "some constraints in '%s' are not supported", constraints);
4848 if (asm_flags & ASM_CONSTRAINT_FLAG_INVALID) {
4849 errorf(pos, "some constraints in '%s' are invalid", constraints);
4852 if (! (asm_flags & ASM_CONSTRAINT_FLAG_MODIFIER_WRITE)) {
4853 errorf(pos, "no write flag specified for output constraints '%s'", constraints);
4858 unsigned pos = next_pos++;
4859 if ( (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE)
4860 || (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER) ) {
4861 expression_t *expr = argument->expression;
4862 ir_node *addr = expression_to_addr(expr);
4863 /* in+output, construct an artifical same_as constraint on the
4865 if (asm_flags & ASM_CONSTRAINT_FLAG_MODIFIER_READ) {
4867 ir_node *value = get_value_from_lvalue(expr, addr);
4869 snprintf(buf, sizeof(buf), "%u", (unsigned) out_size);
4871 ir_asm_constraint constraint;
4872 constraint.pos = pos;
4873 constraint.constraint = new_id_from_str(buf);
4874 constraint.mode = get_ir_mode_storage(expr->base.type);
4875 tmp_in_constraints[in_size] = constraint;
4876 ins[in_size] = value;
4881 out_exprs[out_size] = expr;
4882 out_addrs[out_size] = addr;
4884 } else if (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP) {
4885 /* pure memory ops need no input (but we have to make sure we
4886 * attach to the memory) */
4887 assert(! (asm_flags &
4888 (ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE
4889 | ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER)));
4890 needs_memory = true;
4892 /* we need to attach the address to the inputs */
4893 expression_t *expr = argument->expression;
4895 ir_asm_constraint constraint;
4896 constraint.pos = pos;
4897 constraint.constraint = new_id_from_str(constraints);
4898 constraint.mode = mode_M;
4899 tmp_in_constraints[in_size] = constraint;
4901 ins[in_size] = expression_to_addr(expr);
4905 errorf(&statement->base.source_position,
4906 "only modifiers but no place set in constraints '%s'",
4911 ir_asm_constraint constraint;
4912 constraint.pos = pos;
4913 constraint.constraint = new_id_from_str(constraints);
4914 constraint.mode = get_ir_mode_storage(argument->expression->base.type);
4916 obstack_grow(&asm_obst, &constraint, sizeof(constraint));
4918 assert(obstack_object_size(&asm_obst)
4919 == out_size * sizeof(ir_asm_constraint));
4920 ir_asm_constraint *output_constraints = obstack_finish(&asm_obst);
4923 obstack_grow(&asm_obst, tmp_in_constraints,
4924 in_size * sizeof(tmp_in_constraints[0]));
4925 /* find and count input and output arguments */
4926 argument = statement->inputs;
4927 for ( ; argument != NULL; argument = argument->next) {
4928 const char *constraints = argument->constraints.begin;
4929 asm_constraint_flags_t asm_flags
4930 = be_parse_asm_constraints(constraints);
4932 if (asm_flags & ASM_CONSTRAINT_FLAG_NO_SUPPORT) {
4933 errorf(&statement->base.source_position,
4934 "some constraints in '%s' are not supported", constraints);
4937 if (asm_flags & ASM_CONSTRAINT_FLAG_INVALID) {
4938 errorf(&statement->base.source_position,
4939 "some constraints in '%s' are invalid", constraints);
4942 if (asm_flags & ASM_CONSTRAINT_FLAG_MODIFIER_WRITE) {
4943 errorf(&statement->base.source_position,
4944 "write flag specified for input constraints '%s'",
4950 if ( (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE)
4951 || (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER) ) {
4952 /* we can treat this as "normal" input */
4953 input = expression_to_firm(argument->expression);
4954 } else if (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP) {
4955 /* pure memory ops need no input (but we have to make sure we
4956 * attach to the memory) */
4957 assert(! (asm_flags &
4958 (ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE
4959 | ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER)));
4960 needs_memory = true;
4961 input = expression_to_addr(argument->expression);
4963 errorf(&statement->base.source_position,
4964 "only modifiers but no place set in constraints '%s'",
4969 ir_asm_constraint constraint;
4970 constraint.pos = next_pos++;
4971 constraint.constraint = new_id_from_str(constraints);
4972 constraint.mode = get_irn_mode(input);
4974 obstack_grow(&asm_obst, &constraint, sizeof(constraint));
4975 ins[in_size++] = input;
4978 ir_node *mem = needs_memory ? get_store() : new_NoMem();
4979 assert(obstack_object_size(&asm_obst)
4980 == in_size * sizeof(ir_asm_constraint));
4981 ir_asm_constraint *input_constraints = obstack_finish(&asm_obst);
4983 /* create asm node */
4984 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
4986 ident *asm_text = new_id_from_str(statement->asm_text.begin);
4988 ir_node *node = new_d_ASM(dbgi, mem, in_size, ins, input_constraints,
4989 out_size, output_constraints,
4990 n_clobbers, clobbers, asm_text);
4992 if (statement->is_volatile) {
4993 set_irn_pinned(node, op_pin_state_pinned);
4995 set_irn_pinned(node, op_pin_state_floats);
4998 /* create output projs & connect them */
5000 ir_node *projm = new_Proj(node, mode_M, out_size);
5005 for (i = 0; i < out_size; ++i) {
5006 const expression_t *out_expr = out_exprs[i];
5008 ir_mode *mode = get_ir_mode_storage(out_expr->base.type);
5009 ir_node *proj = new_Proj(node, mode, pn);
5010 ir_node *addr = out_addrs[i];
5012 set_value_for_expression_addr(out_expr, proj, addr);
5018 static ir_node *ms_try_statement_to_firm(ms_try_statement_t *statement)
5020 statement_to_firm(statement->try_statement);
5021 source_position_t const *const pos = &statement->base.source_position;
5022 warningf(WARN_OTHER, pos, "structured exception handling ignored");
5026 static ir_node *leave_statement_to_firm(leave_statement_t *statement)
5028 errorf(&statement->base.source_position, "__leave not supported yet");
5033 * Transform a statement.
5035 static ir_node *statement_to_firm(statement_t *const stmt)
5038 assert(!stmt->base.transformed);
5039 stmt->base.transformed = true;
5042 switch (stmt->kind) {
5043 case STATEMENT_ASM: return asm_statement_to_firm( &stmt->asms);
5044 case STATEMENT_CASE_LABEL: return case_label_to_firm( &stmt->case_label);
5045 case STATEMENT_COMPOUND: return compound_statement_to_firm( &stmt->compound);
5046 case STATEMENT_COMPUTED_GOTO: return computed_goto_to_firm( &stmt->computed_goto);
5047 case STATEMENT_DECLARATION: return declaration_statement_to_firm(&stmt->declaration);
5048 case STATEMENT_DO_WHILE: return do_while_statement_to_firm( &stmt->do_while);
5049 case STATEMENT_EMPTY: return NULL; /* nothing */
5050 case STATEMENT_EXPRESSION: return expression_statement_to_firm( &stmt->expression);
5051 case STATEMENT_FOR: return for_statement_to_firm( &stmt->fors);
5052 case STATEMENT_IF: return if_statement_to_firm( &stmt->ifs);
5053 case STATEMENT_LABEL: return label_to_firm( &stmt->label);
5054 case STATEMENT_LEAVE: return leave_statement_to_firm( &stmt->leave);
5055 case STATEMENT_MS_TRY: return ms_try_statement_to_firm( &stmt->ms_try);
5056 case STATEMENT_RETURN: return return_statement_to_firm( &stmt->returns);
5057 case STATEMENT_SWITCH: return switch_statement_to_firm( &stmt->switchs);
5059 case STATEMENT_BREAK: return create_jump_statement(stmt, get_break_label());
5060 case STATEMENT_CONTINUE: return create_jump_statement(stmt, continue_label);
5061 case STATEMENT_GOTO: return create_jump_statement(stmt, get_label_block(stmt->gotos.label));
5063 case STATEMENT_ERROR: panic("error statement found");
5065 panic("statement not implemented");
5068 static int count_local_variables(const entity_t *entity,
5069 const entity_t *const last)
5072 entity_t const *const end = last != NULL ? last->base.next : NULL;
5073 for (; entity != end; entity = entity->base.next) {
5074 if ((entity->kind == ENTITY_VARIABLE || entity->kind == ENTITY_PARAMETER) &&
5075 !var_needs_entity(&entity->variable))
5081 static void count_local_variables_in_stmt(statement_t *stmt, void *const env)
5083 int *const count = env;
5085 switch (stmt->kind) {
5086 case STATEMENT_DECLARATION: {
5087 const declaration_statement_t *const decl_stmt = &stmt->declaration;
5088 *count += count_local_variables(decl_stmt->declarations_begin,
5089 decl_stmt->declarations_end);
5094 *count += count_local_variables(stmt->fors.scope.entities, NULL);
5103 * Return the number of local (alias free) variables used by a function.
5105 static int get_function_n_local_vars(entity_t *entity)
5107 const function_t *function = &entity->function;
5110 /* count parameters */
5111 count += count_local_variables(function->parameters.entities, NULL);
5113 /* count local variables declared in body */
5114 walk_statements(function->body, count_local_variables_in_stmt, &count);
5119 * Build Firm code for the parameters of a function.
5121 static void initialize_function_parameters(entity_t *entity)
5123 assert(entity->kind == ENTITY_FUNCTION);
5124 ir_graph *irg = current_ir_graph;
5125 ir_node *args = get_irg_args(irg);
5127 ir_type *function_irtype;
5129 if (entity->function.need_closure) {
5130 /* add an extra parameter for the static link */
5131 entity->function.static_link = new_r_Proj(args, mode_P_data, 0);
5134 /* Matze: IMO this is wrong, nested functions should have an own
5135 * type and not rely on strange parameters... */
5136 function_irtype = create_method_type(&entity->declaration.type->function, true);
5138 function_irtype = get_ir_type(entity->declaration.type);
5143 entity_t *parameter = entity->function.parameters.entities;
5144 for ( ; parameter != NULL; parameter = parameter->base.next, ++n) {
5145 if (parameter->kind != ENTITY_PARAMETER)
5148 assert(parameter->declaration.kind == DECLARATION_KIND_UNKNOWN);
5149 type_t *type = skip_typeref(parameter->declaration.type);
5151 dbg_info *const dbgi = get_dbg_info(¶meter->base.source_position);
5152 ir_type *const param_irtype = get_method_param_type(function_irtype, n);
5153 if (var_needs_entity(¶meter->variable)) {
5154 ir_type *frame_type = get_irg_frame_type(irg);
5156 = new_d_parameter_entity(frame_type, n, param_irtype, dbgi);
5157 parameter->declaration.kind = DECLARATION_KIND_PARAMETER_ENTITY;
5158 parameter->variable.v.entity = param;
5162 ir_mode *param_mode = get_type_mode(param_irtype);
5164 ir_node *value = new_rd_Proj(dbgi, args, param_mode, pn);
5166 ir_mode *mode = get_ir_mode_storage(type);
5167 value = create_conv(NULL, value, mode);
5169 parameter->declaration.kind = DECLARATION_KIND_PARAMETER;
5170 parameter->variable.v.value_number = next_value_number_function;
5171 set_irg_loc_description(current_ir_graph, next_value_number_function,
5173 ++next_value_number_function;
5175 set_value(parameter->variable.v.value_number, value);
5180 * Handle additional decl modifiers for IR-graphs
5182 * @param irg the IR-graph
5183 * @param dec_modifiers additional modifiers
5185 static void handle_decl_modifier_irg(ir_graph *irg,
5186 decl_modifiers_t decl_modifiers)
5188 if (decl_modifiers & DM_NAKED) {
5189 /* TRUE if the declaration includes the Microsoft
5190 __declspec(naked) specifier. */
5191 add_irg_additional_properties(irg, mtp_property_naked);
5193 if (decl_modifiers & DM_FORCEINLINE) {
5194 /* TRUE if the declaration includes the
5195 Microsoft __forceinline specifier. */
5196 set_irg_inline_property(irg, irg_inline_forced);
5198 if (decl_modifiers & DM_NOINLINE) {
5199 /* TRUE if the declaration includes the Microsoft
5200 __declspec(noinline) specifier. */
5201 set_irg_inline_property(irg, irg_inline_forbidden);
5205 static void add_function_pointer(ir_type *segment, ir_entity *method,
5206 const char *unique_template)
5208 ir_type *method_type = get_entity_type(method);
5209 ir_type *ptr_type = new_type_pointer(method_type);
5211 /* these entities don't really have a name but firm only allows
5213 * Note that we mustn't give these entities a name since for example
5214 * Mach-O doesn't allow them. */
5215 ident *ide = id_unique(unique_template);
5216 ir_entity *ptr = new_entity(segment, ide, ptr_type);
5217 ir_graph *irg = get_const_code_irg();
5218 ir_node *val = new_rd_SymConst_addr_ent(NULL, irg, mode_P_code,
5221 set_entity_ld_ident(ptr, new_id_from_chars("", 0));
5222 set_entity_compiler_generated(ptr, 1);
5223 set_entity_visibility(ptr, ir_visibility_private);
5224 add_entity_linkage(ptr, IR_LINKAGE_CONSTANT|IR_LINKAGE_HIDDEN_USER);
5225 set_atomic_ent_value(ptr, val);
5229 * Generate possible IJmp branches to a given label block.
5231 static void gen_ijmp_branches(ir_node *block)
5234 for (ijmp = ijmp_list; ijmp != NULL; ijmp = get_irn_link(ijmp)) {
5235 add_immBlock_pred(block, ijmp);
5240 * Create code for a function and all inner functions.
5242 * @param entity the function entity
5244 static void create_function(entity_t *entity)
5246 assert(entity->kind == ENTITY_FUNCTION);
5247 ir_entity *function_entity = get_function_entity(entity, current_outer_frame);
5249 if (entity->function.body == NULL)
5252 inner_functions = NULL;
5253 current_trampolines = NULL;
5255 if (entity->declaration.modifiers & DM_CONSTRUCTOR) {
5256 ir_type *segment = get_segment_type(IR_SEGMENT_CONSTRUCTORS);
5257 add_function_pointer(segment, function_entity, "constructor_ptr.%u");
5259 if (entity->declaration.modifiers & DM_DESTRUCTOR) {
5260 ir_type *segment = get_segment_type(IR_SEGMENT_DESTRUCTORS);
5261 add_function_pointer(segment, function_entity, "destructor_ptr.%u");
5264 current_function_entity = entity;
5265 current_function_name = NULL;
5266 current_funcsig = NULL;
5268 assert(all_labels == NULL);
5269 all_labels = NEW_ARR_F(label_t *, 0);
5272 int n_local_vars = get_function_n_local_vars(entity);
5273 ir_graph *irg = new_ir_graph(function_entity, n_local_vars);
5274 current_ir_graph = irg;
5276 ir_graph *old_current_function = current_function;
5277 current_function = irg;
5279 ir_entity *const old_current_vararg_entity = current_vararg_entity;
5280 current_vararg_entity = NULL;
5282 set_irg_fp_model(irg, firm_fp_model);
5283 tarval_enable_fp_ops(1);
5284 set_irn_dbg_info(get_irg_start_block(irg),
5285 get_entity_dbg_info(function_entity));
5287 /* set inline flags */
5288 if (entity->function.is_inline)
5289 set_irg_inline_property(irg, irg_inline_recomended);
5290 handle_decl_modifier_irg(irg, entity->declaration.modifiers);
5292 next_value_number_function = 0;
5293 initialize_function_parameters(entity);
5294 current_static_link = entity->function.static_link;
5296 statement_to_firm(entity->function.body);
5298 ir_node *end_block = get_irg_end_block(irg);
5300 /* do we have a return statement yet? */
5301 if (currently_reachable()) {
5302 type_t *type = skip_typeref(entity->declaration.type);
5303 assert(is_type_function(type));
5304 type_t *const return_type = skip_typeref(type->function.return_type);
5307 if (is_type_void(return_type)) {
5308 ret = new_Return(get_store(), 0, NULL);
5310 ir_mode *const mode = get_ir_mode_storage(return_type);
5313 /* ยง5.1.2.2.3 main implicitly returns 0 */
5314 if (is_main(entity)) {
5315 in[0] = new_Const(get_mode_null(mode));
5317 in[0] = new_Unknown(mode);
5319 ret = new_Return(get_store(), 1, in);
5321 add_immBlock_pred(end_block, ret);
5324 for (int i = ARR_LEN(all_labels) - 1; i >= 0; --i) {
5325 label_t *label = all_labels[i];
5326 if (label->address_taken) {
5327 gen_ijmp_branches(label->block);
5329 mature_immBlock(label->block);
5332 DEL_ARR_F(all_labels);
5335 irg_finalize_cons(irg);
5337 /* finalize the frame type */
5338 ir_type *frame_type = get_irg_frame_type(irg);
5339 int n = get_compound_n_members(frame_type);
5342 for (int i = 0; i < n; ++i) {
5343 ir_entity *member = get_compound_member(frame_type, i);
5344 ir_type *entity_type = get_entity_type(member);
5346 int align = get_type_alignment_bytes(entity_type);
5347 if (align > align_all)
5351 misalign = offset % align;
5353 offset += align - misalign;
5357 set_entity_offset(member, offset);
5358 offset += get_type_size_bytes(entity_type);
5360 set_type_size_bytes(frame_type, offset);
5361 set_type_alignment_bytes(frame_type, align_all);
5363 irg_verify(irg, VERIFY_ENFORCE_SSA);
5364 current_vararg_entity = old_current_vararg_entity;
5365 current_function = old_current_function;
5367 if (current_trampolines != NULL) {
5368 DEL_ARR_F(current_trampolines);
5369 current_trampolines = NULL;
5372 /* create inner functions if any */
5373 entity_t **inner = inner_functions;
5374 if (inner != NULL) {
5375 ir_type *rem_outer_frame = current_outer_frame;
5376 current_outer_frame = get_irg_frame_type(current_ir_graph);
5377 for (int i = ARR_LEN(inner) - 1; i >= 0; --i) {
5378 create_function(inner[i]);
5382 current_outer_frame = rem_outer_frame;
5386 static void scope_to_firm(scope_t *scope)
5388 /* first pass: create declarations */
5389 entity_t *entity = scope->entities;
5390 for ( ; entity != NULL; entity = entity->base.next) {
5391 if (entity->base.symbol == NULL)
5394 if (entity->kind == ENTITY_FUNCTION) {
5395 if (entity->function.btk != BUILTIN_NONE) {
5396 /* builtins have no representation */
5399 (void)get_function_entity(entity, NULL);
5400 } else if (entity->kind == ENTITY_VARIABLE) {
5401 create_global_variable(entity);
5402 } else if (entity->kind == ENTITY_NAMESPACE) {
5403 scope_to_firm(&entity->namespacee.members);
5407 /* second pass: create code/initializers */
5408 entity = scope->entities;
5409 for ( ; entity != NULL; entity = entity->base.next) {
5410 if (entity->base.symbol == NULL)
5413 if (entity->kind == ENTITY_FUNCTION) {
5414 if (entity->function.btk != BUILTIN_NONE) {
5415 /* builtins have no representation */
5418 create_function(entity);
5419 } else if (entity->kind == ENTITY_VARIABLE) {
5420 assert(entity->declaration.kind
5421 == DECLARATION_KIND_GLOBAL_VARIABLE);
5422 current_ir_graph = get_const_code_irg();
5423 create_variable_initializer(entity);
5428 void init_ast2firm(void)
5430 obstack_init(&asm_obst);
5431 init_atomic_modes();
5433 ir_set_debug_retrieve(dbg_retrieve);
5434 ir_set_type_debug_retrieve(dbg_print_type_dbg_info);
5436 /* create idents for all known runtime functions */
5437 for (size_t i = 0; i < lengthof(rts_data); ++i) {
5438 rts_idents[i] = new_id_from_str(rts_data[i].name);
5441 entitymap_init(&entitymap);
5444 static void init_ir_types(void)
5446 static int ir_types_initialized = 0;
5447 if (ir_types_initialized)
5449 ir_types_initialized = 1;
5451 ir_type_char = get_ir_type(type_char);
5452 ir_type_wchar_t = get_ir_type(type_wchar_t);
5454 be_params = be_get_backend_param();
5455 mode_float_arithmetic = be_params->mode_float_arithmetic;
5457 stack_param_align = be_params->stack_param_align;
5460 void exit_ast2firm(void)
5462 entitymap_destroy(&entitymap);
5463 obstack_free(&asm_obst, NULL);
5466 static void global_asm_to_firm(statement_t *s)
5468 for (; s != NULL; s = s->base.next) {
5469 assert(s->kind == STATEMENT_ASM);
5471 char const *const text = s->asms.asm_text.begin;
5472 size_t const size = s->asms.asm_text.size;
5473 ident *const id = new_id_from_chars(text, size);
5478 static const char *get_cwd(void)
5480 static char buf[1024];
5481 if (buf[0] == '\0') {
5482 return getcwd(buf, sizeof(buf));
5487 void translation_unit_to_firm(translation_unit_t *unit)
5489 if (c_mode & _CXX) {
5490 be_dwarf_set_source_language(DW_LANG_C_plus_plus);
5491 } else if (c_mode & _C99) {
5492 be_dwarf_set_source_language(DW_LANG_C99);
5493 } else if (c_mode & _C89) {
5494 be_dwarf_set_source_language(DW_LANG_C89);
5496 be_dwarf_set_source_language(DW_LANG_C);
5498 const char *cwd = get_cwd();
5500 be_dwarf_set_compilation_directory(cwd);
5503 /* initialize firm arithmetic */
5504 tarval_set_integer_overflow_mode(TV_OVERFLOW_WRAP);
5505 ir_set_uninitialized_local_variable_func(uninitialized_local_var);
5507 /* just to be sure */
5508 continue_label = NULL;
5510 current_switch = NULL;
5511 current_translation_unit = unit;
5515 scope_to_firm(&unit->scope);
5516 global_asm_to_firm(unit->global_asm);
5518 current_ir_graph = NULL;
5519 current_translation_unit = NULL;