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
27 #include <libfirm/firm.h>
28 #include <libfirm/adt/obst.h>
29 #include <libfirm/be.h>
33 #include "adt/error.h"
34 #include "adt/array.h"
35 #include "adt/strutil.h"
43 #include "diagnostic.h"
44 #include "lang_features.h"
46 #include "type_hash.h"
51 #include "entitymap_t.h"
52 #include "driver/firm_opt.h"
54 typedef struct trampoline_region trampoline_region;
55 struct trampoline_region {
56 ir_entity *function; /**< The function that is called by this trampoline */
57 ir_entity *region; /**< created region for the trampoline */
60 fp_model_t firm_fp_model = fp_model_precise;
62 static const backend_params *be_params;
64 static ir_type *ir_type_char;
65 static ir_type *ir_type_const_char;
66 static ir_type *ir_type_wchar_t;
67 static ir_type *ir_type_void;
68 static ir_type *ir_type_int;
70 /* architecture specific floating point arithmetic mode (if any) */
71 static ir_mode *mode_float_arithmetic;
73 /* alignment of stack parameters */
74 static unsigned stack_param_align;
76 static int next_value_number_function;
77 static ir_node *continue_label;
78 static ir_node *break_label;
79 static ir_node *current_switch;
80 static bool saw_default_label;
81 static label_t **all_labels;
82 static entity_t **inner_functions;
83 static ir_node *ijmp_list;
84 static bool constant_folding;
86 static const entity_t *current_function_entity;
87 static ir_node *current_function_name;
88 static ir_node *current_funcsig;
89 static ir_graph *current_function;
90 static translation_unit_t *current_translation_unit;
91 static trampoline_region *current_trampolines;
92 static ir_type *current_outer_frame;
93 static ir_node *current_static_link;
94 static ir_entity *current_vararg_entity;
96 static entitymap_t entitymap;
98 static struct obstack asm_obst;
100 typedef enum declaration_kind_t {
101 DECLARATION_KIND_UNKNOWN,
102 DECLARATION_KIND_VARIABLE_LENGTH_ARRAY,
103 DECLARATION_KIND_GLOBAL_VARIABLE,
104 DECLARATION_KIND_LOCAL_VARIABLE,
105 DECLARATION_KIND_LOCAL_VARIABLE_ENTITY,
106 DECLARATION_KIND_PARAMETER,
107 DECLARATION_KIND_PARAMETER_ENTITY,
108 DECLARATION_KIND_FUNCTION,
109 DECLARATION_KIND_COMPOUND_MEMBER,
110 DECLARATION_KIND_INNER_FUNCTION
111 } declaration_kind_t;
113 static ir_type *get_ir_type_incomplete(type_t *type);
115 static void enqueue_inner_function(entity_t *entity)
117 if (inner_functions == NULL)
118 inner_functions = NEW_ARR_F(entity_t *, 0);
119 ARR_APP1(entity_t*, inner_functions, entity);
122 static ir_node *uninitialized_local_var(ir_graph *irg, ir_mode *mode, int pos)
124 const entity_t *entity = get_irg_loc_description(irg, pos);
126 if (entity != NULL) {
127 source_position_t const *const pos = &entity->base.source_position;
128 warningf(WARN_UNINITIALIZED, pos, "'%N' might be used uninitialized", entity);
130 return new_r_Unknown(irg, mode);
133 static const char *dbg_retrieve(const dbg_info *dbg, unsigned *line)
135 const source_position_t *pos = (const source_position_t*) dbg;
140 return pos->input_name;
143 static dbg_info *get_dbg_info(const source_position_t *pos)
145 return (dbg_info*) pos;
148 static void dbg_print_type_dbg_info(char *buffer, size_t buffer_size,
149 const type_dbg_info *dbg)
152 print_to_buffer(buffer, buffer_size);
153 const type_t *type = (const type_t*) dbg;
155 finish_print_to_buffer();
158 static type_dbg_info *get_type_dbg_info_(const type_t *type)
160 return (type_dbg_info*) type;
163 /* is the current block a reachable one? */
164 static bool currently_reachable(void)
166 ir_node *const block = get_cur_block();
167 return block != NULL && !is_Bad(block);
170 static void set_unreachable_now(void)
175 ir_mode *atomic_modes[ATOMIC_TYPE_LAST+1];
177 static ir_node *_expression_to_firm(const expression_t *expression);
178 static ir_node *expression_to_firm(const expression_t *expression);
179 static void create_local_declaration(entity_t *entity);
181 static unsigned decide_modulo_shift(unsigned type_size)
183 if (architecture_modulo_shift == 0)
185 if (type_size < architecture_modulo_shift)
186 return architecture_modulo_shift;
190 static ir_mode *init_atomic_ir_mode(atomic_type_kind_t kind)
192 unsigned flags = get_atomic_type_flags(kind);
193 unsigned size = get_atomic_type_size(kind);
194 if ((flags & ATOMIC_TYPE_FLAG_FLOAT)
195 && !(flags & ATOMIC_TYPE_FLAG_COMPLEX)) {
198 } else if (size == 8) {
201 panic("unexpected kind");
203 } else if (flags & ATOMIC_TYPE_FLAG_INTEGER) {
205 unsigned bit_size = size * 8;
206 bool is_signed = (flags & ATOMIC_TYPE_FLAG_SIGNED) != 0;
207 unsigned modulo_shift = decide_modulo_shift(bit_size);
209 snprintf(name, sizeof(name), "%s%u", is_signed ? "I" : "U", bit_size);
210 return new_int_mode(name, irma_twos_complement, bit_size, is_signed,
218 * Initialises the atomic modes depending on the machine size.
220 static void init_atomic_modes(void)
222 atomic_modes[ATOMIC_TYPE_VOID] = mode_ANY;
223 for (int i = 0; i <= ATOMIC_TYPE_LAST; ++i) {
224 if (atomic_modes[i] != NULL)
226 atomic_modes[i] = init_atomic_ir_mode((atomic_type_kind_t) i);
230 ir_mode *get_atomic_mode(atomic_type_kind_t kind)
232 assert(kind <= ATOMIC_TYPE_LAST);
233 return atomic_modes[kind];
236 static ir_node *get_vla_size(array_type_t *const type)
238 ir_node *size_node = type->size_node;
239 if (size_node == NULL) {
240 size_node = expression_to_firm(type->size_expression);
241 type->size_node = size_node;
246 static unsigned count_parameters(const function_type_t *function_type)
250 function_parameter_t *parameter = function_type->parameters;
251 for ( ; parameter != NULL; parameter = parameter->next) {
259 * Creates a Firm type for an atomic type
261 static ir_type *create_atomic_type(atomic_type_kind_t akind, const type_t *type)
263 ir_mode *mode = atomic_modes[akind];
264 type_dbg_info *dbgi = get_type_dbg_info_(type);
265 ir_type *irtype = new_d_type_primitive(mode, dbgi);
266 il_alignment_t alignment = get_atomic_type_alignment(akind);
268 set_type_size_bytes(irtype, get_atomic_type_size(akind));
269 set_type_alignment_bytes(irtype, alignment);
275 * Creates a Firm type for a complex type
277 static ir_type *create_complex_type(const atomic_type_t *type)
279 atomic_type_kind_t kind = type->akind;
280 ir_mode *mode = atomic_modes[kind];
281 ident *id = get_mode_ident(mode);
285 /* FIXME: finish the array */
290 * Creates a Firm type for an imaginary type
292 static ir_type *create_imaginary_type(const atomic_type_t *type)
294 return create_atomic_type(type->akind, (const type_t*)type);
298 * return type of a parameter (and take transparent union gnu extension into
301 static type_t *get_parameter_type(type_t *orig_type)
303 type_t *type = skip_typeref(orig_type);
304 if (is_type_union(type)
305 && get_type_modifiers(orig_type) & DM_TRANSPARENT_UNION) {
306 compound_t *compound = type->compound.compound;
307 type = compound->members.entities->declaration.type;
313 static ir_type *create_method_type(const function_type_t *function_type, bool for_closure)
315 type_t *return_type = skip_typeref(function_type->return_type);
317 int n_parameters = count_parameters(function_type)
318 + (for_closure ? 1 : 0);
319 int n_results = return_type == type_void ? 0 : 1;
320 type_dbg_info *dbgi = get_type_dbg_info_((const type_t*) function_type);
321 ir_type *irtype = new_d_type_method(n_parameters, n_results, dbgi);
323 if (return_type != type_void) {
324 ir_type *restype = get_ir_type(return_type);
325 set_method_res_type(irtype, 0, restype);
328 function_parameter_t *parameter = function_type->parameters;
331 ir_type *p_irtype = get_ir_type(type_void_ptr);
332 set_method_param_type(irtype, n, p_irtype);
335 for ( ; parameter != NULL; parameter = parameter->next) {
336 type_t *type = get_parameter_type(parameter->type);
337 ir_type *p_irtype = get_ir_type(type);
338 set_method_param_type(irtype, n, p_irtype);
342 bool is_variadic = function_type->variadic;
345 set_method_variadicity(irtype, variadicity_variadic);
347 unsigned cc = get_method_calling_convention(irtype);
348 switch (function_type->calling_convention) {
349 case CC_DEFAULT: /* unspecified calling convention, equal to one of the other, typically cdecl */
352 set_method_calling_convention(irtype, SET_CDECL(cc));
359 /* only non-variadic function can use stdcall, else use cdecl */
360 set_method_calling_convention(irtype, SET_STDCALL(cc));
366 /* only non-variadic function can use fastcall, else use cdecl */
367 set_method_calling_convention(irtype, SET_FASTCALL(cc));
371 /* Hmm, leave default, not accepted by the parser yet. */
376 set_method_calling_convention(irtype, get_method_calling_convention(irtype) | cc_this_call);
378 const decl_modifiers_t modifiers = function_type->modifiers;
379 if (modifiers & DM_CONST)
380 add_method_additional_properties(irtype, mtp_property_const);
381 if (modifiers & DM_PURE)
382 add_method_additional_properties(irtype, mtp_property_pure);
383 if (modifiers & DM_RETURNS_TWICE)
384 add_method_additional_properties(irtype, mtp_property_returns_twice);
385 if (modifiers & DM_NORETURN)
386 add_method_additional_properties(irtype, mtp_property_noreturn);
387 if (modifiers & DM_NOTHROW)
388 add_method_additional_properties(irtype, mtp_property_nothrow);
389 if (modifiers & DM_MALLOC)
390 add_method_additional_properties(irtype, mtp_property_malloc);
395 static ir_type *create_pointer_type(pointer_type_t *type)
397 type_dbg_info *dbgi = get_type_dbg_info_((const type_t*) type);
398 type_t *points_to = type->points_to;
399 ir_type *ir_points_to = get_ir_type_incomplete(points_to);
400 ir_type *irtype = new_d_type_pointer(ir_points_to, dbgi);
405 static ir_type *create_reference_type(reference_type_t *type)
407 type_dbg_info *dbgi = get_type_dbg_info_((const type_t*) type);
408 type_t *refers_to = type->refers_to;
409 ir_type *ir_refers_to = get_ir_type_incomplete(refers_to);
410 ir_type *irtype = new_d_type_pointer(ir_refers_to, dbgi);
415 static ir_type *create_array_type(array_type_t *type)
417 type_dbg_info *dbgi = get_type_dbg_info_((const type_t*) type);
418 type_t *element_type = type->element_type;
419 ir_type *ir_element_type = get_ir_type(element_type);
420 ir_type *irtype = new_d_type_array(1, ir_element_type, dbgi);
422 const int align = get_type_alignment_bytes(ir_element_type);
423 set_type_alignment_bytes(irtype, align);
425 if (type->size_constant) {
426 int n_elements = type->size;
428 set_array_bounds_int(irtype, 0, 0, n_elements);
430 size_t elemsize = get_type_size_bytes(ir_element_type);
431 if (elemsize % align > 0) {
432 elemsize += align - (elemsize % align);
434 set_type_size_bytes(irtype, n_elements * elemsize);
436 set_array_lower_bound_int(irtype, 0, 0);
438 set_type_state(irtype, layout_fixed);
444 * Return the signed integer type of size bits.
446 * @param size the size
448 static ir_type *get_signed_int_type_for_bit_size(ir_type *base_tp,
452 static ir_mode *s_modes[64 + 1] = {NULL, };
456 if (size <= 0 || size > 64)
459 mode = s_modes[size];
463 snprintf(name, sizeof(name), "bf_I%u", size);
464 mode = new_int_mode(name, irma_twos_complement, size, 1, 0);
465 s_modes[size] = mode;
468 type_dbg_info *dbgi = get_type_dbg_info_(type);
469 res = new_d_type_primitive(mode, dbgi);
470 set_primitive_base_type(res, base_tp);
476 * Return the unsigned integer type of size bits.
478 * @param size the size
480 static ir_type *get_unsigned_int_type_for_bit_size(ir_type *base_tp,
484 static ir_mode *u_modes[64 + 1] = {NULL, };
488 if (size <= 0 || size > 64)
491 mode = u_modes[size];
495 snprintf(name, sizeof(name), "bf_U%u", size);
496 mode = new_int_mode(name, irma_twos_complement, size, 0, 0);
497 u_modes[size] = mode;
500 type_dbg_info *dbgi = get_type_dbg_info_(type);
501 res = new_d_type_primitive(mode, dbgi);
502 set_primitive_base_type(res, base_tp);
507 static ir_type *create_bitfield_type(const entity_t *entity)
509 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
510 type_t *base = skip_typeref(entity->declaration.type);
511 assert(base->kind == TYPE_ATOMIC || base->kind == TYPE_ENUM);
512 ir_type *irbase = get_ir_type(base);
514 unsigned bit_size = entity->compound_member.bit_size;
516 assert(!is_type_float(base));
517 if (is_type_signed(base)) {
518 return get_signed_int_type_for_bit_size(irbase, bit_size, base);
520 return get_unsigned_int_type_for_bit_size(irbase, bit_size, base);
524 #define INVALID_TYPE ((ir_type*)-1)
527 COMPOUND_IS_STRUCT = false,
528 COMPOUND_IS_UNION = true
532 * Construct firm type from ast struct type.
534 static ir_type *create_compound_type(compound_type_t *type,
535 bool incomplete, bool is_union)
537 compound_t *compound = type->compound;
539 if (compound->irtype != NULL && (compound->irtype_complete || incomplete)) {
540 return compound->irtype;
543 symbol_t *type_symbol = compound->base.symbol;
545 if (type_symbol != NULL) {
546 id = new_id_from_str(type_symbol->string);
549 id = id_unique("__anonymous_union.%u");
551 id = id_unique("__anonymous_struct.%u");
557 irtype = new_type_union(id);
559 irtype = new_type_struct(id);
562 compound->irtype_complete = false;
563 compound->irtype = irtype;
569 layout_union_type(type);
571 layout_struct_type(type);
574 compound->irtype_complete = true;
576 entity_t *entry = compound->members.entities;
577 for ( ; entry != NULL; entry = entry->base.next) {
578 if (entry->kind != ENTITY_COMPOUND_MEMBER)
581 symbol_t *symbol = entry->base.symbol;
582 type_t *entry_type = entry->declaration.type;
584 if (symbol == NULL) {
585 /* anonymous bitfield member, skip */
586 if (entry->compound_member.bitfield)
588 assert(entry_type->kind == TYPE_COMPOUND_STRUCT
589 || entry_type->kind == TYPE_COMPOUND_UNION);
590 ident = id_unique("anon.%u");
592 ident = new_id_from_str(symbol->string);
595 dbg_info *dbgi = get_dbg_info(&entry->base.source_position);
597 ir_type *entry_irtype;
598 if (entry->compound_member.bitfield) {
599 entry_irtype = create_bitfield_type(entry);
601 entry_irtype = get_ir_type(entry_type);
603 ir_entity *entity = new_d_entity(irtype, ident, entry_irtype, dbgi);
605 set_entity_offset(entity, entry->compound_member.offset);
606 set_entity_offset_bits_remainder(entity,
607 entry->compound_member.bit_offset);
609 assert(entry->declaration.kind == DECLARATION_KIND_UNKNOWN);
610 entry->declaration.kind = DECLARATION_KIND_COMPOUND_MEMBER;
611 entry->compound_member.entity = entity;
614 set_type_alignment_bytes(irtype, compound->alignment);
615 set_type_size_bytes(irtype, compound->size);
616 set_type_state(irtype, layout_fixed);
621 static void determine_enum_values(enum_type_t *const type)
623 ir_mode *const mode = atomic_modes[type->base.akind];
624 ir_tarval *const one = get_mode_one(mode);
625 ir_tarval * tv_next = get_mode_null(mode);
627 bool constant_folding_old = constant_folding;
628 constant_folding = true;
630 enum_t *enume = type->enume;
631 entity_t *entry = enume->base.next;
632 for (; entry != NULL; entry = entry->base.next) {
633 if (entry->kind != ENTITY_ENUM_VALUE)
636 expression_t *const init = entry->enum_value.value;
638 ir_node *const cnst = expression_to_firm(init);
639 if (!is_Const(cnst)) {
640 panic("couldn't fold constant");
642 tv_next = get_Const_tarval(cnst);
644 assert(entry->enum_value.tv == NULL || entry->enum_value.tv == tv_next);
645 entry->enum_value.tv = tv_next;
646 tv_next = tarval_add(tv_next, one);
649 constant_folding = constant_folding_old;
652 static ir_type *create_enum_type(enum_type_t *const type)
654 return create_atomic_type(type->base.akind, (const type_t*) type);
657 static ir_type *get_ir_type_incomplete(type_t *type)
659 assert(type != NULL);
660 type = skip_typeref(type);
662 if (type->base.firm_type != NULL) {
663 assert(type->base.firm_type != INVALID_TYPE);
664 return type->base.firm_type;
667 switch (type->kind) {
668 case TYPE_COMPOUND_STRUCT:
669 return create_compound_type(&type->compound, true, COMPOUND_IS_STRUCT);
670 case TYPE_COMPOUND_UNION:
671 return create_compound_type(&type->compound, true, COMPOUND_IS_UNION);
673 return get_ir_type(type);
677 ir_type *get_ir_type(type_t *type)
679 assert(type != NULL);
681 type = skip_typeref(type);
683 if (type->base.firm_type != NULL) {
684 assert(type->base.firm_type != INVALID_TYPE);
685 return type->base.firm_type;
688 ir_type *firm_type = NULL;
689 switch (type->kind) {
691 /* Happens while constant folding, when there was an error */
692 return create_atomic_type(ATOMIC_TYPE_VOID, NULL);
695 firm_type = create_atomic_type(type->atomic.akind, type);
698 firm_type = create_complex_type(&type->atomic);
701 firm_type = create_imaginary_type(&type->atomic);
704 firm_type = create_method_type(&type->function, false);
707 firm_type = create_pointer_type(&type->pointer);
710 firm_type = create_reference_type(&type->reference);
713 firm_type = create_array_type(&type->array);
715 case TYPE_COMPOUND_STRUCT:
716 firm_type = create_compound_type(&type->compound, false, COMPOUND_IS_STRUCT);
718 case TYPE_COMPOUND_UNION:
719 firm_type = create_compound_type(&type->compound, false, COMPOUND_IS_UNION);
722 firm_type = create_enum_type(&type->enumt);
729 if (firm_type == NULL)
730 panic("unknown type found");
732 type->base.firm_type = firm_type;
736 static ir_mode *get_ir_mode_storage(type_t *type)
738 ir_type *irtype = get_ir_type(type);
740 /* firm doesn't report a mode for arrays somehow... */
741 if (is_Array_type(irtype)) {
745 ir_mode *mode = get_type_mode(irtype);
746 assert(mode != NULL);
751 * get arithmetic mode for a type. This is different from get_ir_mode_storage,
752 * int that it returns bigger modes for floating point on some platforms
753 * (x87 internally does arithemtic with 80bits)
755 static ir_mode *get_ir_mode_arithmetic(type_t *type)
757 ir_mode *mode = get_ir_mode_storage(type);
758 if (mode_is_float(mode) && mode_float_arithmetic != NULL) {
759 return mode_float_arithmetic;
766 * Return a node representing the size of a type.
768 static ir_node *get_type_size_node(type_t *type)
771 ir_mode *mode = get_ir_mode_arithmetic(type_size_t);
772 type = skip_typeref(type);
774 if (is_type_array(type) && type->array.is_vla) {
775 ir_node *size_node = get_vla_size(&type->array);
776 ir_node *elem_size = get_type_size_node(type->array.element_type);
777 ir_node *real_size = new_d_Mul(NULL, size_node, elem_size, mode);
781 size = get_type_size(type);
782 return new_Const_long(mode, size);
785 /** Names of the runtime functions. */
786 static const struct {
787 int id; /**< the rts id */
788 int n_res; /**< number of return values */
789 const char *name; /**< the name of the rts function */
790 int n_params; /**< number of parameters */
791 unsigned flags; /**< language flags */
793 { rts_debugbreak, 0, "__debugbreak", 0, _MS },
794 { rts_abort, 0, "abort", 0, _C89 },
795 { rts_alloca, 1, "alloca", 1, _ALL },
796 { rts_abs, 1, "abs", 1, _C89 },
797 { rts_labs, 1, "labs", 1, _C89 },
798 { rts_llabs, 1, "llabs", 1, _C99 },
799 { rts_imaxabs, 1, "imaxabs", 1, _C99 },
801 { rts_fabs, 1, "fabs", 1, _C89 },
802 { rts_sqrt, 1, "sqrt", 1, _C89 },
803 { rts_cbrt, 1, "cbrt", 1, _C99 },
804 { rts_exp, 1, "exp", 1, _C89 },
805 { rts_exp2, 1, "exp2", 1, _C89 },
806 { rts_exp10, 1, "exp10", 1, _GNUC },
807 { rts_log, 1, "log", 1, _C89 },
808 { rts_log2, 1, "log2", 1, _C89 },
809 { rts_log10, 1, "log10", 1, _C89 },
810 { rts_pow, 1, "pow", 2, _C89 },
811 { rts_sin, 1, "sin", 1, _C89 },
812 { rts_cos, 1, "cos", 1, _C89 },
813 { rts_tan, 1, "tan", 1, _C89 },
814 { rts_asin, 1, "asin", 1, _C89 },
815 { rts_acos, 1, "acos", 1, _C89 },
816 { rts_atan, 1, "atan", 1, _C89 },
817 { rts_sinh, 1, "sinh", 1, _C89 },
818 { rts_cosh, 1, "cosh", 1, _C89 },
819 { rts_tanh, 1, "tanh", 1, _C89 },
821 { rts_fabsf, 1, "fabsf", 1, _C99 },
822 { rts_sqrtf, 1, "sqrtf", 1, _C99 },
823 { rts_cbrtf, 1, "cbrtf", 1, _C99 },
824 { rts_expf, 1, "expf", 1, _C99 },
825 { rts_exp2f, 1, "exp2f", 1, _C99 },
826 { rts_exp10f, 1, "exp10f", 1, _GNUC },
827 { rts_logf, 1, "logf", 1, _C99 },
828 { rts_log2f, 1, "log2f", 1, _C99 },
829 { rts_log10f, 1, "log10f", 1, _C99 },
830 { rts_powf, 1, "powf", 2, _C99 },
831 { rts_sinf, 1, "sinf", 1, _C99 },
832 { rts_cosf, 1, "cosf", 1, _C99 },
833 { rts_tanf, 1, "tanf", 1, _C99 },
834 { rts_asinf, 1, "asinf", 1, _C99 },
835 { rts_acosf, 1, "acosf", 1, _C99 },
836 { rts_atanf, 1, "atanf", 1, _C99 },
837 { rts_sinhf, 1, "sinhf", 1, _C99 },
838 { rts_coshf, 1, "coshf", 1, _C99 },
839 { rts_tanhf, 1, "tanhf", 1, _C99 },
841 { rts_fabsl, 1, "fabsl", 1, _C99 },
842 { rts_sqrtl, 1, "sqrtl", 1, _C99 },
843 { rts_cbrtl, 1, "cbrtl", 1, _C99 },
844 { rts_expl, 1, "expl", 1, _C99 },
845 { rts_exp2l, 1, "exp2l", 1, _C99 },
846 { rts_exp10l, 1, "exp10l", 1, _GNUC },
847 { rts_logl, 1, "logl", 1, _C99 },
848 { rts_log2l, 1, "log2l", 1, _C99 },
849 { rts_log10l, 1, "log10l", 1, _C99 },
850 { rts_powl, 1, "powl", 2, _C99 },
851 { rts_sinl, 1, "sinl", 1, _C99 },
852 { rts_cosl, 1, "cosl", 1, _C99 },
853 { rts_tanl, 1, "tanl", 1, _C99 },
854 { rts_asinl, 1, "asinl", 1, _C99 },
855 { rts_acosl, 1, "acosl", 1, _C99 },
856 { rts_atanl, 1, "atanl", 1, _C99 },
857 { rts_sinhl, 1, "sinhl", 1, _C99 },
858 { rts_coshl, 1, "coshl", 1, _C99 },
859 { rts_tanhl, 1, "tanhl", 1, _C99 },
861 { rts_strcmp, 1, "strcmp", 2, _C89 },
862 { rts_strncmp, 1, "strncmp", 3, _C89 },
863 { rts_strcpy, 1, "strcpy", 2, _C89 },
864 { rts_strlen, 1, "strlen", 1, _C89 },
865 { rts_memcpy, 1, "memcpy", 3, _C89 },
866 { rts_mempcpy, 1, "mempcpy", 3, _GNUC },
867 { rts_memmove, 1, "memmove", 3, _C89 },
868 { rts_memset, 1, "memset", 3, _C89 },
869 { rts_memcmp, 1, "memcmp", 3, _C89 },
872 static ident *rts_idents[lengthof(rts_data)];
874 static create_ld_ident_func create_ld_ident = create_name_linux_elf;
876 void set_create_ld_ident(ident *(*func)(entity_t*))
878 create_ld_ident = func;
882 * Handle GNU attributes for entities
884 * @param ent the entity
885 * @param decl the routine declaration
887 static void handle_decl_modifiers(ir_entity *irentity, entity_t *entity)
889 assert(is_declaration(entity));
890 decl_modifiers_t modifiers = entity->declaration.modifiers;
892 if (is_method_entity(irentity)) {
893 if (modifiers & DM_PURE) {
894 set_entity_additional_properties(irentity, mtp_property_pure);
896 if (modifiers & DM_CONST) {
897 add_entity_additional_properties(irentity, mtp_property_const);
900 if (modifiers & DM_USED) {
901 add_entity_linkage(irentity, IR_LINKAGE_HIDDEN_USER);
903 if (modifiers & DM_WEAK) {
904 add_entity_linkage(irentity, IR_LINKAGE_WEAK);
908 static bool is_main(entity_t *entity)
910 static symbol_t *sym_main = NULL;
911 if (sym_main == NULL) {
912 sym_main = symbol_table_insert("main");
915 if (entity->base.symbol != sym_main)
917 /* must be in outermost scope */
918 if (entity->base.parent_scope != ¤t_translation_unit->scope)
925 * Creates an entity representing a function.
927 * @param entity the function declaration/definition
928 * @param owner_type the owner type of this function, NULL
929 * for global functions
931 static ir_entity *get_function_entity(entity_t *entity, ir_type *owner_type)
933 assert(entity->kind == ENTITY_FUNCTION);
934 if (entity->function.irentity != NULL)
935 return entity->function.irentity;
937 switch (entity->function.btk) {
940 case BUILTIN_LIBC_CHECK:
946 if (is_main(entity)) {
947 /* force main to C linkage */
948 type_t *type = entity->declaration.type;
949 assert(is_type_function(type));
950 if (type->function.linkage != LINKAGE_C) {
951 type_t *new_type = duplicate_type(type);
952 new_type->function.linkage = LINKAGE_C;
953 type = identify_new_type(new_type);
954 entity->declaration.type = type;
958 symbol_t *symbol = entity->base.symbol;
959 ident *id = new_id_from_str(symbol->string);
961 /* already an entity defined? */
962 ir_entity *irentity = entitymap_get(&entitymap, symbol);
963 bool const has_body = entity->function.statement != NULL;
964 if (irentity != NULL) {
965 if (get_entity_visibility(irentity) == ir_visibility_external
967 set_entity_visibility(irentity, ir_visibility_default);
972 ir_type *ir_type_method;
973 if (entity->function.need_closure)
974 ir_type_method = create_method_type(&entity->declaration.type->function, true);
976 ir_type_method = get_ir_type(entity->declaration.type);
978 bool nested_function = false;
979 if (owner_type == NULL)
980 owner_type = get_glob_type();
982 nested_function = true;
984 dbg_info *const dbgi = get_dbg_info(&entity->base.source_position);
985 irentity = new_d_entity(owner_type, id, ir_type_method, dbgi);
989 ld_id = id_unique("inner.%u");
991 ld_id = create_ld_ident(entity);
992 set_entity_ld_ident(irentity, ld_id);
994 handle_decl_modifiers(irentity, entity);
996 if (! nested_function) {
997 /* static inline => local
998 * extern inline => local
999 * inline without definition => local
1000 * inline with definition => external_visible */
1001 storage_class_tag_t const storage_class
1002 = (storage_class_tag_t) entity->declaration.storage_class;
1003 bool const is_inline = entity->function.is_inline;
1005 if (is_inline && storage_class == STORAGE_CLASS_NONE && has_body) {
1006 set_entity_visibility(irentity, ir_visibility_default);
1007 } else if (storage_class == STORAGE_CLASS_STATIC ||
1008 (is_inline && has_body)) {
1009 set_entity_visibility(irentity, ir_visibility_local);
1010 } else if (has_body) {
1011 set_entity_visibility(irentity, ir_visibility_default);
1013 set_entity_visibility(irentity, ir_visibility_external);
1016 /* nested functions are always local */
1017 set_entity_visibility(irentity, ir_visibility_local);
1020 /* We should check for file scope here, but as long as we compile C only
1021 this is not needed. */
1022 if (!freestanding && !has_body) {
1023 /* check for a known runtime function */
1024 for (size_t i = 0; i < lengthof(rts_data); ++i) {
1025 if (id != rts_idents[i])
1028 function_type_t *function_type
1029 = &entity->declaration.type->function;
1030 /* rts_entities code can't handle a "wrong" number of parameters */
1031 if (function_type->unspecified_parameters)
1034 /* check number of parameters */
1035 int n_params = count_parameters(function_type);
1036 if (n_params != rts_data[i].n_params)
1039 type_t *return_type = skip_typeref(function_type->return_type);
1040 int n_res = return_type != type_void ? 1 : 0;
1041 if (n_res != rts_data[i].n_res)
1044 /* ignore those rts functions not necessary needed for current mode */
1045 if ((c_mode & rts_data[i].flags) == 0)
1047 assert(rts_entities[rts_data[i].id] == NULL);
1048 rts_entities[rts_data[i].id] = irentity;
1052 entitymap_insert(&entitymap, symbol, irentity);
1055 entity->declaration.kind = DECLARATION_KIND_FUNCTION;
1056 entity->function.irentity = irentity;
1062 * Creates a SymConst for a given entity.
1064 * @param dbgi debug info
1065 * @param entity the entity
1067 static ir_node *create_symconst(dbg_info *dbgi, ir_entity *entity)
1069 assert(entity != NULL);
1070 union symconst_symbol sym;
1071 sym.entity_p = entity;
1072 return new_d_SymConst(dbgi, mode_P, sym, symconst_addr_ent);
1075 static ir_node *create_Const_from_bool(ir_mode *const mode, bool const v)
1077 return new_Const((v ? get_mode_one : get_mode_null)(mode));
1080 static ir_node *create_conv_from_b(dbg_info *dbgi, ir_node *value,
1083 if (is_Const(value)) {
1084 return create_Const_from_bool(dest_mode, !is_Const_null(value));
1087 ir_node *cond = new_d_Cond(dbgi, value);
1088 ir_node *proj_true = new_Proj(cond, mode_X, pn_Cond_true);
1089 ir_node *proj_false = new_Proj(cond, mode_X, pn_Cond_false);
1090 ir_node *tblock = new_Block(1, &proj_true);
1091 ir_node *fblock = new_Block(1, &proj_false);
1092 set_cur_block(tblock);
1093 ir_node *const1 = new_Const(get_mode_one(dest_mode));
1094 ir_node *tjump = new_Jmp();
1095 set_cur_block(fblock);
1096 ir_node *const0 = new_Const(get_mode_null(dest_mode));
1097 ir_node *fjump = new_Jmp();
1099 ir_node *in[2] = { tjump, fjump };
1100 ir_node *mergeblock = new_Block(2, in);
1101 set_cur_block(mergeblock);
1102 ir_node *phi_in[2] = { const1, const0 };
1103 ir_node *phi = new_Phi(2, phi_in, dest_mode);
1107 static ir_node *create_conv(dbg_info *dbgi, ir_node *value, ir_mode *dest_mode)
1109 ir_mode *value_mode = get_irn_mode(value);
1111 if (value_mode == dest_mode)
1114 if (dest_mode == mode_b) {
1115 ir_node *zero = new_Const(get_mode_null(value_mode));
1116 ir_node *cmp = new_d_Cmp(dbgi, value, zero, ir_relation_unordered_less_greater);
1118 } else if (value_mode == mode_b) {
1119 return create_conv_from_b(dbgi, value, dest_mode);
1122 return new_d_Conv(dbgi, value, dest_mode);
1126 * Creates a SymConst node representing a wide string literal.
1128 * @param literal the wide string literal
1130 static ir_node *wide_string_literal_to_firm(
1131 const string_literal_expression_t *literal)
1133 ir_type *const global_type = get_glob_type();
1134 ir_type *const elem_type = ir_type_wchar_t;
1135 dbg_info *const dbgi = get_dbg_info(&literal->base.source_position);
1136 ir_type *const type = new_type_array(1, elem_type);
1138 ident *const id = id_unique("str.%u");
1139 ir_entity *const entity = new_d_entity(global_type, id, type, dbgi);
1140 set_entity_ld_ident(entity, id);
1141 set_entity_visibility(entity, ir_visibility_private);
1142 add_entity_linkage(entity, IR_LINKAGE_CONSTANT);
1144 ir_mode *const mode = get_type_mode(elem_type);
1145 const size_t slen = wstrlen(&literal->value);
1147 set_array_lower_bound_int(type, 0, 0);
1148 set_array_upper_bound_int(type, 0, slen);
1149 set_type_size_bytes(type, slen * get_mode_size_bytes(mode));
1150 set_type_state(type, layout_fixed);
1152 ir_initializer_t *initializer = create_initializer_compound(slen);
1153 const char *p = literal->value.begin;
1154 for (size_t i = 0; i < slen; ++i) {
1155 assert(p < literal->value.begin + literal->value.size);
1156 utf32 v = read_utf8_char(&p);
1157 ir_tarval *tv = new_tarval_from_long(v, mode);
1158 ir_initializer_t *val = create_initializer_tarval(tv);
1159 set_initializer_compound_value(initializer, i, val);
1161 set_entity_initializer(entity, initializer);
1163 return create_symconst(dbgi, entity);
1167 * Creates a SymConst node representing a string constant.
1169 * @param src_pos the source position of the string constant
1170 * @param id_prefix a prefix for the name of the generated string constant
1171 * @param value the value of the string constant
1173 static ir_node *string_to_firm(const source_position_t *const src_pos,
1174 const char *const id_prefix,
1175 const string_t *const value)
1177 ir_type *const global_type = get_glob_type();
1178 dbg_info *const dbgi = get_dbg_info(src_pos);
1179 ir_type *const type = new_type_array(1, ir_type_const_char);
1181 ident *const id = id_unique(id_prefix);
1182 ir_entity *const entity = new_d_entity(global_type, id, type, dbgi);
1183 set_entity_ld_ident(entity, id);
1184 set_entity_visibility(entity, ir_visibility_private);
1185 add_entity_linkage(entity, IR_LINKAGE_CONSTANT);
1187 ir_type *const elem_type = ir_type_const_char;
1188 ir_mode *const mode = get_type_mode(elem_type);
1190 const char* const string = value->begin;
1191 const size_t slen = value->size;
1193 set_array_lower_bound_int(type, 0, 0);
1194 set_array_upper_bound_int(type, 0, slen);
1195 set_type_size_bytes(type, slen);
1196 set_type_state(type, layout_fixed);
1198 ir_initializer_t *initializer = create_initializer_compound(slen);
1199 for (size_t i = 0; i < slen; ++i) {
1200 ir_tarval *tv = new_tarval_from_long(string[i], mode);
1201 ir_initializer_t *val = create_initializer_tarval(tv);
1202 set_initializer_compound_value(initializer, i, val);
1204 set_entity_initializer(entity, initializer);
1206 return create_symconst(dbgi, entity);
1209 static bool try_create_integer(literal_expression_t *literal,
1210 type_t *type, unsigned char base)
1212 const char *string = literal->value.begin;
1213 size_t size = literal->value.size;
1215 assert(type->kind == TYPE_ATOMIC);
1216 atomic_type_kind_t akind = type->atomic.akind;
1218 ir_mode *mode = atomic_modes[akind];
1219 ir_tarval *tv = new_integer_tarval_from_str(string, size, 1, base, mode);
1220 if (tv == tarval_bad)
1223 literal->base.type = type;
1224 literal->target_value = tv;
1228 static void create_integer_tarval(literal_expression_t *literal)
1232 const string_t *suffix = &literal->suffix;
1234 if (suffix->size > 0) {
1235 for (const char *c = suffix->begin; *c != '\0'; ++c) {
1236 if (*c == 'u' || *c == 'U') { ++us; }
1237 if (*c == 'l' || *c == 'L') { ++ls; }
1242 switch (literal->base.kind) {
1243 case EXPR_LITERAL_INTEGER_OCTAL: base = 8; break;
1244 case EXPR_LITERAL_INTEGER: base = 10; break;
1245 case EXPR_LITERAL_INTEGER_HEXADECIMAL: base = 16; break;
1246 default: panic("invalid literal kind");
1249 tarval_int_overflow_mode_t old_mode = tarval_get_integer_overflow_mode();
1251 /* now try if the constant is small enough for some types */
1252 tarval_set_integer_overflow_mode(TV_OVERFLOW_BAD);
1254 if (us == 0 && try_create_integer(literal, type_int, base))
1256 if ((us == 1 || base != 10)
1257 && try_create_integer(literal, type_unsigned_int, base))
1261 if (us == 0 && try_create_integer(literal, type_long, base))
1263 if ((us == 1 || base != 10)
1264 && try_create_integer(literal, type_unsigned_long, base))
1267 /* last try? then we should not report tarval_bad */
1268 if (us != 1 && base == 10)
1269 tarval_set_integer_overflow_mode(TV_OVERFLOW_WRAP);
1270 if (us == 0 && try_create_integer(literal, type_long_long, base))
1274 assert(us == 1 || base != 10);
1275 tarval_set_integer_overflow_mode(TV_OVERFLOW_WRAP);
1276 bool res = try_create_integer(literal, type_unsigned_long_long, base);
1278 panic("internal error when parsing number literal");
1281 tarval_set_integer_overflow_mode(old_mode);
1284 void determine_literal_type(literal_expression_t *literal)
1286 switch (literal->base.kind) {
1287 case EXPR_LITERAL_INTEGER:
1288 case EXPR_LITERAL_INTEGER_OCTAL:
1289 case EXPR_LITERAL_INTEGER_HEXADECIMAL:
1290 create_integer_tarval(literal);
1298 * Creates a Const node representing a constant.
1300 static ir_node *literal_to_firm(const literal_expression_t *literal)
1302 type_t *type = skip_typeref(literal->base.type);
1303 ir_mode *mode = get_ir_mode_storage(type);
1304 const char *string = literal->value.begin;
1305 size_t size = literal->value.size;
1308 switch (literal->base.kind) {
1309 case EXPR_LITERAL_WIDE_CHARACTER: {
1310 utf32 v = read_utf8_char(&string);
1312 size_t len = snprintf(buf, sizeof(buf), UTF32_PRINTF_FORMAT, v);
1314 tv = new_tarval_from_str(buf, len, mode);
1317 case EXPR_LITERAL_CHARACTER: {
1320 = get_atomic_type_flags(ATOMIC_TYPE_CHAR) & ATOMIC_TYPE_FLAG_SIGNED;
1321 if (size == 1 && char_is_signed) {
1322 v = (signed char)string[0];
1325 for (size_t i = 0; i < size; ++i) {
1326 v = (v << 8) | ((unsigned char)string[i]);
1330 size_t len = snprintf(buf, sizeof(buf), "%lld", v);
1332 tv = new_tarval_from_str(buf, len, mode);
1335 case EXPR_LITERAL_INTEGER:
1336 case EXPR_LITERAL_INTEGER_OCTAL:
1337 case EXPR_LITERAL_INTEGER_HEXADECIMAL:
1338 assert(literal->target_value != NULL);
1339 tv = literal->target_value;
1341 case EXPR_LITERAL_FLOATINGPOINT:
1342 tv = new_tarval_from_str(string, size, mode);
1344 case EXPR_LITERAL_FLOATINGPOINT_HEXADECIMAL: {
1345 char buffer[size + 2];
1346 memcpy(buffer, "0x", 2);
1347 memcpy(buffer+2, string, size);
1348 tv = new_tarval_from_str(buffer, size+2, mode);
1351 case EXPR_LITERAL_BOOLEAN:
1352 if (string[0] == 't') {
1353 tv = get_mode_one(mode);
1355 assert(string[0] == 'f');
1356 tv = get_mode_null(mode);
1359 case EXPR_LITERAL_MS_NOOP:
1360 tv = get_mode_null(mode);
1365 panic("Invalid literal kind found");
1368 dbg_info *dbgi = get_dbg_info(&literal->base.source_position);
1369 ir_node *res = new_d_Const(dbgi, tv);
1370 ir_mode *mode_arith = get_ir_mode_arithmetic(type);
1371 return create_conv(dbgi, res, mode_arith);
1375 * Allocate an area of size bytes aligned at alignment
1378 static ir_entity *alloc_trampoline(ir_type *frame_type, int size, unsigned alignment)
1380 static unsigned area_cnt = 0;
1383 ir_type *tp = new_type_array(1, ir_type_char);
1384 set_array_bounds_int(tp, 0, 0, size);
1385 set_type_alignment_bytes(tp, alignment);
1387 snprintf(buf, sizeof(buf), "trampolin%u", area_cnt++);
1388 ident *name = new_id_from_str(buf);
1389 ir_entity *area = new_entity(frame_type, name, tp);
1391 /* mark this entity as compiler generated */
1392 set_entity_compiler_generated(area, 1);
1397 * Return a node representing a trampoline region
1398 * for a given function entity.
1400 * @param dbgi debug info
1401 * @param entity the function entity
1403 static ir_node *get_trampoline_region(dbg_info *dbgi, ir_entity *entity)
1405 ir_entity *region = NULL;
1408 if (current_trampolines != NULL) {
1409 for (i = ARR_LEN(current_trampolines) - 1; i >= 0; --i) {
1410 if (current_trampolines[i].function == entity) {
1411 region = current_trampolines[i].region;
1416 current_trampolines = NEW_ARR_F(trampoline_region, 0);
1418 ir_graph *irg = current_ir_graph;
1419 if (region == NULL) {
1420 /* create a new region */
1421 ir_type *frame_tp = get_irg_frame_type(irg);
1422 trampoline_region reg;
1423 reg.function = entity;
1425 reg.region = alloc_trampoline(frame_tp,
1426 be_params->trampoline_size,
1427 be_params->trampoline_align);
1428 ARR_APP1(trampoline_region, current_trampolines, reg);
1429 region = reg.region;
1431 return new_d_simpleSel(dbgi, get_irg_no_mem(irg), get_irg_frame(irg),
1436 * Creates a trampoline for a function represented by an entity.
1438 * @param dbgi debug info
1439 * @param mode the (reference) mode for the function address
1440 * @param entity the function entity
1442 static ir_node *create_trampoline(dbg_info *dbgi, ir_mode *mode,
1445 assert(entity != NULL);
1447 in[0] = get_trampoline_region(dbgi, entity);
1448 in[1] = create_symconst(dbgi, entity);
1449 in[2] = get_irg_frame(current_ir_graph);
1451 ir_node *irn = new_d_Builtin(dbgi, get_store(), 3, in, ir_bk_inner_trampoline, get_unknown_type());
1452 set_store(new_Proj(irn, mode_M, pn_Builtin_M));
1453 return new_Proj(irn, mode, pn_Builtin_max+1);
1457 * Dereference an address.
1459 * @param dbgi debug info
1460 * @param type the type of the dereferenced result (the points_to type)
1461 * @param addr the address to dereference
1463 static ir_node *deref_address(dbg_info *const dbgi, type_t *const type,
1464 ir_node *const addr)
1466 type_t *skipped = skip_typeref(type);
1467 if (is_type_incomplete(skipped))
1470 ir_type *irtype = get_ir_type(skipped);
1471 if (is_compound_type(irtype)
1472 || is_Method_type(irtype)
1473 || is_Array_type(irtype)) {
1477 ir_cons_flags flags = skipped->base.qualifiers & TYPE_QUALIFIER_VOLATILE
1478 ? cons_volatile : cons_none;
1479 ir_mode *const mode = get_type_mode(irtype);
1480 ir_node *const memory = get_store();
1481 ir_node *const load = new_d_Load(dbgi, memory, addr, mode, flags);
1482 ir_node *const load_mem = new_d_Proj(dbgi, load, mode_M, pn_Load_M);
1483 ir_node *const load_res = new_d_Proj(dbgi, load, mode, pn_Load_res);
1485 set_store(load_mem);
1487 ir_mode *const mode_arithmetic = get_ir_mode_arithmetic(skipped);
1488 return create_conv(dbgi, load_res, mode_arithmetic);
1492 * Creates a strict Conv (to the node's mode) if necessary.
1494 * @param dbgi debug info
1495 * @param node the node to strict conv
1497 static ir_node *do_strict_conv(dbg_info *dbgi, ir_node *node)
1499 ir_mode *mode = get_irn_mode(node);
1501 if (!(get_irg_fp_model(current_ir_graph) & fp_explicit_rounding))
1503 if (!mode_is_float(mode))
1506 /* check if there is already a Conv */
1507 if (is_Conv(node)) {
1508 /* convert it into a strict Conv */
1509 set_Conv_strict(node, 1);
1513 /* otherwise create a new one */
1514 return new_d_strictConv(dbgi, node, mode);
1518 * Returns the correct base address depending on whether it is a parameter or a
1519 * normal local variable.
1521 static ir_node *get_local_frame(ir_entity *const ent)
1523 ir_graph *const irg = current_ir_graph;
1524 const ir_type *const owner = get_entity_owner(ent);
1525 if (owner == current_outer_frame) {
1526 assert(current_static_link != NULL);
1527 return current_static_link;
1529 return get_irg_frame(irg);
1534 * Keep all memory edges of the given block.
1536 static void keep_all_memory(ir_node *block)
1538 ir_node *old = get_cur_block();
1540 set_cur_block(block);
1541 keep_alive(get_store());
1542 /* TODO: keep all memory edges from restricted pointers */
1546 static ir_node *reference_expression_enum_value_to_firm(
1547 const reference_expression_t *ref)
1549 entity_t *entity = ref->entity;
1550 if (entity->enum_value.tv == NULL) {
1551 type_t *type = skip_typeref(entity->enum_value.enum_type);
1552 assert(type->kind == TYPE_ENUM);
1553 determine_enum_values(&type->enumt);
1556 return new_Const(entity->enum_value.tv);
1559 static ir_node *reference_expression_to_firm(const reference_expression_t *ref)
1561 dbg_info *dbgi = get_dbg_info(&ref->base.source_position);
1562 entity_t *entity = ref->entity;
1563 assert(is_declaration(entity));
1564 type_t *type = skip_typeref(entity->declaration.type);
1566 /* make sure the type is constructed */
1567 (void) get_ir_type(type);
1569 if (entity->kind == ENTITY_FUNCTION
1570 && entity->function.btk != BUILTIN_NONE) {
1571 ir_entity *irentity = get_function_entity(entity, NULL);
1572 /* for gcc compatibility we have to produce (dummy) addresses for some
1573 * builtins which don't have entities */
1574 if (irentity == NULL) {
1575 source_position_t const *const pos = &ref->base.source_position;
1576 symbol_t const *const sym = ref->entity->base.symbol;
1577 warningf(WARN_OTHER, pos, "taking address of builtin '%Y'", sym);
1579 /* simply create a NULL pointer */
1580 ir_mode *mode = get_ir_mode_arithmetic(type_void_ptr);
1581 ir_node *res = new_Const(get_mode_null(mode));
1587 switch ((declaration_kind_t) entity->declaration.kind) {
1588 case DECLARATION_KIND_UNKNOWN:
1591 case DECLARATION_KIND_LOCAL_VARIABLE: {
1592 ir_mode *const mode = get_ir_mode_storage(type);
1593 ir_node *const value = get_value(entity->variable.v.value_number, mode);
1594 return create_conv(NULL, value, get_ir_mode_arithmetic(type));
1596 case DECLARATION_KIND_PARAMETER: {
1597 ir_mode *const mode = get_ir_mode_storage(type);
1598 ir_node *const value = get_value(entity->parameter.v.value_number,mode);
1599 return create_conv(NULL, value, get_ir_mode_arithmetic(type));
1601 case DECLARATION_KIND_FUNCTION: {
1602 return create_symconst(dbgi, entity->function.irentity);
1604 case DECLARATION_KIND_INNER_FUNCTION: {
1605 ir_mode *const mode = get_ir_mode_storage(type);
1606 if (!entity->function.goto_to_outer && !entity->function.need_closure) {
1607 /* inner function not using the closure */
1608 return create_symconst(dbgi, entity->function.irentity);
1610 /* need trampoline here */
1611 return create_trampoline(dbgi, mode, entity->function.irentity);
1614 case DECLARATION_KIND_GLOBAL_VARIABLE: {
1615 const variable_t *variable = &entity->variable;
1616 ir_node *const addr = create_symconst(dbgi, variable->v.entity);
1617 return deref_address(dbgi, variable->base.type, addr);
1620 case DECLARATION_KIND_LOCAL_VARIABLE_ENTITY: {
1621 ir_entity *irentity = entity->variable.v.entity;
1622 ir_node *frame = get_local_frame(irentity);
1623 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, irentity);
1624 return deref_address(dbgi, entity->declaration.type, sel);
1626 case DECLARATION_KIND_PARAMETER_ENTITY: {
1627 ir_entity *irentity = entity->parameter.v.entity;
1628 ir_node *frame = get_local_frame(irentity);
1629 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, irentity);
1630 return deref_address(dbgi, entity->declaration.type, sel);
1633 case DECLARATION_KIND_VARIABLE_LENGTH_ARRAY:
1634 return entity->variable.v.vla_base;
1636 case DECLARATION_KIND_COMPOUND_MEMBER:
1637 panic("not implemented reference type");
1640 panic("reference to declaration with unknown type found");
1643 static ir_node *reference_addr(const reference_expression_t *ref)
1645 dbg_info *dbgi = get_dbg_info(&ref->base.source_position);
1646 entity_t *entity = ref->entity;
1647 assert(is_declaration(entity));
1649 switch((declaration_kind_t) entity->declaration.kind) {
1650 case DECLARATION_KIND_UNKNOWN:
1652 case DECLARATION_KIND_PARAMETER:
1653 case DECLARATION_KIND_LOCAL_VARIABLE:
1654 /* you can store to a local variable (so we don't panic but return NULL
1655 * as an indicator for no real address) */
1657 case DECLARATION_KIND_GLOBAL_VARIABLE: {
1658 ir_node *const addr = create_symconst(dbgi, entity->variable.v.entity);
1661 case DECLARATION_KIND_LOCAL_VARIABLE_ENTITY: {
1662 ir_entity *irentity = entity->variable.v.entity;
1663 ir_node *frame = get_local_frame(irentity);
1664 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, irentity);
1668 case DECLARATION_KIND_PARAMETER_ENTITY: {
1669 ir_entity *irentity = entity->parameter.v.entity;
1670 ir_node *frame = get_local_frame(irentity);
1671 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, irentity);
1676 case DECLARATION_KIND_VARIABLE_LENGTH_ARRAY:
1677 return entity->variable.v.vla_base;
1679 case DECLARATION_KIND_FUNCTION: {
1680 return create_symconst(dbgi, entity->function.irentity);
1683 case DECLARATION_KIND_INNER_FUNCTION: {
1684 type_t *const type = skip_typeref(entity->declaration.type);
1685 ir_mode *const mode = get_ir_mode_storage(type);
1686 if (!entity->function.goto_to_outer && !entity->function.need_closure) {
1687 /* inner function not using the closure */
1688 return create_symconst(dbgi, entity->function.irentity);
1690 /* need trampoline here */
1691 return create_trampoline(dbgi, mode, entity->function.irentity);
1695 case DECLARATION_KIND_COMPOUND_MEMBER:
1696 panic("not implemented reference type");
1699 panic("reference to declaration with unknown type found");
1703 * Transform calls to builtin functions.
1705 static ir_node *process_builtin_call(const call_expression_t *call)
1707 dbg_info *dbgi = get_dbg_info(&call->base.source_position);
1709 assert(call->function->kind == EXPR_REFERENCE);
1710 reference_expression_t *builtin = &call->function->reference;
1712 type_t *expr_type = skip_typeref(builtin->base.type);
1713 assert(is_type_pointer(expr_type));
1715 type_t *function_type = skip_typeref(expr_type->pointer.points_to);
1717 switch (builtin->entity->function.btk) {
1720 case BUILTIN_ALLOCA: {
1721 expression_t *argument = call->arguments->expression;
1722 ir_node *size = expression_to_firm(argument);
1724 ir_node *store = get_store();
1725 ir_node *alloca = new_d_Alloc(dbgi, store, size, get_unknown_type(),
1727 ir_node *proj_m = new_Proj(alloca, mode_M, pn_Alloc_M);
1729 ir_node *res = new_Proj(alloca, mode_P_data, pn_Alloc_res);
1734 type_t *type = function_type->function.return_type;
1735 ir_mode *mode = get_ir_mode_arithmetic(type);
1736 ir_tarval *tv = get_mode_infinite(mode);
1737 ir_node *res = new_d_Const(dbgi, tv);
1741 /* Ignore string for now... */
1742 assert(is_type_function(function_type));
1743 type_t *type = function_type->function.return_type;
1744 ir_mode *mode = get_ir_mode_arithmetic(type);
1745 ir_tarval *tv = get_mode_NAN(mode);
1746 ir_node *res = new_d_Const(dbgi, tv);
1749 case BUILTIN_EXPECT: {
1750 expression_t *argument = call->arguments->expression;
1751 return _expression_to_firm(argument);
1753 case BUILTIN_VA_END:
1754 /* evaluate the argument of va_end for its side effects */
1755 _expression_to_firm(call->arguments->expression);
1757 case BUILTIN_OBJECT_SIZE: {
1758 /* determine value of "type" */
1759 expression_t *type_expression = call->arguments->next->expression;
1760 long type_val = fold_constant_to_int(type_expression);
1761 type_t *type = function_type->function.return_type;
1762 ir_mode *mode = get_ir_mode_arithmetic(type);
1763 /* just produce a "I don't know" result */
1764 ir_tarval *result = type_val & 2 ? get_mode_null(mode) :
1765 get_mode_minus_one(mode);
1767 return new_d_Const(dbgi, result);
1769 case BUILTIN_ROTL: {
1770 ir_node *val = expression_to_firm(call->arguments->expression);
1771 ir_node *shf = expression_to_firm(call->arguments->next->expression);
1772 ir_mode *mode = get_irn_mode(val);
1773 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
1774 return new_d_Rotl(dbgi, val, create_conv(dbgi, shf, mode_uint), mode);
1776 case BUILTIN_ROTR: {
1777 ir_node *val = expression_to_firm(call->arguments->expression);
1778 ir_node *shf = expression_to_firm(call->arguments->next->expression);
1779 ir_mode *mode = get_irn_mode(val);
1780 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
1781 ir_node *c = new_Const_long(mode_uint, get_mode_size_bits(mode));
1782 ir_node *sub = new_d_Sub(dbgi, c, create_conv(dbgi, shf, mode_uint), mode_uint);
1783 return new_d_Rotl(dbgi, val, sub, mode);
1788 case BUILTIN_LIBC_CHECK:
1789 panic("builtin did not produce an entity");
1791 panic("invalid builtin found");
1795 * Transform a call expression.
1796 * Handles some special cases, like alloca() calls, which must be resolved
1797 * BEFORE the inlines runs. Inlining routines calling alloca() is dangerous,
1798 * 176.gcc for instance might allocate 2GB instead of 256 MB if alloca is not
1801 static ir_node *call_expression_to_firm(const call_expression_t *const call)
1803 dbg_info *const dbgi = get_dbg_info(&call->base.source_position);
1804 assert(currently_reachable());
1806 expression_t *function = call->function;
1807 ir_node *callee = NULL;
1808 bool firm_builtin = false;
1809 ir_builtin_kind firm_builtin_kind = ir_bk_trap;
1810 if (function->kind == EXPR_REFERENCE) {
1811 const reference_expression_t *ref = &function->reference;
1812 entity_t *entity = ref->entity;
1814 if (entity->kind == ENTITY_FUNCTION) {
1815 builtin_kind_t builtin = entity->function.btk;
1816 if (builtin == BUILTIN_FIRM) {
1817 firm_builtin = true;
1818 firm_builtin_kind = entity->function.b.firm_builtin_kind;
1819 } else if (builtin != BUILTIN_NONE && builtin != BUILTIN_LIBC
1820 && builtin != BUILTIN_LIBC_CHECK) {
1821 return process_builtin_call(call);
1826 callee = expression_to_firm(function);
1828 type_t *type = skip_typeref(function->base.type);
1829 assert(is_type_pointer(type));
1830 pointer_type_t *pointer_type = &type->pointer;
1831 type_t *points_to = skip_typeref(pointer_type->points_to);
1832 assert(is_type_function(points_to));
1833 function_type_t *function_type = &points_to->function;
1835 int n_parameters = 0;
1836 ir_type *ir_method_type = get_ir_type((type_t*) function_type);
1837 ir_type *new_method_type = NULL;
1838 if (function_type->variadic || function_type->unspecified_parameters) {
1839 const call_argument_t *argument = call->arguments;
1840 for ( ; argument != NULL; argument = argument->next) {
1844 /* we need to construct a new method type matching the call
1846 type_dbg_info *tdbgi = get_type_dbg_info_((const type_t*) function_type);
1847 int n_res = get_method_n_ress(ir_method_type);
1848 new_method_type = new_d_type_method(n_parameters, n_res, tdbgi);
1849 set_method_calling_convention(new_method_type,
1850 get_method_calling_convention(ir_method_type));
1851 set_method_additional_properties(new_method_type,
1852 get_method_additional_properties(ir_method_type));
1853 set_method_variadicity(new_method_type,
1854 get_method_variadicity(ir_method_type));
1856 for (int i = 0; i < n_res; ++i) {
1857 set_method_res_type(new_method_type, i,
1858 get_method_res_type(ir_method_type, i));
1860 argument = call->arguments;
1861 for (int i = 0; i < n_parameters; ++i, argument = argument->next) {
1862 expression_t *expression = argument->expression;
1863 ir_type *irtype = get_ir_type(expression->base.type);
1864 set_method_param_type(new_method_type, i, irtype);
1866 ir_method_type = new_method_type;
1868 n_parameters = get_method_n_params(ir_method_type);
1871 ir_node *in[n_parameters];
1873 const call_argument_t *argument = call->arguments;
1874 for (int n = 0; n < n_parameters; ++n) {
1875 expression_t *expression = argument->expression;
1876 ir_node *arg_node = expression_to_firm(expression);
1878 type_t *arg_type = skip_typeref(expression->base.type);
1879 if (!is_type_compound(arg_type)) {
1880 ir_mode *mode = get_ir_mode_storage(expression->base.type);
1881 arg_node = create_conv(dbgi, arg_node, mode);
1882 arg_node = do_strict_conv(dbgi, arg_node);
1887 argument = argument->next;
1891 if (function_type->modifiers & DM_CONST) {
1892 store = get_irg_no_mem(current_ir_graph);
1894 store = get_store();
1898 type_t *return_type = skip_typeref(function_type->return_type);
1899 ir_node *result = NULL;
1901 node = new_d_Builtin(dbgi, store, n_parameters, in, firm_builtin_kind,
1903 if (! (function_type->modifiers & DM_CONST)) {
1904 ir_node *mem = new_Proj(node, mode_M, pn_Builtin_M);
1908 if (!is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
1909 assert(is_type_scalar(return_type));
1910 ir_mode *mode = get_ir_mode_storage(return_type);
1911 result = new_Proj(node, mode, pn_Builtin_max+1);
1912 ir_mode *mode_arith = get_ir_mode_arithmetic(return_type);
1913 result = create_conv(NULL, result, mode_arith);
1916 node = new_d_Call(dbgi, store, callee, n_parameters, in, ir_method_type);
1917 if (! (function_type->modifiers & DM_CONST)) {
1918 ir_node *mem = new_Proj(node, mode_M, pn_Call_M);
1922 if (!is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
1923 ir_node *resproj = new_Proj(node, mode_T, pn_Call_T_result);
1925 if (is_type_scalar(return_type)) {
1926 ir_mode *mode = get_ir_mode_storage(return_type);
1927 result = new_Proj(resproj, mode, 0);
1928 ir_mode *mode_arith = get_ir_mode_arithmetic(return_type);
1929 result = create_conv(NULL, result, mode_arith);
1931 ir_mode *mode = mode_P_data;
1932 result = new_Proj(resproj, mode, 0);
1937 if (function_type->modifiers & DM_NORETURN) {
1938 /* A dead end: Keep the Call and the Block. Also place all further
1939 * nodes into a new and unreachable block. */
1941 keep_alive(get_cur_block());
1942 ir_node *block = new_Block(0, NULL);
1943 set_cur_block(block);
1949 static void statement_to_firm(statement_t *statement);
1950 static ir_node *compound_statement_to_firm(compound_statement_t *compound);
1952 static ir_node *expression_to_addr(const expression_t *expression);
1953 static ir_node *create_condition_evaluation(const expression_t *expression,
1954 ir_node *true_block,
1955 ir_node *false_block);
1957 static void assign_value(dbg_info *dbgi, ir_node *addr, type_t *type,
1960 if (!is_type_compound(type)) {
1961 ir_mode *mode = get_ir_mode_storage(type);
1962 value = create_conv(dbgi, value, mode);
1963 value = do_strict_conv(dbgi, value);
1966 ir_node *memory = get_store();
1968 if (is_type_scalar(type)) {
1969 ir_cons_flags flags = type->base.qualifiers & TYPE_QUALIFIER_VOLATILE
1970 ? cons_volatile : cons_none;
1971 ir_node *store = new_d_Store(dbgi, memory, addr, value, flags);
1972 ir_node *store_mem = new_d_Proj(dbgi, store, mode_M, pn_Store_M);
1973 set_store(store_mem);
1975 ir_type *irtype = get_ir_type(type);
1976 ir_node *copyb = new_d_CopyB(dbgi, memory, addr, value, irtype);
1977 ir_node *copyb_mem = new_Proj(copyb, mode_M, pn_CopyB_M);
1978 set_store(copyb_mem);
1982 static ir_tarval *create_bitfield_mask(ir_mode *mode, int offset, int size)
1984 ir_tarval *all_one = get_mode_all_one(mode);
1985 int mode_size = get_mode_size_bits(mode);
1986 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
1988 assert(offset >= 0);
1990 assert(offset + size <= mode_size);
1991 if (size == mode_size) {
1995 long shiftr = get_mode_size_bits(mode) - size;
1996 long shiftl = offset;
1997 ir_tarval *tv_shiftr = new_tarval_from_long(shiftr, mode_uint);
1998 ir_tarval *tv_shiftl = new_tarval_from_long(shiftl, mode_uint);
1999 ir_tarval *mask0 = tarval_shr(all_one, tv_shiftr);
2000 ir_tarval *mask1 = tarval_shl(mask0, tv_shiftl);
2005 static ir_node *bitfield_store_to_firm(dbg_info *dbgi,
2006 ir_entity *entity, ir_node *addr, ir_node *value, bool set_volatile,
2009 ir_type *entity_type = get_entity_type(entity);
2010 ir_type *base_type = get_primitive_base_type(entity_type);
2011 ir_mode *mode = get_type_mode(base_type);
2012 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
2014 value = create_conv(dbgi, value, mode);
2016 /* kill upper bits of value and shift to right position */
2017 unsigned bitoffset = get_entity_offset_bits_remainder(entity);
2018 unsigned bitsize = get_mode_size_bits(get_type_mode(entity_type));
2019 unsigned base_bits = get_mode_size_bits(mode);
2020 unsigned shiftwidth = base_bits - bitsize;
2022 ir_node *shiftcount = new_Const_long(mode_uint, shiftwidth);
2023 ir_node *shiftl = new_d_Shl(dbgi, value, shiftcount, mode);
2025 unsigned shrwidth = base_bits - bitsize - bitoffset;
2026 ir_node *shrconst = new_Const_long(mode_uint, shrwidth);
2027 ir_node *shiftr = new_d_Shr(dbgi, shiftl, shrconst, mode);
2029 /* load current value */
2030 ir_node *mem = get_store();
2031 ir_node *load = new_d_Load(dbgi, mem, addr, mode,
2032 set_volatile ? cons_volatile : cons_none);
2033 ir_node *load_mem = new_d_Proj(dbgi, load, mode_M, pn_Load_M);
2034 ir_node *load_res = new_d_Proj(dbgi, load, mode, pn_Load_res);
2035 ir_tarval *shift_mask = create_bitfield_mask(mode, bitoffset, bitsize);
2036 ir_tarval *inv_mask = tarval_not(shift_mask);
2037 ir_node *inv_mask_node = new_d_Const(dbgi, inv_mask);
2038 ir_node *load_res_masked = new_d_And(dbgi, load_res, inv_mask_node, mode);
2040 /* construct new value and store */
2041 ir_node *new_val = new_d_Or(dbgi, load_res_masked, shiftr, mode);
2042 ir_node *store = new_d_Store(dbgi, load_mem, addr, new_val,
2043 set_volatile ? cons_volatile : cons_none);
2044 ir_node *store_mem = new_d_Proj(dbgi, store, mode_M, pn_Store_M);
2045 set_store(store_mem);
2051 ir_node *count_res_shr = new_Const_long(mode_uint, base_bits - bitsize);
2052 if (mode_is_signed(mode)) {
2053 res_shr = new_d_Shrs(dbgi, shiftl, count_res_shr, mode);
2055 res_shr = new_d_Shr(dbgi, shiftl, count_res_shr, mode);
2060 static ir_node *bitfield_extract_to_firm(const select_expression_t *expression,
2063 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2064 entity_t *entity = expression->compound_entry;
2065 type_t *base_type = entity->declaration.type;
2066 ir_mode *mode = get_ir_mode_storage(base_type);
2067 ir_node *mem = get_store();
2068 ir_node *load = new_d_Load(dbgi, mem, addr, mode, cons_none);
2069 ir_node *load_mem = new_d_Proj(dbgi, load, mode_M, pn_Load_M);
2070 ir_node *load_res = new_d_Proj(dbgi, load, mode, pn_Load_res);
2071 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
2073 ir_mode *amode = mode;
2074 /* optimisation, since shifting in modes < machine_size is usually
2076 if (get_mode_size_bits(amode) < get_mode_size_bits(mode_uint)) {
2079 unsigned amode_size = get_mode_size_bits(amode);
2080 load_res = create_conv(dbgi, load_res, amode);
2082 set_store(load_mem);
2084 /* kill upper bits */
2085 assert(expression->compound_entry->kind == ENTITY_COMPOUND_MEMBER);
2086 unsigned bitoffset = entity->compound_member.bit_offset;
2087 unsigned bitsize = entity->compound_member.bit_size;
2088 unsigned shift_bitsl = amode_size - bitoffset - bitsize;
2089 ir_tarval *tvl = new_tarval_from_long((long)shift_bitsl, mode_uint);
2090 ir_node *countl = new_d_Const(dbgi, tvl);
2091 ir_node *shiftl = new_d_Shl(dbgi, load_res, countl, amode);
2093 unsigned shift_bitsr = bitoffset + shift_bitsl;
2094 assert(shift_bitsr <= amode_size);
2095 ir_tarval *tvr = new_tarval_from_long((long)shift_bitsr, mode_uint);
2096 ir_node *countr = new_d_Const(dbgi, tvr);
2098 if (mode_is_signed(mode)) {
2099 shiftr = new_d_Shrs(dbgi, shiftl, countr, amode);
2101 shiftr = new_d_Shr(dbgi, shiftl, countr, amode);
2104 type_t *type = expression->base.type;
2105 ir_mode *resmode = get_ir_mode_arithmetic(type);
2106 return create_conv(dbgi, shiftr, resmode);
2109 /* make sure the selected compound type is constructed */
2110 static void construct_select_compound(const select_expression_t *expression)
2112 type_t *type = skip_typeref(expression->compound->base.type);
2113 if (is_type_pointer(type)) {
2114 type = type->pointer.points_to;
2116 (void) get_ir_type(type);
2119 static ir_node *set_value_for_expression_addr(const expression_t *expression,
2120 ir_node *value, ir_node *addr)
2122 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2123 type_t *type = skip_typeref(expression->base.type);
2125 if (!is_type_compound(type)) {
2126 ir_mode *mode = get_ir_mode_storage(type);
2127 value = create_conv(dbgi, value, mode);
2128 value = do_strict_conv(dbgi, value);
2131 if (expression->kind == EXPR_REFERENCE) {
2132 const reference_expression_t *ref = &expression->reference;
2134 entity_t *entity = ref->entity;
2135 assert(is_declaration(entity));
2136 assert(entity->declaration.kind != DECLARATION_KIND_UNKNOWN);
2137 if (entity->declaration.kind == DECLARATION_KIND_LOCAL_VARIABLE) {
2138 set_value(entity->variable.v.value_number, value);
2140 } else if (entity->declaration.kind == DECLARATION_KIND_PARAMETER) {
2141 set_value(entity->parameter.v.value_number, value);
2147 addr = expression_to_addr(expression);
2148 assert(addr != NULL);
2150 if (expression->kind == EXPR_SELECT) {
2151 const select_expression_t *select = &expression->select;
2153 construct_select_compound(select);
2155 entity_t *entity = select->compound_entry;
2156 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
2157 if (entity->compound_member.bitfield) {
2158 ir_entity *irentity = entity->compound_member.entity;
2160 = select->base.type->base.qualifiers & TYPE_QUALIFIER_VOLATILE;
2161 value = bitfield_store_to_firm(dbgi, irentity, addr, value,
2162 set_volatile, true);
2167 assign_value(dbgi, addr, type, value);
2171 static void set_value_for_expression(const expression_t *expression,
2174 set_value_for_expression_addr(expression, value, NULL);
2177 static ir_node *get_value_from_lvalue(const expression_t *expression,
2180 if (expression->kind == EXPR_REFERENCE) {
2181 const reference_expression_t *ref = &expression->reference;
2183 entity_t *entity = ref->entity;
2184 assert(entity->kind == ENTITY_VARIABLE
2185 || entity->kind == ENTITY_PARAMETER);
2186 assert(entity->declaration.kind != DECLARATION_KIND_UNKNOWN);
2188 if (entity->declaration.kind == DECLARATION_KIND_LOCAL_VARIABLE) {
2189 value_number = entity->variable.v.value_number;
2190 assert(addr == NULL);
2191 type_t *type = skip_typeref(expression->base.type);
2192 ir_mode *mode = get_ir_mode_storage(type);
2193 ir_node *res = get_value(value_number, mode);
2194 return create_conv(NULL, res, get_ir_mode_arithmetic(type));
2195 } else if (entity->declaration.kind == DECLARATION_KIND_PARAMETER) {
2196 value_number = entity->parameter.v.value_number;
2197 assert(addr == NULL);
2198 type_t *type = skip_typeref(expression->base.type);
2199 ir_mode *mode = get_ir_mode_storage(type);
2200 ir_node *res = get_value(value_number, mode);
2201 return create_conv(NULL, res, get_ir_mode_arithmetic(type));
2205 assert(addr != NULL);
2206 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2209 if (expression->kind == EXPR_SELECT &&
2210 expression->select.compound_entry->compound_member.bitfield) {
2211 construct_select_compound(&expression->select);
2212 value = bitfield_extract_to_firm(&expression->select, addr);
2214 value = deref_address(dbgi, expression->base.type, addr);
2221 static ir_node *create_incdec(const unary_expression_t *expression)
2223 dbg_info *const dbgi = get_dbg_info(&expression->base.source_position);
2224 const expression_t *value_expr = expression->value;
2225 ir_node *addr = expression_to_addr(value_expr);
2226 ir_node *value = get_value_from_lvalue(value_expr, addr);
2228 type_t *type = skip_typeref(expression->base.type);
2229 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
2232 if (is_type_pointer(type)) {
2233 pointer_type_t *pointer_type = &type->pointer;
2234 offset = get_type_size_node(pointer_type->points_to);
2236 assert(is_type_arithmetic(type));
2237 offset = new_Const(get_mode_one(mode));
2241 ir_node *store_value;
2242 switch(expression->base.kind) {
2243 case EXPR_UNARY_POSTFIX_INCREMENT:
2245 store_value = new_d_Add(dbgi, value, offset, mode);
2247 case EXPR_UNARY_POSTFIX_DECREMENT:
2249 store_value = new_d_Sub(dbgi, value, offset, mode);
2251 case EXPR_UNARY_PREFIX_INCREMENT:
2252 result = new_d_Add(dbgi, value, offset, mode);
2253 store_value = result;
2255 case EXPR_UNARY_PREFIX_DECREMENT:
2256 result = new_d_Sub(dbgi, value, offset, mode);
2257 store_value = result;
2260 panic("no incdec expr in create_incdec");
2263 set_value_for_expression_addr(value_expr, store_value, addr);
2268 static bool is_local_variable(expression_t *expression)
2270 if (expression->kind != EXPR_REFERENCE)
2272 reference_expression_t *ref_expr = &expression->reference;
2273 entity_t *entity = ref_expr->entity;
2274 if (entity->kind != ENTITY_VARIABLE)
2276 assert(entity->declaration.kind != DECLARATION_KIND_UNKNOWN);
2277 return entity->declaration.kind == DECLARATION_KIND_LOCAL_VARIABLE;
2280 static ir_relation get_relation(const expression_kind_t kind)
2283 case EXPR_BINARY_EQUAL: return ir_relation_equal;
2284 case EXPR_BINARY_ISLESSGREATER: return ir_relation_less_greater;
2285 case EXPR_BINARY_NOTEQUAL: return ir_relation_unordered_less_greater;
2286 case EXPR_BINARY_ISLESS:
2287 case EXPR_BINARY_LESS: return ir_relation_less;
2288 case EXPR_BINARY_ISLESSEQUAL:
2289 case EXPR_BINARY_LESSEQUAL: return ir_relation_less_equal;
2290 case EXPR_BINARY_ISGREATER:
2291 case EXPR_BINARY_GREATER: return ir_relation_greater;
2292 case EXPR_BINARY_ISGREATEREQUAL:
2293 case EXPR_BINARY_GREATEREQUAL: return ir_relation_greater_equal;
2294 case EXPR_BINARY_ISUNORDERED: return ir_relation_unordered;
2299 panic("trying to get pn_Cmp from non-comparison binexpr type");
2303 * Handle the assume optimizer hint: check if a Confirm
2304 * node can be created.
2306 * @param dbi debug info
2307 * @param expr the IL assume expression
2309 * we support here only some simple cases:
2314 static ir_node *handle_assume_compare(dbg_info *dbi,
2315 const binary_expression_t *expression)
2317 expression_t *op1 = expression->left;
2318 expression_t *op2 = expression->right;
2319 entity_t *var2, *var = NULL;
2320 ir_node *res = NULL;
2321 ir_relation relation = get_relation(expression->base.kind);
2323 if (is_local_variable(op1) && is_local_variable(op2)) {
2324 var = op1->reference.entity;
2325 var2 = op2->reference.entity;
2327 type_t *const type = skip_typeref(var->declaration.type);
2328 ir_mode *const mode = get_ir_mode_storage(type);
2330 ir_node *const irn1 = get_value(var->variable.v.value_number, mode);
2331 ir_node *const irn2 = get_value(var2->variable.v.value_number, mode);
2333 res = new_d_Confirm(dbi, irn2, irn1, get_inversed_relation(relation));
2334 set_value(var2->variable.v.value_number, res);
2336 res = new_d_Confirm(dbi, irn1, irn2, relation);
2337 set_value(var->variable.v.value_number, res);
2342 expression_t *con = NULL;
2343 if (is_local_variable(op1) && is_constant_expression(op2) == EXPR_CLASS_CONSTANT) {
2344 var = op1->reference.entity;
2346 } else if (is_constant_expression(op1) == EXPR_CLASS_CONSTANT && is_local_variable(op2)) {
2347 relation = get_inversed_relation(relation);
2348 var = op2->reference.entity;
2353 type_t *const type = skip_typeref(var->declaration.type);
2354 ir_mode *const mode = get_ir_mode_storage(type);
2356 res = get_value(var->variable.v.value_number, mode);
2357 res = new_d_Confirm(dbi, res, expression_to_firm(con), relation);
2358 set_value(var->variable.v.value_number, res);
2364 * Handle the assume optimizer hint.
2366 * @param dbi debug info
2367 * @param expr the IL assume expression
2369 static ir_node *handle_assume(dbg_info *dbi, const expression_t *expression)
2371 switch(expression->kind) {
2372 case EXPR_BINARY_EQUAL:
2373 case EXPR_BINARY_NOTEQUAL:
2374 case EXPR_BINARY_LESS:
2375 case EXPR_BINARY_LESSEQUAL:
2376 case EXPR_BINARY_GREATER:
2377 case EXPR_BINARY_GREATEREQUAL:
2378 return handle_assume_compare(dbi, &expression->binary);
2384 static ir_node *create_cast(dbg_info *dbgi, ir_node *value_node,
2385 type_t *from_type, type_t *type)
2387 type = skip_typeref(type);
2388 if (type == type_void) {
2389 /* make sure firm type is constructed */
2390 (void) get_ir_type(type);
2393 if (!is_type_scalar(type)) {
2394 /* make sure firm type is constructed */
2395 (void) get_ir_type(type);
2399 from_type = skip_typeref(from_type);
2400 ir_mode *mode = get_ir_mode_storage(type);
2401 /* check for conversion from / to __based types */
2402 if (is_type_pointer(type) && is_type_pointer(from_type)) {
2403 const variable_t *from_var = from_type->pointer.base_variable;
2404 const variable_t *to_var = type->pointer.base_variable;
2405 if (from_var != to_var) {
2406 if (from_var != NULL) {
2407 ir_node *const addr = create_symconst(dbgi, from_var->v.entity);
2408 ir_node *const base = deref_address(dbgi, from_var->base.type, addr);
2409 value_node = new_d_Add(dbgi, value_node, base, get_ir_mode_storage(from_type));
2411 if (to_var != NULL) {
2412 ir_node *const addr = create_symconst(dbgi, to_var->v.entity);
2413 ir_node *const base = deref_address(dbgi, to_var->base.type, addr);
2414 value_node = new_d_Sub(dbgi, value_node, base, mode);
2419 if (is_type_atomic(type, ATOMIC_TYPE_BOOL)) {
2420 /* bool adjustments (we save a mode_Bu, but have to temporarily
2421 * convert to mode_b so we only get a 0/1 value */
2422 value_node = create_conv(dbgi, value_node, mode_b);
2425 ir_mode *mode_arith = get_ir_mode_arithmetic(type);
2426 ir_node *node = create_conv(dbgi, value_node, mode);
2427 node = do_strict_conv(dbgi, node);
2428 node = create_conv(dbgi, node, mode_arith);
2433 static ir_node *unary_expression_to_firm(const unary_expression_t *expression)
2435 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2436 type_t *type = skip_typeref(expression->base.type);
2438 const expression_t *value = expression->value;
2440 switch(expression->base.kind) {
2441 case EXPR_UNARY_TAKE_ADDRESS:
2442 return expression_to_addr(value);
2444 case EXPR_UNARY_NEGATE: {
2445 ir_node *value_node = expression_to_firm(value);
2446 ir_mode *mode = get_ir_mode_arithmetic(type);
2447 return new_d_Minus(dbgi, value_node, mode);
2449 case EXPR_UNARY_PLUS:
2450 return expression_to_firm(value);
2451 case EXPR_UNARY_BITWISE_NEGATE: {
2452 ir_node *value_node = expression_to_firm(value);
2453 ir_mode *mode = get_ir_mode_arithmetic(type);
2454 return new_d_Not(dbgi, value_node, mode);
2456 case EXPR_UNARY_NOT: {
2457 ir_node *value_node = _expression_to_firm(value);
2458 value_node = create_conv(dbgi, value_node, mode_b);
2459 ir_node *res = new_d_Not(dbgi, value_node, mode_b);
2462 case EXPR_UNARY_DEREFERENCE: {
2463 ir_node *value_node = expression_to_firm(value);
2464 type_t *value_type = skip_typeref(value->base.type);
2465 assert(is_type_pointer(value_type));
2467 /* check for __based */
2468 const variable_t *const base_var = value_type->pointer.base_variable;
2469 if (base_var != NULL) {
2470 ir_node *const addr = create_symconst(dbgi, base_var->v.entity);
2471 ir_node *const base = deref_address(dbgi, base_var->base.type, addr);
2472 value_node = new_d_Add(dbgi, value_node, base, get_ir_mode_storage(value_type));
2474 type_t *points_to = value_type->pointer.points_to;
2475 return deref_address(dbgi, points_to, value_node);
2477 case EXPR_UNARY_POSTFIX_INCREMENT:
2478 case EXPR_UNARY_POSTFIX_DECREMENT:
2479 case EXPR_UNARY_PREFIX_INCREMENT:
2480 case EXPR_UNARY_PREFIX_DECREMENT:
2481 return create_incdec(expression);
2482 case EXPR_UNARY_CAST: {
2483 ir_node *value_node = expression_to_firm(value);
2484 type_t *from_type = value->base.type;
2485 return create_cast(dbgi, value_node, from_type, type);
2487 case EXPR_UNARY_ASSUME:
2488 return handle_assume(dbgi, value);
2493 panic("invalid UNEXPR type found");
2497 * produces a 0/1 depending of the value of a mode_b node
2499 static ir_node *produce_condition_result(const expression_t *expression,
2500 ir_mode *mode, dbg_info *dbgi)
2502 ir_node *const one_block = new_immBlock();
2503 ir_node *const zero_block = new_immBlock();
2504 create_condition_evaluation(expression, one_block, zero_block);
2505 mature_immBlock(one_block);
2506 mature_immBlock(zero_block);
2508 ir_node *const jmp_one = new_rd_Jmp(dbgi, one_block);
2509 ir_node *const jmp_zero = new_rd_Jmp(dbgi, zero_block);
2510 ir_node *const in_cf[2] = { jmp_one, jmp_zero };
2511 ir_node *const block = new_Block(lengthof(in_cf), in_cf);
2512 set_cur_block(block);
2514 ir_node *const one = new_Const(get_mode_one(mode));
2515 ir_node *const zero = new_Const(get_mode_null(mode));
2516 ir_node *const in[2] = { one, zero };
2517 ir_node *const val = new_d_Phi(dbgi, lengthof(in), in, mode);
2522 static ir_node *adjust_for_pointer_arithmetic(dbg_info *dbgi,
2523 ir_node *value, type_t *type)
2525 ir_mode *const mode = get_ir_mode_arithmetic(type_ptrdiff_t);
2526 assert(is_type_pointer(type));
2527 pointer_type_t *const pointer_type = &type->pointer;
2528 type_t *const points_to = skip_typeref(pointer_type->points_to);
2529 ir_node * elem_size = get_type_size_node(points_to);
2530 elem_size = create_conv(dbgi, elem_size, mode);
2531 value = create_conv(dbgi, value, mode);
2532 ir_node *const mul = new_d_Mul(dbgi, value, elem_size, mode);
2536 static ir_node *create_op(dbg_info *dbgi, const binary_expression_t *expression,
2537 ir_node *left, ir_node *right)
2540 type_t *type_left = skip_typeref(expression->left->base.type);
2541 type_t *type_right = skip_typeref(expression->right->base.type);
2543 expression_kind_t kind = expression->base.kind;
2546 case EXPR_BINARY_SHIFTLEFT:
2547 case EXPR_BINARY_SHIFTRIGHT:
2548 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2549 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2550 mode = get_ir_mode_arithmetic(expression->base.type);
2551 right = create_conv(dbgi, right, atomic_modes[ATOMIC_TYPE_UINT]);
2554 case EXPR_BINARY_SUB:
2555 if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
2556 const pointer_type_t *const ptr_type = &type_left->pointer;
2558 mode = get_ir_mode_arithmetic(expression->base.type);
2559 ir_node *const elem_size = get_type_size_node(ptr_type->points_to);
2560 ir_node *const conv_size = new_d_Conv(dbgi, elem_size, mode);
2561 ir_node *const sub = new_d_Sub(dbgi, left, right, mode);
2562 ir_node *const no_mem = new_NoMem();
2563 ir_node *const div = new_d_DivRL(dbgi, no_mem, sub, conv_size,
2564 mode, op_pin_state_floats);
2565 return new_d_Proj(dbgi, div, mode, pn_Div_res);
2568 case EXPR_BINARY_SUB_ASSIGN:
2569 if (is_type_pointer(type_left)) {
2570 right = adjust_for_pointer_arithmetic(dbgi, right, type_left);
2571 mode = get_ir_mode_arithmetic(type_left);
2576 case EXPR_BINARY_ADD:
2577 case EXPR_BINARY_ADD_ASSIGN:
2578 if (is_type_pointer(type_left)) {
2579 right = adjust_for_pointer_arithmetic(dbgi, right, type_left);
2580 mode = get_ir_mode_arithmetic(type_left);
2582 } else if (is_type_pointer(type_right)) {
2583 left = adjust_for_pointer_arithmetic(dbgi, left, type_right);
2584 mode = get_ir_mode_arithmetic(type_right);
2591 mode = get_ir_mode_arithmetic(type_right);
2592 left = create_conv(dbgi, left, mode);
2597 case EXPR_BINARY_ADD_ASSIGN:
2598 case EXPR_BINARY_ADD:
2599 return new_d_Add(dbgi, left, right, mode);
2600 case EXPR_BINARY_SUB_ASSIGN:
2601 case EXPR_BINARY_SUB:
2602 return new_d_Sub(dbgi, left, right, mode);
2603 case EXPR_BINARY_MUL_ASSIGN:
2604 case EXPR_BINARY_MUL:
2605 return new_d_Mul(dbgi, left, right, mode);
2606 case EXPR_BINARY_BITWISE_AND:
2607 case EXPR_BINARY_BITWISE_AND_ASSIGN:
2608 return new_d_And(dbgi, left, right, mode);
2609 case EXPR_BINARY_BITWISE_OR:
2610 case EXPR_BINARY_BITWISE_OR_ASSIGN:
2611 return new_d_Or(dbgi, left, right, mode);
2612 case EXPR_BINARY_BITWISE_XOR:
2613 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
2614 return new_d_Eor(dbgi, left, right, mode);
2615 case EXPR_BINARY_SHIFTLEFT:
2616 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2617 return new_d_Shl(dbgi, left, right, mode);
2618 case EXPR_BINARY_SHIFTRIGHT:
2619 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2620 if (mode_is_signed(mode)) {
2621 return new_d_Shrs(dbgi, left, right, mode);
2623 return new_d_Shr(dbgi, left, right, mode);
2625 case EXPR_BINARY_DIV:
2626 case EXPR_BINARY_DIV_ASSIGN: {
2627 ir_node *pin = new_Pin(new_NoMem());
2628 ir_node *op = new_d_Div(dbgi, pin, left, right, mode,
2629 op_pin_state_floats);
2630 ir_node *res = new_d_Proj(dbgi, op, mode, pn_Div_res);
2633 case EXPR_BINARY_MOD:
2634 case EXPR_BINARY_MOD_ASSIGN: {
2635 ir_node *pin = new_Pin(new_NoMem());
2636 assert(!mode_is_float(mode));
2637 ir_node *op = new_d_Mod(dbgi, pin, left, right, mode,
2638 op_pin_state_floats);
2639 ir_node *res = new_d_Proj(dbgi, op, mode, pn_Mod_res);
2643 panic("unexpected expression kind");
2647 static ir_node *create_lazy_op(const binary_expression_t *expression)
2649 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2650 type_t *type = skip_typeref(expression->base.type);
2651 ir_mode *mode = get_ir_mode_arithmetic(type);
2653 if (is_constant_expression(expression->left) == EXPR_CLASS_CONSTANT) {
2654 bool val = fold_constant_to_bool(expression->left);
2655 expression_kind_t ekind = expression->base.kind;
2656 assert(ekind == EXPR_BINARY_LOGICAL_AND || ekind == EXPR_BINARY_LOGICAL_OR);
2657 if (ekind == EXPR_BINARY_LOGICAL_AND) {
2659 return new_Const(get_mode_null(mode));
2663 return new_Const(get_mode_one(mode));
2667 if (is_constant_expression(expression->right) == EXPR_CLASS_CONSTANT) {
2668 bool valr = fold_constant_to_bool(expression->right);
2669 return create_Const_from_bool(mode, valr);
2672 return produce_condition_result(expression->right, mode, dbgi);
2675 return produce_condition_result((const expression_t*) expression, mode,
2679 typedef ir_node * (*create_arithmetic_func)(dbg_info *dbgi, ir_node *left,
2680 ir_node *right, ir_mode *mode);
2682 static ir_node *create_assign_binop(const binary_expression_t *expression)
2684 dbg_info *const dbgi = get_dbg_info(&expression->base.source_position);
2685 const expression_t *left_expr = expression->left;
2686 type_t *type = skip_typeref(left_expr->base.type);
2687 ir_node *right = expression_to_firm(expression->right);
2688 ir_node *left_addr = expression_to_addr(left_expr);
2689 ir_node *left = get_value_from_lvalue(left_expr, left_addr);
2690 ir_node *result = create_op(dbgi, expression, left, right);
2692 result = create_cast(dbgi, result, expression->right->base.type, type);
2693 result = do_strict_conv(dbgi, result);
2695 result = set_value_for_expression_addr(left_expr, result, left_addr);
2697 if (!is_type_compound(type)) {
2698 ir_mode *mode_arithmetic = get_ir_mode_arithmetic(type);
2699 result = create_conv(dbgi, result, mode_arithmetic);
2704 static ir_node *binary_expression_to_firm(const binary_expression_t *expression)
2706 expression_kind_t kind = expression->base.kind;
2709 case EXPR_BINARY_EQUAL:
2710 case EXPR_BINARY_NOTEQUAL:
2711 case EXPR_BINARY_LESS:
2712 case EXPR_BINARY_LESSEQUAL:
2713 case EXPR_BINARY_GREATER:
2714 case EXPR_BINARY_GREATEREQUAL:
2715 case EXPR_BINARY_ISGREATER:
2716 case EXPR_BINARY_ISGREATEREQUAL:
2717 case EXPR_BINARY_ISLESS:
2718 case EXPR_BINARY_ISLESSEQUAL:
2719 case EXPR_BINARY_ISLESSGREATER:
2720 case EXPR_BINARY_ISUNORDERED: {
2721 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2722 ir_node *left = expression_to_firm(expression->left);
2723 ir_node *right = expression_to_firm(expression->right);
2724 ir_relation relation = get_relation(kind);
2725 ir_node *cmp = new_d_Cmp(dbgi, left, right, relation);
2728 case EXPR_BINARY_ASSIGN: {
2729 ir_node *addr = expression_to_addr(expression->left);
2730 ir_node *right = expression_to_firm(expression->right);
2732 = set_value_for_expression_addr(expression->left, right, addr);
2734 type_t *type = skip_typeref(expression->base.type);
2735 if (!is_type_compound(type)) {
2736 ir_mode *mode_arithmetic = get_ir_mode_arithmetic(type);
2737 res = create_conv(NULL, res, mode_arithmetic);
2741 case EXPR_BINARY_ADD:
2742 case EXPR_BINARY_SUB:
2743 case EXPR_BINARY_MUL:
2744 case EXPR_BINARY_DIV:
2745 case EXPR_BINARY_MOD:
2746 case EXPR_BINARY_BITWISE_AND:
2747 case EXPR_BINARY_BITWISE_OR:
2748 case EXPR_BINARY_BITWISE_XOR:
2749 case EXPR_BINARY_SHIFTLEFT:
2750 case EXPR_BINARY_SHIFTRIGHT:
2752 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2753 ir_node *left = expression_to_firm(expression->left);
2754 ir_node *right = expression_to_firm(expression->right);
2755 return create_op(dbgi, expression, left, right);
2757 case EXPR_BINARY_LOGICAL_AND:
2758 case EXPR_BINARY_LOGICAL_OR:
2759 return create_lazy_op(expression);
2760 case EXPR_BINARY_COMMA:
2761 /* create side effects of left side */
2762 (void) expression_to_firm(expression->left);
2763 return _expression_to_firm(expression->right);
2765 case EXPR_BINARY_ADD_ASSIGN:
2766 case EXPR_BINARY_SUB_ASSIGN:
2767 case EXPR_BINARY_MUL_ASSIGN:
2768 case EXPR_BINARY_MOD_ASSIGN:
2769 case EXPR_BINARY_DIV_ASSIGN:
2770 case EXPR_BINARY_BITWISE_AND_ASSIGN:
2771 case EXPR_BINARY_BITWISE_OR_ASSIGN:
2772 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
2773 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2774 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2775 return create_assign_binop(expression);
2777 panic("TODO binexpr type");
2781 static ir_node *array_access_addr(const array_access_expression_t *expression)
2783 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2784 ir_node *base_addr = expression_to_firm(expression->array_ref);
2785 ir_node *offset = expression_to_firm(expression->index);
2786 type_t *ref_type = skip_typeref(expression->array_ref->base.type);
2787 ir_node *real_offset = adjust_for_pointer_arithmetic(dbgi, offset, ref_type);
2788 ir_node *result = new_d_Add(dbgi, base_addr, real_offset, mode_P_data);
2793 static ir_node *array_access_to_firm(
2794 const array_access_expression_t *expression)
2796 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2797 ir_node *addr = array_access_addr(expression);
2798 type_t *type = revert_automatic_type_conversion(
2799 (const expression_t*) expression);
2800 type = skip_typeref(type);
2802 return deref_address(dbgi, type, addr);
2805 static long get_offsetof_offset(const offsetof_expression_t *expression)
2807 type_t *orig_type = expression->type;
2810 designator_t *designator = expression->designator;
2811 for ( ; designator != NULL; designator = designator->next) {
2812 type_t *type = skip_typeref(orig_type);
2813 /* be sure the type is constructed */
2814 (void) get_ir_type(type);
2816 if (designator->symbol != NULL) {
2817 assert(is_type_compound(type));
2818 symbol_t *symbol = designator->symbol;
2820 compound_t *compound = type->compound.compound;
2821 entity_t *iter = compound->members.entities;
2822 for ( ; iter != NULL; iter = iter->base.next) {
2823 if (iter->base.symbol == symbol) {
2827 assert(iter != NULL);
2829 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
2830 assert(iter->declaration.kind == DECLARATION_KIND_COMPOUND_MEMBER);
2831 offset += get_entity_offset(iter->compound_member.entity);
2833 orig_type = iter->declaration.type;
2835 expression_t *array_index = designator->array_index;
2836 assert(designator->array_index != NULL);
2837 assert(is_type_array(type));
2839 long index = fold_constant_to_int(array_index);
2840 ir_type *arr_type = get_ir_type(type);
2841 ir_type *elem_type = get_array_element_type(arr_type);
2842 long elem_size = get_type_size_bytes(elem_type);
2844 offset += index * elem_size;
2846 orig_type = type->array.element_type;
2853 static ir_node *offsetof_to_firm(const offsetof_expression_t *expression)
2855 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
2856 long offset = get_offsetof_offset(expression);
2857 ir_tarval *tv = new_tarval_from_long(offset, mode);
2858 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2860 return new_d_Const(dbgi, tv);
2863 static void create_local_initializer(initializer_t *initializer, dbg_info *dbgi,
2864 ir_entity *entity, type_t *type);
2865 static ir_initializer_t *create_ir_initializer(
2866 const initializer_t *initializer, type_t *type);
2868 static ir_entity *create_initializer_entity(dbg_info *dbgi,
2869 initializer_t *initializer,
2872 /* create the ir_initializer */
2873 ir_graph *const old_current_ir_graph = current_ir_graph;
2874 current_ir_graph = get_const_code_irg();
2876 ir_initializer_t *irinitializer = create_ir_initializer(initializer, type);
2878 assert(current_ir_graph == get_const_code_irg());
2879 current_ir_graph = old_current_ir_graph;
2881 ident *const id = id_unique("initializer.%u");
2882 ir_type *const irtype = get_ir_type(type);
2883 ir_type *const global_type = get_glob_type();
2884 ir_entity *const entity = new_d_entity(global_type, id, irtype, dbgi);
2885 set_entity_ld_ident(entity, id);
2886 set_entity_visibility(entity, ir_visibility_private);
2887 add_entity_linkage(entity, IR_LINKAGE_CONSTANT);
2888 set_entity_initializer(entity, irinitializer);
2892 static ir_node *compound_literal_addr(compound_literal_expression_t const *const expression)
2894 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2895 type_t *type = expression->type;
2896 initializer_t *initializer = expression->initializer;
2898 if (is_constant_initializer(initializer) == EXPR_CLASS_CONSTANT) {
2899 ir_entity *entity = create_initializer_entity(dbgi, initializer, type);
2900 return create_symconst(dbgi, entity);
2902 /* create an entity on the stack */
2903 ident *const id = id_unique("CompLit.%u");
2904 ir_type *const irtype = get_ir_type(type);
2905 ir_type *frame_type = get_irg_frame_type(current_ir_graph);
2907 ir_entity *const entity = new_d_entity(frame_type, id, irtype, dbgi);
2908 set_entity_ld_ident(entity, id);
2910 /* create initialisation code */
2911 create_local_initializer(initializer, dbgi, entity, type);
2913 /* create a sel for the compound literal address */
2914 ir_node *frame = get_irg_frame(current_ir_graph);
2915 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, entity);
2920 static ir_node *compound_literal_to_firm(compound_literal_expression_t const* const expr)
2922 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
2923 type_t *const type = expr->type;
2924 ir_node *const addr = compound_literal_addr(expr);
2925 return deref_address(dbgi, type, addr);
2929 * Transform a sizeof expression into Firm code.
2931 static ir_node *sizeof_to_firm(const typeprop_expression_t *expression)
2933 type_t *const type = skip_typeref(expression->type);
2934 /* ยง6.5.3.4:2 if the type is a VLA, evaluate the expression. */
2935 if (is_type_array(type) && type->array.is_vla
2936 && expression->tp_expression != NULL) {
2937 expression_to_firm(expression->tp_expression);
2939 /* strange gnu extensions: sizeof(function) == 1 */
2940 if (is_type_function(type)) {
2941 ir_mode *mode = get_ir_mode_storage(type_size_t);
2942 return new_Const(get_mode_one(mode));
2945 return get_type_size_node(type);
2948 static entity_t *get_expression_entity(const expression_t *expression)
2950 if (expression->kind != EXPR_REFERENCE)
2953 return expression->reference.entity;
2956 static unsigned get_cparser_entity_alignment(const entity_t *entity)
2958 switch(entity->kind) {
2959 case DECLARATION_KIND_CASES:
2960 return entity->declaration.alignment;
2963 return entity->compound.alignment;
2964 case ENTITY_TYPEDEF:
2965 return entity->typedefe.alignment;
2973 * Transform an alignof expression into Firm code.
2975 static ir_node *alignof_to_firm(const typeprop_expression_t *expression)
2977 unsigned alignment = 0;
2979 const expression_t *tp_expression = expression->tp_expression;
2980 if (tp_expression != NULL) {
2981 entity_t *entity = get_expression_entity(tp_expression);
2982 if (entity != NULL) {
2983 if (entity->kind == ENTITY_FUNCTION) {
2984 /* a gnu-extension */
2987 alignment = get_cparser_entity_alignment(entity);
2992 if (alignment == 0) {
2993 type_t *type = expression->type;
2994 alignment = get_type_alignment(type);
2997 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2998 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
2999 ir_tarval *tv = new_tarval_from_long(alignment, mode);
3000 return new_d_Const(dbgi, tv);
3003 static void init_ir_types(void);
3005 static ir_tarval *fold_constant_to_tarval(const expression_t *expression)
3007 assert(is_type_valid(skip_typeref(expression->base.type)));
3009 bool constant_folding_old = constant_folding;
3010 constant_folding = true;
3011 int old_optimize = get_optimize();
3012 int old_constant_folding = get_opt_constant_folding();
3014 set_opt_constant_folding(1);
3018 assert(is_constant_expression(expression) == EXPR_CLASS_CONSTANT);
3020 ir_graph *old_current_ir_graph = current_ir_graph;
3021 current_ir_graph = get_const_code_irg();
3023 ir_node *cnst = expression_to_firm(expression);
3024 current_ir_graph = old_current_ir_graph;
3025 set_optimize(old_optimize);
3026 set_opt_constant_folding(old_constant_folding);
3028 if (!is_Const(cnst)) {
3029 panic("couldn't fold constant");
3032 constant_folding = constant_folding_old;
3034 return get_Const_tarval(cnst);
3037 /* this function is only used in parser.c, but it relies on libfirm functionality */
3038 bool constant_is_negative(const expression_t *expression)
3040 assert(is_constant_expression(expression) == EXPR_CLASS_CONSTANT);
3041 ir_tarval *tv = fold_constant_to_tarval(expression);
3042 return tarval_is_negative(tv);
3045 long fold_constant_to_int(const expression_t *expression)
3047 if (expression->kind == EXPR_ERROR)
3050 ir_tarval *tv = fold_constant_to_tarval(expression);
3051 if (!tarval_is_long(tv)) {
3052 panic("result of constant folding is not integer");
3055 return get_tarval_long(tv);
3058 bool fold_constant_to_bool(const expression_t *expression)
3060 if (expression->kind == EXPR_ERROR)
3062 ir_tarval *tv = fold_constant_to_tarval(expression);
3063 return !tarval_is_null(tv);
3066 static ir_node *conditional_to_firm(const conditional_expression_t *expression)
3068 dbg_info *const dbgi = get_dbg_info(&expression->base.source_position);
3070 /* first try to fold a constant condition */
3071 if (is_constant_expression(expression->condition) == EXPR_CLASS_CONSTANT) {
3072 bool val = fold_constant_to_bool(expression->condition);
3074 expression_t *true_expression = expression->true_expression;
3075 if (true_expression == NULL)
3076 true_expression = expression->condition;
3077 return expression_to_firm(true_expression);
3079 return expression_to_firm(expression->false_expression);
3083 ir_node *const true_block = new_immBlock();
3084 ir_node *const false_block = new_immBlock();
3085 ir_node *const cond_expr = create_condition_evaluation(expression->condition, true_block, false_block);
3086 mature_immBlock(true_block);
3087 mature_immBlock(false_block);
3089 set_cur_block(true_block);
3091 if (expression->true_expression != NULL) {
3092 true_val = expression_to_firm(expression->true_expression);
3093 } else if (cond_expr != NULL && get_irn_mode(cond_expr) != mode_b) {
3094 true_val = cond_expr;
3096 /* Condition ended with a short circuit (&&, ||, !) operation or a
3097 * comparison. Generate a "1" as value for the true branch. */
3098 true_val = new_Const(get_mode_one(mode_Is));
3100 ir_node *const true_jmp = new_d_Jmp(dbgi);
3102 set_cur_block(false_block);
3103 ir_node *const false_val = expression_to_firm(expression->false_expression);
3104 ir_node *const false_jmp = new_d_Jmp(dbgi);
3106 /* create the common block */
3107 ir_node *const in_cf[2] = { true_jmp, false_jmp };
3108 ir_node *const block = new_Block(lengthof(in_cf), in_cf);
3109 set_cur_block(block);
3111 /* TODO improve static semantics, so either both or no values are NULL */
3112 if (true_val == NULL || false_val == NULL)
3115 ir_node *const in[2] = { true_val, false_val };
3116 type_t *const type = skip_typeref(expression->base.type);
3118 if (is_type_compound(type)) {
3121 mode = get_ir_mode_arithmetic(type);
3123 ir_node *const val = new_d_Phi(dbgi, lengthof(in), in, mode);
3129 * Returns an IR-node representing the address of a field.
3131 static ir_node *select_addr(const select_expression_t *expression)
3133 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3135 construct_select_compound(expression);
3137 ir_node *compound_addr = expression_to_firm(expression->compound);
3139 entity_t *entry = expression->compound_entry;
3140 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3141 assert(entry->declaration.kind == DECLARATION_KIND_COMPOUND_MEMBER);
3143 if (constant_folding) {
3144 ir_mode *mode = get_irn_mode(compound_addr);
3145 ir_mode *mode_uint = get_reference_mode_unsigned_eq(mode);
3146 ir_node *ofs = new_Const_long(mode_uint, entry->compound_member.offset);
3147 return new_d_Add(dbgi, compound_addr, ofs, mode);
3149 ir_entity *irentity = entry->compound_member.entity;
3150 assert(irentity != NULL);
3151 return new_d_simpleSel(dbgi, new_NoMem(), compound_addr, irentity);
3155 static ir_node *select_to_firm(const select_expression_t *expression)
3157 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3158 ir_node *addr = select_addr(expression);
3159 type_t *type = revert_automatic_type_conversion(
3160 (const expression_t*) expression);
3161 type = skip_typeref(type);
3163 entity_t *entry = expression->compound_entry;
3164 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3166 if (entry->compound_member.bitfield) {
3167 return bitfield_extract_to_firm(expression, addr);
3170 return deref_address(dbgi, type, addr);
3173 /* Values returned by __builtin_classify_type. */
3174 typedef enum gcc_type_class
3180 enumeral_type_class,
3183 reference_type_class,
3187 function_type_class,
3198 static ir_node *classify_type_to_firm(const classify_type_expression_t *const expr)
3200 type_t *type = expr->type_expression->base.type;
3202 /* FIXME gcc returns different values depending on whether compiling C or C++
3203 * e.g. int x[10] is pointer_type_class in C, but array_type_class in C++ */
3206 type = skip_typeref(type);
3207 switch (type->kind) {
3209 const atomic_type_t *const atomic_type = &type->atomic;
3210 switch (atomic_type->akind) {
3211 /* should not be reached */
3212 case ATOMIC_TYPE_INVALID:
3216 /* gcc cannot do that */
3217 case ATOMIC_TYPE_VOID:
3218 tc = void_type_class;
3221 case ATOMIC_TYPE_WCHAR_T: /* gcc handles this as integer */
3222 case ATOMIC_TYPE_CHAR: /* gcc handles this as integer */
3223 case ATOMIC_TYPE_SCHAR: /* gcc handles this as integer */
3224 case ATOMIC_TYPE_UCHAR: /* gcc handles this as integer */
3225 case ATOMIC_TYPE_SHORT:
3226 case ATOMIC_TYPE_USHORT:
3227 case ATOMIC_TYPE_INT:
3228 case ATOMIC_TYPE_UINT:
3229 case ATOMIC_TYPE_LONG:
3230 case ATOMIC_TYPE_ULONG:
3231 case ATOMIC_TYPE_LONGLONG:
3232 case ATOMIC_TYPE_ULONGLONG:
3233 case ATOMIC_TYPE_BOOL: /* gcc handles this as integer */
3234 tc = integer_type_class;
3237 case ATOMIC_TYPE_FLOAT:
3238 case ATOMIC_TYPE_DOUBLE:
3239 case ATOMIC_TYPE_LONG_DOUBLE:
3240 tc = real_type_class;
3243 panic("Unexpected atomic type in classify_type_to_firm().");
3246 case TYPE_COMPLEX: tc = complex_type_class; goto make_const;
3247 case TYPE_IMAGINARY: tc = complex_type_class; goto make_const;
3248 case TYPE_ARRAY: /* gcc handles this as pointer */
3249 case TYPE_FUNCTION: /* gcc handles this as pointer */
3250 case TYPE_POINTER: tc = pointer_type_class; goto make_const;
3251 case TYPE_COMPOUND_STRUCT: tc = record_type_class; goto make_const;
3252 case TYPE_COMPOUND_UNION: tc = union_type_class; goto make_const;
3254 /* gcc handles this as integer */
3255 case TYPE_ENUM: tc = integer_type_class; goto make_const;
3257 /* gcc classifies the referenced type */
3258 case TYPE_REFERENCE: type = type->reference.refers_to; continue;
3260 /* typedef/typeof should be skipped already */
3266 panic("unexpected TYPE classify_type_to_firm().");
3270 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
3271 ir_mode *const mode = atomic_modes[ATOMIC_TYPE_INT];
3272 ir_tarval *const tv = new_tarval_from_long(tc, mode);
3273 return new_d_Const(dbgi, tv);
3276 static ir_node *function_name_to_firm(
3277 const funcname_expression_t *const expr)
3279 switch(expr->kind) {
3280 case FUNCNAME_FUNCTION:
3281 case FUNCNAME_PRETTY_FUNCTION:
3282 case FUNCNAME_FUNCDNAME:
3283 if (current_function_name == NULL) {
3284 const source_position_t *const src_pos = &expr->base.source_position;
3285 const char *name = current_function_entity->base.symbol->string;
3286 const string_t string = { name, strlen(name) + 1 };
3287 current_function_name = string_to_firm(src_pos, "__func__.%u", &string);
3289 return current_function_name;
3290 case FUNCNAME_FUNCSIG:
3291 if (current_funcsig == NULL) {
3292 const source_position_t *const src_pos = &expr->base.source_position;
3293 ir_entity *ent = get_irg_entity(current_ir_graph);
3294 const char *const name = get_entity_ld_name(ent);
3295 const string_t string = { name, strlen(name) + 1 };
3296 current_funcsig = string_to_firm(src_pos, "__FUNCSIG__.%u", &string);
3298 return current_funcsig;
3300 panic("Unsupported function name");
3303 static ir_node *statement_expression_to_firm(const statement_expression_t *expr)
3305 statement_t *statement = expr->statement;
3307 assert(statement->kind == STATEMENT_COMPOUND);
3308 return compound_statement_to_firm(&statement->compound);
3311 static ir_node *va_start_expression_to_firm(
3312 const va_start_expression_t *const expr)
3314 ir_entity *param_ent = current_vararg_entity;
3315 if (param_ent == NULL) {
3316 size_t const n = IR_VA_START_PARAMETER_NUMBER;
3317 ir_type *const frame_type = get_irg_frame_type(current_ir_graph);
3318 ir_type *const param_type = get_unknown_type();
3319 param_ent = new_parameter_entity(frame_type, n, param_type);
3320 current_vararg_entity = param_ent;
3323 ir_node *const frame = get_irg_frame(current_ir_graph);
3324 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
3325 ir_node *const no_mem = new_NoMem();
3326 ir_node *const arg_sel = new_d_simpleSel(dbgi, no_mem, frame, param_ent);
3328 set_value_for_expression(expr->ap, arg_sel);
3333 static ir_node *va_arg_expression_to_firm(const va_arg_expression_t *const expr)
3335 type_t *const type = expr->base.type;
3336 expression_t *const ap_expr = expr->ap;
3337 ir_node *const ap_addr = expression_to_addr(ap_expr);
3338 ir_node *const ap = get_value_from_lvalue(ap_expr, ap_addr);
3339 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
3340 ir_node *const res = deref_address(dbgi, type, ap);
3342 ir_node *const cnst = get_type_size_node(expr->base.type);
3343 ir_mode *const mode = get_irn_mode(cnst);
3344 ir_node *const c1 = new_Const_long(mode, stack_param_align - 1);
3345 ir_node *const c2 = new_d_Add(dbgi, cnst, c1, mode);
3346 ir_node *const c3 = new_Const_long(mode, -(long)stack_param_align);
3347 ir_node *const c4 = new_d_And(dbgi, c2, c3, mode);
3348 ir_node *const add = new_d_Add(dbgi, ap, c4, mode_P_data);
3350 set_value_for_expression_addr(ap_expr, add, ap_addr);
3356 * Generate Firm for a va_copy expression.
3358 static ir_node *va_copy_expression_to_firm(const va_copy_expression_t *const expr)
3360 ir_node *const src = expression_to_firm(expr->src);
3361 set_value_for_expression(expr->dst, src);
3365 static ir_node *dereference_addr(const unary_expression_t *const expression)
3367 assert(expression->base.kind == EXPR_UNARY_DEREFERENCE);
3368 return expression_to_firm(expression->value);
3372 * Returns a IR-node representing an lvalue of the given expression.
3374 static ir_node *expression_to_addr(const expression_t *expression)
3376 switch(expression->kind) {
3377 case EXPR_ARRAY_ACCESS:
3378 return array_access_addr(&expression->array_access);
3380 return call_expression_to_firm(&expression->call);
3381 case EXPR_COMPOUND_LITERAL:
3382 return compound_literal_addr(&expression->compound_literal);
3383 case EXPR_REFERENCE:
3384 return reference_addr(&expression->reference);
3386 return select_addr(&expression->select);
3387 case EXPR_UNARY_DEREFERENCE:
3388 return dereference_addr(&expression->unary);
3392 panic("trying to get address of non-lvalue");
3395 static ir_node *builtin_constant_to_firm(
3396 const builtin_constant_expression_t *expression)
3398 ir_mode *const mode = get_ir_mode_arithmetic(expression->base.type);
3399 bool const v = is_constant_expression(expression->value) == EXPR_CLASS_CONSTANT;
3400 return create_Const_from_bool(mode, v);
3403 static ir_node *builtin_types_compatible_to_firm(
3404 const builtin_types_compatible_expression_t *expression)
3406 type_t *const left = get_unqualified_type(skip_typeref(expression->left));
3407 type_t *const right = get_unqualified_type(skip_typeref(expression->right));
3408 bool const value = types_compatible(left, right);
3409 ir_mode *const mode = get_ir_mode_arithmetic(expression->base.type);
3410 return create_Const_from_bool(mode, value);
3413 static ir_node *get_label_block(label_t *label)
3415 if (label->block != NULL)
3416 return label->block;
3418 /* beware: might be called from create initializer with current_ir_graph
3419 * set to const_code_irg. */
3420 ir_graph *rem = current_ir_graph;
3421 current_ir_graph = current_function;
3423 ir_node *block = new_immBlock();
3425 label->block = block;
3427 ARR_APP1(label_t *, all_labels, label);
3429 current_ir_graph = rem;
3434 * Pointer to a label. This is used for the
3435 * GNU address-of-label extension.
3437 static ir_node *label_address_to_firm(const label_address_expression_t *label)
3439 dbg_info *dbgi = get_dbg_info(&label->base.source_position);
3440 ir_node *block = get_label_block(label->label);
3441 ir_entity *entity = create_Block_entity(block);
3443 symconst_symbol value;
3444 value.entity_p = entity;
3445 return new_d_SymConst(dbgi, mode_P_code, value, symconst_addr_ent);
3448 static ir_node *error_to_firm(const expression_t *expression)
3450 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
3451 return new_Bad(mode);
3455 * creates firm nodes for an expression. The difference between this function
3456 * and expression_to_firm is, that this version might produce mode_b nodes
3457 * instead of mode_Is.
3459 static ir_node *_expression_to_firm(const expression_t *expression)
3462 if (!constant_folding) {
3463 assert(!expression->base.transformed);
3464 ((expression_t*) expression)->base.transformed = true;
3468 switch (expression->kind) {
3469 case EXPR_LITERAL_CASES:
3470 return literal_to_firm(&expression->literal);
3471 case EXPR_STRING_LITERAL:
3472 return string_to_firm(&expression->base.source_position, "str.%u",
3473 &expression->literal.value);
3474 case EXPR_WIDE_STRING_LITERAL:
3475 return wide_string_literal_to_firm(&expression->string_literal);
3476 case EXPR_REFERENCE:
3477 return reference_expression_to_firm(&expression->reference);
3478 case EXPR_REFERENCE_ENUM_VALUE:
3479 return reference_expression_enum_value_to_firm(&expression->reference);
3481 return call_expression_to_firm(&expression->call);
3482 case EXPR_UNARY_CASES:
3483 return unary_expression_to_firm(&expression->unary);
3484 case EXPR_BINARY_CASES:
3485 return binary_expression_to_firm(&expression->binary);
3486 case EXPR_ARRAY_ACCESS:
3487 return array_access_to_firm(&expression->array_access);
3489 return sizeof_to_firm(&expression->typeprop);
3491 return alignof_to_firm(&expression->typeprop);
3492 case EXPR_CONDITIONAL:
3493 return conditional_to_firm(&expression->conditional);
3495 return select_to_firm(&expression->select);
3496 case EXPR_CLASSIFY_TYPE:
3497 return classify_type_to_firm(&expression->classify_type);
3499 return function_name_to_firm(&expression->funcname);
3500 case EXPR_STATEMENT:
3501 return statement_expression_to_firm(&expression->statement);
3503 return va_start_expression_to_firm(&expression->va_starte);
3505 return va_arg_expression_to_firm(&expression->va_arge);
3507 return va_copy_expression_to_firm(&expression->va_copye);
3508 case EXPR_BUILTIN_CONSTANT_P:
3509 return builtin_constant_to_firm(&expression->builtin_constant);
3510 case EXPR_BUILTIN_TYPES_COMPATIBLE_P:
3511 return builtin_types_compatible_to_firm(&expression->builtin_types_compatible);
3513 return offsetof_to_firm(&expression->offsetofe);
3514 case EXPR_COMPOUND_LITERAL:
3515 return compound_literal_to_firm(&expression->compound_literal);
3516 case EXPR_LABEL_ADDRESS:
3517 return label_address_to_firm(&expression->label_address);
3520 return error_to_firm(expression);
3522 panic("invalid expression found");
3526 * Check if a given expression is a GNU __builtin_expect() call.
3528 static bool is_builtin_expect(const expression_t *expression)
3530 if (expression->kind != EXPR_CALL)
3533 expression_t *function = expression->call.function;
3534 if (function->kind != EXPR_REFERENCE)
3536 reference_expression_t *ref = &function->reference;
3537 if (ref->entity->kind != ENTITY_FUNCTION ||
3538 ref->entity->function.btk != BUILTIN_EXPECT)
3544 static bool produces_mode_b(const expression_t *expression)
3546 switch (expression->kind) {
3547 case EXPR_BINARY_EQUAL:
3548 case EXPR_BINARY_NOTEQUAL:
3549 case EXPR_BINARY_LESS:
3550 case EXPR_BINARY_LESSEQUAL:
3551 case EXPR_BINARY_GREATER:
3552 case EXPR_BINARY_GREATEREQUAL:
3553 case EXPR_BINARY_ISGREATER:
3554 case EXPR_BINARY_ISGREATEREQUAL:
3555 case EXPR_BINARY_ISLESS:
3556 case EXPR_BINARY_ISLESSEQUAL:
3557 case EXPR_BINARY_ISLESSGREATER:
3558 case EXPR_BINARY_ISUNORDERED:
3559 case EXPR_UNARY_NOT:
3563 if (is_builtin_expect(expression)) {
3564 expression_t *argument = expression->call.arguments->expression;
3565 return produces_mode_b(argument);
3568 case EXPR_BINARY_COMMA:
3569 return produces_mode_b(expression->binary.right);
3576 static ir_node *expression_to_firm(const expression_t *expression)
3578 if (!produces_mode_b(expression)) {
3579 ir_node *res = _expression_to_firm(expression);
3580 assert(res == NULL || get_irn_mode(res) != mode_b);
3584 if (is_constant_expression(expression) == EXPR_CLASS_CONSTANT) {
3585 bool const constant_folding_old = constant_folding;
3586 constant_folding = true;
3587 ir_node *res = _expression_to_firm(expression);
3588 constant_folding = constant_folding_old;
3589 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
3590 assert(is_Const(res));
3591 return create_Const_from_bool(mode, !is_Const_null(res));
3594 /* we have to produce a 0/1 from the mode_b expression */
3595 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3596 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
3597 return produce_condition_result(expression, mode, dbgi);
3601 * create a short-circuit expression evaluation that tries to construct
3602 * efficient control flow structures for &&, || and ! expressions
3604 static ir_node *create_condition_evaluation(const expression_t *expression,
3605 ir_node *true_block,
3606 ir_node *false_block)
3608 switch(expression->kind) {
3609 case EXPR_UNARY_NOT: {
3610 const unary_expression_t *unary_expression = &expression->unary;
3611 create_condition_evaluation(unary_expression->value, false_block,
3615 case EXPR_BINARY_LOGICAL_AND: {
3616 const binary_expression_t *binary_expression = &expression->binary;
3618 ir_node *extra_block = new_immBlock();
3619 create_condition_evaluation(binary_expression->left, extra_block,
3621 mature_immBlock(extra_block);
3622 set_cur_block(extra_block);
3623 create_condition_evaluation(binary_expression->right, true_block,
3627 case EXPR_BINARY_LOGICAL_OR: {
3628 const binary_expression_t *binary_expression = &expression->binary;
3630 ir_node *extra_block = new_immBlock();
3631 create_condition_evaluation(binary_expression->left, true_block,
3633 mature_immBlock(extra_block);
3634 set_cur_block(extra_block);
3635 create_condition_evaluation(binary_expression->right, true_block,
3643 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3644 ir_node *cond_expr = _expression_to_firm(expression);
3645 ir_node *condition = create_conv(dbgi, cond_expr, mode_b);
3646 ir_node *cond = new_d_Cond(dbgi, condition);
3647 ir_node *true_proj = new_d_Proj(dbgi, cond, mode_X, pn_Cond_true);
3648 ir_node *false_proj = new_d_Proj(dbgi, cond, mode_X, pn_Cond_false);
3650 /* set branch prediction info based on __builtin_expect */
3651 if (is_builtin_expect(expression) && is_Cond(cond)) {
3652 call_argument_t *argument = expression->call.arguments->next;
3653 if (is_constant_expression(argument->expression) == EXPR_CLASS_CONSTANT) {
3654 bool const cnst = fold_constant_to_bool(argument->expression);
3655 cond_jmp_predicate const pred = cnst ? COND_JMP_PRED_TRUE : COND_JMP_PRED_FALSE;
3656 set_Cond_jmp_pred(cond, pred);
3660 add_immBlock_pred(true_block, true_proj);
3661 add_immBlock_pred(false_block, false_proj);
3663 set_unreachable_now();
3667 static void create_variable_entity(entity_t *variable,
3668 declaration_kind_t declaration_kind,
3669 ir_type *parent_type)
3671 assert(variable->kind == ENTITY_VARIABLE);
3672 type_t *type = skip_typeref(variable->declaration.type);
3674 ident *const id = new_id_from_str(variable->base.symbol->string);
3675 ir_type *const irtype = get_ir_type(type);
3676 dbg_info *const dbgi = get_dbg_info(&variable->base.source_position);
3677 ir_entity *const irentity = new_d_entity(parent_type, id, irtype, dbgi);
3678 unsigned alignment = variable->declaration.alignment;
3680 set_entity_alignment(irentity, alignment);
3682 handle_decl_modifiers(irentity, variable);
3684 variable->declaration.kind = (unsigned char) declaration_kind;
3685 variable->variable.v.entity = irentity;
3686 set_entity_ld_ident(irentity, create_ld_ident(variable));
3688 if (type->base.qualifiers & TYPE_QUALIFIER_VOLATILE) {
3689 set_entity_volatility(irentity, volatility_is_volatile);
3694 typedef struct type_path_entry_t type_path_entry_t;
3695 struct type_path_entry_t {
3697 ir_initializer_t *initializer;
3699 entity_t *compound_entry;
3702 typedef struct type_path_t type_path_t;
3703 struct type_path_t {
3704 type_path_entry_t *path;
3709 static __attribute__((unused)) void debug_print_type_path(const type_path_t *path)
3711 size_t len = ARR_LEN(path->path);
3713 for (size_t i = 0; i < len; ++i) {
3714 const type_path_entry_t *entry = & path->path[i];
3716 type_t *type = skip_typeref(entry->type);
3717 if (is_type_compound(type)) {
3718 fprintf(stderr, ".%s", entry->compound_entry->base.symbol->string);
3719 } else if (is_type_array(type)) {
3720 fprintf(stderr, "[%u]", (unsigned) entry->index);
3722 fprintf(stderr, "-INVALID-");
3725 fprintf(stderr, " (");
3726 print_type(path->top_type);
3727 fprintf(stderr, ")");
3730 static type_path_entry_t *get_type_path_top(const type_path_t *path)
3732 size_t len = ARR_LEN(path->path);
3734 return & path->path[len-1];
3737 static type_path_entry_t *append_to_type_path(type_path_t *path)
3739 size_t len = ARR_LEN(path->path);
3740 ARR_RESIZE(type_path_entry_t, path->path, len+1);
3742 type_path_entry_t *result = & path->path[len];
3743 memset(result, 0, sizeof(result[0]));
3747 static size_t get_compound_member_count(const compound_type_t *type)
3749 compound_t *compound = type->compound;
3750 size_t n_members = 0;
3751 entity_t *member = compound->members.entities;
3752 for ( ; member != NULL; member = member->base.next) {
3759 static ir_initializer_t *get_initializer_entry(type_path_t *path)
3761 type_t *orig_top_type = path->top_type;
3762 type_t *top_type = skip_typeref(orig_top_type);
3764 assert(is_type_compound(top_type) || is_type_array(top_type));
3766 if (ARR_LEN(path->path) == 0) {
3769 type_path_entry_t *top = get_type_path_top(path);
3770 ir_initializer_t *initializer = top->initializer;
3771 return get_initializer_compound_value(initializer, top->index);
3775 static void descend_into_subtype(type_path_t *path)
3777 type_t *orig_top_type = path->top_type;
3778 type_t *top_type = skip_typeref(orig_top_type);
3780 assert(is_type_compound(top_type) || is_type_array(top_type));
3782 ir_initializer_t *initializer = get_initializer_entry(path);
3784 type_path_entry_t *top = append_to_type_path(path);
3785 top->type = top_type;
3789 if (is_type_compound(top_type)) {
3790 compound_t *const compound = top_type->compound.compound;
3791 entity_t *const entry = skip_unnamed_bitfields(compound->members.entities);
3793 top->compound_entry = entry;
3795 len = get_compound_member_count(&top_type->compound);
3796 if (entry != NULL) {
3797 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3798 path->top_type = entry->declaration.type;
3801 assert(is_type_array(top_type));
3802 assert(top_type->array.size > 0);
3805 path->top_type = top_type->array.element_type;
3806 len = top_type->array.size;
3808 if (initializer == NULL
3809 || get_initializer_kind(initializer) == IR_INITIALIZER_NULL) {
3810 initializer = create_initializer_compound(len);
3811 /* we have to set the entry at the 2nd latest path entry... */
3812 size_t path_len = ARR_LEN(path->path);
3813 assert(path_len >= 1);
3815 type_path_entry_t *entry = & path->path[path_len-2];
3816 ir_initializer_t *tinitializer = entry->initializer;
3817 set_initializer_compound_value(tinitializer, entry->index,
3821 top->initializer = initializer;
3824 static void ascend_from_subtype(type_path_t *path)
3826 type_path_entry_t *top = get_type_path_top(path);
3828 path->top_type = top->type;
3830 size_t len = ARR_LEN(path->path);
3831 ARR_RESIZE(type_path_entry_t, path->path, len-1);
3834 static void walk_designator(type_path_t *path, const designator_t *designator)
3836 /* designators start at current object type */
3837 ARR_RESIZE(type_path_entry_t, path->path, 1);
3839 for ( ; designator != NULL; designator = designator->next) {
3840 type_path_entry_t *top = get_type_path_top(path);
3841 type_t *orig_type = top->type;
3842 type_t *type = skip_typeref(orig_type);
3844 if (designator->symbol != NULL) {
3845 assert(is_type_compound(type));
3847 symbol_t *symbol = designator->symbol;
3849 compound_t *compound = type->compound.compound;
3850 entity_t *iter = compound->members.entities;
3851 for ( ; iter != NULL; iter = iter->base.next, ++index) {
3852 if (iter->base.symbol == symbol) {
3853 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
3857 assert(iter != NULL);
3859 /* revert previous initialisations of other union elements */
3860 if (type->kind == TYPE_COMPOUND_UNION) {
3861 ir_initializer_t *initializer = top->initializer;
3862 if (initializer != NULL
3863 && get_initializer_kind(initializer) == IR_INITIALIZER_COMPOUND) {
3864 /* are we writing to a new element? */
3865 ir_initializer_t *oldi
3866 = get_initializer_compound_value(initializer, index);
3867 if (get_initializer_kind(oldi) == IR_INITIALIZER_NULL) {
3868 /* clear initializer */
3870 = get_initializer_compound_n_entries(initializer);
3871 ir_initializer_t *nulli = get_initializer_null();
3872 for (size_t i = 0; i < len; ++i) {
3873 set_initializer_compound_value(initializer, i,
3880 top->type = orig_type;
3881 top->compound_entry = iter;
3883 orig_type = iter->declaration.type;
3885 expression_t *array_index = designator->array_index;
3886 assert(designator->array_index != NULL);
3887 assert(is_type_array(type));
3889 long index = fold_constant_to_int(array_index);
3892 if (type->array.size_constant) {
3893 long array_size = type->array.size;
3894 assert(index < array_size);
3898 top->type = orig_type;
3899 top->index = (size_t) index;
3900 orig_type = type->array.element_type;
3902 path->top_type = orig_type;
3904 if (designator->next != NULL) {
3905 descend_into_subtype(path);
3909 path->invalid = false;
3912 static void advance_current_object(type_path_t *path)
3914 if (path->invalid) {
3915 /* TODO: handle this... */
3916 panic("invalid initializer in ast2firm (excessive elements)");
3919 type_path_entry_t *top = get_type_path_top(path);
3921 type_t *type = skip_typeref(top->type);
3922 if (is_type_union(type)) {
3923 /* only the first element is initialized in unions */
3924 top->compound_entry = NULL;
3925 } else if (is_type_struct(type)) {
3926 entity_t *entry = top->compound_entry;
3929 entry = skip_unnamed_bitfields(entry->base.next);
3930 top->compound_entry = entry;
3931 if (entry != NULL) {
3932 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3933 path->top_type = entry->declaration.type;
3937 assert(is_type_array(type));
3940 if (!type->array.size_constant || top->index < type->array.size) {
3945 /* we're past the last member of the current sub-aggregate, try if we
3946 * can ascend in the type hierarchy and continue with another subobject */
3947 size_t len = ARR_LEN(path->path);
3950 ascend_from_subtype(path);
3951 advance_current_object(path);
3953 path->invalid = true;
3958 static ir_initializer_t *create_ir_initializer_value(
3959 const initializer_value_t *initializer)
3961 if (is_type_compound(initializer->value->base.type)) {
3962 panic("initializer creation for compounds not implemented yet");
3964 type_t *type = initializer->value->base.type;
3965 expression_t *expr = initializer->value;
3966 ir_node *value = expression_to_firm(expr);
3967 ir_mode *mode = get_ir_mode_storage(type);
3968 value = create_conv(NULL, value, mode);
3969 return create_initializer_const(value);
3972 /** test wether type can be initialized by a string constant */
3973 static bool is_string_type(type_t *type)
3976 if (is_type_pointer(type)) {
3977 inner = skip_typeref(type->pointer.points_to);
3978 } else if(is_type_array(type)) {
3979 inner = skip_typeref(type->array.element_type);
3984 return is_type_integer(inner);
3987 static ir_initializer_t *create_ir_initializer_list(
3988 const initializer_list_t *initializer, type_t *type)
3991 memset(&path, 0, sizeof(path));
3992 path.top_type = type;
3993 path.path = NEW_ARR_F(type_path_entry_t, 0);
3995 descend_into_subtype(&path);
3997 for (size_t i = 0; i < initializer->len; ++i) {
3998 const initializer_t *sub_initializer = initializer->initializers[i];
4000 if (sub_initializer->kind == INITIALIZER_DESIGNATOR) {
4001 walk_designator(&path, sub_initializer->designator.designator);
4005 if (sub_initializer->kind == INITIALIZER_VALUE) {
4006 /* we might have to descend into types until we're at a scalar
4009 type_t *orig_top_type = path.top_type;
4010 type_t *top_type = skip_typeref(orig_top_type);
4012 if (is_type_scalar(top_type))
4014 descend_into_subtype(&path);
4016 } else if (sub_initializer->kind == INITIALIZER_STRING
4017 || sub_initializer->kind == INITIALIZER_WIDE_STRING) {
4018 /* we might have to descend into types until we're at a scalar
4021 type_t *orig_top_type = path.top_type;
4022 type_t *top_type = skip_typeref(orig_top_type);
4024 if (is_string_type(top_type))
4026 descend_into_subtype(&path);
4030 ir_initializer_t *sub_irinitializer
4031 = create_ir_initializer(sub_initializer, path.top_type);
4033 size_t path_len = ARR_LEN(path.path);
4034 assert(path_len >= 1);
4035 type_path_entry_t *entry = & path.path[path_len-1];
4036 ir_initializer_t *tinitializer = entry->initializer;
4037 set_initializer_compound_value(tinitializer, entry->index,
4040 advance_current_object(&path);
4043 assert(ARR_LEN(path.path) >= 1);
4044 ir_initializer_t *result = path.path[0].initializer;
4045 DEL_ARR_F(path.path);
4050 static ir_initializer_t *create_ir_initializer_string(
4051 const initializer_string_t *initializer, type_t *type)
4053 type = skip_typeref(type);
4055 size_t string_len = initializer->string.size;
4056 assert(type->kind == TYPE_ARRAY);
4057 assert(type->array.size_constant);
4058 size_t len = type->array.size;
4059 ir_initializer_t *irinitializer = create_initializer_compound(len);
4061 const char *string = initializer->string.begin;
4062 ir_mode *mode = get_ir_mode_storage(type->array.element_type);
4064 for (size_t i = 0; i < len; ++i) {
4069 ir_tarval *tv = new_tarval_from_long(c, mode);
4070 ir_initializer_t *char_initializer = create_initializer_tarval(tv);
4072 set_initializer_compound_value(irinitializer, i, char_initializer);
4075 return irinitializer;
4078 static ir_initializer_t *create_ir_initializer_wide_string(
4079 const initializer_wide_string_t *initializer, type_t *type)
4081 assert(type->kind == TYPE_ARRAY);
4082 assert(type->array.size_constant);
4083 size_t len = type->array.size;
4084 size_t string_len = wstrlen(&initializer->string);
4085 ir_initializer_t *irinitializer = create_initializer_compound(len);
4087 const char *p = initializer->string.begin;
4088 ir_mode *mode = get_type_mode(ir_type_wchar_t);
4090 for (size_t i = 0; i < len; ++i) {
4092 if (i < string_len) {
4093 c = read_utf8_char(&p);
4095 ir_tarval *tv = new_tarval_from_long(c, mode);
4096 ir_initializer_t *char_initializer = create_initializer_tarval(tv);
4098 set_initializer_compound_value(irinitializer, i, char_initializer);
4101 return irinitializer;
4104 static ir_initializer_t *create_ir_initializer(
4105 const initializer_t *initializer, type_t *type)
4107 switch(initializer->kind) {
4108 case INITIALIZER_STRING:
4109 return create_ir_initializer_string(&initializer->string, type);
4111 case INITIALIZER_WIDE_STRING:
4112 return create_ir_initializer_wide_string(&initializer->wide_string,
4115 case INITIALIZER_LIST:
4116 return create_ir_initializer_list(&initializer->list, type);
4118 case INITIALIZER_VALUE:
4119 return create_ir_initializer_value(&initializer->value);
4121 case INITIALIZER_DESIGNATOR:
4122 panic("unexpected designator initializer found");
4124 panic("unknown initializer");
4127 /** ANSI C ยง6.7.8:21: If there are fewer initializers [..] than there
4128 * are elements [...] the remainder of the aggregate shall be initialized
4129 * implicitly the same as objects that have static storage duration. */
4130 static void create_dynamic_null_initializer(ir_entity *entity, dbg_info *dbgi,
4133 /* for unions we must NOT do anything for null initializers */
4134 ir_type *owner = get_entity_owner(entity);
4135 if (is_Union_type(owner)) {
4139 ir_type *ent_type = get_entity_type(entity);
4140 /* create sub-initializers for a compound type */
4141 if (is_compound_type(ent_type)) {
4142 unsigned n_members = get_compound_n_members(ent_type);
4143 for (unsigned n = 0; n < n_members; ++n) {
4144 ir_entity *member = get_compound_member(ent_type, n);
4145 ir_node *addr = new_d_simpleSel(dbgi, new_NoMem(), base_addr,
4147 create_dynamic_null_initializer(member, dbgi, addr);
4151 if (is_Array_type(ent_type)) {
4152 assert(has_array_upper_bound(ent_type, 0));
4153 long n = get_array_upper_bound_int(ent_type, 0);
4154 for (long i = 0; i < n; ++i) {
4155 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
4156 ir_tarval *index_tv = new_tarval_from_long(i, mode_uint);
4157 ir_node *cnst = new_d_Const(dbgi, index_tv);
4158 ir_node *in[1] = { cnst };
4159 ir_entity *arrent = get_array_element_entity(ent_type);
4160 ir_node *addr = new_d_Sel(dbgi, new_NoMem(), base_addr, 1, in,
4162 create_dynamic_null_initializer(arrent, dbgi, addr);
4167 ir_mode *value_mode = get_type_mode(ent_type);
4168 ir_node *node = new_Const(get_mode_null(value_mode));
4170 /* is it a bitfield type? */
4171 if (is_Primitive_type(ent_type) &&
4172 get_primitive_base_type(ent_type) != NULL) {
4173 bitfield_store_to_firm(dbgi, entity, base_addr, node, false, false);
4177 ir_node *mem = get_store();
4178 ir_node *store = new_d_Store(dbgi, mem, base_addr, node, cons_none);
4179 ir_node *proj_m = new_Proj(store, mode_M, pn_Store_M);
4183 static void create_dynamic_initializer_sub(ir_initializer_t *initializer,
4184 ir_entity *entity, ir_type *type, dbg_info *dbgi, ir_node *base_addr)
4186 switch(get_initializer_kind(initializer)) {
4187 case IR_INITIALIZER_NULL:
4188 create_dynamic_null_initializer(entity, dbgi, base_addr);
4190 case IR_INITIALIZER_CONST: {
4191 ir_node *node = get_initializer_const_value(initializer);
4192 ir_type *ent_type = get_entity_type(entity);
4194 /* is it a bitfield type? */
4195 if (is_Primitive_type(ent_type) &&
4196 get_primitive_base_type(ent_type) != NULL) {
4197 bitfield_store_to_firm(dbgi, entity, base_addr, node, false, false);
4201 assert(get_type_mode(type) == get_irn_mode(node));
4202 ir_node *mem = get_store();
4203 ir_node *store = new_d_Store(dbgi, mem, base_addr, node, cons_none);
4204 ir_node *proj_m = new_Proj(store, mode_M, pn_Store_M);
4208 case IR_INITIALIZER_TARVAL: {
4209 ir_tarval *tv = get_initializer_tarval_value(initializer);
4210 ir_node *cnst = new_d_Const(dbgi, tv);
4211 ir_type *ent_type = get_entity_type(entity);
4213 /* is it a bitfield type? */
4214 if (is_Primitive_type(ent_type) &&
4215 get_primitive_base_type(ent_type) != NULL) {
4216 bitfield_store_to_firm(dbgi, entity, base_addr, cnst, false, false);
4220 assert(get_type_mode(type) == get_tarval_mode(tv));
4221 ir_node *mem = get_store();
4222 ir_node *store = new_d_Store(dbgi, mem, base_addr, cnst, cons_none);
4223 ir_node *proj_m = new_Proj(store, mode_M, pn_Store_M);
4227 case IR_INITIALIZER_COMPOUND: {
4228 assert(is_compound_type(type) || is_Array_type(type));
4230 if (is_Array_type(type)) {
4231 assert(has_array_upper_bound(type, 0));
4232 n_members = get_array_upper_bound_int(type, 0);
4234 n_members = get_compound_n_members(type);
4237 if (get_initializer_compound_n_entries(initializer)
4238 != (unsigned) n_members)
4239 panic("initializer doesn't match compound type");
4241 for (int i = 0; i < n_members; ++i) {
4244 ir_entity *sub_entity;
4245 if (is_Array_type(type)) {
4246 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
4247 ir_tarval *index_tv = new_tarval_from_long(i, mode_uint);
4248 ir_node *cnst = new_d_Const(dbgi, index_tv);
4249 ir_node *in[1] = { cnst };
4250 irtype = get_array_element_type(type);
4251 sub_entity = get_array_element_entity(type);
4252 addr = new_d_Sel(dbgi, new_NoMem(), base_addr, 1, in,
4255 sub_entity = get_compound_member(type, i);
4256 irtype = get_entity_type(sub_entity);
4257 addr = new_d_simpleSel(dbgi, new_NoMem(), base_addr,
4261 ir_initializer_t *sub_init
4262 = get_initializer_compound_value(initializer, i);
4264 create_dynamic_initializer_sub(sub_init, sub_entity, irtype, dbgi,
4271 panic("invalid IR_INITIALIZER found");
4274 static void create_dynamic_initializer(ir_initializer_t *initializer,
4275 dbg_info *dbgi, ir_entity *entity)
4277 ir_node *frame = get_irg_frame(current_ir_graph);
4278 ir_node *base_addr = new_d_simpleSel(dbgi, new_NoMem(), frame, entity);
4279 ir_type *type = get_entity_type(entity);
4281 create_dynamic_initializer_sub(initializer, entity, type, dbgi, base_addr);
4284 static void create_local_initializer(initializer_t *initializer, dbg_info *dbgi,
4285 ir_entity *entity, type_t *type)
4287 ir_node *memory = get_store();
4288 ir_node *nomem = new_NoMem();
4289 ir_node *frame = get_irg_frame(current_ir_graph);
4290 ir_node *addr = new_d_simpleSel(dbgi, nomem, frame, entity);
4292 if (initializer->kind == INITIALIZER_VALUE) {
4293 initializer_value_t *initializer_value = &initializer->value;
4295 ir_node *value = expression_to_firm(initializer_value->value);
4296 type = skip_typeref(type);
4297 assign_value(dbgi, addr, type, value);
4301 if (is_constant_initializer(initializer) == EXPR_CLASS_VARIABLE) {
4302 ir_initializer_t *irinitializer
4303 = create_ir_initializer(initializer, type);
4305 create_dynamic_initializer(irinitializer, dbgi, entity);
4309 /* create a "template" entity which is copied to the entity on the stack */
4310 ir_entity *const init_entity
4311 = create_initializer_entity(dbgi, initializer, type);
4312 ir_node *const src_addr = create_symconst(dbgi, init_entity);
4313 ir_type *const irtype = get_ir_type(type);
4314 ir_node *const copyb = new_d_CopyB(dbgi, memory, addr, src_addr, irtype);
4316 ir_node *const copyb_mem = new_Proj(copyb, mode_M, pn_CopyB_M);
4317 set_store(copyb_mem);
4320 static void create_initializer_local_variable_entity(entity_t *entity)
4322 assert(entity->kind == ENTITY_VARIABLE);
4323 initializer_t *initializer = entity->variable.initializer;
4324 dbg_info *dbgi = get_dbg_info(&entity->base.source_position);
4325 ir_entity *irentity = entity->variable.v.entity;
4326 type_t *type = entity->declaration.type;
4328 create_local_initializer(initializer, dbgi, irentity, type);
4331 static void create_variable_initializer(entity_t *entity)
4333 assert(entity->kind == ENTITY_VARIABLE);
4334 initializer_t *initializer = entity->variable.initializer;
4335 if (initializer == NULL)
4338 declaration_kind_t declaration_kind
4339 = (declaration_kind_t) entity->declaration.kind;
4340 if (declaration_kind == DECLARATION_KIND_LOCAL_VARIABLE_ENTITY) {
4341 create_initializer_local_variable_entity(entity);
4345 type_t *type = entity->declaration.type;
4346 type_qualifiers_t tq = get_type_qualifier(type, true);
4348 if (initializer->kind == INITIALIZER_VALUE) {
4349 initializer_value_t *initializer_value = &initializer->value;
4350 dbg_info *dbgi = get_dbg_info(&entity->base.source_position);
4351 expression_t *value = initializer_value->value;
4352 type_t *init_type = value->base.type;
4353 type_t *skipped = skip_typeref(init_type);
4355 if (!is_type_scalar(skipped)) {
4357 while (value->kind == EXPR_UNARY_CAST)
4358 value = value->unary.value;
4360 if (value->kind != EXPR_COMPOUND_LITERAL)
4361 panic("expected non-scalar initializer to be a compound literal");
4362 initializer = value->compound_literal.initializer;
4363 goto have_initializer;
4366 ir_node *node = expression_to_firm(initializer_value->value);
4368 ir_mode *mode = get_ir_mode_storage(init_type);
4369 node = create_conv(dbgi, node, mode);
4370 node = do_strict_conv(dbgi, node);
4372 if (declaration_kind == DECLARATION_KIND_LOCAL_VARIABLE) {
4373 set_value(entity->variable.v.value_number, node);
4375 assert(declaration_kind == DECLARATION_KIND_GLOBAL_VARIABLE);
4377 ir_entity *irentity = entity->variable.v.entity;
4379 if (tq & TYPE_QUALIFIER_CONST
4380 && get_entity_owner(irentity) != get_tls_type()) {
4381 add_entity_linkage(irentity, IR_LINKAGE_CONSTANT);
4383 set_atomic_ent_value(irentity, node);
4387 assert(declaration_kind == DECLARATION_KIND_LOCAL_VARIABLE_ENTITY ||
4388 declaration_kind == DECLARATION_KIND_GLOBAL_VARIABLE);
4390 ir_entity *irentity = entity->variable.v.entity;
4391 ir_initializer_t *irinitializer
4392 = create_ir_initializer(initializer, type);
4394 if (tq & TYPE_QUALIFIER_CONST) {
4395 add_entity_linkage(irentity, IR_LINKAGE_CONSTANT);
4397 set_entity_initializer(irentity, irinitializer);
4401 static void create_variable_length_array(entity_t *entity)
4403 assert(entity->kind == ENTITY_VARIABLE);
4404 assert(entity->variable.initializer == NULL);
4406 entity->declaration.kind = DECLARATION_KIND_VARIABLE_LENGTH_ARRAY;
4407 entity->variable.v.vla_base = NULL;
4409 /* TODO: record VLA somewhere so we create the free node when we leave
4413 static void allocate_variable_length_array(entity_t *entity)
4415 assert(entity->kind == ENTITY_VARIABLE);
4416 assert(entity->variable.initializer == NULL);
4417 assert(currently_reachable());
4419 dbg_info *dbgi = get_dbg_info(&entity->base.source_position);
4420 type_t *type = entity->declaration.type;
4421 ir_type *el_type = get_ir_type(type->array.element_type);
4423 /* make sure size_node is calculated */
4424 get_type_size_node(type);
4425 ir_node *elems = type->array.size_node;
4426 ir_node *mem = get_store();
4427 ir_node *alloc = new_d_Alloc(dbgi, mem, elems, el_type, stack_alloc);
4429 ir_node *proj_m = new_d_Proj(dbgi, alloc, mode_M, pn_Alloc_M);
4430 ir_node *addr = new_d_Proj(dbgi, alloc, mode_P_data, pn_Alloc_res);
4433 assert(entity->declaration.kind == DECLARATION_KIND_VARIABLE_LENGTH_ARRAY);
4434 entity->variable.v.vla_base = addr;
4438 * Creates a Firm local variable from a declaration.
4440 static void create_local_variable(entity_t *entity)
4442 assert(entity->kind == ENTITY_VARIABLE);
4443 assert(entity->declaration.kind == DECLARATION_KIND_UNKNOWN);
4445 bool needs_entity = entity->variable.address_taken;
4446 type_t *type = skip_typeref(entity->declaration.type);
4448 /* is it a variable length array? */
4449 if (is_type_array(type) && !type->array.size_constant) {
4450 create_variable_length_array(entity);
4452 } else if (is_type_array(type) || is_type_compound(type)) {
4453 needs_entity = true;
4454 } else if (type->base.qualifiers & TYPE_QUALIFIER_VOLATILE) {
4455 needs_entity = true;
4459 ir_type *frame_type = get_irg_frame_type(current_ir_graph);
4460 create_variable_entity(entity,
4461 DECLARATION_KIND_LOCAL_VARIABLE_ENTITY,
4464 entity->declaration.kind = DECLARATION_KIND_LOCAL_VARIABLE;
4465 entity->variable.v.value_number = next_value_number_function;
4466 set_irg_loc_description(current_ir_graph, next_value_number_function,
4468 ++next_value_number_function;
4472 static void create_local_static_variable(entity_t *entity)
4474 assert(entity->kind == ENTITY_VARIABLE);
4475 assert(entity->declaration.kind == DECLARATION_KIND_UNKNOWN);
4477 type_t *type = skip_typeref(entity->declaration.type);
4478 ir_type *const var_type = entity->variable.thread_local ?
4479 get_tls_type() : get_glob_type();
4480 ir_type *const irtype = get_ir_type(type);
4481 dbg_info *const dbgi = get_dbg_info(&entity->base.source_position);
4483 size_t l = strlen(entity->base.symbol->string);
4484 char buf[l + sizeof(".%u")];
4485 snprintf(buf, sizeof(buf), "%s.%%u", entity->base.symbol->string);
4486 ident *const id = id_unique(buf);
4487 ir_entity *const irentity = new_d_entity(var_type, id, irtype, dbgi);
4489 if (type->base.qualifiers & TYPE_QUALIFIER_VOLATILE) {
4490 set_entity_volatility(irentity, volatility_is_volatile);
4493 entity->declaration.kind = DECLARATION_KIND_GLOBAL_VARIABLE;
4494 entity->variable.v.entity = irentity;
4496 set_entity_ld_ident(irentity, id);
4497 set_entity_visibility(irentity, ir_visibility_local);
4499 ir_graph *const old_current_ir_graph = current_ir_graph;
4500 current_ir_graph = get_const_code_irg();
4502 create_variable_initializer(entity);
4504 assert(current_ir_graph == get_const_code_irg());
4505 current_ir_graph = old_current_ir_graph;
4510 static void return_statement_to_firm(return_statement_t *statement)
4512 if (!currently_reachable())
4515 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
4516 type_t *type = current_function_entity->declaration.type;
4517 ir_type *func_irtype = get_ir_type(type);
4521 if (get_method_n_ress(func_irtype) > 0) {
4522 ir_type *res_type = get_method_res_type(func_irtype, 0);
4524 if (statement->value != NULL) {
4525 ir_node *node = expression_to_firm(statement->value);
4526 if (!is_compound_type(res_type)) {
4527 type_t *ret_value_type = statement->value->base.type;
4528 ir_mode *mode = get_ir_mode_storage(ret_value_type);
4529 node = create_conv(dbgi, node, mode);
4530 node = do_strict_conv(dbgi, node);
4535 if (is_compound_type(res_type)) {
4538 mode = get_type_mode(res_type);
4540 in[0] = new_Unknown(mode);
4544 /* build return_value for its side effects */
4545 if (statement->value != NULL) {
4546 expression_to_firm(statement->value);
4551 ir_node *store = get_store();
4552 ir_node *ret = new_d_Return(dbgi, store, in_len, in);
4554 ir_node *end_block = get_irg_end_block(current_ir_graph);
4555 add_immBlock_pred(end_block, ret);
4557 set_unreachable_now();
4560 static ir_node *expression_statement_to_firm(expression_statement_t *statement)
4562 if (!currently_reachable())
4565 return expression_to_firm(statement->expression);
4568 static ir_node *compound_statement_to_firm(compound_statement_t *compound)
4570 entity_t *entity = compound->scope.entities;
4571 for ( ; entity != NULL; entity = entity->base.next) {
4572 if (!is_declaration(entity))
4575 create_local_declaration(entity);
4578 ir_node *result = NULL;
4579 statement_t *statement = compound->statements;
4580 for ( ; statement != NULL; statement = statement->base.next) {
4581 if (statement->base.next == NULL
4582 && statement->kind == STATEMENT_EXPRESSION) {
4583 result = expression_statement_to_firm(
4584 &statement->expression);
4587 statement_to_firm(statement);
4593 static void create_global_variable(entity_t *entity)
4595 ir_linkage linkage = IR_LINKAGE_DEFAULT;
4596 ir_visibility visibility = ir_visibility_default;
4597 ir_entity *irentity;
4598 assert(entity->kind == ENTITY_VARIABLE);
4600 switch ((storage_class_tag_t)entity->declaration.storage_class) {
4601 case STORAGE_CLASS_EXTERN: visibility = ir_visibility_external; break;
4602 case STORAGE_CLASS_STATIC: visibility = ir_visibility_local; break;
4603 case STORAGE_CLASS_NONE:
4604 visibility = ir_visibility_default;
4605 /* uninitialized globals get merged in C */
4606 if (entity->variable.initializer == NULL)
4607 linkage |= IR_LINKAGE_MERGE;
4609 case STORAGE_CLASS_TYPEDEF:
4610 case STORAGE_CLASS_AUTO:
4611 case STORAGE_CLASS_REGISTER:
4612 panic("invalid storage class for global var");
4615 ir_type *var_type = get_glob_type();
4616 if (entity->variable.thread_local) {
4617 var_type = get_tls_type();
4618 /* LINKAGE_MERGE not supported by current linkers */
4619 linkage &= ~IR_LINKAGE_MERGE;
4621 create_variable_entity(entity, DECLARATION_KIND_GLOBAL_VARIABLE, var_type);
4622 irentity = entity->variable.v.entity;
4623 add_entity_linkage(irentity, linkage);
4624 set_entity_visibility(irentity, visibility);
4627 static void create_local_declaration(entity_t *entity)
4629 assert(is_declaration(entity));
4631 /* construct type */
4632 (void) get_ir_type(entity->declaration.type);
4633 if (entity->base.symbol == NULL) {
4637 switch ((storage_class_tag_t) entity->declaration.storage_class) {
4638 case STORAGE_CLASS_STATIC:
4639 if (entity->kind == ENTITY_FUNCTION) {
4640 (void)get_function_entity(entity, NULL);
4642 create_local_static_variable(entity);
4645 case STORAGE_CLASS_EXTERN:
4646 if (entity->kind == ENTITY_FUNCTION) {
4647 assert(entity->function.statement == NULL);
4648 (void)get_function_entity(entity, NULL);
4650 create_global_variable(entity);
4651 create_variable_initializer(entity);
4654 case STORAGE_CLASS_NONE:
4655 case STORAGE_CLASS_AUTO:
4656 case STORAGE_CLASS_REGISTER:
4657 if (entity->kind == ENTITY_FUNCTION) {
4658 if (entity->function.statement != NULL) {
4659 ir_type *owner = get_irg_frame_type(current_ir_graph);
4660 (void)get_function_entity(entity, owner);
4661 entity->declaration.kind = DECLARATION_KIND_INNER_FUNCTION;
4662 enqueue_inner_function(entity);
4664 (void)get_function_entity(entity, NULL);
4667 create_local_variable(entity);
4670 case STORAGE_CLASS_TYPEDEF:
4673 panic("invalid storage class found");
4676 static void initialize_local_declaration(entity_t *entity)
4678 if (entity->base.symbol == NULL)
4681 // no need to emit code in dead blocks
4682 if (entity->declaration.storage_class != STORAGE_CLASS_STATIC
4683 && !currently_reachable())
4686 switch ((declaration_kind_t) entity->declaration.kind) {
4687 case DECLARATION_KIND_LOCAL_VARIABLE:
4688 case DECLARATION_KIND_LOCAL_VARIABLE_ENTITY:
4689 create_variable_initializer(entity);
4692 case DECLARATION_KIND_VARIABLE_LENGTH_ARRAY:
4693 allocate_variable_length_array(entity);
4696 case DECLARATION_KIND_COMPOUND_MEMBER:
4697 case DECLARATION_KIND_GLOBAL_VARIABLE:
4698 case DECLARATION_KIND_FUNCTION:
4699 case DECLARATION_KIND_INNER_FUNCTION:
4702 case DECLARATION_KIND_PARAMETER:
4703 case DECLARATION_KIND_PARAMETER_ENTITY:
4704 panic("can't initialize parameters");
4706 case DECLARATION_KIND_UNKNOWN:
4707 panic("can't initialize unknown declaration");
4709 panic("invalid declaration kind");
4712 static void declaration_statement_to_firm(declaration_statement_t *statement)
4714 entity_t *entity = statement->declarations_begin;
4718 entity_t *const last = statement->declarations_end;
4719 for ( ;; entity = entity->base.next) {
4720 if (is_declaration(entity)) {
4721 initialize_local_declaration(entity);
4722 } else if (entity->kind == ENTITY_TYPEDEF) {
4723 /* ยง6.7.7:3 Any array size expressions associated with variable length
4724 * array declarators are evaluated each time the declaration of the
4725 * typedef name is reached in the order of execution. */
4726 type_t *const type = skip_typeref(entity->typedefe.type);
4727 if (is_type_array(type) && type->array.is_vla)
4728 get_vla_size(&type->array);
4735 static void if_statement_to_firm(if_statement_t *statement)
4737 /* Create the condition. */
4738 ir_node *true_block = NULL;
4739 ir_node *false_block = NULL;
4740 if (currently_reachable()) {
4741 true_block = new_immBlock();
4742 false_block = new_immBlock();
4743 create_condition_evaluation(statement->condition, true_block, false_block);
4744 mature_immBlock(true_block);
4745 mature_immBlock(false_block);
4748 /* Create the true statement. */
4749 set_cur_block(true_block);
4750 statement_to_firm(statement->true_statement);
4751 ir_node *fallthrough_block = get_cur_block();
4753 /* Create the false statement. */
4754 set_cur_block(false_block);
4755 if (statement->false_statement != NULL) {
4756 statement_to_firm(statement->false_statement);
4759 /* Handle the block after the if-statement. Minor simplification and
4760 * optimisation: Reuse the false/true block as fallthrough block, if the
4761 * true/false statement does not pass control to the fallthrough block, e.g.
4762 * in the typical if (x) return; pattern. */
4763 if (fallthrough_block) {
4764 if (currently_reachable()) {
4765 ir_node *const t_jump = new_r_Jmp(fallthrough_block);
4766 ir_node *const f_jump = new_Jmp();
4767 ir_node *const in[] = { t_jump, f_jump };
4768 fallthrough_block = new_Block(2, in);
4770 set_cur_block(fallthrough_block);
4774 /* Create a jump node which jumps into target_block, if the current block is
4776 static void jump_if_reachable(ir_node *const target_block)
4778 ir_node *const pred = currently_reachable() ? new_Jmp() : new_Bad(mode_X);
4779 add_immBlock_pred(target_block, pred);
4782 static void while_statement_to_firm(while_statement_t *statement)
4784 /* Create the header block */
4785 ir_node *const header_block = new_immBlock();
4786 jump_if_reachable(header_block);
4788 /* Create the condition. */
4789 ir_node * body_block;
4790 ir_node * false_block;
4791 expression_t *const cond = statement->condition;
4792 if (is_constant_expression(cond) == EXPR_CLASS_CONSTANT &&
4793 fold_constant_to_bool(cond)) {
4794 /* Shortcut for while (true). */
4795 body_block = header_block;
4798 keep_alive(header_block);
4799 keep_all_memory(header_block);
4801 body_block = new_immBlock();
4802 false_block = new_immBlock();
4804 set_cur_block(header_block);
4805 create_condition_evaluation(cond, body_block, false_block);
4806 mature_immBlock(body_block);
4809 ir_node *const old_continue_label = continue_label;
4810 ir_node *const old_break_label = break_label;
4811 continue_label = header_block;
4812 break_label = false_block;
4814 /* Create the loop body. */
4815 set_cur_block(body_block);
4816 statement_to_firm(statement->body);
4817 jump_if_reachable(header_block);
4819 mature_immBlock(header_block);
4820 assert(false_block == NULL || false_block == break_label);
4821 false_block = break_label;
4822 if (false_block != NULL) {
4823 mature_immBlock(false_block);
4825 set_cur_block(false_block);
4827 assert(continue_label == header_block);
4828 continue_label = old_continue_label;
4829 break_label = old_break_label;
4832 static ir_node *get_break_label(void)
4834 if (break_label == NULL) {
4835 break_label = new_immBlock();
4840 static void do_while_statement_to_firm(do_while_statement_t *statement)
4842 /* create the header block */
4843 ir_node *header_block = new_immBlock();
4846 ir_node *body_block = new_immBlock();
4847 jump_if_reachable(body_block);
4849 ir_node *old_continue_label = continue_label;
4850 ir_node *old_break_label = break_label;
4851 continue_label = header_block;
4854 set_cur_block(body_block);
4855 statement_to_firm(statement->body);
4856 ir_node *const false_block = get_break_label();
4858 assert(continue_label == header_block);
4859 continue_label = old_continue_label;
4860 break_label = old_break_label;
4862 jump_if_reachable(header_block);
4864 /* create the condition */
4865 mature_immBlock(header_block);
4866 set_cur_block(header_block);
4868 create_condition_evaluation(statement->condition, body_block, false_block);
4869 mature_immBlock(body_block);
4870 mature_immBlock(false_block);
4872 set_cur_block(false_block);
4875 static void for_statement_to_firm(for_statement_t *statement)
4877 /* create declarations */
4878 entity_t *entity = statement->scope.entities;
4879 for ( ; entity != NULL; entity = entity->base.next) {
4880 if (!is_declaration(entity))
4883 create_local_declaration(entity);
4886 if (currently_reachable()) {
4887 entity = statement->scope.entities;
4888 for ( ; entity != NULL; entity = entity->base.next) {
4889 if (!is_declaration(entity))
4892 initialize_local_declaration(entity);
4895 if (statement->initialisation != NULL) {
4896 expression_to_firm(statement->initialisation);
4900 /* Create the header block */
4901 ir_node *const header_block = new_immBlock();
4902 jump_if_reachable(header_block);
4904 /* Create the condition. */
4905 ir_node *body_block;
4906 ir_node *false_block;
4907 if (statement->condition != NULL) {
4908 body_block = new_immBlock();
4909 false_block = new_immBlock();
4911 set_cur_block(header_block);
4912 create_condition_evaluation(statement->condition, body_block, false_block);
4913 mature_immBlock(body_block);
4916 body_block = header_block;
4919 keep_alive(header_block);
4920 keep_all_memory(header_block);
4923 /* Create the step block, if necessary. */
4924 ir_node * step_block = header_block;
4925 expression_t *const step = statement->step;
4927 step_block = new_immBlock();
4930 ir_node *const old_continue_label = continue_label;
4931 ir_node *const old_break_label = break_label;
4932 continue_label = step_block;
4933 break_label = false_block;
4935 /* Create the loop body. */
4936 set_cur_block(body_block);
4937 statement_to_firm(statement->body);
4938 jump_if_reachable(step_block);
4940 /* Create the step code. */
4942 mature_immBlock(step_block);
4943 set_cur_block(step_block);
4944 expression_to_firm(step);
4945 jump_if_reachable(header_block);
4948 mature_immBlock(header_block);
4949 assert(false_block == NULL || false_block == break_label);
4950 false_block = break_label;
4951 if (false_block != NULL) {
4952 mature_immBlock(false_block);
4954 set_cur_block(false_block);
4956 assert(continue_label == step_block);
4957 continue_label = old_continue_label;
4958 break_label = old_break_label;
4961 static void create_jump_statement(const statement_t *statement,
4962 ir_node *target_block)
4964 if (!currently_reachable())
4967 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
4968 ir_node *jump = new_d_Jmp(dbgi);
4969 add_immBlock_pred(target_block, jump);
4971 set_unreachable_now();
4974 static ir_switch_table *create_switch_table(const switch_statement_t *statement)
4976 /* determine number of cases */
4978 for (case_label_statement_t *l = statement->first_case; l != NULL;
4981 if (l->expression == NULL)
4983 if (l->is_empty_range)
4988 ir_switch_table *res = ir_new_switch_table(current_ir_graph, n_cases);
4990 for (case_label_statement_t *l = statement->first_case; l != NULL;
4992 if (l->expression == NULL) {
4993 l->pn = pn_Switch_default;
4996 if (l->is_empty_range)
4998 ir_tarval *min = fold_constant_to_tarval(l->expression);
4999 ir_tarval *max = min;
5000 long pn = (long) i+1;
5001 if (l->end_range != NULL)
5002 max = fold_constant_to_tarval(l->end_range);
5003 ir_switch_table_set(res, i++, min, max, pn);
5009 static void switch_statement_to_firm(switch_statement_t *statement)
5011 ir_node *first_block = NULL;
5012 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
5013 ir_node *switch_node = NULL;
5015 if (currently_reachable()) {
5016 ir_node *expression = expression_to_firm(statement->expression);
5017 ir_switch_table *table = create_switch_table(statement);
5018 unsigned n_outs = (unsigned)ir_switch_table_get_n_entries(table) + 1;
5020 switch_node = new_d_Switch(dbgi, expression, n_outs, table);
5021 first_block = get_cur_block();
5024 set_unreachable_now();
5026 ir_node *const old_switch = current_switch;
5027 ir_node *const old_break_label = break_label;
5028 const bool old_saw_default_label = saw_default_label;
5029 saw_default_label = false;
5030 current_switch = switch_node;
5033 statement_to_firm(statement->body);
5035 jump_if_reachable(get_break_label());
5037 if (!saw_default_label && first_block != NULL) {
5038 set_cur_block(first_block);
5039 ir_node *proj = new_d_Proj(dbgi, switch_node, mode_X, pn_Switch_default);
5040 add_immBlock_pred(get_break_label(), proj);
5043 if (break_label != NULL) {
5044 mature_immBlock(break_label);
5046 set_cur_block(break_label);
5048 assert(current_switch == switch_node);
5049 current_switch = old_switch;
5050 break_label = old_break_label;
5051 saw_default_label = old_saw_default_label;
5054 static void case_label_to_firm(const case_label_statement_t *statement)
5056 if (statement->is_empty_range)
5059 if (current_switch != NULL) {
5060 ir_node *block = new_immBlock();
5061 /* Fallthrough from previous case */
5062 jump_if_reachable(block);
5064 ir_node *const proj = new_Proj(current_switch, mode_X, statement->pn);
5065 add_immBlock_pred(block, proj);
5066 if (statement->expression == NULL)
5067 saw_default_label = true;
5069 mature_immBlock(block);
5070 set_cur_block(block);
5073 statement_to_firm(statement->statement);
5076 static void label_to_firm(const label_statement_t *statement)
5078 ir_node *block = get_label_block(statement->label);
5079 jump_if_reachable(block);
5081 set_cur_block(block);
5083 keep_all_memory(block);
5085 statement_to_firm(statement->statement);
5088 static void computed_goto_to_firm(computed_goto_statement_t const *const statement)
5090 if (!currently_reachable())
5093 ir_node *const irn = expression_to_firm(statement->expression);
5094 dbg_info *const dbgi = get_dbg_info(&statement->base.source_position);
5095 ir_node *const ijmp = new_d_IJmp(dbgi, irn);
5097 set_irn_link(ijmp, ijmp_list);
5100 set_unreachable_now();
5103 static void asm_statement_to_firm(const asm_statement_t *statement)
5105 bool needs_memory = false;
5107 if (statement->is_volatile) {
5108 needs_memory = true;
5111 size_t n_clobbers = 0;
5112 asm_clobber_t *clobber = statement->clobbers;
5113 for ( ; clobber != NULL; clobber = clobber->next) {
5114 const char *clobber_str = clobber->clobber.begin;
5116 if (!be_is_valid_clobber(clobber_str)) {
5117 errorf(&statement->base.source_position,
5118 "invalid clobber '%s' specified", clobber->clobber);
5122 if (streq(clobber_str, "memory")) {
5123 needs_memory = true;
5127 ident *id = new_id_from_str(clobber_str);
5128 obstack_ptr_grow(&asm_obst, id);
5131 assert(obstack_object_size(&asm_obst) == n_clobbers * sizeof(ident*));
5132 ident **clobbers = NULL;
5133 if (n_clobbers > 0) {
5134 clobbers = obstack_finish(&asm_obst);
5137 size_t n_inputs = 0;
5138 asm_argument_t *argument = statement->inputs;
5139 for ( ; argument != NULL; argument = argument->next)
5141 size_t n_outputs = 0;
5142 argument = statement->outputs;
5143 for ( ; argument != NULL; argument = argument->next)
5146 unsigned next_pos = 0;
5148 ir_node *ins[n_inputs + n_outputs + 1];
5151 ir_asm_constraint tmp_in_constraints[n_outputs];
5153 const expression_t *out_exprs[n_outputs];
5154 ir_node *out_addrs[n_outputs];
5155 size_t out_size = 0;
5157 argument = statement->outputs;
5158 for ( ; argument != NULL; argument = argument->next) {
5159 const char *constraints = argument->constraints.begin;
5160 asm_constraint_flags_t asm_flags
5161 = be_parse_asm_constraints(constraints);
5164 source_position_t const *const pos = &statement->base.source_position;
5165 if (asm_flags & ASM_CONSTRAINT_FLAG_NO_SUPPORT) {
5166 warningf(WARN_OTHER, pos, "some constraints in '%s' are not supported", constraints);
5168 if (asm_flags & ASM_CONSTRAINT_FLAG_INVALID) {
5169 errorf(pos, "some constraints in '%s' are invalid", constraints);
5172 if (! (asm_flags & ASM_CONSTRAINT_FLAG_MODIFIER_WRITE)) {
5173 errorf(pos, "no write flag specified for output constraints '%s'", constraints);
5178 unsigned pos = next_pos++;
5179 if ( (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE)
5180 || (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER) ) {
5181 expression_t *expr = argument->expression;
5182 ir_node *addr = expression_to_addr(expr);
5183 /* in+output, construct an artifical same_as constraint on the
5185 if (asm_flags & ASM_CONSTRAINT_FLAG_MODIFIER_READ) {
5187 ir_node *value = get_value_from_lvalue(expr, addr);
5189 snprintf(buf, sizeof(buf), "%u", (unsigned) out_size);
5191 ir_asm_constraint constraint;
5192 constraint.pos = pos;
5193 constraint.constraint = new_id_from_str(buf);
5194 constraint.mode = get_ir_mode_storage(expr->base.type);
5195 tmp_in_constraints[in_size] = constraint;
5196 ins[in_size] = value;
5201 out_exprs[out_size] = expr;
5202 out_addrs[out_size] = addr;
5204 } else if (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP) {
5205 /* pure memory ops need no input (but we have to make sure we
5206 * attach to the memory) */
5207 assert(! (asm_flags &
5208 (ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE
5209 | ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER)));
5210 needs_memory = true;
5212 /* we need to attach the address to the inputs */
5213 expression_t *expr = argument->expression;
5215 ir_asm_constraint constraint;
5216 constraint.pos = pos;
5217 constraint.constraint = new_id_from_str(constraints);
5218 constraint.mode = mode_M;
5219 tmp_in_constraints[in_size] = constraint;
5221 ins[in_size] = expression_to_addr(expr);
5225 errorf(&statement->base.source_position,
5226 "only modifiers but no place set in constraints '%s'",
5231 ir_asm_constraint constraint;
5232 constraint.pos = pos;
5233 constraint.constraint = new_id_from_str(constraints);
5234 constraint.mode = get_ir_mode_storage(argument->expression->base.type);
5236 obstack_grow(&asm_obst, &constraint, sizeof(constraint));
5238 assert(obstack_object_size(&asm_obst)
5239 == out_size * sizeof(ir_asm_constraint));
5240 ir_asm_constraint *output_constraints = obstack_finish(&asm_obst);
5243 obstack_grow(&asm_obst, tmp_in_constraints,
5244 in_size * sizeof(tmp_in_constraints[0]));
5245 /* find and count input and output arguments */
5246 argument = statement->inputs;
5247 for ( ; argument != NULL; argument = argument->next) {
5248 const char *constraints = argument->constraints.begin;
5249 asm_constraint_flags_t asm_flags
5250 = be_parse_asm_constraints(constraints);
5252 if (asm_flags & ASM_CONSTRAINT_FLAG_NO_SUPPORT) {
5253 errorf(&statement->base.source_position,
5254 "some constraints in '%s' are not supported", constraints);
5257 if (asm_flags & ASM_CONSTRAINT_FLAG_INVALID) {
5258 errorf(&statement->base.source_position,
5259 "some constraints in '%s' are invalid", constraints);
5262 if (asm_flags & ASM_CONSTRAINT_FLAG_MODIFIER_WRITE) {
5263 errorf(&statement->base.source_position,
5264 "write flag specified for input constraints '%s'",
5270 if ( (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE)
5271 || (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER) ) {
5272 /* we can treat this as "normal" input */
5273 input = expression_to_firm(argument->expression);
5274 } else if (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP) {
5275 /* pure memory ops need no input (but we have to make sure we
5276 * attach to the memory) */
5277 assert(! (asm_flags &
5278 (ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE
5279 | ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER)));
5280 needs_memory = true;
5281 input = expression_to_addr(argument->expression);
5283 errorf(&statement->base.source_position,
5284 "only modifiers but no place set in constraints '%s'",
5289 ir_asm_constraint constraint;
5290 constraint.pos = next_pos++;
5291 constraint.constraint = new_id_from_str(constraints);
5292 constraint.mode = get_irn_mode(input);
5294 obstack_grow(&asm_obst, &constraint, sizeof(constraint));
5295 ins[in_size++] = input;
5299 ir_asm_constraint constraint;
5300 constraint.pos = next_pos++;
5301 constraint.constraint = new_id_from_str("");
5302 constraint.mode = mode_M;
5304 obstack_grow(&asm_obst, &constraint, sizeof(constraint));
5305 ins[in_size++] = get_store();
5308 assert(obstack_object_size(&asm_obst)
5309 == in_size * sizeof(ir_asm_constraint));
5310 ir_asm_constraint *input_constraints = obstack_finish(&asm_obst);
5312 /* create asm node */
5313 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
5315 ident *asm_text = new_id_from_str(statement->asm_text.begin);
5317 ir_node *node = new_d_ASM(dbgi, in_size, ins, input_constraints,
5318 out_size, output_constraints,
5319 n_clobbers, clobbers, asm_text);
5321 if (statement->is_volatile) {
5322 set_irn_pinned(node, op_pin_state_pinned);
5324 set_irn_pinned(node, op_pin_state_floats);
5327 /* create output projs & connect them */
5329 ir_node *projm = new_Proj(node, mode_M, out_size);
5334 for (i = 0; i < out_size; ++i) {
5335 const expression_t *out_expr = out_exprs[i];
5337 ir_mode *mode = get_ir_mode_storage(out_expr->base.type);
5338 ir_node *proj = new_Proj(node, mode, pn);
5339 ir_node *addr = out_addrs[i];
5341 set_value_for_expression_addr(out_expr, proj, addr);
5345 static void ms_try_statement_to_firm(ms_try_statement_t *statement)
5347 statement_to_firm(statement->try_statement);
5348 source_position_t const *const pos = &statement->base.source_position;
5349 warningf(WARN_OTHER, pos, "structured exception handling ignored");
5352 static void leave_statement_to_firm(leave_statement_t *statement)
5354 errorf(&statement->base.source_position, "__leave not supported yet");
5358 * Transform a statement.
5360 static void statement_to_firm(statement_t *const stmt)
5363 assert(!stmt->base.transformed);
5364 stmt->base.transformed = true;
5367 switch (stmt->kind) {
5368 case STATEMENT_ASM: asm_statement_to_firm( &stmt->asms); return;
5369 case STATEMENT_CASE_LABEL: case_label_to_firm( &stmt->case_label); return;
5370 case STATEMENT_COMPOUND: compound_statement_to_firm( &stmt->compound); return;
5371 case STATEMENT_COMPUTED_GOTO: computed_goto_to_firm( &stmt->computed_goto); return;
5372 case STATEMENT_DECLARATION: declaration_statement_to_firm(&stmt->declaration); return;
5373 case STATEMENT_DO_WHILE: do_while_statement_to_firm( &stmt->do_while); return;
5374 case STATEMENT_EMPTY: /* nothing */ return;
5375 case STATEMENT_EXPRESSION: expression_statement_to_firm( &stmt->expression); return;
5376 case STATEMENT_FOR: for_statement_to_firm( &stmt->fors); return;
5377 case STATEMENT_IF: if_statement_to_firm( &stmt->ifs); return;
5378 case STATEMENT_LABEL: label_to_firm( &stmt->label); return;
5379 case STATEMENT_LEAVE: leave_statement_to_firm( &stmt->leave); return;
5380 case STATEMENT_MS_TRY: ms_try_statement_to_firm( &stmt->ms_try); return;
5381 case STATEMENT_RETURN: return_statement_to_firm( &stmt->returns); return;
5382 case STATEMENT_SWITCH: switch_statement_to_firm( &stmt->switchs); return;
5383 case STATEMENT_WHILE: while_statement_to_firm( &stmt->whiles); return;
5385 case STATEMENT_BREAK: create_jump_statement(stmt, get_break_label()); return;
5386 case STATEMENT_CONTINUE: create_jump_statement(stmt, continue_label); return;
5387 case STATEMENT_GOTO: create_jump_statement(stmt, get_label_block(stmt->gotos.label)); return;
5389 case STATEMENT_ERROR: panic("error statement found");
5391 panic("statement not implemented");
5394 static int count_local_variables(const entity_t *entity,
5395 const entity_t *const last)
5398 entity_t const *const end = last != NULL ? last->base.next : NULL;
5399 for (; entity != end; entity = entity->base.next) {
5403 if (entity->kind == ENTITY_VARIABLE) {
5404 type = skip_typeref(entity->declaration.type);
5405 address_taken = entity->variable.address_taken;
5406 } else if (entity->kind == ENTITY_PARAMETER) {
5407 type = skip_typeref(entity->declaration.type);
5408 address_taken = entity->parameter.address_taken;
5413 if (!address_taken && is_type_scalar(type))
5419 static void count_local_variables_in_stmt(statement_t *stmt, void *const env)
5421 int *const count = env;
5423 switch (stmt->kind) {
5424 case STATEMENT_DECLARATION: {
5425 const declaration_statement_t *const decl_stmt = &stmt->declaration;
5426 *count += count_local_variables(decl_stmt->declarations_begin,
5427 decl_stmt->declarations_end);
5432 *count += count_local_variables(stmt->fors.scope.entities, NULL);
5441 * Return the number of local (alias free) variables used by a function.
5443 static int get_function_n_local_vars(entity_t *entity)
5445 const function_t *function = &entity->function;
5448 /* count parameters */
5449 count += count_local_variables(function->parameters.entities, NULL);
5451 /* count local variables declared in body */
5452 walk_statements(function->statement, count_local_variables_in_stmt, &count);
5457 * Build Firm code for the parameters of a function.
5459 static void initialize_function_parameters(entity_t *entity)
5461 assert(entity->kind == ENTITY_FUNCTION);
5462 ir_graph *irg = current_ir_graph;
5463 ir_node *args = get_irg_args(irg);
5465 ir_type *function_irtype;
5467 if (entity->function.need_closure) {
5468 /* add an extra parameter for the static link */
5469 entity->function.static_link = new_r_Proj(args, mode_P_data, 0);
5472 /* Matze: IMO this is wrong, nested functions should have an own
5473 * type and not rely on strange parameters... */
5474 function_irtype = create_method_type(&entity->declaration.type->function, true);
5476 function_irtype = get_ir_type(entity->declaration.type);
5481 entity_t *parameter = entity->function.parameters.entities;
5482 for ( ; parameter != NULL; parameter = parameter->base.next, ++n) {
5483 if (parameter->kind != ENTITY_PARAMETER)
5486 assert(parameter->declaration.kind == DECLARATION_KIND_UNKNOWN);
5487 type_t *type = skip_typeref(parameter->declaration.type);
5489 bool needs_entity = parameter->parameter.address_taken;
5490 assert(!is_type_array(type));
5491 if (is_type_compound(type)) {
5492 needs_entity = true;
5495 ir_type *param_irtype = get_method_param_type(function_irtype, n);
5497 ir_type *frame_type = get_irg_frame_type(irg);
5499 = new_parameter_entity(frame_type, n, param_irtype);
5500 parameter->declaration.kind
5501 = DECLARATION_KIND_PARAMETER_ENTITY;
5502 parameter->parameter.v.entity = param;
5506 ir_mode *param_mode = get_type_mode(param_irtype);
5508 ir_node *value = new_r_Proj(args, param_mode, pn);
5510 ir_mode *mode = get_ir_mode_storage(type);
5511 value = create_conv(NULL, value, mode);
5512 value = do_strict_conv(NULL, value);
5514 parameter->declaration.kind = DECLARATION_KIND_PARAMETER;
5515 parameter->parameter.v.value_number = next_value_number_function;
5516 set_irg_loc_description(current_ir_graph, next_value_number_function,
5518 ++next_value_number_function;
5520 set_value(parameter->parameter.v.value_number, value);
5525 * Handle additional decl modifiers for IR-graphs
5527 * @param irg the IR-graph
5528 * @param dec_modifiers additional modifiers
5530 static void handle_decl_modifier_irg(ir_graph *irg,
5531 decl_modifiers_t decl_modifiers)
5533 if (decl_modifiers & DM_NAKED) {
5534 /* TRUE if the declaration includes the Microsoft
5535 __declspec(naked) specifier. */
5536 add_irg_additional_properties(irg, mtp_property_naked);
5538 if (decl_modifiers & DM_FORCEINLINE) {
5539 /* TRUE if the declaration includes the
5540 Microsoft __forceinline specifier. */
5541 set_irg_inline_property(irg, irg_inline_forced);
5543 if (decl_modifiers & DM_NOINLINE) {
5544 /* TRUE if the declaration includes the Microsoft
5545 __declspec(noinline) specifier. */
5546 set_irg_inline_property(irg, irg_inline_forbidden);
5550 static void add_function_pointer(ir_type *segment, ir_entity *method,
5551 const char *unique_template)
5553 ir_type *method_type = get_entity_type(method);
5554 ir_type *ptr_type = new_type_pointer(method_type);
5556 /* these entities don't really have a name but firm only allows
5558 * Note that we mustn't give these entities a name since for example
5559 * Mach-O doesn't allow them. */
5560 ident *ide = id_unique(unique_template);
5561 ir_entity *ptr = new_entity(segment, ide, ptr_type);
5562 ir_graph *irg = get_const_code_irg();
5563 ir_node *val = new_rd_SymConst_addr_ent(NULL, irg, mode_P_code,
5566 set_entity_ld_ident(ptr, new_id_from_chars("", 0));
5567 set_entity_compiler_generated(ptr, 1);
5568 set_entity_visibility(ptr, ir_visibility_private);
5569 add_entity_linkage(ptr, IR_LINKAGE_CONSTANT|IR_LINKAGE_HIDDEN_USER);
5570 set_atomic_ent_value(ptr, val);
5574 * Generate possible IJmp branches to a given label block.
5576 static void gen_ijmp_branches(ir_node *block)
5579 for (ijmp = ijmp_list; ijmp != NULL; ijmp = get_irn_link(ijmp)) {
5580 add_immBlock_pred(block, ijmp);
5585 * Create code for a function and all inner functions.
5587 * @param entity the function entity
5589 static void create_function(entity_t *entity)
5591 assert(entity->kind == ENTITY_FUNCTION);
5592 ir_entity *function_entity = get_function_entity(entity, current_outer_frame);
5594 if (entity->function.statement == NULL)
5597 inner_functions = NULL;
5598 current_trampolines = NULL;
5600 if (entity->declaration.modifiers & DM_CONSTRUCTOR) {
5601 ir_type *segment = get_segment_type(IR_SEGMENT_CONSTRUCTORS);
5602 add_function_pointer(segment, function_entity, "constructor_ptr.%u");
5604 if (entity->declaration.modifiers & DM_DESTRUCTOR) {
5605 ir_type *segment = get_segment_type(IR_SEGMENT_DESTRUCTORS);
5606 add_function_pointer(segment, function_entity, "destructor_ptr.%u");
5609 current_function_entity = entity;
5610 current_function_name = NULL;
5611 current_funcsig = NULL;
5613 assert(all_labels == NULL);
5614 all_labels = NEW_ARR_F(label_t *, 0);
5617 int n_local_vars = get_function_n_local_vars(entity);
5618 ir_graph *irg = new_ir_graph(function_entity, n_local_vars);
5619 current_ir_graph = irg;
5621 ir_graph *old_current_function = current_function;
5622 current_function = irg;
5624 ir_entity *const old_current_vararg_entity = current_vararg_entity;
5625 current_vararg_entity = NULL;
5627 set_irg_fp_model(irg, firm_fp_model);
5628 tarval_enable_fp_ops(1);
5629 set_irn_dbg_info(get_irg_start_block(irg),
5630 get_entity_dbg_info(function_entity));
5632 /* set inline flags */
5633 if (entity->function.is_inline)
5634 set_irg_inline_property(irg, irg_inline_recomended);
5635 handle_decl_modifier_irg(irg, entity->declaration.modifiers);
5637 next_value_number_function = 0;
5638 initialize_function_parameters(entity);
5639 current_static_link = entity->function.static_link;
5641 statement_to_firm(entity->function.statement);
5643 ir_node *end_block = get_irg_end_block(irg);
5645 /* do we have a return statement yet? */
5646 if (currently_reachable()) {
5647 type_t *type = skip_typeref(entity->declaration.type);
5648 assert(is_type_function(type));
5649 const function_type_t *func_type = &type->function;
5650 const type_t *return_type
5651 = skip_typeref(func_type->return_type);
5654 if (is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
5655 ret = new_Return(get_store(), 0, NULL);
5658 if (is_type_scalar(return_type)) {
5659 mode = get_ir_mode_storage(func_type->return_type);
5665 /* ยง5.1.2.2.3 main implicitly returns 0 */
5666 if (is_main(entity)) {
5667 in[0] = new_Const(get_mode_null(mode));
5669 in[0] = new_Unknown(mode);
5671 ret = new_Return(get_store(), 1, in);
5673 add_immBlock_pred(end_block, ret);
5676 for (int i = ARR_LEN(all_labels) - 1; i >= 0; --i) {
5677 label_t *label = all_labels[i];
5678 if (label->address_taken) {
5679 gen_ijmp_branches(label->block);
5681 mature_immBlock(label->block);
5684 DEL_ARR_F(all_labels);
5687 irg_finalize_cons(irg);
5689 /* finalize the frame type */
5690 ir_type *frame_type = get_irg_frame_type(irg);
5691 int n = get_compound_n_members(frame_type);
5694 for (int i = 0; i < n; ++i) {
5695 ir_entity *member = get_compound_member(frame_type, i);
5696 ir_type *entity_type = get_entity_type(member);
5698 int align = get_type_alignment_bytes(entity_type);
5699 if (align > align_all)
5703 misalign = offset % align;
5705 offset += align - misalign;
5709 set_entity_offset(member, offset);
5710 offset += get_type_size_bytes(entity_type);
5712 set_type_size_bytes(frame_type, offset);
5713 set_type_alignment_bytes(frame_type, align_all);
5715 irg_verify(irg, VERIFY_ENFORCE_SSA);
5716 current_vararg_entity = old_current_vararg_entity;
5717 current_function = old_current_function;
5719 if (current_trampolines != NULL) {
5720 DEL_ARR_F(current_trampolines);
5721 current_trampolines = NULL;
5724 /* create inner functions if any */
5725 entity_t **inner = inner_functions;
5726 if (inner != NULL) {
5727 ir_type *rem_outer_frame = current_outer_frame;
5728 current_outer_frame = get_irg_frame_type(current_ir_graph);
5729 for (int i = ARR_LEN(inner) - 1; i >= 0; --i) {
5730 create_function(inner[i]);
5734 current_outer_frame = rem_outer_frame;
5738 static void scope_to_firm(scope_t *scope)
5740 /* first pass: create declarations */
5741 entity_t *entity = scope->entities;
5742 for ( ; entity != NULL; entity = entity->base.next) {
5743 if (entity->base.symbol == NULL)
5746 if (entity->kind == ENTITY_FUNCTION) {
5747 if (entity->function.btk != BUILTIN_NONE) {
5748 /* builtins have no representation */
5751 (void)get_function_entity(entity, NULL);
5752 } else if (entity->kind == ENTITY_VARIABLE) {
5753 create_global_variable(entity);
5754 } else if (entity->kind == ENTITY_NAMESPACE) {
5755 scope_to_firm(&entity->namespacee.members);
5759 /* second pass: create code/initializers */
5760 entity = scope->entities;
5761 for ( ; entity != NULL; entity = entity->base.next) {
5762 if (entity->base.symbol == NULL)
5765 if (entity->kind == ENTITY_FUNCTION) {
5766 if (entity->function.btk != BUILTIN_NONE) {
5767 /* builtins have no representation */
5770 create_function(entity);
5771 } else if (entity->kind == ENTITY_VARIABLE) {
5772 assert(entity->declaration.kind
5773 == DECLARATION_KIND_GLOBAL_VARIABLE);
5774 current_ir_graph = get_const_code_irg();
5775 create_variable_initializer(entity);
5780 void init_ast2firm(void)
5782 obstack_init(&asm_obst);
5783 init_atomic_modes();
5785 ir_set_debug_retrieve(dbg_retrieve);
5786 ir_set_type_debug_retrieve(dbg_print_type_dbg_info);
5788 /* create idents for all known runtime functions */
5789 for (size_t i = 0; i < lengthof(rts_data); ++i) {
5790 rts_idents[i] = new_id_from_str(rts_data[i].name);
5793 entitymap_init(&entitymap);
5796 static void init_ir_types(void)
5798 static int ir_types_initialized = 0;
5799 if (ir_types_initialized)
5801 ir_types_initialized = 1;
5803 ir_type_int = get_ir_type(type_int);
5804 ir_type_char = get_ir_type(type_char);
5805 ir_type_const_char = get_ir_type(type_const_char);
5806 ir_type_wchar_t = get_ir_type(type_wchar_t);
5807 ir_type_void = get_ir_type(type_void);
5809 be_params = be_get_backend_param();
5810 mode_float_arithmetic = be_params->mode_float_arithmetic;
5812 stack_param_align = be_params->stack_param_align;
5815 void exit_ast2firm(void)
5817 entitymap_destroy(&entitymap);
5818 obstack_free(&asm_obst, NULL);
5821 static void global_asm_to_firm(statement_t *s)
5823 for (; s != NULL; s = s->base.next) {
5824 assert(s->kind == STATEMENT_ASM);
5826 char const *const text = s->asms.asm_text.begin;
5827 size_t size = s->asms.asm_text.size;
5829 /* skip the last \0 */
5830 if (text[size - 1] == '\0')
5833 ident *const id = new_id_from_chars(text, size);
5838 void translation_unit_to_firm(translation_unit_t *unit)
5840 /* initialize firm arithmetic */
5841 tarval_set_integer_overflow_mode(TV_OVERFLOW_WRAP);
5842 ir_set_uninitialized_local_variable_func(uninitialized_local_var);
5844 /* just to be sure */
5845 continue_label = NULL;
5847 current_switch = NULL;
5848 current_translation_unit = unit;
5852 scope_to_firm(&unit->scope);
5853 global_asm_to_firm(unit->global_asm);
5855 current_ir_graph = NULL;
5856 current_translation_unit = NULL;