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 entity_t **inner_functions;
80 static ir_node *ijmp_list;
81 static ir_node **ijmp_blocks;
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 void determine_enum_values(enum_type_t *const type)
630 ir_mode *const mode = atomic_modes[type->base.akind];
631 ir_tarval *const one = get_mode_one(mode);
632 ir_tarval * tv_next = get_mode_null(mode);
634 enum_t *enume = type->enume;
635 entity_t *entry = enume->base.next;
636 for (; entry != NULL; entry = entry->base.next) {
637 if (entry->kind != ENTITY_ENUM_VALUE)
640 expression_t *const init = entry->enum_value.value;
642 tv_next = fold_constant_to_tarval(init);
644 assert(entry->enum_value.tv == NULL || entry->enum_value.tv == tv_next);
645 entry->enum_value.tv = tv_next;
646 tv_next = tarval_add(tv_next, one);
650 static ir_type *create_enum_type(enum_type_t *const type)
652 return create_atomic_type(type->base.akind, (const type_t*) type);
655 static ir_type *get_ir_type_incomplete(type_t *type)
657 type = skip_typeref(type);
659 if (type->base.firm_type != NULL) {
660 return type->base.firm_type;
663 if (is_type_compound(type)) {
664 return create_compound_type(&type->compound, true);
666 return get_ir_type(type);
670 ir_type *get_ir_type(type_t *type)
672 type = skip_typeref(type);
674 if (type->base.firm_type != NULL) {
675 return type->base.firm_type;
678 ir_type *firm_type = NULL;
679 switch (type->kind) {
681 firm_type = create_atomic_type(type->atomic.akind, type);
684 firm_type = create_complex_type(&type->atomic);
687 firm_type = create_imaginary_type(&type->atomic);
690 firm_type = create_method_type(&type->function, false);
693 firm_type = create_pointer_type(&type->pointer);
696 firm_type = create_reference_type(&type->reference);
699 firm_type = create_array_type(&type->array);
701 case TYPE_COMPOUND_STRUCT:
702 case TYPE_COMPOUND_UNION:
703 firm_type = create_compound_type(&type->compound, false);
706 firm_type = create_enum_type(&type->enumt);
714 if (firm_type == NULL)
715 panic("unknown type found");
717 type->base.firm_type = firm_type;
721 static ir_mode *get_ir_mode_storage(type_t *type)
723 type = skip_typeref(type);
725 /* Firm doesn't report a mode for arrays and structs/unions. */
726 if (!is_type_scalar(type)) {
730 ir_type *const irtype = get_ir_type(type);
731 ir_mode *const mode = get_type_mode(irtype);
732 assert(mode != NULL);
737 * get arithmetic mode for a type. This is different from get_ir_mode_storage,
738 * int that it returns bigger modes for floating point on some platforms
739 * (x87 internally does arithemtic with 80bits)
741 static ir_mode *get_ir_mode_arithmetic(type_t *type)
743 ir_mode *mode = get_ir_mode_storage(type);
744 if (mode_is_float(mode) && mode_float_arithmetic != NULL) {
745 return mode_float_arithmetic;
752 * Return a node representing the size of a type.
754 static ir_node *get_type_size_node(type_t *type)
757 ir_mode *mode = get_ir_mode_arithmetic(type_size_t);
758 type = skip_typeref(type);
760 if (is_type_array(type) && type->array.is_vla) {
761 ir_node *size_node = get_vla_size(&type->array);
762 ir_node *elem_size = get_type_size_node(type->array.element_type);
763 ir_node *real_size = new_d_Mul(NULL, size_node, elem_size, mode);
767 size = get_type_size(type);
768 return new_Const_long(mode, size);
771 /** Names of the runtime functions. */
772 static const struct {
773 int id; /**< the rts id */
774 int n_res; /**< number of return values */
775 const char *name; /**< the name of the rts function */
776 int n_params; /**< number of parameters */
777 unsigned flags; /**< language flags */
779 { rts_debugbreak, 0, "__debugbreak", 0, _MS },
780 { rts_abort, 0, "abort", 0, _C89 },
781 { rts_alloca, 1, "alloca", 1, _ALL },
782 { rts_abs, 1, "abs", 1, _C89 },
783 { rts_labs, 1, "labs", 1, _C89 },
784 { rts_llabs, 1, "llabs", 1, _C99 },
785 { rts_imaxabs, 1, "imaxabs", 1, _C99 },
787 { rts_fabs, 1, "fabs", 1, _C89 },
788 { rts_sqrt, 1, "sqrt", 1, _C89 },
789 { rts_cbrt, 1, "cbrt", 1, _C99 },
790 { rts_exp, 1, "exp", 1, _C89 },
791 { rts_exp2, 1, "exp2", 1, _C89 },
792 { rts_exp10, 1, "exp10", 1, _GNUC },
793 { rts_log, 1, "log", 1, _C89 },
794 { rts_log2, 1, "log2", 1, _C89 },
795 { rts_log10, 1, "log10", 1, _C89 },
796 { rts_pow, 1, "pow", 2, _C89 },
797 { rts_sin, 1, "sin", 1, _C89 },
798 { rts_cos, 1, "cos", 1, _C89 },
799 { rts_tan, 1, "tan", 1, _C89 },
800 { rts_asin, 1, "asin", 1, _C89 },
801 { rts_acos, 1, "acos", 1, _C89 },
802 { rts_atan, 1, "atan", 1, _C89 },
803 { rts_sinh, 1, "sinh", 1, _C89 },
804 { rts_cosh, 1, "cosh", 1, _C89 },
805 { rts_tanh, 1, "tanh", 1, _C89 },
807 { rts_fabsf, 1, "fabsf", 1, _C99 },
808 { rts_sqrtf, 1, "sqrtf", 1, _C99 },
809 { rts_cbrtf, 1, "cbrtf", 1, _C99 },
810 { rts_expf, 1, "expf", 1, _C99 },
811 { rts_exp2f, 1, "exp2f", 1, _C99 },
812 { rts_exp10f, 1, "exp10f", 1, _GNUC },
813 { rts_logf, 1, "logf", 1, _C99 },
814 { rts_log2f, 1, "log2f", 1, _C99 },
815 { rts_log10f, 1, "log10f", 1, _C99 },
816 { rts_powf, 1, "powf", 2, _C99 },
817 { rts_sinf, 1, "sinf", 1, _C99 },
818 { rts_cosf, 1, "cosf", 1, _C99 },
819 { rts_tanf, 1, "tanf", 1, _C99 },
820 { rts_asinf, 1, "asinf", 1, _C99 },
821 { rts_acosf, 1, "acosf", 1, _C99 },
822 { rts_atanf, 1, "atanf", 1, _C99 },
823 { rts_sinhf, 1, "sinhf", 1, _C99 },
824 { rts_coshf, 1, "coshf", 1, _C99 },
825 { rts_tanhf, 1, "tanhf", 1, _C99 },
827 { rts_fabsl, 1, "fabsl", 1, _C99 },
828 { rts_sqrtl, 1, "sqrtl", 1, _C99 },
829 { rts_cbrtl, 1, "cbrtl", 1, _C99 },
830 { rts_expl, 1, "expl", 1, _C99 },
831 { rts_exp2l, 1, "exp2l", 1, _C99 },
832 { rts_exp10l, 1, "exp10l", 1, _GNUC },
833 { rts_logl, 1, "logl", 1, _C99 },
834 { rts_log2l, 1, "log2l", 1, _C99 },
835 { rts_log10l, 1, "log10l", 1, _C99 },
836 { rts_powl, 1, "powl", 2, _C99 },
837 { rts_sinl, 1, "sinl", 1, _C99 },
838 { rts_cosl, 1, "cosl", 1, _C99 },
839 { rts_tanl, 1, "tanl", 1, _C99 },
840 { rts_asinl, 1, "asinl", 1, _C99 },
841 { rts_acosl, 1, "acosl", 1, _C99 },
842 { rts_atanl, 1, "atanl", 1, _C99 },
843 { rts_sinhl, 1, "sinhl", 1, _C99 },
844 { rts_coshl, 1, "coshl", 1, _C99 },
845 { rts_tanhl, 1, "tanhl", 1, _C99 },
847 { rts_strcmp, 1, "strcmp", 2, _C89 },
848 { rts_strncmp, 1, "strncmp", 3, _C89 },
849 { rts_strcpy, 1, "strcpy", 2, _C89 },
850 { rts_strlen, 1, "strlen", 1, _C89 },
851 { rts_memcpy, 1, "memcpy", 3, _C89 },
852 { rts_mempcpy, 1, "mempcpy", 3, _GNUC },
853 { rts_memmove, 1, "memmove", 3, _C89 },
854 { rts_memset, 1, "memset", 3, _C89 },
855 { rts_memcmp, 1, "memcmp", 3, _C89 },
858 static ident *rts_idents[lengthof(rts_data)];
860 static create_ld_ident_func create_ld_ident = create_name_linux_elf;
862 void set_create_ld_ident(ident *(*func)(entity_t*))
864 create_ld_ident = func;
867 static bool declaration_is_definition(const entity_t *entity)
869 switch (entity->kind) {
870 case ENTITY_VARIABLE:
871 return entity->declaration.storage_class != STORAGE_CLASS_EXTERN;
872 case ENTITY_FUNCTION:
873 return entity->function.body != NULL;
874 case ENTITY_PARAMETER:
875 case ENTITY_COMPOUND_MEMBER:
879 case ENTITY_ENUM_VALUE:
880 case ENTITY_NAMESPACE:
882 case ENTITY_LOCAL_LABEL:
885 panic("declaration_is_definition called on non-declaration");
889 * Handle GNU attributes for entities
891 * @param ent the entity
892 * @param decl the routine declaration
894 static void handle_decl_modifiers(ir_entity *irentity, entity_t *entity)
896 assert(is_declaration(entity));
897 decl_modifiers_t modifiers = entity->declaration.modifiers;
899 if (is_method_entity(irentity)) {
900 if (modifiers & DM_PURE)
901 add_entity_additional_properties(irentity, mtp_property_pure);
902 if (modifiers & DM_CONST)
903 add_entity_additional_properties(irentity, mtp_property_const);
904 if (modifiers & DM_NOINLINE)
905 add_entity_additional_properties(irentity, mtp_property_noinline);
906 if (modifiers & DM_FORCEINLINE)
907 add_entity_additional_properties(irentity, mtp_property_always_inline);
908 if (modifiers & DM_NAKED)
909 add_entity_additional_properties(irentity, mtp_property_naked);
910 if (entity->kind == ENTITY_FUNCTION && entity->function.is_inline)
911 add_entity_additional_properties(irentity,
912 mtp_property_inline_recommended);
914 if ((modifiers & DM_USED) && declaration_is_definition(entity)) {
915 add_entity_linkage(irentity, IR_LINKAGE_HIDDEN_USER);
917 if ((modifiers & DM_WEAK) && declaration_is_definition(entity)
918 && entity->declaration.storage_class != STORAGE_CLASS_EXTERN) {
919 add_entity_linkage(irentity, IR_LINKAGE_WEAK);
923 static bool is_main(entity_t *entity)
925 static symbol_t *sym_main = NULL;
926 if (sym_main == NULL) {
927 sym_main = symbol_table_insert("main");
930 if (entity->base.symbol != sym_main)
932 /* must be in outermost scope */
933 if (entity->base.parent_scope != ¤t_translation_unit->scope)
940 * Creates an entity representing a function.
942 * @param entity the function declaration/definition
943 * @param owner_type the owner type of this function, NULL
944 * for global functions
946 static ir_entity *get_function_entity(entity_t *entity, ir_type *owner_type)
948 assert(entity->kind == ENTITY_FUNCTION);
949 if (entity->function.irentity != NULL)
950 return entity->function.irentity;
952 switch (entity->function.btk) {
955 case BUILTIN_LIBC_CHECK:
961 symbol_t *symbol = entity->base.symbol;
962 ident *id = new_id_from_str(symbol->string);
964 /* already an entity defined? */
965 ir_entity *irentity = entitymap_get(&entitymap, symbol);
966 bool const has_body = entity->function.body != NULL;
967 if (irentity != NULL) {
971 ir_type *ir_type_method;
972 if (entity->function.need_closure)
973 ir_type_method = create_method_type(&entity->declaration.type->function, true);
975 ir_type_method = get_ir_type(entity->declaration.type);
977 bool nested_function = false;
978 if (owner_type == NULL)
979 owner_type = get_glob_type();
981 nested_function = true;
983 dbg_info *const dbgi = get_dbg_info(&entity->base.source_position);
984 irentity = new_d_entity(owner_type, id, ir_type_method, dbgi);
988 ld_id = id_unique("inner.%u");
990 ld_id = create_ld_ident(entity);
991 set_entity_ld_ident(irentity, ld_id);
993 handle_decl_modifiers(irentity, entity);
995 if (! nested_function) {
996 storage_class_tag_t const storage_class
997 = (storage_class_tag_t) entity->declaration.storage_class;
998 if (storage_class == STORAGE_CLASS_STATIC) {
999 set_entity_visibility(irentity, ir_visibility_local);
1001 set_entity_visibility(irentity, ir_visibility_external);
1004 bool const is_inline = entity->function.is_inline;
1005 if (is_inline && has_body) {
1006 if (((c_mode & _C99) && storage_class == STORAGE_CLASS_NONE)
1007 || ((c_mode & _C99) == 0
1008 && storage_class == STORAGE_CLASS_EXTERN)) {
1009 add_entity_linkage(irentity, IR_LINKAGE_NO_CODEGEN);
1013 /* nested functions are always local */
1014 set_entity_visibility(irentity, ir_visibility_local);
1017 /* We should check for file scope here, but as long as we compile C only
1018 this is not needed. */
1019 if (!freestanding && !has_body) {
1020 /* check for a known runtime function */
1021 for (size_t i = 0; i < lengthof(rts_data); ++i) {
1022 if (id != rts_idents[i])
1025 function_type_t *function_type
1026 = &entity->declaration.type->function;
1027 /* rts_entities code can't handle a "wrong" number of parameters */
1028 if (function_type->unspecified_parameters)
1031 /* check number of parameters */
1032 int n_params = count_parameters(function_type);
1033 if (n_params != rts_data[i].n_params)
1036 type_t *return_type = skip_typeref(function_type->return_type);
1037 int n_res = is_type_void(return_type) ? 0 : 1;
1038 if (n_res != rts_data[i].n_res)
1041 /* ignore those rts functions not necessary needed for current mode */
1042 if ((c_mode & rts_data[i].flags) == 0)
1044 assert(rts_entities[rts_data[i].id] == NULL);
1045 rts_entities[rts_data[i].id] = irentity;
1049 entitymap_insert(&entitymap, symbol, irentity);
1052 entity->declaration.kind = DECLARATION_KIND_FUNCTION;
1053 entity->function.irentity = irentity;
1059 * Creates a SymConst for a given entity.
1061 * @param dbgi debug info
1062 * @param entity the entity
1064 static ir_node *create_symconst(dbg_info *dbgi, ir_entity *entity)
1066 assert(entity != NULL);
1067 union symconst_symbol sym;
1068 sym.entity_p = entity;
1069 return new_d_SymConst(dbgi, mode_P, sym, symconst_addr_ent);
1072 static ir_node *create_Const_from_bool(ir_mode *const mode, bool const v)
1074 return new_Const((v ? get_mode_one : get_mode_null)(mode));
1077 static ir_node *create_conv_from_b(dbg_info *dbgi, ir_node *value,
1080 if (is_Const(value)) {
1081 return create_Const_from_bool(dest_mode, !is_Const_null(value));
1084 ir_node *cond = new_d_Cond(dbgi, value);
1085 ir_node *proj_true = new_Proj(cond, mode_X, pn_Cond_true);
1086 ir_node *proj_false = new_Proj(cond, mode_X, pn_Cond_false);
1087 ir_node *tblock = new_Block(1, &proj_true);
1088 ir_node *fblock = new_Block(1, &proj_false);
1089 set_cur_block(tblock);
1090 ir_node *const1 = new_Const(get_mode_one(dest_mode));
1091 ir_node *tjump = new_Jmp();
1092 set_cur_block(fblock);
1093 ir_node *const0 = new_Const(get_mode_null(dest_mode));
1094 ir_node *fjump = new_Jmp();
1096 ir_node *in[2] = { tjump, fjump };
1097 ir_node *mergeblock = new_Block(2, in);
1098 set_cur_block(mergeblock);
1099 ir_node *phi_in[2] = { const1, const0 };
1100 ir_node *phi = new_Phi(2, phi_in, dest_mode);
1104 static ir_node *create_conv(dbg_info *dbgi, ir_node *value, ir_mode *dest_mode)
1106 ir_mode *value_mode = get_irn_mode(value);
1108 if (value_mode == dest_mode)
1111 if (dest_mode == mode_b) {
1112 ir_node *zero = new_Const(get_mode_null(value_mode));
1113 ir_node *cmp = new_d_Cmp(dbgi, value, zero, ir_relation_unordered_less_greater);
1115 } else if (value_mode == mode_b) {
1116 return create_conv_from_b(dbgi, value, dest_mode);
1119 return new_d_Conv(dbgi, value, dest_mode);
1123 * Creates a SymConst node representing a string constant.
1125 * @param src_pos the source position of the string constant
1126 * @param id_prefix a prefix for the name of the generated string constant
1127 * @param value the value of the string constant
1129 static ir_node *string_to_firm(source_position_t const *const src_pos, char const *const id_prefix, string_t const *const value)
1131 size_t const slen = get_string_len(value) + 1;
1132 ir_initializer_t *const initializer = create_initializer_compound(slen);
1133 ir_type * elem_type;
1134 switch (value->encoding) {
1135 case STRING_ENCODING_CHAR: {
1136 elem_type = ir_type_char;
1138 ir_mode *const mode = get_type_mode(elem_type);
1139 char const *p = value->begin;
1140 for (size_t i = 0; i < slen; ++i) {
1141 ir_tarval *tv = new_tarval_from_long(*p++, mode);
1142 ir_initializer_t *val = create_initializer_tarval(tv);
1143 set_initializer_compound_value(initializer, i, val);
1148 case STRING_ENCODING_WIDE: {
1149 elem_type = ir_type_wchar_t;
1151 ir_mode *const mode = get_type_mode(elem_type);
1152 char const *p = value->begin;
1153 for (size_t i = 0; i < slen; ++i) {
1154 assert(p <= value->begin + value->size);
1155 utf32 v = read_utf8_char(&p);
1156 ir_tarval *tv = new_tarval_from_long(v, mode);
1157 ir_initializer_t *val = create_initializer_tarval(tv);
1158 set_initializer_compound_value(initializer, i, val);
1163 panic("invalid string encoding");
1166 ir_type *const type = new_type_array(1, elem_type);
1167 set_array_bounds_int(type, 0, 0, slen);
1168 set_type_size_bytes( type, slen * get_type_size_bytes(elem_type));
1169 set_type_state( type, layout_fixed);
1171 ir_type *const global_type = get_glob_type();
1172 ident *const id = id_unique(id_prefix);
1173 dbg_info *const dbgi = get_dbg_info(src_pos);
1174 ir_entity *const entity = new_d_entity(global_type, id, type, dbgi);
1175 set_entity_ld_ident( entity, id);
1176 set_entity_visibility( entity, ir_visibility_private);
1177 add_entity_linkage( entity, IR_LINKAGE_CONSTANT);
1178 set_entity_initializer(entity, initializer);
1180 return create_symconst(dbgi, entity);
1183 static bool try_create_integer(literal_expression_t *literal, type_t *type)
1185 assert(type->kind == TYPE_ATOMIC);
1186 atomic_type_kind_t akind = type->atomic.akind;
1188 ir_mode *const mode = atomic_modes[akind];
1189 char const *const str = literal->value.begin;
1190 ir_tarval *const tv = new_tarval_from_str(str, literal->suffix - str, mode);
1191 if (tv == tarval_bad)
1194 literal->base.type = type;
1195 literal->target_value = tv;
1199 void determine_literal_type(literal_expression_t *const literal)
1201 assert(literal->base.kind == EXPR_LITERAL_INTEGER);
1203 /* -1: signed only, 0: any, 1: unsigned only */
1205 !is_type_signed(literal->base.type) ? 1 :
1206 literal->value.begin[0] == '0' ? 0 :
1207 -1; /* Decimal literals only try signed types. */
1209 tarval_int_overflow_mode_t old_mode = tarval_get_integer_overflow_mode();
1210 tarval_set_integer_overflow_mode(TV_OVERFLOW_BAD);
1212 if (try_create_integer(literal, literal->base.type))
1215 /* now try if the constant is small enough for some types */
1216 if (sign >= 0 && try_create_integer(literal, type_unsigned_int))
1218 if (sign <= 0 && try_create_integer(literal, type_long))
1220 if (sign >= 0 && try_create_integer(literal, type_unsigned_long))
1222 /* last try? then we should not report tarval_bad */
1224 tarval_set_integer_overflow_mode(TV_OVERFLOW_WRAP);
1225 if (sign <= 0 && try_create_integer(literal, type_long_long))
1230 tarval_set_integer_overflow_mode(TV_OVERFLOW_WRAP);
1231 bool res = try_create_integer(literal, type_unsigned_long_long);
1233 panic("internal error when parsing number literal");
1236 tarval_set_integer_overflow_mode(old_mode);
1240 * Creates a Const node representing a constant.
1242 static ir_node *literal_to_firm(const literal_expression_t *literal)
1244 type_t *type = skip_typeref(literal->base.type);
1245 ir_mode *mode = get_ir_mode_storage(type);
1246 const char *string = literal->value.begin;
1247 size_t size = literal->value.size;
1250 switch (literal->base.kind) {
1251 case EXPR_LITERAL_INTEGER:
1252 assert(literal->target_value != NULL);
1253 tv = literal->target_value;
1256 case EXPR_LITERAL_FLOATINGPOINT:
1257 tv = new_tarval_from_str(string, size, mode);
1260 case EXPR_LITERAL_BOOLEAN:
1261 if (string[0] == 't') {
1262 tv = get_mode_one(mode);
1264 assert(string[0] == 'f');
1265 case EXPR_LITERAL_MS_NOOP:
1266 tv = get_mode_null(mode);
1271 panic("Invalid literal kind found");
1274 dbg_info *dbgi = get_dbg_info(&literal->base.source_position);
1275 ir_node *res = new_d_Const(dbgi, tv);
1276 ir_mode *mode_arith = get_ir_mode_arithmetic(type);
1277 return create_conv(dbgi, res, mode_arith);
1281 * Creates a Const node representing a character constant.
1283 static ir_node *char_literal_to_firm(string_literal_expression_t const *literal)
1285 type_t *type = skip_typeref(literal->base.type);
1286 ir_mode *mode = get_ir_mode_storage(type);
1287 const char *string = literal->value.begin;
1288 size_t size = literal->value.size;
1291 switch (literal->value.encoding) {
1292 case STRING_ENCODING_WIDE: {
1293 utf32 v = read_utf8_char(&string);
1295 size_t len = snprintf(buf, sizeof(buf), UTF32_PRINTF_FORMAT, v);
1297 tv = new_tarval_from_str(buf, len, mode);
1301 case STRING_ENCODING_CHAR: {
1304 = get_atomic_type_flags(ATOMIC_TYPE_CHAR) & ATOMIC_TYPE_FLAG_SIGNED;
1305 if (size == 1 && char_is_signed) {
1306 v = (signed char)string[0];
1309 for (size_t i = 0; i < size; ++i) {
1310 v = (v << 8) | ((unsigned char)string[i]);
1314 size_t len = snprintf(buf, sizeof(buf), "%lld", v);
1316 tv = new_tarval_from_str(buf, len, mode);
1321 panic("Invalid literal kind found");
1324 dbg_info *dbgi = get_dbg_info(&literal->base.source_position);
1325 ir_node *res = new_d_Const(dbgi, tv);
1326 ir_mode *mode_arith = get_ir_mode_arithmetic(type);
1327 return create_conv(dbgi, res, mode_arith);
1331 * Allocate an area of size bytes aligned at alignment
1334 static ir_entity *alloc_trampoline(ir_type *frame_type, int size, unsigned alignment)
1336 static unsigned area_cnt = 0;
1339 ir_type *tp = new_type_array(1, ir_type_char);
1340 set_array_bounds_int(tp, 0, 0, size);
1341 set_type_alignment_bytes(tp, alignment);
1343 snprintf(buf, sizeof(buf), "trampolin%u", area_cnt++);
1344 ident *name = new_id_from_str(buf);
1345 ir_entity *area = new_entity(frame_type, name, tp);
1347 /* mark this entity as compiler generated */
1348 set_entity_compiler_generated(area, 1);
1353 * Return a node representing a trampoline region
1354 * for a given function entity.
1356 * @param dbgi debug info
1357 * @param entity the function entity
1359 static ir_node *get_trampoline_region(dbg_info *dbgi, ir_entity *entity)
1361 ir_entity *region = NULL;
1364 if (current_trampolines != NULL) {
1365 for (i = ARR_LEN(current_trampolines) - 1; i >= 0; --i) {
1366 if (current_trampolines[i].function == entity) {
1367 region = current_trampolines[i].region;
1372 current_trampolines = NEW_ARR_F(trampoline_region, 0);
1374 ir_graph *irg = current_ir_graph;
1375 if (region == NULL) {
1376 /* create a new region */
1377 ir_type *frame_tp = get_irg_frame_type(irg);
1378 trampoline_region reg;
1379 reg.function = entity;
1381 reg.region = alloc_trampoline(frame_tp,
1382 be_params->trampoline_size,
1383 be_params->trampoline_align);
1384 ARR_APP1(trampoline_region, current_trampolines, reg);
1385 region = reg.region;
1387 return new_d_simpleSel(dbgi, get_irg_no_mem(irg), get_irg_frame(irg),
1392 * Creates a trampoline for a function represented by an entity.
1394 * @param dbgi debug info
1395 * @param mode the (reference) mode for the function address
1396 * @param entity the function entity
1398 static ir_node *create_trampoline(dbg_info *dbgi, ir_mode *mode,
1401 assert(entity != NULL);
1403 in[0] = get_trampoline_region(dbgi, entity);
1404 in[1] = create_symconst(dbgi, entity);
1405 in[2] = get_irg_frame(current_ir_graph);
1407 ir_node *irn = new_d_Builtin(dbgi, get_store(), 3, in, ir_bk_inner_trampoline, get_unknown_type());
1408 set_store(new_Proj(irn, mode_M, pn_Builtin_M));
1409 return new_Proj(irn, mode, pn_Builtin_max+1);
1413 * Dereference an address.
1415 * @param dbgi debug info
1416 * @param type the type of the dereferenced result (the points_to type)
1417 * @param addr the address to dereference
1419 static ir_node *deref_address(dbg_info *const dbgi, type_t *const type,
1420 ir_node *const addr)
1422 type_t *skipped = skip_typeref(type);
1423 if (is_type_incomplete(skipped))
1426 ir_type *irtype = get_ir_type(skipped);
1427 if (is_compound_type(irtype)
1428 || is_Method_type(irtype)
1429 || is_Array_type(irtype)) {
1433 ir_cons_flags flags = skipped->base.qualifiers & TYPE_QUALIFIER_VOLATILE
1434 ? cons_volatile : cons_none;
1435 ir_mode *const mode = get_type_mode(irtype);
1436 ir_node *const memory = get_store();
1437 ir_node *const load = new_d_Load(dbgi, memory, addr, mode, flags);
1438 ir_node *const load_mem = new_d_Proj(dbgi, load, mode_M, pn_Load_M);
1439 ir_node *const load_res = new_d_Proj(dbgi, load, mode, pn_Load_res);
1441 set_store(load_mem);
1443 ir_mode *const mode_arithmetic = get_ir_mode_arithmetic(skipped);
1444 return create_conv(dbgi, load_res, mode_arithmetic);
1448 * Returns the correct base address depending on whether it is a parameter or a
1449 * normal local variable.
1451 static ir_node *get_local_frame(ir_entity *const ent)
1453 ir_graph *const irg = current_ir_graph;
1454 const ir_type *const owner = get_entity_owner(ent);
1455 if (owner == current_outer_frame) {
1456 assert(current_static_link != NULL);
1457 return current_static_link;
1459 return get_irg_frame(irg);
1464 * Keep all memory edges of the given block.
1466 static void keep_all_memory(ir_node *block)
1468 ir_node *old = get_cur_block();
1470 set_cur_block(block);
1471 keep_alive(get_store());
1472 /* TODO: keep all memory edges from restricted pointers */
1476 static ir_node *enum_constant_to_firm(reference_expression_t const *const ref)
1478 entity_t *entity = ref->entity;
1479 if (entity->enum_value.tv == NULL) {
1480 type_t *type = skip_typeref(entity->enum_value.enum_type);
1481 assert(type->kind == TYPE_ENUM);
1482 determine_enum_values(&type->enumt);
1485 return new_Const(entity->enum_value.tv);
1488 static ir_node *reference_addr(const reference_expression_t *ref)
1490 dbg_info *dbgi = get_dbg_info(&ref->base.source_position);
1491 entity_t *entity = ref->entity;
1492 assert(is_declaration(entity));
1494 if (entity->kind == ENTITY_FUNCTION
1495 && entity->function.btk != BUILTIN_NONE) {
1496 ir_entity *irentity = get_function_entity(entity, NULL);
1497 /* for gcc compatibility we have to produce (dummy) addresses for some
1498 * builtins which don't have entities */
1499 if (irentity == NULL) {
1500 source_position_t const *const pos = &ref->base.source_position;
1501 warningf(WARN_OTHER, pos, "taking address of builtin '%N'", ref->entity);
1503 /* simply create a NULL pointer */
1504 ir_mode *mode = get_ir_mode_arithmetic(type_void_ptr);
1505 ir_node *res = new_Const(get_mode_null(mode));
1511 switch((declaration_kind_t) entity->declaration.kind) {
1512 case DECLARATION_KIND_UNKNOWN:
1514 case DECLARATION_KIND_PARAMETER:
1515 case DECLARATION_KIND_LOCAL_VARIABLE:
1516 /* you can store to a local variable (so we don't panic but return NULL
1517 * as an indicator for no real address) */
1519 case DECLARATION_KIND_GLOBAL_VARIABLE: {
1520 ir_node *const addr = create_symconst(dbgi, entity->variable.v.entity);
1524 case DECLARATION_KIND_LOCAL_VARIABLE_ENTITY:
1525 case DECLARATION_KIND_PARAMETER_ENTITY: {
1526 ir_entity *irentity = entity->variable.v.entity;
1527 ir_node *frame = get_local_frame(irentity);
1528 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, irentity);
1532 case DECLARATION_KIND_VARIABLE_LENGTH_ARRAY:
1533 return entity->variable.v.vla_base;
1535 case DECLARATION_KIND_FUNCTION: {
1536 return create_symconst(dbgi, entity->function.irentity);
1539 case DECLARATION_KIND_INNER_FUNCTION: {
1540 type_t *const type = skip_typeref(entity->declaration.type);
1541 ir_mode *const mode = get_ir_mode_storage(type);
1542 if (!entity->function.goto_to_outer && !entity->function.need_closure) {
1543 /* inner function not using the closure */
1544 return create_symconst(dbgi, entity->function.irentity);
1546 /* need trampoline here */
1547 return create_trampoline(dbgi, mode, entity->function.irentity);
1551 case DECLARATION_KIND_COMPOUND_MEMBER:
1552 panic("not implemented reference type");
1555 panic("reference to declaration with unknown type found");
1558 static ir_node *reference_expression_to_firm(const reference_expression_t *ref)
1560 dbg_info *const dbgi = get_dbg_info(&ref->base.source_position);
1561 entity_t *const entity = ref->entity;
1562 assert(is_declaration(entity));
1564 switch ((declaration_kind_t)entity->declaration.kind) {
1565 case DECLARATION_KIND_LOCAL_VARIABLE:
1566 case DECLARATION_KIND_PARAMETER: {
1567 type_t *const type = skip_typeref(entity->declaration.type);
1568 ir_mode *const mode = get_ir_mode_storage(type);
1569 ir_node *const value = get_value(entity->variable.v.value_number, mode);
1570 return create_conv(dbgi, value, get_ir_mode_arithmetic(type));
1574 ir_node *const addr = reference_addr(ref);
1575 return deref_address(dbgi, entity->declaration.type, addr);
1581 * Transform calls to builtin functions.
1583 static ir_node *process_builtin_call(const call_expression_t *call)
1585 dbg_info *dbgi = get_dbg_info(&call->base.source_position);
1587 assert(call->function->kind == EXPR_REFERENCE);
1588 reference_expression_t *builtin = &call->function->reference;
1590 type_t *expr_type = skip_typeref(builtin->base.type);
1591 assert(is_type_pointer(expr_type));
1593 type_t *function_type = skip_typeref(expr_type->pointer.points_to);
1595 switch (builtin->entity->function.btk) {
1598 case BUILTIN_ALLOCA: {
1599 expression_t *argument = call->arguments->expression;
1600 ir_node *size = expression_to_firm(argument);
1602 ir_node *store = get_store();
1603 ir_node *alloca = new_d_Alloc(dbgi, store, size, get_unknown_type(),
1605 ir_node *proj_m = new_Proj(alloca, mode_M, pn_Alloc_M);
1607 ir_node *res = new_Proj(alloca, mode_P_data, pn_Alloc_res);
1612 type_t *type = function_type->function.return_type;
1613 ir_mode *mode = get_ir_mode_arithmetic(type);
1614 ir_tarval *tv = get_mode_infinite(mode);
1615 ir_node *res = new_d_Const(dbgi, tv);
1619 /* Ignore string for now... */
1620 assert(is_type_function(function_type));
1621 type_t *type = function_type->function.return_type;
1622 ir_mode *mode = get_ir_mode_arithmetic(type);
1623 ir_tarval *tv = get_mode_NAN(mode);
1624 ir_node *res = new_d_Const(dbgi, tv);
1627 case BUILTIN_EXPECT: {
1628 expression_t *argument = call->arguments->expression;
1629 return _expression_to_firm(argument);
1631 case BUILTIN_VA_END:
1632 /* evaluate the argument of va_end for its side effects */
1633 _expression_to_firm(call->arguments->expression);
1635 case BUILTIN_OBJECT_SIZE: {
1636 /* determine value of "type" */
1637 expression_t *type_expression = call->arguments->next->expression;
1638 long type_val = fold_constant_to_int(type_expression);
1639 type_t *type = function_type->function.return_type;
1640 ir_mode *mode = get_ir_mode_arithmetic(type);
1641 /* just produce a "I don't know" result */
1642 ir_tarval *result = type_val & 2 ? get_mode_null(mode) :
1643 get_mode_minus_one(mode);
1645 return new_d_Const(dbgi, result);
1647 case BUILTIN_ROTL: {
1648 ir_node *val = expression_to_firm(call->arguments->expression);
1649 ir_node *shf = expression_to_firm(call->arguments->next->expression);
1650 ir_mode *mode = get_irn_mode(val);
1651 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
1652 return new_d_Rotl(dbgi, val, create_conv(dbgi, shf, mode_uint), mode);
1654 case BUILTIN_ROTR: {
1655 ir_node *val = expression_to_firm(call->arguments->expression);
1656 ir_node *shf = expression_to_firm(call->arguments->next->expression);
1657 ir_mode *mode = get_irn_mode(val);
1658 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
1659 ir_node *c = new_Const_long(mode_uint, get_mode_size_bits(mode));
1660 ir_node *sub = new_d_Sub(dbgi, c, create_conv(dbgi, shf, mode_uint), mode_uint);
1661 return new_d_Rotl(dbgi, val, sub, mode);
1666 case BUILTIN_LIBC_CHECK:
1667 panic("builtin did not produce an entity");
1669 panic("invalid builtin found");
1673 * Transform a call expression.
1674 * Handles some special cases, like alloca() calls, which must be resolved
1675 * BEFORE the inlines runs. Inlining routines calling alloca() is dangerous,
1676 * 176.gcc for instance might allocate 2GB instead of 256 MB if alloca is not
1679 static ir_node *call_expression_to_firm(const call_expression_t *const call)
1681 dbg_info *const dbgi = get_dbg_info(&call->base.source_position);
1682 assert(currently_reachable());
1684 expression_t *function = call->function;
1685 ir_node *callee = NULL;
1686 bool firm_builtin = false;
1687 ir_builtin_kind firm_builtin_kind = ir_bk_trap;
1688 if (function->kind == EXPR_REFERENCE) {
1689 const reference_expression_t *ref = &function->reference;
1690 entity_t *entity = ref->entity;
1692 if (entity->kind == ENTITY_FUNCTION) {
1693 builtin_kind_t builtin = entity->function.btk;
1694 if (builtin == BUILTIN_FIRM) {
1695 firm_builtin = true;
1696 firm_builtin_kind = entity->function.b.firm_builtin_kind;
1697 } else if (builtin != BUILTIN_NONE && builtin != BUILTIN_LIBC
1698 && builtin != BUILTIN_LIBC_CHECK) {
1699 return process_builtin_call(call);
1704 callee = expression_to_firm(function);
1706 type_t *type = skip_typeref(function->base.type);
1707 assert(is_type_pointer(type));
1708 pointer_type_t *pointer_type = &type->pointer;
1709 type_t *points_to = skip_typeref(pointer_type->points_to);
1710 assert(is_type_function(points_to));
1711 function_type_t *function_type = &points_to->function;
1713 int n_parameters = 0;
1714 ir_type *ir_method_type = get_ir_type((type_t*) function_type);
1715 ir_type *new_method_type = NULL;
1716 if (function_type->variadic || function_type->unspecified_parameters) {
1717 const call_argument_t *argument = call->arguments;
1718 for ( ; argument != NULL; argument = argument->next) {
1722 /* we need to construct a new method type matching the call
1724 type_dbg_info *tdbgi = get_type_dbg_info_((const type_t*) function_type);
1725 int n_res = get_method_n_ress(ir_method_type);
1726 new_method_type = new_d_type_method(n_parameters, n_res, tdbgi);
1727 set_method_calling_convention(new_method_type,
1728 get_method_calling_convention(ir_method_type));
1729 set_method_additional_properties(new_method_type,
1730 get_method_additional_properties(ir_method_type));
1731 set_method_variadicity(new_method_type,
1732 get_method_variadicity(ir_method_type));
1734 for (int i = 0; i < n_res; ++i) {
1735 set_method_res_type(new_method_type, i,
1736 get_method_res_type(ir_method_type, i));
1738 argument = call->arguments;
1739 for (int i = 0; i < n_parameters; ++i, argument = argument->next) {
1740 expression_t *expression = argument->expression;
1741 ir_type *irtype = get_ir_type(expression->base.type);
1742 set_method_param_type(new_method_type, i, irtype);
1744 ir_method_type = new_method_type;
1746 n_parameters = get_method_n_params(ir_method_type);
1749 ir_node *in[n_parameters];
1751 const call_argument_t *argument = call->arguments;
1752 for (int n = 0; n < n_parameters; ++n) {
1753 expression_t *expression = argument->expression;
1754 ir_node *arg_node = expression_to_firm(expression);
1756 type_t *arg_type = skip_typeref(expression->base.type);
1757 if (!is_type_compound(arg_type)) {
1758 ir_mode *const mode = get_ir_mode_storage(arg_type);
1759 arg_node = create_conv(dbgi, arg_node, mode);
1764 argument = argument->next;
1768 if (function_type->modifiers & DM_CONST) {
1769 store = get_irg_no_mem(current_ir_graph);
1771 store = get_store();
1775 type_t *return_type = skip_typeref(function_type->return_type);
1776 ir_node *result = NULL;
1778 node = new_d_Builtin(dbgi, store, n_parameters, in, firm_builtin_kind,
1780 if (! (function_type->modifiers & DM_CONST)) {
1781 ir_node *mem = new_Proj(node, mode_M, pn_Builtin_M);
1785 if (!is_type_void(return_type)) {
1786 assert(is_type_scalar(return_type));
1787 ir_mode *mode = get_ir_mode_storage(return_type);
1788 result = new_Proj(node, mode, pn_Builtin_max+1);
1789 ir_mode *mode_arith = get_ir_mode_arithmetic(return_type);
1790 result = create_conv(NULL, result, mode_arith);
1793 node = new_d_Call(dbgi, store, callee, n_parameters, in, ir_method_type);
1794 if (! (function_type->modifiers & DM_CONST)) {
1795 ir_node *mem = new_Proj(node, mode_M, pn_Call_M);
1799 if (!is_type_void(return_type)) {
1800 ir_node *const resproj = new_Proj(node, mode_T, pn_Call_T_result);
1801 ir_mode *const mode = get_ir_mode_storage(return_type);
1802 result = new_Proj(resproj, mode, 0);
1803 ir_mode *const mode_arith = get_ir_mode_arithmetic(return_type);
1804 result = create_conv(NULL, result, mode_arith);
1808 if (function_type->modifiers & DM_NORETURN) {
1809 /* A dead end: Keep the Call and the Block. Also place all further
1810 * nodes into a new and unreachable block. */
1812 keep_alive(get_cur_block());
1813 ir_node *block = new_Block(0, NULL);
1814 set_cur_block(block);
1820 static ir_node *statement_to_firm(statement_t *statement);
1821 static ir_node *compound_statement_to_firm(compound_statement_t *compound);
1823 static ir_node *expression_to_addr(const expression_t *expression);
1824 static ir_node *create_condition_evaluation(const expression_t *expression,
1825 ir_node *true_block,
1826 ir_node *false_block);
1828 static void assign_value(dbg_info *dbgi, ir_node *addr, type_t *type,
1831 if (!is_type_compound(type)) {
1832 ir_mode *mode = get_ir_mode_storage(type);
1833 value = create_conv(dbgi, value, mode);
1836 ir_node *memory = get_store();
1838 if (is_type_scalar(type)) {
1839 ir_cons_flags flags = type->base.qualifiers & TYPE_QUALIFIER_VOLATILE
1840 ? cons_volatile : cons_none;
1841 ir_node *store = new_d_Store(dbgi, memory, addr, value, flags);
1842 ir_node *store_mem = new_d_Proj(dbgi, store, mode_M, pn_Store_M);
1843 set_store(store_mem);
1845 ir_type *irtype = get_ir_type(type);
1846 ir_node *copyb = new_d_CopyB(dbgi, memory, addr, value, irtype);
1847 ir_node *copyb_mem = new_Proj(copyb, mode_M, pn_CopyB_M);
1848 set_store(copyb_mem);
1852 static ir_tarval *create_bitfield_mask(ir_mode *mode, int offset, int size)
1854 ir_tarval *all_one = get_mode_all_one(mode);
1855 int mode_size = get_mode_size_bits(mode);
1856 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
1858 assert(offset >= 0);
1860 assert(offset + size <= mode_size);
1861 if (size == mode_size) {
1865 long shiftr = get_mode_size_bits(mode) - size;
1866 long shiftl = offset;
1867 ir_tarval *tv_shiftr = new_tarval_from_long(shiftr, mode_uint);
1868 ir_tarval *tv_shiftl = new_tarval_from_long(shiftl, mode_uint);
1869 ir_tarval *mask0 = tarval_shr(all_one, tv_shiftr);
1870 ir_tarval *mask1 = tarval_shl(mask0, tv_shiftl);
1875 static ir_node *bitfield_store_to_firm(dbg_info *dbgi,
1876 ir_entity *entity, ir_node *addr, ir_node *value, bool set_volatile,
1879 ir_type *entity_type = get_entity_type(entity);
1880 ir_type *base_type = get_primitive_base_type(entity_type);
1881 ir_mode *mode = get_type_mode(base_type);
1882 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
1884 value = create_conv(dbgi, value, mode);
1886 /* kill upper bits of value and shift to right position */
1887 unsigned bitoffset = get_entity_offset_bits_remainder(entity);
1888 unsigned bitsize = get_mode_size_bits(get_type_mode(entity_type));
1889 unsigned base_bits = get_mode_size_bits(mode);
1890 unsigned shiftwidth = base_bits - bitsize;
1892 ir_node *shiftcount = new_Const_long(mode_uint, shiftwidth);
1893 ir_node *shiftl = new_d_Shl(dbgi, value, shiftcount, mode);
1895 unsigned shrwidth = base_bits - bitsize - bitoffset;
1896 ir_node *shrconst = new_Const_long(mode_uint, shrwidth);
1897 ir_node *shiftr = new_d_Shr(dbgi, shiftl, shrconst, mode);
1899 /* load current value */
1900 ir_node *mem = get_store();
1901 ir_node *load = new_d_Load(dbgi, mem, addr, mode,
1902 set_volatile ? cons_volatile : cons_none);
1903 ir_node *load_mem = new_d_Proj(dbgi, load, mode_M, pn_Load_M);
1904 ir_node *load_res = new_d_Proj(dbgi, load, mode, pn_Load_res);
1905 ir_tarval *shift_mask = create_bitfield_mask(mode, bitoffset, bitsize);
1906 ir_tarval *inv_mask = tarval_not(shift_mask);
1907 ir_node *inv_mask_node = new_d_Const(dbgi, inv_mask);
1908 ir_node *load_res_masked = new_d_And(dbgi, load_res, inv_mask_node, mode);
1910 /* construct new value and store */
1911 ir_node *new_val = new_d_Or(dbgi, load_res_masked, shiftr, mode);
1912 ir_node *store = new_d_Store(dbgi, load_mem, addr, new_val,
1913 set_volatile ? cons_volatile : cons_none);
1914 ir_node *store_mem = new_d_Proj(dbgi, store, mode_M, pn_Store_M);
1915 set_store(store_mem);
1921 ir_node *count_res_shr = new_Const_long(mode_uint, base_bits - bitsize);
1922 if (mode_is_signed(mode)) {
1923 res_shr = new_d_Shrs(dbgi, shiftl, count_res_shr, mode);
1925 res_shr = new_d_Shr(dbgi, shiftl, count_res_shr, mode);
1930 static ir_node *bitfield_extract_to_firm(const select_expression_t *expression,
1933 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
1934 entity_t *entity = expression->compound_entry;
1935 type_t *base_type = entity->declaration.type;
1936 ir_mode *mode = get_ir_mode_storage(base_type);
1937 ir_node *mem = get_store();
1938 ir_node *load = new_d_Load(dbgi, mem, addr, mode, cons_none);
1939 ir_node *load_mem = new_d_Proj(dbgi, load, mode_M, pn_Load_M);
1940 ir_node *load_res = new_d_Proj(dbgi, load, mode, pn_Load_res);
1941 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
1943 ir_mode *amode = mode;
1944 /* optimisation, since shifting in modes < machine_size is usually
1946 if (get_mode_size_bits(amode) < get_mode_size_bits(mode_uint)) {
1949 unsigned amode_size = get_mode_size_bits(amode);
1950 load_res = create_conv(dbgi, load_res, amode);
1952 set_store(load_mem);
1954 /* kill upper bits */
1955 assert(expression->compound_entry->kind == ENTITY_COMPOUND_MEMBER);
1956 unsigned bitoffset = entity->compound_member.bit_offset;
1957 unsigned bitsize = entity->compound_member.bit_size;
1958 unsigned shift_bitsl = amode_size - bitoffset - bitsize;
1959 ir_tarval *tvl = new_tarval_from_long((long)shift_bitsl, mode_uint);
1960 ir_node *countl = new_d_Const(dbgi, tvl);
1961 ir_node *shiftl = new_d_Shl(dbgi, load_res, countl, amode);
1963 unsigned shift_bitsr = bitoffset + shift_bitsl;
1964 assert(shift_bitsr <= amode_size);
1965 ir_tarval *tvr = new_tarval_from_long((long)shift_bitsr, mode_uint);
1966 ir_node *countr = new_d_Const(dbgi, tvr);
1968 if (mode_is_signed(mode)) {
1969 shiftr = new_d_Shrs(dbgi, shiftl, countr, amode);
1971 shiftr = new_d_Shr(dbgi, shiftl, countr, amode);
1974 type_t *type = expression->base.type;
1975 ir_mode *resmode = get_ir_mode_arithmetic(type);
1976 return create_conv(dbgi, shiftr, resmode);
1979 /* make sure the selected compound type is constructed */
1980 static void construct_select_compound(const select_expression_t *expression)
1982 type_t *type = skip_typeref(expression->compound->base.type);
1983 if (is_type_pointer(type)) {
1984 type = type->pointer.points_to;
1986 (void) get_ir_type(type);
1989 static ir_node *set_value_for_expression_addr(const expression_t *expression,
1990 ir_node *value, ir_node *addr)
1992 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
1993 type_t *type = skip_typeref(expression->base.type);
1995 if (!is_type_compound(type)) {
1996 ir_mode *mode = get_ir_mode_storage(type);
1997 value = create_conv(dbgi, value, mode);
2000 if (expression->kind == EXPR_REFERENCE) {
2001 const reference_expression_t *ref = &expression->reference;
2003 entity_t *entity = ref->entity;
2004 assert(is_declaration(entity));
2005 assert(entity->declaration.kind != DECLARATION_KIND_UNKNOWN);
2006 if (entity->declaration.kind == DECLARATION_KIND_LOCAL_VARIABLE ||
2007 entity->declaration.kind == DECLARATION_KIND_PARAMETER) {
2008 set_value(entity->variable.v.value_number, value);
2014 addr = expression_to_addr(expression);
2015 assert(addr != NULL);
2017 if (expression->kind == EXPR_SELECT) {
2018 const select_expression_t *select = &expression->select;
2020 construct_select_compound(select);
2022 entity_t *entity = select->compound_entry;
2023 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
2024 if (entity->compound_member.bitfield) {
2025 ir_entity *irentity = entity->compound_member.entity;
2027 = select->base.type->base.qualifiers & TYPE_QUALIFIER_VOLATILE;
2028 value = bitfield_store_to_firm(dbgi, irentity, addr, value,
2029 set_volatile, true);
2034 assign_value(dbgi, addr, type, value);
2038 static void set_value_for_expression(const expression_t *expression,
2041 set_value_for_expression_addr(expression, value, NULL);
2044 static ir_node *get_value_from_lvalue(const expression_t *expression,
2047 if (expression->kind == EXPR_REFERENCE) {
2048 const reference_expression_t *ref = &expression->reference;
2050 entity_t *entity = ref->entity;
2051 assert(entity->kind == ENTITY_VARIABLE
2052 || entity->kind == ENTITY_PARAMETER);
2053 assert(entity->declaration.kind != DECLARATION_KIND_UNKNOWN);
2055 if (entity->declaration.kind == DECLARATION_KIND_LOCAL_VARIABLE ||
2056 entity->declaration.kind == DECLARATION_KIND_PARAMETER) {
2057 value_number = entity->variable.v.value_number;
2058 assert(addr == NULL);
2059 type_t *type = skip_typeref(expression->base.type);
2060 ir_mode *mode = get_ir_mode_storage(type);
2061 ir_node *res = get_value(value_number, mode);
2062 return create_conv(NULL, res, get_ir_mode_arithmetic(type));
2066 assert(addr != NULL);
2067 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2070 if (expression->kind == EXPR_SELECT &&
2071 expression->select.compound_entry->compound_member.bitfield) {
2072 construct_select_compound(&expression->select);
2073 value = bitfield_extract_to_firm(&expression->select, addr);
2075 value = deref_address(dbgi, expression->base.type, addr);
2082 static ir_node *create_incdec(const unary_expression_t *expression)
2084 dbg_info *const dbgi = get_dbg_info(&expression->base.source_position);
2085 const expression_t *value_expr = expression->value;
2086 ir_node *addr = expression_to_addr(value_expr);
2087 ir_node *value = get_value_from_lvalue(value_expr, addr);
2089 type_t *type = skip_typeref(expression->base.type);
2090 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
2093 if (is_type_pointer(type)) {
2094 pointer_type_t *pointer_type = &type->pointer;
2095 offset = get_type_size_node(pointer_type->points_to);
2097 assert(is_type_arithmetic(type));
2098 offset = new_Const(get_mode_one(mode));
2102 ir_node *store_value;
2103 switch(expression->base.kind) {
2104 case EXPR_UNARY_POSTFIX_INCREMENT:
2106 store_value = new_d_Add(dbgi, value, offset, mode);
2108 case EXPR_UNARY_POSTFIX_DECREMENT:
2110 store_value = new_d_Sub(dbgi, value, offset, mode);
2112 case EXPR_UNARY_PREFIX_INCREMENT:
2113 result = new_d_Add(dbgi, value, offset, mode);
2114 store_value = result;
2116 case EXPR_UNARY_PREFIX_DECREMENT:
2117 result = new_d_Sub(dbgi, value, offset, mode);
2118 store_value = result;
2121 panic("no incdec expr in create_incdec");
2124 set_value_for_expression_addr(value_expr, store_value, addr);
2129 static bool is_local_variable(expression_t *expression)
2131 if (expression->kind != EXPR_REFERENCE)
2133 reference_expression_t *ref_expr = &expression->reference;
2134 entity_t *entity = ref_expr->entity;
2135 if (entity->kind != ENTITY_VARIABLE)
2137 assert(entity->declaration.kind != DECLARATION_KIND_UNKNOWN);
2138 return entity->declaration.kind == DECLARATION_KIND_LOCAL_VARIABLE;
2141 static ir_relation get_relation(const expression_kind_t kind)
2144 case EXPR_BINARY_EQUAL: return ir_relation_equal;
2145 case EXPR_BINARY_ISLESSGREATER: return ir_relation_less_greater;
2146 case EXPR_BINARY_NOTEQUAL: return ir_relation_unordered_less_greater;
2147 case EXPR_BINARY_ISLESS:
2148 case EXPR_BINARY_LESS: return ir_relation_less;
2149 case EXPR_BINARY_ISLESSEQUAL:
2150 case EXPR_BINARY_LESSEQUAL: return ir_relation_less_equal;
2151 case EXPR_BINARY_ISGREATER:
2152 case EXPR_BINARY_GREATER: return ir_relation_greater;
2153 case EXPR_BINARY_ISGREATEREQUAL:
2154 case EXPR_BINARY_GREATEREQUAL: return ir_relation_greater_equal;
2155 case EXPR_BINARY_ISUNORDERED: return ir_relation_unordered;
2160 panic("trying to get ir_relation from non-comparison binexpr type");
2164 * Handle the assume optimizer hint: check if a Confirm
2165 * node can be created.
2167 * @param dbi debug info
2168 * @param expr the IL assume expression
2170 * we support here only some simple cases:
2175 static ir_node *handle_assume_compare(dbg_info *dbi,
2176 const binary_expression_t *expression)
2178 expression_t *op1 = expression->left;
2179 expression_t *op2 = expression->right;
2180 entity_t *var2, *var = NULL;
2181 ir_node *res = NULL;
2182 ir_relation relation = get_relation(expression->base.kind);
2184 if (is_local_variable(op1) && is_local_variable(op2)) {
2185 var = op1->reference.entity;
2186 var2 = op2->reference.entity;
2188 type_t *const type = skip_typeref(var->declaration.type);
2189 ir_mode *const mode = get_ir_mode_storage(type);
2191 ir_node *const irn1 = get_value(var->variable.v.value_number, mode);
2192 ir_node *const irn2 = get_value(var2->variable.v.value_number, mode);
2194 res = new_d_Confirm(dbi, irn2, irn1, get_inversed_relation(relation));
2195 set_value(var2->variable.v.value_number, res);
2197 res = new_d_Confirm(dbi, irn1, irn2, relation);
2198 set_value(var->variable.v.value_number, res);
2203 expression_t *con = NULL;
2204 if (is_local_variable(op1) && is_constant_expression(op2) == EXPR_CLASS_CONSTANT) {
2205 var = op1->reference.entity;
2207 } else if (is_constant_expression(op1) == EXPR_CLASS_CONSTANT && is_local_variable(op2)) {
2208 relation = get_inversed_relation(relation);
2209 var = op2->reference.entity;
2214 type_t *const type = skip_typeref(var->declaration.type);
2215 ir_mode *const mode = get_ir_mode_storage(type);
2217 res = get_value(var->variable.v.value_number, mode);
2218 res = new_d_Confirm(dbi, res, expression_to_firm(con), relation);
2219 set_value(var->variable.v.value_number, res);
2225 * Handle the assume optimizer hint.
2227 * @param dbi debug info
2228 * @param expr the IL assume expression
2230 static ir_node *handle_assume(dbg_info *dbi, const expression_t *expression)
2232 switch(expression->kind) {
2233 case EXPR_BINARY_EQUAL:
2234 case EXPR_BINARY_NOTEQUAL:
2235 case EXPR_BINARY_LESS:
2236 case EXPR_BINARY_LESSEQUAL:
2237 case EXPR_BINARY_GREATER:
2238 case EXPR_BINARY_GREATEREQUAL:
2239 return handle_assume_compare(dbi, &expression->binary);
2245 static ir_node *create_cast(dbg_info *dbgi, ir_node *value_node,
2246 type_t *from_type, type_t *type)
2248 type = skip_typeref(type);
2249 if (is_type_void(type)) {
2250 /* make sure firm type is constructed */
2251 (void) get_ir_type(type);
2254 if (!is_type_scalar(type)) {
2255 /* make sure firm type is constructed */
2256 (void) get_ir_type(type);
2260 from_type = skip_typeref(from_type);
2261 ir_mode *mode = get_ir_mode_storage(type);
2262 /* check for conversion from / to __based types */
2263 if (is_type_pointer(type) && is_type_pointer(from_type)) {
2264 const variable_t *from_var = from_type->pointer.base_variable;
2265 const variable_t *to_var = type->pointer.base_variable;
2266 if (from_var != to_var) {
2267 if (from_var != NULL) {
2268 ir_node *const addr = create_symconst(dbgi, from_var->v.entity);
2269 ir_node *const base = deref_address(dbgi, from_var->base.type, addr);
2270 value_node = new_d_Add(dbgi, value_node, base, mode);
2272 if (to_var != NULL) {
2273 ir_node *const addr = create_symconst(dbgi, to_var->v.entity);
2274 ir_node *const base = deref_address(dbgi, to_var->base.type, addr);
2275 value_node = new_d_Sub(dbgi, value_node, base, mode);
2280 if (is_type_atomic(type, ATOMIC_TYPE_BOOL)) {
2281 /* bool adjustments (we save a mode_Bu, but have to temporarily
2282 * convert to mode_b so we only get a 0/1 value */
2283 value_node = create_conv(dbgi, value_node, mode_b);
2286 ir_mode *mode_arith = get_ir_mode_arithmetic(type);
2287 ir_node *node = create_conv(dbgi, value_node, mode);
2288 node = create_conv(dbgi, node, mode_arith);
2293 static ir_node *unary_expression_to_firm(const unary_expression_t *expression)
2295 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2296 type_t *type = skip_typeref(expression->base.type);
2298 const expression_t *value = expression->value;
2300 switch(expression->base.kind) {
2301 case EXPR_UNARY_TAKE_ADDRESS:
2302 return expression_to_addr(value);
2304 case EXPR_UNARY_NEGATE: {
2305 ir_node *value_node = expression_to_firm(value);
2306 ir_mode *mode = get_ir_mode_arithmetic(type);
2307 return new_d_Minus(dbgi, value_node, mode);
2309 case EXPR_UNARY_PLUS:
2310 return expression_to_firm(value);
2311 case EXPR_UNARY_BITWISE_NEGATE: {
2312 ir_node *value_node = expression_to_firm(value);
2313 ir_mode *mode = get_ir_mode_arithmetic(type);
2314 return new_d_Not(dbgi, value_node, mode);
2316 case EXPR_UNARY_NOT: {
2317 ir_node *value_node = _expression_to_firm(value);
2318 value_node = create_conv(dbgi, value_node, mode_b);
2319 ir_node *res = new_d_Not(dbgi, value_node, mode_b);
2322 case EXPR_UNARY_DEREFERENCE: {
2323 ir_node *value_node = expression_to_firm(value);
2324 type_t *value_type = skip_typeref(value->base.type);
2325 assert(is_type_pointer(value_type));
2327 /* check for __based */
2328 const variable_t *const base_var = value_type->pointer.base_variable;
2329 if (base_var != NULL) {
2330 ir_node *const addr = create_symconst(dbgi, base_var->v.entity);
2331 ir_node *const base = deref_address(dbgi, base_var->base.type, addr);
2332 value_node = new_d_Add(dbgi, value_node, base, get_ir_mode_storage(value_type));
2334 type_t *points_to = value_type->pointer.points_to;
2335 return deref_address(dbgi, points_to, value_node);
2337 case EXPR_UNARY_POSTFIX_INCREMENT:
2338 case EXPR_UNARY_POSTFIX_DECREMENT:
2339 case EXPR_UNARY_PREFIX_INCREMENT:
2340 case EXPR_UNARY_PREFIX_DECREMENT:
2341 return create_incdec(expression);
2342 case EXPR_UNARY_CAST: {
2343 ir_node *value_node = expression_to_firm(value);
2344 type_t *from_type = value->base.type;
2345 return create_cast(dbgi, value_node, from_type, type);
2347 case EXPR_UNARY_ASSUME:
2348 return handle_assume(dbgi, value);
2353 panic("invalid UNEXPR type found");
2357 * produces a 0/1 depending of the value of a mode_b node
2359 static ir_node *produce_condition_result(const expression_t *expression,
2360 ir_mode *mode, dbg_info *dbgi)
2362 ir_node *const one_block = new_immBlock();
2363 ir_node *const zero_block = new_immBlock();
2364 create_condition_evaluation(expression, one_block, zero_block);
2365 mature_immBlock(one_block);
2366 mature_immBlock(zero_block);
2368 ir_node *const jmp_one = new_rd_Jmp(dbgi, one_block);
2369 ir_node *const jmp_zero = new_rd_Jmp(dbgi, zero_block);
2370 ir_node *const in_cf[2] = { jmp_one, jmp_zero };
2371 ir_node *const block = new_Block(lengthof(in_cf), in_cf);
2372 set_cur_block(block);
2374 ir_node *const one = new_Const(get_mode_one(mode));
2375 ir_node *const zero = new_Const(get_mode_null(mode));
2376 ir_node *const in[2] = { one, zero };
2377 ir_node *const val = new_d_Phi(dbgi, lengthof(in), in, mode);
2382 static ir_node *adjust_for_pointer_arithmetic(dbg_info *dbgi,
2383 ir_node *value, type_t *type)
2385 ir_mode *const mode = get_ir_mode_arithmetic(type_ptrdiff_t);
2386 assert(is_type_pointer(type));
2387 pointer_type_t *const pointer_type = &type->pointer;
2388 type_t *const points_to = skip_typeref(pointer_type->points_to);
2389 ir_node * elem_size = get_type_size_node(points_to);
2390 elem_size = create_conv(dbgi, elem_size, mode);
2391 value = create_conv(dbgi, value, mode);
2392 ir_node *const mul = new_d_Mul(dbgi, value, elem_size, mode);
2396 static ir_node *create_op(dbg_info *dbgi, const binary_expression_t *expression,
2397 ir_node *left, ir_node *right)
2400 type_t *type_left = skip_typeref(expression->left->base.type);
2401 type_t *type_right = skip_typeref(expression->right->base.type);
2403 expression_kind_t kind = expression->base.kind;
2406 case EXPR_BINARY_SHIFTLEFT:
2407 case EXPR_BINARY_SHIFTRIGHT:
2408 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2409 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2410 mode = get_ir_mode_arithmetic(expression->base.type);
2411 right = create_conv(dbgi, right, atomic_modes[ATOMIC_TYPE_UINT]);
2414 case EXPR_BINARY_SUB:
2415 if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
2416 const pointer_type_t *const ptr_type = &type_left->pointer;
2418 mode = get_ir_mode_arithmetic(expression->base.type);
2419 ir_node *const elem_size = get_type_size_node(ptr_type->points_to);
2420 ir_node *const conv_size = new_d_Conv(dbgi, elem_size, mode);
2421 ir_node *const sub = new_d_Sub(dbgi, left, right, mode);
2422 ir_node *const no_mem = new_NoMem();
2423 ir_node *const div = new_d_DivRL(dbgi, no_mem, sub, conv_size,
2424 mode, op_pin_state_floats);
2425 return new_d_Proj(dbgi, div, mode, pn_Div_res);
2428 case EXPR_BINARY_SUB_ASSIGN:
2429 if (is_type_pointer(type_left)) {
2430 right = adjust_for_pointer_arithmetic(dbgi, right, type_left);
2431 mode = get_ir_mode_arithmetic(type_left);
2436 case EXPR_BINARY_ADD:
2437 case EXPR_BINARY_ADD_ASSIGN:
2438 if (is_type_pointer(type_left)) {
2439 right = adjust_for_pointer_arithmetic(dbgi, right, type_left);
2440 mode = get_ir_mode_arithmetic(type_left);
2442 } else if (is_type_pointer(type_right)) {
2443 left = adjust_for_pointer_arithmetic(dbgi, left, type_right);
2444 mode = get_ir_mode_arithmetic(type_right);
2451 mode = get_ir_mode_arithmetic(type_right);
2452 left = create_conv(dbgi, left, mode);
2457 case EXPR_BINARY_ADD_ASSIGN:
2458 case EXPR_BINARY_ADD:
2459 return new_d_Add(dbgi, left, right, mode);
2460 case EXPR_BINARY_SUB_ASSIGN:
2461 case EXPR_BINARY_SUB:
2462 return new_d_Sub(dbgi, left, right, mode);
2463 case EXPR_BINARY_MUL_ASSIGN:
2464 case EXPR_BINARY_MUL:
2465 return new_d_Mul(dbgi, left, right, mode);
2466 case EXPR_BINARY_BITWISE_AND:
2467 case EXPR_BINARY_BITWISE_AND_ASSIGN:
2468 return new_d_And(dbgi, left, right, mode);
2469 case EXPR_BINARY_BITWISE_OR:
2470 case EXPR_BINARY_BITWISE_OR_ASSIGN:
2471 return new_d_Or(dbgi, left, right, mode);
2472 case EXPR_BINARY_BITWISE_XOR:
2473 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
2474 return new_d_Eor(dbgi, left, right, mode);
2475 case EXPR_BINARY_SHIFTLEFT:
2476 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2477 return new_d_Shl(dbgi, left, right, mode);
2478 case EXPR_BINARY_SHIFTRIGHT:
2479 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2480 if (mode_is_signed(mode)) {
2481 return new_d_Shrs(dbgi, left, right, mode);
2483 return new_d_Shr(dbgi, left, right, mode);
2485 case EXPR_BINARY_DIV:
2486 case EXPR_BINARY_DIV_ASSIGN: {
2487 ir_node *pin = new_Pin(new_NoMem());
2488 ir_node *op = new_d_Div(dbgi, pin, left, right, mode,
2489 op_pin_state_floats);
2490 ir_node *res = new_d_Proj(dbgi, op, mode, pn_Div_res);
2493 case EXPR_BINARY_MOD:
2494 case EXPR_BINARY_MOD_ASSIGN: {
2495 ir_node *pin = new_Pin(new_NoMem());
2496 ir_node *op = new_d_Mod(dbgi, pin, left, right, mode,
2497 op_pin_state_floats);
2498 ir_node *res = new_d_Proj(dbgi, op, mode, pn_Mod_res);
2502 panic("unexpected expression kind");
2506 static ir_node *create_lazy_op(const binary_expression_t *expression)
2508 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2509 type_t *type = skip_typeref(expression->base.type);
2510 ir_mode *mode = get_ir_mode_arithmetic(type);
2512 if (is_constant_expression(expression->left) == EXPR_CLASS_CONSTANT) {
2513 bool val = fold_constant_to_bool(expression->left);
2514 expression_kind_t ekind = expression->base.kind;
2515 assert(ekind == EXPR_BINARY_LOGICAL_AND || ekind == EXPR_BINARY_LOGICAL_OR);
2516 if (ekind == EXPR_BINARY_LOGICAL_AND) {
2518 return new_Const(get_mode_null(mode));
2522 return new_Const(get_mode_one(mode));
2526 if (is_constant_expression(expression->right) == EXPR_CLASS_CONSTANT) {
2527 bool valr = fold_constant_to_bool(expression->right);
2528 return create_Const_from_bool(mode, valr);
2531 return produce_condition_result(expression->right, mode, dbgi);
2534 return produce_condition_result((const expression_t*) expression, mode,
2538 typedef ir_node * (*create_arithmetic_func)(dbg_info *dbgi, ir_node *left,
2539 ir_node *right, ir_mode *mode);
2541 static ir_node *create_assign_binop(const binary_expression_t *expression)
2543 dbg_info *const dbgi = get_dbg_info(&expression->base.source_position);
2544 const expression_t *left_expr = expression->left;
2545 type_t *type = skip_typeref(left_expr->base.type);
2546 ir_node *right = expression_to_firm(expression->right);
2547 ir_node *left_addr = expression_to_addr(left_expr);
2548 ir_node *left = get_value_from_lvalue(left_expr, left_addr);
2549 ir_node *result = create_op(dbgi, expression, left, right);
2551 result = create_cast(dbgi, result, expression->right->base.type, type);
2553 result = set_value_for_expression_addr(left_expr, result, left_addr);
2555 if (!is_type_compound(type)) {
2556 ir_mode *mode_arithmetic = get_ir_mode_arithmetic(type);
2557 result = create_conv(dbgi, result, mode_arithmetic);
2562 static ir_node *binary_expression_to_firm(const binary_expression_t *expression)
2564 expression_kind_t kind = expression->base.kind;
2567 case EXPR_BINARY_EQUAL:
2568 case EXPR_BINARY_NOTEQUAL:
2569 case EXPR_BINARY_LESS:
2570 case EXPR_BINARY_LESSEQUAL:
2571 case EXPR_BINARY_GREATER:
2572 case EXPR_BINARY_GREATEREQUAL:
2573 case EXPR_BINARY_ISGREATER:
2574 case EXPR_BINARY_ISGREATEREQUAL:
2575 case EXPR_BINARY_ISLESS:
2576 case EXPR_BINARY_ISLESSEQUAL:
2577 case EXPR_BINARY_ISLESSGREATER:
2578 case EXPR_BINARY_ISUNORDERED: {
2579 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2580 ir_node *left = expression_to_firm(expression->left);
2581 ir_node *right = expression_to_firm(expression->right);
2582 ir_relation relation = get_relation(kind);
2583 ir_node *cmp = new_d_Cmp(dbgi, left, right, relation);
2586 case EXPR_BINARY_ASSIGN: {
2587 ir_node *addr = expression_to_addr(expression->left);
2588 ir_node *right = expression_to_firm(expression->right);
2590 = set_value_for_expression_addr(expression->left, right, addr);
2592 type_t *type = skip_typeref(expression->base.type);
2593 if (!is_type_compound(type)) {
2594 ir_mode *mode_arithmetic = get_ir_mode_arithmetic(type);
2595 res = create_conv(NULL, res, mode_arithmetic);
2599 case EXPR_BINARY_ADD:
2600 case EXPR_BINARY_SUB:
2601 case EXPR_BINARY_MUL:
2602 case EXPR_BINARY_DIV:
2603 case EXPR_BINARY_MOD:
2604 case EXPR_BINARY_BITWISE_AND:
2605 case EXPR_BINARY_BITWISE_OR:
2606 case EXPR_BINARY_BITWISE_XOR:
2607 case EXPR_BINARY_SHIFTLEFT:
2608 case EXPR_BINARY_SHIFTRIGHT:
2610 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2611 ir_node *left = expression_to_firm(expression->left);
2612 ir_node *right = expression_to_firm(expression->right);
2613 return create_op(dbgi, expression, left, right);
2615 case EXPR_BINARY_LOGICAL_AND:
2616 case EXPR_BINARY_LOGICAL_OR:
2617 return create_lazy_op(expression);
2618 case EXPR_BINARY_COMMA:
2619 /* create side effects of left side */
2620 (void) expression_to_firm(expression->left);
2621 return _expression_to_firm(expression->right);
2623 case EXPR_BINARY_ADD_ASSIGN:
2624 case EXPR_BINARY_SUB_ASSIGN:
2625 case EXPR_BINARY_MUL_ASSIGN:
2626 case EXPR_BINARY_MOD_ASSIGN:
2627 case EXPR_BINARY_DIV_ASSIGN:
2628 case EXPR_BINARY_BITWISE_AND_ASSIGN:
2629 case EXPR_BINARY_BITWISE_OR_ASSIGN:
2630 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
2631 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2632 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2633 return create_assign_binop(expression);
2635 panic("invalid binexpr type");
2639 static ir_node *array_access_addr(const array_access_expression_t *expression)
2641 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2642 ir_node *base_addr = expression_to_firm(expression->array_ref);
2643 ir_node *offset = expression_to_firm(expression->index);
2644 type_t *ref_type = skip_typeref(expression->array_ref->base.type);
2645 ir_node *real_offset = adjust_for_pointer_arithmetic(dbgi, offset, ref_type);
2646 ir_node *result = new_d_Add(dbgi, base_addr, real_offset, mode_P_data);
2651 static ir_node *array_access_to_firm(
2652 const array_access_expression_t *expression)
2654 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2655 ir_node *addr = array_access_addr(expression);
2656 type_t *type = revert_automatic_type_conversion(
2657 (const expression_t*) expression);
2658 type = skip_typeref(type);
2660 return deref_address(dbgi, type, addr);
2663 static long get_offsetof_offset(const offsetof_expression_t *expression)
2665 type_t *orig_type = expression->type;
2668 designator_t *designator = expression->designator;
2669 for ( ; designator != NULL; designator = designator->next) {
2670 type_t *type = skip_typeref(orig_type);
2671 /* be sure the type is constructed */
2672 (void) get_ir_type(type);
2674 if (designator->symbol != NULL) {
2675 assert(is_type_compound(type));
2676 symbol_t *symbol = designator->symbol;
2678 compound_t *compound = type->compound.compound;
2679 entity_t *iter = compound->members.entities;
2680 for (; iter->base.symbol != symbol; iter = iter->base.next) {}
2682 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
2683 assert(iter->declaration.kind == DECLARATION_KIND_COMPOUND_MEMBER);
2684 offset += get_entity_offset(iter->compound_member.entity);
2686 orig_type = iter->declaration.type;
2688 expression_t *array_index = designator->array_index;
2689 assert(designator->array_index != NULL);
2690 assert(is_type_array(type));
2692 long index = fold_constant_to_int(array_index);
2693 ir_type *arr_type = get_ir_type(type);
2694 ir_type *elem_type = get_array_element_type(arr_type);
2695 long elem_size = get_type_size_bytes(elem_type);
2697 offset += index * elem_size;
2699 orig_type = type->array.element_type;
2706 static ir_node *offsetof_to_firm(const offsetof_expression_t *expression)
2708 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
2709 long offset = get_offsetof_offset(expression);
2710 ir_tarval *tv = new_tarval_from_long(offset, mode);
2711 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2713 return new_d_Const(dbgi, tv);
2716 static void create_local_initializer(initializer_t *initializer, dbg_info *dbgi,
2717 ir_entity *entity, type_t *type);
2718 static ir_initializer_t *create_ir_initializer(
2719 const initializer_t *initializer, type_t *type);
2721 static ir_entity *create_initializer_entity(dbg_info *dbgi,
2722 initializer_t *initializer,
2725 /* create the ir_initializer */
2726 PUSH_IRG(get_const_code_irg());
2727 ir_initializer_t *irinitializer = create_ir_initializer(initializer, type);
2730 ident *const id = id_unique("initializer.%u");
2731 ir_type *const irtype = get_ir_type(type);
2732 ir_type *const global_type = get_glob_type();
2733 ir_entity *const entity = new_d_entity(global_type, id, irtype, dbgi);
2734 set_entity_ld_ident(entity, id);
2735 set_entity_visibility(entity, ir_visibility_private);
2736 add_entity_linkage(entity, IR_LINKAGE_CONSTANT);
2737 set_entity_initializer(entity, irinitializer);
2741 static ir_node *compound_literal_addr(compound_literal_expression_t const *const expression)
2743 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2744 type_t *type = expression->type;
2745 initializer_t *initializer = expression->initializer;
2747 if (is_constant_initializer(initializer) == EXPR_CLASS_CONSTANT) {
2748 ir_entity *entity = create_initializer_entity(dbgi, initializer, type);
2749 return create_symconst(dbgi, entity);
2751 /* create an entity on the stack */
2752 ident *const id = id_unique("CompLit.%u");
2753 ir_type *const irtype = get_ir_type(type);
2754 ir_type *frame_type = get_irg_frame_type(current_ir_graph);
2756 ir_entity *const entity = new_d_entity(frame_type, id, irtype, dbgi);
2757 set_entity_ld_ident(entity, id);
2759 /* create initialisation code */
2760 create_local_initializer(initializer, dbgi, entity, type);
2762 /* create a sel for the compound literal address */
2763 ir_node *frame = get_irg_frame(current_ir_graph);
2764 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, entity);
2769 static ir_node *compound_literal_to_firm(compound_literal_expression_t const* const expr)
2771 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
2772 type_t *const type = expr->type;
2773 ir_node *const addr = compound_literal_addr(expr);
2774 return deref_address(dbgi, type, addr);
2778 * Transform a sizeof expression into Firm code.
2780 static ir_node *sizeof_to_firm(const typeprop_expression_t *expression)
2782 type_t *const type = skip_typeref(expression->type);
2783 /* ยง6.5.3.4:2 if the type is a VLA, evaluate the expression. */
2784 if (is_type_array(type) && type->array.is_vla
2785 && expression->tp_expression != NULL) {
2786 expression_to_firm(expression->tp_expression);
2789 return get_type_size_node(type);
2792 static entity_t *get_expression_entity(const expression_t *expression)
2794 if (expression->kind != EXPR_REFERENCE)
2797 return expression->reference.entity;
2800 static unsigned get_cparser_entity_alignment(const entity_t *entity)
2802 switch(entity->kind) {
2803 case DECLARATION_KIND_CASES:
2804 return entity->declaration.alignment;
2807 return entity->compound.alignment;
2808 case ENTITY_TYPEDEF:
2809 return entity->typedefe.alignment;
2817 * Transform an alignof expression into Firm code.
2819 static ir_node *alignof_to_firm(const typeprop_expression_t *expression)
2821 unsigned alignment = 0;
2823 const expression_t *tp_expression = expression->tp_expression;
2824 if (tp_expression != NULL) {
2825 entity_t *entity = get_expression_entity(tp_expression);
2826 if (entity != NULL) {
2827 alignment = get_cparser_entity_alignment(entity);
2831 if (alignment == 0) {
2832 type_t *type = expression->type;
2833 alignment = get_type_alignment(type);
2836 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2837 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
2838 ir_tarval *tv = new_tarval_from_long(alignment, mode);
2839 return new_d_Const(dbgi, tv);
2842 static void init_ir_types(void);
2844 ir_tarval *fold_constant_to_tarval(const expression_t *expression)
2846 assert(is_constant_expression(expression) == EXPR_CLASS_CONSTANT);
2848 bool constant_folding_old = constant_folding;
2849 constant_folding = true;
2850 int old_optimize = get_optimize();
2851 int old_constant_folding = get_opt_constant_folding();
2853 set_opt_constant_folding(1);
2857 PUSH_IRG(get_const_code_irg());
2858 ir_node *const cnst = _expression_to_firm(expression);
2861 set_optimize(old_optimize);
2862 set_opt_constant_folding(old_constant_folding);
2864 if (!is_Const(cnst)) {
2865 panic("couldn't fold constant");
2868 constant_folding = constant_folding_old;
2870 ir_tarval *const tv = get_Const_tarval(cnst);
2871 ir_mode *const mode = get_ir_mode_arithmetic(skip_typeref(expression->base.type));
2872 return tarval_convert_to(tv, mode);
2875 /* this function is only used in parser.c, but it relies on libfirm functionality */
2876 bool constant_is_negative(const expression_t *expression)
2878 ir_tarval *tv = fold_constant_to_tarval(expression);
2879 return tarval_is_negative(tv);
2882 long fold_constant_to_int(const expression_t *expression)
2884 ir_tarval *tv = fold_constant_to_tarval(expression);
2885 if (!tarval_is_long(tv)) {
2886 panic("result of constant folding is not integer");
2889 return get_tarval_long(tv);
2892 bool fold_constant_to_bool(const expression_t *expression)
2894 ir_tarval *tv = fold_constant_to_tarval(expression);
2895 return !tarval_is_null(tv);
2898 static ir_node *conditional_to_firm(const conditional_expression_t *expression)
2900 dbg_info *const dbgi = get_dbg_info(&expression->base.source_position);
2902 /* first try to fold a constant condition */
2903 if (is_constant_expression(expression->condition) == EXPR_CLASS_CONSTANT) {
2904 bool val = fold_constant_to_bool(expression->condition);
2906 expression_t *true_expression = expression->true_expression;
2907 if (true_expression == NULL)
2908 true_expression = expression->condition;
2909 return expression_to_firm(true_expression);
2911 return expression_to_firm(expression->false_expression);
2915 ir_node *const true_block = new_immBlock();
2916 ir_node *const false_block = new_immBlock();
2917 ir_node *const cond_expr = create_condition_evaluation(expression->condition, true_block, false_block);
2918 mature_immBlock(true_block);
2919 mature_immBlock(false_block);
2921 set_cur_block(true_block);
2923 if (expression->true_expression != NULL) {
2924 true_val = expression_to_firm(expression->true_expression);
2925 } else if (cond_expr != NULL && get_irn_mode(cond_expr) != mode_b) {
2926 true_val = cond_expr;
2928 /* Condition ended with a short circuit (&&, ||, !) operation or a
2929 * comparison. Generate a "1" as value for the true branch. */
2930 true_val = new_Const(get_mode_one(mode_Is));
2932 ir_node *const true_jmp = new_d_Jmp(dbgi);
2934 set_cur_block(false_block);
2935 ir_node *const false_val = expression_to_firm(expression->false_expression);
2936 ir_node *const false_jmp = new_d_Jmp(dbgi);
2938 /* create the common block */
2939 ir_node *const in_cf[2] = { true_jmp, false_jmp };
2940 ir_node *const block = new_Block(lengthof(in_cf), in_cf);
2941 set_cur_block(block);
2943 /* TODO improve static semantics, so either both or no values are NULL */
2944 if (true_val == NULL || false_val == NULL)
2947 ir_node *const in[2] = { true_val, false_val };
2948 type_t *const type = skip_typeref(expression->base.type);
2949 ir_mode *const mode = get_ir_mode_arithmetic(type);
2950 ir_node *const val = new_d_Phi(dbgi, lengthof(in), in, mode);
2956 * Returns an IR-node representing the address of a field.
2958 static ir_node *select_addr(const select_expression_t *expression)
2960 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2962 construct_select_compound(expression);
2964 ir_node *compound_addr = expression_to_firm(expression->compound);
2966 entity_t *entry = expression->compound_entry;
2967 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
2968 assert(entry->declaration.kind == DECLARATION_KIND_COMPOUND_MEMBER);
2970 if (constant_folding) {
2971 ir_mode *mode = get_irn_mode(compound_addr);
2972 ir_mode *mode_uint = get_reference_mode_unsigned_eq(mode);
2973 ir_node *ofs = new_Const_long(mode_uint, entry->compound_member.offset);
2974 return new_d_Add(dbgi, compound_addr, ofs, mode);
2976 ir_entity *irentity = entry->compound_member.entity;
2977 assert(irentity != NULL);
2978 return new_d_simpleSel(dbgi, new_NoMem(), compound_addr, irentity);
2982 static ir_node *select_to_firm(const select_expression_t *expression)
2984 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2985 ir_node *addr = select_addr(expression);
2986 type_t *type = revert_automatic_type_conversion(
2987 (const expression_t*) expression);
2988 type = skip_typeref(type);
2990 entity_t *entry = expression->compound_entry;
2991 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
2993 if (entry->compound_member.bitfield) {
2994 return bitfield_extract_to_firm(expression, addr);
2997 return deref_address(dbgi, type, addr);
3000 /* Values returned by __builtin_classify_type. */
3001 typedef enum gcc_type_class
3007 enumeral_type_class,
3010 reference_type_class,
3014 function_type_class,
3025 static ir_node *classify_type_to_firm(const classify_type_expression_t *const expr)
3027 type_t *type = expr->type_expression->base.type;
3029 /* FIXME gcc returns different values depending on whether compiling C or C++
3030 * e.g. int x[10] is pointer_type_class in C, but array_type_class in C++ */
3033 type = skip_typeref(type);
3034 switch (type->kind) {
3036 const atomic_type_t *const atomic_type = &type->atomic;
3037 switch (atomic_type->akind) {
3038 /* gcc cannot do that */
3039 case ATOMIC_TYPE_VOID:
3040 tc = void_type_class;
3043 case ATOMIC_TYPE_WCHAR_T: /* gcc handles this as integer */
3044 case ATOMIC_TYPE_CHAR: /* gcc handles this as integer */
3045 case ATOMIC_TYPE_SCHAR: /* gcc handles this as integer */
3046 case ATOMIC_TYPE_UCHAR: /* gcc handles this as integer */
3047 case ATOMIC_TYPE_SHORT:
3048 case ATOMIC_TYPE_USHORT:
3049 case ATOMIC_TYPE_INT:
3050 case ATOMIC_TYPE_UINT:
3051 case ATOMIC_TYPE_LONG:
3052 case ATOMIC_TYPE_ULONG:
3053 case ATOMIC_TYPE_LONGLONG:
3054 case ATOMIC_TYPE_ULONGLONG:
3055 case ATOMIC_TYPE_BOOL: /* gcc handles this as integer */
3056 tc = integer_type_class;
3059 case ATOMIC_TYPE_FLOAT:
3060 case ATOMIC_TYPE_DOUBLE:
3061 case ATOMIC_TYPE_LONG_DOUBLE:
3062 tc = real_type_class;
3065 panic("Unexpected atomic type in classify_type_to_firm().");
3068 case TYPE_COMPLEX: tc = complex_type_class; goto make_const;
3069 case TYPE_IMAGINARY: tc = complex_type_class; goto make_const;
3070 case TYPE_ARRAY: /* gcc handles this as pointer */
3071 case TYPE_FUNCTION: /* gcc handles this as pointer */
3072 case TYPE_POINTER: tc = pointer_type_class; goto make_const;
3073 case TYPE_COMPOUND_STRUCT: tc = record_type_class; goto make_const;
3074 case TYPE_COMPOUND_UNION: tc = union_type_class; goto make_const;
3076 /* gcc handles this as integer */
3077 case TYPE_ENUM: tc = integer_type_class; goto make_const;
3079 /* gcc classifies the referenced type */
3080 case TYPE_REFERENCE: type = type->reference.refers_to; continue;
3082 /* typedef/typeof should be skipped already */
3088 panic("unexpected TYPE classify_type_to_firm().");
3092 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
3093 ir_mode *const mode = atomic_modes[ATOMIC_TYPE_INT];
3094 ir_tarval *const tv = new_tarval_from_long(tc, mode);
3095 return new_d_Const(dbgi, tv);
3098 static ir_node *function_name_to_firm(
3099 const funcname_expression_t *const expr)
3101 switch(expr->kind) {
3102 case FUNCNAME_FUNCTION:
3103 case FUNCNAME_PRETTY_FUNCTION:
3104 case FUNCNAME_FUNCDNAME:
3105 if (current_function_name == NULL) {
3106 source_position_t const *const src_pos = &expr->base.source_position;
3107 char const *const name = current_function_entity->base.symbol->string;
3108 string_t const string = { name, strlen(name), STRING_ENCODING_CHAR };
3109 current_function_name = string_to_firm(src_pos, "__func__.%u", &string);
3111 return current_function_name;
3112 case FUNCNAME_FUNCSIG:
3113 if (current_funcsig == NULL) {
3114 source_position_t const *const src_pos = &expr->base.source_position;
3115 ir_entity *const ent = get_irg_entity(current_ir_graph);
3116 char const *const name = get_entity_ld_name(ent);
3117 string_t const string = { name, strlen(name), STRING_ENCODING_CHAR };
3118 current_funcsig = string_to_firm(src_pos, "__FUNCSIG__.%u", &string);
3120 return current_funcsig;
3122 panic("Unsupported function name");
3125 static ir_node *statement_expression_to_firm(const statement_expression_t *expr)
3127 statement_t *statement = expr->statement;
3129 assert(statement->kind == STATEMENT_COMPOUND);
3130 return compound_statement_to_firm(&statement->compound);
3133 static ir_node *va_start_expression_to_firm(
3134 const va_start_expression_t *const expr)
3136 ir_entity *param_ent = current_vararg_entity;
3137 if (param_ent == NULL) {
3138 size_t const n = IR_VA_START_PARAMETER_NUMBER;
3139 ir_type *const frame_type = get_irg_frame_type(current_ir_graph);
3140 ir_type *const param_type = get_unknown_type();
3141 param_ent = new_parameter_entity(frame_type, n, param_type);
3142 current_vararg_entity = param_ent;
3145 ir_node *const frame = get_irg_frame(current_ir_graph);
3146 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
3147 ir_node *const no_mem = new_NoMem();
3148 ir_node *const arg_sel = new_d_simpleSel(dbgi, no_mem, frame, param_ent);
3150 set_value_for_expression(expr->ap, arg_sel);
3155 static ir_node *va_arg_expression_to_firm(const va_arg_expression_t *const expr)
3157 type_t *const type = expr->base.type;
3158 expression_t *const ap_expr = expr->ap;
3159 ir_node *const ap_addr = expression_to_addr(ap_expr);
3160 ir_node *const ap = get_value_from_lvalue(ap_expr, ap_addr);
3161 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
3162 ir_node *const res = deref_address(dbgi, type, ap);
3164 ir_node *const cnst = get_type_size_node(expr->base.type);
3165 ir_mode *const mode = get_irn_mode(cnst);
3166 ir_node *const c1 = new_Const_long(mode, stack_param_align - 1);
3167 ir_node *const c2 = new_d_Add(dbgi, cnst, c1, mode);
3168 ir_node *const c3 = new_Const_long(mode, -(long)stack_param_align);
3169 ir_node *const c4 = new_d_And(dbgi, c2, c3, mode);
3170 ir_node *const add = new_d_Add(dbgi, ap, c4, mode_P_data);
3172 set_value_for_expression_addr(ap_expr, add, ap_addr);
3178 * Generate Firm for a va_copy expression.
3180 static ir_node *va_copy_expression_to_firm(const va_copy_expression_t *const expr)
3182 ir_node *const src = expression_to_firm(expr->src);
3183 set_value_for_expression(expr->dst, src);
3187 static ir_node *dereference_addr(const unary_expression_t *const expression)
3189 assert(expression->base.kind == EXPR_UNARY_DEREFERENCE);
3190 return expression_to_firm(expression->value);
3194 * Returns a IR-node representing an lvalue of the given expression.
3196 static ir_node *expression_to_addr(const expression_t *expression)
3198 switch(expression->kind) {
3199 case EXPR_ARRAY_ACCESS:
3200 return array_access_addr(&expression->array_access);
3202 return call_expression_to_firm(&expression->call);
3203 case EXPR_COMPOUND_LITERAL:
3204 return compound_literal_addr(&expression->compound_literal);
3205 case EXPR_REFERENCE:
3206 return reference_addr(&expression->reference);
3208 return select_addr(&expression->select);
3209 case EXPR_UNARY_DEREFERENCE:
3210 return dereference_addr(&expression->unary);
3214 panic("trying to get address of non-lvalue");
3217 static ir_node *builtin_constant_to_firm(
3218 const builtin_constant_expression_t *expression)
3220 ir_mode *const mode = get_ir_mode_arithmetic(expression->base.type);
3221 bool const v = is_constant_expression(expression->value) == EXPR_CLASS_CONSTANT;
3222 return create_Const_from_bool(mode, v);
3225 static ir_node *builtin_types_compatible_to_firm(
3226 const builtin_types_compatible_expression_t *expression)
3228 type_t *const left = get_unqualified_type(skip_typeref(expression->left));
3229 type_t *const right = get_unqualified_type(skip_typeref(expression->right));
3230 bool const value = types_compatible(left, right);
3231 ir_mode *const mode = get_ir_mode_arithmetic(expression->base.type);
3232 return create_Const_from_bool(mode, value);
3235 static ir_node *get_label_block(label_t *label)
3237 if (label->block != NULL)
3238 return label->block;
3240 ir_node *block = new_immBlock();
3241 label->block = block;
3242 if (label->address_taken)
3243 ARR_APP1(ir_node*, ijmp_blocks, block);
3248 * Pointer to a label. This is used for the
3249 * GNU address-of-label extension.
3251 static ir_node *label_address_to_firm(const label_address_expression_t *label)
3253 /* Beware: Might be called from create initializer with current_ir_graph
3254 * set to const_code_irg. */
3255 PUSH_IRG(current_function);
3256 dbg_info *dbgi = get_dbg_info(&label->base.source_position);
3257 ir_node *block = get_label_block(label->label);
3258 ir_entity *entity = create_Block_entity(block);
3261 symconst_symbol value;
3262 value.entity_p = entity;
3263 return new_d_SymConst(dbgi, mode_P_code, value, symconst_addr_ent);
3267 * creates firm nodes for an expression. The difference between this function
3268 * and expression_to_firm is, that this version might produce mode_b nodes
3269 * instead of mode_Is.
3271 static ir_node *_expression_to_firm(expression_t const *const expr)
3274 if (!constant_folding) {
3275 assert(!expr->base.transformed);
3276 ((expression_t*)expr)->base.transformed = true;
3280 switch (expr->kind) {
3281 case EXPR_ALIGNOF: return alignof_to_firm( &expr->typeprop);
3282 case EXPR_ARRAY_ACCESS: return array_access_to_firm( &expr->array_access);
3283 case EXPR_BINARY_CASES: return binary_expression_to_firm( &expr->binary);
3284 case EXPR_BUILTIN_CONSTANT_P: return builtin_constant_to_firm( &expr->builtin_constant);
3285 case EXPR_BUILTIN_TYPES_COMPATIBLE_P: return builtin_types_compatible_to_firm(&expr->builtin_types_compatible);
3286 case EXPR_CALL: return call_expression_to_firm( &expr->call);
3287 case EXPR_CLASSIFY_TYPE: return classify_type_to_firm( &expr->classify_type);
3288 case EXPR_COMPOUND_LITERAL: return compound_literal_to_firm( &expr->compound_literal);
3289 case EXPR_CONDITIONAL: return conditional_to_firm( &expr->conditional);
3290 case EXPR_FUNCNAME: return function_name_to_firm( &expr->funcname);
3291 case EXPR_LABEL_ADDRESS: return label_address_to_firm( &expr->label_address);
3292 case EXPR_LITERAL_CASES: return literal_to_firm( &expr->literal);
3293 case EXPR_LITERAL_CHARACTER: return char_literal_to_firm( &expr->string_literal);
3294 case EXPR_OFFSETOF: return offsetof_to_firm( &expr->offsetofe);
3295 case EXPR_REFERENCE: return reference_expression_to_firm( &expr->reference);
3296 case EXPR_ENUM_CONSTANT: return enum_constant_to_firm( &expr->reference);
3297 case EXPR_SELECT: return select_to_firm( &expr->select);
3298 case EXPR_SIZEOF: return sizeof_to_firm( &expr->typeprop);
3299 case EXPR_STATEMENT: return statement_expression_to_firm( &expr->statement);
3300 case EXPR_UNARY_CASES: return unary_expression_to_firm( &expr->unary);
3301 case EXPR_VA_ARG: return va_arg_expression_to_firm( &expr->va_arge);
3302 case EXPR_VA_COPY: return va_copy_expression_to_firm( &expr->va_copye);
3303 case EXPR_VA_START: return va_start_expression_to_firm( &expr->va_starte);
3305 case EXPR_STRING_LITERAL: return string_to_firm(&expr->base.source_position, "str.%u", &expr->string_literal.value);
3307 case EXPR_ERROR: break;
3309 panic("invalid expression found");
3313 * Check if a given expression is a GNU __builtin_expect() call.
3315 static bool is_builtin_expect(const expression_t *expression)
3317 if (expression->kind != EXPR_CALL)
3320 expression_t *function = expression->call.function;
3321 if (function->kind != EXPR_REFERENCE)
3323 reference_expression_t *ref = &function->reference;
3324 if (ref->entity->kind != ENTITY_FUNCTION ||
3325 ref->entity->function.btk != BUILTIN_EXPECT)
3331 static bool produces_mode_b(const expression_t *expression)
3333 switch (expression->kind) {
3334 case EXPR_BINARY_EQUAL:
3335 case EXPR_BINARY_NOTEQUAL:
3336 case EXPR_BINARY_LESS:
3337 case EXPR_BINARY_LESSEQUAL:
3338 case EXPR_BINARY_GREATER:
3339 case EXPR_BINARY_GREATEREQUAL:
3340 case EXPR_BINARY_ISGREATER:
3341 case EXPR_BINARY_ISGREATEREQUAL:
3342 case EXPR_BINARY_ISLESS:
3343 case EXPR_BINARY_ISLESSEQUAL:
3344 case EXPR_BINARY_ISLESSGREATER:
3345 case EXPR_BINARY_ISUNORDERED:
3346 case EXPR_UNARY_NOT:
3350 if (is_builtin_expect(expression)) {
3351 expression_t *argument = expression->call.arguments->expression;
3352 return produces_mode_b(argument);
3355 case EXPR_BINARY_COMMA:
3356 return produces_mode_b(expression->binary.right);
3363 static ir_node *expression_to_firm(const expression_t *expression)
3365 if (!produces_mode_b(expression)) {
3366 ir_node *res = _expression_to_firm(expression);
3367 assert(res == NULL || get_irn_mode(res) != mode_b);
3371 if (is_constant_expression(expression) == EXPR_CLASS_CONSTANT) {
3372 return new_Const(fold_constant_to_tarval(expression));
3375 /* we have to produce a 0/1 from the mode_b expression */
3376 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3377 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
3378 return produce_condition_result(expression, mode, dbgi);
3382 * create a short-circuit expression evaluation that tries to construct
3383 * efficient control flow structures for &&, || and ! expressions
3385 static ir_node *create_condition_evaluation(const expression_t *expression,
3386 ir_node *true_block,
3387 ir_node *false_block)
3389 switch(expression->kind) {
3390 case EXPR_UNARY_NOT: {
3391 const unary_expression_t *unary_expression = &expression->unary;
3392 create_condition_evaluation(unary_expression->value, false_block,
3396 case EXPR_BINARY_LOGICAL_AND: {
3397 const binary_expression_t *binary_expression = &expression->binary;
3399 ir_node *extra_block = new_immBlock();
3400 create_condition_evaluation(binary_expression->left, extra_block,
3402 mature_immBlock(extra_block);
3403 set_cur_block(extra_block);
3404 create_condition_evaluation(binary_expression->right, true_block,
3408 case EXPR_BINARY_LOGICAL_OR: {
3409 const binary_expression_t *binary_expression = &expression->binary;
3411 ir_node *extra_block = new_immBlock();
3412 create_condition_evaluation(binary_expression->left, true_block,
3414 mature_immBlock(extra_block);
3415 set_cur_block(extra_block);
3416 create_condition_evaluation(binary_expression->right, true_block,
3424 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3425 ir_node *cond_expr = _expression_to_firm(expression);
3426 ir_node *condition = create_conv(dbgi, cond_expr, mode_b);
3427 ir_node *cond = new_d_Cond(dbgi, condition);
3428 ir_node *true_proj = new_d_Proj(dbgi, cond, mode_X, pn_Cond_true);
3429 ir_node *false_proj = new_d_Proj(dbgi, cond, mode_X, pn_Cond_false);
3431 /* set branch prediction info based on __builtin_expect */
3432 if (is_builtin_expect(expression) && is_Cond(cond)) {
3433 call_argument_t *argument = expression->call.arguments->next;
3434 if (is_constant_expression(argument->expression) == EXPR_CLASS_CONSTANT) {
3435 bool const cnst = fold_constant_to_bool(argument->expression);
3436 cond_jmp_predicate const pred = cnst ? COND_JMP_PRED_TRUE : COND_JMP_PRED_FALSE;
3437 set_Cond_jmp_pred(cond, pred);
3441 add_immBlock_pred(true_block, true_proj);
3442 add_immBlock_pred(false_block, false_proj);
3444 set_unreachable_now();
3448 static void create_variable_entity(entity_t *variable,
3449 declaration_kind_t declaration_kind,
3450 ir_type *parent_type)
3452 assert(variable->kind == ENTITY_VARIABLE);
3453 type_t *type = skip_typeref(variable->declaration.type);
3455 ident *const id = new_id_from_str(variable->base.symbol->string);
3456 ir_type *const irtype = get_ir_type(type);
3457 dbg_info *const dbgi = get_dbg_info(&variable->base.source_position);
3458 ir_entity *const irentity = new_d_entity(parent_type, id, irtype, dbgi);
3459 unsigned alignment = variable->declaration.alignment;
3461 set_entity_alignment(irentity, alignment);
3463 handle_decl_modifiers(irentity, variable);
3465 variable->declaration.kind = (unsigned char) declaration_kind;
3466 variable->variable.v.entity = irentity;
3467 set_entity_ld_ident(irentity, create_ld_ident(variable));
3469 if (type->base.qualifiers & TYPE_QUALIFIER_VOLATILE) {
3470 set_entity_volatility(irentity, volatility_is_volatile);
3475 typedef struct type_path_entry_t type_path_entry_t;
3476 struct type_path_entry_t {
3478 ir_initializer_t *initializer;
3480 entity_t *compound_entry;
3483 typedef struct type_path_t type_path_t;
3484 struct type_path_t {
3485 type_path_entry_t *path;
3490 static __attribute__((unused)) void debug_print_type_path(const type_path_t *path)
3492 size_t len = ARR_LEN(path->path);
3494 for (size_t i = 0; i < len; ++i) {
3495 const type_path_entry_t *entry = & path->path[i];
3497 type_t *type = skip_typeref(entry->type);
3498 if (is_type_compound(type)) {
3499 fprintf(stderr, ".%s", entry->compound_entry->base.symbol->string);
3500 } else if (is_type_array(type)) {
3501 fprintf(stderr, "[%u]", (unsigned) entry->index);
3503 fprintf(stderr, "-INVALID-");
3506 fprintf(stderr, " (");
3507 print_type(path->top_type);
3508 fprintf(stderr, ")");
3511 static type_path_entry_t *get_type_path_top(const type_path_t *path)
3513 size_t len = ARR_LEN(path->path);
3515 return & path->path[len-1];
3518 static type_path_entry_t *append_to_type_path(type_path_t *path)
3520 size_t len = ARR_LEN(path->path);
3521 ARR_RESIZE(type_path_entry_t, path->path, len+1);
3523 type_path_entry_t *result = & path->path[len];
3524 memset(result, 0, sizeof(result[0]));
3528 static size_t get_compound_member_count(const compound_type_t *type)
3530 compound_t *compound = type->compound;
3531 size_t n_members = 0;
3532 entity_t *member = compound->members.entities;
3533 for ( ; member != NULL; member = member->base.next) {
3540 static ir_initializer_t *get_initializer_entry(type_path_t *path)
3542 type_t *orig_top_type = path->top_type;
3543 type_t *top_type = skip_typeref(orig_top_type);
3545 assert(is_type_compound(top_type) || is_type_array(top_type));
3547 if (ARR_LEN(path->path) == 0) {
3550 type_path_entry_t *top = get_type_path_top(path);
3551 ir_initializer_t *initializer = top->initializer;
3552 return get_initializer_compound_value(initializer, top->index);
3556 static void descend_into_subtype(type_path_t *path)
3558 type_t *orig_top_type = path->top_type;
3559 type_t *top_type = skip_typeref(orig_top_type);
3561 assert(is_type_compound(top_type) || is_type_array(top_type));
3563 ir_initializer_t *initializer = get_initializer_entry(path);
3565 type_path_entry_t *top = append_to_type_path(path);
3566 top->type = top_type;
3570 if (is_type_compound(top_type)) {
3571 compound_t *const compound = top_type->compound.compound;
3572 entity_t *const entry = skip_unnamed_bitfields(compound->members.entities);
3574 top->compound_entry = entry;
3576 len = get_compound_member_count(&top_type->compound);
3577 if (entry != NULL) {
3578 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3579 path->top_type = entry->declaration.type;
3582 assert(is_type_array(top_type));
3583 assert(top_type->array.size > 0);
3586 path->top_type = top_type->array.element_type;
3587 len = top_type->array.size;
3589 if (initializer == NULL
3590 || get_initializer_kind(initializer) == IR_INITIALIZER_NULL) {
3591 initializer = create_initializer_compound(len);
3592 /* we have to set the entry at the 2nd latest path entry... */
3593 size_t path_len = ARR_LEN(path->path);
3594 assert(path_len >= 1);
3596 type_path_entry_t *entry = & path->path[path_len-2];
3597 ir_initializer_t *tinitializer = entry->initializer;
3598 set_initializer_compound_value(tinitializer, entry->index,
3602 top->initializer = initializer;
3605 static void ascend_from_subtype(type_path_t *path)
3607 type_path_entry_t *top = get_type_path_top(path);
3609 path->top_type = top->type;
3611 size_t len = ARR_LEN(path->path);
3612 ARR_RESIZE(type_path_entry_t, path->path, len-1);
3615 static void walk_designator(type_path_t *path, const designator_t *designator)
3617 /* designators start at current object type */
3618 ARR_RESIZE(type_path_entry_t, path->path, 1);
3620 for ( ; designator != NULL; designator = designator->next) {
3621 type_path_entry_t *top = get_type_path_top(path);
3622 type_t *orig_type = top->type;
3623 type_t *type = skip_typeref(orig_type);
3625 if (designator->symbol != NULL) {
3626 assert(is_type_compound(type));
3628 symbol_t *symbol = designator->symbol;
3630 compound_t *compound = type->compound.compound;
3631 entity_t *iter = compound->members.entities;
3632 for (; iter->base.symbol != symbol; iter = iter->base.next, ++index) {}
3633 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
3635 /* revert previous initialisations of other union elements */
3636 if (type->kind == TYPE_COMPOUND_UNION) {
3637 ir_initializer_t *initializer = top->initializer;
3638 if (initializer != NULL
3639 && get_initializer_kind(initializer) == IR_INITIALIZER_COMPOUND) {
3640 /* are we writing to a new element? */
3641 ir_initializer_t *oldi
3642 = get_initializer_compound_value(initializer, index);
3643 if (get_initializer_kind(oldi) == IR_INITIALIZER_NULL) {
3644 /* clear initializer */
3646 = get_initializer_compound_n_entries(initializer);
3647 ir_initializer_t *nulli = get_initializer_null();
3648 for (size_t i = 0; i < len; ++i) {
3649 set_initializer_compound_value(initializer, i,
3656 top->type = orig_type;
3657 top->compound_entry = iter;
3659 orig_type = iter->declaration.type;
3661 expression_t *array_index = designator->array_index;
3662 assert(is_type_array(type));
3664 long index = fold_constant_to_int(array_index);
3665 assert(0 <= index && (!type->array.size_constant || (size_t)index < type->array.size));
3667 top->type = orig_type;
3668 top->index = (size_t) index;
3669 orig_type = type->array.element_type;
3671 path->top_type = orig_type;
3673 if (designator->next != NULL) {
3674 descend_into_subtype(path);
3678 path->invalid = false;
3681 static void advance_current_object(type_path_t *path)
3683 if (path->invalid) {
3684 /* TODO: handle this... */
3685 panic("invalid initializer in ast2firm (excessive elements)");
3688 type_path_entry_t *top = get_type_path_top(path);
3690 type_t *type = skip_typeref(top->type);
3691 if (is_type_union(type)) {
3692 /* only the first element is initialized in unions */
3693 top->compound_entry = NULL;
3694 } else if (is_type_struct(type)) {
3695 entity_t *entry = top->compound_entry;
3698 entry = skip_unnamed_bitfields(entry->base.next);
3699 top->compound_entry = entry;
3700 if (entry != NULL) {
3701 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3702 path->top_type = entry->declaration.type;
3706 assert(is_type_array(type));
3709 if (!type->array.size_constant || top->index < type->array.size) {
3714 /* we're past the last member of the current sub-aggregate, try if we
3715 * can ascend in the type hierarchy and continue with another subobject */
3716 size_t len = ARR_LEN(path->path);
3719 ascend_from_subtype(path);
3720 advance_current_object(path);
3722 path->invalid = true;
3727 static ir_initializer_t *create_ir_initializer_value(
3728 const initializer_value_t *initializer)
3730 if (is_type_compound(initializer->value->base.type)) {
3731 panic("initializer creation for compounds not implemented yet");
3733 type_t *type = initializer->value->base.type;
3734 expression_t *expr = initializer->value;
3735 ir_node *value = expression_to_firm(expr);
3736 ir_mode *mode = get_ir_mode_storage(type);
3737 value = create_conv(NULL, value, mode);
3738 return create_initializer_const(value);
3741 /** test wether type can be initialized by a string constant */
3742 static bool is_string_type(type_t *type)
3744 if (!is_type_array(type))
3747 type_t *const inner = skip_typeref(type->array.element_type);
3748 return is_type_integer(inner);
3751 static ir_initializer_t *create_ir_initializer_list(
3752 const initializer_list_t *initializer, type_t *type)
3755 memset(&path, 0, sizeof(path));
3756 path.top_type = type;
3757 path.path = NEW_ARR_F(type_path_entry_t, 0);
3759 descend_into_subtype(&path);
3761 for (size_t i = 0; i < initializer->len; ++i) {
3762 const initializer_t *sub_initializer = initializer->initializers[i];
3764 if (sub_initializer->kind == INITIALIZER_DESIGNATOR) {
3765 walk_designator(&path, sub_initializer->designator.designator);
3769 if (sub_initializer->kind == INITIALIZER_VALUE) {
3770 /* we might have to descend into types until we're at a scalar
3773 type_t *orig_top_type = path.top_type;
3774 type_t *top_type = skip_typeref(orig_top_type);
3776 if (is_type_scalar(top_type))
3778 descend_into_subtype(&path);
3780 } else if (sub_initializer->kind == INITIALIZER_STRING) {
3781 /* we might have to descend into types until we're at a scalar
3784 type_t *orig_top_type = path.top_type;
3785 type_t *top_type = skip_typeref(orig_top_type);
3787 if (is_string_type(top_type))
3789 descend_into_subtype(&path);
3793 ir_initializer_t *sub_irinitializer
3794 = create_ir_initializer(sub_initializer, path.top_type);
3796 size_t path_len = ARR_LEN(path.path);
3797 assert(path_len >= 1);
3798 type_path_entry_t *entry = & path.path[path_len-1];
3799 ir_initializer_t *tinitializer = entry->initializer;
3800 set_initializer_compound_value(tinitializer, entry->index,
3803 advance_current_object(&path);
3806 assert(ARR_LEN(path.path) >= 1);
3807 ir_initializer_t *result = path.path[0].initializer;
3808 DEL_ARR_F(path.path);
3813 static ir_initializer_t *create_ir_initializer_string(initializer_t const *const init, type_t *type)
3815 type = skip_typeref(type);
3817 assert(type->kind == TYPE_ARRAY);
3818 assert(type->array.size_constant);
3819 string_literal_expression_t const *const str = get_init_string(init);
3820 size_t const str_len = str->value.size;
3821 size_t const arr_len = type->array.size;
3822 ir_initializer_t *const irinit = create_initializer_compound(arr_len);
3823 ir_mode *const mode = get_ir_mode_storage(type->array.element_type);
3824 char const * p = str->value.begin;
3825 switch (str->value.encoding) {
3826 case STRING_ENCODING_CHAR:
3827 for (size_t i = 0; i != arr_len; ++i) {
3828 char const c = i < str_len ? *p++ : 0;
3829 ir_tarval *const tv = new_tarval_from_long(c, mode);
3830 ir_initializer_t *const tvinit = create_initializer_tarval(tv);
3831 set_initializer_compound_value(irinit, i, tvinit);
3835 case STRING_ENCODING_WIDE:
3836 for (size_t i = 0; i != arr_len; ++i) {
3837 utf32 const c = i < str_len ? read_utf8_char(&p) : 0;
3838 ir_tarval *const tv = new_tarval_from_long(c, mode);
3839 ir_initializer_t *const tvinit = create_initializer_tarval(tv);
3840 set_initializer_compound_value(irinit, i, tvinit);
3848 static ir_initializer_t *create_ir_initializer(
3849 const initializer_t *initializer, type_t *type)
3851 switch(initializer->kind) {
3852 case INITIALIZER_STRING:
3853 return create_ir_initializer_string(initializer, type);
3855 case INITIALIZER_LIST:
3856 return create_ir_initializer_list(&initializer->list, type);
3858 case INITIALIZER_VALUE:
3859 return create_ir_initializer_value(&initializer->value);
3861 case INITIALIZER_DESIGNATOR:
3862 panic("unexpected designator initializer found");
3864 panic("unknown initializer");
3867 /** ANSI C ยง6.7.8:21: If there are fewer initializers [..] than there
3868 * are elements [...] the remainder of the aggregate shall be initialized
3869 * implicitly the same as objects that have static storage duration. */
3870 static void create_dynamic_null_initializer(ir_entity *entity, dbg_info *dbgi,
3873 /* for unions we must NOT do anything for null initializers */
3874 ir_type *owner = get_entity_owner(entity);
3875 if (is_Union_type(owner)) {
3879 ir_type *ent_type = get_entity_type(entity);
3880 /* create sub-initializers for a compound type */
3881 if (is_compound_type(ent_type)) {
3882 unsigned n_members = get_compound_n_members(ent_type);
3883 for (unsigned n = 0; n < n_members; ++n) {
3884 ir_entity *member = get_compound_member(ent_type, n);
3885 ir_node *addr = new_d_simpleSel(dbgi, new_NoMem(), base_addr,
3887 create_dynamic_null_initializer(member, dbgi, addr);
3891 if (is_Array_type(ent_type)) {
3892 assert(has_array_upper_bound(ent_type, 0));
3893 long n = get_array_upper_bound_int(ent_type, 0);
3894 for (long i = 0; i < n; ++i) {
3895 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
3896 ir_tarval *index_tv = new_tarval_from_long(i, mode_uint);
3897 ir_node *cnst = new_d_Const(dbgi, index_tv);
3898 ir_node *in[1] = { cnst };
3899 ir_entity *arrent = get_array_element_entity(ent_type);
3900 ir_node *addr = new_d_Sel(dbgi, new_NoMem(), base_addr, 1, in,
3902 create_dynamic_null_initializer(arrent, dbgi, addr);
3907 ir_mode *value_mode = get_type_mode(ent_type);
3908 ir_node *node = new_Const(get_mode_null(value_mode));
3910 /* is it a bitfield type? */
3911 if (is_Primitive_type(ent_type) &&
3912 get_primitive_base_type(ent_type) != NULL) {
3913 bitfield_store_to_firm(dbgi, entity, base_addr, node, false, false);
3917 ir_node *mem = get_store();
3918 ir_node *store = new_d_Store(dbgi, mem, base_addr, node, cons_none);
3919 ir_node *proj_m = new_Proj(store, mode_M, pn_Store_M);
3923 static void create_dynamic_initializer_sub(ir_initializer_t *initializer,
3924 ir_entity *entity, ir_type *type, dbg_info *dbgi, ir_node *base_addr)
3926 switch(get_initializer_kind(initializer)) {
3927 case IR_INITIALIZER_NULL:
3928 create_dynamic_null_initializer(entity, dbgi, base_addr);
3930 case IR_INITIALIZER_CONST: {
3931 ir_node *node = get_initializer_const_value(initializer);
3932 ir_type *ent_type = get_entity_type(entity);
3934 /* is it a bitfield type? */
3935 if (is_Primitive_type(ent_type) &&
3936 get_primitive_base_type(ent_type) != NULL) {
3937 bitfield_store_to_firm(dbgi, entity, base_addr, node, false, false);
3941 assert(get_type_mode(type) == get_irn_mode(node));
3942 ir_node *mem = get_store();
3943 ir_node *store = new_d_Store(dbgi, mem, base_addr, node, cons_none);
3944 ir_node *proj_m = new_Proj(store, mode_M, pn_Store_M);
3948 case IR_INITIALIZER_TARVAL: {
3949 ir_tarval *tv = get_initializer_tarval_value(initializer);
3950 ir_node *cnst = new_d_Const(dbgi, tv);
3951 ir_type *ent_type = get_entity_type(entity);
3953 /* is it a bitfield type? */
3954 if (is_Primitive_type(ent_type) &&
3955 get_primitive_base_type(ent_type) != NULL) {
3956 bitfield_store_to_firm(dbgi, entity, base_addr, cnst, false, false);
3960 assert(get_type_mode(type) == get_tarval_mode(tv));
3961 ir_node *mem = get_store();
3962 ir_node *store = new_d_Store(dbgi, mem, base_addr, cnst, cons_none);
3963 ir_node *proj_m = new_Proj(store, mode_M, pn_Store_M);
3967 case IR_INITIALIZER_COMPOUND: {
3968 assert(is_compound_type(type) || is_Array_type(type));
3970 if (is_Array_type(type)) {
3971 assert(has_array_upper_bound(type, 0));
3972 n_members = get_array_upper_bound_int(type, 0);
3974 n_members = get_compound_n_members(type);
3977 if (get_initializer_compound_n_entries(initializer)
3978 != (unsigned) n_members)
3979 panic("initializer doesn't match compound type");
3981 for (int i = 0; i < n_members; ++i) {
3984 ir_entity *sub_entity;
3985 if (is_Array_type(type)) {
3986 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
3987 ir_tarval *index_tv = new_tarval_from_long(i, mode_uint);
3988 ir_node *cnst = new_d_Const(dbgi, index_tv);
3989 ir_node *in[1] = { cnst };
3990 irtype = get_array_element_type(type);
3991 sub_entity = get_array_element_entity(type);
3992 addr = new_d_Sel(dbgi, new_NoMem(), base_addr, 1, in,
3995 sub_entity = get_compound_member(type, i);
3996 irtype = get_entity_type(sub_entity);
3997 addr = new_d_simpleSel(dbgi, new_NoMem(), base_addr,
4001 ir_initializer_t *sub_init
4002 = get_initializer_compound_value(initializer, i);
4004 create_dynamic_initializer_sub(sub_init, sub_entity, irtype, dbgi,
4011 panic("invalid IR_INITIALIZER found");
4014 static void create_dynamic_initializer(ir_initializer_t *initializer,
4015 dbg_info *dbgi, ir_entity *entity)
4017 ir_node *frame = get_irg_frame(current_ir_graph);
4018 ir_node *base_addr = new_d_simpleSel(dbgi, new_NoMem(), frame, entity);
4019 ir_type *type = get_entity_type(entity);
4021 create_dynamic_initializer_sub(initializer, entity, type, dbgi, base_addr);
4024 static void create_local_initializer(initializer_t *initializer, dbg_info *dbgi,
4025 ir_entity *entity, type_t *type)
4027 ir_node *memory = get_store();
4028 ir_node *nomem = new_NoMem();
4029 ir_node *frame = get_irg_frame(current_ir_graph);
4030 ir_node *addr = new_d_simpleSel(dbgi, nomem, frame, entity);
4032 if (initializer->kind == INITIALIZER_VALUE) {
4033 initializer_value_t *initializer_value = &initializer->value;
4035 ir_node *value = expression_to_firm(initializer_value->value);
4036 type = skip_typeref(type);
4037 assign_value(dbgi, addr, type, value);
4041 if (is_constant_initializer(initializer) == EXPR_CLASS_VARIABLE) {
4042 ir_initializer_t *irinitializer
4043 = create_ir_initializer(initializer, type);
4045 create_dynamic_initializer(irinitializer, dbgi, entity);
4049 /* create a "template" entity which is copied to the entity on the stack */
4050 ir_entity *const init_entity
4051 = create_initializer_entity(dbgi, initializer, type);
4052 ir_node *const src_addr = create_symconst(dbgi, init_entity);
4053 ir_type *const irtype = get_ir_type(type);
4054 ir_node *const copyb = new_d_CopyB(dbgi, memory, addr, src_addr, irtype);
4056 ir_node *const copyb_mem = new_Proj(copyb, mode_M, pn_CopyB_M);
4057 set_store(copyb_mem);
4060 static void create_initializer_local_variable_entity(entity_t *entity)
4062 assert(entity->kind == ENTITY_VARIABLE);
4063 initializer_t *initializer = entity->variable.initializer;
4064 dbg_info *dbgi = get_dbg_info(&entity->base.source_position);
4065 ir_entity *irentity = entity->variable.v.entity;
4066 type_t *type = entity->declaration.type;
4068 create_local_initializer(initializer, dbgi, irentity, type);
4071 static void create_variable_initializer(entity_t *entity)
4073 assert(entity->kind == ENTITY_VARIABLE);
4074 initializer_t *initializer = entity->variable.initializer;
4075 if (initializer == NULL)
4078 declaration_kind_t declaration_kind
4079 = (declaration_kind_t) entity->declaration.kind;
4080 if (declaration_kind == DECLARATION_KIND_LOCAL_VARIABLE_ENTITY) {
4081 create_initializer_local_variable_entity(entity);
4085 type_t *type = entity->declaration.type;
4086 type_qualifiers_t tq = get_type_qualifier(type, true);
4088 if (initializer->kind == INITIALIZER_VALUE) {
4089 expression_t * value = initializer->value.value;
4090 type_t *const init_type = skip_typeref(value->base.type);
4092 if (!is_type_scalar(init_type)) {
4094 while (value->kind == EXPR_UNARY_CAST)
4095 value = value->unary.value;
4097 if (value->kind != EXPR_COMPOUND_LITERAL)
4098 panic("expected non-scalar initializer to be a compound literal");
4099 initializer = value->compound_literal.initializer;
4100 goto have_initializer;
4103 ir_node * node = expression_to_firm(value);
4104 dbg_info *const dbgi = get_dbg_info(&entity->base.source_position);
4105 ir_mode *const mode = get_ir_mode_storage(init_type);
4106 node = create_conv(dbgi, node, mode);
4108 if (declaration_kind == DECLARATION_KIND_LOCAL_VARIABLE) {
4109 set_value(entity->variable.v.value_number, node);
4111 assert(declaration_kind == DECLARATION_KIND_GLOBAL_VARIABLE);
4113 ir_entity *irentity = entity->variable.v.entity;
4115 if (tq & TYPE_QUALIFIER_CONST
4116 && get_entity_owner(irentity) != get_tls_type()) {
4117 add_entity_linkage(irentity, IR_LINKAGE_CONSTANT);
4119 set_atomic_ent_value(irentity, node);
4123 assert(declaration_kind == DECLARATION_KIND_LOCAL_VARIABLE_ENTITY ||
4124 declaration_kind == DECLARATION_KIND_GLOBAL_VARIABLE);
4126 ir_entity *irentity = entity->variable.v.entity;
4127 ir_initializer_t *irinitializer
4128 = create_ir_initializer(initializer, type);
4130 if (tq & TYPE_QUALIFIER_CONST) {
4131 add_entity_linkage(irentity, IR_LINKAGE_CONSTANT);
4133 set_entity_initializer(irentity, irinitializer);
4137 static void create_variable_length_array(entity_t *entity)
4139 assert(entity->kind == ENTITY_VARIABLE);
4140 assert(entity->variable.initializer == NULL);
4142 entity->declaration.kind = DECLARATION_KIND_VARIABLE_LENGTH_ARRAY;
4143 entity->variable.v.vla_base = NULL;
4145 /* TODO: record VLA somewhere so we create the free node when we leave
4149 static void allocate_variable_length_array(entity_t *entity)
4151 assert(entity->kind == ENTITY_VARIABLE);
4152 assert(entity->variable.initializer == NULL);
4153 assert(currently_reachable());
4155 dbg_info *dbgi = get_dbg_info(&entity->base.source_position);
4156 type_t *type = entity->declaration.type;
4157 ir_type *el_type = get_ir_type(type->array.element_type);
4159 /* make sure size_node is calculated */
4160 get_type_size_node(type);
4161 ir_node *elems = type->array.size_node;
4162 ir_node *mem = get_store();
4163 ir_node *alloc = new_d_Alloc(dbgi, mem, elems, el_type, stack_alloc);
4165 ir_node *proj_m = new_d_Proj(dbgi, alloc, mode_M, pn_Alloc_M);
4166 ir_node *addr = new_d_Proj(dbgi, alloc, mode_P_data, pn_Alloc_res);
4169 assert(entity->declaration.kind == DECLARATION_KIND_VARIABLE_LENGTH_ARRAY);
4170 entity->variable.v.vla_base = addr;
4173 static bool var_needs_entity(variable_t const *const var)
4175 if (var->address_taken)
4177 type_t *const type = skip_typeref(var->base.type);
4178 return !is_type_scalar(type) || type->base.qualifiers & TYPE_QUALIFIER_VOLATILE;
4182 * Creates a Firm local variable from a declaration.
4184 static void create_local_variable(entity_t *entity)
4186 assert(entity->kind == ENTITY_VARIABLE);
4187 assert(entity->declaration.kind == DECLARATION_KIND_UNKNOWN);
4189 if (!var_needs_entity(&entity->variable)) {
4190 entity->declaration.kind = DECLARATION_KIND_LOCAL_VARIABLE;
4191 entity->variable.v.value_number = next_value_number_function;
4192 set_irg_loc_description(current_ir_graph, next_value_number_function, entity);
4193 ++next_value_number_function;
4197 /* is it a variable length array? */
4198 type_t *const type = skip_typeref(entity->declaration.type);
4199 if (is_type_array(type) && !type->array.size_constant) {
4200 create_variable_length_array(entity);
4204 ir_type *const frame_type = get_irg_frame_type(current_ir_graph);
4205 create_variable_entity(entity, DECLARATION_KIND_LOCAL_VARIABLE_ENTITY, frame_type);
4208 static void create_local_static_variable(entity_t *entity)
4210 assert(entity->kind == ENTITY_VARIABLE);
4211 assert(entity->declaration.kind == DECLARATION_KIND_UNKNOWN);
4213 type_t *type = skip_typeref(entity->declaration.type);
4214 ir_type *const var_type = entity->variable.thread_local ?
4215 get_tls_type() : get_glob_type();
4216 ir_type *const irtype = get_ir_type(type);
4217 dbg_info *const dbgi = get_dbg_info(&entity->base.source_position);
4219 size_t l = strlen(entity->base.symbol->string);
4220 char buf[l + sizeof(".%u")];
4221 snprintf(buf, sizeof(buf), "%s.%%u", entity->base.symbol->string);
4222 ident *const id = id_unique(buf);
4223 ir_entity *const irentity = new_d_entity(var_type, id, irtype, dbgi);
4225 if (type->base.qualifiers & TYPE_QUALIFIER_VOLATILE) {
4226 set_entity_volatility(irentity, volatility_is_volatile);
4229 entity->declaration.kind = DECLARATION_KIND_GLOBAL_VARIABLE;
4230 entity->variable.v.entity = irentity;
4232 set_entity_ld_ident(irentity, id);
4233 set_entity_visibility(irentity, ir_visibility_local);
4235 if (entity->variable.initializer == NULL) {
4236 ir_initializer_t *null_init = get_initializer_null();
4237 set_entity_initializer(irentity, null_init);
4240 PUSH_IRG(get_const_code_irg());
4241 create_variable_initializer(entity);
4247 static ir_node *return_statement_to_firm(return_statement_t *statement)
4249 if (!currently_reachable())
4252 dbg_info *const dbgi = get_dbg_info(&statement->base.source_position);
4253 type_t *const type = skip_typeref(current_function_entity->declaration.type->function.return_type);
4254 ir_node * res = statement->value ? expression_to_firm(statement->value) : NULL;
4257 if (!is_type_void(type)) {
4258 ir_mode *const mode = get_ir_mode_storage(type);
4260 res = create_conv(dbgi, res, mode);
4262 res = new_Unknown(mode);
4269 ir_node *const in[1] = { res };
4270 ir_node *const store = get_store();
4271 ir_node *const ret = new_d_Return(dbgi, store, in_len, in);
4273 ir_node *end_block = get_irg_end_block(current_ir_graph);
4274 add_immBlock_pred(end_block, ret);
4276 set_unreachable_now();
4280 static ir_node *expression_statement_to_firm(expression_statement_t *statement)
4282 if (!currently_reachable())
4285 return expression_to_firm(statement->expression);
4288 static void create_local_declarations(entity_t*);
4290 static ir_node *compound_statement_to_firm(compound_statement_t *compound)
4292 create_local_declarations(compound->scope.entities);
4294 ir_node *result = NULL;
4295 statement_t *statement = compound->statements;
4296 for ( ; statement != NULL; statement = statement->base.next) {
4297 result = statement_to_firm(statement);
4303 static void create_global_variable(entity_t *entity)
4305 ir_linkage linkage = IR_LINKAGE_DEFAULT;
4306 ir_visibility visibility = ir_visibility_external;
4307 storage_class_tag_t storage
4308 = (storage_class_tag_t)entity->declaration.storage_class;
4309 decl_modifiers_t modifiers = entity->declaration.modifiers;
4310 assert(entity->kind == ENTITY_VARIABLE);
4313 case STORAGE_CLASS_EXTERN: visibility = ir_visibility_external; break;
4314 case STORAGE_CLASS_STATIC: visibility = ir_visibility_local; break;
4315 case STORAGE_CLASS_NONE: visibility = ir_visibility_external; break;
4316 case STORAGE_CLASS_TYPEDEF:
4317 case STORAGE_CLASS_AUTO:
4318 case STORAGE_CLASS_REGISTER:
4319 panic("invalid storage class for global var");
4322 /* "common" symbols */
4323 if (storage == STORAGE_CLASS_NONE
4324 && entity->variable.initializer == NULL
4325 && !entity->variable.thread_local
4326 && (modifiers & DM_WEAK) == 0) {
4327 linkage |= IR_LINKAGE_MERGE;
4330 ir_type *var_type = get_glob_type();
4331 if (entity->variable.thread_local) {
4332 var_type = get_tls_type();
4334 create_variable_entity(entity, DECLARATION_KIND_GLOBAL_VARIABLE, var_type);
4335 ir_entity *irentity = entity->variable.v.entity;
4336 add_entity_linkage(irentity, linkage);
4337 set_entity_visibility(irentity, visibility);
4338 if (entity->variable.initializer == NULL
4339 && storage != STORAGE_CLASS_EXTERN) {
4340 ir_initializer_t *null_init = get_initializer_null();
4341 set_entity_initializer(irentity, null_init);
4345 static void create_local_declaration(entity_t *entity)
4347 assert(is_declaration(entity));
4349 /* construct type */
4350 (void) get_ir_type(entity->declaration.type);
4351 if (entity->base.symbol == NULL) {
4355 switch ((storage_class_tag_t) entity->declaration.storage_class) {
4356 case STORAGE_CLASS_STATIC:
4357 if (entity->kind == ENTITY_FUNCTION) {
4358 (void)get_function_entity(entity, NULL);
4360 create_local_static_variable(entity);
4363 case STORAGE_CLASS_EXTERN:
4364 if (entity->kind == ENTITY_FUNCTION) {
4365 assert(entity->function.body == NULL);
4366 (void)get_function_entity(entity, NULL);
4368 create_global_variable(entity);
4369 create_variable_initializer(entity);
4372 case STORAGE_CLASS_NONE:
4373 case STORAGE_CLASS_AUTO:
4374 case STORAGE_CLASS_REGISTER:
4375 if (entity->kind == ENTITY_FUNCTION) {
4376 if (entity->function.body != NULL) {
4377 ir_type *owner = get_irg_frame_type(current_ir_graph);
4378 (void)get_function_entity(entity, owner);
4379 entity->declaration.kind = DECLARATION_KIND_INNER_FUNCTION;
4380 enqueue_inner_function(entity);
4382 (void)get_function_entity(entity, NULL);
4385 create_local_variable(entity);
4388 case STORAGE_CLASS_TYPEDEF:
4391 panic("invalid storage class found");
4394 static void create_local_declarations(entity_t *e)
4396 for (; e; e = e->base.next) {
4397 if (is_declaration(e))
4398 create_local_declaration(e);
4402 static void initialize_local_declaration(entity_t *entity)
4404 if (entity->base.symbol == NULL)
4407 // no need to emit code in dead blocks
4408 if (entity->declaration.storage_class != STORAGE_CLASS_STATIC
4409 && !currently_reachable())
4412 switch ((declaration_kind_t) entity->declaration.kind) {
4413 case DECLARATION_KIND_LOCAL_VARIABLE:
4414 case DECLARATION_KIND_LOCAL_VARIABLE_ENTITY:
4415 create_variable_initializer(entity);
4418 case DECLARATION_KIND_VARIABLE_LENGTH_ARRAY:
4419 allocate_variable_length_array(entity);
4422 case DECLARATION_KIND_COMPOUND_MEMBER:
4423 case DECLARATION_KIND_GLOBAL_VARIABLE:
4424 case DECLARATION_KIND_FUNCTION:
4425 case DECLARATION_KIND_INNER_FUNCTION:
4428 case DECLARATION_KIND_PARAMETER:
4429 case DECLARATION_KIND_PARAMETER_ENTITY:
4430 panic("can't initialize parameters");
4432 case DECLARATION_KIND_UNKNOWN:
4433 panic("can't initialize unknown declaration");
4435 panic("invalid declaration kind");
4438 static ir_node *declaration_statement_to_firm(declaration_statement_t *statement)
4440 entity_t *entity = statement->declarations_begin;
4444 entity_t *const last = statement->declarations_end;
4445 for ( ;; entity = entity->base.next) {
4446 if (is_declaration(entity)) {
4447 initialize_local_declaration(entity);
4448 } else if (entity->kind == ENTITY_TYPEDEF) {
4449 /* ยง6.7.7:3 Any array size expressions associated with variable length
4450 * array declarators are evaluated each time the declaration of the
4451 * typedef name is reached in the order of execution. */
4452 type_t *const type = skip_typeref(entity->typedefe.type);
4453 if (is_type_array(type) && type->array.is_vla)
4454 get_vla_size(&type->array);
4463 static ir_node *if_statement_to_firm(if_statement_t *statement)
4465 create_local_declarations(statement->scope.entities);
4467 /* Create the condition. */
4468 ir_node *true_block = NULL;
4469 ir_node *false_block = NULL;
4470 if (currently_reachable()) {
4471 true_block = new_immBlock();
4472 false_block = new_immBlock();
4473 create_condition_evaluation(statement->condition, true_block, false_block);
4474 mature_immBlock(true_block);
4475 mature_immBlock(false_block);
4478 /* Create the true statement. */
4479 set_cur_block(true_block);
4480 statement_to_firm(statement->true_statement);
4481 ir_node *fallthrough_block = get_cur_block();
4483 /* Create the false statement. */
4484 set_cur_block(false_block);
4485 if (statement->false_statement != NULL) {
4486 statement_to_firm(statement->false_statement);
4489 /* Handle the block after the if-statement. Minor simplification and
4490 * optimisation: Reuse the false/true block as fallthrough block, if the
4491 * true/false statement does not pass control to the fallthrough block, e.g.
4492 * in the typical if (x) return; pattern. */
4493 if (fallthrough_block) {
4494 if (currently_reachable()) {
4495 ir_node *const t_jump = new_r_Jmp(fallthrough_block);
4496 ir_node *const f_jump = new_Jmp();
4497 ir_node *const in[] = { t_jump, f_jump };
4498 fallthrough_block = new_Block(2, in);
4500 set_cur_block(fallthrough_block);
4507 * Add an unconditional jump to the target block. If the source block is not
4508 * reachable, then a Bad predecessor is created to prevent Phi-less unreachable
4509 * loops. This is necessary if the jump potentially enters a loop.
4511 static void jump_to(ir_node *const target_block)
4513 ir_node *const pred = currently_reachable() ? new_Jmp() : new_Bad(mode_X);
4514 add_immBlock_pred(target_block, pred);
4515 set_cur_block(target_block);
4519 * Add an unconditional jump to the target block, if the current block is
4520 * reachable and do nothing otherwise. This is only valid if the jump does not
4521 * enter a loop (a back edge is ok).
4523 static void jump_if_reachable(ir_node *const target_block)
4525 if (currently_reachable())
4526 add_immBlock_pred(target_block, new_Jmp());
4529 static ir_node *get_break_label(void)
4531 if (break_label == NULL) {
4532 break_label = new_immBlock();
4537 static ir_node *do_while_statement_to_firm(do_while_statement_t *statement)
4539 create_local_declarations(statement->scope.entities);
4541 /* create the header block */
4542 ir_node *header_block = new_immBlock();
4545 PUSH_CONTINUE(header_block);
4547 /* The loop body. */
4548 ir_node *body_block = NULL;
4549 expression_t *const cond = statement->condition;
4550 /* Avoid an explicit body block in case of do ... while (0);. */
4551 if (is_constant_expression(cond) != EXPR_CLASS_CONSTANT || fold_constant_to_bool(cond)) {
4552 /* Not do ... while (0);. */
4553 body_block = new_immBlock();
4554 jump_to(body_block);
4556 statement_to_firm(statement->body);
4558 /* create the condition */
4559 jump_if_reachable(header_block);
4560 mature_immBlock(header_block);
4561 set_cur_block(header_block);
4562 ir_node *const false_block = get_break_label();
4564 create_condition_evaluation(statement->condition, body_block, false_block);
4565 mature_immBlock(body_block);
4567 jump_if_reachable(false_block);
4569 mature_immBlock(false_block);
4570 set_cur_block(false_block);
4577 static ir_node *for_statement_to_firm(for_statement_t *statement)
4579 create_local_declarations(statement->scope.entities);
4581 if (currently_reachable()) {
4582 entity_t *entity = statement->scope.entities;
4583 for ( ; entity != NULL; entity = entity->base.next) {
4584 if (!is_declaration(entity))
4587 initialize_local_declaration(entity);
4590 if (statement->initialisation != NULL) {
4591 expression_to_firm(statement->initialisation);
4595 /* Create the header block */
4596 ir_node *const header_block = new_immBlock();
4597 jump_to(header_block);
4599 /* Create the condition. */
4600 ir_node *false_block;
4601 expression_t *const cond = statement->condition;
4602 if (cond && (is_constant_expression(cond) != EXPR_CLASS_CONSTANT || !fold_constant_to_bool(cond))) {
4603 false_block = new_immBlock();
4605 ir_node *const body_block = new_immBlock();
4606 create_condition_evaluation(cond, body_block, false_block);
4607 mature_immBlock(body_block);
4608 set_cur_block(body_block);
4613 keep_alive(header_block);
4614 keep_all_memory(header_block);
4617 /* Create the step block, if necessary. */
4618 ir_node * step_block = header_block;
4619 expression_t *const step = statement->step;
4621 step_block = new_immBlock();
4624 PUSH_BREAK(false_block);
4625 PUSH_CONTINUE(step_block);
4627 /* Create the loop body. */
4628 statement_to_firm(statement->body);
4629 jump_if_reachable(step_block);
4631 /* Create the step code. */
4633 mature_immBlock(step_block);
4634 set_cur_block(step_block);
4635 expression_to_firm(step);
4636 jump_if_reachable(header_block);
4639 mature_immBlock(header_block);
4640 assert(false_block == NULL || false_block == break_label);
4641 false_block = break_label;
4642 if (false_block != NULL) {
4643 mature_immBlock(false_block);
4645 set_cur_block(false_block);
4652 static ir_node *create_jump_statement(const statement_t *statement, ir_node *target_block)
4654 if (!currently_reachable())
4657 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
4658 ir_node *jump = new_d_Jmp(dbgi);
4659 add_immBlock_pred(target_block, jump);
4661 set_unreachable_now();
4665 static ir_switch_table *create_switch_table(const switch_statement_t *statement)
4667 /* determine number of cases */
4669 for (case_label_statement_t *l = statement->first_case; l != NULL;
4672 if (l->expression == NULL)
4674 if (l->is_empty_range)
4679 ir_switch_table *res = ir_new_switch_table(current_ir_graph, n_cases);
4681 for (case_label_statement_t *l = statement->first_case; l != NULL;
4683 if (l->expression == NULL) {
4684 l->pn = pn_Switch_default;
4687 if (l->is_empty_range)
4689 ir_tarval *min = l->first_case;
4690 ir_tarval *max = l->last_case;
4691 long pn = (long) i+1;
4692 ir_switch_table_set(res, i++, min, max, pn);
4698 static ir_node *switch_statement_to_firm(switch_statement_t *statement)
4700 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
4701 ir_node *switch_node = NULL;
4703 if (currently_reachable()) {
4704 ir_node *expression = expression_to_firm(statement->expression);
4705 ir_switch_table *table = create_switch_table(statement);
4706 unsigned n_outs = (unsigned)ir_switch_table_get_n_entries(table) + 1;
4708 switch_node = new_d_Switch(dbgi, expression, n_outs, table);
4711 set_unreachable_now();
4714 ir_node *const old_switch = current_switch;
4715 const bool old_saw_default_label = saw_default_label;
4716 saw_default_label = false;
4717 current_switch = switch_node;
4719 statement_to_firm(statement->body);
4721 if (currently_reachable()) {
4722 add_immBlock_pred(get_break_label(), new_Jmp());
4725 if (!saw_default_label && switch_node) {
4726 ir_node *proj = new_d_Proj(dbgi, switch_node, mode_X, pn_Switch_default);
4727 add_immBlock_pred(get_break_label(), proj);
4730 if (break_label != NULL) {
4731 mature_immBlock(break_label);
4733 set_cur_block(break_label);
4735 assert(current_switch == switch_node);
4736 current_switch = old_switch;
4737 saw_default_label = old_saw_default_label;
4742 static ir_node *case_label_to_firm(const case_label_statement_t *statement)
4744 if (current_switch != NULL && !statement->is_empty_range) {
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 void try_mature_label(label_t *const label)
4763 if (--label->n_users == 0 && !label->address_taken)
4764 mature_immBlock(label->block);
4767 static ir_node *label_to_firm(const label_statement_t *statement)
4769 label_t *const label = statement->label;
4770 ir_node *const block = get_label_block(label);
4774 keep_all_memory(block);
4776 try_mature_label(label);
4778 return statement_to_firm(statement->statement);
4781 static ir_node *goto_statement_to_firm(goto_statement_t *const stmt)
4783 label_t *const label = stmt->label;
4784 create_jump_statement((statement_t*)stmt, get_label_block(label));
4785 try_mature_label(label);
4789 static ir_node *computed_goto_to_firm(computed_goto_statement_t const *const statement)
4791 if (!currently_reachable())
4794 ir_node *const irn = expression_to_firm(statement->expression);
4795 dbg_info *const dbgi = get_dbg_info(&statement->base.source_position);
4796 ir_node *const ijmp = new_d_IJmp(dbgi, irn);
4798 set_irn_link(ijmp, ijmp_list);
4801 set_unreachable_now();
4805 static ir_node *asm_statement_to_firm(const asm_statement_t *statement)
4807 bool needs_memory = statement->is_volatile;
4808 size_t n_clobbers = 0;
4809 asm_clobber_t *clobber = statement->clobbers;
4810 for ( ; clobber != NULL; clobber = clobber->next) {
4811 const char *clobber_str = clobber->clobber.begin;
4813 if (!be_is_valid_clobber(clobber_str)) {
4814 errorf(&statement->base.source_position,
4815 "invalid clobber '%s' specified", clobber->clobber);
4819 if (streq(clobber_str, "memory")) {
4820 needs_memory = true;
4824 ident *id = new_id_from_str(clobber_str);
4825 obstack_ptr_grow(&asm_obst, id);
4828 assert(obstack_object_size(&asm_obst) == n_clobbers * sizeof(ident*));
4829 ident **clobbers = NULL;
4830 if (n_clobbers > 0) {
4831 clobbers = obstack_finish(&asm_obst);
4834 size_t n_inputs = 0;
4835 asm_argument_t *argument = statement->inputs;
4836 for ( ; argument != NULL; argument = argument->next)
4838 size_t n_outputs = 0;
4839 argument = statement->outputs;
4840 for ( ; argument != NULL; argument = argument->next)
4843 unsigned next_pos = 0;
4845 ir_node *ins[n_inputs + n_outputs + 1];
4848 ir_asm_constraint tmp_in_constraints[n_outputs];
4850 const expression_t *out_exprs[n_outputs];
4851 ir_node *out_addrs[n_outputs];
4852 size_t out_size = 0;
4854 argument = statement->outputs;
4855 for ( ; argument != NULL; argument = argument->next) {
4856 const char *constraints = argument->constraints.begin;
4857 asm_constraint_flags_t asm_flags
4858 = be_parse_asm_constraints(constraints);
4861 source_position_t const *const pos = &statement->base.source_position;
4862 if (asm_flags & ASM_CONSTRAINT_FLAG_NO_SUPPORT) {
4863 warningf(WARN_OTHER, pos, "some constraints in '%s' are not supported", constraints);
4865 if (asm_flags & ASM_CONSTRAINT_FLAG_INVALID) {
4866 errorf(pos, "some constraints in '%s' are invalid", constraints);
4869 if (! (asm_flags & ASM_CONSTRAINT_FLAG_MODIFIER_WRITE)) {
4870 errorf(pos, "no write flag specified for output constraints '%s'", constraints);
4875 unsigned pos = next_pos++;
4876 if ( (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE)
4877 || (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER) ) {
4878 expression_t *expr = argument->expression;
4879 ir_node *addr = expression_to_addr(expr);
4880 /* in+output, construct an artifical same_as constraint on the
4882 if (asm_flags & ASM_CONSTRAINT_FLAG_MODIFIER_READ) {
4884 ir_node *value = get_value_from_lvalue(expr, addr);
4886 snprintf(buf, sizeof(buf), "%u", (unsigned) out_size);
4888 ir_asm_constraint constraint;
4889 constraint.pos = pos;
4890 constraint.constraint = new_id_from_str(buf);
4891 constraint.mode = get_ir_mode_storage(expr->base.type);
4892 tmp_in_constraints[in_size] = constraint;
4893 ins[in_size] = value;
4898 out_exprs[out_size] = expr;
4899 out_addrs[out_size] = addr;
4901 } else if (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP) {
4902 /* pure memory ops need no input (but we have to make sure we
4903 * attach to the memory) */
4904 assert(! (asm_flags &
4905 (ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE
4906 | ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER)));
4907 needs_memory = true;
4909 /* we need to attach the address to the inputs */
4910 expression_t *expr = argument->expression;
4912 ir_asm_constraint constraint;
4913 constraint.pos = pos;
4914 constraint.constraint = new_id_from_str(constraints);
4915 constraint.mode = mode_M;
4916 tmp_in_constraints[in_size] = constraint;
4918 ins[in_size] = expression_to_addr(expr);
4922 errorf(&statement->base.source_position,
4923 "only modifiers but no place set in constraints '%s'",
4928 ir_asm_constraint constraint;
4929 constraint.pos = pos;
4930 constraint.constraint = new_id_from_str(constraints);
4931 constraint.mode = get_ir_mode_storage(argument->expression->base.type);
4933 obstack_grow(&asm_obst, &constraint, sizeof(constraint));
4935 assert(obstack_object_size(&asm_obst)
4936 == out_size * sizeof(ir_asm_constraint));
4937 ir_asm_constraint *output_constraints = obstack_finish(&asm_obst);
4940 obstack_grow(&asm_obst, tmp_in_constraints,
4941 in_size * sizeof(tmp_in_constraints[0]));
4942 /* find and count input and output arguments */
4943 argument = statement->inputs;
4944 for ( ; argument != NULL; argument = argument->next) {
4945 const char *constraints = argument->constraints.begin;
4946 asm_constraint_flags_t asm_flags
4947 = be_parse_asm_constraints(constraints);
4949 if (asm_flags & ASM_CONSTRAINT_FLAG_NO_SUPPORT) {
4950 errorf(&statement->base.source_position,
4951 "some constraints in '%s' are not supported", constraints);
4954 if (asm_flags & ASM_CONSTRAINT_FLAG_INVALID) {
4955 errorf(&statement->base.source_position,
4956 "some constraints in '%s' are invalid", constraints);
4959 if (asm_flags & ASM_CONSTRAINT_FLAG_MODIFIER_WRITE) {
4960 errorf(&statement->base.source_position,
4961 "write flag specified for input constraints '%s'",
4967 if ( (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE)
4968 || (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER) ) {
4969 /* we can treat this as "normal" input */
4970 input = expression_to_firm(argument->expression);
4971 } else if (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP) {
4972 /* pure memory ops need no input (but we have to make sure we
4973 * attach to the memory) */
4974 assert(! (asm_flags &
4975 (ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE
4976 | ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER)));
4977 needs_memory = true;
4978 input = expression_to_addr(argument->expression);
4980 errorf(&statement->base.source_position,
4981 "only modifiers but no place set in constraints '%s'",
4986 ir_asm_constraint constraint;
4987 constraint.pos = next_pos++;
4988 constraint.constraint = new_id_from_str(constraints);
4989 constraint.mode = get_irn_mode(input);
4991 obstack_grow(&asm_obst, &constraint, sizeof(constraint));
4992 ins[in_size++] = input;
4995 ir_node *mem = needs_memory ? get_store() : new_NoMem();
4996 assert(obstack_object_size(&asm_obst)
4997 == in_size * sizeof(ir_asm_constraint));
4998 ir_asm_constraint *input_constraints = obstack_finish(&asm_obst);
5000 /* create asm node */
5001 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
5003 ident *asm_text = new_id_from_str(statement->asm_text.begin);
5005 ir_node *node = new_d_ASM(dbgi, mem, in_size, ins, input_constraints,
5006 out_size, output_constraints,
5007 n_clobbers, clobbers, asm_text);
5009 if (statement->is_volatile) {
5010 set_irn_pinned(node, op_pin_state_pinned);
5012 set_irn_pinned(node, op_pin_state_floats);
5015 /* create output projs & connect them */
5017 ir_node *projm = new_Proj(node, mode_M, out_size);
5022 for (i = 0; i < out_size; ++i) {
5023 const expression_t *out_expr = out_exprs[i];
5025 ir_mode *mode = get_ir_mode_storage(out_expr->base.type);
5026 ir_node *proj = new_Proj(node, mode, pn);
5027 ir_node *addr = out_addrs[i];
5029 set_value_for_expression_addr(out_expr, proj, addr);
5035 static ir_node *ms_try_statement_to_firm(ms_try_statement_t *statement)
5037 statement_to_firm(statement->try_statement);
5038 source_position_t const *const pos = &statement->base.source_position;
5039 warningf(WARN_OTHER, pos, "structured exception handling ignored");
5043 static ir_node *leave_statement_to_firm(leave_statement_t *statement)
5045 errorf(&statement->base.source_position, "__leave not supported yet");
5050 * Transform a statement.
5052 static ir_node *statement_to_firm(statement_t *const stmt)
5055 assert(!stmt->base.transformed);
5056 stmt->base.transformed = true;
5059 switch (stmt->kind) {
5060 case STATEMENT_ASM: return asm_statement_to_firm( &stmt->asms);
5061 case STATEMENT_CASE_LABEL: return case_label_to_firm( &stmt->case_label);
5062 case STATEMENT_COMPOUND: return compound_statement_to_firm( &stmt->compound);
5063 case STATEMENT_COMPUTED_GOTO: return computed_goto_to_firm( &stmt->computed_goto);
5064 case STATEMENT_DECLARATION: return declaration_statement_to_firm(&stmt->declaration);
5065 case STATEMENT_DO_WHILE: return do_while_statement_to_firm( &stmt->do_while);
5066 case STATEMENT_EMPTY: return NULL; /* nothing */
5067 case STATEMENT_EXPRESSION: return expression_statement_to_firm( &stmt->expression);
5068 case STATEMENT_FOR: return for_statement_to_firm( &stmt->fors);
5069 case STATEMENT_GOTO: return goto_statement_to_firm( &stmt->gotos);
5070 case STATEMENT_IF: return if_statement_to_firm( &stmt->ifs);
5071 case STATEMENT_LABEL: return label_to_firm( &stmt->label);
5072 case STATEMENT_LEAVE: return leave_statement_to_firm( &stmt->leave);
5073 case STATEMENT_MS_TRY: return ms_try_statement_to_firm( &stmt->ms_try);
5074 case STATEMENT_RETURN: return return_statement_to_firm( &stmt->returns);
5075 case STATEMENT_SWITCH: return switch_statement_to_firm( &stmt->switchs);
5077 case STATEMENT_BREAK: return create_jump_statement(stmt, get_break_label());
5078 case STATEMENT_CONTINUE: return create_jump_statement(stmt, continue_label);
5080 case STATEMENT_ERROR: panic("error statement found");
5082 panic("statement not implemented");
5085 static int count_local_variables(const entity_t *entity,
5086 const entity_t *const last)
5089 entity_t const *const end = last != NULL ? last->base.next : NULL;
5090 for (; entity != end; entity = entity->base.next) {
5091 if ((entity->kind == ENTITY_VARIABLE || entity->kind == ENTITY_PARAMETER) &&
5092 !var_needs_entity(&entity->variable))
5098 static void count_local_variables_in_stmt(statement_t *stmt, void *const env)
5100 int *const count = env;
5102 switch (stmt->kind) {
5103 case STATEMENT_DECLARATION: {
5104 const declaration_statement_t *const decl_stmt = &stmt->declaration;
5105 *count += count_local_variables(decl_stmt->declarations_begin,
5106 decl_stmt->declarations_end);
5111 *count += count_local_variables(stmt->fors.scope.entities, NULL);
5120 * Return the number of local (alias free) variables used by a function.
5122 static int get_function_n_local_vars(entity_t *entity)
5124 const function_t *function = &entity->function;
5127 /* count parameters */
5128 count += count_local_variables(function->parameters.entities, NULL);
5130 /* count local variables declared in body */
5131 walk_statements(function->body, count_local_variables_in_stmt, &count);
5136 * Build Firm code for the parameters of a function.
5138 static void initialize_function_parameters(entity_t *entity)
5140 assert(entity->kind == ENTITY_FUNCTION);
5141 ir_graph *irg = current_ir_graph;
5142 ir_node *args = get_irg_args(irg);
5144 ir_type *function_irtype;
5146 if (entity->function.need_closure) {
5147 /* add an extra parameter for the static link */
5148 entity->function.static_link = new_r_Proj(args, mode_P_data, 0);
5151 /* Matze: IMO this is wrong, nested functions should have an own
5152 * type and not rely on strange parameters... */
5153 function_irtype = create_method_type(&entity->declaration.type->function, true);
5155 function_irtype = get_ir_type(entity->declaration.type);
5160 entity_t *parameter = entity->function.parameters.entities;
5161 for ( ; parameter != NULL; parameter = parameter->base.next, ++n) {
5162 if (parameter->kind != ENTITY_PARAMETER)
5165 assert(parameter->declaration.kind == DECLARATION_KIND_UNKNOWN);
5166 type_t *type = skip_typeref(parameter->declaration.type);
5168 dbg_info *const dbgi = get_dbg_info(¶meter->base.source_position);
5169 ir_type *const param_irtype = get_method_param_type(function_irtype, n);
5170 if (var_needs_entity(¶meter->variable)) {
5171 ir_type *frame_type = get_irg_frame_type(irg);
5173 = new_d_parameter_entity(frame_type, n, param_irtype, dbgi);
5174 parameter->declaration.kind = DECLARATION_KIND_PARAMETER_ENTITY;
5175 parameter->variable.v.entity = param;
5179 ir_mode *param_mode = get_type_mode(param_irtype);
5181 ir_node *value = new_rd_Proj(dbgi, args, param_mode, pn);
5183 ir_mode *mode = get_ir_mode_storage(type);
5184 value = create_conv(NULL, value, mode);
5186 parameter->declaration.kind = DECLARATION_KIND_PARAMETER;
5187 parameter->variable.v.value_number = next_value_number_function;
5188 set_irg_loc_description(current_ir_graph, next_value_number_function,
5190 ++next_value_number_function;
5192 set_value(parameter->variable.v.value_number, value);
5196 static void add_function_pointer(ir_type *segment, ir_entity *method,
5197 const char *unique_template)
5199 ir_type *method_type = get_entity_type(method);
5200 ir_type *ptr_type = new_type_pointer(method_type);
5202 /* these entities don't really have a name but firm only allows
5204 * Note that we mustn't give these entities a name since for example
5205 * Mach-O doesn't allow them. */
5206 ident *ide = id_unique(unique_template);
5207 ir_entity *ptr = new_entity(segment, ide, ptr_type);
5208 ir_graph *irg = get_const_code_irg();
5209 ir_node *val = new_rd_SymConst_addr_ent(NULL, irg, mode_P_code,
5212 set_entity_ld_ident(ptr, new_id_from_chars("", 0));
5213 set_entity_compiler_generated(ptr, 1);
5214 set_entity_visibility(ptr, ir_visibility_private);
5215 add_entity_linkage(ptr, IR_LINKAGE_CONSTANT|IR_LINKAGE_HIDDEN_USER);
5216 set_atomic_ent_value(ptr, val);
5220 * Generate possible IJmp branches to a given label block.
5222 static void gen_ijmp_branches(ir_node *block)
5225 for (ijmp = ijmp_list; ijmp != NULL; ijmp = get_irn_link(ijmp)) {
5226 add_immBlock_pred(block, ijmp);
5231 * Create code for a function and all inner functions.
5233 * @param entity the function entity
5235 static void create_function(entity_t *entity)
5237 assert(entity->kind == ENTITY_FUNCTION);
5238 ir_entity *function_entity = get_function_entity(entity, current_outer_frame);
5240 if (entity->function.body == NULL)
5243 inner_functions = NULL;
5244 current_trampolines = NULL;
5246 if (entity->declaration.modifiers & DM_CONSTRUCTOR) {
5247 ir_type *segment = get_segment_type(IR_SEGMENT_CONSTRUCTORS);
5248 add_function_pointer(segment, function_entity, "constructor_ptr.%u");
5250 if (entity->declaration.modifiers & DM_DESTRUCTOR) {
5251 ir_type *segment = get_segment_type(IR_SEGMENT_DESTRUCTORS);
5252 add_function_pointer(segment, function_entity, "destructor_ptr.%u");
5255 current_function_entity = entity;
5256 current_function_name = NULL;
5257 current_funcsig = NULL;
5259 assert(ijmp_blocks == NULL);
5260 ijmp_blocks = NEW_ARR_F(ir_node*, 0);
5263 int n_local_vars = get_function_n_local_vars(entity);
5264 ir_graph *irg = new_ir_graph(function_entity, n_local_vars);
5265 current_ir_graph = irg;
5267 ir_graph *old_current_function = current_function;
5268 current_function = irg;
5270 ir_entity *const old_current_vararg_entity = current_vararg_entity;
5271 current_vararg_entity = NULL;
5273 set_irg_fp_model(irg, firm_fp_model);
5274 tarval_enable_fp_ops(1);
5275 set_irn_dbg_info(get_irg_start_block(irg),
5276 get_entity_dbg_info(function_entity));
5278 next_value_number_function = 0;
5279 initialize_function_parameters(entity);
5280 current_static_link = entity->function.static_link;
5282 statement_to_firm(entity->function.body);
5284 ir_node *end_block = get_irg_end_block(irg);
5286 /* do we have a return statement yet? */
5287 if (currently_reachable()) {
5288 type_t *type = skip_typeref(entity->declaration.type);
5289 assert(is_type_function(type));
5290 type_t *const return_type = skip_typeref(type->function.return_type);
5293 if (is_type_void(return_type)) {
5294 ret = new_Return(get_store(), 0, NULL);
5296 ir_mode *const mode = get_ir_mode_storage(return_type);
5299 /* ยง5.1.2.2.3 main implicitly returns 0 */
5300 if (is_main(entity)) {
5301 in[0] = new_Const(get_mode_null(mode));
5303 in[0] = new_Unknown(mode);
5305 ret = new_Return(get_store(), 1, in);
5307 add_immBlock_pred(end_block, ret);
5310 for (size_t i = ARR_LEN(ijmp_blocks); i-- != 0;) {
5311 ir_node *const block = ijmp_blocks[i];
5312 gen_ijmp_branches(block);
5313 mature_immBlock(block);
5316 DEL_ARR_F(ijmp_blocks);
5319 irg_finalize_cons(irg);
5321 /* finalize the frame type */
5322 ir_type *frame_type = get_irg_frame_type(irg);
5323 int n = get_compound_n_members(frame_type);
5326 for (int i = 0; i < n; ++i) {
5327 ir_entity *member = get_compound_member(frame_type, i);
5328 ir_type *entity_type = get_entity_type(member);
5330 int align = get_type_alignment_bytes(entity_type);
5331 if (align > align_all)
5335 misalign = offset % align;
5337 offset += align - misalign;
5341 set_entity_offset(member, offset);
5342 offset += get_type_size_bytes(entity_type);
5344 set_type_size_bytes(frame_type, offset);
5345 set_type_alignment_bytes(frame_type, align_all);
5347 irg_verify(irg, VERIFY_ENFORCE_SSA);
5348 current_vararg_entity = old_current_vararg_entity;
5349 current_function = old_current_function;
5351 if (current_trampolines != NULL) {
5352 DEL_ARR_F(current_trampolines);
5353 current_trampolines = NULL;
5356 /* create inner functions if any */
5357 entity_t **inner = inner_functions;
5358 if (inner != NULL) {
5359 ir_type *rem_outer_frame = current_outer_frame;
5360 current_outer_frame = get_irg_frame_type(current_ir_graph);
5361 for (int i = ARR_LEN(inner) - 1; i >= 0; --i) {
5362 create_function(inner[i]);
5366 current_outer_frame = rem_outer_frame;
5370 static void scope_to_firm(scope_t *scope)
5372 /* first pass: create declarations */
5373 entity_t *entity = scope->entities;
5374 for ( ; entity != NULL; entity = entity->base.next) {
5375 if (entity->base.symbol == NULL)
5378 if (entity->kind == ENTITY_FUNCTION) {
5379 if (entity->function.btk != BUILTIN_NONE) {
5380 /* builtins have no representation */
5383 (void)get_function_entity(entity, NULL);
5384 } else if (entity->kind == ENTITY_VARIABLE) {
5385 create_global_variable(entity);
5386 } else if (entity->kind == ENTITY_NAMESPACE) {
5387 scope_to_firm(&entity->namespacee.members);
5391 /* second pass: create code/initializers */
5392 entity = scope->entities;
5393 for ( ; entity != NULL; entity = entity->base.next) {
5394 if (entity->base.symbol == NULL)
5397 if (entity->kind == ENTITY_FUNCTION) {
5398 if (entity->function.btk != BUILTIN_NONE) {
5399 /* builtins have no representation */
5402 create_function(entity);
5403 } else if (entity->kind == ENTITY_VARIABLE) {
5404 assert(entity->declaration.kind
5405 == DECLARATION_KIND_GLOBAL_VARIABLE);
5406 current_ir_graph = get_const_code_irg();
5407 create_variable_initializer(entity);
5412 void init_ast2firm(void)
5414 obstack_init(&asm_obst);
5415 init_atomic_modes();
5417 ir_set_debug_retrieve(dbg_retrieve);
5418 ir_set_type_debug_retrieve(dbg_print_type_dbg_info);
5420 /* create idents for all known runtime functions */
5421 for (size_t i = 0; i < lengthof(rts_data); ++i) {
5422 rts_idents[i] = new_id_from_str(rts_data[i].name);
5425 entitymap_init(&entitymap);
5428 static void init_ir_types(void)
5430 static int ir_types_initialized = 0;
5431 if (ir_types_initialized)
5433 ir_types_initialized = 1;
5435 ir_type_char = get_ir_type(type_char);
5436 ir_type_wchar_t = get_ir_type(type_wchar_t);
5438 be_params = be_get_backend_param();
5439 mode_float_arithmetic = be_params->mode_float_arithmetic;
5441 stack_param_align = be_params->stack_param_align;
5444 void exit_ast2firm(void)
5446 entitymap_destroy(&entitymap);
5447 obstack_free(&asm_obst, NULL);
5450 static void global_asm_to_firm(statement_t *s)
5452 for (; s != NULL; s = s->base.next) {
5453 assert(s->kind == STATEMENT_ASM);
5455 char const *const text = s->asms.asm_text.begin;
5456 size_t const size = s->asms.asm_text.size;
5457 ident *const id = new_id_from_chars(text, size);
5462 static const char *get_cwd(void)
5464 static char buf[1024];
5465 if (buf[0] == '\0') {
5466 return getcwd(buf, sizeof(buf));
5471 void translation_unit_to_firm(translation_unit_t *unit)
5473 if (c_mode & _CXX) {
5474 be_dwarf_set_source_language(DW_LANG_C_plus_plus);
5475 } else if (c_mode & _C99) {
5476 be_dwarf_set_source_language(DW_LANG_C99);
5477 } else if (c_mode & _C89) {
5478 be_dwarf_set_source_language(DW_LANG_C89);
5480 be_dwarf_set_source_language(DW_LANG_C);
5482 const char *cwd = get_cwd();
5484 be_dwarf_set_compilation_directory(cwd);
5487 /* initialize firm arithmetic */
5488 tarval_set_integer_overflow_mode(TV_OVERFLOW_WRAP);
5489 ir_set_uninitialized_local_variable_func(uninitialized_local_var);
5491 /* just to be sure */
5492 continue_label = NULL;
5494 current_switch = NULL;
5495 current_translation_unit = unit;
5499 scope_to_firm(&unit->scope);
5500 global_asm_to_firm(unit->global_asm);
5502 current_ir_graph = NULL;
5503 current_translation_unit = NULL;