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;
857 static bool declaration_is_definition(const entity_t *entity)
859 switch (entity->kind) {
860 case ENTITY_VARIABLE:
861 return entity->variable.initializer != NULL;
862 case ENTITY_FUNCTION:
863 return entity->function.statement != NULL;
864 case ENTITY_PARAMETER:
865 case ENTITY_COMPOUND_MEMBER:
869 case ENTITY_ENUM_VALUE:
870 case ENTITY_NAMESPACE:
872 case ENTITY_LOCAL_LABEL:
875 panic("declaration_is_definition called on non-declaration");
879 * Handle GNU attributes for entities
881 * @param ent the entity
882 * @param decl the routine declaration
884 static void handle_decl_modifiers(ir_entity *irentity, entity_t *entity)
886 assert(is_declaration(entity));
887 decl_modifiers_t modifiers = entity->declaration.modifiers;
889 if (is_method_entity(irentity)) {
890 if (modifiers & DM_PURE) {
891 set_entity_additional_properties(irentity, mtp_property_pure);
893 if (modifiers & DM_CONST) {
894 add_entity_additional_properties(irentity, mtp_property_const);
897 if ((modifiers & DM_USED) && declaration_is_definition(entity)) {
898 add_entity_linkage(irentity, IR_LINKAGE_HIDDEN_USER);
900 if ((modifiers & DM_WEAK) && declaration_is_definition(entity)
901 && entity->declaration.storage_class != STORAGE_CLASS_EXTERN) {
902 add_entity_linkage(irentity, IR_LINKAGE_WEAK);
906 static bool is_main(entity_t *entity)
908 static symbol_t *sym_main = NULL;
909 if (sym_main == NULL) {
910 sym_main = symbol_table_insert("main");
913 if (entity->base.symbol != sym_main)
915 /* must be in outermost scope */
916 if (entity->base.parent_scope != ¤t_translation_unit->scope)
923 * Creates an entity representing a function.
925 * @param entity the function declaration/definition
926 * @param owner_type the owner type of this function, NULL
927 * for global functions
929 static ir_entity *get_function_entity(entity_t *entity, ir_type *owner_type)
931 assert(entity->kind == ENTITY_FUNCTION);
932 if (entity->function.irentity != NULL)
933 return entity->function.irentity;
935 switch (entity->function.btk) {
938 case BUILTIN_LIBC_CHECK:
944 symbol_t *symbol = entity->base.symbol;
945 ident *id = new_id_from_str(symbol->string);
947 /* already an entity defined? */
948 ir_entity *irentity = entitymap_get(&entitymap, symbol);
949 bool const has_body = entity->function.statement != NULL;
950 if (irentity != NULL) {
954 ir_type *ir_type_method;
955 if (entity->function.need_closure)
956 ir_type_method = create_method_type(&entity->declaration.type->function, true);
958 ir_type_method = get_ir_type(entity->declaration.type);
960 bool nested_function = false;
961 if (owner_type == NULL)
962 owner_type = get_glob_type();
964 nested_function = true;
966 dbg_info *const dbgi = get_dbg_info(&entity->base.source_position);
967 irentity = new_d_entity(owner_type, id, ir_type_method, dbgi);
971 ld_id = id_unique("inner.%u");
973 ld_id = create_ld_ident(entity);
974 set_entity_ld_ident(irentity, ld_id);
976 handle_decl_modifiers(irentity, entity);
978 if (! nested_function) {
979 storage_class_tag_t const storage_class
980 = (storage_class_tag_t) entity->declaration.storage_class;
981 if (storage_class == STORAGE_CLASS_STATIC) {
982 set_entity_visibility(irentity, ir_visibility_local);
984 set_entity_visibility(irentity, ir_visibility_external);
987 bool const is_inline = entity->function.is_inline;
988 if (is_inline && has_body) {
989 if (((c_mode & _C99) && storage_class == STORAGE_CLASS_NONE)
990 || ((c_mode & _C99) == 0
991 && storage_class == STORAGE_CLASS_EXTERN)) {
992 add_entity_linkage(irentity, IR_LINKAGE_NO_CODEGEN);
996 /* nested functions are always local */
997 set_entity_visibility(irentity, ir_visibility_local);
1000 /* We should check for file scope here, but as long as we compile C only
1001 this is not needed. */
1002 if (!freestanding && !has_body) {
1003 /* check for a known runtime function */
1004 for (size_t i = 0; i < lengthof(rts_data); ++i) {
1005 if (id != rts_idents[i])
1008 function_type_t *function_type
1009 = &entity->declaration.type->function;
1010 /* rts_entities code can't handle a "wrong" number of parameters */
1011 if (function_type->unspecified_parameters)
1014 /* check number of parameters */
1015 int n_params = count_parameters(function_type);
1016 if (n_params != rts_data[i].n_params)
1019 type_t *return_type = skip_typeref(function_type->return_type);
1020 int n_res = is_type_void(return_type) ? 0 : 1;
1021 if (n_res != rts_data[i].n_res)
1024 /* ignore those rts functions not necessary needed for current mode */
1025 if ((c_mode & rts_data[i].flags) == 0)
1027 assert(rts_entities[rts_data[i].id] == NULL);
1028 rts_entities[rts_data[i].id] = irentity;
1032 entitymap_insert(&entitymap, symbol, irentity);
1035 entity->declaration.kind = DECLARATION_KIND_FUNCTION;
1036 entity->function.irentity = irentity;
1042 * Creates a SymConst for a given entity.
1044 * @param dbgi debug info
1045 * @param entity the entity
1047 static ir_node *create_symconst(dbg_info *dbgi, ir_entity *entity)
1049 assert(entity != NULL);
1050 union symconst_symbol sym;
1051 sym.entity_p = entity;
1052 return new_d_SymConst(dbgi, mode_P, sym, symconst_addr_ent);
1055 static ir_node *create_Const_from_bool(ir_mode *const mode, bool const v)
1057 return new_Const((v ? get_mode_one : get_mode_null)(mode));
1060 static ir_node *create_conv_from_b(dbg_info *dbgi, ir_node *value,
1063 if (is_Const(value)) {
1064 return create_Const_from_bool(dest_mode, !is_Const_null(value));
1067 ir_node *cond = new_d_Cond(dbgi, value);
1068 ir_node *proj_true = new_Proj(cond, mode_X, pn_Cond_true);
1069 ir_node *proj_false = new_Proj(cond, mode_X, pn_Cond_false);
1070 ir_node *tblock = new_Block(1, &proj_true);
1071 ir_node *fblock = new_Block(1, &proj_false);
1072 set_cur_block(tblock);
1073 ir_node *const1 = new_Const(get_mode_one(dest_mode));
1074 ir_node *tjump = new_Jmp();
1075 set_cur_block(fblock);
1076 ir_node *const0 = new_Const(get_mode_null(dest_mode));
1077 ir_node *fjump = new_Jmp();
1079 ir_node *in[2] = { tjump, fjump };
1080 ir_node *mergeblock = new_Block(2, in);
1081 set_cur_block(mergeblock);
1082 ir_node *phi_in[2] = { const1, const0 };
1083 ir_node *phi = new_Phi(2, phi_in, dest_mode);
1087 static ir_node *create_conv(dbg_info *dbgi, ir_node *value, ir_mode *dest_mode)
1089 ir_mode *value_mode = get_irn_mode(value);
1091 if (value_mode == dest_mode)
1094 if (dest_mode == mode_b) {
1095 ir_node *zero = new_Const(get_mode_null(value_mode));
1096 ir_node *cmp = new_d_Cmp(dbgi, value, zero, ir_relation_unordered_less_greater);
1098 } else if (value_mode == mode_b) {
1099 return create_conv_from_b(dbgi, value, dest_mode);
1102 return new_d_Conv(dbgi, value, dest_mode);
1106 * Creates a SymConst node representing a wide string literal.
1108 * @param literal the wide string literal
1110 static ir_node *wide_string_literal_to_firm(
1111 const string_literal_expression_t *literal)
1113 ir_type *const global_type = get_glob_type();
1114 ir_type *const elem_type = ir_type_wchar_t;
1115 dbg_info *const dbgi = get_dbg_info(&literal->base.source_position);
1116 ir_type *const type = new_type_array(1, elem_type);
1118 ident *const id = id_unique("str.%u");
1119 ir_entity *const entity = new_d_entity(global_type, id, type, dbgi);
1120 set_entity_ld_ident(entity, id);
1121 set_entity_visibility(entity, ir_visibility_private);
1122 add_entity_linkage(entity, IR_LINKAGE_CONSTANT);
1124 ir_mode *const mode = get_type_mode(elem_type);
1125 const size_t slen = wstrlen(&literal->value);
1127 set_array_lower_bound_int(type, 0, 0);
1128 set_array_upper_bound_int(type, 0, slen);
1129 set_type_size_bytes(type, slen * get_mode_size_bytes(mode));
1130 set_type_state(type, layout_fixed);
1132 ir_initializer_t *initializer = create_initializer_compound(slen);
1133 const char *p = literal->value.begin;
1134 for (size_t i = 0; i < slen; ++i) {
1135 assert(p < literal->value.begin + literal->value.size);
1136 utf32 v = read_utf8_char(&p);
1137 ir_tarval *tv = new_tarval_from_long(v, mode);
1138 ir_initializer_t *val = create_initializer_tarval(tv);
1139 set_initializer_compound_value(initializer, i, val);
1141 set_entity_initializer(entity, initializer);
1143 return create_symconst(dbgi, entity);
1147 * Creates a SymConst node representing a string constant.
1149 * @param src_pos the source position of the string constant
1150 * @param id_prefix a prefix for the name of the generated string constant
1151 * @param value the value of the string constant
1153 static ir_node *string_to_firm(const source_position_t *const src_pos,
1154 const char *const id_prefix,
1155 const string_t *const value)
1157 ir_type *const global_type = get_glob_type();
1158 dbg_info *const dbgi = get_dbg_info(src_pos);
1159 ir_type *const type = new_type_array(1, ir_type_const_char);
1161 ident *const id = id_unique(id_prefix);
1162 ir_entity *const entity = new_d_entity(global_type, id, type, dbgi);
1163 set_entity_ld_ident(entity, id);
1164 set_entity_visibility(entity, ir_visibility_private);
1165 add_entity_linkage(entity, IR_LINKAGE_CONSTANT);
1167 ir_type *const elem_type = ir_type_const_char;
1168 ir_mode *const mode = get_type_mode(elem_type);
1170 const char* const string = value->begin;
1171 const size_t slen = value->size;
1173 set_array_lower_bound_int(type, 0, 0);
1174 set_array_upper_bound_int(type, 0, slen);
1175 set_type_size_bytes(type, slen);
1176 set_type_state(type, layout_fixed);
1178 ir_initializer_t *initializer = create_initializer_compound(slen);
1179 for (size_t i = 0; i < slen; ++i) {
1180 ir_tarval *tv = new_tarval_from_long(string[i], mode);
1181 ir_initializer_t *val = create_initializer_tarval(tv);
1182 set_initializer_compound_value(initializer, i, val);
1184 set_entity_initializer(entity, initializer);
1186 return create_symconst(dbgi, entity);
1189 static bool try_create_integer(literal_expression_t *literal,
1190 type_t *type, unsigned char base)
1192 const char *string = literal->value.begin;
1193 size_t size = literal->value.size;
1195 assert(type->kind == TYPE_ATOMIC);
1196 atomic_type_kind_t akind = type->atomic.akind;
1198 ir_mode *mode = atomic_modes[akind];
1199 ir_tarval *tv = new_integer_tarval_from_str(string, size, 1, base, mode);
1200 if (tv == tarval_bad)
1203 literal->base.type = type;
1204 literal->target_value = tv;
1208 static void create_integer_tarval(literal_expression_t *literal)
1210 /* -1: signed only, 0: any, 1: unsigned only */
1211 int sign = literal->base.kind == EXPR_LITERAL_INTEGER ? -1 : 0;
1213 const string_t *suffix = &literal->suffix;
1215 if (suffix->size > 0) {
1216 for (const char *c = suffix->begin; *c != '\0'; ++c) {
1217 if (*c == 'u' || *c == 'U') sign = 1;
1218 if (*c == 'l' || *c == 'L') { ++ls; }
1223 switch (literal->base.kind) {
1224 case EXPR_LITERAL_INTEGER_OCTAL: base = 8; break;
1225 case EXPR_LITERAL_INTEGER: base = 10; break;
1226 case EXPR_LITERAL_INTEGER_HEXADECIMAL: base = 16; break;
1227 default: panic("invalid literal kind");
1230 tarval_int_overflow_mode_t old_mode = tarval_get_integer_overflow_mode();
1232 /* now try if the constant is small enough for some types */
1233 tarval_set_integer_overflow_mode(TV_OVERFLOW_BAD);
1235 if (sign <= 0 && try_create_integer(literal, type_int, base))
1237 if (sign >= 0 && try_create_integer(literal, type_unsigned_int, base))
1241 if (sign <= 0 && try_create_integer(literal, type_long, base))
1243 if (sign >= 0 && try_create_integer(literal, type_unsigned_long, base))
1246 /* last try? then we should not report tarval_bad */
1248 tarval_set_integer_overflow_mode(TV_OVERFLOW_WRAP);
1249 if (sign <= 0 && try_create_integer(literal, type_long_long, base))
1254 tarval_set_integer_overflow_mode(TV_OVERFLOW_WRAP);
1255 bool res = try_create_integer(literal, type_unsigned_long_long, base);
1257 panic("internal error when parsing number literal");
1260 tarval_set_integer_overflow_mode(old_mode);
1263 void determine_literal_type(literal_expression_t *literal)
1265 switch (literal->base.kind) {
1266 case EXPR_LITERAL_INTEGER:
1267 case EXPR_LITERAL_INTEGER_OCTAL:
1268 case EXPR_LITERAL_INTEGER_HEXADECIMAL:
1269 create_integer_tarval(literal);
1277 * Creates a Const node representing a constant.
1279 static ir_node *literal_to_firm(const literal_expression_t *literal)
1281 type_t *type = skip_typeref(literal->base.type);
1282 ir_mode *mode = get_ir_mode_storage(type);
1283 const char *string = literal->value.begin;
1284 size_t size = literal->value.size;
1287 switch (literal->base.kind) {
1288 case EXPR_LITERAL_WIDE_CHARACTER: {
1289 utf32 v = read_utf8_char(&string);
1291 size_t len = snprintf(buf, sizeof(buf), UTF32_PRINTF_FORMAT, v);
1293 tv = new_tarval_from_str(buf, len, mode);
1297 case EXPR_LITERAL_CHARACTER: {
1300 = get_atomic_type_flags(ATOMIC_TYPE_CHAR) & ATOMIC_TYPE_FLAG_SIGNED;
1301 if (size == 1 && char_is_signed) {
1302 v = (signed char)string[0];
1305 for (size_t i = 0; i < size; ++i) {
1306 v = (v << 8) | ((unsigned char)string[i]);
1310 size_t len = snprintf(buf, sizeof(buf), "%lld", v);
1312 tv = new_tarval_from_str(buf, len, mode);
1316 case EXPR_LITERAL_INTEGER:
1317 case EXPR_LITERAL_INTEGER_OCTAL:
1318 case EXPR_LITERAL_INTEGER_HEXADECIMAL:
1319 assert(literal->target_value != NULL);
1320 tv = literal->target_value;
1323 case EXPR_LITERAL_FLOATINGPOINT:
1324 tv = new_tarval_from_str(string, size, mode);
1327 case EXPR_LITERAL_FLOATINGPOINT_HEXADECIMAL: {
1328 char buffer[size + 2];
1329 memcpy(buffer, "0x", 2);
1330 memcpy(buffer+2, string, size);
1331 tv = new_tarval_from_str(buffer, size+2, mode);
1335 case EXPR_LITERAL_BOOLEAN:
1336 if (string[0] == 't') {
1337 tv = get_mode_one(mode);
1339 assert(string[0] == 'f');
1340 case EXPR_LITERAL_MS_NOOP:
1341 tv = get_mode_null(mode);
1346 panic("Invalid literal kind found");
1349 dbg_info *dbgi = get_dbg_info(&literal->base.source_position);
1350 ir_node *res = new_d_Const(dbgi, tv);
1351 ir_mode *mode_arith = get_ir_mode_arithmetic(type);
1352 return create_conv(dbgi, res, mode_arith);
1356 * Allocate an area of size bytes aligned at alignment
1359 static ir_entity *alloc_trampoline(ir_type *frame_type, int size, unsigned alignment)
1361 static unsigned area_cnt = 0;
1364 ir_type *tp = new_type_array(1, ir_type_char);
1365 set_array_bounds_int(tp, 0, 0, size);
1366 set_type_alignment_bytes(tp, alignment);
1368 snprintf(buf, sizeof(buf), "trampolin%u", area_cnt++);
1369 ident *name = new_id_from_str(buf);
1370 ir_entity *area = new_entity(frame_type, name, tp);
1372 /* mark this entity as compiler generated */
1373 set_entity_compiler_generated(area, 1);
1378 * Return a node representing a trampoline region
1379 * for a given function entity.
1381 * @param dbgi debug info
1382 * @param entity the function entity
1384 static ir_node *get_trampoline_region(dbg_info *dbgi, ir_entity *entity)
1386 ir_entity *region = NULL;
1389 if (current_trampolines != NULL) {
1390 for (i = ARR_LEN(current_trampolines) - 1; i >= 0; --i) {
1391 if (current_trampolines[i].function == entity) {
1392 region = current_trampolines[i].region;
1397 current_trampolines = NEW_ARR_F(trampoline_region, 0);
1399 ir_graph *irg = current_ir_graph;
1400 if (region == NULL) {
1401 /* create a new region */
1402 ir_type *frame_tp = get_irg_frame_type(irg);
1403 trampoline_region reg;
1404 reg.function = entity;
1406 reg.region = alloc_trampoline(frame_tp,
1407 be_params->trampoline_size,
1408 be_params->trampoline_align);
1409 ARR_APP1(trampoline_region, current_trampolines, reg);
1410 region = reg.region;
1412 return new_d_simpleSel(dbgi, get_irg_no_mem(irg), get_irg_frame(irg),
1417 * Creates a trampoline for a function represented by an entity.
1419 * @param dbgi debug info
1420 * @param mode the (reference) mode for the function address
1421 * @param entity the function entity
1423 static ir_node *create_trampoline(dbg_info *dbgi, ir_mode *mode,
1426 assert(entity != NULL);
1428 in[0] = get_trampoline_region(dbgi, entity);
1429 in[1] = create_symconst(dbgi, entity);
1430 in[2] = get_irg_frame(current_ir_graph);
1432 ir_node *irn = new_d_Builtin(dbgi, get_store(), 3, in, ir_bk_inner_trampoline, get_unknown_type());
1433 set_store(new_Proj(irn, mode_M, pn_Builtin_M));
1434 return new_Proj(irn, mode, pn_Builtin_max+1);
1438 * Dereference an address.
1440 * @param dbgi debug info
1441 * @param type the type of the dereferenced result (the points_to type)
1442 * @param addr the address to dereference
1444 static ir_node *deref_address(dbg_info *const dbgi, type_t *const type,
1445 ir_node *const addr)
1447 type_t *skipped = skip_typeref(type);
1448 if (is_type_incomplete(skipped))
1451 ir_type *irtype = get_ir_type(skipped);
1452 if (is_compound_type(irtype)
1453 || is_Method_type(irtype)
1454 || is_Array_type(irtype)) {
1458 ir_cons_flags flags = skipped->base.qualifiers & TYPE_QUALIFIER_VOLATILE
1459 ? cons_volatile : cons_none;
1460 ir_mode *const mode = get_type_mode(irtype);
1461 ir_node *const memory = get_store();
1462 ir_node *const load = new_d_Load(dbgi, memory, addr, mode, flags);
1463 ir_node *const load_mem = new_d_Proj(dbgi, load, mode_M, pn_Load_M);
1464 ir_node *const load_res = new_d_Proj(dbgi, load, mode, pn_Load_res);
1466 set_store(load_mem);
1468 ir_mode *const mode_arithmetic = get_ir_mode_arithmetic(skipped);
1469 return create_conv(dbgi, load_res, mode_arithmetic);
1473 * Creates a strict Conv (to the node's mode) if necessary.
1475 * @param dbgi debug info
1476 * @param node the node to strict conv
1478 static ir_node *do_strict_conv(dbg_info *dbgi, ir_node *node)
1480 ir_mode *mode = get_irn_mode(node);
1482 if (!(get_irg_fp_model(current_ir_graph) & fp_explicit_rounding))
1484 if (!mode_is_float(mode))
1487 /* check if there is already a Conv */
1488 if (is_Conv(node)) {
1489 /* convert it into a strict Conv */
1490 set_Conv_strict(node, 1);
1494 /* otherwise create a new one */
1495 return new_d_strictConv(dbgi, node, mode);
1499 * Returns the correct base address depending on whether it is a parameter or a
1500 * normal local variable.
1502 static ir_node *get_local_frame(ir_entity *const ent)
1504 ir_graph *const irg = current_ir_graph;
1505 const ir_type *const owner = get_entity_owner(ent);
1506 if (owner == current_outer_frame) {
1507 assert(current_static_link != NULL);
1508 return current_static_link;
1510 return get_irg_frame(irg);
1515 * Keep all memory edges of the given block.
1517 static void keep_all_memory(ir_node *block)
1519 ir_node *old = get_cur_block();
1521 set_cur_block(block);
1522 keep_alive(get_store());
1523 /* TODO: keep all memory edges from restricted pointers */
1527 static ir_node *enum_constant_to_firm(reference_expression_t const *const ref)
1529 entity_t *entity = ref->entity;
1530 if (entity->enum_value.tv == NULL) {
1531 type_t *type = skip_typeref(entity->enum_value.enum_type);
1532 assert(type->kind == TYPE_ENUM);
1533 determine_enum_values(&type->enumt);
1536 return new_Const(entity->enum_value.tv);
1539 static ir_node *reference_expression_to_firm(const reference_expression_t *ref)
1541 dbg_info *dbgi = get_dbg_info(&ref->base.source_position);
1542 entity_t *entity = ref->entity;
1543 assert(is_declaration(entity));
1544 type_t *type = skip_typeref(entity->declaration.type);
1546 /* make sure the type is constructed */
1547 (void) get_ir_type(type);
1549 if (entity->kind == ENTITY_FUNCTION
1550 && entity->function.btk != BUILTIN_NONE) {
1551 ir_entity *irentity = get_function_entity(entity, NULL);
1552 /* for gcc compatibility we have to produce (dummy) addresses for some
1553 * builtins which don't have entities */
1554 if (irentity == NULL) {
1555 source_position_t const *const pos = &ref->base.source_position;
1556 symbol_t const *const sym = ref->entity->base.symbol;
1557 warningf(WARN_OTHER, pos, "taking address of builtin '%Y'", sym);
1559 /* simply create a NULL pointer */
1560 ir_mode *mode = get_ir_mode_arithmetic(type_void_ptr);
1561 ir_node *res = new_Const(get_mode_null(mode));
1567 switch ((declaration_kind_t) entity->declaration.kind) {
1568 case DECLARATION_KIND_UNKNOWN:
1571 case DECLARATION_KIND_LOCAL_VARIABLE: {
1572 ir_mode *const mode = get_ir_mode_storage(type);
1573 ir_node *const value = get_value(entity->variable.v.value_number, mode);
1574 return create_conv(NULL, value, get_ir_mode_arithmetic(type));
1576 case DECLARATION_KIND_PARAMETER: {
1577 ir_mode *const mode = get_ir_mode_storage(type);
1578 ir_node *const value = get_value(entity->parameter.v.value_number,mode);
1579 return create_conv(NULL, value, get_ir_mode_arithmetic(type));
1581 case DECLARATION_KIND_FUNCTION: {
1582 return create_symconst(dbgi, entity->function.irentity);
1584 case DECLARATION_KIND_INNER_FUNCTION: {
1585 ir_mode *const mode = get_ir_mode_storage(type);
1586 if (!entity->function.goto_to_outer && !entity->function.need_closure) {
1587 /* inner function not using the closure */
1588 return create_symconst(dbgi, entity->function.irentity);
1590 /* need trampoline here */
1591 return create_trampoline(dbgi, mode, entity->function.irentity);
1594 case DECLARATION_KIND_GLOBAL_VARIABLE: {
1595 const variable_t *variable = &entity->variable;
1596 ir_node *const addr = create_symconst(dbgi, variable->v.entity);
1597 return deref_address(dbgi, variable->base.type, addr);
1600 case DECLARATION_KIND_LOCAL_VARIABLE_ENTITY: {
1601 ir_entity *irentity = entity->variable.v.entity;
1602 ir_node *frame = get_local_frame(irentity);
1603 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, irentity);
1604 return deref_address(dbgi, entity->declaration.type, sel);
1606 case DECLARATION_KIND_PARAMETER_ENTITY: {
1607 ir_entity *irentity = entity->parameter.v.entity;
1608 ir_node *frame = get_local_frame(irentity);
1609 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, irentity);
1610 return deref_address(dbgi, entity->declaration.type, sel);
1613 case DECLARATION_KIND_VARIABLE_LENGTH_ARRAY:
1614 return entity->variable.v.vla_base;
1616 case DECLARATION_KIND_COMPOUND_MEMBER:
1617 panic("not implemented reference type");
1620 panic("reference to declaration with unknown type found");
1623 static ir_node *reference_addr(const reference_expression_t *ref)
1625 dbg_info *dbgi = get_dbg_info(&ref->base.source_position);
1626 entity_t *entity = ref->entity;
1627 assert(is_declaration(entity));
1629 switch((declaration_kind_t) entity->declaration.kind) {
1630 case DECLARATION_KIND_UNKNOWN:
1632 case DECLARATION_KIND_PARAMETER:
1633 case DECLARATION_KIND_LOCAL_VARIABLE:
1634 /* you can store to a local variable (so we don't panic but return NULL
1635 * as an indicator for no real address) */
1637 case DECLARATION_KIND_GLOBAL_VARIABLE: {
1638 ir_node *const addr = create_symconst(dbgi, entity->variable.v.entity);
1641 case DECLARATION_KIND_LOCAL_VARIABLE_ENTITY: {
1642 ir_entity *irentity = entity->variable.v.entity;
1643 ir_node *frame = get_local_frame(irentity);
1644 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, irentity);
1648 case DECLARATION_KIND_PARAMETER_ENTITY: {
1649 ir_entity *irentity = entity->parameter.v.entity;
1650 ir_node *frame = get_local_frame(irentity);
1651 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, irentity);
1656 case DECLARATION_KIND_VARIABLE_LENGTH_ARRAY:
1657 return entity->variable.v.vla_base;
1659 case DECLARATION_KIND_FUNCTION: {
1660 return create_symconst(dbgi, entity->function.irentity);
1663 case DECLARATION_KIND_INNER_FUNCTION: {
1664 type_t *const type = skip_typeref(entity->declaration.type);
1665 ir_mode *const mode = get_ir_mode_storage(type);
1666 if (!entity->function.goto_to_outer && !entity->function.need_closure) {
1667 /* inner function not using the closure */
1668 return create_symconst(dbgi, entity->function.irentity);
1670 /* need trampoline here */
1671 return create_trampoline(dbgi, mode, entity->function.irentity);
1675 case DECLARATION_KIND_COMPOUND_MEMBER:
1676 panic("not implemented reference type");
1679 panic("reference to declaration with unknown type found");
1683 * Transform calls to builtin functions.
1685 static ir_node *process_builtin_call(const call_expression_t *call)
1687 dbg_info *dbgi = get_dbg_info(&call->base.source_position);
1689 assert(call->function->kind == EXPR_REFERENCE);
1690 reference_expression_t *builtin = &call->function->reference;
1692 type_t *expr_type = skip_typeref(builtin->base.type);
1693 assert(is_type_pointer(expr_type));
1695 type_t *function_type = skip_typeref(expr_type->pointer.points_to);
1697 switch (builtin->entity->function.btk) {
1700 case BUILTIN_ALLOCA: {
1701 expression_t *argument = call->arguments->expression;
1702 ir_node *size = expression_to_firm(argument);
1704 ir_node *store = get_store();
1705 ir_node *alloca = new_d_Alloc(dbgi, store, size, get_unknown_type(),
1707 ir_node *proj_m = new_Proj(alloca, mode_M, pn_Alloc_M);
1709 ir_node *res = new_Proj(alloca, mode_P_data, pn_Alloc_res);
1714 type_t *type = function_type->function.return_type;
1715 ir_mode *mode = get_ir_mode_arithmetic(type);
1716 ir_tarval *tv = get_mode_infinite(mode);
1717 ir_node *res = new_d_Const(dbgi, tv);
1721 /* Ignore string for now... */
1722 assert(is_type_function(function_type));
1723 type_t *type = function_type->function.return_type;
1724 ir_mode *mode = get_ir_mode_arithmetic(type);
1725 ir_tarval *tv = get_mode_NAN(mode);
1726 ir_node *res = new_d_Const(dbgi, tv);
1729 case BUILTIN_EXPECT: {
1730 expression_t *argument = call->arguments->expression;
1731 return _expression_to_firm(argument);
1733 case BUILTIN_VA_END:
1734 /* evaluate the argument of va_end for its side effects */
1735 _expression_to_firm(call->arguments->expression);
1737 case BUILTIN_OBJECT_SIZE: {
1738 /* determine value of "type" */
1739 expression_t *type_expression = call->arguments->next->expression;
1740 long type_val = fold_constant_to_int(type_expression);
1741 type_t *type = function_type->function.return_type;
1742 ir_mode *mode = get_ir_mode_arithmetic(type);
1743 /* just produce a "I don't know" result */
1744 ir_tarval *result = type_val & 2 ? get_mode_null(mode) :
1745 get_mode_minus_one(mode);
1747 return new_d_Const(dbgi, result);
1749 case BUILTIN_ROTL: {
1750 ir_node *val = expression_to_firm(call->arguments->expression);
1751 ir_node *shf = expression_to_firm(call->arguments->next->expression);
1752 ir_mode *mode = get_irn_mode(val);
1753 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
1754 return new_d_Rotl(dbgi, val, create_conv(dbgi, shf, mode_uint), mode);
1756 case BUILTIN_ROTR: {
1757 ir_node *val = expression_to_firm(call->arguments->expression);
1758 ir_node *shf = expression_to_firm(call->arguments->next->expression);
1759 ir_mode *mode = get_irn_mode(val);
1760 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
1761 ir_node *c = new_Const_long(mode_uint, get_mode_size_bits(mode));
1762 ir_node *sub = new_d_Sub(dbgi, c, create_conv(dbgi, shf, mode_uint), mode_uint);
1763 return new_d_Rotl(dbgi, val, sub, mode);
1768 case BUILTIN_LIBC_CHECK:
1769 panic("builtin did not produce an entity");
1771 panic("invalid builtin found");
1775 * Transform a call expression.
1776 * Handles some special cases, like alloca() calls, which must be resolved
1777 * BEFORE the inlines runs. Inlining routines calling alloca() is dangerous,
1778 * 176.gcc for instance might allocate 2GB instead of 256 MB if alloca is not
1781 static ir_node *call_expression_to_firm(const call_expression_t *const call)
1783 dbg_info *const dbgi = get_dbg_info(&call->base.source_position);
1784 assert(currently_reachable());
1786 expression_t *function = call->function;
1787 ir_node *callee = NULL;
1788 bool firm_builtin = false;
1789 ir_builtin_kind firm_builtin_kind = ir_bk_trap;
1790 if (function->kind == EXPR_REFERENCE) {
1791 const reference_expression_t *ref = &function->reference;
1792 entity_t *entity = ref->entity;
1794 if (entity->kind == ENTITY_FUNCTION) {
1795 builtin_kind_t builtin = entity->function.btk;
1796 if (builtin == BUILTIN_FIRM) {
1797 firm_builtin = true;
1798 firm_builtin_kind = entity->function.b.firm_builtin_kind;
1799 } else if (builtin != BUILTIN_NONE && builtin != BUILTIN_LIBC
1800 && builtin != BUILTIN_LIBC_CHECK) {
1801 return process_builtin_call(call);
1806 callee = expression_to_firm(function);
1808 type_t *type = skip_typeref(function->base.type);
1809 assert(is_type_pointer(type));
1810 pointer_type_t *pointer_type = &type->pointer;
1811 type_t *points_to = skip_typeref(pointer_type->points_to);
1812 assert(is_type_function(points_to));
1813 function_type_t *function_type = &points_to->function;
1815 int n_parameters = 0;
1816 ir_type *ir_method_type = get_ir_type((type_t*) function_type);
1817 ir_type *new_method_type = NULL;
1818 if (function_type->variadic || function_type->unspecified_parameters) {
1819 const call_argument_t *argument = call->arguments;
1820 for ( ; argument != NULL; argument = argument->next) {
1824 /* we need to construct a new method type matching the call
1826 type_dbg_info *tdbgi = get_type_dbg_info_((const type_t*) function_type);
1827 int n_res = get_method_n_ress(ir_method_type);
1828 new_method_type = new_d_type_method(n_parameters, n_res, tdbgi);
1829 set_method_calling_convention(new_method_type,
1830 get_method_calling_convention(ir_method_type));
1831 set_method_additional_properties(new_method_type,
1832 get_method_additional_properties(ir_method_type));
1833 set_method_variadicity(new_method_type,
1834 get_method_variadicity(ir_method_type));
1836 for (int i = 0; i < n_res; ++i) {
1837 set_method_res_type(new_method_type, i,
1838 get_method_res_type(ir_method_type, i));
1840 argument = call->arguments;
1841 for (int i = 0; i < n_parameters; ++i, argument = argument->next) {
1842 expression_t *expression = argument->expression;
1843 ir_type *irtype = get_ir_type(expression->base.type);
1844 set_method_param_type(new_method_type, i, irtype);
1846 ir_method_type = new_method_type;
1848 n_parameters = get_method_n_params(ir_method_type);
1851 ir_node *in[n_parameters];
1853 const call_argument_t *argument = call->arguments;
1854 for (int n = 0; n < n_parameters; ++n) {
1855 expression_t *expression = argument->expression;
1856 ir_node *arg_node = expression_to_firm(expression);
1858 type_t *arg_type = skip_typeref(expression->base.type);
1859 if (!is_type_compound(arg_type)) {
1860 ir_mode *const mode = get_ir_mode_storage(arg_type);
1861 arg_node = create_conv(dbgi, arg_node, mode);
1862 arg_node = do_strict_conv(dbgi, arg_node);
1867 argument = argument->next;
1871 if (function_type->modifiers & DM_CONST) {
1872 store = get_irg_no_mem(current_ir_graph);
1874 store = get_store();
1878 type_t *return_type = skip_typeref(function_type->return_type);
1879 ir_node *result = NULL;
1881 node = new_d_Builtin(dbgi, store, n_parameters, in, firm_builtin_kind,
1883 if (! (function_type->modifiers & DM_CONST)) {
1884 ir_node *mem = new_Proj(node, mode_M, pn_Builtin_M);
1888 if (!is_type_void(return_type)) {
1889 assert(is_type_scalar(return_type));
1890 ir_mode *mode = get_ir_mode_storage(return_type);
1891 result = new_Proj(node, mode, pn_Builtin_max+1);
1892 ir_mode *mode_arith = get_ir_mode_arithmetic(return_type);
1893 result = create_conv(NULL, result, mode_arith);
1896 node = new_d_Call(dbgi, store, callee, n_parameters, in, ir_method_type);
1897 if (! (function_type->modifiers & DM_CONST)) {
1898 ir_node *mem = new_Proj(node, mode_M, pn_Call_M);
1902 if (!is_type_void(return_type)) {
1903 ir_node *const resproj = new_Proj(node, mode_T, pn_Call_T_result);
1904 ir_mode *const mode = get_ir_mode_storage(return_type);
1905 result = new_Proj(resproj, mode, 0);
1906 ir_mode *const mode_arith = get_ir_mode_arithmetic(return_type);
1907 result = create_conv(NULL, result, mode_arith);
1911 if (function_type->modifiers & DM_NORETURN) {
1912 /* A dead end: Keep the Call and the Block. Also place all further
1913 * nodes into a new and unreachable block. */
1915 keep_alive(get_cur_block());
1916 ir_node *block = new_Block(0, NULL);
1917 set_cur_block(block);
1923 static ir_node *statement_to_firm(statement_t *statement);
1924 static ir_node *compound_statement_to_firm(compound_statement_t *compound);
1926 static ir_node *expression_to_addr(const expression_t *expression);
1927 static ir_node *create_condition_evaluation(const expression_t *expression,
1928 ir_node *true_block,
1929 ir_node *false_block);
1931 static void assign_value(dbg_info *dbgi, ir_node *addr, type_t *type,
1934 if (!is_type_compound(type)) {
1935 ir_mode *mode = get_ir_mode_storage(type);
1936 value = create_conv(dbgi, value, mode);
1937 value = do_strict_conv(dbgi, value);
1940 ir_node *memory = get_store();
1942 if (is_type_scalar(type)) {
1943 ir_cons_flags flags = type->base.qualifiers & TYPE_QUALIFIER_VOLATILE
1944 ? cons_volatile : cons_none;
1945 ir_node *store = new_d_Store(dbgi, memory, addr, value, flags);
1946 ir_node *store_mem = new_d_Proj(dbgi, store, mode_M, pn_Store_M);
1947 set_store(store_mem);
1949 ir_type *irtype = get_ir_type(type);
1950 ir_node *copyb = new_d_CopyB(dbgi, memory, addr, value, irtype);
1951 ir_node *copyb_mem = new_Proj(copyb, mode_M, pn_CopyB_M);
1952 set_store(copyb_mem);
1956 static ir_tarval *create_bitfield_mask(ir_mode *mode, int offset, int size)
1958 ir_tarval *all_one = get_mode_all_one(mode);
1959 int mode_size = get_mode_size_bits(mode);
1960 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
1962 assert(offset >= 0);
1964 assert(offset + size <= mode_size);
1965 if (size == mode_size) {
1969 long shiftr = get_mode_size_bits(mode) - size;
1970 long shiftl = offset;
1971 ir_tarval *tv_shiftr = new_tarval_from_long(shiftr, mode_uint);
1972 ir_tarval *tv_shiftl = new_tarval_from_long(shiftl, mode_uint);
1973 ir_tarval *mask0 = tarval_shr(all_one, tv_shiftr);
1974 ir_tarval *mask1 = tarval_shl(mask0, tv_shiftl);
1979 static ir_node *bitfield_store_to_firm(dbg_info *dbgi,
1980 ir_entity *entity, ir_node *addr, ir_node *value, bool set_volatile,
1983 ir_type *entity_type = get_entity_type(entity);
1984 ir_type *base_type = get_primitive_base_type(entity_type);
1985 ir_mode *mode = get_type_mode(base_type);
1986 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
1988 value = create_conv(dbgi, value, mode);
1990 /* kill upper bits of value and shift to right position */
1991 unsigned bitoffset = get_entity_offset_bits_remainder(entity);
1992 unsigned bitsize = get_mode_size_bits(get_type_mode(entity_type));
1993 unsigned base_bits = get_mode_size_bits(mode);
1994 unsigned shiftwidth = base_bits - bitsize;
1996 ir_node *shiftcount = new_Const_long(mode_uint, shiftwidth);
1997 ir_node *shiftl = new_d_Shl(dbgi, value, shiftcount, mode);
1999 unsigned shrwidth = base_bits - bitsize - bitoffset;
2000 ir_node *shrconst = new_Const_long(mode_uint, shrwidth);
2001 ir_node *shiftr = new_d_Shr(dbgi, shiftl, shrconst, mode);
2003 /* load current value */
2004 ir_node *mem = get_store();
2005 ir_node *load = new_d_Load(dbgi, mem, addr, mode,
2006 set_volatile ? cons_volatile : cons_none);
2007 ir_node *load_mem = new_d_Proj(dbgi, load, mode_M, pn_Load_M);
2008 ir_node *load_res = new_d_Proj(dbgi, load, mode, pn_Load_res);
2009 ir_tarval *shift_mask = create_bitfield_mask(mode, bitoffset, bitsize);
2010 ir_tarval *inv_mask = tarval_not(shift_mask);
2011 ir_node *inv_mask_node = new_d_Const(dbgi, inv_mask);
2012 ir_node *load_res_masked = new_d_And(dbgi, load_res, inv_mask_node, mode);
2014 /* construct new value and store */
2015 ir_node *new_val = new_d_Or(dbgi, load_res_masked, shiftr, mode);
2016 ir_node *store = new_d_Store(dbgi, load_mem, addr, new_val,
2017 set_volatile ? cons_volatile : cons_none);
2018 ir_node *store_mem = new_d_Proj(dbgi, store, mode_M, pn_Store_M);
2019 set_store(store_mem);
2025 ir_node *count_res_shr = new_Const_long(mode_uint, base_bits - bitsize);
2026 if (mode_is_signed(mode)) {
2027 res_shr = new_d_Shrs(dbgi, shiftl, count_res_shr, mode);
2029 res_shr = new_d_Shr(dbgi, shiftl, count_res_shr, mode);
2034 static ir_node *bitfield_extract_to_firm(const select_expression_t *expression,
2037 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2038 entity_t *entity = expression->compound_entry;
2039 type_t *base_type = entity->declaration.type;
2040 ir_mode *mode = get_ir_mode_storage(base_type);
2041 ir_node *mem = get_store();
2042 ir_node *load = new_d_Load(dbgi, mem, addr, mode, cons_none);
2043 ir_node *load_mem = new_d_Proj(dbgi, load, mode_M, pn_Load_M);
2044 ir_node *load_res = new_d_Proj(dbgi, load, mode, pn_Load_res);
2045 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
2047 ir_mode *amode = mode;
2048 /* optimisation, since shifting in modes < machine_size is usually
2050 if (get_mode_size_bits(amode) < get_mode_size_bits(mode_uint)) {
2053 unsigned amode_size = get_mode_size_bits(amode);
2054 load_res = create_conv(dbgi, load_res, amode);
2056 set_store(load_mem);
2058 /* kill upper bits */
2059 assert(expression->compound_entry->kind == ENTITY_COMPOUND_MEMBER);
2060 unsigned bitoffset = entity->compound_member.bit_offset;
2061 unsigned bitsize = entity->compound_member.bit_size;
2062 unsigned shift_bitsl = amode_size - bitoffset - bitsize;
2063 ir_tarval *tvl = new_tarval_from_long((long)shift_bitsl, mode_uint);
2064 ir_node *countl = new_d_Const(dbgi, tvl);
2065 ir_node *shiftl = new_d_Shl(dbgi, load_res, countl, amode);
2067 unsigned shift_bitsr = bitoffset + shift_bitsl;
2068 assert(shift_bitsr <= amode_size);
2069 ir_tarval *tvr = new_tarval_from_long((long)shift_bitsr, mode_uint);
2070 ir_node *countr = new_d_Const(dbgi, tvr);
2072 if (mode_is_signed(mode)) {
2073 shiftr = new_d_Shrs(dbgi, shiftl, countr, amode);
2075 shiftr = new_d_Shr(dbgi, shiftl, countr, amode);
2078 type_t *type = expression->base.type;
2079 ir_mode *resmode = get_ir_mode_arithmetic(type);
2080 return create_conv(dbgi, shiftr, resmode);
2083 /* make sure the selected compound type is constructed */
2084 static void construct_select_compound(const select_expression_t *expression)
2086 type_t *type = skip_typeref(expression->compound->base.type);
2087 if (is_type_pointer(type)) {
2088 type = type->pointer.points_to;
2090 (void) get_ir_type(type);
2093 static ir_node *set_value_for_expression_addr(const expression_t *expression,
2094 ir_node *value, ir_node *addr)
2096 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2097 type_t *type = skip_typeref(expression->base.type);
2099 if (!is_type_compound(type)) {
2100 ir_mode *mode = get_ir_mode_storage(type);
2101 value = create_conv(dbgi, value, mode);
2102 value = do_strict_conv(dbgi, value);
2105 if (expression->kind == EXPR_REFERENCE) {
2106 const reference_expression_t *ref = &expression->reference;
2108 entity_t *entity = ref->entity;
2109 assert(is_declaration(entity));
2110 assert(entity->declaration.kind != DECLARATION_KIND_UNKNOWN);
2111 if (entity->declaration.kind == DECLARATION_KIND_LOCAL_VARIABLE) {
2112 set_value(entity->variable.v.value_number, value);
2114 } else if (entity->declaration.kind == DECLARATION_KIND_PARAMETER) {
2115 set_value(entity->parameter.v.value_number, value);
2121 addr = expression_to_addr(expression);
2122 assert(addr != NULL);
2124 if (expression->kind == EXPR_SELECT) {
2125 const select_expression_t *select = &expression->select;
2127 construct_select_compound(select);
2129 entity_t *entity = select->compound_entry;
2130 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
2131 if (entity->compound_member.bitfield) {
2132 ir_entity *irentity = entity->compound_member.entity;
2134 = select->base.type->base.qualifiers & TYPE_QUALIFIER_VOLATILE;
2135 value = bitfield_store_to_firm(dbgi, irentity, addr, value,
2136 set_volatile, true);
2141 assign_value(dbgi, addr, type, value);
2145 static void set_value_for_expression(const expression_t *expression,
2148 set_value_for_expression_addr(expression, value, NULL);
2151 static ir_node *get_value_from_lvalue(const expression_t *expression,
2154 if (expression->kind == EXPR_REFERENCE) {
2155 const reference_expression_t *ref = &expression->reference;
2157 entity_t *entity = ref->entity;
2158 assert(entity->kind == ENTITY_VARIABLE
2159 || entity->kind == ENTITY_PARAMETER);
2160 assert(entity->declaration.kind != DECLARATION_KIND_UNKNOWN);
2162 if (entity->declaration.kind == DECLARATION_KIND_LOCAL_VARIABLE) {
2163 value_number = entity->variable.v.value_number;
2164 assert(addr == NULL);
2165 type_t *type = skip_typeref(expression->base.type);
2166 ir_mode *mode = get_ir_mode_storage(type);
2167 ir_node *res = get_value(value_number, mode);
2168 return create_conv(NULL, res, get_ir_mode_arithmetic(type));
2169 } else if (entity->declaration.kind == DECLARATION_KIND_PARAMETER) {
2170 value_number = entity->parameter.v.value_number;
2171 assert(addr == NULL);
2172 type_t *type = skip_typeref(expression->base.type);
2173 ir_mode *mode = get_ir_mode_storage(type);
2174 ir_node *res = get_value(value_number, mode);
2175 return create_conv(NULL, res, get_ir_mode_arithmetic(type));
2179 assert(addr != NULL);
2180 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2183 if (expression->kind == EXPR_SELECT &&
2184 expression->select.compound_entry->compound_member.bitfield) {
2185 construct_select_compound(&expression->select);
2186 value = bitfield_extract_to_firm(&expression->select, addr);
2188 value = deref_address(dbgi, expression->base.type, addr);
2195 static ir_node *create_incdec(const unary_expression_t *expression)
2197 dbg_info *const dbgi = get_dbg_info(&expression->base.source_position);
2198 const expression_t *value_expr = expression->value;
2199 ir_node *addr = expression_to_addr(value_expr);
2200 ir_node *value = get_value_from_lvalue(value_expr, addr);
2202 type_t *type = skip_typeref(expression->base.type);
2203 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
2206 if (is_type_pointer(type)) {
2207 pointer_type_t *pointer_type = &type->pointer;
2208 offset = get_type_size_node(pointer_type->points_to);
2210 assert(is_type_arithmetic(type));
2211 offset = new_Const(get_mode_one(mode));
2215 ir_node *store_value;
2216 switch(expression->base.kind) {
2217 case EXPR_UNARY_POSTFIX_INCREMENT:
2219 store_value = new_d_Add(dbgi, value, offset, mode);
2221 case EXPR_UNARY_POSTFIX_DECREMENT:
2223 store_value = new_d_Sub(dbgi, value, offset, mode);
2225 case EXPR_UNARY_PREFIX_INCREMENT:
2226 result = new_d_Add(dbgi, value, offset, mode);
2227 store_value = result;
2229 case EXPR_UNARY_PREFIX_DECREMENT:
2230 result = new_d_Sub(dbgi, value, offset, mode);
2231 store_value = result;
2234 panic("no incdec expr in create_incdec");
2237 set_value_for_expression_addr(value_expr, store_value, addr);
2242 static bool is_local_variable(expression_t *expression)
2244 if (expression->kind != EXPR_REFERENCE)
2246 reference_expression_t *ref_expr = &expression->reference;
2247 entity_t *entity = ref_expr->entity;
2248 if (entity->kind != ENTITY_VARIABLE)
2250 assert(entity->declaration.kind != DECLARATION_KIND_UNKNOWN);
2251 return entity->declaration.kind == DECLARATION_KIND_LOCAL_VARIABLE;
2254 static ir_relation get_relation(const expression_kind_t kind)
2257 case EXPR_BINARY_EQUAL: return ir_relation_equal;
2258 case EXPR_BINARY_ISLESSGREATER: return ir_relation_less_greater;
2259 case EXPR_BINARY_NOTEQUAL: return ir_relation_unordered_less_greater;
2260 case EXPR_BINARY_ISLESS:
2261 case EXPR_BINARY_LESS: return ir_relation_less;
2262 case EXPR_BINARY_ISLESSEQUAL:
2263 case EXPR_BINARY_LESSEQUAL: return ir_relation_less_equal;
2264 case EXPR_BINARY_ISGREATER:
2265 case EXPR_BINARY_GREATER: return ir_relation_greater;
2266 case EXPR_BINARY_ISGREATEREQUAL:
2267 case EXPR_BINARY_GREATEREQUAL: return ir_relation_greater_equal;
2268 case EXPR_BINARY_ISUNORDERED: return ir_relation_unordered;
2273 panic("trying to get pn_Cmp from non-comparison binexpr type");
2277 * Handle the assume optimizer hint: check if a Confirm
2278 * node can be created.
2280 * @param dbi debug info
2281 * @param expr the IL assume expression
2283 * we support here only some simple cases:
2288 static ir_node *handle_assume_compare(dbg_info *dbi,
2289 const binary_expression_t *expression)
2291 expression_t *op1 = expression->left;
2292 expression_t *op2 = expression->right;
2293 entity_t *var2, *var = NULL;
2294 ir_node *res = NULL;
2295 ir_relation relation = get_relation(expression->base.kind);
2297 if (is_local_variable(op1) && is_local_variable(op2)) {
2298 var = op1->reference.entity;
2299 var2 = op2->reference.entity;
2301 type_t *const type = skip_typeref(var->declaration.type);
2302 ir_mode *const mode = get_ir_mode_storage(type);
2304 ir_node *const irn1 = get_value(var->variable.v.value_number, mode);
2305 ir_node *const irn2 = get_value(var2->variable.v.value_number, mode);
2307 res = new_d_Confirm(dbi, irn2, irn1, get_inversed_relation(relation));
2308 set_value(var2->variable.v.value_number, res);
2310 res = new_d_Confirm(dbi, irn1, irn2, relation);
2311 set_value(var->variable.v.value_number, res);
2316 expression_t *con = NULL;
2317 if (is_local_variable(op1) && is_constant_expression(op2) == EXPR_CLASS_CONSTANT) {
2318 var = op1->reference.entity;
2320 } else if (is_constant_expression(op1) == EXPR_CLASS_CONSTANT && is_local_variable(op2)) {
2321 relation = get_inversed_relation(relation);
2322 var = op2->reference.entity;
2327 type_t *const type = skip_typeref(var->declaration.type);
2328 ir_mode *const mode = get_ir_mode_storage(type);
2330 res = get_value(var->variable.v.value_number, mode);
2331 res = new_d_Confirm(dbi, res, expression_to_firm(con), relation);
2332 set_value(var->variable.v.value_number, res);
2338 * Handle the assume optimizer hint.
2340 * @param dbi debug info
2341 * @param expr the IL assume expression
2343 static ir_node *handle_assume(dbg_info *dbi, const expression_t *expression)
2345 switch(expression->kind) {
2346 case EXPR_BINARY_EQUAL:
2347 case EXPR_BINARY_NOTEQUAL:
2348 case EXPR_BINARY_LESS:
2349 case EXPR_BINARY_LESSEQUAL:
2350 case EXPR_BINARY_GREATER:
2351 case EXPR_BINARY_GREATEREQUAL:
2352 return handle_assume_compare(dbi, &expression->binary);
2358 static ir_node *create_cast(dbg_info *dbgi, ir_node *value_node,
2359 type_t *from_type, type_t *type)
2361 type = skip_typeref(type);
2362 if (is_type_void(type)) {
2363 /* make sure firm type is constructed */
2364 (void) get_ir_type(type);
2367 if (!is_type_scalar(type)) {
2368 /* make sure firm type is constructed */
2369 (void) get_ir_type(type);
2373 from_type = skip_typeref(from_type);
2374 ir_mode *mode = get_ir_mode_storage(type);
2375 /* check for conversion from / to __based types */
2376 if (is_type_pointer(type) && is_type_pointer(from_type)) {
2377 const variable_t *from_var = from_type->pointer.base_variable;
2378 const variable_t *to_var = type->pointer.base_variable;
2379 if (from_var != to_var) {
2380 if (from_var != NULL) {
2381 ir_node *const addr = create_symconst(dbgi, from_var->v.entity);
2382 ir_node *const base = deref_address(dbgi, from_var->base.type, addr);
2383 value_node = new_d_Add(dbgi, value_node, base, mode);
2385 if (to_var != NULL) {
2386 ir_node *const addr = create_symconst(dbgi, to_var->v.entity);
2387 ir_node *const base = deref_address(dbgi, to_var->base.type, addr);
2388 value_node = new_d_Sub(dbgi, value_node, base, mode);
2393 if (is_type_atomic(type, ATOMIC_TYPE_BOOL)) {
2394 /* bool adjustments (we save a mode_Bu, but have to temporarily
2395 * convert to mode_b so we only get a 0/1 value */
2396 value_node = create_conv(dbgi, value_node, mode_b);
2399 ir_mode *mode_arith = get_ir_mode_arithmetic(type);
2400 ir_node *node = create_conv(dbgi, value_node, mode);
2401 node = do_strict_conv(dbgi, node);
2402 node = create_conv(dbgi, node, mode_arith);
2407 static ir_node *unary_expression_to_firm(const unary_expression_t *expression)
2409 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2410 type_t *type = skip_typeref(expression->base.type);
2412 const expression_t *value = expression->value;
2414 switch(expression->base.kind) {
2415 case EXPR_UNARY_TAKE_ADDRESS:
2416 return expression_to_addr(value);
2418 case EXPR_UNARY_NEGATE: {
2419 ir_node *value_node = expression_to_firm(value);
2420 ir_mode *mode = get_ir_mode_arithmetic(type);
2421 return new_d_Minus(dbgi, value_node, mode);
2423 case EXPR_UNARY_PLUS:
2424 return expression_to_firm(value);
2425 case EXPR_UNARY_BITWISE_NEGATE: {
2426 ir_node *value_node = expression_to_firm(value);
2427 ir_mode *mode = get_ir_mode_arithmetic(type);
2428 return new_d_Not(dbgi, value_node, mode);
2430 case EXPR_UNARY_NOT: {
2431 ir_node *value_node = _expression_to_firm(value);
2432 value_node = create_conv(dbgi, value_node, mode_b);
2433 ir_node *res = new_d_Not(dbgi, value_node, mode_b);
2436 case EXPR_UNARY_DEREFERENCE: {
2437 ir_node *value_node = expression_to_firm(value);
2438 type_t *value_type = skip_typeref(value->base.type);
2439 assert(is_type_pointer(value_type));
2441 /* check for __based */
2442 const variable_t *const base_var = value_type->pointer.base_variable;
2443 if (base_var != NULL) {
2444 ir_node *const addr = create_symconst(dbgi, base_var->v.entity);
2445 ir_node *const base = deref_address(dbgi, base_var->base.type, addr);
2446 value_node = new_d_Add(dbgi, value_node, base, get_ir_mode_storage(value_type));
2448 type_t *points_to = value_type->pointer.points_to;
2449 return deref_address(dbgi, points_to, value_node);
2451 case EXPR_UNARY_POSTFIX_INCREMENT:
2452 case EXPR_UNARY_POSTFIX_DECREMENT:
2453 case EXPR_UNARY_PREFIX_INCREMENT:
2454 case EXPR_UNARY_PREFIX_DECREMENT:
2455 return create_incdec(expression);
2456 case EXPR_UNARY_CAST: {
2457 ir_node *value_node = expression_to_firm(value);
2458 type_t *from_type = value->base.type;
2459 return create_cast(dbgi, value_node, from_type, type);
2461 case EXPR_UNARY_ASSUME:
2462 return handle_assume(dbgi, value);
2467 panic("invalid UNEXPR type found");
2471 * produces a 0/1 depending of the value of a mode_b node
2473 static ir_node *produce_condition_result(const expression_t *expression,
2474 ir_mode *mode, dbg_info *dbgi)
2476 ir_node *const one_block = new_immBlock();
2477 ir_node *const zero_block = new_immBlock();
2478 create_condition_evaluation(expression, one_block, zero_block);
2479 mature_immBlock(one_block);
2480 mature_immBlock(zero_block);
2482 ir_node *const jmp_one = new_rd_Jmp(dbgi, one_block);
2483 ir_node *const jmp_zero = new_rd_Jmp(dbgi, zero_block);
2484 ir_node *const in_cf[2] = { jmp_one, jmp_zero };
2485 ir_node *const block = new_Block(lengthof(in_cf), in_cf);
2486 set_cur_block(block);
2488 ir_node *const one = new_Const(get_mode_one(mode));
2489 ir_node *const zero = new_Const(get_mode_null(mode));
2490 ir_node *const in[2] = { one, zero };
2491 ir_node *const val = new_d_Phi(dbgi, lengthof(in), in, mode);
2496 static ir_node *adjust_for_pointer_arithmetic(dbg_info *dbgi,
2497 ir_node *value, type_t *type)
2499 ir_mode *const mode = get_ir_mode_arithmetic(type_ptrdiff_t);
2500 assert(is_type_pointer(type));
2501 pointer_type_t *const pointer_type = &type->pointer;
2502 type_t *const points_to = skip_typeref(pointer_type->points_to);
2503 ir_node * elem_size = get_type_size_node(points_to);
2504 elem_size = create_conv(dbgi, elem_size, mode);
2505 value = create_conv(dbgi, value, mode);
2506 ir_node *const mul = new_d_Mul(dbgi, value, elem_size, mode);
2510 static ir_node *create_op(dbg_info *dbgi, const binary_expression_t *expression,
2511 ir_node *left, ir_node *right)
2514 type_t *type_left = skip_typeref(expression->left->base.type);
2515 type_t *type_right = skip_typeref(expression->right->base.type);
2517 expression_kind_t kind = expression->base.kind;
2520 case EXPR_BINARY_SHIFTLEFT:
2521 case EXPR_BINARY_SHIFTRIGHT:
2522 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2523 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2524 mode = get_ir_mode_arithmetic(expression->base.type);
2525 right = create_conv(dbgi, right, atomic_modes[ATOMIC_TYPE_UINT]);
2528 case EXPR_BINARY_SUB:
2529 if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
2530 const pointer_type_t *const ptr_type = &type_left->pointer;
2532 mode = get_ir_mode_arithmetic(expression->base.type);
2533 ir_node *const elem_size = get_type_size_node(ptr_type->points_to);
2534 ir_node *const conv_size = new_d_Conv(dbgi, elem_size, mode);
2535 ir_node *const sub = new_d_Sub(dbgi, left, right, mode);
2536 ir_node *const no_mem = new_NoMem();
2537 ir_node *const div = new_d_DivRL(dbgi, no_mem, sub, conv_size,
2538 mode, op_pin_state_floats);
2539 return new_d_Proj(dbgi, div, mode, pn_Div_res);
2542 case EXPR_BINARY_SUB_ASSIGN:
2543 if (is_type_pointer(type_left)) {
2544 right = adjust_for_pointer_arithmetic(dbgi, right, type_left);
2545 mode = get_ir_mode_arithmetic(type_left);
2550 case EXPR_BINARY_ADD:
2551 case EXPR_BINARY_ADD_ASSIGN:
2552 if (is_type_pointer(type_left)) {
2553 right = adjust_for_pointer_arithmetic(dbgi, right, type_left);
2554 mode = get_ir_mode_arithmetic(type_left);
2556 } else if (is_type_pointer(type_right)) {
2557 left = adjust_for_pointer_arithmetic(dbgi, left, type_right);
2558 mode = get_ir_mode_arithmetic(type_right);
2565 mode = get_ir_mode_arithmetic(type_right);
2566 left = create_conv(dbgi, left, mode);
2571 case EXPR_BINARY_ADD_ASSIGN:
2572 case EXPR_BINARY_ADD:
2573 return new_d_Add(dbgi, left, right, mode);
2574 case EXPR_BINARY_SUB_ASSIGN:
2575 case EXPR_BINARY_SUB:
2576 return new_d_Sub(dbgi, left, right, mode);
2577 case EXPR_BINARY_MUL_ASSIGN:
2578 case EXPR_BINARY_MUL:
2579 return new_d_Mul(dbgi, left, right, mode);
2580 case EXPR_BINARY_BITWISE_AND:
2581 case EXPR_BINARY_BITWISE_AND_ASSIGN:
2582 return new_d_And(dbgi, left, right, mode);
2583 case EXPR_BINARY_BITWISE_OR:
2584 case EXPR_BINARY_BITWISE_OR_ASSIGN:
2585 return new_d_Or(dbgi, left, right, mode);
2586 case EXPR_BINARY_BITWISE_XOR:
2587 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
2588 return new_d_Eor(dbgi, left, right, mode);
2589 case EXPR_BINARY_SHIFTLEFT:
2590 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2591 return new_d_Shl(dbgi, left, right, mode);
2592 case EXPR_BINARY_SHIFTRIGHT:
2593 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2594 if (mode_is_signed(mode)) {
2595 return new_d_Shrs(dbgi, left, right, mode);
2597 return new_d_Shr(dbgi, left, right, mode);
2599 case EXPR_BINARY_DIV:
2600 case EXPR_BINARY_DIV_ASSIGN: {
2601 ir_node *pin = new_Pin(new_NoMem());
2602 ir_node *op = new_d_Div(dbgi, pin, left, right, mode,
2603 op_pin_state_floats);
2604 ir_node *res = new_d_Proj(dbgi, op, mode, pn_Div_res);
2607 case EXPR_BINARY_MOD:
2608 case EXPR_BINARY_MOD_ASSIGN: {
2609 ir_node *pin = new_Pin(new_NoMem());
2610 assert(!mode_is_float(mode));
2611 ir_node *op = new_d_Mod(dbgi, pin, left, right, mode,
2612 op_pin_state_floats);
2613 ir_node *res = new_d_Proj(dbgi, op, mode, pn_Mod_res);
2617 panic("unexpected expression kind");
2621 static ir_node *create_lazy_op(const binary_expression_t *expression)
2623 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2624 type_t *type = skip_typeref(expression->base.type);
2625 ir_mode *mode = get_ir_mode_arithmetic(type);
2627 if (is_constant_expression(expression->left) == EXPR_CLASS_CONSTANT) {
2628 bool val = fold_constant_to_bool(expression->left);
2629 expression_kind_t ekind = expression->base.kind;
2630 assert(ekind == EXPR_BINARY_LOGICAL_AND || ekind == EXPR_BINARY_LOGICAL_OR);
2631 if (ekind == EXPR_BINARY_LOGICAL_AND) {
2633 return new_Const(get_mode_null(mode));
2637 return new_Const(get_mode_one(mode));
2641 if (is_constant_expression(expression->right) == EXPR_CLASS_CONSTANT) {
2642 bool valr = fold_constant_to_bool(expression->right);
2643 return create_Const_from_bool(mode, valr);
2646 return produce_condition_result(expression->right, mode, dbgi);
2649 return produce_condition_result((const expression_t*) expression, mode,
2653 typedef ir_node * (*create_arithmetic_func)(dbg_info *dbgi, ir_node *left,
2654 ir_node *right, ir_mode *mode);
2656 static ir_node *create_assign_binop(const binary_expression_t *expression)
2658 dbg_info *const dbgi = get_dbg_info(&expression->base.source_position);
2659 const expression_t *left_expr = expression->left;
2660 type_t *type = skip_typeref(left_expr->base.type);
2661 ir_node *right = expression_to_firm(expression->right);
2662 ir_node *left_addr = expression_to_addr(left_expr);
2663 ir_node *left = get_value_from_lvalue(left_expr, left_addr);
2664 ir_node *result = create_op(dbgi, expression, left, right);
2666 result = create_cast(dbgi, result, expression->right->base.type, type);
2667 result = do_strict_conv(dbgi, result);
2669 result = set_value_for_expression_addr(left_expr, result, left_addr);
2671 if (!is_type_compound(type)) {
2672 ir_mode *mode_arithmetic = get_ir_mode_arithmetic(type);
2673 result = create_conv(dbgi, result, mode_arithmetic);
2678 static ir_node *binary_expression_to_firm(const binary_expression_t *expression)
2680 expression_kind_t kind = expression->base.kind;
2683 case EXPR_BINARY_EQUAL:
2684 case EXPR_BINARY_NOTEQUAL:
2685 case EXPR_BINARY_LESS:
2686 case EXPR_BINARY_LESSEQUAL:
2687 case EXPR_BINARY_GREATER:
2688 case EXPR_BINARY_GREATEREQUAL:
2689 case EXPR_BINARY_ISGREATER:
2690 case EXPR_BINARY_ISGREATEREQUAL:
2691 case EXPR_BINARY_ISLESS:
2692 case EXPR_BINARY_ISLESSEQUAL:
2693 case EXPR_BINARY_ISLESSGREATER:
2694 case EXPR_BINARY_ISUNORDERED: {
2695 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2696 ir_node *left = expression_to_firm(expression->left);
2697 ir_node *right = expression_to_firm(expression->right);
2698 ir_relation relation = get_relation(kind);
2699 ir_node *cmp = new_d_Cmp(dbgi, left, right, relation);
2702 case EXPR_BINARY_ASSIGN: {
2703 ir_node *addr = expression_to_addr(expression->left);
2704 ir_node *right = expression_to_firm(expression->right);
2706 = set_value_for_expression_addr(expression->left, right, addr);
2708 type_t *type = skip_typeref(expression->base.type);
2709 if (!is_type_compound(type)) {
2710 ir_mode *mode_arithmetic = get_ir_mode_arithmetic(type);
2711 res = create_conv(NULL, res, mode_arithmetic);
2715 case EXPR_BINARY_ADD:
2716 case EXPR_BINARY_SUB:
2717 case EXPR_BINARY_MUL:
2718 case EXPR_BINARY_DIV:
2719 case EXPR_BINARY_MOD:
2720 case EXPR_BINARY_BITWISE_AND:
2721 case EXPR_BINARY_BITWISE_OR:
2722 case EXPR_BINARY_BITWISE_XOR:
2723 case EXPR_BINARY_SHIFTLEFT:
2724 case EXPR_BINARY_SHIFTRIGHT:
2726 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2727 ir_node *left = expression_to_firm(expression->left);
2728 ir_node *right = expression_to_firm(expression->right);
2729 return create_op(dbgi, expression, left, right);
2731 case EXPR_BINARY_LOGICAL_AND:
2732 case EXPR_BINARY_LOGICAL_OR:
2733 return create_lazy_op(expression);
2734 case EXPR_BINARY_COMMA:
2735 /* create side effects of left side */
2736 (void) expression_to_firm(expression->left);
2737 return _expression_to_firm(expression->right);
2739 case EXPR_BINARY_ADD_ASSIGN:
2740 case EXPR_BINARY_SUB_ASSIGN:
2741 case EXPR_BINARY_MUL_ASSIGN:
2742 case EXPR_BINARY_MOD_ASSIGN:
2743 case EXPR_BINARY_DIV_ASSIGN:
2744 case EXPR_BINARY_BITWISE_AND_ASSIGN:
2745 case EXPR_BINARY_BITWISE_OR_ASSIGN:
2746 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
2747 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2748 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2749 return create_assign_binop(expression);
2751 panic("TODO binexpr type");
2755 static ir_node *array_access_addr(const array_access_expression_t *expression)
2757 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2758 ir_node *base_addr = expression_to_firm(expression->array_ref);
2759 ir_node *offset = expression_to_firm(expression->index);
2760 type_t *ref_type = skip_typeref(expression->array_ref->base.type);
2761 ir_node *real_offset = adjust_for_pointer_arithmetic(dbgi, offset, ref_type);
2762 ir_node *result = new_d_Add(dbgi, base_addr, real_offset, mode_P_data);
2767 static ir_node *array_access_to_firm(
2768 const array_access_expression_t *expression)
2770 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2771 ir_node *addr = array_access_addr(expression);
2772 type_t *type = revert_automatic_type_conversion(
2773 (const expression_t*) expression);
2774 type = skip_typeref(type);
2776 return deref_address(dbgi, type, addr);
2779 static long get_offsetof_offset(const offsetof_expression_t *expression)
2781 type_t *orig_type = expression->type;
2784 designator_t *designator = expression->designator;
2785 for ( ; designator != NULL; designator = designator->next) {
2786 type_t *type = skip_typeref(orig_type);
2787 /* be sure the type is constructed */
2788 (void) get_ir_type(type);
2790 if (designator->symbol != NULL) {
2791 assert(is_type_compound(type));
2792 symbol_t *symbol = designator->symbol;
2794 compound_t *compound = type->compound.compound;
2795 entity_t *iter = compound->members.entities;
2796 for ( ; iter != NULL; iter = iter->base.next) {
2797 if (iter->base.symbol == symbol) {
2801 assert(iter != NULL);
2803 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
2804 assert(iter->declaration.kind == DECLARATION_KIND_COMPOUND_MEMBER);
2805 offset += get_entity_offset(iter->compound_member.entity);
2807 orig_type = iter->declaration.type;
2809 expression_t *array_index = designator->array_index;
2810 assert(designator->array_index != NULL);
2811 assert(is_type_array(type));
2813 long index = fold_constant_to_int(array_index);
2814 ir_type *arr_type = get_ir_type(type);
2815 ir_type *elem_type = get_array_element_type(arr_type);
2816 long elem_size = get_type_size_bytes(elem_type);
2818 offset += index * elem_size;
2820 orig_type = type->array.element_type;
2827 static ir_node *offsetof_to_firm(const offsetof_expression_t *expression)
2829 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
2830 long offset = get_offsetof_offset(expression);
2831 ir_tarval *tv = new_tarval_from_long(offset, mode);
2832 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2834 return new_d_Const(dbgi, tv);
2837 static void create_local_initializer(initializer_t *initializer, dbg_info *dbgi,
2838 ir_entity *entity, type_t *type);
2839 static ir_initializer_t *create_ir_initializer(
2840 const initializer_t *initializer, type_t *type);
2842 static ir_entity *create_initializer_entity(dbg_info *dbgi,
2843 initializer_t *initializer,
2846 /* create the ir_initializer */
2847 ir_graph *const old_current_ir_graph = current_ir_graph;
2848 current_ir_graph = get_const_code_irg();
2850 ir_initializer_t *irinitializer = create_ir_initializer(initializer, type);
2852 assert(current_ir_graph == get_const_code_irg());
2853 current_ir_graph = old_current_ir_graph;
2855 ident *const id = id_unique("initializer.%u");
2856 ir_type *const irtype = get_ir_type(type);
2857 ir_type *const global_type = get_glob_type();
2858 ir_entity *const entity = new_d_entity(global_type, id, irtype, dbgi);
2859 set_entity_ld_ident(entity, id);
2860 set_entity_visibility(entity, ir_visibility_private);
2861 add_entity_linkage(entity, IR_LINKAGE_CONSTANT);
2862 set_entity_initializer(entity, irinitializer);
2866 static ir_node *compound_literal_addr(compound_literal_expression_t const *const expression)
2868 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2869 type_t *type = expression->type;
2870 initializer_t *initializer = expression->initializer;
2872 if (is_constant_initializer(initializer) == EXPR_CLASS_CONSTANT) {
2873 ir_entity *entity = create_initializer_entity(dbgi, initializer, type);
2874 return create_symconst(dbgi, entity);
2876 /* create an entity on the stack */
2877 ident *const id = id_unique("CompLit.%u");
2878 ir_type *const irtype = get_ir_type(type);
2879 ir_type *frame_type = get_irg_frame_type(current_ir_graph);
2881 ir_entity *const entity = new_d_entity(frame_type, id, irtype, dbgi);
2882 set_entity_ld_ident(entity, id);
2884 /* create initialisation code */
2885 create_local_initializer(initializer, dbgi, entity, type);
2887 /* create a sel for the compound literal address */
2888 ir_node *frame = get_irg_frame(current_ir_graph);
2889 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, entity);
2894 static ir_node *compound_literal_to_firm(compound_literal_expression_t const* const expr)
2896 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
2897 type_t *const type = expr->type;
2898 ir_node *const addr = compound_literal_addr(expr);
2899 return deref_address(dbgi, type, addr);
2903 * Transform a sizeof expression into Firm code.
2905 static ir_node *sizeof_to_firm(const typeprop_expression_t *expression)
2907 type_t *const type = skip_typeref(expression->type);
2908 /* ยง6.5.3.4:2 if the type is a VLA, evaluate the expression. */
2909 if (is_type_array(type) && type->array.is_vla
2910 && expression->tp_expression != NULL) {
2911 expression_to_firm(expression->tp_expression);
2914 return get_type_size_node(type);
2917 static entity_t *get_expression_entity(const expression_t *expression)
2919 if (expression->kind != EXPR_REFERENCE)
2922 return expression->reference.entity;
2925 static unsigned get_cparser_entity_alignment(const entity_t *entity)
2927 switch(entity->kind) {
2928 case DECLARATION_KIND_CASES:
2929 return entity->declaration.alignment;
2932 return entity->compound.alignment;
2933 case ENTITY_TYPEDEF:
2934 return entity->typedefe.alignment;
2942 * Transform an alignof expression into Firm code.
2944 static ir_node *alignof_to_firm(const typeprop_expression_t *expression)
2946 unsigned alignment = 0;
2948 const expression_t *tp_expression = expression->tp_expression;
2949 if (tp_expression != NULL) {
2950 entity_t *entity = get_expression_entity(tp_expression);
2951 if (entity != NULL) {
2952 alignment = get_cparser_entity_alignment(entity);
2956 if (alignment == 0) {
2957 type_t *type = expression->type;
2958 alignment = get_type_alignment(type);
2961 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2962 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
2963 ir_tarval *tv = new_tarval_from_long(alignment, mode);
2964 return new_d_Const(dbgi, tv);
2967 static void init_ir_types(void);
2969 static ir_tarval *fold_constant_to_tarval(const expression_t *expression)
2971 assert(is_constant_expression(expression) == EXPR_CLASS_CONSTANT);
2973 bool constant_folding_old = constant_folding;
2974 constant_folding = true;
2975 int old_optimize = get_optimize();
2976 int old_constant_folding = get_opt_constant_folding();
2978 set_opt_constant_folding(1);
2982 ir_graph *old_current_ir_graph = current_ir_graph;
2983 current_ir_graph = get_const_code_irg();
2985 ir_node *const cnst = _expression_to_firm(expression);
2987 current_ir_graph = old_current_ir_graph;
2988 set_optimize(old_optimize);
2989 set_opt_constant_folding(old_constant_folding);
2991 if (!is_Const(cnst)) {
2992 panic("couldn't fold constant");
2995 constant_folding = constant_folding_old;
2997 ir_tarval *const tv = get_Const_tarval(cnst);
2998 ir_mode *const mode = get_ir_mode_arithmetic(skip_typeref(expression->base.type));
2999 return tarval_convert_to(tv, mode);
3002 /* this function is only used in parser.c, but it relies on libfirm functionality */
3003 bool constant_is_negative(const expression_t *expression)
3005 ir_tarval *tv = fold_constant_to_tarval(expression);
3006 return tarval_is_negative(tv);
3009 long fold_constant_to_int(const expression_t *expression)
3011 ir_tarval *tv = fold_constant_to_tarval(expression);
3012 if (!tarval_is_long(tv)) {
3013 panic("result of constant folding is not integer");
3016 return get_tarval_long(tv);
3019 bool fold_constant_to_bool(const expression_t *expression)
3021 ir_tarval *tv = fold_constant_to_tarval(expression);
3022 return !tarval_is_null(tv);
3025 static ir_node *conditional_to_firm(const conditional_expression_t *expression)
3027 dbg_info *const dbgi = get_dbg_info(&expression->base.source_position);
3029 /* first try to fold a constant condition */
3030 if (is_constant_expression(expression->condition) == EXPR_CLASS_CONSTANT) {
3031 bool val = fold_constant_to_bool(expression->condition);
3033 expression_t *true_expression = expression->true_expression;
3034 if (true_expression == NULL)
3035 true_expression = expression->condition;
3036 return expression_to_firm(true_expression);
3038 return expression_to_firm(expression->false_expression);
3042 ir_node *const true_block = new_immBlock();
3043 ir_node *const false_block = new_immBlock();
3044 ir_node *const cond_expr = create_condition_evaluation(expression->condition, true_block, false_block);
3045 mature_immBlock(true_block);
3046 mature_immBlock(false_block);
3048 set_cur_block(true_block);
3050 if (expression->true_expression != NULL) {
3051 true_val = expression_to_firm(expression->true_expression);
3052 } else if (cond_expr != NULL && get_irn_mode(cond_expr) != mode_b) {
3053 true_val = cond_expr;
3055 /* Condition ended with a short circuit (&&, ||, !) operation or a
3056 * comparison. Generate a "1" as value for the true branch. */
3057 true_val = new_Const(get_mode_one(mode_Is));
3059 ir_node *const true_jmp = new_d_Jmp(dbgi);
3061 set_cur_block(false_block);
3062 ir_node *const false_val = expression_to_firm(expression->false_expression);
3063 ir_node *const false_jmp = new_d_Jmp(dbgi);
3065 /* create the common block */
3066 ir_node *const in_cf[2] = { true_jmp, false_jmp };
3067 ir_node *const block = new_Block(lengthof(in_cf), in_cf);
3068 set_cur_block(block);
3070 /* TODO improve static semantics, so either both or no values are NULL */
3071 if (true_val == NULL || false_val == NULL)
3074 ir_node *const in[2] = { true_val, false_val };
3075 type_t *const type = skip_typeref(expression->base.type);
3076 ir_mode *const mode = get_ir_mode_arithmetic(type);
3077 ir_node *const val = new_d_Phi(dbgi, lengthof(in), in, mode);
3083 * Returns an IR-node representing the address of a field.
3085 static ir_node *select_addr(const select_expression_t *expression)
3087 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3089 construct_select_compound(expression);
3091 ir_node *compound_addr = expression_to_firm(expression->compound);
3093 entity_t *entry = expression->compound_entry;
3094 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3095 assert(entry->declaration.kind == DECLARATION_KIND_COMPOUND_MEMBER);
3097 if (constant_folding) {
3098 ir_mode *mode = get_irn_mode(compound_addr);
3099 ir_mode *mode_uint = get_reference_mode_unsigned_eq(mode);
3100 ir_node *ofs = new_Const_long(mode_uint, entry->compound_member.offset);
3101 return new_d_Add(dbgi, compound_addr, ofs, mode);
3103 ir_entity *irentity = entry->compound_member.entity;
3104 assert(irentity != NULL);
3105 return new_d_simpleSel(dbgi, new_NoMem(), compound_addr, irentity);
3109 static ir_node *select_to_firm(const select_expression_t *expression)
3111 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3112 ir_node *addr = select_addr(expression);
3113 type_t *type = revert_automatic_type_conversion(
3114 (const expression_t*) expression);
3115 type = skip_typeref(type);
3117 entity_t *entry = expression->compound_entry;
3118 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3120 if (entry->compound_member.bitfield) {
3121 return bitfield_extract_to_firm(expression, addr);
3124 return deref_address(dbgi, type, addr);
3127 /* Values returned by __builtin_classify_type. */
3128 typedef enum gcc_type_class
3134 enumeral_type_class,
3137 reference_type_class,
3141 function_type_class,
3152 static ir_node *classify_type_to_firm(const classify_type_expression_t *const expr)
3154 type_t *type = expr->type_expression->base.type;
3156 /* FIXME gcc returns different values depending on whether compiling C or C++
3157 * e.g. int x[10] is pointer_type_class in C, but array_type_class in C++ */
3160 type = skip_typeref(type);
3161 switch (type->kind) {
3163 const atomic_type_t *const atomic_type = &type->atomic;
3164 switch (atomic_type->akind) {
3165 /* should not be reached */
3166 case ATOMIC_TYPE_INVALID:
3170 /* gcc cannot do that */
3171 case ATOMIC_TYPE_VOID:
3172 tc = void_type_class;
3175 case ATOMIC_TYPE_WCHAR_T: /* gcc handles this as integer */
3176 case ATOMIC_TYPE_CHAR: /* gcc handles this as integer */
3177 case ATOMIC_TYPE_SCHAR: /* gcc handles this as integer */
3178 case ATOMIC_TYPE_UCHAR: /* gcc handles this as integer */
3179 case ATOMIC_TYPE_SHORT:
3180 case ATOMIC_TYPE_USHORT:
3181 case ATOMIC_TYPE_INT:
3182 case ATOMIC_TYPE_UINT:
3183 case ATOMIC_TYPE_LONG:
3184 case ATOMIC_TYPE_ULONG:
3185 case ATOMIC_TYPE_LONGLONG:
3186 case ATOMIC_TYPE_ULONGLONG:
3187 case ATOMIC_TYPE_BOOL: /* gcc handles this as integer */
3188 tc = integer_type_class;
3191 case ATOMIC_TYPE_FLOAT:
3192 case ATOMIC_TYPE_DOUBLE:
3193 case ATOMIC_TYPE_LONG_DOUBLE:
3194 tc = real_type_class;
3197 panic("Unexpected atomic type in classify_type_to_firm().");
3200 case TYPE_COMPLEX: tc = complex_type_class; goto make_const;
3201 case TYPE_IMAGINARY: tc = complex_type_class; goto make_const;
3202 case TYPE_ARRAY: /* gcc handles this as pointer */
3203 case TYPE_FUNCTION: /* gcc handles this as pointer */
3204 case TYPE_POINTER: tc = pointer_type_class; goto make_const;
3205 case TYPE_COMPOUND_STRUCT: tc = record_type_class; goto make_const;
3206 case TYPE_COMPOUND_UNION: tc = union_type_class; goto make_const;
3208 /* gcc handles this as integer */
3209 case TYPE_ENUM: tc = integer_type_class; goto make_const;
3211 /* gcc classifies the referenced type */
3212 case TYPE_REFERENCE: type = type->reference.refers_to; continue;
3214 /* typedef/typeof should be skipped already */
3220 panic("unexpected TYPE classify_type_to_firm().");
3224 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
3225 ir_mode *const mode = atomic_modes[ATOMIC_TYPE_INT];
3226 ir_tarval *const tv = new_tarval_from_long(tc, mode);
3227 return new_d_Const(dbgi, tv);
3230 static ir_node *function_name_to_firm(
3231 const funcname_expression_t *const expr)
3233 switch(expr->kind) {
3234 case FUNCNAME_FUNCTION:
3235 case FUNCNAME_PRETTY_FUNCTION:
3236 case FUNCNAME_FUNCDNAME:
3237 if (current_function_name == NULL) {
3238 const source_position_t *const src_pos = &expr->base.source_position;
3239 const char *name = current_function_entity->base.symbol->string;
3240 const string_t string = { name, strlen(name) + 1 };
3241 current_function_name = string_to_firm(src_pos, "__func__.%u", &string);
3243 return current_function_name;
3244 case FUNCNAME_FUNCSIG:
3245 if (current_funcsig == NULL) {
3246 const source_position_t *const src_pos = &expr->base.source_position;
3247 ir_entity *ent = get_irg_entity(current_ir_graph);
3248 const char *const name = get_entity_ld_name(ent);
3249 const string_t string = { name, strlen(name) + 1 };
3250 current_funcsig = string_to_firm(src_pos, "__FUNCSIG__.%u", &string);
3252 return current_funcsig;
3254 panic("Unsupported function name");
3257 static ir_node *statement_expression_to_firm(const statement_expression_t *expr)
3259 statement_t *statement = expr->statement;
3261 assert(statement->kind == STATEMENT_COMPOUND);
3262 return compound_statement_to_firm(&statement->compound);
3265 static ir_node *va_start_expression_to_firm(
3266 const va_start_expression_t *const expr)
3268 ir_entity *param_ent = current_vararg_entity;
3269 if (param_ent == NULL) {
3270 size_t const n = IR_VA_START_PARAMETER_NUMBER;
3271 ir_type *const frame_type = get_irg_frame_type(current_ir_graph);
3272 ir_type *const param_type = get_unknown_type();
3273 param_ent = new_parameter_entity(frame_type, n, param_type);
3274 current_vararg_entity = param_ent;
3277 ir_node *const frame = get_irg_frame(current_ir_graph);
3278 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
3279 ir_node *const no_mem = new_NoMem();
3280 ir_node *const arg_sel = new_d_simpleSel(dbgi, no_mem, frame, param_ent);
3282 set_value_for_expression(expr->ap, arg_sel);
3287 static ir_node *va_arg_expression_to_firm(const va_arg_expression_t *const expr)
3289 type_t *const type = expr->base.type;
3290 expression_t *const ap_expr = expr->ap;
3291 ir_node *const ap_addr = expression_to_addr(ap_expr);
3292 ir_node *const ap = get_value_from_lvalue(ap_expr, ap_addr);
3293 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
3294 ir_node *const res = deref_address(dbgi, type, ap);
3296 ir_node *const cnst = get_type_size_node(expr->base.type);
3297 ir_mode *const mode = get_irn_mode(cnst);
3298 ir_node *const c1 = new_Const_long(mode, stack_param_align - 1);
3299 ir_node *const c2 = new_d_Add(dbgi, cnst, c1, mode);
3300 ir_node *const c3 = new_Const_long(mode, -(long)stack_param_align);
3301 ir_node *const c4 = new_d_And(dbgi, c2, c3, mode);
3302 ir_node *const add = new_d_Add(dbgi, ap, c4, mode_P_data);
3304 set_value_for_expression_addr(ap_expr, add, ap_addr);
3310 * Generate Firm for a va_copy expression.
3312 static ir_node *va_copy_expression_to_firm(const va_copy_expression_t *const expr)
3314 ir_node *const src = expression_to_firm(expr->src);
3315 set_value_for_expression(expr->dst, src);
3319 static ir_node *dereference_addr(const unary_expression_t *const expression)
3321 assert(expression->base.kind == EXPR_UNARY_DEREFERENCE);
3322 return expression_to_firm(expression->value);
3326 * Returns a IR-node representing an lvalue of the given expression.
3328 static ir_node *expression_to_addr(const expression_t *expression)
3330 switch(expression->kind) {
3331 case EXPR_ARRAY_ACCESS:
3332 return array_access_addr(&expression->array_access);
3334 return call_expression_to_firm(&expression->call);
3335 case EXPR_COMPOUND_LITERAL:
3336 return compound_literal_addr(&expression->compound_literal);
3337 case EXPR_REFERENCE:
3338 return reference_addr(&expression->reference);
3340 return select_addr(&expression->select);
3341 case EXPR_UNARY_DEREFERENCE:
3342 return dereference_addr(&expression->unary);
3346 panic("trying to get address of non-lvalue");
3349 static ir_node *builtin_constant_to_firm(
3350 const builtin_constant_expression_t *expression)
3352 ir_mode *const mode = get_ir_mode_arithmetic(expression->base.type);
3353 bool const v = is_constant_expression(expression->value) == EXPR_CLASS_CONSTANT;
3354 return create_Const_from_bool(mode, v);
3357 static ir_node *builtin_types_compatible_to_firm(
3358 const builtin_types_compatible_expression_t *expression)
3360 type_t *const left = get_unqualified_type(skip_typeref(expression->left));
3361 type_t *const right = get_unqualified_type(skip_typeref(expression->right));
3362 bool const value = types_compatible(left, right);
3363 ir_mode *const mode = get_ir_mode_arithmetic(expression->base.type);
3364 return create_Const_from_bool(mode, value);
3367 static ir_node *get_label_block(label_t *label)
3369 if (label->block != NULL)
3370 return label->block;
3372 /* beware: might be called from create initializer with current_ir_graph
3373 * set to const_code_irg. */
3374 ir_graph *rem = current_ir_graph;
3375 current_ir_graph = current_function;
3377 ir_node *block = new_immBlock();
3379 label->block = block;
3381 ARR_APP1(label_t *, all_labels, label);
3383 current_ir_graph = rem;
3388 * Pointer to a label. This is used for the
3389 * GNU address-of-label extension.
3391 static ir_node *label_address_to_firm(const label_address_expression_t *label)
3393 dbg_info *dbgi = get_dbg_info(&label->base.source_position);
3394 ir_node *block = get_label_block(label->label);
3395 ir_entity *entity = create_Block_entity(block);
3397 symconst_symbol value;
3398 value.entity_p = entity;
3399 return new_d_SymConst(dbgi, mode_P_code, value, symconst_addr_ent);
3403 * creates firm nodes for an expression. The difference between this function
3404 * and expression_to_firm is, that this version might produce mode_b nodes
3405 * instead of mode_Is.
3407 static ir_node *_expression_to_firm(expression_t const *const expr)
3410 if (!constant_folding) {
3411 assert(!expr->base.transformed);
3412 ((expression_t*)expr)->base.transformed = true;
3416 switch (expr->kind) {
3417 case EXPR_ALIGNOF: return alignof_to_firm( &expr->typeprop);
3418 case EXPR_ARRAY_ACCESS: return array_access_to_firm( &expr->array_access);
3419 case EXPR_BINARY_CASES: return binary_expression_to_firm( &expr->binary);
3420 case EXPR_BUILTIN_CONSTANT_P: return builtin_constant_to_firm( &expr->builtin_constant);
3421 case EXPR_BUILTIN_TYPES_COMPATIBLE_P: return builtin_types_compatible_to_firm(&expr->builtin_types_compatible);
3422 case EXPR_CALL: return call_expression_to_firm( &expr->call);
3423 case EXPR_CLASSIFY_TYPE: return classify_type_to_firm( &expr->classify_type);
3424 case EXPR_COMPOUND_LITERAL: return compound_literal_to_firm( &expr->compound_literal);
3425 case EXPR_CONDITIONAL: return conditional_to_firm( &expr->conditional);
3426 case EXPR_FUNCNAME: return function_name_to_firm( &expr->funcname);
3427 case EXPR_LABEL_ADDRESS: return label_address_to_firm( &expr->label_address);
3428 case EXPR_LITERAL_CASES: return literal_to_firm( &expr->literal);
3429 case EXPR_OFFSETOF: return offsetof_to_firm( &expr->offsetofe);
3430 case EXPR_REFERENCE: return reference_expression_to_firm( &expr->reference);
3431 case EXPR_ENUM_CONSTANT: return enum_constant_to_firm( &expr->reference);
3432 case EXPR_SELECT: return select_to_firm( &expr->select);
3433 case EXPR_SIZEOF: return sizeof_to_firm( &expr->typeprop);
3434 case EXPR_STATEMENT: return statement_expression_to_firm( &expr->statement);
3435 case EXPR_UNARY_CASES: return unary_expression_to_firm( &expr->unary);
3436 case EXPR_VA_ARG: return va_arg_expression_to_firm( &expr->va_arge);
3437 case EXPR_VA_COPY: return va_copy_expression_to_firm( &expr->va_copye);
3438 case EXPR_VA_START: return va_start_expression_to_firm( &expr->va_starte);
3439 case EXPR_WIDE_STRING_LITERAL: return wide_string_literal_to_firm( &expr->string_literal);
3441 case EXPR_STRING_LITERAL: return string_to_firm(&expr->base.source_position, "str.%u", &expr->literal.value);
3443 case EXPR_ERROR: break;
3445 panic("invalid expression found");
3449 * Check if a given expression is a GNU __builtin_expect() call.
3451 static bool is_builtin_expect(const expression_t *expression)
3453 if (expression->kind != EXPR_CALL)
3456 expression_t *function = expression->call.function;
3457 if (function->kind != EXPR_REFERENCE)
3459 reference_expression_t *ref = &function->reference;
3460 if (ref->entity->kind != ENTITY_FUNCTION ||
3461 ref->entity->function.btk != BUILTIN_EXPECT)
3467 static bool produces_mode_b(const expression_t *expression)
3469 switch (expression->kind) {
3470 case EXPR_BINARY_EQUAL:
3471 case EXPR_BINARY_NOTEQUAL:
3472 case EXPR_BINARY_LESS:
3473 case EXPR_BINARY_LESSEQUAL:
3474 case EXPR_BINARY_GREATER:
3475 case EXPR_BINARY_GREATEREQUAL:
3476 case EXPR_BINARY_ISGREATER:
3477 case EXPR_BINARY_ISGREATEREQUAL:
3478 case EXPR_BINARY_ISLESS:
3479 case EXPR_BINARY_ISLESSEQUAL:
3480 case EXPR_BINARY_ISLESSGREATER:
3481 case EXPR_BINARY_ISUNORDERED:
3482 case EXPR_UNARY_NOT:
3486 if (is_builtin_expect(expression)) {
3487 expression_t *argument = expression->call.arguments->expression;
3488 return produces_mode_b(argument);
3491 case EXPR_BINARY_COMMA:
3492 return produces_mode_b(expression->binary.right);
3499 static ir_node *expression_to_firm(const expression_t *expression)
3501 if (!produces_mode_b(expression)) {
3502 ir_node *res = _expression_to_firm(expression);
3503 assert(res == NULL || get_irn_mode(res) != mode_b);
3507 if (is_constant_expression(expression) == EXPR_CLASS_CONSTANT) {
3508 return new_Const(fold_constant_to_tarval(expression));
3511 /* we have to produce a 0/1 from the mode_b expression */
3512 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3513 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
3514 return produce_condition_result(expression, mode, dbgi);
3518 * create a short-circuit expression evaluation that tries to construct
3519 * efficient control flow structures for &&, || and ! expressions
3521 static ir_node *create_condition_evaluation(const expression_t *expression,
3522 ir_node *true_block,
3523 ir_node *false_block)
3525 switch(expression->kind) {
3526 case EXPR_UNARY_NOT: {
3527 const unary_expression_t *unary_expression = &expression->unary;
3528 create_condition_evaluation(unary_expression->value, false_block,
3532 case EXPR_BINARY_LOGICAL_AND: {
3533 const binary_expression_t *binary_expression = &expression->binary;
3535 ir_node *extra_block = new_immBlock();
3536 create_condition_evaluation(binary_expression->left, extra_block,
3538 mature_immBlock(extra_block);
3539 set_cur_block(extra_block);
3540 create_condition_evaluation(binary_expression->right, true_block,
3544 case EXPR_BINARY_LOGICAL_OR: {
3545 const binary_expression_t *binary_expression = &expression->binary;
3547 ir_node *extra_block = new_immBlock();
3548 create_condition_evaluation(binary_expression->left, true_block,
3550 mature_immBlock(extra_block);
3551 set_cur_block(extra_block);
3552 create_condition_evaluation(binary_expression->right, true_block,
3560 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3561 ir_node *cond_expr = _expression_to_firm(expression);
3562 ir_node *condition = create_conv(dbgi, cond_expr, mode_b);
3563 ir_node *cond = new_d_Cond(dbgi, condition);
3564 ir_node *true_proj = new_d_Proj(dbgi, cond, mode_X, pn_Cond_true);
3565 ir_node *false_proj = new_d_Proj(dbgi, cond, mode_X, pn_Cond_false);
3567 /* set branch prediction info based on __builtin_expect */
3568 if (is_builtin_expect(expression) && is_Cond(cond)) {
3569 call_argument_t *argument = expression->call.arguments->next;
3570 if (is_constant_expression(argument->expression) == EXPR_CLASS_CONSTANT) {
3571 bool const cnst = fold_constant_to_bool(argument->expression);
3572 cond_jmp_predicate const pred = cnst ? COND_JMP_PRED_TRUE : COND_JMP_PRED_FALSE;
3573 set_Cond_jmp_pred(cond, pred);
3577 add_immBlock_pred(true_block, true_proj);
3578 add_immBlock_pred(false_block, false_proj);
3580 set_unreachable_now();
3584 static void create_variable_entity(entity_t *variable,
3585 declaration_kind_t declaration_kind,
3586 ir_type *parent_type)
3588 assert(variable->kind == ENTITY_VARIABLE);
3589 type_t *type = skip_typeref(variable->declaration.type);
3591 ident *const id = new_id_from_str(variable->base.symbol->string);
3592 ir_type *const irtype = get_ir_type(type);
3593 dbg_info *const dbgi = get_dbg_info(&variable->base.source_position);
3594 ir_entity *const irentity = new_d_entity(parent_type, id, irtype, dbgi);
3595 unsigned alignment = variable->declaration.alignment;
3597 set_entity_alignment(irentity, alignment);
3599 handle_decl_modifiers(irentity, variable);
3601 variable->declaration.kind = (unsigned char) declaration_kind;
3602 variable->variable.v.entity = irentity;
3603 set_entity_ld_ident(irentity, create_ld_ident(variable));
3605 if (type->base.qualifiers & TYPE_QUALIFIER_VOLATILE) {
3606 set_entity_volatility(irentity, volatility_is_volatile);
3611 typedef struct type_path_entry_t type_path_entry_t;
3612 struct type_path_entry_t {
3614 ir_initializer_t *initializer;
3616 entity_t *compound_entry;
3619 typedef struct type_path_t type_path_t;
3620 struct type_path_t {
3621 type_path_entry_t *path;
3626 static __attribute__((unused)) void debug_print_type_path(const type_path_t *path)
3628 size_t len = ARR_LEN(path->path);
3630 for (size_t i = 0; i < len; ++i) {
3631 const type_path_entry_t *entry = & path->path[i];
3633 type_t *type = skip_typeref(entry->type);
3634 if (is_type_compound(type)) {
3635 fprintf(stderr, ".%s", entry->compound_entry->base.symbol->string);
3636 } else if (is_type_array(type)) {
3637 fprintf(stderr, "[%u]", (unsigned) entry->index);
3639 fprintf(stderr, "-INVALID-");
3642 fprintf(stderr, " (");
3643 print_type(path->top_type);
3644 fprintf(stderr, ")");
3647 static type_path_entry_t *get_type_path_top(const type_path_t *path)
3649 size_t len = ARR_LEN(path->path);
3651 return & path->path[len-1];
3654 static type_path_entry_t *append_to_type_path(type_path_t *path)
3656 size_t len = ARR_LEN(path->path);
3657 ARR_RESIZE(type_path_entry_t, path->path, len+1);
3659 type_path_entry_t *result = & path->path[len];
3660 memset(result, 0, sizeof(result[0]));
3664 static size_t get_compound_member_count(const compound_type_t *type)
3666 compound_t *compound = type->compound;
3667 size_t n_members = 0;
3668 entity_t *member = compound->members.entities;
3669 for ( ; member != NULL; member = member->base.next) {
3676 static ir_initializer_t *get_initializer_entry(type_path_t *path)
3678 type_t *orig_top_type = path->top_type;
3679 type_t *top_type = skip_typeref(orig_top_type);
3681 assert(is_type_compound(top_type) || is_type_array(top_type));
3683 if (ARR_LEN(path->path) == 0) {
3686 type_path_entry_t *top = get_type_path_top(path);
3687 ir_initializer_t *initializer = top->initializer;
3688 return get_initializer_compound_value(initializer, top->index);
3692 static void descend_into_subtype(type_path_t *path)
3694 type_t *orig_top_type = path->top_type;
3695 type_t *top_type = skip_typeref(orig_top_type);
3697 assert(is_type_compound(top_type) || is_type_array(top_type));
3699 ir_initializer_t *initializer = get_initializer_entry(path);
3701 type_path_entry_t *top = append_to_type_path(path);
3702 top->type = top_type;
3706 if (is_type_compound(top_type)) {
3707 compound_t *const compound = top_type->compound.compound;
3708 entity_t *const entry = skip_unnamed_bitfields(compound->members.entities);
3710 top->compound_entry = entry;
3712 len = get_compound_member_count(&top_type->compound);
3713 if (entry != NULL) {
3714 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3715 path->top_type = entry->declaration.type;
3718 assert(is_type_array(top_type));
3719 assert(top_type->array.size > 0);
3722 path->top_type = top_type->array.element_type;
3723 len = top_type->array.size;
3725 if (initializer == NULL
3726 || get_initializer_kind(initializer) == IR_INITIALIZER_NULL) {
3727 initializer = create_initializer_compound(len);
3728 /* we have to set the entry at the 2nd latest path entry... */
3729 size_t path_len = ARR_LEN(path->path);
3730 assert(path_len >= 1);
3732 type_path_entry_t *entry = & path->path[path_len-2];
3733 ir_initializer_t *tinitializer = entry->initializer;
3734 set_initializer_compound_value(tinitializer, entry->index,
3738 top->initializer = initializer;
3741 static void ascend_from_subtype(type_path_t *path)
3743 type_path_entry_t *top = get_type_path_top(path);
3745 path->top_type = top->type;
3747 size_t len = ARR_LEN(path->path);
3748 ARR_RESIZE(type_path_entry_t, path->path, len-1);
3751 static void walk_designator(type_path_t *path, const designator_t *designator)
3753 /* designators start at current object type */
3754 ARR_RESIZE(type_path_entry_t, path->path, 1);
3756 for ( ; designator != NULL; designator = designator->next) {
3757 type_path_entry_t *top = get_type_path_top(path);
3758 type_t *orig_type = top->type;
3759 type_t *type = skip_typeref(orig_type);
3761 if (designator->symbol != NULL) {
3762 assert(is_type_compound(type));
3764 symbol_t *symbol = designator->symbol;
3766 compound_t *compound = type->compound.compound;
3767 entity_t *iter = compound->members.entities;
3768 for ( ; iter != NULL; iter = iter->base.next, ++index) {
3769 if (iter->base.symbol == symbol) {
3770 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
3774 assert(iter != NULL);
3776 /* revert previous initialisations of other union elements */
3777 if (type->kind == TYPE_COMPOUND_UNION) {
3778 ir_initializer_t *initializer = top->initializer;
3779 if (initializer != NULL
3780 && get_initializer_kind(initializer) == IR_INITIALIZER_COMPOUND) {
3781 /* are we writing to a new element? */
3782 ir_initializer_t *oldi
3783 = get_initializer_compound_value(initializer, index);
3784 if (get_initializer_kind(oldi) == IR_INITIALIZER_NULL) {
3785 /* clear initializer */
3787 = get_initializer_compound_n_entries(initializer);
3788 ir_initializer_t *nulli = get_initializer_null();
3789 for (size_t i = 0; i < len; ++i) {
3790 set_initializer_compound_value(initializer, i,
3797 top->type = orig_type;
3798 top->compound_entry = iter;
3800 orig_type = iter->declaration.type;
3802 expression_t *array_index = designator->array_index;
3803 assert(designator->array_index != NULL);
3804 assert(is_type_array(type));
3806 long index = fold_constant_to_int(array_index);
3809 if (type->array.size_constant) {
3810 long array_size = type->array.size;
3811 assert(index < array_size);
3815 top->type = orig_type;
3816 top->index = (size_t) index;
3817 orig_type = type->array.element_type;
3819 path->top_type = orig_type;
3821 if (designator->next != NULL) {
3822 descend_into_subtype(path);
3826 path->invalid = false;
3829 static void advance_current_object(type_path_t *path)
3831 if (path->invalid) {
3832 /* TODO: handle this... */
3833 panic("invalid initializer in ast2firm (excessive elements)");
3836 type_path_entry_t *top = get_type_path_top(path);
3838 type_t *type = skip_typeref(top->type);
3839 if (is_type_union(type)) {
3840 /* only the first element is initialized in unions */
3841 top->compound_entry = NULL;
3842 } else if (is_type_struct(type)) {
3843 entity_t *entry = top->compound_entry;
3846 entry = skip_unnamed_bitfields(entry->base.next);
3847 top->compound_entry = entry;
3848 if (entry != NULL) {
3849 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3850 path->top_type = entry->declaration.type;
3854 assert(is_type_array(type));
3857 if (!type->array.size_constant || top->index < type->array.size) {
3862 /* we're past the last member of the current sub-aggregate, try if we
3863 * can ascend in the type hierarchy and continue with another subobject */
3864 size_t len = ARR_LEN(path->path);
3867 ascend_from_subtype(path);
3868 advance_current_object(path);
3870 path->invalid = true;
3875 static ir_initializer_t *create_ir_initializer_value(
3876 const initializer_value_t *initializer)
3878 if (is_type_compound(initializer->value->base.type)) {
3879 panic("initializer creation for compounds not implemented yet");
3881 type_t *type = initializer->value->base.type;
3882 expression_t *expr = initializer->value;
3883 ir_node *value = expression_to_firm(expr);
3884 ir_mode *mode = get_ir_mode_storage(type);
3885 value = create_conv(NULL, value, mode);
3886 return create_initializer_const(value);
3889 /** test wether type can be initialized by a string constant */
3890 static bool is_string_type(type_t *type)
3893 if (is_type_pointer(type)) {
3894 inner = skip_typeref(type->pointer.points_to);
3895 } else if(is_type_array(type)) {
3896 inner = skip_typeref(type->array.element_type);
3901 return is_type_integer(inner);
3904 static ir_initializer_t *create_ir_initializer_list(
3905 const initializer_list_t *initializer, type_t *type)
3908 memset(&path, 0, sizeof(path));
3909 path.top_type = type;
3910 path.path = NEW_ARR_F(type_path_entry_t, 0);
3912 descend_into_subtype(&path);
3914 for (size_t i = 0; i < initializer->len; ++i) {
3915 const initializer_t *sub_initializer = initializer->initializers[i];
3917 if (sub_initializer->kind == INITIALIZER_DESIGNATOR) {
3918 walk_designator(&path, sub_initializer->designator.designator);
3922 if (sub_initializer->kind == INITIALIZER_VALUE) {
3923 /* we might have to descend into types until we're at a scalar
3926 type_t *orig_top_type = path.top_type;
3927 type_t *top_type = skip_typeref(orig_top_type);
3929 if (is_type_scalar(top_type))
3931 descend_into_subtype(&path);
3933 } else if (sub_initializer->kind == INITIALIZER_STRING
3934 || sub_initializer->kind == INITIALIZER_WIDE_STRING) {
3935 /* we might have to descend into types until we're at a scalar
3938 type_t *orig_top_type = path.top_type;
3939 type_t *top_type = skip_typeref(orig_top_type);
3941 if (is_string_type(top_type))
3943 descend_into_subtype(&path);
3947 ir_initializer_t *sub_irinitializer
3948 = create_ir_initializer(sub_initializer, path.top_type);
3950 size_t path_len = ARR_LEN(path.path);
3951 assert(path_len >= 1);
3952 type_path_entry_t *entry = & path.path[path_len-1];
3953 ir_initializer_t *tinitializer = entry->initializer;
3954 set_initializer_compound_value(tinitializer, entry->index,
3957 advance_current_object(&path);
3960 assert(ARR_LEN(path.path) >= 1);
3961 ir_initializer_t *result = path.path[0].initializer;
3962 DEL_ARR_F(path.path);
3967 static ir_initializer_t *create_ir_initializer_string(
3968 const initializer_string_t *initializer, type_t *type)
3970 type = skip_typeref(type);
3972 size_t string_len = initializer->string.size;
3973 assert(type->kind == TYPE_ARRAY);
3974 assert(type->array.size_constant);
3975 size_t len = type->array.size;
3976 ir_initializer_t *irinitializer = create_initializer_compound(len);
3978 const char *string = initializer->string.begin;
3979 ir_mode *mode = get_ir_mode_storage(type->array.element_type);
3981 for (size_t i = 0; i < len; ++i) {
3986 ir_tarval *tv = new_tarval_from_long(c, mode);
3987 ir_initializer_t *char_initializer = create_initializer_tarval(tv);
3989 set_initializer_compound_value(irinitializer, i, char_initializer);
3992 return irinitializer;
3995 static ir_initializer_t *create_ir_initializer_wide_string(
3996 const initializer_wide_string_t *initializer, type_t *type)
3998 assert(type->kind == TYPE_ARRAY);
3999 assert(type->array.size_constant);
4000 size_t len = type->array.size;
4001 size_t string_len = wstrlen(&initializer->string);
4002 ir_initializer_t *irinitializer = create_initializer_compound(len);
4004 const char *p = initializer->string.begin;
4005 ir_mode *mode = get_type_mode(ir_type_wchar_t);
4007 for (size_t i = 0; i < len; ++i) {
4009 if (i < string_len) {
4010 c = read_utf8_char(&p);
4012 ir_tarval *tv = new_tarval_from_long(c, mode);
4013 ir_initializer_t *char_initializer = create_initializer_tarval(tv);
4015 set_initializer_compound_value(irinitializer, i, char_initializer);
4018 return irinitializer;
4021 static ir_initializer_t *create_ir_initializer(
4022 const initializer_t *initializer, type_t *type)
4024 switch(initializer->kind) {
4025 case INITIALIZER_STRING:
4026 return create_ir_initializer_string(&initializer->string, type);
4028 case INITIALIZER_WIDE_STRING:
4029 return create_ir_initializer_wide_string(&initializer->wide_string,
4032 case INITIALIZER_LIST:
4033 return create_ir_initializer_list(&initializer->list, type);
4035 case INITIALIZER_VALUE:
4036 return create_ir_initializer_value(&initializer->value);
4038 case INITIALIZER_DESIGNATOR:
4039 panic("unexpected designator initializer found");
4041 panic("unknown initializer");
4044 /** ANSI C ยง6.7.8:21: If there are fewer initializers [..] than there
4045 * are elements [...] the remainder of the aggregate shall be initialized
4046 * implicitly the same as objects that have static storage duration. */
4047 static void create_dynamic_null_initializer(ir_entity *entity, dbg_info *dbgi,
4050 /* for unions we must NOT do anything for null initializers */
4051 ir_type *owner = get_entity_owner(entity);
4052 if (is_Union_type(owner)) {
4056 ir_type *ent_type = get_entity_type(entity);
4057 /* create sub-initializers for a compound type */
4058 if (is_compound_type(ent_type)) {
4059 unsigned n_members = get_compound_n_members(ent_type);
4060 for (unsigned n = 0; n < n_members; ++n) {
4061 ir_entity *member = get_compound_member(ent_type, n);
4062 ir_node *addr = new_d_simpleSel(dbgi, new_NoMem(), base_addr,
4064 create_dynamic_null_initializer(member, dbgi, addr);
4068 if (is_Array_type(ent_type)) {
4069 assert(has_array_upper_bound(ent_type, 0));
4070 long n = get_array_upper_bound_int(ent_type, 0);
4071 for (long i = 0; i < n; ++i) {
4072 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
4073 ir_tarval *index_tv = new_tarval_from_long(i, mode_uint);
4074 ir_node *cnst = new_d_Const(dbgi, index_tv);
4075 ir_node *in[1] = { cnst };
4076 ir_entity *arrent = get_array_element_entity(ent_type);
4077 ir_node *addr = new_d_Sel(dbgi, new_NoMem(), base_addr, 1, in,
4079 create_dynamic_null_initializer(arrent, dbgi, addr);
4084 ir_mode *value_mode = get_type_mode(ent_type);
4085 ir_node *node = new_Const(get_mode_null(value_mode));
4087 /* is it a bitfield type? */
4088 if (is_Primitive_type(ent_type) &&
4089 get_primitive_base_type(ent_type) != NULL) {
4090 bitfield_store_to_firm(dbgi, entity, base_addr, node, false, false);
4094 ir_node *mem = get_store();
4095 ir_node *store = new_d_Store(dbgi, mem, base_addr, node, cons_none);
4096 ir_node *proj_m = new_Proj(store, mode_M, pn_Store_M);
4100 static void create_dynamic_initializer_sub(ir_initializer_t *initializer,
4101 ir_entity *entity, ir_type *type, dbg_info *dbgi, ir_node *base_addr)
4103 switch(get_initializer_kind(initializer)) {
4104 case IR_INITIALIZER_NULL:
4105 create_dynamic_null_initializer(entity, dbgi, base_addr);
4107 case IR_INITIALIZER_CONST: {
4108 ir_node *node = get_initializer_const_value(initializer);
4109 ir_type *ent_type = get_entity_type(entity);
4111 /* is it a bitfield type? */
4112 if (is_Primitive_type(ent_type) &&
4113 get_primitive_base_type(ent_type) != NULL) {
4114 bitfield_store_to_firm(dbgi, entity, base_addr, node, false, false);
4118 assert(get_type_mode(type) == get_irn_mode(node));
4119 ir_node *mem = get_store();
4120 ir_node *store = new_d_Store(dbgi, mem, base_addr, node, cons_none);
4121 ir_node *proj_m = new_Proj(store, mode_M, pn_Store_M);
4125 case IR_INITIALIZER_TARVAL: {
4126 ir_tarval *tv = get_initializer_tarval_value(initializer);
4127 ir_node *cnst = new_d_Const(dbgi, tv);
4128 ir_type *ent_type = get_entity_type(entity);
4130 /* is it a bitfield type? */
4131 if (is_Primitive_type(ent_type) &&
4132 get_primitive_base_type(ent_type) != NULL) {
4133 bitfield_store_to_firm(dbgi, entity, base_addr, cnst, false, false);
4137 assert(get_type_mode(type) == get_tarval_mode(tv));
4138 ir_node *mem = get_store();
4139 ir_node *store = new_d_Store(dbgi, mem, base_addr, cnst, cons_none);
4140 ir_node *proj_m = new_Proj(store, mode_M, pn_Store_M);
4144 case IR_INITIALIZER_COMPOUND: {
4145 assert(is_compound_type(type) || is_Array_type(type));
4147 if (is_Array_type(type)) {
4148 assert(has_array_upper_bound(type, 0));
4149 n_members = get_array_upper_bound_int(type, 0);
4151 n_members = get_compound_n_members(type);
4154 if (get_initializer_compound_n_entries(initializer)
4155 != (unsigned) n_members)
4156 panic("initializer doesn't match compound type");
4158 for (int i = 0; i < n_members; ++i) {
4161 ir_entity *sub_entity;
4162 if (is_Array_type(type)) {
4163 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
4164 ir_tarval *index_tv = new_tarval_from_long(i, mode_uint);
4165 ir_node *cnst = new_d_Const(dbgi, index_tv);
4166 ir_node *in[1] = { cnst };
4167 irtype = get_array_element_type(type);
4168 sub_entity = get_array_element_entity(type);
4169 addr = new_d_Sel(dbgi, new_NoMem(), base_addr, 1, in,
4172 sub_entity = get_compound_member(type, i);
4173 irtype = get_entity_type(sub_entity);
4174 addr = new_d_simpleSel(dbgi, new_NoMem(), base_addr,
4178 ir_initializer_t *sub_init
4179 = get_initializer_compound_value(initializer, i);
4181 create_dynamic_initializer_sub(sub_init, sub_entity, irtype, dbgi,
4188 panic("invalid IR_INITIALIZER found");
4191 static void create_dynamic_initializer(ir_initializer_t *initializer,
4192 dbg_info *dbgi, ir_entity *entity)
4194 ir_node *frame = get_irg_frame(current_ir_graph);
4195 ir_node *base_addr = new_d_simpleSel(dbgi, new_NoMem(), frame, entity);
4196 ir_type *type = get_entity_type(entity);
4198 create_dynamic_initializer_sub(initializer, entity, type, dbgi, base_addr);
4201 static void create_local_initializer(initializer_t *initializer, dbg_info *dbgi,
4202 ir_entity *entity, type_t *type)
4204 ir_node *memory = get_store();
4205 ir_node *nomem = new_NoMem();
4206 ir_node *frame = get_irg_frame(current_ir_graph);
4207 ir_node *addr = new_d_simpleSel(dbgi, nomem, frame, entity);
4209 if (initializer->kind == INITIALIZER_VALUE) {
4210 initializer_value_t *initializer_value = &initializer->value;
4212 ir_node *value = expression_to_firm(initializer_value->value);
4213 type = skip_typeref(type);
4214 assign_value(dbgi, addr, type, value);
4218 if (is_constant_initializer(initializer) == EXPR_CLASS_VARIABLE) {
4219 ir_initializer_t *irinitializer
4220 = create_ir_initializer(initializer, type);
4222 create_dynamic_initializer(irinitializer, dbgi, entity);
4226 /* create a "template" entity which is copied to the entity on the stack */
4227 ir_entity *const init_entity
4228 = create_initializer_entity(dbgi, initializer, type);
4229 ir_node *const src_addr = create_symconst(dbgi, init_entity);
4230 ir_type *const irtype = get_ir_type(type);
4231 ir_node *const copyb = new_d_CopyB(dbgi, memory, addr, src_addr, irtype);
4233 ir_node *const copyb_mem = new_Proj(copyb, mode_M, pn_CopyB_M);
4234 set_store(copyb_mem);
4237 static void create_initializer_local_variable_entity(entity_t *entity)
4239 assert(entity->kind == ENTITY_VARIABLE);
4240 initializer_t *initializer = entity->variable.initializer;
4241 dbg_info *dbgi = get_dbg_info(&entity->base.source_position);
4242 ir_entity *irentity = entity->variable.v.entity;
4243 type_t *type = entity->declaration.type;
4245 create_local_initializer(initializer, dbgi, irentity, type);
4248 static void create_variable_initializer(entity_t *entity)
4250 assert(entity->kind == ENTITY_VARIABLE);
4251 initializer_t *initializer = entity->variable.initializer;
4252 if (initializer == NULL)
4255 declaration_kind_t declaration_kind
4256 = (declaration_kind_t) entity->declaration.kind;
4257 if (declaration_kind == DECLARATION_KIND_LOCAL_VARIABLE_ENTITY) {
4258 create_initializer_local_variable_entity(entity);
4262 type_t *type = entity->declaration.type;
4263 type_qualifiers_t tq = get_type_qualifier(type, true);
4265 if (initializer->kind == INITIALIZER_VALUE) {
4266 expression_t * value = initializer->value.value;
4267 type_t *const init_type = skip_typeref(value->base.type);
4269 if (!is_type_scalar(init_type)) {
4271 while (value->kind == EXPR_UNARY_CAST)
4272 value = value->unary.value;
4274 if (value->kind != EXPR_COMPOUND_LITERAL)
4275 panic("expected non-scalar initializer to be a compound literal");
4276 initializer = value->compound_literal.initializer;
4277 goto have_initializer;
4280 ir_node * node = expression_to_firm(value);
4281 dbg_info *const dbgi = get_dbg_info(&entity->base.source_position);
4282 ir_mode *const mode = get_ir_mode_storage(init_type);
4283 node = create_conv(dbgi, node, mode);
4284 node = do_strict_conv(dbgi, node);
4286 if (declaration_kind == DECLARATION_KIND_LOCAL_VARIABLE) {
4287 set_value(entity->variable.v.value_number, node);
4289 assert(declaration_kind == DECLARATION_KIND_GLOBAL_VARIABLE);
4291 ir_entity *irentity = entity->variable.v.entity;
4293 if (tq & TYPE_QUALIFIER_CONST
4294 && get_entity_owner(irentity) != get_tls_type()) {
4295 add_entity_linkage(irentity, IR_LINKAGE_CONSTANT);
4297 set_atomic_ent_value(irentity, node);
4301 assert(declaration_kind == DECLARATION_KIND_LOCAL_VARIABLE_ENTITY ||
4302 declaration_kind == DECLARATION_KIND_GLOBAL_VARIABLE);
4304 ir_entity *irentity = entity->variable.v.entity;
4305 ir_initializer_t *irinitializer
4306 = create_ir_initializer(initializer, type);
4308 if (tq & TYPE_QUALIFIER_CONST) {
4309 add_entity_linkage(irentity, IR_LINKAGE_CONSTANT);
4311 set_entity_initializer(irentity, irinitializer);
4315 static void create_variable_length_array(entity_t *entity)
4317 assert(entity->kind == ENTITY_VARIABLE);
4318 assert(entity->variable.initializer == NULL);
4320 entity->declaration.kind = DECLARATION_KIND_VARIABLE_LENGTH_ARRAY;
4321 entity->variable.v.vla_base = NULL;
4323 /* TODO: record VLA somewhere so we create the free node when we leave
4327 static void allocate_variable_length_array(entity_t *entity)
4329 assert(entity->kind == ENTITY_VARIABLE);
4330 assert(entity->variable.initializer == NULL);
4331 assert(currently_reachable());
4333 dbg_info *dbgi = get_dbg_info(&entity->base.source_position);
4334 type_t *type = entity->declaration.type;
4335 ir_type *el_type = get_ir_type(type->array.element_type);
4337 /* make sure size_node is calculated */
4338 get_type_size_node(type);
4339 ir_node *elems = type->array.size_node;
4340 ir_node *mem = get_store();
4341 ir_node *alloc = new_d_Alloc(dbgi, mem, elems, el_type, stack_alloc);
4343 ir_node *proj_m = new_d_Proj(dbgi, alloc, mode_M, pn_Alloc_M);
4344 ir_node *addr = new_d_Proj(dbgi, alloc, mode_P_data, pn_Alloc_res);
4347 assert(entity->declaration.kind == DECLARATION_KIND_VARIABLE_LENGTH_ARRAY);
4348 entity->variable.v.vla_base = addr;
4352 * Creates a Firm local variable from a declaration.
4354 static void create_local_variable(entity_t *entity)
4356 assert(entity->kind == ENTITY_VARIABLE);
4357 assert(entity->declaration.kind == DECLARATION_KIND_UNKNOWN);
4359 bool needs_entity = entity->variable.address_taken;
4360 type_t *type = skip_typeref(entity->declaration.type);
4362 /* is it a variable length array? */
4363 if (is_type_array(type) && !type->array.size_constant) {
4364 create_variable_length_array(entity);
4366 } else if (is_type_array(type) || is_type_compound(type)) {
4367 needs_entity = true;
4368 } else if (type->base.qualifiers & TYPE_QUALIFIER_VOLATILE) {
4369 needs_entity = true;
4373 ir_type *frame_type = get_irg_frame_type(current_ir_graph);
4374 create_variable_entity(entity,
4375 DECLARATION_KIND_LOCAL_VARIABLE_ENTITY,
4378 entity->declaration.kind = DECLARATION_KIND_LOCAL_VARIABLE;
4379 entity->variable.v.value_number = next_value_number_function;
4380 set_irg_loc_description(current_ir_graph, next_value_number_function,
4382 ++next_value_number_function;
4386 static void create_local_static_variable(entity_t *entity)
4388 assert(entity->kind == ENTITY_VARIABLE);
4389 assert(entity->declaration.kind == DECLARATION_KIND_UNKNOWN);
4391 type_t *type = skip_typeref(entity->declaration.type);
4392 ir_type *const var_type = entity->variable.thread_local ?
4393 get_tls_type() : get_glob_type();
4394 ir_type *const irtype = get_ir_type(type);
4395 dbg_info *const dbgi = get_dbg_info(&entity->base.source_position);
4397 size_t l = strlen(entity->base.symbol->string);
4398 char buf[l + sizeof(".%u")];
4399 snprintf(buf, sizeof(buf), "%s.%%u", entity->base.symbol->string);
4400 ident *const id = id_unique(buf);
4401 ir_entity *const irentity = new_d_entity(var_type, id, irtype, dbgi);
4403 if (type->base.qualifiers & TYPE_QUALIFIER_VOLATILE) {
4404 set_entity_volatility(irentity, volatility_is_volatile);
4407 entity->declaration.kind = DECLARATION_KIND_GLOBAL_VARIABLE;
4408 entity->variable.v.entity = irentity;
4410 set_entity_ld_ident(irentity, id);
4411 set_entity_visibility(irentity, ir_visibility_local);
4413 if (entity->variable.initializer == NULL) {
4414 ir_initializer_t *null_init = get_initializer_null();
4415 set_entity_initializer(irentity, null_init);
4418 ir_graph *const old_current_ir_graph = current_ir_graph;
4419 current_ir_graph = get_const_code_irg();
4421 create_variable_initializer(entity);
4423 assert(current_ir_graph == get_const_code_irg());
4424 current_ir_graph = old_current_ir_graph;
4429 static ir_node *return_statement_to_firm(return_statement_t *statement)
4431 if (!currently_reachable())
4434 dbg_info *const dbgi = get_dbg_info(&statement->base.source_position);
4435 type_t *const type = skip_typeref(current_function_entity->declaration.type->function.return_type);
4436 ir_node * res = statement->value ? expression_to_firm(statement->value) : NULL;
4439 if (!is_type_void(type)) {
4440 ir_mode *const mode = get_ir_mode_storage(type);
4442 res = create_conv(dbgi, res, mode);
4443 res = do_strict_conv(dbgi, res);
4445 res = new_Unknown(mode);
4452 ir_node *const in[1] = { res };
4453 ir_node *const store = get_store();
4454 ir_node *const ret = new_d_Return(dbgi, store, in_len, in);
4456 ir_node *end_block = get_irg_end_block(current_ir_graph);
4457 add_immBlock_pred(end_block, ret);
4459 set_unreachable_now();
4463 static ir_node *expression_statement_to_firm(expression_statement_t *statement)
4465 if (!currently_reachable())
4468 return expression_to_firm(statement->expression);
4471 static void create_local_declarations(entity_t*);
4473 static ir_node *compound_statement_to_firm(compound_statement_t *compound)
4475 create_local_declarations(compound->scope.entities);
4477 ir_node *result = NULL;
4478 statement_t *statement = compound->statements;
4479 for ( ; statement != NULL; statement = statement->base.next) {
4480 result = statement_to_firm(statement);
4486 static void create_global_variable(entity_t *entity)
4488 ir_linkage linkage = IR_LINKAGE_DEFAULT;
4489 ir_visibility visibility = ir_visibility_external;
4490 storage_class_tag_t storage
4491 = (storage_class_tag_t)entity->declaration.storage_class;
4492 decl_modifiers_t modifiers = entity->declaration.modifiers;
4493 assert(entity->kind == ENTITY_VARIABLE);
4496 case STORAGE_CLASS_EXTERN: visibility = ir_visibility_external; break;
4497 case STORAGE_CLASS_STATIC: visibility = ir_visibility_local; break;
4498 case STORAGE_CLASS_NONE: visibility = ir_visibility_external; break;
4499 case STORAGE_CLASS_TYPEDEF:
4500 case STORAGE_CLASS_AUTO:
4501 case STORAGE_CLASS_REGISTER:
4502 panic("invalid storage class for global var");
4505 /* "common" symbols */
4506 if (storage == STORAGE_CLASS_NONE
4507 && entity->variable.initializer == NULL
4508 && !entity->variable.thread_local
4509 && (modifiers & DM_WEAK) == 0) {
4510 linkage |= IR_LINKAGE_MERGE;
4513 ir_type *var_type = get_glob_type();
4514 if (entity->variable.thread_local) {
4515 var_type = get_tls_type();
4517 create_variable_entity(entity, DECLARATION_KIND_GLOBAL_VARIABLE, var_type);
4518 ir_entity *irentity = entity->variable.v.entity;
4519 add_entity_linkage(irentity, linkage);
4520 set_entity_visibility(irentity, visibility);
4521 if (entity->variable.initializer == NULL
4522 && storage != STORAGE_CLASS_EXTERN) {
4523 ir_initializer_t *null_init = get_initializer_null();
4524 set_entity_initializer(irentity, null_init);
4528 static void create_local_declaration(entity_t *entity)
4530 assert(is_declaration(entity));
4532 /* construct type */
4533 (void) get_ir_type(entity->declaration.type);
4534 if (entity->base.symbol == NULL) {
4538 switch ((storage_class_tag_t) entity->declaration.storage_class) {
4539 case STORAGE_CLASS_STATIC:
4540 if (entity->kind == ENTITY_FUNCTION) {
4541 (void)get_function_entity(entity, NULL);
4543 create_local_static_variable(entity);
4546 case STORAGE_CLASS_EXTERN:
4547 if (entity->kind == ENTITY_FUNCTION) {
4548 assert(entity->function.statement == NULL);
4549 (void)get_function_entity(entity, NULL);
4551 create_global_variable(entity);
4552 create_variable_initializer(entity);
4555 case STORAGE_CLASS_NONE:
4556 case STORAGE_CLASS_AUTO:
4557 case STORAGE_CLASS_REGISTER:
4558 if (entity->kind == ENTITY_FUNCTION) {
4559 if (entity->function.statement != NULL) {
4560 ir_type *owner = get_irg_frame_type(current_ir_graph);
4561 (void)get_function_entity(entity, owner);
4562 entity->declaration.kind = DECLARATION_KIND_INNER_FUNCTION;
4563 enqueue_inner_function(entity);
4565 (void)get_function_entity(entity, NULL);
4568 create_local_variable(entity);
4571 case STORAGE_CLASS_TYPEDEF:
4574 panic("invalid storage class found");
4577 static void create_local_declarations(entity_t *e)
4579 for (; e; e = e->base.next) {
4580 if (is_declaration(e))
4581 create_local_declaration(e);
4585 static void initialize_local_declaration(entity_t *entity)
4587 if (entity->base.symbol == NULL)
4590 // no need to emit code in dead blocks
4591 if (entity->declaration.storage_class != STORAGE_CLASS_STATIC
4592 && !currently_reachable())
4595 switch ((declaration_kind_t) entity->declaration.kind) {
4596 case DECLARATION_KIND_LOCAL_VARIABLE:
4597 case DECLARATION_KIND_LOCAL_VARIABLE_ENTITY:
4598 create_variable_initializer(entity);
4601 case DECLARATION_KIND_VARIABLE_LENGTH_ARRAY:
4602 allocate_variable_length_array(entity);
4605 case DECLARATION_KIND_COMPOUND_MEMBER:
4606 case DECLARATION_KIND_GLOBAL_VARIABLE:
4607 case DECLARATION_KIND_FUNCTION:
4608 case DECLARATION_KIND_INNER_FUNCTION:
4611 case DECLARATION_KIND_PARAMETER:
4612 case DECLARATION_KIND_PARAMETER_ENTITY:
4613 panic("can't initialize parameters");
4615 case DECLARATION_KIND_UNKNOWN:
4616 panic("can't initialize unknown declaration");
4618 panic("invalid declaration kind");
4621 static ir_node *declaration_statement_to_firm(declaration_statement_t *statement)
4623 entity_t *entity = statement->declarations_begin;
4627 entity_t *const last = statement->declarations_end;
4628 for ( ;; entity = entity->base.next) {
4629 if (is_declaration(entity)) {
4630 initialize_local_declaration(entity);
4631 } else if (entity->kind == ENTITY_TYPEDEF) {
4632 /* ยง6.7.7:3 Any array size expressions associated with variable length
4633 * array declarators are evaluated each time the declaration of the
4634 * typedef name is reached in the order of execution. */
4635 type_t *const type = skip_typeref(entity->typedefe.type);
4636 if (is_type_array(type) && type->array.is_vla)
4637 get_vla_size(&type->array);
4646 static ir_node *if_statement_to_firm(if_statement_t *statement)
4648 create_local_declarations(statement->scope.entities);
4650 /* Create the condition. */
4651 ir_node *true_block = NULL;
4652 ir_node *false_block = NULL;
4653 if (currently_reachable()) {
4654 true_block = new_immBlock();
4655 false_block = new_immBlock();
4656 create_condition_evaluation(statement->condition, true_block, false_block);
4657 mature_immBlock(true_block);
4658 mature_immBlock(false_block);
4661 /* Create the true statement. */
4662 set_cur_block(true_block);
4663 statement_to_firm(statement->true_statement);
4664 ir_node *fallthrough_block = get_cur_block();
4666 /* Create the false statement. */
4667 set_cur_block(false_block);
4668 if (statement->false_statement != NULL) {
4669 statement_to_firm(statement->false_statement);
4672 /* Handle the block after the if-statement. Minor simplification and
4673 * optimisation: Reuse the false/true block as fallthrough block, if the
4674 * true/false statement does not pass control to the fallthrough block, e.g.
4675 * in the typical if (x) return; pattern. */
4676 if (fallthrough_block) {
4677 if (currently_reachable()) {
4678 ir_node *const t_jump = new_r_Jmp(fallthrough_block);
4679 ir_node *const f_jump = new_Jmp();
4680 ir_node *const in[] = { t_jump, f_jump };
4681 fallthrough_block = new_Block(2, in);
4683 set_cur_block(fallthrough_block);
4690 * Add an unconditional jump to the target block. If the source block is not
4691 * reachable, then a Bad predecessor is created to prevent Phi-less unreachable
4692 * loops. This is necessary if the jump potentially enters a loop.
4694 static void jump_to(ir_node *const target_block)
4696 ir_node *const pred = currently_reachable() ? new_Jmp() : new_Bad(mode_X);
4697 add_immBlock_pred(target_block, pred);
4701 * Add an unconditional jump to the target block, if the current block is
4702 * reachable and do nothing otherwise. This is only valid if the jump does not
4703 * enter a loop (a back edge is ok).
4705 static void jump_if_reachable(ir_node *const target_block)
4707 if (currently_reachable())
4708 add_immBlock_pred(target_block, new_Jmp());
4711 static ir_node *while_statement_to_firm(while_statement_t *statement)
4713 create_local_declarations(statement->scope.entities);
4715 /* Create the header block */
4716 ir_node *const header_block = new_immBlock();
4717 jump_to(header_block);
4719 /* Create the condition. */
4720 ir_node * body_block;
4721 ir_node * false_block;
4722 expression_t *const cond = statement->condition;
4723 if (is_constant_expression(cond) == EXPR_CLASS_CONSTANT &&
4724 fold_constant_to_bool(cond)) {
4725 /* Shortcut for while (true). */
4726 body_block = header_block;
4729 keep_alive(header_block);
4730 keep_all_memory(header_block);
4732 body_block = new_immBlock();
4733 false_block = new_immBlock();
4735 set_cur_block(header_block);
4736 create_condition_evaluation(cond, body_block, false_block);
4737 mature_immBlock(body_block);
4740 ir_node *const old_continue_label = continue_label;
4741 ir_node *const old_break_label = break_label;
4742 continue_label = header_block;
4743 break_label = false_block;
4745 /* Create the loop body. */
4746 set_cur_block(body_block);
4747 statement_to_firm(statement->body);
4748 jump_if_reachable(header_block);
4750 mature_immBlock(header_block);
4751 assert(false_block == NULL || false_block == break_label);
4752 false_block = break_label;
4753 if (false_block != NULL) {
4754 mature_immBlock(false_block);
4756 set_cur_block(false_block);
4758 assert(continue_label == header_block);
4759 continue_label = old_continue_label;
4760 break_label = old_break_label;
4764 static ir_node *get_break_label(void)
4766 if (break_label == NULL) {
4767 break_label = new_immBlock();
4772 static ir_node *do_while_statement_to_firm(do_while_statement_t *statement)
4774 create_local_declarations(statement->scope.entities);
4776 /* create the header block */
4777 ir_node *header_block = new_immBlock();
4780 ir_node *body_block = new_immBlock();
4781 jump_to(body_block);
4783 ir_node *old_continue_label = continue_label;
4784 ir_node *old_break_label = break_label;
4785 continue_label = header_block;
4788 set_cur_block(body_block);
4789 statement_to_firm(statement->body);
4790 ir_node *const false_block = get_break_label();
4792 assert(continue_label == header_block);
4793 continue_label = old_continue_label;
4794 break_label = old_break_label;
4796 jump_if_reachable(header_block);
4798 /* create the condition */
4799 mature_immBlock(header_block);
4800 set_cur_block(header_block);
4802 create_condition_evaluation(statement->condition, body_block, false_block);
4803 mature_immBlock(body_block);
4804 mature_immBlock(false_block);
4806 set_cur_block(false_block);
4810 static ir_node *for_statement_to_firm(for_statement_t *statement)
4812 create_local_declarations(statement->scope.entities);
4814 if (currently_reachable()) {
4815 entity_t *entity = statement->scope.entities;
4816 for ( ; entity != NULL; entity = entity->base.next) {
4817 if (!is_declaration(entity))
4820 initialize_local_declaration(entity);
4823 if (statement->initialisation != NULL) {
4824 expression_to_firm(statement->initialisation);
4828 /* Create the header block */
4829 ir_node *const header_block = new_immBlock();
4830 jump_to(header_block);
4832 /* Create the condition. */
4833 ir_node *body_block;
4834 ir_node *false_block;
4835 if (statement->condition != NULL) {
4836 body_block = new_immBlock();
4837 false_block = new_immBlock();
4839 set_cur_block(header_block);
4840 create_condition_evaluation(statement->condition, body_block, false_block);
4841 mature_immBlock(body_block);
4844 body_block = header_block;
4847 keep_alive(header_block);
4848 keep_all_memory(header_block);
4851 /* Create the step block, if necessary. */
4852 ir_node * step_block = header_block;
4853 expression_t *const step = statement->step;
4855 step_block = new_immBlock();
4858 ir_node *const old_continue_label = continue_label;
4859 ir_node *const old_break_label = break_label;
4860 continue_label = step_block;
4861 break_label = false_block;
4863 /* Create the loop body. */
4864 set_cur_block(body_block);
4865 statement_to_firm(statement->body);
4866 jump_if_reachable(step_block);
4868 /* Create the step code. */
4870 mature_immBlock(step_block);
4871 set_cur_block(step_block);
4872 expression_to_firm(step);
4873 jump_if_reachable(header_block);
4876 mature_immBlock(header_block);
4877 assert(false_block == NULL || false_block == break_label);
4878 false_block = break_label;
4879 if (false_block != NULL) {
4880 mature_immBlock(false_block);
4882 set_cur_block(false_block);
4884 assert(continue_label == step_block);
4885 continue_label = old_continue_label;
4886 break_label = old_break_label;
4890 static ir_node *create_jump_statement(const statement_t *statement, ir_node *target_block)
4892 if (!currently_reachable())
4895 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
4896 ir_node *jump = new_d_Jmp(dbgi);
4897 add_immBlock_pred(target_block, jump);
4899 set_unreachable_now();
4903 static ir_switch_table *create_switch_table(const switch_statement_t *statement)
4905 /* determine number of cases */
4907 for (case_label_statement_t *l = statement->first_case; l != NULL;
4910 if (l->expression == NULL)
4912 if (l->is_empty_range)
4917 ir_switch_table *res = ir_new_switch_table(current_ir_graph, n_cases);
4919 for (case_label_statement_t *l = statement->first_case; l != NULL;
4921 if (l->expression == NULL) {
4922 l->pn = pn_Switch_default;
4925 if (l->is_empty_range)
4927 ir_tarval *min = fold_constant_to_tarval(l->expression);
4928 ir_tarval *max = min;
4929 long pn = (long) i+1;
4930 if (l->end_range != NULL)
4931 max = fold_constant_to_tarval(l->end_range);
4932 ir_switch_table_set(res, i++, min, max, pn);
4938 static ir_node *switch_statement_to_firm(switch_statement_t *statement)
4940 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
4941 ir_node *switch_node = NULL;
4943 if (currently_reachable()) {
4944 ir_node *expression = expression_to_firm(statement->expression);
4945 ir_switch_table *table = create_switch_table(statement);
4946 unsigned n_outs = (unsigned)ir_switch_table_get_n_entries(table) + 1;
4948 switch_node = new_d_Switch(dbgi, expression, n_outs, table);
4951 set_unreachable_now();
4953 ir_node *const old_switch = current_switch;
4954 ir_node *const old_break_label = break_label;
4955 const bool old_saw_default_label = saw_default_label;
4956 saw_default_label = false;
4957 current_switch = switch_node;
4960 statement_to_firm(statement->body);
4962 if (currently_reachable()) {
4963 add_immBlock_pred(get_break_label(), new_Jmp());
4966 if (!saw_default_label && switch_node) {
4967 ir_node *proj = new_d_Proj(dbgi, switch_node, mode_X, pn_Switch_default);
4968 add_immBlock_pred(get_break_label(), proj);
4971 if (break_label != NULL) {
4972 mature_immBlock(break_label);
4974 set_cur_block(break_label);
4976 assert(current_switch == switch_node);
4977 current_switch = old_switch;
4978 break_label = old_break_label;
4979 saw_default_label = old_saw_default_label;
4983 static ir_node *case_label_to_firm(const case_label_statement_t *statement)
4985 if (statement->is_empty_range)
4988 if (current_switch != NULL) {
4989 ir_node *block = new_immBlock();
4990 /* Fallthrough from previous case */
4991 jump_if_reachable(block);
4993 ir_node *const proj = new_Proj(current_switch, mode_X, statement->pn);
4994 add_immBlock_pred(block, proj);
4995 if (statement->expression == NULL)
4996 saw_default_label = true;
4998 mature_immBlock(block);
4999 set_cur_block(block);
5002 return statement_to_firm(statement->statement);
5005 static ir_node *label_to_firm(const label_statement_t *statement)
5007 ir_node *block = get_label_block(statement->label);
5010 set_cur_block(block);
5012 keep_all_memory(block);
5014 return statement_to_firm(statement->statement);
5017 static ir_node *computed_goto_to_firm(computed_goto_statement_t const *const statement)
5019 if (!currently_reachable())
5022 ir_node *const irn = expression_to_firm(statement->expression);
5023 dbg_info *const dbgi = get_dbg_info(&statement->base.source_position);
5024 ir_node *const ijmp = new_d_IJmp(dbgi, irn);
5026 set_irn_link(ijmp, ijmp_list);
5029 set_unreachable_now();
5033 static ir_node *asm_statement_to_firm(const asm_statement_t *statement)
5035 bool needs_memory = false;
5037 if (statement->is_volatile) {
5038 needs_memory = true;
5041 size_t n_clobbers = 0;
5042 asm_clobber_t *clobber = statement->clobbers;
5043 for ( ; clobber != NULL; clobber = clobber->next) {
5044 const char *clobber_str = clobber->clobber.begin;
5046 if (!be_is_valid_clobber(clobber_str)) {
5047 errorf(&statement->base.source_position,
5048 "invalid clobber '%s' specified", clobber->clobber);
5052 if (streq(clobber_str, "memory")) {
5053 needs_memory = true;
5057 ident *id = new_id_from_str(clobber_str);
5058 obstack_ptr_grow(&asm_obst, id);
5061 assert(obstack_object_size(&asm_obst) == n_clobbers * sizeof(ident*));
5062 ident **clobbers = NULL;
5063 if (n_clobbers > 0) {
5064 clobbers = obstack_finish(&asm_obst);
5067 size_t n_inputs = 0;
5068 asm_argument_t *argument = statement->inputs;
5069 for ( ; argument != NULL; argument = argument->next)
5071 size_t n_outputs = 0;
5072 argument = statement->outputs;
5073 for ( ; argument != NULL; argument = argument->next)
5076 unsigned next_pos = 0;
5078 ir_node *ins[n_inputs + n_outputs + 1];
5081 ir_asm_constraint tmp_in_constraints[n_outputs];
5083 const expression_t *out_exprs[n_outputs];
5084 ir_node *out_addrs[n_outputs];
5085 size_t out_size = 0;
5087 argument = statement->outputs;
5088 for ( ; argument != NULL; argument = argument->next) {
5089 const char *constraints = argument->constraints.begin;
5090 asm_constraint_flags_t asm_flags
5091 = be_parse_asm_constraints(constraints);
5094 source_position_t const *const pos = &statement->base.source_position;
5095 if (asm_flags & ASM_CONSTRAINT_FLAG_NO_SUPPORT) {
5096 warningf(WARN_OTHER, pos, "some constraints in '%s' are not supported", constraints);
5098 if (asm_flags & ASM_CONSTRAINT_FLAG_INVALID) {
5099 errorf(pos, "some constraints in '%s' are invalid", constraints);
5102 if (! (asm_flags & ASM_CONSTRAINT_FLAG_MODIFIER_WRITE)) {
5103 errorf(pos, "no write flag specified for output constraints '%s'", constraints);
5108 unsigned pos = next_pos++;
5109 if ( (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE)
5110 || (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER) ) {
5111 expression_t *expr = argument->expression;
5112 ir_node *addr = expression_to_addr(expr);
5113 /* in+output, construct an artifical same_as constraint on the
5115 if (asm_flags & ASM_CONSTRAINT_FLAG_MODIFIER_READ) {
5117 ir_node *value = get_value_from_lvalue(expr, addr);
5119 snprintf(buf, sizeof(buf), "%u", (unsigned) out_size);
5121 ir_asm_constraint constraint;
5122 constraint.pos = pos;
5123 constraint.constraint = new_id_from_str(buf);
5124 constraint.mode = get_ir_mode_storage(expr->base.type);
5125 tmp_in_constraints[in_size] = constraint;
5126 ins[in_size] = value;
5131 out_exprs[out_size] = expr;
5132 out_addrs[out_size] = addr;
5134 } else if (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP) {
5135 /* pure memory ops need no input (but we have to make sure we
5136 * attach to the memory) */
5137 assert(! (asm_flags &
5138 (ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE
5139 | ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER)));
5140 needs_memory = true;
5142 /* we need to attach the address to the inputs */
5143 expression_t *expr = argument->expression;
5145 ir_asm_constraint constraint;
5146 constraint.pos = pos;
5147 constraint.constraint = new_id_from_str(constraints);
5148 constraint.mode = mode_M;
5149 tmp_in_constraints[in_size] = constraint;
5151 ins[in_size] = expression_to_addr(expr);
5155 errorf(&statement->base.source_position,
5156 "only modifiers but no place set in constraints '%s'",
5161 ir_asm_constraint constraint;
5162 constraint.pos = pos;
5163 constraint.constraint = new_id_from_str(constraints);
5164 constraint.mode = get_ir_mode_storage(argument->expression->base.type);
5166 obstack_grow(&asm_obst, &constraint, sizeof(constraint));
5168 assert(obstack_object_size(&asm_obst)
5169 == out_size * sizeof(ir_asm_constraint));
5170 ir_asm_constraint *output_constraints = obstack_finish(&asm_obst);
5173 obstack_grow(&asm_obst, tmp_in_constraints,
5174 in_size * sizeof(tmp_in_constraints[0]));
5175 /* find and count input and output arguments */
5176 argument = statement->inputs;
5177 for ( ; argument != NULL; argument = argument->next) {
5178 const char *constraints = argument->constraints.begin;
5179 asm_constraint_flags_t asm_flags
5180 = be_parse_asm_constraints(constraints);
5182 if (asm_flags & ASM_CONSTRAINT_FLAG_NO_SUPPORT) {
5183 errorf(&statement->base.source_position,
5184 "some constraints in '%s' are not supported", constraints);
5187 if (asm_flags & ASM_CONSTRAINT_FLAG_INVALID) {
5188 errorf(&statement->base.source_position,
5189 "some constraints in '%s' are invalid", constraints);
5192 if (asm_flags & ASM_CONSTRAINT_FLAG_MODIFIER_WRITE) {
5193 errorf(&statement->base.source_position,
5194 "write flag specified for input constraints '%s'",
5200 if ( (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE)
5201 || (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER) ) {
5202 /* we can treat this as "normal" input */
5203 input = expression_to_firm(argument->expression);
5204 } else if (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP) {
5205 /* pure memory ops need no input (but we have to make sure we
5206 * attach to the memory) */
5207 assert(! (asm_flags &
5208 (ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE
5209 | ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER)));
5210 needs_memory = true;
5211 input = expression_to_addr(argument->expression);
5213 errorf(&statement->base.source_position,
5214 "only modifiers but no place set in constraints '%s'",
5219 ir_asm_constraint constraint;
5220 constraint.pos = next_pos++;
5221 constraint.constraint = new_id_from_str(constraints);
5222 constraint.mode = get_irn_mode(input);
5224 obstack_grow(&asm_obst, &constraint, sizeof(constraint));
5225 ins[in_size++] = input;
5229 ir_asm_constraint constraint;
5230 constraint.pos = next_pos++;
5231 constraint.constraint = new_id_from_str("");
5232 constraint.mode = mode_M;
5234 obstack_grow(&asm_obst, &constraint, sizeof(constraint));
5235 ins[in_size++] = get_store();
5238 assert(obstack_object_size(&asm_obst)
5239 == in_size * sizeof(ir_asm_constraint));
5240 ir_asm_constraint *input_constraints = obstack_finish(&asm_obst);
5242 /* create asm node */
5243 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
5245 ident *asm_text = new_id_from_str(statement->asm_text.begin);
5247 ir_node *node = new_d_ASM(dbgi, in_size, ins, input_constraints,
5248 out_size, output_constraints,
5249 n_clobbers, clobbers, asm_text);
5251 if (statement->is_volatile) {
5252 set_irn_pinned(node, op_pin_state_pinned);
5254 set_irn_pinned(node, op_pin_state_floats);
5257 /* create output projs & connect them */
5259 ir_node *projm = new_Proj(node, mode_M, out_size);
5264 for (i = 0; i < out_size; ++i) {
5265 const expression_t *out_expr = out_exprs[i];
5267 ir_mode *mode = get_ir_mode_storage(out_expr->base.type);
5268 ir_node *proj = new_Proj(node, mode, pn);
5269 ir_node *addr = out_addrs[i];
5271 set_value_for_expression_addr(out_expr, proj, addr);
5277 static ir_node *ms_try_statement_to_firm(ms_try_statement_t *statement)
5279 statement_to_firm(statement->try_statement);
5280 source_position_t const *const pos = &statement->base.source_position;
5281 warningf(WARN_OTHER, pos, "structured exception handling ignored");
5285 static ir_node *leave_statement_to_firm(leave_statement_t *statement)
5287 errorf(&statement->base.source_position, "__leave not supported yet");
5292 * Transform a statement.
5294 static ir_node *statement_to_firm(statement_t *const stmt)
5297 assert(!stmt->base.transformed);
5298 stmt->base.transformed = true;
5301 switch (stmt->kind) {
5302 case STATEMENT_ASM: return asm_statement_to_firm( &stmt->asms);
5303 case STATEMENT_CASE_LABEL: return case_label_to_firm( &stmt->case_label);
5304 case STATEMENT_COMPOUND: return compound_statement_to_firm( &stmt->compound);
5305 case STATEMENT_COMPUTED_GOTO: return computed_goto_to_firm( &stmt->computed_goto);
5306 case STATEMENT_DECLARATION: return declaration_statement_to_firm(&stmt->declaration);
5307 case STATEMENT_DO_WHILE: return do_while_statement_to_firm( &stmt->do_while);
5308 case STATEMENT_EMPTY: return NULL; /* nothing */
5309 case STATEMENT_EXPRESSION: return expression_statement_to_firm( &stmt->expression);
5310 case STATEMENT_FOR: return for_statement_to_firm( &stmt->fors);
5311 case STATEMENT_IF: return if_statement_to_firm( &stmt->ifs);
5312 case STATEMENT_LABEL: return label_to_firm( &stmt->label);
5313 case STATEMENT_LEAVE: return leave_statement_to_firm( &stmt->leave);
5314 case STATEMENT_MS_TRY: return ms_try_statement_to_firm( &stmt->ms_try);
5315 case STATEMENT_RETURN: return return_statement_to_firm( &stmt->returns);
5316 case STATEMENT_SWITCH: return switch_statement_to_firm( &stmt->switchs);
5317 case STATEMENT_WHILE: return while_statement_to_firm( &stmt->whiles);
5319 case STATEMENT_BREAK: return create_jump_statement(stmt, get_break_label());
5320 case STATEMENT_CONTINUE: return create_jump_statement(stmt, continue_label);
5321 case STATEMENT_GOTO: return create_jump_statement(stmt, get_label_block(stmt->gotos.label));
5323 case STATEMENT_ERROR: panic("error statement found");
5325 panic("statement not implemented");
5328 static int count_local_variables(const entity_t *entity,
5329 const entity_t *const last)
5332 entity_t const *const end = last != NULL ? last->base.next : NULL;
5333 for (; entity != end; entity = entity->base.next) {
5337 if (entity->kind == ENTITY_VARIABLE) {
5338 type = skip_typeref(entity->declaration.type);
5339 address_taken = entity->variable.address_taken;
5340 } else if (entity->kind == ENTITY_PARAMETER) {
5341 type = skip_typeref(entity->declaration.type);
5342 address_taken = entity->parameter.address_taken;
5347 if (!address_taken && is_type_scalar(type))
5353 static void count_local_variables_in_stmt(statement_t *stmt, void *const env)
5355 int *const count = env;
5357 switch (stmt->kind) {
5358 case STATEMENT_DECLARATION: {
5359 const declaration_statement_t *const decl_stmt = &stmt->declaration;
5360 *count += count_local_variables(decl_stmt->declarations_begin,
5361 decl_stmt->declarations_end);
5366 *count += count_local_variables(stmt->fors.scope.entities, NULL);
5375 * Return the number of local (alias free) variables used by a function.
5377 static int get_function_n_local_vars(entity_t *entity)
5379 const function_t *function = &entity->function;
5382 /* count parameters */
5383 count += count_local_variables(function->parameters.entities, NULL);
5385 /* count local variables declared in body */
5386 walk_statements(function->statement, count_local_variables_in_stmt, &count);
5391 * Build Firm code for the parameters of a function.
5393 static void initialize_function_parameters(entity_t *entity)
5395 assert(entity->kind == ENTITY_FUNCTION);
5396 ir_graph *irg = current_ir_graph;
5397 ir_node *args = get_irg_args(irg);
5399 ir_type *function_irtype;
5401 if (entity->function.need_closure) {
5402 /* add an extra parameter for the static link */
5403 entity->function.static_link = new_r_Proj(args, mode_P_data, 0);
5406 /* Matze: IMO this is wrong, nested functions should have an own
5407 * type and not rely on strange parameters... */
5408 function_irtype = create_method_type(&entity->declaration.type->function, true);
5410 function_irtype = get_ir_type(entity->declaration.type);
5415 entity_t *parameter = entity->function.parameters.entities;
5416 for ( ; parameter != NULL; parameter = parameter->base.next, ++n) {
5417 if (parameter->kind != ENTITY_PARAMETER)
5420 assert(parameter->declaration.kind == DECLARATION_KIND_UNKNOWN);
5421 type_t *type = skip_typeref(parameter->declaration.type);
5423 bool needs_entity = parameter->parameter.address_taken;
5424 assert(!is_type_array(type));
5425 if (is_type_compound(type)) {
5426 needs_entity = true;
5429 ir_type *param_irtype = get_method_param_type(function_irtype, n);
5431 ir_type *frame_type = get_irg_frame_type(irg);
5433 = new_parameter_entity(frame_type, n, param_irtype);
5434 parameter->declaration.kind
5435 = DECLARATION_KIND_PARAMETER_ENTITY;
5436 parameter->parameter.v.entity = param;
5440 ir_mode *param_mode = get_type_mode(param_irtype);
5442 ir_node *value = new_r_Proj(args, param_mode, pn);
5444 ir_mode *mode = get_ir_mode_storage(type);
5445 value = create_conv(NULL, value, mode);
5446 value = do_strict_conv(NULL, value);
5448 parameter->declaration.kind = DECLARATION_KIND_PARAMETER;
5449 parameter->parameter.v.value_number = next_value_number_function;
5450 set_irg_loc_description(current_ir_graph, next_value_number_function,
5452 ++next_value_number_function;
5454 set_value(parameter->parameter.v.value_number, value);
5459 * Handle additional decl modifiers for IR-graphs
5461 * @param irg the IR-graph
5462 * @param dec_modifiers additional modifiers
5464 static void handle_decl_modifier_irg(ir_graph *irg,
5465 decl_modifiers_t decl_modifiers)
5467 if (decl_modifiers & DM_NAKED) {
5468 /* TRUE if the declaration includes the Microsoft
5469 __declspec(naked) specifier. */
5470 add_irg_additional_properties(irg, mtp_property_naked);
5472 if (decl_modifiers & DM_FORCEINLINE) {
5473 /* TRUE if the declaration includes the
5474 Microsoft __forceinline specifier. */
5475 set_irg_inline_property(irg, irg_inline_forced);
5477 if (decl_modifiers & DM_NOINLINE) {
5478 /* TRUE if the declaration includes the Microsoft
5479 __declspec(noinline) specifier. */
5480 set_irg_inline_property(irg, irg_inline_forbidden);
5484 static void add_function_pointer(ir_type *segment, ir_entity *method,
5485 const char *unique_template)
5487 ir_type *method_type = get_entity_type(method);
5488 ir_type *ptr_type = new_type_pointer(method_type);
5490 /* these entities don't really have a name but firm only allows
5492 * Note that we mustn't give these entities a name since for example
5493 * Mach-O doesn't allow them. */
5494 ident *ide = id_unique(unique_template);
5495 ir_entity *ptr = new_entity(segment, ide, ptr_type);
5496 ir_graph *irg = get_const_code_irg();
5497 ir_node *val = new_rd_SymConst_addr_ent(NULL, irg, mode_P_code,
5500 set_entity_ld_ident(ptr, new_id_from_chars("", 0));
5501 set_entity_compiler_generated(ptr, 1);
5502 set_entity_visibility(ptr, ir_visibility_private);
5503 add_entity_linkage(ptr, IR_LINKAGE_CONSTANT|IR_LINKAGE_HIDDEN_USER);
5504 set_atomic_ent_value(ptr, val);
5508 * Generate possible IJmp branches to a given label block.
5510 static void gen_ijmp_branches(ir_node *block)
5513 for (ijmp = ijmp_list; ijmp != NULL; ijmp = get_irn_link(ijmp)) {
5514 add_immBlock_pred(block, ijmp);
5519 * Create code for a function and all inner functions.
5521 * @param entity the function entity
5523 static void create_function(entity_t *entity)
5525 assert(entity->kind == ENTITY_FUNCTION);
5526 ir_entity *function_entity = get_function_entity(entity, current_outer_frame);
5528 if (entity->function.statement == NULL)
5531 inner_functions = NULL;
5532 current_trampolines = NULL;
5534 if (entity->declaration.modifiers & DM_CONSTRUCTOR) {
5535 ir_type *segment = get_segment_type(IR_SEGMENT_CONSTRUCTORS);
5536 add_function_pointer(segment, function_entity, "constructor_ptr.%u");
5538 if (entity->declaration.modifiers & DM_DESTRUCTOR) {
5539 ir_type *segment = get_segment_type(IR_SEGMENT_DESTRUCTORS);
5540 add_function_pointer(segment, function_entity, "destructor_ptr.%u");
5543 current_function_entity = entity;
5544 current_function_name = NULL;
5545 current_funcsig = NULL;
5547 assert(all_labels == NULL);
5548 all_labels = NEW_ARR_F(label_t *, 0);
5551 int n_local_vars = get_function_n_local_vars(entity);
5552 ir_graph *irg = new_ir_graph(function_entity, n_local_vars);
5553 current_ir_graph = irg;
5555 ir_graph *old_current_function = current_function;
5556 current_function = irg;
5558 ir_entity *const old_current_vararg_entity = current_vararg_entity;
5559 current_vararg_entity = NULL;
5561 set_irg_fp_model(irg, firm_fp_model);
5562 tarval_enable_fp_ops(1);
5563 set_irn_dbg_info(get_irg_start_block(irg),
5564 get_entity_dbg_info(function_entity));
5566 /* set inline flags */
5567 if (entity->function.is_inline)
5568 set_irg_inline_property(irg, irg_inline_recomended);
5569 handle_decl_modifier_irg(irg, entity->declaration.modifiers);
5571 next_value_number_function = 0;
5572 initialize_function_parameters(entity);
5573 current_static_link = entity->function.static_link;
5575 statement_to_firm(entity->function.statement);
5577 ir_node *end_block = get_irg_end_block(irg);
5579 /* do we have a return statement yet? */
5580 if (currently_reachable()) {
5581 type_t *type = skip_typeref(entity->declaration.type);
5582 assert(is_type_function(type));
5583 type_t *const return_type = skip_typeref(type->function.return_type);
5586 if (is_type_void(return_type)) {
5587 ret = new_Return(get_store(), 0, NULL);
5589 ir_mode *const mode = get_ir_mode_storage(return_type);
5592 /* ยง5.1.2.2.3 main implicitly returns 0 */
5593 if (is_main(entity)) {
5594 in[0] = new_Const(get_mode_null(mode));
5596 in[0] = new_Unknown(mode);
5598 ret = new_Return(get_store(), 1, in);
5600 add_immBlock_pred(end_block, ret);
5603 for (int i = ARR_LEN(all_labels) - 1; i >= 0; --i) {
5604 label_t *label = all_labels[i];
5605 if (label->address_taken) {
5606 gen_ijmp_branches(label->block);
5608 mature_immBlock(label->block);
5611 DEL_ARR_F(all_labels);
5614 irg_finalize_cons(irg);
5616 /* finalize the frame type */
5617 ir_type *frame_type = get_irg_frame_type(irg);
5618 int n = get_compound_n_members(frame_type);
5621 for (int i = 0; i < n; ++i) {
5622 ir_entity *member = get_compound_member(frame_type, i);
5623 ir_type *entity_type = get_entity_type(member);
5625 int align = get_type_alignment_bytes(entity_type);
5626 if (align > align_all)
5630 misalign = offset % align;
5632 offset += align - misalign;
5636 set_entity_offset(member, offset);
5637 offset += get_type_size_bytes(entity_type);
5639 set_type_size_bytes(frame_type, offset);
5640 set_type_alignment_bytes(frame_type, align_all);
5642 irg_verify(irg, VERIFY_ENFORCE_SSA);
5643 current_vararg_entity = old_current_vararg_entity;
5644 current_function = old_current_function;
5646 if (current_trampolines != NULL) {
5647 DEL_ARR_F(current_trampolines);
5648 current_trampolines = NULL;
5651 /* create inner functions if any */
5652 entity_t **inner = inner_functions;
5653 if (inner != NULL) {
5654 ir_type *rem_outer_frame = current_outer_frame;
5655 current_outer_frame = get_irg_frame_type(current_ir_graph);
5656 for (int i = ARR_LEN(inner) - 1; i >= 0; --i) {
5657 create_function(inner[i]);
5661 current_outer_frame = rem_outer_frame;
5665 static void scope_to_firm(scope_t *scope)
5667 /* first pass: create declarations */
5668 entity_t *entity = scope->entities;
5669 for ( ; entity != NULL; entity = entity->base.next) {
5670 if (entity->base.symbol == NULL)
5673 if (entity->kind == ENTITY_FUNCTION) {
5674 if (entity->function.btk != BUILTIN_NONE) {
5675 /* builtins have no representation */
5678 (void)get_function_entity(entity, NULL);
5679 } else if (entity->kind == ENTITY_VARIABLE) {
5680 create_global_variable(entity);
5681 } else if (entity->kind == ENTITY_NAMESPACE) {
5682 scope_to_firm(&entity->namespacee.members);
5686 /* second pass: create code/initializers */
5687 entity = scope->entities;
5688 for ( ; entity != NULL; entity = entity->base.next) {
5689 if (entity->base.symbol == NULL)
5692 if (entity->kind == ENTITY_FUNCTION) {
5693 if (entity->function.btk != BUILTIN_NONE) {
5694 /* builtins have no representation */
5697 create_function(entity);
5698 } else if (entity->kind == ENTITY_VARIABLE) {
5699 assert(entity->declaration.kind
5700 == DECLARATION_KIND_GLOBAL_VARIABLE);
5701 current_ir_graph = get_const_code_irg();
5702 create_variable_initializer(entity);
5707 void init_ast2firm(void)
5709 obstack_init(&asm_obst);
5710 init_atomic_modes();
5712 ir_set_debug_retrieve(dbg_retrieve);
5713 ir_set_type_debug_retrieve(dbg_print_type_dbg_info);
5715 /* create idents for all known runtime functions */
5716 for (size_t i = 0; i < lengthof(rts_data); ++i) {
5717 rts_idents[i] = new_id_from_str(rts_data[i].name);
5720 entitymap_init(&entitymap);
5723 static void init_ir_types(void)
5725 static int ir_types_initialized = 0;
5726 if (ir_types_initialized)
5728 ir_types_initialized = 1;
5730 ir_type_char = get_ir_type(type_char);
5731 ir_type_const_char = get_ir_type(type_const_char);
5732 ir_type_wchar_t = get_ir_type(type_wchar_t);
5734 be_params = be_get_backend_param();
5735 mode_float_arithmetic = be_params->mode_float_arithmetic;
5737 stack_param_align = be_params->stack_param_align;
5740 void exit_ast2firm(void)
5742 entitymap_destroy(&entitymap);
5743 obstack_free(&asm_obst, NULL);
5746 static void global_asm_to_firm(statement_t *s)
5748 for (; s != NULL; s = s->base.next) {
5749 assert(s->kind == STATEMENT_ASM);
5751 char const *const text = s->asms.asm_text.begin;
5752 size_t size = s->asms.asm_text.size;
5754 /* skip the last \0 */
5755 if (text[size - 1] == '\0')
5758 ident *const id = new_id_from_chars(text, size);
5763 static const char *get_cwd(void)
5765 static char buf[1024];
5767 getcwd(buf, sizeof(buf));
5771 void translation_unit_to_firm(translation_unit_t *unit)
5773 if (c_mode & _CXX) {
5774 be_dwarf_set_source_language(DW_LANG_C_plus_plus);
5775 } else if (c_mode & _C99) {
5776 be_dwarf_set_source_language(DW_LANG_C99);
5777 } else if (c_mode & _C89) {
5778 be_dwarf_set_source_language(DW_LANG_C89);
5780 be_dwarf_set_source_language(DW_LANG_C);
5782 be_dwarf_set_compilation_directory(get_cwd());
5784 /* initialize firm arithmetic */
5785 tarval_set_integer_overflow_mode(TV_OVERFLOW_WRAP);
5786 ir_set_uninitialized_local_variable_func(uninitialized_local_var);
5788 /* just to be sure */
5789 continue_label = NULL;
5791 current_switch = NULL;
5792 current_translation_unit = unit;
5796 scope_to_firm(&unit->scope);
5797 global_asm_to_firm(unit->global_asm);
5799 current_ir_graph = NULL;
5800 current_translation_unit = NULL;