2 * This file is part of cparser.
3 * Copyright (C) 2007-2009 Matthias Braun <matze@braunis.de>
5 * This program is free software; you can redistribute it and/or
6 * modify it under the terms of the GNU General Public License
7 * as published by the Free Software Foundation; either version 2
8 * of the License, or (at your option) any later version.
10 * This program is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 * GNU General Public License for more details.
15 * You should have received a copy of the GNU General Public License
16 * along with this program; if not, write to the Free Software
17 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
28 #include <libfirm/firm.h>
29 #include <libfirm/adt/obst.h>
30 #include <libfirm/be.h>
34 #include "adt/error.h"
35 #include "adt/array.h"
36 #include "adt/strutil.h"
44 #include "diagnostic.h"
45 #include "lang_features.h"
47 #include "type_hash.h"
52 #include "entitymap_t.h"
53 #include "driver/firm_opt.h"
55 typedef struct trampoline_region trampoline_region;
56 struct trampoline_region {
57 ir_entity *function; /**< The function that is called by this trampoline */
58 ir_entity *region; /**< created region for the trampoline */
61 fp_model_t firm_fp_model = fp_model_precise;
63 static const backend_params *be_params;
65 static ir_type *ir_type_char;
66 static ir_type *ir_type_wchar_t;
68 /* architecture specific floating point arithmetic mode (if any) */
69 static ir_mode *mode_float_arithmetic;
71 /* alignment of stack parameters */
72 static unsigned stack_param_align;
74 static int next_value_number_function;
75 static ir_node *continue_label;
76 static ir_node *break_label;
77 static ir_node *current_switch;
78 static bool saw_default_label;
79 static label_t **all_labels;
80 static entity_t **inner_functions;
81 static ir_node *ijmp_list;
82 static bool constant_folding;
84 static const entity_t *current_function_entity;
85 static ir_node *current_function_name;
86 static ir_node *current_funcsig;
87 static ir_graph *current_function;
88 static translation_unit_t *current_translation_unit;
89 static trampoline_region *current_trampolines;
90 static ir_type *current_outer_frame;
91 static ir_node *current_static_link;
92 static ir_entity *current_vararg_entity;
94 static entitymap_t entitymap;
96 static struct obstack asm_obst;
98 typedef enum declaration_kind_t {
99 DECLARATION_KIND_UNKNOWN,
100 DECLARATION_KIND_VARIABLE_LENGTH_ARRAY,
101 DECLARATION_KIND_GLOBAL_VARIABLE,
102 DECLARATION_KIND_LOCAL_VARIABLE,
103 DECLARATION_KIND_LOCAL_VARIABLE_ENTITY,
104 DECLARATION_KIND_PARAMETER,
105 DECLARATION_KIND_PARAMETER_ENTITY,
106 DECLARATION_KIND_FUNCTION,
107 DECLARATION_KIND_COMPOUND_MEMBER,
108 DECLARATION_KIND_INNER_FUNCTION
109 } declaration_kind_t;
111 static ir_type *get_ir_type_incomplete(type_t *type);
113 static void enqueue_inner_function(entity_t *entity)
115 if (inner_functions == NULL)
116 inner_functions = NEW_ARR_F(entity_t *, 0);
117 ARR_APP1(entity_t*, inner_functions, entity);
120 static ir_node *uninitialized_local_var(ir_graph *irg, ir_mode *mode, int pos)
122 const entity_t *entity = get_irg_loc_description(irg, pos);
124 if (entity != NULL) {
125 source_position_t const *const pos = &entity->base.source_position;
126 warningf(WARN_UNINITIALIZED, pos, "'%N' might be used uninitialized", entity);
128 return new_r_Unknown(irg, mode);
131 static src_loc_t dbg_retrieve(const dbg_info *dbg)
133 source_position_t const *const pos = (source_position_t const*)dbg;
135 return (src_loc_t){ pos->input_name, pos->lineno, pos->colno };
137 return (src_loc_t){ NULL, 0, 0 };
141 static dbg_info *get_dbg_info(const source_position_t *pos)
143 return (dbg_info*) pos;
146 static void dbg_print_type_dbg_info(char *buffer, size_t buffer_size,
147 const type_dbg_info *dbg)
150 print_to_buffer(buffer, buffer_size);
151 const type_t *type = (const type_t*) dbg;
153 finish_print_to_buffer();
156 static type_dbg_info *get_type_dbg_info_(const type_t *type)
158 return (type_dbg_info*) type;
161 /* is the current block a reachable one? */
162 static bool currently_reachable(void)
164 ir_node *const block = get_cur_block();
165 return block != NULL && !is_Bad(block);
168 static void set_unreachable_now(void)
173 ir_mode *atomic_modes[ATOMIC_TYPE_LAST+1];
175 static ir_node *_expression_to_firm(const expression_t *expression);
176 static ir_node *expression_to_firm(const expression_t *expression);
178 static unsigned decide_modulo_shift(unsigned type_size)
180 if (architecture_modulo_shift == 0)
182 if (type_size < architecture_modulo_shift)
183 return architecture_modulo_shift;
187 static ir_mode *init_atomic_ir_mode(atomic_type_kind_t kind)
189 unsigned flags = get_atomic_type_flags(kind);
190 unsigned size = get_atomic_type_size(kind);
191 if ((flags & ATOMIC_TYPE_FLAG_FLOAT)
192 && !(flags & ATOMIC_TYPE_FLAG_COMPLEX)) {
195 } else if (size == 8) {
198 panic("unexpected kind");
200 } else if (flags & ATOMIC_TYPE_FLAG_INTEGER) {
202 unsigned bit_size = size * 8;
203 bool is_signed = (flags & ATOMIC_TYPE_FLAG_SIGNED) != 0;
204 unsigned modulo_shift = decide_modulo_shift(bit_size);
206 snprintf(name, sizeof(name), "%s%u", is_signed ? "I" : "U", bit_size);
207 return new_int_mode(name, irma_twos_complement, bit_size, is_signed,
215 * Initialises the atomic modes depending on the machine size.
217 static void init_atomic_modes(void)
219 atomic_modes[ATOMIC_TYPE_VOID] = mode_ANY;
220 for (int i = 0; i <= ATOMIC_TYPE_LAST; ++i) {
221 if (atomic_modes[i] != NULL)
223 atomic_modes[i] = init_atomic_ir_mode((atomic_type_kind_t) i);
227 ir_mode *get_atomic_mode(atomic_type_kind_t kind)
229 assert(kind <= ATOMIC_TYPE_LAST);
230 return atomic_modes[kind];
233 static ir_node *get_vla_size(array_type_t *const type)
235 ir_node *size_node = type->size_node;
236 if (size_node == NULL) {
237 size_node = expression_to_firm(type->size_expression);
238 type->size_node = size_node;
243 static unsigned count_parameters(const function_type_t *function_type)
247 function_parameter_t *parameter = function_type->parameters;
248 for ( ; parameter != NULL; parameter = parameter->next) {
256 * Creates a Firm type for an atomic type
258 static ir_type *create_atomic_type(atomic_type_kind_t akind, const type_t *type)
260 ir_mode *mode = atomic_modes[akind];
261 type_dbg_info *dbgi = get_type_dbg_info_(type);
262 ir_type *irtype = new_d_type_primitive(mode, dbgi);
263 il_alignment_t alignment = get_atomic_type_alignment(akind);
265 set_type_size_bytes(irtype, get_atomic_type_size(akind));
266 set_type_alignment_bytes(irtype, alignment);
272 * Creates a Firm type for a complex type
274 static ir_type *create_complex_type(const atomic_type_t *type)
276 atomic_type_kind_t kind = type->akind;
277 ir_mode *mode = atomic_modes[kind];
278 ident *id = get_mode_ident(mode);
282 /* FIXME: finish the array */
287 * Creates a Firm type for an imaginary type
289 static ir_type *create_imaginary_type(const atomic_type_t *type)
291 return create_atomic_type(type->akind, (const type_t*)type);
295 * return type of a parameter (and take transparent union gnu extension into
298 static type_t *get_parameter_type(type_t *orig_type)
300 type_t *type = skip_typeref(orig_type);
301 if (is_type_union(type)
302 && get_type_modifiers(orig_type) & DM_TRANSPARENT_UNION) {
303 compound_t *compound = type->compound.compound;
304 type = compound->members.entities->declaration.type;
310 static ir_type *create_method_type(const function_type_t *function_type, bool for_closure)
312 type_t *return_type = skip_typeref(function_type->return_type);
314 int n_parameters = count_parameters(function_type)
315 + (for_closure ? 1 : 0);
316 int n_results = is_type_void(return_type) ? 0 : 1;
317 type_dbg_info *dbgi = get_type_dbg_info_((const type_t*) function_type);
318 ir_type *irtype = new_d_type_method(n_parameters, n_results, dbgi);
320 if (!is_type_void(return_type)) {
321 ir_type *restype = get_ir_type(return_type);
322 set_method_res_type(irtype, 0, restype);
325 function_parameter_t *parameter = function_type->parameters;
328 ir_type *p_irtype = get_ir_type(type_void_ptr);
329 set_method_param_type(irtype, n, p_irtype);
332 for ( ; parameter != NULL; parameter = parameter->next) {
333 type_t *type = get_parameter_type(parameter->type);
334 ir_type *p_irtype = get_ir_type(type);
335 set_method_param_type(irtype, n, p_irtype);
339 bool is_variadic = function_type->variadic;
342 set_method_variadicity(irtype, variadicity_variadic);
344 unsigned cc = get_method_calling_convention(irtype);
345 switch (function_type->calling_convention) {
346 case CC_DEFAULT: /* unspecified calling convention, equal to one of the other, typically cdecl */
349 set_method_calling_convention(irtype, SET_CDECL(cc));
356 /* only non-variadic function can use stdcall, else use cdecl */
357 set_method_calling_convention(irtype, SET_STDCALL(cc));
363 /* only non-variadic function can use fastcall, else use cdecl */
364 set_method_calling_convention(irtype, SET_FASTCALL(cc));
368 /* Hmm, leave default, not accepted by the parser yet. */
373 set_method_calling_convention(irtype, get_method_calling_convention(irtype) | cc_this_call);
375 const decl_modifiers_t modifiers = function_type->modifiers;
376 if (modifiers & DM_CONST)
377 add_method_additional_properties(irtype, mtp_property_const);
378 if (modifiers & DM_PURE)
379 add_method_additional_properties(irtype, mtp_property_pure);
380 if (modifiers & DM_RETURNS_TWICE)
381 add_method_additional_properties(irtype, mtp_property_returns_twice);
382 if (modifiers & DM_NORETURN)
383 add_method_additional_properties(irtype, mtp_property_noreturn);
384 if (modifiers & DM_NOTHROW)
385 add_method_additional_properties(irtype, mtp_property_nothrow);
386 if (modifiers & DM_MALLOC)
387 add_method_additional_properties(irtype, mtp_property_malloc);
392 static ir_type *create_pointer_type(pointer_type_t *type)
394 type_dbg_info *dbgi = get_type_dbg_info_((const type_t*) type);
395 type_t *points_to = type->points_to;
396 ir_type *ir_points_to = get_ir_type_incomplete(points_to);
397 ir_type *irtype = new_d_type_pointer(ir_points_to, dbgi);
402 static ir_type *create_reference_type(reference_type_t *type)
404 type_dbg_info *dbgi = get_type_dbg_info_((const type_t*) type);
405 type_t *refers_to = type->refers_to;
406 ir_type *ir_refers_to = get_ir_type_incomplete(refers_to);
407 ir_type *irtype = new_d_type_pointer(ir_refers_to, dbgi);
412 static ir_type *create_array_type(array_type_t *type)
414 type_dbg_info *dbgi = get_type_dbg_info_((const type_t*) type);
415 type_t *element_type = type->element_type;
416 ir_type *ir_element_type = get_ir_type(element_type);
417 ir_type *irtype = new_d_type_array(1, ir_element_type, dbgi);
419 const int align = get_type_alignment_bytes(ir_element_type);
420 set_type_alignment_bytes(irtype, align);
422 if (type->size_constant) {
423 int n_elements = type->size;
425 set_array_bounds_int(irtype, 0, 0, n_elements);
427 size_t elemsize = get_type_size_bytes(ir_element_type);
428 if (elemsize % align > 0) {
429 elemsize += align - (elemsize % align);
431 set_type_size_bytes(irtype, n_elements * elemsize);
433 set_array_lower_bound_int(irtype, 0, 0);
435 set_type_state(irtype, layout_fixed);
441 * Return the signed integer type of size bits.
443 * @param size the size
445 static ir_type *get_signed_int_type_for_bit_size(ir_type *base_tp,
449 static ir_mode *s_modes[64 + 1] = {NULL, };
453 if (size <= 0 || size > 64)
456 mode = s_modes[size];
460 snprintf(name, sizeof(name), "bf_I%u", size);
461 mode = new_int_mode(name, irma_twos_complement, size, 1, 0);
462 s_modes[size] = mode;
465 type_dbg_info *dbgi = get_type_dbg_info_(type);
466 res = new_d_type_primitive(mode, dbgi);
467 set_primitive_base_type(res, base_tp);
473 * Return the unsigned integer type of size bits.
475 * @param size the size
477 static ir_type *get_unsigned_int_type_for_bit_size(ir_type *base_tp,
481 static ir_mode *u_modes[64 + 1] = {NULL, };
485 if (size <= 0 || size > 64)
488 mode = u_modes[size];
492 snprintf(name, sizeof(name), "bf_U%u", size);
493 mode = new_int_mode(name, irma_twos_complement, size, 0, 0);
494 u_modes[size] = mode;
497 type_dbg_info *dbgi = get_type_dbg_info_(type);
498 res = new_d_type_primitive(mode, dbgi);
499 set_primitive_base_type(res, base_tp);
504 static ir_type *create_bitfield_type(const entity_t *entity)
506 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
507 type_t *base = skip_typeref(entity->declaration.type);
508 assert(base->kind == TYPE_ATOMIC || base->kind == TYPE_ENUM);
509 ir_type *irbase = get_ir_type(base);
511 unsigned bit_size = entity->compound_member.bit_size;
513 assert(!is_type_float(base));
514 if (is_type_signed(base)) {
515 return get_signed_int_type_for_bit_size(irbase, bit_size, base);
517 return get_unsigned_int_type_for_bit_size(irbase, bit_size, base);
522 * Construct firm type from ast struct type.
524 static ir_type *create_compound_type(compound_type_t *const type, bool const incomplete)
526 compound_t *compound = type->compound;
528 if (compound->irtype != NULL && (compound->irtype_complete || incomplete)) {
529 return compound->irtype;
532 bool const is_union = type->base.kind == TYPE_COMPOUND_UNION;
534 symbol_t *type_symbol = compound->base.symbol;
536 if (type_symbol != NULL) {
537 id = new_id_from_str(type_symbol->string);
540 id = id_unique("__anonymous_union.%u");
542 id = id_unique("__anonymous_struct.%u");
548 irtype = new_type_union(id);
550 irtype = new_type_struct(id);
553 compound->irtype_complete = false;
554 compound->irtype = irtype;
560 layout_union_type(type);
562 layout_struct_type(type);
565 compound->irtype_complete = true;
567 entity_t *entry = compound->members.entities;
568 for ( ; entry != NULL; entry = entry->base.next) {
569 if (entry->kind != ENTITY_COMPOUND_MEMBER)
572 symbol_t *symbol = entry->base.symbol;
573 type_t *entry_type = entry->declaration.type;
575 if (symbol == NULL) {
576 /* anonymous bitfield member, skip */
577 if (entry->compound_member.bitfield)
579 assert(entry_type->kind == TYPE_COMPOUND_STRUCT
580 || entry_type->kind == TYPE_COMPOUND_UNION);
581 ident = id_unique("anon.%u");
583 ident = new_id_from_str(symbol->string);
586 dbg_info *dbgi = get_dbg_info(&entry->base.source_position);
588 ir_type *entry_irtype;
589 if (entry->compound_member.bitfield) {
590 entry_irtype = create_bitfield_type(entry);
592 entry_irtype = get_ir_type(entry_type);
594 ir_entity *entity = new_d_entity(irtype, ident, entry_irtype, dbgi);
596 set_entity_offset(entity, entry->compound_member.offset);
597 set_entity_offset_bits_remainder(entity,
598 entry->compound_member.bit_offset);
600 assert(entry->declaration.kind == DECLARATION_KIND_UNKNOWN);
601 entry->declaration.kind = DECLARATION_KIND_COMPOUND_MEMBER;
602 entry->compound_member.entity = entity;
605 set_type_alignment_bytes(irtype, compound->alignment);
606 set_type_size_bytes(irtype, compound->size);
607 set_type_state(irtype, layout_fixed);
612 static ir_tarval *fold_constant_to_tarval(expression_t const *);
614 static void determine_enum_values(enum_type_t *const type)
616 ir_mode *const mode = atomic_modes[type->base.akind];
617 ir_tarval *const one = get_mode_one(mode);
618 ir_tarval * tv_next = get_mode_null(mode);
620 enum_t *enume = type->enume;
621 entity_t *entry = enume->base.next;
622 for (; entry != NULL; entry = entry->base.next) {
623 if (entry->kind != ENTITY_ENUM_VALUE)
626 expression_t *const init = entry->enum_value.value;
628 tv_next = fold_constant_to_tarval(init);
630 assert(entry->enum_value.tv == NULL || entry->enum_value.tv == tv_next);
631 entry->enum_value.tv = tv_next;
632 tv_next = tarval_add(tv_next, one);
636 static ir_type *create_enum_type(enum_type_t *const type)
638 return create_atomic_type(type->base.akind, (const type_t*) type);
641 static ir_type *get_ir_type_incomplete(type_t *type)
643 assert(type != NULL);
644 type = skip_typeref(type);
646 if (type->base.firm_type != NULL) {
647 return type->base.firm_type;
650 if (is_type_compound(type)) {
651 return create_compound_type(&type->compound, true);
653 return get_ir_type(type);
657 ir_type *get_ir_type(type_t *type)
659 assert(type != NULL);
661 type = skip_typeref(type);
663 if (type->base.firm_type != NULL) {
664 return type->base.firm_type;
667 ir_type *firm_type = NULL;
668 switch (type->kind) {
670 firm_type = create_atomic_type(type->atomic.akind, type);
673 firm_type = create_complex_type(&type->atomic);
676 firm_type = create_imaginary_type(&type->atomic);
679 firm_type = create_method_type(&type->function, false);
682 firm_type = create_pointer_type(&type->pointer);
685 firm_type = create_reference_type(&type->reference);
688 firm_type = create_array_type(&type->array);
690 case TYPE_COMPOUND_STRUCT:
691 case TYPE_COMPOUND_UNION:
692 firm_type = create_compound_type(&type->compound, false);
695 firm_type = create_enum_type(&type->enumt);
703 if (firm_type == NULL)
704 panic("unknown type found");
706 type->base.firm_type = firm_type;
710 static ir_mode *get_ir_mode_storage(type_t *type)
712 type = skip_typeref(type);
714 /* Firm doesn't report a mode for arrays and structs/unions. */
715 if (!is_type_scalar(type)) {
719 ir_type *const irtype = get_ir_type(type);
720 ir_mode *const mode = get_type_mode(irtype);
721 assert(mode != NULL);
726 * get arithmetic mode for a type. This is different from get_ir_mode_storage,
727 * int that it returns bigger modes for floating point on some platforms
728 * (x87 internally does arithemtic with 80bits)
730 static ir_mode *get_ir_mode_arithmetic(type_t *type)
732 ir_mode *mode = get_ir_mode_storage(type);
733 if (mode_is_float(mode) && mode_float_arithmetic != NULL) {
734 return mode_float_arithmetic;
741 * Return a node representing the size of a type.
743 static ir_node *get_type_size_node(type_t *type)
746 ir_mode *mode = get_ir_mode_arithmetic(type_size_t);
747 type = skip_typeref(type);
749 if (is_type_array(type) && type->array.is_vla) {
750 ir_node *size_node = get_vla_size(&type->array);
751 ir_node *elem_size = get_type_size_node(type->array.element_type);
752 ir_node *real_size = new_d_Mul(NULL, size_node, elem_size, mode);
756 size = get_type_size(type);
757 return new_Const_long(mode, size);
760 /** Names of the runtime functions. */
761 static const struct {
762 int id; /**< the rts id */
763 int n_res; /**< number of return values */
764 const char *name; /**< the name of the rts function */
765 int n_params; /**< number of parameters */
766 unsigned flags; /**< language flags */
768 { rts_debugbreak, 0, "__debugbreak", 0, _MS },
769 { rts_abort, 0, "abort", 0, _C89 },
770 { rts_alloca, 1, "alloca", 1, _ALL },
771 { rts_abs, 1, "abs", 1, _C89 },
772 { rts_labs, 1, "labs", 1, _C89 },
773 { rts_llabs, 1, "llabs", 1, _C99 },
774 { rts_imaxabs, 1, "imaxabs", 1, _C99 },
776 { rts_fabs, 1, "fabs", 1, _C89 },
777 { rts_sqrt, 1, "sqrt", 1, _C89 },
778 { rts_cbrt, 1, "cbrt", 1, _C99 },
779 { rts_exp, 1, "exp", 1, _C89 },
780 { rts_exp2, 1, "exp2", 1, _C89 },
781 { rts_exp10, 1, "exp10", 1, _GNUC },
782 { rts_log, 1, "log", 1, _C89 },
783 { rts_log2, 1, "log2", 1, _C89 },
784 { rts_log10, 1, "log10", 1, _C89 },
785 { rts_pow, 1, "pow", 2, _C89 },
786 { rts_sin, 1, "sin", 1, _C89 },
787 { rts_cos, 1, "cos", 1, _C89 },
788 { rts_tan, 1, "tan", 1, _C89 },
789 { rts_asin, 1, "asin", 1, _C89 },
790 { rts_acos, 1, "acos", 1, _C89 },
791 { rts_atan, 1, "atan", 1, _C89 },
792 { rts_sinh, 1, "sinh", 1, _C89 },
793 { rts_cosh, 1, "cosh", 1, _C89 },
794 { rts_tanh, 1, "tanh", 1, _C89 },
796 { rts_fabsf, 1, "fabsf", 1, _C99 },
797 { rts_sqrtf, 1, "sqrtf", 1, _C99 },
798 { rts_cbrtf, 1, "cbrtf", 1, _C99 },
799 { rts_expf, 1, "expf", 1, _C99 },
800 { rts_exp2f, 1, "exp2f", 1, _C99 },
801 { rts_exp10f, 1, "exp10f", 1, _GNUC },
802 { rts_logf, 1, "logf", 1, _C99 },
803 { rts_log2f, 1, "log2f", 1, _C99 },
804 { rts_log10f, 1, "log10f", 1, _C99 },
805 { rts_powf, 1, "powf", 2, _C99 },
806 { rts_sinf, 1, "sinf", 1, _C99 },
807 { rts_cosf, 1, "cosf", 1, _C99 },
808 { rts_tanf, 1, "tanf", 1, _C99 },
809 { rts_asinf, 1, "asinf", 1, _C99 },
810 { rts_acosf, 1, "acosf", 1, _C99 },
811 { rts_atanf, 1, "atanf", 1, _C99 },
812 { rts_sinhf, 1, "sinhf", 1, _C99 },
813 { rts_coshf, 1, "coshf", 1, _C99 },
814 { rts_tanhf, 1, "tanhf", 1, _C99 },
816 { rts_fabsl, 1, "fabsl", 1, _C99 },
817 { rts_sqrtl, 1, "sqrtl", 1, _C99 },
818 { rts_cbrtl, 1, "cbrtl", 1, _C99 },
819 { rts_expl, 1, "expl", 1, _C99 },
820 { rts_exp2l, 1, "exp2l", 1, _C99 },
821 { rts_exp10l, 1, "exp10l", 1, _GNUC },
822 { rts_logl, 1, "logl", 1, _C99 },
823 { rts_log2l, 1, "log2l", 1, _C99 },
824 { rts_log10l, 1, "log10l", 1, _C99 },
825 { rts_powl, 1, "powl", 2, _C99 },
826 { rts_sinl, 1, "sinl", 1, _C99 },
827 { rts_cosl, 1, "cosl", 1, _C99 },
828 { rts_tanl, 1, "tanl", 1, _C99 },
829 { rts_asinl, 1, "asinl", 1, _C99 },
830 { rts_acosl, 1, "acosl", 1, _C99 },
831 { rts_atanl, 1, "atanl", 1, _C99 },
832 { rts_sinhl, 1, "sinhl", 1, _C99 },
833 { rts_coshl, 1, "coshl", 1, _C99 },
834 { rts_tanhl, 1, "tanhl", 1, _C99 },
836 { rts_strcmp, 1, "strcmp", 2, _C89 },
837 { rts_strncmp, 1, "strncmp", 3, _C89 },
838 { rts_strcpy, 1, "strcpy", 2, _C89 },
839 { rts_strlen, 1, "strlen", 1, _C89 },
840 { rts_memcpy, 1, "memcpy", 3, _C89 },
841 { rts_mempcpy, 1, "mempcpy", 3, _GNUC },
842 { rts_memmove, 1, "memmove", 3, _C89 },
843 { rts_memset, 1, "memset", 3, _C89 },
844 { rts_memcmp, 1, "memcmp", 3, _C89 },
847 static ident *rts_idents[lengthof(rts_data)];
849 static create_ld_ident_func create_ld_ident = create_name_linux_elf;
851 void set_create_ld_ident(ident *(*func)(entity_t*))
853 create_ld_ident = func;
856 static bool declaration_is_definition(const entity_t *entity)
858 switch (entity->kind) {
859 case ENTITY_VARIABLE:
860 return entity->declaration.storage_class != STORAGE_CLASS_EXTERN;
861 case ENTITY_FUNCTION:
862 return entity->function.statement != NULL;
863 case ENTITY_PARAMETER:
864 case ENTITY_COMPOUND_MEMBER:
868 case ENTITY_ENUM_VALUE:
869 case ENTITY_NAMESPACE:
871 case ENTITY_LOCAL_LABEL:
874 panic("declaration_is_definition called on non-declaration");
878 * Handle GNU attributes for entities
880 * @param ent the entity
881 * @param decl the routine declaration
883 static void handle_decl_modifiers(ir_entity *irentity, entity_t *entity)
885 assert(is_declaration(entity));
886 decl_modifiers_t modifiers = entity->declaration.modifiers;
888 if (is_method_entity(irentity)) {
889 if (modifiers & DM_PURE) {
890 set_entity_additional_properties(irentity, mtp_property_pure);
892 if (modifiers & DM_CONST) {
893 add_entity_additional_properties(irentity, mtp_property_const);
896 if ((modifiers & DM_USED) && declaration_is_definition(entity)) {
897 add_entity_linkage(irentity, IR_LINKAGE_HIDDEN_USER);
899 if ((modifiers & DM_WEAK) && declaration_is_definition(entity)
900 && entity->declaration.storage_class != STORAGE_CLASS_EXTERN) {
901 add_entity_linkage(irentity, IR_LINKAGE_WEAK);
905 static bool is_main(entity_t *entity)
907 static symbol_t *sym_main = NULL;
908 if (sym_main == NULL) {
909 sym_main = symbol_table_insert("main");
912 if (entity->base.symbol != sym_main)
914 /* must be in outermost scope */
915 if (entity->base.parent_scope != ¤t_translation_unit->scope)
922 * Creates an entity representing a function.
924 * @param entity the function declaration/definition
925 * @param owner_type the owner type of this function, NULL
926 * for global functions
928 static ir_entity *get_function_entity(entity_t *entity, ir_type *owner_type)
930 assert(entity->kind == ENTITY_FUNCTION);
931 if (entity->function.irentity != NULL)
932 return entity->function.irentity;
934 switch (entity->function.btk) {
937 case BUILTIN_LIBC_CHECK:
943 symbol_t *symbol = entity->base.symbol;
944 ident *id = new_id_from_str(symbol->string);
946 /* already an entity defined? */
947 ir_entity *irentity = entitymap_get(&entitymap, symbol);
948 bool const has_body = entity->function.statement != NULL;
949 if (irentity != NULL) {
953 ir_type *ir_type_method;
954 if (entity->function.need_closure)
955 ir_type_method = create_method_type(&entity->declaration.type->function, true);
957 ir_type_method = get_ir_type(entity->declaration.type);
959 bool nested_function = false;
960 if (owner_type == NULL)
961 owner_type = get_glob_type();
963 nested_function = true;
965 dbg_info *const dbgi = get_dbg_info(&entity->base.source_position);
966 irentity = new_d_entity(owner_type, id, ir_type_method, dbgi);
970 ld_id = id_unique("inner.%u");
972 ld_id = create_ld_ident(entity);
973 set_entity_ld_ident(irentity, ld_id);
975 handle_decl_modifiers(irentity, entity);
977 if (! nested_function) {
978 storage_class_tag_t const storage_class
979 = (storage_class_tag_t) entity->declaration.storage_class;
980 if (storage_class == STORAGE_CLASS_STATIC) {
981 set_entity_visibility(irentity, ir_visibility_local);
983 set_entity_visibility(irentity, ir_visibility_external);
986 bool const is_inline = entity->function.is_inline;
987 if (is_inline && has_body) {
988 if (((c_mode & _C99) && storage_class == STORAGE_CLASS_NONE)
989 || ((c_mode & _C99) == 0
990 && storage_class == STORAGE_CLASS_EXTERN)) {
991 add_entity_linkage(irentity, IR_LINKAGE_NO_CODEGEN);
995 /* nested functions are always local */
996 set_entity_visibility(irentity, ir_visibility_local);
999 /* We should check for file scope here, but as long as we compile C only
1000 this is not needed. */
1001 if (!freestanding && !has_body) {
1002 /* check for a known runtime function */
1003 for (size_t i = 0; i < lengthof(rts_data); ++i) {
1004 if (id != rts_idents[i])
1007 function_type_t *function_type
1008 = &entity->declaration.type->function;
1009 /* rts_entities code can't handle a "wrong" number of parameters */
1010 if (function_type->unspecified_parameters)
1013 /* check number of parameters */
1014 int n_params = count_parameters(function_type);
1015 if (n_params != rts_data[i].n_params)
1018 type_t *return_type = skip_typeref(function_type->return_type);
1019 int n_res = is_type_void(return_type) ? 0 : 1;
1020 if (n_res != rts_data[i].n_res)
1023 /* ignore those rts functions not necessary needed for current mode */
1024 if ((c_mode & rts_data[i].flags) == 0)
1026 assert(rts_entities[rts_data[i].id] == NULL);
1027 rts_entities[rts_data[i].id] = irentity;
1031 entitymap_insert(&entitymap, symbol, irentity);
1034 entity->declaration.kind = DECLARATION_KIND_FUNCTION;
1035 entity->function.irentity = irentity;
1041 * Creates a SymConst for a given entity.
1043 * @param dbgi debug info
1044 * @param entity the entity
1046 static ir_node *create_symconst(dbg_info *dbgi, ir_entity *entity)
1048 assert(entity != NULL);
1049 union symconst_symbol sym;
1050 sym.entity_p = entity;
1051 return new_d_SymConst(dbgi, mode_P, sym, symconst_addr_ent);
1054 static ir_node *create_Const_from_bool(ir_mode *const mode, bool const v)
1056 return new_Const((v ? get_mode_one : get_mode_null)(mode));
1059 static ir_node *create_conv_from_b(dbg_info *dbgi, ir_node *value,
1062 if (is_Const(value)) {
1063 return create_Const_from_bool(dest_mode, !is_Const_null(value));
1066 ir_node *cond = new_d_Cond(dbgi, value);
1067 ir_node *proj_true = new_Proj(cond, mode_X, pn_Cond_true);
1068 ir_node *proj_false = new_Proj(cond, mode_X, pn_Cond_false);
1069 ir_node *tblock = new_Block(1, &proj_true);
1070 ir_node *fblock = new_Block(1, &proj_false);
1071 set_cur_block(tblock);
1072 ir_node *const1 = new_Const(get_mode_one(dest_mode));
1073 ir_node *tjump = new_Jmp();
1074 set_cur_block(fblock);
1075 ir_node *const0 = new_Const(get_mode_null(dest_mode));
1076 ir_node *fjump = new_Jmp();
1078 ir_node *in[2] = { tjump, fjump };
1079 ir_node *mergeblock = new_Block(2, in);
1080 set_cur_block(mergeblock);
1081 ir_node *phi_in[2] = { const1, const0 };
1082 ir_node *phi = new_Phi(2, phi_in, dest_mode);
1086 static ir_node *create_conv(dbg_info *dbgi, ir_node *value, ir_mode *dest_mode)
1088 ir_mode *value_mode = get_irn_mode(value);
1090 if (value_mode == dest_mode)
1093 if (dest_mode == mode_b) {
1094 ir_node *zero = new_Const(get_mode_null(value_mode));
1095 ir_node *cmp = new_d_Cmp(dbgi, value, zero, ir_relation_unordered_less_greater);
1097 } else if (value_mode == mode_b) {
1098 return create_conv_from_b(dbgi, value, dest_mode);
1101 return new_d_Conv(dbgi, value, dest_mode);
1105 * Creates a SymConst node representing a string constant.
1107 * @param src_pos the source position of the string constant
1108 * @param id_prefix a prefix for the name of the generated string constant
1109 * @param value the value of the string constant
1111 static ir_node *string_to_firm(source_position_t const *const src_pos, char const *const id_prefix, string_encoding_t const enc, string_t const *const value)
1115 ir_initializer_t *initializer;
1117 case STRING_ENCODING_CHAR: {
1118 slen = value->size + 1;
1119 elem_type = ir_type_char;
1120 initializer = create_initializer_compound(slen);
1122 ir_mode *const mode = get_type_mode(elem_type);
1123 char const *p = value->begin;
1124 for (size_t i = 0; i < slen; ++i) {
1125 ir_tarval *tv = new_tarval_from_long(*p++, mode);
1126 ir_initializer_t *val = create_initializer_tarval(tv);
1127 set_initializer_compound_value(initializer, i, val);
1132 case STRING_ENCODING_WIDE: {
1133 slen = wstrlen(value) + 1;
1134 elem_type = ir_type_wchar_t;
1135 initializer = create_initializer_compound(slen);
1137 ir_mode *const mode = get_type_mode(elem_type);
1138 char const *p = value->begin;
1139 for (size_t i = 0; i < slen; ++i) {
1140 assert(p <= value->begin + value->size);
1141 utf32 v = read_utf8_char(&p);
1142 ir_tarval *tv = new_tarval_from_long(v, mode);
1143 ir_initializer_t *val = create_initializer_tarval(tv);
1144 set_initializer_compound_value(initializer, i, val);
1149 panic("invalid string encoding");
1152 ir_type *const type = new_type_array(1, elem_type);
1153 set_array_bounds_int(type, 0, 0, slen);
1154 set_type_size_bytes( type, slen * get_type_size_bytes(elem_type));
1155 set_type_state( type, layout_fixed);
1157 ir_type *const global_type = get_glob_type();
1158 ident *const id = id_unique(id_prefix);
1159 dbg_info *const dbgi = get_dbg_info(src_pos);
1160 ir_entity *const entity = new_d_entity(global_type, id, type, dbgi);
1161 set_entity_ld_ident( entity, id);
1162 set_entity_visibility( entity, ir_visibility_private);
1163 add_entity_linkage( entity, IR_LINKAGE_CONSTANT);
1164 set_entity_initializer(entity, initializer);
1166 return create_symconst(dbgi, entity);
1169 static bool try_create_integer(literal_expression_t *literal, type_t *type)
1171 const char *string = literal->value.begin;
1172 size_t size = literal->value.size;
1174 assert(type->kind == TYPE_ATOMIC);
1175 atomic_type_kind_t akind = type->atomic.akind;
1177 ir_mode *const mode = atomic_modes[akind];
1178 ir_tarval *const tv = new_tarval_from_str(string, size, mode);
1179 if (tv == tarval_bad)
1182 literal->base.type = type;
1183 literal->target_value = tv;
1187 static void create_integer_tarval(literal_expression_t *literal)
1189 /* -1: signed only, 0: any, 1: unsigned only */
1190 int sign = literal->value.begin[0] != '0' /* decimal */ ? -1 : 0;
1192 const string_t *suffix = &literal->suffix;
1194 if (suffix->size > 0) {
1195 for (const char *c = suffix->begin; *c != '\0'; ++c) {
1196 if (*c == 'u' || *c == 'U') sign = 1;
1197 if (*c == 'l' || *c == 'L') { ++ls; }
1201 tarval_int_overflow_mode_t old_mode = tarval_get_integer_overflow_mode();
1203 /* now try if the constant is small enough for some types */
1204 tarval_set_integer_overflow_mode(TV_OVERFLOW_BAD);
1206 if (sign <= 0 && try_create_integer(literal, type_int))
1208 if (sign >= 0 && try_create_integer(literal, type_unsigned_int))
1212 if (sign <= 0 && try_create_integer(literal, type_long))
1214 if (sign >= 0 && try_create_integer(literal, type_unsigned_long))
1217 /* last try? then we should not report tarval_bad */
1219 tarval_set_integer_overflow_mode(TV_OVERFLOW_WRAP);
1220 if (sign <= 0 && try_create_integer(literal, type_long_long))
1225 tarval_set_integer_overflow_mode(TV_OVERFLOW_WRAP);
1226 bool res = try_create_integer(literal, type_unsigned_long_long);
1228 panic("internal error when parsing number literal");
1231 tarval_set_integer_overflow_mode(old_mode);
1234 void determine_literal_type(literal_expression_t *literal)
1236 switch (literal->base.kind) {
1237 case EXPR_LITERAL_INTEGER:
1238 create_integer_tarval(literal);
1246 * Creates a Const node representing a constant.
1248 static ir_node *literal_to_firm(const literal_expression_t *literal)
1250 type_t *type = skip_typeref(literal->base.type);
1251 ir_mode *mode = get_ir_mode_storage(type);
1252 const char *string = literal->value.begin;
1253 size_t size = literal->value.size;
1256 switch (literal->base.kind) {
1257 case EXPR_LITERAL_INTEGER:
1258 assert(literal->target_value != NULL);
1259 tv = literal->target_value;
1262 case EXPR_LITERAL_FLOATINGPOINT:
1263 tv = new_tarval_from_str(string, size, mode);
1266 case EXPR_LITERAL_BOOLEAN:
1267 if (string[0] == 't') {
1268 tv = get_mode_one(mode);
1270 assert(string[0] == 'f');
1271 case EXPR_LITERAL_MS_NOOP:
1272 tv = get_mode_null(mode);
1277 panic("Invalid literal kind found");
1280 dbg_info *dbgi = get_dbg_info(&literal->base.source_position);
1281 ir_node *res = new_d_Const(dbgi, tv);
1282 ir_mode *mode_arith = get_ir_mode_arithmetic(type);
1283 return create_conv(dbgi, res, mode_arith);
1287 * Creates a Const node representing a character constant.
1289 static ir_node *char_literal_to_firm(string_literal_expression_t const *literal)
1291 type_t *type = skip_typeref(literal->base.type);
1292 ir_mode *mode = get_ir_mode_storage(type);
1293 const char *string = literal->value.begin;
1294 size_t size = literal->value.size;
1297 switch (literal->encoding) {
1298 case STRING_ENCODING_WIDE: {
1299 utf32 v = read_utf8_char(&string);
1301 size_t len = snprintf(buf, sizeof(buf), UTF32_PRINTF_FORMAT, v);
1303 tv = new_tarval_from_str(buf, len, mode);
1307 case STRING_ENCODING_CHAR: {
1310 = get_atomic_type_flags(ATOMIC_TYPE_CHAR) & ATOMIC_TYPE_FLAG_SIGNED;
1311 if (size == 1 && char_is_signed) {
1312 v = (signed char)string[0];
1315 for (size_t i = 0; i < size; ++i) {
1316 v = (v << 8) | ((unsigned char)string[i]);
1320 size_t len = snprintf(buf, sizeof(buf), "%lld", v);
1322 tv = new_tarval_from_str(buf, len, mode);
1327 panic("Invalid literal kind found");
1330 dbg_info *dbgi = get_dbg_info(&literal->base.source_position);
1331 ir_node *res = new_d_Const(dbgi, tv);
1332 ir_mode *mode_arith = get_ir_mode_arithmetic(type);
1333 return create_conv(dbgi, res, mode_arith);
1337 * Allocate an area of size bytes aligned at alignment
1340 static ir_entity *alloc_trampoline(ir_type *frame_type, int size, unsigned alignment)
1342 static unsigned area_cnt = 0;
1345 ir_type *tp = new_type_array(1, ir_type_char);
1346 set_array_bounds_int(tp, 0, 0, size);
1347 set_type_alignment_bytes(tp, alignment);
1349 snprintf(buf, sizeof(buf), "trampolin%u", area_cnt++);
1350 ident *name = new_id_from_str(buf);
1351 ir_entity *area = new_entity(frame_type, name, tp);
1353 /* mark this entity as compiler generated */
1354 set_entity_compiler_generated(area, 1);
1359 * Return a node representing a trampoline region
1360 * for a given function entity.
1362 * @param dbgi debug info
1363 * @param entity the function entity
1365 static ir_node *get_trampoline_region(dbg_info *dbgi, ir_entity *entity)
1367 ir_entity *region = NULL;
1370 if (current_trampolines != NULL) {
1371 for (i = ARR_LEN(current_trampolines) - 1; i >= 0; --i) {
1372 if (current_trampolines[i].function == entity) {
1373 region = current_trampolines[i].region;
1378 current_trampolines = NEW_ARR_F(trampoline_region, 0);
1380 ir_graph *irg = current_ir_graph;
1381 if (region == NULL) {
1382 /* create a new region */
1383 ir_type *frame_tp = get_irg_frame_type(irg);
1384 trampoline_region reg;
1385 reg.function = entity;
1387 reg.region = alloc_trampoline(frame_tp,
1388 be_params->trampoline_size,
1389 be_params->trampoline_align);
1390 ARR_APP1(trampoline_region, current_trampolines, reg);
1391 region = reg.region;
1393 return new_d_simpleSel(dbgi, get_irg_no_mem(irg), get_irg_frame(irg),
1398 * Creates a trampoline for a function represented by an entity.
1400 * @param dbgi debug info
1401 * @param mode the (reference) mode for the function address
1402 * @param entity the function entity
1404 static ir_node *create_trampoline(dbg_info *dbgi, ir_mode *mode,
1407 assert(entity != NULL);
1409 in[0] = get_trampoline_region(dbgi, entity);
1410 in[1] = create_symconst(dbgi, entity);
1411 in[2] = get_irg_frame(current_ir_graph);
1413 ir_node *irn = new_d_Builtin(dbgi, get_store(), 3, in, ir_bk_inner_trampoline, get_unknown_type());
1414 set_store(new_Proj(irn, mode_M, pn_Builtin_M));
1415 return new_Proj(irn, mode, pn_Builtin_max+1);
1419 * Dereference an address.
1421 * @param dbgi debug info
1422 * @param type the type of the dereferenced result (the points_to type)
1423 * @param addr the address to dereference
1425 static ir_node *deref_address(dbg_info *const dbgi, type_t *const type,
1426 ir_node *const addr)
1428 type_t *skipped = skip_typeref(type);
1429 if (is_type_incomplete(skipped))
1432 ir_type *irtype = get_ir_type(skipped);
1433 if (is_compound_type(irtype)
1434 || is_Method_type(irtype)
1435 || is_Array_type(irtype)) {
1439 ir_cons_flags flags = skipped->base.qualifiers & TYPE_QUALIFIER_VOLATILE
1440 ? cons_volatile : cons_none;
1441 ir_mode *const mode = get_type_mode(irtype);
1442 ir_node *const memory = get_store();
1443 ir_node *const load = new_d_Load(dbgi, memory, addr, mode, flags);
1444 ir_node *const load_mem = new_d_Proj(dbgi, load, mode_M, pn_Load_M);
1445 ir_node *const load_res = new_d_Proj(dbgi, load, mode, pn_Load_res);
1447 set_store(load_mem);
1449 ir_mode *const mode_arithmetic = get_ir_mode_arithmetic(skipped);
1450 return create_conv(dbgi, load_res, mode_arithmetic);
1454 * Creates a strict Conv (to the node's mode) if necessary.
1456 * @param dbgi debug info
1457 * @param node the node to strict conv
1459 static ir_node *do_strict_conv(dbg_info *dbgi, ir_node *node)
1461 ir_mode *mode = get_irn_mode(node);
1463 if (!(get_irg_fp_model(current_ir_graph) & fp_explicit_rounding))
1465 if (!mode_is_float(mode))
1468 /* check if there is already a Conv */
1469 if (is_Conv(node)) {
1470 /* convert it into a strict Conv */
1471 set_Conv_strict(node, 1);
1475 /* otherwise create a new one */
1476 return new_d_strictConv(dbgi, node, mode);
1480 * Returns the correct base address depending on whether it is a parameter or a
1481 * normal local variable.
1483 static ir_node *get_local_frame(ir_entity *const ent)
1485 ir_graph *const irg = current_ir_graph;
1486 const ir_type *const owner = get_entity_owner(ent);
1487 if (owner == current_outer_frame) {
1488 assert(current_static_link != NULL);
1489 return current_static_link;
1491 return get_irg_frame(irg);
1496 * Keep all memory edges of the given block.
1498 static void keep_all_memory(ir_node *block)
1500 ir_node *old = get_cur_block();
1502 set_cur_block(block);
1503 keep_alive(get_store());
1504 /* TODO: keep all memory edges from restricted pointers */
1508 static ir_node *enum_constant_to_firm(reference_expression_t const *const ref)
1510 entity_t *entity = ref->entity;
1511 if (entity->enum_value.tv == NULL) {
1512 type_t *type = skip_typeref(entity->enum_value.enum_type);
1513 assert(type->kind == TYPE_ENUM);
1514 determine_enum_values(&type->enumt);
1517 return new_Const(entity->enum_value.tv);
1520 static ir_node *reference_addr(const reference_expression_t *ref)
1522 dbg_info *dbgi = get_dbg_info(&ref->base.source_position);
1523 entity_t *entity = ref->entity;
1524 assert(is_declaration(entity));
1526 if (entity->kind == ENTITY_FUNCTION
1527 && entity->function.btk != BUILTIN_NONE) {
1528 ir_entity *irentity = get_function_entity(entity, NULL);
1529 /* for gcc compatibility we have to produce (dummy) addresses for some
1530 * builtins which don't have entities */
1531 if (irentity == NULL) {
1532 source_position_t const *const pos = &ref->base.source_position;
1533 warningf(WARN_OTHER, pos, "taking address of builtin '%N'", ref->entity);
1535 /* simply create a NULL pointer */
1536 ir_mode *mode = get_ir_mode_arithmetic(type_void_ptr);
1537 ir_node *res = new_Const(get_mode_null(mode));
1543 switch((declaration_kind_t) entity->declaration.kind) {
1544 case DECLARATION_KIND_UNKNOWN:
1546 case DECLARATION_KIND_PARAMETER:
1547 case DECLARATION_KIND_LOCAL_VARIABLE:
1548 /* you can store to a local variable (so we don't panic but return NULL
1549 * as an indicator for no real address) */
1551 case DECLARATION_KIND_GLOBAL_VARIABLE: {
1552 ir_node *const addr = create_symconst(dbgi, entity->variable.v.entity);
1556 case DECLARATION_KIND_LOCAL_VARIABLE_ENTITY:
1557 case DECLARATION_KIND_PARAMETER_ENTITY: {
1558 ir_entity *irentity = entity->variable.v.entity;
1559 ir_node *frame = get_local_frame(irentity);
1560 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, irentity);
1564 case DECLARATION_KIND_VARIABLE_LENGTH_ARRAY:
1565 return entity->variable.v.vla_base;
1567 case DECLARATION_KIND_FUNCTION: {
1568 return create_symconst(dbgi, entity->function.irentity);
1571 case DECLARATION_KIND_INNER_FUNCTION: {
1572 type_t *const type = skip_typeref(entity->declaration.type);
1573 ir_mode *const mode = get_ir_mode_storage(type);
1574 if (!entity->function.goto_to_outer && !entity->function.need_closure) {
1575 /* inner function not using the closure */
1576 return create_symconst(dbgi, entity->function.irentity);
1578 /* need trampoline here */
1579 return create_trampoline(dbgi, mode, entity->function.irentity);
1583 case DECLARATION_KIND_COMPOUND_MEMBER:
1584 panic("not implemented reference type");
1587 panic("reference to declaration with unknown type found");
1590 static ir_node *reference_expression_to_firm(const reference_expression_t *ref)
1592 dbg_info *const dbgi = get_dbg_info(&ref->base.source_position);
1593 entity_t *const entity = ref->entity;
1594 assert(is_declaration(entity));
1596 switch ((declaration_kind_t)entity->declaration.kind) {
1597 case DECLARATION_KIND_LOCAL_VARIABLE:
1598 case DECLARATION_KIND_PARAMETER: {
1599 type_t *const type = skip_typeref(entity->declaration.type);
1600 ir_mode *const mode = get_ir_mode_storage(type);
1601 ir_node *const value = get_value(entity->variable.v.value_number, mode);
1602 return create_conv(dbgi, value, get_ir_mode_arithmetic(type));
1606 ir_node *const addr = reference_addr(ref);
1607 return deref_address(dbgi, entity->declaration.type, addr);
1613 * Transform calls to builtin functions.
1615 static ir_node *process_builtin_call(const call_expression_t *call)
1617 dbg_info *dbgi = get_dbg_info(&call->base.source_position);
1619 assert(call->function->kind == EXPR_REFERENCE);
1620 reference_expression_t *builtin = &call->function->reference;
1622 type_t *expr_type = skip_typeref(builtin->base.type);
1623 assert(is_type_pointer(expr_type));
1625 type_t *function_type = skip_typeref(expr_type->pointer.points_to);
1627 switch (builtin->entity->function.btk) {
1630 case BUILTIN_ALLOCA: {
1631 expression_t *argument = call->arguments->expression;
1632 ir_node *size = expression_to_firm(argument);
1634 ir_node *store = get_store();
1635 ir_node *alloca = new_d_Alloc(dbgi, store, size, get_unknown_type(),
1637 ir_node *proj_m = new_Proj(alloca, mode_M, pn_Alloc_M);
1639 ir_node *res = new_Proj(alloca, mode_P_data, pn_Alloc_res);
1644 type_t *type = function_type->function.return_type;
1645 ir_mode *mode = get_ir_mode_arithmetic(type);
1646 ir_tarval *tv = get_mode_infinite(mode);
1647 ir_node *res = new_d_Const(dbgi, tv);
1651 /* Ignore string for now... */
1652 assert(is_type_function(function_type));
1653 type_t *type = function_type->function.return_type;
1654 ir_mode *mode = get_ir_mode_arithmetic(type);
1655 ir_tarval *tv = get_mode_NAN(mode);
1656 ir_node *res = new_d_Const(dbgi, tv);
1659 case BUILTIN_EXPECT: {
1660 expression_t *argument = call->arguments->expression;
1661 return _expression_to_firm(argument);
1663 case BUILTIN_VA_END:
1664 /* evaluate the argument of va_end for its side effects */
1665 _expression_to_firm(call->arguments->expression);
1667 case BUILTIN_OBJECT_SIZE: {
1668 /* determine value of "type" */
1669 expression_t *type_expression = call->arguments->next->expression;
1670 long type_val = fold_constant_to_int(type_expression);
1671 type_t *type = function_type->function.return_type;
1672 ir_mode *mode = get_ir_mode_arithmetic(type);
1673 /* just produce a "I don't know" result */
1674 ir_tarval *result = type_val & 2 ? get_mode_null(mode) :
1675 get_mode_minus_one(mode);
1677 return new_d_Const(dbgi, result);
1679 case BUILTIN_ROTL: {
1680 ir_node *val = expression_to_firm(call->arguments->expression);
1681 ir_node *shf = expression_to_firm(call->arguments->next->expression);
1682 ir_mode *mode = get_irn_mode(val);
1683 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
1684 return new_d_Rotl(dbgi, val, create_conv(dbgi, shf, mode_uint), mode);
1686 case BUILTIN_ROTR: {
1687 ir_node *val = expression_to_firm(call->arguments->expression);
1688 ir_node *shf = expression_to_firm(call->arguments->next->expression);
1689 ir_mode *mode = get_irn_mode(val);
1690 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
1691 ir_node *c = new_Const_long(mode_uint, get_mode_size_bits(mode));
1692 ir_node *sub = new_d_Sub(dbgi, c, create_conv(dbgi, shf, mode_uint), mode_uint);
1693 return new_d_Rotl(dbgi, val, sub, mode);
1698 case BUILTIN_LIBC_CHECK:
1699 panic("builtin did not produce an entity");
1701 panic("invalid builtin found");
1705 * Transform a call expression.
1706 * Handles some special cases, like alloca() calls, which must be resolved
1707 * BEFORE the inlines runs. Inlining routines calling alloca() is dangerous,
1708 * 176.gcc for instance might allocate 2GB instead of 256 MB if alloca is not
1711 static ir_node *call_expression_to_firm(const call_expression_t *const call)
1713 dbg_info *const dbgi = get_dbg_info(&call->base.source_position);
1714 assert(currently_reachable());
1716 expression_t *function = call->function;
1717 ir_node *callee = NULL;
1718 bool firm_builtin = false;
1719 ir_builtin_kind firm_builtin_kind = ir_bk_trap;
1720 if (function->kind == EXPR_REFERENCE) {
1721 const reference_expression_t *ref = &function->reference;
1722 entity_t *entity = ref->entity;
1724 if (entity->kind == ENTITY_FUNCTION) {
1725 builtin_kind_t builtin = entity->function.btk;
1726 if (builtin == BUILTIN_FIRM) {
1727 firm_builtin = true;
1728 firm_builtin_kind = entity->function.b.firm_builtin_kind;
1729 } else if (builtin != BUILTIN_NONE && builtin != BUILTIN_LIBC
1730 && builtin != BUILTIN_LIBC_CHECK) {
1731 return process_builtin_call(call);
1736 callee = expression_to_firm(function);
1738 type_t *type = skip_typeref(function->base.type);
1739 assert(is_type_pointer(type));
1740 pointer_type_t *pointer_type = &type->pointer;
1741 type_t *points_to = skip_typeref(pointer_type->points_to);
1742 assert(is_type_function(points_to));
1743 function_type_t *function_type = &points_to->function;
1745 int n_parameters = 0;
1746 ir_type *ir_method_type = get_ir_type((type_t*) function_type);
1747 ir_type *new_method_type = NULL;
1748 if (function_type->variadic || function_type->unspecified_parameters) {
1749 const call_argument_t *argument = call->arguments;
1750 for ( ; argument != NULL; argument = argument->next) {
1754 /* we need to construct a new method type matching the call
1756 type_dbg_info *tdbgi = get_type_dbg_info_((const type_t*) function_type);
1757 int n_res = get_method_n_ress(ir_method_type);
1758 new_method_type = new_d_type_method(n_parameters, n_res, tdbgi);
1759 set_method_calling_convention(new_method_type,
1760 get_method_calling_convention(ir_method_type));
1761 set_method_additional_properties(new_method_type,
1762 get_method_additional_properties(ir_method_type));
1763 set_method_variadicity(new_method_type,
1764 get_method_variadicity(ir_method_type));
1766 for (int i = 0; i < n_res; ++i) {
1767 set_method_res_type(new_method_type, i,
1768 get_method_res_type(ir_method_type, i));
1770 argument = call->arguments;
1771 for (int i = 0; i < n_parameters; ++i, argument = argument->next) {
1772 expression_t *expression = argument->expression;
1773 ir_type *irtype = get_ir_type(expression->base.type);
1774 set_method_param_type(new_method_type, i, irtype);
1776 ir_method_type = new_method_type;
1778 n_parameters = get_method_n_params(ir_method_type);
1781 ir_node *in[n_parameters];
1783 const call_argument_t *argument = call->arguments;
1784 for (int n = 0; n < n_parameters; ++n) {
1785 expression_t *expression = argument->expression;
1786 ir_node *arg_node = expression_to_firm(expression);
1788 type_t *arg_type = skip_typeref(expression->base.type);
1789 if (!is_type_compound(arg_type)) {
1790 ir_mode *const mode = get_ir_mode_storage(arg_type);
1791 arg_node = create_conv(dbgi, arg_node, mode);
1792 arg_node = do_strict_conv(dbgi, arg_node);
1797 argument = argument->next;
1801 if (function_type->modifiers & DM_CONST) {
1802 store = get_irg_no_mem(current_ir_graph);
1804 store = get_store();
1808 type_t *return_type = skip_typeref(function_type->return_type);
1809 ir_node *result = NULL;
1811 node = new_d_Builtin(dbgi, store, n_parameters, in, firm_builtin_kind,
1813 if (! (function_type->modifiers & DM_CONST)) {
1814 ir_node *mem = new_Proj(node, mode_M, pn_Builtin_M);
1818 if (!is_type_void(return_type)) {
1819 assert(is_type_scalar(return_type));
1820 ir_mode *mode = get_ir_mode_storage(return_type);
1821 result = new_Proj(node, mode, pn_Builtin_max+1);
1822 ir_mode *mode_arith = get_ir_mode_arithmetic(return_type);
1823 result = create_conv(NULL, result, mode_arith);
1826 node = new_d_Call(dbgi, store, callee, n_parameters, in, ir_method_type);
1827 if (! (function_type->modifiers & DM_CONST)) {
1828 ir_node *mem = new_Proj(node, mode_M, pn_Call_M);
1832 if (!is_type_void(return_type)) {
1833 ir_node *const resproj = new_Proj(node, mode_T, pn_Call_T_result);
1834 ir_mode *const mode = get_ir_mode_storage(return_type);
1835 result = new_Proj(resproj, mode, 0);
1836 ir_mode *const mode_arith = get_ir_mode_arithmetic(return_type);
1837 result = create_conv(NULL, result, mode_arith);
1841 if (function_type->modifiers & DM_NORETURN) {
1842 /* A dead end: Keep the Call and the Block. Also place all further
1843 * nodes into a new and unreachable block. */
1845 keep_alive(get_cur_block());
1846 ir_node *block = new_Block(0, NULL);
1847 set_cur_block(block);
1853 static ir_node *statement_to_firm(statement_t *statement);
1854 static ir_node *compound_statement_to_firm(compound_statement_t *compound);
1856 static ir_node *expression_to_addr(const expression_t *expression);
1857 static ir_node *create_condition_evaluation(const expression_t *expression,
1858 ir_node *true_block,
1859 ir_node *false_block);
1861 static void assign_value(dbg_info *dbgi, ir_node *addr, type_t *type,
1864 if (!is_type_compound(type)) {
1865 ir_mode *mode = get_ir_mode_storage(type);
1866 value = create_conv(dbgi, value, mode);
1867 value = do_strict_conv(dbgi, value);
1870 ir_node *memory = get_store();
1872 if (is_type_scalar(type)) {
1873 ir_cons_flags flags = type->base.qualifiers & TYPE_QUALIFIER_VOLATILE
1874 ? cons_volatile : cons_none;
1875 ir_node *store = new_d_Store(dbgi, memory, addr, value, flags);
1876 ir_node *store_mem = new_d_Proj(dbgi, store, mode_M, pn_Store_M);
1877 set_store(store_mem);
1879 ir_type *irtype = get_ir_type(type);
1880 ir_node *copyb = new_d_CopyB(dbgi, memory, addr, value, irtype);
1881 ir_node *copyb_mem = new_Proj(copyb, mode_M, pn_CopyB_M);
1882 set_store(copyb_mem);
1886 static ir_tarval *create_bitfield_mask(ir_mode *mode, int offset, int size)
1888 ir_tarval *all_one = get_mode_all_one(mode);
1889 int mode_size = get_mode_size_bits(mode);
1890 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
1892 assert(offset >= 0);
1894 assert(offset + size <= mode_size);
1895 if (size == mode_size) {
1899 long shiftr = get_mode_size_bits(mode) - size;
1900 long shiftl = offset;
1901 ir_tarval *tv_shiftr = new_tarval_from_long(shiftr, mode_uint);
1902 ir_tarval *tv_shiftl = new_tarval_from_long(shiftl, mode_uint);
1903 ir_tarval *mask0 = tarval_shr(all_one, tv_shiftr);
1904 ir_tarval *mask1 = tarval_shl(mask0, tv_shiftl);
1909 static ir_node *bitfield_store_to_firm(dbg_info *dbgi,
1910 ir_entity *entity, ir_node *addr, ir_node *value, bool set_volatile,
1913 ir_type *entity_type = get_entity_type(entity);
1914 ir_type *base_type = get_primitive_base_type(entity_type);
1915 ir_mode *mode = get_type_mode(base_type);
1916 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
1918 value = create_conv(dbgi, value, mode);
1920 /* kill upper bits of value and shift to right position */
1921 unsigned bitoffset = get_entity_offset_bits_remainder(entity);
1922 unsigned bitsize = get_mode_size_bits(get_type_mode(entity_type));
1923 unsigned base_bits = get_mode_size_bits(mode);
1924 unsigned shiftwidth = base_bits - bitsize;
1926 ir_node *shiftcount = new_Const_long(mode_uint, shiftwidth);
1927 ir_node *shiftl = new_d_Shl(dbgi, value, shiftcount, mode);
1929 unsigned shrwidth = base_bits - bitsize - bitoffset;
1930 ir_node *shrconst = new_Const_long(mode_uint, shrwidth);
1931 ir_node *shiftr = new_d_Shr(dbgi, shiftl, shrconst, mode);
1933 /* load current value */
1934 ir_node *mem = get_store();
1935 ir_node *load = new_d_Load(dbgi, mem, addr, mode,
1936 set_volatile ? cons_volatile : cons_none);
1937 ir_node *load_mem = new_d_Proj(dbgi, load, mode_M, pn_Load_M);
1938 ir_node *load_res = new_d_Proj(dbgi, load, mode, pn_Load_res);
1939 ir_tarval *shift_mask = create_bitfield_mask(mode, bitoffset, bitsize);
1940 ir_tarval *inv_mask = tarval_not(shift_mask);
1941 ir_node *inv_mask_node = new_d_Const(dbgi, inv_mask);
1942 ir_node *load_res_masked = new_d_And(dbgi, load_res, inv_mask_node, mode);
1944 /* construct new value and store */
1945 ir_node *new_val = new_d_Or(dbgi, load_res_masked, shiftr, mode);
1946 ir_node *store = new_d_Store(dbgi, load_mem, addr, new_val,
1947 set_volatile ? cons_volatile : cons_none);
1948 ir_node *store_mem = new_d_Proj(dbgi, store, mode_M, pn_Store_M);
1949 set_store(store_mem);
1955 ir_node *count_res_shr = new_Const_long(mode_uint, base_bits - bitsize);
1956 if (mode_is_signed(mode)) {
1957 res_shr = new_d_Shrs(dbgi, shiftl, count_res_shr, mode);
1959 res_shr = new_d_Shr(dbgi, shiftl, count_res_shr, mode);
1964 static ir_node *bitfield_extract_to_firm(const select_expression_t *expression,
1967 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
1968 entity_t *entity = expression->compound_entry;
1969 type_t *base_type = entity->declaration.type;
1970 ir_mode *mode = get_ir_mode_storage(base_type);
1971 ir_node *mem = get_store();
1972 ir_node *load = new_d_Load(dbgi, mem, addr, mode, cons_none);
1973 ir_node *load_mem = new_d_Proj(dbgi, load, mode_M, pn_Load_M);
1974 ir_node *load_res = new_d_Proj(dbgi, load, mode, pn_Load_res);
1975 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
1977 ir_mode *amode = mode;
1978 /* optimisation, since shifting in modes < machine_size is usually
1980 if (get_mode_size_bits(amode) < get_mode_size_bits(mode_uint)) {
1983 unsigned amode_size = get_mode_size_bits(amode);
1984 load_res = create_conv(dbgi, load_res, amode);
1986 set_store(load_mem);
1988 /* kill upper bits */
1989 assert(expression->compound_entry->kind == ENTITY_COMPOUND_MEMBER);
1990 unsigned bitoffset = entity->compound_member.bit_offset;
1991 unsigned bitsize = entity->compound_member.bit_size;
1992 unsigned shift_bitsl = amode_size - bitoffset - bitsize;
1993 ir_tarval *tvl = new_tarval_from_long((long)shift_bitsl, mode_uint);
1994 ir_node *countl = new_d_Const(dbgi, tvl);
1995 ir_node *shiftl = new_d_Shl(dbgi, load_res, countl, amode);
1997 unsigned shift_bitsr = bitoffset + shift_bitsl;
1998 assert(shift_bitsr <= amode_size);
1999 ir_tarval *tvr = new_tarval_from_long((long)shift_bitsr, mode_uint);
2000 ir_node *countr = new_d_Const(dbgi, tvr);
2002 if (mode_is_signed(mode)) {
2003 shiftr = new_d_Shrs(dbgi, shiftl, countr, amode);
2005 shiftr = new_d_Shr(dbgi, shiftl, countr, amode);
2008 type_t *type = expression->base.type;
2009 ir_mode *resmode = get_ir_mode_arithmetic(type);
2010 return create_conv(dbgi, shiftr, resmode);
2013 /* make sure the selected compound type is constructed */
2014 static void construct_select_compound(const select_expression_t *expression)
2016 type_t *type = skip_typeref(expression->compound->base.type);
2017 if (is_type_pointer(type)) {
2018 type = type->pointer.points_to;
2020 (void) get_ir_type(type);
2023 static ir_node *set_value_for_expression_addr(const expression_t *expression,
2024 ir_node *value, ir_node *addr)
2026 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2027 type_t *type = skip_typeref(expression->base.type);
2029 if (!is_type_compound(type)) {
2030 ir_mode *mode = get_ir_mode_storage(type);
2031 value = create_conv(dbgi, value, mode);
2032 value = do_strict_conv(dbgi, value);
2035 if (expression->kind == EXPR_REFERENCE) {
2036 const reference_expression_t *ref = &expression->reference;
2038 entity_t *entity = ref->entity;
2039 assert(is_declaration(entity));
2040 assert(entity->declaration.kind != DECLARATION_KIND_UNKNOWN);
2041 if (entity->declaration.kind == DECLARATION_KIND_LOCAL_VARIABLE ||
2042 entity->declaration.kind == DECLARATION_KIND_PARAMETER) {
2043 set_value(entity->variable.v.value_number, value);
2049 addr = expression_to_addr(expression);
2050 assert(addr != NULL);
2052 if (expression->kind == EXPR_SELECT) {
2053 const select_expression_t *select = &expression->select;
2055 construct_select_compound(select);
2057 entity_t *entity = select->compound_entry;
2058 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
2059 if (entity->compound_member.bitfield) {
2060 ir_entity *irentity = entity->compound_member.entity;
2062 = select->base.type->base.qualifiers & TYPE_QUALIFIER_VOLATILE;
2063 value = bitfield_store_to_firm(dbgi, irentity, addr, value,
2064 set_volatile, true);
2069 assign_value(dbgi, addr, type, value);
2073 static void set_value_for_expression(const expression_t *expression,
2076 set_value_for_expression_addr(expression, value, NULL);
2079 static ir_node *get_value_from_lvalue(const expression_t *expression,
2082 if (expression->kind == EXPR_REFERENCE) {
2083 const reference_expression_t *ref = &expression->reference;
2085 entity_t *entity = ref->entity;
2086 assert(entity->kind == ENTITY_VARIABLE
2087 || entity->kind == ENTITY_PARAMETER);
2088 assert(entity->declaration.kind != DECLARATION_KIND_UNKNOWN);
2090 if (entity->declaration.kind == DECLARATION_KIND_LOCAL_VARIABLE ||
2091 entity->declaration.kind == DECLARATION_KIND_PARAMETER) {
2092 value_number = entity->variable.v.value_number;
2093 assert(addr == NULL);
2094 type_t *type = skip_typeref(expression->base.type);
2095 ir_mode *mode = get_ir_mode_storage(type);
2096 ir_node *res = get_value(value_number, mode);
2097 return create_conv(NULL, res, get_ir_mode_arithmetic(type));
2101 assert(addr != NULL);
2102 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2105 if (expression->kind == EXPR_SELECT &&
2106 expression->select.compound_entry->compound_member.bitfield) {
2107 construct_select_compound(&expression->select);
2108 value = bitfield_extract_to_firm(&expression->select, addr);
2110 value = deref_address(dbgi, expression->base.type, addr);
2117 static ir_node *create_incdec(const unary_expression_t *expression)
2119 dbg_info *const dbgi = get_dbg_info(&expression->base.source_position);
2120 const expression_t *value_expr = expression->value;
2121 ir_node *addr = expression_to_addr(value_expr);
2122 ir_node *value = get_value_from_lvalue(value_expr, addr);
2124 type_t *type = skip_typeref(expression->base.type);
2125 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
2128 if (is_type_pointer(type)) {
2129 pointer_type_t *pointer_type = &type->pointer;
2130 offset = get_type_size_node(pointer_type->points_to);
2132 assert(is_type_arithmetic(type));
2133 offset = new_Const(get_mode_one(mode));
2137 ir_node *store_value;
2138 switch(expression->base.kind) {
2139 case EXPR_UNARY_POSTFIX_INCREMENT:
2141 store_value = new_d_Add(dbgi, value, offset, mode);
2143 case EXPR_UNARY_POSTFIX_DECREMENT:
2145 store_value = new_d_Sub(dbgi, value, offset, mode);
2147 case EXPR_UNARY_PREFIX_INCREMENT:
2148 result = new_d_Add(dbgi, value, offset, mode);
2149 store_value = result;
2151 case EXPR_UNARY_PREFIX_DECREMENT:
2152 result = new_d_Sub(dbgi, value, offset, mode);
2153 store_value = result;
2156 panic("no incdec expr in create_incdec");
2159 set_value_for_expression_addr(value_expr, store_value, addr);
2164 static bool is_local_variable(expression_t *expression)
2166 if (expression->kind != EXPR_REFERENCE)
2168 reference_expression_t *ref_expr = &expression->reference;
2169 entity_t *entity = ref_expr->entity;
2170 if (entity->kind != ENTITY_VARIABLE)
2172 assert(entity->declaration.kind != DECLARATION_KIND_UNKNOWN);
2173 return entity->declaration.kind == DECLARATION_KIND_LOCAL_VARIABLE;
2176 static ir_relation get_relation(const expression_kind_t kind)
2179 case EXPR_BINARY_EQUAL: return ir_relation_equal;
2180 case EXPR_BINARY_ISLESSGREATER: return ir_relation_less_greater;
2181 case EXPR_BINARY_NOTEQUAL: return ir_relation_unordered_less_greater;
2182 case EXPR_BINARY_ISLESS:
2183 case EXPR_BINARY_LESS: return ir_relation_less;
2184 case EXPR_BINARY_ISLESSEQUAL:
2185 case EXPR_BINARY_LESSEQUAL: return ir_relation_less_equal;
2186 case EXPR_BINARY_ISGREATER:
2187 case EXPR_BINARY_GREATER: return ir_relation_greater;
2188 case EXPR_BINARY_ISGREATEREQUAL:
2189 case EXPR_BINARY_GREATEREQUAL: return ir_relation_greater_equal;
2190 case EXPR_BINARY_ISUNORDERED: return ir_relation_unordered;
2195 panic("trying to get pn_Cmp from non-comparison binexpr type");
2199 * Handle the assume optimizer hint: check if a Confirm
2200 * node can be created.
2202 * @param dbi debug info
2203 * @param expr the IL assume expression
2205 * we support here only some simple cases:
2210 static ir_node *handle_assume_compare(dbg_info *dbi,
2211 const binary_expression_t *expression)
2213 expression_t *op1 = expression->left;
2214 expression_t *op2 = expression->right;
2215 entity_t *var2, *var = NULL;
2216 ir_node *res = NULL;
2217 ir_relation relation = get_relation(expression->base.kind);
2219 if (is_local_variable(op1) && is_local_variable(op2)) {
2220 var = op1->reference.entity;
2221 var2 = op2->reference.entity;
2223 type_t *const type = skip_typeref(var->declaration.type);
2224 ir_mode *const mode = get_ir_mode_storage(type);
2226 ir_node *const irn1 = get_value(var->variable.v.value_number, mode);
2227 ir_node *const irn2 = get_value(var2->variable.v.value_number, mode);
2229 res = new_d_Confirm(dbi, irn2, irn1, get_inversed_relation(relation));
2230 set_value(var2->variable.v.value_number, res);
2232 res = new_d_Confirm(dbi, irn1, irn2, relation);
2233 set_value(var->variable.v.value_number, res);
2238 expression_t *con = NULL;
2239 if (is_local_variable(op1) && is_constant_expression(op2) == EXPR_CLASS_CONSTANT) {
2240 var = op1->reference.entity;
2242 } else if (is_constant_expression(op1) == EXPR_CLASS_CONSTANT && is_local_variable(op2)) {
2243 relation = get_inversed_relation(relation);
2244 var = op2->reference.entity;
2249 type_t *const type = skip_typeref(var->declaration.type);
2250 ir_mode *const mode = get_ir_mode_storage(type);
2252 res = get_value(var->variable.v.value_number, mode);
2253 res = new_d_Confirm(dbi, res, expression_to_firm(con), relation);
2254 set_value(var->variable.v.value_number, res);
2260 * Handle the assume optimizer hint.
2262 * @param dbi debug info
2263 * @param expr the IL assume expression
2265 static ir_node *handle_assume(dbg_info *dbi, const expression_t *expression)
2267 switch(expression->kind) {
2268 case EXPR_BINARY_EQUAL:
2269 case EXPR_BINARY_NOTEQUAL:
2270 case EXPR_BINARY_LESS:
2271 case EXPR_BINARY_LESSEQUAL:
2272 case EXPR_BINARY_GREATER:
2273 case EXPR_BINARY_GREATEREQUAL:
2274 return handle_assume_compare(dbi, &expression->binary);
2280 static ir_node *create_cast(dbg_info *dbgi, ir_node *value_node,
2281 type_t *from_type, type_t *type)
2283 type = skip_typeref(type);
2284 if (is_type_void(type)) {
2285 /* make sure firm type is constructed */
2286 (void) get_ir_type(type);
2289 if (!is_type_scalar(type)) {
2290 /* make sure firm type is constructed */
2291 (void) get_ir_type(type);
2295 from_type = skip_typeref(from_type);
2296 ir_mode *mode = get_ir_mode_storage(type);
2297 /* check for conversion from / to __based types */
2298 if (is_type_pointer(type) && is_type_pointer(from_type)) {
2299 const variable_t *from_var = from_type->pointer.base_variable;
2300 const variable_t *to_var = type->pointer.base_variable;
2301 if (from_var != to_var) {
2302 if (from_var != NULL) {
2303 ir_node *const addr = create_symconst(dbgi, from_var->v.entity);
2304 ir_node *const base = deref_address(dbgi, from_var->base.type, addr);
2305 value_node = new_d_Add(dbgi, value_node, base, mode);
2307 if (to_var != NULL) {
2308 ir_node *const addr = create_symconst(dbgi, to_var->v.entity);
2309 ir_node *const base = deref_address(dbgi, to_var->base.type, addr);
2310 value_node = new_d_Sub(dbgi, value_node, base, mode);
2315 if (is_type_atomic(type, ATOMIC_TYPE_BOOL)) {
2316 /* bool adjustments (we save a mode_Bu, but have to temporarily
2317 * convert to mode_b so we only get a 0/1 value */
2318 value_node = create_conv(dbgi, value_node, mode_b);
2321 ir_mode *mode_arith = get_ir_mode_arithmetic(type);
2322 ir_node *node = create_conv(dbgi, value_node, mode);
2323 node = do_strict_conv(dbgi, node);
2324 node = create_conv(dbgi, node, mode_arith);
2329 static ir_node *unary_expression_to_firm(const unary_expression_t *expression)
2331 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2332 type_t *type = skip_typeref(expression->base.type);
2334 const expression_t *value = expression->value;
2336 switch(expression->base.kind) {
2337 case EXPR_UNARY_TAKE_ADDRESS:
2338 return expression_to_addr(value);
2340 case EXPR_UNARY_NEGATE: {
2341 ir_node *value_node = expression_to_firm(value);
2342 ir_mode *mode = get_ir_mode_arithmetic(type);
2343 return new_d_Minus(dbgi, value_node, mode);
2345 case EXPR_UNARY_PLUS:
2346 return expression_to_firm(value);
2347 case EXPR_UNARY_BITWISE_NEGATE: {
2348 ir_node *value_node = expression_to_firm(value);
2349 ir_mode *mode = get_ir_mode_arithmetic(type);
2350 return new_d_Not(dbgi, value_node, mode);
2352 case EXPR_UNARY_NOT: {
2353 ir_node *value_node = _expression_to_firm(value);
2354 value_node = create_conv(dbgi, value_node, mode_b);
2355 ir_node *res = new_d_Not(dbgi, value_node, mode_b);
2358 case EXPR_UNARY_DEREFERENCE: {
2359 ir_node *value_node = expression_to_firm(value);
2360 type_t *value_type = skip_typeref(value->base.type);
2361 assert(is_type_pointer(value_type));
2363 /* check for __based */
2364 const variable_t *const base_var = value_type->pointer.base_variable;
2365 if (base_var != NULL) {
2366 ir_node *const addr = create_symconst(dbgi, base_var->v.entity);
2367 ir_node *const base = deref_address(dbgi, base_var->base.type, addr);
2368 value_node = new_d_Add(dbgi, value_node, base, get_ir_mode_storage(value_type));
2370 type_t *points_to = value_type->pointer.points_to;
2371 return deref_address(dbgi, points_to, value_node);
2373 case EXPR_UNARY_POSTFIX_INCREMENT:
2374 case EXPR_UNARY_POSTFIX_DECREMENT:
2375 case EXPR_UNARY_PREFIX_INCREMENT:
2376 case EXPR_UNARY_PREFIX_DECREMENT:
2377 return create_incdec(expression);
2378 case EXPR_UNARY_CAST: {
2379 ir_node *value_node = expression_to_firm(value);
2380 type_t *from_type = value->base.type;
2381 return create_cast(dbgi, value_node, from_type, type);
2383 case EXPR_UNARY_ASSUME:
2384 return handle_assume(dbgi, value);
2389 panic("invalid UNEXPR type found");
2393 * produces a 0/1 depending of the value of a mode_b node
2395 static ir_node *produce_condition_result(const expression_t *expression,
2396 ir_mode *mode, dbg_info *dbgi)
2398 ir_node *const one_block = new_immBlock();
2399 ir_node *const zero_block = new_immBlock();
2400 create_condition_evaluation(expression, one_block, zero_block);
2401 mature_immBlock(one_block);
2402 mature_immBlock(zero_block);
2404 ir_node *const jmp_one = new_rd_Jmp(dbgi, one_block);
2405 ir_node *const jmp_zero = new_rd_Jmp(dbgi, zero_block);
2406 ir_node *const in_cf[2] = { jmp_one, jmp_zero };
2407 ir_node *const block = new_Block(lengthof(in_cf), in_cf);
2408 set_cur_block(block);
2410 ir_node *const one = new_Const(get_mode_one(mode));
2411 ir_node *const zero = new_Const(get_mode_null(mode));
2412 ir_node *const in[2] = { one, zero };
2413 ir_node *const val = new_d_Phi(dbgi, lengthof(in), in, mode);
2418 static ir_node *adjust_for_pointer_arithmetic(dbg_info *dbgi,
2419 ir_node *value, type_t *type)
2421 ir_mode *const mode = get_ir_mode_arithmetic(type_ptrdiff_t);
2422 assert(is_type_pointer(type));
2423 pointer_type_t *const pointer_type = &type->pointer;
2424 type_t *const points_to = skip_typeref(pointer_type->points_to);
2425 ir_node * elem_size = get_type_size_node(points_to);
2426 elem_size = create_conv(dbgi, elem_size, mode);
2427 value = create_conv(dbgi, value, mode);
2428 ir_node *const mul = new_d_Mul(dbgi, value, elem_size, mode);
2432 static ir_node *create_op(dbg_info *dbgi, const binary_expression_t *expression,
2433 ir_node *left, ir_node *right)
2436 type_t *type_left = skip_typeref(expression->left->base.type);
2437 type_t *type_right = skip_typeref(expression->right->base.type);
2439 expression_kind_t kind = expression->base.kind;
2442 case EXPR_BINARY_SHIFTLEFT:
2443 case EXPR_BINARY_SHIFTRIGHT:
2444 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2445 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2446 mode = get_ir_mode_arithmetic(expression->base.type);
2447 right = create_conv(dbgi, right, atomic_modes[ATOMIC_TYPE_UINT]);
2450 case EXPR_BINARY_SUB:
2451 if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
2452 const pointer_type_t *const ptr_type = &type_left->pointer;
2454 mode = get_ir_mode_arithmetic(expression->base.type);
2455 ir_node *const elem_size = get_type_size_node(ptr_type->points_to);
2456 ir_node *const conv_size = new_d_Conv(dbgi, elem_size, mode);
2457 ir_node *const sub = new_d_Sub(dbgi, left, right, mode);
2458 ir_node *const no_mem = new_NoMem();
2459 ir_node *const div = new_d_DivRL(dbgi, no_mem, sub, conv_size,
2460 mode, op_pin_state_floats);
2461 return new_d_Proj(dbgi, div, mode, pn_Div_res);
2464 case EXPR_BINARY_SUB_ASSIGN:
2465 if (is_type_pointer(type_left)) {
2466 right = adjust_for_pointer_arithmetic(dbgi, right, type_left);
2467 mode = get_ir_mode_arithmetic(type_left);
2472 case EXPR_BINARY_ADD:
2473 case EXPR_BINARY_ADD_ASSIGN:
2474 if (is_type_pointer(type_left)) {
2475 right = adjust_for_pointer_arithmetic(dbgi, right, type_left);
2476 mode = get_ir_mode_arithmetic(type_left);
2478 } else if (is_type_pointer(type_right)) {
2479 left = adjust_for_pointer_arithmetic(dbgi, left, type_right);
2480 mode = get_ir_mode_arithmetic(type_right);
2487 mode = get_ir_mode_arithmetic(type_right);
2488 left = create_conv(dbgi, left, mode);
2493 case EXPR_BINARY_ADD_ASSIGN:
2494 case EXPR_BINARY_ADD:
2495 return new_d_Add(dbgi, left, right, mode);
2496 case EXPR_BINARY_SUB_ASSIGN:
2497 case EXPR_BINARY_SUB:
2498 return new_d_Sub(dbgi, left, right, mode);
2499 case EXPR_BINARY_MUL_ASSIGN:
2500 case EXPR_BINARY_MUL:
2501 return new_d_Mul(dbgi, left, right, mode);
2502 case EXPR_BINARY_BITWISE_AND:
2503 case EXPR_BINARY_BITWISE_AND_ASSIGN:
2504 return new_d_And(dbgi, left, right, mode);
2505 case EXPR_BINARY_BITWISE_OR:
2506 case EXPR_BINARY_BITWISE_OR_ASSIGN:
2507 return new_d_Or(dbgi, left, right, mode);
2508 case EXPR_BINARY_BITWISE_XOR:
2509 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
2510 return new_d_Eor(dbgi, left, right, mode);
2511 case EXPR_BINARY_SHIFTLEFT:
2512 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2513 return new_d_Shl(dbgi, left, right, mode);
2514 case EXPR_BINARY_SHIFTRIGHT:
2515 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2516 if (mode_is_signed(mode)) {
2517 return new_d_Shrs(dbgi, left, right, mode);
2519 return new_d_Shr(dbgi, left, right, mode);
2521 case EXPR_BINARY_DIV:
2522 case EXPR_BINARY_DIV_ASSIGN: {
2523 ir_node *pin = new_Pin(new_NoMem());
2524 ir_node *op = new_d_Div(dbgi, pin, left, right, mode,
2525 op_pin_state_floats);
2526 ir_node *res = new_d_Proj(dbgi, op, mode, pn_Div_res);
2529 case EXPR_BINARY_MOD:
2530 case EXPR_BINARY_MOD_ASSIGN: {
2531 ir_node *pin = new_Pin(new_NoMem());
2532 assert(!mode_is_float(mode));
2533 ir_node *op = new_d_Mod(dbgi, pin, left, right, mode,
2534 op_pin_state_floats);
2535 ir_node *res = new_d_Proj(dbgi, op, mode, pn_Mod_res);
2539 panic("unexpected expression kind");
2543 static ir_node *create_lazy_op(const binary_expression_t *expression)
2545 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2546 type_t *type = skip_typeref(expression->base.type);
2547 ir_mode *mode = get_ir_mode_arithmetic(type);
2549 if (is_constant_expression(expression->left) == EXPR_CLASS_CONSTANT) {
2550 bool val = fold_constant_to_bool(expression->left);
2551 expression_kind_t ekind = expression->base.kind;
2552 assert(ekind == EXPR_BINARY_LOGICAL_AND || ekind == EXPR_BINARY_LOGICAL_OR);
2553 if (ekind == EXPR_BINARY_LOGICAL_AND) {
2555 return new_Const(get_mode_null(mode));
2559 return new_Const(get_mode_one(mode));
2563 if (is_constant_expression(expression->right) == EXPR_CLASS_CONSTANT) {
2564 bool valr = fold_constant_to_bool(expression->right);
2565 return create_Const_from_bool(mode, valr);
2568 return produce_condition_result(expression->right, mode, dbgi);
2571 return produce_condition_result((const expression_t*) expression, mode,
2575 typedef ir_node * (*create_arithmetic_func)(dbg_info *dbgi, ir_node *left,
2576 ir_node *right, ir_mode *mode);
2578 static ir_node *create_assign_binop(const binary_expression_t *expression)
2580 dbg_info *const dbgi = get_dbg_info(&expression->base.source_position);
2581 const expression_t *left_expr = expression->left;
2582 type_t *type = skip_typeref(left_expr->base.type);
2583 ir_node *right = expression_to_firm(expression->right);
2584 ir_node *left_addr = expression_to_addr(left_expr);
2585 ir_node *left = get_value_from_lvalue(left_expr, left_addr);
2586 ir_node *result = create_op(dbgi, expression, left, right);
2588 result = create_cast(dbgi, result, expression->right->base.type, type);
2589 result = do_strict_conv(dbgi, result);
2591 result = set_value_for_expression_addr(left_expr, result, left_addr);
2593 if (!is_type_compound(type)) {
2594 ir_mode *mode_arithmetic = get_ir_mode_arithmetic(type);
2595 result = create_conv(dbgi, result, mode_arithmetic);
2600 static ir_node *binary_expression_to_firm(const binary_expression_t *expression)
2602 expression_kind_t kind = expression->base.kind;
2605 case EXPR_BINARY_EQUAL:
2606 case EXPR_BINARY_NOTEQUAL:
2607 case EXPR_BINARY_LESS:
2608 case EXPR_BINARY_LESSEQUAL:
2609 case EXPR_BINARY_GREATER:
2610 case EXPR_BINARY_GREATEREQUAL:
2611 case EXPR_BINARY_ISGREATER:
2612 case EXPR_BINARY_ISGREATEREQUAL:
2613 case EXPR_BINARY_ISLESS:
2614 case EXPR_BINARY_ISLESSEQUAL:
2615 case EXPR_BINARY_ISLESSGREATER:
2616 case EXPR_BINARY_ISUNORDERED: {
2617 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2618 ir_node *left = expression_to_firm(expression->left);
2619 ir_node *right = expression_to_firm(expression->right);
2620 ir_relation relation = get_relation(kind);
2621 ir_node *cmp = new_d_Cmp(dbgi, left, right, relation);
2624 case EXPR_BINARY_ASSIGN: {
2625 ir_node *addr = expression_to_addr(expression->left);
2626 ir_node *right = expression_to_firm(expression->right);
2628 = set_value_for_expression_addr(expression->left, right, addr);
2630 type_t *type = skip_typeref(expression->base.type);
2631 if (!is_type_compound(type)) {
2632 ir_mode *mode_arithmetic = get_ir_mode_arithmetic(type);
2633 res = create_conv(NULL, res, mode_arithmetic);
2637 case EXPR_BINARY_ADD:
2638 case EXPR_BINARY_SUB:
2639 case EXPR_BINARY_MUL:
2640 case EXPR_BINARY_DIV:
2641 case EXPR_BINARY_MOD:
2642 case EXPR_BINARY_BITWISE_AND:
2643 case EXPR_BINARY_BITWISE_OR:
2644 case EXPR_BINARY_BITWISE_XOR:
2645 case EXPR_BINARY_SHIFTLEFT:
2646 case EXPR_BINARY_SHIFTRIGHT:
2648 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2649 ir_node *left = expression_to_firm(expression->left);
2650 ir_node *right = expression_to_firm(expression->right);
2651 return create_op(dbgi, expression, left, right);
2653 case EXPR_BINARY_LOGICAL_AND:
2654 case EXPR_BINARY_LOGICAL_OR:
2655 return create_lazy_op(expression);
2656 case EXPR_BINARY_COMMA:
2657 /* create side effects of left side */
2658 (void) expression_to_firm(expression->left);
2659 return _expression_to_firm(expression->right);
2661 case EXPR_BINARY_ADD_ASSIGN:
2662 case EXPR_BINARY_SUB_ASSIGN:
2663 case EXPR_BINARY_MUL_ASSIGN:
2664 case EXPR_BINARY_MOD_ASSIGN:
2665 case EXPR_BINARY_DIV_ASSIGN:
2666 case EXPR_BINARY_BITWISE_AND_ASSIGN:
2667 case EXPR_BINARY_BITWISE_OR_ASSIGN:
2668 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
2669 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2670 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2671 return create_assign_binop(expression);
2673 panic("TODO binexpr type");
2677 static ir_node *array_access_addr(const array_access_expression_t *expression)
2679 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2680 ir_node *base_addr = expression_to_firm(expression->array_ref);
2681 ir_node *offset = expression_to_firm(expression->index);
2682 type_t *ref_type = skip_typeref(expression->array_ref->base.type);
2683 ir_node *real_offset = adjust_for_pointer_arithmetic(dbgi, offset, ref_type);
2684 ir_node *result = new_d_Add(dbgi, base_addr, real_offset, mode_P_data);
2689 static ir_node *array_access_to_firm(
2690 const array_access_expression_t *expression)
2692 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2693 ir_node *addr = array_access_addr(expression);
2694 type_t *type = revert_automatic_type_conversion(
2695 (const expression_t*) expression);
2696 type = skip_typeref(type);
2698 return deref_address(dbgi, type, addr);
2701 static long get_offsetof_offset(const offsetof_expression_t *expression)
2703 type_t *orig_type = expression->type;
2706 designator_t *designator = expression->designator;
2707 for ( ; designator != NULL; designator = designator->next) {
2708 type_t *type = skip_typeref(orig_type);
2709 /* be sure the type is constructed */
2710 (void) get_ir_type(type);
2712 if (designator->symbol != NULL) {
2713 assert(is_type_compound(type));
2714 symbol_t *symbol = designator->symbol;
2716 compound_t *compound = type->compound.compound;
2717 entity_t *iter = compound->members.entities;
2718 for ( ; iter != NULL; iter = iter->base.next) {
2719 if (iter->base.symbol == symbol) {
2723 assert(iter != NULL);
2725 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
2726 assert(iter->declaration.kind == DECLARATION_KIND_COMPOUND_MEMBER);
2727 offset += get_entity_offset(iter->compound_member.entity);
2729 orig_type = iter->declaration.type;
2731 expression_t *array_index = designator->array_index;
2732 assert(designator->array_index != NULL);
2733 assert(is_type_array(type));
2735 long index = fold_constant_to_int(array_index);
2736 ir_type *arr_type = get_ir_type(type);
2737 ir_type *elem_type = get_array_element_type(arr_type);
2738 long elem_size = get_type_size_bytes(elem_type);
2740 offset += index * elem_size;
2742 orig_type = type->array.element_type;
2749 static ir_node *offsetof_to_firm(const offsetof_expression_t *expression)
2751 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
2752 long offset = get_offsetof_offset(expression);
2753 ir_tarval *tv = new_tarval_from_long(offset, mode);
2754 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2756 return new_d_Const(dbgi, tv);
2759 static void create_local_initializer(initializer_t *initializer, dbg_info *dbgi,
2760 ir_entity *entity, type_t *type);
2761 static ir_initializer_t *create_ir_initializer(
2762 const initializer_t *initializer, type_t *type);
2764 static ir_entity *create_initializer_entity(dbg_info *dbgi,
2765 initializer_t *initializer,
2768 /* create the ir_initializer */
2769 ir_graph *const old_current_ir_graph = current_ir_graph;
2770 current_ir_graph = get_const_code_irg();
2772 ir_initializer_t *irinitializer = create_ir_initializer(initializer, type);
2774 assert(current_ir_graph == get_const_code_irg());
2775 current_ir_graph = old_current_ir_graph;
2777 ident *const id = id_unique("initializer.%u");
2778 ir_type *const irtype = get_ir_type(type);
2779 ir_type *const global_type = get_glob_type();
2780 ir_entity *const entity = new_d_entity(global_type, id, irtype, dbgi);
2781 set_entity_ld_ident(entity, id);
2782 set_entity_visibility(entity, ir_visibility_private);
2783 add_entity_linkage(entity, IR_LINKAGE_CONSTANT);
2784 set_entity_initializer(entity, irinitializer);
2788 static ir_node *compound_literal_addr(compound_literal_expression_t const *const expression)
2790 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2791 type_t *type = expression->type;
2792 initializer_t *initializer = expression->initializer;
2794 if (is_constant_initializer(initializer) == EXPR_CLASS_CONSTANT) {
2795 ir_entity *entity = create_initializer_entity(dbgi, initializer, type);
2796 return create_symconst(dbgi, entity);
2798 /* create an entity on the stack */
2799 ident *const id = id_unique("CompLit.%u");
2800 ir_type *const irtype = get_ir_type(type);
2801 ir_type *frame_type = get_irg_frame_type(current_ir_graph);
2803 ir_entity *const entity = new_d_entity(frame_type, id, irtype, dbgi);
2804 set_entity_ld_ident(entity, id);
2806 /* create initialisation code */
2807 create_local_initializer(initializer, dbgi, entity, type);
2809 /* create a sel for the compound literal address */
2810 ir_node *frame = get_irg_frame(current_ir_graph);
2811 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, entity);
2816 static ir_node *compound_literal_to_firm(compound_literal_expression_t const* const expr)
2818 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
2819 type_t *const type = expr->type;
2820 ir_node *const addr = compound_literal_addr(expr);
2821 return deref_address(dbgi, type, addr);
2825 * Transform a sizeof expression into Firm code.
2827 static ir_node *sizeof_to_firm(const typeprop_expression_t *expression)
2829 type_t *const type = skip_typeref(expression->type);
2830 /* ยง6.5.3.4:2 if the type is a VLA, evaluate the expression. */
2831 if (is_type_array(type) && type->array.is_vla
2832 && expression->tp_expression != NULL) {
2833 expression_to_firm(expression->tp_expression);
2836 return get_type_size_node(type);
2839 static entity_t *get_expression_entity(const expression_t *expression)
2841 if (expression->kind != EXPR_REFERENCE)
2844 return expression->reference.entity;
2847 static unsigned get_cparser_entity_alignment(const entity_t *entity)
2849 switch(entity->kind) {
2850 case DECLARATION_KIND_CASES:
2851 return entity->declaration.alignment;
2854 return entity->compound.alignment;
2855 case ENTITY_TYPEDEF:
2856 return entity->typedefe.alignment;
2864 * Transform an alignof expression into Firm code.
2866 static ir_node *alignof_to_firm(const typeprop_expression_t *expression)
2868 unsigned alignment = 0;
2870 const expression_t *tp_expression = expression->tp_expression;
2871 if (tp_expression != NULL) {
2872 entity_t *entity = get_expression_entity(tp_expression);
2873 if (entity != NULL) {
2874 alignment = get_cparser_entity_alignment(entity);
2878 if (alignment == 0) {
2879 type_t *type = expression->type;
2880 alignment = get_type_alignment(type);
2883 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2884 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
2885 ir_tarval *tv = new_tarval_from_long(alignment, mode);
2886 return new_d_Const(dbgi, tv);
2889 static void init_ir_types(void);
2891 static ir_tarval *fold_constant_to_tarval(const expression_t *expression)
2893 assert(is_constant_expression(expression) == EXPR_CLASS_CONSTANT);
2895 bool constant_folding_old = constant_folding;
2896 constant_folding = true;
2897 int old_optimize = get_optimize();
2898 int old_constant_folding = get_opt_constant_folding();
2900 set_opt_constant_folding(1);
2904 ir_graph *old_current_ir_graph = current_ir_graph;
2905 current_ir_graph = get_const_code_irg();
2907 ir_node *const cnst = _expression_to_firm(expression);
2909 current_ir_graph = old_current_ir_graph;
2910 set_optimize(old_optimize);
2911 set_opt_constant_folding(old_constant_folding);
2913 if (!is_Const(cnst)) {
2914 panic("couldn't fold constant");
2917 constant_folding = constant_folding_old;
2919 ir_tarval *const tv = get_Const_tarval(cnst);
2920 ir_mode *const mode = get_ir_mode_arithmetic(skip_typeref(expression->base.type));
2921 return tarval_convert_to(tv, mode);
2924 /* this function is only used in parser.c, but it relies on libfirm functionality */
2925 bool constant_is_negative(const expression_t *expression)
2927 ir_tarval *tv = fold_constant_to_tarval(expression);
2928 return tarval_is_negative(tv);
2931 long fold_constant_to_int(const expression_t *expression)
2933 ir_tarval *tv = fold_constant_to_tarval(expression);
2934 if (!tarval_is_long(tv)) {
2935 panic("result of constant folding is not integer");
2938 return get_tarval_long(tv);
2941 bool fold_constant_to_bool(const expression_t *expression)
2943 ir_tarval *tv = fold_constant_to_tarval(expression);
2944 return !tarval_is_null(tv);
2947 static ir_node *conditional_to_firm(const conditional_expression_t *expression)
2949 dbg_info *const dbgi = get_dbg_info(&expression->base.source_position);
2951 /* first try to fold a constant condition */
2952 if (is_constant_expression(expression->condition) == EXPR_CLASS_CONSTANT) {
2953 bool val = fold_constant_to_bool(expression->condition);
2955 expression_t *true_expression = expression->true_expression;
2956 if (true_expression == NULL)
2957 true_expression = expression->condition;
2958 return expression_to_firm(true_expression);
2960 return expression_to_firm(expression->false_expression);
2964 ir_node *const true_block = new_immBlock();
2965 ir_node *const false_block = new_immBlock();
2966 ir_node *const cond_expr = create_condition_evaluation(expression->condition, true_block, false_block);
2967 mature_immBlock(true_block);
2968 mature_immBlock(false_block);
2970 set_cur_block(true_block);
2972 if (expression->true_expression != NULL) {
2973 true_val = expression_to_firm(expression->true_expression);
2974 } else if (cond_expr != NULL && get_irn_mode(cond_expr) != mode_b) {
2975 true_val = cond_expr;
2977 /* Condition ended with a short circuit (&&, ||, !) operation or a
2978 * comparison. Generate a "1" as value for the true branch. */
2979 true_val = new_Const(get_mode_one(mode_Is));
2981 ir_node *const true_jmp = new_d_Jmp(dbgi);
2983 set_cur_block(false_block);
2984 ir_node *const false_val = expression_to_firm(expression->false_expression);
2985 ir_node *const false_jmp = new_d_Jmp(dbgi);
2987 /* create the common block */
2988 ir_node *const in_cf[2] = { true_jmp, false_jmp };
2989 ir_node *const block = new_Block(lengthof(in_cf), in_cf);
2990 set_cur_block(block);
2992 /* TODO improve static semantics, so either both or no values are NULL */
2993 if (true_val == NULL || false_val == NULL)
2996 ir_node *const in[2] = { true_val, false_val };
2997 type_t *const type = skip_typeref(expression->base.type);
2998 ir_mode *const mode = get_ir_mode_arithmetic(type);
2999 ir_node *const val = new_d_Phi(dbgi, lengthof(in), in, mode);
3005 * Returns an IR-node representing the address of a field.
3007 static ir_node *select_addr(const select_expression_t *expression)
3009 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3011 construct_select_compound(expression);
3013 ir_node *compound_addr = expression_to_firm(expression->compound);
3015 entity_t *entry = expression->compound_entry;
3016 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3017 assert(entry->declaration.kind == DECLARATION_KIND_COMPOUND_MEMBER);
3019 if (constant_folding) {
3020 ir_mode *mode = get_irn_mode(compound_addr);
3021 ir_mode *mode_uint = get_reference_mode_unsigned_eq(mode);
3022 ir_node *ofs = new_Const_long(mode_uint, entry->compound_member.offset);
3023 return new_d_Add(dbgi, compound_addr, ofs, mode);
3025 ir_entity *irentity = entry->compound_member.entity;
3026 assert(irentity != NULL);
3027 return new_d_simpleSel(dbgi, new_NoMem(), compound_addr, irentity);
3031 static ir_node *select_to_firm(const select_expression_t *expression)
3033 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3034 ir_node *addr = select_addr(expression);
3035 type_t *type = revert_automatic_type_conversion(
3036 (const expression_t*) expression);
3037 type = skip_typeref(type);
3039 entity_t *entry = expression->compound_entry;
3040 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3042 if (entry->compound_member.bitfield) {
3043 return bitfield_extract_to_firm(expression, addr);
3046 return deref_address(dbgi, type, addr);
3049 /* Values returned by __builtin_classify_type. */
3050 typedef enum gcc_type_class
3056 enumeral_type_class,
3059 reference_type_class,
3063 function_type_class,
3074 static ir_node *classify_type_to_firm(const classify_type_expression_t *const expr)
3076 type_t *type = expr->type_expression->base.type;
3078 /* FIXME gcc returns different values depending on whether compiling C or C++
3079 * e.g. int x[10] is pointer_type_class in C, but array_type_class in C++ */
3082 type = skip_typeref(type);
3083 switch (type->kind) {
3085 const atomic_type_t *const atomic_type = &type->atomic;
3086 switch (atomic_type->akind) {
3087 /* should not be reached */
3088 case ATOMIC_TYPE_INVALID:
3092 /* gcc cannot do that */
3093 case ATOMIC_TYPE_VOID:
3094 tc = void_type_class;
3097 case ATOMIC_TYPE_WCHAR_T: /* gcc handles this as integer */
3098 case ATOMIC_TYPE_CHAR: /* gcc handles this as integer */
3099 case ATOMIC_TYPE_SCHAR: /* gcc handles this as integer */
3100 case ATOMIC_TYPE_UCHAR: /* gcc handles this as integer */
3101 case ATOMIC_TYPE_SHORT:
3102 case ATOMIC_TYPE_USHORT:
3103 case ATOMIC_TYPE_INT:
3104 case ATOMIC_TYPE_UINT:
3105 case ATOMIC_TYPE_LONG:
3106 case ATOMIC_TYPE_ULONG:
3107 case ATOMIC_TYPE_LONGLONG:
3108 case ATOMIC_TYPE_ULONGLONG:
3109 case ATOMIC_TYPE_BOOL: /* gcc handles this as integer */
3110 tc = integer_type_class;
3113 case ATOMIC_TYPE_FLOAT:
3114 case ATOMIC_TYPE_DOUBLE:
3115 case ATOMIC_TYPE_LONG_DOUBLE:
3116 tc = real_type_class;
3119 panic("Unexpected atomic type in classify_type_to_firm().");
3122 case TYPE_COMPLEX: tc = complex_type_class; goto make_const;
3123 case TYPE_IMAGINARY: tc = complex_type_class; goto make_const;
3124 case TYPE_ARRAY: /* gcc handles this as pointer */
3125 case TYPE_FUNCTION: /* gcc handles this as pointer */
3126 case TYPE_POINTER: tc = pointer_type_class; goto make_const;
3127 case TYPE_COMPOUND_STRUCT: tc = record_type_class; goto make_const;
3128 case TYPE_COMPOUND_UNION: tc = union_type_class; goto make_const;
3130 /* gcc handles this as integer */
3131 case TYPE_ENUM: tc = integer_type_class; goto make_const;
3133 /* gcc classifies the referenced type */
3134 case TYPE_REFERENCE: type = type->reference.refers_to; continue;
3136 /* typedef/typeof should be skipped already */
3142 panic("unexpected TYPE classify_type_to_firm().");
3146 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
3147 ir_mode *const mode = atomic_modes[ATOMIC_TYPE_INT];
3148 ir_tarval *const tv = new_tarval_from_long(tc, mode);
3149 return new_d_Const(dbgi, tv);
3152 static ir_node *function_name_to_firm(
3153 const funcname_expression_t *const expr)
3155 switch(expr->kind) {
3156 case FUNCNAME_FUNCTION:
3157 case FUNCNAME_PRETTY_FUNCTION:
3158 case FUNCNAME_FUNCDNAME:
3159 if (current_function_name == NULL) {
3160 const source_position_t *const src_pos = &expr->base.source_position;
3161 const char *name = current_function_entity->base.symbol->string;
3162 const string_t string = { name, strlen(name) };
3163 current_function_name = string_to_firm(src_pos, "__func__.%u", STRING_ENCODING_CHAR, &string);
3165 return current_function_name;
3166 case FUNCNAME_FUNCSIG:
3167 if (current_funcsig == NULL) {
3168 const source_position_t *const src_pos = &expr->base.source_position;
3169 ir_entity *ent = get_irg_entity(current_ir_graph);
3170 const char *const name = get_entity_ld_name(ent);
3171 const string_t string = { name, strlen(name) };
3172 current_funcsig = string_to_firm(src_pos, "__FUNCSIG__.%u", STRING_ENCODING_CHAR, &string);
3174 return current_funcsig;
3176 panic("Unsupported function name");
3179 static ir_node *statement_expression_to_firm(const statement_expression_t *expr)
3181 statement_t *statement = expr->statement;
3183 assert(statement->kind == STATEMENT_COMPOUND);
3184 return compound_statement_to_firm(&statement->compound);
3187 static ir_node *va_start_expression_to_firm(
3188 const va_start_expression_t *const expr)
3190 ir_entity *param_ent = current_vararg_entity;
3191 if (param_ent == NULL) {
3192 size_t const n = IR_VA_START_PARAMETER_NUMBER;
3193 ir_type *const frame_type = get_irg_frame_type(current_ir_graph);
3194 ir_type *const param_type = get_unknown_type();
3195 param_ent = new_parameter_entity(frame_type, n, param_type);
3196 current_vararg_entity = param_ent;
3199 ir_node *const frame = get_irg_frame(current_ir_graph);
3200 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
3201 ir_node *const no_mem = new_NoMem();
3202 ir_node *const arg_sel = new_d_simpleSel(dbgi, no_mem, frame, param_ent);
3204 set_value_for_expression(expr->ap, arg_sel);
3209 static ir_node *va_arg_expression_to_firm(const va_arg_expression_t *const expr)
3211 type_t *const type = expr->base.type;
3212 expression_t *const ap_expr = expr->ap;
3213 ir_node *const ap_addr = expression_to_addr(ap_expr);
3214 ir_node *const ap = get_value_from_lvalue(ap_expr, ap_addr);
3215 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
3216 ir_node *const res = deref_address(dbgi, type, ap);
3218 ir_node *const cnst = get_type_size_node(expr->base.type);
3219 ir_mode *const mode = get_irn_mode(cnst);
3220 ir_node *const c1 = new_Const_long(mode, stack_param_align - 1);
3221 ir_node *const c2 = new_d_Add(dbgi, cnst, c1, mode);
3222 ir_node *const c3 = new_Const_long(mode, -(long)stack_param_align);
3223 ir_node *const c4 = new_d_And(dbgi, c2, c3, mode);
3224 ir_node *const add = new_d_Add(dbgi, ap, c4, mode_P_data);
3226 set_value_for_expression_addr(ap_expr, add, ap_addr);
3232 * Generate Firm for a va_copy expression.
3234 static ir_node *va_copy_expression_to_firm(const va_copy_expression_t *const expr)
3236 ir_node *const src = expression_to_firm(expr->src);
3237 set_value_for_expression(expr->dst, src);
3241 static ir_node *dereference_addr(const unary_expression_t *const expression)
3243 assert(expression->base.kind == EXPR_UNARY_DEREFERENCE);
3244 return expression_to_firm(expression->value);
3248 * Returns a IR-node representing an lvalue of the given expression.
3250 static ir_node *expression_to_addr(const expression_t *expression)
3252 switch(expression->kind) {
3253 case EXPR_ARRAY_ACCESS:
3254 return array_access_addr(&expression->array_access);
3256 return call_expression_to_firm(&expression->call);
3257 case EXPR_COMPOUND_LITERAL:
3258 return compound_literal_addr(&expression->compound_literal);
3259 case EXPR_REFERENCE:
3260 return reference_addr(&expression->reference);
3262 return select_addr(&expression->select);
3263 case EXPR_UNARY_DEREFERENCE:
3264 return dereference_addr(&expression->unary);
3268 panic("trying to get address of non-lvalue");
3271 static ir_node *builtin_constant_to_firm(
3272 const builtin_constant_expression_t *expression)
3274 ir_mode *const mode = get_ir_mode_arithmetic(expression->base.type);
3275 bool const v = is_constant_expression(expression->value) == EXPR_CLASS_CONSTANT;
3276 return create_Const_from_bool(mode, v);
3279 static ir_node *builtin_types_compatible_to_firm(
3280 const builtin_types_compatible_expression_t *expression)
3282 type_t *const left = get_unqualified_type(skip_typeref(expression->left));
3283 type_t *const right = get_unqualified_type(skip_typeref(expression->right));
3284 bool const value = types_compatible(left, right);
3285 ir_mode *const mode = get_ir_mode_arithmetic(expression->base.type);
3286 return create_Const_from_bool(mode, value);
3289 static ir_node *get_label_block(label_t *label)
3291 if (label->block != NULL)
3292 return label->block;
3294 /* beware: might be called from create initializer with current_ir_graph
3295 * set to const_code_irg. */
3296 ir_graph *rem = current_ir_graph;
3297 current_ir_graph = current_function;
3299 ir_node *block = new_immBlock();
3301 label->block = block;
3303 ARR_APP1(label_t *, all_labels, label);
3305 current_ir_graph = rem;
3310 * Pointer to a label. This is used for the
3311 * GNU address-of-label extension.
3313 static ir_node *label_address_to_firm(const label_address_expression_t *label)
3315 dbg_info *dbgi = get_dbg_info(&label->base.source_position);
3316 ir_node *block = get_label_block(label->label);
3317 ir_entity *entity = create_Block_entity(block);
3319 symconst_symbol value;
3320 value.entity_p = entity;
3321 return new_d_SymConst(dbgi, mode_P_code, value, symconst_addr_ent);
3325 * creates firm nodes for an expression. The difference between this function
3326 * and expression_to_firm is, that this version might produce mode_b nodes
3327 * instead of mode_Is.
3329 static ir_node *_expression_to_firm(expression_t const *const expr)
3332 if (!constant_folding) {
3333 assert(!expr->base.transformed);
3334 ((expression_t*)expr)->base.transformed = true;
3338 switch (expr->kind) {
3339 case EXPR_ALIGNOF: return alignof_to_firm( &expr->typeprop);
3340 case EXPR_ARRAY_ACCESS: return array_access_to_firm( &expr->array_access);
3341 case EXPR_BINARY_CASES: return binary_expression_to_firm( &expr->binary);
3342 case EXPR_BUILTIN_CONSTANT_P: return builtin_constant_to_firm( &expr->builtin_constant);
3343 case EXPR_BUILTIN_TYPES_COMPATIBLE_P: return builtin_types_compatible_to_firm(&expr->builtin_types_compatible);
3344 case EXPR_CALL: return call_expression_to_firm( &expr->call);
3345 case EXPR_CLASSIFY_TYPE: return classify_type_to_firm( &expr->classify_type);
3346 case EXPR_COMPOUND_LITERAL: return compound_literal_to_firm( &expr->compound_literal);
3347 case EXPR_CONDITIONAL: return conditional_to_firm( &expr->conditional);
3348 case EXPR_FUNCNAME: return function_name_to_firm( &expr->funcname);
3349 case EXPR_LABEL_ADDRESS: return label_address_to_firm( &expr->label_address);
3350 case EXPR_LITERAL_CASES: return literal_to_firm( &expr->literal);
3351 case EXPR_LITERAL_CHARACTER: return char_literal_to_firm( &expr->string_literal);
3352 case EXPR_OFFSETOF: return offsetof_to_firm( &expr->offsetofe);
3353 case EXPR_REFERENCE: return reference_expression_to_firm( &expr->reference);
3354 case EXPR_ENUM_CONSTANT: return enum_constant_to_firm( &expr->reference);
3355 case EXPR_SELECT: return select_to_firm( &expr->select);
3356 case EXPR_SIZEOF: return sizeof_to_firm( &expr->typeprop);
3357 case EXPR_STATEMENT: return statement_expression_to_firm( &expr->statement);
3358 case EXPR_UNARY_CASES: return unary_expression_to_firm( &expr->unary);
3359 case EXPR_VA_ARG: return va_arg_expression_to_firm( &expr->va_arge);
3360 case EXPR_VA_COPY: return va_copy_expression_to_firm( &expr->va_copye);
3361 case EXPR_VA_START: return va_start_expression_to_firm( &expr->va_starte);
3363 case EXPR_STRING_LITERAL: return string_to_firm(&expr->base.source_position, "str.%u", expr->string_literal.encoding, &expr->string_literal.value);
3365 case EXPR_ERROR: break;
3367 panic("invalid expression found");
3371 * Check if a given expression is a GNU __builtin_expect() call.
3373 static bool is_builtin_expect(const expression_t *expression)
3375 if (expression->kind != EXPR_CALL)
3378 expression_t *function = expression->call.function;
3379 if (function->kind != EXPR_REFERENCE)
3381 reference_expression_t *ref = &function->reference;
3382 if (ref->entity->kind != ENTITY_FUNCTION ||
3383 ref->entity->function.btk != BUILTIN_EXPECT)
3389 static bool produces_mode_b(const expression_t *expression)
3391 switch (expression->kind) {
3392 case EXPR_BINARY_EQUAL:
3393 case EXPR_BINARY_NOTEQUAL:
3394 case EXPR_BINARY_LESS:
3395 case EXPR_BINARY_LESSEQUAL:
3396 case EXPR_BINARY_GREATER:
3397 case EXPR_BINARY_GREATEREQUAL:
3398 case EXPR_BINARY_ISGREATER:
3399 case EXPR_BINARY_ISGREATEREQUAL:
3400 case EXPR_BINARY_ISLESS:
3401 case EXPR_BINARY_ISLESSEQUAL:
3402 case EXPR_BINARY_ISLESSGREATER:
3403 case EXPR_BINARY_ISUNORDERED:
3404 case EXPR_UNARY_NOT:
3408 if (is_builtin_expect(expression)) {
3409 expression_t *argument = expression->call.arguments->expression;
3410 return produces_mode_b(argument);
3413 case EXPR_BINARY_COMMA:
3414 return produces_mode_b(expression->binary.right);
3421 static ir_node *expression_to_firm(const expression_t *expression)
3423 if (!produces_mode_b(expression)) {
3424 ir_node *res = _expression_to_firm(expression);
3425 assert(res == NULL || get_irn_mode(res) != mode_b);
3429 if (is_constant_expression(expression) == EXPR_CLASS_CONSTANT) {
3430 return new_Const(fold_constant_to_tarval(expression));
3433 /* we have to produce a 0/1 from the mode_b expression */
3434 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3435 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
3436 return produce_condition_result(expression, mode, dbgi);
3440 * create a short-circuit expression evaluation that tries to construct
3441 * efficient control flow structures for &&, || and ! expressions
3443 static ir_node *create_condition_evaluation(const expression_t *expression,
3444 ir_node *true_block,
3445 ir_node *false_block)
3447 switch(expression->kind) {
3448 case EXPR_UNARY_NOT: {
3449 const unary_expression_t *unary_expression = &expression->unary;
3450 create_condition_evaluation(unary_expression->value, false_block,
3454 case EXPR_BINARY_LOGICAL_AND: {
3455 const binary_expression_t *binary_expression = &expression->binary;
3457 ir_node *extra_block = new_immBlock();
3458 create_condition_evaluation(binary_expression->left, extra_block,
3460 mature_immBlock(extra_block);
3461 set_cur_block(extra_block);
3462 create_condition_evaluation(binary_expression->right, true_block,
3466 case EXPR_BINARY_LOGICAL_OR: {
3467 const binary_expression_t *binary_expression = &expression->binary;
3469 ir_node *extra_block = new_immBlock();
3470 create_condition_evaluation(binary_expression->left, true_block,
3472 mature_immBlock(extra_block);
3473 set_cur_block(extra_block);
3474 create_condition_evaluation(binary_expression->right, true_block,
3482 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3483 ir_node *cond_expr = _expression_to_firm(expression);
3484 ir_node *condition = create_conv(dbgi, cond_expr, mode_b);
3485 ir_node *cond = new_d_Cond(dbgi, condition);
3486 ir_node *true_proj = new_d_Proj(dbgi, cond, mode_X, pn_Cond_true);
3487 ir_node *false_proj = new_d_Proj(dbgi, cond, mode_X, pn_Cond_false);
3489 /* set branch prediction info based on __builtin_expect */
3490 if (is_builtin_expect(expression) && is_Cond(cond)) {
3491 call_argument_t *argument = expression->call.arguments->next;
3492 if (is_constant_expression(argument->expression) == EXPR_CLASS_CONSTANT) {
3493 bool const cnst = fold_constant_to_bool(argument->expression);
3494 cond_jmp_predicate const pred = cnst ? COND_JMP_PRED_TRUE : COND_JMP_PRED_FALSE;
3495 set_Cond_jmp_pred(cond, pred);
3499 add_immBlock_pred(true_block, true_proj);
3500 add_immBlock_pred(false_block, false_proj);
3502 set_unreachable_now();
3506 static void create_variable_entity(entity_t *variable,
3507 declaration_kind_t declaration_kind,
3508 ir_type *parent_type)
3510 assert(variable->kind == ENTITY_VARIABLE);
3511 type_t *type = skip_typeref(variable->declaration.type);
3513 ident *const id = new_id_from_str(variable->base.symbol->string);
3514 ir_type *const irtype = get_ir_type(type);
3515 dbg_info *const dbgi = get_dbg_info(&variable->base.source_position);
3516 ir_entity *const irentity = new_d_entity(parent_type, id, irtype, dbgi);
3517 unsigned alignment = variable->declaration.alignment;
3519 set_entity_alignment(irentity, alignment);
3521 handle_decl_modifiers(irentity, variable);
3523 variable->declaration.kind = (unsigned char) declaration_kind;
3524 variable->variable.v.entity = irentity;
3525 set_entity_ld_ident(irentity, create_ld_ident(variable));
3527 if (type->base.qualifiers & TYPE_QUALIFIER_VOLATILE) {
3528 set_entity_volatility(irentity, volatility_is_volatile);
3533 typedef struct type_path_entry_t type_path_entry_t;
3534 struct type_path_entry_t {
3536 ir_initializer_t *initializer;
3538 entity_t *compound_entry;
3541 typedef struct type_path_t type_path_t;
3542 struct type_path_t {
3543 type_path_entry_t *path;
3548 static __attribute__((unused)) void debug_print_type_path(const type_path_t *path)
3550 size_t len = ARR_LEN(path->path);
3552 for (size_t i = 0; i < len; ++i) {
3553 const type_path_entry_t *entry = & path->path[i];
3555 type_t *type = skip_typeref(entry->type);
3556 if (is_type_compound(type)) {
3557 fprintf(stderr, ".%s", entry->compound_entry->base.symbol->string);
3558 } else if (is_type_array(type)) {
3559 fprintf(stderr, "[%u]", (unsigned) entry->index);
3561 fprintf(stderr, "-INVALID-");
3564 fprintf(stderr, " (");
3565 print_type(path->top_type);
3566 fprintf(stderr, ")");
3569 static type_path_entry_t *get_type_path_top(const type_path_t *path)
3571 size_t len = ARR_LEN(path->path);
3573 return & path->path[len-1];
3576 static type_path_entry_t *append_to_type_path(type_path_t *path)
3578 size_t len = ARR_LEN(path->path);
3579 ARR_RESIZE(type_path_entry_t, path->path, len+1);
3581 type_path_entry_t *result = & path->path[len];
3582 memset(result, 0, sizeof(result[0]));
3586 static size_t get_compound_member_count(const compound_type_t *type)
3588 compound_t *compound = type->compound;
3589 size_t n_members = 0;
3590 entity_t *member = compound->members.entities;
3591 for ( ; member != NULL; member = member->base.next) {
3598 static ir_initializer_t *get_initializer_entry(type_path_t *path)
3600 type_t *orig_top_type = path->top_type;
3601 type_t *top_type = skip_typeref(orig_top_type);
3603 assert(is_type_compound(top_type) || is_type_array(top_type));
3605 if (ARR_LEN(path->path) == 0) {
3608 type_path_entry_t *top = get_type_path_top(path);
3609 ir_initializer_t *initializer = top->initializer;
3610 return get_initializer_compound_value(initializer, top->index);
3614 static void descend_into_subtype(type_path_t *path)
3616 type_t *orig_top_type = path->top_type;
3617 type_t *top_type = skip_typeref(orig_top_type);
3619 assert(is_type_compound(top_type) || is_type_array(top_type));
3621 ir_initializer_t *initializer = get_initializer_entry(path);
3623 type_path_entry_t *top = append_to_type_path(path);
3624 top->type = top_type;
3628 if (is_type_compound(top_type)) {
3629 compound_t *const compound = top_type->compound.compound;
3630 entity_t *const entry = skip_unnamed_bitfields(compound->members.entities);
3632 top->compound_entry = entry;
3634 len = get_compound_member_count(&top_type->compound);
3635 if (entry != NULL) {
3636 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3637 path->top_type = entry->declaration.type;
3640 assert(is_type_array(top_type));
3641 assert(top_type->array.size > 0);
3644 path->top_type = top_type->array.element_type;
3645 len = top_type->array.size;
3647 if (initializer == NULL
3648 || get_initializer_kind(initializer) == IR_INITIALIZER_NULL) {
3649 initializer = create_initializer_compound(len);
3650 /* we have to set the entry at the 2nd latest path entry... */
3651 size_t path_len = ARR_LEN(path->path);
3652 assert(path_len >= 1);
3654 type_path_entry_t *entry = & path->path[path_len-2];
3655 ir_initializer_t *tinitializer = entry->initializer;
3656 set_initializer_compound_value(tinitializer, entry->index,
3660 top->initializer = initializer;
3663 static void ascend_from_subtype(type_path_t *path)
3665 type_path_entry_t *top = get_type_path_top(path);
3667 path->top_type = top->type;
3669 size_t len = ARR_LEN(path->path);
3670 ARR_RESIZE(type_path_entry_t, path->path, len-1);
3673 static void walk_designator(type_path_t *path, const designator_t *designator)
3675 /* designators start at current object type */
3676 ARR_RESIZE(type_path_entry_t, path->path, 1);
3678 for ( ; designator != NULL; designator = designator->next) {
3679 type_path_entry_t *top = get_type_path_top(path);
3680 type_t *orig_type = top->type;
3681 type_t *type = skip_typeref(orig_type);
3683 if (designator->symbol != NULL) {
3684 assert(is_type_compound(type));
3686 symbol_t *symbol = designator->symbol;
3688 compound_t *compound = type->compound.compound;
3689 entity_t *iter = compound->members.entities;
3690 for ( ; iter != NULL; iter = iter->base.next, ++index) {
3691 if (iter->base.symbol == symbol) {
3692 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
3696 assert(iter != NULL);
3698 /* revert previous initialisations of other union elements */
3699 if (type->kind == TYPE_COMPOUND_UNION) {
3700 ir_initializer_t *initializer = top->initializer;
3701 if (initializer != NULL
3702 && get_initializer_kind(initializer) == IR_INITIALIZER_COMPOUND) {
3703 /* are we writing to a new element? */
3704 ir_initializer_t *oldi
3705 = get_initializer_compound_value(initializer, index);
3706 if (get_initializer_kind(oldi) == IR_INITIALIZER_NULL) {
3707 /* clear initializer */
3709 = get_initializer_compound_n_entries(initializer);
3710 ir_initializer_t *nulli = get_initializer_null();
3711 for (size_t i = 0; i < len; ++i) {
3712 set_initializer_compound_value(initializer, i,
3719 top->type = orig_type;
3720 top->compound_entry = iter;
3722 orig_type = iter->declaration.type;
3724 expression_t *array_index = designator->array_index;
3725 assert(designator->array_index != NULL);
3726 assert(is_type_array(type));
3728 long index = fold_constant_to_int(array_index);
3731 if (type->array.size_constant) {
3732 long array_size = type->array.size;
3733 assert(index < array_size);
3737 top->type = orig_type;
3738 top->index = (size_t) index;
3739 orig_type = type->array.element_type;
3741 path->top_type = orig_type;
3743 if (designator->next != NULL) {
3744 descend_into_subtype(path);
3748 path->invalid = false;
3751 static void advance_current_object(type_path_t *path)
3753 if (path->invalid) {
3754 /* TODO: handle this... */
3755 panic("invalid initializer in ast2firm (excessive elements)");
3758 type_path_entry_t *top = get_type_path_top(path);
3760 type_t *type = skip_typeref(top->type);
3761 if (is_type_union(type)) {
3762 /* only the first element is initialized in unions */
3763 top->compound_entry = NULL;
3764 } else if (is_type_struct(type)) {
3765 entity_t *entry = top->compound_entry;
3768 entry = skip_unnamed_bitfields(entry->base.next);
3769 top->compound_entry = entry;
3770 if (entry != NULL) {
3771 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3772 path->top_type = entry->declaration.type;
3776 assert(is_type_array(type));
3779 if (!type->array.size_constant || top->index < type->array.size) {
3784 /* we're past the last member of the current sub-aggregate, try if we
3785 * can ascend in the type hierarchy and continue with another subobject */
3786 size_t len = ARR_LEN(path->path);
3789 ascend_from_subtype(path);
3790 advance_current_object(path);
3792 path->invalid = true;
3797 static ir_initializer_t *create_ir_initializer_value(
3798 const initializer_value_t *initializer)
3800 if (is_type_compound(initializer->value->base.type)) {
3801 panic("initializer creation for compounds not implemented yet");
3803 type_t *type = initializer->value->base.type;
3804 expression_t *expr = initializer->value;
3805 ir_node *value = expression_to_firm(expr);
3806 ir_mode *mode = get_ir_mode_storage(type);
3807 value = create_conv(NULL, value, mode);
3808 return create_initializer_const(value);
3811 /** test wether type can be initialized by a string constant */
3812 static bool is_string_type(type_t *type)
3815 if (is_type_pointer(type)) {
3816 inner = skip_typeref(type->pointer.points_to);
3817 } else if(is_type_array(type)) {
3818 inner = skip_typeref(type->array.element_type);
3823 return is_type_integer(inner);
3826 static ir_initializer_t *create_ir_initializer_list(
3827 const initializer_list_t *initializer, type_t *type)
3830 memset(&path, 0, sizeof(path));
3831 path.top_type = type;
3832 path.path = NEW_ARR_F(type_path_entry_t, 0);
3834 descend_into_subtype(&path);
3836 for (size_t i = 0; i < initializer->len; ++i) {
3837 const initializer_t *sub_initializer = initializer->initializers[i];
3839 if (sub_initializer->kind == INITIALIZER_DESIGNATOR) {
3840 walk_designator(&path, sub_initializer->designator.designator);
3844 if (sub_initializer->kind == INITIALIZER_VALUE) {
3845 /* we might have to descend into types until we're at a scalar
3848 type_t *orig_top_type = path.top_type;
3849 type_t *top_type = skip_typeref(orig_top_type);
3851 if (is_type_scalar(top_type))
3853 descend_into_subtype(&path);
3855 } else if (sub_initializer->kind == INITIALIZER_STRING
3856 || sub_initializer->kind == INITIALIZER_WIDE_STRING) {
3857 /* we might have to descend into types until we're at a scalar
3860 type_t *orig_top_type = path.top_type;
3861 type_t *top_type = skip_typeref(orig_top_type);
3863 if (is_string_type(top_type))
3865 descend_into_subtype(&path);
3869 ir_initializer_t *sub_irinitializer
3870 = create_ir_initializer(sub_initializer, path.top_type);
3872 size_t path_len = ARR_LEN(path.path);
3873 assert(path_len >= 1);
3874 type_path_entry_t *entry = & path.path[path_len-1];
3875 ir_initializer_t *tinitializer = entry->initializer;
3876 set_initializer_compound_value(tinitializer, entry->index,
3879 advance_current_object(&path);
3882 assert(ARR_LEN(path.path) >= 1);
3883 ir_initializer_t *result = path.path[0].initializer;
3884 DEL_ARR_F(path.path);
3889 static ir_initializer_t *create_ir_initializer_string(
3890 const initializer_string_t *initializer, type_t *type)
3892 type = skip_typeref(type);
3894 size_t string_len = initializer->string.size;
3895 assert(type->kind == TYPE_ARRAY);
3896 assert(type->array.size_constant);
3897 size_t len = type->array.size;
3898 ir_initializer_t *irinitializer = create_initializer_compound(len);
3900 const char *string = initializer->string.begin;
3901 ir_mode *mode = get_ir_mode_storage(type->array.element_type);
3903 for (size_t i = 0; i < len; ++i) {
3908 ir_tarval *tv = new_tarval_from_long(c, mode);
3909 ir_initializer_t *char_initializer = create_initializer_tarval(tv);
3911 set_initializer_compound_value(irinitializer, i, char_initializer);
3914 return irinitializer;
3917 static ir_initializer_t *create_ir_initializer_wide_string(
3918 const initializer_wide_string_t *initializer, type_t *type)
3920 assert(type->kind == TYPE_ARRAY);
3921 assert(type->array.size_constant);
3922 size_t len = type->array.size;
3923 size_t string_len = wstrlen(&initializer->string);
3924 ir_initializer_t *irinitializer = create_initializer_compound(len);
3926 const char *p = initializer->string.begin;
3927 ir_mode *mode = get_type_mode(ir_type_wchar_t);
3929 for (size_t i = 0; i < len; ++i) {
3931 if (i < string_len) {
3932 c = read_utf8_char(&p);
3934 ir_tarval *tv = new_tarval_from_long(c, mode);
3935 ir_initializer_t *char_initializer = create_initializer_tarval(tv);
3937 set_initializer_compound_value(irinitializer, i, char_initializer);
3940 return irinitializer;
3943 static ir_initializer_t *create_ir_initializer(
3944 const initializer_t *initializer, type_t *type)
3946 switch(initializer->kind) {
3947 case INITIALIZER_STRING:
3948 return create_ir_initializer_string(&initializer->string, type);
3950 case INITIALIZER_WIDE_STRING:
3951 return create_ir_initializer_wide_string(&initializer->wide_string,
3954 case INITIALIZER_LIST:
3955 return create_ir_initializer_list(&initializer->list, type);
3957 case INITIALIZER_VALUE:
3958 return create_ir_initializer_value(&initializer->value);
3960 case INITIALIZER_DESIGNATOR:
3961 panic("unexpected designator initializer found");
3963 panic("unknown initializer");
3966 /** ANSI C ยง6.7.8:21: If there are fewer initializers [..] than there
3967 * are elements [...] the remainder of the aggregate shall be initialized
3968 * implicitly the same as objects that have static storage duration. */
3969 static void create_dynamic_null_initializer(ir_entity *entity, dbg_info *dbgi,
3972 /* for unions we must NOT do anything for null initializers */
3973 ir_type *owner = get_entity_owner(entity);
3974 if (is_Union_type(owner)) {
3978 ir_type *ent_type = get_entity_type(entity);
3979 /* create sub-initializers for a compound type */
3980 if (is_compound_type(ent_type)) {
3981 unsigned n_members = get_compound_n_members(ent_type);
3982 for (unsigned n = 0; n < n_members; ++n) {
3983 ir_entity *member = get_compound_member(ent_type, n);
3984 ir_node *addr = new_d_simpleSel(dbgi, new_NoMem(), base_addr,
3986 create_dynamic_null_initializer(member, dbgi, addr);
3990 if (is_Array_type(ent_type)) {
3991 assert(has_array_upper_bound(ent_type, 0));
3992 long n = get_array_upper_bound_int(ent_type, 0);
3993 for (long i = 0; i < n; ++i) {
3994 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
3995 ir_tarval *index_tv = new_tarval_from_long(i, mode_uint);
3996 ir_node *cnst = new_d_Const(dbgi, index_tv);
3997 ir_node *in[1] = { cnst };
3998 ir_entity *arrent = get_array_element_entity(ent_type);
3999 ir_node *addr = new_d_Sel(dbgi, new_NoMem(), base_addr, 1, in,
4001 create_dynamic_null_initializer(arrent, dbgi, addr);
4006 ir_mode *value_mode = get_type_mode(ent_type);
4007 ir_node *node = new_Const(get_mode_null(value_mode));
4009 /* is it a bitfield type? */
4010 if (is_Primitive_type(ent_type) &&
4011 get_primitive_base_type(ent_type) != NULL) {
4012 bitfield_store_to_firm(dbgi, entity, base_addr, node, false, false);
4016 ir_node *mem = get_store();
4017 ir_node *store = new_d_Store(dbgi, mem, base_addr, node, cons_none);
4018 ir_node *proj_m = new_Proj(store, mode_M, pn_Store_M);
4022 static void create_dynamic_initializer_sub(ir_initializer_t *initializer,
4023 ir_entity *entity, ir_type *type, dbg_info *dbgi, ir_node *base_addr)
4025 switch(get_initializer_kind(initializer)) {
4026 case IR_INITIALIZER_NULL:
4027 create_dynamic_null_initializer(entity, dbgi, base_addr);
4029 case IR_INITIALIZER_CONST: {
4030 ir_node *node = get_initializer_const_value(initializer);
4031 ir_type *ent_type = get_entity_type(entity);
4033 /* is it a bitfield type? */
4034 if (is_Primitive_type(ent_type) &&
4035 get_primitive_base_type(ent_type) != NULL) {
4036 bitfield_store_to_firm(dbgi, entity, base_addr, node, false, false);
4040 assert(get_type_mode(type) == get_irn_mode(node));
4041 ir_node *mem = get_store();
4042 ir_node *store = new_d_Store(dbgi, mem, base_addr, node, cons_none);
4043 ir_node *proj_m = new_Proj(store, mode_M, pn_Store_M);
4047 case IR_INITIALIZER_TARVAL: {
4048 ir_tarval *tv = get_initializer_tarval_value(initializer);
4049 ir_node *cnst = new_d_Const(dbgi, tv);
4050 ir_type *ent_type = get_entity_type(entity);
4052 /* is it a bitfield type? */
4053 if (is_Primitive_type(ent_type) &&
4054 get_primitive_base_type(ent_type) != NULL) {
4055 bitfield_store_to_firm(dbgi, entity, base_addr, cnst, false, false);
4059 assert(get_type_mode(type) == get_tarval_mode(tv));
4060 ir_node *mem = get_store();
4061 ir_node *store = new_d_Store(dbgi, mem, base_addr, cnst, cons_none);
4062 ir_node *proj_m = new_Proj(store, mode_M, pn_Store_M);
4066 case IR_INITIALIZER_COMPOUND: {
4067 assert(is_compound_type(type) || is_Array_type(type));
4069 if (is_Array_type(type)) {
4070 assert(has_array_upper_bound(type, 0));
4071 n_members = get_array_upper_bound_int(type, 0);
4073 n_members = get_compound_n_members(type);
4076 if (get_initializer_compound_n_entries(initializer)
4077 != (unsigned) n_members)
4078 panic("initializer doesn't match compound type");
4080 for (int i = 0; i < n_members; ++i) {
4083 ir_entity *sub_entity;
4084 if (is_Array_type(type)) {
4085 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
4086 ir_tarval *index_tv = new_tarval_from_long(i, mode_uint);
4087 ir_node *cnst = new_d_Const(dbgi, index_tv);
4088 ir_node *in[1] = { cnst };
4089 irtype = get_array_element_type(type);
4090 sub_entity = get_array_element_entity(type);
4091 addr = new_d_Sel(dbgi, new_NoMem(), base_addr, 1, in,
4094 sub_entity = get_compound_member(type, i);
4095 irtype = get_entity_type(sub_entity);
4096 addr = new_d_simpleSel(dbgi, new_NoMem(), base_addr,
4100 ir_initializer_t *sub_init
4101 = get_initializer_compound_value(initializer, i);
4103 create_dynamic_initializer_sub(sub_init, sub_entity, irtype, dbgi,
4110 panic("invalid IR_INITIALIZER found");
4113 static void create_dynamic_initializer(ir_initializer_t *initializer,
4114 dbg_info *dbgi, ir_entity *entity)
4116 ir_node *frame = get_irg_frame(current_ir_graph);
4117 ir_node *base_addr = new_d_simpleSel(dbgi, new_NoMem(), frame, entity);
4118 ir_type *type = get_entity_type(entity);
4120 create_dynamic_initializer_sub(initializer, entity, type, dbgi, base_addr);
4123 static void create_local_initializer(initializer_t *initializer, dbg_info *dbgi,
4124 ir_entity *entity, type_t *type)
4126 ir_node *memory = get_store();
4127 ir_node *nomem = new_NoMem();
4128 ir_node *frame = get_irg_frame(current_ir_graph);
4129 ir_node *addr = new_d_simpleSel(dbgi, nomem, frame, entity);
4131 if (initializer->kind == INITIALIZER_VALUE) {
4132 initializer_value_t *initializer_value = &initializer->value;
4134 ir_node *value = expression_to_firm(initializer_value->value);
4135 type = skip_typeref(type);
4136 assign_value(dbgi, addr, type, value);
4140 if (is_constant_initializer(initializer) == EXPR_CLASS_VARIABLE) {
4141 ir_initializer_t *irinitializer
4142 = create_ir_initializer(initializer, type);
4144 create_dynamic_initializer(irinitializer, dbgi, entity);
4148 /* create a "template" entity which is copied to the entity on the stack */
4149 ir_entity *const init_entity
4150 = create_initializer_entity(dbgi, initializer, type);
4151 ir_node *const src_addr = create_symconst(dbgi, init_entity);
4152 ir_type *const irtype = get_ir_type(type);
4153 ir_node *const copyb = new_d_CopyB(dbgi, memory, addr, src_addr, irtype);
4155 ir_node *const copyb_mem = new_Proj(copyb, mode_M, pn_CopyB_M);
4156 set_store(copyb_mem);
4159 static void create_initializer_local_variable_entity(entity_t *entity)
4161 assert(entity->kind == ENTITY_VARIABLE);
4162 initializer_t *initializer = entity->variable.initializer;
4163 dbg_info *dbgi = get_dbg_info(&entity->base.source_position);
4164 ir_entity *irentity = entity->variable.v.entity;
4165 type_t *type = entity->declaration.type;
4167 create_local_initializer(initializer, dbgi, irentity, type);
4170 static void create_variable_initializer(entity_t *entity)
4172 assert(entity->kind == ENTITY_VARIABLE);
4173 initializer_t *initializer = entity->variable.initializer;
4174 if (initializer == NULL)
4177 declaration_kind_t declaration_kind
4178 = (declaration_kind_t) entity->declaration.kind;
4179 if (declaration_kind == DECLARATION_KIND_LOCAL_VARIABLE_ENTITY) {
4180 create_initializer_local_variable_entity(entity);
4184 type_t *type = entity->declaration.type;
4185 type_qualifiers_t tq = get_type_qualifier(type, true);
4187 if (initializer->kind == INITIALIZER_VALUE) {
4188 expression_t * value = initializer->value.value;
4189 type_t *const init_type = skip_typeref(value->base.type);
4191 if (!is_type_scalar(init_type)) {
4193 while (value->kind == EXPR_UNARY_CAST)
4194 value = value->unary.value;
4196 if (value->kind != EXPR_COMPOUND_LITERAL)
4197 panic("expected non-scalar initializer to be a compound literal");
4198 initializer = value->compound_literal.initializer;
4199 goto have_initializer;
4202 ir_node * node = expression_to_firm(value);
4203 dbg_info *const dbgi = get_dbg_info(&entity->base.source_position);
4204 ir_mode *const mode = get_ir_mode_storage(init_type);
4205 node = create_conv(dbgi, node, mode);
4206 node = do_strict_conv(dbgi, node);
4208 if (declaration_kind == DECLARATION_KIND_LOCAL_VARIABLE) {
4209 set_value(entity->variable.v.value_number, node);
4211 assert(declaration_kind == DECLARATION_KIND_GLOBAL_VARIABLE);
4213 ir_entity *irentity = entity->variable.v.entity;
4215 if (tq & TYPE_QUALIFIER_CONST
4216 && get_entity_owner(irentity) != get_tls_type()) {
4217 add_entity_linkage(irentity, IR_LINKAGE_CONSTANT);
4219 set_atomic_ent_value(irentity, node);
4223 assert(declaration_kind == DECLARATION_KIND_LOCAL_VARIABLE_ENTITY ||
4224 declaration_kind == DECLARATION_KIND_GLOBAL_VARIABLE);
4226 ir_entity *irentity = entity->variable.v.entity;
4227 ir_initializer_t *irinitializer
4228 = create_ir_initializer(initializer, type);
4230 if (tq & TYPE_QUALIFIER_CONST) {
4231 add_entity_linkage(irentity, IR_LINKAGE_CONSTANT);
4233 set_entity_initializer(irentity, irinitializer);
4237 static void create_variable_length_array(entity_t *entity)
4239 assert(entity->kind == ENTITY_VARIABLE);
4240 assert(entity->variable.initializer == NULL);
4242 entity->declaration.kind = DECLARATION_KIND_VARIABLE_LENGTH_ARRAY;
4243 entity->variable.v.vla_base = NULL;
4245 /* TODO: record VLA somewhere so we create the free node when we leave
4249 static void allocate_variable_length_array(entity_t *entity)
4251 assert(entity->kind == ENTITY_VARIABLE);
4252 assert(entity->variable.initializer == NULL);
4253 assert(currently_reachable());
4255 dbg_info *dbgi = get_dbg_info(&entity->base.source_position);
4256 type_t *type = entity->declaration.type;
4257 ir_type *el_type = get_ir_type(type->array.element_type);
4259 /* make sure size_node is calculated */
4260 get_type_size_node(type);
4261 ir_node *elems = type->array.size_node;
4262 ir_node *mem = get_store();
4263 ir_node *alloc = new_d_Alloc(dbgi, mem, elems, el_type, stack_alloc);
4265 ir_node *proj_m = new_d_Proj(dbgi, alloc, mode_M, pn_Alloc_M);
4266 ir_node *addr = new_d_Proj(dbgi, alloc, mode_P_data, pn_Alloc_res);
4269 assert(entity->declaration.kind == DECLARATION_KIND_VARIABLE_LENGTH_ARRAY);
4270 entity->variable.v.vla_base = addr;
4274 * Creates a Firm local variable from a declaration.
4276 static void create_local_variable(entity_t *entity)
4278 assert(entity->kind == ENTITY_VARIABLE);
4279 assert(entity->declaration.kind == DECLARATION_KIND_UNKNOWN);
4281 bool needs_entity = entity->variable.address_taken;
4282 type_t *type = skip_typeref(entity->declaration.type);
4284 /* is it a variable length array? */
4285 if (is_type_array(type) && !type->array.size_constant) {
4286 create_variable_length_array(entity);
4288 } else if (is_type_array(type) || is_type_compound(type)) {
4289 needs_entity = true;
4290 } else if (type->base.qualifiers & TYPE_QUALIFIER_VOLATILE) {
4291 needs_entity = true;
4295 ir_type *frame_type = get_irg_frame_type(current_ir_graph);
4296 create_variable_entity(entity,
4297 DECLARATION_KIND_LOCAL_VARIABLE_ENTITY,
4300 entity->declaration.kind = DECLARATION_KIND_LOCAL_VARIABLE;
4301 entity->variable.v.value_number = next_value_number_function;
4302 set_irg_loc_description(current_ir_graph, next_value_number_function,
4304 ++next_value_number_function;
4308 static void create_local_static_variable(entity_t *entity)
4310 assert(entity->kind == ENTITY_VARIABLE);
4311 assert(entity->declaration.kind == DECLARATION_KIND_UNKNOWN);
4313 type_t *type = skip_typeref(entity->declaration.type);
4314 ir_type *const var_type = entity->variable.thread_local ?
4315 get_tls_type() : get_glob_type();
4316 ir_type *const irtype = get_ir_type(type);
4317 dbg_info *const dbgi = get_dbg_info(&entity->base.source_position);
4319 size_t l = strlen(entity->base.symbol->string);
4320 char buf[l + sizeof(".%u")];
4321 snprintf(buf, sizeof(buf), "%s.%%u", entity->base.symbol->string);
4322 ident *const id = id_unique(buf);
4323 ir_entity *const irentity = new_d_entity(var_type, id, irtype, dbgi);
4325 if (type->base.qualifiers & TYPE_QUALIFIER_VOLATILE) {
4326 set_entity_volatility(irentity, volatility_is_volatile);
4329 entity->declaration.kind = DECLARATION_KIND_GLOBAL_VARIABLE;
4330 entity->variable.v.entity = irentity;
4332 set_entity_ld_ident(irentity, id);
4333 set_entity_visibility(irentity, ir_visibility_local);
4335 if (entity->variable.initializer == NULL) {
4336 ir_initializer_t *null_init = get_initializer_null();
4337 set_entity_initializer(irentity, null_init);
4340 ir_graph *const old_current_ir_graph = current_ir_graph;
4341 current_ir_graph = get_const_code_irg();
4343 create_variable_initializer(entity);
4345 assert(current_ir_graph == get_const_code_irg());
4346 current_ir_graph = old_current_ir_graph;
4351 static ir_node *return_statement_to_firm(return_statement_t *statement)
4353 if (!currently_reachable())
4356 dbg_info *const dbgi = get_dbg_info(&statement->base.source_position);
4357 type_t *const type = skip_typeref(current_function_entity->declaration.type->function.return_type);
4358 ir_node * res = statement->value ? expression_to_firm(statement->value) : NULL;
4361 if (!is_type_void(type)) {
4362 ir_mode *const mode = get_ir_mode_storage(type);
4364 res = create_conv(dbgi, res, mode);
4365 res = do_strict_conv(dbgi, res);
4367 res = new_Unknown(mode);
4374 ir_node *const in[1] = { res };
4375 ir_node *const store = get_store();
4376 ir_node *const ret = new_d_Return(dbgi, store, in_len, in);
4378 ir_node *end_block = get_irg_end_block(current_ir_graph);
4379 add_immBlock_pred(end_block, ret);
4381 set_unreachable_now();
4385 static ir_node *expression_statement_to_firm(expression_statement_t *statement)
4387 if (!currently_reachable())
4390 return expression_to_firm(statement->expression);
4393 static void create_local_declarations(entity_t*);
4395 static ir_node *compound_statement_to_firm(compound_statement_t *compound)
4397 create_local_declarations(compound->scope.entities);
4399 ir_node *result = NULL;
4400 statement_t *statement = compound->statements;
4401 for ( ; statement != NULL; statement = statement->base.next) {
4402 result = statement_to_firm(statement);
4408 static void create_global_variable(entity_t *entity)
4410 ir_linkage linkage = IR_LINKAGE_DEFAULT;
4411 ir_visibility visibility = ir_visibility_external;
4412 storage_class_tag_t storage
4413 = (storage_class_tag_t)entity->declaration.storage_class;
4414 decl_modifiers_t modifiers = entity->declaration.modifiers;
4415 assert(entity->kind == ENTITY_VARIABLE);
4418 case STORAGE_CLASS_EXTERN: visibility = ir_visibility_external; break;
4419 case STORAGE_CLASS_STATIC: visibility = ir_visibility_local; break;
4420 case STORAGE_CLASS_NONE: visibility = ir_visibility_external; break;
4421 case STORAGE_CLASS_TYPEDEF:
4422 case STORAGE_CLASS_AUTO:
4423 case STORAGE_CLASS_REGISTER:
4424 panic("invalid storage class for global var");
4427 /* "common" symbols */
4428 if (storage == STORAGE_CLASS_NONE
4429 && entity->variable.initializer == NULL
4430 && !entity->variable.thread_local
4431 && (modifiers & DM_WEAK) == 0) {
4432 linkage |= IR_LINKAGE_MERGE;
4435 ir_type *var_type = get_glob_type();
4436 if (entity->variable.thread_local) {
4437 var_type = get_tls_type();
4439 create_variable_entity(entity, DECLARATION_KIND_GLOBAL_VARIABLE, var_type);
4440 ir_entity *irentity = entity->variable.v.entity;
4441 add_entity_linkage(irentity, linkage);
4442 set_entity_visibility(irentity, visibility);
4443 if (entity->variable.initializer == NULL
4444 && storage != STORAGE_CLASS_EXTERN) {
4445 ir_initializer_t *null_init = get_initializer_null();
4446 set_entity_initializer(irentity, null_init);
4450 static void create_local_declaration(entity_t *entity)
4452 assert(is_declaration(entity));
4454 /* construct type */
4455 (void) get_ir_type(entity->declaration.type);
4456 if (entity->base.symbol == NULL) {
4460 switch ((storage_class_tag_t) entity->declaration.storage_class) {
4461 case STORAGE_CLASS_STATIC:
4462 if (entity->kind == ENTITY_FUNCTION) {
4463 (void)get_function_entity(entity, NULL);
4465 create_local_static_variable(entity);
4468 case STORAGE_CLASS_EXTERN:
4469 if (entity->kind == ENTITY_FUNCTION) {
4470 assert(entity->function.statement == NULL);
4471 (void)get_function_entity(entity, NULL);
4473 create_global_variable(entity);
4474 create_variable_initializer(entity);
4477 case STORAGE_CLASS_NONE:
4478 case STORAGE_CLASS_AUTO:
4479 case STORAGE_CLASS_REGISTER:
4480 if (entity->kind == ENTITY_FUNCTION) {
4481 if (entity->function.statement != NULL) {
4482 ir_type *owner = get_irg_frame_type(current_ir_graph);
4483 (void)get_function_entity(entity, owner);
4484 entity->declaration.kind = DECLARATION_KIND_INNER_FUNCTION;
4485 enqueue_inner_function(entity);
4487 (void)get_function_entity(entity, NULL);
4490 create_local_variable(entity);
4493 case STORAGE_CLASS_TYPEDEF:
4496 panic("invalid storage class found");
4499 static void create_local_declarations(entity_t *e)
4501 for (; e; e = e->base.next) {
4502 if (is_declaration(e))
4503 create_local_declaration(e);
4507 static void initialize_local_declaration(entity_t *entity)
4509 if (entity->base.symbol == NULL)
4512 // no need to emit code in dead blocks
4513 if (entity->declaration.storage_class != STORAGE_CLASS_STATIC
4514 && !currently_reachable())
4517 switch ((declaration_kind_t) entity->declaration.kind) {
4518 case DECLARATION_KIND_LOCAL_VARIABLE:
4519 case DECLARATION_KIND_LOCAL_VARIABLE_ENTITY:
4520 create_variable_initializer(entity);
4523 case DECLARATION_KIND_VARIABLE_LENGTH_ARRAY:
4524 allocate_variable_length_array(entity);
4527 case DECLARATION_KIND_COMPOUND_MEMBER:
4528 case DECLARATION_KIND_GLOBAL_VARIABLE:
4529 case DECLARATION_KIND_FUNCTION:
4530 case DECLARATION_KIND_INNER_FUNCTION:
4533 case DECLARATION_KIND_PARAMETER:
4534 case DECLARATION_KIND_PARAMETER_ENTITY:
4535 panic("can't initialize parameters");
4537 case DECLARATION_KIND_UNKNOWN:
4538 panic("can't initialize unknown declaration");
4540 panic("invalid declaration kind");
4543 static ir_node *declaration_statement_to_firm(declaration_statement_t *statement)
4545 entity_t *entity = statement->declarations_begin;
4549 entity_t *const last = statement->declarations_end;
4550 for ( ;; entity = entity->base.next) {
4551 if (is_declaration(entity)) {
4552 initialize_local_declaration(entity);
4553 } else if (entity->kind == ENTITY_TYPEDEF) {
4554 /* ยง6.7.7:3 Any array size expressions associated with variable length
4555 * array declarators are evaluated each time the declaration of the
4556 * typedef name is reached in the order of execution. */
4557 type_t *const type = skip_typeref(entity->typedefe.type);
4558 if (is_type_array(type) && type->array.is_vla)
4559 get_vla_size(&type->array);
4568 static ir_node *if_statement_to_firm(if_statement_t *statement)
4570 create_local_declarations(statement->scope.entities);
4572 /* Create the condition. */
4573 ir_node *true_block = NULL;
4574 ir_node *false_block = NULL;
4575 if (currently_reachable()) {
4576 true_block = new_immBlock();
4577 false_block = new_immBlock();
4578 create_condition_evaluation(statement->condition, true_block, false_block);
4579 mature_immBlock(true_block);
4580 mature_immBlock(false_block);
4583 /* Create the true statement. */
4584 set_cur_block(true_block);
4585 statement_to_firm(statement->true_statement);
4586 ir_node *fallthrough_block = get_cur_block();
4588 /* Create the false statement. */
4589 set_cur_block(false_block);
4590 if (statement->false_statement != NULL) {
4591 statement_to_firm(statement->false_statement);
4594 /* Handle the block after the if-statement. Minor simplification and
4595 * optimisation: Reuse the false/true block as fallthrough block, if the
4596 * true/false statement does not pass control to the fallthrough block, e.g.
4597 * in the typical if (x) return; pattern. */
4598 if (fallthrough_block) {
4599 if (currently_reachable()) {
4600 ir_node *const t_jump = new_r_Jmp(fallthrough_block);
4601 ir_node *const f_jump = new_Jmp();
4602 ir_node *const in[] = { t_jump, f_jump };
4603 fallthrough_block = new_Block(2, in);
4605 set_cur_block(fallthrough_block);
4612 * Add an unconditional jump to the target block. If the source block is not
4613 * reachable, then a Bad predecessor is created to prevent Phi-less unreachable
4614 * loops. This is necessary if the jump potentially enters a loop.
4616 static void jump_to(ir_node *const target_block)
4618 ir_node *const pred = currently_reachable() ? new_Jmp() : new_Bad(mode_X);
4619 add_immBlock_pred(target_block, pred);
4623 * Add an unconditional jump to the target block, if the current block is
4624 * reachable and do nothing otherwise. This is only valid if the jump does not
4625 * enter a loop (a back edge is ok).
4627 static void jump_if_reachable(ir_node *const target_block)
4629 if (currently_reachable())
4630 add_immBlock_pred(target_block, new_Jmp());
4633 static ir_node *while_statement_to_firm(while_statement_t *statement)
4635 create_local_declarations(statement->scope.entities);
4637 /* Create the header block */
4638 ir_node *const header_block = new_immBlock();
4639 jump_to(header_block);
4641 /* Create the condition. */
4642 ir_node * body_block;
4643 ir_node * false_block;
4644 expression_t *const cond = statement->condition;
4645 if (is_constant_expression(cond) == EXPR_CLASS_CONSTANT &&
4646 fold_constant_to_bool(cond)) {
4647 /* Shortcut for while (true). */
4648 body_block = header_block;
4651 keep_alive(header_block);
4652 keep_all_memory(header_block);
4654 body_block = new_immBlock();
4655 false_block = new_immBlock();
4657 set_cur_block(header_block);
4658 create_condition_evaluation(cond, body_block, false_block);
4659 mature_immBlock(body_block);
4662 ir_node *const old_continue_label = continue_label;
4663 ir_node *const old_break_label = break_label;
4664 continue_label = header_block;
4665 break_label = false_block;
4667 /* Create the loop body. */
4668 set_cur_block(body_block);
4669 statement_to_firm(statement->body);
4670 jump_if_reachable(header_block);
4672 mature_immBlock(header_block);
4673 assert(false_block == NULL || false_block == break_label);
4674 false_block = break_label;
4675 if (false_block != NULL) {
4676 mature_immBlock(false_block);
4678 set_cur_block(false_block);
4680 assert(continue_label == header_block);
4681 continue_label = old_continue_label;
4682 break_label = old_break_label;
4686 static ir_node *get_break_label(void)
4688 if (break_label == NULL) {
4689 break_label = new_immBlock();
4694 static ir_node *do_while_statement_to_firm(do_while_statement_t *statement)
4696 create_local_declarations(statement->scope.entities);
4698 /* create the header block */
4699 ir_node *header_block = new_immBlock();
4702 ir_node *body_block = new_immBlock();
4703 jump_to(body_block);
4705 ir_node *old_continue_label = continue_label;
4706 ir_node *old_break_label = break_label;
4707 continue_label = header_block;
4710 set_cur_block(body_block);
4711 statement_to_firm(statement->body);
4712 ir_node *const false_block = get_break_label();
4714 assert(continue_label == header_block);
4715 continue_label = old_continue_label;
4716 break_label = old_break_label;
4718 jump_if_reachable(header_block);
4720 /* create the condition */
4721 mature_immBlock(header_block);
4722 set_cur_block(header_block);
4724 create_condition_evaluation(statement->condition, body_block, false_block);
4725 mature_immBlock(body_block);
4726 mature_immBlock(false_block);
4728 set_cur_block(false_block);
4732 static ir_node *for_statement_to_firm(for_statement_t *statement)
4734 create_local_declarations(statement->scope.entities);
4736 if (currently_reachable()) {
4737 entity_t *entity = statement->scope.entities;
4738 for ( ; entity != NULL; entity = entity->base.next) {
4739 if (!is_declaration(entity))
4742 initialize_local_declaration(entity);
4745 if (statement->initialisation != NULL) {
4746 expression_to_firm(statement->initialisation);
4750 /* Create the header block */
4751 ir_node *const header_block = new_immBlock();
4752 jump_to(header_block);
4754 /* Create the condition. */
4755 ir_node *body_block;
4756 ir_node *false_block;
4757 if (statement->condition != NULL) {
4758 body_block = new_immBlock();
4759 false_block = new_immBlock();
4761 set_cur_block(header_block);
4762 create_condition_evaluation(statement->condition, body_block, false_block);
4763 mature_immBlock(body_block);
4766 body_block = header_block;
4769 keep_alive(header_block);
4770 keep_all_memory(header_block);
4773 /* Create the step block, if necessary. */
4774 ir_node * step_block = header_block;
4775 expression_t *const step = statement->step;
4777 step_block = new_immBlock();
4780 ir_node *const old_continue_label = continue_label;
4781 ir_node *const old_break_label = break_label;
4782 continue_label = step_block;
4783 break_label = false_block;
4785 /* Create the loop body. */
4786 set_cur_block(body_block);
4787 statement_to_firm(statement->body);
4788 jump_if_reachable(step_block);
4790 /* Create the step code. */
4792 mature_immBlock(step_block);
4793 set_cur_block(step_block);
4794 expression_to_firm(step);
4795 jump_if_reachable(header_block);
4798 mature_immBlock(header_block);
4799 assert(false_block == NULL || false_block == break_label);
4800 false_block = break_label;
4801 if (false_block != NULL) {
4802 mature_immBlock(false_block);
4804 set_cur_block(false_block);
4806 assert(continue_label == step_block);
4807 continue_label = old_continue_label;
4808 break_label = old_break_label;
4812 static ir_node *create_jump_statement(const statement_t *statement, ir_node *target_block)
4814 if (!currently_reachable())
4817 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
4818 ir_node *jump = new_d_Jmp(dbgi);
4819 add_immBlock_pred(target_block, jump);
4821 set_unreachable_now();
4825 static ir_switch_table *create_switch_table(const switch_statement_t *statement)
4827 /* determine number of cases */
4829 for (case_label_statement_t *l = statement->first_case; l != NULL;
4832 if (l->expression == NULL)
4834 if (l->is_empty_range)
4839 ir_switch_table *res = ir_new_switch_table(current_ir_graph, n_cases);
4841 for (case_label_statement_t *l = statement->first_case; l != NULL;
4843 if (l->expression == NULL) {
4844 l->pn = pn_Switch_default;
4847 if (l->is_empty_range)
4849 ir_tarval *min = fold_constant_to_tarval(l->expression);
4850 ir_tarval *max = min;
4851 long pn = (long) i+1;
4852 if (l->end_range != NULL)
4853 max = fold_constant_to_tarval(l->end_range);
4854 ir_switch_table_set(res, i++, min, max, pn);
4860 static ir_node *switch_statement_to_firm(switch_statement_t *statement)
4862 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
4863 ir_node *switch_node = NULL;
4865 if (currently_reachable()) {
4866 ir_node *expression = expression_to_firm(statement->expression);
4867 ir_switch_table *table = create_switch_table(statement);
4868 unsigned n_outs = (unsigned)ir_switch_table_get_n_entries(table) + 1;
4870 switch_node = new_d_Switch(dbgi, expression, n_outs, table);
4873 set_unreachable_now();
4875 ir_node *const old_switch = current_switch;
4876 ir_node *const old_break_label = break_label;
4877 const bool old_saw_default_label = saw_default_label;
4878 saw_default_label = false;
4879 current_switch = switch_node;
4882 statement_to_firm(statement->body);
4884 if (currently_reachable()) {
4885 add_immBlock_pred(get_break_label(), new_Jmp());
4888 if (!saw_default_label && switch_node) {
4889 ir_node *proj = new_d_Proj(dbgi, switch_node, mode_X, pn_Switch_default);
4890 add_immBlock_pred(get_break_label(), proj);
4893 if (break_label != NULL) {
4894 mature_immBlock(break_label);
4896 set_cur_block(break_label);
4898 assert(current_switch == switch_node);
4899 current_switch = old_switch;
4900 break_label = old_break_label;
4901 saw_default_label = old_saw_default_label;
4905 static ir_node *case_label_to_firm(const case_label_statement_t *statement)
4907 if (statement->is_empty_range)
4910 if (current_switch != NULL) {
4911 ir_node *block = new_immBlock();
4912 /* Fallthrough from previous case */
4913 jump_if_reachable(block);
4915 ir_node *const proj = new_Proj(current_switch, mode_X, statement->pn);
4916 add_immBlock_pred(block, proj);
4917 if (statement->expression == NULL)
4918 saw_default_label = true;
4920 mature_immBlock(block);
4921 set_cur_block(block);
4924 return statement_to_firm(statement->statement);
4927 static ir_node *label_to_firm(const label_statement_t *statement)
4929 ir_node *block = get_label_block(statement->label);
4932 set_cur_block(block);
4934 keep_all_memory(block);
4936 return statement_to_firm(statement->statement);
4939 static ir_node *computed_goto_to_firm(computed_goto_statement_t const *const statement)
4941 if (!currently_reachable())
4944 ir_node *const irn = expression_to_firm(statement->expression);
4945 dbg_info *const dbgi = get_dbg_info(&statement->base.source_position);
4946 ir_node *const ijmp = new_d_IJmp(dbgi, irn);
4948 set_irn_link(ijmp, ijmp_list);
4951 set_unreachable_now();
4955 static ir_node *asm_statement_to_firm(const asm_statement_t *statement)
4957 bool needs_memory = false;
4959 if (statement->is_volatile) {
4960 needs_memory = true;
4963 size_t n_clobbers = 0;
4964 asm_clobber_t *clobber = statement->clobbers;
4965 for ( ; clobber != NULL; clobber = clobber->next) {
4966 const char *clobber_str = clobber->clobber.begin;
4968 if (!be_is_valid_clobber(clobber_str)) {
4969 errorf(&statement->base.source_position,
4970 "invalid clobber '%s' specified", clobber->clobber);
4974 if (streq(clobber_str, "memory")) {
4975 needs_memory = true;
4979 ident *id = new_id_from_str(clobber_str);
4980 obstack_ptr_grow(&asm_obst, id);
4983 assert(obstack_object_size(&asm_obst) == n_clobbers * sizeof(ident*));
4984 ident **clobbers = NULL;
4985 if (n_clobbers > 0) {
4986 clobbers = obstack_finish(&asm_obst);
4989 size_t n_inputs = 0;
4990 asm_argument_t *argument = statement->inputs;
4991 for ( ; argument != NULL; argument = argument->next)
4993 size_t n_outputs = 0;
4994 argument = statement->outputs;
4995 for ( ; argument != NULL; argument = argument->next)
4998 unsigned next_pos = 0;
5000 ir_node *ins[n_inputs + n_outputs + 1];
5003 ir_asm_constraint tmp_in_constraints[n_outputs];
5005 const expression_t *out_exprs[n_outputs];
5006 ir_node *out_addrs[n_outputs];
5007 size_t out_size = 0;
5009 argument = statement->outputs;
5010 for ( ; argument != NULL; argument = argument->next) {
5011 const char *constraints = argument->constraints.begin;
5012 asm_constraint_flags_t asm_flags
5013 = be_parse_asm_constraints(constraints);
5016 source_position_t const *const pos = &statement->base.source_position;
5017 if (asm_flags & ASM_CONSTRAINT_FLAG_NO_SUPPORT) {
5018 warningf(WARN_OTHER, pos, "some constraints in '%s' are not supported", constraints);
5020 if (asm_flags & ASM_CONSTRAINT_FLAG_INVALID) {
5021 errorf(pos, "some constraints in '%s' are invalid", constraints);
5024 if (! (asm_flags & ASM_CONSTRAINT_FLAG_MODIFIER_WRITE)) {
5025 errorf(pos, "no write flag specified for output constraints '%s'", constraints);
5030 unsigned pos = next_pos++;
5031 if ( (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE)
5032 || (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER) ) {
5033 expression_t *expr = argument->expression;
5034 ir_node *addr = expression_to_addr(expr);
5035 /* in+output, construct an artifical same_as constraint on the
5037 if (asm_flags & ASM_CONSTRAINT_FLAG_MODIFIER_READ) {
5039 ir_node *value = get_value_from_lvalue(expr, addr);
5041 snprintf(buf, sizeof(buf), "%u", (unsigned) out_size);
5043 ir_asm_constraint constraint;
5044 constraint.pos = pos;
5045 constraint.constraint = new_id_from_str(buf);
5046 constraint.mode = get_ir_mode_storage(expr->base.type);
5047 tmp_in_constraints[in_size] = constraint;
5048 ins[in_size] = value;
5053 out_exprs[out_size] = expr;
5054 out_addrs[out_size] = addr;
5056 } else if (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP) {
5057 /* pure memory ops need no input (but we have to make sure we
5058 * attach to the memory) */
5059 assert(! (asm_flags &
5060 (ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE
5061 | ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER)));
5062 needs_memory = true;
5064 /* we need to attach the address to the inputs */
5065 expression_t *expr = argument->expression;
5067 ir_asm_constraint constraint;
5068 constraint.pos = pos;
5069 constraint.constraint = new_id_from_str(constraints);
5070 constraint.mode = mode_M;
5071 tmp_in_constraints[in_size] = constraint;
5073 ins[in_size] = expression_to_addr(expr);
5077 errorf(&statement->base.source_position,
5078 "only modifiers but no place set in constraints '%s'",
5083 ir_asm_constraint constraint;
5084 constraint.pos = pos;
5085 constraint.constraint = new_id_from_str(constraints);
5086 constraint.mode = get_ir_mode_storage(argument->expression->base.type);
5088 obstack_grow(&asm_obst, &constraint, sizeof(constraint));
5090 assert(obstack_object_size(&asm_obst)
5091 == out_size * sizeof(ir_asm_constraint));
5092 ir_asm_constraint *output_constraints = obstack_finish(&asm_obst);
5095 obstack_grow(&asm_obst, tmp_in_constraints,
5096 in_size * sizeof(tmp_in_constraints[0]));
5097 /* find and count input and output arguments */
5098 argument = statement->inputs;
5099 for ( ; argument != NULL; argument = argument->next) {
5100 const char *constraints = argument->constraints.begin;
5101 asm_constraint_flags_t asm_flags
5102 = be_parse_asm_constraints(constraints);
5104 if (asm_flags & ASM_CONSTRAINT_FLAG_NO_SUPPORT) {
5105 errorf(&statement->base.source_position,
5106 "some constraints in '%s' are not supported", constraints);
5109 if (asm_flags & ASM_CONSTRAINT_FLAG_INVALID) {
5110 errorf(&statement->base.source_position,
5111 "some constraints in '%s' are invalid", constraints);
5114 if (asm_flags & ASM_CONSTRAINT_FLAG_MODIFIER_WRITE) {
5115 errorf(&statement->base.source_position,
5116 "write flag specified for input constraints '%s'",
5122 if ( (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE)
5123 || (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER) ) {
5124 /* we can treat this as "normal" input */
5125 input = expression_to_firm(argument->expression);
5126 } else if (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP) {
5127 /* pure memory ops need no input (but we have to make sure we
5128 * attach to the memory) */
5129 assert(! (asm_flags &
5130 (ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE
5131 | ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER)));
5132 needs_memory = true;
5133 input = expression_to_addr(argument->expression);
5135 errorf(&statement->base.source_position,
5136 "only modifiers but no place set in constraints '%s'",
5141 ir_asm_constraint constraint;
5142 constraint.pos = next_pos++;
5143 constraint.constraint = new_id_from_str(constraints);
5144 constraint.mode = get_irn_mode(input);
5146 obstack_grow(&asm_obst, &constraint, sizeof(constraint));
5147 ins[in_size++] = input;
5151 ir_asm_constraint constraint;
5152 constraint.pos = next_pos++;
5153 constraint.constraint = new_id_from_str("");
5154 constraint.mode = mode_M;
5156 obstack_grow(&asm_obst, &constraint, sizeof(constraint));
5157 ins[in_size++] = get_store();
5160 assert(obstack_object_size(&asm_obst)
5161 == in_size * sizeof(ir_asm_constraint));
5162 ir_asm_constraint *input_constraints = obstack_finish(&asm_obst);
5164 /* create asm node */
5165 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
5167 ident *asm_text = new_id_from_str(statement->asm_text.begin);
5169 ir_node *node = new_d_ASM(dbgi, in_size, ins, input_constraints,
5170 out_size, output_constraints,
5171 n_clobbers, clobbers, asm_text);
5173 if (statement->is_volatile) {
5174 set_irn_pinned(node, op_pin_state_pinned);
5176 set_irn_pinned(node, op_pin_state_floats);
5179 /* create output projs & connect them */
5181 ir_node *projm = new_Proj(node, mode_M, out_size);
5186 for (i = 0; i < out_size; ++i) {
5187 const expression_t *out_expr = out_exprs[i];
5189 ir_mode *mode = get_ir_mode_storage(out_expr->base.type);
5190 ir_node *proj = new_Proj(node, mode, pn);
5191 ir_node *addr = out_addrs[i];
5193 set_value_for_expression_addr(out_expr, proj, addr);
5199 static ir_node *ms_try_statement_to_firm(ms_try_statement_t *statement)
5201 statement_to_firm(statement->try_statement);
5202 source_position_t const *const pos = &statement->base.source_position;
5203 warningf(WARN_OTHER, pos, "structured exception handling ignored");
5207 static ir_node *leave_statement_to_firm(leave_statement_t *statement)
5209 errorf(&statement->base.source_position, "__leave not supported yet");
5214 * Transform a statement.
5216 static ir_node *statement_to_firm(statement_t *const stmt)
5219 assert(!stmt->base.transformed);
5220 stmt->base.transformed = true;
5223 switch (stmt->kind) {
5224 case STATEMENT_ASM: return asm_statement_to_firm( &stmt->asms);
5225 case STATEMENT_CASE_LABEL: return case_label_to_firm( &stmt->case_label);
5226 case STATEMENT_COMPOUND: return compound_statement_to_firm( &stmt->compound);
5227 case STATEMENT_COMPUTED_GOTO: return computed_goto_to_firm( &stmt->computed_goto);
5228 case STATEMENT_DECLARATION: return declaration_statement_to_firm(&stmt->declaration);
5229 case STATEMENT_DO_WHILE: return do_while_statement_to_firm( &stmt->do_while);
5230 case STATEMENT_EMPTY: return NULL; /* nothing */
5231 case STATEMENT_EXPRESSION: return expression_statement_to_firm( &stmt->expression);
5232 case STATEMENT_FOR: return for_statement_to_firm( &stmt->fors);
5233 case STATEMENT_IF: return if_statement_to_firm( &stmt->ifs);
5234 case STATEMENT_LABEL: return label_to_firm( &stmt->label);
5235 case STATEMENT_LEAVE: return leave_statement_to_firm( &stmt->leave);
5236 case STATEMENT_MS_TRY: return ms_try_statement_to_firm( &stmt->ms_try);
5237 case STATEMENT_RETURN: return return_statement_to_firm( &stmt->returns);
5238 case STATEMENT_SWITCH: return switch_statement_to_firm( &stmt->switchs);
5239 case STATEMENT_WHILE: return while_statement_to_firm( &stmt->whiles);
5241 case STATEMENT_BREAK: return create_jump_statement(stmt, get_break_label());
5242 case STATEMENT_CONTINUE: return create_jump_statement(stmt, continue_label);
5243 case STATEMENT_GOTO: return create_jump_statement(stmt, get_label_block(stmt->gotos.label));
5245 case STATEMENT_ERROR: panic("error statement found");
5247 panic("statement not implemented");
5250 static int count_local_variables(const entity_t *entity,
5251 const entity_t *const last)
5254 entity_t const *const end = last != NULL ? last->base.next : NULL;
5255 for (; entity != end; entity = entity->base.next) {
5256 if ((entity->kind == ENTITY_VARIABLE || entity->kind == ENTITY_PARAMETER) &&
5257 !entity->variable.address_taken &&
5258 is_type_scalar(skip_typeref(entity->declaration.type)))
5264 static void count_local_variables_in_stmt(statement_t *stmt, void *const env)
5266 int *const count = env;
5268 switch (stmt->kind) {
5269 case STATEMENT_DECLARATION: {
5270 const declaration_statement_t *const decl_stmt = &stmt->declaration;
5271 *count += count_local_variables(decl_stmt->declarations_begin,
5272 decl_stmt->declarations_end);
5277 *count += count_local_variables(stmt->fors.scope.entities, NULL);
5286 * Return the number of local (alias free) variables used by a function.
5288 static int get_function_n_local_vars(entity_t *entity)
5290 const function_t *function = &entity->function;
5293 /* count parameters */
5294 count += count_local_variables(function->parameters.entities, NULL);
5296 /* count local variables declared in body */
5297 walk_statements(function->statement, count_local_variables_in_stmt, &count);
5302 * Build Firm code for the parameters of a function.
5304 static void initialize_function_parameters(entity_t *entity)
5306 assert(entity->kind == ENTITY_FUNCTION);
5307 ir_graph *irg = current_ir_graph;
5308 ir_node *args = get_irg_args(irg);
5310 ir_type *function_irtype;
5312 if (entity->function.need_closure) {
5313 /* add an extra parameter for the static link */
5314 entity->function.static_link = new_r_Proj(args, mode_P_data, 0);
5317 /* Matze: IMO this is wrong, nested functions should have an own
5318 * type and not rely on strange parameters... */
5319 function_irtype = create_method_type(&entity->declaration.type->function, true);
5321 function_irtype = get_ir_type(entity->declaration.type);
5326 entity_t *parameter = entity->function.parameters.entities;
5327 for ( ; parameter != NULL; parameter = parameter->base.next, ++n) {
5328 if (parameter->kind != ENTITY_PARAMETER)
5331 assert(parameter->declaration.kind == DECLARATION_KIND_UNKNOWN);
5332 type_t *type = skip_typeref(parameter->declaration.type);
5334 assert(!is_type_array(type));
5335 bool const needs_entity = parameter->variable.address_taken || is_type_compound(type);
5337 ir_type *param_irtype = get_method_param_type(function_irtype, n);
5339 ir_type *frame_type = get_irg_frame_type(irg);
5341 = new_parameter_entity(frame_type, n, param_irtype);
5342 parameter->declaration.kind = DECLARATION_KIND_PARAMETER_ENTITY;
5343 parameter->variable.v.entity = param;
5347 ir_mode *param_mode = get_type_mode(param_irtype);
5349 ir_node *value = new_r_Proj(args, param_mode, pn);
5351 ir_mode *mode = get_ir_mode_storage(type);
5352 value = create_conv(NULL, value, mode);
5353 value = do_strict_conv(NULL, value);
5355 parameter->declaration.kind = DECLARATION_KIND_PARAMETER;
5356 parameter->variable.v.value_number = next_value_number_function;
5357 set_irg_loc_description(current_ir_graph, next_value_number_function,
5359 ++next_value_number_function;
5361 set_value(parameter->variable.v.value_number, value);
5366 * Handle additional decl modifiers for IR-graphs
5368 * @param irg the IR-graph
5369 * @param dec_modifiers additional modifiers
5371 static void handle_decl_modifier_irg(ir_graph *irg,
5372 decl_modifiers_t decl_modifiers)
5374 if (decl_modifiers & DM_NAKED) {
5375 /* TRUE if the declaration includes the Microsoft
5376 __declspec(naked) specifier. */
5377 add_irg_additional_properties(irg, mtp_property_naked);
5379 if (decl_modifiers & DM_FORCEINLINE) {
5380 /* TRUE if the declaration includes the
5381 Microsoft __forceinline specifier. */
5382 set_irg_inline_property(irg, irg_inline_forced);
5384 if (decl_modifiers & DM_NOINLINE) {
5385 /* TRUE if the declaration includes the Microsoft
5386 __declspec(noinline) specifier. */
5387 set_irg_inline_property(irg, irg_inline_forbidden);
5391 static void add_function_pointer(ir_type *segment, ir_entity *method,
5392 const char *unique_template)
5394 ir_type *method_type = get_entity_type(method);
5395 ir_type *ptr_type = new_type_pointer(method_type);
5397 /* these entities don't really have a name but firm only allows
5399 * Note that we mustn't give these entities a name since for example
5400 * Mach-O doesn't allow them. */
5401 ident *ide = id_unique(unique_template);
5402 ir_entity *ptr = new_entity(segment, ide, ptr_type);
5403 ir_graph *irg = get_const_code_irg();
5404 ir_node *val = new_rd_SymConst_addr_ent(NULL, irg, mode_P_code,
5407 set_entity_ld_ident(ptr, new_id_from_chars("", 0));
5408 set_entity_compiler_generated(ptr, 1);
5409 set_entity_visibility(ptr, ir_visibility_private);
5410 add_entity_linkage(ptr, IR_LINKAGE_CONSTANT|IR_LINKAGE_HIDDEN_USER);
5411 set_atomic_ent_value(ptr, val);
5415 * Generate possible IJmp branches to a given label block.
5417 static void gen_ijmp_branches(ir_node *block)
5420 for (ijmp = ijmp_list; ijmp != NULL; ijmp = get_irn_link(ijmp)) {
5421 add_immBlock_pred(block, ijmp);
5426 * Create code for a function and all inner functions.
5428 * @param entity the function entity
5430 static void create_function(entity_t *entity)
5432 assert(entity->kind == ENTITY_FUNCTION);
5433 ir_entity *function_entity = get_function_entity(entity, current_outer_frame);
5435 if (entity->function.statement == NULL)
5438 inner_functions = NULL;
5439 current_trampolines = NULL;
5441 if (entity->declaration.modifiers & DM_CONSTRUCTOR) {
5442 ir_type *segment = get_segment_type(IR_SEGMENT_CONSTRUCTORS);
5443 add_function_pointer(segment, function_entity, "constructor_ptr.%u");
5445 if (entity->declaration.modifiers & DM_DESTRUCTOR) {
5446 ir_type *segment = get_segment_type(IR_SEGMENT_DESTRUCTORS);
5447 add_function_pointer(segment, function_entity, "destructor_ptr.%u");
5450 current_function_entity = entity;
5451 current_function_name = NULL;
5452 current_funcsig = NULL;
5454 assert(all_labels == NULL);
5455 all_labels = NEW_ARR_F(label_t *, 0);
5458 int n_local_vars = get_function_n_local_vars(entity);
5459 ir_graph *irg = new_ir_graph(function_entity, n_local_vars);
5460 current_ir_graph = irg;
5462 ir_graph *old_current_function = current_function;
5463 current_function = irg;
5465 ir_entity *const old_current_vararg_entity = current_vararg_entity;
5466 current_vararg_entity = NULL;
5468 set_irg_fp_model(irg, firm_fp_model);
5469 tarval_enable_fp_ops(1);
5470 set_irn_dbg_info(get_irg_start_block(irg),
5471 get_entity_dbg_info(function_entity));
5473 /* set inline flags */
5474 if (entity->function.is_inline)
5475 set_irg_inline_property(irg, irg_inline_recomended);
5476 handle_decl_modifier_irg(irg, entity->declaration.modifiers);
5478 next_value_number_function = 0;
5479 initialize_function_parameters(entity);
5480 current_static_link = entity->function.static_link;
5482 statement_to_firm(entity->function.statement);
5484 ir_node *end_block = get_irg_end_block(irg);
5486 /* do we have a return statement yet? */
5487 if (currently_reachable()) {
5488 type_t *type = skip_typeref(entity->declaration.type);
5489 assert(is_type_function(type));
5490 type_t *const return_type = skip_typeref(type->function.return_type);
5493 if (is_type_void(return_type)) {
5494 ret = new_Return(get_store(), 0, NULL);
5496 ir_mode *const mode = get_ir_mode_storage(return_type);
5499 /* ยง5.1.2.2.3 main implicitly returns 0 */
5500 if (is_main(entity)) {
5501 in[0] = new_Const(get_mode_null(mode));
5503 in[0] = new_Unknown(mode);
5505 ret = new_Return(get_store(), 1, in);
5507 add_immBlock_pred(end_block, ret);
5510 for (int i = ARR_LEN(all_labels) - 1; i >= 0; --i) {
5511 label_t *label = all_labels[i];
5512 if (label->address_taken) {
5513 gen_ijmp_branches(label->block);
5515 mature_immBlock(label->block);
5518 DEL_ARR_F(all_labels);
5521 irg_finalize_cons(irg);
5523 /* finalize the frame type */
5524 ir_type *frame_type = get_irg_frame_type(irg);
5525 int n = get_compound_n_members(frame_type);
5528 for (int i = 0; i < n; ++i) {
5529 ir_entity *member = get_compound_member(frame_type, i);
5530 ir_type *entity_type = get_entity_type(member);
5532 int align = get_type_alignment_bytes(entity_type);
5533 if (align > align_all)
5537 misalign = offset % align;
5539 offset += align - misalign;
5543 set_entity_offset(member, offset);
5544 offset += get_type_size_bytes(entity_type);
5546 set_type_size_bytes(frame_type, offset);
5547 set_type_alignment_bytes(frame_type, align_all);
5549 irg_verify(irg, VERIFY_ENFORCE_SSA);
5550 current_vararg_entity = old_current_vararg_entity;
5551 current_function = old_current_function;
5553 if (current_trampolines != NULL) {
5554 DEL_ARR_F(current_trampolines);
5555 current_trampolines = NULL;
5558 /* create inner functions if any */
5559 entity_t **inner = inner_functions;
5560 if (inner != NULL) {
5561 ir_type *rem_outer_frame = current_outer_frame;
5562 current_outer_frame = get_irg_frame_type(current_ir_graph);
5563 for (int i = ARR_LEN(inner) - 1; i >= 0; --i) {
5564 create_function(inner[i]);
5568 current_outer_frame = rem_outer_frame;
5572 static void scope_to_firm(scope_t *scope)
5574 /* first pass: create declarations */
5575 entity_t *entity = scope->entities;
5576 for ( ; entity != NULL; entity = entity->base.next) {
5577 if (entity->base.symbol == NULL)
5580 if (entity->kind == ENTITY_FUNCTION) {
5581 if (entity->function.btk != BUILTIN_NONE) {
5582 /* builtins have no representation */
5585 (void)get_function_entity(entity, NULL);
5586 } else if (entity->kind == ENTITY_VARIABLE) {
5587 create_global_variable(entity);
5588 } else if (entity->kind == ENTITY_NAMESPACE) {
5589 scope_to_firm(&entity->namespacee.members);
5593 /* second pass: create code/initializers */
5594 entity = scope->entities;
5595 for ( ; entity != NULL; entity = entity->base.next) {
5596 if (entity->base.symbol == NULL)
5599 if (entity->kind == ENTITY_FUNCTION) {
5600 if (entity->function.btk != BUILTIN_NONE) {
5601 /* builtins have no representation */
5604 create_function(entity);
5605 } else if (entity->kind == ENTITY_VARIABLE) {
5606 assert(entity->declaration.kind
5607 == DECLARATION_KIND_GLOBAL_VARIABLE);
5608 current_ir_graph = get_const_code_irg();
5609 create_variable_initializer(entity);
5614 void init_ast2firm(void)
5616 obstack_init(&asm_obst);
5617 init_atomic_modes();
5619 ir_set_debug_retrieve(dbg_retrieve);
5620 ir_set_type_debug_retrieve(dbg_print_type_dbg_info);
5622 /* create idents for all known runtime functions */
5623 for (size_t i = 0; i < lengthof(rts_data); ++i) {
5624 rts_idents[i] = new_id_from_str(rts_data[i].name);
5627 entitymap_init(&entitymap);
5630 static void init_ir_types(void)
5632 static int ir_types_initialized = 0;
5633 if (ir_types_initialized)
5635 ir_types_initialized = 1;
5637 ir_type_char = get_ir_type(type_char);
5638 ir_type_wchar_t = get_ir_type(type_wchar_t);
5640 be_params = be_get_backend_param();
5641 mode_float_arithmetic = be_params->mode_float_arithmetic;
5643 stack_param_align = be_params->stack_param_align;
5646 void exit_ast2firm(void)
5648 entitymap_destroy(&entitymap);
5649 obstack_free(&asm_obst, NULL);
5652 static void global_asm_to_firm(statement_t *s)
5654 for (; s != NULL; s = s->base.next) {
5655 assert(s->kind == STATEMENT_ASM);
5657 char const *const text = s->asms.asm_text.begin;
5658 size_t const size = s->asms.asm_text.size;
5659 ident *const id = new_id_from_chars(text, size);
5664 static const char *get_cwd(void)
5666 static char buf[1024];
5668 getcwd(buf, sizeof(buf));
5672 void translation_unit_to_firm(translation_unit_t *unit)
5674 if (c_mode & _CXX) {
5675 be_dwarf_set_source_language(DW_LANG_C_plus_plus);
5676 } else if (c_mode & _C99) {
5677 be_dwarf_set_source_language(DW_LANG_C99);
5678 } else if (c_mode & _C89) {
5679 be_dwarf_set_source_language(DW_LANG_C89);
5681 be_dwarf_set_source_language(DW_LANG_C);
5683 be_dwarf_set_compilation_directory(get_cwd());
5685 /* initialize firm arithmetic */
5686 tarval_set_integer_overflow_mode(TV_OVERFLOW_WRAP);
5687 ir_set_uninitialized_local_variable_func(uninitialized_local_var);
5689 /* just to be sure */
5690 continue_label = NULL;
5692 current_switch = NULL;
5693 current_translation_unit = unit;
5697 scope_to_firm(&unit->scope);
5698 global_asm_to_firm(unit->global_asm);
5700 current_ir_graph = NULL;
5701 current_translation_unit = NULL;