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, type_t *type)
1191 const char *string = literal->value.begin;
1192 size_t size = literal->value.size;
1194 assert(type->kind == TYPE_ATOMIC);
1195 atomic_type_kind_t akind = type->atomic.akind;
1197 ir_mode *const mode = atomic_modes[akind];
1198 ir_tarval *const tv = new_tarval_from_str(string, size, mode);
1199 if (tv == tarval_bad)
1202 literal->base.type = type;
1203 literal->target_value = tv;
1207 static void create_integer_tarval(literal_expression_t *literal)
1209 /* -1: signed only, 0: any, 1: unsigned only */
1210 int sign = literal->base.kind == EXPR_LITERAL_INTEGER ? -1 : 0;
1212 const string_t *suffix = &literal->suffix;
1214 if (suffix->size > 0) {
1215 for (const char *c = suffix->begin; *c != '\0'; ++c) {
1216 if (*c == 'u' || *c == 'U') sign = 1;
1217 if (*c == 'l' || *c == 'L') { ++ls; }
1221 tarval_int_overflow_mode_t old_mode = tarval_get_integer_overflow_mode();
1223 /* now try if the constant is small enough for some types */
1224 tarval_set_integer_overflow_mode(TV_OVERFLOW_BAD);
1226 if (sign <= 0 && try_create_integer(literal, type_int))
1228 if (sign >= 0 && try_create_integer(literal, type_unsigned_int))
1232 if (sign <= 0 && try_create_integer(literal, type_long))
1234 if (sign >= 0 && try_create_integer(literal, type_unsigned_long))
1237 /* last try? then we should not report tarval_bad */
1239 tarval_set_integer_overflow_mode(TV_OVERFLOW_WRAP);
1240 if (sign <= 0 && try_create_integer(literal, type_long_long))
1245 tarval_set_integer_overflow_mode(TV_OVERFLOW_WRAP);
1246 bool res = try_create_integer(literal, type_unsigned_long_long);
1248 panic("internal error when parsing number literal");
1251 tarval_set_integer_overflow_mode(old_mode);
1254 void determine_literal_type(literal_expression_t *literal)
1256 switch (literal->base.kind) {
1257 case EXPR_LITERAL_INTEGER:
1258 case EXPR_LITERAL_INTEGER_OCTAL:
1259 case EXPR_LITERAL_INTEGER_HEXADECIMAL:
1260 create_integer_tarval(literal);
1268 * Creates a Const node representing a constant.
1270 static ir_node *literal_to_firm(const literal_expression_t *literal)
1272 type_t *type = skip_typeref(literal->base.type);
1273 ir_mode *mode = get_ir_mode_storage(type);
1274 const char *string = literal->value.begin;
1275 size_t size = literal->value.size;
1278 switch (literal->base.kind) {
1279 case EXPR_LITERAL_WIDE_CHARACTER: {
1280 utf32 v = read_utf8_char(&string);
1282 size_t len = snprintf(buf, sizeof(buf), UTF32_PRINTF_FORMAT, v);
1284 tv = new_tarval_from_str(buf, len, mode);
1288 case EXPR_LITERAL_CHARACTER: {
1291 = get_atomic_type_flags(ATOMIC_TYPE_CHAR) & ATOMIC_TYPE_FLAG_SIGNED;
1292 if (size == 1 && char_is_signed) {
1293 v = (signed char)string[0];
1296 for (size_t i = 0; i < size; ++i) {
1297 v = (v << 8) | ((unsigned char)string[i]);
1301 size_t len = snprintf(buf, sizeof(buf), "%lld", v);
1303 tv = new_tarval_from_str(buf, len, mode);
1307 case EXPR_LITERAL_INTEGER:
1308 case EXPR_LITERAL_INTEGER_OCTAL:
1309 case EXPR_LITERAL_INTEGER_HEXADECIMAL:
1310 assert(literal->target_value != NULL);
1311 tv = literal->target_value;
1314 case EXPR_LITERAL_FLOATINGPOINT:
1315 case EXPR_LITERAL_FLOATINGPOINT_HEXADECIMAL:
1316 tv = new_tarval_from_str(string, size, mode);
1319 case EXPR_LITERAL_BOOLEAN:
1320 if (string[0] == 't') {
1321 tv = get_mode_one(mode);
1323 assert(string[0] == 'f');
1324 case EXPR_LITERAL_MS_NOOP:
1325 tv = get_mode_null(mode);
1330 panic("Invalid literal kind found");
1333 dbg_info *dbgi = get_dbg_info(&literal->base.source_position);
1334 ir_node *res = new_d_Const(dbgi, tv);
1335 ir_mode *mode_arith = get_ir_mode_arithmetic(type);
1336 return create_conv(dbgi, res, mode_arith);
1340 * Allocate an area of size bytes aligned at alignment
1343 static ir_entity *alloc_trampoline(ir_type *frame_type, int size, unsigned alignment)
1345 static unsigned area_cnt = 0;
1348 ir_type *tp = new_type_array(1, ir_type_char);
1349 set_array_bounds_int(tp, 0, 0, size);
1350 set_type_alignment_bytes(tp, alignment);
1352 snprintf(buf, sizeof(buf), "trampolin%u", area_cnt++);
1353 ident *name = new_id_from_str(buf);
1354 ir_entity *area = new_entity(frame_type, name, tp);
1356 /* mark this entity as compiler generated */
1357 set_entity_compiler_generated(area, 1);
1362 * Return a node representing a trampoline region
1363 * for a given function entity.
1365 * @param dbgi debug info
1366 * @param entity the function entity
1368 static ir_node *get_trampoline_region(dbg_info *dbgi, ir_entity *entity)
1370 ir_entity *region = NULL;
1373 if (current_trampolines != NULL) {
1374 for (i = ARR_LEN(current_trampolines) - 1; i >= 0; --i) {
1375 if (current_trampolines[i].function == entity) {
1376 region = current_trampolines[i].region;
1381 current_trampolines = NEW_ARR_F(trampoline_region, 0);
1383 ir_graph *irg = current_ir_graph;
1384 if (region == NULL) {
1385 /* create a new region */
1386 ir_type *frame_tp = get_irg_frame_type(irg);
1387 trampoline_region reg;
1388 reg.function = entity;
1390 reg.region = alloc_trampoline(frame_tp,
1391 be_params->trampoline_size,
1392 be_params->trampoline_align);
1393 ARR_APP1(trampoline_region, current_trampolines, reg);
1394 region = reg.region;
1396 return new_d_simpleSel(dbgi, get_irg_no_mem(irg), get_irg_frame(irg),
1401 * Creates a trampoline for a function represented by an entity.
1403 * @param dbgi debug info
1404 * @param mode the (reference) mode for the function address
1405 * @param entity the function entity
1407 static ir_node *create_trampoline(dbg_info *dbgi, ir_mode *mode,
1410 assert(entity != NULL);
1412 in[0] = get_trampoline_region(dbgi, entity);
1413 in[1] = create_symconst(dbgi, entity);
1414 in[2] = get_irg_frame(current_ir_graph);
1416 ir_node *irn = new_d_Builtin(dbgi, get_store(), 3, in, ir_bk_inner_trampoline, get_unknown_type());
1417 set_store(new_Proj(irn, mode_M, pn_Builtin_M));
1418 return new_Proj(irn, mode, pn_Builtin_max+1);
1422 * Dereference an address.
1424 * @param dbgi debug info
1425 * @param type the type of the dereferenced result (the points_to type)
1426 * @param addr the address to dereference
1428 static ir_node *deref_address(dbg_info *const dbgi, type_t *const type,
1429 ir_node *const addr)
1431 type_t *skipped = skip_typeref(type);
1432 if (is_type_incomplete(skipped))
1435 ir_type *irtype = get_ir_type(skipped);
1436 if (is_compound_type(irtype)
1437 || is_Method_type(irtype)
1438 || is_Array_type(irtype)) {
1442 ir_cons_flags flags = skipped->base.qualifiers & TYPE_QUALIFIER_VOLATILE
1443 ? cons_volatile : cons_none;
1444 ir_mode *const mode = get_type_mode(irtype);
1445 ir_node *const memory = get_store();
1446 ir_node *const load = new_d_Load(dbgi, memory, addr, mode, flags);
1447 ir_node *const load_mem = new_d_Proj(dbgi, load, mode_M, pn_Load_M);
1448 ir_node *const load_res = new_d_Proj(dbgi, load, mode, pn_Load_res);
1450 set_store(load_mem);
1452 ir_mode *const mode_arithmetic = get_ir_mode_arithmetic(skipped);
1453 return create_conv(dbgi, load_res, mode_arithmetic);
1457 * Creates a strict Conv (to the node's mode) if necessary.
1459 * @param dbgi debug info
1460 * @param node the node to strict conv
1462 static ir_node *do_strict_conv(dbg_info *dbgi, ir_node *node)
1464 ir_mode *mode = get_irn_mode(node);
1466 if (!(get_irg_fp_model(current_ir_graph) & fp_explicit_rounding))
1468 if (!mode_is_float(mode))
1471 /* check if there is already a Conv */
1472 if (is_Conv(node)) {
1473 /* convert it into a strict Conv */
1474 set_Conv_strict(node, 1);
1478 /* otherwise create a new one */
1479 return new_d_strictConv(dbgi, node, mode);
1483 * Returns the correct base address depending on whether it is a parameter or a
1484 * normal local variable.
1486 static ir_node *get_local_frame(ir_entity *const ent)
1488 ir_graph *const irg = current_ir_graph;
1489 const ir_type *const owner = get_entity_owner(ent);
1490 if (owner == current_outer_frame) {
1491 assert(current_static_link != NULL);
1492 return current_static_link;
1494 return get_irg_frame(irg);
1499 * Keep all memory edges of the given block.
1501 static void keep_all_memory(ir_node *block)
1503 ir_node *old = get_cur_block();
1505 set_cur_block(block);
1506 keep_alive(get_store());
1507 /* TODO: keep all memory edges from restricted pointers */
1511 static ir_node *enum_constant_to_firm(reference_expression_t const *const ref)
1513 entity_t *entity = ref->entity;
1514 if (entity->enum_value.tv == NULL) {
1515 type_t *type = skip_typeref(entity->enum_value.enum_type);
1516 assert(type->kind == TYPE_ENUM);
1517 determine_enum_values(&type->enumt);
1520 return new_Const(entity->enum_value.tv);
1523 static ir_node *reference_expression_to_firm(const reference_expression_t *ref)
1525 dbg_info *dbgi = get_dbg_info(&ref->base.source_position);
1526 entity_t *entity = ref->entity;
1527 assert(is_declaration(entity));
1528 type_t *type = skip_typeref(entity->declaration.type);
1530 /* make sure the type is constructed */
1531 (void) get_ir_type(type);
1533 if (entity->kind == ENTITY_FUNCTION
1534 && entity->function.btk != BUILTIN_NONE) {
1535 ir_entity *irentity = get_function_entity(entity, NULL);
1536 /* for gcc compatibility we have to produce (dummy) addresses for some
1537 * builtins which don't have entities */
1538 if (irentity == NULL) {
1539 source_position_t const *const pos = &ref->base.source_position;
1540 symbol_t const *const sym = ref->entity->base.symbol;
1541 warningf(WARN_OTHER, pos, "taking address of builtin '%Y'", sym);
1543 /* simply create a NULL pointer */
1544 ir_mode *mode = get_ir_mode_arithmetic(type_void_ptr);
1545 ir_node *res = new_Const(get_mode_null(mode));
1551 switch ((declaration_kind_t) entity->declaration.kind) {
1552 case DECLARATION_KIND_UNKNOWN:
1555 case DECLARATION_KIND_LOCAL_VARIABLE: {
1556 ir_mode *const mode = get_ir_mode_storage(type);
1557 ir_node *const value = get_value(entity->variable.v.value_number, mode);
1558 return create_conv(NULL, value, get_ir_mode_arithmetic(type));
1560 case DECLARATION_KIND_PARAMETER: {
1561 ir_mode *const mode = get_ir_mode_storage(type);
1562 ir_node *const value = get_value(entity->parameter.v.value_number,mode);
1563 return create_conv(NULL, value, get_ir_mode_arithmetic(type));
1565 case DECLARATION_KIND_FUNCTION: {
1566 return create_symconst(dbgi, entity->function.irentity);
1568 case DECLARATION_KIND_INNER_FUNCTION: {
1569 ir_mode *const mode = get_ir_mode_storage(type);
1570 if (!entity->function.goto_to_outer && !entity->function.need_closure) {
1571 /* inner function not using the closure */
1572 return create_symconst(dbgi, entity->function.irentity);
1574 /* need trampoline here */
1575 return create_trampoline(dbgi, mode, entity->function.irentity);
1578 case DECLARATION_KIND_GLOBAL_VARIABLE: {
1579 const variable_t *variable = &entity->variable;
1580 ir_node *const addr = create_symconst(dbgi, variable->v.entity);
1581 return deref_address(dbgi, variable->base.type, addr);
1584 case DECLARATION_KIND_LOCAL_VARIABLE_ENTITY: {
1585 ir_entity *irentity = entity->variable.v.entity;
1586 ir_node *frame = get_local_frame(irentity);
1587 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, irentity);
1588 return deref_address(dbgi, entity->declaration.type, sel);
1590 case DECLARATION_KIND_PARAMETER_ENTITY: {
1591 ir_entity *irentity = entity->parameter.v.entity;
1592 ir_node *frame = get_local_frame(irentity);
1593 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, irentity);
1594 return deref_address(dbgi, entity->declaration.type, sel);
1597 case DECLARATION_KIND_VARIABLE_LENGTH_ARRAY:
1598 return entity->variable.v.vla_base;
1600 case DECLARATION_KIND_COMPOUND_MEMBER:
1601 panic("not implemented reference type");
1604 panic("reference to declaration with unknown type found");
1607 static ir_node *reference_addr(const reference_expression_t *ref)
1609 dbg_info *dbgi = get_dbg_info(&ref->base.source_position);
1610 entity_t *entity = ref->entity;
1611 assert(is_declaration(entity));
1613 switch((declaration_kind_t) entity->declaration.kind) {
1614 case DECLARATION_KIND_UNKNOWN:
1616 case DECLARATION_KIND_PARAMETER:
1617 case DECLARATION_KIND_LOCAL_VARIABLE:
1618 /* you can store to a local variable (so we don't panic but return NULL
1619 * as an indicator for no real address) */
1621 case DECLARATION_KIND_GLOBAL_VARIABLE: {
1622 ir_node *const addr = create_symconst(dbgi, entity->variable.v.entity);
1625 case DECLARATION_KIND_LOCAL_VARIABLE_ENTITY: {
1626 ir_entity *irentity = entity->variable.v.entity;
1627 ir_node *frame = get_local_frame(irentity);
1628 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, irentity);
1632 case DECLARATION_KIND_PARAMETER_ENTITY: {
1633 ir_entity *irentity = entity->parameter.v.entity;
1634 ir_node *frame = get_local_frame(irentity);
1635 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, irentity);
1640 case DECLARATION_KIND_VARIABLE_LENGTH_ARRAY:
1641 return entity->variable.v.vla_base;
1643 case DECLARATION_KIND_FUNCTION: {
1644 return create_symconst(dbgi, entity->function.irentity);
1647 case DECLARATION_KIND_INNER_FUNCTION: {
1648 type_t *const type = skip_typeref(entity->declaration.type);
1649 ir_mode *const mode = get_ir_mode_storage(type);
1650 if (!entity->function.goto_to_outer && !entity->function.need_closure) {
1651 /* inner function not using the closure */
1652 return create_symconst(dbgi, entity->function.irentity);
1654 /* need trampoline here */
1655 return create_trampoline(dbgi, mode, entity->function.irentity);
1659 case DECLARATION_KIND_COMPOUND_MEMBER:
1660 panic("not implemented reference type");
1663 panic("reference to declaration with unknown type found");
1667 * Transform calls to builtin functions.
1669 static ir_node *process_builtin_call(const call_expression_t *call)
1671 dbg_info *dbgi = get_dbg_info(&call->base.source_position);
1673 assert(call->function->kind == EXPR_REFERENCE);
1674 reference_expression_t *builtin = &call->function->reference;
1676 type_t *expr_type = skip_typeref(builtin->base.type);
1677 assert(is_type_pointer(expr_type));
1679 type_t *function_type = skip_typeref(expr_type->pointer.points_to);
1681 switch (builtin->entity->function.btk) {
1684 case BUILTIN_ALLOCA: {
1685 expression_t *argument = call->arguments->expression;
1686 ir_node *size = expression_to_firm(argument);
1688 ir_node *store = get_store();
1689 ir_node *alloca = new_d_Alloc(dbgi, store, size, get_unknown_type(),
1691 ir_node *proj_m = new_Proj(alloca, mode_M, pn_Alloc_M);
1693 ir_node *res = new_Proj(alloca, mode_P_data, pn_Alloc_res);
1698 type_t *type = function_type->function.return_type;
1699 ir_mode *mode = get_ir_mode_arithmetic(type);
1700 ir_tarval *tv = get_mode_infinite(mode);
1701 ir_node *res = new_d_Const(dbgi, tv);
1705 /* Ignore string for now... */
1706 assert(is_type_function(function_type));
1707 type_t *type = function_type->function.return_type;
1708 ir_mode *mode = get_ir_mode_arithmetic(type);
1709 ir_tarval *tv = get_mode_NAN(mode);
1710 ir_node *res = new_d_Const(dbgi, tv);
1713 case BUILTIN_EXPECT: {
1714 expression_t *argument = call->arguments->expression;
1715 return _expression_to_firm(argument);
1717 case BUILTIN_VA_END:
1718 /* evaluate the argument of va_end for its side effects */
1719 _expression_to_firm(call->arguments->expression);
1721 case BUILTIN_OBJECT_SIZE: {
1722 /* determine value of "type" */
1723 expression_t *type_expression = call->arguments->next->expression;
1724 long type_val = fold_constant_to_int(type_expression);
1725 type_t *type = function_type->function.return_type;
1726 ir_mode *mode = get_ir_mode_arithmetic(type);
1727 /* just produce a "I don't know" result */
1728 ir_tarval *result = type_val & 2 ? get_mode_null(mode) :
1729 get_mode_minus_one(mode);
1731 return new_d_Const(dbgi, result);
1733 case BUILTIN_ROTL: {
1734 ir_node *val = expression_to_firm(call->arguments->expression);
1735 ir_node *shf = expression_to_firm(call->arguments->next->expression);
1736 ir_mode *mode = get_irn_mode(val);
1737 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
1738 return new_d_Rotl(dbgi, val, create_conv(dbgi, shf, mode_uint), mode);
1740 case BUILTIN_ROTR: {
1741 ir_node *val = expression_to_firm(call->arguments->expression);
1742 ir_node *shf = expression_to_firm(call->arguments->next->expression);
1743 ir_mode *mode = get_irn_mode(val);
1744 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
1745 ir_node *c = new_Const_long(mode_uint, get_mode_size_bits(mode));
1746 ir_node *sub = new_d_Sub(dbgi, c, create_conv(dbgi, shf, mode_uint), mode_uint);
1747 return new_d_Rotl(dbgi, val, sub, mode);
1752 case BUILTIN_LIBC_CHECK:
1753 panic("builtin did not produce an entity");
1755 panic("invalid builtin found");
1759 * Transform a call expression.
1760 * Handles some special cases, like alloca() calls, which must be resolved
1761 * BEFORE the inlines runs. Inlining routines calling alloca() is dangerous,
1762 * 176.gcc for instance might allocate 2GB instead of 256 MB if alloca is not
1765 static ir_node *call_expression_to_firm(const call_expression_t *const call)
1767 dbg_info *const dbgi = get_dbg_info(&call->base.source_position);
1768 assert(currently_reachable());
1770 expression_t *function = call->function;
1771 ir_node *callee = NULL;
1772 bool firm_builtin = false;
1773 ir_builtin_kind firm_builtin_kind = ir_bk_trap;
1774 if (function->kind == EXPR_REFERENCE) {
1775 const reference_expression_t *ref = &function->reference;
1776 entity_t *entity = ref->entity;
1778 if (entity->kind == ENTITY_FUNCTION) {
1779 builtin_kind_t builtin = entity->function.btk;
1780 if (builtin == BUILTIN_FIRM) {
1781 firm_builtin = true;
1782 firm_builtin_kind = entity->function.b.firm_builtin_kind;
1783 } else if (builtin != BUILTIN_NONE && builtin != BUILTIN_LIBC
1784 && builtin != BUILTIN_LIBC_CHECK) {
1785 return process_builtin_call(call);
1790 callee = expression_to_firm(function);
1792 type_t *type = skip_typeref(function->base.type);
1793 assert(is_type_pointer(type));
1794 pointer_type_t *pointer_type = &type->pointer;
1795 type_t *points_to = skip_typeref(pointer_type->points_to);
1796 assert(is_type_function(points_to));
1797 function_type_t *function_type = &points_to->function;
1799 int n_parameters = 0;
1800 ir_type *ir_method_type = get_ir_type((type_t*) function_type);
1801 ir_type *new_method_type = NULL;
1802 if (function_type->variadic || function_type->unspecified_parameters) {
1803 const call_argument_t *argument = call->arguments;
1804 for ( ; argument != NULL; argument = argument->next) {
1808 /* we need to construct a new method type matching the call
1810 type_dbg_info *tdbgi = get_type_dbg_info_((const type_t*) function_type);
1811 int n_res = get_method_n_ress(ir_method_type);
1812 new_method_type = new_d_type_method(n_parameters, n_res, tdbgi);
1813 set_method_calling_convention(new_method_type,
1814 get_method_calling_convention(ir_method_type));
1815 set_method_additional_properties(new_method_type,
1816 get_method_additional_properties(ir_method_type));
1817 set_method_variadicity(new_method_type,
1818 get_method_variadicity(ir_method_type));
1820 for (int i = 0; i < n_res; ++i) {
1821 set_method_res_type(new_method_type, i,
1822 get_method_res_type(ir_method_type, i));
1824 argument = call->arguments;
1825 for (int i = 0; i < n_parameters; ++i, argument = argument->next) {
1826 expression_t *expression = argument->expression;
1827 ir_type *irtype = get_ir_type(expression->base.type);
1828 set_method_param_type(new_method_type, i, irtype);
1830 ir_method_type = new_method_type;
1832 n_parameters = get_method_n_params(ir_method_type);
1835 ir_node *in[n_parameters];
1837 const call_argument_t *argument = call->arguments;
1838 for (int n = 0; n < n_parameters; ++n) {
1839 expression_t *expression = argument->expression;
1840 ir_node *arg_node = expression_to_firm(expression);
1842 type_t *arg_type = skip_typeref(expression->base.type);
1843 if (!is_type_compound(arg_type)) {
1844 ir_mode *const mode = get_ir_mode_storage(arg_type);
1845 arg_node = create_conv(dbgi, arg_node, mode);
1846 arg_node = do_strict_conv(dbgi, arg_node);
1851 argument = argument->next;
1855 if (function_type->modifiers & DM_CONST) {
1856 store = get_irg_no_mem(current_ir_graph);
1858 store = get_store();
1862 type_t *return_type = skip_typeref(function_type->return_type);
1863 ir_node *result = NULL;
1865 node = new_d_Builtin(dbgi, store, n_parameters, in, firm_builtin_kind,
1867 if (! (function_type->modifiers & DM_CONST)) {
1868 ir_node *mem = new_Proj(node, mode_M, pn_Builtin_M);
1872 if (!is_type_void(return_type)) {
1873 assert(is_type_scalar(return_type));
1874 ir_mode *mode = get_ir_mode_storage(return_type);
1875 result = new_Proj(node, mode, pn_Builtin_max+1);
1876 ir_mode *mode_arith = get_ir_mode_arithmetic(return_type);
1877 result = create_conv(NULL, result, mode_arith);
1880 node = new_d_Call(dbgi, store, callee, n_parameters, in, ir_method_type);
1881 if (! (function_type->modifiers & DM_CONST)) {
1882 ir_node *mem = new_Proj(node, mode_M, pn_Call_M);
1886 if (!is_type_void(return_type)) {
1887 ir_node *const resproj = new_Proj(node, mode_T, pn_Call_T_result);
1888 ir_mode *const mode = get_ir_mode_storage(return_type);
1889 result = new_Proj(resproj, mode, 0);
1890 ir_mode *const mode_arith = get_ir_mode_arithmetic(return_type);
1891 result = create_conv(NULL, result, mode_arith);
1895 if (function_type->modifiers & DM_NORETURN) {
1896 /* A dead end: Keep the Call and the Block. Also place all further
1897 * nodes into a new and unreachable block. */
1899 keep_alive(get_cur_block());
1900 ir_node *block = new_Block(0, NULL);
1901 set_cur_block(block);
1907 static ir_node *statement_to_firm(statement_t *statement);
1908 static ir_node *compound_statement_to_firm(compound_statement_t *compound);
1910 static ir_node *expression_to_addr(const expression_t *expression);
1911 static ir_node *create_condition_evaluation(const expression_t *expression,
1912 ir_node *true_block,
1913 ir_node *false_block);
1915 static void assign_value(dbg_info *dbgi, ir_node *addr, type_t *type,
1918 if (!is_type_compound(type)) {
1919 ir_mode *mode = get_ir_mode_storage(type);
1920 value = create_conv(dbgi, value, mode);
1921 value = do_strict_conv(dbgi, value);
1924 ir_node *memory = get_store();
1926 if (is_type_scalar(type)) {
1927 ir_cons_flags flags = type->base.qualifiers & TYPE_QUALIFIER_VOLATILE
1928 ? cons_volatile : cons_none;
1929 ir_node *store = new_d_Store(dbgi, memory, addr, value, flags);
1930 ir_node *store_mem = new_d_Proj(dbgi, store, mode_M, pn_Store_M);
1931 set_store(store_mem);
1933 ir_type *irtype = get_ir_type(type);
1934 ir_node *copyb = new_d_CopyB(dbgi, memory, addr, value, irtype);
1935 ir_node *copyb_mem = new_Proj(copyb, mode_M, pn_CopyB_M);
1936 set_store(copyb_mem);
1940 static ir_tarval *create_bitfield_mask(ir_mode *mode, int offset, int size)
1942 ir_tarval *all_one = get_mode_all_one(mode);
1943 int mode_size = get_mode_size_bits(mode);
1944 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
1946 assert(offset >= 0);
1948 assert(offset + size <= mode_size);
1949 if (size == mode_size) {
1953 long shiftr = get_mode_size_bits(mode) - size;
1954 long shiftl = offset;
1955 ir_tarval *tv_shiftr = new_tarval_from_long(shiftr, mode_uint);
1956 ir_tarval *tv_shiftl = new_tarval_from_long(shiftl, mode_uint);
1957 ir_tarval *mask0 = tarval_shr(all_one, tv_shiftr);
1958 ir_tarval *mask1 = tarval_shl(mask0, tv_shiftl);
1963 static ir_node *bitfield_store_to_firm(dbg_info *dbgi,
1964 ir_entity *entity, ir_node *addr, ir_node *value, bool set_volatile,
1967 ir_type *entity_type = get_entity_type(entity);
1968 ir_type *base_type = get_primitive_base_type(entity_type);
1969 ir_mode *mode = get_type_mode(base_type);
1970 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
1972 value = create_conv(dbgi, value, mode);
1974 /* kill upper bits of value and shift to right position */
1975 unsigned bitoffset = get_entity_offset_bits_remainder(entity);
1976 unsigned bitsize = get_mode_size_bits(get_type_mode(entity_type));
1977 unsigned base_bits = get_mode_size_bits(mode);
1978 unsigned shiftwidth = base_bits - bitsize;
1980 ir_node *shiftcount = new_Const_long(mode_uint, shiftwidth);
1981 ir_node *shiftl = new_d_Shl(dbgi, value, shiftcount, mode);
1983 unsigned shrwidth = base_bits - bitsize - bitoffset;
1984 ir_node *shrconst = new_Const_long(mode_uint, shrwidth);
1985 ir_node *shiftr = new_d_Shr(dbgi, shiftl, shrconst, mode);
1987 /* load current value */
1988 ir_node *mem = get_store();
1989 ir_node *load = new_d_Load(dbgi, mem, addr, mode,
1990 set_volatile ? cons_volatile : cons_none);
1991 ir_node *load_mem = new_d_Proj(dbgi, load, mode_M, pn_Load_M);
1992 ir_node *load_res = new_d_Proj(dbgi, load, mode, pn_Load_res);
1993 ir_tarval *shift_mask = create_bitfield_mask(mode, bitoffset, bitsize);
1994 ir_tarval *inv_mask = tarval_not(shift_mask);
1995 ir_node *inv_mask_node = new_d_Const(dbgi, inv_mask);
1996 ir_node *load_res_masked = new_d_And(dbgi, load_res, inv_mask_node, mode);
1998 /* construct new value and store */
1999 ir_node *new_val = new_d_Or(dbgi, load_res_masked, shiftr, mode);
2000 ir_node *store = new_d_Store(dbgi, load_mem, addr, new_val,
2001 set_volatile ? cons_volatile : cons_none);
2002 ir_node *store_mem = new_d_Proj(dbgi, store, mode_M, pn_Store_M);
2003 set_store(store_mem);
2009 ir_node *count_res_shr = new_Const_long(mode_uint, base_bits - bitsize);
2010 if (mode_is_signed(mode)) {
2011 res_shr = new_d_Shrs(dbgi, shiftl, count_res_shr, mode);
2013 res_shr = new_d_Shr(dbgi, shiftl, count_res_shr, mode);
2018 static ir_node *bitfield_extract_to_firm(const select_expression_t *expression,
2021 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2022 entity_t *entity = expression->compound_entry;
2023 type_t *base_type = entity->declaration.type;
2024 ir_mode *mode = get_ir_mode_storage(base_type);
2025 ir_node *mem = get_store();
2026 ir_node *load = new_d_Load(dbgi, mem, addr, mode, cons_none);
2027 ir_node *load_mem = new_d_Proj(dbgi, load, mode_M, pn_Load_M);
2028 ir_node *load_res = new_d_Proj(dbgi, load, mode, pn_Load_res);
2029 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
2031 ir_mode *amode = mode;
2032 /* optimisation, since shifting in modes < machine_size is usually
2034 if (get_mode_size_bits(amode) < get_mode_size_bits(mode_uint)) {
2037 unsigned amode_size = get_mode_size_bits(amode);
2038 load_res = create_conv(dbgi, load_res, amode);
2040 set_store(load_mem);
2042 /* kill upper bits */
2043 assert(expression->compound_entry->kind == ENTITY_COMPOUND_MEMBER);
2044 unsigned bitoffset = entity->compound_member.bit_offset;
2045 unsigned bitsize = entity->compound_member.bit_size;
2046 unsigned shift_bitsl = amode_size - bitoffset - bitsize;
2047 ir_tarval *tvl = new_tarval_from_long((long)shift_bitsl, mode_uint);
2048 ir_node *countl = new_d_Const(dbgi, tvl);
2049 ir_node *shiftl = new_d_Shl(dbgi, load_res, countl, amode);
2051 unsigned shift_bitsr = bitoffset + shift_bitsl;
2052 assert(shift_bitsr <= amode_size);
2053 ir_tarval *tvr = new_tarval_from_long((long)shift_bitsr, mode_uint);
2054 ir_node *countr = new_d_Const(dbgi, tvr);
2056 if (mode_is_signed(mode)) {
2057 shiftr = new_d_Shrs(dbgi, shiftl, countr, amode);
2059 shiftr = new_d_Shr(dbgi, shiftl, countr, amode);
2062 type_t *type = expression->base.type;
2063 ir_mode *resmode = get_ir_mode_arithmetic(type);
2064 return create_conv(dbgi, shiftr, resmode);
2067 /* make sure the selected compound type is constructed */
2068 static void construct_select_compound(const select_expression_t *expression)
2070 type_t *type = skip_typeref(expression->compound->base.type);
2071 if (is_type_pointer(type)) {
2072 type = type->pointer.points_to;
2074 (void) get_ir_type(type);
2077 static ir_node *set_value_for_expression_addr(const expression_t *expression,
2078 ir_node *value, ir_node *addr)
2080 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2081 type_t *type = skip_typeref(expression->base.type);
2083 if (!is_type_compound(type)) {
2084 ir_mode *mode = get_ir_mode_storage(type);
2085 value = create_conv(dbgi, value, mode);
2086 value = do_strict_conv(dbgi, value);
2089 if (expression->kind == EXPR_REFERENCE) {
2090 const reference_expression_t *ref = &expression->reference;
2092 entity_t *entity = ref->entity;
2093 assert(is_declaration(entity));
2094 assert(entity->declaration.kind != DECLARATION_KIND_UNKNOWN);
2095 if (entity->declaration.kind == DECLARATION_KIND_LOCAL_VARIABLE) {
2096 set_value(entity->variable.v.value_number, value);
2098 } else if (entity->declaration.kind == DECLARATION_KIND_PARAMETER) {
2099 set_value(entity->parameter.v.value_number, value);
2105 addr = expression_to_addr(expression);
2106 assert(addr != NULL);
2108 if (expression->kind == EXPR_SELECT) {
2109 const select_expression_t *select = &expression->select;
2111 construct_select_compound(select);
2113 entity_t *entity = select->compound_entry;
2114 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
2115 if (entity->compound_member.bitfield) {
2116 ir_entity *irentity = entity->compound_member.entity;
2118 = select->base.type->base.qualifiers & TYPE_QUALIFIER_VOLATILE;
2119 value = bitfield_store_to_firm(dbgi, irentity, addr, value,
2120 set_volatile, true);
2125 assign_value(dbgi, addr, type, value);
2129 static void set_value_for_expression(const expression_t *expression,
2132 set_value_for_expression_addr(expression, value, NULL);
2135 static ir_node *get_value_from_lvalue(const expression_t *expression,
2138 if (expression->kind == EXPR_REFERENCE) {
2139 const reference_expression_t *ref = &expression->reference;
2141 entity_t *entity = ref->entity;
2142 assert(entity->kind == ENTITY_VARIABLE
2143 || entity->kind == ENTITY_PARAMETER);
2144 assert(entity->declaration.kind != DECLARATION_KIND_UNKNOWN);
2146 if (entity->declaration.kind == DECLARATION_KIND_LOCAL_VARIABLE) {
2147 value_number = entity->variable.v.value_number;
2148 assert(addr == NULL);
2149 type_t *type = skip_typeref(expression->base.type);
2150 ir_mode *mode = get_ir_mode_storage(type);
2151 ir_node *res = get_value(value_number, mode);
2152 return create_conv(NULL, res, get_ir_mode_arithmetic(type));
2153 } else if (entity->declaration.kind == DECLARATION_KIND_PARAMETER) {
2154 value_number = entity->parameter.v.value_number;
2155 assert(addr == NULL);
2156 type_t *type = skip_typeref(expression->base.type);
2157 ir_mode *mode = get_ir_mode_storage(type);
2158 ir_node *res = get_value(value_number, mode);
2159 return create_conv(NULL, res, get_ir_mode_arithmetic(type));
2163 assert(addr != NULL);
2164 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2167 if (expression->kind == EXPR_SELECT &&
2168 expression->select.compound_entry->compound_member.bitfield) {
2169 construct_select_compound(&expression->select);
2170 value = bitfield_extract_to_firm(&expression->select, addr);
2172 value = deref_address(dbgi, expression->base.type, addr);
2179 static ir_node *create_incdec(const unary_expression_t *expression)
2181 dbg_info *const dbgi = get_dbg_info(&expression->base.source_position);
2182 const expression_t *value_expr = expression->value;
2183 ir_node *addr = expression_to_addr(value_expr);
2184 ir_node *value = get_value_from_lvalue(value_expr, addr);
2186 type_t *type = skip_typeref(expression->base.type);
2187 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
2190 if (is_type_pointer(type)) {
2191 pointer_type_t *pointer_type = &type->pointer;
2192 offset = get_type_size_node(pointer_type->points_to);
2194 assert(is_type_arithmetic(type));
2195 offset = new_Const(get_mode_one(mode));
2199 ir_node *store_value;
2200 switch(expression->base.kind) {
2201 case EXPR_UNARY_POSTFIX_INCREMENT:
2203 store_value = new_d_Add(dbgi, value, offset, mode);
2205 case EXPR_UNARY_POSTFIX_DECREMENT:
2207 store_value = new_d_Sub(dbgi, value, offset, mode);
2209 case EXPR_UNARY_PREFIX_INCREMENT:
2210 result = new_d_Add(dbgi, value, offset, mode);
2211 store_value = result;
2213 case EXPR_UNARY_PREFIX_DECREMENT:
2214 result = new_d_Sub(dbgi, value, offset, mode);
2215 store_value = result;
2218 panic("no incdec expr in create_incdec");
2221 set_value_for_expression_addr(value_expr, store_value, addr);
2226 static bool is_local_variable(expression_t *expression)
2228 if (expression->kind != EXPR_REFERENCE)
2230 reference_expression_t *ref_expr = &expression->reference;
2231 entity_t *entity = ref_expr->entity;
2232 if (entity->kind != ENTITY_VARIABLE)
2234 assert(entity->declaration.kind != DECLARATION_KIND_UNKNOWN);
2235 return entity->declaration.kind == DECLARATION_KIND_LOCAL_VARIABLE;
2238 static ir_relation get_relation(const expression_kind_t kind)
2241 case EXPR_BINARY_EQUAL: return ir_relation_equal;
2242 case EXPR_BINARY_ISLESSGREATER: return ir_relation_less_greater;
2243 case EXPR_BINARY_NOTEQUAL: return ir_relation_unordered_less_greater;
2244 case EXPR_BINARY_ISLESS:
2245 case EXPR_BINARY_LESS: return ir_relation_less;
2246 case EXPR_BINARY_ISLESSEQUAL:
2247 case EXPR_BINARY_LESSEQUAL: return ir_relation_less_equal;
2248 case EXPR_BINARY_ISGREATER:
2249 case EXPR_BINARY_GREATER: return ir_relation_greater;
2250 case EXPR_BINARY_ISGREATEREQUAL:
2251 case EXPR_BINARY_GREATEREQUAL: return ir_relation_greater_equal;
2252 case EXPR_BINARY_ISUNORDERED: return ir_relation_unordered;
2257 panic("trying to get pn_Cmp from non-comparison binexpr type");
2261 * Handle the assume optimizer hint: check if a Confirm
2262 * node can be created.
2264 * @param dbi debug info
2265 * @param expr the IL assume expression
2267 * we support here only some simple cases:
2272 static ir_node *handle_assume_compare(dbg_info *dbi,
2273 const binary_expression_t *expression)
2275 expression_t *op1 = expression->left;
2276 expression_t *op2 = expression->right;
2277 entity_t *var2, *var = NULL;
2278 ir_node *res = NULL;
2279 ir_relation relation = get_relation(expression->base.kind);
2281 if (is_local_variable(op1) && is_local_variable(op2)) {
2282 var = op1->reference.entity;
2283 var2 = op2->reference.entity;
2285 type_t *const type = skip_typeref(var->declaration.type);
2286 ir_mode *const mode = get_ir_mode_storage(type);
2288 ir_node *const irn1 = get_value(var->variable.v.value_number, mode);
2289 ir_node *const irn2 = get_value(var2->variable.v.value_number, mode);
2291 res = new_d_Confirm(dbi, irn2, irn1, get_inversed_relation(relation));
2292 set_value(var2->variable.v.value_number, res);
2294 res = new_d_Confirm(dbi, irn1, irn2, relation);
2295 set_value(var->variable.v.value_number, res);
2300 expression_t *con = NULL;
2301 if (is_local_variable(op1) && is_constant_expression(op2) == EXPR_CLASS_CONSTANT) {
2302 var = op1->reference.entity;
2304 } else if (is_constant_expression(op1) == EXPR_CLASS_CONSTANT && is_local_variable(op2)) {
2305 relation = get_inversed_relation(relation);
2306 var = op2->reference.entity;
2311 type_t *const type = skip_typeref(var->declaration.type);
2312 ir_mode *const mode = get_ir_mode_storage(type);
2314 res = get_value(var->variable.v.value_number, mode);
2315 res = new_d_Confirm(dbi, res, expression_to_firm(con), relation);
2316 set_value(var->variable.v.value_number, res);
2322 * Handle the assume optimizer hint.
2324 * @param dbi debug info
2325 * @param expr the IL assume expression
2327 static ir_node *handle_assume(dbg_info *dbi, const expression_t *expression)
2329 switch(expression->kind) {
2330 case EXPR_BINARY_EQUAL:
2331 case EXPR_BINARY_NOTEQUAL:
2332 case EXPR_BINARY_LESS:
2333 case EXPR_BINARY_LESSEQUAL:
2334 case EXPR_BINARY_GREATER:
2335 case EXPR_BINARY_GREATEREQUAL:
2336 return handle_assume_compare(dbi, &expression->binary);
2342 static ir_node *create_cast(dbg_info *dbgi, ir_node *value_node,
2343 type_t *from_type, type_t *type)
2345 type = skip_typeref(type);
2346 if (is_type_void(type)) {
2347 /* make sure firm type is constructed */
2348 (void) get_ir_type(type);
2351 if (!is_type_scalar(type)) {
2352 /* make sure firm type is constructed */
2353 (void) get_ir_type(type);
2357 from_type = skip_typeref(from_type);
2358 ir_mode *mode = get_ir_mode_storage(type);
2359 /* check for conversion from / to __based types */
2360 if (is_type_pointer(type) && is_type_pointer(from_type)) {
2361 const variable_t *from_var = from_type->pointer.base_variable;
2362 const variable_t *to_var = type->pointer.base_variable;
2363 if (from_var != to_var) {
2364 if (from_var != NULL) {
2365 ir_node *const addr = create_symconst(dbgi, from_var->v.entity);
2366 ir_node *const base = deref_address(dbgi, from_var->base.type, addr);
2367 value_node = new_d_Add(dbgi, value_node, base, mode);
2369 if (to_var != NULL) {
2370 ir_node *const addr = create_symconst(dbgi, to_var->v.entity);
2371 ir_node *const base = deref_address(dbgi, to_var->base.type, addr);
2372 value_node = new_d_Sub(dbgi, value_node, base, mode);
2377 if (is_type_atomic(type, ATOMIC_TYPE_BOOL)) {
2378 /* bool adjustments (we save a mode_Bu, but have to temporarily
2379 * convert to mode_b so we only get a 0/1 value */
2380 value_node = create_conv(dbgi, value_node, mode_b);
2383 ir_mode *mode_arith = get_ir_mode_arithmetic(type);
2384 ir_node *node = create_conv(dbgi, value_node, mode);
2385 node = do_strict_conv(dbgi, node);
2386 node = create_conv(dbgi, node, mode_arith);
2391 static ir_node *unary_expression_to_firm(const unary_expression_t *expression)
2393 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2394 type_t *type = skip_typeref(expression->base.type);
2396 const expression_t *value = expression->value;
2398 switch(expression->base.kind) {
2399 case EXPR_UNARY_TAKE_ADDRESS:
2400 return expression_to_addr(value);
2402 case EXPR_UNARY_NEGATE: {
2403 ir_node *value_node = expression_to_firm(value);
2404 ir_mode *mode = get_ir_mode_arithmetic(type);
2405 return new_d_Minus(dbgi, value_node, mode);
2407 case EXPR_UNARY_PLUS:
2408 return expression_to_firm(value);
2409 case EXPR_UNARY_BITWISE_NEGATE: {
2410 ir_node *value_node = expression_to_firm(value);
2411 ir_mode *mode = get_ir_mode_arithmetic(type);
2412 return new_d_Not(dbgi, value_node, mode);
2414 case EXPR_UNARY_NOT: {
2415 ir_node *value_node = _expression_to_firm(value);
2416 value_node = create_conv(dbgi, value_node, mode_b);
2417 ir_node *res = new_d_Not(dbgi, value_node, mode_b);
2420 case EXPR_UNARY_DEREFERENCE: {
2421 ir_node *value_node = expression_to_firm(value);
2422 type_t *value_type = skip_typeref(value->base.type);
2423 assert(is_type_pointer(value_type));
2425 /* check for __based */
2426 const variable_t *const base_var = value_type->pointer.base_variable;
2427 if (base_var != NULL) {
2428 ir_node *const addr = create_symconst(dbgi, base_var->v.entity);
2429 ir_node *const base = deref_address(dbgi, base_var->base.type, addr);
2430 value_node = new_d_Add(dbgi, value_node, base, get_ir_mode_storage(value_type));
2432 type_t *points_to = value_type->pointer.points_to;
2433 return deref_address(dbgi, points_to, value_node);
2435 case EXPR_UNARY_POSTFIX_INCREMENT:
2436 case EXPR_UNARY_POSTFIX_DECREMENT:
2437 case EXPR_UNARY_PREFIX_INCREMENT:
2438 case EXPR_UNARY_PREFIX_DECREMENT:
2439 return create_incdec(expression);
2440 case EXPR_UNARY_CAST: {
2441 ir_node *value_node = expression_to_firm(value);
2442 type_t *from_type = value->base.type;
2443 return create_cast(dbgi, value_node, from_type, type);
2445 case EXPR_UNARY_ASSUME:
2446 return handle_assume(dbgi, value);
2451 panic("invalid UNEXPR type found");
2455 * produces a 0/1 depending of the value of a mode_b node
2457 static ir_node *produce_condition_result(const expression_t *expression,
2458 ir_mode *mode, dbg_info *dbgi)
2460 ir_node *const one_block = new_immBlock();
2461 ir_node *const zero_block = new_immBlock();
2462 create_condition_evaluation(expression, one_block, zero_block);
2463 mature_immBlock(one_block);
2464 mature_immBlock(zero_block);
2466 ir_node *const jmp_one = new_rd_Jmp(dbgi, one_block);
2467 ir_node *const jmp_zero = new_rd_Jmp(dbgi, zero_block);
2468 ir_node *const in_cf[2] = { jmp_one, jmp_zero };
2469 ir_node *const block = new_Block(lengthof(in_cf), in_cf);
2470 set_cur_block(block);
2472 ir_node *const one = new_Const(get_mode_one(mode));
2473 ir_node *const zero = new_Const(get_mode_null(mode));
2474 ir_node *const in[2] = { one, zero };
2475 ir_node *const val = new_d_Phi(dbgi, lengthof(in), in, mode);
2480 static ir_node *adjust_for_pointer_arithmetic(dbg_info *dbgi,
2481 ir_node *value, type_t *type)
2483 ir_mode *const mode = get_ir_mode_arithmetic(type_ptrdiff_t);
2484 assert(is_type_pointer(type));
2485 pointer_type_t *const pointer_type = &type->pointer;
2486 type_t *const points_to = skip_typeref(pointer_type->points_to);
2487 ir_node * elem_size = get_type_size_node(points_to);
2488 elem_size = create_conv(dbgi, elem_size, mode);
2489 value = create_conv(dbgi, value, mode);
2490 ir_node *const mul = new_d_Mul(dbgi, value, elem_size, mode);
2494 static ir_node *create_op(dbg_info *dbgi, const binary_expression_t *expression,
2495 ir_node *left, ir_node *right)
2498 type_t *type_left = skip_typeref(expression->left->base.type);
2499 type_t *type_right = skip_typeref(expression->right->base.type);
2501 expression_kind_t kind = expression->base.kind;
2504 case EXPR_BINARY_SHIFTLEFT:
2505 case EXPR_BINARY_SHIFTRIGHT:
2506 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2507 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2508 mode = get_ir_mode_arithmetic(expression->base.type);
2509 right = create_conv(dbgi, right, atomic_modes[ATOMIC_TYPE_UINT]);
2512 case EXPR_BINARY_SUB:
2513 if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
2514 const pointer_type_t *const ptr_type = &type_left->pointer;
2516 mode = get_ir_mode_arithmetic(expression->base.type);
2517 ir_node *const elem_size = get_type_size_node(ptr_type->points_to);
2518 ir_node *const conv_size = new_d_Conv(dbgi, elem_size, mode);
2519 ir_node *const sub = new_d_Sub(dbgi, left, right, mode);
2520 ir_node *const no_mem = new_NoMem();
2521 ir_node *const div = new_d_DivRL(dbgi, no_mem, sub, conv_size,
2522 mode, op_pin_state_floats);
2523 return new_d_Proj(dbgi, div, mode, pn_Div_res);
2526 case EXPR_BINARY_SUB_ASSIGN:
2527 if (is_type_pointer(type_left)) {
2528 right = adjust_for_pointer_arithmetic(dbgi, right, type_left);
2529 mode = get_ir_mode_arithmetic(type_left);
2534 case EXPR_BINARY_ADD:
2535 case EXPR_BINARY_ADD_ASSIGN:
2536 if (is_type_pointer(type_left)) {
2537 right = adjust_for_pointer_arithmetic(dbgi, right, type_left);
2538 mode = get_ir_mode_arithmetic(type_left);
2540 } else if (is_type_pointer(type_right)) {
2541 left = adjust_for_pointer_arithmetic(dbgi, left, type_right);
2542 mode = get_ir_mode_arithmetic(type_right);
2549 mode = get_ir_mode_arithmetic(type_right);
2550 left = create_conv(dbgi, left, mode);
2555 case EXPR_BINARY_ADD_ASSIGN:
2556 case EXPR_BINARY_ADD:
2557 return new_d_Add(dbgi, left, right, mode);
2558 case EXPR_BINARY_SUB_ASSIGN:
2559 case EXPR_BINARY_SUB:
2560 return new_d_Sub(dbgi, left, right, mode);
2561 case EXPR_BINARY_MUL_ASSIGN:
2562 case EXPR_BINARY_MUL:
2563 return new_d_Mul(dbgi, left, right, mode);
2564 case EXPR_BINARY_BITWISE_AND:
2565 case EXPR_BINARY_BITWISE_AND_ASSIGN:
2566 return new_d_And(dbgi, left, right, mode);
2567 case EXPR_BINARY_BITWISE_OR:
2568 case EXPR_BINARY_BITWISE_OR_ASSIGN:
2569 return new_d_Or(dbgi, left, right, mode);
2570 case EXPR_BINARY_BITWISE_XOR:
2571 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
2572 return new_d_Eor(dbgi, left, right, mode);
2573 case EXPR_BINARY_SHIFTLEFT:
2574 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2575 return new_d_Shl(dbgi, left, right, mode);
2576 case EXPR_BINARY_SHIFTRIGHT:
2577 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2578 if (mode_is_signed(mode)) {
2579 return new_d_Shrs(dbgi, left, right, mode);
2581 return new_d_Shr(dbgi, left, right, mode);
2583 case EXPR_BINARY_DIV:
2584 case EXPR_BINARY_DIV_ASSIGN: {
2585 ir_node *pin = new_Pin(new_NoMem());
2586 ir_node *op = new_d_Div(dbgi, pin, left, right, mode,
2587 op_pin_state_floats);
2588 ir_node *res = new_d_Proj(dbgi, op, mode, pn_Div_res);
2591 case EXPR_BINARY_MOD:
2592 case EXPR_BINARY_MOD_ASSIGN: {
2593 ir_node *pin = new_Pin(new_NoMem());
2594 assert(!mode_is_float(mode));
2595 ir_node *op = new_d_Mod(dbgi, pin, left, right, mode,
2596 op_pin_state_floats);
2597 ir_node *res = new_d_Proj(dbgi, op, mode, pn_Mod_res);
2601 panic("unexpected expression kind");
2605 static ir_node *create_lazy_op(const binary_expression_t *expression)
2607 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2608 type_t *type = skip_typeref(expression->base.type);
2609 ir_mode *mode = get_ir_mode_arithmetic(type);
2611 if (is_constant_expression(expression->left) == EXPR_CLASS_CONSTANT) {
2612 bool val = fold_constant_to_bool(expression->left);
2613 expression_kind_t ekind = expression->base.kind;
2614 assert(ekind == EXPR_BINARY_LOGICAL_AND || ekind == EXPR_BINARY_LOGICAL_OR);
2615 if (ekind == EXPR_BINARY_LOGICAL_AND) {
2617 return new_Const(get_mode_null(mode));
2621 return new_Const(get_mode_one(mode));
2625 if (is_constant_expression(expression->right) == EXPR_CLASS_CONSTANT) {
2626 bool valr = fold_constant_to_bool(expression->right);
2627 return create_Const_from_bool(mode, valr);
2630 return produce_condition_result(expression->right, mode, dbgi);
2633 return produce_condition_result((const expression_t*) expression, mode,
2637 typedef ir_node * (*create_arithmetic_func)(dbg_info *dbgi, ir_node *left,
2638 ir_node *right, ir_mode *mode);
2640 static ir_node *create_assign_binop(const binary_expression_t *expression)
2642 dbg_info *const dbgi = get_dbg_info(&expression->base.source_position);
2643 const expression_t *left_expr = expression->left;
2644 type_t *type = skip_typeref(left_expr->base.type);
2645 ir_node *right = expression_to_firm(expression->right);
2646 ir_node *left_addr = expression_to_addr(left_expr);
2647 ir_node *left = get_value_from_lvalue(left_expr, left_addr);
2648 ir_node *result = create_op(dbgi, expression, left, right);
2650 result = create_cast(dbgi, result, expression->right->base.type, type);
2651 result = do_strict_conv(dbgi, result);
2653 result = set_value_for_expression_addr(left_expr, result, left_addr);
2655 if (!is_type_compound(type)) {
2656 ir_mode *mode_arithmetic = get_ir_mode_arithmetic(type);
2657 result = create_conv(dbgi, result, mode_arithmetic);
2662 static ir_node *binary_expression_to_firm(const binary_expression_t *expression)
2664 expression_kind_t kind = expression->base.kind;
2667 case EXPR_BINARY_EQUAL:
2668 case EXPR_BINARY_NOTEQUAL:
2669 case EXPR_BINARY_LESS:
2670 case EXPR_BINARY_LESSEQUAL:
2671 case EXPR_BINARY_GREATER:
2672 case EXPR_BINARY_GREATEREQUAL:
2673 case EXPR_BINARY_ISGREATER:
2674 case EXPR_BINARY_ISGREATEREQUAL:
2675 case EXPR_BINARY_ISLESS:
2676 case EXPR_BINARY_ISLESSEQUAL:
2677 case EXPR_BINARY_ISLESSGREATER:
2678 case EXPR_BINARY_ISUNORDERED: {
2679 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2680 ir_node *left = expression_to_firm(expression->left);
2681 ir_node *right = expression_to_firm(expression->right);
2682 ir_relation relation = get_relation(kind);
2683 ir_node *cmp = new_d_Cmp(dbgi, left, right, relation);
2686 case EXPR_BINARY_ASSIGN: {
2687 ir_node *addr = expression_to_addr(expression->left);
2688 ir_node *right = expression_to_firm(expression->right);
2690 = set_value_for_expression_addr(expression->left, right, addr);
2692 type_t *type = skip_typeref(expression->base.type);
2693 if (!is_type_compound(type)) {
2694 ir_mode *mode_arithmetic = get_ir_mode_arithmetic(type);
2695 res = create_conv(NULL, res, mode_arithmetic);
2699 case EXPR_BINARY_ADD:
2700 case EXPR_BINARY_SUB:
2701 case EXPR_BINARY_MUL:
2702 case EXPR_BINARY_DIV:
2703 case EXPR_BINARY_MOD:
2704 case EXPR_BINARY_BITWISE_AND:
2705 case EXPR_BINARY_BITWISE_OR:
2706 case EXPR_BINARY_BITWISE_XOR:
2707 case EXPR_BINARY_SHIFTLEFT:
2708 case EXPR_BINARY_SHIFTRIGHT:
2710 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2711 ir_node *left = expression_to_firm(expression->left);
2712 ir_node *right = expression_to_firm(expression->right);
2713 return create_op(dbgi, expression, left, right);
2715 case EXPR_BINARY_LOGICAL_AND:
2716 case EXPR_BINARY_LOGICAL_OR:
2717 return create_lazy_op(expression);
2718 case EXPR_BINARY_COMMA:
2719 /* create side effects of left side */
2720 (void) expression_to_firm(expression->left);
2721 return _expression_to_firm(expression->right);
2723 case EXPR_BINARY_ADD_ASSIGN:
2724 case EXPR_BINARY_SUB_ASSIGN:
2725 case EXPR_BINARY_MUL_ASSIGN:
2726 case EXPR_BINARY_MOD_ASSIGN:
2727 case EXPR_BINARY_DIV_ASSIGN:
2728 case EXPR_BINARY_BITWISE_AND_ASSIGN:
2729 case EXPR_BINARY_BITWISE_OR_ASSIGN:
2730 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
2731 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2732 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2733 return create_assign_binop(expression);
2735 panic("TODO binexpr type");
2739 static ir_node *array_access_addr(const array_access_expression_t *expression)
2741 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2742 ir_node *base_addr = expression_to_firm(expression->array_ref);
2743 ir_node *offset = expression_to_firm(expression->index);
2744 type_t *ref_type = skip_typeref(expression->array_ref->base.type);
2745 ir_node *real_offset = adjust_for_pointer_arithmetic(dbgi, offset, ref_type);
2746 ir_node *result = new_d_Add(dbgi, base_addr, real_offset, mode_P_data);
2751 static ir_node *array_access_to_firm(
2752 const array_access_expression_t *expression)
2754 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2755 ir_node *addr = array_access_addr(expression);
2756 type_t *type = revert_automatic_type_conversion(
2757 (const expression_t*) expression);
2758 type = skip_typeref(type);
2760 return deref_address(dbgi, type, addr);
2763 static long get_offsetof_offset(const offsetof_expression_t *expression)
2765 type_t *orig_type = expression->type;
2768 designator_t *designator = expression->designator;
2769 for ( ; designator != NULL; designator = designator->next) {
2770 type_t *type = skip_typeref(orig_type);
2771 /* be sure the type is constructed */
2772 (void) get_ir_type(type);
2774 if (designator->symbol != NULL) {
2775 assert(is_type_compound(type));
2776 symbol_t *symbol = designator->symbol;
2778 compound_t *compound = type->compound.compound;
2779 entity_t *iter = compound->members.entities;
2780 for ( ; iter != NULL; iter = iter->base.next) {
2781 if (iter->base.symbol == symbol) {
2785 assert(iter != NULL);
2787 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
2788 assert(iter->declaration.kind == DECLARATION_KIND_COMPOUND_MEMBER);
2789 offset += get_entity_offset(iter->compound_member.entity);
2791 orig_type = iter->declaration.type;
2793 expression_t *array_index = designator->array_index;
2794 assert(designator->array_index != NULL);
2795 assert(is_type_array(type));
2797 long index = fold_constant_to_int(array_index);
2798 ir_type *arr_type = get_ir_type(type);
2799 ir_type *elem_type = get_array_element_type(arr_type);
2800 long elem_size = get_type_size_bytes(elem_type);
2802 offset += index * elem_size;
2804 orig_type = type->array.element_type;
2811 static ir_node *offsetof_to_firm(const offsetof_expression_t *expression)
2813 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
2814 long offset = get_offsetof_offset(expression);
2815 ir_tarval *tv = new_tarval_from_long(offset, mode);
2816 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2818 return new_d_Const(dbgi, tv);
2821 static void create_local_initializer(initializer_t *initializer, dbg_info *dbgi,
2822 ir_entity *entity, type_t *type);
2823 static ir_initializer_t *create_ir_initializer(
2824 const initializer_t *initializer, type_t *type);
2826 static ir_entity *create_initializer_entity(dbg_info *dbgi,
2827 initializer_t *initializer,
2830 /* create the ir_initializer */
2831 ir_graph *const old_current_ir_graph = current_ir_graph;
2832 current_ir_graph = get_const_code_irg();
2834 ir_initializer_t *irinitializer = create_ir_initializer(initializer, type);
2836 assert(current_ir_graph == get_const_code_irg());
2837 current_ir_graph = old_current_ir_graph;
2839 ident *const id = id_unique("initializer.%u");
2840 ir_type *const irtype = get_ir_type(type);
2841 ir_type *const global_type = get_glob_type();
2842 ir_entity *const entity = new_d_entity(global_type, id, irtype, dbgi);
2843 set_entity_ld_ident(entity, id);
2844 set_entity_visibility(entity, ir_visibility_private);
2845 add_entity_linkage(entity, IR_LINKAGE_CONSTANT);
2846 set_entity_initializer(entity, irinitializer);
2850 static ir_node *compound_literal_addr(compound_literal_expression_t const *const expression)
2852 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2853 type_t *type = expression->type;
2854 initializer_t *initializer = expression->initializer;
2856 if (is_constant_initializer(initializer) == EXPR_CLASS_CONSTANT) {
2857 ir_entity *entity = create_initializer_entity(dbgi, initializer, type);
2858 return create_symconst(dbgi, entity);
2860 /* create an entity on the stack */
2861 ident *const id = id_unique("CompLit.%u");
2862 ir_type *const irtype = get_ir_type(type);
2863 ir_type *frame_type = get_irg_frame_type(current_ir_graph);
2865 ir_entity *const entity = new_d_entity(frame_type, id, irtype, dbgi);
2866 set_entity_ld_ident(entity, id);
2868 /* create initialisation code */
2869 create_local_initializer(initializer, dbgi, entity, type);
2871 /* create a sel for the compound literal address */
2872 ir_node *frame = get_irg_frame(current_ir_graph);
2873 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, entity);
2878 static ir_node *compound_literal_to_firm(compound_literal_expression_t const* const expr)
2880 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
2881 type_t *const type = expr->type;
2882 ir_node *const addr = compound_literal_addr(expr);
2883 return deref_address(dbgi, type, addr);
2887 * Transform a sizeof expression into Firm code.
2889 static ir_node *sizeof_to_firm(const typeprop_expression_t *expression)
2891 type_t *const type = skip_typeref(expression->type);
2892 /* ยง6.5.3.4:2 if the type is a VLA, evaluate the expression. */
2893 if (is_type_array(type) && type->array.is_vla
2894 && expression->tp_expression != NULL) {
2895 expression_to_firm(expression->tp_expression);
2898 return get_type_size_node(type);
2901 static entity_t *get_expression_entity(const expression_t *expression)
2903 if (expression->kind != EXPR_REFERENCE)
2906 return expression->reference.entity;
2909 static unsigned get_cparser_entity_alignment(const entity_t *entity)
2911 switch(entity->kind) {
2912 case DECLARATION_KIND_CASES:
2913 return entity->declaration.alignment;
2916 return entity->compound.alignment;
2917 case ENTITY_TYPEDEF:
2918 return entity->typedefe.alignment;
2926 * Transform an alignof expression into Firm code.
2928 static ir_node *alignof_to_firm(const typeprop_expression_t *expression)
2930 unsigned alignment = 0;
2932 const expression_t *tp_expression = expression->tp_expression;
2933 if (tp_expression != NULL) {
2934 entity_t *entity = get_expression_entity(tp_expression);
2935 if (entity != NULL) {
2936 alignment = get_cparser_entity_alignment(entity);
2940 if (alignment == 0) {
2941 type_t *type = expression->type;
2942 alignment = get_type_alignment(type);
2945 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2946 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
2947 ir_tarval *tv = new_tarval_from_long(alignment, mode);
2948 return new_d_Const(dbgi, tv);
2951 static void init_ir_types(void);
2953 static ir_tarval *fold_constant_to_tarval(const expression_t *expression)
2955 assert(is_constant_expression(expression) == EXPR_CLASS_CONSTANT);
2957 bool constant_folding_old = constant_folding;
2958 constant_folding = true;
2959 int old_optimize = get_optimize();
2960 int old_constant_folding = get_opt_constant_folding();
2962 set_opt_constant_folding(1);
2966 ir_graph *old_current_ir_graph = current_ir_graph;
2967 current_ir_graph = get_const_code_irg();
2969 ir_node *const cnst = _expression_to_firm(expression);
2971 current_ir_graph = old_current_ir_graph;
2972 set_optimize(old_optimize);
2973 set_opt_constant_folding(old_constant_folding);
2975 if (!is_Const(cnst)) {
2976 panic("couldn't fold constant");
2979 constant_folding = constant_folding_old;
2981 ir_tarval *const tv = get_Const_tarval(cnst);
2982 ir_mode *const mode = get_ir_mode_arithmetic(skip_typeref(expression->base.type));
2983 return tarval_convert_to(tv, mode);
2986 /* this function is only used in parser.c, but it relies on libfirm functionality */
2987 bool constant_is_negative(const expression_t *expression)
2989 ir_tarval *tv = fold_constant_to_tarval(expression);
2990 return tarval_is_negative(tv);
2993 long fold_constant_to_int(const expression_t *expression)
2995 ir_tarval *tv = fold_constant_to_tarval(expression);
2996 if (!tarval_is_long(tv)) {
2997 panic("result of constant folding is not integer");
3000 return get_tarval_long(tv);
3003 bool fold_constant_to_bool(const expression_t *expression)
3005 ir_tarval *tv = fold_constant_to_tarval(expression);
3006 return !tarval_is_null(tv);
3009 static ir_node *conditional_to_firm(const conditional_expression_t *expression)
3011 dbg_info *const dbgi = get_dbg_info(&expression->base.source_position);
3013 /* first try to fold a constant condition */
3014 if (is_constant_expression(expression->condition) == EXPR_CLASS_CONSTANT) {
3015 bool val = fold_constant_to_bool(expression->condition);
3017 expression_t *true_expression = expression->true_expression;
3018 if (true_expression == NULL)
3019 true_expression = expression->condition;
3020 return expression_to_firm(true_expression);
3022 return expression_to_firm(expression->false_expression);
3026 ir_node *const true_block = new_immBlock();
3027 ir_node *const false_block = new_immBlock();
3028 ir_node *const cond_expr = create_condition_evaluation(expression->condition, true_block, false_block);
3029 mature_immBlock(true_block);
3030 mature_immBlock(false_block);
3032 set_cur_block(true_block);
3034 if (expression->true_expression != NULL) {
3035 true_val = expression_to_firm(expression->true_expression);
3036 } else if (cond_expr != NULL && get_irn_mode(cond_expr) != mode_b) {
3037 true_val = cond_expr;
3039 /* Condition ended with a short circuit (&&, ||, !) operation or a
3040 * comparison. Generate a "1" as value for the true branch. */
3041 true_val = new_Const(get_mode_one(mode_Is));
3043 ir_node *const true_jmp = new_d_Jmp(dbgi);
3045 set_cur_block(false_block);
3046 ir_node *const false_val = expression_to_firm(expression->false_expression);
3047 ir_node *const false_jmp = new_d_Jmp(dbgi);
3049 /* create the common block */
3050 ir_node *const in_cf[2] = { true_jmp, false_jmp };
3051 ir_node *const block = new_Block(lengthof(in_cf), in_cf);
3052 set_cur_block(block);
3054 /* TODO improve static semantics, so either both or no values are NULL */
3055 if (true_val == NULL || false_val == NULL)
3058 ir_node *const in[2] = { true_val, false_val };
3059 type_t *const type = skip_typeref(expression->base.type);
3060 ir_mode *const mode = get_ir_mode_arithmetic(type);
3061 ir_node *const val = new_d_Phi(dbgi, lengthof(in), in, mode);
3067 * Returns an IR-node representing the address of a field.
3069 static ir_node *select_addr(const select_expression_t *expression)
3071 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3073 construct_select_compound(expression);
3075 ir_node *compound_addr = expression_to_firm(expression->compound);
3077 entity_t *entry = expression->compound_entry;
3078 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3079 assert(entry->declaration.kind == DECLARATION_KIND_COMPOUND_MEMBER);
3081 if (constant_folding) {
3082 ir_mode *mode = get_irn_mode(compound_addr);
3083 ir_mode *mode_uint = get_reference_mode_unsigned_eq(mode);
3084 ir_node *ofs = new_Const_long(mode_uint, entry->compound_member.offset);
3085 return new_d_Add(dbgi, compound_addr, ofs, mode);
3087 ir_entity *irentity = entry->compound_member.entity;
3088 assert(irentity != NULL);
3089 return new_d_simpleSel(dbgi, new_NoMem(), compound_addr, irentity);
3093 static ir_node *select_to_firm(const select_expression_t *expression)
3095 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3096 ir_node *addr = select_addr(expression);
3097 type_t *type = revert_automatic_type_conversion(
3098 (const expression_t*) expression);
3099 type = skip_typeref(type);
3101 entity_t *entry = expression->compound_entry;
3102 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3104 if (entry->compound_member.bitfield) {
3105 return bitfield_extract_to_firm(expression, addr);
3108 return deref_address(dbgi, type, addr);
3111 /* Values returned by __builtin_classify_type. */
3112 typedef enum gcc_type_class
3118 enumeral_type_class,
3121 reference_type_class,
3125 function_type_class,
3136 static ir_node *classify_type_to_firm(const classify_type_expression_t *const expr)
3138 type_t *type = expr->type_expression->base.type;
3140 /* FIXME gcc returns different values depending on whether compiling C or C++
3141 * e.g. int x[10] is pointer_type_class in C, but array_type_class in C++ */
3144 type = skip_typeref(type);
3145 switch (type->kind) {
3147 const atomic_type_t *const atomic_type = &type->atomic;
3148 switch (atomic_type->akind) {
3149 /* should not be reached */
3150 case ATOMIC_TYPE_INVALID:
3154 /* gcc cannot do that */
3155 case ATOMIC_TYPE_VOID:
3156 tc = void_type_class;
3159 case ATOMIC_TYPE_WCHAR_T: /* gcc handles this as integer */
3160 case ATOMIC_TYPE_CHAR: /* gcc handles this as integer */
3161 case ATOMIC_TYPE_SCHAR: /* gcc handles this as integer */
3162 case ATOMIC_TYPE_UCHAR: /* gcc handles this as integer */
3163 case ATOMIC_TYPE_SHORT:
3164 case ATOMIC_TYPE_USHORT:
3165 case ATOMIC_TYPE_INT:
3166 case ATOMIC_TYPE_UINT:
3167 case ATOMIC_TYPE_LONG:
3168 case ATOMIC_TYPE_ULONG:
3169 case ATOMIC_TYPE_LONGLONG:
3170 case ATOMIC_TYPE_ULONGLONG:
3171 case ATOMIC_TYPE_BOOL: /* gcc handles this as integer */
3172 tc = integer_type_class;
3175 case ATOMIC_TYPE_FLOAT:
3176 case ATOMIC_TYPE_DOUBLE:
3177 case ATOMIC_TYPE_LONG_DOUBLE:
3178 tc = real_type_class;
3181 panic("Unexpected atomic type in classify_type_to_firm().");
3184 case TYPE_COMPLEX: tc = complex_type_class; goto make_const;
3185 case TYPE_IMAGINARY: tc = complex_type_class; goto make_const;
3186 case TYPE_ARRAY: /* gcc handles this as pointer */
3187 case TYPE_FUNCTION: /* gcc handles this as pointer */
3188 case TYPE_POINTER: tc = pointer_type_class; goto make_const;
3189 case TYPE_COMPOUND_STRUCT: tc = record_type_class; goto make_const;
3190 case TYPE_COMPOUND_UNION: tc = union_type_class; goto make_const;
3192 /* gcc handles this as integer */
3193 case TYPE_ENUM: tc = integer_type_class; goto make_const;
3195 /* gcc classifies the referenced type */
3196 case TYPE_REFERENCE: type = type->reference.refers_to; continue;
3198 /* typedef/typeof should be skipped already */
3204 panic("unexpected TYPE classify_type_to_firm().");
3208 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
3209 ir_mode *const mode = atomic_modes[ATOMIC_TYPE_INT];
3210 ir_tarval *const tv = new_tarval_from_long(tc, mode);
3211 return new_d_Const(dbgi, tv);
3214 static ir_node *function_name_to_firm(
3215 const funcname_expression_t *const expr)
3217 switch(expr->kind) {
3218 case FUNCNAME_FUNCTION:
3219 case FUNCNAME_PRETTY_FUNCTION:
3220 case FUNCNAME_FUNCDNAME:
3221 if (current_function_name == NULL) {
3222 const source_position_t *const src_pos = &expr->base.source_position;
3223 const char *name = current_function_entity->base.symbol->string;
3224 const string_t string = { name, strlen(name) + 1 };
3225 current_function_name = string_to_firm(src_pos, "__func__.%u", &string);
3227 return current_function_name;
3228 case FUNCNAME_FUNCSIG:
3229 if (current_funcsig == NULL) {
3230 const source_position_t *const src_pos = &expr->base.source_position;
3231 ir_entity *ent = get_irg_entity(current_ir_graph);
3232 const char *const name = get_entity_ld_name(ent);
3233 const string_t string = { name, strlen(name) + 1 };
3234 current_funcsig = string_to_firm(src_pos, "__FUNCSIG__.%u", &string);
3236 return current_funcsig;
3238 panic("Unsupported function name");
3241 static ir_node *statement_expression_to_firm(const statement_expression_t *expr)
3243 statement_t *statement = expr->statement;
3245 assert(statement->kind == STATEMENT_COMPOUND);
3246 return compound_statement_to_firm(&statement->compound);
3249 static ir_node *va_start_expression_to_firm(
3250 const va_start_expression_t *const expr)
3252 ir_entity *param_ent = current_vararg_entity;
3253 if (param_ent == NULL) {
3254 size_t const n = IR_VA_START_PARAMETER_NUMBER;
3255 ir_type *const frame_type = get_irg_frame_type(current_ir_graph);
3256 ir_type *const param_type = get_unknown_type();
3257 param_ent = new_parameter_entity(frame_type, n, param_type);
3258 current_vararg_entity = param_ent;
3261 ir_node *const frame = get_irg_frame(current_ir_graph);
3262 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
3263 ir_node *const no_mem = new_NoMem();
3264 ir_node *const arg_sel = new_d_simpleSel(dbgi, no_mem, frame, param_ent);
3266 set_value_for_expression(expr->ap, arg_sel);
3271 static ir_node *va_arg_expression_to_firm(const va_arg_expression_t *const expr)
3273 type_t *const type = expr->base.type;
3274 expression_t *const ap_expr = expr->ap;
3275 ir_node *const ap_addr = expression_to_addr(ap_expr);
3276 ir_node *const ap = get_value_from_lvalue(ap_expr, ap_addr);
3277 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
3278 ir_node *const res = deref_address(dbgi, type, ap);
3280 ir_node *const cnst = get_type_size_node(expr->base.type);
3281 ir_mode *const mode = get_irn_mode(cnst);
3282 ir_node *const c1 = new_Const_long(mode, stack_param_align - 1);
3283 ir_node *const c2 = new_d_Add(dbgi, cnst, c1, mode);
3284 ir_node *const c3 = new_Const_long(mode, -(long)stack_param_align);
3285 ir_node *const c4 = new_d_And(dbgi, c2, c3, mode);
3286 ir_node *const add = new_d_Add(dbgi, ap, c4, mode_P_data);
3288 set_value_for_expression_addr(ap_expr, add, ap_addr);
3294 * Generate Firm for a va_copy expression.
3296 static ir_node *va_copy_expression_to_firm(const va_copy_expression_t *const expr)
3298 ir_node *const src = expression_to_firm(expr->src);
3299 set_value_for_expression(expr->dst, src);
3303 static ir_node *dereference_addr(const unary_expression_t *const expression)
3305 assert(expression->base.kind == EXPR_UNARY_DEREFERENCE);
3306 return expression_to_firm(expression->value);
3310 * Returns a IR-node representing an lvalue of the given expression.
3312 static ir_node *expression_to_addr(const expression_t *expression)
3314 switch(expression->kind) {
3315 case EXPR_ARRAY_ACCESS:
3316 return array_access_addr(&expression->array_access);
3318 return call_expression_to_firm(&expression->call);
3319 case EXPR_COMPOUND_LITERAL:
3320 return compound_literal_addr(&expression->compound_literal);
3321 case EXPR_REFERENCE:
3322 return reference_addr(&expression->reference);
3324 return select_addr(&expression->select);
3325 case EXPR_UNARY_DEREFERENCE:
3326 return dereference_addr(&expression->unary);
3330 panic("trying to get address of non-lvalue");
3333 static ir_node *builtin_constant_to_firm(
3334 const builtin_constant_expression_t *expression)
3336 ir_mode *const mode = get_ir_mode_arithmetic(expression->base.type);
3337 bool const v = is_constant_expression(expression->value) == EXPR_CLASS_CONSTANT;
3338 return create_Const_from_bool(mode, v);
3341 static ir_node *builtin_types_compatible_to_firm(
3342 const builtin_types_compatible_expression_t *expression)
3344 type_t *const left = get_unqualified_type(skip_typeref(expression->left));
3345 type_t *const right = get_unqualified_type(skip_typeref(expression->right));
3346 bool const value = types_compatible(left, right);
3347 ir_mode *const mode = get_ir_mode_arithmetic(expression->base.type);
3348 return create_Const_from_bool(mode, value);
3351 static ir_node *get_label_block(label_t *label)
3353 if (label->block != NULL)
3354 return label->block;
3356 /* beware: might be called from create initializer with current_ir_graph
3357 * set to const_code_irg. */
3358 ir_graph *rem = current_ir_graph;
3359 current_ir_graph = current_function;
3361 ir_node *block = new_immBlock();
3363 label->block = block;
3365 ARR_APP1(label_t *, all_labels, label);
3367 current_ir_graph = rem;
3372 * Pointer to a label. This is used for the
3373 * GNU address-of-label extension.
3375 static ir_node *label_address_to_firm(const label_address_expression_t *label)
3377 dbg_info *dbgi = get_dbg_info(&label->base.source_position);
3378 ir_node *block = get_label_block(label->label);
3379 ir_entity *entity = create_Block_entity(block);
3381 symconst_symbol value;
3382 value.entity_p = entity;
3383 return new_d_SymConst(dbgi, mode_P_code, value, symconst_addr_ent);
3387 * creates firm nodes for an expression. The difference between this function
3388 * and expression_to_firm is, that this version might produce mode_b nodes
3389 * instead of mode_Is.
3391 static ir_node *_expression_to_firm(expression_t const *const expr)
3394 if (!constant_folding) {
3395 assert(!expr->base.transformed);
3396 ((expression_t*)expr)->base.transformed = true;
3400 switch (expr->kind) {
3401 case EXPR_ALIGNOF: return alignof_to_firm( &expr->typeprop);
3402 case EXPR_ARRAY_ACCESS: return array_access_to_firm( &expr->array_access);
3403 case EXPR_BINARY_CASES: return binary_expression_to_firm( &expr->binary);
3404 case EXPR_BUILTIN_CONSTANT_P: return builtin_constant_to_firm( &expr->builtin_constant);
3405 case EXPR_BUILTIN_TYPES_COMPATIBLE_P: return builtin_types_compatible_to_firm(&expr->builtin_types_compatible);
3406 case EXPR_CALL: return call_expression_to_firm( &expr->call);
3407 case EXPR_CLASSIFY_TYPE: return classify_type_to_firm( &expr->classify_type);
3408 case EXPR_COMPOUND_LITERAL: return compound_literal_to_firm( &expr->compound_literal);
3409 case EXPR_CONDITIONAL: return conditional_to_firm( &expr->conditional);
3410 case EXPR_FUNCNAME: return function_name_to_firm( &expr->funcname);
3411 case EXPR_LABEL_ADDRESS: return label_address_to_firm( &expr->label_address);
3412 case EXPR_LITERAL_CASES: return literal_to_firm( &expr->literal);
3413 case EXPR_OFFSETOF: return offsetof_to_firm( &expr->offsetofe);
3414 case EXPR_REFERENCE: return reference_expression_to_firm( &expr->reference);
3415 case EXPR_ENUM_CONSTANT: return enum_constant_to_firm( &expr->reference);
3416 case EXPR_SELECT: return select_to_firm( &expr->select);
3417 case EXPR_SIZEOF: return sizeof_to_firm( &expr->typeprop);
3418 case EXPR_STATEMENT: return statement_expression_to_firm( &expr->statement);
3419 case EXPR_UNARY_CASES: return unary_expression_to_firm( &expr->unary);
3420 case EXPR_VA_ARG: return va_arg_expression_to_firm( &expr->va_arge);
3421 case EXPR_VA_COPY: return va_copy_expression_to_firm( &expr->va_copye);
3422 case EXPR_VA_START: return va_start_expression_to_firm( &expr->va_starte);
3423 case EXPR_WIDE_STRING_LITERAL: return wide_string_literal_to_firm( &expr->string_literal);
3425 case EXPR_STRING_LITERAL: return string_to_firm(&expr->base.source_position, "str.%u", &expr->literal.value);
3427 case EXPR_ERROR: break;
3429 panic("invalid expression found");
3433 * Check if a given expression is a GNU __builtin_expect() call.
3435 static bool is_builtin_expect(const expression_t *expression)
3437 if (expression->kind != EXPR_CALL)
3440 expression_t *function = expression->call.function;
3441 if (function->kind != EXPR_REFERENCE)
3443 reference_expression_t *ref = &function->reference;
3444 if (ref->entity->kind != ENTITY_FUNCTION ||
3445 ref->entity->function.btk != BUILTIN_EXPECT)
3451 static bool produces_mode_b(const expression_t *expression)
3453 switch (expression->kind) {
3454 case EXPR_BINARY_EQUAL:
3455 case EXPR_BINARY_NOTEQUAL:
3456 case EXPR_BINARY_LESS:
3457 case EXPR_BINARY_LESSEQUAL:
3458 case EXPR_BINARY_GREATER:
3459 case EXPR_BINARY_GREATEREQUAL:
3460 case EXPR_BINARY_ISGREATER:
3461 case EXPR_BINARY_ISGREATEREQUAL:
3462 case EXPR_BINARY_ISLESS:
3463 case EXPR_BINARY_ISLESSEQUAL:
3464 case EXPR_BINARY_ISLESSGREATER:
3465 case EXPR_BINARY_ISUNORDERED:
3466 case EXPR_UNARY_NOT:
3470 if (is_builtin_expect(expression)) {
3471 expression_t *argument = expression->call.arguments->expression;
3472 return produces_mode_b(argument);
3475 case EXPR_BINARY_COMMA:
3476 return produces_mode_b(expression->binary.right);
3483 static ir_node *expression_to_firm(const expression_t *expression)
3485 if (!produces_mode_b(expression)) {
3486 ir_node *res = _expression_to_firm(expression);
3487 assert(res == NULL || get_irn_mode(res) != mode_b);
3491 if (is_constant_expression(expression) == EXPR_CLASS_CONSTANT) {
3492 return new_Const(fold_constant_to_tarval(expression));
3495 /* we have to produce a 0/1 from the mode_b expression */
3496 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3497 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
3498 return produce_condition_result(expression, mode, dbgi);
3502 * create a short-circuit expression evaluation that tries to construct
3503 * efficient control flow structures for &&, || and ! expressions
3505 static ir_node *create_condition_evaluation(const expression_t *expression,
3506 ir_node *true_block,
3507 ir_node *false_block)
3509 switch(expression->kind) {
3510 case EXPR_UNARY_NOT: {
3511 const unary_expression_t *unary_expression = &expression->unary;
3512 create_condition_evaluation(unary_expression->value, false_block,
3516 case EXPR_BINARY_LOGICAL_AND: {
3517 const binary_expression_t *binary_expression = &expression->binary;
3519 ir_node *extra_block = new_immBlock();
3520 create_condition_evaluation(binary_expression->left, extra_block,
3522 mature_immBlock(extra_block);
3523 set_cur_block(extra_block);
3524 create_condition_evaluation(binary_expression->right, true_block,
3528 case EXPR_BINARY_LOGICAL_OR: {
3529 const binary_expression_t *binary_expression = &expression->binary;
3531 ir_node *extra_block = new_immBlock();
3532 create_condition_evaluation(binary_expression->left, true_block,
3534 mature_immBlock(extra_block);
3535 set_cur_block(extra_block);
3536 create_condition_evaluation(binary_expression->right, true_block,
3544 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3545 ir_node *cond_expr = _expression_to_firm(expression);
3546 ir_node *condition = create_conv(dbgi, cond_expr, mode_b);
3547 ir_node *cond = new_d_Cond(dbgi, condition);
3548 ir_node *true_proj = new_d_Proj(dbgi, cond, mode_X, pn_Cond_true);
3549 ir_node *false_proj = new_d_Proj(dbgi, cond, mode_X, pn_Cond_false);
3551 /* set branch prediction info based on __builtin_expect */
3552 if (is_builtin_expect(expression) && is_Cond(cond)) {
3553 call_argument_t *argument = expression->call.arguments->next;
3554 if (is_constant_expression(argument->expression) == EXPR_CLASS_CONSTANT) {
3555 bool const cnst = fold_constant_to_bool(argument->expression);
3556 cond_jmp_predicate const pred = cnst ? COND_JMP_PRED_TRUE : COND_JMP_PRED_FALSE;
3557 set_Cond_jmp_pred(cond, pred);
3561 add_immBlock_pred(true_block, true_proj);
3562 add_immBlock_pred(false_block, false_proj);
3564 set_unreachable_now();
3568 static void create_variable_entity(entity_t *variable,
3569 declaration_kind_t declaration_kind,
3570 ir_type *parent_type)
3572 assert(variable->kind == ENTITY_VARIABLE);
3573 type_t *type = skip_typeref(variable->declaration.type);
3575 ident *const id = new_id_from_str(variable->base.symbol->string);
3576 ir_type *const irtype = get_ir_type(type);
3577 dbg_info *const dbgi = get_dbg_info(&variable->base.source_position);
3578 ir_entity *const irentity = new_d_entity(parent_type, id, irtype, dbgi);
3579 unsigned alignment = variable->declaration.alignment;
3581 set_entity_alignment(irentity, alignment);
3583 handle_decl_modifiers(irentity, variable);
3585 variable->declaration.kind = (unsigned char) declaration_kind;
3586 variable->variable.v.entity = irentity;
3587 set_entity_ld_ident(irentity, create_ld_ident(variable));
3589 if (type->base.qualifiers & TYPE_QUALIFIER_VOLATILE) {
3590 set_entity_volatility(irentity, volatility_is_volatile);
3595 typedef struct type_path_entry_t type_path_entry_t;
3596 struct type_path_entry_t {
3598 ir_initializer_t *initializer;
3600 entity_t *compound_entry;
3603 typedef struct type_path_t type_path_t;
3604 struct type_path_t {
3605 type_path_entry_t *path;
3610 static __attribute__((unused)) void debug_print_type_path(const type_path_t *path)
3612 size_t len = ARR_LEN(path->path);
3614 for (size_t i = 0; i < len; ++i) {
3615 const type_path_entry_t *entry = & path->path[i];
3617 type_t *type = skip_typeref(entry->type);
3618 if (is_type_compound(type)) {
3619 fprintf(stderr, ".%s", entry->compound_entry->base.symbol->string);
3620 } else if (is_type_array(type)) {
3621 fprintf(stderr, "[%u]", (unsigned) entry->index);
3623 fprintf(stderr, "-INVALID-");
3626 fprintf(stderr, " (");
3627 print_type(path->top_type);
3628 fprintf(stderr, ")");
3631 static type_path_entry_t *get_type_path_top(const type_path_t *path)
3633 size_t len = ARR_LEN(path->path);
3635 return & path->path[len-1];
3638 static type_path_entry_t *append_to_type_path(type_path_t *path)
3640 size_t len = ARR_LEN(path->path);
3641 ARR_RESIZE(type_path_entry_t, path->path, len+1);
3643 type_path_entry_t *result = & path->path[len];
3644 memset(result, 0, sizeof(result[0]));
3648 static size_t get_compound_member_count(const compound_type_t *type)
3650 compound_t *compound = type->compound;
3651 size_t n_members = 0;
3652 entity_t *member = compound->members.entities;
3653 for ( ; member != NULL; member = member->base.next) {
3660 static ir_initializer_t *get_initializer_entry(type_path_t *path)
3662 type_t *orig_top_type = path->top_type;
3663 type_t *top_type = skip_typeref(orig_top_type);
3665 assert(is_type_compound(top_type) || is_type_array(top_type));
3667 if (ARR_LEN(path->path) == 0) {
3670 type_path_entry_t *top = get_type_path_top(path);
3671 ir_initializer_t *initializer = top->initializer;
3672 return get_initializer_compound_value(initializer, top->index);
3676 static void descend_into_subtype(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 ir_initializer_t *initializer = get_initializer_entry(path);
3685 type_path_entry_t *top = append_to_type_path(path);
3686 top->type = top_type;
3690 if (is_type_compound(top_type)) {
3691 compound_t *const compound = top_type->compound.compound;
3692 entity_t *const entry = skip_unnamed_bitfields(compound->members.entities);
3694 top->compound_entry = entry;
3696 len = get_compound_member_count(&top_type->compound);
3697 if (entry != NULL) {
3698 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3699 path->top_type = entry->declaration.type;
3702 assert(is_type_array(top_type));
3703 assert(top_type->array.size > 0);
3706 path->top_type = top_type->array.element_type;
3707 len = top_type->array.size;
3709 if (initializer == NULL
3710 || get_initializer_kind(initializer) == IR_INITIALIZER_NULL) {
3711 initializer = create_initializer_compound(len);
3712 /* we have to set the entry at the 2nd latest path entry... */
3713 size_t path_len = ARR_LEN(path->path);
3714 assert(path_len >= 1);
3716 type_path_entry_t *entry = & path->path[path_len-2];
3717 ir_initializer_t *tinitializer = entry->initializer;
3718 set_initializer_compound_value(tinitializer, entry->index,
3722 top->initializer = initializer;
3725 static void ascend_from_subtype(type_path_t *path)
3727 type_path_entry_t *top = get_type_path_top(path);
3729 path->top_type = top->type;
3731 size_t len = ARR_LEN(path->path);
3732 ARR_RESIZE(type_path_entry_t, path->path, len-1);
3735 static void walk_designator(type_path_t *path, const designator_t *designator)
3737 /* designators start at current object type */
3738 ARR_RESIZE(type_path_entry_t, path->path, 1);
3740 for ( ; designator != NULL; designator = designator->next) {
3741 type_path_entry_t *top = get_type_path_top(path);
3742 type_t *orig_type = top->type;
3743 type_t *type = skip_typeref(orig_type);
3745 if (designator->symbol != NULL) {
3746 assert(is_type_compound(type));
3748 symbol_t *symbol = designator->symbol;
3750 compound_t *compound = type->compound.compound;
3751 entity_t *iter = compound->members.entities;
3752 for ( ; iter != NULL; iter = iter->base.next, ++index) {
3753 if (iter->base.symbol == symbol) {
3754 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
3758 assert(iter != NULL);
3760 /* revert previous initialisations of other union elements */
3761 if (type->kind == TYPE_COMPOUND_UNION) {
3762 ir_initializer_t *initializer = top->initializer;
3763 if (initializer != NULL
3764 && get_initializer_kind(initializer) == IR_INITIALIZER_COMPOUND) {
3765 /* are we writing to a new element? */
3766 ir_initializer_t *oldi
3767 = get_initializer_compound_value(initializer, index);
3768 if (get_initializer_kind(oldi) == IR_INITIALIZER_NULL) {
3769 /* clear initializer */
3771 = get_initializer_compound_n_entries(initializer);
3772 ir_initializer_t *nulli = get_initializer_null();
3773 for (size_t i = 0; i < len; ++i) {
3774 set_initializer_compound_value(initializer, i,
3781 top->type = orig_type;
3782 top->compound_entry = iter;
3784 orig_type = iter->declaration.type;
3786 expression_t *array_index = designator->array_index;
3787 assert(designator->array_index != NULL);
3788 assert(is_type_array(type));
3790 long index = fold_constant_to_int(array_index);
3793 if (type->array.size_constant) {
3794 long array_size = type->array.size;
3795 assert(index < array_size);
3799 top->type = orig_type;
3800 top->index = (size_t) index;
3801 orig_type = type->array.element_type;
3803 path->top_type = orig_type;
3805 if (designator->next != NULL) {
3806 descend_into_subtype(path);
3810 path->invalid = false;
3813 static void advance_current_object(type_path_t *path)
3815 if (path->invalid) {
3816 /* TODO: handle this... */
3817 panic("invalid initializer in ast2firm (excessive elements)");
3820 type_path_entry_t *top = get_type_path_top(path);
3822 type_t *type = skip_typeref(top->type);
3823 if (is_type_union(type)) {
3824 /* only the first element is initialized in unions */
3825 top->compound_entry = NULL;
3826 } else if (is_type_struct(type)) {
3827 entity_t *entry = top->compound_entry;
3830 entry = skip_unnamed_bitfields(entry->base.next);
3831 top->compound_entry = entry;
3832 if (entry != NULL) {
3833 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3834 path->top_type = entry->declaration.type;
3838 assert(is_type_array(type));
3841 if (!type->array.size_constant || top->index < type->array.size) {
3846 /* we're past the last member of the current sub-aggregate, try if we
3847 * can ascend in the type hierarchy and continue with another subobject */
3848 size_t len = ARR_LEN(path->path);
3851 ascend_from_subtype(path);
3852 advance_current_object(path);
3854 path->invalid = true;
3859 static ir_initializer_t *create_ir_initializer_value(
3860 const initializer_value_t *initializer)
3862 if (is_type_compound(initializer->value->base.type)) {
3863 panic("initializer creation for compounds not implemented yet");
3865 type_t *type = initializer->value->base.type;
3866 expression_t *expr = initializer->value;
3867 ir_node *value = expression_to_firm(expr);
3868 ir_mode *mode = get_ir_mode_storage(type);
3869 value = create_conv(NULL, value, mode);
3870 return create_initializer_const(value);
3873 /** test wether type can be initialized by a string constant */
3874 static bool is_string_type(type_t *type)
3877 if (is_type_pointer(type)) {
3878 inner = skip_typeref(type->pointer.points_to);
3879 } else if(is_type_array(type)) {
3880 inner = skip_typeref(type->array.element_type);
3885 return is_type_integer(inner);
3888 static ir_initializer_t *create_ir_initializer_list(
3889 const initializer_list_t *initializer, type_t *type)
3892 memset(&path, 0, sizeof(path));
3893 path.top_type = type;
3894 path.path = NEW_ARR_F(type_path_entry_t, 0);
3896 descend_into_subtype(&path);
3898 for (size_t i = 0; i < initializer->len; ++i) {
3899 const initializer_t *sub_initializer = initializer->initializers[i];
3901 if (sub_initializer->kind == INITIALIZER_DESIGNATOR) {
3902 walk_designator(&path, sub_initializer->designator.designator);
3906 if (sub_initializer->kind == INITIALIZER_VALUE) {
3907 /* we might have to descend into types until we're at a scalar
3910 type_t *orig_top_type = path.top_type;
3911 type_t *top_type = skip_typeref(orig_top_type);
3913 if (is_type_scalar(top_type))
3915 descend_into_subtype(&path);
3917 } else if (sub_initializer->kind == INITIALIZER_STRING
3918 || sub_initializer->kind == INITIALIZER_WIDE_STRING) {
3919 /* we might have to descend into types until we're at a scalar
3922 type_t *orig_top_type = path.top_type;
3923 type_t *top_type = skip_typeref(orig_top_type);
3925 if (is_string_type(top_type))
3927 descend_into_subtype(&path);
3931 ir_initializer_t *sub_irinitializer
3932 = create_ir_initializer(sub_initializer, path.top_type);
3934 size_t path_len = ARR_LEN(path.path);
3935 assert(path_len >= 1);
3936 type_path_entry_t *entry = & path.path[path_len-1];
3937 ir_initializer_t *tinitializer = entry->initializer;
3938 set_initializer_compound_value(tinitializer, entry->index,
3941 advance_current_object(&path);
3944 assert(ARR_LEN(path.path) >= 1);
3945 ir_initializer_t *result = path.path[0].initializer;
3946 DEL_ARR_F(path.path);
3951 static ir_initializer_t *create_ir_initializer_string(
3952 const initializer_string_t *initializer, type_t *type)
3954 type = skip_typeref(type);
3956 size_t string_len = initializer->string.size;
3957 assert(type->kind == TYPE_ARRAY);
3958 assert(type->array.size_constant);
3959 size_t len = type->array.size;
3960 ir_initializer_t *irinitializer = create_initializer_compound(len);
3962 const char *string = initializer->string.begin;
3963 ir_mode *mode = get_ir_mode_storage(type->array.element_type);
3965 for (size_t i = 0; i < len; ++i) {
3970 ir_tarval *tv = new_tarval_from_long(c, mode);
3971 ir_initializer_t *char_initializer = create_initializer_tarval(tv);
3973 set_initializer_compound_value(irinitializer, i, char_initializer);
3976 return irinitializer;
3979 static ir_initializer_t *create_ir_initializer_wide_string(
3980 const initializer_wide_string_t *initializer, type_t *type)
3982 assert(type->kind == TYPE_ARRAY);
3983 assert(type->array.size_constant);
3984 size_t len = type->array.size;
3985 size_t string_len = wstrlen(&initializer->string);
3986 ir_initializer_t *irinitializer = create_initializer_compound(len);
3988 const char *p = initializer->string.begin;
3989 ir_mode *mode = get_type_mode(ir_type_wchar_t);
3991 for (size_t i = 0; i < len; ++i) {
3993 if (i < string_len) {
3994 c = read_utf8_char(&p);
3996 ir_tarval *tv = new_tarval_from_long(c, mode);
3997 ir_initializer_t *char_initializer = create_initializer_tarval(tv);
3999 set_initializer_compound_value(irinitializer, i, char_initializer);
4002 return irinitializer;
4005 static ir_initializer_t *create_ir_initializer(
4006 const initializer_t *initializer, type_t *type)
4008 switch(initializer->kind) {
4009 case INITIALIZER_STRING:
4010 return create_ir_initializer_string(&initializer->string, type);
4012 case INITIALIZER_WIDE_STRING:
4013 return create_ir_initializer_wide_string(&initializer->wide_string,
4016 case INITIALIZER_LIST:
4017 return create_ir_initializer_list(&initializer->list, type);
4019 case INITIALIZER_VALUE:
4020 return create_ir_initializer_value(&initializer->value);
4022 case INITIALIZER_DESIGNATOR:
4023 panic("unexpected designator initializer found");
4025 panic("unknown initializer");
4028 /** ANSI C ยง6.7.8:21: If there are fewer initializers [..] than there
4029 * are elements [...] the remainder of the aggregate shall be initialized
4030 * implicitly the same as objects that have static storage duration. */
4031 static void create_dynamic_null_initializer(ir_entity *entity, dbg_info *dbgi,
4034 /* for unions we must NOT do anything for null initializers */
4035 ir_type *owner = get_entity_owner(entity);
4036 if (is_Union_type(owner)) {
4040 ir_type *ent_type = get_entity_type(entity);
4041 /* create sub-initializers for a compound type */
4042 if (is_compound_type(ent_type)) {
4043 unsigned n_members = get_compound_n_members(ent_type);
4044 for (unsigned n = 0; n < n_members; ++n) {
4045 ir_entity *member = get_compound_member(ent_type, n);
4046 ir_node *addr = new_d_simpleSel(dbgi, new_NoMem(), base_addr,
4048 create_dynamic_null_initializer(member, dbgi, addr);
4052 if (is_Array_type(ent_type)) {
4053 assert(has_array_upper_bound(ent_type, 0));
4054 long n = get_array_upper_bound_int(ent_type, 0);
4055 for (long i = 0; i < n; ++i) {
4056 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
4057 ir_tarval *index_tv = new_tarval_from_long(i, mode_uint);
4058 ir_node *cnst = new_d_Const(dbgi, index_tv);
4059 ir_node *in[1] = { cnst };
4060 ir_entity *arrent = get_array_element_entity(ent_type);
4061 ir_node *addr = new_d_Sel(dbgi, new_NoMem(), base_addr, 1, in,
4063 create_dynamic_null_initializer(arrent, dbgi, addr);
4068 ir_mode *value_mode = get_type_mode(ent_type);
4069 ir_node *node = new_Const(get_mode_null(value_mode));
4071 /* is it a bitfield type? */
4072 if (is_Primitive_type(ent_type) &&
4073 get_primitive_base_type(ent_type) != NULL) {
4074 bitfield_store_to_firm(dbgi, entity, base_addr, node, false, false);
4078 ir_node *mem = get_store();
4079 ir_node *store = new_d_Store(dbgi, mem, base_addr, node, cons_none);
4080 ir_node *proj_m = new_Proj(store, mode_M, pn_Store_M);
4084 static void create_dynamic_initializer_sub(ir_initializer_t *initializer,
4085 ir_entity *entity, ir_type *type, dbg_info *dbgi, ir_node *base_addr)
4087 switch(get_initializer_kind(initializer)) {
4088 case IR_INITIALIZER_NULL:
4089 create_dynamic_null_initializer(entity, dbgi, base_addr);
4091 case IR_INITIALIZER_CONST: {
4092 ir_node *node = get_initializer_const_value(initializer);
4093 ir_type *ent_type = get_entity_type(entity);
4095 /* is it a bitfield type? */
4096 if (is_Primitive_type(ent_type) &&
4097 get_primitive_base_type(ent_type) != NULL) {
4098 bitfield_store_to_firm(dbgi, entity, base_addr, node, false, false);
4102 assert(get_type_mode(type) == get_irn_mode(node));
4103 ir_node *mem = get_store();
4104 ir_node *store = new_d_Store(dbgi, mem, base_addr, node, cons_none);
4105 ir_node *proj_m = new_Proj(store, mode_M, pn_Store_M);
4109 case IR_INITIALIZER_TARVAL: {
4110 ir_tarval *tv = get_initializer_tarval_value(initializer);
4111 ir_node *cnst = new_d_Const(dbgi, tv);
4112 ir_type *ent_type = get_entity_type(entity);
4114 /* is it a bitfield type? */
4115 if (is_Primitive_type(ent_type) &&
4116 get_primitive_base_type(ent_type) != NULL) {
4117 bitfield_store_to_firm(dbgi, entity, base_addr, cnst, false, false);
4121 assert(get_type_mode(type) == get_tarval_mode(tv));
4122 ir_node *mem = get_store();
4123 ir_node *store = new_d_Store(dbgi, mem, base_addr, cnst, cons_none);
4124 ir_node *proj_m = new_Proj(store, mode_M, pn_Store_M);
4128 case IR_INITIALIZER_COMPOUND: {
4129 assert(is_compound_type(type) || is_Array_type(type));
4131 if (is_Array_type(type)) {
4132 assert(has_array_upper_bound(type, 0));
4133 n_members = get_array_upper_bound_int(type, 0);
4135 n_members = get_compound_n_members(type);
4138 if (get_initializer_compound_n_entries(initializer)
4139 != (unsigned) n_members)
4140 panic("initializer doesn't match compound type");
4142 for (int i = 0; i < n_members; ++i) {
4145 ir_entity *sub_entity;
4146 if (is_Array_type(type)) {
4147 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
4148 ir_tarval *index_tv = new_tarval_from_long(i, mode_uint);
4149 ir_node *cnst = new_d_Const(dbgi, index_tv);
4150 ir_node *in[1] = { cnst };
4151 irtype = get_array_element_type(type);
4152 sub_entity = get_array_element_entity(type);
4153 addr = new_d_Sel(dbgi, new_NoMem(), base_addr, 1, in,
4156 sub_entity = get_compound_member(type, i);
4157 irtype = get_entity_type(sub_entity);
4158 addr = new_d_simpleSel(dbgi, new_NoMem(), base_addr,
4162 ir_initializer_t *sub_init
4163 = get_initializer_compound_value(initializer, i);
4165 create_dynamic_initializer_sub(sub_init, sub_entity, irtype, dbgi,
4172 panic("invalid IR_INITIALIZER found");
4175 static void create_dynamic_initializer(ir_initializer_t *initializer,
4176 dbg_info *dbgi, ir_entity *entity)
4178 ir_node *frame = get_irg_frame(current_ir_graph);
4179 ir_node *base_addr = new_d_simpleSel(dbgi, new_NoMem(), frame, entity);
4180 ir_type *type = get_entity_type(entity);
4182 create_dynamic_initializer_sub(initializer, entity, type, dbgi, base_addr);
4185 static void create_local_initializer(initializer_t *initializer, dbg_info *dbgi,
4186 ir_entity *entity, type_t *type)
4188 ir_node *memory = get_store();
4189 ir_node *nomem = new_NoMem();
4190 ir_node *frame = get_irg_frame(current_ir_graph);
4191 ir_node *addr = new_d_simpleSel(dbgi, nomem, frame, entity);
4193 if (initializer->kind == INITIALIZER_VALUE) {
4194 initializer_value_t *initializer_value = &initializer->value;
4196 ir_node *value = expression_to_firm(initializer_value->value);
4197 type = skip_typeref(type);
4198 assign_value(dbgi, addr, type, value);
4202 if (is_constant_initializer(initializer) == EXPR_CLASS_VARIABLE) {
4203 ir_initializer_t *irinitializer
4204 = create_ir_initializer(initializer, type);
4206 create_dynamic_initializer(irinitializer, dbgi, entity);
4210 /* create a "template" entity which is copied to the entity on the stack */
4211 ir_entity *const init_entity
4212 = create_initializer_entity(dbgi, initializer, type);
4213 ir_node *const src_addr = create_symconst(dbgi, init_entity);
4214 ir_type *const irtype = get_ir_type(type);
4215 ir_node *const copyb = new_d_CopyB(dbgi, memory, addr, src_addr, irtype);
4217 ir_node *const copyb_mem = new_Proj(copyb, mode_M, pn_CopyB_M);
4218 set_store(copyb_mem);
4221 static void create_initializer_local_variable_entity(entity_t *entity)
4223 assert(entity->kind == ENTITY_VARIABLE);
4224 initializer_t *initializer = entity->variable.initializer;
4225 dbg_info *dbgi = get_dbg_info(&entity->base.source_position);
4226 ir_entity *irentity = entity->variable.v.entity;
4227 type_t *type = entity->declaration.type;
4229 create_local_initializer(initializer, dbgi, irentity, type);
4232 static void create_variable_initializer(entity_t *entity)
4234 assert(entity->kind == ENTITY_VARIABLE);
4235 initializer_t *initializer = entity->variable.initializer;
4236 if (initializer == NULL)
4239 declaration_kind_t declaration_kind
4240 = (declaration_kind_t) entity->declaration.kind;
4241 if (declaration_kind == DECLARATION_KIND_LOCAL_VARIABLE_ENTITY) {
4242 create_initializer_local_variable_entity(entity);
4246 type_t *type = entity->declaration.type;
4247 type_qualifiers_t tq = get_type_qualifier(type, true);
4249 if (initializer->kind == INITIALIZER_VALUE) {
4250 expression_t * value = initializer->value.value;
4251 type_t *const init_type = skip_typeref(value->base.type);
4253 if (!is_type_scalar(init_type)) {
4255 while (value->kind == EXPR_UNARY_CAST)
4256 value = value->unary.value;
4258 if (value->kind != EXPR_COMPOUND_LITERAL)
4259 panic("expected non-scalar initializer to be a compound literal");
4260 initializer = value->compound_literal.initializer;
4261 goto have_initializer;
4264 ir_node * node = expression_to_firm(value);
4265 dbg_info *const dbgi = get_dbg_info(&entity->base.source_position);
4266 ir_mode *const mode = get_ir_mode_storage(init_type);
4267 node = create_conv(dbgi, node, mode);
4268 node = do_strict_conv(dbgi, node);
4270 if (declaration_kind == DECLARATION_KIND_LOCAL_VARIABLE) {
4271 set_value(entity->variable.v.value_number, node);
4273 assert(declaration_kind == DECLARATION_KIND_GLOBAL_VARIABLE);
4275 ir_entity *irentity = entity->variable.v.entity;
4277 if (tq & TYPE_QUALIFIER_CONST
4278 && get_entity_owner(irentity) != get_tls_type()) {
4279 add_entity_linkage(irentity, IR_LINKAGE_CONSTANT);
4281 set_atomic_ent_value(irentity, node);
4285 assert(declaration_kind == DECLARATION_KIND_LOCAL_VARIABLE_ENTITY ||
4286 declaration_kind == DECLARATION_KIND_GLOBAL_VARIABLE);
4288 ir_entity *irentity = entity->variable.v.entity;
4289 ir_initializer_t *irinitializer
4290 = create_ir_initializer(initializer, type);
4292 if (tq & TYPE_QUALIFIER_CONST) {
4293 add_entity_linkage(irentity, IR_LINKAGE_CONSTANT);
4295 set_entity_initializer(irentity, irinitializer);
4299 static void create_variable_length_array(entity_t *entity)
4301 assert(entity->kind == ENTITY_VARIABLE);
4302 assert(entity->variable.initializer == NULL);
4304 entity->declaration.kind = DECLARATION_KIND_VARIABLE_LENGTH_ARRAY;
4305 entity->variable.v.vla_base = NULL;
4307 /* TODO: record VLA somewhere so we create the free node when we leave
4311 static void allocate_variable_length_array(entity_t *entity)
4313 assert(entity->kind == ENTITY_VARIABLE);
4314 assert(entity->variable.initializer == NULL);
4315 assert(currently_reachable());
4317 dbg_info *dbgi = get_dbg_info(&entity->base.source_position);
4318 type_t *type = entity->declaration.type;
4319 ir_type *el_type = get_ir_type(type->array.element_type);
4321 /* make sure size_node is calculated */
4322 get_type_size_node(type);
4323 ir_node *elems = type->array.size_node;
4324 ir_node *mem = get_store();
4325 ir_node *alloc = new_d_Alloc(dbgi, mem, elems, el_type, stack_alloc);
4327 ir_node *proj_m = new_d_Proj(dbgi, alloc, mode_M, pn_Alloc_M);
4328 ir_node *addr = new_d_Proj(dbgi, alloc, mode_P_data, pn_Alloc_res);
4331 assert(entity->declaration.kind == DECLARATION_KIND_VARIABLE_LENGTH_ARRAY);
4332 entity->variable.v.vla_base = addr;
4336 * Creates a Firm local variable from a declaration.
4338 static void create_local_variable(entity_t *entity)
4340 assert(entity->kind == ENTITY_VARIABLE);
4341 assert(entity->declaration.kind == DECLARATION_KIND_UNKNOWN);
4343 bool needs_entity = entity->variable.address_taken;
4344 type_t *type = skip_typeref(entity->declaration.type);
4346 /* is it a variable length array? */
4347 if (is_type_array(type) && !type->array.size_constant) {
4348 create_variable_length_array(entity);
4350 } else if (is_type_array(type) || is_type_compound(type)) {
4351 needs_entity = true;
4352 } else if (type->base.qualifiers & TYPE_QUALIFIER_VOLATILE) {
4353 needs_entity = true;
4357 ir_type *frame_type = get_irg_frame_type(current_ir_graph);
4358 create_variable_entity(entity,
4359 DECLARATION_KIND_LOCAL_VARIABLE_ENTITY,
4362 entity->declaration.kind = DECLARATION_KIND_LOCAL_VARIABLE;
4363 entity->variable.v.value_number = next_value_number_function;
4364 set_irg_loc_description(current_ir_graph, next_value_number_function,
4366 ++next_value_number_function;
4370 static void create_local_static_variable(entity_t *entity)
4372 assert(entity->kind == ENTITY_VARIABLE);
4373 assert(entity->declaration.kind == DECLARATION_KIND_UNKNOWN);
4375 type_t *type = skip_typeref(entity->declaration.type);
4376 ir_type *const var_type = entity->variable.thread_local ?
4377 get_tls_type() : get_glob_type();
4378 ir_type *const irtype = get_ir_type(type);
4379 dbg_info *const dbgi = get_dbg_info(&entity->base.source_position);
4381 size_t l = strlen(entity->base.symbol->string);
4382 char buf[l + sizeof(".%u")];
4383 snprintf(buf, sizeof(buf), "%s.%%u", entity->base.symbol->string);
4384 ident *const id = id_unique(buf);
4385 ir_entity *const irentity = new_d_entity(var_type, id, irtype, dbgi);
4387 if (type->base.qualifiers & TYPE_QUALIFIER_VOLATILE) {
4388 set_entity_volatility(irentity, volatility_is_volatile);
4391 entity->declaration.kind = DECLARATION_KIND_GLOBAL_VARIABLE;
4392 entity->variable.v.entity = irentity;
4394 set_entity_ld_ident(irentity, id);
4395 set_entity_visibility(irentity, ir_visibility_local);
4397 if (entity->variable.initializer == NULL) {
4398 ir_initializer_t *null_init = get_initializer_null();
4399 set_entity_initializer(irentity, null_init);
4402 ir_graph *const old_current_ir_graph = current_ir_graph;
4403 current_ir_graph = get_const_code_irg();
4405 create_variable_initializer(entity);
4407 assert(current_ir_graph == get_const_code_irg());
4408 current_ir_graph = old_current_ir_graph;
4413 static ir_node *return_statement_to_firm(return_statement_t *statement)
4415 if (!currently_reachable())
4418 dbg_info *const dbgi = get_dbg_info(&statement->base.source_position);
4419 type_t *const type = skip_typeref(current_function_entity->declaration.type->function.return_type);
4420 ir_node * res = statement->value ? expression_to_firm(statement->value) : NULL;
4423 if (!is_type_void(type)) {
4424 ir_mode *const mode = get_ir_mode_storage(type);
4426 res = create_conv(dbgi, res, mode);
4427 res = do_strict_conv(dbgi, res);
4429 res = new_Unknown(mode);
4436 ir_node *const in[1] = { res };
4437 ir_node *const store = get_store();
4438 ir_node *const ret = new_d_Return(dbgi, store, in_len, in);
4440 ir_node *end_block = get_irg_end_block(current_ir_graph);
4441 add_immBlock_pred(end_block, ret);
4443 set_unreachable_now();
4447 static ir_node *expression_statement_to_firm(expression_statement_t *statement)
4449 if (!currently_reachable())
4452 return expression_to_firm(statement->expression);
4455 static void create_local_declarations(entity_t*);
4457 static ir_node *compound_statement_to_firm(compound_statement_t *compound)
4459 create_local_declarations(compound->scope.entities);
4461 ir_node *result = NULL;
4462 statement_t *statement = compound->statements;
4463 for ( ; statement != NULL; statement = statement->base.next) {
4464 result = statement_to_firm(statement);
4470 static void create_global_variable(entity_t *entity)
4472 ir_linkage linkage = IR_LINKAGE_DEFAULT;
4473 ir_visibility visibility = ir_visibility_external;
4474 storage_class_tag_t storage
4475 = (storage_class_tag_t)entity->declaration.storage_class;
4476 decl_modifiers_t modifiers = entity->declaration.modifiers;
4477 assert(entity->kind == ENTITY_VARIABLE);
4480 case STORAGE_CLASS_EXTERN: visibility = ir_visibility_external; break;
4481 case STORAGE_CLASS_STATIC: visibility = ir_visibility_local; break;
4482 case STORAGE_CLASS_NONE: visibility = ir_visibility_external; break;
4483 case STORAGE_CLASS_TYPEDEF:
4484 case STORAGE_CLASS_AUTO:
4485 case STORAGE_CLASS_REGISTER:
4486 panic("invalid storage class for global var");
4489 /* "common" symbols */
4490 if (storage == STORAGE_CLASS_NONE
4491 && entity->variable.initializer == NULL
4492 && !entity->variable.thread_local
4493 && (modifiers & DM_WEAK) == 0) {
4494 linkage |= IR_LINKAGE_MERGE;
4497 ir_type *var_type = get_glob_type();
4498 if (entity->variable.thread_local) {
4499 var_type = get_tls_type();
4501 create_variable_entity(entity, DECLARATION_KIND_GLOBAL_VARIABLE, var_type);
4502 ir_entity *irentity = entity->variable.v.entity;
4503 add_entity_linkage(irentity, linkage);
4504 set_entity_visibility(irentity, visibility);
4505 if (entity->variable.initializer == NULL
4506 && storage != STORAGE_CLASS_EXTERN) {
4507 ir_initializer_t *null_init = get_initializer_null();
4508 set_entity_initializer(irentity, null_init);
4512 static void create_local_declaration(entity_t *entity)
4514 assert(is_declaration(entity));
4516 /* construct type */
4517 (void) get_ir_type(entity->declaration.type);
4518 if (entity->base.symbol == NULL) {
4522 switch ((storage_class_tag_t) entity->declaration.storage_class) {
4523 case STORAGE_CLASS_STATIC:
4524 if (entity->kind == ENTITY_FUNCTION) {
4525 (void)get_function_entity(entity, NULL);
4527 create_local_static_variable(entity);
4530 case STORAGE_CLASS_EXTERN:
4531 if (entity->kind == ENTITY_FUNCTION) {
4532 assert(entity->function.statement == NULL);
4533 (void)get_function_entity(entity, NULL);
4535 create_global_variable(entity);
4536 create_variable_initializer(entity);
4539 case STORAGE_CLASS_NONE:
4540 case STORAGE_CLASS_AUTO:
4541 case STORAGE_CLASS_REGISTER:
4542 if (entity->kind == ENTITY_FUNCTION) {
4543 if (entity->function.statement != NULL) {
4544 ir_type *owner = get_irg_frame_type(current_ir_graph);
4545 (void)get_function_entity(entity, owner);
4546 entity->declaration.kind = DECLARATION_KIND_INNER_FUNCTION;
4547 enqueue_inner_function(entity);
4549 (void)get_function_entity(entity, NULL);
4552 create_local_variable(entity);
4555 case STORAGE_CLASS_TYPEDEF:
4558 panic("invalid storage class found");
4561 static void create_local_declarations(entity_t *e)
4563 for (; e; e = e->base.next) {
4564 if (is_declaration(e))
4565 create_local_declaration(e);
4569 static void initialize_local_declaration(entity_t *entity)
4571 if (entity->base.symbol == NULL)
4574 // no need to emit code in dead blocks
4575 if (entity->declaration.storage_class != STORAGE_CLASS_STATIC
4576 && !currently_reachable())
4579 switch ((declaration_kind_t) entity->declaration.kind) {
4580 case DECLARATION_KIND_LOCAL_VARIABLE:
4581 case DECLARATION_KIND_LOCAL_VARIABLE_ENTITY:
4582 create_variable_initializer(entity);
4585 case DECLARATION_KIND_VARIABLE_LENGTH_ARRAY:
4586 allocate_variable_length_array(entity);
4589 case DECLARATION_KIND_COMPOUND_MEMBER:
4590 case DECLARATION_KIND_GLOBAL_VARIABLE:
4591 case DECLARATION_KIND_FUNCTION:
4592 case DECLARATION_KIND_INNER_FUNCTION:
4595 case DECLARATION_KIND_PARAMETER:
4596 case DECLARATION_KIND_PARAMETER_ENTITY:
4597 panic("can't initialize parameters");
4599 case DECLARATION_KIND_UNKNOWN:
4600 panic("can't initialize unknown declaration");
4602 panic("invalid declaration kind");
4605 static ir_node *declaration_statement_to_firm(declaration_statement_t *statement)
4607 entity_t *entity = statement->declarations_begin;
4611 entity_t *const last = statement->declarations_end;
4612 for ( ;; entity = entity->base.next) {
4613 if (is_declaration(entity)) {
4614 initialize_local_declaration(entity);
4615 } else if (entity->kind == ENTITY_TYPEDEF) {
4616 /* ยง6.7.7:3 Any array size expressions associated with variable length
4617 * array declarators are evaluated each time the declaration of the
4618 * typedef name is reached in the order of execution. */
4619 type_t *const type = skip_typeref(entity->typedefe.type);
4620 if (is_type_array(type) && type->array.is_vla)
4621 get_vla_size(&type->array);
4630 static ir_node *if_statement_to_firm(if_statement_t *statement)
4632 create_local_declarations(statement->scope.entities);
4634 /* Create the condition. */
4635 ir_node *true_block = NULL;
4636 ir_node *false_block = NULL;
4637 if (currently_reachable()) {
4638 true_block = new_immBlock();
4639 false_block = new_immBlock();
4640 create_condition_evaluation(statement->condition, true_block, false_block);
4641 mature_immBlock(true_block);
4642 mature_immBlock(false_block);
4645 /* Create the true statement. */
4646 set_cur_block(true_block);
4647 statement_to_firm(statement->true_statement);
4648 ir_node *fallthrough_block = get_cur_block();
4650 /* Create the false statement. */
4651 set_cur_block(false_block);
4652 if (statement->false_statement != NULL) {
4653 statement_to_firm(statement->false_statement);
4656 /* Handle the block after the if-statement. Minor simplification and
4657 * optimisation: Reuse the false/true block as fallthrough block, if the
4658 * true/false statement does not pass control to the fallthrough block, e.g.
4659 * in the typical if (x) return; pattern. */
4660 if (fallthrough_block) {
4661 if (currently_reachable()) {
4662 ir_node *const t_jump = new_r_Jmp(fallthrough_block);
4663 ir_node *const f_jump = new_Jmp();
4664 ir_node *const in[] = { t_jump, f_jump };
4665 fallthrough_block = new_Block(2, in);
4667 set_cur_block(fallthrough_block);
4674 * Add an unconditional jump to the target block. If the source block is not
4675 * reachable, then a Bad predecessor is created to prevent Phi-less unreachable
4676 * loops. This is necessary if the jump potentially enters a loop.
4678 static void jump_to(ir_node *const target_block)
4680 ir_node *const pred = currently_reachable() ? new_Jmp() : new_Bad(mode_X);
4681 add_immBlock_pred(target_block, pred);
4685 * Add an unconditional jump to the target block, if the current block is
4686 * reachable and do nothing otherwise. This is only valid if the jump does not
4687 * enter a loop (a back edge is ok).
4689 static void jump_if_reachable(ir_node *const target_block)
4691 if (currently_reachable())
4692 add_immBlock_pred(target_block, new_Jmp());
4695 static ir_node *while_statement_to_firm(while_statement_t *statement)
4697 create_local_declarations(statement->scope.entities);
4699 /* Create the header block */
4700 ir_node *const header_block = new_immBlock();
4701 jump_to(header_block);
4703 /* Create the condition. */
4704 ir_node * body_block;
4705 ir_node * false_block;
4706 expression_t *const cond = statement->condition;
4707 if (is_constant_expression(cond) == EXPR_CLASS_CONSTANT &&
4708 fold_constant_to_bool(cond)) {
4709 /* Shortcut for while (true). */
4710 body_block = header_block;
4713 keep_alive(header_block);
4714 keep_all_memory(header_block);
4716 body_block = new_immBlock();
4717 false_block = new_immBlock();
4719 set_cur_block(header_block);
4720 create_condition_evaluation(cond, body_block, false_block);
4721 mature_immBlock(body_block);
4724 ir_node *const old_continue_label = continue_label;
4725 ir_node *const old_break_label = break_label;
4726 continue_label = header_block;
4727 break_label = false_block;
4729 /* Create the loop body. */
4730 set_cur_block(body_block);
4731 statement_to_firm(statement->body);
4732 jump_if_reachable(header_block);
4734 mature_immBlock(header_block);
4735 assert(false_block == NULL || false_block == break_label);
4736 false_block = break_label;
4737 if (false_block != NULL) {
4738 mature_immBlock(false_block);
4740 set_cur_block(false_block);
4742 assert(continue_label == header_block);
4743 continue_label = old_continue_label;
4744 break_label = old_break_label;
4748 static ir_node *get_break_label(void)
4750 if (break_label == NULL) {
4751 break_label = new_immBlock();
4756 static ir_node *do_while_statement_to_firm(do_while_statement_t *statement)
4758 create_local_declarations(statement->scope.entities);
4760 /* create the header block */
4761 ir_node *header_block = new_immBlock();
4764 ir_node *body_block = new_immBlock();
4765 jump_to(body_block);
4767 ir_node *old_continue_label = continue_label;
4768 ir_node *old_break_label = break_label;
4769 continue_label = header_block;
4772 set_cur_block(body_block);
4773 statement_to_firm(statement->body);
4774 ir_node *const false_block = get_break_label();
4776 assert(continue_label == header_block);
4777 continue_label = old_continue_label;
4778 break_label = old_break_label;
4780 jump_if_reachable(header_block);
4782 /* create the condition */
4783 mature_immBlock(header_block);
4784 set_cur_block(header_block);
4786 create_condition_evaluation(statement->condition, body_block, false_block);
4787 mature_immBlock(body_block);
4788 mature_immBlock(false_block);
4790 set_cur_block(false_block);
4794 static ir_node *for_statement_to_firm(for_statement_t *statement)
4796 create_local_declarations(statement->scope.entities);
4798 if (currently_reachable()) {
4799 entity_t *entity = statement->scope.entities;
4800 for ( ; entity != NULL; entity = entity->base.next) {
4801 if (!is_declaration(entity))
4804 initialize_local_declaration(entity);
4807 if (statement->initialisation != NULL) {
4808 expression_to_firm(statement->initialisation);
4812 /* Create the header block */
4813 ir_node *const header_block = new_immBlock();
4814 jump_to(header_block);
4816 /* Create the condition. */
4817 ir_node *body_block;
4818 ir_node *false_block;
4819 if (statement->condition != NULL) {
4820 body_block = new_immBlock();
4821 false_block = new_immBlock();
4823 set_cur_block(header_block);
4824 create_condition_evaluation(statement->condition, body_block, false_block);
4825 mature_immBlock(body_block);
4828 body_block = header_block;
4831 keep_alive(header_block);
4832 keep_all_memory(header_block);
4835 /* Create the step block, if necessary. */
4836 ir_node * step_block = header_block;
4837 expression_t *const step = statement->step;
4839 step_block = new_immBlock();
4842 ir_node *const old_continue_label = continue_label;
4843 ir_node *const old_break_label = break_label;
4844 continue_label = step_block;
4845 break_label = false_block;
4847 /* Create the loop body. */
4848 set_cur_block(body_block);
4849 statement_to_firm(statement->body);
4850 jump_if_reachable(step_block);
4852 /* Create the step code. */
4854 mature_immBlock(step_block);
4855 set_cur_block(step_block);
4856 expression_to_firm(step);
4857 jump_if_reachable(header_block);
4860 mature_immBlock(header_block);
4861 assert(false_block == NULL || false_block == break_label);
4862 false_block = break_label;
4863 if (false_block != NULL) {
4864 mature_immBlock(false_block);
4866 set_cur_block(false_block);
4868 assert(continue_label == step_block);
4869 continue_label = old_continue_label;
4870 break_label = old_break_label;
4874 static ir_node *create_jump_statement(const statement_t *statement, ir_node *target_block)
4876 if (!currently_reachable())
4879 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
4880 ir_node *jump = new_d_Jmp(dbgi);
4881 add_immBlock_pred(target_block, jump);
4883 set_unreachable_now();
4887 static ir_switch_table *create_switch_table(const switch_statement_t *statement)
4889 /* determine number of cases */
4891 for (case_label_statement_t *l = statement->first_case; l != NULL;
4894 if (l->expression == NULL)
4896 if (l->is_empty_range)
4901 ir_switch_table *res = ir_new_switch_table(current_ir_graph, n_cases);
4903 for (case_label_statement_t *l = statement->first_case; l != NULL;
4905 if (l->expression == NULL) {
4906 l->pn = pn_Switch_default;
4909 if (l->is_empty_range)
4911 ir_tarval *min = fold_constant_to_tarval(l->expression);
4912 ir_tarval *max = min;
4913 long pn = (long) i+1;
4914 if (l->end_range != NULL)
4915 max = fold_constant_to_tarval(l->end_range);
4916 ir_switch_table_set(res, i++, min, max, pn);
4922 static ir_node *switch_statement_to_firm(switch_statement_t *statement)
4924 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
4925 ir_node *switch_node = NULL;
4927 if (currently_reachable()) {
4928 ir_node *expression = expression_to_firm(statement->expression);
4929 ir_switch_table *table = create_switch_table(statement);
4930 unsigned n_outs = (unsigned)ir_switch_table_get_n_entries(table) + 1;
4932 switch_node = new_d_Switch(dbgi, expression, n_outs, table);
4935 set_unreachable_now();
4937 ir_node *const old_switch = current_switch;
4938 ir_node *const old_break_label = break_label;
4939 const bool old_saw_default_label = saw_default_label;
4940 saw_default_label = false;
4941 current_switch = switch_node;
4944 statement_to_firm(statement->body);
4946 if (currently_reachable()) {
4947 add_immBlock_pred(get_break_label(), new_Jmp());
4950 if (!saw_default_label && switch_node) {
4951 ir_node *proj = new_d_Proj(dbgi, switch_node, mode_X, pn_Switch_default);
4952 add_immBlock_pred(get_break_label(), proj);
4955 if (break_label != NULL) {
4956 mature_immBlock(break_label);
4958 set_cur_block(break_label);
4960 assert(current_switch == switch_node);
4961 current_switch = old_switch;
4962 break_label = old_break_label;
4963 saw_default_label = old_saw_default_label;
4967 static ir_node *case_label_to_firm(const case_label_statement_t *statement)
4969 if (statement->is_empty_range)
4972 if (current_switch != NULL) {
4973 ir_node *block = new_immBlock();
4974 /* Fallthrough from previous case */
4975 jump_if_reachable(block);
4977 ir_node *const proj = new_Proj(current_switch, mode_X, statement->pn);
4978 add_immBlock_pred(block, proj);
4979 if (statement->expression == NULL)
4980 saw_default_label = true;
4982 mature_immBlock(block);
4983 set_cur_block(block);
4986 return statement_to_firm(statement->statement);
4989 static ir_node *label_to_firm(const label_statement_t *statement)
4991 ir_node *block = get_label_block(statement->label);
4994 set_cur_block(block);
4996 keep_all_memory(block);
4998 return statement_to_firm(statement->statement);
5001 static ir_node *computed_goto_to_firm(computed_goto_statement_t const *const statement)
5003 if (!currently_reachable())
5006 ir_node *const irn = expression_to_firm(statement->expression);
5007 dbg_info *const dbgi = get_dbg_info(&statement->base.source_position);
5008 ir_node *const ijmp = new_d_IJmp(dbgi, irn);
5010 set_irn_link(ijmp, ijmp_list);
5013 set_unreachable_now();
5017 static ir_node *asm_statement_to_firm(const asm_statement_t *statement)
5019 bool needs_memory = false;
5021 if (statement->is_volatile) {
5022 needs_memory = true;
5025 size_t n_clobbers = 0;
5026 asm_clobber_t *clobber = statement->clobbers;
5027 for ( ; clobber != NULL; clobber = clobber->next) {
5028 const char *clobber_str = clobber->clobber.begin;
5030 if (!be_is_valid_clobber(clobber_str)) {
5031 errorf(&statement->base.source_position,
5032 "invalid clobber '%s' specified", clobber->clobber);
5036 if (streq(clobber_str, "memory")) {
5037 needs_memory = true;
5041 ident *id = new_id_from_str(clobber_str);
5042 obstack_ptr_grow(&asm_obst, id);
5045 assert(obstack_object_size(&asm_obst) == n_clobbers * sizeof(ident*));
5046 ident **clobbers = NULL;
5047 if (n_clobbers > 0) {
5048 clobbers = obstack_finish(&asm_obst);
5051 size_t n_inputs = 0;
5052 asm_argument_t *argument = statement->inputs;
5053 for ( ; argument != NULL; argument = argument->next)
5055 size_t n_outputs = 0;
5056 argument = statement->outputs;
5057 for ( ; argument != NULL; argument = argument->next)
5060 unsigned next_pos = 0;
5062 ir_node *ins[n_inputs + n_outputs + 1];
5065 ir_asm_constraint tmp_in_constraints[n_outputs];
5067 const expression_t *out_exprs[n_outputs];
5068 ir_node *out_addrs[n_outputs];
5069 size_t out_size = 0;
5071 argument = statement->outputs;
5072 for ( ; argument != NULL; argument = argument->next) {
5073 const char *constraints = argument->constraints.begin;
5074 asm_constraint_flags_t asm_flags
5075 = be_parse_asm_constraints(constraints);
5078 source_position_t const *const pos = &statement->base.source_position;
5079 if (asm_flags & ASM_CONSTRAINT_FLAG_NO_SUPPORT) {
5080 warningf(WARN_OTHER, pos, "some constraints in '%s' are not supported", constraints);
5082 if (asm_flags & ASM_CONSTRAINT_FLAG_INVALID) {
5083 errorf(pos, "some constraints in '%s' are invalid", constraints);
5086 if (! (asm_flags & ASM_CONSTRAINT_FLAG_MODIFIER_WRITE)) {
5087 errorf(pos, "no write flag specified for output constraints '%s'", constraints);
5092 unsigned pos = next_pos++;
5093 if ( (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE)
5094 || (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER) ) {
5095 expression_t *expr = argument->expression;
5096 ir_node *addr = expression_to_addr(expr);
5097 /* in+output, construct an artifical same_as constraint on the
5099 if (asm_flags & ASM_CONSTRAINT_FLAG_MODIFIER_READ) {
5101 ir_node *value = get_value_from_lvalue(expr, addr);
5103 snprintf(buf, sizeof(buf), "%u", (unsigned) out_size);
5105 ir_asm_constraint constraint;
5106 constraint.pos = pos;
5107 constraint.constraint = new_id_from_str(buf);
5108 constraint.mode = get_ir_mode_storage(expr->base.type);
5109 tmp_in_constraints[in_size] = constraint;
5110 ins[in_size] = value;
5115 out_exprs[out_size] = expr;
5116 out_addrs[out_size] = addr;
5118 } else if (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP) {
5119 /* pure memory ops need no input (but we have to make sure we
5120 * attach to the memory) */
5121 assert(! (asm_flags &
5122 (ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE
5123 | ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER)));
5124 needs_memory = true;
5126 /* we need to attach the address to the inputs */
5127 expression_t *expr = argument->expression;
5129 ir_asm_constraint constraint;
5130 constraint.pos = pos;
5131 constraint.constraint = new_id_from_str(constraints);
5132 constraint.mode = mode_M;
5133 tmp_in_constraints[in_size] = constraint;
5135 ins[in_size] = expression_to_addr(expr);
5139 errorf(&statement->base.source_position,
5140 "only modifiers but no place set in constraints '%s'",
5145 ir_asm_constraint constraint;
5146 constraint.pos = pos;
5147 constraint.constraint = new_id_from_str(constraints);
5148 constraint.mode = get_ir_mode_storage(argument->expression->base.type);
5150 obstack_grow(&asm_obst, &constraint, sizeof(constraint));
5152 assert(obstack_object_size(&asm_obst)
5153 == out_size * sizeof(ir_asm_constraint));
5154 ir_asm_constraint *output_constraints = obstack_finish(&asm_obst);
5157 obstack_grow(&asm_obst, tmp_in_constraints,
5158 in_size * sizeof(tmp_in_constraints[0]));
5159 /* find and count input and output arguments */
5160 argument = statement->inputs;
5161 for ( ; argument != NULL; argument = argument->next) {
5162 const char *constraints = argument->constraints.begin;
5163 asm_constraint_flags_t asm_flags
5164 = be_parse_asm_constraints(constraints);
5166 if (asm_flags & ASM_CONSTRAINT_FLAG_NO_SUPPORT) {
5167 errorf(&statement->base.source_position,
5168 "some constraints in '%s' are not supported", constraints);
5171 if (asm_flags & ASM_CONSTRAINT_FLAG_INVALID) {
5172 errorf(&statement->base.source_position,
5173 "some constraints in '%s' are invalid", constraints);
5176 if (asm_flags & ASM_CONSTRAINT_FLAG_MODIFIER_WRITE) {
5177 errorf(&statement->base.source_position,
5178 "write flag specified for input constraints '%s'",
5184 if ( (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE)
5185 || (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER) ) {
5186 /* we can treat this as "normal" input */
5187 input = expression_to_firm(argument->expression);
5188 } else if (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP) {
5189 /* pure memory ops need no input (but we have to make sure we
5190 * attach to the memory) */
5191 assert(! (asm_flags &
5192 (ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE
5193 | ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER)));
5194 needs_memory = true;
5195 input = expression_to_addr(argument->expression);
5197 errorf(&statement->base.source_position,
5198 "only modifiers but no place set in constraints '%s'",
5203 ir_asm_constraint constraint;
5204 constraint.pos = next_pos++;
5205 constraint.constraint = new_id_from_str(constraints);
5206 constraint.mode = get_irn_mode(input);
5208 obstack_grow(&asm_obst, &constraint, sizeof(constraint));
5209 ins[in_size++] = input;
5213 ir_asm_constraint constraint;
5214 constraint.pos = next_pos++;
5215 constraint.constraint = new_id_from_str("");
5216 constraint.mode = mode_M;
5218 obstack_grow(&asm_obst, &constraint, sizeof(constraint));
5219 ins[in_size++] = get_store();
5222 assert(obstack_object_size(&asm_obst)
5223 == in_size * sizeof(ir_asm_constraint));
5224 ir_asm_constraint *input_constraints = obstack_finish(&asm_obst);
5226 /* create asm node */
5227 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
5229 ident *asm_text = new_id_from_str(statement->asm_text.begin);
5231 ir_node *node = new_d_ASM(dbgi, in_size, ins, input_constraints,
5232 out_size, output_constraints,
5233 n_clobbers, clobbers, asm_text);
5235 if (statement->is_volatile) {
5236 set_irn_pinned(node, op_pin_state_pinned);
5238 set_irn_pinned(node, op_pin_state_floats);
5241 /* create output projs & connect them */
5243 ir_node *projm = new_Proj(node, mode_M, out_size);
5248 for (i = 0; i < out_size; ++i) {
5249 const expression_t *out_expr = out_exprs[i];
5251 ir_mode *mode = get_ir_mode_storage(out_expr->base.type);
5252 ir_node *proj = new_Proj(node, mode, pn);
5253 ir_node *addr = out_addrs[i];
5255 set_value_for_expression_addr(out_expr, proj, addr);
5261 static ir_node *ms_try_statement_to_firm(ms_try_statement_t *statement)
5263 statement_to_firm(statement->try_statement);
5264 source_position_t const *const pos = &statement->base.source_position;
5265 warningf(WARN_OTHER, pos, "structured exception handling ignored");
5269 static ir_node *leave_statement_to_firm(leave_statement_t *statement)
5271 errorf(&statement->base.source_position, "__leave not supported yet");
5276 * Transform a statement.
5278 static ir_node *statement_to_firm(statement_t *const stmt)
5281 assert(!stmt->base.transformed);
5282 stmt->base.transformed = true;
5285 switch (stmt->kind) {
5286 case STATEMENT_ASM: return asm_statement_to_firm( &stmt->asms);
5287 case STATEMENT_CASE_LABEL: return case_label_to_firm( &stmt->case_label);
5288 case STATEMENT_COMPOUND: return compound_statement_to_firm( &stmt->compound);
5289 case STATEMENT_COMPUTED_GOTO: return computed_goto_to_firm( &stmt->computed_goto);
5290 case STATEMENT_DECLARATION: return declaration_statement_to_firm(&stmt->declaration);
5291 case STATEMENT_DO_WHILE: return do_while_statement_to_firm( &stmt->do_while);
5292 case STATEMENT_EMPTY: return NULL; /* nothing */
5293 case STATEMENT_EXPRESSION: return expression_statement_to_firm( &stmt->expression);
5294 case STATEMENT_FOR: return for_statement_to_firm( &stmt->fors);
5295 case STATEMENT_IF: return if_statement_to_firm( &stmt->ifs);
5296 case STATEMENT_LABEL: return label_to_firm( &stmt->label);
5297 case STATEMENT_LEAVE: return leave_statement_to_firm( &stmt->leave);
5298 case STATEMENT_MS_TRY: return ms_try_statement_to_firm( &stmt->ms_try);
5299 case STATEMENT_RETURN: return return_statement_to_firm( &stmt->returns);
5300 case STATEMENT_SWITCH: return switch_statement_to_firm( &stmt->switchs);
5301 case STATEMENT_WHILE: return while_statement_to_firm( &stmt->whiles);
5303 case STATEMENT_BREAK: return create_jump_statement(stmt, get_break_label());
5304 case STATEMENT_CONTINUE: return create_jump_statement(stmt, continue_label);
5305 case STATEMENT_GOTO: return create_jump_statement(stmt, get_label_block(stmt->gotos.label));
5307 case STATEMENT_ERROR: panic("error statement found");
5309 panic("statement not implemented");
5312 static int count_local_variables(const entity_t *entity,
5313 const entity_t *const last)
5316 entity_t const *const end = last != NULL ? last->base.next : NULL;
5317 for (; entity != end; entity = entity->base.next) {
5321 if (entity->kind == ENTITY_VARIABLE) {
5322 type = skip_typeref(entity->declaration.type);
5323 address_taken = entity->variable.address_taken;
5324 } else if (entity->kind == ENTITY_PARAMETER) {
5325 type = skip_typeref(entity->declaration.type);
5326 address_taken = entity->parameter.address_taken;
5331 if (!address_taken && is_type_scalar(type))
5337 static void count_local_variables_in_stmt(statement_t *stmt, void *const env)
5339 int *const count = env;
5341 switch (stmt->kind) {
5342 case STATEMENT_DECLARATION: {
5343 const declaration_statement_t *const decl_stmt = &stmt->declaration;
5344 *count += count_local_variables(decl_stmt->declarations_begin,
5345 decl_stmt->declarations_end);
5350 *count += count_local_variables(stmt->fors.scope.entities, NULL);
5359 * Return the number of local (alias free) variables used by a function.
5361 static int get_function_n_local_vars(entity_t *entity)
5363 const function_t *function = &entity->function;
5366 /* count parameters */
5367 count += count_local_variables(function->parameters.entities, NULL);
5369 /* count local variables declared in body */
5370 walk_statements(function->statement, count_local_variables_in_stmt, &count);
5375 * Build Firm code for the parameters of a function.
5377 static void initialize_function_parameters(entity_t *entity)
5379 assert(entity->kind == ENTITY_FUNCTION);
5380 ir_graph *irg = current_ir_graph;
5381 ir_node *args = get_irg_args(irg);
5383 ir_type *function_irtype;
5385 if (entity->function.need_closure) {
5386 /* add an extra parameter for the static link */
5387 entity->function.static_link = new_r_Proj(args, mode_P_data, 0);
5390 /* Matze: IMO this is wrong, nested functions should have an own
5391 * type and not rely on strange parameters... */
5392 function_irtype = create_method_type(&entity->declaration.type->function, true);
5394 function_irtype = get_ir_type(entity->declaration.type);
5399 entity_t *parameter = entity->function.parameters.entities;
5400 for ( ; parameter != NULL; parameter = parameter->base.next, ++n) {
5401 if (parameter->kind != ENTITY_PARAMETER)
5404 assert(parameter->declaration.kind == DECLARATION_KIND_UNKNOWN);
5405 type_t *type = skip_typeref(parameter->declaration.type);
5407 bool needs_entity = parameter->parameter.address_taken;
5408 assert(!is_type_array(type));
5409 if (is_type_compound(type)) {
5410 needs_entity = true;
5413 ir_type *param_irtype = get_method_param_type(function_irtype, n);
5415 ir_type *frame_type = get_irg_frame_type(irg);
5417 = new_parameter_entity(frame_type, n, param_irtype);
5418 parameter->declaration.kind
5419 = DECLARATION_KIND_PARAMETER_ENTITY;
5420 parameter->parameter.v.entity = param;
5424 ir_mode *param_mode = get_type_mode(param_irtype);
5426 ir_node *value = new_r_Proj(args, param_mode, pn);
5428 ir_mode *mode = get_ir_mode_storage(type);
5429 value = create_conv(NULL, value, mode);
5430 value = do_strict_conv(NULL, value);
5432 parameter->declaration.kind = DECLARATION_KIND_PARAMETER;
5433 parameter->parameter.v.value_number = next_value_number_function;
5434 set_irg_loc_description(current_ir_graph, next_value_number_function,
5436 ++next_value_number_function;
5438 set_value(parameter->parameter.v.value_number, value);
5443 * Handle additional decl modifiers for IR-graphs
5445 * @param irg the IR-graph
5446 * @param dec_modifiers additional modifiers
5448 static void handle_decl_modifier_irg(ir_graph *irg,
5449 decl_modifiers_t decl_modifiers)
5451 if (decl_modifiers & DM_NAKED) {
5452 /* TRUE if the declaration includes the Microsoft
5453 __declspec(naked) specifier. */
5454 add_irg_additional_properties(irg, mtp_property_naked);
5456 if (decl_modifiers & DM_FORCEINLINE) {
5457 /* TRUE if the declaration includes the
5458 Microsoft __forceinline specifier. */
5459 set_irg_inline_property(irg, irg_inline_forced);
5461 if (decl_modifiers & DM_NOINLINE) {
5462 /* TRUE if the declaration includes the Microsoft
5463 __declspec(noinline) specifier. */
5464 set_irg_inline_property(irg, irg_inline_forbidden);
5468 static void add_function_pointer(ir_type *segment, ir_entity *method,
5469 const char *unique_template)
5471 ir_type *method_type = get_entity_type(method);
5472 ir_type *ptr_type = new_type_pointer(method_type);
5474 /* these entities don't really have a name but firm only allows
5476 * Note that we mustn't give these entities a name since for example
5477 * Mach-O doesn't allow them. */
5478 ident *ide = id_unique(unique_template);
5479 ir_entity *ptr = new_entity(segment, ide, ptr_type);
5480 ir_graph *irg = get_const_code_irg();
5481 ir_node *val = new_rd_SymConst_addr_ent(NULL, irg, mode_P_code,
5484 set_entity_ld_ident(ptr, new_id_from_chars("", 0));
5485 set_entity_compiler_generated(ptr, 1);
5486 set_entity_visibility(ptr, ir_visibility_private);
5487 add_entity_linkage(ptr, IR_LINKAGE_CONSTANT|IR_LINKAGE_HIDDEN_USER);
5488 set_atomic_ent_value(ptr, val);
5492 * Generate possible IJmp branches to a given label block.
5494 static void gen_ijmp_branches(ir_node *block)
5497 for (ijmp = ijmp_list; ijmp != NULL; ijmp = get_irn_link(ijmp)) {
5498 add_immBlock_pred(block, ijmp);
5503 * Create code for a function and all inner functions.
5505 * @param entity the function entity
5507 static void create_function(entity_t *entity)
5509 assert(entity->kind == ENTITY_FUNCTION);
5510 ir_entity *function_entity = get_function_entity(entity, current_outer_frame);
5512 if (entity->function.statement == NULL)
5515 inner_functions = NULL;
5516 current_trampolines = NULL;
5518 if (entity->declaration.modifiers & DM_CONSTRUCTOR) {
5519 ir_type *segment = get_segment_type(IR_SEGMENT_CONSTRUCTORS);
5520 add_function_pointer(segment, function_entity, "constructor_ptr.%u");
5522 if (entity->declaration.modifiers & DM_DESTRUCTOR) {
5523 ir_type *segment = get_segment_type(IR_SEGMENT_DESTRUCTORS);
5524 add_function_pointer(segment, function_entity, "destructor_ptr.%u");
5527 current_function_entity = entity;
5528 current_function_name = NULL;
5529 current_funcsig = NULL;
5531 assert(all_labels == NULL);
5532 all_labels = NEW_ARR_F(label_t *, 0);
5535 int n_local_vars = get_function_n_local_vars(entity);
5536 ir_graph *irg = new_ir_graph(function_entity, n_local_vars);
5537 current_ir_graph = irg;
5539 ir_graph *old_current_function = current_function;
5540 current_function = irg;
5542 ir_entity *const old_current_vararg_entity = current_vararg_entity;
5543 current_vararg_entity = NULL;
5545 set_irg_fp_model(irg, firm_fp_model);
5546 tarval_enable_fp_ops(1);
5547 set_irn_dbg_info(get_irg_start_block(irg),
5548 get_entity_dbg_info(function_entity));
5550 /* set inline flags */
5551 if (entity->function.is_inline)
5552 set_irg_inline_property(irg, irg_inline_recomended);
5553 handle_decl_modifier_irg(irg, entity->declaration.modifiers);
5555 next_value_number_function = 0;
5556 initialize_function_parameters(entity);
5557 current_static_link = entity->function.static_link;
5559 statement_to_firm(entity->function.statement);
5561 ir_node *end_block = get_irg_end_block(irg);
5563 /* do we have a return statement yet? */
5564 if (currently_reachable()) {
5565 type_t *type = skip_typeref(entity->declaration.type);
5566 assert(is_type_function(type));
5567 type_t *const return_type = skip_typeref(type->function.return_type);
5570 if (is_type_void(return_type)) {
5571 ret = new_Return(get_store(), 0, NULL);
5573 ir_mode *const mode = get_ir_mode_storage(return_type);
5576 /* ยง5.1.2.2.3 main implicitly returns 0 */
5577 if (is_main(entity)) {
5578 in[0] = new_Const(get_mode_null(mode));
5580 in[0] = new_Unknown(mode);
5582 ret = new_Return(get_store(), 1, in);
5584 add_immBlock_pred(end_block, ret);
5587 for (int i = ARR_LEN(all_labels) - 1; i >= 0; --i) {
5588 label_t *label = all_labels[i];
5589 if (label->address_taken) {
5590 gen_ijmp_branches(label->block);
5592 mature_immBlock(label->block);
5595 DEL_ARR_F(all_labels);
5598 irg_finalize_cons(irg);
5600 /* finalize the frame type */
5601 ir_type *frame_type = get_irg_frame_type(irg);
5602 int n = get_compound_n_members(frame_type);
5605 for (int i = 0; i < n; ++i) {
5606 ir_entity *member = get_compound_member(frame_type, i);
5607 ir_type *entity_type = get_entity_type(member);
5609 int align = get_type_alignment_bytes(entity_type);
5610 if (align > align_all)
5614 misalign = offset % align;
5616 offset += align - misalign;
5620 set_entity_offset(member, offset);
5621 offset += get_type_size_bytes(entity_type);
5623 set_type_size_bytes(frame_type, offset);
5624 set_type_alignment_bytes(frame_type, align_all);
5626 irg_verify(irg, VERIFY_ENFORCE_SSA);
5627 current_vararg_entity = old_current_vararg_entity;
5628 current_function = old_current_function;
5630 if (current_trampolines != NULL) {
5631 DEL_ARR_F(current_trampolines);
5632 current_trampolines = NULL;
5635 /* create inner functions if any */
5636 entity_t **inner = inner_functions;
5637 if (inner != NULL) {
5638 ir_type *rem_outer_frame = current_outer_frame;
5639 current_outer_frame = get_irg_frame_type(current_ir_graph);
5640 for (int i = ARR_LEN(inner) - 1; i >= 0; --i) {
5641 create_function(inner[i]);
5645 current_outer_frame = rem_outer_frame;
5649 static void scope_to_firm(scope_t *scope)
5651 /* first pass: create declarations */
5652 entity_t *entity = scope->entities;
5653 for ( ; entity != NULL; entity = entity->base.next) {
5654 if (entity->base.symbol == NULL)
5657 if (entity->kind == ENTITY_FUNCTION) {
5658 if (entity->function.btk != BUILTIN_NONE) {
5659 /* builtins have no representation */
5662 (void)get_function_entity(entity, NULL);
5663 } else if (entity->kind == ENTITY_VARIABLE) {
5664 create_global_variable(entity);
5665 } else if (entity->kind == ENTITY_NAMESPACE) {
5666 scope_to_firm(&entity->namespacee.members);
5670 /* second pass: create code/initializers */
5671 entity = scope->entities;
5672 for ( ; entity != NULL; entity = entity->base.next) {
5673 if (entity->base.symbol == NULL)
5676 if (entity->kind == ENTITY_FUNCTION) {
5677 if (entity->function.btk != BUILTIN_NONE) {
5678 /* builtins have no representation */
5681 create_function(entity);
5682 } else if (entity->kind == ENTITY_VARIABLE) {
5683 assert(entity->declaration.kind
5684 == DECLARATION_KIND_GLOBAL_VARIABLE);
5685 current_ir_graph = get_const_code_irg();
5686 create_variable_initializer(entity);
5691 void init_ast2firm(void)
5693 obstack_init(&asm_obst);
5694 init_atomic_modes();
5696 ir_set_debug_retrieve(dbg_retrieve);
5697 ir_set_type_debug_retrieve(dbg_print_type_dbg_info);
5699 /* create idents for all known runtime functions */
5700 for (size_t i = 0; i < lengthof(rts_data); ++i) {
5701 rts_idents[i] = new_id_from_str(rts_data[i].name);
5704 entitymap_init(&entitymap);
5707 static void init_ir_types(void)
5709 static int ir_types_initialized = 0;
5710 if (ir_types_initialized)
5712 ir_types_initialized = 1;
5714 ir_type_char = get_ir_type(type_char);
5715 ir_type_const_char = get_ir_type(type_const_char);
5716 ir_type_wchar_t = get_ir_type(type_wchar_t);
5718 be_params = be_get_backend_param();
5719 mode_float_arithmetic = be_params->mode_float_arithmetic;
5721 stack_param_align = be_params->stack_param_align;
5724 void exit_ast2firm(void)
5726 entitymap_destroy(&entitymap);
5727 obstack_free(&asm_obst, NULL);
5730 static void global_asm_to_firm(statement_t *s)
5732 for (; s != NULL; s = s->base.next) {
5733 assert(s->kind == STATEMENT_ASM);
5735 char const *const text = s->asms.asm_text.begin;
5736 size_t size = s->asms.asm_text.size;
5738 /* skip the last \0 */
5739 if (text[size - 1] == '\0')
5742 ident *const id = new_id_from_chars(text, size);
5747 static const char *get_cwd(void)
5749 static char buf[1024];
5751 getcwd(buf, sizeof(buf));
5755 void translation_unit_to_firm(translation_unit_t *unit)
5757 if (c_mode & _CXX) {
5758 be_dwarf_set_source_language(DW_LANG_C_plus_plus);
5759 } else if (c_mode & _C99) {
5760 be_dwarf_set_source_language(DW_LANG_C99);
5761 } else if (c_mode & _C89) {
5762 be_dwarf_set_source_language(DW_LANG_C89);
5764 be_dwarf_set_source_language(DW_LANG_C);
5766 be_dwarf_set_compilation_directory(get_cwd());
5768 /* initialize firm arithmetic */
5769 tarval_set_integer_overflow_mode(TV_OVERFLOW_WRAP);
5770 ir_set_uninitialized_local_variable_func(uninitialized_local_var);
5772 /* just to be sure */
5773 continue_label = NULL;
5775 current_switch = NULL;
5776 current_translation_unit = unit;
5780 scope_to_firm(&unit->scope);
5781 global_asm_to_firm(unit->global_asm);
5783 current_ir_graph = NULL;
5784 current_translation_unit = NULL;