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_const_char;
67 static ir_type *ir_type_wchar_t;
69 /* architecture specific floating point arithmetic mode (if any) */
70 static ir_mode *mode_float_arithmetic;
72 /* alignment of stack parameters */
73 static unsigned stack_param_align;
75 static int next_value_number_function;
76 static ir_node *continue_label;
77 static ir_node *break_label;
78 static ir_node *current_switch;
79 static bool saw_default_label;
80 static label_t **all_labels;
81 static entity_t **inner_functions;
82 static ir_node *ijmp_list;
83 static bool constant_folding;
85 static const entity_t *current_function_entity;
86 static ir_node *current_function_name;
87 static ir_node *current_funcsig;
88 static ir_graph *current_function;
89 static translation_unit_t *current_translation_unit;
90 static trampoline_region *current_trampolines;
91 static ir_type *current_outer_frame;
92 static ir_node *current_static_link;
93 static ir_entity *current_vararg_entity;
95 static entitymap_t entitymap;
97 static struct obstack asm_obst;
99 typedef enum declaration_kind_t {
100 DECLARATION_KIND_UNKNOWN,
101 DECLARATION_KIND_VARIABLE_LENGTH_ARRAY,
102 DECLARATION_KIND_GLOBAL_VARIABLE,
103 DECLARATION_KIND_LOCAL_VARIABLE,
104 DECLARATION_KIND_LOCAL_VARIABLE_ENTITY,
105 DECLARATION_KIND_PARAMETER,
106 DECLARATION_KIND_PARAMETER_ENTITY,
107 DECLARATION_KIND_FUNCTION,
108 DECLARATION_KIND_COMPOUND_MEMBER,
109 DECLARATION_KIND_INNER_FUNCTION
110 } declaration_kind_t;
112 static ir_type *get_ir_type_incomplete(type_t *type);
114 static void enqueue_inner_function(entity_t *entity)
116 if (inner_functions == NULL)
117 inner_functions = NEW_ARR_F(entity_t *, 0);
118 ARR_APP1(entity_t*, inner_functions, entity);
121 static ir_node *uninitialized_local_var(ir_graph *irg, ir_mode *mode, int pos)
123 const entity_t *entity = get_irg_loc_description(irg, pos);
125 if (entity != NULL) {
126 source_position_t const *const pos = &entity->base.source_position;
127 warningf(WARN_UNINITIALIZED, pos, "'%N' might be used uninitialized", entity);
129 return new_r_Unknown(irg, mode);
132 static src_loc_t dbg_retrieve(const dbg_info *dbg)
134 source_position_t const *const pos = (source_position_t const*)dbg;
136 return (src_loc_t){ pos->input_name, pos->lineno, pos->colno };
138 return (src_loc_t){ NULL, 0, 0 };
142 static dbg_info *get_dbg_info(const source_position_t *pos)
144 return (dbg_info*) pos;
147 static void dbg_print_type_dbg_info(char *buffer, size_t buffer_size,
148 const type_dbg_info *dbg)
151 print_to_buffer(buffer, buffer_size);
152 const type_t *type = (const type_t*) dbg;
154 finish_print_to_buffer();
157 static type_dbg_info *get_type_dbg_info_(const type_t *type)
159 return (type_dbg_info*) type;
162 /* is the current block a reachable one? */
163 static bool currently_reachable(void)
165 ir_node *const block = get_cur_block();
166 return block != NULL && !is_Bad(block);
169 static void set_unreachable_now(void)
174 ir_mode *atomic_modes[ATOMIC_TYPE_LAST+1];
176 static ir_node *_expression_to_firm(const expression_t *expression);
177 static ir_node *expression_to_firm(const expression_t *expression);
179 static unsigned decide_modulo_shift(unsigned type_size)
181 if (architecture_modulo_shift == 0)
183 if (type_size < architecture_modulo_shift)
184 return architecture_modulo_shift;
188 static ir_mode *init_atomic_ir_mode(atomic_type_kind_t kind)
190 unsigned flags = get_atomic_type_flags(kind);
191 unsigned size = get_atomic_type_size(kind);
192 if ((flags & ATOMIC_TYPE_FLAG_FLOAT)
193 && !(flags & ATOMIC_TYPE_FLAG_COMPLEX)) {
196 } else if (size == 8) {
199 panic("unexpected kind");
201 } else if (flags & ATOMIC_TYPE_FLAG_INTEGER) {
203 unsigned bit_size = size * 8;
204 bool is_signed = (flags & ATOMIC_TYPE_FLAG_SIGNED) != 0;
205 unsigned modulo_shift = decide_modulo_shift(bit_size);
207 snprintf(name, sizeof(name), "%s%u", is_signed ? "I" : "U", bit_size);
208 return new_int_mode(name, irma_twos_complement, bit_size, is_signed,
216 * Initialises the atomic modes depending on the machine size.
218 static void init_atomic_modes(void)
220 atomic_modes[ATOMIC_TYPE_VOID] = mode_ANY;
221 for (int i = 0; i <= ATOMIC_TYPE_LAST; ++i) {
222 if (atomic_modes[i] != NULL)
224 atomic_modes[i] = init_atomic_ir_mode((atomic_type_kind_t) i);
228 ir_mode *get_atomic_mode(atomic_type_kind_t kind)
230 assert(kind <= ATOMIC_TYPE_LAST);
231 return atomic_modes[kind];
234 static ir_node *get_vla_size(array_type_t *const type)
236 ir_node *size_node = type->size_node;
237 if (size_node == NULL) {
238 size_node = expression_to_firm(type->size_expression);
239 type->size_node = size_node;
244 static unsigned count_parameters(const function_type_t *function_type)
248 function_parameter_t *parameter = function_type->parameters;
249 for ( ; parameter != NULL; parameter = parameter->next) {
257 * Creates a Firm type for an atomic type
259 static ir_type *create_atomic_type(atomic_type_kind_t akind, const type_t *type)
261 ir_mode *mode = atomic_modes[akind];
262 type_dbg_info *dbgi = get_type_dbg_info_(type);
263 ir_type *irtype = new_d_type_primitive(mode, dbgi);
264 il_alignment_t alignment = get_atomic_type_alignment(akind);
266 set_type_size_bytes(irtype, get_atomic_type_size(akind));
267 set_type_alignment_bytes(irtype, alignment);
273 * Creates a Firm type for a complex type
275 static ir_type *create_complex_type(const atomic_type_t *type)
277 atomic_type_kind_t kind = type->akind;
278 ir_mode *mode = atomic_modes[kind];
279 ident *id = get_mode_ident(mode);
283 /* FIXME: finish the array */
288 * Creates a Firm type for an imaginary type
290 static ir_type *create_imaginary_type(const atomic_type_t *type)
292 return create_atomic_type(type->akind, (const type_t*)type);
296 * return type of a parameter (and take transparent union gnu extension into
299 static type_t *get_parameter_type(type_t *orig_type)
301 type_t *type = skip_typeref(orig_type);
302 if (is_type_union(type)
303 && get_type_modifiers(orig_type) & DM_TRANSPARENT_UNION) {
304 compound_t *compound = type->compound.compound;
305 type = compound->members.entities->declaration.type;
311 static ir_type *create_method_type(const function_type_t *function_type, bool for_closure)
313 type_t *return_type = skip_typeref(function_type->return_type);
315 int n_parameters = count_parameters(function_type)
316 + (for_closure ? 1 : 0);
317 int n_results = is_type_void(return_type) ? 0 : 1;
318 type_dbg_info *dbgi = get_type_dbg_info_((const type_t*) function_type);
319 ir_type *irtype = new_d_type_method(n_parameters, n_results, dbgi);
321 if (!is_type_void(return_type)) {
322 ir_type *restype = get_ir_type(return_type);
323 set_method_res_type(irtype, 0, restype);
326 function_parameter_t *parameter = function_type->parameters;
329 ir_type *p_irtype = get_ir_type(type_void_ptr);
330 set_method_param_type(irtype, n, p_irtype);
333 for ( ; parameter != NULL; parameter = parameter->next) {
334 type_t *type = get_parameter_type(parameter->type);
335 ir_type *p_irtype = get_ir_type(type);
336 set_method_param_type(irtype, n, p_irtype);
340 bool is_variadic = function_type->variadic;
343 set_method_variadicity(irtype, variadicity_variadic);
345 unsigned cc = get_method_calling_convention(irtype);
346 switch (function_type->calling_convention) {
347 case CC_DEFAULT: /* unspecified calling convention, equal to one of the other, typically cdecl */
350 set_method_calling_convention(irtype, SET_CDECL(cc));
357 /* only non-variadic function can use stdcall, else use cdecl */
358 set_method_calling_convention(irtype, SET_STDCALL(cc));
364 /* only non-variadic function can use fastcall, else use cdecl */
365 set_method_calling_convention(irtype, SET_FASTCALL(cc));
369 /* Hmm, leave default, not accepted by the parser yet. */
374 set_method_calling_convention(irtype, get_method_calling_convention(irtype) | cc_this_call);
376 const decl_modifiers_t modifiers = function_type->modifiers;
377 if (modifiers & DM_CONST)
378 add_method_additional_properties(irtype, mtp_property_const);
379 if (modifiers & DM_PURE)
380 add_method_additional_properties(irtype, mtp_property_pure);
381 if (modifiers & DM_RETURNS_TWICE)
382 add_method_additional_properties(irtype, mtp_property_returns_twice);
383 if (modifiers & DM_NORETURN)
384 add_method_additional_properties(irtype, mtp_property_noreturn);
385 if (modifiers & DM_NOTHROW)
386 add_method_additional_properties(irtype, mtp_property_nothrow);
387 if (modifiers & DM_MALLOC)
388 add_method_additional_properties(irtype, mtp_property_malloc);
393 static ir_type *create_pointer_type(pointer_type_t *type)
395 type_dbg_info *dbgi = get_type_dbg_info_((const type_t*) type);
396 type_t *points_to = type->points_to;
397 ir_type *ir_points_to = get_ir_type_incomplete(points_to);
398 ir_type *irtype = new_d_type_pointer(ir_points_to, dbgi);
403 static ir_type *create_reference_type(reference_type_t *type)
405 type_dbg_info *dbgi = get_type_dbg_info_((const type_t*) type);
406 type_t *refers_to = type->refers_to;
407 ir_type *ir_refers_to = get_ir_type_incomplete(refers_to);
408 ir_type *irtype = new_d_type_pointer(ir_refers_to, dbgi);
413 static ir_type *create_array_type(array_type_t *type)
415 type_dbg_info *dbgi = get_type_dbg_info_((const type_t*) type);
416 type_t *element_type = type->element_type;
417 ir_type *ir_element_type = get_ir_type(element_type);
418 ir_type *irtype = new_d_type_array(1, ir_element_type, dbgi);
420 const int align = get_type_alignment_bytes(ir_element_type);
421 set_type_alignment_bytes(irtype, align);
423 if (type->size_constant) {
424 int n_elements = type->size;
426 set_array_bounds_int(irtype, 0, 0, n_elements);
428 size_t elemsize = get_type_size_bytes(ir_element_type);
429 if (elemsize % align > 0) {
430 elemsize += align - (elemsize % align);
432 set_type_size_bytes(irtype, n_elements * elemsize);
434 set_array_lower_bound_int(irtype, 0, 0);
436 set_type_state(irtype, layout_fixed);
442 * Return the signed integer type of size bits.
444 * @param size the size
446 static ir_type *get_signed_int_type_for_bit_size(ir_type *base_tp,
450 static ir_mode *s_modes[64 + 1] = {NULL, };
454 if (size <= 0 || size > 64)
457 mode = s_modes[size];
461 snprintf(name, sizeof(name), "bf_I%u", size);
462 mode = new_int_mode(name, irma_twos_complement, size, 1, 0);
463 s_modes[size] = mode;
466 type_dbg_info *dbgi = get_type_dbg_info_(type);
467 res = new_d_type_primitive(mode, dbgi);
468 set_primitive_base_type(res, base_tp);
474 * Return the unsigned integer type of size bits.
476 * @param size the size
478 static ir_type *get_unsigned_int_type_for_bit_size(ir_type *base_tp,
482 static ir_mode *u_modes[64 + 1] = {NULL, };
486 if (size <= 0 || size > 64)
489 mode = u_modes[size];
493 snprintf(name, sizeof(name), "bf_U%u", size);
494 mode = new_int_mode(name, irma_twos_complement, size, 0, 0);
495 u_modes[size] = mode;
498 type_dbg_info *dbgi = get_type_dbg_info_(type);
499 res = new_d_type_primitive(mode, dbgi);
500 set_primitive_base_type(res, base_tp);
505 static ir_type *create_bitfield_type(const entity_t *entity)
507 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
508 type_t *base = skip_typeref(entity->declaration.type);
509 assert(base->kind == TYPE_ATOMIC || base->kind == TYPE_ENUM);
510 ir_type *irbase = get_ir_type(base);
512 unsigned bit_size = entity->compound_member.bit_size;
514 assert(!is_type_float(base));
515 if (is_type_signed(base)) {
516 return get_signed_int_type_for_bit_size(irbase, bit_size, base);
518 return get_unsigned_int_type_for_bit_size(irbase, bit_size, base);
523 * Construct firm type from ast struct type.
525 static ir_type *create_compound_type(compound_type_t *const type, bool const incomplete)
527 compound_t *compound = type->compound;
529 if (compound->irtype != NULL && (compound->irtype_complete || incomplete)) {
530 return compound->irtype;
533 bool const is_union = type->base.kind == TYPE_COMPOUND_UNION;
535 symbol_t *type_symbol = compound->base.symbol;
537 if (type_symbol != NULL) {
538 id = new_id_from_str(type_symbol->string);
541 id = id_unique("__anonymous_union.%u");
543 id = id_unique("__anonymous_struct.%u");
549 irtype = new_type_union(id);
551 irtype = new_type_struct(id);
554 compound->irtype_complete = false;
555 compound->irtype = irtype;
561 layout_union_type(type);
563 layout_struct_type(type);
566 compound->irtype_complete = true;
568 entity_t *entry = compound->members.entities;
569 for ( ; entry != NULL; entry = entry->base.next) {
570 if (entry->kind != ENTITY_COMPOUND_MEMBER)
573 symbol_t *symbol = entry->base.symbol;
574 type_t *entry_type = entry->declaration.type;
576 if (symbol == NULL) {
577 /* anonymous bitfield member, skip */
578 if (entry->compound_member.bitfield)
580 assert(entry_type->kind == TYPE_COMPOUND_STRUCT
581 || entry_type->kind == TYPE_COMPOUND_UNION);
582 ident = id_unique("anon.%u");
584 ident = new_id_from_str(symbol->string);
587 dbg_info *dbgi = get_dbg_info(&entry->base.source_position);
589 ir_type *entry_irtype;
590 if (entry->compound_member.bitfield) {
591 entry_irtype = create_bitfield_type(entry);
593 entry_irtype = get_ir_type(entry_type);
595 ir_entity *entity = new_d_entity(irtype, ident, entry_irtype, dbgi);
597 set_entity_offset(entity, entry->compound_member.offset);
598 set_entity_offset_bits_remainder(entity,
599 entry->compound_member.bit_offset);
601 assert(entry->declaration.kind == DECLARATION_KIND_UNKNOWN);
602 entry->declaration.kind = DECLARATION_KIND_COMPOUND_MEMBER;
603 entry->compound_member.entity = entity;
606 set_type_alignment_bytes(irtype, compound->alignment);
607 set_type_size_bytes(irtype, compound->size);
608 set_type_state(irtype, layout_fixed);
613 static ir_tarval *fold_constant_to_tarval(expression_t const *);
615 static void determine_enum_values(enum_type_t *const type)
617 ir_mode *const mode = atomic_modes[type->base.akind];
618 ir_tarval *const one = get_mode_one(mode);
619 ir_tarval * tv_next = get_mode_null(mode);
621 enum_t *enume = type->enume;
622 entity_t *entry = enume->base.next;
623 for (; entry != NULL; entry = entry->base.next) {
624 if (entry->kind != ENTITY_ENUM_VALUE)
627 expression_t *const init = entry->enum_value.value;
629 tv_next = fold_constant_to_tarval(init);
631 assert(entry->enum_value.tv == NULL || entry->enum_value.tv == tv_next);
632 entry->enum_value.tv = tv_next;
633 tv_next = tarval_add(tv_next, one);
637 static ir_type *create_enum_type(enum_type_t *const type)
639 return create_atomic_type(type->base.akind, (const type_t*) type);
642 static ir_type *get_ir_type_incomplete(type_t *type)
644 assert(type != NULL);
645 type = skip_typeref(type);
647 if (type->base.firm_type != NULL) {
648 return type->base.firm_type;
651 if (is_type_compound(type)) {
652 return create_compound_type(&type->compound, true);
654 return get_ir_type(type);
658 ir_type *get_ir_type(type_t *type)
660 assert(type != NULL);
662 type = skip_typeref(type);
664 if (type->base.firm_type != NULL) {
665 return type->base.firm_type;
668 ir_type *firm_type = NULL;
669 switch (type->kind) {
671 firm_type = create_atomic_type(type->atomic.akind, type);
674 firm_type = create_complex_type(&type->atomic);
677 firm_type = create_imaginary_type(&type->atomic);
680 firm_type = create_method_type(&type->function, false);
683 firm_type = create_pointer_type(&type->pointer);
686 firm_type = create_reference_type(&type->reference);
689 firm_type = create_array_type(&type->array);
691 case TYPE_COMPOUND_STRUCT:
692 case TYPE_COMPOUND_UNION:
693 firm_type = create_compound_type(&type->compound, false);
696 firm_type = create_enum_type(&type->enumt);
704 if (firm_type == NULL)
705 panic("unknown type found");
707 type->base.firm_type = firm_type;
711 static ir_mode *get_ir_mode_storage(type_t *type)
713 type = skip_typeref(type);
715 /* Firm doesn't report a mode for arrays and structs/unions. */
716 if (!is_type_scalar(type)) {
720 ir_type *const irtype = get_ir_type(type);
721 ir_mode *const mode = get_type_mode(irtype);
722 assert(mode != NULL);
727 * get arithmetic mode for a type. This is different from get_ir_mode_storage,
728 * int that it returns bigger modes for floating point on some platforms
729 * (x87 internally does arithemtic with 80bits)
731 static ir_mode *get_ir_mode_arithmetic(type_t *type)
733 ir_mode *mode = get_ir_mode_storage(type);
734 if (mode_is_float(mode) && mode_float_arithmetic != NULL) {
735 return mode_float_arithmetic;
742 * Return a node representing the size of a type.
744 static ir_node *get_type_size_node(type_t *type)
747 ir_mode *mode = get_ir_mode_arithmetic(type_size_t);
748 type = skip_typeref(type);
750 if (is_type_array(type) && type->array.is_vla) {
751 ir_node *size_node = get_vla_size(&type->array);
752 ir_node *elem_size = get_type_size_node(type->array.element_type);
753 ir_node *real_size = new_d_Mul(NULL, size_node, elem_size, mode);
757 size = get_type_size(type);
758 return new_Const_long(mode, size);
761 /** Names of the runtime functions. */
762 static const struct {
763 int id; /**< the rts id */
764 int n_res; /**< number of return values */
765 const char *name; /**< the name of the rts function */
766 int n_params; /**< number of parameters */
767 unsigned flags; /**< language flags */
769 { rts_debugbreak, 0, "__debugbreak", 0, _MS },
770 { rts_abort, 0, "abort", 0, _C89 },
771 { rts_alloca, 1, "alloca", 1, _ALL },
772 { rts_abs, 1, "abs", 1, _C89 },
773 { rts_labs, 1, "labs", 1, _C89 },
774 { rts_llabs, 1, "llabs", 1, _C99 },
775 { rts_imaxabs, 1, "imaxabs", 1, _C99 },
777 { rts_fabs, 1, "fabs", 1, _C89 },
778 { rts_sqrt, 1, "sqrt", 1, _C89 },
779 { rts_cbrt, 1, "cbrt", 1, _C99 },
780 { rts_exp, 1, "exp", 1, _C89 },
781 { rts_exp2, 1, "exp2", 1, _C89 },
782 { rts_exp10, 1, "exp10", 1, _GNUC },
783 { rts_log, 1, "log", 1, _C89 },
784 { rts_log2, 1, "log2", 1, _C89 },
785 { rts_log10, 1, "log10", 1, _C89 },
786 { rts_pow, 1, "pow", 2, _C89 },
787 { rts_sin, 1, "sin", 1, _C89 },
788 { rts_cos, 1, "cos", 1, _C89 },
789 { rts_tan, 1, "tan", 1, _C89 },
790 { rts_asin, 1, "asin", 1, _C89 },
791 { rts_acos, 1, "acos", 1, _C89 },
792 { rts_atan, 1, "atan", 1, _C89 },
793 { rts_sinh, 1, "sinh", 1, _C89 },
794 { rts_cosh, 1, "cosh", 1, _C89 },
795 { rts_tanh, 1, "tanh", 1, _C89 },
797 { rts_fabsf, 1, "fabsf", 1, _C99 },
798 { rts_sqrtf, 1, "sqrtf", 1, _C99 },
799 { rts_cbrtf, 1, "cbrtf", 1, _C99 },
800 { rts_expf, 1, "expf", 1, _C99 },
801 { rts_exp2f, 1, "exp2f", 1, _C99 },
802 { rts_exp10f, 1, "exp10f", 1, _GNUC },
803 { rts_logf, 1, "logf", 1, _C99 },
804 { rts_log2f, 1, "log2f", 1, _C99 },
805 { rts_log10f, 1, "log10f", 1, _C99 },
806 { rts_powf, 1, "powf", 2, _C99 },
807 { rts_sinf, 1, "sinf", 1, _C99 },
808 { rts_cosf, 1, "cosf", 1, _C99 },
809 { rts_tanf, 1, "tanf", 1, _C99 },
810 { rts_asinf, 1, "asinf", 1, _C99 },
811 { rts_acosf, 1, "acosf", 1, _C99 },
812 { rts_atanf, 1, "atanf", 1, _C99 },
813 { rts_sinhf, 1, "sinhf", 1, _C99 },
814 { rts_coshf, 1, "coshf", 1, _C99 },
815 { rts_tanhf, 1, "tanhf", 1, _C99 },
817 { rts_fabsl, 1, "fabsl", 1, _C99 },
818 { rts_sqrtl, 1, "sqrtl", 1, _C99 },
819 { rts_cbrtl, 1, "cbrtl", 1, _C99 },
820 { rts_expl, 1, "expl", 1, _C99 },
821 { rts_exp2l, 1, "exp2l", 1, _C99 },
822 { rts_exp10l, 1, "exp10l", 1, _GNUC },
823 { rts_logl, 1, "logl", 1, _C99 },
824 { rts_log2l, 1, "log2l", 1, _C99 },
825 { rts_log10l, 1, "log10l", 1, _C99 },
826 { rts_powl, 1, "powl", 2, _C99 },
827 { rts_sinl, 1, "sinl", 1, _C99 },
828 { rts_cosl, 1, "cosl", 1, _C99 },
829 { rts_tanl, 1, "tanl", 1, _C99 },
830 { rts_asinl, 1, "asinl", 1, _C99 },
831 { rts_acosl, 1, "acosl", 1, _C99 },
832 { rts_atanl, 1, "atanl", 1, _C99 },
833 { rts_sinhl, 1, "sinhl", 1, _C99 },
834 { rts_coshl, 1, "coshl", 1, _C99 },
835 { rts_tanhl, 1, "tanhl", 1, _C99 },
837 { rts_strcmp, 1, "strcmp", 2, _C89 },
838 { rts_strncmp, 1, "strncmp", 3, _C89 },
839 { rts_strcpy, 1, "strcpy", 2, _C89 },
840 { rts_strlen, 1, "strlen", 1, _C89 },
841 { rts_memcpy, 1, "memcpy", 3, _C89 },
842 { rts_mempcpy, 1, "mempcpy", 3, _GNUC },
843 { rts_memmove, 1, "memmove", 3, _C89 },
844 { rts_memset, 1, "memset", 3, _C89 },
845 { rts_memcmp, 1, "memcmp", 3, _C89 },
848 static ident *rts_idents[lengthof(rts_data)];
850 static create_ld_ident_func create_ld_ident = create_name_linux_elf;
852 void set_create_ld_ident(ident *(*func)(entity_t*))
854 create_ld_ident = func;
858 * Handle GNU attributes for entities
860 * @param ent the entity
861 * @param decl the routine declaration
863 static void handle_decl_modifiers(ir_entity *irentity, entity_t *entity)
865 assert(is_declaration(entity));
866 decl_modifiers_t modifiers = entity->declaration.modifiers;
868 if (is_method_entity(irentity)) {
869 if (modifiers & DM_PURE) {
870 set_entity_additional_properties(irentity, mtp_property_pure);
872 if (modifiers & DM_CONST) {
873 add_entity_additional_properties(irentity, mtp_property_const);
876 if (modifiers & DM_USED) {
877 add_entity_linkage(irentity, IR_LINKAGE_HIDDEN_USER);
879 if (modifiers & DM_WEAK) {
880 add_entity_linkage(irentity, IR_LINKAGE_WEAK);
884 static bool is_main(entity_t *entity)
886 static symbol_t *sym_main = NULL;
887 if (sym_main == NULL) {
888 sym_main = symbol_table_insert("main");
891 if (entity->base.symbol != sym_main)
893 /* must be in outermost scope */
894 if (entity->base.parent_scope != ¤t_translation_unit->scope)
901 * Creates an entity representing a function.
903 * @param entity the function declaration/definition
904 * @param owner_type the owner type of this function, NULL
905 * for global functions
907 static ir_entity *get_function_entity(entity_t *entity, ir_type *owner_type)
909 assert(entity->kind == ENTITY_FUNCTION);
910 if (entity->function.irentity != NULL)
911 return entity->function.irentity;
913 switch (entity->function.btk) {
916 case BUILTIN_LIBC_CHECK:
922 if (is_main(entity)) {
923 /* force main to C linkage */
924 type_t *type = entity->declaration.type;
925 assert(is_type_function(type));
926 if (type->function.linkage != LINKAGE_C) {
927 type_t *new_type = duplicate_type(type);
928 new_type->function.linkage = LINKAGE_C;
929 type = identify_new_type(new_type);
930 entity->declaration.type = type;
934 symbol_t *symbol = entity->base.symbol;
935 ident *id = new_id_from_str(symbol->string);
937 /* already an entity defined? */
938 ir_entity *irentity = entitymap_get(&entitymap, symbol);
939 bool const has_body = entity->function.statement != NULL;
940 if (irentity != NULL) {
941 if (get_entity_visibility(irentity) == ir_visibility_external
943 set_entity_visibility(irentity, ir_visibility_default);
948 ir_type *ir_type_method;
949 if (entity->function.need_closure)
950 ir_type_method = create_method_type(&entity->declaration.type->function, true);
952 ir_type_method = get_ir_type(entity->declaration.type);
954 bool nested_function = false;
955 if (owner_type == NULL)
956 owner_type = get_glob_type();
958 nested_function = true;
960 dbg_info *const dbgi = get_dbg_info(&entity->base.source_position);
961 irentity = new_d_entity(owner_type, id, ir_type_method, dbgi);
965 ld_id = id_unique("inner.%u");
967 ld_id = create_ld_ident(entity);
968 set_entity_ld_ident(irentity, ld_id);
970 handle_decl_modifiers(irentity, entity);
972 if (! nested_function) {
973 /* static inline => local
974 * extern inline => local
975 * inline without definition => local
976 * inline with definition => external_visible */
977 storage_class_tag_t const storage_class
978 = (storage_class_tag_t) entity->declaration.storage_class;
979 bool const is_inline = entity->function.is_inline;
981 if (is_inline && storage_class == STORAGE_CLASS_NONE && has_body) {
982 set_entity_visibility(irentity, ir_visibility_default);
983 } else if (storage_class == STORAGE_CLASS_STATIC ||
984 (is_inline && has_body)) {
985 set_entity_visibility(irentity, ir_visibility_local);
986 } else if (has_body) {
987 set_entity_visibility(irentity, ir_visibility_default);
989 set_entity_visibility(irentity, ir_visibility_external);
992 /* nested functions are always local */
993 set_entity_visibility(irentity, ir_visibility_local);
996 /* We should check for file scope here, but as long as we compile C only
997 this is not needed. */
998 if (!freestanding && !has_body) {
999 /* check for a known runtime function */
1000 for (size_t i = 0; i < lengthof(rts_data); ++i) {
1001 if (id != rts_idents[i])
1004 function_type_t *function_type
1005 = &entity->declaration.type->function;
1006 /* rts_entities code can't handle a "wrong" number of parameters */
1007 if (function_type->unspecified_parameters)
1010 /* check number of parameters */
1011 int n_params = count_parameters(function_type);
1012 if (n_params != rts_data[i].n_params)
1015 type_t *return_type = skip_typeref(function_type->return_type);
1016 int n_res = is_type_void(return_type) ? 0 : 1;
1017 if (n_res != rts_data[i].n_res)
1020 /* ignore those rts functions not necessary needed for current mode */
1021 if ((c_mode & rts_data[i].flags) == 0)
1023 assert(rts_entities[rts_data[i].id] == NULL);
1024 rts_entities[rts_data[i].id] = irentity;
1028 entitymap_insert(&entitymap, symbol, irentity);
1031 entity->declaration.kind = DECLARATION_KIND_FUNCTION;
1032 entity->function.irentity = irentity;
1038 * Creates a SymConst for a given entity.
1040 * @param dbgi debug info
1041 * @param entity the entity
1043 static ir_node *create_symconst(dbg_info *dbgi, ir_entity *entity)
1045 assert(entity != NULL);
1046 union symconst_symbol sym;
1047 sym.entity_p = entity;
1048 return new_d_SymConst(dbgi, mode_P, sym, symconst_addr_ent);
1051 static ir_node *create_Const_from_bool(ir_mode *const mode, bool const v)
1053 return new_Const((v ? get_mode_one : get_mode_null)(mode));
1056 static ir_node *create_conv_from_b(dbg_info *dbgi, ir_node *value,
1059 if (is_Const(value)) {
1060 return create_Const_from_bool(dest_mode, !is_Const_null(value));
1063 ir_node *cond = new_d_Cond(dbgi, value);
1064 ir_node *proj_true = new_Proj(cond, mode_X, pn_Cond_true);
1065 ir_node *proj_false = new_Proj(cond, mode_X, pn_Cond_false);
1066 ir_node *tblock = new_Block(1, &proj_true);
1067 ir_node *fblock = new_Block(1, &proj_false);
1068 set_cur_block(tblock);
1069 ir_node *const1 = new_Const(get_mode_one(dest_mode));
1070 ir_node *tjump = new_Jmp();
1071 set_cur_block(fblock);
1072 ir_node *const0 = new_Const(get_mode_null(dest_mode));
1073 ir_node *fjump = new_Jmp();
1075 ir_node *in[2] = { tjump, fjump };
1076 ir_node *mergeblock = new_Block(2, in);
1077 set_cur_block(mergeblock);
1078 ir_node *phi_in[2] = { const1, const0 };
1079 ir_node *phi = new_Phi(2, phi_in, dest_mode);
1083 static ir_node *create_conv(dbg_info *dbgi, ir_node *value, ir_mode *dest_mode)
1085 ir_mode *value_mode = get_irn_mode(value);
1087 if (value_mode == dest_mode)
1090 if (dest_mode == mode_b) {
1091 ir_node *zero = new_Const(get_mode_null(value_mode));
1092 ir_node *cmp = new_d_Cmp(dbgi, value, zero, ir_relation_unordered_less_greater);
1094 } else if (value_mode == mode_b) {
1095 return create_conv_from_b(dbgi, value, dest_mode);
1098 return new_d_Conv(dbgi, value, dest_mode);
1102 * Creates a SymConst node representing a wide string literal.
1104 * @param literal the wide string literal
1106 static ir_node *wide_string_literal_to_firm(
1107 const string_literal_expression_t *literal)
1109 ir_type *const global_type = get_glob_type();
1110 ir_type *const elem_type = ir_type_wchar_t;
1111 dbg_info *const dbgi = get_dbg_info(&literal->base.source_position);
1112 ir_type *const type = new_type_array(1, elem_type);
1114 ident *const id = id_unique("str.%u");
1115 ir_entity *const entity = new_d_entity(global_type, id, type, dbgi);
1116 set_entity_ld_ident(entity, id);
1117 set_entity_visibility(entity, ir_visibility_private);
1118 add_entity_linkage(entity, IR_LINKAGE_CONSTANT);
1120 ir_mode *const mode = get_type_mode(elem_type);
1121 const size_t slen = wstrlen(&literal->value);
1123 set_array_lower_bound_int(type, 0, 0);
1124 set_array_upper_bound_int(type, 0, slen);
1125 set_type_size_bytes(type, slen * get_mode_size_bytes(mode));
1126 set_type_state(type, layout_fixed);
1128 ir_initializer_t *initializer = create_initializer_compound(slen);
1129 const char *p = literal->value.begin;
1130 for (size_t i = 0; i < slen; ++i) {
1131 assert(p < literal->value.begin + literal->value.size);
1132 utf32 v = read_utf8_char(&p);
1133 ir_tarval *tv = new_tarval_from_long(v, mode);
1134 ir_initializer_t *val = create_initializer_tarval(tv);
1135 set_initializer_compound_value(initializer, i, val);
1137 set_entity_initializer(entity, initializer);
1139 return create_symconst(dbgi, entity);
1143 * Creates a SymConst node representing a string constant.
1145 * @param src_pos the source position of the string constant
1146 * @param id_prefix a prefix for the name of the generated string constant
1147 * @param value the value of the string constant
1149 static ir_node *string_to_firm(const source_position_t *const src_pos,
1150 const char *const id_prefix,
1151 const string_t *const value)
1153 ir_type *const global_type = get_glob_type();
1154 dbg_info *const dbgi = get_dbg_info(src_pos);
1155 ir_type *const type = new_type_array(1, ir_type_const_char);
1157 ident *const id = id_unique(id_prefix);
1158 ir_entity *const entity = new_d_entity(global_type, id, type, dbgi);
1159 set_entity_ld_ident(entity, id);
1160 set_entity_visibility(entity, ir_visibility_private);
1161 add_entity_linkage(entity, IR_LINKAGE_CONSTANT);
1163 ir_type *const elem_type = ir_type_const_char;
1164 ir_mode *const mode = get_type_mode(elem_type);
1166 const char* const string = value->begin;
1167 const size_t slen = value->size;
1169 set_array_lower_bound_int(type, 0, 0);
1170 set_array_upper_bound_int(type, 0, slen);
1171 set_type_size_bytes(type, slen);
1172 set_type_state(type, layout_fixed);
1174 ir_initializer_t *initializer = create_initializer_compound(slen);
1175 for (size_t i = 0; i < slen; ++i) {
1176 ir_tarval *tv = new_tarval_from_long(string[i], mode);
1177 ir_initializer_t *val = create_initializer_tarval(tv);
1178 set_initializer_compound_value(initializer, i, val);
1180 set_entity_initializer(entity, initializer);
1182 return create_symconst(dbgi, entity);
1185 static bool try_create_integer(literal_expression_t *literal,
1186 type_t *type, unsigned char base)
1188 const char *string = literal->value.begin;
1189 size_t size = literal->value.size;
1191 assert(type->kind == TYPE_ATOMIC);
1192 atomic_type_kind_t akind = type->atomic.akind;
1194 ir_mode *mode = atomic_modes[akind];
1195 ir_tarval *tv = new_integer_tarval_from_str(string, size, 1, base, mode);
1196 if (tv == tarval_bad)
1199 literal->base.type = type;
1200 literal->target_value = tv;
1204 static void create_integer_tarval(literal_expression_t *literal)
1208 const string_t *suffix = &literal->suffix;
1210 if (suffix->size > 0) {
1211 for (const char *c = suffix->begin; *c != '\0'; ++c) {
1212 if (*c == 'u' || *c == 'U') { ++us; }
1213 if (*c == 'l' || *c == 'L') { ++ls; }
1218 switch (literal->base.kind) {
1219 case EXPR_LITERAL_INTEGER_OCTAL: base = 8; break;
1220 case EXPR_LITERAL_INTEGER: base = 10; break;
1221 case EXPR_LITERAL_INTEGER_HEXADECIMAL: base = 16; break;
1222 default: panic("invalid literal kind");
1225 tarval_int_overflow_mode_t old_mode = tarval_get_integer_overflow_mode();
1227 /* now try if the constant is small enough for some types */
1228 tarval_set_integer_overflow_mode(TV_OVERFLOW_BAD);
1230 if (us == 0 && try_create_integer(literal, type_int, base))
1232 if ((us == 1 || base != 10)
1233 && try_create_integer(literal, type_unsigned_int, base))
1237 if (us == 0 && try_create_integer(literal, type_long, base))
1239 if ((us == 1 || base != 10)
1240 && try_create_integer(literal, type_unsigned_long, base))
1243 /* last try? then we should not report tarval_bad */
1244 if (us != 1 && base == 10)
1245 tarval_set_integer_overflow_mode(TV_OVERFLOW_WRAP);
1246 if (us == 0 && try_create_integer(literal, type_long_long, base))
1250 assert(us == 1 || base != 10);
1251 tarval_set_integer_overflow_mode(TV_OVERFLOW_WRAP);
1252 bool res = try_create_integer(literal, type_unsigned_long_long, base);
1254 panic("internal error when parsing number literal");
1257 tarval_set_integer_overflow_mode(old_mode);
1260 void determine_literal_type(literal_expression_t *literal)
1262 switch (literal->base.kind) {
1263 case EXPR_LITERAL_INTEGER:
1264 case EXPR_LITERAL_INTEGER_OCTAL:
1265 case EXPR_LITERAL_INTEGER_HEXADECIMAL:
1266 create_integer_tarval(literal);
1274 * Creates a Const node representing a constant.
1276 static ir_node *literal_to_firm(const literal_expression_t *literal)
1278 type_t *type = skip_typeref(literal->base.type);
1279 ir_mode *mode = get_ir_mode_storage(type);
1280 const char *string = literal->value.begin;
1281 size_t size = literal->value.size;
1284 switch (literal->base.kind) {
1285 case EXPR_LITERAL_WIDE_CHARACTER: {
1286 utf32 v = read_utf8_char(&string);
1288 size_t len = snprintf(buf, sizeof(buf), UTF32_PRINTF_FORMAT, v);
1290 tv = new_tarval_from_str(buf, len, mode);
1294 case EXPR_LITERAL_CHARACTER: {
1297 = get_atomic_type_flags(ATOMIC_TYPE_CHAR) & ATOMIC_TYPE_FLAG_SIGNED;
1298 if (size == 1 && char_is_signed) {
1299 v = (signed char)string[0];
1302 for (size_t i = 0; i < size; ++i) {
1303 v = (v << 8) | ((unsigned char)string[i]);
1307 size_t len = snprintf(buf, sizeof(buf), "%lld", v);
1309 tv = new_tarval_from_str(buf, len, mode);
1313 case EXPR_LITERAL_INTEGER:
1314 case EXPR_LITERAL_INTEGER_OCTAL:
1315 case EXPR_LITERAL_INTEGER_HEXADECIMAL:
1316 assert(literal->target_value != NULL);
1317 tv = literal->target_value;
1320 case EXPR_LITERAL_FLOATINGPOINT:
1321 tv = new_tarval_from_str(string, size, mode);
1324 case EXPR_LITERAL_FLOATINGPOINT_HEXADECIMAL: {
1325 char buffer[size + 2];
1326 memcpy(buffer, "0x", 2);
1327 memcpy(buffer+2, string, size);
1328 tv = new_tarval_from_str(buffer, size+2, mode);
1332 case EXPR_LITERAL_BOOLEAN:
1333 if (string[0] == 't') {
1334 tv = get_mode_one(mode);
1336 assert(string[0] == 'f');
1337 case EXPR_LITERAL_MS_NOOP:
1338 tv = get_mode_null(mode);
1343 panic("Invalid literal kind found");
1346 dbg_info *dbgi = get_dbg_info(&literal->base.source_position);
1347 ir_node *res = new_d_Const(dbgi, tv);
1348 ir_mode *mode_arith = get_ir_mode_arithmetic(type);
1349 return create_conv(dbgi, res, mode_arith);
1353 * Allocate an area of size bytes aligned at alignment
1356 static ir_entity *alloc_trampoline(ir_type *frame_type, int size, unsigned alignment)
1358 static unsigned area_cnt = 0;
1361 ir_type *tp = new_type_array(1, ir_type_char);
1362 set_array_bounds_int(tp, 0, 0, size);
1363 set_type_alignment_bytes(tp, alignment);
1365 snprintf(buf, sizeof(buf), "trampolin%u", area_cnt++);
1366 ident *name = new_id_from_str(buf);
1367 ir_entity *area = new_entity(frame_type, name, tp);
1369 /* mark this entity as compiler generated */
1370 set_entity_compiler_generated(area, 1);
1375 * Return a node representing a trampoline region
1376 * for a given function entity.
1378 * @param dbgi debug info
1379 * @param entity the function entity
1381 static ir_node *get_trampoline_region(dbg_info *dbgi, ir_entity *entity)
1383 ir_entity *region = NULL;
1386 if (current_trampolines != NULL) {
1387 for (i = ARR_LEN(current_trampolines) - 1; i >= 0; --i) {
1388 if (current_trampolines[i].function == entity) {
1389 region = current_trampolines[i].region;
1394 current_trampolines = NEW_ARR_F(trampoline_region, 0);
1396 ir_graph *irg = current_ir_graph;
1397 if (region == NULL) {
1398 /* create a new region */
1399 ir_type *frame_tp = get_irg_frame_type(irg);
1400 trampoline_region reg;
1401 reg.function = entity;
1403 reg.region = alloc_trampoline(frame_tp,
1404 be_params->trampoline_size,
1405 be_params->trampoline_align);
1406 ARR_APP1(trampoline_region, current_trampolines, reg);
1407 region = reg.region;
1409 return new_d_simpleSel(dbgi, get_irg_no_mem(irg), get_irg_frame(irg),
1414 * Creates a trampoline for a function represented by an entity.
1416 * @param dbgi debug info
1417 * @param mode the (reference) mode for the function address
1418 * @param entity the function entity
1420 static ir_node *create_trampoline(dbg_info *dbgi, ir_mode *mode,
1423 assert(entity != NULL);
1425 in[0] = get_trampoline_region(dbgi, entity);
1426 in[1] = create_symconst(dbgi, entity);
1427 in[2] = get_irg_frame(current_ir_graph);
1429 ir_node *irn = new_d_Builtin(dbgi, get_store(), 3, in, ir_bk_inner_trampoline, get_unknown_type());
1430 set_store(new_Proj(irn, mode_M, pn_Builtin_M));
1431 return new_Proj(irn, mode, pn_Builtin_max+1);
1435 * Dereference an address.
1437 * @param dbgi debug info
1438 * @param type the type of the dereferenced result (the points_to type)
1439 * @param addr the address to dereference
1441 static ir_node *deref_address(dbg_info *const dbgi, type_t *const type,
1442 ir_node *const addr)
1444 type_t *skipped = skip_typeref(type);
1445 if (is_type_incomplete(skipped))
1448 ir_type *irtype = get_ir_type(skipped);
1449 if (is_compound_type(irtype)
1450 || is_Method_type(irtype)
1451 || is_Array_type(irtype)) {
1455 ir_cons_flags flags = skipped->base.qualifiers & TYPE_QUALIFIER_VOLATILE
1456 ? cons_volatile : cons_none;
1457 ir_mode *const mode = get_type_mode(irtype);
1458 ir_node *const memory = get_store();
1459 ir_node *const load = new_d_Load(dbgi, memory, addr, mode, flags);
1460 ir_node *const load_mem = new_d_Proj(dbgi, load, mode_M, pn_Load_M);
1461 ir_node *const load_res = new_d_Proj(dbgi, load, mode, pn_Load_res);
1463 set_store(load_mem);
1465 ir_mode *const mode_arithmetic = get_ir_mode_arithmetic(skipped);
1466 return create_conv(dbgi, load_res, mode_arithmetic);
1470 * Creates a strict Conv (to the node's mode) if necessary.
1472 * @param dbgi debug info
1473 * @param node the node to strict conv
1475 static ir_node *do_strict_conv(dbg_info *dbgi, ir_node *node)
1477 ir_mode *mode = get_irn_mode(node);
1479 if (!(get_irg_fp_model(current_ir_graph) & fp_explicit_rounding))
1481 if (!mode_is_float(mode))
1484 /* check if there is already a Conv */
1485 if (is_Conv(node)) {
1486 /* convert it into a strict Conv */
1487 set_Conv_strict(node, 1);
1491 /* otherwise create a new one */
1492 return new_d_strictConv(dbgi, node, mode);
1496 * Returns the correct base address depending on whether it is a parameter or a
1497 * normal local variable.
1499 static ir_node *get_local_frame(ir_entity *const ent)
1501 ir_graph *const irg = current_ir_graph;
1502 const ir_type *const owner = get_entity_owner(ent);
1503 if (owner == current_outer_frame) {
1504 assert(current_static_link != NULL);
1505 return current_static_link;
1507 return get_irg_frame(irg);
1512 * Keep all memory edges of the given block.
1514 static void keep_all_memory(ir_node *block)
1516 ir_node *old = get_cur_block();
1518 set_cur_block(block);
1519 keep_alive(get_store());
1520 /* TODO: keep all memory edges from restricted pointers */
1524 static ir_node *enum_constant_to_firm(reference_expression_t const *const ref)
1526 entity_t *entity = ref->entity;
1527 if (entity->enum_value.tv == NULL) {
1528 type_t *type = skip_typeref(entity->enum_value.enum_type);
1529 assert(type->kind == TYPE_ENUM);
1530 determine_enum_values(&type->enumt);
1533 return new_Const(entity->enum_value.tv);
1536 static ir_node *reference_expression_to_firm(const reference_expression_t *ref)
1538 dbg_info *dbgi = get_dbg_info(&ref->base.source_position);
1539 entity_t *entity = ref->entity;
1540 assert(is_declaration(entity));
1541 type_t *type = skip_typeref(entity->declaration.type);
1543 /* make sure the type is constructed */
1544 (void) get_ir_type(type);
1546 if (entity->kind == ENTITY_FUNCTION
1547 && entity->function.btk != BUILTIN_NONE) {
1548 ir_entity *irentity = get_function_entity(entity, NULL);
1549 /* for gcc compatibility we have to produce (dummy) addresses for some
1550 * builtins which don't have entities */
1551 if (irentity == NULL) {
1552 source_position_t const *const pos = &ref->base.source_position;
1553 symbol_t const *const sym = ref->entity->base.symbol;
1554 warningf(WARN_OTHER, pos, "taking address of builtin '%Y'", sym);
1556 /* simply create a NULL pointer */
1557 ir_mode *mode = get_ir_mode_arithmetic(type_void_ptr);
1558 ir_node *res = new_Const(get_mode_null(mode));
1564 switch ((declaration_kind_t) entity->declaration.kind) {
1565 case DECLARATION_KIND_UNKNOWN:
1568 case DECLARATION_KIND_LOCAL_VARIABLE: {
1569 ir_mode *const mode = get_ir_mode_storage(type);
1570 ir_node *const value = get_value(entity->variable.v.value_number, mode);
1571 return create_conv(NULL, value, get_ir_mode_arithmetic(type));
1573 case DECLARATION_KIND_PARAMETER: {
1574 ir_mode *const mode = get_ir_mode_storage(type);
1575 ir_node *const value = get_value(entity->parameter.v.value_number,mode);
1576 return create_conv(NULL, value, get_ir_mode_arithmetic(type));
1578 case DECLARATION_KIND_FUNCTION: {
1579 return create_symconst(dbgi, entity->function.irentity);
1581 case DECLARATION_KIND_INNER_FUNCTION: {
1582 ir_mode *const mode = get_ir_mode_storage(type);
1583 if (!entity->function.goto_to_outer && !entity->function.need_closure) {
1584 /* inner function not using the closure */
1585 return create_symconst(dbgi, entity->function.irentity);
1587 /* need trampoline here */
1588 return create_trampoline(dbgi, mode, entity->function.irentity);
1591 case DECLARATION_KIND_GLOBAL_VARIABLE: {
1592 const variable_t *variable = &entity->variable;
1593 ir_node *const addr = create_symconst(dbgi, variable->v.entity);
1594 return deref_address(dbgi, variable->base.type, addr);
1597 case DECLARATION_KIND_LOCAL_VARIABLE_ENTITY: {
1598 ir_entity *irentity = entity->variable.v.entity;
1599 ir_node *frame = get_local_frame(irentity);
1600 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, irentity);
1601 return deref_address(dbgi, entity->declaration.type, sel);
1603 case DECLARATION_KIND_PARAMETER_ENTITY: {
1604 ir_entity *irentity = entity->parameter.v.entity;
1605 ir_node *frame = get_local_frame(irentity);
1606 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, irentity);
1607 return deref_address(dbgi, entity->declaration.type, sel);
1610 case DECLARATION_KIND_VARIABLE_LENGTH_ARRAY:
1611 return entity->variable.v.vla_base;
1613 case DECLARATION_KIND_COMPOUND_MEMBER:
1614 panic("not implemented reference type");
1617 panic("reference to declaration with unknown type found");
1620 static ir_node *reference_addr(const reference_expression_t *ref)
1622 dbg_info *dbgi = get_dbg_info(&ref->base.source_position);
1623 entity_t *entity = ref->entity;
1624 assert(is_declaration(entity));
1626 switch((declaration_kind_t) entity->declaration.kind) {
1627 case DECLARATION_KIND_UNKNOWN:
1629 case DECLARATION_KIND_PARAMETER:
1630 case DECLARATION_KIND_LOCAL_VARIABLE:
1631 /* you can store to a local variable (so we don't panic but return NULL
1632 * as an indicator for no real address) */
1634 case DECLARATION_KIND_GLOBAL_VARIABLE: {
1635 ir_node *const addr = create_symconst(dbgi, entity->variable.v.entity);
1638 case DECLARATION_KIND_LOCAL_VARIABLE_ENTITY: {
1639 ir_entity *irentity = entity->variable.v.entity;
1640 ir_node *frame = get_local_frame(irentity);
1641 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, irentity);
1645 case DECLARATION_KIND_PARAMETER_ENTITY: {
1646 ir_entity *irentity = entity->parameter.v.entity;
1647 ir_node *frame = get_local_frame(irentity);
1648 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, irentity);
1653 case DECLARATION_KIND_VARIABLE_LENGTH_ARRAY:
1654 return entity->variable.v.vla_base;
1656 case DECLARATION_KIND_FUNCTION: {
1657 return create_symconst(dbgi, entity->function.irentity);
1660 case DECLARATION_KIND_INNER_FUNCTION: {
1661 type_t *const type = skip_typeref(entity->declaration.type);
1662 ir_mode *const mode = get_ir_mode_storage(type);
1663 if (!entity->function.goto_to_outer && !entity->function.need_closure) {
1664 /* inner function not using the closure */
1665 return create_symconst(dbgi, entity->function.irentity);
1667 /* need trampoline here */
1668 return create_trampoline(dbgi, mode, entity->function.irentity);
1672 case DECLARATION_KIND_COMPOUND_MEMBER:
1673 panic("not implemented reference type");
1676 panic("reference to declaration with unknown type found");
1680 * Transform calls to builtin functions.
1682 static ir_node *process_builtin_call(const call_expression_t *call)
1684 dbg_info *dbgi = get_dbg_info(&call->base.source_position);
1686 assert(call->function->kind == EXPR_REFERENCE);
1687 reference_expression_t *builtin = &call->function->reference;
1689 type_t *expr_type = skip_typeref(builtin->base.type);
1690 assert(is_type_pointer(expr_type));
1692 type_t *function_type = skip_typeref(expr_type->pointer.points_to);
1694 switch (builtin->entity->function.btk) {
1697 case BUILTIN_ALLOCA: {
1698 expression_t *argument = call->arguments->expression;
1699 ir_node *size = expression_to_firm(argument);
1701 ir_node *store = get_store();
1702 ir_node *alloca = new_d_Alloc(dbgi, store, size, get_unknown_type(),
1704 ir_node *proj_m = new_Proj(alloca, mode_M, pn_Alloc_M);
1706 ir_node *res = new_Proj(alloca, mode_P_data, pn_Alloc_res);
1711 type_t *type = function_type->function.return_type;
1712 ir_mode *mode = get_ir_mode_arithmetic(type);
1713 ir_tarval *tv = get_mode_infinite(mode);
1714 ir_node *res = new_d_Const(dbgi, tv);
1718 /* Ignore string for now... */
1719 assert(is_type_function(function_type));
1720 type_t *type = function_type->function.return_type;
1721 ir_mode *mode = get_ir_mode_arithmetic(type);
1722 ir_tarval *tv = get_mode_NAN(mode);
1723 ir_node *res = new_d_Const(dbgi, tv);
1726 case BUILTIN_EXPECT: {
1727 expression_t *argument = call->arguments->expression;
1728 return _expression_to_firm(argument);
1730 case BUILTIN_VA_END:
1731 /* evaluate the argument of va_end for its side effects */
1732 _expression_to_firm(call->arguments->expression);
1734 case BUILTIN_OBJECT_SIZE: {
1735 /* determine value of "type" */
1736 expression_t *type_expression = call->arguments->next->expression;
1737 long type_val = fold_constant_to_int(type_expression);
1738 type_t *type = function_type->function.return_type;
1739 ir_mode *mode = get_ir_mode_arithmetic(type);
1740 /* just produce a "I don't know" result */
1741 ir_tarval *result = type_val & 2 ? get_mode_null(mode) :
1742 get_mode_minus_one(mode);
1744 return new_d_Const(dbgi, result);
1746 case BUILTIN_ROTL: {
1747 ir_node *val = expression_to_firm(call->arguments->expression);
1748 ir_node *shf = expression_to_firm(call->arguments->next->expression);
1749 ir_mode *mode = get_irn_mode(val);
1750 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
1751 return new_d_Rotl(dbgi, val, create_conv(dbgi, shf, mode_uint), mode);
1753 case BUILTIN_ROTR: {
1754 ir_node *val = expression_to_firm(call->arguments->expression);
1755 ir_node *shf = expression_to_firm(call->arguments->next->expression);
1756 ir_mode *mode = get_irn_mode(val);
1757 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
1758 ir_node *c = new_Const_long(mode_uint, get_mode_size_bits(mode));
1759 ir_node *sub = new_d_Sub(dbgi, c, create_conv(dbgi, shf, mode_uint), mode_uint);
1760 return new_d_Rotl(dbgi, val, sub, mode);
1765 case BUILTIN_LIBC_CHECK:
1766 panic("builtin did not produce an entity");
1768 panic("invalid builtin found");
1772 * Transform a call expression.
1773 * Handles some special cases, like alloca() calls, which must be resolved
1774 * BEFORE the inlines runs. Inlining routines calling alloca() is dangerous,
1775 * 176.gcc for instance might allocate 2GB instead of 256 MB if alloca is not
1778 static ir_node *call_expression_to_firm(const call_expression_t *const call)
1780 dbg_info *const dbgi = get_dbg_info(&call->base.source_position);
1781 assert(currently_reachable());
1783 expression_t *function = call->function;
1784 ir_node *callee = NULL;
1785 bool firm_builtin = false;
1786 ir_builtin_kind firm_builtin_kind = ir_bk_trap;
1787 if (function->kind == EXPR_REFERENCE) {
1788 const reference_expression_t *ref = &function->reference;
1789 entity_t *entity = ref->entity;
1791 if (entity->kind == ENTITY_FUNCTION) {
1792 builtin_kind_t builtin = entity->function.btk;
1793 if (builtin == BUILTIN_FIRM) {
1794 firm_builtin = true;
1795 firm_builtin_kind = entity->function.b.firm_builtin_kind;
1796 } else if (builtin != BUILTIN_NONE && builtin != BUILTIN_LIBC
1797 && builtin != BUILTIN_LIBC_CHECK) {
1798 return process_builtin_call(call);
1803 callee = expression_to_firm(function);
1805 type_t *type = skip_typeref(function->base.type);
1806 assert(is_type_pointer(type));
1807 pointer_type_t *pointer_type = &type->pointer;
1808 type_t *points_to = skip_typeref(pointer_type->points_to);
1809 assert(is_type_function(points_to));
1810 function_type_t *function_type = &points_to->function;
1812 int n_parameters = 0;
1813 ir_type *ir_method_type = get_ir_type((type_t*) function_type);
1814 ir_type *new_method_type = NULL;
1815 if (function_type->variadic || function_type->unspecified_parameters) {
1816 const call_argument_t *argument = call->arguments;
1817 for ( ; argument != NULL; argument = argument->next) {
1821 /* we need to construct a new method type matching the call
1823 type_dbg_info *tdbgi = get_type_dbg_info_((const type_t*) function_type);
1824 int n_res = get_method_n_ress(ir_method_type);
1825 new_method_type = new_d_type_method(n_parameters, n_res, tdbgi);
1826 set_method_calling_convention(new_method_type,
1827 get_method_calling_convention(ir_method_type));
1828 set_method_additional_properties(new_method_type,
1829 get_method_additional_properties(ir_method_type));
1830 set_method_variadicity(new_method_type,
1831 get_method_variadicity(ir_method_type));
1833 for (int i = 0; i < n_res; ++i) {
1834 set_method_res_type(new_method_type, i,
1835 get_method_res_type(ir_method_type, i));
1837 argument = call->arguments;
1838 for (int i = 0; i < n_parameters; ++i, argument = argument->next) {
1839 expression_t *expression = argument->expression;
1840 ir_type *irtype = get_ir_type(expression->base.type);
1841 set_method_param_type(new_method_type, i, irtype);
1843 ir_method_type = new_method_type;
1845 n_parameters = get_method_n_params(ir_method_type);
1848 ir_node *in[n_parameters];
1850 const call_argument_t *argument = call->arguments;
1851 for (int n = 0; n < n_parameters; ++n) {
1852 expression_t *expression = argument->expression;
1853 ir_node *arg_node = expression_to_firm(expression);
1855 type_t *arg_type = skip_typeref(expression->base.type);
1856 if (!is_type_compound(arg_type)) {
1857 ir_mode *const mode = get_ir_mode_storage(arg_type);
1858 arg_node = create_conv(dbgi, arg_node, mode);
1859 arg_node = do_strict_conv(dbgi, arg_node);
1864 argument = argument->next;
1868 if (function_type->modifiers & DM_CONST) {
1869 store = get_irg_no_mem(current_ir_graph);
1871 store = get_store();
1875 type_t *return_type = skip_typeref(function_type->return_type);
1876 ir_node *result = NULL;
1878 node = new_d_Builtin(dbgi, store, n_parameters, in, firm_builtin_kind,
1880 if (! (function_type->modifiers & DM_CONST)) {
1881 ir_node *mem = new_Proj(node, mode_M, pn_Builtin_M);
1885 if (!is_type_void(return_type)) {
1886 assert(is_type_scalar(return_type));
1887 ir_mode *mode = get_ir_mode_storage(return_type);
1888 result = new_Proj(node, mode, pn_Builtin_max+1);
1889 ir_mode *mode_arith = get_ir_mode_arithmetic(return_type);
1890 result = create_conv(NULL, result, mode_arith);
1893 node = new_d_Call(dbgi, store, callee, n_parameters, in, ir_method_type);
1894 if (! (function_type->modifiers & DM_CONST)) {
1895 ir_node *mem = new_Proj(node, mode_M, pn_Call_M);
1899 if (!is_type_void(return_type)) {
1900 ir_node *const resproj = new_Proj(node, mode_T, pn_Call_T_result);
1901 ir_mode *const mode = get_ir_mode_storage(return_type);
1902 result = new_Proj(resproj, mode, 0);
1903 ir_mode *const mode_arith = get_ir_mode_arithmetic(return_type);
1904 result = create_conv(NULL, result, mode_arith);
1908 if (function_type->modifiers & DM_NORETURN) {
1909 /* A dead end: Keep the Call and the Block. Also place all further
1910 * nodes into a new and unreachable block. */
1912 keep_alive(get_cur_block());
1913 ir_node *block = new_Block(0, NULL);
1914 set_cur_block(block);
1920 static ir_node *statement_to_firm(statement_t *statement);
1921 static ir_node *compound_statement_to_firm(compound_statement_t *compound);
1923 static ir_node *expression_to_addr(const expression_t *expression);
1924 static ir_node *create_condition_evaluation(const expression_t *expression,
1925 ir_node *true_block,
1926 ir_node *false_block);
1928 static void assign_value(dbg_info *dbgi, ir_node *addr, type_t *type,
1931 if (!is_type_compound(type)) {
1932 ir_mode *mode = get_ir_mode_storage(type);
1933 value = create_conv(dbgi, value, mode);
1934 value = do_strict_conv(dbgi, value);
1937 ir_node *memory = get_store();
1939 if (is_type_scalar(type)) {
1940 ir_cons_flags flags = type->base.qualifiers & TYPE_QUALIFIER_VOLATILE
1941 ? cons_volatile : cons_none;
1942 ir_node *store = new_d_Store(dbgi, memory, addr, value, flags);
1943 ir_node *store_mem = new_d_Proj(dbgi, store, mode_M, pn_Store_M);
1944 set_store(store_mem);
1946 ir_type *irtype = get_ir_type(type);
1947 ir_node *copyb = new_d_CopyB(dbgi, memory, addr, value, irtype);
1948 ir_node *copyb_mem = new_Proj(copyb, mode_M, pn_CopyB_M);
1949 set_store(copyb_mem);
1953 static ir_tarval *create_bitfield_mask(ir_mode *mode, int offset, int size)
1955 ir_tarval *all_one = get_mode_all_one(mode);
1956 int mode_size = get_mode_size_bits(mode);
1957 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
1959 assert(offset >= 0);
1961 assert(offset + size <= mode_size);
1962 if (size == mode_size) {
1966 long shiftr = get_mode_size_bits(mode) - size;
1967 long shiftl = offset;
1968 ir_tarval *tv_shiftr = new_tarval_from_long(shiftr, mode_uint);
1969 ir_tarval *tv_shiftl = new_tarval_from_long(shiftl, mode_uint);
1970 ir_tarval *mask0 = tarval_shr(all_one, tv_shiftr);
1971 ir_tarval *mask1 = tarval_shl(mask0, tv_shiftl);
1976 static ir_node *bitfield_store_to_firm(dbg_info *dbgi,
1977 ir_entity *entity, ir_node *addr, ir_node *value, bool set_volatile,
1980 ir_type *entity_type = get_entity_type(entity);
1981 ir_type *base_type = get_primitive_base_type(entity_type);
1982 ir_mode *mode = get_type_mode(base_type);
1983 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
1985 value = create_conv(dbgi, value, mode);
1987 /* kill upper bits of value and shift to right position */
1988 unsigned bitoffset = get_entity_offset_bits_remainder(entity);
1989 unsigned bitsize = get_mode_size_bits(get_type_mode(entity_type));
1990 unsigned base_bits = get_mode_size_bits(mode);
1991 unsigned shiftwidth = base_bits - bitsize;
1993 ir_node *shiftcount = new_Const_long(mode_uint, shiftwidth);
1994 ir_node *shiftl = new_d_Shl(dbgi, value, shiftcount, mode);
1996 unsigned shrwidth = base_bits - bitsize - bitoffset;
1997 ir_node *shrconst = new_Const_long(mode_uint, shrwidth);
1998 ir_node *shiftr = new_d_Shr(dbgi, shiftl, shrconst, mode);
2000 /* load current value */
2001 ir_node *mem = get_store();
2002 ir_node *load = new_d_Load(dbgi, mem, addr, mode,
2003 set_volatile ? cons_volatile : cons_none);
2004 ir_node *load_mem = new_d_Proj(dbgi, load, mode_M, pn_Load_M);
2005 ir_node *load_res = new_d_Proj(dbgi, load, mode, pn_Load_res);
2006 ir_tarval *shift_mask = create_bitfield_mask(mode, bitoffset, bitsize);
2007 ir_tarval *inv_mask = tarval_not(shift_mask);
2008 ir_node *inv_mask_node = new_d_Const(dbgi, inv_mask);
2009 ir_node *load_res_masked = new_d_And(dbgi, load_res, inv_mask_node, mode);
2011 /* construct new value and store */
2012 ir_node *new_val = new_d_Or(dbgi, load_res_masked, shiftr, mode);
2013 ir_node *store = new_d_Store(dbgi, load_mem, addr, new_val,
2014 set_volatile ? cons_volatile : cons_none);
2015 ir_node *store_mem = new_d_Proj(dbgi, store, mode_M, pn_Store_M);
2016 set_store(store_mem);
2022 ir_node *count_res_shr = new_Const_long(mode_uint, base_bits - bitsize);
2023 if (mode_is_signed(mode)) {
2024 res_shr = new_d_Shrs(dbgi, shiftl, count_res_shr, mode);
2026 res_shr = new_d_Shr(dbgi, shiftl, count_res_shr, mode);
2031 static ir_node *bitfield_extract_to_firm(const select_expression_t *expression,
2034 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2035 entity_t *entity = expression->compound_entry;
2036 type_t *base_type = entity->declaration.type;
2037 ir_mode *mode = get_ir_mode_storage(base_type);
2038 ir_node *mem = get_store();
2039 ir_node *load = new_d_Load(dbgi, mem, addr, mode, cons_none);
2040 ir_node *load_mem = new_d_Proj(dbgi, load, mode_M, pn_Load_M);
2041 ir_node *load_res = new_d_Proj(dbgi, load, mode, pn_Load_res);
2042 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
2044 ir_mode *amode = mode;
2045 /* optimisation, since shifting in modes < machine_size is usually
2047 if (get_mode_size_bits(amode) < get_mode_size_bits(mode_uint)) {
2050 unsigned amode_size = get_mode_size_bits(amode);
2051 load_res = create_conv(dbgi, load_res, amode);
2053 set_store(load_mem);
2055 /* kill upper bits */
2056 assert(expression->compound_entry->kind == ENTITY_COMPOUND_MEMBER);
2057 unsigned bitoffset = entity->compound_member.bit_offset;
2058 unsigned bitsize = entity->compound_member.bit_size;
2059 unsigned shift_bitsl = amode_size - bitoffset - bitsize;
2060 ir_tarval *tvl = new_tarval_from_long((long)shift_bitsl, mode_uint);
2061 ir_node *countl = new_d_Const(dbgi, tvl);
2062 ir_node *shiftl = new_d_Shl(dbgi, load_res, countl, amode);
2064 unsigned shift_bitsr = bitoffset + shift_bitsl;
2065 assert(shift_bitsr <= amode_size);
2066 ir_tarval *tvr = new_tarval_from_long((long)shift_bitsr, mode_uint);
2067 ir_node *countr = new_d_Const(dbgi, tvr);
2069 if (mode_is_signed(mode)) {
2070 shiftr = new_d_Shrs(dbgi, shiftl, countr, amode);
2072 shiftr = new_d_Shr(dbgi, shiftl, countr, amode);
2075 type_t *type = expression->base.type;
2076 ir_mode *resmode = get_ir_mode_arithmetic(type);
2077 return create_conv(dbgi, shiftr, resmode);
2080 /* make sure the selected compound type is constructed */
2081 static void construct_select_compound(const select_expression_t *expression)
2083 type_t *type = skip_typeref(expression->compound->base.type);
2084 if (is_type_pointer(type)) {
2085 type = type->pointer.points_to;
2087 (void) get_ir_type(type);
2090 static ir_node *set_value_for_expression_addr(const expression_t *expression,
2091 ir_node *value, ir_node *addr)
2093 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2094 type_t *type = skip_typeref(expression->base.type);
2096 if (!is_type_compound(type)) {
2097 ir_mode *mode = get_ir_mode_storage(type);
2098 value = create_conv(dbgi, value, mode);
2099 value = do_strict_conv(dbgi, value);
2102 if (expression->kind == EXPR_REFERENCE) {
2103 const reference_expression_t *ref = &expression->reference;
2105 entity_t *entity = ref->entity;
2106 assert(is_declaration(entity));
2107 assert(entity->declaration.kind != DECLARATION_KIND_UNKNOWN);
2108 if (entity->declaration.kind == DECLARATION_KIND_LOCAL_VARIABLE) {
2109 set_value(entity->variable.v.value_number, value);
2111 } else if (entity->declaration.kind == DECLARATION_KIND_PARAMETER) {
2112 set_value(entity->parameter.v.value_number, value);
2118 addr = expression_to_addr(expression);
2119 assert(addr != NULL);
2121 if (expression->kind == EXPR_SELECT) {
2122 const select_expression_t *select = &expression->select;
2124 construct_select_compound(select);
2126 entity_t *entity = select->compound_entry;
2127 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
2128 if (entity->compound_member.bitfield) {
2129 ir_entity *irentity = entity->compound_member.entity;
2131 = select->base.type->base.qualifiers & TYPE_QUALIFIER_VOLATILE;
2132 value = bitfield_store_to_firm(dbgi, irentity, addr, value,
2133 set_volatile, true);
2138 assign_value(dbgi, addr, type, value);
2142 static void set_value_for_expression(const expression_t *expression,
2145 set_value_for_expression_addr(expression, value, NULL);
2148 static ir_node *get_value_from_lvalue(const expression_t *expression,
2151 if (expression->kind == EXPR_REFERENCE) {
2152 const reference_expression_t *ref = &expression->reference;
2154 entity_t *entity = ref->entity;
2155 assert(entity->kind == ENTITY_VARIABLE
2156 || entity->kind == ENTITY_PARAMETER);
2157 assert(entity->declaration.kind != DECLARATION_KIND_UNKNOWN);
2159 if (entity->declaration.kind == DECLARATION_KIND_LOCAL_VARIABLE) {
2160 value_number = entity->variable.v.value_number;
2161 assert(addr == NULL);
2162 type_t *type = skip_typeref(expression->base.type);
2163 ir_mode *mode = get_ir_mode_storage(type);
2164 ir_node *res = get_value(value_number, mode);
2165 return create_conv(NULL, res, get_ir_mode_arithmetic(type));
2166 } else if (entity->declaration.kind == DECLARATION_KIND_PARAMETER) {
2167 value_number = entity->parameter.v.value_number;
2168 assert(addr == NULL);
2169 type_t *type = skip_typeref(expression->base.type);
2170 ir_mode *mode = get_ir_mode_storage(type);
2171 ir_node *res = get_value(value_number, mode);
2172 return create_conv(NULL, res, get_ir_mode_arithmetic(type));
2176 assert(addr != NULL);
2177 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2180 if (expression->kind == EXPR_SELECT &&
2181 expression->select.compound_entry->compound_member.bitfield) {
2182 construct_select_compound(&expression->select);
2183 value = bitfield_extract_to_firm(&expression->select, addr);
2185 value = deref_address(dbgi, expression->base.type, addr);
2192 static ir_node *create_incdec(const unary_expression_t *expression)
2194 dbg_info *const dbgi = get_dbg_info(&expression->base.source_position);
2195 const expression_t *value_expr = expression->value;
2196 ir_node *addr = expression_to_addr(value_expr);
2197 ir_node *value = get_value_from_lvalue(value_expr, addr);
2199 type_t *type = skip_typeref(expression->base.type);
2200 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
2203 if (is_type_pointer(type)) {
2204 pointer_type_t *pointer_type = &type->pointer;
2205 offset = get_type_size_node(pointer_type->points_to);
2207 assert(is_type_arithmetic(type));
2208 offset = new_Const(get_mode_one(mode));
2212 ir_node *store_value;
2213 switch(expression->base.kind) {
2214 case EXPR_UNARY_POSTFIX_INCREMENT:
2216 store_value = new_d_Add(dbgi, value, offset, mode);
2218 case EXPR_UNARY_POSTFIX_DECREMENT:
2220 store_value = new_d_Sub(dbgi, value, offset, mode);
2222 case EXPR_UNARY_PREFIX_INCREMENT:
2223 result = new_d_Add(dbgi, value, offset, mode);
2224 store_value = result;
2226 case EXPR_UNARY_PREFIX_DECREMENT:
2227 result = new_d_Sub(dbgi, value, offset, mode);
2228 store_value = result;
2231 panic("no incdec expr in create_incdec");
2234 set_value_for_expression_addr(value_expr, store_value, addr);
2239 static bool is_local_variable(expression_t *expression)
2241 if (expression->kind != EXPR_REFERENCE)
2243 reference_expression_t *ref_expr = &expression->reference;
2244 entity_t *entity = ref_expr->entity;
2245 if (entity->kind != ENTITY_VARIABLE)
2247 assert(entity->declaration.kind != DECLARATION_KIND_UNKNOWN);
2248 return entity->declaration.kind == DECLARATION_KIND_LOCAL_VARIABLE;
2251 static ir_relation get_relation(const expression_kind_t kind)
2254 case EXPR_BINARY_EQUAL: return ir_relation_equal;
2255 case EXPR_BINARY_ISLESSGREATER: return ir_relation_less_greater;
2256 case EXPR_BINARY_NOTEQUAL: return ir_relation_unordered_less_greater;
2257 case EXPR_BINARY_ISLESS:
2258 case EXPR_BINARY_LESS: return ir_relation_less;
2259 case EXPR_BINARY_ISLESSEQUAL:
2260 case EXPR_BINARY_LESSEQUAL: return ir_relation_less_equal;
2261 case EXPR_BINARY_ISGREATER:
2262 case EXPR_BINARY_GREATER: return ir_relation_greater;
2263 case EXPR_BINARY_ISGREATEREQUAL:
2264 case EXPR_BINARY_GREATEREQUAL: return ir_relation_greater_equal;
2265 case EXPR_BINARY_ISUNORDERED: return ir_relation_unordered;
2270 panic("trying to get pn_Cmp from non-comparison binexpr type");
2274 * Handle the assume optimizer hint: check if a Confirm
2275 * node can be created.
2277 * @param dbi debug info
2278 * @param expr the IL assume expression
2280 * we support here only some simple cases:
2285 static ir_node *handle_assume_compare(dbg_info *dbi,
2286 const binary_expression_t *expression)
2288 expression_t *op1 = expression->left;
2289 expression_t *op2 = expression->right;
2290 entity_t *var2, *var = NULL;
2291 ir_node *res = NULL;
2292 ir_relation relation = get_relation(expression->base.kind);
2294 if (is_local_variable(op1) && is_local_variable(op2)) {
2295 var = op1->reference.entity;
2296 var2 = op2->reference.entity;
2298 type_t *const type = skip_typeref(var->declaration.type);
2299 ir_mode *const mode = get_ir_mode_storage(type);
2301 ir_node *const irn1 = get_value(var->variable.v.value_number, mode);
2302 ir_node *const irn2 = get_value(var2->variable.v.value_number, mode);
2304 res = new_d_Confirm(dbi, irn2, irn1, get_inversed_relation(relation));
2305 set_value(var2->variable.v.value_number, res);
2307 res = new_d_Confirm(dbi, irn1, irn2, relation);
2308 set_value(var->variable.v.value_number, res);
2313 expression_t *con = NULL;
2314 if (is_local_variable(op1) && is_constant_expression(op2) == EXPR_CLASS_CONSTANT) {
2315 var = op1->reference.entity;
2317 } else if (is_constant_expression(op1) == EXPR_CLASS_CONSTANT && is_local_variable(op2)) {
2318 relation = get_inversed_relation(relation);
2319 var = op2->reference.entity;
2324 type_t *const type = skip_typeref(var->declaration.type);
2325 ir_mode *const mode = get_ir_mode_storage(type);
2327 res = get_value(var->variable.v.value_number, mode);
2328 res = new_d_Confirm(dbi, res, expression_to_firm(con), relation);
2329 set_value(var->variable.v.value_number, res);
2335 * Handle the assume optimizer hint.
2337 * @param dbi debug info
2338 * @param expr the IL assume expression
2340 static ir_node *handle_assume(dbg_info *dbi, const expression_t *expression)
2342 switch(expression->kind) {
2343 case EXPR_BINARY_EQUAL:
2344 case EXPR_BINARY_NOTEQUAL:
2345 case EXPR_BINARY_LESS:
2346 case EXPR_BINARY_LESSEQUAL:
2347 case EXPR_BINARY_GREATER:
2348 case EXPR_BINARY_GREATEREQUAL:
2349 return handle_assume_compare(dbi, &expression->binary);
2355 static ir_node *create_cast(dbg_info *dbgi, ir_node *value_node,
2356 type_t *from_type, type_t *type)
2358 type = skip_typeref(type);
2359 if (is_type_void(type)) {
2360 /* make sure firm type is constructed */
2361 (void) get_ir_type(type);
2364 if (!is_type_scalar(type)) {
2365 /* make sure firm type is constructed */
2366 (void) get_ir_type(type);
2370 from_type = skip_typeref(from_type);
2371 ir_mode *mode = get_ir_mode_storage(type);
2372 /* check for conversion from / to __based types */
2373 if (is_type_pointer(type) && is_type_pointer(from_type)) {
2374 const variable_t *from_var = from_type->pointer.base_variable;
2375 const variable_t *to_var = type->pointer.base_variable;
2376 if (from_var != to_var) {
2377 if (from_var != NULL) {
2378 ir_node *const addr = create_symconst(dbgi, from_var->v.entity);
2379 ir_node *const base = deref_address(dbgi, from_var->base.type, addr);
2380 value_node = new_d_Add(dbgi, value_node, base, mode);
2382 if (to_var != NULL) {
2383 ir_node *const addr = create_symconst(dbgi, to_var->v.entity);
2384 ir_node *const base = deref_address(dbgi, to_var->base.type, addr);
2385 value_node = new_d_Sub(dbgi, value_node, base, mode);
2390 if (is_type_atomic(type, ATOMIC_TYPE_BOOL)) {
2391 /* bool adjustments (we save a mode_Bu, but have to temporarily
2392 * convert to mode_b so we only get a 0/1 value */
2393 value_node = create_conv(dbgi, value_node, mode_b);
2396 ir_mode *mode_arith = get_ir_mode_arithmetic(type);
2397 ir_node *node = create_conv(dbgi, value_node, mode);
2398 node = do_strict_conv(dbgi, node);
2399 node = create_conv(dbgi, node, mode_arith);
2404 static ir_node *unary_expression_to_firm(const unary_expression_t *expression)
2406 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2407 type_t *type = skip_typeref(expression->base.type);
2409 const expression_t *value = expression->value;
2411 switch(expression->base.kind) {
2412 case EXPR_UNARY_TAKE_ADDRESS:
2413 return expression_to_addr(value);
2415 case EXPR_UNARY_NEGATE: {
2416 ir_node *value_node = expression_to_firm(value);
2417 ir_mode *mode = get_ir_mode_arithmetic(type);
2418 return new_d_Minus(dbgi, value_node, mode);
2420 case EXPR_UNARY_PLUS:
2421 return expression_to_firm(value);
2422 case EXPR_UNARY_BITWISE_NEGATE: {
2423 ir_node *value_node = expression_to_firm(value);
2424 ir_mode *mode = get_ir_mode_arithmetic(type);
2425 return new_d_Not(dbgi, value_node, mode);
2427 case EXPR_UNARY_NOT: {
2428 ir_node *value_node = _expression_to_firm(value);
2429 value_node = create_conv(dbgi, value_node, mode_b);
2430 ir_node *res = new_d_Not(dbgi, value_node, mode_b);
2433 case EXPR_UNARY_DEREFERENCE: {
2434 ir_node *value_node = expression_to_firm(value);
2435 type_t *value_type = skip_typeref(value->base.type);
2436 assert(is_type_pointer(value_type));
2438 /* check for __based */
2439 const variable_t *const base_var = value_type->pointer.base_variable;
2440 if (base_var != NULL) {
2441 ir_node *const addr = create_symconst(dbgi, base_var->v.entity);
2442 ir_node *const base = deref_address(dbgi, base_var->base.type, addr);
2443 value_node = new_d_Add(dbgi, value_node, base, get_ir_mode_storage(value_type));
2445 type_t *points_to = value_type->pointer.points_to;
2446 return deref_address(dbgi, points_to, value_node);
2448 case EXPR_UNARY_POSTFIX_INCREMENT:
2449 case EXPR_UNARY_POSTFIX_DECREMENT:
2450 case EXPR_UNARY_PREFIX_INCREMENT:
2451 case EXPR_UNARY_PREFIX_DECREMENT:
2452 return create_incdec(expression);
2453 case EXPR_UNARY_CAST: {
2454 ir_node *value_node = expression_to_firm(value);
2455 type_t *from_type = value->base.type;
2456 return create_cast(dbgi, value_node, from_type, type);
2458 case EXPR_UNARY_ASSUME:
2459 return handle_assume(dbgi, value);
2464 panic("invalid UNEXPR type found");
2468 * produces a 0/1 depending of the value of a mode_b node
2470 static ir_node *produce_condition_result(const expression_t *expression,
2471 ir_mode *mode, dbg_info *dbgi)
2473 ir_node *const one_block = new_immBlock();
2474 ir_node *const zero_block = new_immBlock();
2475 create_condition_evaluation(expression, one_block, zero_block);
2476 mature_immBlock(one_block);
2477 mature_immBlock(zero_block);
2479 ir_node *const jmp_one = new_rd_Jmp(dbgi, one_block);
2480 ir_node *const jmp_zero = new_rd_Jmp(dbgi, zero_block);
2481 ir_node *const in_cf[2] = { jmp_one, jmp_zero };
2482 ir_node *const block = new_Block(lengthof(in_cf), in_cf);
2483 set_cur_block(block);
2485 ir_node *const one = new_Const(get_mode_one(mode));
2486 ir_node *const zero = new_Const(get_mode_null(mode));
2487 ir_node *const in[2] = { one, zero };
2488 ir_node *const val = new_d_Phi(dbgi, lengthof(in), in, mode);
2493 static ir_node *adjust_for_pointer_arithmetic(dbg_info *dbgi,
2494 ir_node *value, type_t *type)
2496 ir_mode *const mode = get_ir_mode_arithmetic(type_ptrdiff_t);
2497 assert(is_type_pointer(type));
2498 pointer_type_t *const pointer_type = &type->pointer;
2499 type_t *const points_to = skip_typeref(pointer_type->points_to);
2500 ir_node * elem_size = get_type_size_node(points_to);
2501 elem_size = create_conv(dbgi, elem_size, mode);
2502 value = create_conv(dbgi, value, mode);
2503 ir_node *const mul = new_d_Mul(dbgi, value, elem_size, mode);
2507 static ir_node *create_op(dbg_info *dbgi, const binary_expression_t *expression,
2508 ir_node *left, ir_node *right)
2511 type_t *type_left = skip_typeref(expression->left->base.type);
2512 type_t *type_right = skip_typeref(expression->right->base.type);
2514 expression_kind_t kind = expression->base.kind;
2517 case EXPR_BINARY_SHIFTLEFT:
2518 case EXPR_BINARY_SHIFTRIGHT:
2519 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2520 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2521 mode = get_ir_mode_arithmetic(expression->base.type);
2522 right = create_conv(dbgi, right, atomic_modes[ATOMIC_TYPE_UINT]);
2525 case EXPR_BINARY_SUB:
2526 if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
2527 const pointer_type_t *const ptr_type = &type_left->pointer;
2529 mode = get_ir_mode_arithmetic(expression->base.type);
2530 ir_node *const elem_size = get_type_size_node(ptr_type->points_to);
2531 ir_node *const conv_size = new_d_Conv(dbgi, elem_size, mode);
2532 ir_node *const sub = new_d_Sub(dbgi, left, right, mode);
2533 ir_node *const no_mem = new_NoMem();
2534 ir_node *const div = new_d_DivRL(dbgi, no_mem, sub, conv_size,
2535 mode, op_pin_state_floats);
2536 return new_d_Proj(dbgi, div, mode, pn_Div_res);
2539 case EXPR_BINARY_SUB_ASSIGN:
2540 if (is_type_pointer(type_left)) {
2541 right = adjust_for_pointer_arithmetic(dbgi, right, type_left);
2542 mode = get_ir_mode_arithmetic(type_left);
2547 case EXPR_BINARY_ADD:
2548 case EXPR_BINARY_ADD_ASSIGN:
2549 if (is_type_pointer(type_left)) {
2550 right = adjust_for_pointer_arithmetic(dbgi, right, type_left);
2551 mode = get_ir_mode_arithmetic(type_left);
2553 } else if (is_type_pointer(type_right)) {
2554 left = adjust_for_pointer_arithmetic(dbgi, left, type_right);
2555 mode = get_ir_mode_arithmetic(type_right);
2562 mode = get_ir_mode_arithmetic(type_right);
2563 left = create_conv(dbgi, left, mode);
2568 case EXPR_BINARY_ADD_ASSIGN:
2569 case EXPR_BINARY_ADD:
2570 return new_d_Add(dbgi, left, right, mode);
2571 case EXPR_BINARY_SUB_ASSIGN:
2572 case EXPR_BINARY_SUB:
2573 return new_d_Sub(dbgi, left, right, mode);
2574 case EXPR_BINARY_MUL_ASSIGN:
2575 case EXPR_BINARY_MUL:
2576 return new_d_Mul(dbgi, left, right, mode);
2577 case EXPR_BINARY_BITWISE_AND:
2578 case EXPR_BINARY_BITWISE_AND_ASSIGN:
2579 return new_d_And(dbgi, left, right, mode);
2580 case EXPR_BINARY_BITWISE_OR:
2581 case EXPR_BINARY_BITWISE_OR_ASSIGN:
2582 return new_d_Or(dbgi, left, right, mode);
2583 case EXPR_BINARY_BITWISE_XOR:
2584 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
2585 return new_d_Eor(dbgi, left, right, mode);
2586 case EXPR_BINARY_SHIFTLEFT:
2587 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2588 return new_d_Shl(dbgi, left, right, mode);
2589 case EXPR_BINARY_SHIFTRIGHT:
2590 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2591 if (mode_is_signed(mode)) {
2592 return new_d_Shrs(dbgi, left, right, mode);
2594 return new_d_Shr(dbgi, left, right, mode);
2596 case EXPR_BINARY_DIV:
2597 case EXPR_BINARY_DIV_ASSIGN: {
2598 ir_node *pin = new_Pin(new_NoMem());
2599 ir_node *op = new_d_Div(dbgi, pin, left, right, mode,
2600 op_pin_state_floats);
2601 ir_node *res = new_d_Proj(dbgi, op, mode, pn_Div_res);
2604 case EXPR_BINARY_MOD:
2605 case EXPR_BINARY_MOD_ASSIGN: {
2606 ir_node *pin = new_Pin(new_NoMem());
2607 assert(!mode_is_float(mode));
2608 ir_node *op = new_d_Mod(dbgi, pin, left, right, mode,
2609 op_pin_state_floats);
2610 ir_node *res = new_d_Proj(dbgi, op, mode, pn_Mod_res);
2614 panic("unexpected expression kind");
2618 static ir_node *create_lazy_op(const binary_expression_t *expression)
2620 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2621 type_t *type = skip_typeref(expression->base.type);
2622 ir_mode *mode = get_ir_mode_arithmetic(type);
2624 if (is_constant_expression(expression->left) == EXPR_CLASS_CONSTANT) {
2625 bool val = fold_constant_to_bool(expression->left);
2626 expression_kind_t ekind = expression->base.kind;
2627 assert(ekind == EXPR_BINARY_LOGICAL_AND || ekind == EXPR_BINARY_LOGICAL_OR);
2628 if (ekind == EXPR_BINARY_LOGICAL_AND) {
2630 return new_Const(get_mode_null(mode));
2634 return new_Const(get_mode_one(mode));
2638 if (is_constant_expression(expression->right) == EXPR_CLASS_CONSTANT) {
2639 bool valr = fold_constant_to_bool(expression->right);
2640 return create_Const_from_bool(mode, valr);
2643 return produce_condition_result(expression->right, mode, dbgi);
2646 return produce_condition_result((const expression_t*) expression, mode,
2650 typedef ir_node * (*create_arithmetic_func)(dbg_info *dbgi, ir_node *left,
2651 ir_node *right, ir_mode *mode);
2653 static ir_node *create_assign_binop(const binary_expression_t *expression)
2655 dbg_info *const dbgi = get_dbg_info(&expression->base.source_position);
2656 const expression_t *left_expr = expression->left;
2657 type_t *type = skip_typeref(left_expr->base.type);
2658 ir_node *right = expression_to_firm(expression->right);
2659 ir_node *left_addr = expression_to_addr(left_expr);
2660 ir_node *left = get_value_from_lvalue(left_expr, left_addr);
2661 ir_node *result = create_op(dbgi, expression, left, right);
2663 result = create_cast(dbgi, result, expression->right->base.type, type);
2664 result = do_strict_conv(dbgi, result);
2666 result = set_value_for_expression_addr(left_expr, result, left_addr);
2668 if (!is_type_compound(type)) {
2669 ir_mode *mode_arithmetic = get_ir_mode_arithmetic(type);
2670 result = create_conv(dbgi, result, mode_arithmetic);
2675 static ir_node *binary_expression_to_firm(const binary_expression_t *expression)
2677 expression_kind_t kind = expression->base.kind;
2680 case EXPR_BINARY_EQUAL:
2681 case EXPR_BINARY_NOTEQUAL:
2682 case EXPR_BINARY_LESS:
2683 case EXPR_BINARY_LESSEQUAL:
2684 case EXPR_BINARY_GREATER:
2685 case EXPR_BINARY_GREATEREQUAL:
2686 case EXPR_BINARY_ISGREATER:
2687 case EXPR_BINARY_ISGREATEREQUAL:
2688 case EXPR_BINARY_ISLESS:
2689 case EXPR_BINARY_ISLESSEQUAL:
2690 case EXPR_BINARY_ISLESSGREATER:
2691 case EXPR_BINARY_ISUNORDERED: {
2692 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2693 ir_node *left = expression_to_firm(expression->left);
2694 ir_node *right = expression_to_firm(expression->right);
2695 ir_relation relation = get_relation(kind);
2696 ir_node *cmp = new_d_Cmp(dbgi, left, right, relation);
2699 case EXPR_BINARY_ASSIGN: {
2700 ir_node *addr = expression_to_addr(expression->left);
2701 ir_node *right = expression_to_firm(expression->right);
2703 = set_value_for_expression_addr(expression->left, right, addr);
2705 type_t *type = skip_typeref(expression->base.type);
2706 if (!is_type_compound(type)) {
2707 ir_mode *mode_arithmetic = get_ir_mode_arithmetic(type);
2708 res = create_conv(NULL, res, mode_arithmetic);
2712 case EXPR_BINARY_ADD:
2713 case EXPR_BINARY_SUB:
2714 case EXPR_BINARY_MUL:
2715 case EXPR_BINARY_DIV:
2716 case EXPR_BINARY_MOD:
2717 case EXPR_BINARY_BITWISE_AND:
2718 case EXPR_BINARY_BITWISE_OR:
2719 case EXPR_BINARY_BITWISE_XOR:
2720 case EXPR_BINARY_SHIFTLEFT:
2721 case EXPR_BINARY_SHIFTRIGHT:
2723 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2724 ir_node *left = expression_to_firm(expression->left);
2725 ir_node *right = expression_to_firm(expression->right);
2726 return create_op(dbgi, expression, left, right);
2728 case EXPR_BINARY_LOGICAL_AND:
2729 case EXPR_BINARY_LOGICAL_OR:
2730 return create_lazy_op(expression);
2731 case EXPR_BINARY_COMMA:
2732 /* create side effects of left side */
2733 (void) expression_to_firm(expression->left);
2734 return _expression_to_firm(expression->right);
2736 case EXPR_BINARY_ADD_ASSIGN:
2737 case EXPR_BINARY_SUB_ASSIGN:
2738 case EXPR_BINARY_MUL_ASSIGN:
2739 case EXPR_BINARY_MOD_ASSIGN:
2740 case EXPR_BINARY_DIV_ASSIGN:
2741 case EXPR_BINARY_BITWISE_AND_ASSIGN:
2742 case EXPR_BINARY_BITWISE_OR_ASSIGN:
2743 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
2744 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2745 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2746 return create_assign_binop(expression);
2748 panic("TODO binexpr type");
2752 static ir_node *array_access_addr(const array_access_expression_t *expression)
2754 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2755 ir_node *base_addr = expression_to_firm(expression->array_ref);
2756 ir_node *offset = expression_to_firm(expression->index);
2757 type_t *ref_type = skip_typeref(expression->array_ref->base.type);
2758 ir_node *real_offset = adjust_for_pointer_arithmetic(dbgi, offset, ref_type);
2759 ir_node *result = new_d_Add(dbgi, base_addr, real_offset, mode_P_data);
2764 static ir_node *array_access_to_firm(
2765 const array_access_expression_t *expression)
2767 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2768 ir_node *addr = array_access_addr(expression);
2769 type_t *type = revert_automatic_type_conversion(
2770 (const expression_t*) expression);
2771 type = skip_typeref(type);
2773 return deref_address(dbgi, type, addr);
2776 static long get_offsetof_offset(const offsetof_expression_t *expression)
2778 type_t *orig_type = expression->type;
2781 designator_t *designator = expression->designator;
2782 for ( ; designator != NULL; designator = designator->next) {
2783 type_t *type = skip_typeref(orig_type);
2784 /* be sure the type is constructed */
2785 (void) get_ir_type(type);
2787 if (designator->symbol != NULL) {
2788 assert(is_type_compound(type));
2789 symbol_t *symbol = designator->symbol;
2791 compound_t *compound = type->compound.compound;
2792 entity_t *iter = compound->members.entities;
2793 for ( ; iter != NULL; iter = iter->base.next) {
2794 if (iter->base.symbol == symbol) {
2798 assert(iter != NULL);
2800 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
2801 assert(iter->declaration.kind == DECLARATION_KIND_COMPOUND_MEMBER);
2802 offset += get_entity_offset(iter->compound_member.entity);
2804 orig_type = iter->declaration.type;
2806 expression_t *array_index = designator->array_index;
2807 assert(designator->array_index != NULL);
2808 assert(is_type_array(type));
2810 long index = fold_constant_to_int(array_index);
2811 ir_type *arr_type = get_ir_type(type);
2812 ir_type *elem_type = get_array_element_type(arr_type);
2813 long elem_size = get_type_size_bytes(elem_type);
2815 offset += index * elem_size;
2817 orig_type = type->array.element_type;
2824 static ir_node *offsetof_to_firm(const offsetof_expression_t *expression)
2826 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
2827 long offset = get_offsetof_offset(expression);
2828 ir_tarval *tv = new_tarval_from_long(offset, mode);
2829 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2831 return new_d_Const(dbgi, tv);
2834 static void create_local_initializer(initializer_t *initializer, dbg_info *dbgi,
2835 ir_entity *entity, type_t *type);
2836 static ir_initializer_t *create_ir_initializer(
2837 const initializer_t *initializer, type_t *type);
2839 static ir_entity *create_initializer_entity(dbg_info *dbgi,
2840 initializer_t *initializer,
2843 /* create the ir_initializer */
2844 ir_graph *const old_current_ir_graph = current_ir_graph;
2845 current_ir_graph = get_const_code_irg();
2847 ir_initializer_t *irinitializer = create_ir_initializer(initializer, type);
2849 assert(current_ir_graph == get_const_code_irg());
2850 current_ir_graph = old_current_ir_graph;
2852 ident *const id = id_unique("initializer.%u");
2853 ir_type *const irtype = get_ir_type(type);
2854 ir_type *const global_type = get_glob_type();
2855 ir_entity *const entity = new_d_entity(global_type, id, irtype, dbgi);
2856 set_entity_ld_ident(entity, id);
2857 set_entity_visibility(entity, ir_visibility_private);
2858 add_entity_linkage(entity, IR_LINKAGE_CONSTANT);
2859 set_entity_initializer(entity, irinitializer);
2863 static ir_node *compound_literal_addr(compound_literal_expression_t const *const expression)
2865 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2866 type_t *type = expression->type;
2867 initializer_t *initializer = expression->initializer;
2869 if (is_constant_initializer(initializer) == EXPR_CLASS_CONSTANT) {
2870 ir_entity *entity = create_initializer_entity(dbgi, initializer, type);
2871 return create_symconst(dbgi, entity);
2873 /* create an entity on the stack */
2874 ident *const id = id_unique("CompLit.%u");
2875 ir_type *const irtype = get_ir_type(type);
2876 ir_type *frame_type = get_irg_frame_type(current_ir_graph);
2878 ir_entity *const entity = new_d_entity(frame_type, id, irtype, dbgi);
2879 set_entity_ld_ident(entity, id);
2881 /* create initialisation code */
2882 create_local_initializer(initializer, dbgi, entity, type);
2884 /* create a sel for the compound literal address */
2885 ir_node *frame = get_irg_frame(current_ir_graph);
2886 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, entity);
2891 static ir_node *compound_literal_to_firm(compound_literal_expression_t const* const expr)
2893 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
2894 type_t *const type = expr->type;
2895 ir_node *const addr = compound_literal_addr(expr);
2896 return deref_address(dbgi, type, addr);
2900 * Transform a sizeof expression into Firm code.
2902 static ir_node *sizeof_to_firm(const typeprop_expression_t *expression)
2904 type_t *const type = skip_typeref(expression->type);
2905 /* ยง6.5.3.4:2 if the type is a VLA, evaluate the expression. */
2906 if (is_type_array(type) && type->array.is_vla
2907 && expression->tp_expression != NULL) {
2908 expression_to_firm(expression->tp_expression);
2911 return get_type_size_node(type);
2914 static entity_t *get_expression_entity(const expression_t *expression)
2916 if (expression->kind != EXPR_REFERENCE)
2919 return expression->reference.entity;
2922 static unsigned get_cparser_entity_alignment(const entity_t *entity)
2924 switch(entity->kind) {
2925 case DECLARATION_KIND_CASES:
2926 return entity->declaration.alignment;
2929 return entity->compound.alignment;
2930 case ENTITY_TYPEDEF:
2931 return entity->typedefe.alignment;
2939 * Transform an alignof expression into Firm code.
2941 static ir_node *alignof_to_firm(const typeprop_expression_t *expression)
2943 unsigned alignment = 0;
2945 const expression_t *tp_expression = expression->tp_expression;
2946 if (tp_expression != NULL) {
2947 entity_t *entity = get_expression_entity(tp_expression);
2948 if (entity != NULL) {
2949 if (entity->kind == ENTITY_FUNCTION) {
2950 /* a gnu-extension */
2953 alignment = get_cparser_entity_alignment(entity);
2958 if (alignment == 0) {
2959 type_t *type = expression->type;
2960 alignment = get_type_alignment(type);
2963 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2964 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
2965 ir_tarval *tv = new_tarval_from_long(alignment, mode);
2966 return new_d_Const(dbgi, tv);
2969 static void init_ir_types(void);
2971 static ir_tarval *fold_constant_to_tarval(const expression_t *expression)
2973 assert(is_constant_expression(expression) == EXPR_CLASS_CONSTANT);
2975 bool constant_folding_old = constant_folding;
2976 constant_folding = true;
2977 int old_optimize = get_optimize();
2978 int old_constant_folding = get_opt_constant_folding();
2980 set_opt_constant_folding(1);
2984 ir_graph *old_current_ir_graph = current_ir_graph;
2985 current_ir_graph = get_const_code_irg();
2987 ir_node *const cnst = _expression_to_firm(expression);
2989 current_ir_graph = old_current_ir_graph;
2990 set_optimize(old_optimize);
2991 set_opt_constant_folding(old_constant_folding);
2993 if (!is_Const(cnst)) {
2994 panic("couldn't fold constant");
2997 constant_folding = constant_folding_old;
2999 ir_tarval *const tv = get_Const_tarval(cnst);
3000 ir_mode *const mode = get_ir_mode_arithmetic(skip_typeref(expression->base.type));
3001 return tarval_convert_to(tv, mode);
3004 /* this function is only used in parser.c, but it relies on libfirm functionality */
3005 bool constant_is_negative(const expression_t *expression)
3007 ir_tarval *tv = fold_constant_to_tarval(expression);
3008 return tarval_is_negative(tv);
3011 long fold_constant_to_int(const expression_t *expression)
3013 ir_tarval *tv = fold_constant_to_tarval(expression);
3014 if (!tarval_is_long(tv)) {
3015 panic("result of constant folding is not integer");
3018 return get_tarval_long(tv);
3021 bool fold_constant_to_bool(const expression_t *expression)
3023 ir_tarval *tv = fold_constant_to_tarval(expression);
3024 return !tarval_is_null(tv);
3027 static ir_node *conditional_to_firm(const conditional_expression_t *expression)
3029 dbg_info *const dbgi = get_dbg_info(&expression->base.source_position);
3031 /* first try to fold a constant condition */
3032 if (is_constant_expression(expression->condition) == EXPR_CLASS_CONSTANT) {
3033 bool val = fold_constant_to_bool(expression->condition);
3035 expression_t *true_expression = expression->true_expression;
3036 if (true_expression == NULL)
3037 true_expression = expression->condition;
3038 return expression_to_firm(true_expression);
3040 return expression_to_firm(expression->false_expression);
3044 ir_node *const true_block = new_immBlock();
3045 ir_node *const false_block = new_immBlock();
3046 ir_node *const cond_expr = create_condition_evaluation(expression->condition, true_block, false_block);
3047 mature_immBlock(true_block);
3048 mature_immBlock(false_block);
3050 set_cur_block(true_block);
3052 if (expression->true_expression != NULL) {
3053 true_val = expression_to_firm(expression->true_expression);
3054 } else if (cond_expr != NULL && get_irn_mode(cond_expr) != mode_b) {
3055 true_val = cond_expr;
3057 /* Condition ended with a short circuit (&&, ||, !) operation or a
3058 * comparison. Generate a "1" as value for the true branch. */
3059 true_val = new_Const(get_mode_one(mode_Is));
3061 ir_node *const true_jmp = new_d_Jmp(dbgi);
3063 set_cur_block(false_block);
3064 ir_node *const false_val = expression_to_firm(expression->false_expression);
3065 ir_node *const false_jmp = new_d_Jmp(dbgi);
3067 /* create the common block */
3068 ir_node *const in_cf[2] = { true_jmp, false_jmp };
3069 ir_node *const block = new_Block(lengthof(in_cf), in_cf);
3070 set_cur_block(block);
3072 /* TODO improve static semantics, so either both or no values are NULL */
3073 if (true_val == NULL || false_val == NULL)
3076 ir_node *const in[2] = { true_val, false_val };
3077 type_t *const type = skip_typeref(expression->base.type);
3078 ir_mode *const mode = get_ir_mode_arithmetic(type);
3079 ir_node *const val = new_d_Phi(dbgi, lengthof(in), in, mode);
3085 * Returns an IR-node representing the address of a field.
3087 static ir_node *select_addr(const select_expression_t *expression)
3089 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3091 construct_select_compound(expression);
3093 ir_node *compound_addr = expression_to_firm(expression->compound);
3095 entity_t *entry = expression->compound_entry;
3096 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3097 assert(entry->declaration.kind == DECLARATION_KIND_COMPOUND_MEMBER);
3099 if (constant_folding) {
3100 ir_mode *mode = get_irn_mode(compound_addr);
3101 ir_mode *mode_uint = get_reference_mode_unsigned_eq(mode);
3102 ir_node *ofs = new_Const_long(mode_uint, entry->compound_member.offset);
3103 return new_d_Add(dbgi, compound_addr, ofs, mode);
3105 ir_entity *irentity = entry->compound_member.entity;
3106 assert(irentity != NULL);
3107 return new_d_simpleSel(dbgi, new_NoMem(), compound_addr, irentity);
3111 static ir_node *select_to_firm(const select_expression_t *expression)
3113 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3114 ir_node *addr = select_addr(expression);
3115 type_t *type = revert_automatic_type_conversion(
3116 (const expression_t*) expression);
3117 type = skip_typeref(type);
3119 entity_t *entry = expression->compound_entry;
3120 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3122 if (entry->compound_member.bitfield) {
3123 return bitfield_extract_to_firm(expression, addr);
3126 return deref_address(dbgi, type, addr);
3129 /* Values returned by __builtin_classify_type. */
3130 typedef enum gcc_type_class
3136 enumeral_type_class,
3139 reference_type_class,
3143 function_type_class,
3154 static ir_node *classify_type_to_firm(const classify_type_expression_t *const expr)
3156 type_t *type = expr->type_expression->base.type;
3158 /* FIXME gcc returns different values depending on whether compiling C or C++
3159 * e.g. int x[10] is pointer_type_class in C, but array_type_class in C++ */
3162 type = skip_typeref(type);
3163 switch (type->kind) {
3165 const atomic_type_t *const atomic_type = &type->atomic;
3166 switch (atomic_type->akind) {
3167 /* should not be reached */
3168 case ATOMIC_TYPE_INVALID:
3172 /* gcc cannot do that */
3173 case ATOMIC_TYPE_VOID:
3174 tc = void_type_class;
3177 case ATOMIC_TYPE_WCHAR_T: /* gcc handles this as integer */
3178 case ATOMIC_TYPE_CHAR: /* gcc handles this as integer */
3179 case ATOMIC_TYPE_SCHAR: /* gcc handles this as integer */
3180 case ATOMIC_TYPE_UCHAR: /* gcc handles this as integer */
3181 case ATOMIC_TYPE_SHORT:
3182 case ATOMIC_TYPE_USHORT:
3183 case ATOMIC_TYPE_INT:
3184 case ATOMIC_TYPE_UINT:
3185 case ATOMIC_TYPE_LONG:
3186 case ATOMIC_TYPE_ULONG:
3187 case ATOMIC_TYPE_LONGLONG:
3188 case ATOMIC_TYPE_ULONGLONG:
3189 case ATOMIC_TYPE_BOOL: /* gcc handles this as integer */
3190 tc = integer_type_class;
3193 case ATOMIC_TYPE_FLOAT:
3194 case ATOMIC_TYPE_DOUBLE:
3195 case ATOMIC_TYPE_LONG_DOUBLE:
3196 tc = real_type_class;
3199 panic("Unexpected atomic type in classify_type_to_firm().");
3202 case TYPE_COMPLEX: tc = complex_type_class; goto make_const;
3203 case TYPE_IMAGINARY: tc = complex_type_class; goto make_const;
3204 case TYPE_ARRAY: /* gcc handles this as pointer */
3205 case TYPE_FUNCTION: /* gcc handles this as pointer */
3206 case TYPE_POINTER: tc = pointer_type_class; goto make_const;
3207 case TYPE_COMPOUND_STRUCT: tc = record_type_class; goto make_const;
3208 case TYPE_COMPOUND_UNION: tc = union_type_class; goto make_const;
3210 /* gcc handles this as integer */
3211 case TYPE_ENUM: tc = integer_type_class; goto make_const;
3213 /* gcc classifies the referenced type */
3214 case TYPE_REFERENCE: type = type->reference.refers_to; continue;
3216 /* typedef/typeof should be skipped already */
3222 panic("unexpected TYPE classify_type_to_firm().");
3226 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
3227 ir_mode *const mode = atomic_modes[ATOMIC_TYPE_INT];
3228 ir_tarval *const tv = new_tarval_from_long(tc, mode);
3229 return new_d_Const(dbgi, tv);
3232 static ir_node *function_name_to_firm(
3233 const funcname_expression_t *const expr)
3235 switch(expr->kind) {
3236 case FUNCNAME_FUNCTION:
3237 case FUNCNAME_PRETTY_FUNCTION:
3238 case FUNCNAME_FUNCDNAME:
3239 if (current_function_name == NULL) {
3240 const source_position_t *const src_pos = &expr->base.source_position;
3241 const char *name = current_function_entity->base.symbol->string;
3242 const string_t string = { name, strlen(name) + 1 };
3243 current_function_name = string_to_firm(src_pos, "__func__.%u", &string);
3245 return current_function_name;
3246 case FUNCNAME_FUNCSIG:
3247 if (current_funcsig == NULL) {
3248 const source_position_t *const src_pos = &expr->base.source_position;
3249 ir_entity *ent = get_irg_entity(current_ir_graph);
3250 const char *const name = get_entity_ld_name(ent);
3251 const string_t string = { name, strlen(name) + 1 };
3252 current_funcsig = string_to_firm(src_pos, "__FUNCSIG__.%u", &string);
3254 return current_funcsig;
3256 panic("Unsupported function name");
3259 static ir_node *statement_expression_to_firm(const statement_expression_t *expr)
3261 statement_t *statement = expr->statement;
3263 assert(statement->kind == STATEMENT_COMPOUND);
3264 return compound_statement_to_firm(&statement->compound);
3267 static ir_node *va_start_expression_to_firm(
3268 const va_start_expression_t *const expr)
3270 ir_entity *param_ent = current_vararg_entity;
3271 if (param_ent == NULL) {
3272 size_t const n = IR_VA_START_PARAMETER_NUMBER;
3273 ir_type *const frame_type = get_irg_frame_type(current_ir_graph);
3274 ir_type *const param_type = get_unknown_type();
3275 param_ent = new_parameter_entity(frame_type, n, param_type);
3276 current_vararg_entity = param_ent;
3279 ir_node *const frame = get_irg_frame(current_ir_graph);
3280 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
3281 ir_node *const no_mem = new_NoMem();
3282 ir_node *const arg_sel = new_d_simpleSel(dbgi, no_mem, frame, param_ent);
3284 set_value_for_expression(expr->ap, arg_sel);
3289 static ir_node *va_arg_expression_to_firm(const va_arg_expression_t *const expr)
3291 type_t *const type = expr->base.type;
3292 expression_t *const ap_expr = expr->ap;
3293 ir_node *const ap_addr = expression_to_addr(ap_expr);
3294 ir_node *const ap = get_value_from_lvalue(ap_expr, ap_addr);
3295 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
3296 ir_node *const res = deref_address(dbgi, type, ap);
3298 ir_node *const cnst = get_type_size_node(expr->base.type);
3299 ir_mode *const mode = get_irn_mode(cnst);
3300 ir_node *const c1 = new_Const_long(mode, stack_param_align - 1);
3301 ir_node *const c2 = new_d_Add(dbgi, cnst, c1, mode);
3302 ir_node *const c3 = new_Const_long(mode, -(long)stack_param_align);
3303 ir_node *const c4 = new_d_And(dbgi, c2, c3, mode);
3304 ir_node *const add = new_d_Add(dbgi, ap, c4, mode_P_data);
3306 set_value_for_expression_addr(ap_expr, add, ap_addr);
3312 * Generate Firm for a va_copy expression.
3314 static ir_node *va_copy_expression_to_firm(const va_copy_expression_t *const expr)
3316 ir_node *const src = expression_to_firm(expr->src);
3317 set_value_for_expression(expr->dst, src);
3321 static ir_node *dereference_addr(const unary_expression_t *const expression)
3323 assert(expression->base.kind == EXPR_UNARY_DEREFERENCE);
3324 return expression_to_firm(expression->value);
3328 * Returns a IR-node representing an lvalue of the given expression.
3330 static ir_node *expression_to_addr(const expression_t *expression)
3332 switch(expression->kind) {
3333 case EXPR_ARRAY_ACCESS:
3334 return array_access_addr(&expression->array_access);
3336 return call_expression_to_firm(&expression->call);
3337 case EXPR_COMPOUND_LITERAL:
3338 return compound_literal_addr(&expression->compound_literal);
3339 case EXPR_REFERENCE:
3340 return reference_addr(&expression->reference);
3342 return select_addr(&expression->select);
3343 case EXPR_UNARY_DEREFERENCE:
3344 return dereference_addr(&expression->unary);
3348 panic("trying to get address of non-lvalue");
3351 static ir_node *builtin_constant_to_firm(
3352 const builtin_constant_expression_t *expression)
3354 ir_mode *const mode = get_ir_mode_arithmetic(expression->base.type);
3355 bool const v = is_constant_expression(expression->value) == EXPR_CLASS_CONSTANT;
3356 return create_Const_from_bool(mode, v);
3359 static ir_node *builtin_types_compatible_to_firm(
3360 const builtin_types_compatible_expression_t *expression)
3362 type_t *const left = get_unqualified_type(skip_typeref(expression->left));
3363 type_t *const right = get_unqualified_type(skip_typeref(expression->right));
3364 bool const value = types_compatible(left, right);
3365 ir_mode *const mode = get_ir_mode_arithmetic(expression->base.type);
3366 return create_Const_from_bool(mode, value);
3369 static ir_node *get_label_block(label_t *label)
3371 if (label->block != NULL)
3372 return label->block;
3374 /* beware: might be called from create initializer with current_ir_graph
3375 * set to const_code_irg. */
3376 ir_graph *rem = current_ir_graph;
3377 current_ir_graph = current_function;
3379 ir_node *block = new_immBlock();
3381 label->block = block;
3383 ARR_APP1(label_t *, all_labels, label);
3385 current_ir_graph = rem;
3390 * Pointer to a label. This is used for the
3391 * GNU address-of-label extension.
3393 static ir_node *label_address_to_firm(const label_address_expression_t *label)
3395 dbg_info *dbgi = get_dbg_info(&label->base.source_position);
3396 ir_node *block = get_label_block(label->label);
3397 ir_entity *entity = create_Block_entity(block);
3399 symconst_symbol value;
3400 value.entity_p = entity;
3401 return new_d_SymConst(dbgi, mode_P_code, value, symconst_addr_ent);
3405 * creates firm nodes for an expression. The difference between this function
3406 * and expression_to_firm is, that this version might produce mode_b nodes
3407 * instead of mode_Is.
3409 static ir_node *_expression_to_firm(expression_t const *const expr)
3412 if (!constant_folding) {
3413 assert(!expr->base.transformed);
3414 ((expression_t*)expr)->base.transformed = true;
3418 switch (expr->kind) {
3419 case EXPR_ALIGNOF: return alignof_to_firm( &expr->typeprop);
3420 case EXPR_ARRAY_ACCESS: return array_access_to_firm( &expr->array_access);
3421 case EXPR_BINARY_CASES: return binary_expression_to_firm( &expr->binary);
3422 case EXPR_BUILTIN_CONSTANT_P: return builtin_constant_to_firm( &expr->builtin_constant);
3423 case EXPR_BUILTIN_TYPES_COMPATIBLE_P: return builtin_types_compatible_to_firm(&expr->builtin_types_compatible);
3424 case EXPR_CALL: return call_expression_to_firm( &expr->call);
3425 case EXPR_CLASSIFY_TYPE: return classify_type_to_firm( &expr->classify_type);
3426 case EXPR_COMPOUND_LITERAL: return compound_literal_to_firm( &expr->compound_literal);
3427 case EXPR_CONDITIONAL: return conditional_to_firm( &expr->conditional);
3428 case EXPR_FUNCNAME: return function_name_to_firm( &expr->funcname);
3429 case EXPR_LABEL_ADDRESS: return label_address_to_firm( &expr->label_address);
3430 case EXPR_LITERAL_CASES: return literal_to_firm( &expr->literal);
3431 case EXPR_OFFSETOF: return offsetof_to_firm( &expr->offsetofe);
3432 case EXPR_REFERENCE: return reference_expression_to_firm( &expr->reference);
3433 case EXPR_ENUM_CONSTANT: return enum_constant_to_firm( &expr->reference);
3434 case EXPR_SELECT: return select_to_firm( &expr->select);
3435 case EXPR_SIZEOF: return sizeof_to_firm( &expr->typeprop);
3436 case EXPR_STATEMENT: return statement_expression_to_firm( &expr->statement);
3437 case EXPR_UNARY_CASES: return unary_expression_to_firm( &expr->unary);
3438 case EXPR_VA_ARG: return va_arg_expression_to_firm( &expr->va_arge);
3439 case EXPR_VA_COPY: return va_copy_expression_to_firm( &expr->va_copye);
3440 case EXPR_VA_START: return va_start_expression_to_firm( &expr->va_starte);
3441 case EXPR_WIDE_STRING_LITERAL: return wide_string_literal_to_firm( &expr->string_literal);
3443 case EXPR_STRING_LITERAL: return string_to_firm(&expr->base.source_position, "str.%u", &expr->literal.value);
3445 case EXPR_ERROR: break;
3447 panic("invalid expression found");
3451 * Check if a given expression is a GNU __builtin_expect() call.
3453 static bool is_builtin_expect(const expression_t *expression)
3455 if (expression->kind != EXPR_CALL)
3458 expression_t *function = expression->call.function;
3459 if (function->kind != EXPR_REFERENCE)
3461 reference_expression_t *ref = &function->reference;
3462 if (ref->entity->kind != ENTITY_FUNCTION ||
3463 ref->entity->function.btk != BUILTIN_EXPECT)
3469 static bool produces_mode_b(const expression_t *expression)
3471 switch (expression->kind) {
3472 case EXPR_BINARY_EQUAL:
3473 case EXPR_BINARY_NOTEQUAL:
3474 case EXPR_BINARY_LESS:
3475 case EXPR_BINARY_LESSEQUAL:
3476 case EXPR_BINARY_GREATER:
3477 case EXPR_BINARY_GREATEREQUAL:
3478 case EXPR_BINARY_ISGREATER:
3479 case EXPR_BINARY_ISGREATEREQUAL:
3480 case EXPR_BINARY_ISLESS:
3481 case EXPR_BINARY_ISLESSEQUAL:
3482 case EXPR_BINARY_ISLESSGREATER:
3483 case EXPR_BINARY_ISUNORDERED:
3484 case EXPR_UNARY_NOT:
3488 if (is_builtin_expect(expression)) {
3489 expression_t *argument = expression->call.arguments->expression;
3490 return produces_mode_b(argument);
3493 case EXPR_BINARY_COMMA:
3494 return produces_mode_b(expression->binary.right);
3501 static ir_node *expression_to_firm(const expression_t *expression)
3503 if (!produces_mode_b(expression)) {
3504 ir_node *res = _expression_to_firm(expression);
3505 assert(res == NULL || get_irn_mode(res) != mode_b);
3509 if (is_constant_expression(expression) == EXPR_CLASS_CONSTANT) {
3510 return new_Const(fold_constant_to_tarval(expression));
3513 /* we have to produce a 0/1 from the mode_b expression */
3514 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3515 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
3516 return produce_condition_result(expression, mode, dbgi);
3520 * create a short-circuit expression evaluation that tries to construct
3521 * efficient control flow structures for &&, || and ! expressions
3523 static ir_node *create_condition_evaluation(const expression_t *expression,
3524 ir_node *true_block,
3525 ir_node *false_block)
3527 switch(expression->kind) {
3528 case EXPR_UNARY_NOT: {
3529 const unary_expression_t *unary_expression = &expression->unary;
3530 create_condition_evaluation(unary_expression->value, false_block,
3534 case EXPR_BINARY_LOGICAL_AND: {
3535 const binary_expression_t *binary_expression = &expression->binary;
3537 ir_node *extra_block = new_immBlock();
3538 create_condition_evaluation(binary_expression->left, extra_block,
3540 mature_immBlock(extra_block);
3541 set_cur_block(extra_block);
3542 create_condition_evaluation(binary_expression->right, true_block,
3546 case EXPR_BINARY_LOGICAL_OR: {
3547 const binary_expression_t *binary_expression = &expression->binary;
3549 ir_node *extra_block = new_immBlock();
3550 create_condition_evaluation(binary_expression->left, true_block,
3552 mature_immBlock(extra_block);
3553 set_cur_block(extra_block);
3554 create_condition_evaluation(binary_expression->right, true_block,
3562 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3563 ir_node *cond_expr = _expression_to_firm(expression);
3564 ir_node *condition = create_conv(dbgi, cond_expr, mode_b);
3565 ir_node *cond = new_d_Cond(dbgi, condition);
3566 ir_node *true_proj = new_d_Proj(dbgi, cond, mode_X, pn_Cond_true);
3567 ir_node *false_proj = new_d_Proj(dbgi, cond, mode_X, pn_Cond_false);
3569 /* set branch prediction info based on __builtin_expect */
3570 if (is_builtin_expect(expression) && is_Cond(cond)) {
3571 call_argument_t *argument = expression->call.arguments->next;
3572 if (is_constant_expression(argument->expression) == EXPR_CLASS_CONSTANT) {
3573 bool const cnst = fold_constant_to_bool(argument->expression);
3574 cond_jmp_predicate const pred = cnst ? COND_JMP_PRED_TRUE : COND_JMP_PRED_FALSE;
3575 set_Cond_jmp_pred(cond, pred);
3579 add_immBlock_pred(true_block, true_proj);
3580 add_immBlock_pred(false_block, false_proj);
3582 set_unreachable_now();
3586 static void create_variable_entity(entity_t *variable,
3587 declaration_kind_t declaration_kind,
3588 ir_type *parent_type)
3590 assert(variable->kind == ENTITY_VARIABLE);
3591 type_t *type = skip_typeref(variable->declaration.type);
3593 ident *const id = new_id_from_str(variable->base.symbol->string);
3594 ir_type *const irtype = get_ir_type(type);
3595 dbg_info *const dbgi = get_dbg_info(&variable->base.source_position);
3596 ir_entity *const irentity = new_d_entity(parent_type, id, irtype, dbgi);
3597 unsigned alignment = variable->declaration.alignment;
3599 set_entity_alignment(irentity, alignment);
3601 handle_decl_modifiers(irentity, variable);
3603 variable->declaration.kind = (unsigned char) declaration_kind;
3604 variable->variable.v.entity = irentity;
3605 set_entity_ld_ident(irentity, create_ld_ident(variable));
3607 if (type->base.qualifiers & TYPE_QUALIFIER_VOLATILE) {
3608 set_entity_volatility(irentity, volatility_is_volatile);
3613 typedef struct type_path_entry_t type_path_entry_t;
3614 struct type_path_entry_t {
3616 ir_initializer_t *initializer;
3618 entity_t *compound_entry;
3621 typedef struct type_path_t type_path_t;
3622 struct type_path_t {
3623 type_path_entry_t *path;
3628 static __attribute__((unused)) void debug_print_type_path(const type_path_t *path)
3630 size_t len = ARR_LEN(path->path);
3632 for (size_t i = 0; i < len; ++i) {
3633 const type_path_entry_t *entry = & path->path[i];
3635 type_t *type = skip_typeref(entry->type);
3636 if (is_type_compound(type)) {
3637 fprintf(stderr, ".%s", entry->compound_entry->base.symbol->string);
3638 } else if (is_type_array(type)) {
3639 fprintf(stderr, "[%u]", (unsigned) entry->index);
3641 fprintf(stderr, "-INVALID-");
3644 fprintf(stderr, " (");
3645 print_type(path->top_type);
3646 fprintf(stderr, ")");
3649 static type_path_entry_t *get_type_path_top(const type_path_t *path)
3651 size_t len = ARR_LEN(path->path);
3653 return & path->path[len-1];
3656 static type_path_entry_t *append_to_type_path(type_path_t *path)
3658 size_t len = ARR_LEN(path->path);
3659 ARR_RESIZE(type_path_entry_t, path->path, len+1);
3661 type_path_entry_t *result = & path->path[len];
3662 memset(result, 0, sizeof(result[0]));
3666 static size_t get_compound_member_count(const compound_type_t *type)
3668 compound_t *compound = type->compound;
3669 size_t n_members = 0;
3670 entity_t *member = compound->members.entities;
3671 for ( ; member != NULL; member = member->base.next) {
3678 static ir_initializer_t *get_initializer_entry(type_path_t *path)
3680 type_t *orig_top_type = path->top_type;
3681 type_t *top_type = skip_typeref(orig_top_type);
3683 assert(is_type_compound(top_type) || is_type_array(top_type));
3685 if (ARR_LEN(path->path) == 0) {
3688 type_path_entry_t *top = get_type_path_top(path);
3689 ir_initializer_t *initializer = top->initializer;
3690 return get_initializer_compound_value(initializer, top->index);
3694 static void descend_into_subtype(type_path_t *path)
3696 type_t *orig_top_type = path->top_type;
3697 type_t *top_type = skip_typeref(orig_top_type);
3699 assert(is_type_compound(top_type) || is_type_array(top_type));
3701 ir_initializer_t *initializer = get_initializer_entry(path);
3703 type_path_entry_t *top = append_to_type_path(path);
3704 top->type = top_type;
3708 if (is_type_compound(top_type)) {
3709 compound_t *const compound = top_type->compound.compound;
3710 entity_t *const entry = skip_unnamed_bitfields(compound->members.entities);
3712 top->compound_entry = entry;
3714 len = get_compound_member_count(&top_type->compound);
3715 if (entry != NULL) {
3716 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3717 path->top_type = entry->declaration.type;
3720 assert(is_type_array(top_type));
3721 assert(top_type->array.size > 0);
3724 path->top_type = top_type->array.element_type;
3725 len = top_type->array.size;
3727 if (initializer == NULL
3728 || get_initializer_kind(initializer) == IR_INITIALIZER_NULL) {
3729 initializer = create_initializer_compound(len);
3730 /* we have to set the entry at the 2nd latest path entry... */
3731 size_t path_len = ARR_LEN(path->path);
3732 assert(path_len >= 1);
3734 type_path_entry_t *entry = & path->path[path_len-2];
3735 ir_initializer_t *tinitializer = entry->initializer;
3736 set_initializer_compound_value(tinitializer, entry->index,
3740 top->initializer = initializer;
3743 static void ascend_from_subtype(type_path_t *path)
3745 type_path_entry_t *top = get_type_path_top(path);
3747 path->top_type = top->type;
3749 size_t len = ARR_LEN(path->path);
3750 ARR_RESIZE(type_path_entry_t, path->path, len-1);
3753 static void walk_designator(type_path_t *path, const designator_t *designator)
3755 /* designators start at current object type */
3756 ARR_RESIZE(type_path_entry_t, path->path, 1);
3758 for ( ; designator != NULL; designator = designator->next) {
3759 type_path_entry_t *top = get_type_path_top(path);
3760 type_t *orig_type = top->type;
3761 type_t *type = skip_typeref(orig_type);
3763 if (designator->symbol != NULL) {
3764 assert(is_type_compound(type));
3766 symbol_t *symbol = designator->symbol;
3768 compound_t *compound = type->compound.compound;
3769 entity_t *iter = compound->members.entities;
3770 for ( ; iter != NULL; iter = iter->base.next, ++index) {
3771 if (iter->base.symbol == symbol) {
3772 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
3776 assert(iter != NULL);
3778 /* revert previous initialisations of other union elements */
3779 if (type->kind == TYPE_COMPOUND_UNION) {
3780 ir_initializer_t *initializer = top->initializer;
3781 if (initializer != NULL
3782 && get_initializer_kind(initializer) == IR_INITIALIZER_COMPOUND) {
3783 /* are we writing to a new element? */
3784 ir_initializer_t *oldi
3785 = get_initializer_compound_value(initializer, index);
3786 if (get_initializer_kind(oldi) == IR_INITIALIZER_NULL) {
3787 /* clear initializer */
3789 = get_initializer_compound_n_entries(initializer);
3790 ir_initializer_t *nulli = get_initializer_null();
3791 for (size_t i = 0; i < len; ++i) {
3792 set_initializer_compound_value(initializer, i,
3799 top->type = orig_type;
3800 top->compound_entry = iter;
3802 orig_type = iter->declaration.type;
3804 expression_t *array_index = designator->array_index;
3805 assert(designator->array_index != NULL);
3806 assert(is_type_array(type));
3808 long index = fold_constant_to_int(array_index);
3811 if (type->array.size_constant) {
3812 long array_size = type->array.size;
3813 assert(index < array_size);
3817 top->type = orig_type;
3818 top->index = (size_t) index;
3819 orig_type = type->array.element_type;
3821 path->top_type = orig_type;
3823 if (designator->next != NULL) {
3824 descend_into_subtype(path);
3828 path->invalid = false;
3831 static void advance_current_object(type_path_t *path)
3833 if (path->invalid) {
3834 /* TODO: handle this... */
3835 panic("invalid initializer in ast2firm (excessive elements)");
3838 type_path_entry_t *top = get_type_path_top(path);
3840 type_t *type = skip_typeref(top->type);
3841 if (is_type_union(type)) {
3842 /* only the first element is initialized in unions */
3843 top->compound_entry = NULL;
3844 } else if (is_type_struct(type)) {
3845 entity_t *entry = top->compound_entry;
3848 entry = skip_unnamed_bitfields(entry->base.next);
3849 top->compound_entry = entry;
3850 if (entry != NULL) {
3851 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3852 path->top_type = entry->declaration.type;
3856 assert(is_type_array(type));
3859 if (!type->array.size_constant || top->index < type->array.size) {
3864 /* we're past the last member of the current sub-aggregate, try if we
3865 * can ascend in the type hierarchy and continue with another subobject */
3866 size_t len = ARR_LEN(path->path);
3869 ascend_from_subtype(path);
3870 advance_current_object(path);
3872 path->invalid = true;
3877 static ir_initializer_t *create_ir_initializer_value(
3878 const initializer_value_t *initializer)
3880 if (is_type_compound(initializer->value->base.type)) {
3881 panic("initializer creation for compounds not implemented yet");
3883 type_t *type = initializer->value->base.type;
3884 expression_t *expr = initializer->value;
3885 ir_node *value = expression_to_firm(expr);
3886 ir_mode *mode = get_ir_mode_storage(type);
3887 value = create_conv(NULL, value, mode);
3888 return create_initializer_const(value);
3891 /** test wether type can be initialized by a string constant */
3892 static bool is_string_type(type_t *type)
3895 if (is_type_pointer(type)) {
3896 inner = skip_typeref(type->pointer.points_to);
3897 } else if(is_type_array(type)) {
3898 inner = skip_typeref(type->array.element_type);
3903 return is_type_integer(inner);
3906 static ir_initializer_t *create_ir_initializer_list(
3907 const initializer_list_t *initializer, type_t *type)
3910 memset(&path, 0, sizeof(path));
3911 path.top_type = type;
3912 path.path = NEW_ARR_F(type_path_entry_t, 0);
3914 descend_into_subtype(&path);
3916 for (size_t i = 0; i < initializer->len; ++i) {
3917 const initializer_t *sub_initializer = initializer->initializers[i];
3919 if (sub_initializer->kind == INITIALIZER_DESIGNATOR) {
3920 walk_designator(&path, sub_initializer->designator.designator);
3924 if (sub_initializer->kind == INITIALIZER_VALUE) {
3925 /* we might have to descend into types until we're at a scalar
3928 type_t *orig_top_type = path.top_type;
3929 type_t *top_type = skip_typeref(orig_top_type);
3931 if (is_type_scalar(top_type))
3933 descend_into_subtype(&path);
3935 } else if (sub_initializer->kind == INITIALIZER_STRING
3936 || sub_initializer->kind == INITIALIZER_WIDE_STRING) {
3937 /* we might have to descend into types until we're at a scalar
3940 type_t *orig_top_type = path.top_type;
3941 type_t *top_type = skip_typeref(orig_top_type);
3943 if (is_string_type(top_type))
3945 descend_into_subtype(&path);
3949 ir_initializer_t *sub_irinitializer
3950 = create_ir_initializer(sub_initializer, path.top_type);
3952 size_t path_len = ARR_LEN(path.path);
3953 assert(path_len >= 1);
3954 type_path_entry_t *entry = & path.path[path_len-1];
3955 ir_initializer_t *tinitializer = entry->initializer;
3956 set_initializer_compound_value(tinitializer, entry->index,
3959 advance_current_object(&path);
3962 assert(ARR_LEN(path.path) >= 1);
3963 ir_initializer_t *result = path.path[0].initializer;
3964 DEL_ARR_F(path.path);
3969 static ir_initializer_t *create_ir_initializer_string(
3970 const initializer_string_t *initializer, type_t *type)
3972 type = skip_typeref(type);
3974 size_t string_len = initializer->string.size;
3975 assert(type->kind == TYPE_ARRAY);
3976 assert(type->array.size_constant);
3977 size_t len = type->array.size;
3978 ir_initializer_t *irinitializer = create_initializer_compound(len);
3980 const char *string = initializer->string.begin;
3981 ir_mode *mode = get_ir_mode_storage(type->array.element_type);
3983 for (size_t i = 0; i < len; ++i) {
3988 ir_tarval *tv = new_tarval_from_long(c, mode);
3989 ir_initializer_t *char_initializer = create_initializer_tarval(tv);
3991 set_initializer_compound_value(irinitializer, i, char_initializer);
3994 return irinitializer;
3997 static ir_initializer_t *create_ir_initializer_wide_string(
3998 const initializer_wide_string_t *initializer, type_t *type)
4000 assert(type->kind == TYPE_ARRAY);
4001 assert(type->array.size_constant);
4002 size_t len = type->array.size;
4003 size_t string_len = wstrlen(&initializer->string);
4004 ir_initializer_t *irinitializer = create_initializer_compound(len);
4006 const char *p = initializer->string.begin;
4007 ir_mode *mode = get_type_mode(ir_type_wchar_t);
4009 for (size_t i = 0; i < len; ++i) {
4011 if (i < string_len) {
4012 c = read_utf8_char(&p);
4014 ir_tarval *tv = new_tarval_from_long(c, mode);
4015 ir_initializer_t *char_initializer = create_initializer_tarval(tv);
4017 set_initializer_compound_value(irinitializer, i, char_initializer);
4020 return irinitializer;
4023 static ir_initializer_t *create_ir_initializer(
4024 const initializer_t *initializer, type_t *type)
4026 switch(initializer->kind) {
4027 case INITIALIZER_STRING:
4028 return create_ir_initializer_string(&initializer->string, type);
4030 case INITIALIZER_WIDE_STRING:
4031 return create_ir_initializer_wide_string(&initializer->wide_string,
4034 case INITIALIZER_LIST:
4035 return create_ir_initializer_list(&initializer->list, type);
4037 case INITIALIZER_VALUE:
4038 return create_ir_initializer_value(&initializer->value);
4040 case INITIALIZER_DESIGNATOR:
4041 panic("unexpected designator initializer found");
4043 panic("unknown initializer");
4046 /** ANSI C ยง6.7.8:21: If there are fewer initializers [..] than there
4047 * are elements [...] the remainder of the aggregate shall be initialized
4048 * implicitly the same as objects that have static storage duration. */
4049 static void create_dynamic_null_initializer(ir_entity *entity, dbg_info *dbgi,
4052 /* for unions we must NOT do anything for null initializers */
4053 ir_type *owner = get_entity_owner(entity);
4054 if (is_Union_type(owner)) {
4058 ir_type *ent_type = get_entity_type(entity);
4059 /* create sub-initializers for a compound type */
4060 if (is_compound_type(ent_type)) {
4061 unsigned n_members = get_compound_n_members(ent_type);
4062 for (unsigned n = 0; n < n_members; ++n) {
4063 ir_entity *member = get_compound_member(ent_type, n);
4064 ir_node *addr = new_d_simpleSel(dbgi, new_NoMem(), base_addr,
4066 create_dynamic_null_initializer(member, dbgi, addr);
4070 if (is_Array_type(ent_type)) {
4071 assert(has_array_upper_bound(ent_type, 0));
4072 long n = get_array_upper_bound_int(ent_type, 0);
4073 for (long i = 0; i < n; ++i) {
4074 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
4075 ir_tarval *index_tv = new_tarval_from_long(i, mode_uint);
4076 ir_node *cnst = new_d_Const(dbgi, index_tv);
4077 ir_node *in[1] = { cnst };
4078 ir_entity *arrent = get_array_element_entity(ent_type);
4079 ir_node *addr = new_d_Sel(dbgi, new_NoMem(), base_addr, 1, in,
4081 create_dynamic_null_initializer(arrent, dbgi, addr);
4086 ir_mode *value_mode = get_type_mode(ent_type);
4087 ir_node *node = new_Const(get_mode_null(value_mode));
4089 /* is it a bitfield type? */
4090 if (is_Primitive_type(ent_type) &&
4091 get_primitive_base_type(ent_type) != NULL) {
4092 bitfield_store_to_firm(dbgi, entity, base_addr, node, false, false);
4096 ir_node *mem = get_store();
4097 ir_node *store = new_d_Store(dbgi, mem, base_addr, node, cons_none);
4098 ir_node *proj_m = new_Proj(store, mode_M, pn_Store_M);
4102 static void create_dynamic_initializer_sub(ir_initializer_t *initializer,
4103 ir_entity *entity, ir_type *type, dbg_info *dbgi, ir_node *base_addr)
4105 switch(get_initializer_kind(initializer)) {
4106 case IR_INITIALIZER_NULL:
4107 create_dynamic_null_initializer(entity, dbgi, base_addr);
4109 case IR_INITIALIZER_CONST: {
4110 ir_node *node = get_initializer_const_value(initializer);
4111 ir_type *ent_type = get_entity_type(entity);
4113 /* is it a bitfield type? */
4114 if (is_Primitive_type(ent_type) &&
4115 get_primitive_base_type(ent_type) != NULL) {
4116 bitfield_store_to_firm(dbgi, entity, base_addr, node, false, false);
4120 assert(get_type_mode(type) == get_irn_mode(node));
4121 ir_node *mem = get_store();
4122 ir_node *store = new_d_Store(dbgi, mem, base_addr, node, cons_none);
4123 ir_node *proj_m = new_Proj(store, mode_M, pn_Store_M);
4127 case IR_INITIALIZER_TARVAL: {
4128 ir_tarval *tv = get_initializer_tarval_value(initializer);
4129 ir_node *cnst = new_d_Const(dbgi, tv);
4130 ir_type *ent_type = get_entity_type(entity);
4132 /* is it a bitfield type? */
4133 if (is_Primitive_type(ent_type) &&
4134 get_primitive_base_type(ent_type) != NULL) {
4135 bitfield_store_to_firm(dbgi, entity, base_addr, cnst, false, false);
4139 assert(get_type_mode(type) == get_tarval_mode(tv));
4140 ir_node *mem = get_store();
4141 ir_node *store = new_d_Store(dbgi, mem, base_addr, cnst, cons_none);
4142 ir_node *proj_m = new_Proj(store, mode_M, pn_Store_M);
4146 case IR_INITIALIZER_COMPOUND: {
4147 assert(is_compound_type(type) || is_Array_type(type));
4149 if (is_Array_type(type)) {
4150 assert(has_array_upper_bound(type, 0));
4151 n_members = get_array_upper_bound_int(type, 0);
4153 n_members = get_compound_n_members(type);
4156 if (get_initializer_compound_n_entries(initializer)
4157 != (unsigned) n_members)
4158 panic("initializer doesn't match compound type");
4160 for (int i = 0; i < n_members; ++i) {
4163 ir_entity *sub_entity;
4164 if (is_Array_type(type)) {
4165 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
4166 ir_tarval *index_tv = new_tarval_from_long(i, mode_uint);
4167 ir_node *cnst = new_d_Const(dbgi, index_tv);
4168 ir_node *in[1] = { cnst };
4169 irtype = get_array_element_type(type);
4170 sub_entity = get_array_element_entity(type);
4171 addr = new_d_Sel(dbgi, new_NoMem(), base_addr, 1, in,
4174 sub_entity = get_compound_member(type, i);
4175 irtype = get_entity_type(sub_entity);
4176 addr = new_d_simpleSel(dbgi, new_NoMem(), base_addr,
4180 ir_initializer_t *sub_init
4181 = get_initializer_compound_value(initializer, i);
4183 create_dynamic_initializer_sub(sub_init, sub_entity, irtype, dbgi,
4190 panic("invalid IR_INITIALIZER found");
4193 static void create_dynamic_initializer(ir_initializer_t *initializer,
4194 dbg_info *dbgi, ir_entity *entity)
4196 ir_node *frame = get_irg_frame(current_ir_graph);
4197 ir_node *base_addr = new_d_simpleSel(dbgi, new_NoMem(), frame, entity);
4198 ir_type *type = get_entity_type(entity);
4200 create_dynamic_initializer_sub(initializer, entity, type, dbgi, base_addr);
4203 static void create_local_initializer(initializer_t *initializer, dbg_info *dbgi,
4204 ir_entity *entity, type_t *type)
4206 ir_node *memory = get_store();
4207 ir_node *nomem = new_NoMem();
4208 ir_node *frame = get_irg_frame(current_ir_graph);
4209 ir_node *addr = new_d_simpleSel(dbgi, nomem, frame, entity);
4211 if (initializer->kind == INITIALIZER_VALUE) {
4212 initializer_value_t *initializer_value = &initializer->value;
4214 ir_node *value = expression_to_firm(initializer_value->value);
4215 type = skip_typeref(type);
4216 assign_value(dbgi, addr, type, value);
4220 if (is_constant_initializer(initializer) == EXPR_CLASS_VARIABLE) {
4221 ir_initializer_t *irinitializer
4222 = create_ir_initializer(initializer, type);
4224 create_dynamic_initializer(irinitializer, dbgi, entity);
4228 /* create a "template" entity which is copied to the entity on the stack */
4229 ir_entity *const init_entity
4230 = create_initializer_entity(dbgi, initializer, type);
4231 ir_node *const src_addr = create_symconst(dbgi, init_entity);
4232 ir_type *const irtype = get_ir_type(type);
4233 ir_node *const copyb = new_d_CopyB(dbgi, memory, addr, src_addr, irtype);
4235 ir_node *const copyb_mem = new_Proj(copyb, mode_M, pn_CopyB_M);
4236 set_store(copyb_mem);
4239 static void create_initializer_local_variable_entity(entity_t *entity)
4241 assert(entity->kind == ENTITY_VARIABLE);
4242 initializer_t *initializer = entity->variable.initializer;
4243 dbg_info *dbgi = get_dbg_info(&entity->base.source_position);
4244 ir_entity *irentity = entity->variable.v.entity;
4245 type_t *type = entity->declaration.type;
4247 create_local_initializer(initializer, dbgi, irentity, type);
4250 static void create_variable_initializer(entity_t *entity)
4252 assert(entity->kind == ENTITY_VARIABLE);
4253 initializer_t *initializer = entity->variable.initializer;
4254 if (initializer == NULL)
4257 declaration_kind_t declaration_kind
4258 = (declaration_kind_t) entity->declaration.kind;
4259 if (declaration_kind == DECLARATION_KIND_LOCAL_VARIABLE_ENTITY) {
4260 create_initializer_local_variable_entity(entity);
4264 type_t *type = entity->declaration.type;
4265 type_qualifiers_t tq = get_type_qualifier(type, true);
4267 if (initializer->kind == INITIALIZER_VALUE) {
4268 expression_t * value = initializer->value.value;
4269 type_t *const init_type = skip_typeref(value->base.type);
4271 if (!is_type_scalar(init_type)) {
4273 while (value->kind == EXPR_UNARY_CAST)
4274 value = value->unary.value;
4276 if (value->kind != EXPR_COMPOUND_LITERAL)
4277 panic("expected non-scalar initializer to be a compound literal");
4278 initializer = value->compound_literal.initializer;
4279 goto have_initializer;
4282 ir_node * node = expression_to_firm(value);
4283 dbg_info *const dbgi = get_dbg_info(&entity->base.source_position);
4284 ir_mode *const mode = get_ir_mode_storage(init_type);
4285 node = create_conv(dbgi, node, mode);
4286 node = do_strict_conv(dbgi, node);
4288 if (declaration_kind == DECLARATION_KIND_LOCAL_VARIABLE) {
4289 set_value(entity->variable.v.value_number, node);
4291 assert(declaration_kind == DECLARATION_KIND_GLOBAL_VARIABLE);
4293 ir_entity *irentity = entity->variable.v.entity;
4295 if (tq & TYPE_QUALIFIER_CONST
4296 && get_entity_owner(irentity) != get_tls_type()) {
4297 add_entity_linkage(irentity, IR_LINKAGE_CONSTANT);
4299 set_atomic_ent_value(irentity, node);
4303 assert(declaration_kind == DECLARATION_KIND_LOCAL_VARIABLE_ENTITY ||
4304 declaration_kind == DECLARATION_KIND_GLOBAL_VARIABLE);
4306 ir_entity *irentity = entity->variable.v.entity;
4307 ir_initializer_t *irinitializer
4308 = create_ir_initializer(initializer, type);
4310 if (tq & TYPE_QUALIFIER_CONST) {
4311 add_entity_linkage(irentity, IR_LINKAGE_CONSTANT);
4313 set_entity_initializer(irentity, irinitializer);
4317 static void create_variable_length_array(entity_t *entity)
4319 assert(entity->kind == ENTITY_VARIABLE);
4320 assert(entity->variable.initializer == NULL);
4322 entity->declaration.kind = DECLARATION_KIND_VARIABLE_LENGTH_ARRAY;
4323 entity->variable.v.vla_base = NULL;
4325 /* TODO: record VLA somewhere so we create the free node when we leave
4329 static void allocate_variable_length_array(entity_t *entity)
4331 assert(entity->kind == ENTITY_VARIABLE);
4332 assert(entity->variable.initializer == NULL);
4333 assert(currently_reachable());
4335 dbg_info *dbgi = get_dbg_info(&entity->base.source_position);
4336 type_t *type = entity->declaration.type;
4337 ir_type *el_type = get_ir_type(type->array.element_type);
4339 /* make sure size_node is calculated */
4340 get_type_size_node(type);
4341 ir_node *elems = type->array.size_node;
4342 ir_node *mem = get_store();
4343 ir_node *alloc = new_d_Alloc(dbgi, mem, elems, el_type, stack_alloc);
4345 ir_node *proj_m = new_d_Proj(dbgi, alloc, mode_M, pn_Alloc_M);
4346 ir_node *addr = new_d_Proj(dbgi, alloc, mode_P_data, pn_Alloc_res);
4349 assert(entity->declaration.kind == DECLARATION_KIND_VARIABLE_LENGTH_ARRAY);
4350 entity->variable.v.vla_base = addr;
4354 * Creates a Firm local variable from a declaration.
4356 static void create_local_variable(entity_t *entity)
4358 assert(entity->kind == ENTITY_VARIABLE);
4359 assert(entity->declaration.kind == DECLARATION_KIND_UNKNOWN);
4361 bool needs_entity = entity->variable.address_taken;
4362 type_t *type = skip_typeref(entity->declaration.type);
4364 /* is it a variable length array? */
4365 if (is_type_array(type) && !type->array.size_constant) {
4366 create_variable_length_array(entity);
4368 } else if (is_type_array(type) || is_type_compound(type)) {
4369 needs_entity = true;
4370 } else if (type->base.qualifiers & TYPE_QUALIFIER_VOLATILE) {
4371 needs_entity = true;
4375 ir_type *frame_type = get_irg_frame_type(current_ir_graph);
4376 create_variable_entity(entity,
4377 DECLARATION_KIND_LOCAL_VARIABLE_ENTITY,
4380 entity->declaration.kind = DECLARATION_KIND_LOCAL_VARIABLE;
4381 entity->variable.v.value_number = next_value_number_function;
4382 set_irg_loc_description(current_ir_graph, next_value_number_function,
4384 ++next_value_number_function;
4388 static void create_local_static_variable(entity_t *entity)
4390 assert(entity->kind == ENTITY_VARIABLE);
4391 assert(entity->declaration.kind == DECLARATION_KIND_UNKNOWN);
4393 type_t *type = skip_typeref(entity->declaration.type);
4394 ir_type *const var_type = entity->variable.thread_local ?
4395 get_tls_type() : get_glob_type();
4396 ir_type *const irtype = get_ir_type(type);
4397 dbg_info *const dbgi = get_dbg_info(&entity->base.source_position);
4399 size_t l = strlen(entity->base.symbol->string);
4400 char buf[l + sizeof(".%u")];
4401 snprintf(buf, sizeof(buf), "%s.%%u", entity->base.symbol->string);
4402 ident *const id = id_unique(buf);
4403 ir_entity *const irentity = new_d_entity(var_type, id, irtype, dbgi);
4405 if (type->base.qualifiers & TYPE_QUALIFIER_VOLATILE) {
4406 set_entity_volatility(irentity, volatility_is_volatile);
4409 entity->declaration.kind = DECLARATION_KIND_GLOBAL_VARIABLE;
4410 entity->variable.v.entity = irentity;
4412 set_entity_ld_ident(irentity, id);
4413 set_entity_visibility(irentity, ir_visibility_local);
4415 ir_graph *const old_current_ir_graph = current_ir_graph;
4416 current_ir_graph = get_const_code_irg();
4418 create_variable_initializer(entity);
4420 assert(current_ir_graph == get_const_code_irg());
4421 current_ir_graph = old_current_ir_graph;
4426 static ir_node *return_statement_to_firm(return_statement_t *statement)
4428 if (!currently_reachable())
4431 dbg_info *const dbgi = get_dbg_info(&statement->base.source_position);
4432 type_t *const type = skip_typeref(current_function_entity->declaration.type->function.return_type);
4433 ir_node * res = statement->value ? expression_to_firm(statement->value) : NULL;
4436 if (!is_type_void(type)) {
4437 ir_mode *const mode = get_ir_mode_storage(type);
4439 res = create_conv(dbgi, res, mode);
4440 res = do_strict_conv(dbgi, res);
4442 res = new_Unknown(mode);
4449 ir_node *const in[1] = { res };
4450 ir_node *const store = get_store();
4451 ir_node *const ret = new_d_Return(dbgi, store, in_len, in);
4453 ir_node *end_block = get_irg_end_block(current_ir_graph);
4454 add_immBlock_pred(end_block, ret);
4456 set_unreachable_now();
4460 static ir_node *expression_statement_to_firm(expression_statement_t *statement)
4462 if (!currently_reachable())
4465 return expression_to_firm(statement->expression);
4468 static void create_local_declarations(entity_t*);
4470 static ir_node *compound_statement_to_firm(compound_statement_t *compound)
4472 create_local_declarations(compound->scope.entities);
4474 ir_node *result = NULL;
4475 statement_t *statement = compound->statements;
4476 for ( ; statement != NULL; statement = statement->base.next) {
4477 result = statement_to_firm(statement);
4483 static void create_global_variable(entity_t *entity)
4485 ir_linkage linkage = IR_LINKAGE_DEFAULT;
4486 ir_visibility visibility = ir_visibility_default;
4487 ir_entity *irentity;
4488 assert(entity->kind == ENTITY_VARIABLE);
4490 switch ((storage_class_tag_t)entity->declaration.storage_class) {
4491 case STORAGE_CLASS_EXTERN: visibility = ir_visibility_external; break;
4492 case STORAGE_CLASS_STATIC: visibility = ir_visibility_local; break;
4493 case STORAGE_CLASS_NONE:
4494 visibility = ir_visibility_default;
4495 /* uninitialized globals get merged in C */
4496 if (entity->variable.initializer == NULL)
4497 linkage |= IR_LINKAGE_MERGE;
4499 case STORAGE_CLASS_TYPEDEF:
4500 case STORAGE_CLASS_AUTO:
4501 case STORAGE_CLASS_REGISTER:
4502 panic("invalid storage class for global var");
4505 ir_type *var_type = get_glob_type();
4506 if (entity->variable.thread_local) {
4507 var_type = get_tls_type();
4508 /* LINKAGE_MERGE not supported by current linkers */
4509 linkage &= ~IR_LINKAGE_MERGE;
4511 create_variable_entity(entity, DECLARATION_KIND_GLOBAL_VARIABLE, var_type);
4512 irentity = entity->variable.v.entity;
4513 add_entity_linkage(irentity, linkage);
4514 set_entity_visibility(irentity, visibility);
4517 static void create_local_declaration(entity_t *entity)
4519 assert(is_declaration(entity));
4521 /* construct type */
4522 (void) get_ir_type(entity->declaration.type);
4523 if (entity->base.symbol == NULL) {
4527 switch ((storage_class_tag_t) entity->declaration.storage_class) {
4528 case STORAGE_CLASS_STATIC:
4529 if (entity->kind == ENTITY_FUNCTION) {
4530 (void)get_function_entity(entity, NULL);
4532 create_local_static_variable(entity);
4535 case STORAGE_CLASS_EXTERN:
4536 if (entity->kind == ENTITY_FUNCTION) {
4537 assert(entity->function.statement == NULL);
4538 (void)get_function_entity(entity, NULL);
4540 create_global_variable(entity);
4541 create_variable_initializer(entity);
4544 case STORAGE_CLASS_NONE:
4545 case STORAGE_CLASS_AUTO:
4546 case STORAGE_CLASS_REGISTER:
4547 if (entity->kind == ENTITY_FUNCTION) {
4548 if (entity->function.statement != NULL) {
4549 ir_type *owner = get_irg_frame_type(current_ir_graph);
4550 (void)get_function_entity(entity, owner);
4551 entity->declaration.kind = DECLARATION_KIND_INNER_FUNCTION;
4552 enqueue_inner_function(entity);
4554 (void)get_function_entity(entity, NULL);
4557 create_local_variable(entity);
4560 case STORAGE_CLASS_TYPEDEF:
4563 panic("invalid storage class found");
4566 static void create_local_declarations(entity_t *e)
4568 for (; e; e = e->base.next) {
4569 if (is_declaration(e))
4570 create_local_declaration(e);
4574 static void initialize_local_declaration(entity_t *entity)
4576 if (entity->base.symbol == NULL)
4579 // no need to emit code in dead blocks
4580 if (entity->declaration.storage_class != STORAGE_CLASS_STATIC
4581 && !currently_reachable())
4584 switch ((declaration_kind_t) entity->declaration.kind) {
4585 case DECLARATION_KIND_LOCAL_VARIABLE:
4586 case DECLARATION_KIND_LOCAL_VARIABLE_ENTITY:
4587 create_variable_initializer(entity);
4590 case DECLARATION_KIND_VARIABLE_LENGTH_ARRAY:
4591 allocate_variable_length_array(entity);
4594 case DECLARATION_KIND_COMPOUND_MEMBER:
4595 case DECLARATION_KIND_GLOBAL_VARIABLE:
4596 case DECLARATION_KIND_FUNCTION:
4597 case DECLARATION_KIND_INNER_FUNCTION:
4600 case DECLARATION_KIND_PARAMETER:
4601 case DECLARATION_KIND_PARAMETER_ENTITY:
4602 panic("can't initialize parameters");
4604 case DECLARATION_KIND_UNKNOWN:
4605 panic("can't initialize unknown declaration");
4607 panic("invalid declaration kind");
4610 static ir_node *declaration_statement_to_firm(declaration_statement_t *statement)
4612 entity_t *entity = statement->declarations_begin;
4616 entity_t *const last = statement->declarations_end;
4617 for ( ;; entity = entity->base.next) {
4618 if (is_declaration(entity)) {
4619 initialize_local_declaration(entity);
4620 } else if (entity->kind == ENTITY_TYPEDEF) {
4621 /* ยง6.7.7:3 Any array size expressions associated with variable length
4622 * array declarators are evaluated each time the declaration of the
4623 * typedef name is reached in the order of execution. */
4624 type_t *const type = skip_typeref(entity->typedefe.type);
4625 if (is_type_array(type) && type->array.is_vla)
4626 get_vla_size(&type->array);
4635 static ir_node *if_statement_to_firm(if_statement_t *statement)
4637 /* Create the condition. */
4638 ir_node *true_block = NULL;
4639 ir_node *false_block = NULL;
4640 if (currently_reachable()) {
4641 true_block = new_immBlock();
4642 false_block = new_immBlock();
4643 create_condition_evaluation(statement->condition, true_block, false_block);
4644 mature_immBlock(true_block);
4645 mature_immBlock(false_block);
4648 /* Create the true statement. */
4649 set_cur_block(true_block);
4650 statement_to_firm(statement->true_statement);
4651 ir_node *fallthrough_block = get_cur_block();
4653 /* Create the false statement. */
4654 set_cur_block(false_block);
4655 if (statement->false_statement != NULL) {
4656 statement_to_firm(statement->false_statement);
4659 /* Handle the block after the if-statement. Minor simplification and
4660 * optimisation: Reuse the false/true block as fallthrough block, if the
4661 * true/false statement does not pass control to the fallthrough block, e.g.
4662 * in the typical if (x) return; pattern. */
4663 if (fallthrough_block) {
4664 if (currently_reachable()) {
4665 ir_node *const t_jump = new_r_Jmp(fallthrough_block);
4666 ir_node *const f_jump = new_Jmp();
4667 ir_node *const in[] = { t_jump, f_jump };
4668 fallthrough_block = new_Block(2, in);
4670 set_cur_block(fallthrough_block);
4677 * Add an unconditional jump to the target block. If the source block is not
4678 * reachable, then a Bad predecessor is created to prevent Phi-less unreachable
4679 * loops. This is necessary if the jump potentially enters a loop.
4681 static void jump_to(ir_node *const target_block)
4683 ir_node *const pred = currently_reachable() ? new_Jmp() : new_Bad(mode_X);
4684 add_immBlock_pred(target_block, pred);
4688 * Add an unconditional jump to the target block, if the current block is
4689 * reachable and do nothing otherwise. This is only valid if the jump does not
4690 * enter a loop (a back edge is ok).
4692 static void jump_if_reachable(ir_node *const target_block)
4694 if (currently_reachable())
4695 add_immBlock_pred(target_block, new_Jmp());
4698 static ir_node *while_statement_to_firm(while_statement_t *statement)
4700 /* Create the header block */
4701 ir_node *const header_block = new_immBlock();
4702 jump_to(header_block);
4704 /* Create the condition. */
4705 ir_node * body_block;
4706 ir_node * false_block;
4707 expression_t *const cond = statement->condition;
4708 if (is_constant_expression(cond) == EXPR_CLASS_CONSTANT &&
4709 fold_constant_to_bool(cond)) {
4710 /* Shortcut for while (true). */
4711 body_block = header_block;
4714 keep_alive(header_block);
4715 keep_all_memory(header_block);
4717 body_block = new_immBlock();
4718 false_block = new_immBlock();
4720 set_cur_block(header_block);
4721 create_condition_evaluation(cond, body_block, false_block);
4722 mature_immBlock(body_block);
4725 ir_node *const old_continue_label = continue_label;
4726 ir_node *const old_break_label = break_label;
4727 continue_label = header_block;
4728 break_label = false_block;
4730 /* Create the loop body. */
4731 set_cur_block(body_block);
4732 statement_to_firm(statement->body);
4733 jump_if_reachable(header_block);
4735 mature_immBlock(header_block);
4736 assert(false_block == NULL || false_block == break_label);
4737 false_block = break_label;
4738 if (false_block != NULL) {
4739 mature_immBlock(false_block);
4741 set_cur_block(false_block);
4743 assert(continue_label == header_block);
4744 continue_label = old_continue_label;
4745 break_label = old_break_label;
4749 static ir_node *get_break_label(void)
4751 if (break_label == NULL) {
4752 break_label = new_immBlock();
4757 static ir_node *do_while_statement_to_firm(do_while_statement_t *statement)
4759 /* create the header block */
4760 ir_node *header_block = new_immBlock();
4763 ir_node *body_block = new_immBlock();
4764 jump_to(body_block);
4766 ir_node *old_continue_label = continue_label;
4767 ir_node *old_break_label = break_label;
4768 continue_label = header_block;
4771 set_cur_block(body_block);
4772 statement_to_firm(statement->body);
4773 ir_node *const false_block = get_break_label();
4775 assert(continue_label == header_block);
4776 continue_label = old_continue_label;
4777 break_label = old_break_label;
4779 jump_if_reachable(header_block);
4781 /* create the condition */
4782 mature_immBlock(header_block);
4783 set_cur_block(header_block);
4785 create_condition_evaluation(statement->condition, body_block, false_block);
4786 mature_immBlock(body_block);
4787 mature_immBlock(false_block);
4789 set_cur_block(false_block);
4793 static ir_node *for_statement_to_firm(for_statement_t *statement)
4795 create_local_declarations(statement->scope.entities);
4797 if (currently_reachable()) {
4798 entity_t *entity = statement->scope.entities;
4799 for ( ; entity != NULL; entity = entity->base.next) {
4800 if (!is_declaration(entity))
4803 initialize_local_declaration(entity);
4806 if (statement->initialisation != NULL) {
4807 expression_to_firm(statement->initialisation);
4811 /* Create the header block */
4812 ir_node *const header_block = new_immBlock();
4813 jump_to(header_block);
4815 /* Create the condition. */
4816 ir_node *body_block;
4817 ir_node *false_block;
4818 if (statement->condition != NULL) {
4819 body_block = new_immBlock();
4820 false_block = new_immBlock();
4822 set_cur_block(header_block);
4823 create_condition_evaluation(statement->condition, body_block, false_block);
4824 mature_immBlock(body_block);
4827 body_block = header_block;
4830 keep_alive(header_block);
4831 keep_all_memory(header_block);
4834 /* Create the step block, if necessary. */
4835 ir_node * step_block = header_block;
4836 expression_t *const step = statement->step;
4838 step_block = new_immBlock();
4841 ir_node *const old_continue_label = continue_label;
4842 ir_node *const old_break_label = break_label;
4843 continue_label = step_block;
4844 break_label = false_block;
4846 /* Create the loop body. */
4847 set_cur_block(body_block);
4848 statement_to_firm(statement->body);
4849 jump_if_reachable(step_block);
4851 /* Create the step code. */
4853 mature_immBlock(step_block);
4854 set_cur_block(step_block);
4855 expression_to_firm(step);
4856 jump_if_reachable(header_block);
4859 mature_immBlock(header_block);
4860 assert(false_block == NULL || false_block == break_label);
4861 false_block = break_label;
4862 if (false_block != NULL) {
4863 mature_immBlock(false_block);
4865 set_cur_block(false_block);
4867 assert(continue_label == step_block);
4868 continue_label = old_continue_label;
4869 break_label = old_break_label;
4873 static ir_node *create_jump_statement(const statement_t *statement, ir_node *target_block)
4875 if (!currently_reachable())
4878 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
4879 ir_node *jump = new_d_Jmp(dbgi);
4880 add_immBlock_pred(target_block, jump);
4882 set_unreachable_now();
4886 static ir_switch_table *create_switch_table(const switch_statement_t *statement)
4888 /* determine number of cases */
4890 for (case_label_statement_t *l = statement->first_case; l != NULL;
4893 if (l->expression == NULL)
4895 if (l->is_empty_range)
4900 ir_switch_table *res = ir_new_switch_table(current_ir_graph, n_cases);
4902 for (case_label_statement_t *l = statement->first_case; l != NULL;
4904 if (l->expression == NULL) {
4905 l->pn = pn_Switch_default;
4908 if (l->is_empty_range)
4910 ir_tarval *min = fold_constant_to_tarval(l->expression);
4911 ir_tarval *max = min;
4912 long pn = (long) i+1;
4913 if (l->end_range != NULL)
4914 max = fold_constant_to_tarval(l->end_range);
4915 ir_switch_table_set(res, i++, min, max, pn);
4921 static ir_node *switch_statement_to_firm(switch_statement_t *statement)
4923 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
4924 ir_node *switch_node = NULL;
4926 if (currently_reachable()) {
4927 ir_node *expression = expression_to_firm(statement->expression);
4928 ir_switch_table *table = create_switch_table(statement);
4929 unsigned n_outs = (unsigned)ir_switch_table_get_n_entries(table) + 1;
4931 switch_node = new_d_Switch(dbgi, expression, n_outs, table);
4934 set_unreachable_now();
4936 ir_node *const old_switch = current_switch;
4937 ir_node *const old_break_label = break_label;
4938 const bool old_saw_default_label = saw_default_label;
4939 saw_default_label = false;
4940 current_switch = switch_node;
4943 statement_to_firm(statement->body);
4945 if (currently_reachable()) {
4946 add_immBlock_pred(get_break_label(), new_Jmp());
4949 if (!saw_default_label && switch_node) {
4950 ir_node *proj = new_d_Proj(dbgi, switch_node, mode_X, pn_Switch_default);
4951 add_immBlock_pred(get_break_label(), proj);
4954 if (break_label != NULL) {
4955 mature_immBlock(break_label);
4957 set_cur_block(break_label);
4959 assert(current_switch == switch_node);
4960 current_switch = old_switch;
4961 break_label = old_break_label;
4962 saw_default_label = old_saw_default_label;
4966 static ir_node *case_label_to_firm(const case_label_statement_t *statement)
4968 if (statement->is_empty_range)
4971 if (current_switch != NULL) {
4972 ir_node *block = new_immBlock();
4973 /* Fallthrough from previous case */
4974 jump_if_reachable(block);
4976 ir_node *const proj = new_Proj(current_switch, mode_X, statement->pn);
4977 add_immBlock_pred(block, proj);
4978 if (statement->expression == NULL)
4979 saw_default_label = true;
4981 mature_immBlock(block);
4982 set_cur_block(block);
4985 return statement_to_firm(statement->statement);
4988 static ir_node *label_to_firm(const label_statement_t *statement)
4990 ir_node *block = get_label_block(statement->label);
4993 set_cur_block(block);
4995 keep_all_memory(block);
4997 return statement_to_firm(statement->statement);
5000 static ir_node *computed_goto_to_firm(computed_goto_statement_t const *const statement)
5002 if (!currently_reachable())
5005 ir_node *const irn = expression_to_firm(statement->expression);
5006 dbg_info *const dbgi = get_dbg_info(&statement->base.source_position);
5007 ir_node *const ijmp = new_d_IJmp(dbgi, irn);
5009 set_irn_link(ijmp, ijmp_list);
5012 set_unreachable_now();
5016 static ir_node *asm_statement_to_firm(const asm_statement_t *statement)
5018 bool needs_memory = false;
5020 if (statement->is_volatile) {
5021 needs_memory = true;
5024 size_t n_clobbers = 0;
5025 asm_clobber_t *clobber = statement->clobbers;
5026 for ( ; clobber != NULL; clobber = clobber->next) {
5027 const char *clobber_str = clobber->clobber.begin;
5029 if (!be_is_valid_clobber(clobber_str)) {
5030 errorf(&statement->base.source_position,
5031 "invalid clobber '%s' specified", clobber->clobber);
5035 if (streq(clobber_str, "memory")) {
5036 needs_memory = true;
5040 ident *id = new_id_from_str(clobber_str);
5041 obstack_ptr_grow(&asm_obst, id);
5044 assert(obstack_object_size(&asm_obst) == n_clobbers * sizeof(ident*));
5045 ident **clobbers = NULL;
5046 if (n_clobbers > 0) {
5047 clobbers = obstack_finish(&asm_obst);
5050 size_t n_inputs = 0;
5051 asm_argument_t *argument = statement->inputs;
5052 for ( ; argument != NULL; argument = argument->next)
5054 size_t n_outputs = 0;
5055 argument = statement->outputs;
5056 for ( ; argument != NULL; argument = argument->next)
5059 unsigned next_pos = 0;
5061 ir_node *ins[n_inputs + n_outputs + 1];
5064 ir_asm_constraint tmp_in_constraints[n_outputs];
5066 const expression_t *out_exprs[n_outputs];
5067 ir_node *out_addrs[n_outputs];
5068 size_t out_size = 0;
5070 argument = statement->outputs;
5071 for ( ; argument != NULL; argument = argument->next) {
5072 const char *constraints = argument->constraints.begin;
5073 asm_constraint_flags_t asm_flags
5074 = be_parse_asm_constraints(constraints);
5077 source_position_t const *const pos = &statement->base.source_position;
5078 if (asm_flags & ASM_CONSTRAINT_FLAG_NO_SUPPORT) {
5079 warningf(WARN_OTHER, pos, "some constraints in '%s' are not supported", constraints);
5081 if (asm_flags & ASM_CONSTRAINT_FLAG_INVALID) {
5082 errorf(pos, "some constraints in '%s' are invalid", constraints);
5085 if (! (asm_flags & ASM_CONSTRAINT_FLAG_MODIFIER_WRITE)) {
5086 errorf(pos, "no write flag specified for output constraints '%s'", constraints);
5091 unsigned pos = next_pos++;
5092 if ( (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE)
5093 || (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER) ) {
5094 expression_t *expr = argument->expression;
5095 ir_node *addr = expression_to_addr(expr);
5096 /* in+output, construct an artifical same_as constraint on the
5098 if (asm_flags & ASM_CONSTRAINT_FLAG_MODIFIER_READ) {
5100 ir_node *value = get_value_from_lvalue(expr, addr);
5102 snprintf(buf, sizeof(buf), "%u", (unsigned) out_size);
5104 ir_asm_constraint constraint;
5105 constraint.pos = pos;
5106 constraint.constraint = new_id_from_str(buf);
5107 constraint.mode = get_ir_mode_storage(expr->base.type);
5108 tmp_in_constraints[in_size] = constraint;
5109 ins[in_size] = value;
5114 out_exprs[out_size] = expr;
5115 out_addrs[out_size] = addr;
5117 } else if (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP) {
5118 /* pure memory ops need no input (but we have to make sure we
5119 * attach to the memory) */
5120 assert(! (asm_flags &
5121 (ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE
5122 | ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER)));
5123 needs_memory = true;
5125 /* we need to attach the address to the inputs */
5126 expression_t *expr = argument->expression;
5128 ir_asm_constraint constraint;
5129 constraint.pos = pos;
5130 constraint.constraint = new_id_from_str(constraints);
5131 constraint.mode = mode_M;
5132 tmp_in_constraints[in_size] = constraint;
5134 ins[in_size] = expression_to_addr(expr);
5138 errorf(&statement->base.source_position,
5139 "only modifiers but no place set in constraints '%s'",
5144 ir_asm_constraint constraint;
5145 constraint.pos = pos;
5146 constraint.constraint = new_id_from_str(constraints);
5147 constraint.mode = get_ir_mode_storage(argument->expression->base.type);
5149 obstack_grow(&asm_obst, &constraint, sizeof(constraint));
5151 assert(obstack_object_size(&asm_obst)
5152 == out_size * sizeof(ir_asm_constraint));
5153 ir_asm_constraint *output_constraints = obstack_finish(&asm_obst);
5156 obstack_grow(&asm_obst, tmp_in_constraints,
5157 in_size * sizeof(tmp_in_constraints[0]));
5158 /* find and count input and output arguments */
5159 argument = statement->inputs;
5160 for ( ; argument != NULL; argument = argument->next) {
5161 const char *constraints = argument->constraints.begin;
5162 asm_constraint_flags_t asm_flags
5163 = be_parse_asm_constraints(constraints);
5165 if (asm_flags & ASM_CONSTRAINT_FLAG_NO_SUPPORT) {
5166 errorf(&statement->base.source_position,
5167 "some constraints in '%s' are not supported", constraints);
5170 if (asm_flags & ASM_CONSTRAINT_FLAG_INVALID) {
5171 errorf(&statement->base.source_position,
5172 "some constraints in '%s' are invalid", constraints);
5175 if (asm_flags & ASM_CONSTRAINT_FLAG_MODIFIER_WRITE) {
5176 errorf(&statement->base.source_position,
5177 "write flag specified for input constraints '%s'",
5183 if ( (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE)
5184 || (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER) ) {
5185 /* we can treat this as "normal" input */
5186 input = expression_to_firm(argument->expression);
5187 } else if (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP) {
5188 /* pure memory ops need no input (but we have to make sure we
5189 * attach to the memory) */
5190 assert(! (asm_flags &
5191 (ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE
5192 | ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER)));
5193 needs_memory = true;
5194 input = expression_to_addr(argument->expression);
5196 errorf(&statement->base.source_position,
5197 "only modifiers but no place set in constraints '%s'",
5202 ir_asm_constraint constraint;
5203 constraint.pos = next_pos++;
5204 constraint.constraint = new_id_from_str(constraints);
5205 constraint.mode = get_irn_mode(input);
5207 obstack_grow(&asm_obst, &constraint, sizeof(constraint));
5208 ins[in_size++] = input;
5212 ir_asm_constraint constraint;
5213 constraint.pos = next_pos++;
5214 constraint.constraint = new_id_from_str("");
5215 constraint.mode = mode_M;
5217 obstack_grow(&asm_obst, &constraint, sizeof(constraint));
5218 ins[in_size++] = get_store();
5221 assert(obstack_object_size(&asm_obst)
5222 == in_size * sizeof(ir_asm_constraint));
5223 ir_asm_constraint *input_constraints = obstack_finish(&asm_obst);
5225 /* create asm node */
5226 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
5228 ident *asm_text = new_id_from_str(statement->asm_text.begin);
5230 ir_node *node = new_d_ASM(dbgi, in_size, ins, input_constraints,
5231 out_size, output_constraints,
5232 n_clobbers, clobbers, asm_text);
5234 if (statement->is_volatile) {
5235 set_irn_pinned(node, op_pin_state_pinned);
5237 set_irn_pinned(node, op_pin_state_floats);
5240 /* create output projs & connect them */
5242 ir_node *projm = new_Proj(node, mode_M, out_size);
5247 for (i = 0; i < out_size; ++i) {
5248 const expression_t *out_expr = out_exprs[i];
5250 ir_mode *mode = get_ir_mode_storage(out_expr->base.type);
5251 ir_node *proj = new_Proj(node, mode, pn);
5252 ir_node *addr = out_addrs[i];
5254 set_value_for_expression_addr(out_expr, proj, addr);
5260 static ir_node *ms_try_statement_to_firm(ms_try_statement_t *statement)
5262 statement_to_firm(statement->try_statement);
5263 source_position_t const *const pos = &statement->base.source_position;
5264 warningf(WARN_OTHER, pos, "structured exception handling ignored");
5268 static ir_node *leave_statement_to_firm(leave_statement_t *statement)
5270 errorf(&statement->base.source_position, "__leave not supported yet");
5275 * Transform a statement.
5277 static ir_node *statement_to_firm(statement_t *const stmt)
5280 assert(!stmt->base.transformed);
5281 stmt->base.transformed = true;
5284 switch (stmt->kind) {
5285 case STATEMENT_ASM: return asm_statement_to_firm( &stmt->asms);
5286 case STATEMENT_CASE_LABEL: return case_label_to_firm( &stmt->case_label);
5287 case STATEMENT_COMPOUND: return compound_statement_to_firm( &stmt->compound);
5288 case STATEMENT_COMPUTED_GOTO: return computed_goto_to_firm( &stmt->computed_goto);
5289 case STATEMENT_DECLARATION: return declaration_statement_to_firm(&stmt->declaration);
5290 case STATEMENT_DO_WHILE: return do_while_statement_to_firm( &stmt->do_while);
5291 case STATEMENT_EMPTY: return NULL; /* nothing */
5292 case STATEMENT_EXPRESSION: return expression_statement_to_firm( &stmt->expression);
5293 case STATEMENT_FOR: return for_statement_to_firm( &stmt->fors);
5294 case STATEMENT_IF: return if_statement_to_firm( &stmt->ifs);
5295 case STATEMENT_LABEL: return label_to_firm( &stmt->label);
5296 case STATEMENT_LEAVE: return leave_statement_to_firm( &stmt->leave);
5297 case STATEMENT_MS_TRY: return ms_try_statement_to_firm( &stmt->ms_try);
5298 case STATEMENT_RETURN: return return_statement_to_firm( &stmt->returns);
5299 case STATEMENT_SWITCH: return switch_statement_to_firm( &stmt->switchs);
5300 case STATEMENT_WHILE: return while_statement_to_firm( &stmt->whiles);
5302 case STATEMENT_BREAK: return create_jump_statement(stmt, get_break_label());
5303 case STATEMENT_CONTINUE: return create_jump_statement(stmt, continue_label);
5304 case STATEMENT_GOTO: return create_jump_statement(stmt, get_label_block(stmt->gotos.label));
5306 case STATEMENT_ERROR: panic("error statement found");
5308 panic("statement not implemented");
5311 static int count_local_variables(const entity_t *entity,
5312 const entity_t *const last)
5315 entity_t const *const end = last != NULL ? last->base.next : NULL;
5316 for (; entity != end; entity = entity->base.next) {
5320 if (entity->kind == ENTITY_VARIABLE) {
5321 type = skip_typeref(entity->declaration.type);
5322 address_taken = entity->variable.address_taken;
5323 } else if (entity->kind == ENTITY_PARAMETER) {
5324 type = skip_typeref(entity->declaration.type);
5325 address_taken = entity->parameter.address_taken;
5330 if (!address_taken && is_type_scalar(type))
5336 static void count_local_variables_in_stmt(statement_t *stmt, void *const env)
5338 int *const count = env;
5340 switch (stmt->kind) {
5341 case STATEMENT_DECLARATION: {
5342 const declaration_statement_t *const decl_stmt = &stmt->declaration;
5343 *count += count_local_variables(decl_stmt->declarations_begin,
5344 decl_stmt->declarations_end);
5349 *count += count_local_variables(stmt->fors.scope.entities, NULL);
5358 * Return the number of local (alias free) variables used by a function.
5360 static int get_function_n_local_vars(entity_t *entity)
5362 const function_t *function = &entity->function;
5365 /* count parameters */
5366 count += count_local_variables(function->parameters.entities, NULL);
5368 /* count local variables declared in body */
5369 walk_statements(function->statement, count_local_variables_in_stmt, &count);
5374 * Build Firm code for the parameters of a function.
5376 static void initialize_function_parameters(entity_t *entity)
5378 assert(entity->kind == ENTITY_FUNCTION);
5379 ir_graph *irg = current_ir_graph;
5380 ir_node *args = get_irg_args(irg);
5382 ir_type *function_irtype;
5384 if (entity->function.need_closure) {
5385 /* add an extra parameter for the static link */
5386 entity->function.static_link = new_r_Proj(args, mode_P_data, 0);
5389 /* Matze: IMO this is wrong, nested functions should have an own
5390 * type and not rely on strange parameters... */
5391 function_irtype = create_method_type(&entity->declaration.type->function, true);
5393 function_irtype = get_ir_type(entity->declaration.type);
5398 entity_t *parameter = entity->function.parameters.entities;
5399 for ( ; parameter != NULL; parameter = parameter->base.next, ++n) {
5400 if (parameter->kind != ENTITY_PARAMETER)
5403 assert(parameter->declaration.kind == DECLARATION_KIND_UNKNOWN);
5404 type_t *type = skip_typeref(parameter->declaration.type);
5406 bool needs_entity = parameter->parameter.address_taken;
5407 assert(!is_type_array(type));
5408 if (is_type_compound(type)) {
5409 needs_entity = true;
5412 ir_type *param_irtype = get_method_param_type(function_irtype, n);
5414 ir_type *frame_type = get_irg_frame_type(irg);
5416 = new_parameter_entity(frame_type, n, param_irtype);
5417 parameter->declaration.kind
5418 = DECLARATION_KIND_PARAMETER_ENTITY;
5419 parameter->parameter.v.entity = param;
5423 ir_mode *param_mode = get_type_mode(param_irtype);
5425 ir_node *value = new_r_Proj(args, param_mode, pn);
5427 ir_mode *mode = get_ir_mode_storage(type);
5428 value = create_conv(NULL, value, mode);
5429 value = do_strict_conv(NULL, value);
5431 parameter->declaration.kind = DECLARATION_KIND_PARAMETER;
5432 parameter->parameter.v.value_number = next_value_number_function;
5433 set_irg_loc_description(current_ir_graph, next_value_number_function,
5435 ++next_value_number_function;
5437 set_value(parameter->parameter.v.value_number, value);
5442 * Handle additional decl modifiers for IR-graphs
5444 * @param irg the IR-graph
5445 * @param dec_modifiers additional modifiers
5447 static void handle_decl_modifier_irg(ir_graph *irg,
5448 decl_modifiers_t decl_modifiers)
5450 if (decl_modifiers & DM_NAKED) {
5451 /* TRUE if the declaration includes the Microsoft
5452 __declspec(naked) specifier. */
5453 add_irg_additional_properties(irg, mtp_property_naked);
5455 if (decl_modifiers & DM_FORCEINLINE) {
5456 /* TRUE if the declaration includes the
5457 Microsoft __forceinline specifier. */
5458 set_irg_inline_property(irg, irg_inline_forced);
5460 if (decl_modifiers & DM_NOINLINE) {
5461 /* TRUE if the declaration includes the Microsoft
5462 __declspec(noinline) specifier. */
5463 set_irg_inline_property(irg, irg_inline_forbidden);
5467 static void add_function_pointer(ir_type *segment, ir_entity *method,
5468 const char *unique_template)
5470 ir_type *method_type = get_entity_type(method);
5471 ir_type *ptr_type = new_type_pointer(method_type);
5473 /* these entities don't really have a name but firm only allows
5475 * Note that we mustn't give these entities a name since for example
5476 * Mach-O doesn't allow them. */
5477 ident *ide = id_unique(unique_template);
5478 ir_entity *ptr = new_entity(segment, ide, ptr_type);
5479 ir_graph *irg = get_const_code_irg();
5480 ir_node *val = new_rd_SymConst_addr_ent(NULL, irg, mode_P_code,
5483 set_entity_ld_ident(ptr, new_id_from_chars("", 0));
5484 set_entity_compiler_generated(ptr, 1);
5485 set_entity_visibility(ptr, ir_visibility_private);
5486 add_entity_linkage(ptr, IR_LINKAGE_CONSTANT|IR_LINKAGE_HIDDEN_USER);
5487 set_atomic_ent_value(ptr, val);
5491 * Generate possible IJmp branches to a given label block.
5493 static void gen_ijmp_branches(ir_node *block)
5496 for (ijmp = ijmp_list; ijmp != NULL; ijmp = get_irn_link(ijmp)) {
5497 add_immBlock_pred(block, ijmp);
5502 * Create code for a function and all inner functions.
5504 * @param entity the function entity
5506 static void create_function(entity_t *entity)
5508 assert(entity->kind == ENTITY_FUNCTION);
5509 ir_entity *function_entity = get_function_entity(entity, current_outer_frame);
5511 if (entity->function.statement == NULL)
5514 inner_functions = NULL;
5515 current_trampolines = NULL;
5517 if (entity->declaration.modifiers & DM_CONSTRUCTOR) {
5518 ir_type *segment = get_segment_type(IR_SEGMENT_CONSTRUCTORS);
5519 add_function_pointer(segment, function_entity, "constructor_ptr.%u");
5521 if (entity->declaration.modifiers & DM_DESTRUCTOR) {
5522 ir_type *segment = get_segment_type(IR_SEGMENT_DESTRUCTORS);
5523 add_function_pointer(segment, function_entity, "destructor_ptr.%u");
5526 current_function_entity = entity;
5527 current_function_name = NULL;
5528 current_funcsig = NULL;
5530 assert(all_labels == NULL);
5531 all_labels = NEW_ARR_F(label_t *, 0);
5534 int n_local_vars = get_function_n_local_vars(entity);
5535 ir_graph *irg = new_ir_graph(function_entity, n_local_vars);
5536 current_ir_graph = irg;
5538 ir_graph *old_current_function = current_function;
5539 current_function = irg;
5541 ir_entity *const old_current_vararg_entity = current_vararg_entity;
5542 current_vararg_entity = NULL;
5544 set_irg_fp_model(irg, firm_fp_model);
5545 tarval_enable_fp_ops(1);
5546 set_irn_dbg_info(get_irg_start_block(irg),
5547 get_entity_dbg_info(function_entity));
5549 /* set inline flags */
5550 if (entity->function.is_inline)
5551 set_irg_inline_property(irg, irg_inline_recomended);
5552 handle_decl_modifier_irg(irg, entity->declaration.modifiers);
5554 next_value_number_function = 0;
5555 initialize_function_parameters(entity);
5556 current_static_link = entity->function.static_link;
5558 statement_to_firm(entity->function.statement);
5560 ir_node *end_block = get_irg_end_block(irg);
5562 /* do we have a return statement yet? */
5563 if (currently_reachable()) {
5564 type_t *type = skip_typeref(entity->declaration.type);
5565 assert(is_type_function(type));
5566 type_t *const return_type = skip_typeref(type->function.return_type);
5569 if (is_type_void(return_type)) {
5570 ret = new_Return(get_store(), 0, NULL);
5572 ir_mode *const mode = get_ir_mode_storage(return_type);
5575 /* ยง5.1.2.2.3 main implicitly returns 0 */
5576 if (is_main(entity)) {
5577 in[0] = new_Const(get_mode_null(mode));
5579 in[0] = new_Unknown(mode);
5581 ret = new_Return(get_store(), 1, in);
5583 add_immBlock_pred(end_block, ret);
5586 for (int i = ARR_LEN(all_labels) - 1; i >= 0; --i) {
5587 label_t *label = all_labels[i];
5588 if (label->address_taken) {
5589 gen_ijmp_branches(label->block);
5591 mature_immBlock(label->block);
5594 DEL_ARR_F(all_labels);
5597 irg_finalize_cons(irg);
5599 /* finalize the frame type */
5600 ir_type *frame_type = get_irg_frame_type(irg);
5601 int n = get_compound_n_members(frame_type);
5604 for (int i = 0; i < n; ++i) {
5605 ir_entity *member = get_compound_member(frame_type, i);
5606 ir_type *entity_type = get_entity_type(member);
5608 int align = get_type_alignment_bytes(entity_type);
5609 if (align > align_all)
5613 misalign = offset % align;
5615 offset += align - misalign;
5619 set_entity_offset(member, offset);
5620 offset += get_type_size_bytes(entity_type);
5622 set_type_size_bytes(frame_type, offset);
5623 set_type_alignment_bytes(frame_type, align_all);
5625 irg_verify(irg, VERIFY_ENFORCE_SSA);
5626 current_vararg_entity = old_current_vararg_entity;
5627 current_function = old_current_function;
5629 if (current_trampolines != NULL) {
5630 DEL_ARR_F(current_trampolines);
5631 current_trampolines = NULL;
5634 /* create inner functions if any */
5635 entity_t **inner = inner_functions;
5636 if (inner != NULL) {
5637 ir_type *rem_outer_frame = current_outer_frame;
5638 current_outer_frame = get_irg_frame_type(current_ir_graph);
5639 for (int i = ARR_LEN(inner) - 1; i >= 0; --i) {
5640 create_function(inner[i]);
5644 current_outer_frame = rem_outer_frame;
5648 static void scope_to_firm(scope_t *scope)
5650 /* first pass: create declarations */
5651 entity_t *entity = scope->entities;
5652 for ( ; entity != NULL; entity = entity->base.next) {
5653 if (entity->base.symbol == NULL)
5656 if (entity->kind == ENTITY_FUNCTION) {
5657 if (entity->function.btk != BUILTIN_NONE) {
5658 /* builtins have no representation */
5661 (void)get_function_entity(entity, NULL);
5662 } else if (entity->kind == ENTITY_VARIABLE) {
5663 create_global_variable(entity);
5664 } else if (entity->kind == ENTITY_NAMESPACE) {
5665 scope_to_firm(&entity->namespacee.members);
5669 /* second pass: create code/initializers */
5670 entity = scope->entities;
5671 for ( ; entity != NULL; entity = entity->base.next) {
5672 if (entity->base.symbol == NULL)
5675 if (entity->kind == ENTITY_FUNCTION) {
5676 if (entity->function.btk != BUILTIN_NONE) {
5677 /* builtins have no representation */
5680 create_function(entity);
5681 } else if (entity->kind == ENTITY_VARIABLE) {
5682 assert(entity->declaration.kind
5683 == DECLARATION_KIND_GLOBAL_VARIABLE);
5684 current_ir_graph = get_const_code_irg();
5685 create_variable_initializer(entity);
5690 void init_ast2firm(void)
5692 obstack_init(&asm_obst);
5693 init_atomic_modes();
5695 ir_set_debug_retrieve(dbg_retrieve);
5696 ir_set_type_debug_retrieve(dbg_print_type_dbg_info);
5698 /* create idents for all known runtime functions */
5699 for (size_t i = 0; i < lengthof(rts_data); ++i) {
5700 rts_idents[i] = new_id_from_str(rts_data[i].name);
5703 entitymap_init(&entitymap);
5706 static void init_ir_types(void)
5708 static int ir_types_initialized = 0;
5709 if (ir_types_initialized)
5711 ir_types_initialized = 1;
5713 ir_type_char = get_ir_type(type_char);
5714 ir_type_const_char = get_ir_type(type_const_char);
5715 ir_type_wchar_t = get_ir_type(type_wchar_t);
5717 be_params = be_get_backend_param();
5718 mode_float_arithmetic = be_params->mode_float_arithmetic;
5720 stack_param_align = be_params->stack_param_align;
5723 void exit_ast2firm(void)
5725 entitymap_destroy(&entitymap);
5726 obstack_free(&asm_obst, NULL);
5729 static void global_asm_to_firm(statement_t *s)
5731 for (; s != NULL; s = s->base.next) {
5732 assert(s->kind == STATEMENT_ASM);
5734 char const *const text = s->asms.asm_text.begin;
5735 size_t size = s->asms.asm_text.size;
5737 /* skip the last \0 */
5738 if (text[size - 1] == '\0')
5741 ident *const id = new_id_from_chars(text, size);
5746 static const char *get_cwd(void)
5748 static char buf[1024];
5750 getcwd(buf, sizeof(buf));
5754 void translation_unit_to_firm(translation_unit_t *unit)
5756 if (c_mode & _CXX) {
5757 be_dwarf_set_source_language(DW_LANG_C_plus_plus);
5758 } else if (c_mode & _C99) {
5759 be_dwarf_set_source_language(DW_LANG_C99);
5760 } else if (c_mode & _C89) {
5761 be_dwarf_set_source_language(DW_LANG_C89);
5763 be_dwarf_set_source_language(DW_LANG_C);
5765 be_dwarf_set_compilation_directory(get_cwd());
5767 /* initialize firm arithmetic */
5768 tarval_set_integer_overflow_mode(TV_OVERFLOW_WRAP);
5769 ir_set_uninitialized_local_variable_func(uninitialized_local_var);
5771 /* just to be sure */
5772 continue_label = NULL;
5774 current_switch = NULL;
5775 current_translation_unit = unit;
5779 scope_to_firm(&unit->scope);
5780 global_asm_to_firm(unit->global_asm);
5782 current_ir_graph = NULL;
5783 current_translation_unit = NULL;